View Assessment Result: Multiple-Choice Quiz 8
Your performance was as follows:
1.
A node in a tree that does not have a predecessor is called
(a) a parent node
(b) an internal node
(c) a leaf
(d) a root
Correct answer is (d)
Your score on this question is: 10.00
Feedback:
See section 5.1.1 of the course notes.
(d)
--------------------------------------------------------------------------------
2.
By definition, a(n) _____ graph contains edges that can be traversed in either direction.
(a) disconnected
(b) undirected
(c) connected
(d) directed
Correct answer is (b)
Your score on this question is: 0.00
Feedback:
See section 5.2.1 in the course notes.
(d)
--------------------------------------------------------------------------------
3.
Which of the following is a C++ data structure that represents a list of entries consisting of unique keys and their associated values?
(a) priority_queue
(b) set
(c) stack
