Exam Details
Subject | computational biology | |
Paper | ||
Exam / Course | m.sc bioinformatics | |
Department | ||
Organization | alagappa university | |
Position | ||
Exam Date | April, 2016 | |
City, State | tamil nadu, karaikudi |
Question Paper
M.Sc. DEGREE EXAMINATION, APRIL 2016
Second Semester
Bioinformatics
COMPUTATIONAL BIOLOGY
(CBCS 2013 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 2 20)
Answer all questions.
1. Draw a phylogenetic tree and mark the leaf, node, branch
and root of that tree.
2. What is Hamilton path?
3. What is Z value?
4. Expand and explain about BLAST and FASTA.
5. What is multiple sequence alignment?
6. What are gap penalties?
7. Expand and explain about HMM and ANN.
8. Brief out probabilistic pattern?
9. What is superposition?
10. Name any four visualization tools.
Sub. Code
502204
RW-10867
2
WS 20
Part B 5 25)
Answer all questions.
11. Discuss about any two complexity classes.
Or
What is phylogenetic tree? Explain about their
types and terminologies.
12. Explain in detail about Smith-Waterman algorithm.
Or
Explain BLAST algorithm.
13. Explain about PAM ad BLOSUM.
Or
What are the character based methods used for
phylogenetic tree construction? Explain.
14. Write about ANN.
Or
Explain in detail about GRAIL and GenScan.
15. Discuss about the geometrical analysis of molecules.
Or
Explain about dynamic programming.
RW-10867
3
WS 20
Part C 10 30)
Answer any three questions.
16. Discuss in detail about strings.
17. Explain Needleman-Wunsch algorithm with an example.
18. Explain the various methods used for Phylogenetic tree
construction.
19. Write about the general methods used for Gene discovery.
20. Explain in detail about Ramachandran map.
Second Semester
Bioinformatics
COMPUTATIONAL BIOLOGY
(CBCS 2013 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 2 20)
Answer all questions.
1. Draw a phylogenetic tree and mark the leaf, node, branch
and root of that tree.
2. What is Hamilton path?
3. What is Z value?
4. Expand and explain about BLAST and FASTA.
5. What is multiple sequence alignment?
6. What are gap penalties?
7. Expand and explain about HMM and ANN.
8. Brief out probabilistic pattern?
9. What is superposition?
10. Name any four visualization tools.
Sub. Code
502204
RW-10867
2
WS 20
Part B 5 25)
Answer all questions.
11. Discuss about any two complexity classes.
Or
What is phylogenetic tree? Explain about their
types and terminologies.
12. Explain in detail about Smith-Waterman algorithm.
Or
Explain BLAST algorithm.
13. Explain about PAM ad BLOSUM.
Or
What are the character based methods used for
phylogenetic tree construction? Explain.
14. Write about ANN.
Or
Explain in detail about GRAIL and GenScan.
15. Discuss about the geometrical analysis of molecules.
Or
Explain about dynamic programming.
RW-10867
3
WS 20
Part C 10 30)
Answer any three questions.
16. Discuss in detail about strings.
17. Explain Needleman-Wunsch algorithm with an example.
18. Explain the various methods used for Phylogenetic tree
construction.
19. Write about the general methods used for Gene discovery.
20. Explain in detail about Ramachandran map.
Other Question Papers
Subjects
- biomolecules
- computational approach to taxonomy and phylogeny
- computational biology
- elective i –– general chemistry
- elective ii — immunology and immunotechnology
- genomics and pharmacogenomics
- introduction to bioinformatics
- lab ii : biochemical and molecular biology methods
- lab iii – mysql and perl programming
- mathematics and biostatistics
- molecular cell biology and genetics
- molecular modelling and pharmacoinformatics
- nanotechnology and advanced drug delivery system
- principles of gene manipulation
- structural biology