Queue

Queue

University

11 Qs

quiz-placeholder

Similar activities

Quiz3_DivideConquer_GreedyApproach

Quiz3_DivideConquer_GreedyApproach

University

10 Qs

Web Development Revision 3

Web Development Revision 3

University

15 Qs

CC103_COMPUTER_PROGRAMMING

CC103_COMPUTER_PROGRAMMING

University

15 Qs

Design Patterns-Introduction-Session-1

Design Patterns-Introduction-Session-1

University

11 Qs

Unit - 4 Network Analysis & DEM

Unit - 4 Network Analysis & DEM

University

10 Qs

Week 2 Quiz

Week 2 Quiz

University

11 Qs

INB23503 Quiz Chapter 10

INB23503 Quiz Chapter 10

University

10 Qs

Advanced SQL

Advanced SQL

KG - University

10 Qs

Queue

Queue

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

O A

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

11 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose a queue of size 30 is implemented using a circular array. How many items are in the queue of the front is index 27 and the rear is index 6? (front & rear both were initialized with “0”)

a)9

b)10

c)11

d)12

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose a queue of size 40 is implemented using a circular array. How many items are in the queue of the front is index 38 and the rear is index 9? (front & rear both were initialized with “0”)

a)10

b)11

c)12

d)13

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In general, a queue Abstract Data Type allows:

a)Insertions and removals anywhere.

b)Insertions and removals only at one end.

c)Insertions at the back and removals from the front.

d)None of the above.

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose a queue of size 50 is implemented using a circular array. How many items are in the queue if the front is at index 45 and the rear is at index 4? (front & rear both were initialized with “0”)

a)9

b)10

c)11

d)12

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the most appropriate way to implement a queue using a singly-linked list?

a)Enqueue at the head, dequeue at the tail.

b)Enqueue at the tail, dequeue at the head.

c)Both enqueue and dequeue at the head.

d)Both enqueue and dequeue at the tail.

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the property of “queue”?

a)Last in, Last Out

b)First in, First Out

c)Accessed by both ends

d)May be implemented using Arrays

e)All of the choices

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not an “operation” of the queue?

a)Enqueue

b)Dequeue

c)Peek

d)isFull

e)None

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers