50S SYS SYS 3.23 = 3 3.3 Boe OB seis — QUESTION PAPE Ti] | i fei # / In figures) : fawa / Subject : e Computer Sci. & Application et Gf 4 psi at te | ‘Computer Sci, & Application Number of Pages in Booklet : 32 ‘fsa F aeit Gt dea / ‘Number of Questions in Booklet :75 we / Time = 24 We / Hours eta / Maximum Marks : 160 INSTRUCTIONS =” 4. Answer all questions 2. All questions carry equal marks. 3. Only one answer ts fo be gan for each question 4 Ht more than one answers are marked, it would be tested as wrong answer 6. Each quesion has lour llenalive responses maried serially as 4, 2.3.4, You have to darken the covtact 8. There will bo no negative mafaing fr wrong answet T. The cenaiate should ensurg that Rolt Number, Subject Coto and Series Code on the Guest Papir Sooklct and Answer Sheot inust be same affer opening Ihe envelopes, In case they are diferent carded must oan anaher Gueston Peper of he sare Sees. Candia hunee? shall be vesponste r ensuring tris &. Mobile Phone or any other elacronic gadget in the examination haf is strictly prohibited, A candidate found ‘aly any of such objectionable material vith hirvher wll be sirclly cea 2s. per rues. ‘The candidate wil be alowed to cary te carbon pnni-out of OMR Respanse Sheet vk them on conciusiea ‘of the exaranation 10. fete any so of ambanyneike eit of pring of Tet ralue han out of Hin and Engish Version of the question, the Engish Version will be Ualed ae slandard. Warning : If a eandidale is found copying or if any unauthorised material fs found in tisther possession, LR, weuld be isdged againat ewer in the Pokoe Staion and hohe wuld lable tobe prosecuted under Secton 3 of the R.P.E. (Prevention of Uniaireans) Act, 1902, Commission may aise dobar himer permanent from al feture evawinations of the Coremisetan. Fie wh we ee A wt nea of eer EL aa, wea a Sem go & ore AY We 8 Shier vee eT we & ae ds we TM | weer wer fy ae Reiter gre FRA WA 9, ee me 1, 2, 3, 4 ag am me Ba ore wel aE aT vate a 8. TR TT fae ree fy al Bo se | 7. oe om gers Te Hw Bees AW aha a Te Mth ae BP a Re aa =O lr {es Ho oe eT args, Fe ae we wen arr a fs © cae ag Heer rw meron SY a eee en re aye on ee! woe we | eT TTA Aner sl rit 8. wang pan zSeries Bre HR he il wh Pe at mt Rew rn ae a ath 8. rsh one ae sre wae ar ards fh RPE ALOT dE | 0, ae Pe wet Be ware oad goer an caer sere gfe wat wen fed aan ht el sini) war ar ae . neh anne aig ev we rd RT aTaT ss Te | AAG rg ah ak, al we oma fren fs 9 weft of eerd on rer, .& (rgea ee daa) Pe, 1992 & Raat 3:2 an order orbit ne Barn och a wera ed xe eb a eT Faia ae wen EE 03 / COMPSCI33_A] 1 (INNING (Cone.3b BB $3 3 3S A process can follow the sequence’ in order (1) Ready, New, Run, Terminated (2) Blocked, Ready, Terminated, Run 3) New, Ready, Blocked, Run, Terminated @) New, Ready, Run, Terminated we aide fer Fe aa wr A aT am & 7 CQ) Way e, ate 2) Rs, UB, zs, TH G) = tS, are, o, PRs 4) =, We, G, ais A join ‘in RDBMS without any condition is called () Self Join 2) Le Outer Join GB) Right Outer Join (4) Cross Join ‘wy RDBMS fer fit anf & aera & (1) aaa ster Q) we awe ve G) UR onset wigt @) wre ster 3. The Boolean expression for the output F of the multiplexer shown below is R Rr F R R PQ () (Peger): 2 (peger) 6) PHOHR @) (P+Q+R)! Preifafca aed cawt & ameeye & faq ata qa wale zee wae? R Rr F R R PQ a) (r@geR) 2) (PeQ@R) G) P+O4HR @) (P+Q+R)' 03 / COMPSCI33_A] 2 IE] Conta...: 33 3 33 3 3S 3 : 4 ‘What ensures that after successful transaction completion, all updates persist irrespective of system failures ? U) Atomicity (2) Consistency G} Isolation (4) Durability ae ghia ot fy Rete & wh sem wwaagda a mr ewe wmee at Tt Ren be tS aR . () GetiRrar @) whee G) omgeert OMS Consider a direct mapped cache of size 32 KB with block size 32 bytes. ~ The CPU generates 32 bit addresses, The number of bits needed for cache indexing and the mumber of tag bits are respectively. @ 10.17 2) 10,22 @) 15,17 @) 5,17 ner 8 up sete ays Sa wr wT 32 KB wr & Bree are ae 32° ages #1 ihe 32 fre or age tar 1 Sar Sei fe et wear @) faa ake vee a or wae: Sat (dy 1017 (2) 10,22 @) 15,17 @) 517 Which one is true in context of static RAM ? (1) It does not store data in fip-flops (2) It is used in implementing cache memory (G) It is very cheap (4) Used systems main RAM Ske tS wet shew war B 7 () ae Reraara % ere at ete ae aa & @) xe Sa Td at writer were G) Fe aye wen 4) ae fren at aq tH oe e 03 / COMPSC133.A} 3 WAENUMIHLA #Conca...33 3 33 3 33 3 Idemtify Leaf nodes in a binary tree, if given preorder and inorder traversals of the tree are Preorder = ABCDEF Inorder: = BAEDFC (ABC @) BEF (G3) DFC (4) DCE att a Bt fire he ae wire, sath Ra fkoonde okt eonee gama do gan & horde ABCDEF wi-wét > BAEDFC (1) ABC (2) BEF @) DFC (4) DCE Which of the following bit patterns give best performance using Booth's algorithim ? @) 1111 0000 2) 0000 111 (3) 0101 0101 (4) uit ut faafafen & & arom fee tet qa wether a sella F cee aaa oer ar? (111 0000 (2) 0000 1111 @) o101 0101 @) mii Consider a set s=f.oo'}, where « and cot @? cube soots of unity. [f * denotes the multiplication operation, the structure (S, *) forms (1) a group (2) ating (3) an integer Domain (4) a Field wrt fe ww ae S={L0,07} wet @ ott go wa & HA we BI sere * quia ameter BH aater %, ch gear (8, 4) He aT Q) Ge a @ wt G) we fer str @) ww ate 03 / COMPSCI33_A] 4 AANMUUELIMA, Come... 5 ww10 For given set of data if 284 and 34 pass are given , name the sorting algorithm VP data : 13452, 176543, 27384, 22345, 17263, 29340, 98432, 28739, 60785 ard Pass 98432, 28739, 29340, 176543, 22345, 13452, 17263, 27384, 66785 31 Pass : 17263, 29340, 29345, 27384, 98432, 13452, 176543, 28739, 66785 (1) Selection Sort 2) Insertion Son G) Bucket Sort (4) Quick Sort oreifeea srr % ae ete saa facia (2"9 Pass) ett qdtae (3 Pass) ue & fae afta center & UP data : 13452, 176543, 27384, 22345, 17263, 29340, 98432, 28739, 66785 2M Pass : 98432, 28739, 29340, 176543, 22345, 13452, 17263, 27384, 66785, 3"! Pass : 17263, 20340, 22345, 27384, 98432, 13452, 17643, 28739, 66785 Q) waar ae Q) Tran dé @) we ae 4) wate ate Find out the number of page faults using FIFO : 391394 241231242313 a 8 @ 9 @) 10 @ FIFO @ sadrr Yo ma gu ty wee & seat aia ART 31342412312 42313 @ 8 Qs G) 10 @ u 03 / COMPSCI33_A] 5 IAINITINI, (Conta...3 12 B 3 bs 38 For a hypothetical processor, compute result of the below written assembly program assuming status of register as 1 Rp= 2, R= PUSH R,, PUSH Ry, PUSH R; MUL PUSH R, ADD PUSH Rs Ro DIV ADD ao 2) 2 G) 3 a) 4 frais sere & Peg, cree 5 eng, wre aE Preece ge eu trae wey et aor great at “Ry = 1 Ry #2. Ry 3 Ry =A Ry = 20 PUSH R, PUSH R,, PUSH Ry MUL PUSH Ry ADD PUSH R; DIV ADD aot @ 2 @) 3 @ 4 Which project 802 standard provides for a collision free protocol’? G) 802.2 (2) 802.3 (3) 802.5 (4) None of these ér-a site 302 are, efor a weet & fac ae? CG) 802.2 Q) 302.3 (3) 802.5 @) sete 4S ae ae 03 { COMPSCI33_A} 6 HUTT tone...ly 33 3 3.3 3 3.3 3 14 16 You have.an IP address 136.233.42.56 with a subnet mask of 7 bits How many hosts and subnet are possible ? (1) 126 hosts and 510 subnet (2) 128 hosts and 512 subnet (3) 510 hosts and 126 subnet (4) 512 hosts and 128 subnet ws Te ware wR ] 7 bits wea 156.233.4256 w amb, we € 1 fart ae ait aaiz aa t 7 (0 126 the sit sto watz @). 128 He afte 512 wate G) 510 de aie 126 wR (4) 512 aE atte 128 wae The Solution ‘of NP-Complete problem (1) Never gets solved @). Status is unknown (3) Takes polynomial time (4) Takes non-polynomial time wit, Tt wer a aman & Q) wt gowns 8 oT dat 2) Ree at ve Tet G) tenia agra eG) ae dee aga ade Let / be a regular language and Mf.be a context free language, both over the alphabet ¥ Let L° and Mé denote the complements of £ and M respectively. Which of the following statements about the language ISUM® is true (1) It is necessarily regular but not necessarily context free ©) Ic is necessarily context free (3) It is necessarily non-regular (4) none of the above rt Re 1 wae Tae AT & othe Mom eRe TT &, eat at avi 4,1 ott % wmaitive Le otk ve & eater war & at Prafafea ¥ a ata sea mer oye & fie ae & (1) ae tape % ag area WI oat ae @) we artaee St ae & G) ae aa tap Te t () anlar Fa alg we 03 / COMPSCI33_A} 7 IAUELLUEM, Conca...3 33 3 3.3 3 | 17 A polynomial time algorithm makes polynomial number of calls to ! polynomial time subroutine . The resulting algorithm runs in (i) Polynomial time 2) Exponential time (3) Complex. time (None of these we WiReriae ay getter citric ag weed & fu vitae aie Bae aa & at often getter oF aim OC) aitenPet gy Q) Ghent ze G) orga cer (4) ores FS ae ae 18 Which of the following grammars cin be converted as an operator grammar (1) S-+SAS |e, A> Aala (2) S—> SAIbA— Aala G) $-9S8A | eA Aaa (4) None of these foafaea F & ated om, affvter mae A aest at want & (1) S4SAS | ¢,A— Aala i Q) S-+ SABA Aala | GB) SSSA | cA>Aala | (4) ortar Fah alt : 19 Which of the following is an unweighted code ? i (1) 8421 code @) 5211 code (3) Excess 3 code (A) 2421 code far 9 & ahem amide as B 7 (1) 8421 ate (2) $211 ats G) Wee 3 wis (1421 ate 03 / COMPSCI33_A] 8 [OMIA (Contd...55 Ss $3 38 33 8 20 2 2 ‘The minimal expression of F(A,B,C,D) = ¥ (0,5,7,8,9,10,11,14,15) Q) B+ C'+ D! = F(ABCD) (2) F(ABCD) = AC + AB! + BICD' + ABD @) BICD' + AB’ +ABD + AC + BCD : (4) None FAB.C.D) = ¥ (0,5,7,8,9,10,11,14,15) a fier water & () B+ C+ p= ABCD) @) FABCD) = AC + AB! + BICD' + ABD G) BCD + AB’ +A'BD + AC + BCD 4) wig Aer A 4*2 encoder uses the following priorities I, Ip Ip Ty (highest to lowest) if the encoded bits are Y; Yq what is the expression for Y, (MSB) () + hy ty @ hry @ heheh (4) None We 482 wrmlet Pret AAR 1, Ty Ip 1, @arar @ wa) ween A aa Fy wre wretés free Y,; Yy & at Y, (MSB) & waar ar ehh Uy + tly @ th B) thr (4) ae aa The size of PLA is specified by number of (2) input 2) Product tems G) outputs @ All dawn. (PLA) dt wga Pra vat a une at + a) Bye Q) site af G) omeege @ wh 03 / COMPSCI33_A] 9 ARIMA CComre...33 3.3 3 33 3 23 24 How many flip-flops are required to construct a mod-60 counter ? a3 Q4 @) Ss @) 6 Ais-co weet GT & fre Part Reet pay at omega F 7 (3 @ 4 Gy 5 @) 6 in hierarchical model a record type that does not patticipate as parent record type in any’ parent-child relationship type is called (1) Leaf of the hieratchical schema (2) Root of the hierarchical schema G) Parent record set (4) Child record set Soften aise ar ow Rand aga ol Pe Sed oh Ree ~ mes Tere TET Y Yee feet were A um ad Aart ae Heat ( Bafenet fase et site (2) Raftas feet at we G) Bee Ra de (4) ses Poms ae Which of the following is collision resolution method ? (1) Open addressing (2) Chaining 3) Multiple hashing, (4) All of the above Pea 3 & aa Roller ater & 2 Cy ster aeaftir 2) afer 3) TRetaa Bin 4) ort wi 03 / COMPSCI33_A} 10 IAMUHIEMIA). (Comte.3.3 3 3.3 3 33 SB 26 The internet working device that connects two networks together anxd whose sole aim is to trace the best possible route in the given network for transmitting the information is: a) Hab (2) Gateway: GQ) Switch (4) Router wa eee aR eva oh fis at Aeah ot ofan 8 oie sat ort wi me we & fe fq ag Aah ® aad aren dif we, qa a Aort & Ree oar em (1) ee (2) fee G) Rae ay WET 27 If there are 32 segments, each of size IK byte, then the logical address : should have | (1) 13 bits : 2) 14 bits 13) 15 bits ' 16 bits ! ame 32 uike % oie yee gt ae IK age & at alter wa en (13 Rea @) ld Rew G) 15 Ree (4) 16 Pree 03 / COMPSCH33_A] uN IMMER (conta...33 ~3 33 3 3.3 3 28 What is output of the following 7 main( int i= 15 while(i<=32767) t printf("Zed", i), * printi("\n"); ieith 4 B (132768 2) Indefinite loop (3) -32768 (4) 32767 Prefer ar onseqe ean di? main( ) t ‘ int i= 1; while(i<=32767) { printh("%d", i). printi("n"), (ld) 1.32768 @) wi ga a a oe a (3) 32768 (4) 32767 03 | COMPSCI33_A] 12 TILIA, (Cones...3.3 3 33 3 3.3 3 29 What is output of the following 2 main( ) int x; while(x. <=10) { printi("\in%d", x); aon . @) 10 6) Jon () cant say , may be a blank screen Praia a onecye am oor 7 main( } 1 int x i while(x <=10) printf("\ndd", x); @Q) 10 G) 1011 (4) ge wer 8 ot wan, anh wit et watt F nt... * 03 / COMPSCI33_A] 3 (MIE Ly] (Conta...3.3 =~ 3 3.3 ~=3 33 3 430 Which one is true regarding switch case in C language ? (1) The switch executes the case where a match is found and leaves all subsequent cases if we do not use break (2) We need to follow either ascending or descending order in cases (3) Use of break takes control out of switch (1) Both (2) and 3) cum X ate be & def F aa wh 7 aw wre Pare Rie omer ¥ at ea ufisege tar & obe artes we te aa Fone wae wr oer wa ae BL (2) ede 3 wa ore a geertet AS TAA eT Q) ae a gama faa @ Per Far to @) aT Q) sit G) 31 Standard Template Library (STL) provides three derived containers namely (1) Vector, fist, deque (@) Stack, queue and priority-aueue (3) Set, multiset, map (4) None of the above eof watt (61) de Bape war Paget oor Fe (1) tae, fie, BE 2 Ba, ey, wae ey G) a, watz, 39 (4) valet 4 @ ath et 03 COMPSCI33_A] 14 3233 3 33 3 33 3 32 33 What will be output of following C-program ? void foo (int a) { primti("%ed *,--a) if (2>0) foot@-1); j void main() t foo(S).} a) 543210 Q)-012345 G) 135 @) 420 + Prafefiaa C ster wr ensege an em? void foo {int a) { printh(*%d."\--2) if (a0) foola-1); ' void main() { foo(s),} (I) $43210 @) 012345. @) 135 @) 420 An n = 9 array v is defined as follows. The sum of the elements of the array V is V (Lj) = iy for all i, j Ocicml,.0¢j ao Q mt | GQ) n2.3nt2 (4) ni (n-1y/2 ere nn Rv at Prefer was S aeia ona tat oe wee wT oe a ae ear er 1 VEL i) = ij wh & fem i, j Ogignl, Ogjcnt a) 0 Q) ml (3) n2-3n42 4) 2 n-1/2 03 / COMPSCI33_A] 1s TANITIMINE, (Cone...333 33 3 3.3 3 34 The most appropriate matching for following pairs W: Threaded U X: Depth first search 2 Y. Underflow 3 Zz Sorting 4. (3) Wea, X23, ¥-2, Z-d Q @) W-4, X2, V1, 23 @ Peafafrs grt ar Part ster, wae 1 x: bea at wd 2. YY. sisted 3 Zafer 4 (1) W-4, X38, 2, ZA @ @) W-4, X2, ¥-1, Z-3 4) External Stack Graph ‘Tree W-2, X-4, ¥-3, Z-1 W-3, XeL, Yo, 2-2 rere ee are a W-2, X-4, ¥-3, Z-1 W-3, X-1, Yd, 2-2 38. For Ky Seleot the incorrect statement (1) A Nonpianer graph (2) A Biparatite, Graph @) A Complete Graph (4) A Simple Graph Ky fey steer Fat ae 0) Gm Tiere ar Q) we aR Te 3) cw adie a6 (4) ue fers ae 03 / COMPSCI33_A} 16 (ANUMNIQY (Conte.3.3 3 33 3 33 3 36 37 For language {5"a"6™" :n20,m20} select correct statement (1) A regular language (2) A Context-free language (3), A Type-1 Language (4) An invalid language Ao met {orate nz0,m20} ae Gee ar aT Fife (De VaR Tse Q) aH wre — wT TTT 3) WH TeI-1 AT (4) We Tea AIST If jobs are sharing access to @ device bit only one can access the device at one time then it is called (3) Reader's Problem (2) Writer's Problem G) Mutual Exclusion (4) SPOOL . ame af ang 0a Rama at ale @ Foot fe ww an 7 we Rae sia art & arr ® fea on wat & ae Heer F Q) Pree, ster @) URE Wert @) fram GREET 4) Ue The process of giving several meaning to an operator of function is called (1) Abstraction 2) Overloading ) Encapsulation @) | Binding wep weet ar ameter at aE att aed 24 A wire wt aed F1 a cantar @) -sieretfé GQ) TREES @ ser 03 /COMPSCI33_A] 17 (NONININE, !Comee33 3 33 3 $3 3 39 Which of the following conversion is not possible algorithmically ? i (1) Regular grammar to context free grammar, (2) Non-deterministic Finite State Machine to Deterministic Finite State Machine, GB) Non-deterministic Push down Automata to Deterministic Push down * Automata. (4) Non-determit ic Turing Machine to deterministic Turing Machine Freer 4 & abr eee fifties wee oi 2 (), tapre mee & area wt are 2) ai reife wate Re mie a Rextifete mez ee asi | @) oe Reeihfrete ya ero aid dar a Reet yor see viet Fey (4) Tir free Rieder zgftr wie @ RedhPrete eafcr aster 40 RATD Level-l allows - (1) Block-Interleaved Parity (2) Mirroring, G3) Strippingand Mirroring (4) Bit-Interleaved Parity RAID Wee] wae} (1) sire geefirers TE Q) Beitr G) wir att eter 4) fe parties TY 03 / COMPSCI33_A] 18 (HUA tConed...33 3 33 3 3.3 3 42 43 03 / COMPSC133_A] 19 i The range of integers that can be represented by an n-bit 2's complement number system is (1) =28-1 tant — 1) @ -@"- 1) to @ I) GB) 28! to wel” (4) 421+ 1) to (2a) ofie 2's arate par Reed & Pratt ot on eat art yatet a Ya aay 1 GQ) 2 a arta) @ -@l= he ary G) -20-1 @ at @ -erl 40% @rLy In case of Binary Search Algorithm if the number found is present at the: first place then it represents (1) Best Case Q) Average Case @) Worst Case (4) Invalid Case amr argh ad weothe Fei Gor TAT ve eM ee Fiera E at ae eat () sen a Q) Fea ae @) wea te 4) Tea oe ‘The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of 4K* 16 (1) 10 address, 16 data lines (2) 11 address, 8 data lines (3) 12 address, 16 data lines (4) 12 address, 12 data lines Fett ape Bt ara wt vet B wae ae Reeayaé an gaia a afeertier we 1 feat oom a ada atte ster aft 4K* 16 Bae at sraaTT at (1) 10 we, 16 srt wT (2) 11 we, 8 ser ae G) 12 ea, 16 ser aT (4) 12 a, 12 Ser a iL 1Cons33 3 3.3 3 33 3 44 Jn binary max heap containing n numbers, the smallest element can be found in time (O(n) @) O(logn) Q) O(leglogn) (4) 004) ory aete taw 2a Fon eae & at aad wer Bette Peas err F Preto () Of) (2), Oflogn) (3) Offoglogn) @ Oa) The inorder and preorder traversal of a binary tree are dbeafog and abdecty, respectively the post order traversal of the, binagy tree is (1) debfgea @) edbgfca @) edbfgea (4) defebea att & % or onde ote the ands FqeaT dbeateg afk abdeokg * at att 2 & whe onde trae 3 (1) debfgca Q) edbgfca (G3) edbfgca (4) defgbca The subset sum problem is defined as follows: given a set S of n positive integer and positive integer W, determine whether there is a subset of S whose elements sum to W. ‘An algorithm Q solves this problem in O(n\W) time. Which of the following statements is false? (1) Q solves the subset-sum problem in polynomial time when the input is encoded in unary. (2) Q solves the subset-sum problem in polynomial time when the input is encoded in binary. : (3) The subset-sum problem belongs to the class NP (4) The subset sum problem is NP-hard wade-wa sem 22 ufontta at wei % fe n sista Faer sie W wit rier s de & fre iy qe Et um Uther Q ge Wen # O~W) waa F yearn F ch Pret F a aha wat mid F () wa sige att HF crate dar % ct Q Gitte eH FY gade- wa wert Gt gaat & | Q) wa ey were HX case dar F dt Q Tienes ag HY ara A TET at gaat % | G) wate-es we NP wre at efta Gane I (4) wade vier NP oe EI 03 / COMPSCI33_A] 20 {AEUIMNTTY. Conte...decty ta itive #S ving spat ‘put (“33 3 3.3 3 3.3 3 47 The concatenation of two lists is to be performed on O(1) time, Which of the following implementations ofa list should be: used/ (1) Singly finked fist (2) Doubly linked list (3) Ciréular doubly tinked list (4) Array implementation of list fire at sis ae fee 0(1) aa wre F Prey AS aa fhe ory ae & fire waht ah - () Rare Rie fre 2) watt fate feree G) AeA. cae fia fre (4) fre ar Be TAT 48 Suppose each set is represented as a linked list with elements in arbitrary ‘order, Which of the operations among union, intersection, membership, cardinality will be the slowest ? (1) union only (2) Intersection, membership (3) membership, cardinality (4) Union, intersection nat fe aie Be Shem Boa Ale fiver @ Prefer dar & at Prestees a fre wy et ae (1) ferret fete Perea (2) sat fie fre @G) aeaqat sal feta fre G@) fre ar tt petit 03 / COMPSCI33_A} a& B 2 BBB Wie one off the following siaieien! is FALSE » (1) Caion-contex-fiee languages are closed ander union veatenation comtext-fiee languaues are closed ander imersection context-free languawes are closed ‘under « (2 Kleene closure context-itee languages aie closed under ipcete #4 att er goa aaa E e (oat st ne ape & op 8 1 ve wae me EA here Si mer Rene a nee (Osea si saan ait ade & mB 1 ‘s swch of the following case process will be in Zombie state > (1) shen the parent process dies before the child process calls exit(), ' this case the child process becomes’ a zombie process, (2) when! the parent process has vt yet called the wait ), but the child vas called exit(), in this case the child process become ess 2 Zombie 1) when parent process dies before the child and it haswt calied wait), 18 this “cxse the child process becomes a zombie process (none oF above aa FQ wis ar wide aa aud ee a ee (i sa Pee cide wes vide aed exit) calls &@ war em = at ca a 2 ee vide omatd dete car Oy wr ee te, wait) WW ea ¥ RAL USE exit) Geet) Aar PR co Y aye dee mei dae aa b 7 Wee choy age vide @ awk wer dar © the wait) dat & 8 oR Rage vide omag waa dar E Cooter ip abd we OMI AL IPRA (Conca. | |3 SI 52 33 3.3 3 3.3 ~3 To represent a function in a truth table we need a list of the combination of then binary variables Q Nevo @ 20 Gyan (4)? ve gu 2am F watt a eet few, FH on wet aRaw at egET fre a weet at @1 (Nx a @ 20 6) 2 4) Valid bit in each cache is associated with- (1) Each Memory byte in cache (2) Each memory word in cache (3) One bit with the all memory words (4) None of these votes a AH att fee es ma GE ett GQ) Sa wee At ade 2) Ber 8 wee Aare ez ©) wit ae see eer ww Be 4) sada FS ae et Which of the following is the correct simplification of Boolean expression ABC+AC ? (1). BC+AC @) BCH (G) BC @ ac frafefaa 9 a afeat atten A'BCHAC a WF ? (1) BAC @ BCC G) BC @) AC 03 / COMPSCI33_A] 23 IMMNKNY tConed..3.3 ~=3 33 3 3.3 3 Sd 'A simple protocol used for fetching e-mail from a remote mailbox is Which. is defined in RFC 1064 ? (IMAP @) DMSP G) POPS (4) PrGp Sag @t foie fe aaa Ya aT] fee ww fees stata oat F aren & sit fie REC 1064 % venta vot Fae e (1) IMAP (2) DMSP (3) POP3 (4) PrGp When a bad frame is received , the frame relay service ? (1) Simply receive it (2) Simply discard it G) Provide acknowledgement (4) none of these wa te oy ont } at be fe afta we 2? () faa eat dar & @) We ea tart G) igi tm ) water ag ae Which is a method of implementations of IDS (Intrusion Detection System) 7 (1) Signature Identification (2) Recognition and Statistical Anomaly Detection * 3) Both (1) and (2) (4) None of these IDS ear Brat fees) a ary wet & fag ate? (1) Reema ombedfneiart QQ) Ramat ote Rete wire Seat @) FG) ae @ (4) vader 1A aE Te 03 / COMPSCI33_A} 24 UOEINNYE Honea.33 3 3.3 3 33 5 37 In the direct file organization, the key value is mapped directly to the strong location. The usual method of direct mapping is by performing some arithmetic manipulation of the key value . This Process is Known as- (I) Bucket Addressing (2) Hashing, 3) Clashing (4) Direct. Mapping age wie artagis §, ater a wag steers we het ort 3, wren ogee atin a den diver & ea et t oe wee ar wet (1) we WRT @) *ir G) wR @) setae afi A is said to occur when two distinct Key values are mapped to the same storage location (1) Clashing 2) Collision G3) Chaining (4) Probing ae rat Bt end owe Gwe chert oe Pet F at ae wean & Q) Re 2) Biase G) afr (4) stfier 03 / COMPSCI33_A] 25 IMINII) Toned...33 3 33 3 3.3 3 Changing and indexing are the strategics of (1) Contiguous allocation (2) Non-contiguous Allocation (3) Partition allocation (4) _ Static allocation Afi ote PaRRiT a Read Gay F 7 0) arias ber (2) ait were uailebart G) Water ualert 4) Rew Utter 60 A transaction between two memory resident process in 4 multiprogramming system is called (1) Context. switch (2) Mode switch (3) Transaction switch {4) “None of these . adhinnin fren % et ant Ase & gietaat wear & (1) wraae fea (2) tts faa (3) gia Reet (4) edad Fa ate aah 03 / COMPSCI33_A] 26° HWE). tComee..2B 61 62 3 bb OD 3B ob maint.) int counter-40; for{-counter;) counter, pein e"%d" ccs @) 40 is) 6 (4) None of these wie ge ar a? maint} int counter for(.counter,) counter, ° printfi¢%a" counter), U) 40 (2) 40 Go (4) sedan A a at adi A type of inheritance that permits 4 class to have more th nd te inhesit featsres from all ancestors- super (1) Inberitances Q) Muhipie inheritance (3) Subclasses (4) Super classes ua gaia ar yar of wal yrat at gifts age § Oy seer (2) wedtrer wer Gp) wa aan 4) OT Fae care A we a Spel gat wer 03 COMPSCIS3: Aj ay (IRIE eee3.3 3 3.3 3 3.3 3 63 Which of the following is different from the group ? (Private ©) Protected (3) Public (4) Friend fefafaa # @ dow gu @ ome ? QW) wae (@) weaee @) aera @) we + G4 Which is the following statement is false regarding SQL statement ? (1) SOI Statement are not case sensitive (2) SQL statement can be on one or more lines (3) Keywords can be abbreviated or spill across Tines (4) Clauses are usually places on separate lines SOL oar & aad & Pritts 4 a wean et ora & 2 QQ) SQL Bat @) SOL wert cw oft wm & ore adr A on eT E G) take Baier we Moa ore wT Baten @) ware @ on ot YT 65 Which of the following is not valid date types in SQL 7 () CHAR : (2) FLOAT @) CLoB (4) DATE fm Xe ae-a SQL H wa we? (1) CHAR (@) FLOAT @) CLOB (4) DATE 03 / COMPSCI33_A] 28 HIRT, FConea 3 66 or 68 03, 1333 3.3 = 3 3.3 3 ‘The complied form of the definitions is known as (1) Data Dictionary (2) Directory (3) System catalog (4) All of these cftannet ar ogre ar erat & (1) sre feagratt, 2), aiest r G) Fea Seria @) eTtad wh 67 What is the first activity of the prototype model ? (1) Designing of the test model @) Requirement gathering (3). Testing of model (4) None of these adiey vise at afeact aan ehh 7 Q) 2s sist or Soret wen @) aft gaETT G) Fist a te wor @) wider 4 a ws wa 68 Project indicators enable a software project manager to (1) Assess the status of an ongoing project (2) Track Potential risks (3) Uncover problem areas before they " go critical (4) All of the above idee eet, tee Hen at aad wT F () aa @ vitae at See wt te Q) amef shir gwar G) AeRea Aart & wet Per wax art eae @) ster wt 03 / COMPSCI33_A] 29 UHI. Fonte.33 5 33 3 3.3 3 70 n 2 ~ design use information flow characteristics to derive program structures. (1) Procedural (2) Architectural @) User Interface (4) None of these see ea Ros atc wat ier see Gaee H seT @) ae 2) anfieerartet @) eR rer (a) wate FA aE ae What are safest way to edit registry in win 95 ? () Edit Q) REGEDIT (@) DEVICE MANAGER (4) Control Panel Applets sem 05 # oegy ae HH fig aR gees wa? ay wee @ Mise @) Bada Fer (4) aaa tat HAT windows 2000 support creation of which type of volume @) Raid-5 2) Spanned (3) Both (1) and @) (4) None of these seca 2000 Pre are 3 we a TAA we wee a 5 . Q) UE 8) a @ & @ (a arden 3a ate =e Four connected algorithm is used for = () Hidden surface removal (2) Polygon filling @) Line drawing (4) Circle drawing ae BB Gt THT Poa Fae orien X ort #1 a) fet wT uehieat @) ait fafa G) wet eth (4) eta ae 03 | COMPSCI33_A] 30 AQUI, ECO33 3 3.3 3 33 3 73 Weaving is composed of (1) Scaling, translation (2) Rotation, Shearing (3). Scaling, rotation (4) Reflection fafin fore aaa & C1) Safin, greigrt Q) Wem, frafer G) Shin, Wart 4) Retagrt , 74 To rotate a text using HTML , what tag is used ? (1) ROTATE QUEUE @) MARQUE @) ascit (4) None of the above pe urea (text) @t HTML # gare & fay, ae 2a oad ore = a) te Q) ay @G) area @) unter ¥ a ad at 75 Full form of XML is (1) External Modern language @) Extendible Markup language G) External Markup language (4) Executable modeling language We. UF UM. I WT 4m 0) ureta até ae OQ). wattam urbe are GB) oeReta anger aes 4) Weken aetit ae 03/ COMPSCi33 A} 3L INTIME Conta.33 3 3.3 3 3.3 =3 SPACE FOR ROUGH WORK / 34 am & fev oe 03 / COMPSCI33_A] 2 ‘Aun s ONe® of ofe ONhe oMe ofe