Scribd
Upload
37 views

Data Structure QB

Uploaded by

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

Data Structure QB

Uploaded by

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

MUMBAI UNIVERSITY STUDENTS ASSOCIAATION (MUSA)

QUESTION BANK OF ENGINEERING DATA STRUCTURE


S.E SEM-III BRANCH: COMPS/AIML/CSE DS FOR WINTER SESSION – NOVEMBER 2024

Q.1) Explain various types of data structure with example.


Q.2) Explain ADT with an example.
Q.3) What is topological sort? Explain topological sort with an example.
Q.4) Explain various graph representation techniques and define graph.
Q.5) Explain different case for deletion of a node in binary search tree.
Q.6) Explain different operation that can be performed on data structure.
Q.7) Explain the advantages of circular queue over linear queue OR Circular queue
overcomes disadvantages of linear queue.
Q.8) Explain double ended queue. Explain its types.
Q.9) Differentiate between the following:
i) Linear and Non-linear data structure.
ii) B tree and B+ tree.
Q.10) Explain or Write a short note on: (vvimp)
i) Binary search tree.
ii) Priority Queue with example.
iii) Depth first search (DFS) transversal with example.
iv) Hashing and collision.
Programming
Q.1) Write a function in C to count the number of nodes in (Singly and Doubly Linked
List)
Q.2) Write a C program to perform the operation on Singly linked list:
i) Insert a new node at the end of the list.
ii) Delete a node from the beginning of the list.
iii) Search for a given node.
iv) Display the list
Q.3) Write a C program to implement the operation on (Circular Linked list):
i) Delete a node after given node.
ii) Find node with smallest data value
iii) Display the list
iv) Insert a node at the end of the list.
Q.3) Write a C program to stimulate linear queue as a linked list.
Q.4) Write a c program for infix and postfix conversion.
Q.5) Write a program in C to implement queue ADT using linked list.
Numerical
Q.1) Apply linear probing and quadratic probing (Hashing). Show No. of collision.
(imp)
Q.2) Construct AVL tree for the following elements. (imp)
Q.3) Construct Huffman tree. (imp)
Q.4) Construct Binary search tree, to the given following sequence.
Q.5) Construct B and B+ tree of tree order of 3 (imp)
Q.6) Show BFS traversal for the following graph with all the steps.
Q.7) Write the steps for topological sorting for the following graph.
Q.8) Evaluate Postfix Evaluation for the expression. (imp)

*****ALL THE BEST*****

You might also like