Q1. Sorting is a process of arranging a series in either ascending or descending order?

(A) True (B) False

Q2. Merge sort is one of the divide and conquer class of algorith . (A) True (B) False

Q!. Quic" sort does#nt support divide and conquer. (A) $rue (B) False

Q%. &nsertion and deletion in stac" ta"e place at sa e end. (A) True (B) False

Q'. Stac" (ased on F&)* technique. (A) True (B) False

Q+. Stac" is a non,linear data structure. (A) $rue (B) False

Q-. Queue follo. )&F* list. (A) $rue (B) False

Q/. An arra0 is collection of si ilar data t0pe as .ill as dissi ilar. (A) $rue Q1. 20na ic (A) $rue (B) False e or0 allocation is possi(le .hile i ple enting arra0. (B) False e or0 location of the varia(le rather than its contents.

Q13. 4ointer contains onl0 the (A) True (B) False

Q11. 5o need to specif0 .hen declaring pointer .hat the0 are going to point to it. (A) $rue (B) False

Q12. Structure is a collection of users defined data t0pe as .ell as pre,defined t0pe.

(A) True

(B) False ainl0 concerned .ith the accessing structure e (er.

Q1!. $he process of structure is (A) True (B) False

Q1%. 4ointers are used to setup co plicated data structure and are used to lin" varia(les together. (A) True (B) False

Q1'. 2ata structure represent places to store data for use (0 a co puter progra . (A) True (B) False e or0 or in a file.

Q1+. A data structure is the organi6ation of data in a co puter#s (A) True (B) False

Q1-. A(straction is used to suppress irrelevant details .hile at the sa e ti e e phasi6ing. (A) True (B) False echanis to the t0pe#s data

Q1/. *perations of the interface are the one and onl0 access structure. (A) True (B) False

Q11. Structure varia(les cannot (e initiali6ed during declaration. (A) $rue (B) False

Q23. Static data need not (e initiali6ed. (A) $rue (B) False

Q21. 7nar0 operators overloaded for the class can differentiate (et.een pre and post operators. (A) $rue (B) False

Q22. Arra0 of structure can (e created. (A) True (B) False

Q2!. Queue is a linear list for .hich all insertions are deletion at another end. (A) True (B) False

ade at one end of the list and

Q2%. )in"ed list is a collection of records called node8 each containing at least one field that gives the location of the ne9t node in the list. (A) True (B) False

Q2'. A circular list can (e used as a stac"8 queue or a dequeue. (A) True (B) False

Q2+. $he lin"ed list is a ver0 fle9i(le (ut not a d0na ic data structure. (A) $rue (B) False

Q2-. Binar0 search can (etter applied on sorted list. (A) True (B) False

Q2/. A tree consist of finite set of ele ents called nodes and a finite set of directed lines called (ranches8 that connects the nodes. (A) True Q21. $he su (A) True Q!3. A tree root. (A) True (B) False of out,degree and in,degree (ranches equals to the degree of the nodes. (B) False a0 (e divided into su(tree#s. A su(tree is an0 connected structure (elo. the (B) False

% MA:;S Q1. A node is consist of <<<<. and <<<< (A) float8 lin" (B) integer8 lin" (=) Information, link (2) none Q2. >hich of the follo.ing is true for linear search? (A) N comparison to find D in the worst case. N/2 on the a era!e case and one comparison in "est case.

(B) 5?2 to find 2 in the .orst case. 5 co parison on the average case and one co parison on the (est case. (=) 1 co parison to find 2 in the .orst case.5?2 co parison on the average case and 5 co parison in the (est. (2) 5one of these Q!. Select of aspects of pro(le solving. (A) For ulation of algorith . (B) Selection of an appropriate athe atical oles. (=) 2esign of storage structure for the data structure . Ans 1. A and = !. A and 2 2. B and = % A and # on the arra0 2+8 '8 !-8

Q%. $he t.o su( arra0s o(tained (0 appl0ing quic" sort algorith 18 +18 '18 1'8 %/8 11 as first step is@, (A) A1183'81'81B '1 A2+8+18%/8!-B (B) A'81181'8182+B11A'18+18%/8!-B (#) $%%,&,%',%,%&(2),$&',)%,*+,,-( (2) A'8118181'82+B11A'18+18%/8!-B

Q'. =hoose the properties of BS$. 1. Cver0 ele ent has a "e0 and no t.o ele ent have the sa e "e0. 2. $he "e0 in a non e pt0 su(tree ust (e larger that the "e0 in the root of the su(tree. !. $he left and right su(tree are also (inar0 search tree. (A) 1 and 2 (B) 2 and ! (#) % and , (2) 1 8 2 and ! Q+. DEet a node8 store ne. ele ents and insert the ne. node at the topF refers to the inset operation in non,e pt0. (A) .tack (B) Queue (=) Arra0 (2) 5one of these Q-. DFrontG :earG5ullF pointer refers to e pt0@, (A) Stac" (/) 0ueue (=) Arra0 (2) All of a(ove

Q/. $here are <<<.. different traversal used for tree. Ans 12 Three Q1. $he advantage of <<<<. &s that the0 solve the pro(le representation. Ans 12 3ined 3ist Q13. $ree and <<<. are t0pe of non,linear data structure. Ans 4raph Q11. Sorting is (asicall0 of t.o t0pes <<.. and <<<< Ans 12 Internal and 56ternal Q12. $.o verte9 are said to (e <<<< if there is path (et.een the . Ans 12 #onnected Q1!. A directed graph is <<<.. if atleast t.o verte9 are not connected. Ans 12 7eekl8 #onnected Q1%. A graph is <<<. if there is path fro graph. Ans 12 .tron!l8 #onnected Q1'. $.o ain data structures for the representation of graph are used in practice <<<. and <<<. Ans 12 Ad9acenc8 3ist , Ad9acenc8 :etrics Q1+. &5 the depth,first,traversal .e process all of a verte9 descendent (efore <<<<<<.. Ans 12 Ad9acent ;erte6 Q1-. &n the (readth,first,traversal .e process all adHacent verte9 (efore going to the ne9t<<< . Ans 12 3e el ove to an each verte9 to ever0 other verte9 in the of sequential storage

Q1/. A spanning tree of a graph is an <<. tree consisting of onl0 those edges necessar0 to connect all the nodes in the original graph. Ans 12 <ndirected Q11. Mini u spanning tree is a tree that converse all vertices of a net.or" such that the <<<< of the cost of its edges is ini u . Ans 12 .um Q23. Sorting is the process of arranging a series in either <<<. or <<<.. order of their values. Ans 12 Ascendin! and Descendin!