6. The last node in a linked list as defined in the text should always point bac
ID: 3693023 • Letter: 6
Question
6.
The last node in a linked list as defined in the text should always point back to the head of the list.
Select one:
True
False
7.
If you have a node pointer named head, which is pointing to a valid node, how do you access the member variable in the node named item?
Select one:
a. head.item
b. *head.item
c. (*head).item
d. head->item
e. All of these
f. head.item or *head.item
g. (*head).item or head->item
8.
The discipline for a stack is
Select one:
a. .data first inserted is the data first out.
b. for a misbehaving stack, 30 lashes.
c. data last inserted is the data first out.
d. depends on the application of the stack.
9.
Most applications that use a stack will store a struct or class object on the stack.
Select one:
True
False
10.
If you need to access the last element of a linked list with N nodes in it, how many comparisons do you need to make to find the last element?
Select one:
a. 0
b. 1
c. N-1
d. N
Explanation / Answer
6. True because The last node in a linked list as defined in the text should always point back to the head of the list.
7. d
8.c since the stack is closed at one end
9. True
10. N-1 comparisions
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.