uiz Space

January 2025 term · Big Data and Biological Networks · BSBT4002

Big Data and Biological Networks Quiz 2: 16 March 2025 (January 2025 term)

The IIT Madras BS Big Data and Biological Networks (Big Data and Biological Networks) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term: 22 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.

Questions
22
Marks
50
Duration
120 min
MCQ
11
MSQ
11

Updated

Official paper: IIT M DEGREE AN EXAM QDB2 16 Mar 2025 · No negative marking.

Question 1

+2 marksOne correct option

What happens to scale-free networks when subjected to random node removal?

  1. A

    The network disintegrates rapidly

  2. B

    The diameter and characteristic path length decrease significantly

  3. C

    The network remains largely insensitive to the perturbation

  4. D

    The diameter and characteristic path length increase significantly

Show answer

Correct answer

  • C

    The network remains largely insensitive to the perturbation

Question 2

+2 marksOne correct option

Consider a regular lattice with n = 7 and m = 14. The number of triangular sub-graphs in the given network is

  1. A

    70

  2. B

    35

  3. C

    140

  4. D

    360

Show answer

Correct answer

  • B

    35

Question 3

+2 marksOne correct option

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?

  1. A

    0.33

  2. B

    0.56

  3. C

    0.27

  4. D

    0.73

Show answer

Correct answer

  • A

    0.33

Question 4

+2 marksOne correct option

If a metabolite with high betweenness centrality is knocked out, what is the likely consequence?

  1. A

    Pathway redundancy increases, paradoxically making the metabolic network more resilient.

  2. B

    The network always compensates through alternative routes, ensuring no functional loss.

  3. C

    Metabolic pathways may become fragmented, potentially disrupting essential biochemical functions.

  4. D

    Only directly connected reactions are affected, while the overall network remains stable.

Show answer

Correct answer

  • C

    Metabolic pathways may become fragmented, potentially disrupting essential biochemical functions.

Question 5

+2 marksOne correct option

What is the average degree (regardless of the direction) of the 3-mer De-Bruijn graph constructed from “TCAGAGGT”?

  1. A

    4.1

  2. B

    2.4

  3. C

    3.4

  4. D

    2

Show answer

Correct answer

  • D

    2

Question 6

+2 marksOne correct option

What is the total number of edges of the De-Bruijn Graph generated from the 3-mers obtained from “ATCGGTACAACTCTCTCATGCG”?

  1. A

    15

  2. B

    14

  3. C

    19

  4. D

    17

Show answer

Correct answer

  • C

    19

Question 7

+3 marksOne or more correct options

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?

Select all that apply.

  1. A

    Randomized networks must ideally retain the same number of nodes and edges as the original network.

  2. B

    Randomized networks can have a different degree distribution to ensure statistical significance.

  3. C

    Randomized networks can be generated using the configuration model, to ensure that the degree sequence of the original network is preserved.

  4. D

    Randomized networks can be generated by randomly adding new nodes and edges.

Show answer

Correct answers

  • A

    Randomized networks must ideally retain the same number of nodes and edges as the original network.

  • C

    Randomized networks can be generated using the configuration model, to ensure that the degree sequence of the original network is preserved.

Question 8

+3 marksOne or more correct options

The Girvan–Newman algorithm for community detection involves which of the following steps?

Select all that apply.

  1. A

    Remove edges with the highest betweenness first.

  2. B

    Re-compute the betweenness after each edge removal.

  3. C

    Remove edges with the lowest betweenness first.

  4. D

    Remove nodes with the lowest betweenness first.

Show answer

Correct answers

  • A

    Remove edges with the highest betweenness first.

  • B

    Re-compute the betweenness after each edge removal.

Question 9

+3 marksOne or more correct options

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?

Select all that apply.

  1. A

    The diameter of the network is an important factor, as it influences how quickly the disease can reach distant nodes.

  2. B

    The clustering coefficient is one of the parameters that determine the likelihood of localized outbreaks.

  3. C

    The degree distribution has no impact on disease spread in small-world networks.

  4. D

    The transmissibility of the disease is independent of the network structure.

Show answer

Correct answers

  • A

    The diameter of the network is an important factor, as it influences how quickly the disease can reach distant nodes.

  • B

    The clustering coefficient is one of the parameters that determine the likelihood of localized outbreaks.

Question 10

+3 marksOne or more correct options

Which of these are challenges one might encounter in the process of genome assembly?

Select all that apply.

  1. A

    Erroneous reads

  2. B

    Large volumes of data

  3. C

    Duplicate sequences

  4. D

    Incomplete graph

Show answer

Correct answers

  • A

    Erroneous reads

  • B

    Large volumes of data

  • C

    Duplicate sequences

Question 11

+3 marksOne or more correct options

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?

Select all that apply.

  1. A

    Both statements are true and statement 2 is a potential solution for statement 1

  2. B

    Both statements are true but statement 2 is not a solution to statement 1

  3. C

    Both statements are false

  4. D

    Statement 1 is false but Statement 2 is true

