B.E-B.E Civil Engineering Data Structures (Sathyabama University, Chennai, Tamil Nadu-2011)
Monday, 19 August 2013 12:30Duraimani
(Established under section 3 of UGC Act,1956)
Course & Branch :B.E - P-ECE/P-EEE
Title of the Paper :Data Structures Max. Marks:80
Sub. Code :6CPT0029 (2007-08-09-2010) Time : 3 Hours
Date :16/11/2011 Session :AN
PART - A (10 x 2 = 20)
Answer ALL the Questions
1. Analyse the best and worst case in Linear Search.
2. Differentiate between List and Link List.
3. Compare Queue and Circular Queue.
4. Convert the infix expression A+B*C-D to Postfix expression.
5. What are the steps involved in inorder traversal of a binary tree?
6. What is meant by level order traversal of a binary tree?
7. Explain how the elements are sorted using insertion sort.
8. Write an algorithm for bubble sort.
9. What is meant by Divide and Conquer technique?
10. What is the logic behind merge sort?
PART – B (5 x 12 = 60)
Answer All the Questions
11. Explain the various asymptotic notations in detail.
(or)
12. Explain the implementation of Single Link List in radix sorts.
13. What is a Postfix expression? Explain how an infix expression is converted into a Postfix expression.
(or)
14. What is Image Component labeling trees and explain how queue is used in solving.
15. Explain how the Single Booster problem is solved using binary tree.
(or)
16. Explain in detail the algorithm for finding all pair shortest path algorithm.
17. Explain Quick sort with an algorithm and analyse its time complexity.
(or)
18. Explain index sequential search with an algorithm.
19. Explain the dynamic programming approach for solving Traveling Salesman Problem.
(or)
20. Describe the solution for 8 queens problem using backtracking algorithmic approach.
| Earning: ₹ 4.65/- |
