Click Here for Data Structures full study material.

VALLIAMMAI ENGINEERING COLLEGE

SRM Nagar, Kattankulathur – 603 203

DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

III SEMESTER

CS8391- DATA STRUCTURES

Regulation – 2017

Academic Year 2018 – 19

Prepared by

Dr.V.Dhanakoti, Associate Professor / CSE

Dr.M.Sentil Kumar, Associate Professor / CSE

Ms. K. Devi, Assistant Professor/CSE

www.BrainKart.com
Click Here for Data Structures full study material.

VALLIAMMAI ENGINEERING COLLEGE

SRM Nagar , Kattankulathur-603203

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK
SUBJECT : CS8391- DATA STRUCTURES
SEM/YEAR :III/II
UNIT I - LINEAR DATA STRUCTURES – LIST
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation – singly
linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All
operation (Insertion, Deletion, Merge, Traversal)

PART – A
BT
Q.No Questions Level
Competence

1 Define ADT. Give any two examples. BTL-1 Remember

2 Distinguish between linear and non linear data structures. BTL-2 Understand
Compare calloc() and realloc() function and mention its application in linked
3 BTL-4 Analyze
list.
4 Describe the differences between singly and doubly linked lists. BTL-1 Remember
5 List out the areas in which data structures are applied extensively. BTL-1 Remember
6 Define non linear data structure. BTL-1 Remember
7 Compare singly linked list with circular linked list. BTL-5 Evaluate
8 What are the types of linked list? BTL-1 Remember
9 List out the advantage of circular linked list. BTL-1 Remember
10 Binary search cannot be performed on a linked list. Examine. BTL-3 Apply
11 Discuss the advantages and disadvantages of linked lists and arrays. BTL-2 Understand
12 Give an example for linked list application. BTL-2 Understand
13 Specify the use of Header node in a linked list. BTL-6 Create
14 Illustrate the use of linked list with an example. BTL-3 Apply
15 Show the ways in which list ADT can be implemented. BTL-3 Apply

16 Differentiate arrays and linked lists. BTL-2 Understand

17 Analyze and write a find routine in array implementation. BTL-4 Analyze

Analyze and write the array representation of a polynomial:
18 BTL-4 Analyze
p(x) = 4x3+6x2+7x+9

www.BrainKart.com
Click Here for Data Structures full study material.

Should arrays or linked lists be used for the following types of applications?
Support your justification.
19 BTL-5 Evaluate
1. Many search operations in sorted list.
2. Many search operations in Unsorted list.
20 Develop an algorithm for insertion operation in a singly linked list. BTL-6 Create

PART – B
Describe the following:
1 i. Applications of lists. (5) BTL-1 Remember
ii. Polynomial manipulation. (8)
i. What is a linked list? (2)
2 BTL-1 Remember
ii. Describe the suitable routine segments for any four operations. (11)
List an algorithm to perform the following operations in a doubly linked list.
3 i.Insert a node at the end of the list.(6) BTL-1 Remember
ii.Delete the last node in the list. (7)
i. Discuss the insertion and deletion procedures for cursor based linked
lists.(7)
4 BTL-2 Understand
ii. Give an algorithm for the deletion and reverse operations on doubly linked
list. (6)
i. Give the algorithm to perform insertion on a doubly linked list.(7)
5 BTL-2 Understand
ii. Give the algorithm to perform deletion on a doubly linked list.(6)
Write an algorithm to demonstrate a polynomial using a linked list for
6 i.Addition and Subtraction. (7) BTL-3 Analyze
ii.Multiplication operations. (6)
Analyze and write algorithm for Circular Linked list for the following
operations using structure pointer.
7 BTL-4 Analyze
i. Create & Insert . (6)
ii. Delete & Display.(7)

Explain the application of linked list in detail.

8 i. Radix sort. (7) BTL-4 Apply
ii. Multi list. (6)
Consider an array A[1: n] Given a position, write an algorithm to insert an
element in the Array. If the position is empty, the element is inserted easily. If
9 the position is already occupied the element should be inserted with the BTL-5 Evaluate
minimum number of shifts. (Note: The elements can shift to the left or to the
right to make the minimum number of moves). (13)
Develop a program to add the values of the nodes of a linked list and then
10 BTL-6 Create
calculate the mean. (13)

