• Home
  • University of the People
  • Data Structures (proctored course) CS 3303
  • Data Structures Self-Quiz

Data Structures Self-Quiz

Dashboard / My courses / g CS 3303-01 - AY2022-T5 / 14 July - 20 July / Self-Quiz Unit 5 Started on Friday, 15 July 2022, 12:05 AM State Finished Completed on Friday, 15 July 2022, 12:08 AM Time taken 2 mins 43 secs Grade 10.00 out of 10.00 (100%) Question 1 Correct Mark 1.00 out of 1.00 A finite set of one or more nodes such that there is one designated node call the root is a: (select the best answer) Select one: O a. Parent root O b.a B+ tree data structure O c. Index O d. Tree The correct answer is: Tree Question 2 Correct Mark 1.00 out of 1.00 A collection of one or more trees is called: Select one: O a. Trees O b. Multiple Spanning Trees O c. a Forest O d. Traversals The correct answer is: a Forest Question 3 Correct Mark 1.00 out of 1.00 The process of determining if two objects are in the same set and then merging those sets is called: Select one: O a. a Union Operation O b. Union/Find O c. a Weighted Union O d. a Merge Operation The correct answer is:Union/Find Question 4 Correct Mark 1.00 out of 1.00 Select one: O True O False v The correct answer is 'False'. Question 5 Correct Mark 1.00 out of 1.00 A method that is designed to create extremely shallow trees is called: Select one: O a. Dynamic node implementation O b. Union/Find O c. The list of children method O d. Path compression The correct answer is: Path compression Question 6 Correct Mark 1.00 out of 1.00 A tree whose internal nodes all have exactly K children is called a K-ary tree. Select one: O True v O False The correct answer is'True' Question 7 Correct Mark 1.00 out of 1.00 An important advantage of the sequential tree implementation is that (select the best answer): Select one: O a. It is an extremely shallow tree O b. The data structure can be transmitted between computers O c. It saves space because no pointers are stored O d. It uses dynamic nodes The correct answer is: It saves space because no pointers are stored Question 8 Correct Mark 1.00 out of 1.00 A sequential tree can be represented using a bit vector? Select one: O False The correct answer is