Sail E0 Webinar

MCQs

Total Questions : 50 | Page 3 of 5 pages
Question 21. The rigorous dynamic programming method is normally not used for database searching because it is slow and computationally expensive.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 22. Scan PS is a web-based program that implements a modified version of the Needleman-Wunsch algorithm.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option B. -> False
Answer: (b).False
Question 23. FASTA and BLAST are __________ but __________ for larger datasets.
  1.    faster, more sensitive
  2.    faster, less sensitive
  3.    slower, less sensitive
  4.    slower, more sensitive
 Discuss Question
Answer: Option B. -> faster, less sensitive
Answer: (b).faster, less sensitive
Question 24. In Smith–Waterman algorithm, in initialization Step, the _________ row and ________ column are subject to gap penalty.
  1.    first, first
  2.    first, second
  3.    second, First
  4.    first, last
 Discuss Question
Answer: Option A. -> first, first
Answer: (a).first, first
Question 25. Par Align is a web-based server that uses parallel processors to perform exhaustive sequence comparisons using either a parallelized version of the Smith–Waterman algorithm or a heuristic program for further speed gains.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 26. The main application of pairwise alignment is retrieving biological sequences in databases based on similarity.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 27. Dynamic programming method is the fastest and most practical method.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option B. -> False
Answer: (b).False
Question 28. Sensitivity refers to the ability to find as many correct hits as possible.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option A. -> True
Answer: (a).True
Question 29. Which of the following is not one of the requirements for implementing algorithms for sequence database searching?
  1.    Size of the dataset
  2.    Sensitivity
  3.    Specificity
  4.    Speed
 Discuss Question
Answer: Option A. -> Size of the dataset
Answer: (a).Size of the dataset
Question 30. The specificity refers to the ability to include incorrect hits.
  1.    True
  2.    False
  3.    May be True or False
  4.    Can't say
 Discuss Question
Answer: Option B. -> False
Answer: (b).False

Latest Videos

Latest Test Papers