SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY

SOFTWARE ENGINEERING DEPARTMENT

Fall 2022
Data Structures and Algorithms (SE-203T)
Assignment 3
Semester: III Batch: 2021F
Due Date: 11-01-2023 Max Marks: 10

Instructions:
 Solution must be in Handwritten form.
 Solution must be provided in group of 4 students.
 Late Submissions will not be acknowledged.

Question 1
Write the values of Front and Rear for Linear QUEUE for the following conditions

a) When the queue is empty

b) When the queue is full

Question 2
Consider a DEQUE (Double Ended Queue) having memory cells N = 5. Initially the queue is
empty. Perform thefollowing operations and update the values of Left and Right. Initially Left
= 1 and Right =3.

a) Red, Yellow and Brown are inserted

b) Red is deleted
c) Pink and Blue are inserted
d) Yellow and Brown are deleted
e) Black is inserted
f) Pink is deleted
g) Orange and Green are inserted
h) Blue is deleted
i) Yellow is deleted

Question 3
What is priority queue? Write the real world and computer science example of Priority
Queue.

Question 4
Draw Binary Expression Tree for the following equations.
i. A OR B OR C OR (D AND E)
ii. NOT ((A AND NOT B) OR (C XOR D))

Question 5
Traverse the following graphs using the following methods. Also represent the through adjacency list
and adjacency matrix.

a. Breadth First Search

b. Depth First Search