Scribd
Upload
19 views1 page

DSA Model Exam

Uploaded by

hod
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
19 views1 page

DSA Model Exam

Uploaded by

hod
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/ 1

REG. NO.

PMC/IT/frm -06
PMC/MOD/
IT/3/5/6

DEPARTMENT OF INFORMATION TECHNOLOGY


MODEL EXAMINATION
PUCS3PC03 & DATA STRUCTURES AND ALGORITHMS
YEAR/SEMESTER- II / III
Date: 05.12.2024 Duration: Max.Marks:
3Hours 100
Answer all the Questions
PART - A (10*2=20)
1 Difference between array-based and linked list implementation of lists? CO1 Remember
2 What is a stack? Name two stack operations. CO1 Understand
3 List the types of tree traversals. CO2 Understand
4 What are the properties of a Binary Search Tree? CO2 Understand
5 Differentiate between directed and undirected graphs. CO3 Remember
6 Differentiate between BFS and DFS. CO3 Remember
7 Define asymptotic notations and explain their types. CO4 Understand
8 How do you analyze a recursive algorithm? CO4 Analyze
9 What is the analysis of sorting algorithms? CO5 Understand
10 What are Load Factors and Rehashing in Hashing? CO5 Understand
PART B (5*16=80)
11 a. Explain how a circular linked list works. What are its applications? CO1 Understand
OR
b. Explain the operations of Queue ADT. How does it differ from Stack ADT? CO1 Understand
12 a Describe the operations on a heap and its applications. O2 Remember
OR
b What is a Binary Search Tree (BST)? Explain its properties. CO2 Remember
13 a. Explain topological ordering and its algorithm and the principle of greedy
CO3 Understand
algorithms with an example.
OR
b. Differentiate between Prim’s and Kruskal’s algorithms for Minimum
CO3 Understand
Spanning Trees (MST).
14 a. Define asymptotic notations and explain their types. Explain the difference
between worst-case and average-case analysis . OR CO4 Analyze
b. What is divide and conquer? Give an example. What is recursion? Explain Analyze
CO4
with an example.
15 a. Analyze the time complexities of various sorting algorithms (Bubble Sort,
CO5 Understand
Selection Sort, Insertion Sort, Merge Sort, Quick Sort)..
OR
b. Describe collision handling techniques in hashing. CO5 Understand

Prepared by Verified by Approved by


(QP Prepared) (Department Exam cell) (HOD)

Page 1 of 1

You might also like