Scribd
Upload
630 views2 pages

DSA Model QUESTION PAPER

The document outlines a model exam for the Data Structures and Algorithms course at Thiruvalluvar College of Engineering and Technology. It includes various questions divided into three parts, covering topics such as algorithms, data structures, sorting techniques, and graph representations. The exam is scheduled for November 19, 2024, with a total of 100 marks.

Uploaded by

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

DSA Model QUESTION PAPER

The document outlines a model exam for the Data Structures and Algorithms course at Thiruvalluvar College of Engineering and Technology. It includes various questions divided into three parts, covering topics such as algorithms, data structures, sorting techniques, and graph representations. The exam is scheduled for November 19, 2024, with a total of 100 marks.

Uploaded by

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

THIRUVALLUVAR COLLEGE OF ENGINEERING AND TECHNOLOGY

Ponnur Hills vandavasi 604 505


Department of CSE &AIML
Date: 19.11.2024 MODEL EXAM Time: 9.30am To 12.30pm
SEM / Year: III / II Max Mark: 100
CD3291-DATA STRUCTURES AND ALGORITHMS
Part A Answer All the Questions 10X2 = 20

1. Define an algorithm. List some essential properties of algorithm.


2. Write about recursion.
3. Identify the data structures to represent Stack.
4. List out the advantages of circularly linked list.
5. Compare bubble sort and Insertion sort in term of time complexity.
6. Differentiate between linear search and binary search.
7. Define B-tree .list its properties.
8. Write about the AVL tree.
9. Write the steps required to construct the minimum spanning tree.
10. What is bi-connected graph? Give an example.

Part B Answer All the Questions 5X13 = 65

11. (a)Discuss in detail about different classification of algorithms.


(13)
OR
(b)Elaborate about the asymptotic notations with appropriate examples. (13)
12. (a) Explain the insertion operation in linked list. How nodes are inserted after a specified node
(13)
(OR)
(b) Explain Stack ADT and its operations. (13)
13. (a) Discuss the common collision resolution strategies used in clothing hashing system.
(13)
(OR)
(b) Writye in algorithm to implement insertion sort with suitable example (13)
14. (a) How to insert and delet an element into a binary search tree and write down the code for the
insertion routine with example.
(13)
(OR)
(b) Describe the algorithms used to perform single and double rotation on AVL tree.
(13)
15. Explain the various representation of graph with example in detail.
(13)
(OR)
(b) Write an algorithm for Greedy approach and give one real time example. (13)
Part C Answer the Question 1X15=15

16. (a) Construct an expression tree for the expression (a+b*c)+((d*e+1)*g).Give the output when you
apply preorder,inorder and postorder traversals.
(15)
(OR)
(b) Construct the minimum spanning tree(MST) for the given graphs using Prim’s Algorithm. Find the Cost of
Minimum Spanning Tree. (15)

You might also like