Data File Stucture

8/16/2019 Data File Stucture

1/50

MCQ:DataStructur

e


2/50

MCQ :Data Structure

Index

1.Data structure basics

2.Algorithm – Complexity Notations

3.Linked List.!tacks and "ueues#.$rees and %inary $rees&.%inary !earch $ree'.%alanced $rees

(.)raphs*.Applications o+ )raphs

1,.Dynamic !torage -anagement

11.!earching and !orting $echniues12./ile !tructures

Unit 1 : Data structure Basics

1. Data structures can be divided in to two types.(a) Two (b) !ree (c) !ree (d) "one.

#. $$$$$$$$is dividin% t!e &ar%er prob&e's to sub prob&e's(a) Modularity(b) Co'p&ex ro%ra''in%(c) b*ect ro%ra'in%(d) "one o+ t!e above

,. - stora%e structure representation in auxi&iary 'e'ory is o+ten ca&&ed as.(a) Database(b) e&ationa& Mode&(c) File Structure(d) Data Structure

/. $$$$$$$$ represents t!e &o%ica& re&ations!ip o+ t!e particu&ar data sets.(a) Data structure(b) In+or'ation(c) ro%ra'(d) "one o+ t!e above

0. !en t!e data is stored in t!e 'e'ory in &inear or se2uentia& +or' is ca&&ed

1 3 a % e


3/50

MCQ :Data Structure

(a) "on&inear Data structure(b) Linear Data structure(c) user de4ne data structure(d) a&& o+ t!e above

5. -rray6 Stac76 Queue6 8in7ed &ist are exa'p&es o+(a) Linear data structure(b) "on&inear data structure(c) data structure(d) none o+ t!ese

9. !en t!e data is stored in t!e 'e'ory in dispersed or nonse2uentia& order isca&&ed non&inear data structure is ca&&ed(a) se2uentia& data structure(b) Non Linear data structure(c) data structure(d) 8inear data structure

;. $$$$$$$$ is t!e si'p&est type o+ data structures.(a) array(b) 8in7ed &ist(c) (a) array(b)


4/50

MCQ :Data Structure

(b) @I@ (@irst in @irst ut)(c) L"F#(Last in last #ut)(d) "one o+ t!e above

15.!ic! is not non&inear data structure(a) Tree(b)-rray(c) Mu&tidi'ensiona& array(d) 8in7ed &ist

19.- non&inear data structure w!ic! contains t!e !ierarc!ica& re&ations!ip betweenvarious e&e'ents is ca&&ed(a)


5/50


6/50

MCQ :Data Structure

,0.- $$$$$$o+ a set o+ n e&e'ents is an arran%e'ent o+ t!e e&e'ents in a %ivenorder.(a) raversin%(b) Se2uencin%(c) rderin%(d) per'utation

,5.It is a step by step procedure in nor'a& Fn%&is! &an%ua%e +or so&vin% aparticu&ar prob&e'.(a) Al&orith'(b) rocedure(c) ro%ra'(d)Modu&e

