Sail E0 Webinar

MCQs

Total Questions : 80 | Page 4 of 8 pages
Question 31. Which of the following is not the objective to perform sequence comparison?
  1.    To observe patterns of conservation
  2.    To find the common motifs present in both sequences
  3.    To study the physical properties of molecules
  4.    To study evolutionary relationships
 Discuss Question
Answer: Option C. -> To study the physical properties of molecules
Answer: (c).To study the physical properties of molecules
Question 32. The global sequence alignment is suitable when the two sequences are of dissimilar length, with a negligible degree of similarity throughout.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option B. -> False
Answer: (b).False
Question 33. The substitution matrices are rarely used in this type of matching.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option B. -> False
Answer: (b).False
Question 34. A dotplot is a visual and qualitative technique whereas the sequence alignment is an exact and quantitative measure of similarity of alignments.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 35. The alignment score is the sum of substitution scores and gap penalties in this type of algorithm.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 36. Which of the following is untrue about Protein substitution matrices?
  1.    They are significantly more complex than DNA scoring matrices
  2.    They have the N x N matrices of the amino acids
  3.    Protein substitution matrices have quite important role in evolutionary studies
  4.    They are significantly quite less complex than DNA scoring matrices
 Discuss Question
Answer: Option D. -> They are significantly quite less complex than DNA scoring matrices
Answer: (d).They are significantly quite less complex than DNA scoring matrices
Question 37. There are two types matrices involved in the study- score matrices and trace matrices.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 38. In Needleman-Wunsch algorithm, the gaps are scored -2.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option B. -> False
Answer: (b).False
Question 39. The number of possible global alignments between two sequences of length N is _____
  1.    \(\frac{2^N}{\sqrt{πN}}\)
  2.    \(\frac{2^{2N}}{\sqrt{πN}}\)
  3.    \(\frac{2^{(N-1)}}{\sqrt{πN}}\)
  4.    \(\frac{2^{2N}}{\sqrt{N}}\)
 Discuss Question
Answer: Option B. -> \(\frac{2^{2N}}{\sqrt{πN}}\)
Answer: (b).\(\frac{2^{2N}}{\sqrt{πN}}\)
Question 40. Which of the following is untrue about Needleman-Wunsch algorithm?
  1.    It is an example of dynamic programming
  2.    Basic idea here is to build up the best alignment by using optimal alignments of larger subsequences
  3.    It was first used by Saul Needleman and Christian Wunsch
  4.    It was first used in 1970
 Discuss Question
Answer: Option B. -> Basic idea here is to build up the best alignment by using optimal alignments of larger subsequences
Answer: (b).Basic idea here is to build up the best alignment by using optimal alignments of larger subsequences

Latest Videos

Latest Test Papers