Queues Flashcards

1
Q

What is a queue?

A

A linear data structure which has a first-in-first-out (FIFO) characteristic where elements are inserted at the rear and removed from the front

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the three types of queues?

A
  1. Regular queue
  2. Priority queue
  3. Circular queue
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a regular queue?

A

A queue that has no special property to it. Elements are added to the back and removed from the front.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a priority queue?

A

A queue where elements with a higher priority are closer to the front of the queue than elements with a lower priority.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a circular queue?

A

A queue where the back points back to the front of the queue.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Common STL queue functions

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Queues practice: regular queue

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Queues practice: priority queue

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Queues practice: print level order

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Queues practice: round Robin

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly