Scribd
Upload
70 views2 pages

DSD Model Exam Set-1&2 QP

Anna University important questions and answers

Uploaded by

sparksince2006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
70 views2 pages

DSD Model Exam Set-1&2 QP

Anna University important questions and answers

Uploaded by

sparksince2006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SRI MUTHUKUMARAN INSTITUTE OF TECHNOLOGY

Chikkarayapuram, Near Mangadu Chennai -600 069


Academic Year 2023- 2024 /Even Semester
Model examination
Branch : AIDS first year Date:
Sub Code: AD 3251 Marks: 100
Subject : Data structures and Design Time: 3.00 Hrs
Part – A (10*2 =20)
1. List the advantages of recursion.
2. What is OOPS in python?
3. Define abstract data type.
4. Define circularly linked list.
5. Define sorting.
6. What do you mean by hash table?
7. Define AVL.
8. Define expression tree.
9. What is meant by Acyclic graph?
10. What is topological sort?
Part – B (5*13=65)
11. a)Explain about different types of inheritance with an example. (13)
(Or)
b)Explain about shallow copy and deep copy with an example program (13)
12. a) Explain array based implementation of stacks. (13)
(Or)
b) Explain linked list implementation of stacks. (13)
13. a) How to implement radix sort? Explain with a suitable example (13)
(Or)
b) How to implement selection sort? Explain with a suitable example. (13)
14. a)Write an algorithm for inserting and deleting a node in a binary search tree (13)
(Or)
b)Explain in detail about M-way search tree and its operations. (13)
15. a) Define spanning tree. Explain Prim’s algorithm to find minimum spanning tree in the
connected graph with an example. (13)
(Or)
b) Describe and justify kruskal’s algorithm for finding minimum spanning tree for
undirected graph. (13)

Part -C (1*15=15)
16. a) Explain the various types of graph traversals with neat algorithms (15)
(Or)
b) Explain the concept of Topological sort algorithm with example (15)
SRI MUTHUKUMARAN INSTITUTE OF TECHNOLOGY
Chikkarayapuram, Near Mangadu Chennai -600 069
Academic Year 2023- 2024/Even Semester

Model Examination
Branch : AIDS first year Date:
Sub Code: AD 3251 Marks: 100
Subject : Data Structures and Design Time: 3.00 Hrs
Part – A (10*2 = 20)
1. What is python inheritance?
2. List the difference between shallow copy and deep copy.
3. Define Dqueue.
4. Define Stack.
5. What do you mean by linear probing & quadratic probing?
6. Write the disadvantages of separate chaining.
7. What are the various operation performed in the binary
search tree?
8. What are the different types of traversing?
9. State the difference between BFS and DFS.
10. What are the methods to solve minimum spanning tree? (13*5=65)
Part – B
11. a) Explain the commonly used different types of
asymptotic notations to calculate the running time (13)
complexity of an algorithm
(Or)
b) Explain about recurrence relation and master theorem (13)
12. a) Explain the operations of singly linked list and doubly linked lists (13)
(Or)
b) Write a python program for i)array implementation of lists & (6)
ii)linked list implementation of lists (7)
13.a) Write a python program for i)binary search & (7)
ii) linear search with suitable examples (6)
(Or)
b) How to implement merge sort? Explain with a suitable example. (13)
14.a) Write an algorithm for inserting & deleting a node in a binary search tree (13)
(Or)
b) Discuss in detail the various methods in which a binary tree can be represented.
Discuss the advantage and disadvantage of each method (13)
15.a) Explain the various types of graph representations (13)
(Or)
b) How to implement insertion sort? Explain it with a suitable example. (13)

Part -C (15*1=15)
16.a) What are the advantages and disadvantages of various collision resolution strategies? (15)
(Or)
b) Explain the Dijkstra algorithms for finding the shortest path in network with example (15)

You might also like