Show answer

Correct answers

  • B

    Both statements are true but statement 2 is not a solution to statement 1

  • C

    Both statements are false

  • D

    Statement 1 is false but Statement 2 is true

Question 12

+2 marksOne or more correct options

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?

Select all that apply.

  1. A

    MSI of ‘M’ in the presence of ‘N’ is 0.2.

  2. B

    MSI of ‘M’ in the presence of ‘O’ is 0.16.

  3. C

    MSI of ‘M’ in the presence of ‘N’ and ‘O’ is 0.36.

  4. D

    MSI of ‘N’ in the presence of ‘M’ is 0.2.

Show answer

Correct answers

  • A

    MSI of ‘M’ in the presence of ‘N’ is 0.2.

  • B

    MSI of ‘M’ in the presence of ‘O’ is 0.16.

Question 13

+2 marksOne or more correct options

Select all that apply.

  1. A

    Gene 1 → Gene 2

  2. B

    Gene 1 → Gene 3

  3. C

    Gene 3 → Gene 2

  4. D

    Gene 3 → Gene 1

Show answer

Correct answers

  • A

    Gene 1 → Gene 2

  • B

    Gene 1 → Gene 3

Question 14

+2 marksOne or more correct options

How are network motifs related to the organization of gene regulatory networks?

Select all that apply.

  1. A

    They represent common patterns of gene regulation that appear frequently in the network

  2. B

    They can be interconnected to form modules, which can regulate specific gene sets

  3. C

    They are not relevant at all levels of regulatory networks

  4. D

    They are always independent of the modules in the network

Show answer

Correct answers

  • A

    They represent common patterns of gene regulation that appear frequently in the network

  • B

    They can be interconnected to form modules, which can regulate specific gene sets

Question 15

+2 marksOne or more correct options

Which of the following are true about feed-forward loop (FFL) motifs in transcriptional regulatory networks?

Select all that apply.

  1. A

    FFLs are simple sequences of gene interactions with no regulation involved.

  2. B

    FFLs can involve both positive and negative regulation, which helps control gene expression in a dynamic manner.

  3. C

    FFLs are mainly found in eukaryotic organisms and are not present in prokaryotes.

  4. D

    In an FFL, feedback can either increase (amplify) or decrease (attenuate) the gene expression signal.

Show answer

Correct answers

  • B

    FFLs can involve both positive and negative regulation, which helps control gene expression in a dynamic manner.

  • D

    In an FFL, feedback can either increase (amplify) or decrease (attenuate) the gene expression signal.

Question 16

+2 marksOne or more correct options

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:

Select all that apply.

  1. A

    Inserting a new node to the graph requires n comparisons

  2. B

    Inserting a new node is a node level task

  3. C

    If all the alignments have the same score, the resultant graph is a complete graph

  4. D

    There will be two connected components in the resultant graph

Show answer

Correct answers

  • A

    Inserting a new node to the graph requires n comparisons

  • B

    Inserting a new node is a node level task

  • C

    If all the alignments have the same score, the resultant graph is a complete graph

Question 17

+2 marksOne or more correct options

Which of the following does not makes an appropriate pair?

Select all that apply.

  1. A

    Node classification – Predicting drug-drug interaction

  2. B

    Graph classification – Predicting toxicity of a chemical compound

  3. C

    Link Prediction – Predicting function of novel proteins

  4. D

    Graph regression – Predicting free energy of hydration

Show answer

Correct answers

  • A

    Node classification – Predicting drug-drug interaction

  • C

    Link Prediction – Predicting function of novel proteins

Question 18

+1 markOne correct option

How many solutions are possible for a string reconstruction problem with 13 words?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D

Question 19

+1 markOne correct option

What is the number of 5-mers generated from the sequence : “AGATATATTATTGTCTTTTTTGTCA”?

  1. A

    20

  2. B

    22

  3. C

    15

  4. D

    21

Show answer

Correct answer

  • D

    21

Question 20

+3 marksOne correct option

What is the total number of nodes of the De-Bruijn Graph generated from the 3-mers obtained from “TACTCTAAG”?

  1. A

    3

  2. B

    5

  3. C

    7

  4. D

    4

Show answer

Correct answer

  • C

    7

Question 21

+3 marksOne correct option

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.

  1. A

    10

  2. B

    -11

  3. C

    -3

  4. D

    2

Show answer

Correct answer

  • C

    -3

Question 22

+3 marksOne correct option

Given the k-mers : ’GCCGT’, ’CGTAG’, ’TAGGC’, ’GTAGG’, ’CTATG’, ’CCGTA’, ’TATGC’, ’TGCCG’, ’AGGCG’, ’ATGCC’, reconstruct the sequence from which the k-mers were generated.

  1. A

    CTATACCGTAGGCG

  2. B

    CTATGCCGTAGGCG

  3. C

    ATCGGTACAACGG

  4. D

    TATGCCGTAGGCGC

Show answer

Correct answer

  • B

    CTATGCCGTAGGCG