APSU CSCI 2010 FINAL EXAM REVIEW
SHEET VERIFIED QUESTIONS AND
ACCURATE ANSWERS GRADED A+
⩥ A doubly-linked list keeps track of the next node in the list as well as.
Answer: the previous node
⩥ The list container provided by the Standard Template Library is a
template version of a _____.
Answer: doubly linked list
⩥ Appending a node means adding it to the end of a list. _____ a node
means putting a new node in the list but not necessarily at the end..
Answer: Inserting
⩥ In a circular-linked list, the last node points to the:.
Answer: first node
⩥ If new data needs to be added to a linked list, the program simply
_____ and inserts it into the series.
Answer: allocates another node
,⩥ The advantage a linked list has over a vector is:.
Answer: a node can be inserted intro or removed from a linked list faster
than from a vector
⩥ To create a linked list, you first create a(n).
Answer: struct
⩥ Which of the following is a basic linked list operation?.
Answer: appending a node, traversing the list, inserting or deleting a
node
⩥ The last node in a linked list points to _____.
Answer: NULL
⩥ A _____ is used to travel through a linked list and search for data.
Answer: pointer
⩥ While traversing a list, a node pointer knows when it has reached the
end of a list when.
Answer: it encounters NULL
⩥ To build a list initially, you can use a(n) _____ routine.
Answer:
, ⩥ Variations of the linked list are:.
Answer: doubly-linked list and circular linked list
⩥ A linked list class must take care of removing the dynamically
allocated nodes. This is done by _____.
Answer: the destructor function
⩥ A _____ list contains pointers to the nodes before it an after it..
Answer: doubly linked and circular-linked
⩥ This type of list does not contain a NULL pointer at the end of the list.
Answer: circular linked
⩥ To insert a new node in ascending order into a list, the list must be:.
Answer: arranged in ascending order
⩥ A(n) _____ is an abstract data type that stores and retrieves items in a
last-n-first-out manner.
Answer: stack
⩥ A dynamic stack has a ________ size, and is implemented as a(n)
________..
SHEET VERIFIED QUESTIONS AND
ACCURATE ANSWERS GRADED A+
⩥ A doubly-linked list keeps track of the next node in the list as well as.
Answer: the previous node
⩥ The list container provided by the Standard Template Library is a
template version of a _____.
Answer: doubly linked list
⩥ Appending a node means adding it to the end of a list. _____ a node
means putting a new node in the list but not necessarily at the end..
Answer: Inserting
⩥ In a circular-linked list, the last node points to the:.
Answer: first node
⩥ If new data needs to be added to a linked list, the program simply
_____ and inserts it into the series.
Answer: allocates another node
,⩥ The advantage a linked list has over a vector is:.
Answer: a node can be inserted intro or removed from a linked list faster
than from a vector
⩥ To create a linked list, you first create a(n).
Answer: struct
⩥ Which of the following is a basic linked list operation?.
Answer: appending a node, traversing the list, inserting or deleting a
node
⩥ The last node in a linked list points to _____.
Answer: NULL
⩥ A _____ is used to travel through a linked list and search for data.
Answer: pointer
⩥ While traversing a list, a node pointer knows when it has reached the
end of a list when.
Answer: it encounters NULL
⩥ To build a list initially, you can use a(n) _____ routine.
Answer:
, ⩥ Variations of the linked list are:.
Answer: doubly-linked list and circular linked list
⩥ A linked list class must take care of removing the dynamically
allocated nodes. This is done by _____.
Answer: the destructor function
⩥ A _____ list contains pointers to the nodes before it an after it..
Answer: doubly linked and circular-linked
⩥ This type of list does not contain a NULL pointer at the end of the list.
Answer: circular linked
⩥ To insert a new node in ascending order into a list, the list must be:.
Answer: arranged in ascending order
⩥ A(n) _____ is an abstract data type that stores and retrieves items in a
last-n-first-out manner.
Answer: stack
⩥ A dynamic stack has a ________ size, and is implemented as a(n)
________..