11 Describe the various operations of the list ADT with examples. (13) BTL-1 Remember

Illustrate how polynomial manipulations are performed using lists? Explain

12 BTL-3 Analyze
any two operations with example. (13)

www.BrainKart.com
Click Here for Data Structures full study material.

Explain the steps involved in the following insertion operations in a singly

linked list.
13 BTL-4 Apply
i.Insert the node in the start and End. (7)
ii.Insert the node in the middle of the List (6)

14 Dicuss an algorithm for linked list implementation of list. (13) BTL-2 Understand

PART – C
1 Create an algorithm to add two polynomials using linked list.(15) BTL-6 Create
Explain an algorithm to split a linked list into two sub lists containing odd and
2 BTL-5 Evaluate
even ordered elements in them respectively.(15)
Explain an algorithm to merge two sorted linked lists into a single sorted
3 BTL-5 Evaluate
list.(15)
Design algorithm for various operations performed on circular linked list.
4 Extend the algorithm defined in the previous question for the doubly linked BTL-6 Create
circular list. (15)

UNIT II - LINEAR DATA STRUCTURES – STACKS, QUEUES

Stack ADT – Evaluating arithmetic expressions- other applications- Queue ADT – circular queue
implementation – Double ended Queues – applications of queues
PART – A
BT
Q.No Questions Competence
Level
1 Point out the advantage of representing stack using a linked list than array. BTL-4 Analyze
2 Point out the rules followed during the infix to postfix conversions. BTL-4 Analyze
3 Compare the working of stack and queue data structure. BTL-5 Evaluate
4 Develop an algorithm for inserting a new element into the stack. BTL-6 Create
5 Define stack and queue. BTL-1 Remember
6 List any four applications of stack. BTL-1 Remember
7 Given the prefix for an expression. Write its postfix: BTL-2 Understand
8 Describe how the following "infix" expression is evaluated with the help of BTL-2 Understand
9 Give the postfix and prefix forms of the expression: BTL-2 Understand
10 Define double ended queue. BTL-1 Remember
11 List the applications of a queue. BTL-1 Remember
12 What are the applications of priority queue? BTL-1 Remember
13 What is circular queue? BTL-1 Remember
14 Circular queue is better than standard linear queue, Why? BTL-2 Understand
15 Classify the different types of queues. BTL-3 Apply
16 Illustrate the difference between a queues and linked lists with an example. BTL-3 Apply

17 Complete a routine to display the contents of queue. BTL-3 Apply

18 Analyze and write a routine to check whether the queue is full or empty. BTL-4 Analyze

www.BrainKart.com
Click Here for Data Structures full study material.

19 For railway reservation the queue data structure is preferred –Justify. BTL-5 Evaluate

20 Develop an algorithm for deleting an element in a double ended queue. BTL-6 Create
PART – B
Describe with an example how to evaluate arithmetic expressions using
1 stacks. (13) BTL-1 Remember

Explain array based implementation of stacks. (7)

2 BTL-4 Apply
Explain linked list implementation of stacks. (6)
i. Describe about stack ADT in detail. (7)
3 BTL-1 Remember
ii. Explain any one application of stack.(6)
Explain the following expressions with an example.
4 i.Prefix and infix .(7) BTL-4 Apply
ii.Postfix. (6)
i. Write an algorithm to convert an infix expression to a postfix expression.
Trace the algorithm to convert the infix expression ‘(a+b)*c/d+e/f” to a postfix
5 BTL-5 Evaluate
expression.(8)
ii. Justify the need for Infix and Postfix expression. (5)
i. Give an algorithm for push and pop operations on stack using a linked
list.(7)
6 BTL-2 Understand
ii. Discuss about addition and deletion operations performed on a circular
queue with necessary algorithms. (6)
i. Describe the process of postfix expression evaluation with an example. (7)
7 ii. Describe the process of conversion from infix expression to postfix BTL-2 Understand
expression using stack. (6)
i. Write an algorithm that checks if expression is correctly parenthesized using
8 stack and illustrate with an example. (7) BTL-3 Analyze
ii. Write the function to examine whether the stack is full() or empty(). (6)
i. Describe about queue ADT in detail. (7)
9 BTL-1 Remember
ii. Explain any one application of queue with suitable example. (6)
10 Briefly describe the operations of queue with examples. (13) BTL-1 Remember

