MauryaHub PYQ Practice

Big Data and Biological Networks · Quiz 2 · Jan 2025

Big Data and Biological Networks · Quiz 2 · Jan 2025

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

0 / 24 published solutions

Question 293 MCQ · 1.0 marks

What does the action set represents?
6406533953214.
The city Ramu should visit next in a stage
6406533953215.
The beginning city in every stages
6406533953216.
Distance covered upto a given stage

A published solution is not available for this question yet.

Report a correction for Q293

Question 294 NAT · 2.0 marks

What is the objective function value in Stage-2?

A published solution is not available for this question yet.

Report a correction for Q294

Question 296 MCQ · 2.0 marks

What happens to scale-free networks when subjected to random node removal?
6406533953220.
The network disintegrates rapidly
6406533953221.
The diameter and characteristic path length decrease significantly
6406533953222.
The network remains largely insensitive to the perturbation
6406533953223.
The diameter and characteristic path length increase significantly

A published solution is not available for this question yet.

Report a correction for Q296

Question 297 MCQ · 2.0 marks

Consider a regular lattice with n = 7 and m = 14. The number of triangular sub-graphs in the given network is
6406533953224.
70
6406533953225.
35
6406533953226.
140
6406533953227.
360

A published solution is not available for this question yet.

Report a correction for Q297

Question 298 MCQ · 2.0 marks

Consider the following set of metabolic reactions: R1: P + Q → 2R R2: 2Q + S → T R3: R + T → 3U R4: P + U → V + S What is the density of the undirected substrate graph formed?
6406533953228.
0.33
6406533953229.
0.56
6406533953230.
0.27
6406533953231.
0.73

A published solution is not available for this question yet.

Report a correction for Q298

Question 299 MCQ · 2.0 marks

If a metabolite with high betweenness centrality is knocked out, what is the likely consequence?
6406533953232.
Pathway redundancy increases, paradoxically making the metabolic network more resilient.
6406533953233.
The network always compensates through alternative routes, ensuring no functional loss.
6406533953234.
Metabolic pathways may become fragmented, potentially disrupting essential biochemical functions.
6406533953235.
Only directly connected reactions are affected, while the overall network remains stable.

A published solution is not available for this question yet.

Report a correction for Q299

Question 300 MCQ · 2.0 marks

What is the average degree (regardless of the direction) of the 3-mer De-Bruijn graph constructed from “TCAGAGGT”?
6406533953272.
4.1
6406533953273.
2.4
6406533953274.
3.4
6406533953275.
2

A published solution is not available for this question yet.

Report a correction for Q300

Question 301 MCQ · 2.0 marks

What is the total number of edges of the De-Bruijn Graph generated from the 3-mers obtained from “ATCGGTACAACTCTCTCATGCG”?
6406533953276.
15
6406533953277.
14
6406533953278.
19
6406533953279.
17

A published solution is not available for this question yet.

Report a correction for Q301

Question 302 MSQ · 3.0 marks

A researcher is studying network motifs in a biological network and generates randomized networks for comparison. Which of the following statements are correct regarding the randomization process?
6406533953236.
Randomized networks must ideally retain the same number of nodes and edges as the original network.
6406533953237.
Randomized networks can have a different degree distribution to ensure statistical significance.
6406533953238.
Randomized networks can be generated using the configuration model, to ensure that the degree sequence of the original network is preserved.
6406533953239.
Randomized networks can be generated by randomly adding new nodes and edges.

A published solution is not available for this question yet.

Report a correction for Q302

Question 303 MSQ · 3.0 marks

The Girvan–Newman algorithm for community detection involves which of the following steps?
6406533953240.
Remove edges with the highest betweenness first.
6406533953241.
Re-compute the betweenness after each edge removal.
6406533953242.
Remove edges with the lowest betweenness first.
6406533953243.
Remove nodes with the lowest betweenness first.

A published solution is not available for this question yet.

Report a correction for Q303

Question 304 MSQ · 3.0 marks

A researcher is modeling the spread of an infectious disease on a small-world network. Which of the following are true in the context of the likelihood of a disease outbreak?
6406533953244.
The diameter of the network is an important factor, as it influences how quickly the disease can reach distant nodes.
6406533953245.
The clustering coefficient is one of the parameters that determine the likelihood of localized outbreaks.
6406533953246.
The degree distribution has no impact on disease spread in small-world networks.
6406533953247.
The transmissibility of the disease is independent of the network structure.

A published solution is not available for this question yet.

Report a correction for Q304

Question 305 MSQ · 3.0 marks

Which of these are challenges one might encounter in the process of genome assembly?
6406533953300.
Erroneous reads
6406533953301.
Large volumes of data
6406533953302.
Duplicate sequences
6406533953303.
Incomplete graph

A published solution is not available for this question yet.

Report a correction for Q305

Question 306 MSQ · 3.0 marks

Consider the following two statements: a. **Statement 1:** Reads from the genome sequencing are prone to error. b. **Statement 2:** Sequence alignment can be used to overcome this problem. Based on your observations, which of the following statements is not true?
6406533953304.
Both statements are true and statement 2 is a potential solution for statement 1
6406533953305.
Both statements are true but statement 2 is not a solution to statement 1
6406533953306.
Both statements are false
6406533953307.
Statement 1 is false but Statement 2 is true

