KAMARAJ COLLEGE OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES USING PYTHON

IMPORTANT QUESTIONS
SEM / YEAR: IIISem/ II Year

Q.No Questions
1. Define ADT. Give any two examples.

2. What are the postfix and prefix forms of the expression:

A + B* (C – D) / (P – R)
3. List out the areas in which data structures are applied extensively.
4. Define data structure with example.

5. What is circular linked list?

6. List out the advantage of circular linked list.

7. Distinguish between linear and nonlinear data structures.

8. Interpret the advantages and disadvantages of linked lists over arrays.

9. Differentiate arrays and linked lists.

10. Give an example for linked list application.

11. Examine a doubly linked list with neat diagram.

12. Illustrate the basic operations carried out in a linked list.

13. Show the ways in which list ADT can be implemented.

Analyze and write a routine to find position of given element in
14.
singly linked list.
Analyze and write the linked list representation of a polynomial:
15.
p(x)=4x3+6x2+7x+9
 Should arrays or linked lists be used for the following types of
applications? Support your justification.
17.
1. Many search operations in sorted list.
2. Many search operations in Unsorted list.

18. Compare singly linked list with circular linked list.

19. Design a routine to delete an element in a linked list.

20. Develop an algorithm for insertion operation in a singly linked list.

PART - B

1. Describe in detail about Polynomial manipulation in linked list. (13)

What is a linked list? Describe the suitable routine segments for any
2.
four operations. (13)
Examine the algorithms to implement the doubly linked list and
3. perform all the operations on the created list. (13)

Identify the array implementation of list and show all its operation.
4.
(13)

Discuss the creation of a doubly linked list and appending the list.
5.
Give relevant coding in C. (13)

Write C code for singly linked list with insert, delete, display
6.
operations using structure pointer. (13)

Differentiate single linked list and doubly linked list with an

7.
example. (13)

8. Explain the application of linked list in detail. (13)

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 the position is already occupied the element should
9.
be inserted with the minimum number of shifts.(Note: The elements
can shift to the left or to the right to make the minimum number of
moves). (13)

Analyze and write C code for circular linked list with create, insert,
10.
delete, display operations. (13)

11. Explain the various operations of the list ADT with examples. (13)

Analyze the doubly linked list and circular linked list. Mention its
12.
advantages and disadvantages. (13)
Explain the steps involved in insertion and deletion into a singly
13. linked list. (13)
 14. Develop a C program for linked list implementation of list. (13)
PART – C
Recommend an algorithm to add two polynomials
1. 5x2+3x+15,2x2+6x+3 when the polynomials are represented during
singly linked lists. (15)
Compose an algorithm to
i) Reverse the elements of a single linked lists. (5)
2.
ii) count the number of nodes in a given singly linked list.(5)
iii) Searching the element from linked list. (5)

Given an list 10,20,30,40 ,generalize the steps to delete a node from

3. the beginning of the linked list, deletion of last node in a list and
deletion of middle node in a list. (15)

Develop a C program to split a linked list into sub lists containing

4.
odd and even ordered elements in them respectively. (15)

UNIT II - LINEAR DATA STRUCTURES – STACKS, QUEUES

Stack ADT – Operations - Applications - Evaluating arithmetic expressions- Conversion of Infix to postfix
expression - Queue ADT – Operations - Circular Queue – Priority Queue - deQueue – applications of
queues.

PART - A
Q.No Questions
1. Define stack and specify the operations
2. List any four applications of stack?
Given the prefix for an expression. Write its postfix:
3.
-*-+abc/ef-g/hi
4. Given the infix for an expression, write its prefix a*b/c+d.
Discuss the postfix and prefix forms of the expression?
5. A+B*(C-D)/(P-R)
6. Illustrate the purpose of top and pop?
7. What causes underflow of stack? How it could be avoided?
8. How to implement stack using linked list.
Summarize the rules followed during the infix to postfix
9.
conversions.
10. Generalize a routine to return top element in a stack using linked list.
11. Define double ended queue.
12. List the applications of a queue.
13. What are the applications of priority queue?
14. What is circular queue?
15. Circular queue is better than standard linear queue, Why?
16. Classify the different types of queues.
17. Show a routine to perform enqueue operation in a queue.

