CS 3303-01 - AY2024-T3 / Self-Quiz Unit 5 Self-Quiz Unit 5 Started on Monday, 4 March 2024, 10:59 AM State Finished Completed on Monday, 4 March 2024, 11:03 AM Time taken 3 mins 56 secs Grade 7.00 out of 10.00 (70%) Question 1 Select one: Correct Mark 1.00 out of 1.00 P Flag question Question 2 Correct Mark 1.00 out of 1.00 P Flag question Question 3 Correct Mark 1.00 out of 1.00 F Flag question A finite set of one or more nodes such that there is one designated node call the root is a: (select the best answer) a. Parent root b. a B+ tree data structure C. Index d. Tree v The correct answer is: Tree A collection of one or more trees is called: Select one: a. Trees b. Multiple Spanning Trees . c. a Forest v d. Traversals The correct answer is: a Forest The process of determining if two objects are in the same set and then merging those sets is called: Select one: a. a Union Operation . b. Union / Find c. a Weighted Union d. a Merge Operation
Question 4 Correct Mark 1.00 out of 1.00 P Flag question Question 5 Incorrect Mark 0.00 out of 1.00 P Flag question Question 6 Correct Mark 1.00 out of 1.00 P Flag question A traversal of a general tree that traverses the roots subtrees from left to right, then visits the root is called a preorde Select one: True . False The correct answer is 'False'. A method that is designed to create extremely shallow trees is called: Select one: a. Dynamic node implementation b. Union/Find c. The list of children method x d. Path compression The correct answer is: Path compression A tree whose internal nodes all have exactly K children is called a K-ary tree. Select one: . True False The correct answer is 'True'.
Question 7 Correct Mark 1.00 out of 1.00 P Flag question Question 8 A sequential tree can be represented using a bit vector? Correct Select one: Mark 1.00 out True of 1.00 Flag question Question 9 The list of children approach uses both pointers and an array structure to represent the tree. Incorrect Mark 0.00 out of 1.00 True P Flag question Question 10 Select one: True Incorrect Mark 0.00 out of 1.00 Flag question An important advantage of the sequential tree implementation is that (select the best answer): Select one: a. It is an extremely shallow tree b. The data structure can be transmitted between computers c. It saves space because no pointers are stored d. It uses dynamic nodes The correct answer is: It saves space because no pointers are stored False The correct answer is 'True'. Select one: False X The correct answer is 'True'. The weighted union rule joins a tree with fewer nodes to a tree with more nodes by making the smaller tree's root point to the root of the larger tree. . False X