Algorithmic Thinking in Bioinformatics Quiz 1: 23 February 2025 (January 2025 term)

Question 1

+3 marksOne correct option

Given below is the algorithm to print the longest common subsequence between the $i$ -prefix of $v$ and the $j$ -prefix of $w$ . The matrix $\mathit{Backtrack}$ stores the directions along which the algorithm should perform the backtracking operation in the form of arrows. Fill the given blanks to complete the algorithm.

text

1OUTPUTLCS(Backtrack, v, i, j)
2  if i = 0 or j = 0
3    return
4  if Backtrack_{i,j} = ↓
5    OUTPUTLCS([    I    ])
6  else if Backtrack_{i,j} = →
7    OUTPUTLCS([    II    ])
8  else
9    OUTPUTLCS([    III    ])
10    output v_i

Question 2

+3 marksNumerical answer

Calculate the optimal global alignment score for the DNA sequences GAATTC and GATTA. Scoring is done as follows:
• For every match: +2 points
• For every mismatch: -1 points
• For every insertion or deletion: -2 points

Question 3

+3 marksNumerical answer

13 more questions in this paper

Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.

More on the Algorithmic Thinking in Bioinformatics Quiz 1 23 Feb 2025 paper

The IIT Madras BS Algorithmic Thinking in Bioinformatics (Algorithmic Thinking in Bioinformatics) Quiz 1 paper sat on 23 Feb 2025, in the January 2025 term: 16 questions for 50 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.

Feature	Algorithmic Thinking in Bioinformatics Quiz 1 23 Feb 2025 at a glance
Term	January 2025 term
Subject	Algorithmic Thinking in Bioinformatics
Course code	BSBT4001
Questions	16
Marks	50
Duration	120 min
MCQ	3
Numerical	10
MSQ	2
Written	1
Official paper	IIT M DEGREE AN EXAM QDB2 23 Feb 2025
Negative marking	No negative marking.
Updated	25 Sept 2026