Scribd
Upload
2 views3 pages

Mid II Dsa Important

The document outlines various data structures and algorithms, including doubly linked lists, circular linked lists, binary trees, AVL trees, B-trees, and sorting algorithms like Quick Sort and Insertion Sort. It provides algorithms for inserting and deleting nodes in these structures, as well as comparisons between different tree types and sorting methods. Additionally, it discusses hash functions and collision resolution techniques in hashing.

Uploaded by

subbu
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
2 views3 pages

Mid II Dsa Important

The document outlines various data structures and algorithms, including doubly linked lists, circular linked lists, binary trees, AVL trees, B-trees, and sorting algorithms like Quick Sort and Insertion Sort. It provides algorithms for inserting and deleting nodes in these structures, as well as comparisons between different tree types and sorting methods. Additionally, it discusses hash functions and collision resolution techniques in hashing.

Uploaded by

subbu
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/ 3

1. What is a doubly linked list?

Present the algorithms used to insert and delete nodes in


such a list.

2. Outline the steps involved in inserting and deleting a node in a circular linked list.
Provide the algorithm for each operation.

3. Describe priority queue operations with neat example

4. Implement python program to perform circular linked list


5. Explain circular linked list concept with an example. How does it differ from
regular singly linked list?
6. Write an algorithm to insert and delete a node at end in doubly linked list.
7. Write the algorithm for inserting an element at the end of a doubly linked list.
Implement this algorithm in Python and analyze its complexity.
8. Describe the algorithm for inserting an element at the beginning of a singly linked list.
Implement this algorithm in C .

UNIT 4

1. Describe the structure and properties of a binary tree. What are the key differences
between a binary tree and a binary search tree.
2. Explain the concept of an AVL tree. Describe how it maintains balance and the types of
rotations used to keep the tree balanced with suitable example
3. Detail the procedures for inserting and deleting nodes in a B+ tree, using an example to
demonstrate each operation.
4. List and differentiate the three standard tree traversal methods: inorder, preorder, and
postorder.
5. What is a B-tree? Explain how insertion and deletion are handled, supported by suitable
examples
6. Constract an algorithm for DLL.
7. Construct a binary search tree(BST) for the following sequence of numbers
50,70,60,20,90,10,40,100,85,66,78 and Explain the various deletion operations in BST.
8. Illustrate the properties of binary tree?
9. Construct a AVL Tree for the following sequence 21,26,30,9,4,14,28,18,15,10,2,3,7
10. Explain binary tree traversals with example.
11. Define a tree. Explain the concepts of height and depth of a tree with examples.
12. What is Binary Search Tree? Construct a binary search tree for the data.
S={13,3,4,14,10,5,1,8,2,7,9,11,6,18}
13. Build a Binary Tree for the given In-order and Pre-order
In-order : D → B → E → A → F → C → G
Pre-order :A → B → D → E → C → F → G
14. Explain AVL tree with an example.
15. Generate a B-Tree of order 3 for the following key values: 25,10,12,15,39,64,53
16. Differentiate between B-Trees and B+Trees with examples.
17. Construct a Binary tree for the given In-order an Pre-order .
In-order:D,B,E,A,F,C,G
Pre-order:A,B,D,E,C,F,G
18. Compare and contrast B-trees and B+ trees. Discuss their applications in database systems
and file systems.

UNIT 5

1. Explain the Quick Sort algorithm. Provide average, best and worst-case time complexities
and also Quick Sort compare to Merge Sort?
2. Explain the role of a hash function in hashing. Describe the collision resolution techniques
with examples
3. What is Insertion Sort, and how does it differ from Bubble Sort? Discuss its best, average-
case and worst time complexity.
4. Explain the basic concept of Selection Sort. Provide time complexity in the best case,
average and worst-case scenario
5. Design and implement a graph traversal using Depth-First Search (DFS). Compare it with
Breadth-First Search (BFS) in terms of strategy and use cases
6. Implement c program to perform selection sort
7. Explain how to sort elements by using bubble sort from the list of elements
42,16,84,12,77,26,53
8. Define collision and describe the various collision resolution techniques with neat example
9. Draw DFS and BFS for the below graph

10. Implement c program to perform insertion sort.


11. Design a C or python program to sort the elements using heap sort technique.
12. Illustrate hashing. Explain hash table and different types of hash functions with examples.
13. Explain Collision Resolution Techniques with examples.
14. Define graph. Explain graph traversals with examples.
15. A hash table of length 10 uses open addressing with hash function h(k)=k mod 10 and
linear probing.After inserting 6 values (42,23,52,13,15,16) into an empty hash table,then
show the status of the table.
16. Implement Insertion sort in Python. Analyze the performance in best, worst, and average
cases.
17. Explain basic graph terminologies such as vertex, edge, adjacency list, and adjacency
matrix.
18. Explain the Quick Sort algorithm with example.
19. Implement Insertion sort in Python. Analyze the performance in best, worst, and average
cases.

You might also like