MCQOPTIONS

Explore topic-wise MCQs in Bioinformatics.

This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.

1.	Which of the following is wrong in case of substitution matrices?
A.	They determine likelihood of homology between two sequences
B.	They use system where substitutions that are more likely should get a higher score
C.	They use system where substitutions that are less likely should get a lower score
D.	BLOSUM-X type uses logarithmic identity to find similarity
Answer» E.

2.	Which of the following is not a disadvantage of Needleman-Wunsch algorithm?
A.	This method is comparatively slow
B.	There is a need of intensive memory
C.	This cannot be applied on genome sized sequences
D.	This method can be applied to even large sized sequences
Answer» E.

3.	WHICH_OF_THE_FOLLOWING_DOES_NOT_DESCRIBE_GLOBAL_ALIGNMENT_ALGORITHM??$
A.	It attempts to align every residue in every sequence
B.	It is most useful when the aligning sequences are similar and of roughly the same size
C.	It is useful when the aligning sequences are dissimilar
D.	It can use Needleman-Wunsch algorithm
Answer» D. It can use Needleman-Wunsch algorithm

4.	Which of the following is wrong in case of substitution matrices?$
A.	They determine likelihood of homology between two sequences
B.	They use system where substitutions that are more likely should get a higher score
C.	They use system where substitutions that are less likely should get a lower score
D.	BLOSUM-X type uses logarithmic identity to find similarity
Answer» E.

5.	Which of the following is untrue regarding the scoring system used in dynamic programming?
A.	If the residues are same in both the sequences the match score is assumed as +5 which is added to the diagonally positioned cell of the current cell
B.	If the residues are not same, the mismatch score is assumed as -3
C.	If the residues are not same, the mismatch score is assumed as 3
D.	The score should be added to the diagonally positioned cell of the current cell
Answer» D. The score should be added to the diagonally positioned cell of the current cell

6.	Which of the following does not describe PAM matrices?
A.	These matrices are used in optimal alignment scoring
B.	It stands for Point Altered Mutations
C.	It stands for Point Accepted Mutations
D.	It was first developed by Margaret Dayhoff
Answer» C. It stands for Point Accepted Mutations

7.	Which of the following does not describe global alignment algorithm?
A.	In initialization step, the first row and first column are subject to gap penalty
B.	Score can be negative
C.	In trace back step, beginning is with the cell at the lower right of the matrix and it ends at top left cell
D.	First row and first column are set to zero
Answer» E.

8.	Which of the following is not an advantage of Needleman-Wunsch algorithm?
A.	New algorithmic improvements as well as increasing computer capacity make possible to align a query sequence against a large DB in a few minutes
B.	Similar sequence region is of same order and orientation
C.	This does not help in determining evolutionary relationship
D.	If you have 2 genes that are already understood as closely related, then this type of algorithm can be used to understand them in further details
Answer» D. If you have 2 genes that are already understood as closely related, then this type of algorithm can be used to understand them in further details

9.	Which of the following does not describe dynamic programming?
A.	The approach compares every pair of characters in the two sequences and generates an alignment, which is the best or optimal
B.	Global alignment algorithm is based on this method
C.	Local alignment algorithm is based on this method
D.	The method can be useful in aligning protein sequences to protein sequences only
Answer» E.

10.	When did Needleman-Wunsch first describe the algorithm for global alignment?
A.	1899
B.	1970
C.	1930
D.	1950
Answer» C. 1930