11 Analyze and write an algorithm to implement queue functions using arrays. BTL-4 Analyze
(13)
Develop an algorithm to perform the four operations in a double ended queue
12 BTL-6 Create
that is implemented as an array. (13)
13 Discuss circular queue and its implementation. (13) BTL-2 Understand

14 Illustrate the enqueue and dequeue operations on double ended queues. (13) BTL-3 Analyze

PART – C
Develop and Show the simulation using stack for the following expression :
1 BTL-6 Create
12 + 3 * 14 – (5 * 16) + 7 .(15)
Explain an algorithm to implement the circular queue using arrays.
2 BTL-5 Evaluate
List the applications of Queues.(15)

www.BrainKart.com
Click Here for Data Structures full study material.

Assess the difference between double ended queue and circular queue.
3 Show the simulation using stack for the following expression to convert infix BTL-5 Evaluate
to postpix : p * q = (r-s / t).(15)
Develop an algorithm to explain Priority Queue, deQueue and the applications
4 of queues. (15) BTL-6 Create

UNIT III -NON LINEAR DATA STRUCTURES-TREES

Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of trees – binary search tree
ADT –Threaded Binary Trees- AVL Trees – B-Tree - B+ Tree - Heap – Applications of heap.
PART-A
Q.No Questions BT
Level Competence
1 If the depth of the binary tree is k, the maximum number of nodes in the BTL 5 Evaluate
binary tree is 2k-1.Justify
2 For the given binary search tree, if we remove the root and replace it with
something from left subtree. What will be the value of the new root? Justify
your answer.
14
2 22 BTL 5 Evaluate

1 5 20 30

4 17 40

3 Define a fully binary tree.Give an example. BTL 1 Remember

4 Create an expression tree for the expression.a*(b+c)+((d+e*f)*g) BTL 6 Create
5 How does the AVL tree differ from binary search tree? BTL 4 Analyze
6 What are the various rotations in AVL trees? BTL 1 Understand
7 List the applications of trees. BTL 1 Remember
8 What are threaded binary trees? Give its advantages BTL 2 Understand
9 Define balance factor of AVL Tree. BTL 1 Remember
10 How do we calculate the balance factor for each node in a AVL tree? BTL 2 Understand
11 Simulate the result of inserting 3,1,4,6,2,8,9 into an initially empty AVL
BTL 6 Create
Tree.
12 Give an example for expression tree. BTL 2 Understand
13 Number the following binary tree to traverse it in
i.Preorder
ii.Inorder
BTL 2 Understand

14 Explain why binary search cannot be performed on a linked list. BTL 4 Analyze
15 How do you calculate the depth of a B-Tree? BTL 3 Apply
16 List out the various operations that can be performed on B-trees BTL 1 Remember

www.BrainKart.com
Click Here for Data Structures full study material.

17 List out the properties of B+ -Trees BTL 1 Remember

18 Illustrate the steps in the construction of a heap of records with the BTL 3 Apply
following key values:12,33,67,8,7,80,5,23
19 Analyze the properties of binary heap. BTL 4 Analyze
20 Define a heap and show how it can be used to represent a priority queue. BTL 3 Apply

