SSD5+选择题8+Multiple-Choice+Quiz+8.txt

View Assessment Result: Multiple-Choice Quiz 8


 A node in a tree that does not have any children is called  
 

  (a) a root
 (b) an empty node
 (c) a leaf
 (d) an internal node  

 Correct answer is  (c)  

 Your score on this question is: 0.00  

 Feedback: 
 

 

 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.