Scribd
Upload
14 views1 page

Dsa Imp Questions

The document outlines a series of questions related to data structures, covering topics such as stacks, queues, linked lists, trees, and sorting algorithms. It includes explanations of operations like push and pop for stacks, types of queues, and algorithms for linked lists and binary search trees. Additionally, it discusses various sorting methods and hashing, along with their efficiencies.

Uploaded by

anshulkhandelwal2217
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
14 views1 page

Dsa Imp Questions

The document outlines a series of questions related to data structures, covering topics such as stacks, queues, linked lists, trees, and sorting algorithms. It includes explanations of operations like push and pop for stacks, types of queues, and algorithms for linked lists and binary search trees. Additionally, it discusses various sorting methods and hashing, along with their efficiencies.

Uploaded by

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

Unit -1

Q1. What do you mean by stack ? explain push and pop operation. (12)
Q2. Stack expression infix to prefix or postfix. (2/4)
Q3. What is queue ? explain types of queue and its operations or implementation any DS.
/only one queue explain. (12, 2022).
Q4. Explain different types of operation perform on data structure / its types. (12,4)
Q5. Explain array with a program / efficiency of algorithm. (4)

Unit-II
Q1. Explain circular linked list. Write an algorithm insert and delete node at a specific position/ at end. (12)
Q2. Explain doubly linked list. Write algorithms on all operation perform on it. (12)
Q3. What is linked list? explain list represent. ( 4)
Q4. Anyone linked list application (2,4).
Q5. Different between doubly and circular linked list. (4)

Unit-III
Q1. Explain tree terms like node, root, sibling, subtree, edge . (2,4).
Q2. Explain binary tree? Write an algorithm/process for insert and delete node in binary search tree. (12)
Q3. Sequence tree travel in given order / make binary search tree of values. (4, 12)
Q4. Explain tree traversals and search? (12)
Q5. Write Huffman’s algorithm? Explain with example? (12)

Unit-V
Q1. What is binary search? Write an algorithm for binary search . (12 0r 10%).
Q2. What is quick/merge sort? Explain with example and write an algo. { cpp #code} (12 90%)
Q3. What is difference b/w binary search and sequence search. (4)
Q4. Write short notes heap, bubble, insertion, selection sort. (4)
Q5. What is hashing. / Any algorithm efficiency (2,4)

You might also like