This document contains a model exam for a data structures course covering topics such as linear and non-linear data structures, abstract data types, arrays and linked lists, stacks, queues, binary trees, binary search trees, binary heaps, hashing, hash collisions, AVL trees, splay trees, graphs, minimum spanning trees, shortest path algorithms, and tree/graph traversal algorithms. The exam is divided into two parts - part A contains 20 short answer questions defining various data structures and algorithms, and part B contains 5 long answer questions explaining the implementation and workings of specific algorithms.
This document contains a model exam for a data structures course covering topics such as linear and non-linear data structures, abstract data types, arrays and linked lists, stacks, queues, binary trees, binary search trees, binary heaps, hashing, hash collisions, AVL trees, splay trees, graphs, minimum spanning trees, shortest path algorithms, and tree/graph traversal algorithms. The exam is divided into two parts - part A contains 20 short answer questions defining various data structures and algorithms, and part B contains 5 long answer questions explaining the implementation and workings of specific algorithms.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
This document contains a model exam for a data structures course covering topics such as linear and non-linear data structures, abstract data types, arrays and linked lists, stacks, queues, binary trees, binary search trees, binary heaps, hashing, hash collisions, AVL trees, splay trees, graphs, minimum spanning trees, shortest path algorithms, and tree/graph traversal algorithms. The exam is divided into two parts - part A contains 20 short answer questions defining various data structures and algorithms, and part B contains 5 long answer questions explaining the implementation and workings of specific algorithms.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
Model Exam PGP College of Engineering and Technology Data Structures Department of Computer Science and Class: BE (CSE) Batch 2009-2013 Engineering Part – A (10*2=20) Model Exam 1. Define: Linear and Non Linear Data structures. Data Structures 2. Define an Abstract Data Type. Class: BE (CSE) Batch 2009- 3. Difference between Array and Linked List. 2013 4. Define: Stack and Queue. Part – A (10*2=20) 5. Define: Deque, Priority Queue. 1. Define: Linear and Non Linear Data 6. List out the Applications in Stack and Queue. structures. 7. Define: Binary Tree. 2. Define an Abstract Data Type. 8. Define: Binary Search Tree. 3. Difference between Array and Linked List. 9. Define: Binary Heap. 4. Define: Stack and Queue. 10. List out the applications in Binary Heaps. 5. Define: Deque, Priority Queue. 11. What is meant by hashing and Hash Collision? 6. List out the Applications in Stack and Queue. 12. Define: AVL Tree. 7. Define: Binary Tree. 8. Define: Binary Search Tree. 13. What are the operations in Splay tree? 9. Define: Binary Heap. 14. List out the types in hash collision. 10. List out the applications in Binary Heaps. 15. Define: Smart Union Algorithms. 11. What is meant by hashing and Hash 16. Define: Breadth First Search and Depth First Search. Collision? 17. Define: Biconnectivity. 12. Define: AVL Tree. 18. Define: Applications of Graphs. 13. What are the operations in Splay tree? 19. List out Minimum Spanning Tree. 14. List out the types in hash collision. 20. List out Shortest Path Algorithms. 15. Define: Smart Union Algorithms. 16. Define: Breadth First Search and Depth First Part-B (5 * 12 = 60) Search. 17. Define: Biconnectivity. 21. Explain the stack and Queue algorithms With 18. Define: Applications of Graphs. Explanation 19. List out Minimum Spanning Tree. 22. Explain Binary Search Create-Insert and Delete 20. List out Shortest Path Algorithms. Algorithms. 23. Explain the Tree Traversals Algorithms With Part-B (5 * 12 = 60) Explanations. 24. Explain the Hash Collision methods with Explanations. 21. Explain the stack and Queue algorithms With 25. Explain the Minimum Spanning tree With Explanation Explanations. 22. Explain Binary Search Create-Insert and 26. Explain the Shortest Path Algorithms with Delete Algorithms. Explanations. 23. Explain the Tree Traversals Algorithms With 27. Explain the AVL Tree and Splay Tree. Explanations. 28. Explain the Depth First Search and Breadth First 24. Explain the Hash Collision methods with Search. Explanations. 25. Explain the Minimum Spanning tree With Explanations. 26. Explain the Shortest Path Algorithms with Explanations. 27. Explain the AVL Tree and Splay Tree. 28. Explain the Depth First Search and Breadth First Search.