bt4001_2023T1_Q1_NA.pdf

Algorithmic Thinking in Bioinformatics · Quiz 1 · Jan 2023

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

Question 125 MCQ · 3.0 marks

Suppose you fly to an alien world and are surprised to find that life there follows the same central dogma. The difference is that the alien life has 2 distinct nucleotides that make up DNA sequences and a whopping 600 distinct amino acids that make up protein sequences. What is the minimum length of each codon in this alien species?

A published solution is not available for this question yet.

Question 126 MCQ · 3.0 marks

Consider a GRN system with four genes: g1 ,g2 , g3 and g4.The adjacency matrix that represents the GRN is given below. [[IMAGE:942924bdc1568505_3_1]] From the given options, identify the appropriate graph representation for the given gene regulatory network (GRN).

[[IMAGE:942924bdc1568505_4_2]]
[[IMAGE:942924bdc1568505_4_3]]
[[IMAGE:942924bdc1568505_4_4]]
[[IMAGE:942924bdc1568505_4_5]]

A published solution is not available for this question yet.

Question 127 MCQ · 3.0 marks

The figure below shows the genetic code describing the translation of an RNA codon into one of 20 different amino acids. [[IMAGE:942924bdc1568505_5_6]]

[[IMAGE:942924bdc1568505_5_7]]
[[IMAGE:942924bdc1568505_5_8]]
[[IMAGE:942924bdc1568505_5_9]]
[[IMAGE:942924bdc1568505_6_10]]

A published solution is not available for this question yet.

Question 128 MCQ · 3.0 marks

What is the probability that a 4-length path between two nodes in a graph is colorful (i.e., all the vertices in the path get a unique color), when each node in the graph is assigned one of 4 colors uniformly and independently at random? (Note: Path length is measured as number of nodes in a path.)

1.0
0.049
0.93
0.094

A published solution is not available for this question yet.

Question 129 MCQ · 3.0 marks

[[IMAGE:942924bdc1568505_6_11]]

[[IMAGE:942924bdc1568505_7_12]]
[[IMAGE:942924bdc1568505_7_13]]
[[IMAGE:942924bdc1568505_7_14]]
[[IMAGE:942924bdc1568505_7_15]]

A published solution is not available for this question yet.

Question 130 MCQ · 3.0 marks

According to the central dogma of molecular biology, what is the direction of information flow within a cell?

DNA → Protein → RNA
Protein → RNA → DNA
RNA → Protein → DNA
DNA → RNA → Protein

A published solution is not available for this question yet.

Question 131 MCQ · 3.0 marks

In the color-coding algorithm where each of the n nodes in the input graph is assigned one of k colors, the total number of DP table entries (i.e., DP states denoted W(v,X)) is:

2\(^{k}\)
n\(^{k}\)
n2\(^{k}\)
nn\(^{k}\)

A published solution is not available for this question yet.

Question 132 NAT · 3.0 marks

[[IMAGE:942924bdc1568505_8_16]]

A published solution is not available for this question yet.

Question 133 MCQ · 4.0 marks

[[IMAGE:942924bdc1568505_9_17]]

[[IMAGE:942924bdc1568505_9_18]]
[[IMAGE:942924bdc1568505_9_19]]
[[IMAGE:942924bdc1568505_9_20]]
[[IMAGE:942924bdc1568505_9_21]]

A published solution is not available for this question yet.

Question 134 MCQ · 4.0 marks

[[IMAGE:942924bdc1568505_9_22]]

[[IMAGE:942924bdc1568505_9_23]]
[[IMAGE:942924bdc1568505_9_24]]
[[IMAGE:942924bdc1568505_10_25]]
[[IMAGE:942924bdc1568505_10_26]]

A published solution is not available for this question yet.

Question 135 MCQ · 4.0 marks

[[IMAGE:942924bdc1568505_10_27]] Based on the above data, answer the given subquestions.

What is the number of nodes in the De Bruijn graph?

A published solution is not available for this question yet.

Question 136 MCQ · 4.0 marks

[[IMAGE:942924bdc1568505_10_27]] Based on the above data, answer the given subquestions.

From among the options, identify the genome that can be spelt out from the De Bruijn graph (using the Eulerian path method).

[[IMAGE:942924bdc1568505_11_28]]
[[IMAGE:942924bdc1568505_11_29]]
[[IMAGE:942924bdc1568505_11_30]]
[[IMAGE:942924bdc1568505_11_31]]

A published solution is not available for this question yet.

Question 137 MSQ · 3.0 marks

[[IMAGE:942924bdc1568505_11_32]] Based on the above data, answer the given subquestions.

Consider an alignment game to align v and w such that we can score the maximum number of points. Scoring is done as follows: • For each match between two symbols: +1 point • For each mismatch between two symbols: 0 point • For each removal of symbol from any one sequence: 0 point Find the highest-scoring alignment(s) between the two strings.

[[IMAGE:942924bdc1568505_12_33]]
[[IMAGE:942924bdc1568505_12_34]]
[[IMAGE:942924bdc1568505_12_35]]
[[IMAGE:942924bdc1568505_12_36]]

A published solution is not available for this question yet.

Question 138 MCQ · 3.0 marks

[[IMAGE:942924bdc1568505_11_32]] Based on the above data, answer the given subquestions.

Consider the global alignment between v and w. Let the score be computed as follows: [[IMAGE:942924bdc1568505_13_37]] From the given options, identify the highest-scoring global alignment(s) between the two strings.

[[IMAGE:942924bdc1568505_13_38]]
[[IMAGE:942924bdc1568505_13_39]]
[[IMAGE:942924bdc1568505_13_40]]
[[IMAGE:942924bdc1568505_13_41]]

A published solution is not available for this question yet.

Question 139 MCQ · 4.0 marks

[[IMAGE:942924bdc1568505_11_32]] Based on the above data, answer the given subquestions.

Consider the local alignment between v and w. Let the score be computed as follows: [[IMAGE:942924bdc1568505_13_42]] From the given options, find the highest-scoring local alignment(s) between the two input strings.

[[IMAGE:942924bdc1568505_13_43]]
[[IMAGE:942924bdc1568505_14_44]]
[[IMAGE:942924bdc1568505_14_45]]
[[IMAGE:942924bdc1568505_14_46]] **BBN** **Section Id :** 64065330380 **Section Number :** 9 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 33 **Number of Questions to be attempted :** 33 **Section Marks :** 50 **Display Number Panel :** Yes **Group All Questions :** No **Enable Mark as Answered Mark for Review and** Yes **Clear Response :** **Maximum Instruction Time :** 0

A published solution is not available for this question yet.