,9.-BS(I"(5.,5) wi&& returns(a) 5.,5(b) 5.,5(c) *(d) .,5

,;.It consists o+ nu'ber o+ condition w!ic! &eads to se&ection o+ one out o+ severa&a&ternative 'odu&es.(a) Selection lo&ic(b) @&ow &o%ic(c) Iteration(d) Se2uence

,=.i'e and space are two 'ain 'easures +or t!e eciency o+(a) An al&orith'(b) 8oop contro&(c) Data structure(d) "one o+ t!ese

/?.!en t!e IFM is in t!e &ast position o+ t!e array D-- or is not t!ere at a&&t!en co'p&exity is ca&&ed in (a) +orst case(b) Best case(c) -vera%e case

/1.!en t!e IFM is in t!e 4rst position o+ t!e array D--6 so t!e co'p&exity is(a) (n),-(b)(n)(c) &o%(n)(d) (n#)

/#.Measurin% t!e per+or'ance o+ a&%orit!' in re&ation wit! t!e input siEe n isca&&ed(a) rate of &rowth(b) rate o+ Fxecution

(c) avera%e execution(d) none o+ t!ese/,.!ic! o+ t!e +o&&owin% are asy'ptotic notations

(a) ! "otation(b) 'e%a "otation(c) !eta "otation(d) All of these

//.!e$$$$$$$$ o+ a&%orit!' !i%!&y re&ated wit! %rowt! o+ rate(a) co'plexity(b) rate o+ per+or'ance(c) rate o+ execution

0 3 a % e


7/50

MCQ :Data Structure

(d) none o+ t!ese/0.@unction returns abso&ute va&ue o+ a %iven nu'ber

(a) 4x(b) Aoor(c) cei&in%(d) absolute

0nit 3 Linked List/5.8in7ed &ist store data $$$$$$$$$$$.

(a) Dyna'ically(b) Statica&&y(c) Bot! Dyna'ic and static(d) ando'&y

/9.8ist is a $$$$$ (a) Self.referential structure(b) structure(c) pointer variab&e(d) non&inear data structure

/;.8in7ed &ist is a &inear co&&ection o+ data e&e'ents ca&&ed(a)F&e'ents(b) Nodes(c)Data va&ues(d)"one o+ t!ese

/=. Fac! node is divided into $$$$ parts(a) !ree(b) Two(c) Many(d)@our

0?.@irst part is 7nown as $$$$$$$$$$w!ere data is stored

(a) -ddress(b)Data(c) In+o(d) oth b / c

01.!e next or &in7 4e&d contain(a) address o+ anot!er node(b) address o+ 4rst node(c) address of next node in list(d) address o+ current node

0#.!e &in7 4e&d o+ &ast node contains a specia& va&ue6 ca&&ed(a) Null pointer

5 3 a % e


8/50

MCQ :Data Structure

(b) address pointer(c) va&ue(d) "one o+ t!ese

0,.


9/50

MCQ :Data Structure

(b) Sin%&y 8in7ed 8ist(c) Circu&ar 8in7ed 8ist(d) Linear Linked List

5,.In $$$$$$$$ we cantraverse in bot! +orward and bac7ward direction.(a) Bidirectiona& 8ist(b) Doubly Linked List(c) Unidirectiona& 8ist(d) Circu&ar 8in7ed 8ist

5/.$$$$$$ is t!e one w!ere t!e nu&& pointer in t!e &ast node is rep&aced wit! t!eaddress o+ t!e 4rst node.(a) ircular linked list(b) 8in7ed 8ist(c) Sin%&y 8in7 8ist(d) Doub&y &in7ed &ist

50.Doub&y &in7ed &ist are a&so ca&&ed as $$$$$$$$$$$$$$$$$.(a) Two way linked list(b) Doub&e side &in7ed &ist(c) binary &in7ed &ist(d) "one o+ t!ese

55.!e 'e'ory address o+ t!e 4rst e&e'ent o+ an array is ca&&ed(a) -ddress e&e'ent(b) ase Address(c) Uni2ue address(d) base Me'ory

59.!ic! o+ t!e +o&&owin% data structures are indexed structures>(a) linear arrays(b) &in7ed &ists(c) bot! o+ above(d) none o+ above

5;.- variab&e is ca&&ed pointer i+(a) 1 contains the address of an ele'ent in DATA2(b) points to t!e address o+ 4rst e&e'ent in D--(c) can store on&y 'e'ory addresses(d) contain t!e D-- and t!e address o+ D--

5=.!ic! o+ t!e +o&&owin% data structure cant store t!e non!o'o%eneous datae&e'ents>(a) -rrays(b) ecords(c) ointers(d) "one

9?.!en new data are to be inserted into a data structure6 but t!ere is noavai&ab&e spaceN t!is situation is usua&&y ca&&ed

(a) UnderAow(b) #%er3ow(c) Oouse+u&(d) Saturated

91.!e situation w!en in a &in7ed &ist S-K"U88 is(a) 4nder3ow(b) verAow(c) Oouse+u&(d) Saturated

; 3 a % e


10/50

MCQ :Data Structure

4nit 59#.$$$$$$ is a data structures in w!ic! insertion and de&etion o+ ite's are 'ade at

t!e one end.(a) Stack (b)Queue(c) -rray(d) wo di'ensiona& -rray

9,.$$$$ is used to insert an ite' into a stac7.(a) op(b) Insert(c) De&ete(d) 1ush

9/.op is used to de&ete an ite' +ro' a stac7.(a) De&ete(b) e'ove(c) 1op(d)C&ear

90.In stac7 insertion and de&etion can be done +ro' (a) Top(b) Base -ddress(c) @ront(d)ear

95.Stac7 is a an ordered co&&ection o+ ite's +or'in% a &ist t!at is(a) Last in 6rst #ut(b) @irst in @irst ut(c) 8ast in 8ast ut(d) @irst in 8ast ut

99.peration in stac7 aect

(a) Bot! end(b) Sin%&e end(c) Top end(d)"one

9;.$$$$$$ and $$$$$$ operation be&on%s to stac7(a) push and pop(b) insert and de&ete(c) ead and write(d) a&& o+ t!e above

9=.Initia&&y top set to(a) 1

= 3 a % e


11/50

MCQ :Data Structure

(b) .-(c) ?(d)"u&&

;?.I'p&e'entation o+ stac7 can be done eit!er usin%(a) array or &ist(b) array or sin&le linked list(c) Doub&y &ist or #D array(d) Circu&ar or doub&y &in7ed &ist

;1.Be+ore executin% pus! operation one 'ust c!ec7 +or t!e (a) #78FL#+(b) U"DF@8(c) Maxi'u' va&ue(d) Mini'u' va&ue

;#.op Kop J1 indicates(a) A successful push operation(b) - success+u& pop operation(c) Is stac7 @u&&(d) Is stac7 e'pty

;,.a J b P c d is in data structure(a) ost 4x expression(b) re4x expression(c) "n6x expression(d) 'at!e'atica& expression

;/.In so'e type o+ notation t!e operator is p&aced be+ore its two operands6 t!is isca&&ed(a) In4x expression(b) 1re6x expression(c) ost4x expression(d) e%u&ar expression

;0.op operation is per+or'ed by re'ovin% t!e 4rst or t!e start node o+ a &in7ed&ist.(a) pop(b)De&ete(c) e'ove(d)us!

;5.Be+ore every de&etion into t!e stac7 $$$$$$$$$$ condition need to be c!ec7ed.(a) insertion(b) De&etion(c) op(d)us!

;9.- $$$$$ is a &inear &ist o+ e&e'ents in w!ic! de&etions and insertion can ta7ep&ace +ro' dierent end.

(a) !ueue(b)Stac7(c) -rray(d)8ist

;;.In 2ueue de&etions can ta7e p&ace on&y at one end6 ca&&ed t!e (a) Front(b)ear(c) Oead(d) op

;=.In Queue insertions can ta7e p&ace on&y at t!e ot!er end6 ca&&ed (a) ear

1? 3 a % e


12/50

MCQ :Data Structure

(b) @ront(c) op(d)Start

=?.Queues are a&so ca&&ed (a) (F"F#) 6rst.in.6rst.out data structure(b) (8I@) 8ast in @irst out data structure(c) &inear data structure(d) none o+ t!ese

=1.!e two 'et!ods oered by 2ueue +or addin% and de&etin% e&e'ent +ro' t!e2ueue.(a) us! and op(b) Insert and de&ete(c) 8n9ueue and De9ueue(d) -&& o+ t!ese

=#.!enever t!e e&e'ent is de&eted +ro' t!e 2ueue t!e va&ue o+ t!e $$$$$$ isincreased by 1(a) Front(b)ear(c) Start(d) op

=,.!enever an e&e'ent is $$$$$$ to t!e 2ueue6 t!e va&ue o+ F- is increased by1(a) Added(b)Updated(c) De&eted(d) Increased

=/.JQ and (JR)P is t!e $$$$$$$$$$$$$$$ expression(a) e%u&ar arit!'etic expression(b) "n6x expression(c) ost4x expression(d) re4x expression

=0.$$$$$$$$$$ and $$$$$$$$$$$ are t!e two pointers are used in 2ueue.(a) ear and @ront(b) @ront and Start(c) Front and ear(d) @irst and 8ast

=5."ew node can be avai&ed +ro' $$$$$$$$$$$ &ist w!i&e insertin% new e&e'ent intot!e 2ueue.(a) 8in7 &ist(b) A7A"L list(c) -rray(d) "one

=9.ost 4x expression o+ a J b P c d(a) abc:;d.(b)abcPJd(c) abcdPJ(d) PJabc

11 3 a % e


13/50

MCQ :Data Structure

4nit <=;.- tree is a non&inear data structure

(a) tree(b)-rray(c) 8in7ed &ist(d)Stac7

==. A tree is a non-linear data structure that consists of a _____ and potentially many levels ofadditional nodes that form a hierarchy.(a) oot Node(b) @ront "ode(c) arent "ode(d) C!i&d "ode

1??. - tree can be e'pty wit! no nodes ca&&ed (a) The null or e'pty tree(b) !e B&an7 ree(c) ree(d) Binary ree

1?1. op 'ost nodes in a tree.(a) oot(b) 8ea+ "ode(c) C!i&d "ode(d) arent "ode

1?#. !e node t!at !as a c!i&d.(a) oot(b) parent(c) &ea+ (d) "one

1?,. !e node wit! t!e sa'e parent.(a) Sib&in%(b)8ea+(c) C!i&d(d) -&& o+ t!ese

1?/. !e nodes wit! no c!i&dren.(a) 8eaves(b)C!i&d(c) parent(d) Interna& node

1?0. !e nodes wit! at &east one c!i&d.

1# 3 a % e


14/50

MCQ :Data Structure

(a) "nternal Node(b) Fxterna& "ode(c) 8ea+ (d)C!i&d

1?5. connection between one node to anot!er is ca&&ed(a) 8d&e(b) Connection(c) 8in7(d) e&ation

1?9. "u'ber o+ sub trees o+ a node is ca&&ed(a) C!i&d tree(b) De&ree(c) "ode(d) "one o+ t!ese

1?;. !e 'axi'u' &eve& o+ any node in t!e tree is ca&&ed(a) =ei&ht(b) Max node(c) Max &eve&(d) -&& o+ t!e above

1?=. $$$$$is a specia& case o+ tree w!ere no node o+ a tree can !ave a de%ree o+'ore t!an two.

(a) A binary tree(b) BS tree(c) -T8 ree(d) ree

11?. !e 'axi'u' nu'ber o+ nodes at &eve&x wi&& be

(a) >x .-

(b)x#1

(c) x #

(d) "one o+ t!ese111. - binary tree w!ic! !as on&y &e+t sub tree is ca&&ed (a) 8e+t ree(b) Left skewed tree(c) 8e+t Binary ree(d) -T8 ree

11#. $$$$$$$$$$are not ecient in 'e'ory 'ana%e'ent(a) Binary tree(b) Skewed trees(c) @u&& Binary ree(d) Co'p&ete Binary ree

11,. $$$$$$ tree is a binary tree in w!ic! every &eve&6 except possib&y t!e &ast6 is

co'p&ete&y 4&&ed6 and a&& nodes are as +ar &e+t as possib&e.(a) Co'p&ete binary tree(b) Binary ree(c) ree(d) -T8 ree

11/. raversin% in w!ic! &e+t sub tree processed 4rst 6 t!en root and ri%!t subtree is ca&&ed

(a) Inorder raversin%(b) re order raversin%(c) ost order raversin%(d) "one o+ t!ese

1, 3 a % e


15/50

MCQ :Data Structure

110. !ic! o+ t!e +o&&owin% is in Inorder 'anner

(a) D B F - C(b)- B C D F(c) C - B D F(d)- C B D F

115. - &in7 &ist presentation o+ binary tree consist node !avin%(a) - &e+t pointer 6 i%!t ointer6 and Data(b) i%!t pointer6 "u&& pointer and @irst "ode pointer(c) -ddress o+ oot pointer

(d) "one o+ t!ese119. !ic! o+ t!e +o&&owin% is in preorder Mannner

(a) -BDFC(b)-BCDF(c) C-BFD(d)FDB-C

11;. !ic! o+ t!e +o&&owin% is in post order'anner

(a) -BCDF@<(b) DFB@


16/50

MCQ :Data Structure

(a) oot "ode(b) Sib&in% "ode(c) C!i&d "ode(d) "one o+ t!ese

1#?. ne o+ t!e subc&ass o+ binary tree $$$$$$$ tree.(a) Binary searc! tree(b) o'plete binary tree(c) -T8 Binary tree(d) ree

1#1. Binary trees w!ic! !ave 'ore or &ess t!an #n1 nodes ca&&ed(a) "nco'plete inary tree(b) Binary Searc! ree(c) @u&& Binary ree(d) Co'p&ete Binary ree

10 3 a % e


17/50

MCQ :Data Structure

4nit *1##. $$$$$$is desi%ned to 'ini'iEe t!e nu'ber o+ dis7 accesses.

(a) A .tree(b) - binary ree(c) Binary Searc! ree(d) @u&& Binary ree

1#,. ree can be converted into an e2uiva&ent binary tree6 but t!is process'a7es t!e tree

(a) "'balance(b) Ba&anced(c) @u&& binary(d) Inco'p&ete Binary tree

1#/. 8inear representation o+ co'p&ete binary tree in array t!e &e+t and ri%!tnode wi&& be

(a) >i and >i;-(b)# and #i

(c) #n and #n

(d) "one o+ t!ese1#0. @or inco'p&ete binary trees extra stora%e is re2uired

(a) 8xtra stora&e(b) Mini'u' stora%e

(c) Se2uentia& Me'ory byte(d) "one o+ t!ese1#5. ree t!at !ave t!e va&ue at n is %reater t!an every va&ue in t!e &e+t subtree

o+ n and is &ess t!an every va&ue in t!e ri%!t subtree o+ n is ca&&ed(a) Binary tree(b) inary search tree(c) @u&& binary tree(d) Searc! tree

1#9. $$$$$$$$$$ !e&ps in easy insertion and de&etion o+ e&e'ents.(a) Binary tree(b) inary search tree(c) ree

(d) "one o+ t!ese1#;. In+or'ation represented by eac! node is a $$$$$$$rat!er t!an a sin%&e data

e&e'ent(a) ecord(b) Data(c) Ta&ue(d) -&& o+ t!ese

1#=. In binary searc! tree nodes are co'pared accordin% to t!eir $$$$$rat!ert!an any part o+ t!eir associated records.

(a) ?ey(b) Data

15 3 a % e


18/50

MCQ :Data Structure

(c) ecords(d) Index va&ues

1,?. se2uentia& representation o+ binary tress uses t!e p!ysica& $$$$$$$$$$$$re&ations!ip o+ t!e co'puter 'e'ory

(a) ad*acency(b) Se2uentia&&y(c) 8inear(d) "one o+ t!ese

1,1. o represent a node in tree se2uentia&&y usin% postorder traversa& vectorre2uired is ca&&ed

(a) ost(b) repost(c) Bot! a and b(d)De%ree

1,#. enab&es one to searc! +or and 4nd an e&e'ent wit! an avera%e runnin% ti'e(a) 8o%(n)(b)(n)(c) #(lo&> n)(d) 8o%(n)

1,,. rdered binary tree is a $$$$$$$binary tree data structure(a) node.based(b) ecord Based(c) 8ist Based(d) "one o+ t!ese

1,/. In Binary searc! tree t!e &e+t sub tree o+ a node contains on&y nodes wit!7eys $$$$$$$ t!e nodes 7ey.

(a) Less than(b)


19/50

MCQ :Data Structure

(b) Insertion(c) Searc!in%(d) Sortin%

1/?. I+ we are tryin% to $$$$$$$$$ a &ea+ node *ust de&ete t!at node and t!e rest o+t!e tree is &e+t as it is ear&ier.

(a) Delete(b)Update(c) Insert(d)Searc!

1; 3 a % e


20/50

MCQ :Data Structure

4nit @1/1. $$$$$$$$ is a ba&anced binary tree t!at rearran%es its nodes w!enever it

beco'es unba&anced.(a) A7L tree(b) Binary tree(c) Binary searc! tree(d) Co'p&ete Binary tree

1/#. $$$$$$$ is desi%ned to 'ini'iEe t!e nu'ber o+ dis7 accesses.(a) .tree(b) Binary tree(c) -T8 tree(d) Binary searc! tree

1/,. -T8 tree is anot!er ba&anced binary searc! tree na'ed a+ter(a) Denis itc!ie6


21/50

MCQ :Data Structure

(a) -(b),(c) 1(d)?

10?. $$$$$$$$$ an e&e'ent into an -T8 searc! tree is very si'i&ar to t!at o+ t!eprocess used in a binary tree.

(a) S!i+tin%(b) Insertion(c) De&etion(d) Ba&ancin% tree

101. -n -T8 tree is $$$$$$$$$$$$tree(a) ba&anced binary searc!(b) Binary searc! tree(c) Co'p&ete tree(d) @u&& tree

10#. !ic! o+ t!e +o&&owin% deter'ine ba&ance +actor o+ ba&ance tree

(a) 8 or (b) non e'pty binary

(c) ! (8)!(

) Y 1. !(

8) !(

)

(d) ! (8)!(

) (

8) !(

)

(e) "one o+ t!ese10,. Ba&ance +actor o+ t!e root node is

(a) 1(b) C(c) 1

(d) J110/. Struct -T8"odeZ Int dataN Int ba&+actorN $$$$$$$$$$$$$$$$$$$$$$$ [In above structure de4nition w!ic! e&e'ent 'ust re2uired to de4ne(a) Struct &e+t6 ri%!tN(b) Struct P&e+t6 Pri%!tN(c) Struct av&"ode P&e+t6P ri%!tN

#? 3 a % e


22/50

MCQ :Data Structure

(d) Struct A7LNode :left:ri&ht100. -ny operation in tree start +ro'

(a) Start pointer(b)oot(c) ree pointer(d) "one o+ t!ese

105. -+ter insertion o+ t!e e&e'ent6 i+ t!e ba&ance +actor o+ any node in t!e tree isaected6 we need to reso&ve t!is prob&e' by app&yin% t!e tec!ni2ue ca&&ed $$$$$$$$

(a) otation(b) S!i+tin%(c) Movin%(d) De&etion

109. o per+or' rotations in av& tree it is necessary to identi+y a speci4c node -w!ose $$$$$$is neit!er ?6 1 or 16

(a) balance factor(b) &eve&(c) Dept! o+ tree(d) "ode +actor

10;. $$$$$$is a 'irror o+ t!e &e+t rotation operation(a) A ri&ht rotation(b) otation(c) Bot! - and B(d) "eit!er - nor B

10=. - $$$$$$$$$$$$$$ 'ust be per+or'ed w!en atte'ptin% to ba&ance a treew!ic! !as a &e+t subtree t!at is ri%!t !eavy.

(a) otation(b) 8e+t rotation(c) i&ht left otation(d) i%!t rotation

15?. @or retrieva& and 'anipu&ation o+ data stored in externa& 'e'ory need(a) tree(b)BJ tree(c) B tree and BJ tree(d) "one o+ t!ese

151. Mway tree used +or(a) retrie%al and 'anipulation of data stored in external 'e'ory(b) retrieva& and 'anipu&ation o+ data stored in -M(c) retrieva& and 'anipu&ation o+ data stored in interna& 'e'ory(d) a&& o+ above

15#. - Bree o+ order M is(a) - +u&& binary tree

(b) - +u&& binary tree or co'p&ete binary tree(c) -n F'pty tree or +u&& tree(d) An e'pty tree or '.way search tree

15,. In $$$$$$$$$$a&& interna& nodes o+ (ot!er t!an its root) !ave between \M#]and M subtrees.

(a) .Tree(b) Binary tree(c) -T8 tree(d) ree

15/. - btree !as a 'ini'u' nu'ber o+ a&&owab&e c!i&dren +or eac! node 7nownas t!e

#1 3 a % e


23/50

MCQ :Data Structure

(a) Ba&ance +actor(b) Mini'iEation factor(c) Maxi'iEation +actor(d) +actor

150. Fac! node o+ a $$$$$$$$ 'ay !ave a variab&e nu'ber o+ 7eys and c!i&dren(a) -T8 tree(b) .Tree(c) BS(d) Binary tree

155. In btree t!e $$$$$are stored in nondecreasin% order.(a) ?eys(b) C!i&dren(c) 8ea+ node(d) Interna& node

159. In Btree every node 'ust !ave at &east (a) t.- keys(b) #t 1 7eys(c) t# 7eys(d) #t 7eys

15;. $$$$$$ is an idea& data structure +or situations w!ere a&& data cannot residein pri'ary stora%e and accesses to secondary stora%e are co'parative&yexpensive

(a) .Tree(b) Binary tree(c) -T8 ree(d) ree

15=. Searc!in% in btree t!e nu'ber o+ accesses depends on t!e(a) "odes(b) Interna& nodes(c) 8eve&(d)=ei&ht of .tree

19?. !e Btrees are co''on&y used in &ar%e $$$$$$$$$$to provide 2uic7 access tot!e data.

(a) Data(b) ecords(c) Databases(d) 4&e

191. In Btree searc! operation t!e worst case ti'e co'p&exity is (a) 8o%"(b) #(n)(c) &o%(n)(d) "one o+ t!ese

19#. Durin% t!e process o+ de&etion to 'a7e t!e tree ba&ance(a) u&& s'a&&est +ro' &e+t sib&in%(b) u&& &ar%est +ro' &e+t sib&in%(c) 1ull s'allest fro' ri&ht siblin&(d) u&& &ar%est +ro' &e+t sib&in%

## 3 a % e


24/50

MCQ :Data Structure

4nit G$raph19,. Used to 'ode& a &ar%e variety o+ data

(a) $raph(b)-rray(c) ree(d)8ist

19/.


25/50

MCQ :Data Structure

(d) "one o+ t!ese1;#. In directed %rap! eac! ed%e e is identi4ed wit! $$$$$$$$$$ o+ nodes in <

(a) Unordered pair o+ nodes(v1 6v#)(b) rdered pair o+ nodes (v16v#)(c) Se2uentia& &ist o+ nodes(d) -&& o+ above

1;,. Directed %rap! can be seen as (a) "etwor7(b) Flow network (c) Connected %rap!(d) Bot! a and c

1;/. !e $$$$$$$$a&%orit!' is used to 4nd out t!e 'axi'u' Aow +ro' a sourceto a sin7 in a %rap!.

(a) Ford.Fulkerson(b) rus7a& -&%orit!'(c) Searc! a&%orit!'(d) Oas!in% a&%orit!'

1;0.


26/50

MCQ :Data Structure

1=#. - vertex is not ad*acent to any ot!er vertices in a %rap!6 t!en suc! type o+vertex is 7nown as

(a) "solated 7ertex(b) Directed Tertex(c) Main vertex(d) -d*acent Tertex

1=,. - %rap! containin% on&y iso&ated vertices is ca&&ed (a) Null &raph(b) Mu&ti %rap!(c) -cyc&ic %rap!(d) Directed %rap!

1=/. @o&&owin% dia%ra' represent

(a)


27/50

MCQ :Data Structure

(b) utde%ree 6 In de%ree(c) Fd%es6 de%ree(d) De%ree6 ed%es

#?1. It is a twodi'ensiona& Boo&ean 'atrix to store t!e in+or'ation about t!e%rap! nodes

(a) -d*acency Matrix(b)-rray(c) wo di'ensiona& array(d)Matrix

#?#. !e rows and co&u'ns represent source and destination vertices and entriesin t!e 'atrix indicate

(a) Source and destination in %ertices(b) Ta&ues o+ %rap!(c) Fd%es o+ %rap!(d) "one o+ t!ese

#?,. - 'u&ti%rap! is a %rap! w!ic! !as 'ore t!an one$$$$$$ between t!e sa'etwo vertices.

(a) 8in7s(b) 8d&es(c) oints(d) Tetex

#?/. In $$$$$$$$$ entries in an array indicate i+ bot! are re&ated to eac! ot!ert!rou%! ed%es.

(a) "ncidence 'atix(b) -d*acency 'atrix(c) Mu&ti%rap! 'atrix(d)Matrix

#?0. Incidence Matrix entries va&ues o+ t!e 'atrix are %iven as (a) 16 ?6 or 1.(b) 1 or ?(c) 1 or ?(d)1 or 1

#?5. In ad*acency 'atrix6$$$$$ is 'ar7ed in a ce&& i+ t!ere exists an ed%e betweentwo nodes t!at index t!at ce&&.

(a) ?(b) -(c) 1(d) "one o+ t!ese

#?9. - nu&& %rap! consists o+ T vertices but no ed%es6 t!en t!e ad*acency 'atrix!as a&& o+ its entire e&e'ents as $$$$$$$$$$$$$$$$.

(a) C(b) 1

(c) 1(d) -&& o+ t!ese#?;. $$$$$$are used to so&ve t!e prob&e' re&ated to t!e area o+ arti4cia&

inte&&i%ence6 a&%ebraic'anipu&ation6 text processin%6 %rap!ics etc.(a) List structures(b)-rray(c) ree(d)


28/50

MCQ :Data Structure

(a) 8en%t!(b)rder(c) 8eve&(d) Depth

#1?. $$$$$$$$$$ is t!e nu'ber o+ e&e'ents at &eve& 1 in a &ist.(a) Len&th(b)Dept!(c) 8eve&(d)rder

#11. $$$$$$$$$$$$is i'p&e'ented as an array o+ &ists wit! one &ist o+ destinationnodes +or eac! source node.

(a) -d*acency Matrix(b) AdHacency List(c) 8ist(d) 8ist structure

#1#. $$$$$$$$$ every entry is a set (or 'u&tiset) o+ two nodes containin% t!e twoends o+ t!e correspondin% ed%e.

(a)


29/50

MCQ :Data Structure

(d)Matrix#1=. - spannin% tree is de4ned as an undirected tree o+ a connected %rap! <

w!ic! is co'posed o+ a&& t!e vertices and t!e ed%es necessary to connect a&& t!enodes o+ %rap!


30/50

MCQ :Data Structure

Unit 9: Application of Graph

##/. $$$$$$$$ cannot be app&ied +or &inear orderin% in t!e %rap! wit! cyc&es.(a) Topolo&ical sortin&(b) Breadt! 4rst searc!in%(c) Dept! 4rst searc!in%(d) "one o+ t!ese

##0. $$$$$$$$$$ was used +or networ7 ana&ysis(a) Sortin%(b) Searc!in%(c)Network analysis

(d) raversin%##5. opo&o%ica& Sort was used +or networ7 ana&ysis wit! tec!ni2ue (a)18T(b) CM(c) D-<(d) "on

##9. $$$$$$$$ order produced by a topo&o%ica& sort is not uni2ue(a) %ertex(b)nodes(c) points(d) &eve&s

##;. Descriptor_s successor 'ust appear a+ter t!at descriptor in $$$$$$ orderin%

+or topo&o%ica& sort.(a) ando'(b) Linear(c) -&p!abetica&(d)Uni2ue

##=. $$$$$$$ 'ay !ave 'ore t!an one possib&e topo&o%ica& order.(a) DA$(b) BS(c) D@S(d) opo&o%ica& sort

#,?. $$$$$$$is used to 4nd t!e s!ortest pat! between t!e two vertices in awei%!ted directed %rap!

(a) Di*7stra_s -&%orit!'(b) Oas!in% a&%orit!'(c) Breadt! 4rst searc! a&%orit!'(d) Dept! 4rs t a&%orit!'

#,1. !e ti'e re2uired by Di*7stras a&%orit!' is(a) (1???)(b)(n)

(c) (3T3#

(d)8o%(n)#,#. In Di*7stra_s a&%orit!'6 $$$$$$$ are assi%ned to eac! vertex.

(a) ei%!t

#= 3 a % e


31/50

MCQ :Data Structure

(b)8en%t!(c) Cost(d) Labels

#,,. Spannin% tree !as a&& t!e vertex t!at &ies in t!e tree6 but $$$$$$$$$$$$$.(a) it! &oop(b) +ithout loop(c) it!out ed%es(d)"u&&

#,/. !e tota& $$$$$$$o+ a tree is %iven by t!e su' o+ t!e wei%!ts o+ t!e ed%es int!e tree.

(a) Fd%e(b)8abe&(c) +ei&ht(d) Tertex

#,0. ri's a&%orit!' and rus7a&s a&%orit!' w!ic! are a&so 7nown as %reedya&%orit!'s

(a) ri'e_s a&%orit!'(b) rus7a&_s -&%orit!'(c) Boruv7a_s a&%orit!'(d) oth a and b

#,5. $$$$$$$$$$ is very si'i&ar to Di*7stras sin%&esource s!ortest pat! a&%orit!'.(a) 1ri'Is al&orith'(b) rus7a&_s a&%orit!'(c) Boruv7a_s a&%orit!'(d) "one o+ t!ese

#,9. $$$$$$$$ is a&ways not uni2ue.(a) Mini'u' spannin& tree(b) Maxi'u' spannin% tree(c) Spannin% tree(d) Spannin% +orest

#,;. Mini'u' spannin% tree is a %rap! wit! wei%!t $$$$$$$$ t!an or $$$$$$$ tot!e wei%!t o+ every ot!er spannin% tree.

(a) &ess6 %reater(b) less e9ual(c) %reater6 e2ua&(d) %reater6 a&ways %reater

#,=. ri'_s 'ini'u' spannin% tree a&%orit!' is 7nown as $$$$$$$$$$$$ sty&ea&%orit!'

(a) &reedy(b)uni2ue(c) &inear(d)sparse

#/?. !e ̀ "_ stands +or ̀ nondeter'inistic po&yno'ia& ti'e(a) "ode processed(b) "on deter'inistic point(c) Non deter'inistic polyno'ial ti'e(d) "ode po&yno'ia&s

#/1. - prob&e' is said to be po&yno'ia& i+ t!ere exists an a&%orit!' t!at so&vest!e prob&e' in ti'e +or t!e expression &i7e (n) K (nc)6 w!ere c is a constant

(a) o&yno'ia&s(b) node po&yno'ia&s(c) "on deter'inistic po&yno'ia&s(d) deter'inistic po&yno'ia&s

,? 3 a % e


32/50

MCQ :Data Structure

#/#. Fxa'p&e o+ po&yno'ia& prob&e's(a) #(n Lo& n )(b) (F#)(c) 3T3(d) &o%

#/,. -ny prob&e' +or w!ic! t!e answer is eit!er in t!e +or' o+ RFS or " isca&&ed a decision prob&e'.

(a) Decision 1roble'(b) Boo&ean prob&e'(c) -&%orit!' prob&e'(d) "one o+ t!ese

#//. -n a&%orit!' +or a decision prob&e' is ter'ed $$$$$$$.(a) rus7a&_s a&%orit!'(b) Buruv7a_s -&%orit!'(c) Spars a&%orit!'(d) Decision Al&orith'

#/0. -ny prob&e' t!at invo&ves t!e identi4cation o+ an opti'a& so&ution (w!ereso'e va&ue needs to be +ound out as 'ini'iEed or 'axi'iEed) is 7nown as.

(a) Decision rob&e'(b) #pti'iEation 1roble'(c) Identica& rob&e'(d) "one o+ t!ese

#/5. $$$$$$$$$ is used to so&ve an opti'iEation prob&e'.(a) Decision a&%orit!'(b) #pti'iEation al&orith'(c) rus7a&_s a&%orit!'(d) Buruv7a_s a&%orit!'

#/9. -$$$$$$$$ is a se2uence o+ vertices in t!e %rap!6 wit! per!aps an e'ptyse2uence denotin% t!at no pat! exists.

(a) Solution(b) -&%orit!'(c) rob&e'(d) -&& o+ t!ese

#/;. It is very dicu&t to 4nd t!e so&ution +or so'e o+ t!e $$$$$$$$$w!ere t!e'et!odo&o%y o+ 4ndin% its so&ution 'ay be end&ess.

(a) #pti'iEation proble's(b) Decision prob&e's(c) -&%orit!'s prob&e's(d) "one o+ t!ese

#/=. I+ an opti'iEation prob&e' is easy t!en its re&ated decision prob&e' is easyas we&&.

(a) pti'iEation a&%orit!'

(b) Decision proble'(c) Decision a&%orit!'(d) a&& o+ t!e above

#0?. -n a&%orit!' is said to be po&yno'ia&&y bounded i+ its worstcase co'p&exityis bounded by a $$$$$$$$$$$ o+ t!e input siEe.

(a) 1olyno'ial function(b) o&yno'ia& prob&e's(c) Decision prob&e'(d) pti'iEation prob&e'

#01. " represents t!e c&ass o+ $$$$$$$$$ w!ic! can be so&ved in po&yno'ia& ti'eby a nondeter'inistic 'ode& o+ co'putation.

,1 3 a % e


33/50

MCQ :Data Structure

(a) Decision proble's(b) pti'iEation prob&e's(c) Ca&cu&ation prob&e's(d) Searc!in% prob&e's

#0#. $$$$$$ is t!e standard notation +or t!e c&ass o+ a&& "co'p&ete prob&e's(a) N1(b) "(c) CM(d) D@S

#0,. - decision prob&e' F is $$$$$$$$$ i+ every prob&e' in t!e c&ass " ispo&yno'ia&ti'e reducib&e to F.

(a) N1. o'plete(b) " Inco'p&ete(c) "(d) -&& o+ t!ese

#0/. - prob&e' is JJJJJ i+ an a&%orit!' to so&ve it in (deter'inistic) po&yno'ia&ti'e wou&d 'a7e it possib&e to so&ve a&& " prob&e's in po&yno'ia& ti'e.

(a) N1.hard(b) " co'p&ete(c) "Inco'p&ete(d) "one o+ t!ese

#00. - prob&e' is "!ard i+ an a&%orit!' to so&ve it in (deter'inistic) po&yno'ia&ti'e wou&d 'a7e it possib&e to so&ve a&& $$$$$$$$$$$$ prob&e's in po&yno'ia& ti'e.

(a) decision(b) nondeter'inistic(c) N1(d) opti'iEation

,# 3 a % e


34/50

MCQ :Data Structure

4N"T -CG Dyna'ic Me'ory Allocation

#05. 8an%ua%e 8I de4ne dierent $$$$$$$$$ dependin% upon t!e &i+e span andaccess 'et!od o+ t!e variab&es.

(a) variab&e(b) 'e'ory(c) stora&e class(d) Dyna'ic 'e'ory

#09. $$$$$$$$$ b&oc7 a&&ocations are one o+ t!e basic types under dyna'icstora%e a&&ocation

(a) Fixed block and %ariable block (b) 4xed and per'anent(c) variab&e &en%t!(d) none o+ t!ese

#0;. $$$$$$$$ !o&ds basica&&y pro%ra's and t!eir data.(a) Me'ory(b) Tariab&e(c) ro%ra'(d) ointer

#0=. $$$$$$$$$$ data structures &i7e inte%er6 rea&6 or c!aracter variab&e !as t!ec!aracters t!at6 t!eir siEes are speci4ed eit!er exp&icit&y or i'p&icit&y in t!eirdec&arations.

(a) 1ri'iti%e(b) User de4ne(c) "on pri'itive(d) Fxterna& data

#5?. $$$$$$$$$ are i'posin% &i'itations.(a) Static allocation(b) Dyna'ic a&&ocation(c) Co'pi&e ti'e a&&ocation(d) -&& o+ t!ese

#51. Static a&&ocations are 'ana%eab&e +or $$$$$$$$$ +or si'p&e app&ication.(a) 1ri'iti%e data structure(b) 8inear data structure(c) "on&inear data structure(d) Dyna'ic data structure

#5#. $$$$$$$$$ stora%e a&&ocation is t!e si'p&est case o+ dyna'ic stora%ea&&ocation.(a) ando' b&oc7 stora%e(b) First block (c) &ast b&oc7(d) !i%!est b&oc7

#5,. Strai%!t +orward 'et!od in w!ic!6 a&& t!e b&oc7s are o+ (a) "dentical siEe(b) Mini'u' siEe(c) -ppropriate siEe(d) Max siEe

,, 3 a % e


35/50

MCQ :Data Structure

#5/. FU""DF() is used to return t!e (a) b&oc7 o+ 'e'ory(b) pointer o+ 4rst node(c) va&ue o+ node(d) none o+ t!ese

#50. t!e $$$$$$$ is executed it c!ec7s +or t!e avai&abi&ity o+ +ree node in t!e -T-I8&ist and %et a 'e'ory b&oc7

(a) FU""DF()(b) "DF-CCFSS()(c) $8TN#D8()(d) @I"D"DF()

#55. o overco'e t!e disadvanta%es o+ $$$$$$$$ b&oc7s o+ variab&e siEes are used(a) Fixed block stora&e(b) Dyna'ic stora%e(c) Max b&oc7 stora%e(d) Tariab&e &en%t! stora%e

#59. @or dyna'ic stora%e$$$$$$$$ p&ay a vita& +or t!e 'ana%e'ent o+ 'e'oryb&oc7s.

(a) -rray(b)Matrix(c) Linked list(d)Queue

#5;. @ree 'e'ory in t!e +ree stora%e area %enera&&y !o&ds t!e 'e'ory as $$$$$$$$$$$$$$$$$$$$ b&oc7.

(a) conti%uous(b) continuous(c) non.conti&uous(d) noncontinuous

#5=. rocedure $$$$$$$$$$$$$$$$$ wi&& return t!e used b&oc7 o+ 'e'ory to t!e'e'ory poo&.

(a) 8T4NN#D8()(b) -T-I8()(c)


36/50

MCQ :Data Structure

(a) one(b) Two(c) ree(d)@our

#9/. @ra%'entation types(a) ypica& and nontypica&(b) Fxterna& and nonexterna&(c) 8xternal and "nternal(d) Fxtre'e and nonextre'e

#90. $$$$$is a p!eno'enon in w!ic! stora%e space is used inecient&y6 reducin%stora%e capacity and in 'ost cases per+or'ance.

(a) Fra&'entation(b) De+ra%'entation(c) De&etion(d) Insertion

#95. $$$$$$$$$ a&so used to denote t!e wasted space itse&+.(a) Fra&'entation(b)Sp&it(c) Me'ory a&&ocation(d) Dea&&ocation

#99. $$$$$$$$ +ra%'entation occurs w!en 'ore stora%e is a&&ocated t!an isactua&&y re2uested

(a) "nternal(b) Fxterna&(c) Bot! Interna& and externa&(d) "eit!er Interna& nor externa&

#9;. S&ac7 space6 causes a de%radation o+ (a) Syste' perfor'ance(b) ro%ra' per+or'ance(c) rocess !and&in%(d) "one o+ t!ese

#9=. $$$$$$$$$$ +ra%'entation occurs w!en +ree 'e'ory beco'es divided intosevera& s'a&& b&oc7s over ti'e.

(a) 8xternal(b) Interna&(c) Dyna'ic(d) Dea&&ocation

#;?. It is t!e process o+ re&easin% an a&&otted 'e'ory and returnin% it to t!e +ree&ist.

(a) Stora&e elease(b) @ree Me'ory(c) Me'ory 'ana%e'ent

(d) Me'ory a&&ocation#;1. $$$$$$$$ is t!e variab&e indicates t!e startin% point +or searc!in% in t!ea&&ocation routine

(a) MFM$B8C (b) #78(c) -T-I8(d) IFM

#;#. $$$$$$$$ tec!ni2ue is a 'e'ory a&&ocation a&%orit!' t!at divides 'e'oryinto partitions to try to satis+y a 'e'ory re2uest as suitab&y as possib&e.

(a) @ree Me'ory a&&ocation(b) Dyna'ic Me'ory a&&ocation

,0 3 a % e


37/50

MCQ :Data Structure

(c) uddy 'e'ory allocation(d) "one o+ t!ese

#;,. Buddy syste' 'a7es use o+ $$$$$$$$$$ 'e'ory into !a&ves to try to %ive abest4t.

(a) Splittin&(b) Mer%in%(c) Insertin%(d) e'ovin%

#;/. Buddy syste' was invented in 1=5, by(a) =arry MarkowitE(b) Dona&d urt!(c) rus7a&(d) Vi' erry

#;0. !e buddy syste' !as t!e advanta%e t!at it 'ini'iEes t!e $$$$$$$$$+ra%'entation

(a) Interna&(b) Fxterna&(c) Bot! Interna& and externa&(d) "one o+ t!e above

#;5. $$$$$$$ is t!e syste'atic recovery o+ poo&ed co'puter stora%e t!at is bein%used by a pro%ra' w!en t!at pro%ra' no &on%er needs t!e stora%e.

(a) $arba&e ollection(b) Me'ory ecovery(c) Me'ory a&&ocation(d) Me'ory Mana%e'ent

#;9. !is +rees t!e$$$$$$$$$$ +or use by ot!er pro%ra's (or processes wit!in apro%ra').

(a) Stora&e(b) ro%ra'(c) rocess(d) -&& o+ t!e above

#;;.


38/50

MCQ :Data Structure

(c) Double free bu&s(d) Insucient 'e'ory a&&ocation

#=#. In a pro%ra' t!e ob*ects w!ic! can not be reac!ed is ca&&ed (a)


39/50

MCQ :Data Structure

U"I 11 Searc!in% and Sortin% ec!ni2ues

#=5. $$$$$$$$$ is one o+ t!e 'ost +unda'enta& a&%orit!'ic prob&e's.(a) Sortin&(b) raversin%(c) eadin%(d) -ccessin%

#=9. $$$$$can occur in any +or' and it is assu'ed t!at we are %iven a co&&ectiono+ e&e'ents.

(a) Data

(b) Ta&ues(c) Ite's(d) "u&& va&ues

#=;. Bubb&e sort is a strai%!t+orward and si'p&istic 'et!od o+ sortin% data t!at isused very co''on&y.

(a) raversin%(b) ubble sort(c) Quic7 sort(d) Binary sort

#==. Bubb&e sort avera%e case and worst case are bot! (n).(a) (n)(b) #(n> )

(c) 8o%(n)(d) (n &o% n),??. is a %enera& a&%orit!' desi%n paradi%'

(a) Di%ide.and con9uer(b) Divide a&%orit!'(c) Si'p&i+yin%(d) raversin% and Searc!in%

,?1. $$$$$$$$$$$$ is one o+ t!e sortin% tec!ni2ues t!at is typica&&y used +orse2uencin% s'a&& &ists.

(a) Selection sort(b) Mer%e sort(c) Bubb&e sort

(d) adix sort,?#. - ba&anced6 &e+t*usti4ed binary tree in w!ic! no node !as a va&ue %reater

t!an t!e va&ue in its parent.(a) ree(b) =eap(c) Data structure(d)8ist

,?,. $$$$$$$ is a 'uc! 'ore eective type o+ se&ection sort6 and is one o+ t!e+astest sortin% a&%orit!'s.

(a) =eap sort(b) 'er%e sort

,; 3 a % e


40/50

MCQ :Data Structure

(c) Bubb&e sort(d) Se&ection sort

,?/. OF-S() starts wit! 4ndin% t!e $$$$$$$$$$$ o+ t!e array stored at t!eroot

(a) Maxi'u' ele'ent(b) Mini'u' e&e'ent(c) 8ea+ node(d) Interna& node

,?0. Sortin% is t!e process o+ arran%in% t!e content in so'e order based on $$$$$$$$$$ criterion.

(a) 7ey(b) Searc! e&e'ent(c) Ta&ue(d) #rderin&

,?5. Mer%e sort uses $$$$$$$$$$$$$$ tec!ni2ue to sort t!e e&e'ents.(a) Di%ide and con9uer(b) raverse and searc!(c) se2uentia& access(d) ando' searc!

,?9. $$$$$$$$$$$$$$$$$ uses &e+t*usti4ed binary tree to sort t!e e&e'ents.(a) =eap sort(b) Bubb&e sort(c) Binary searc!(d) Se&ection sort

,?;. !ic! a&%orit!' uses MID va&ue to searc!(a) inary(b)8inear(c) Oeap(d)Mer%e

,?=. In binary searc! 'id e&e'ent can be 4nd usin%(a) 'idKsiEe#(b) 'id,(low;hi&h)K>(c) 'idK&owJ!i%!#(d) 'idK'axsiEen

,1?. !e si'p&est type o+ searc!in% process is t!e(a) se9uential search(b) Binary searc!(c) Quic7 searc!(d) -&& o+ t!ese

,11. $$$$$$$$$$$is one o+ t!e +astest ways to searc! t!e e&e'ent in a sortedarray.

(a) inary search

(b) 8inear searc!(c) Se2uentia& searc!(d) Searc!in%

,1#. In Binary searc! array 'ust be(a) S'a&&(b) Sorted(c) 8ar%e(d) "one o+ t!ese

,1,. I+ any searc! e&e'ent is %reater t!en 'id e&e'ent in binary searc! t!enw!ic! o+ t!e +o&&owin% is true

(a) low,'id;-

,= 3 a % e


41/50

MCQ :Data Structure

(b) !i%!K'idJ1(c) &owK'id1(d) !i%!K'id1

,1/. In t!e se2uentia& searc!6 eac! e&e'ent o+ t!e array is co'pared to t!e 7ey6(a) ?ey(b) Ta&ue(c) ointer(d) "u&& va&ue

,10. i'e co'p&exity o+ Se2uentia& searc! is (a) #(n)(b)8o%"(c) (&o% n)(d) "one o+ t!ese

/? 3 a % e


42/50

MCQ :Data Structure

U"I 1# : @i&e Structure,15. -n externa& stora%e device 'ay be de4ned as device ot!er t!an t!e 'ain

'e'ory on w!ic! in+or'ation or data can be stored and +ro' w!ic! t!ein+or'ation retrieved +or processin%.

(a) 8xternal stora&e de%ice(b) Interna& stora%e device(c) Dyna'ic stora%e device(d) Static stora%e device

,19. Fxterna& stora%e devices are !avin% $$$$$$$$ capacities and +ewer expensesto store co'pared to 'ain 'e'ory.

(a) Lar&er(b)Mediu'

(c) S'a&&(d) "one o+ t!ese

,1;. Bubb&e6 se&ection6 insertion and !eap are so'e(a) Searc!in%(b) Sortin&(c) raversin%(d) Insertion

,1=. !e capacity o+ '$$$$$$$$$ain 'e'ory is &i'ited by two +actors6 t!e cost o+'ain 'e'ory and t!e tec!nica& prob&e' in deve&opin% a &ar%e capacity o+ 'ain'e'ory.

(a) Oard dis7(b) Ma%netic tape

(c) Main 'e'ory(d) Fxterna& 'e'ory

,#?. $$$$$$$$$ is an in+or'ation stora%e 'ediu' consistin% o+ a 'a%netisab&ecoatin% on a t!in p&astic strip.

(a) Co'pact dis7(b) Di%ita& dis7(c) Ma&netic tape(d) Oard drive

,#1. D- stands +or(a) Di&ital Audio Tape(b) Di%ita& -ccess ape(c) Direct -udio ape

(d) Direct -ccess ape,##. ee& toree& tape6 co'pact audio cassette6 di%ita& audio tape6 di%ita& &inear

tape or %enera& purpose di%ita& data stora%e are o+ type(a) Interna& Me'ory(b) Fxterna& 'e'ory(c) Main 'e'ory(d) Ma&netic Tape

,#,. Modern 'a%netic tape is 'ost co''on&y pac7a%ed in cartrid%es andcassettes.

(a) Cartrid%es(b) Cassettes

/1 3 a % e


43/50

MCQ :Data Structure

(c) artrid&es and assettes(d) "one o+ t!ese

,#/. !e device t!at per+or's actua& writin% or readin% o+ data is a (a) Oard dis7(b) Tape Dri%e(c) Interna& Drive(d) -&& o+ t!ese

,#0. !en storin% &ar%e a'ounts o+ data$$$$$$ can be substantia&&y &essexpensive t!an dis7 or ot!er data stora%e options.

(a) Tape(b) Oard dis7(c) Di%ita& Dis7 drive(d) Oard dis7 drive

,#5. ape stora%e !as a&ways been used wit! (a) Lar&e co'puter syste'(b) Interna& 'e'ory(c) Data structure(d) S'a&& stora%e option

,#9. Far&y industrystandard 'a%netic tape was $$$$$$$$$ in dia'eter.(a) 1?.0 inc!es(b) 1# inc!es(c) 0.0 inc!es(d) #.0 inc!es

,#;. In 'odern 'a%netic tape syste's t!e ree&s are 'uc! (a) S'aller(b)8ar%er(c) !ic7(d) !in

,#=. - typica& recordin% density was $$$$$ c!aracters per inc!(a) 0#,(b) 0??(c) 9??(d)


44/50

MCQ :Data Structure

(d) -&& o+ t!ese,,/. - $$$$$$$$$$$ is a directaccess or rando'access stora%e device6

(a) Ma%netic tape(b) Ma%netic drive(c) Ma&netic dru'(d) Ma%netic dis7

,,0. Ma%netic dru's were once used as a $$$$$$$ device but !ave since beeni'p&e'ented as auxi&iary stora%e devices.

(a) er'anent stora%e(b) 1ri'ary stora&e(c) ando' stora%e(d) rocessin% stora%e

,,5. Ma%netic dru' is a 'eta& cy&inder coated wit! (a) Ma&netic iron.oxide(b) Ma%netic oxide(c) Iron oxide(d) Carbon xide

,,9. !e $$$$ on a 'a%netic dru' are assi%ned to c!anne&s &ocated around t!ecircu'+erence o+ t!e dru'.

(a) Track (b) ecord(c) Data(d)Sector

,,;. - sin%&e dru' can !ave up to$$$$$$ trac7s.(a) ,??(b) /0?(c) >CC(d) #0?

,,=. !e dru' rotates at a speed o+ up to $$$$$ rp'(a) #???(b) 1???(c) CCC(d) #0??

,/?. - 'a%netic dru' diers +ro' a 'a%netic dis7 in t!at t!e trac7s in w!ic! t!edata is stored are assi%ned to c!anne&s &ocated around t!e circu'+erence o+ t!edru'

(a) Ma&netic disk (b) Ma%netic ape(c) Oard dis7(d) Di%ita& dis7

,/1. !e trac7s on eac! c!anne& are %rouped into sectors.(a) Ma%netic b&oc7

(b)B&oc7(c) Sectors(d) C&usters

,/#. $$$$$$$$$are 'ounted in a !oriEonta& position6 w!i&e ot!ers are 'ounted in avertica& position.

(a) Oard dis7(b) Ma&netic dru'(c) Ma%netic tape(d) Ma%netic dis7

,/,. !e on&y si%ni4cant ti'e re2uired w!en readin% or writin% is t!e $$$$$$$ t!atoccurs in reac!in% a desired record &ocation.

/, 3 a % e


45/50

MCQ :Data Structure

(a) otation ti'e(b) evo&vin% ti'e(c) otation delay(d) evo&vin% de&ay

,//. oday we !ave ,.0inc! Aoppy dis7s wit! a capacity o+ over (a) -25 'b(b)1.# 'b(c) #.0 'b(d)#.? 'b

,/0. !ere are current&y two types o+ dis7s(a) Ma%netic dis7 and 'a%netic tape(b) =ard disk and 3oppy disk (c) Interna& dis7 and externa& dis7(d) "one o+ t!ese

,/5. $$$$$$$$$ are s'a&& sea&ed units t!at contain one or 'ore dis7 p&atters(a) Fixed disk (b) dis7(c) Ma%netic dis7(d) -&& o+ t!ese

,/9. @ixed dis7s are used in 'inico'puters and persona& co'puters.(a) Super co'puter(b) ersona& co'puter(c) Minico'puter(d) oth b and c

,/;. Dividin% t!e dis7 is done so t!at data can be easi&y written and retrieved6w!ic! is 7nown as $$$$$$$$$ t!e dis7.

(a) For'attin&(b) C&usterin%(c) -ccessin%(d)"one

,/=. !e +or'at pro%ra' divides eac! data sur+ace into $$$$$$ (a) Tracks and sector(b) s'a&& b&oc7s(c) rac7s(d)Sectors

,0?. Concentric rin%s6 ca&&ed $$$$$$ are written on t!e dis7 durin% t!e +or'attin%process.

(a) Tracks(b)Sector(c) B&oc7(d) "one

,01. Fac! trac7 is divided into

(a) rac7 b&oc7(b) Sectors(c) C&uster(d) -&& o+ t!ese

,0#. Ma%netic tapes6 'a%netic dis7s6 optica& dis7s are a&& t!e 7ind o+ $$$$$$$$$$$$$$$ stora%e devices.

(a) rocessin% devices(b) Interna& 'e'ory devices(c) 8xternal stora&e de%ices(d) Me'ory devices

// 3 a % e


46/50

MCQ :Data Structure

,0,. - $$$$$ s!ou&d be or%aniEed in suc! a way t!at t!e records are a&waysavai&ab&e +or processin% wit! no de&ay.

(a) File(b) ecord(c) Data(d) "one o+ t!ese

,0/. -$$$$ is a 'eanin%+u& co&&ection o+ re&ated c!aracters.(a) @i&e(b) ecord(c) Field(d) Data

,00. It is t!e s'a&&est &o%ica& data entity t!at is treated as a sin%&e unit in dataprocessin%.

(a) Field(b) ecord(c) Data structure(d)@i&e

,05. @ie&ds are %enera&&y %rouped to%et!er to +or' a (a) Database(b) ecord(c) @i&e(d) Data

,09. - $$$$$$$$$ is a %roup o+ re&ated in+or'ation uni2ue&y identi4ab&e andtreated as a unit.

(a) 8abe& ecord(b) Lo&ical record(c) !ysica& record(d) "one o+ t!ese

,0;. - $$$$$$ is a p!ysica& unit o+ in+or'ation w!ose siEe and record 'ode isconvenient +or a particu&ar input or output device +or t!e stora%e o+ data.

(a) 8o%ica& record(b) Data ecord(c) 1hysical ecord(d) Data va&ue

,0=. $$$$$$$ are nor'a&&y used +or 4&es t!at are stored on 'a%netic tape or directaccess devices.

(a) Label ecord(b) !ysica& record(c) Data record(d) 8o%ica& record

,5?. !ere are $$$$$$ types o+ access on t!e 4&es(a) Two

(b) ne(c) !ree(d)@our

,51. ando' and se2uentia& are (a) File access technics(b) Stora%e tec!nics(c) Insertion tec!nics(d) Sortin% tec!nics

,5#. In$$$$$$$$ t!e 4&es6 data can be stored and accessed rando'&y(a) rando' 6le access(b) 8inear access

/0 3 a % e


47/50

MCQ :Data Structure

(c) Se2uentia& access(d) a&& o+ t!ese

,5,. In $$$$$$$$$ 4&es6 t!e data or text can be stored or read bac7 se2uentia&&y(a) ando' access(b) Se9uential(c) bot! a and b(d) "eit!er a not b

,5/. Se2uentia& processin% is t!e access o+ records one a+ter ot!er in t!e $$$$$$$in w!ic! t!ey appear on t!e 4&e.

(a) 8o%ica& order(b) !ysica& order(c) Manua&&y order(d) none o+ t!ese

,50. @i&e or%aniEation is t!e 'et!odo&o%y w!ic! is app&ied to $$$$$$$$$$$$$co'puter 4&es.

(a) Structured(b) Unstructured(c) Interna&(d) Fxterna&

,55. Ma%netic dis7s and dru's supports bot! $$$$$$$$ and se2uentia& access.(a) ando'(b)Quic7(c) !ysica&(d) 8o%ica&

,59. @i&e or%aniEation re+ers pri'ari&y to t!e &o%ica& arran%e'ent o+ data in a $$$$$$$$$$$$.

(a) @i&e(b) ecord(c) Data(d) File syste'

*2 $$$$$$$$is a tab&e or ot!er data structure t!at !o&ds addresses o+ ot!erindividua& records o+ a 4&e w!ic! contain on&y two data

(a) "ndex File(b)@i&e(c)ecord(d)Data

,5=. It is t!at tab&e w!ic! contains actua& data.(a) Master 6le(b) 8o%ica& @i&e(c) Data base(d) ransaction 4&e

,9?. In a se2uentia& indexed or%aniEation records are stored se2uentia&&y by

$$$$$$$$$va&ue(a) Data va&ue(b) 1ri'ary key(c) +orei%n ey(d) ey va&ue

,91. $$$$$$$ syste's use a &aser to read and write data(a) #ptical disk (b) Di%ita& dis7(c) Oard dis7(d) @&oppy dis7

/5 3 a % e


48/50

MCQ :Data Structure

,9#. $$$$$$$$is a use+u& searc!in% tec!ni2ue6 w!ic! can be used +ori'p&e'entin% indexes.

(a) =ashin&(b) Sortin%(c) De&etin%(d) Searc!in%

/9 3 a % e


49/50

MCQ :Data Structure

/; 3 a % e


50/50

MCQ :Data Structure

Documents

Data File Stucture