i cs 28.2.23

Minimum number of fields in each node of a doubly linked list is_________

• 2

• 3

• 4

• None of the above

A parentheses checker program would be best implemented using_____

• List

• Queue

• Stack

• Any of the above

The time complexity of quicksort is ……..

• O(n)

• O(logn)

• O(n2)

• O(n logn)

. ……… form of access is used to add and remove nodes from a queue.

• LIFO, Last In First Out

• FIFO, First In First Out

• Both a and b

• None of these

New nodes are added to the ……… of the queue

• Front

• Back

• Middle

• Both A and B

The term push and pop is related to_____

• Array

• Lists

• Stacks

• Trees