B.Tech-B.Tech Bioinformatics Data structure and Algorithm(Sathyabama University, Chennai, Tamil Nadu-2010)
Friday, 23 August 2013 06:00Duraimani
(Established under section 3 of UGC Act,1956)
Course & Branch :B.Tech - BIN
Title of the Paper :Data structure & Algorithm Max. Marks :80
Sub. Code :522507/622507 Time : 3 Hours
Date :04/05/2010 Session :AN
PART - A (10 x 2 = 20)
Answer ALL the Questions
1. Write the pseudo code to find the factorial of a given number.
2. What is program module?
3. Write the use of index table method.
4. List out the applications of stack.
5. What are the methods used in tree representation?
6. What do you mean by height of a binary tree?
7. What is multi dimensional array?
8. What is topological ordering?
9. Compare internal and external sorting.
10. Write the best case and worst case analysis of insertion sort.
PART – B (5 x 12 = 60)
Answer All the Questions
11. (a) Discuss the function of logic and control structures with examples. (8)
(b) Describe the advantages of doubly linked list. (4)
(or)
12. Explain the algorithm for insertion and deletion operation of singly linked list.
13. Write and explain the algorithm for linked list implementation of a queue.
(or)
14. With an example, explain the algorithm for evaluation of arithmetic expression.
15. Explain the binary tree traversal. Give example for each.
(or)
16. Write a detailed note on threaded binary trees.
17. Explain the algorithm for linked list implementation of sparse matrix.
(or)
18. (a) Explain the use of Prim’s algorithm.
(b) Compare Breadth First and Depth First Search algorithm.
19. Write an algorithm for Quick sort. Analyze its performance with an example.
(or)
20. Sort the following numbers using Merge sort.
45,38,48,99,77,21,87,54,90,11
Analyze its best case and worst case performance.
| Earning: ₹ 3.20/- |
