Question 1
The bond between a phosphate group and the ribose sugar group in RNA is called which of the following?
Peptide bond
Glycosidic bond
Phosphodiester bond
Amide bond

The IIT Madras BS Big Data and Biological Networks (Big Data and Biological Networks) Quiz 1 paper sat on 23 Feb 2025, in the January 2025 term: 27 questions for 50 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.
The bond between a phosphate group and the ribose sugar group in RNA is called which of the following?
Peptide bond
Glycosidic bond
Phosphodiester bond
Amide bond
Correct answer
Phosphodiester bond
Translation is the process by which:
DNA gets converted to chromosomes
RNA gets converted to protein
Protein folding occurs to produce functional enzymes
Cells produce ATP
Correct answer
RNA gets converted to protein
Which of the following is not true :
Genomics data is independent of the cell type
Transcriptomics data is dependent on a specific cell type
Both genomics data is independent of the cell type and transcriptomics data is dependent on a specific cell type are true
None of these statements are true
Correct answer
None of these statements are true
What is the primary advantage of Next-Generation Sequencing (NGS) over traditional Sanger sequencing?
Longer read lengths.
Higher accuracy.
Higher throughput.
Lower cost per base.
Correct answer
Higher throughput.
What do the term Okazaki fragments refer to?
Short fragments of DNA created before transcription
Byproducts of histone modifications
Short fragments of DNA created during replication on the 5’ to 3’ template strand
Short fragments of DNA created during replication on the 3’ to 5’ template strand
Correct answer
Short fragments of DNA created during replication on the 3’ to 5’ template strand
Which of the following proteins is required for transcription:
DNA polymerase
Sigma factor
Uracilase
Ribonuclease
Correct answer
Sigma factor
Which of the following experiments fall under the purview of epigenomics?
DNA methylation
Chromatin accessibility
Genome wide association studies
Differential expression analysis
Correct answers
DNA methylation
Chromatin accessibility
Match the following and choose the correct option
| Column A | Column B | ||
|---|---|---|---|
| A | Linkage disequilibrium | 1 | Visualization of genomic regions associated with traits or diseases |
| B | P-value | 2 | A statistical measure indicating the strength of association between a genetic variant and a trait. |
| C | Manhattan plot | 3 | Patterns of non-random association of alleles at different loci. |
| D | SNP | 4 | Common type of genetic variation analysed in GWAS |
A - 2, B - 1, C - 4, D - 3
A - 4, B - 2, C - 1, D - 3
A - 3, B - 2, C - 1, D - 3
A - 3, B - 2, C - 1, D - 4
Correct answer
A - 3, B - 2, C - 1, D - 4
Consider the following and select the correct option.
Assertion: Genomics can be used to identify individuals predisposed to certain diseases. Reason: By analyzing an individual's DNA, specific genetic variations associated with increased disease risk can be detected.
Both the assertion and reason are correct, and the reason is a correct explanation of the assertion.
Both the assertion and reason are correct, but the reason is not a correct explanation of the assertion.
The assertion is correct, but the reason is incorrect.
The assertion is incorrect, but the reason is correct.
Correct answer
Both the assertion and reason are correct, and the reason is a correct explanation of the assertion.
Which of the following statements are true:
Transcription uses two strands of DNA
Polyadenylation does not happen in prokaryotic cells
Intronic genes are only present in eukaryotic cells
Proteins are produced in the nuclei
Correct answers
Polyadenylation does not happen in prokaryotic cells
Intronic genes are only present in eukaryotic cells
Application of genomics include:
Identifying individuals based on DNA evidence
Tracking the spread of infectious diseases
Predictive testing for genetic diseases
Identifying genetic diversity within species
Correct answers
Identifying individuals based on DNA evidence
Predictive testing for genetic diseases
Identifying genetic diversity within species
Based on the above data, answer the given subquestions.
What is the id number of the most significant SNP?
Correct answer: 2
Based on the above data, answer the given subquestions.
From the plot, what would be the number of SNPs considered for this analysis? (Give 5% range above and below)
Correct answer: 1000000
Based on the above data, answer the given subquestions.
How many causal SNPs are present in the figure?
Correct answer: 9
NOTE: Enter the exact answer without any extra space in the beginning or at the end.
Correct answer: ATGCTGTAACTGA
NOTE: Enter the exact answer without any extra space in the beginning or at the end.
Correct answer: Ile-Asp-Pro-Asn
What is the clustering coefficient of the given graph?
0.67
0.50
0.31
0.44
Correct answer
0.44
What is the mean degree of this undirected graph?
1/3
4/3
8/3
2/3
Correct answer
8/3
Consider the following code snippet. What will the output be?
import networkx as nx
G = nx.DiGraph()G.add_edges_from([(1, 2), (2, 3), (3, 4)])
H = nx.Graph(G)
G.add_edge(4, 1)print(list(H.neighbors(1)))AttributeError: 'Graph' object has no attribute 'add_edge'
TypeError: 'DiGraph' object is not subscriptable
NetworkXError: Graph is immutable
[2]
Correct answer
AttributeError: 'Graph' object has no attribute 'add_edge'
Correct answer
Which of the following statements about bipartite graphs is TRUE?
In a bipartite graph, there are two disjoint sets of vertices such that no two vertices within the same set are adjacent.
Every complete bipartite graph has an Eulerian circuit.
A bipartite graph can be colored with two colors such that no two adjacent nodes have the same color.
In the adjacency matrix of a bipartite graph, the values corresponding to edges within the same set of nodes will not all be zero.
Correct answers
In a bipartite graph, there are two disjoint sets of vertices such that no two vertices within the same set are adjacent.
A bipartite graph can be colored with two colors such that no two adjacent nodes have the same color.
Which of the following statements are true about the behavior of random and small-world networks?
In a small-world network, as the rewiring probability p increases, the average path length decreases dramatically.
Random networks tend to have high clustering coefficients compared to small- world networks for small p.
In a small-world network, increasing the rewiring probability p makes the network more disconnected and increases the clustering coefficient.
Small-world networks have a balance of high clustering and short average path length for intermediate values of rewiring probability p.
Correct answers
In a small-world network, as the rewiring probability p increases, the average path length decreases dramatically.
Small-world networks have a balance of high clustering and short average path length for intermediate values of rewiring probability p.
Which of the following network models are suitable for representing the topology of metabolic pathways in biological systems?
Small-world network because it ensures high clustering, which represents functional metabolic clusters and pathways, while also having short path lengths for efficient chemical signaling.
Random network because it randomly connects metabolites and enzymes, ensuring diverse and unpredictable interactions in the network.
Power-law network because it produces a few highly connected nodes (hub enzymes) that play crucial roles in regulating key metabolic pathways.
Random network because it results in efficient information transfer through a uniform distribution of connections between metabolites and enzymes.
Correct answers
Small-world network because it ensures high clustering, which represents functional metabolic clusters and pathways, while also having short path lengths for efficient chemical signaling.
Power-law network because it produces a few highly connected nodes (hub enzymes) that play crucial roles in regulating key metabolic pathways.
Calculate the betweenness centrality of node D in the network.
0.429
0.333
0.524
0.286
Correct answer
0.429
In the network shown, calculate the degree centrality of node E.
0.571
0.714
0.429
0.857
Correct answer
0.714
What is the density of this network?
0.464
0.393
0.500
0.429
Correct answer
0.464
Calculate the closeness centrality of node E.
0.538
0.636
0.583
0.500
Correct answer
0.583