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 Describe the classification of data structures with a neat diagram. Medium
2 1 Explain the bubble sort algorithm and the steps to implement it. How does it work? Medium
3 1 Explain the selection sort algorithm. How does it work? Medium
4 1 Describe the common time and space complexity notations (Big O, Big Omega, Big Theta) Medium
5 1 Summarize the merge sort algorithm.Use the same to sort the following elements :-30,15,42.27,83,55,73,67 . Medium
6 1 Compare bubble sort, selection sort, and insertion sort. Analyse their time and space complexities . Medium
7 1 Explain the concept of heap sort. Implement a heap sort algorithm and analyse its time and space complexity. Medium
8 1 Interpret when would you use linear search over binary search? Medium
9 1 Outline the different pivot selection strategies ,how it affect the performance of quick sort. Medium
Illustrate the dynamic memory allocation functions in detail. Also Give any two difference between i)static memory
allocation and dynamic memory allocation. ii)malloc() & calloc().
10 1 Medium
11 1 Outline the time complexity of linear and binary search in best, average, and worst cases? Medium
12 1 Explain the difference between best-case, average-case, and worst-case time complexity. Medium
13 2 Outline the algorithm for PUSH and POP operations. Medium
Summarize the steps for infix to postfix conversion. Discuss the same to convert the following expressions to postfix (i)(A-B*C-D)/(E+F)
14 2 (ii) ((A+B)*C-(D-E)^(F+G)) Medium
15 2 With neat diagrams explain different types of queues. Also list out various applications of queue. Medium
16 2 Examine how to implement basic operations on a Linear Queue using a C++ program Medium
Define the following
i)Binary Tree
ii)Complete Binary Tree
iii)Level of a tree
iv)Binary Search Tree
v)Depth of a Tree
17 2 Medium
Demonstrate using a C++ function the following tree traversal techniques and derive the same for the below tree i)inorder ii)preorder iii)postorder.

18 2 Medium
19 2 Summarize what is a binary tree?State its Properties. Describe its representation using arrays and linked list. Medium
Construct a binary tree from the traversal order given below: Pre-order = A B D E F
CGHLJK In-order = D B F E A G C L J H K
20 2 Medium
21 2 Define threaded binary tree and explain right in and left in threaded binary trees. Medium
22 2 Describe the different types of linked lists. List the basic operations carried out in a linked list. Medium
23 2 Differentiate between linked list and arrays. Medium
Illustrate the following operations in doubly linked list with functions. (i) Insert new node at the
beginning of the list
24 2 (ii) Delete the last node Medium
25 3 Define a priority queue. What are its primary operations? Medium
26 3 Explain how a heap can be used to implement a priority queue. Medium
27 3 Explain the heapify operations. How are they used in insertion and deletion operations in a heap-based priority queue? Medium
28 3 Interpret what is a min-heap and a max-heap? Medium
29 3 Summarize external sorting? Why is it necessary when dealing with large datasets that cannot fit entirely in main memory? Medium
30 3 Explain the concept of a multiway merge. How does it work in the context of external sorting? Medium
31 3 Describe the polyphase merge algorithm. How does it differ from a simple multiway merge? Medium
32 3 Summarize the different types of linked lists? Medium
33 3 Explain the concept of a binary search tree (BST) with a suitable example. Medium
34 3 Write an algorithm to find the height of a binary tree Medium
Explain the advantages and disadvantages of using a linked list for implementing a queue compared to an array-based implementation
35 3 Medium
36 3 Discuss the advantages of using a circular queue over a linear queue. Medium
37 4 Illustrate what is a skip list? How does it differ from a traditional linked list? Medium
38 4 Interpret How does the level of a skip list affect its performance. Medium
39 4 Summarize the advantages and disadvantages of using skip lists compared to other data structures like balanced trees? Medium
40 4 Explain the operatins on a Skip list with example Medium
41 4 Illustrate what is a hash function?What are the key properties of a good hash function? Medium
Explain the concept of hash collisions in detail. Describe two common techniques used to resolve hash collisions, providing examples for each.
42 4 Medium
43 4 Compare separate chaining and open addressing as collision resolution strategies. Medium
Consider a hash table with a fixed size of 10 and a hash function that maps integers to indices in the range 0 to 9. If the following keys are inserted: 12,
25, 37, 41, 53, 68, 79, 82, 94, 101. Demonstrate the insertion process using separate chaining

44 4 Medium
Consider a hash table with a fixed size of 10 and a hash function that maps integers to indices in the range 0 to 9. If the following keys are inserted: 12,
25, 37, 41, 53, 68, 79, 82, 94, 101. * Demonstrate the insertion process using open addressing (linear probing). Medium
45 4
46 4 Discuss the two primary techniques used to resolve hash collisions: Medium
47 4 Discuss different probing techniques (linear, quadratic, double hashing). Medium
48 4 Explain the step-by-step process of inserting a new node into a skip list. Medium
Compute for the given data a Binary Search Tree and draw the array and Linked List representation of the same. 100 85 45 55 110 20
49 5 70 65 Medium
Construct a AVL tree for the following data performing necessary rotations if required
50 5 21,26,30,9,4,14,28,18,15,10 Medium
51 5 Summarize what is a B-Tree and its properties Medium
Explain the concept of B-trees with their structure and properties. Discuss their advantages over other tree structures like binary search trees.
52 5 Medium
53 5 Describe the insertion algorithm for B-trees. Illustrate the process with an example. Medium
54 5 Explain the basic operations performed on a Binary Search Tree (BST) with code snippet: insertion, deletion, and searching. Medium
Define the following graph terminology with examples:i)Vertex ii)Edge iii)Degree of vertex iv)Path v)Weighted and Unweighted Graph
55 5 Medium
56 5 Describe the difference between a tree and a graph data structure Medium
57 5 Explain the Depth-First Search (DFS) algorithms for traversing graphs. Medium
58 5 Explain the Breadth-First Search (BFS) algorithms for traversing graphs. Medium
Perform the BFS and DFS for the following graph (with the steps)

59 5 Medium
60 5 Describe the applications of trees and graphs in various fields. Medium