PART B
Write an algorithm for preorder, inorder and postorder traversal of a binary
1 BTL 1 Remember
tree. (13)
Explain the following operations on a binary search tree with suitable
algorithms
2 BTL 4 Analyze
i. Find a node (6)
ii. Find the minimum and maximum elements of binary search tree (7)
i. Write short notes on threaded binary tree (7)
3 BTL 1 Remember
ii. Describe an iterative algorithm to traverse a tree in preorder (6)
Write an algorithm for inserting and deleting a node in a binary search tree.
4. BTL 1 Remember
(13)
Discuss in detail the various methods in which a binary tree can be BTL 2 Understand
5
represented. Discuss the advantage and disadvantage of each method (13)
i. Explain the B+ tree and its properties with an Example (7)
6 BTL 5 Evaluate
ii. What are the steps to convert general tree to binary tree? (6)
i. Construct B Tree to insert the following key elements(order of the tree is
7 3) 5,2,13,3,45,72,4,6,9,22 (7) BTL 6 Create
ii. Draw a B Tree of order 6 (6)
i. Discuss how to insert an element in a AVL tree, Explain with algorithm. (7)
8 ii. Explain how deletion can take place in AVL trees with suitable algorithms BTL 2 Understand
(6)
i. What are AVL trees? Describe the different rotations defined for AVL tree.
(7)
9 BTL 1 Remember
ii. Insert the following elements step by step in sequence into an empty AVL
tree 15,18,20,21,28,2330,26 (6)
i. Point out the operations of B-tree using 2-3 tree. (7)
10 ii.Explain the operations of threaded binary tree. (6) BTL 4
Analyze

Discuss the different traversal technique in binary tree with suitable

11 BTL 2 Remember
algorithms and examples? (13)
Explain the construction of expression tree with example. (7) Analyze
12 BTL 4
Give the applications of trees (6)
i. Show the result of inserting 15,17,6,19,11,10,13,20,8,14,12 one at a time
into an initially empty binary min heap.(7) Apply
13 BTL 3
ii. Show the result of performing three delete min operations in the final binary
min heap obtained . (6)
i. Illustrate How delete operation performed on binary heap? (7)
14 ii. Write a suitable operations for procolate up and percolate down operations BTL 3 Apply
in a binary heap.(6)

www.BrainKart.com
Click Here for Data Structures full study material.

PART C
1 Consider the binary search tree given below.
Find the result of in-order, pre-order, and post-order traversals.
Show the deletion of the root node
Insert 11, 22, 33, 44, 55, 66, and 77 in the tree

BTL 5 Evaluate

(15)

2 i. Compare B trees with B+ trees. (7)

ii. Create a B+ tree of order 5 for the following data arriving in sequence: BTL 6 Create
90, 27, 7, 9, 18, 21, 3, 4, 16, 11, 21, 72 (8)
i. Draw B – Tree pf order m = 5 for the keys
{K, O,S,V,MF,B,G,T,U,W} (5)
3 ii. Delete the keys K and G in order. (5)
iii. Justify the number of splits needed for inserts / delete with proper BTL 5 Evaluate
reasons. (5)
Construct AVL tree for the followings after rotation.(4+4+7)
i. ii.
1 1
4
4
8
1
iii.
4 BTL 6 Create
1 20

1
2

UNIT IV -NON LINEAR DATA STRUCTURES –GRAPHS

Definition – Representation of Graph – Types of graph - Breadth-first traversal - Depth-first traversal –
Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.
PART-A
Q.No Questions BT
Level Competence
1 What is a graph and its types? BTL 1 Remember
2 Consider the graph given below. Create the adjacency matrix of it BTL 6 Create

www.BrainKart.com
Click Here for Data Structures full study material.

3 Find out the in-degree and out-degree of each node in the given graph

BTL 3 Apply

4 Create a complete undirected graph having five nodes BTL 6 Create

5 Given the following adjacency matrix, draw the weighted graph.

BTL 2 Understand

6 When do you say a graph is bi-connected? BTL 1 Remember

7 Give the purpose of Dijikstra’s algorithm. BTL 2 Understand
8 Differentiate cyclic and acyclic graph BTL 4 Analyze
9 Classify strongly connected and weakly connected graph. BTL 3 Apply
10 How to find all articulation points in a given graph? BTL 3 Apply
11 Define the length of the graph. BTL 1 Remember
12 Define minimum spanning tree. Give an example BTL 2 Understand
13 State the principle of Topological sorting. BTL 1 Remember
14 Explain procedure for Depth first search algorithm. BTL 4 Analyze
15 Analyze Bi-connectivity. BTL 4 Analyze
16 Prove that the number of edges in a complete graph of n vertices in BTL 5 Evaluate
n(n-1)/2
17 In a complete graph with n vertices, show that the number of spanning BTL 5 Evaluate
trees is at least 2 n-1 _ 1
18 What are Euler circuits? BTL 1 Remember
19 Give two applications of graphs. BTL 2 Understand
20 What is residual graph? BTL 1 Remember

