Data Structures Question Bank ESE

1 A Provide two examples of ADTs and briefly describe their operations.

2 A Explain the concept of "traversal" in data structures. How does it differ when applied
to linear data structures versus nonlinear data structures?

3 A What is the difference between a one-dimensional array and a two-dimensional array?

4 A What is an array of pointers? Give an example of how it is used in C

5 A Explain how the array implementation of a stack works. What is the role of the 'top'
variable in this implementation?

6 A Convert the following infix expression to postfix: (A + B) * (C - D). 7 A How does

the circular queue overcome the limitations of a linear queue? 8 A What is a priority

queue? How does it differ from a regular queue?

9 A what are the advantages of using linked lists over an array? 10 A

What is a circular linked list?

11 A What is the basic structure of a node in a singly linked list?

12 A Describe how the enqueue operation works in a queue implemented using a singly
linked list.

13 A What is a binary tree?

 14 A What is the key property of a Binary Search Tree (BST) regarding the
arrangement of its nodes?

15 A What are the four types of rotations used in AVL trees to maintain balance?
16 A Describe the structure of a B+ tree and explain how it differs from a B-tree in terms of
data storage and retrieval.

17 A Define a graph, and how is it typically defined?

18 A Enlist 4 applications of graph.

19 A Describe the primary data structure used in the DFS algorithm? 20 A

Describe the primary data structure used in the BFS algorithm?

21 A Define the basic idea behind the selection sort algorithm ? 22 A

Define Linear Search.Explain with an example.

23 A Explain the hash table and hash function ?

24 A Explain what a collision is in the context of hash tables and why it occurs. 5 Mark

Questions

1 B Explain different operations performed on data structures. 2 B What is

a Linked List? State the different types of Linked List. 3 B Discuss Array of

pointers.
 4 B Explain String manipulation.

5 B Summarise various operations in data structure.

6 B Differentiate linear and non linear data structures with examples.

7 B How does an ADT differ from a data structure?What are the advantages of using
ADTs in programming?

8 B How does memory allocation differ between linear and nonlinear data
structures?

9 B Summarise various operations in data structure with example. 10 B Explain Insertion

operation in Array data structure with example. 11 B Compare traversal operation in

linear and non linear data structure. 12 B Discuss the process of initialising and declaring

an single dimensional array. 13 B Describe how to initialise and declare a two dimensional

array.

14 B State advantages of single dimentional array.Explain the advantages of using

multidimensional arrays for matrix operations.

15 B State and discuss any 5 string manupulation techniques. 16 B

Discuss Array of Pointers

17 B Explain string manipulation

18 B Describe different operations on stack.

19 B How can you check if a stack is full and is Empty (in case of array
implementation)?
20 B How can a stack be used to check the well-formedness of parentheses in an
expression?

21 B Describe the algorithm to convert an infix expression to a postfix expression.

22 B Convert given Infix expression to postfix expression using stack

(A+B*C-D)/E*F

23 B Convert given Infix expression to postfix expression using stack

