On a search of Data Structures & Algorithms question papers of Sathyabama University? Read this blog post to collect the old one conducted on 12th November 2014. Read on!
Sathyabama University
(Established under section 3 of UGC Act,1956)
Course & Branch : B.E/B.Tech - CSE/IT
Title of the Paper : Data Structures & Algorithms
Maximum Marks: 80
Sub. Code : 6C0043(2007/2008/2009)
Time : 3 Hours
Date : 12/11/2014
Session : FN
PART - A (10 x 2 = 20)
Answer ALL the Questions
1. Define data structure.
2. What are the applications of stack?
3. What is binary tree?
4. What is in degree and out degree?
5. What is internal and external sorting?
6. What is K-Way Merge Sort?
7. What is an algorithm?
8. What is Big O notation?
9. What is dynamic programming?
10. What do you mean by branch and bound technique?
PART – B (5 x 12 = 60)
Answer All the Questions
11. What is doubly linked list? Explain the operations on doubly
(or)
12. Explain any one application of queue with code.
13. Write down the recursive functions for preorder, post order and in order traversal of a tree.
(or)
14. Explain AVL rotations.
15. Explain multilink files with example.
(or)
16. Write the algorithm for doing quick sorting.
17. What is complexity analysis or performance analysis? Explain space complexity and time complexity with an example.
(or)
18. Using state space method, explain the lower bound for the minmax problem.
19. Write down the recursive procedure for 0/1 Knapsack problem using dynamic programming.
(or)
20. Write a program in C++ to solve 0/1 knapsack problem using branch and bound technique.
Sathyabama University
(Established under section 3 of UGC Act,1956)
Course & Branch : B.E/B.Tech - CSE/IT
Title of the Paper : Data Structures & Algorithms
Maximum Marks: 80
Sub. Code : 6C0043(2007/2008/2009)
Time : 3 Hours
Date : 12/11/2014
Session : FN
PART - A (10 x 2 = 20)
Answer ALL the Questions
1. Define data structure.
2. What are the applications of stack?
3. What is binary tree?
4. What is in degree and out degree?
5. What is internal and external sorting?
6. What is K-Way Merge Sort?
7. What is an algorithm?
8. What is Big O notation?
9. What is dynamic programming?
10. What do you mean by branch and bound technique?
PART – B (5 x 12 = 60)
Answer All the Questions
11. What is doubly linked list? Explain the operations on doubly
(or)
12. Explain any one application of queue with code.
13. Write down the recursive functions for preorder, post order and in order traversal of a tree.
(or)
14. Explain AVL rotations.
15. Explain multilink files with example.
(or)
16. Write the algorithm for doing quick sorting.
17. What is complexity analysis or performance analysis? Explain space complexity and time complexity with an example.
(or)
18. Using state space method, explain the lower bound for the minmax problem.
19. Write down the recursive procedure for 0/1 Knapsack problem using dynamic programming.
(or)
20. Write a program in C++ to solve 0/1 knapsack problem using branch and bound technique.
0 comments:
Pen down your valuable important comments below