Data Structure Final Exam Review (Multiple Choice) Solved Correctly To Score A+

Data Structure Final Exam Review
(Multiple Choice) Solved Correctly To
Score A+
Queue CORRECT ANSWERS a linear collection whose elements are added on one
end and removed from the other

first in, first out (FIFO) manner CORRECT ANSWERS We say that queue elements are
processed in a...

circular array (queue) CORRECT ANSWERS To avoid shifting elements, we will use a
________________ to implement the queue

Stack CORRECT ANSWERS a linear collection whose elements are added and
removed from the same end

last in, first out (LIFO) manner CORRECT ANSWERS Stacks are processed in a...

top CORRECT ANSWERS Usually, stacks are depicted vertically, and we refer to the
____ of the stack as the end to which elements are added and removed

infix; operator is placed between its operands CORRECT ANSWERS Arithmetic
operations are traditionally written in _____ notation, meaning that the
_______________________________ in the form

postfix CORRECT ANSWERS In a _________ expression, the operator comes after its
two operands

linked structure CORRECT ANSWERS a data structure that uses object reference
variables to create links between objects

nodes CORRECT ANSWERS Often the objects stored in a linked list are referred to
generically as the _________ in the list

dynamic structure CORRECT ANSWERS A linked list is considered to be a
_________________ because its size grows and shrinks as needed

doubly linked list CORRECT ANSWERS In a _______________________, each node
in the list stores both a reference to the next element and a reference to the previous
one

tree CORRECT ANSWERS a non-linear structure in which elements are organized into
a hierarchy