PART-B
1 Describe in detail about the following representations of a graph.
BTL 1 Remember
i. Adjacency Matrix (7)

www.BrainKart.com
Click Here for Data Structures full study material.

ii. Adjacency List (6)

2 i. Consider the given directed acyclic graph D. Sort the nodes D by
applying topological sort on ‘D’

A B E F

D
(7)
G
BTL 3
Apply
ii. Consider the graph given below and show its adjacency list in the
memory

(6)
3 i. Explain the topological sorting of a graph G with example. (7) BTL 1 Remember
ii. Quote the step wise procedure for topological sort (6)
4 Differentiate depth-first search and breadth-first search traversal of a graph
BTL 4 Analyze
with suitable examples. (13)
5 i. Explain with algorithm, How DFS be performed on a undirected
graph. (7)
ii. Show the algorithm for finding connected components of an undirected BTL 4 Analyze
graph using DFS, and derive the time complexity of the algorithm.
(6)
6 i. Discuss an algorithm for Breadth first Search on a graph.(7) BTL 2 Understand
ii. Give an example based on the algorithm.(6)
7 i. Illustrate Kruskal’s algorithm to find the minimum spanning tree of a
graph. (7)
ii. Trace the algorithm for the following graph
7
1 2 BTL 3 Apply
1 6 1
5

3 4 5
3 5
(6)
8 Compare any two applications of Graph with your own example (13) BTL 5 Remember
9 Describe any one of the shortest path algorithms with suitable example BTL 1 Remember
(13)
10 Discuss the prims algorithm for minmum spanning tree.Give an example. BTL 2 Understand
(13)
11 i. Write a program to find an Euler circuit in a graph. (7) BTL 1
Remember
ii. Trace the algorithm for the given graph.(6)

www.BrainKart.com
Click Here for Data Structures full study material.

3
5 V2 V3 2

V1 2
V7
3
V6 3
1
4
V5 V4

12 Develop an algorithm to compute the shortest path using Dijkstra’s BTL 6 Create
algorithm. Validate the algorithm with suitable example. (13)
13 Explain the depth first approach of finding articulation points in a connected BTL 4 Analyze
graph with necessary algorithm.(13)
14 i. Write short notes on Bi-connectivity. (7) BTL 2 Understand
ii. Express different types of graphs with example. (6)

PART C
1 Given the adjacency matrix of a graph, write a program to calculate the in- BTL 4 Analyze
degree and the out-degree of a node N in the graph. (15)
2. Consider five cities: (1) New Delhi, (2) Mumbai, (3) Chennai, (4) Bangalore,
and (5) Kolkata, and a list of flights that connect these cities as shown in the
following table.Use the given information to construct a graph.(15)
Flight No Origin Destination
101 2 3
102 3 2
103 5 3
BTL 6 Create
104 3 4
105 2 5
106 5 2
107 5 1
108 1 4
109 5 4
110 4 5
3 i.How can we efficiently check whether or not a graph is disconnected? (7)
ii.Describe an algorithm that uses a brute force approach to find all the BTL 5 Evaluate
articulation points in G in O(V (V + E)) time. (8)
4 i. Given a rooted tree, one desires to find the shortest path from the root
to a given node v. Which algorithm would one use to find this shortest
path.(7) BTL 6 Create
ii. Write a program to determine whether there is at least one path from
the source to the destination. (8)

UNIT V - SORTING, SEARCHING AND HASH TECHNIQUES

Sorting algorithms: Insertion sort - Selection sort - Shell sort - Bubble sort - Quick sort - Merge sort - Radix sort
– Searching: Linear search –Binary Search Hashing: Hash Functions – Separate Chaining – Open Addressing –
Rehashing – Extendible Hashing

www.BrainKart.com
Click Here for Data Structures full study material.

PART – A
Q.N BT
o
Questions Competence
Level
1 What is hashing? BTL-1 Remember
2 Define extendible hashing. BTL-1 Remember

3 Give the fastest searching algorithm. BTL-2 Understand