18. Differentiate between double ended queue and circular queue.

19. For railway reservation the queue data structure is preferred –Justify.

Develop an algorithm for deleting an element in a double ended

20.
queue.
PART – B

1. Describe about stack ADT using array in detail. (13)

i) Give an algorithm for push and pop operations on stack using a
linked list with an example. (8)
2. ii) Describe the function to examine whether the stack is full() or
empty(). (5)

i) Discuss the process of evaluating postfix expression with an

example. (10)
3. ii) Write an algorithm that checks if expression is correctly
parenthesized using stack. (3)

Give an algorithm to convert an infix expression to a postfix

4. expression using stack with suitable example. (13)

5. Illustrate the application of stack with an example. (13)

i) Trace the algorithm to convert the infix expression “3-(4/2) +

(1*5) + 6” to a postfix expression using stack. (8)
6.
ii) Show the simulation using stack for the following expression to
convert infix to postfix :p*q+ (r-s/t). (5)
Explain how to evaluate the following arithmetic expressions using
stacks.
7. i)6 5 2 3 + 8 * + 3 + * (7)
ii) 2 3 1 * + 9 - (6)

8. Briefly describe the operations of queue with example. (13)

Describe about implementation of queue ADT using linked list. Give

9.
relevant examples and diagrammatic representations. (13)

Discuss and write a C program to implement queue functions using

10.
arrays. (13)

11. Explain application of queue with suitable example. (13)

12. Explain circular queue and its implementation. (13)

 13. Analyze the implementation of priority queue. (13)
14. Prepare an algorithm to perform the operations in a double ended
queue. (13)
PART – C

1. Develop a C program for linked list implementation of stack. (15)

Convert the following infix expression into postfix form:

i ) A+B*C+(D*E+F)*G (5)
2. ii) A+B*((C+D)/F)+G*E (5)
iii)Evaluate the above postfix expression for
A=2,B=2,C=1,D=4,E=6,F=4,G=3. (5)

A circular queue has a size of 5 and has 3 elements 10,20 and 40

where F=2 and R=4.After inserting 50 and 60,what is the value of F
3. and R.Trying to insert 30 at this stage what happens? Delete 2
elements from the queue and insert 70, 80 & 90.Assess the sequence
of steps with necessary diagrams with the value of F & R. (15)

Generalize and develop a function to insert an element into a queue

4. and delete an element from a queue, in which the queue is
implemented as a linked list. (15)

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

If the depth of the binary tree is k, the maximum number of nodes in

1.
the binary tree is 2k-1.Prove
Recommend the result of inserting 3,1,4,6,9,2,5,7 into an initially
2.
empty binary search tree.
3. Define a binary tree. Give an example.
4. Create an expression tree for the expression. (a-b) / ((c*d) + e)

5. Differentiate AVL tree and Binary search tree.

Give the various types of rotations in AVL tree during the insertion
6.
of a node?
7. List the applications of trees.
8. What are threaded binary trees? Give its advantages

9. Define balance factor of AVL Tree.

 Simulate the result of inserting 2,1,4,5,9,3,6,7 into an initially empty
10.
AVL Tree.
11. Define an expression tree. Give an example for it.

12. Summarize tree traversal and mention the type of traversals?

13. Differentiate B tree and B+ tree
14. Point out the properties of B+ tree.
15. Illustrate the benefits of B+ tree.

16. List out the various operations that can be performed on B-trees
17. Identify the structural properties of B-Trees.
Illustrate the steps in the construction of a heap of records with the
18.
following key values:12,33,67,8,7,80,5,23.
19. Analyze the properties of binary heap.
Define a heap and show how it can be used to represent a priority
20.
queue.

Write an algorithm for preorder, inorder and postorder traversal of a

1. binary tree. (13)
Explain the following operations on a binary search tree with
suitable algorithms
2. i) Find a node (7)
ii) Find the minimum and maximum elements of binary search tree.
(6)
Write an algorithm for inserting and deleting a node in a binary
3. search tree. (13)
Describe the concept of threaded binary tree with example. (13)
4.
Discuss in detail the various methods in which a binary tree can be
5. represented. Discuss the advantage and disadvantage of each
method. (13)

