Scribd
Upload
47 views

Model It 2

This document contains a model examination for a Data Structures and Algorithms class. It has two parts: Part A contains 10 short answer questions testing core concepts like abstract data types, arrays vs linked lists, expression trees, binary trees, graphs, and biconnectivity. Part B contains 5 longer answer questions worth 16 marks each, testing data structures like stacks, queues, linked lists, binary search trees, AVL trees, hash tables, and algorithms like separate chaining, priority queues, graph search methods (Prim's, Dijkstra's), and dynamic programming.

Uploaded by

Karthick MuthuSwami
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
47 views

Model It 2

This document contains a model examination for a Data Structures and Algorithms class. It has two parts: Part A contains 10 short answer questions testing core concepts like abstract data types, arrays vs linked lists, expression trees, binary trees, graphs, and biconnectivity. Part B contains 5 longer answer questions worth 16 marks each, testing data structures like stacks, queues, linked lists, binary search trees, AVL trees, hash tables, and algorithms like separate chaining, priority queues, graph search methods (Prim's, Dijkstra's), and dynamic programming.

Uploaded by

Karthick MuthuSwami
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

B

Class : II IT Max. Marks : 100 DATA STRUCTURES AND ALGORITHM Date: Time: 3 Hrs.
Annai Mathammal Sheela Engineering College Department of Electrical and Electronics Engineering Model Examination

PART A (Answer All.) 10 x 2 = 20 1. Define Abstract Data Type. 2. Difference between Arrays and Linked List. 3. Convert the infix expression a + b * c + (d * e +f) * g to its equivalent postfix expression. 4. Draw the expression tree for (A+B*C+(D-E)*F). 5. How can you represent the binary tree? 6. Define an AVL tree. 7. Define priority queue. 8. Define minimum spanning tree. 9. Define a graph. How it differs from tree? 10. Define Biconnectivity. PART B 5 x 16 = 80 11. a) Explain ADT operations for linked implementation of stack. (16) (or) b) Write ADT routines for a singly linked list. (16) 12. a) Write the routines to insert and remove a node from Binary Search Tree. (16) (or) b)Write insertion algorithm for AVL Tree. Write suitable rotation algorithm. (16) 13. a) i)Explain the algorithm for separate chaining (8) ii) Explain implementation of priority queue (8) (or) b) Discuss in detail about the linked list implementation of Queue. (16) 14. a)i) Explain the Prims algorithm with example. (10) ii) Write ADT routines for depth first search algorithm. (6) (or) b) Explain Dijikstras algorithm using the following graph. (16) Find the shortest path between A to B, C, D, F, G.

15. a) Given input { 4371, 1323, 6173,, 4199, 4344, 9679, 1989 } and function h(X) = X (mod 10), show the resulting: (i) seperate chaining table (ii) Open addressing hash table using linear probing (iii) Open addressing hash table using quadratic probing (iv) Open addressing hash table with second hash function h2(X) = 7 (X mod 7) b) Explain Dynamic Programming with example

(16)

(16)

You might also like