uiz Space

May 2026 term · Algorithmic Thinking in Bioinformatics · BSBT4001

Algorithmic Thinking in Bioinformatics Quiz 2: 16 August 2026 (May 2026 term)

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. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
17
Marks
50
Duration
120 min
MCQ
13
Numerical
2
MSQ
2

Updated

Official paper: Algorithmic Thinking In Bioinformatics 16 Aug 26 · No negative marking.

Question 1

+2 marksOne correct option

What is the asymptotic space complexity required to store the topology of the phylogenetic tree?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B

Question 2

+2 marksOne correct option

What is the asymptotic space complexity required to store the branch lengths of the phylogenetic tree?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B

Question 3

+1 markOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 4

+4 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B

Question 5

+2 marksOne correct option

This profile matrix was computed from a set of five motifs as shown below. Three nucleotides in the motif set are missing. Use the given profile matrix above to infer the missing nucleotides and answer the given subquestions with respect to the same.

What is the nucleotide at position (i) in the given set of motifs?

  1. A

    A

  2. B

    C

  3. C

    G

  4. D

    T

Show answer

Correct answer

  • C

    G

Question 6

+3 marksOne correct option

This profile matrix was computed from a set of five motifs as shown below. Three nucleotides in the motif set are missing. Use the given profile matrix above to infer the missing nucleotides and answer the given subquestions with respect to the same.

Determine the nucleotide/s at positions (ii) and (iii).

  1. A

    A

  2. B

    C

  3. C

    G

  4. D

    T

Show answer

Correct answer

  • D

    T

Question 7

+3 marksNumerical answer

Answer the given subquestions with respect to the same.

Show answer

Correct answer: 2

Question 8

+2 marksOne or more correct options

Answer the given subquestions with respect to the same.

Suppose the UPGMA algorithm is applied to this distance matrix. Which of the following pair(s) of leaves can be merged first?

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • A
  • C

Question 9

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
  5. E

    Cannot be determined from the information provided

Show answer

Correct answer

  • B

Question 10

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 11

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B

Question 12

+2 marksNumerical answer
Show answer

Correct answer: 17

Question 13

+3 marksOne correct option

Answer the given subquestions with respect to the same.

Determine which among the following is the reference DNA sequence?

  1. A

    TTGTCCCCCGGGT$

  2. B

    TTGTCAACTGGGT$

  3. C

    ATGTCAACCGGGT$

  4. D

    ATGTCAACCGGGG$

  5. E

    TTTGCAACCGGGT$

Show answer

Correct answer

  • C

    ATGTCAACCGGGT$

Question 14

+4 marksOne or more correct options

Answer the given subquestions with respect to the same.

Select all that apply.

  1. A

    TTAC

  2. B

    GTCA

  3. C

    ATGT

  4. D

    GGCC

Show answer

Correct answers

  • B

    GTCA

  • C

    ATGT

Question 15

+4 marksOne correct option
  1. A

    ATGT

  2. B

    TGTG

  3. C

    GTGC

  4. D

    TGCA

Show answer

Correct answer

  • A

    ATGT

Question 16

+4 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • C

Question 17

+5 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D