i) Consider the following list of

numbers14,15,4,9,7,18,3,5,16,4,20,17,9,14,5Using that construct a
6. binary search tree. (7)
ii) Expl
ain the steps to convert general tree to binary tree? (6)
i) Construct B Tree of order m=5 for the following keys
7. 1,12,8,2,25,5,14,28,17,7,52,16,48,68,3,26,29,53,55,45 (8)
ii)Delete the keys 8 and 55.State the rules for deletion. (5)

i) Discuss how to insert an element in a AVL tree and explain with

algorithm. (7)
8. ii) Explain how deletion can take place in AVL trees with suitable
algorithm. (6)
i) What are AVL trees? Describe the different rotations defined for
AVL tree. (7)
9. ii) Insert the following elements step by step in sequence into an
empty AVL tree 44,30,76,16,39,37. (6)
10. Analyze the operations of B-tree using 2-3 tree with example. (13)

11. Discuss about B+ tree in brief with suitable example. (13)

Explain the construction of expression tree with example. Give the
12.
applications of trees. (13)
Illustrate the construction of binomial heaps and its operations with
13. a suitable example. (13)
14.
i)Illustrate how the delete operation is performed on binary heap?(7)
ii)Write suitable operations for percolate up and percolate down
operations in a binary heap. (6)

PART - C

Explain insertion and deletion operations on Fibonacci

1. heaps.Construct Fibonaaci heaps for the following set of elements
10,11,5,35,8,4,2,3,77 (15)
i) Merge the given Binomial heaps. Write procedures for merge
operations. (8)
H 1.
9 2
1
7
11 4
8

5 10 12
2.

21
6
H 2. 3

14

ii) Delete three elements from the merged Binomial Queue. (7)
i) Draw B-Tree of order m = 5 for the keys {K,
O,S,V,M,F,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 reasons. (5)
 4. Construct AVL tree for the followings after rotation. (5+5+5)

i. ii.
12
12
4 44

8 18

iii.
14

12 20

18
23

44

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
1. What is a graph and mention its types?
2. Consider the graph given below. Create the adjacency matrix of it
3. Find out the in-degree and out-degree of each node in the given graph

4. Create an undirected graph and its adjacency matrix for the

following specification of a graph G.
V(G)=1,2,3,4
E(G) ={ (1,2),(1,3),(3,3),3,4),(4,1)}

5. Differentiate BFS and DFS.

6. What is meant by bi-connected graph.
7. Give the purpose of Dijikstra’s algorithm.
8. Differentiate cyclic and acyclic graph
9. Classify strongly connected and weakly connected graph.
10. Illustrate an articulation point with example.
11. Define the length of the graph.
12. Define minimum spanning tree. Give an example
13. State the principle of Topological sorting.
14. Explain procedure for Depth first search algorithm.
15. Analyze the different ways of representing a graph.
16. Prove that the number of edges in a complete graph of n vertices in
n(n-1)/2
17. Assess the minimum number of spanning tree possible for a
complete graph with n vertices.
18. What are Euler circuits?
19. Give two applications of graphs.
20. What is residual graph?
PART - B
1. Describe in detail about the following representations of a graph.
i) Adjacency Matrix (7)
ii) Adjacency List (6)
2. i) Consider the given directed acyclic graph D. Sort the nodes D by
applying topological sort on ‘D’. (7)

A B
E F

ii.Consider the graph given below and show its adjacency list in the
memory. (6)

3. Examine topological sorting of a graph G with suitable example.(13)

4. Differentiate depth-first search and breadth-first search traversal of
a graph 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 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)

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. (6)

7
1 2

1 6 1
5

3 4 5

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

3
5 V2 V3 2

V1 2
V7
3
V6 3
V4
4
V5 1

12. Develop an algorithm to compute the shortest path using Dijkstra’s

algorithm. Validate the algorithm with suitable example. (13)

13. Explain the depth first approach of finding articulation points in a

connected graph with necessary algorithm. (13)

14. i) Write short notes on Bi-connectivity. (7)

ii) Express different types of graphs with example. (6)

