Q32. Header and trailer nodes can complicate insertion and deletion algorithms.
a. true
b. false
Q33. Which answer most accurately completes the following sentence: A linked list is made up of ____.
a. classes
b. nodes
c. addresses
d. memory variables
Q34. Linked lists built forward or backward are identical in every way.
a. true
b. false
Q35. while(current!=null)
current=head.link;
The above statement traverses a linked list.
a. true
b. false
Q36. In the class LinkedListClass, the search method is declared as ____.
a. public
b. private
c. abstract
d. protected
Q37. In an ordered list, we need to modify only the algorithms (as implemented for a regular linked list) for the ____, insert, and delete operations.
a. copy
b. compare
c. traverse
d. search
Q38. Which of the following should be used to traverse a list?
a. the head of the list
b. the tail of the list
c. a reference variable not in the list
d. any node in the list
Q39. Searching, inserting, and deleting require traversal of the linked list.
a. true
b. false
Q40. Searching through a linked list or inserting an item in a linked list requires a ____ of the list.
a. review
b. deletion
c. copy
d. traversal
Q41. private int func3(int m, int n) {
if (m < n)
return 0;
else
return 1 + func3(m-n, n);
}
Refer to the code above. What is the value of func3(-5, 1)?
a. -5
b. 0
c. 1
d. 5
Q42. The overhead associated with iterative methods is greater in terms of both memory space and computer time, when compared to the overhead associated with executing recursive methods.
a. true
b. false
