Scribd
Upload
23 views4 pages

Dsa Paper

The document is an exam paper for a Data Structures and Algorithms course. It contains 7 questions in Section A and asks students to attempt 4 out of 6 questions in Section B. The questions cover topics like binary search trees, sorting algorithms, linked lists, stacks, tree traversals, minimum spanning trees, hashing, heaps, AVL trees, B-trees and more.

Uploaded by

Shazia Siddiqui
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
23 views4 pages

Dsa Paper

The document is an exam paper for a Data Structures and Algorithms course. It contains 7 questions in Section A and asks students to attempt 4 out of 6 questions in Section B. The questions cover topics like binary search trees, sorting algorithms, linked lists, stacks, tree traversals, minimum spanning trees, hashing, heaps, AVL trees, B-trees and more.

Uploaded by

Shazia Siddiqui
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/ 4

JAMIA HAMDARD

Department of Computer Science & Engineering


School of Engineering Sciences & Technology
New Delhi-110062

Even Semester Examination 2021

Paper Name: Data Structures & Algorithms Paper Code: MCA 202

Total marks: 75 Total Time: 3 hr.

SECTION A
All questions are compulsory. 7×5=35marks

Ques 1. Draw the binary search tree by inserting the following data arriving in sequence –

152, 40,78, 17, 29, 100, 80, 50, 88, 126

(a) Write the algo to search for the node “88” in this tree
(b) Delete node “40” and draw resultant tree

Ques 2. What is insertion sort? Write the algorithm and include an example.

Ques 3. What is a Linked list? How is insertion and deletion done in a linked list?

Ques 4. Define stack. What are its applications? On a stack following operations are done. What
will be the resultant stack?
Push(‘A’)
Push(‘T’)
Push(‘M’)
Pop()
Push(‘Q’)
Push(‘R’)
Push(‘K’)
Pop()
Pop()

Ques 5. Write the inorder, pre order and post order traversal for the tree
Ques 6. What is a spanning tree? What is minimum spanning tree and how to create it?

Ques 7. Show the trace of the Merge sort algorithm for the following data:
51, 14, 27, 10, 72, 39, 3, 54, 62, 17, 56
SECTION B

Attempt any Four questions. 4 X 10 = 40 marks

Ques 1. What is the Dijsktra Algorithm? Apply Djisktra algorithm to the graph in the figure

Ques 2. (a) What is hashing and why is it used? Explain the purpose of a hash function and hash

table.

(b) What is heap tree? How is sorting done using it? Explain with example

Ques 3. (a)Explain in detail AVL tree with example

(b)In the following AVL tree add a node ‘A’ then in the resultant tree delte node ‘V’
Ques 4. Find out the minimum spanning tree for the following graph using Prim’s algorithm.
Show all the steps.

Ques 5. (a) Convert the expression A+(B^C*D) *M /E-(N*(G-H+K)) into Postfix using stack.

(b) Evaluate the postfix expression

2536+**5/2-

Ques 6. (a) What is B-Tree? How is it different from B+ tree?

(b) Insert the following keys in the order shown below into an initially empty B-tree of order 3

B, S, M, L, A, Q, J, W, X, P, C, V, R, T

You might also like