Skip to content

Data Structure

SWE · Quiz · Fall 26

Section B · Batch 47

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Quiz-3, Data Structure, Date: 17-November-2026, Section-B , Fall - 2026, Time: 30 Mins 1. Suppose you have a data set with elements: A, B, C, D. You need to store them in a Circular linked list with sentinel value. If memory cells available are: M1, M2, M3, M4, M5 then construct the linked list. After construction, insert two elements E and F as first and last elements. Draw the linked list. After that delete one element A and draw the linked list. [marks: 3+3+2] 2. Explain Double ended Queue with example. [marks:4] 3. If you have a circular queue of size 6 and perform the following operations, draw the result after each step: [marks: 3] I. Insert 5 elements: A, B, C, D, E II. Insert 2 elements: F, G III. Delete 7 elements