A published solution is not available for this question yet.

Report a correction for Q306

Question 307 MSQ · 2.0 marks

Microbe ‘M’ has 50 reactions that are stuck when grown by itself. When ‘M’ is grown with ‘N’, the stuck reactions reduce to 40. When ‘M’ is paired with ‘O’, the number drops to 42. Which of the following statements hold true?
6406533953248.
MSI of ‘M’ in the presence of ‘N’ is 0.2.
6406533953249.
MSI of ‘M’ in the presence of ‘O’ is 0.16.
6406533953250.
MSI of ‘M’ in the presence of ‘N’ and ‘O’ is 0.36.
6406533953251.
MSI of ‘N’ in the presence of ‘M’ is 0.2.

A published solution is not available for this question yet.

Report a correction for Q307

Question 308 MSQ · 2.0 marks

Source diagram or notation
6406533953252.
Gene 1 → Gene 2
6406533953253.
Gene 1 → Gene 3
6406533953254.
Gene 3 → Gene 2
6406533953255.
Gene 3 → Gene 1

A published solution is not available for this question yet.

Report a correction for Q308

Question 309 MSQ · 2.0 marks

How are network motifs related to the organization of gene regulatory networks?
6406533953256.
They represent common patterns of gene regulation that appear frequently in the network
6406533953257.
They can be interconnected to form modules, which can regulate specific gene sets
6406533953258.
They are not relevant at all levels of regulatory networks
6406533953259.
They are always independent of the modules in the network

A published solution is not available for this question yet.

Report a correction for Q309

Question 310 MSQ · 2.0 marks

Which of the following are true about feed-forward loop (FFL) motifs in transcriptional regulatory networks?
6406533953260.
FFLs are simple sequences of gene interactions with no regulation involved.
6406533953261.
FFLs can involve both positive and negative regulation, which helps control gene expression in a dynamic manner.
6406533953262.
FFLs are mainly found in eukaryotic organisms and are not present in prokaryotes.
6406533953263.
In an FFL, feedback can either increase (amplify) or decrease (attenuate) the gene expression signal.

A published solution is not available for this question yet.

Report a correction for Q310

Question 311 MSQ · 2.0 marks

Consider a graph that was constructed by comparing n DNA sequences. If the two sequences can be aligned with a score greater than a threshold value, we assign an edge between the two in the graph. Given this, which of the following is true:
6406533953292.
Inserting a new node to the graph requires n comparisons
6406533953293.
Inserting a new node is a node level task
6406533953294.
If all the alignments have the same score, the resultant graph is a complete graph
6406533953295.
There will be two connected components in the resultant graph

A published solution is not available for this question yet.

Report a correction for Q311

Question 312 MSQ · 2.0 marks

Which of the following does not makes an appropriate pair?
6406533953296.
Node classification – Predicting drug-drug interaction
6406533953297.
Graph classification – Predicting toxicity of a chemical compound
6406533953298.
Link Prediction – Predicting function of novel proteins
6406533953299.
Graph regression – Predicting free energy of hydration

A published solution is not available for this question yet.

Report a correction for Q312

Question 313 MCQ · 1.0 marks

How many solutions are possible for a string reconstruction problem with 13 words?
6406533953264.Source diagram or notation
6406533953265.Source diagram or notation
6406533953266.Source diagram or notation
6406533953267.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q313

Question 314 MCQ · 1.0 marks

What is the number of 5-mers generated from the sequence : “AGATATATTATTGTCTTTTTTGTCA”?
6406533953268.
20
6406533953269.
22
6406533953270.
15
6406533953271.
21

A published solution is not available for this question yet.

Report a correction for Q314

Question 315 MCQ · 3.0 marks

What is the total number of nodes of the De-Bruijn Graph generated from the 3-mers obtained from “TACTCTAAG”?
6406533953280.
3
6406533953281.
5
6406533953282.
7
6406533953283.
4

A published solution is not available for this question yet.

Report a correction for Q315

Question 316 MCQ · 3.0 marks

Given the two sequences “GATTACA”, “GTCGACGCA”, and the scoring paradigm: matches: “+1”, mismatches: “-1” and gap: “-2”, find the final score for the best global alignment between the two sequences.
6406533953284.
10
6406533953285.
-11
6406533953286.
-3
6406533953287.
2

A published solution is not available for this question yet.

Report a correction for Q316

Question 317 MCQ · 3.0 marks

Given the k-mers : ’GCCGT’, ’CGTAG’, ’TAGGC’, ’GTAGG’, ’CTATG’, ’CCGTA’, ’TATGC’, ’TGCCG’, ’AGGCG’, ’ATGCC’, reconstruct the sequence from which the k-mers were generated.
6406533953288.
CTATACCGTAGGCG
6406533953289.
CTATGCCGTAGGCG
6406533953290.
ATCGGTACAACGG
6406533953291.
TATGCCGTAGGCGC

A published solution is not available for this question yet.

Report a correction for Q317