My Courcs
imonn-u-cin Conloct uEnglih n
CS 3303-01 Data Structures - AY2022-T5 O-UEE53/sanco/pue Y202-TS/30an6 July/Suinit
Started on Wednesday.6 July2022.404PM
Completed onWednesday.6 July2022.4:04 PM Time taken 12secs Grade 0.00 cut af 10.000%
Alist is
Mared OUt f 1.00 Flag queslon
Select one:
b.A tree data structure Finite crdered sequence of clata item
The correct answer isFinite ordered sequence of cata item
A list is said to be empty whenall of itselements have a zero 0) value
Select one: True Ofalse
The correct anwer is False
The most time consuming of thefollowing operations on an aray beed lit implementationi
Maed out cf 1.00
Select one: inserting a nw element at postion n-1in the liwhere n is the numer of elements in the list. Inserting a new element into the head of the lis Femcving an element at positin n-1within the ist d.Removing an eement from the tail of the ist.
The correct answer i:Insering anew element into the head of the list
A linked ist implementation relies upo static memory allocation where static relers to the requirement to pre-allocate all of the memory that will be used for the list
MaedOut ef 1.0 Flug qumfor
Select one: True
ecn.5 Not answerer dout ef 1.00 Flag queston
Select one:
False
The correct answer is Tue
ation ofalist
Not answen Marsed out et 1.0 P.lag quefion
Select one: True false
The corret anwer is False
The freelist..
Mared oute 100
Select one:
Provides access to memory obectswhich have no Big Ontime
in queueplacingn
ed outcf 1
Select one:
In linked lists there are no NULL links in
ed out ef 1.
Flag question
Select one: aSingle inkedlist O b. Linear doubly linked list Circular linked list d.None of these
The corrert answer isCircular linked lis
Maried out ef 1.00 Flag question
s.push(-1] -angnbaps S.popo: S.por: 5.por(g 5.pop[(-3);
Opton 2
Option 3.
Option 4.
Select one: uondo b.Option2 Option3 d.Option4
The correct answer isOption 3
Finish revi