BLDEA’s DSA Question Bank
BLDEA’s Dr. P.G. Halakatti College of Engineering
and Technology, Vijayapur
Department of Computer Science and Engineering
Data Structures and Applications
Module-II Question Bank
No. Questions RBT Level
1 Define queue. Write QINSERT and QDELETE proce- 3
dures for queues using arrays.
2 Write a C function CQInsert( ) and CQDelete( ) 3
operations on circular queue.
3 Define a queue. List the different types of queues. 3
State the limitation of ordinary queue. Explain how
do you overcome the limitation by specifying the
required C-statements and diagrammatic represen-
tation using an example.
4 With the C–statements, explain how do you create 2
a node, add and delete on Singly Linked List (SLL)
with proper message where each node is containing
the details of employee in the form of EmpId, Emp-
Name, EmpAddr and EmpSalary as data fields.
5 Write and explain how do you implement the oper- 3
ations of stack using Singly Linked List (SLL) with
the help of C–statements.
6 Write C functions for the following operations on 3
linked list:
i) Insertion at the beginning
ii) Insertion at the end
iii) Deletion at the beginning
iv) Deletion at the end
7 Develop C functions to implement insertion, dele- 3
tion and display operations of a circular queue
Dept. of CSE August 23, 2025 1
BLDEA’s DSA Question Bank
No. Questions RBT Level
8 Write C function to add two polynomials. Show the 3
linked list representation of below two polynomials
and in addition. POLY 1: 5x3 + 4x + 2 POLY 2:
3x3 + 2x + 5
9 Write C functions for following operations on circu- 3
lar linked list:
i) Insertion at the beginning
ii) Insertion at the end
iii) Deletion at the beginning
iv) Deletion at the end
10 Explain the various operations on Circular queues 2
using arrays.
11 Give the node structure of a single linked list of 3
integers and write the functions to perform the fol-
lowing operations:
i) Create a list containing three nodes with data
10, 20, 30 using front insertion.
ii) Insert a node with data 40 at the end of list.
iii) Delete a node whose data is 30.
iv) Display the list contents.
12 What is a linked list? List and explain the different 2
types of linked list with examples.
13 Write the node representation for the linked repre- 2
sentation of a polynomial. Explain the algorithm
to add two polynomials represented as linked list.
14 Write the following algorithms for singly linked list:
i] Inserting ITEM as the first node in the list.
ii] Deleting the last node in the list. 3
Dept. of CSE August 23, 2025 2
BLDEA’s DSA Question Bank
No. Questions RBT Level
15 What are the disadvantages of ordinary queue? 3
Discuss the implementation of circular queue.
16 Write a note on multiple stacks and priority queue. 2
17 Define Queue. Discuss how to represent queue us- 3
ing dynamic arrays.
18 What is a linked list? Explain the different types 3
of linked lists with neat diagram.
19 Give the structure definition for singly linked list
(SLL). Write a C function to
i] Insert an element at the end of SLL.
ii] Delete a node at the beginning of SLL. 3
20 Write a C function to add two polynomials. Show 3
the linked list representation of below two polyno-
mials:
p(x) = 8x14 + 2x8 + 1
q(x) = 8x8 − 3x10 + 10x6
21 Write the differences between arrays and linked 2
lists.
22 Develop a C function to add two polynomials using 3
singly linked list.
Dept. of CSE August 23, 2025 3