Queues MCQs Questions Answers – Data Structures

18
Score: 0
Attempted: 0/18
Subscribe

1. . Which deletion can be insertion take place only at the other end (rear) and done from one end (front)?
(A) Linked list
(B) Stack
(C) Tree
(D) Queue

2. . For Breadth-First Traversal on a graph, which data structure is required?
(A) Stack
(B) Queue
(C) Array
(D) Tree

3. . Queue follows __________
(A) FIFO (First In First Out) principle
(B) LIFO (Last In First Out) principle
(C) Linear tree
(D) Ordered array

4. . Circular Queue is also called ________
(A) Square Buffer
(B) Ring Buffer
(C) Rectangle Buffer
(D) Curve Buffer

5. . In what order will they be removed if the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time?
(A) ABCD
(B) DCAB
(C) DCBA
(D) ABDC

6. . Which elements are not in the middle but can be inserted or deleted at/from both ends?
(A) Circular queue
(B) Priority queue
(C) Queue
(D) DE queue

7. . If implemented using an array of size MAX_SIZE, a queue gets full when
(A) Front = (rear + 1) mod MAX_SIZE
(B) Front = rear + 1
(C) Rear = MAX_SIZE – 1
(D) Rear = front

8. . Major role of a queue server is in ______________
(A) Simulation of heapsort
(B) Simulation of arbitrary linked list
(C) Simulation of limited resource allocation
(D) Simulation of recursion

9. . Which is not a type of queue?
(A) Single ended queue
(B) Ordinary queue
(C) Circular queue
(D) Priority queue

10. . ……… form of access is used to add and remove nodes from a queue.
(A) LIFO, Last In First Out
(B) FIFO, First In First Out
(C) Both A and B
(D) None of these

11. . Which field holds the elements of the stack?
(A) INFO
(B) TOP
(C) LINK
(D) NULL

12. . Which form of access is used to add/remove nodes from a stack?
(A) LIFO
(B) FIFO
(C) Both A and B
(D) None of these

13. . Which pointer behaves as the top pointer variable of the stack?
(A) Stop pointer
(B) Begin pointer
(C) Avail pointer
(D) Start pointer

14. . ……… of the queue adds a new node.
(A) Front
(B) Middle
(C) Back
(D) Both A and B

15. . A null pointer of the last node in the list signals ………
(A) Beginning of the stack
(B) Bottom of the stack
(C) Middle of the stack
(D) In between some value

16. . The queue is a ………
(A) FIFO
(B) LIFO
(C) LOFI
(D) FILO

17. . Which name does not relate to stacks?
(A) FIFO lists
(B) LIFO lists
(C) Push down lists
(D) Piles

18. . Operation for retrieval of items in a stack is ……………
(A) Access
(B) Pop
(C) Retrieval
(D) Push

Data Structures MCQs

Basic Concepts

Introduction to Data Structures
- Abstract Data Types (ADT) MCQs
Complexity Analysis MCQs

Linear Data Structures MCQs

Arrays MCQs
Linked Lists MCQs
Stacks MCQs
- Stack operations (push, pop, peek) MCQs
- Applications of stacks (expression evaluation, recursion) MCQs
Queues MCQs
- Queue operations (enqueue, dequeue, front, rear) MCQs
- Types: Simple queue, circular queue, priority queue, deque MCQs

Non-Linear Data Structures MCQs

Trees MCQs
Heaps MCQs
Graphs MCQs

Hashing MCQs MCQs

Hash Tables

Sorting and Searching Algorithms MCQs

Sorting Algorithms MCQs
Searching Algorithms MCQs

Miscellaneous

Memory Management in data structures MCQs
- Dynamic memory allocation MCQs
- Garbage collection MCQs
String Manipulation Algorithms MCQs
- Pattern matching (KMP, Rabin-Karp) MCQs
- String hashing MCQs

Data Structures MCQs 1
Data Structures MCQs 2
Data Structures MCQs 3
Data Structures MCQs 4
Data Structures MCQs 5
Stacks Solved MCQs
Queues MCQs
pointer mcqs
Array MCQs

Program to Implement Stack using two Queues in Data Structures (C plus plus)
Difference between homologous structures and analogous structures
Applications of heaps (priority queues, heap sort) MCQs
Queues MCQs
Queues JavaScript Implementation Pseudocode and Algorithm
Data Structures Past Papers Exam Questions

Queues MCQs Questions Answers – Data Structures
By: Prof. Dr. Fazal Rehman | Last updated: April 30, 2025

Related Posts:

Leave a Comment