A+(B*C-(D/E-F*G)*H

24 B Evaluate the following postfix expression. AB*C+D-E+ , where A=5, B= 4, C 10, D=15,
E=6

25 B Evaluate the following postfix expression. ABC+*DE/- , where A=5, B= 6, C=2, D=12,
E=4

26 B Explain enque() and deque() operation in Queue ADT.

27 B Describe isFull(), Front() and rear() operation in queue.

28 B Discuss the advantages and disadvantages of using a queue. 29 B

Write a C program to implement a circular queue

30 B Write a C program to implement a queue using an array. 31 B

Discuss linear queue and circular queue with example.

32 B Define a double-ended queue (deque) and explain its properties. 33 B

Explain the insertion operations in a deque with different cases.

34 B State applications of queue and Describe how queues can be used in job
scheduling.
35 B What is a linked list and how does it differ from an array? 36 B

Explain different types of linked lists.

37 B What are the key operations that can be performed on a linked list? 38 B

Explain singly linked list and describe its structure.

39 B Explain different types of linked list in detail.

40 B Explain concept of circular linked list with example.

41 B Explain different operations performed on doubly linked list

42 B Explain the process of inserting a node at the end of a singly linked list. Provide a
step-by-step explanation and illustrate the changes to the list with a diagram.

43 B Explain the process of inserting a node at a specific position in a doubly linked list.
Provide a detailed explanation and illustrate with a diagram for inserting a
node at position 3.

44 B Illustrate and explain the process of reversing a singly linked list. What changes occur to
the pointers of each node?

45 B Explain the push and pop operations of a stack implemented using a singly linked list.
Provide detailed steps and illustrate with diagrams before and after the
operations.

46 B Explain the enqueue and dequeue operations of a queue implemented using a singly
linked list. Provide detailed steps and illustrate with diagrams before and after
the operations.

47 B Define the type of Binary Tree.

48 B Define different terminologies used in tree.

49 B Explain the representation of Binary Tree using an Array with example

50 B Define Traversal of Binary tree.Explain different types of traversal of binary tree with
example.

51 B Traverse the following binary tree using preorder, inorder and postorder traversal
techniques.

52 B From the given Traversals Construct the binary Tree Inoder: 4,2,5,1,6,3,7
Postorder: 4,5,2,6,7,3,1

53 B What are AVL Trees, and how do they maintain balance in a binary search tree?

54 B Insert the following elements in a AVL search tree : 27, 25, 23, 29,35,33, 34

55 B For the given data build the huffman's tree stepwise

A: 5 B: 9 C: 12 D: 13 E: 16 F: 45

56 B Given an unbalanced AVL Tree, demonstrate how to apply the necessary single or
double rotations to restore balance. Show the process step-by-step with an
example.

57 B Form B Tree using following:

10,20,30,40,50,60,70,80,90
58 B What are the key properties of a B Tree, and how do these properties make it suitable
for database indexing?

59 B Differentiate between directed and undirected graphs. Provide examples for both.

60 B Explain the following graph terminologies with examples: Degree of a vertex, Path,
Cycle, Connected Graph, and Complete Graph.

61 B Define a graph. Explain its components with examples.

62 B Explain the adjacency matrix representation of a directed and undirected graph

63 B Describe the adjacency list representation of a graph.

64 B Compare adjacency matrix and adjacency list representations of graphs

65 B Explain the Depth First Search (DFS) algorithm in Graph. Provide an example with
step-by-step traversal.

66 B Describe how DFS can be used for topological sorting. Explain the algorithm with an
example.

67 B Write and explain algorithm for DFS traversal (recursive) in graph. 68 B

Apply BFS
Algorithm on
following graph:

69 B Demonstrate graph traversal Technique with example.

70 B Explain BFS algorithm in Graph with examples.

71 B Given the list [12, 11, 13, 5, 6, 7, 2] show the result of the all iteration
of Insertion Sort.

72 B Given the list [64, 25, 12, 22, 11], show the result of the all iteration of Selection Sort.

73 B Given the list [6,5,9,6,2,8,1], show the result of the all iteration of Bubble Sort.

74 B Define Linear Search and explain how it works.

75 B Apply Binary Search on the following number stored in the array from A[0] to A[5] [2,
4, 6, 8, 10, 12] to search the number 8

76 B Discuss the advantages and disadvantages of Linear Search compared to Binary

Search.

77 B Explain how a hash function can affect the performance of a hash table.

78 B Explain hash function? List its main properties.

79 B Define hashing. What is its primary purpose in data structures?

80 B Describe any two collision resolution techniques.

81 B Given a hash table of size 5 and the hash function h(x) = x % 5, insert the following
keys using open addressing with quadratic probing: [7, 13, 3, 14, 8]. Show the
resulting hash table.

82 B Given a hash table of size 10 .insert the following keys using linear probing:
99,33,23,44,56,43,19. Show the resulting hash table.

3 Marks Questions
1 C Analyze the concept of Abstract Data Types (ADT) and how they differ from concrete
data structures. with examples of ADTs such as List, Stack, and Queue.

2 C Evaluate the impact of various operations (insertion, deletion, searching) on different

types of data structures (e.g., arrays, linked lists, binary search trees).

3 C Evaluate the advantages and disadvantages of using multidimensional arrays over

one-dimensional arrays in real-world applications.

4 C Analyze the concept of an array of pointers and how it differs from a regular array.
What are the advantages and disadvantages

5 C Explain how the array implementation of a stack works. What is the role of the 'top'
variable in this implementation?

6 C Evaluate the following postfix expression: 6 3 2 + * 4 -. Show the steps involved in solving
it.

7 C Analyze how the enqueue and dequeue operations work in a Circular Queue

8 C Analyse the process of implementing priority queue.

9 C Apply the concept of a doubly linked list to design the enqueue and dequeue
operations from both ends of a deque.

10 C How would you implement a function to delete a node in a circular linked list given its
value?

11 C Evaluate the advantages and disadvantages of using a singly linked list

compared to an array for storing a sequence of nodes.

12 C Implement the push operation for a stack using a singly linked list. Describe the steps
 involved.

13 C Analyze the structure and explain whether this binary tree satisfies the
properties of a Binary Search Tree (BST).

14 C In the given the binary tree Apply pre-order traversal to this tree and list the sequence
of nodes visited.

15 C In the given the following sequence of integers to insert into an AVL tree: 50, 30, 20, 40,
70, 60, 80 Apply the AVL tree insertion process step by step, showing how the
tree is balanced after each insertion.

16 C Compare and evaluate the differences between B-trees and B+ trees in terms of storage
efficiency and query performance. In which types of applications would one be
preferred over the other?

17 C How to create an adjacency matrix for a weighted graph explain with example.
18 C Solve using two primary methods for representing of graph.
19 C Provide code and example to illustrate DFS.

20 C How does BFS ensure that all nodes at the current depth are explored before moving
to the next level? Explain with an example.

21 C Sort using merge sort Input List: [64, 25, 12, 22]

22 C Explain Insertion function for Binary Search with example.

23 C How collisions are managed in a hash table using separate chaining. Provide an example
of inserting keys that result in collisions.

24 C Illustrate how double hashing works to resolve collisions in a hash table. Provide an
example with a specific hash function and a series of insertions.