My Courcs
inn-u-in
ct nglih
CS 3303-01 Data Structures - AY2022-T5 O-UEES3/sanco/pue Y2072-TS/16an2Jue/if-QiLnir
Started on Wednesday.22June 2022,6:2 PM
Completed onWednesday.22 Junc 20ZZ.6:53 PM Time taken 12secs Marks 0.0/3.00 Grade.0.00cut of10.000%
cn1
A solution i said to be efficinti it
Mard gut e Fiag question
Select one: Sohves the problem within the required resou
onstraints
s completed in the fewest number of steps
d. Can be explained in the contex of Big-Oh notation
The correct answer is Solves the problem within the required resource constraints
Dueiton2
An ADT is
Med ut cf 100 Prig queston
Select one: A type together with acllection of cperations to manipulate the type b.An implemertation of afyeight deign pattem The relizaticn of a data type as a software component An implemertation in java of a class for a data type
The correct answer is: The realization cf a data type as a software component
The implementation of a data type as a data structure is the physical form of an ADT.
Not arawerer
Select one: True False
The corret anwer is rue
Which of the fcllowing is NOT one of the design patterns outlined in our text.
Mrd OU efi. lig queon
Select one aRyweight bvisitor Dc. Compcsite O d.Synergr
The corretanser is Synegy
fA={1,2,3,4ani B={4,5,6}.findA5
Mered out ef 1
Select one: .{[1,2.3.44.5.6 b,{4} 0c {iall positive integer} d,{1,2.3.45.6}
The correct anwer is (1.2.3.4.5.6
According to the propertie ot logarithms, lognm) NoeDue to iueswith HTML formaing. exponent i representedbypreding i with thesymbol.Assuch is equivalnt t
Select one: a.logn-logm b.nlogn clogn+logm O d. Iog(n^m)
The correct answer is: log n +: log m
sion is when an algorithm uses
tures to repeat an operation until the answer has been compute
Not answere Mafad out ef 1.0 lg quecton
Select ong: True False
The correct anwer is False
Which of the fellowing i
Vered out ct 1.
Select one Proof by mathematical induction Sfroof by contradiction Direct proof d.Proof by conensus
Not answ
Select one: t must be correc it must be composed of concrete steps It can have no ambiguity osed of an.infinite number of steps.
Finish reviev
Learning lournal Unit 1
Jump to..
nit 1OptionalVideo Lec