Big Data and Biological Networks · Quiz 1 · Jan 2025

Peptide bond

Glycosidic bond

Phosphodiester bond

Amide bond

DNA gets converted to chromosomes

RNA gets converted to protein

Protein folding occurs to produce functional enzymes

Cells produce ATP

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

Longer read lengths.

Higher accuracy.

Higher throughput.

Lower cost per base.

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

DNA polymerase

Sigma factor

Uracilase

Ribonuclease

DNA methylation

Chromatin accessibility

Genome wide association studies

Differential expression analysis

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

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.

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

Identifying individuals based on DNA evidence

Tracking the spread of infectious diseases

Predictive testing for genetic diseases

Identifying genetic diversity within species

0.67

0.50

0.31

0.44

1/3

4/3

8/3

2/3

AttributeError: 'Graph' object has no attribute 'add_edge'

TypeError: 'DiGraph' object is not subscriptable

NetworkXError: Graph is immutable

[2]

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.

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.

**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.

0.429

0.333

0.524

0.286

0.571

0.714

0.429

0.857

0.464

0.393

0.500

0.429

0.538

0.636

0.583

0.500       **Deep Learning** **Section Id :** 64065379067 **Section Number :** 4 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 10 **Number of Questions to be attempted :** 10 **Section Marks :** 40 **Display Number Panel :** Yes **Section Negative Marks :** 0 **Group All Questions :** No **Enable Mark as Answered Mark for Review and** No **Clear Response :** **Section Maximum Duration :** 0 **Section Minimum Duration :** 0 **Section Time In :** Minutes **Maximum Instruction Time :** 0