Skip to content
VUBuddy

BIF501 Final Term MCQs

Bioinformatics II PDF 940 KBUpdated 23 Oct 2026
Final term past paper BIF501 Final Term MCQs PDF 940 KB
vubuddy.com
Type
Final term past paper
Course
BIF501 Bioinformatics II
Size
PDF 940 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 940 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 11. Download the file for all 11 pages.

MCQs FOR FINAL EXAMS PREPARATION

Q1. A simple way (but not the best) to score an alignment is to count 1 for each match and 0 for each mismatch .

  1. multiole alignment score
  2. Simple Alignment Scores
  3. scoring matrix
  4. match model

Q2. Substitution matrices are the log-odds matrices used for scoring ……. substitutions in pairwise alignments.

  1. nucleotides
  2. DNA
  3. amino acid
  4. All

Q3. When amino Acids are dissimilar, mutations from one into the other occur less during evolution it will be

  1. positive score
  2. Negative Score
  3. score 1
  4. score 0

Q4. Substitution scores can be derived from,

  1. Match model
  2. simple matrix
  3. probabilistic model
  4. a and c

Q5. The probability of two sequences is the product of probability of each amino acid, in the case of

  1. Unrelated Model
  2. random Model
  3. Match model
  4. a and b

Q6. Dayhoff, Schwartz and Orcutt presented their famous PAM matrix in

  1. 1977
  2. 1976
  3. 1978
  4. 1975

Q7. …….. do not capture true difference between short time substitutions and long term ones.

  1. BLOSUM matrix
  2. Dayhoff matrices
  3. optimal alignment
  4. a and b

Q8. Which one can perform well only in case of closely related proteins.

  1. PAM matrices
  2. BLOSUM matrix
  3. simple scoring matrix
  4. match model

Q9. BLOSOM or BLOCKS database was derived in …….. by Henikoff&Henikoff.

  1. 1990
  2. 1995
  3. 1998
  4. 1992

Q10. BLOSUM62 is good for ………. Alignments.

  1. multiple
  2. substitution
  3. ungapped
  4. gapped

Q11. PAM and BLOSUM are famous ……….. matrices.

  1. addition
  2. deletion
  3. multiplication
  4. substitution

Q12. Smith-Waterman algorithm finds the best …….. alignment between two sequences.

  1. multiple
  2. optimal
  3. local
  4. global
  5. Dynamic programming is used to find an ……… alignment of two sequences and its scores.
  6. a) multiple b) optimal c) local d) global
  7. Needleman wunsch algorithm was developed by Saul B. Needleman and Christian D. Wunsch and published in
  8. a) 1966 b) 1870 c) 1975 d) 1970

Q17. In needle man wunch algorithm while doing matrix filling …… is the sum of the cell to the left and the gap score

  1. vertical sequence score
  2. horizontal match score
  3. horizontal gap score
  4. b and c

Q18. …….. was awarded by Noble prize after sequencing a virus having size 5386 nucleotides.

  1. Walter Gilbert
  2. Steve Fodor
  3. Fred Sanger
  4. Needle man

Q19. Human genome project was started in

  1. 1977
  2. 1989
  3. 1988
  4. 1975

Q20. After completion of genome project approximately …….. nucleotides were sequenced.

  1. 5 billion
  2. 5 million
  3. 2 million
  4. 3 billion

Q21. How many nucleotides could be reads in starting sequencing methods?

  1. 200 – 300
  2. 400 – 500
  3. 500 – 600
  4. 500 - 700

Q22. After completion of H.G.P, Shotgun sequencing was came into being after

  1. 5 years
  2. 20 years
  3. 7 years
  4. 10 years

Q23. Shot gun sequencing is used when there will be …….. Amount of DNA sequence.

  1. Huge
  2. small
  3. medium
  4. All

Q24. In shot gun we use ………. for the breakdown of DNA into small pieces.

  1. PCR
  2. hybridization
  3. electrophoreses
  4. sonication

Q25. For obtaining shortest super string we use a technique

  1. super string problem
  2. shortest super string problem
  3. shortest string problem
  4. shortest super problem

Q26. Poly nomial algorithm is …… for shortest super string problem.

  1. best
  2. likely
  3. unlikely
  4. a and b

Q27. In sequencing hybridization to identify a fragment there was a small prob of …… nucleotides size

  1. 9 – 20
  2. 12 – 17
  3. 7 – 15
  4. 8 – 32

Q28. Which of the following is time consuming technique?

  1. sequencing hybridization
  2. Human genome project
  3. Steve fodor
  4. a and b

Q29. Light directed polymer synthesis was develop by

  1. sanger
  2. Walter Gilbert
  3. steve fodor
  4. albert jackob

Q30. Steve gave his sequencing technique in

  1. 1989
  2. 1991
  3. 1975
  4. 1985

Q31. 64-kb DNA array was build in 1994 by a company of California named as

  1. affymatrix
  2. prob matrix
  3. symmatrix
  4. array matrix

Q32. In an array of DNA chip each prob locate at a distance with

  1. unknown location
  2. known location
  3. unknown sequence
  4. b and c

Q33. What we use to determine the prob which is hybridized to DNA.

  1. spectrophoto meter
  2. micro aray
  3. spectrometer
  4. spectroscopic detector

Q34. Fragment assembly is actually assemblage of fragments into

  1. short array
  2. string
  3. l-mers
  4. entire genome

Q35. How many %age of human genome consist of repeat sequence

  1. 10%
  2. 20%
  3. 30%
  4. 40%

Q36. How many times the 300bp ALU is present in human genome?

  1. 1 billion
  2. 2 million
  3. 1 million
  4. 3 billion

Q37. In human T cells Locus there are 5 different closely related fragment of …….. gene.

  1. tyrosine
  2. tryptophan
  3. terasin
  4. tryptosine
All BIF501 files →
BIF501 Bioinformatics II All BIF501 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.