Question Bank

Program Name :- B.Tech in Computer Science/Robotics Engineering/Information Science,B.E in Computer Science/Information Science Semester :- III
Course Code:-10ABTEC22312 Course :- Data Structures using C++
Faculty Incharge:- M S Shobha/A Gnanasundari Difficulty Level :- Medium
SL.NO Module Questions
1 1 What is a data structure? Explain its importance in computer science. Medium
2 1 Differentiate between linear and non-linear data structures with examples. Medium
3 1 What are the basic operations that can be performed on data structures? Medium
4 1 Explain the concept of time and space complexity in the context of data structures. Medium
5 1 What is an array? Discuss its advantages and disadvantages. Medium
6 1 Describe the different types of linked lists and their applications. Medium
7 1 How does a stack work? Explain its operations (push, pop, peek) with real-world examples. Medium
8 1 What is a queue? Discuss its applications and how it differs from a stack. Medium
9 1 Explain the concept of trees and their different types (binary tree, binary search tree). Medium
10 1 What are graphs? Describe their representations (adjacency matrix, adjacency list) and applications. Medium
11 1 Explain the difference between linear search and binary search. Medium
12 1 What is the time complexity of bubble sort in the best, average, and worst cases? Medium
13 1 How does insertion sort work, and when is it considered efficient? Medium
14 1 Describe the divide-and-conquer strategy used in merge sort. Medium
15 1 Explain the pivot selection process in quicksort and its impact on performance. Medium
16 1 What is the space complexity of heap sort? Medium
17 1 Compare and contrast the stability of different sorting algorithms. Medium
18 1 How can you optimize the search process in a sorted array? Medium
19 1 Discuss the applications of searching and sorting algorithms in real-world scenarios. Medium
20 1 Explain the concept of lower bound for comparison-based sorting algorithms. Medium
21 2 What is a stack data structure? Explain the LIFO principle. Medium
22 2 What are the basic operations performed on a stack? Medium
23 2 How is a stack implemented using an array? Medium
24 2 What is the time complexity of push, pop, and peek operations in a stack? Medium
25 2 What are some real-world applications of stacks? Medium
26 2 Explain the concept of stack overflow and stack underflow. Medium
27 2 How can you implement a stack using a linked list? Medium
28 2 What is a postfix expression? How can you evaluate a postfix expression using a stack? Medium
29 2 Explain the difference between a stack and a queue. Medium
30 2 How can you reverse a string using a stack? Medium
31 2 What is a queue data structure? Explain its key characteristics. Medium
32 2 Differentiate between a queue and a stack. Medium
33 2 Describe the basic operations performed on a queue (enqueue, dequeue, peek, isEmpty). Medium
34 2 How can a queue be implemented in programming? Discuss common implementations (array-based, linked list-based). Medium
35 2 Explain the concept of a circular queue and its advantages over a linear queue. Medium
36 2 What are some real-world applications of queues? Medium
37 2 How can you implement a queue using two stacks? Medium
38 2 What is priority queue? How does it differ from a regular queue? Medium
39 2 Explain the concept of queue overflow and underflow. Medium
40 2 How can you determine if a given queue is empty or full? Medium
41 2 What is a linked list? Explain its basic structure and types. Medium
42 2 What are the advantages and disadvantages of linked lists compared to arrays? Medium
43 2 How do you traverse a singly linked list? Write pseudocode or code snippet. Medium
44 2 Explain the process of inserting a new node at the beginning, middle, and end of a singly linked list. Medium
45 2 How do you delete a node from a singly linked list? Consider cases for deleting the head, tail, and a node in between. Medium
46 2 What is a doubly linked list? How does it differ from a singly linked list? Medium
47 2 How do you implement a stack using a linked list? Explain the operations (push and pop). Medium
48 2 How do you implement a queue using a linked list? Explain the operations (enqueue and dequeue). Medium
49 2 What is a circular linked list? Explain its applications. Medium
50 2 How do you detect and remove a loop in a linked list? Medium
51 3 What is a tree data structure? Explain its key characteristics. Medium
52 3 Differentiate between a tree and a binary tree. Medium
53 3 Describe the different types of tree traversals (e.g., inorder, preorder, postorder). Medium
54 3 What is a binary search tree (BST)? How does it differ from a binary tree? Medium
55 3 Explain the concept of tree balancing and why it's important. Medium
56 3 What are some common applications of tree data structures? Medium
57 3 How would you implement a tree using a linked list? Medium
58 3 Describe the process of inserting and deleting nodes in a binary search tree. Medium
59 3 What are the time and space complexities of common tree operations? Medium
60 3 How can you determine if a given binary tree is a BST? Medium
61 3 What is a graph data structure? Explain its key components. Medium
62 3 Differentiate between a directed and an undirected graph. Medium
63 3 How are graphs represented in memory? Discuss adjacency matrix and adjacency list. Medium
64 3 What is a weighted graph? Provide a real-world example. Medium
65 3 Explain the concept of graph traversal. Discuss Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms. Medium
66 3 How can you detect cycles in a graph? Medium
67 3 What are some applications of graph data structures in computer science? Medium
68 3 Explain the Dijkstra's algorithm for finding the shortest path in a weighted graph. Medium
69 3 What is a minimum spanning tree? How is it different from a shortest path tree? Medium
70 3 Discuss the challenges and complexities involved in working with large graphs. Medium
71 4 What is a dictionary and how does it differ from a list? Medium
72 4 Explain the concept of linear list representation for dictionaries. What are its advantages and disadvantages? Medium
73 4 How does skip list representation improve upon linear list representation for dictionaries? Medium
74 4 Describe the insertion operation in a skip list. What is the time complexity of insertion? Medium
75 4 Explain the deletion operation in a skip list. What is the time complexity of deletion? Medium
76 4 How does searching work in a skip list? What is the average and worst-case time complexity of search? Medium
77 4 What is a hash table? How does it work? Medium
78 4 What is a hash function? What are the desirable properties of a good hash function? Medium
79 4 Explain the concept of collision in hash tables. Medium
80 4 Describe the collision resolution technique of separate chaining. What are its advantages and disadvantages? Medium
81 4 Explain the collision resolution technique of open addressing - linear probing. What are its advantages and disadvantages? Medium
82 4 Explain the collision resolution technique of open addressing - quadratic probing. What are its advantages and disadvantages? Medium
83 4 Explain the collision resolution technique of open addressing - double hashing. What are its advantages and disadvantages? Medium
84 4 What is rehashing? When is it necessary? Medium
85 4 Explain the concept of extendible hashing. How does it work? Medium
86 4 Compare the time complexity of search, insertion, and deletion operations in hash tables using different collision resolution techniques. Medium
87 4 Compare the space complexity of hash tables using different collision resolution techniques. Medium
88 4 Compare the performance of hash tables and skip lists in terms of average and worst-case search times. Medium
89 4 Discuss the applications of hash tables and skip lists in real-world scenarios. Medium
90 4 How can you choose the appropriate data structure (hash table or skip list) for a given problem? Medium
91 5 Define a Priority Queue. What are its key characteristics? Medium
92 5 Explain the Abstract Data Type (ADT) for a Priority Queue. What operations are supported? Medium
93 5 How does a Priority Queue differ from a regular Queue? Medium
94 5 What is a Heap? Explain the different types of Heaps (Max-Heap and Min-Heap). Medium
95 5 How can you represent a Heap using an array? Medium
96 5 Describe the process of inserting an element into a Max-Heap. Medium
97 5 Explain the process of deleting the maximum element from a Max-Heap. Medium
98 5 How can you implement a Priority Queue using a Heap? What are the advantages of this approach? Medium
99 5 What is External Sorting? Why is it necessary? Medium
100 5 Describe the basic model for External Sorting. Medium
101 5 What is Multiway Merge? How does it work? Medium
102 5 Explain the concept of k-way merging. Medium
103 5 How does Multiway Merge improve the efficiency of External Sorting? Medium
104 5 What is Polyphase Merge? How does it differ from Multiway Merge? Medium
105 5 Explain the concept of Fibonacci Heaps and their use in Priority Queues. Medium
106 5 How can you optimize the performance of External Sorting using techniques like buffering and double buffering? Medium
107 5 Discuss the time and space complexity of different Priority Queue implementations (e.g., Array-based, Heap-based). Medium
108 5 How can you handle dynamic changes in priorities in a Priority Queue? Medium
109 5 Give an example of a real-world application that utilizes Priority Queues. Medium
110 5 Compare and contrast the performance of Multiway Merge and Polyphase Merge in different scenarios. Medium