Queues

Question 1

a linear data structure that follows the First-In-First-Out (FIFO)principle.

Answer 1

Queues

Question 2

(T or F)in queues first element added is the first one to be removed

Answer 2

True

Question 3

(T or F)in queues It represents a collection of elements in which elements are added at one end (rear) and removed from the other end (front).

Answer 3

True

Question 4

adds an element to the rear(end) of the queue. The newly added element becomes the last one in the queue.

Answer 4

Enqueue(insertion)

Question 5

removes the element from the front of the queue. The next element in the queue becomes the new front.

Answer 5

Dequeue(deletion)

Question 6

view the element at the front of the queue without removing it.

Answer 6

Peek

Question 7

array-based
last element of the queue (where you add)

Answer 7

Rear

Question 8

array-based
index of first element of the queue (where you delete)

Answer 8

Front

Question 9

array-based
rear and front is -1

Answer 9

empty queue

Question 10

array-based
rear is incremented by 1
new element is inserted at index rear
initially empty queue(front is -1) front is made 0

Answer 10

insertion

Question 11

array-based
front is incremented by 1
element at index front is taken out

Answer 11

deletion

Question 12

array-based
(T or F) If front is equal to rear, there is one element in the queue, except in initially empty queue
ex. front = 3, rear = 3

Answer 12

True

Question 13

array-based
(T or F) Number of elements can be determined by
rear - front + 1, except empty queue

Answer 13

True

Question 14

array-based
front is -1

Answer 14

queue is empty

Question 15

array-based
front is equal to rear + 1

Answer 15

queue is empty

Question 16

array-based
rear becomes equal to arraySize - 1

Answer 16

queue is full