DATA STRUCTURES FINAL MULTIPLE
CHOICE QUESTIONS AND ANSWERS
A linked list is a collection of .
a. classes c. addresses
b. nodes d. memory variables - Correct Answers -b nodes
A(n) is a list of items, called nodes, in which the next node is determined by the
address, called the link, stored in each node.
a. array c. linked list
b. structure d. hash table - Correct Answers -c. linked list
The address of the first node in the list is stored in a separate location, called the .
a. head c. key
b. tail d. top - Correct Answers -a. head
Searching through a linked list or inserting an item in a linked list may require a___ of
the list.
a. review c. copying
b. deletion d. traversal - Correct Answers -d. traversal
In a linked list, we always want head to point to the node.
a. key c. first
b. main d. last - Correct Answers -c. first
Building a linked list forward places the item to be added at the of the linked list.
a. beginning c. middle
b. end d. key point - Correct Answers -b. end
Building a linked list backward places the item to be added at the of the linked list.
a. beginning c. middle
b. end d. key point - Correct Answers -a. beginning
Because initially the list is empty, the pointer first must be initialized to .
a. NULL c. NIL
b. EMPTY d. NOP - Correct Answers -a. NULL
lists have elements that are in no particular order.
a. Search c. Unsorted
, b. Structured d. Randomized - Correct Answers -c. Unsorted
In an ordered linked list, the search algorithm is somewhat improved because the list
is___ .
a. larger c. referenced
b. smaller d. sorted - Correct Answers -d. sorted
Can apply binary search
A doubly linked list is a linked list in which every node has a next pointer and a ____
pointer.
a. back c. null
b. center d. binary - Correct Answers -a. back
In a doubly linked list, every node contains the address of the next node except for the
node.
a. middle c. first
b. last d. second to last - Correct Answers -b. last
A doubly linked list can be traversed in direction.
a. only the forward c. a circular
b. only the backward d. either the forward or backward - Correct Answers -d. either the
forward or backward
A linked list is not a random access data structure such as a(n) .
a. stack c. structure
b. deque d. array - Correct Answers -d. array
The header node is placed at the of a list.
a. middle c. beginning
b. end d. key location - Correct Answers -c. beginning
A linked list in which the last node points to the first node is called a linked list.
a. circular c. standard
b. recursive d. doubly - Correct Answers -a. circular
The last is pointing to first. So if you visualize it, it looks like a circle
The process of solving a problem by reducing it to smaller versions of itself is called .
a. iteration c. recursion
b. succession d. repulsion - Correct Answers -c. recursion
A ___case is the case for which the solution is obtained directly.
a. base c. direct
b. general d. recursive - Correct Answers -a. base
A(n) definition is a definition in which something is defined in terms of a smaller version
of itself.
CHOICE QUESTIONS AND ANSWERS
A linked list is a collection of .
a. classes c. addresses
b. nodes d. memory variables - Correct Answers -b nodes
A(n) is a list of items, called nodes, in which the next node is determined by the
address, called the link, stored in each node.
a. array c. linked list
b. structure d. hash table - Correct Answers -c. linked list
The address of the first node in the list is stored in a separate location, called the .
a. head c. key
b. tail d. top - Correct Answers -a. head
Searching through a linked list or inserting an item in a linked list may require a___ of
the list.
a. review c. copying
b. deletion d. traversal - Correct Answers -d. traversal
In a linked list, we always want head to point to the node.
a. key c. first
b. main d. last - Correct Answers -c. first
Building a linked list forward places the item to be added at the of the linked list.
a. beginning c. middle
b. end d. key point - Correct Answers -b. end
Building a linked list backward places the item to be added at the of the linked list.
a. beginning c. middle
b. end d. key point - Correct Answers -a. beginning
Because initially the list is empty, the pointer first must be initialized to .
a. NULL c. NIL
b. EMPTY d. NOP - Correct Answers -a. NULL
lists have elements that are in no particular order.
a. Search c. Unsorted
, b. Structured d. Randomized - Correct Answers -c. Unsorted
In an ordered linked list, the search algorithm is somewhat improved because the list
is___ .
a. larger c. referenced
b. smaller d. sorted - Correct Answers -d. sorted
Can apply binary search
A doubly linked list is a linked list in which every node has a next pointer and a ____
pointer.
a. back c. null
b. center d. binary - Correct Answers -a. back
In a doubly linked list, every node contains the address of the next node except for the
node.
a. middle c. first
b. last d. second to last - Correct Answers -b. last
A doubly linked list can be traversed in direction.
a. only the forward c. a circular
b. only the backward d. either the forward or backward - Correct Answers -d. either the
forward or backward
A linked list is not a random access data structure such as a(n) .
a. stack c. structure
b. deque d. array - Correct Answers -d. array
The header node is placed at the of a list.
a. middle c. beginning
b. end d. key location - Correct Answers -c. beginning
A linked list in which the last node points to the first node is called a linked list.
a. circular c. standard
b. recursive d. doubly - Correct Answers -a. circular
The last is pointing to first. So if you visualize it, it looks like a circle
The process of solving a problem by reducing it to smaller versions of itself is called .
a. iteration c. recursion
b. succession d. repulsion - Correct Answers -c. recursion
A ___case is the case for which the solution is obtained directly.
a. base c. direct
b. general d. recursive - Correct Answers -a. base
A(n) definition is a definition in which something is defined in terms of a smaller version
of itself.
