Scribd
Upload
8 views3 pages

CP4161 1

Uploaded by

saranyacse.1987
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
8 views3 pages

CP4161 1

Uploaded by

saranyacse.1987
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/ 3

M.

E PRACTICAL END SEMESTER EXAMINATIONS NOV/DEC 2024

College Code & Name : 5117 & Pallavan College of Engineering


Sub Code & Name : CP4161 & Advanced Data Structures & Algorithm Laboratory
Sem & Year : I Sem & I Year M.E.CSE
Date & Session : 21.02.24 & FN

Time : 3 Hours Answer any one Question Max. Marks 100


Viva-
Aim/Algorithm Program Results Record Total
Voce
30 25 25 10 10 100

1. (a)Write and execute a C++ program that uses recursive function for tree traversal.

(b)Write and execute a C++ program for implementing the traversal algorithm for Breadth first
search.
(a) Write and execute a C++ program that uses iterative function for tree traversal.
2.
(b) Write and execute a C++ program for implementing the traversal algorithm for Depth first
search.

3. (a) Write and execute a C++ program that uses recursive function for generating Fibonacci
series.

(b) Write and execute a C++ program for implementing Merge sort
(a) Write and execute a program that uses iterative function for generating Fibonacci series.
4.
(b) Write and execute a C++ program for implementing Quick sort

Write and execute a program for Binary Search Tree to implement following operations:
5.
a. Insertion
b. Deletion
i. Delete node with only child
ii. Delete node with both children
c. Finding an element
d. Finding Min element
e. Finding Max element
f. Left child of the given node

Page 1 of 3
g. Right child of the given node
h. Finding the number of nodes, leaves nodes, full nodes, ancestors, descendants
Write and execute a program to implement Red-Black trees with insertion and deletion operation
6.
for the given input data.

Write and execute a program to implement Make_Heap, Insertion, Find_Min, Extract_Min,


7.
Union, Decrease_Key and Delete_Key operations in Fibonacci Heap for the given data as
Student structures (contains student_name, student_roll_no, total_marks), with key as student_
roll no.

Write and execute a program to generate minimum spanning tree in a connected, undirected
8.
weighted graph using Prims algorithm.
(a)Write and execute a program for implementing the traversal algorithm for Breadth first search
9.
(b) Write and execute a program for implementing Quick sort

10. Write and execute a program to implement Dijkstra’s algorithm for single-source shortest path in
a weighted directed graph
Write and execute a program to find single-source shortest path in a weighted directed graph
11.
using BellmanFord algorithm
Write and execute a program to generate minimum spanning tree in a connected, undirected
12.
weighted graph using Kuruskal’s algorithm with disjoint set data structures.
Write and execute a program to implement Matrix Chain Multiplication
13.

14. Write and execute a program to implement Huffman Coding


Write and execute a C++ program to perform the following operations: a) Insert an element into
15.
a binary search tree. b) Delete an element from a binary search tree. c) Search for a key element
in a binary search tree.

16. Write and execute a program to implement Activity Selection problem.

Write and execute a program to implement Make_Heap, Insertion, Find_Min, Extract_Min,


17.
Union, Decrease_Key and Delete_Key operations in Heap for the given data as Student
structures (contains student_name, student_roll_no, total_marks), with key as student_ roll_no.
Write and execute a program that uses recursive function for tree traversal and Fibonacci
18.
sequence generation.

Page 2 of 3
19. Write and execute a program that uses iterative function for tree traversal and Fibonacci
sequence generation.

20. Write and execute a program for implementing the following traversal algorithm

(i) Breadth first search

(ii) Non recursive Tree traversal (Inorder,Preorder,Post order)

INTERNAL EXAMINER EXTERNAL EXAMINER

Page 3 of 3

You might also like