uiz Space

January 2023 term · Algorithmic Thinking in Bioinformatics · BSBT4001

Algorithmic Thinking in Bioinformatics End Term: 30 April 2023 (January 2023 term)

The IIT Madras BS Algorithmic Thinking in Bioinformatics (Algorithmic Thinking in Bioinformatics) End Term paper sat on 30 Apr 2023, in the January 2023 term: 7 questions for 22 marks in 180 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
7
Marks
22
Duration
180 min
MCQ
5
MSQ
2

Updated

Official paper: IIT M DEGREE ET1 EXAM QPE2 S1 30 Apr 2023 · No negative marking.

Question 1

+4 marksOne correct option

Many antibiotics interfere with the transfer of genetic information from X to Y, preventing bacteria from growing. Y is a polymer of Z. X has ribose sugar in its composition. Identify X, Y, and Z. Name the process that is affected by antibiotics here. X, Y, Z and the process are respectively:

  1. A

    RNA, Protein, Amino acids, Translation

  2. B

    DNA, Protein, Amino acids, Transcription

  3. C

    RNA, Protein, Amino acids, Transcription

  4. D

    RNA, Amino acids, Proteins, Translation

Show answer

Correct answer

  • A

    RNA, Protein, Amino acids, Translation

Question 2

+2 marksOne or more correct options

Select all that apply.

  1. A

    Sensitivity to outliers

  2. B

    Sensitivity to centroid initialization

  3. C

    Non-convergence

  4. D

    Some of the output clusters can be non-convex.

Show answer

Correct answers

  • C

    Non-convergence

  • D

    Some of the output clusters can be non-convex.

Question 3

+3 marksOne correct option

Consider the following hypothetical phylogenetic tree constructed using viral sequences isolated from different host species.

Consider the following hypothetical phylogenetic tree constructed using viral sequences isolated from different host species.
Which of the following is/are true (with absolute certainty) with respect to the immediate common ancestor of the Human and Monkey viruses?

  1. A

    Human virus is the immediate common ancestor

  2. B

    Monkey virus is the immediate common ancestor

  3. C

    Goat virus is the immediate common ancestor

  4. D

    Cannot tell

Show answer

Correct answer

  • D

    Cannot tell

Question 4

+3 marksOne correct option
  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

Show answer

Correct answer

  • A

    1

Question 5

+3 marksOne correct option

Which of the following statements is/are true?
1. UPGMA method builds a rooted phylogenetic tree while the neighbor-joining tree method builds an unrooted phylogenetic tree.
2. UPGMA algorithm requires the distances to be ultrametric while the neighbor-joining tree algorithm requires the distances to be additive, if we need to prove that the respective algorithm can correctly recover the true tree. 3. The basic assumption of the UPGMA method is that all taxa evolve at a constant rate and that they are equally distant from the root.

  1. A

    1 and 2

  2. B

    2 and 3

  3. C

    1 and 3

  4. D

    1, 2 and 3

Show answer

Correct answer

  • D

    1, 2 and 3

Question 6

+3 marksOne correct option
  1. A

    1 and 2

  2. B

    2 and 3

  3. C

    1 and 3

  4. D

    1, 2 and 3

Show answer

Correct answer

  • A

    1 and 2

Question 7

+4 marksOne or more correct options

Which of the following is/are true with respect to additive and ultrametric distance matrices and trees? Assume that the distance matrix satisfies the usual distance metric axioms like non-negativity, symmetricity and triangle inequality. Also, recall that an ultrametric distance matrix is any distance matrix that can be derived from some ultrametric tree (using the edge weights and paths in that tree).

Select all that apply.

  1. A

    A 3 × 3 non-additive distance matrix is possible.

  2. B

    A 4 × 4 non-additive distance matrix is possible.

  3. C

    All ultrametric distance matrices are additive but not vice-versa.

  4. D

    In an ultrametric tree, the distance from the root to any leaf is the same.

Show answer

Correct answers

  • B

    A 4 × 4 non-additive distance matrix is possible.

  • C

    All ultrametric distance matrices are additive but not vice-versa.

  • D

    In an ultrametric tree, the distance from the root to any leaf is the same.