Given a multiset of 
-mers 
, the pseudocode of the algorithm to construct the de Bruijn graph (G) is given below. Fill in the four blanks.
I: , II: 
, III: 
, IV: 
I: 
, II: , III: , IV:
I: , II: , III: , IV:
I: , II: , III: , IV:
Consider the overlap graph representing all the connections between the following 3-mer collection: 
. From among the given options, identify the string that can be constructed from some path in the overlap graph?
Consider a logistic regression model trained to predict whether a protein–protein interaction exists (interaction = 1, no interaction = 0) using two biological features in 
(for example, expression correlation and functional similarity). The model predicts that the probability of interaction for the feature vector
is equal to 
. What is the probability that a protein pair with feature vector
belongs to class 
(interaction)?
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.
The IIT Madras BS Algorithmic Thinking in Bioinformatics (Algorithmic Thinking in Bioinformatics) Quiz 1 paper sat on 15 Mar 2026, in the January 2026 term: 15 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 15 Mar 2026 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Algorithmic Thinking in Bioinformatics |
| Course code | BSBT4001 |
| Questions | 15 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 5 |
| MSQ | 4 |
| Numerical | 6 |
| Official paper | Algorithmic Thinking In Bioinformatics 15 Mar 26 |
| Negative marking | No negative marking. |
| Updated |
