DIS_Quiz4 Flashcards
1
Q
Stacks must be implemented using an array.
A
False
2
Q
There is no need to specify the capacity of a linked queue in its declaration.
A
True
3
Q
Two variables are needed in a queue to represent the front and the back of the queue.
A
True
4
Q
For an array-based queue “myBack == -1” returns true when the queue is empty.
A
False
5
Q
A queue is a first-in-first-out (FIFO) data structure.
A
True
6
Q
The array element at index 0 should always be the top of the stack for efficiency.
A
False
7
Q
In a queue, the value of myFront is always less than myBack
A
False
8
Q
A stack is a last-in-first-out (LIFO) data structure.
A
True
9
Q
Stack is a suitable data structure for a base conversion program, which converts a decimal number to a binary number.
A
True
10
Q
A