PART –C
1 Consider the graph G given below. The adjacency list of G is also
given. Evaluate the steps needed to print all the nodes that can be
reached from the node H (including H itself).One alternative is to
use a depth-first search of G starting at node H. (15)
 2 i) Formulate the minimum spanning tree for the following graph. (8) BTL 6 Creating

1 6
A B C
3
1
3 2
4

D E F
1 4
ii) Generalize any two applications of depth first search. (7)

3 Using Dijkstra’s algorithm to find the shortest path from the source
node A. (15)

4 i) Explain weakly connected graph and strongly connected graph

with example. (7)
ii) State the various graph traversal algorithm. Explain each in detail.
(8)

UNIT V - SEARCHING, SORTING AND HASHING TECHNIQUES

Searching- Linear Search - Binary Search. Sorting - Bubble sort - Selection sort - Insertion sort - Shell sort
– Radix sort. Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible
Hashing.

PART – A
Q.No Questions
1. What is hashing?
2. Define extendible hashing and give its significance.
3. What is meant by internal and external sorting? Give any two
examples for each type.
4.
List the different types of searching
5. Define rehashing.
6. Identify the advantage of shell sort over insertion sort.
7.
Give the time complexities of insertion sort .
8. Give the types of collision resolution.
9. Interpret the fastest searching algorithm and give reason.
10. Distinguish between linear and binary search technique.
11. Classify the different sorting methods.
12. Apply insertion sort and sort the following elements
3,1,4,1,5,9,2,6,5
13. Which hashing technique is best and illustrate with an example?
14. Analyze why do we need a hash table as a data structure as
compared to any other data structure?
15. Point out the advantages of using open addressing.
16. Compare the working of separate chaining and open addressing
techniques.
17. Select the best sorting method out of the following - insertion sort,
quick sort and merge sort and give justification.
18. Summarize the open addressing hashing method with an example.
19.
Develop an algorithm for a shell sort.
20.
Prepare a simple C Program for a linear search.

1.
Describe about selection sort with suitable example. (13)
2.
Examine the algorithm for Insertion sort and sort the following
array: 77, 33, 44, 11, 88, 22, 66, 55 (13)
3.
List the different types of hashing techniques? Explain them in
detail with an example. (13)
4. Show the result of inserting the keys 2, 3, 5, 7, 11, 13, 15, 6, 4 into
an initially empty extendible hashing data structure with M = 3.
(13)
5.
Write a C program to search a number with the given set of
numbers using binary search. (13)
6.
Interpret an algorithm to sort a set of ‘N’ numbers using bubble sort
and demonstrate the sorting steps for the following set of numbers:
88,11,22,44,66,99,32,67,54,10. (13)
7.
Discuss the various open addressing techniques in hashing with an
example. (13)
8.
i) Sort the given integers and Show the intermediate results using
shellsort:35,12,14,9,15,45,32,95,40,5. (7)
ii) Write an algorithm to sort an integer array using shell sort. (6)

9. Illustrate with example the open addressing and chaining methods

of techniques collision resolution techniques in hashing. (13)
10. Compare working of binary search and linear search technique with
example. (13)
11. Analyze extendible hashing in brief. (13)
12. Explain in detail about separate chaining. (13)
13.
Formulate the rehashing technique with suitable example. (13)
14. Prepare an algorithm to sort the elements using radix sort with
example. (13)
PART-C
1.
Mention the different Sorting methods and Explain about each
method in detailed Manner. (15)
2.
Sort the sequence 96, 31, 27,42,76,61,10,4 using shell sort and radix
sort and prepare the required steps. (15)
3.
Given input {4371,1323,6173,4199,4344,9679,1989} and a hash
function h(x) =x mod 10. Prepare the resulting for the following:
i) Separate chaining hash table. (3)
ii)Open addressing hash table using linear probing. (4)
iii) Open addressing hah table using quadratic probing. (4)
iv) Open addressing hash table with second hash
h2(x)=7- (x mod 7). (4)

4. i) Write and explain non-recursive algorithm for binary search. (8)

ii) Using binary search, search the number 26 from the list of
numbers and give the steps. 10,7,17,26,32,92 (7)

***************