What is meant by internal and external sorting? Give any two examples for
4 BTL-1 Remember
each type.
5 Describe the complexity of bubble sort. BTL-1 Remember
6 Name the applications of linear and binary search techniques. BTL-1 Remember
7 Give the time complexities of bubble sort and quick sort. BTL-2 Understand
8 Predict the fastest sorting algorithm, justify. BTL-2 Understand
9 Compare internal and external sorting. BTL-4 Analyze
10 Distinguish between linear and binary search technique. BTL-2 Understand
11 Classify the different sorting methods. BTL-3 Apply
12 Develop an algorithm for a quick sort. BTL-6 Create

13 Which hashing technique is best and illustrate with an example? BTL-3 Apply

14 Summarize the open addressing hashing method with an example. BTL-5 Evaluate
15 Point out the advantages of using quick sort. BTL-4 Analyze
16 Compare the working of linear and binary search techniques. BTL-4 Analyze
Select the best sorting method out of the following - insertion sort, quick sort
17 BTL-5 Evaluate
and merge sort and give justification.
18 Illustrate the time complexity of insertion sort with an example. BTL-3 Apply
19 Identify the advantage of shell sort over insertion sort. BTL-1 Remember
20 Develop a simple algorithm for a linear search. BTL-6 Create
PART – B
Describe how the divide and conquer technique is implemented in binary
1 BTL-1 Remember
search. (13)
Describe the algorithm to sort the following array: 77, 33, 44, 11, 88, 22, 66,
55
2 i. Insertion sort (7) BTL-1 Remember
ii. Shell Sort (6)

i. List the different types of hashing techniques? (7)

3 BTL-1 Remember
ii. Explain them in detail with an Example. (6)
i. Interpret the result of inserting the keys 2, 3, 5, 7, 11, 13, 15, 6, 4 into an
4 initially empty extendible hashing data structure with M = 3. (7) BTL-2 Understand
ii. Discuss the running time of Divide-and-Conquer Merge sort algorithm. (6)

www.BrainKart.com
Click Here for Data Structures full study material.

i. Sort the sequence 3, 1, 4, 1, 5, 9, 2, 6, 5 using Insertion sort. (7)

5 BTL-2 Understand
ii. Describe the routine for insertion sort. (6)
Write an algorithm to sort a set of ‘N’ numbers using quick sort. Demonstrate
6 the algorithm for the following set of numbers: BTL-3 Analyze
88,11,22,44,66,99,32,67,54,10. (13)
Explain the various collision resolution techniques in detail with an example.
7 BTL-4 Analyze
(13)
Compare the below different Sorting methods and discuss about each method
in a very detailed Manner.
8 BTL-4 Apply
i. Bucket Sort. (7)
ii. Selection Sort .(6)
i. Sort the given integers and Explain the intermediate results using shell sort:
9 35,12,14,9,15,45,32,95,40,5. (7) BTL-5 Evaluate
ii. Write and Explain a C code to sort an integer array. (6)
i. Create a algorithm to perform a binary Search. (7)
10 BTL-6 Create
ii. Develop an algorithm for Merge sort with an example.(6)
i. Write short notes on Bubble Sort.(5)
11 BTL-3 Analyze
ii. Illustrate an algorithm to sort the elements using bubble sort. (8)

Describe the following collision resolution techniques in detail with an

example.
12 BTL-1 Remember
i. Separate chaining. (7)
ii. Rehashing. (6)

i. Explain different hashing technique. (5)

13 BTL-4 Apply
ii. Explain the rehashing technique with suitable example. (8)
Describe the open addressing and chaining methods of collusion resolution
14 BTL-2 Understand
techniques in hashing. (13)

PART – C
1 Develop an algorithm to search a number in a given set of numbers using
BTL-6 Create
binary search. Develop and algorithm to explain Extendible Hashing.(15)
2 Explain a C code to sort an integer array using Selection Sort and Radix BTL-5 Evaluate
Sort.(15)
3 Explain an algorithm for Shell Sort and Merge Sort and explain with
BTL-5 Evaluate
example.(15)
4 Prepare a quick sort algorithm and explain with suitable example Give its
BTL-6 Create
worst case, average case and best case time complexities.(15)

www.BrainKart.com