NRI INSTITUTE OF TECHNOLOGY

(AUTONOMOUS)
Approved by AICTE, New Delhi: Permanently Affiliated to JNTUK, Kakinada
Accredited by NAAC with "A" GRADE, Accredited by NBA (CSE,ECE&EEE)
An ISO 9001:2015 Certified Institution
Pothavarappadu (V), Agiripalli (M), Eluru District, A.P., India, Pin: 521 212
URL: www.nriit.edu.in, email: [email protected], Mobile: + 91 8333882444

CḺASS: I B.Tech II Semester (NRIA23) ACADEMIC YEAR: 2024 – 25

Date:
ASSIGNMENT– II
BRANCH: CSE-B Max. Time: 1Hour
SUBJECT: Data Structures (23A1205401) Max. Marks: 10 Marks
Answer All Questions
Each question carries 5 marks
S.NO QUESTION Marks BTL CO PO
1 a) Explain the concept of a queue. How is it different from a stack? Give
real-world examples of queues 5 2 3
1,,2,3,5,
b) Write a program that implement Queue using a Linked List.
11,12
2 Describe the working of a circular queue. Write a program to implement 2
it using arrays and demonstrate enqueue and dequeue operations 5 3
1,2,3, 11
3 Explain the concept of a Priority Queue in detail. Discuss the different 2
types of priority queues and implement with an example 5 3
1,2,3,5,
12
4 What is a deque (Double-Ended Queue)? How does it differ from a 1
standard queue? Explain the concept of an Input Restricted Queue and 3 1,2,5,12
5
Output Restricted Queue. Explain the operations on a Deque
5 Implement a Circular Queue using an array with a maximum size of 10 2
elements. Demonstrate the operations of enqueue, dequeue, and display. 3 1,3,5,11
5
Show how the front and rear pointers change with each operation
6 Explain the Concept of Multiple Queues 2
3 3,5,12
5
7 Represent a stack using an array with the help of a suitable example. 4
5 3 1,5,12
Write and explain the algorithm for all basic stack operations
8 Write a program to implement a stack using a singly linked list. 3
5 3 1,5,12
Implement operations: push, pop, and top.
9 How to reverse a given array or list using stack operations. Explain how 5 2 1,5,12
the LIFO property of stack helps in reversing. 3
10 Convert the given infix expression to Postfix 5
a) A + B * C b) A + B * C - D 5 3 1,2,3,5,12
11 Evaluate the following Postfix Expressions: 5 4 3 1,2,3,11,1
a) 5 3 2 * + b) 10 2 8 * + 3 - 2
12 Write a non-recursive program to calculate the factorial of a number 5 1 1,2,3,11
using a stack 3

Question No(S) Regd Numbers

1,12 24KN1A0567 - 24KN1A0577 ,PPDV-508
2,11 24KN1A0578 - 24KN1A0588, PPDV-509
3,10 24KN1A0589 - 24KN1A0599, PPDV-510
4,9 24KN1A05A0 - 24KN1A05AA, PPDV-511
5 ,8 24KN1A05AB - 24KN1A05AL, PPDV-512
6,7 24KN1A05AM - 24KN1A05AW, PPDV-513, 514

Signature of Course Instructor Signature of Course Coordinator Signature of the Head of Department
Signature of Course Instructor Signature of Course Coordinator Signature of the Head of Department