Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Algorithmic Thinking in Bioinformatics
Suffix trees, suffix arrays & BWT
Official Paper
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- NAT: Numerical response. No negative marking.
- Scientific calculator allowed for all calculations.
- Official answer key is sealed at the end of this sheet.
End Term · 31 Aug 2025 (FN)End Term
- Q1NAT5 Marks·Write the number
Your answer:
Quiz 2 · 3 Aug 2025 (AN)Quiz 2
- Q2NAT3 Marks·Write the number
Your answer: Read the passage below, then answer Q3–Q5
Q3NAT3 Marks·Write the numberWhat is the number of edges in the corresponding suffix trie? Enter the value as a single integer.
Your answer:- Q4NAT2 Marks·Write the number
What is the length of the reference sequence from which this suffix tree has been constructed? Include $ in the calculation of length. Enter the value as a single integer.
Your answer: - Q5MCQ3 Marks·Choose one option
Use the given suffix tree to determine which of the following is the suffix array for the reference sequence ? Assume $ comes first in the alphabet.
- A[7, 6, 5, 3, 1, 4, 2, 0]
- B[7, 6, 5, 3, 1, 4, 0, 2]
- C[7, 5, 3, 1, 6, 4, 2, 0]
- D[7, 5, 3, 1, 6, 4, 0, 2]
- ENone of these
Read the passage below, then answer Q6–Q7
Q6MCQ2 Marks·Choose one option
- A
- B
- C
- D
- A
- Q7MCQ1 Mark·Choose one option
- A
- B
- C
- D
- E
- A