Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Algorithmic Thinking in Bioinformatics
Assembly, alignment & rearrangements
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- MSQ: One or more options correct. Select all to score.
- NAT: Numerical response. No negative marking.
- Scientific calculator allowed for all calculations.
- Official answer key is sealed at the end of this sheet.
- Q1MCQ5 Marks·Choose one option

- A14
- B41
- C57
- D128
- Q2NAT5 Marks·Write the number
Your answer: - Q3NAT5 Marks·Write the number
Your answer: Read the passage below, then answer Q4–Q5
The de Bruijn graph of some linear (i.e., non-circular) genome Dna comprises of 2 nodes (N_1 and N_2) and 3 edges – two of these edges are directed from N_1 to N_2 and the remaining edge is directed from N_2 to N_1. To reconstruct Dna, you are allowed to start only from the node N_1. Answer the given subquestions with respect to the same.
Q4NAT2 Marks·Write the numberIf the k-mers represented by both N_1 and N_2 are fixed, then how many unique genome sequences can be constructed from this de Bruijn graph? Enter the answer as a single integer.
Your answer:- Q5MSQ3 Marks·Choose all correct options
Suppose you don’t know the 2-mers representing N_1 and N_2. Then which of the following is/are possible choices for Dna?
- ATATAT
- BCACAC
- CATATA
- DAGAGG
- ETGTGG