Given a Queue with elements $A,B,C,D,E,F$ : Left$/$Front $A,B,C,D,E,F$

Applied Operations in order: Enqueue$($Z$),$ Enqueue$($X$),$ Dequeue$(),$ Enqueue$($Peek$()),$ Enqueue$($Dequeue$())$

Given the above case, what is the final Queue?

a$.B,C,D,E,F,Z,B$

b$.C,D,E,F,Z,x,B,B$

c$.C,D,E,F,Z,x,B$

d$.C,D,E,F,Z,x,x,B$

Which of the following is correct in general?

a$.$ Array$-$List involves fewer element movements than Linked$-$List, when removing an element.

b$.$ Array$-$List involves more element movements than Linked$-$List, when inserting an element.

c$.$ Array$-$List involves more element movements than Linked$-$List, when getting an element.

d$.$ None of the other answers

Which of the following structures allow reading the structure's last element directly in a single operation?

a$.$ None of the other answers

b$.$ Stack and Queue

c$.$ Queue and List

d$.$ List and Stack

Select the option of choice that "best" completes the statement, matches the item, or answers the question.

Operations with binary operators placed after their operands

Inserting element to a Stack

Operations with binary operators placed between their operands

Choose...

Dequeue

LILO $($last in$,$ last out$)$

Removing element from a Queue

Prefix Expression

Push

Infix Expression

Enqueue

Postfix Expression

Queue

Which of the following is correct?

Pop

Stack

a$.$ None of the other answers

b$.$ Linked$-$List cannot be used to implement both Stack and Queue.

c$.$ Linked$-$List can be used to implement Queue, but not Stack.

d$.$ Linked$-$List can be used to implement Stack, but not Queue.