Question 1
What is the asymptotic space complexity required to store the topology of the phylogenetic tree?
What is the asymptotic space complexity required to store the topology of the phylogenetic tree?
What is the asymptotic space complexity required to store the branch lengths of the phylogenetic tree?
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 2 paper sat on 16 Aug 2026, in the May 2026 term: 17 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 2 16 Aug 2026 at a glance |
|---|---|
| Term | May 2026 term |
| Subject | Algorithmic Thinking in Bioinformatics |
| Course code | BSBT4001 |
| Questions | 17 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 13 |
| Numerical | 2 |
| MSQ | 2 |
| Official paper | Algorithmic Thinking In Bioinformatics 16 Aug 26 |
| Negative marking | No negative marking. |
| Updated |