Question 2 MCQ · 5.0 marks
[[IMAGE:2ee57e045b5e7b36_1_0]]
- TACC, ATGT, CGGC, ACTA
- ACCT, TGTC, GGCG, CTAA
- TACC, TGTC, GGCG, CTAA
- ACCT, ATGT, CGGC, ACTA
A published solution is not available for this question yet.
bt4001_2025T2_ET_FN.pdf
Algorithmic Thinking in Bioinformatics · End Term · May 2025 FN
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
Question 3 MCQ · 5.0 marks
[[IMAGE:2ee57e045b5e7b36_2_1]]
- 14
- 41
- 57
- 128
A published solution is not available for this question yet.
Question 4 NAT · 5.0 marks
[[IMAGE:2ee57e045b5e7b36_3_2]]
A published solution is not available for this question yet.
Question 5 NAT · 5.0 marks
[[IMAGE:2ee57e045b5e7b36_3_3]]
A published solution is not available for this question yet.
Question 6 NAT · 5.0 marks
[[IMAGE:2ee57e045b5e7b36_4_4]]
A published solution is not available for this question yet.
Question 7 NAT · 2.0 marks
The de Bruijn graph of some linear (i.e., non-circular) genome Dna comprises of 2 nodes (N1 and
N2) and 3 edges – two of these edges are directed from N1 to N2 and the remaining edge is
directed from N2 to N1. To reconstruct Dna, you are allowed to start only from the node N1. Answer
the given subquestions with respect to the same.
If the k-mers represented by both N1 and N2 are fixed, then how many unique genome sequences
can be constructed from this de Bruijn graph? Enter the answer as a single integer.
A published solution is not available for this question yet.
Question 8 MSQ · 3.0 marks
The de Bruijn graph of some linear (i.e., non-circular) genome Dna comprises of 2 nodes (N1 and
N2) and 3 edges – two of these edges are directed from N1 to N2 and the remaining edge is
directed from N2 to N1. To reconstruct Dna, you are allowed to start only from the node N1. Answer
the given subquestions with respect to the same.
Suppose you don’t know the 2-mers representing N1 and N2. Then which of the following is/are
possible choices for Dna?
- TATAT
- CACAC
- ATATA
- AGAGG
- TGTGG
A published solution is not available for this question yet.
Question 9 NAT · 3.0 marks
[[IMAGE:2ee57e045b5e7b36_5_5]]
Based on the above data, answer the given subquestions.
What is the value of the probability density function at x = 45 under this model? Round the answer
to three decimal digits.
A published solution is not available for this question yet.
Question 10 NAT · 2.0 marks
[[IMAGE:2ee57e045b5e7b36_5_5]]
Based on the above data, answer the given subquestions.
What is the probability that this data point was generated by the first cluster? Round the answer to
three decimal digits.
A published solution is not available for this question yet.
Question 11 NAT · 2.0 marks
You are asked to construct a phylogeny on the distance matrix D using the Additive Phylogeny
algorithm. At the end of the 5\(^{th}\) iteration, you notice the D\(^{bald}\) matrix consumes 81 units of
memory space. Assume every entry in a matrix requires 1 unit of space. Also assume the count of
the iterations starts from 1. Answer the given subquestions with respect to the same.
How many units of space is required to the corresponding D\(^{trimmed}\) matrix? Enter the answer as a
single integer.
A published solution is not available for this question yet.
Question 12 NAT · 2.0 marks
You are asked to construct a phylogeny on the distance matrix D using the Additive Phylogeny
algorithm. At the end of the 5\(^{th}\) iteration, you notice the D\(^{bald}\) matrix consumes 81 units of
memory space. Assume every entry in a matrix requires 1 unit of space. Also assume the count of
the iterations starts from 1. Answer the given subquestions with respect to the same.
How many leaves will be there in the final phylogeny constructed at the end of the algorithm?
Enter the answer as a single integer.
A published solution is not available for this question yet.
Question 13 NAT · 1.0 marks
You are asked to construct a phylogeny on the distance matrix D using the Additive Phylogeny
algorithm. At the end of the 5\(^{th}\) iteration, you notice the D\(^{bald}\) matrix consumes 81 units of
memory space. Assume every entry in a matrix requires 1 unit of space. Also assume the count of
the iterations starts from 1. Answer the given subquestions with respect to the same.
[[IMAGE:2ee57e045b5e7b36_7_6]]
Read the pseudocode carefully and calculate the number of iterations required by the UPGMA
algorithm to construct the Ultrametric tree on D? Enter the answer as a single integer.
A published solution is not available for this question yet.
Question 14 NAT · 4.0 marks
[[IMAGE:2ee57e045b5e7b36_8_7]]
Based on the above data, answer the given subquestions.
How many 6-mers in the sequence ‘**ATTCCGGCCAACAG**’ have a nonzero probability of binding to
the TF according to the PWM given in the table? Enter the answer as a single integer.
A published solution is not available for this question yet.
Question 15 MCQ · 4.0 marks
[[IMAGE:2ee57e045b5e7b36_8_7]]
Based on the above data, answer the given subquestions.
Which of the following substrings is most likely to be bound by the TF?
- TTCCGG
- CCGGCC
- ATTCCG
- CCAACA
A published solution is not available for this question yet.
Question 16 MCQ · 2.0 marks
[[IMAGE:2ee57e045b5e7b36_9_8]]
Based on the above data, answer the given subquestions.
[[IMAGE:2ee57e045b5e7b36_9_9]]
- [[IMAGE:2ee57e045b5e7b36_9_10]]
- [[IMAGE:2ee57e045b5e7b36_9_11]]
- [[IMAGE:2ee57e045b5e7b36_9_12]]
- [[IMAGE:2ee57e045b5e7b36_10_13]]
A published solution is not available for this question yet.