12th Grade Queues Quizzes, Questions & Answers

Think your child knows their 12th grade Queues? Read more

Queues Quizzes By Grade

Find More 12th Grade Subject Quizzes

Computer Science Operating Systems Network Protocols Network Topologies Sql & Querying Software Quality Assurance Network Fundamentals Machine Learning Requirement Analysis

Top Trending Queues Quizzes

Ds Quiz 4 Cse D

DS QUIZ 4 CSE D assesses knowledge on circular queues, priority queues, and queue configurations. It tests the understanding of queue operations, conditions for full or empty queues, and priority queue representations, essential...

Questions: 10 | Attempts: 163 | Last updated: Mar 17, 2025

Sample Question 1
Suppose a circular queue of capacity n elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = -1. The conditions to detect queue full and queue empty are:

Full: (REAR+1) mod n = = FRONT, empty: (FRONT+1) mod n == REAR

Full: REAR == FRONT, empty: (REAR+1) mod n = = FRONT

Full: (FRONT+1) mod n = = REAR, empty: FRONT= =REAR=-1

Full: (REAR+1) mod n = = FRONT, empty: REAR = = FRONT= -1

Sample Question 2
The initial configuration of a queue is a, b, c, d, e ('a' is in the front end). To get the configuration e, d, c, b, a, one needs a minimum of :

3 deletion and 4 additions

4 deletion and 3 additions

4 deletion and 5 additions

None

Sample Question 3
Which of the following is a collection of items into which items can be inserted arbitrarily and from which only the smallest item can be removed?

FIFO queue

Deque

Decreasing order priority queue

Increasing order priority queue