My Courc -inn-u-in Conlct uEnglih n
CS 3303-01 Data Structures - AY2022-T5 Snard/My csurcet/C CS3303.01 Y2072-TS/14aty3uly/Gra n5
Started on Wedneay.20Juy2022.523 PM
Completed onWednesday.20Juy 2022.5:33 PM Time taken 10 mirs 6 secs Marks 24.00/25.00 Grade 96.00out of100.00
True/False: Big Theta indicates that the Upper and Lower bounds of an aigorithm are the same
Corse: 1.00 f 1.00 ag queter
Select one: Truev False
Corre:
Select one: Queue b. Stack c. Uist d.Array
Flay qiefon
Qen3
The most time consuming of the following operations on an array based list implementation is
Select one
riag queston
ts in the list
Remcving an element at position n1 within the list Removing an element from the tall or the Ist
The upper bound for the growth of the lgorithms running time is repreented by (ease select the best anwer 401 Z,Big Omega )
Carred
ugeanb y.
4.Exonentiai growth
Select one: a.Choice1 b, Chcice2 Chcie3 d. Choice4
utton5 Correst Mark100out ot 1,00 ogn
Select the answ
best defines Hufman Coding:
select one: A set cf coding rules that is typically used for compression A fied lengt coding scheme tor characterreprentation A tree structure thet trades off space and tirme requirements to previde a rt
ncn6 Corren Mer10D.Ou ct
3
rlag queston
00
Select one: Dapartially orderedheap b.max-heap structure pricrity heap d.min-heap ctructuire
Scn7
the memory that will be used for thelist
Select one True False;
P.Flay muosfion
Which.ofthe fllowing is NOT one of the design patterns outlined in our text
Corre Marc1.00.ou.cf
Select one Rlyweight Visitor Compcsite d.Synergy
Flag question
A fnite set of oneormore noues such that there is one designated nodeall the root sa(select thebest anwer)
Select one: a.Parent root b.a B+tre data structure index d.ee
PFlag quetion
10 Corre breL.D.out or 1.00 P Flag queston
IfA={1,2.3,+}andB={4,5.6.find4UB
Select one: .{1,2.3,44,5,6} b.{4} {xi allpositie ineger d,{1,2.34.5.6}
Tr/False Big ThetO indicaes that the Upper and Lowerbounds of an aigorimarethe same
Carrect Mere1.00 out cf 1.00 *rlag question
Select one: True False
eris Truf
12 corre:
True/False:The stack data struc
d as a LIFO structure (last in first out)
Select one: #True'v False
Flag questior
13 Corre:t Mork1.00 ou of 1,00
An impoant advantage of the sequential tree impleimertatinn is that (select thebest answer:
Select one: It is an extremely shallcw tree The data structure can be transmitted between computers
.. It uses dynamic notles
14 Corte: Va1.00.ou.f
The process of determining if two objects are in the same set and then merging those sets is called
Select one: Union Operation b.UnionFind aWeighted Union d.a Merge Operation
Flag question
nswer isUnion/Find
on15 Cortest
Aleaf is any ncde that.
Select one: Has one chid is an internal node with no ancestors I any node with to mpty chldren d.s the ancestor of the root nod
Flag quction
Clmon.16 Corfert Mar 1.00 out of
// Towers of Hano
if(disks>=1 ck-1,fromole,withPole,toole moveDisk(fromPole toPole solveHanoidik-1withPol,toPolfromPole
iag question
static void moveDisk(char fromPole, char toPole{
Opion1On Opion2.O2 Oplion3 O(n logn Option 4. 0(n2
Select one Option b.Option
d.Option4
n17
In linked l