UNIVERSITY
My Courc
Conloct unglih n
CS 3303-01 Data Structures -AY2022-T5 ard/My csurcat/ CS3303.01 V2072TS/14aly25uy/Selfui n5
Started on Wedneday.20Juy 2022.3 AM
Completed onWednesday.20Juy 2022.:41AM Time taken 1 min 30 secs Grade 5.00 cut af 10.00505
MareL.0 out of Flag qusfion
Select one aParent root baB+tree data structure Index d.Tree
exten2
A colctin of one ormoretrees is caled
Viare.00 out cf
Select one: a.Trees b.Multiple Spanning Trees a Fores d.Traversals
uotsanb feu
erging those sets is called
Select one a Union Operation b,UnionFind run paia d.Merge Operation
Flag question
A tiaversal of a general tree that traverses the roots subtrees from leit to right, then visits the rcot is called a preorcler traversal
inconiect
Select one Tnuex False
-Flag qusstion
rtcn5 inconect Merk.00 OUt of 1.00 lag queon
A method that is designeci to create exremely shalow tres is callect
Select ont Dynamic noc implementation Union/Find The list of chidren method .Path compression
ueiticn 6 Correst
i callecK-ary tr
1.00 Flug quesier
Select one: "True
An important advantage of the sequernvial tree implernertation is that (select the best answer):
Mera.0D out of 1,00 Hlag question
Select one: Itis an extremelyshallcwtree b.The daa structure can be transmitted between computer
it uses dynamic nodes
A sequential tree can be represented using a bit vector?
Correr 1.00 outof 101 riag queston
Select one True False
ecn9
Select on True Falsex
Priag queston
10 Corres
The weighted union ule joins a tree with fewer nodes to a tree with more nodes by making the smaller tree's root point to the rot of the larger tee.
Select one: True. false
Fag queston
Finish revie