DATA STRUCTURES AND ALGORITHMS USING PYTHON (20ES0505)
QUESTION BANK
BRANCH: EEE(R20) YEAR & SEM: II-IV SEM
***************************************************************************************
UNIT – 1
SNO 10 Marks Questions CO PO BL
1 Explain about selection sort along with suitable example? 1 1,2,3 1
2 Write about bubble sort and write the algorithm? 1 1,2,3 6
3 Write about insertion sort algorithm with suitable example (step 1 1,2,3 6
by step for every iteration).
4 Explain about linear search and binary search? 1 1,2,3 2
5 Explain any one algorithm with example under divide and 1 1,2,3 2
conquer method?
6 43,10,79,90,12,54,11,9,50 sort this element as per Quick sort by 1 1,2,3 4
selecting a pivot Element step by step in detail and write a python
code for it
7 Divide this element 50,70,60,20,90,10,40,100 and conquer the 1 1,2,3 4
result by merge sorting step by step and write python code for it.
8 Sort this element JGDHEBKIFCA by Selection sorting technique 1 1,2,3 5,6
step by step in detail and write python code for it
9 45,36,54,27,63,72,61 and 18 sort give element by bubble sort 1 1,2,3 3
method and write python code for it
10 50,70,60,20,90,10,40,100sort this element as per insertion sort 1 1,2,3 3
Element step by step in detail and write a python code for it
SNO 2 Marks Questions CO PO BL
1 what is data and information 1 1,2,3 1
2 what is data type 1 1,2,3 1
3 what is a Array and what are the types present in it 1 1,2,3 1
4 Differentiate Array and List in python 1 1,2,3 1
5 what is static Memory 1 1,2,3 1
6 what is Dynamic Memory 1 1,2,3 1
7 Explain list and its index in python 1 1,2,3 2
8 What is sorting and searching 1 1,2,3 2
9 How many types data types are there 1 1,2,3 1
10 What is asymptotic notation and what is the purpose of it. 1 1,2,3 1
Unit 2
SNO 10 Marks Questions CO PO BL
1 What is linked list? And explain about types of linked list with 2 1,2,3 1
examples.
2 Insert a node in a linked list and delete a node in linked list. Write 2 1,2,3 6
code for above operations.
3 Display the elements from the list. And insert the element in given 2 1,2,3 6
position, Write code for those?
4 What is double linked list? Write code for sorting the elements in 2 1,2,3 1,6
linked list.
5 What is a node? How many fields are there in double linked list, 2 1,2,3 6
Explain it with example. Write code for sorting list?
6 Define linked list and list all types of it. And representation by 2 1,2,3 3
static and dynamic
7 Differentiate SLL and DLL and list out advantages of Singly 2 1,2,3 4
Linked list and Double Linked list
8 Write a python code for Singly Linked List and its operations 2 1,2,3 1,6
9 Write a python code for Double Linked List and its operations 2 1,2,3 6
10 Write a short notes on linked list 2 1,2,3 2
SNO 2 Marks Questions CO PO BL
1 Define doubly linked- linked list with neat diagram. 2 1,2,3 1
2 Define circularly linked list with neat diagram. 2 1,2,3 1
3 State the different types of linked lists 2 1,2,3 3
4 List the basic operations carried out in a linked list 2 1,2,3 2
5 List out the applications of a linked list 2 1,2,3 2
6 State the difference between arrays and linked lists 2 1,2,3 4
7 Define Data Structures 2 1,2,3 1
8 Define an Abstract Data Type (ADT) 2 1,2,3 1
9 List the various operations that can be performed on data 2 1,2,3 4
structure.
10 What is static linked list? State any two applications of it. 2 1,2,3 2
UNIT – 3
SNO 10 Marks Questions CO PO BL
1 Define stack and its operations by using any examples? 3 1,2,3 2
2 Define queue and its operations by using any examples? 3 1,2,3 2
3 Write a python program to perform insertion and deletion 3 1,2,3 6
operations on queue using arrays?
4 Write a python program to perform push and pop operations on 3 1,2,3 6
stack using arrays?
5 Write a python program to perform insertion and deletion 3 1,2,3 6
operations on queue using linked list?
6 Write a python program to perform push and pop operations on 3 1,2,3 6
stack using linked list?
7 convert infix expression to postfix and prefix: 3 1,2,3 5
(a).A+B*C+D
(b).(A+B)*(C+D)
(c).A*B+C*D
8 8.evaluate Expressions: 3 1,2,3 5
(a).12+3-4/2<3+1
(b).4 2 3 5 1 - + * + *
(c).(4+2)+(3*(5-1))
9 List applications the of stack data structures And give detail notes 3 1,2,3 2,3
how recursive function works by using stack data structures
10 Write an algorithm to convert an infix expression to postfix 3 1,2,3
expression and also trace the same for expression
(a+b)*d+e/f+c
SNO 2 Marks Questions CO PO BL
1 Define stack? 3 1,2,3 1
2 Define queue? 3 1,2,3 1
3 How many ways can be represent stack and queue? 3 1,2,3 2
4 Evaluate (3+2)*4? 3 1,2,3 4
5 Evaluate 4 5 7 2 + - * 3 1,2,3 4
6 Convert infix to prefix A+B+C+D? 3 1,2,3 3
7 Convert infix to postfix A+B+C+D? 3 1,2,3 3
8 Define operant precedence? 3 1,2,3 1
9 Define operator Associativity? 3 1,2,3 1
10 List applications of stack? 3 1,2,3 5
Unit 4
SNO 10 Marks Questions CO PO BL
1 Define binary searching tree and construct BST for the following 4 1,2,3 3
sequence numbers 50,70,60,20,90,10,40,100 and write inorder,
preorder, postorder?
2 Define binary tree and construct binary tree using the following 4 1,2,3 3
data elements 43,10,79,90,12,54,11,9,50 and write inorder,
preorder, postorder?
3 Define expression tree and construct expression tree for postfix 4 1,2,3 3
expression a b + c d e + * * and write expression in infix form.
4 Define heap tree and construct 45,36,54,27,63,72,61 and 18 and 4 1,2,3
write inorder, preorder, postorder?
5 Define AVL trees and list and explain rotations construct BST for 4 1,2,3 5
the following sequence numbers 50,70,60,20,90,10,40,100 and
AVL
6 Given inorder: DJGBHEAFKIC and 4 1,2,3 4
postorder: JGDHEBKIFCA
Construct the binary tree and give its preorder, inorder, postorder,
traversal
7 Define the following with respect to trees with an example 4 1,2,3 6
i. Degree of tree
ii. Siblings
iii. Leaf nodes
iv. level of a tree
v. height of a tree
8 Define binary search tree Write a python code for traversal 4 1,2,3 3
(inorder, preorder, postorder) of binary search tree.
9 For the given data draw a binary search tree and show the array 4 1,2,3 5
and linked list representation of the same:
100,85,45,55,110,20,70,65
10 Draw a binary tree for the following expression 4 1,2,3 5
3+4*(7-6)/4+3 traverse the generated tree using inorder,
preorder, postorder
SNO 2 Marks Questions CO PO BL
1 Define Tree with example 4 1,2,3 1
2 Define BST with example 4 1,2,3 1
3 Define heap tree with example 4 1,2,3 1
4 Define Expression Tree with example 4 1,2,3 1
5 Define degree, height in tree 4 1,2,3 1
6 Define level, path in tree 4 1,2,3 1
7 Construction tree for ab+c* 4 1,2,3 3
8 Define inorder, Preorder, Postorder 4 1,2,3 1
9 Define AVL Tree with example 4 1,2,3 1
10 Define threaded binary tree with example 4 1,2,3 1
Unit – 5
SNO 10 Marks Questions CO PO BL
1 1. Define the following with respect to graphs with an example 5 1,2,3 1
i. connected graph
ii. directed graph
iii. multi graph
iv. complete graph
v. sub graph
2 Define a graph and list types of graphs. Show the adjacency matrix 5 1,2,3 1,3
and adjacency list representation of the graph for below graph
3 Define BFS and write python code for BFS algorithm. 5 1,2,3 6
4 Define DFS and write python code for DFS algorithm. 5 1,2,3 6
5 Write short notes for Hashing Functions. 5 1,2,3
6 What is a collision? What are the methods used to resolve 5 1,2,3 3
collision? Explain linear probing with example
7 Discuss division, mid-square and folding hash functions 5 1,2,3 5
8 Initially following keys 10,16,11,1,3,4,23 and 15 are inserted into 5 1,2,3 4,5
empty hash table of length of 10. Using open addressing with hash
function h(k) = k mod10 and linear probing. What is the resultant
hash table? Explain linear probing.
9 Define a graph and list types of graphs. Show the adjacency matrix 5 1,2,3 1,2
and adjacency list representation of the graph for below graph
SNO 2 Marks Questions CO PO BL
1 Define graph and Connected graph 5 1,2,3 1
2 Define a graph and Directed graph 5 1,2,3 1
3 Define a graph and Multi graph 5 1,2,3 1
4 Define a graph and Complete graph 5 1,2,3 1
5 Define a graph and sub graph 5 1,2,3 1
6 Define hashing in data structures 5 1,2,3 1
7 Define collision and list the type which is resolve collision 5 1,2,3 1
8 What is Breath First Search 5 1,2,3 1
9 What is Depth First Search 5 1,2,3 2
10 Write a Matrix for below graph. 5 1,2,3 2
