Scribd
Upload
5 views

Question Bank

The document outlines a comprehensive curriculum on data structures and algorithms, divided into five modules covering topics such as recursion, dynamic arrays, linked lists, hashing, trees, graphs, and pattern matching. Each module includes specific questions and tasks that require explanations, comparisons, and algorithm implementations related to the respective topics. The content is designed to enhance understanding of fundamental concepts and practical applications in computer science.

Uploaded by

pranayaalluri5
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Question Bank

The document outlines a comprehensive curriculum on data structures and algorithms, divided into five modules covering topics such as recursion, dynamic arrays, linked lists, hashing, trees, graphs, and pattern matching. Each module includes specific questions and tasks that require explanations, comparisons, and algorithm implementations related to the respective topics. The content is designed to enhance understanding of fundamental concepts and practical applications in computer science.

Uploaded by

pranayaalluri5
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Module-1

1. What is recursion, and how does it differ from iteration in programming?


2. How does a dynamic array manage its memory allocation compared to a static array?
3. Explain about the implementation of stack operations using linked lists.
4. What is a linked list? Specify the difference between singly, doubly and circular linked lists.
5. What is a LIFO data structure?
6. Compare the advantages and disadvantages of low-level arrays, referential arrays, compact arrays,
and dynamic arrays in terms of time complexity, space complexity, and usage scenarios with proper
examples.
7. Give the sketch to array representation of queue data structure and mention its advantages over
stack data structure. Also, write the algorithms for the operations on queues.
8. Compare static allocation and dynamic allocation
9. Demonstrate your understanding of double ended queue. Write algorithms for both insertion and
deletion.
10. What do you mean by Heap Order Property?

Module-2

1. In hashing, what is the load factor, and how does it impact the performance of a hash
table?
2. What is the primary purpose of a map or dictionary data structure?
3. What do you mean by a hash table and a hash function? Explain the following hash functions with
an example (i) Division method (ii) Mid square (iii)Digit analysis(Digit folding method)
4. What do you mean by collision and how can you handle it by using linear probing.
5. What is hashing? Why do collisions take place in hashing? Explain different techniques in brief to
handle it with examples.
6. Explain the basic idea behind extendible hashing. How does extendible hashing handle collisions
discuss this with an example.
7. Demonstrate what is double hashing is and how it attempts to reduce collision in a hash table.
8. Explain the about skip lists in detail with an example
9. What are Hash functions? List some techniques that are used to implement Hash functions.
10. What is rehashing?
11. What do you mean by hashing? Why do we need it?
12. Following elements are inserted into an empty hash table with hash function f(x) = x% 13 and
linear probing 112, 44, 52, 45, 37, 278, 89, 28, 61,249
a) Draw the hash table for each insertion.
b) What is the load factor after last insertion?
c) What is the maximum number of buckets examined in an unsuccessful search
13. Compare Closed hashing Vs Open hashing.
14. What are the methods used to represent Dictionary?
Module-3
1. Discuss the Splay Tree and its rotations.
2. Construct an AVL Tree and show each step diagram for the following data. 20, 34, 55, 45, 67, 89,
56, 88
3. Discuss B-Tree with an example of at least 8 data and order (m) of 5.
4. Construct a Red-Black Tree and show each step for the following data.20, 34, 55, 45, 67, 89, 56,
88
5. Compare between B-Tree a binary tree?
6. Compare and contrast AVL trees, Splay trees, and Red-Black trees as balanced search tree data
structures.
7. List all B-Tree properties. Show the step-by-step process to insert keys 6, 15,17,18 in the B-tree.
8. Explain the significance of the 'order' (m) in a B-Tree with example.
9. Write short notes 2-3 trees.
10. What is an AVL search tree? How do we define the height of it?Explain the balance factor
associated with a node of an AVL tree.
11. What is the maximum number of nodes in an AVL tree of a given height h?
12. What is a height balanced tree? How rebalancing is done in a height balanced tree?

Module-IV
1. What is spanning tree? Explain with an example.
2. Write an algorithm to perform insertion of 2-3 tree.
3. Discuss an adjacency list representation of the undirected graph with an example.
4. Compare and contrast Prim-Jarnik's Algorithm and Kruskal's Algorithm for finding the
minimum spanning tree in a graph. Discuss their underlying principles, data structures used,
and how they ensure the optimality of the resulting spanning tree. Evaluate their time and space
complexity.
5. Explain the concept of Directed Acyclic Graphs (DAGs) and their significance in modeling
various real-world scenarios. Discuss the properties of DAGs that distinguish them from
general graphs, such as absence of cycles and topological ordering.
6. What is an Acyclic graph?
7. List applications of prim’s algorithm.
8. Explain the concept of external sorting and discuss why it is necessary for handling large
datasets that do not fit into memeory.
9. How to optimize the union and find operations?
10. Explain the disjoint set operations in detail.
11. Differentiate the multiway merge and polyphase merge.
12. Describe k-way merge sort with an example.

Module-V
1. Construct a Trie for the following String S={cat,bat,ball,rat,cap,be}.
2. Explain Knuth-Morris-Pratt algorithm.
3. What is Pattern Matching? Briefly describe compressed trie.
4. What is 2-3 tree? How is it better than other search trees? Construct a 2-3 B tree
for the list C, O, M, P, U, T, I, N, G.
5. Explain the main features of Boyer-Moore algorithm.
6. What are the applications of pattern matching algorithm?
7. List the advantages and disadvantages of Tries.
8. Which pattern matching algorithm scans the characters from right to left? Explain it with
suitable example.
9. Describe the primary operations of Tries.
10. Discuss the Compressed Tries and construct the Compact representation of the compressed
trie with suitable example.

You might also like