Scribd
Upload
22 views1 page

DS Set 1

The document is an exam paper for a Data Structures course covering topics like linear and binary search, stacks, linked lists, trees, and graphs. It contains 4 questions, with the first question being compulsory and covering topics like search algorithms, stacks, and insertion sort. The second question covers linked lists and their operations. The third question covers B-trees, AVL trees, and binary search trees. The fourth question allows students to choose two of three subquestions covering directed graphs, graph search algorithms, and graph types.

Uploaded by

Master Arron
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
22 views1 page

DS Set 1

The document is an exam paper for a Data Structures course covering topics like linear and binary search, stacks, linked lists, trees, and graphs. It contains 4 questions, with the first question being compulsory and covering topics like search algorithms, stacks, and insertion sort. The second question covers linked lists and their operations. The third question covers B-trees, AVL trees, and binary search trees. The fourth question allows students to choose two of three subquestions covering directed graphs, graph search algorithms, and graph types.

Uploaded by

Master Arron
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

D.Y.

PATIL COLLEGE OF ENGINEERING & TECHNOLOGY


KASABA BAWADA KOLHAPUR-416006 Q. Paper Code:
23SYCS204304
(An Autonomous Institute)
S. Y. B. Tech (CSE), Sem-III Set-: I
END SEMESTER EXAMINATION, Jan – 2023.
Course Name: Data Structure, Course Code:201CSL204.
Day and Date: Monday 23/1/2022. Seat No:
Time: 10.00am to 12.00 pm. Max. Marks- 50
Instructions:
i. Question No. 1,2 & 3 is compulsory.
ii. Figure to the right indicate full marks.

BT CO’s Q. No. Marks


Q.1 All Questions are compulsory 20
1.2 CO2 a Compare working of linear and binary search 5M
1,2 CO1 b Describe data structure with its all types and explain all the 8M
operations of stack.
3 CO3 c Write a program for insertion sort. 7M

Q.2 All Questions are compulsory 10


1,2 CO3 a Explain types of linked list with the help of example. 3
3 CO3 b Write an algorithm or pseudo code for insertion at beginning and 7
deletion at end of singly linked list.
OR
Write an algorithm or pseudo code for insertion at end and deletion
at beginning of singly linked list.

Q.3 All Questions are compulsory 10


3 CO4 a What are B- trees? Construct B tree of order 5 for the list of 5
elements given as follows
1,7,6,2,11,4,8,13,12,5,19,9,18,24,5,12,14,20,21
OR
What is AVL tree? Write all the rotation operations of it.
3 CO4 b Construct Binary Search Tree of following data and apply all the 5
tree traversal techniques on that tree.
Data:- 11,6,8,19,4,10,5,17,43,49,31,60

Q.4 Attempt any two out of three questions 10


3 CO4 a Draw the picture of the directed graph specified below: 5
G=(V,E)
V(G)={1,2,3,4,5,6}
E(G)={(1,2),(2,3),(3,4),(5,1),(5,6),(2,6),(1,6),(4,6),(2,4)}
Obtain the following from the directed graph:
i)Adjacency matrix
ii) Adjacency list
1,2,3 CO3 b Explain any one following term of Graph with help of suitable 5
example.
i) Breadth First Search
ii) Depth First Search
1,2 CO3 C What is graph? Explain all types of graph with the help of example. 5

*************

You might also like