A) 1.Create a new node.
2.Insert the node before first.
3.Increment the counter by 1.
B) 1.Create a new node.
2.Store the new item in the new node.
3.Insert the node before first.
4.Increment the counter by 1.
C) 1.Create a new node.
2.Store the new item in the new node.
3.Insert the node before first.
D) 1.Create a new node.
2.Store the new item in the new node.
3.Insert the node before first.
4.Decrement the counter by 1.
Correct Answer
verified
Short Answer
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) top; bottom
B) back; next
C) current; forward
D) previous; forward
Correct Answer
verified
Short Answer
Correct Answer
verified
Multiple Choice
A) protected
B) int
C) void
D) bool
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) reference and string
B) int and object
C) index and element
D) class or struct
Correct Answer
verified
Short Answer
Correct Answer
verified
Multiple Choice
A) elements
B) nodes
C) members
D) pointers
Correct Answer
verified
Multiple Choice
A) backward
B) forward
C) traversal
D) random
Correct Answer
verified
Short Answer
Correct Answer
verified
Multiple Choice
A) constructor
B) destructor
C) head pointer
D) tail pointer
Correct Answer
verified
Multiple Choice
A) Retrieve the data of an arbitrary node.
B) Swap the head and the last nodes.
C) Determine whether the list is nearly full.
D) Make a copy of the linked list.
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) Insertion of a node
B) Selection of a node
C) Traversal of a linked list
D) Creation of a new list
Correct Answer
verified
Multiple Choice
A) delete first;
B) delete temp;
C) destroy temp;
D) clear temp;
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) info, head
B) link, back
C) back, head
D) info, link
Correct Answer
verified
Multiple Choice
A) head
B) tail
C) link
D) first
Correct Answer
verified
Showing 1 - 20 of 40
Related Exams