ugc computer science paper 2 solved december 2012

10
1. Write y our ro ll numb er in the s pace p rov ided o n the top o f this page. 2. This paper consists of fifty multiple-choice type of  questions. 3. At the commen cement of ex amination , the question booklet will be given to you. In the first 5 minute s, you are requested to open the booklet and compulsorily examine it as below : (i) To hav e acce ss to the Quest ion Bo okle t, tear o ff the  paper seal on the edge of this cover page. Do not accept a booklet without sticker-seal and do not accept an open booklet. (ii) Tally the number of pages and number of questions in the booklet with the information printed on the cover page. Faulty booklets due to pages/questions missing or duplicate or not in serial order or any other discrepancy should be got replaced immediately by a correct booklet from the invigilator within the period of 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra time will be given. (iii ) After this verifica tion is over, the OMR Sheet Number should be entered on this Test Booklet. 4. Each ite m has fou r altern ativ e respo nses marke d (A), (B) , (C) and (D). You have to darken the circle as indicated below on the correct response against each item. Example : where (C) is the correct response. 5. Y our res ponses to the items ar e to be ind icated in the OMR Sheet given inside the Paper I Booklet only. If you mark at any place other than in the circle in the OMR Sheet, it will not be evaluated. 6. Read in stru ctio ns giv en ins ide ca refu lly . 7. Roug h Work is to be d one in th e end of th is book let. 8. If you write yo ur Name, Roll Numbe r, Phon e Number or  put any mark on any part of the OMR Sheet, ex cept for th e space allotted for the relevant entries, which may disclose your identity, or use abusive language or employ any other unfair means, you will render yourself liable to disqualification. 9. Y ou have to return the test question booklet and Orig inal OMR Sheet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. You are, however, allowed to carry duplicate copy of OMR Sheet on conclusion of examination. 10. Use only Blue/Black Ball point pen. 11. Use of any calculator or log table etc., is prohibited. 12. There is no negative marks for incorrect answers.  Number of Pages in this Booklet : 8  Number of Qu estions in this Bo oklet : 50 Instructions for the Candidates  ¯Ö¸ßõÖÖ Ù£Ö  μ   ÖÖë Ûê ×»Ö‹ ×®Ö¤ì¿Ö D-87-12 1 P.T.O. 1. ¯ÖÆ»Öê  ¯Ö éš Ûê ¯Ö¸ × ®Ö   μ   ÖŸÖ ãÖÖ®Ö ¯Ö¸ †¯Ö®ÖÖ ¸Öê»Ö ®Ö´²Ö¸ ×»Ö×ÜÖ‹ 2. ÃÖ ¯ÖÏ  ¿®Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆã×¾ÖÛ »¯Öß  μ   Ö ¯ÖÏ  ¿®Ö Æï 3. ¯Ö ¸ßõÖ Ö ¯Ö ÏÖ¸´ ³Ö ÆÖê ®Ö ê ¯Ö ¸, ¯Ö Ï¿® Ö-¯Öã  ×ßÖÛ Ö †Ö¯ÖÛ Öê  ¤ê ¤ß •ÖÖ  μ   Öê  ÝÖß … ¯ÖÆ»Öê  ¯ÖÖÑ“Ö ×´Ö®Ö™ †Ö¯ÖÛ Öê ¯ÖÏ¿®Ö-¯Ö ã×ßÖÛ Ö ÜÖÖê»Ö®Ö ê ŸÖ£ÖÖ ˆÃÖÛ ß ×®Ö´®Ö× »Ö×ÜÖŸ Ö  •ÖÖÑ  “Ö Ûê ×»Ö‹ פ  μ   Öê  •ÖÖ  μ   Öë  ÝÖê , וÖà ÖÛ ß •ÖÖÑ “Ö †Ö¯ ÖÛ Öê †¾Ö¿  μ   Ö Û ¸®Öß Æî : (i)  ¯ÖÏ  ¿®Ö-¯Öã  ×ßÖÛ Ö ÜÖÖê  »Ö®Öê  Ûê ×»Ö ‹ ˆÃ ÖÛê Û ¾Ö ¸ ¯Öê  •Ö ¯Ö¸ »ÖÝÖß Û ÖÝÖ•Ö  Û ß ÃÖß»Ö Û Öê ± Ö›Ì »Öë ÜÖã»Öß Æã‡Ô  μ   ÖÖ ×²Ö®ÖÖ Ã™ß Û ¸-ÃÖ ß»Ö Û ß  ¯Öã  ×ßÖÛ Ö Ã¾ÖßÛ Ö¸ ®Ö Û ¸ë (ii)  Û ¾Ö¸ ¯Öé  Âš ¯Ö¸ ”¯Öê  ×®Ö¤ì¿ÖÖ®ÖãÃÖÖ¸ ¯ÖÏ  ¿®Ö-¯Öã  ×ßÖÛ Ö Ûê ¯Öéš ŸÖ£ÖÖ  ¯ÖÏ  ¿®ÖÖë Û ß ÃÖÓÜ  μ   ÖÖ Û Öê †“” ß ŸÖ¸Æ “Öî  Û Û ¸ »Öë ×Û  μ   Öê ¯Öæ¸ê  Æï … ¤Öê  ÂÖ¯Öæ  ÞÖÔ  ¯Öã  ×ßÖÛ Ö ×•Ö®Ö ´Öë  ¯Öé  Âš/¯ÖÏ  ¿®Ö Û ´Ö ÆÖë   μ   ÖÖ ¤ã²ÖÖ¸Ö †Ö  ÝÖ  μ   Öê  ÆÖë   μ   ÖÖ ÃÖß׸  μ   Ö»Ö ´Öë  ®Ö ÆÖë †£ÖÖÔ  ŸÖË  ×Û ÃÖß ³Ö ß ¯ÖÏ  Û Ö¸ Û ß  ¡Öã×™ ¯ÖæÞÖ Ô ¯Öã×à ŸÖÛ Ö Ã¾ÖßÛ Ö¸ ®Ö Û ¸ë ŸÖ£ÖÖ ˆÃÖß ÃÖ´Ö  μ   Ö ˆÃÖê  »ÖÖî™ÖÛ ¸ ˆÃÖÛê ãÖÖ®Ö ¯Ö¸ ¤æÃÖ¸ß ÃÖÆß ¯ÖÏ  ¿®Ö-¯Öã×ßÖÛ Ö »Öê  »Öë   ‡ÃÖÛê ×»Ö‹ †Ö¯ÖÛ Öê  ¯ÖÖÑ  “Ö ×´Ö®Ö™ פ  μ   Öê  •ÖÖ  μ   Öë  ÝÖê  … ˆÃÖ Ûê ²ÖÖ¤ ®Ö  ŸÖÖê  †Ö¯Ö Û ß ¯ÖÏ  ¿®Ö -¯Öã  ×ÃŸÖ Û Ö ¾ÖÖ ¯ÖÃÖ »Öß •ÖÖ  μ   Öê  ÝÖß †Öî  ¸ ®Ö Æß †Ö¯ ÖÛ Öê †×ŸÖ׸ŒŸÖ ÃÖ´Ö  μ   Ö פ  μ   ÖÖ •ÖÖ  μ   Öê  ÝÖÖ … (iii)  ‡ÃÖ •ÖÖÑ“Ö Ûê ²ÖÖ¤ OMR  ¯Ö ¡Ö Û Û ß ÛÎ ´Ö ÃÖ ÓÜ  μ   ÖÖ ‡ÃÖ ¯ÖÏ  ¿®Ö-¯Öã  ×ßÖÛ Ö  ¯Ö¸ †Ó  ×Û ŸÖ Û ¸ ¤ë 4.  ¯ÖÏ  Ÿ  μ   Öê  Û ¯ÖÏ  ¿®Ö Ûê ×»Ö‹ “ÖÖ¸ ˆ¢Ö¸ ×¾ÖÛ »¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) ×¤  μ   Öê  ÝÖ  μ   Öê  Æï … †Ö¯Ö Û Öê ÃÖ Æß ˆ¢Ö¸ Ûê ¾Öé  ¢Ö Û Öê ¯Öê®Ö ÃÖê  ³Ö ¸Û ¸ Û Ö»ÖÖ Û ¸®Ö Ö Æ  •ÖîÃÖÖ ×Û ®Öß“Öê  ×¤ÜÖÖ  μ   ÖÖ ÝÖ  μ   ÖÖ Æî  ˆ¤ÖÆ ¸ÞÖ :  •Ö²Ö×Û (C) ÃÖÆß ˆ¢Ö¸ Æî 5. ¯ÖÏ  ¿®ÖÖë  Ûê ˆ¢ Ö¸   Ûê ¾Ö» Ö ¯ÖÏ  ¿®Ö ¯Ö¡Ö I Ûê †® ¤¸ פ   μ   Öê  ÝÖ  μ   Öê  OMR  ¯Ö¡ÖÛ ¯Ö¸ Æß †Ó ×Û ŸÖ Û ¸®Ö  Æï …  μ   Öפ †Ö¯Ö OMR  ¯Ö¡ ÖÛ ¯Ö¸ פ   μ   Öê ÝÖ  μ   Öê ¾Öé¢Ö Ûê †»ÖÖ¾ÖÖ  ×Û ÃÖß † ®  μ   Ö Ã£Ö Ö®Ö ¯Ö¸ ˆ¢Ö¸ דÖÅ® ÖÖÓ×Û ŸÖ Û ¸Ÿ Öê Æï , ŸÖÖ ê ˆÃÖÛ Ö ´Öæ »  μ   ÖÖÓÛ ®Ö  ®ÖÆ à Æ ÖêÝÖ Ö … 6. †®¤¸ פ   μ   Öê  ÝÖ  μ   Öê  ×®Ö¤ì¿ÖÖë  Û Öê  ¬  μ   ÖÖ®Ö¯Öæ  ¾ÖÔ  Û ¯ÖœÌ   ë 7. Û“ ÖÖ ÛÖ´ Ö (Rough Work) ‡ÃÖ ¯Öã×ß ÖÛ Ö Ûê †×®ŸÖ´Ö ¯Öé  Âš ¯Ö¸ Û ¸ë 8.  μ   Öפ †Ö¯Ö OMR  ¯Ö¡Ö Û ¯Ö¸ ×® Ö   μ   ÖŸÖ ãÖÖ®Ö Ûê †»ÖÖ¾ÖÖ †¯Ö®ÖÖ ®ÖÖ´Ö, ¸Öê»Ö  ®Ö´²Ö¸, ± Öê  ®Ö ®Ö´²Ö¸  μ   ÖÖ Û Öê  ‡Ô  ³Öß ‹êÃÖÖ ×“ÖÅ®Ö ×• ÖÃÖÃÖê †Ö¯ ÖÛ ß ¯ÖÆ“ÖÖ®Ö ÆÖê  ÃÖÛê , †Ó  ×Û ŸÖ Û ¸ŸÖê Æï †£Ö¾ÖÖ †³Ö¦ ³ÖÖÂÖÖ Û Ö ¯ÖÏ  μ   ÖÖê  ÝÖ Û ¸ŸÖê  Æï,  μ   ÖÖ Û Öê‡Ô †®  μ   Ö †®Öã  ×“ÖŸÖ ÃÖÖ¬Ö®Ö Û Ö ¯ÖÏ  μ   ÖÖê  ÝÖ Û ¸ŸÖê Æï, ŸÖÖê ¯Ö¸ßõÖÖ Ûê ×»Ö  μ   Öê   μ   ÖÖêÝ  μ   Ö  ‘ÖÖê  ×ÂÖŸÖ ×Û   μ   Öê  •ÖÖ ÃÖ Û ŸÖê Æ ï … 9. †Ö¯ÖÛÖ  ¯Ö¸ßõÖÖ ÃÖ´ÖÖ¯ŸÖ ÆÖê  ®Öê ¯Ö¸ ¯ÖÏ  ¿®Ö-¯Öã×ßÖÛ Ö ‹¾ÖÓ  ´Öæ»Ö OMR  ¯Ö¡ÖÛ   ×®Ö¸ßõÖÛ ´ÖÆÖê  ¤  μ   Ö Û Öê » ÖÖî  ™Ö®ÖÖ †Ö¾Ö¿  μ   ÖÛ Æî †Öî  ¸ ¯Ö¸ßõÖÖ ÃÖ´ÖÖׯŸÖ Ûê ²ÖÖ¤  ˆÃÖê  †¯Ö®Öê ÃÖÖ£Ö ¯Ö¸ßõÖÖ ³Ö¾Ö®Ö ÃÖê  ²ÖÖƸ ®Ö »Ö êÛ ¸ •ÖÖ   μ   Öë  … ÆÖ»ÖÖÓ  ×Û †Ö¯Ö  ¯Ö¸ßõÖÖ ÃÖ´ÖÖׯŸÖ ¯Ö¸ OMR  ¯Ö¡ ÖÛ Û ß ›ã ¯» ÖßÛ ™ ¯ÖÏ  ×ŸÖ †¯Ö®Öê  ÃÖÖ£Ö »Öê •ÖÖ  ÃÖÛ ŸÖê Æï … 10.  Ûê ¾Ö»Ö ®Öß»Öê Ö» Öê  ²ÖÖ»Ö ¯¾ÖÖ‡Õ  ¯Öê  ®Ö Û Ö Æß ‡ÃŸÖê  ´ÖÖ»Ö Û ¸ë 11.  ×Û ÃÖß ³Öß ¯ÖÏ  Û Ö¸ Û Ö ÃÖÓ  ÝÖÞÖÛ (Ûî »ÖÛã »Öꙸ)  μ   ÖÖ »ÖÖÝÖ ™ê²Ö»Ö †Öפ Û Ö  ¯ÖÏ  μ   ÖÖêÝÖ ¾ÖÙ•ÖŸÖ Æî 12.  ÝÖ»ÖŸÖ ˆ¢Ö¸Öë  Ûê ×»Ö ‹ Û Öê‡ Ô †Ó  Û Û Ö™ê ®ÖÆà •ÖÖ‹Ñ  ÝÖê … [Maximum Marks : 100 Time : 1 1  / 4  hours] PAPER-II COMPUTER SCIENCE AND APPLICATIONS (To be filled by the Candidate) Signature and Name of Invigilator OMR Sheet No. : ............................................... Roll No. (In words) 1. (Signature) __________________________ (Name) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ Roll   No. ___ ______ 8 7 (In figures as per admission card) D 1 2 www.examrace.com

Upload: tanyagoswami11

Post on 04-Jun-2018

218 views

Category:

Documents


0 download

TRANSCRIPT

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 110

1 Write your roll number in the space provided on the top of

this page2 This paper consists of fifty multiple-choice type of

questions3 At the commencement of examination the question booklet

will be given to you In the first 5 minutes you are requested to open the booklet and compulsorily examine it as below (i) To have access to the Question Booklet tear off the

paper seal on the edge of this cover page Do not accepta booklet without sticker-seal and do not accept anopen booklet

(ii) Tally the number of pages and number of questionsin the booklet with the information printed on thecover page Faulty booklets due to pagesquestionsmissing or duplicate or not in serial order or anyother discrepancy should be got replaced immediately

by a correct booklet from the invigilator within theperiod of 5 minutes Afterwards neither theQuestion Booklet will be replaced nor any extratime will be given

(iii) After this verification is over the OMR Sheet Number should be entered on this Test Booklet

4 Each item has four alternative responses marked (A) (B)(C) and (D) You have to darken the circle as indicated belowon the correct response against each itemExample where (C) is the correct response

5 Your responses to the items are to be indicated in the OMRSheet given inside the Paper I Booklet only If you mark at any place other than in the circle in the OMR Sheet it willnot be evaluated

6 Read instructions given inside carefully7 Rough Work is to be done in the end of this booklet8 If you write your Name Roll Number Phone Number or

put any mark on any part of the OMR Sheet except for thespace allotted for the relevant entries which may discloseyour identity or use abusive language or employ any other unfair means you will render yourself liable todisqualification

9 You have to return the test question booklet and OriginalOMR Sheet to the invigilators at the end of the examinationcompulsorily and must not carry it with you outside theExamination Hall You are however allowed to carryduplicate copy of OMR Sheet on conclusion of examination

10 Use only BlueBlack Ball point pen11 Use of any calculator or log table etc is prohibited

12 There is no negative marks for incorrect answers

Number of Pages in this Booklet 8 Number of Questions in this Booklet 50

Instructions for the Candidates macrOumlcedilszligotildeOumlOumlUgravepoundOuml μ OumlOumleuml Ucircecirc timesraquoOumllsaquo timesregOumlcurrenigraveiquestOuml

D-87-12 1 PTO

1 macrOumlAEligraquoOumlecirc macrOumleacuteAcircš Ucircecirc permil macrOumlcedil timesregOuml μ OumlŸOuml AtildepoundOumlOumlregOuml macrOumlcedil daggermacrOumlregOumlOuml cedilOumlecircraquoOuml regOumlacutesup2Oumlcedil timesraquoOumltimesUumlOumllsaquo hellip

2 DaggerAtildeOuml macrOumlIuml iquestregOuml-macrOumliexclOuml acuteOumleuml macrOumlldquoOumlOumlAtildeOuml sup2OumlAEligatildetimesfrac34OumlUcirc raquomacrOumlszlig μ Ouml macrOumlIuml iquestregOuml AEligiuml hellip3 macrOuml szligotildeOumlOuml macrOumlIumlOumlcedil sup3Ouml AEligOumlecircregOumlecirc macrOuml macrOumlIumliquestregOuml-macrOumlatilde timesAtildeŸOumlUcirc Ouml daggerOumlmacrOumlUcirc Oumlecirc currenecirc currenszlig bullOumlOuml μ Oumlecirc YacuteOumlszlig hellip macrOumlAEligraquoOumlecirc

macrOumlOumlNtildeldquoOuml timesacuteOumlregOumltrade daggerOumlmacrOumlUcirc Oumlecirc macrOumlIumliquestregOuml-macrOuml atildetimesAtildeŸOumlUcirc Ouml UumlOumlOumlecircraquoOumlregOuml ecirc ŸOumlpoundOumlOuml ˆAtildeOumlUcirc szlig timesregOumlacuteregOumltimesraquoOumltimesUumlOumlŸ Ouml bullOumlOumlNtilde ldquoOuml Ucircecirc timesraquoOumllsaquo timescurren μ Oumlecirc bullOumlOuml μ Oumleuml YacuteOumlecirc timesbullOumlAtildeOumlUcirc szlig bullOumlOumlNtildeldquoOuml daggerOuml OumlUcirc Oumlecirc daggerfrac34Oumliquest μ Ouml Ucirc cedilregOumlszlig AEligicirc (i) macrOumlIuml iquestregOuml-macrOumlatilde timesAtildeŸOumlUcirc Ouml UumlOumlOumlecirc raquoOumlregOumlecirc Ucircecirc timesraquoOumllsaquo ˆAtildeOumlUcircecirc Ucirc frac34Ouml macrOumlecirc bullOuml macrOumlcedil raquoOumlYacuteOumlszlig Ucirc OumlYacuteOumlbullOuml

Ucirc szlig AtildeOumlszligraquoOuml Ucirc Oumlecirc plusmn OumlrsaquoIgrave raquoOumleuml hellip UumlOumlatilderaquoOumlszlig AEligatildeDaggerOcirc μ OumlOuml timessup2OumlregOumlOuml AtildetradeszligUcirc cedil-AtildeOuml szligraquoOuml Ucirc szlig macrOumlatilde timesAtildeŸOumlUcirc Ouml Atildefrac34OumlszligUcirc Oumlcedil regOuml Ucirc cedileuml hellip

(ii) Ucirc frac34Oumlcedil macrOumleacute Acircš macrOumlcedil rdquomacrOumlecirc timesregOumlcurrenigraveiquestOumlOumlregOumlatildeAtildeOumlOumlcedil macrOumlIuml iquestregOuml-macrOumlatilde timesAtildeŸOumlUcirc Ouml Ucircecirc macrOumleacuteAcircš ŸOumlpoundOumlOuml macrOumlIuml iquestregOumlOumleuml Ucirc szlig AtildeOumlOacuteUuml μ OumlOuml Ucirc Oumlecirc daggerldquordquoszlig ŸOumlcedilAElig ldquoOumlicirc Ucirc Ucirc cedil raquoOumleuml timesUcirc μ Oumlecirc macrOumlaeligcedilecirc AEligiuml hellip currenOumlecirc AcircOumlmacrOumlaelig THORNOumlOcirc macrOumlatilde timesAtildeŸOumlUcirc Ouml timesbullOumlregOuml Oumleuml macrOumleacute AcircšmacrOumlIuml iquestregOuml Ucirc acuteOuml AEligOumleuml μ OumlOuml currenatildesup2OumlOumlcedilOuml daggerOuml YacuteOuml μ Oumlecirc AEligOumleuml μ OumlOuml AtildeOumlszligtimescedil μ OumlraquoOuml acuteOumleuml regOuml AEligOumleuml daggerpoundOumlOumlOcirc ŸOumlEuml timesUcirc AtildeOumlszlig sup3Oumlszlig macrOumlIuml Ucirc Oumlcedil Ucirc szlig iexclOumlatildetimestrade macrOumlaeligTHORNOuml Ocirc macrOumlatildetimesAtildeŸOumlUcirc Ouml Atildefrac34OumlszligUcirc Oumlcedil regOuml Ucirc cedileuml ŸOumlpoundOumlOuml ˆAtildeOumlszlig AtildeOumlacuteOuml μ Ouml ˆAtildeOumlecirc raquoOumlOumlicirctradeOumlUcirc cedil ˆAtildeOumlUcircecirc AtildepoundOumlOumlregOuml macrOumlcedil currenaeligAtildeOumlcedilszlig AtildeOumlAEligszlig macrOumlIuml iquestregOuml-macrOumlatildetimesAtildeŸOumlUcirc Ouml raquoOumlecirc raquoOumleuml hellip DaggerAtildeOumlUcircecirc timesraquoOumllsaquo daggerOumlmacrOumlUcirc Oumlecirc macrOumlOumlNtilde ldquoOuml timesacuteOumlregOumltrade timescurren μ Oumlecirc bullOumlOuml μ Oumleuml YacuteOumlecirc hellip ˆAtildeOumlUcircecirc sup2OumlOumlcurren regOuml

ŸOumlOumlecirc daggerOumlmacrOumlUcirc szlig macrOumlIuml iquestregOuml-macrOumlatilde timesAtildeŸOumlUcirc Ouml frac34OumlOuml OumlAtildeOuml raquoOumlszlig bullOumlOuml μ Oumlecirc YacuteOumlszlig daggerOumlicirc cedil regOuml AEligszlig daggerOuml OumlUcirc OumlecircdaggertimesŸOumltimescedilŒŸOuml AtildeOumlacuteOuml μ Ouml timescurren μ OumlOuml bullOumlOuml μ Oumlecirc YacuteOumlOuml hellip

(iii) DaggerAtildeOuml bullOumlOumlNtildeldquoOuml Ucircecirc sup2OumlOumlcurren OMR macrOumliexclOumlUcirc Ucirc szlig UcircIcirc acuteOuml AtildeOumlOacuteUuml μ OumlOuml DaggerAtildeOuml macrOumlIuml iquestregOuml-macrOumlatilde timesAtildeŸOumlUcirc Ouml macrOumlcedil daggerOacute timesUcirc ŸOuml Ucirc cedil curreneuml hellip

4 macrOumlIuml Ÿ μ Oumlecirc Ucirc macrOumlIuml iquestregOuml Ucircecirc timesraquoOumllsaquo ldquoOumlOumlcedil ˆcentOumlcedil timesfrac34OumlUcirc raquomacrOuml (A) (B) (C) ŸOumlpoundOumlOuml (D) timescurren μ Oumlecirc YacuteOuml μ Oumlecirc AEligiuml hellip daggerOumlmacrOumlUcirc Oumlecirc AtildeOumlAEligszlig ˆcentOumlcedil Ucircecirc frac34Oumleacute centOuml Ucirc Oumlecirc macrOumlecircregOuml AtildeOumlecirc sup3Ouml Ucirc cedil Ucirc OumlraquoOumlOuml Ucirc cedilregOumlOuml AEligicirc bullOumlicircAtildeOumlOuml timesUcirc regOumlszligldquoOumlecirc timescurrenUumlOumlOuml μ OumlOuml YacuteOuml μ OumlOuml AEligicirc hellip ˆcurrenOumlAEligcedilTHORNOuml bullOumlsup2OumltimesUcirc (C) AtildeOumlAEligszlig ˆcentOumlcedil AEligicirc hellip

5 macrOumlIuml iquestregOumlOumleuml Ucircecirc ˆcentOumlcedil Ucircecirc frac34OumlraquoOuml OumlIuml iquestregOuml macrOumliexclOuml I Ucircecirc daggerregcurrencedil timescurren μ Oumlecirc YacuteOuml μ Oumlecirc OMR macrOumliexclOumlUcirc macrOumlcedil AEligszligdaggerOacutetimesUcirc ŸOuml Ucirc cedilregOumlecirc AEligiuml hellip μ Oumltimescurren daggerOumlmacrOuml OMR macrOumliexclOumlUcirc macrOumlcedil timescurren μ Oumlecirc YacuteOuml μ Oumlecirc frac34OumleacutecentOuml Ucircecirc daggerraquoOumlOumlfrac34OumlOuml timesUcirc AtildeOumlszlig daggerreg μ Ouml AtildepoundOuml OumlregOuml macrOumlcedil ˆcentOumlcedil timesldquoOumlAringreg OumlOumlOacutetimesUcirc ŸOuml Ucirc cedilŸ Oumlecirc AEligiuml ŸOumlOuml ecirc ˆAtildeOumlUcirc Ouml acuteOumlaeligraquo μ OumlOumlOacuteUcirc regOuml regOumlAElig agrave AElig OumlecircYacuteOuml Ouml hellip

6 daggerregcurrencedil timescurren μ Oumlecirc YacuteOuml μ Oumlecirc timesregOumlcurrenigraveiquestOumlOumleuml Ucirc Oumlecirc not μ OumlOumlregOumlmacrOumlaelig frac34OumlOcirc Ucirc macrOumlœIgrave euml hellip

7 Ucirc ldquoldquoOumlOuml Ucirc Ouml Ouml (Rough Work) DaggerAtildeOuml macrOumlatildetimesAtildeŸOumlUcirc Ouml Ucircecirc daggertimesregŸOumlacuteOuml macrOumleacute Acircš macrOumlcedil Ucirc cedileuml hellip8 μ Oumltimescurren daggerOumlmacrOuml OMR macrOumliexclOumlUcirc macrOumlcedil timesregOuml μ OumlŸOuml AtildepoundOumlOumlregOuml Ucircecirc daggerraquoOumlOumlfrac34OumlOuml daggermacrOumlregOumlOuml regOumlOumlacuteOuml cedilOumlecircraquoOuml

regOumlacutesup2Oumlcedil plusmn Oumlecirc regOuml regOumlacutesup2Oumlcedil μ OumlOuml Ucirc Oumlecirc DaggerOcirc sup3Oumlszlig lsaquoecircAtildeOumlOuml timesldquoOumlAringregOuml timesbullOumlAtildeOumlAtildeOumlecirc daggerOuml OumlUcirc szlig macrOumlAEligldquoOumlOumlregOuml AEligOumlecirc AtildeOumlUcircecirc daggerOacute timesUcirc ŸOuml Ucirc cedilŸOumlecirc AEligiuml daggerpoundOumlfrac34OumlOuml daggersup3Oumlbrvbar sup3OumlOumlAcircOumlOuml Ucirc Ouml macrOumlIuml μ OumlOumlecirc YacuteOuml Ucirc cedilŸOumlecirc AEligiuml μ OumlOuml Ucirc OumlecircDaggerOcircdaggerreg μ Ouml daggerregOumlatilde timesldquoOumlŸOuml AtildeOumlOumlnotOumlregOuml Ucirc Ouml macrOumlIuml μ OumlOumlecirc YacuteOuml Ucirc cedilŸOumlecirc AEligiuml ŸOumlOumlecirc macrOumlcedilszligotildeOumlOuml Ucircecirc timesraquoOuml μ Oumlecirc dagger μ OumlOumlecircYacute μ Ouml lsquoOumlOumlecirc timesAcircOumlŸOuml timesUcirc μ Oumlecirc bullOumlOuml AtildeOumlUcirc ŸOumlecirc AEligiuml hellip

9 daggerOumlmacrOumlUcirc Oumlecirc macrOumlcedilszligotildeOumlOuml AtildeOumlacuteOumlOumlmacrŸOuml AEligOumlecirc regOumlecirc macrOumlcedil macrOumlIuml iquestregOuml-macrOumlatildetimesAtildeŸOumlUcirc Ouml lsaquofrac34OumlOacute acuteOumlaeligraquoOuml OMR macrOumliexclOumlUcirc timesregOumlcedilszligotildeOumlUcirc acuteOumlAEligOumlecirc curren μ Ouml Ucirc Oumlecirc raquoOumlOumlicirc tradeOumlregOumlOuml daggerOumlfrac34Oumliquest μ OumlUcirc AEligicirc daggerOumlicirc cedil macrOumlcedilszligotildeOumlOuml AtildeOumlacuteOumlOumltimesmacrŸOuml Ucircecirc sup2OumlOumlcurren ˆAtildeOumlecirc daggermacrOumlregOumlecirc AtildeOumlOumlpoundOuml macrOumlcedilszligotildeOumlOuml sup3Oumlfrac34OumlregOuml AtildeOumlecirc sup2OumlOumlAEligcedil regOuml raquoOumlecircUcirc cedil bullOumlOuml μ Oumleuml hellip AEligOumlraquoOumlOumlOacute timesUcirc daggerOumlmacrOuml macrOumlcedilszligotildeOumlOuml AtildeOumlacuteOumlOumltimesmacrŸOuml macrOumlcedil OMR macrOumliexclOumlUcirc Ucirc szlig rsaquoatilde raquoOumlszligUcircecirc trade macrOumlIuml timesŸOuml daggermacrOumlregOumlecirc AtildeOumlOumlpoundOuml raquoOumlecirc bullOumlOuml AtildeOumlUcirc ŸOumlecirc AEligiuml hellip

10 Ucircecirc frac34OumlraquoOuml regOumlszligraquoOumlecircUcirc OumlraquoOumlecirc sup2OumlOumlraquoOuml macrfrac34OumlOumlDaggerOtilde trade macrOumlecirc regOuml Ucirc Ouml AEligszlig DaggerAtildeŸOumlecirc acuteOumlOumlraquoOuml Ucirc cedileuml hellip11 timesUcirc AtildeOumlszlig sup3Oumlszlig macrOumlIuml Ucirc Oumlcedil Ucirc Ouml AtildeOumlOacute YacuteOumlTHORNOumlUcirc (Ucircicirc raquoOumlUcircatilde raquoOumlecirctradecedil) μ OumlOuml raquoOumlOumlYacuteOuml tradeecircsup2OumlraquoOuml daggerOumltimescurren Ucirc Ouml

macrOumlIuml μ OumlOumlecircYacuteOuml frac34OumlUgravebullOumlŸOuml AEligicirc hellip

12 YacuteOumlraquoOumlŸOuml ˆcentOumlcedilOumleuml Ucircecirc timesraquoOumllsaquo Ucirc OumlecircDaggerOcirc daggerOacute Ucirc Ucirc Oumltradeecirc regOumlAEligagrave bullOumlOumllsaquoNtilde YacuteOumlecirc hellip

[Maximum Marks 100Time 1 1 4 hours]

PAPER-IICOMPUTER SCIENCE AND APPLICATIONS

(To be filled by the Candidate)

Signature and Name of Invigilator

OMR Sheet No

Roll No

(In words)

1 (Signature) __________________________ (Name) ____________________________

2 (Signature) __________________________

(Name) ____________________________ Roll No________________________________

8 7

(In figures as per admission card)

D 1 2

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 210

Paper-II 2 D-87-12

1 Consider the circuit shown below In acertain steady state Y is at logical lsquolrsquo

What are possible values of A B C

(A) A = 0 B = 0 C = 1

(B) A = 0 B = C = 1

(C) A = 1 B = C = 0

(D) A = B = 1 C = 1

2 The worst case time complexity of

AVL tree is better in comparison to binary search tree for

(A) Search and Insert Operations

(B) Search and Delete Operations

(C) Insert and Delete Operations

(D) Search Insert and DeleteOperations

3 The GSM network is divided into the

following three major systems (A) SS BSS OSS(B) BSS BSC MSC

(C) CELL BSC OSS

(D) SS CELL MSC

4 The power set of the set is

(A)

(B)

(C) 0

(D) 0

5 If the disk head is located initially at32 find the number of disk moves

required with FCFS if the disk queue

of IO blocks requests are 98 37 14

124 65 67

(A) 239

(B) 310

(C) 321

(D) 325

6 Component level design is concerned

with

(A) Flow oriented analysis

(B) Class based analysis

(C) Both of the above

(D) None of the above

7 The lsquoCrsquo language is

(A) Context free language

(B) Context sensitive language

(C) Regular language

(D) None of the above

8 The Mobile Application Protocol(MAP) typically runs on top of which

protocol

(A) SNMP (Simple Network

Management Protocol)

(B) SMTP (Simple Mail TransferProtocol)

(C) SS7 (Signalling System 7)

(D) HTTP (Hyper Text TransferProtocol)

COMPUTER SCIENCE AND APPLICATIONS

Paper ndash II

Note This paper contains fifty (50) objective type questions of two (2) marks each All

questions are compulsory

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 310

D-87-12 3 Paper-II

9 If a packet arrive with an M-bit valueis lsquolrsquo and a fragmentation offset value

lsquo0rsquo then it is ______ fragment

(A) First

(B) Middle

(C) Last

(D) All of the above

10 The number of bit strings of length

eight that will either start with a 1 bitor end with two bits 00 shall be

(A) 32

(B) 64

(C) 128

(D) 160

11 In compiler design lsquoreducing thestrengthrsquo refers to

(A) reducing the range of values of

input variables

(B) code optimization using cheapermachine instructions

(C) reducing efficiency of program

(D) None of the above

12 In which addressing mode the

effective address of the operand is

generated by adding a constant value to

the contents of register

(A) Absolute

(B) Indirect

(C) Immediate

(D) Index

13 Which of the following is true

(A) A relation in BCNF is always in3NF

(B) A relation in 3NF is always in

BCNF

(C) BCNF and 3NF are same

(D) A relation in BCNF is not in3NF

14 Given memory partitions of 100 K500 K 200 K 300 K and 600 K (in

order) and processes of 212 K 417 K

112 K and 426 K (in order) using thefirst-fit algorithm in which partition

would the process requiring 426 K be placed

(A) 500 K

(B) 200 K

(C) 300 K

(D) 600 K

15 What is the size of the Unicode

character in Windows Operating

System

(A) 8-Bits

(B) 16-Bits

(C) 32-Bits

(D) 64-Bits

16 In which tree for every node the heightof its left subtree and right subtree

differ almost by one

(A) Binary search tree

(B) AVL tree(C) Threaded Binary Tree

(D) Complete Binary Tree

17 The design issue of Datalink Layer in

OSI Reference Model is

(A) Framing

(B) Representation of bits

(C) Synchronization of bits

(D) Connection control

18 Given the following expressions of agrammar

E E F F + E F

F F ndash F id

Which of the following is true

(A) has higher precedence than +

(B) ndash has higher precedence than

(C) + and ndash have same precedence

(D) + has higher precedence than

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 410

Paper-II 4 D-87-12

19 The maturity levels used to measure a process are

(A) Initial Repeatable DefinedManaged Optimized

(B) Primary Secondary Defined

Managed Optimized

(C) Initial Stating Defined

Managed Optimized

(D) None of the above

20 The problem of indefinite blockage of

low-priority jobs in general priority

scheduling algorithm can be solvedusing

(A) Parity bit

(B) Aging

(C) Compaction

(D) Timer

21 Which API is used to draw a circle

(A) Circle ( )

(B) Ellipse ( )

(C) Round Rect ( )

(D) Pie ( )

22 In DML RECONNCT command

cannot be used with

(A) OPTIONAL Set

(B) FIXED Set

(C) MANDATOR Set

(D) All of the above

23 Coaxial cables are categorized by

Radio Government rating are adapted

for specialized functions Category

RG-59 with impedance 75 used for

(A) Cable TV

(B) Ethernet

(C) Thin Ethernet

(D) Thick Ethernet

24 RAD stands for

(A) Rapid and Design

(B) Rapid Aided Development

(C) Rapid Application Development

(D) Rapid Application Design

25 Suppose that someone starts with a

chain letter Each person who receivesthe letter is asked to send it on to 4

other people Some people do this

while some do not send any letter

How many people have seen the letterincluding the first person if no one

receives more than one letter and if thechain letter ends after there have been

100 people who read it but did not sendit out Also find how many people

sent out the letter

(A) 122 amp 22

(B) 111 amp 11

(C) 133 amp 33

(D) 144 amp 44

26 A hash function f defined as f (key) =

key mod 13 with linear probing is

used to insert keys 55 58 68 91 27

145 What will be the location of 79

(A) 1

(B) 2

(C) 3(D) 4

27 Which of the following is true while

converting CFG to LL(I) grammar

(A) Remove left recursion alone

(B) Factoring grammar alone

(C) Both of the above

(D) None of the above

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 510

D-87-12 5 Paper-II

28 Identify the Risk factors which areassociated with Electronic payment

system

(A) Fraudulent use of Credit Cards

(B) Sending Credit Card details overinternet

(C) Remote storage of Credit Carddetails

(D) All of the above

29 Which of the following are two specialfunctions that are meant for handling

exception that occur during exceptionhandling itself

(A) Void terminate ( ) and Voidunexpected ( )

(B) Non void terminate ( ) and void

unexpected ( )

(C) Void terminate ( ) and non voidunexpected ( )

(D) Non void terminate ( ) and nonvoid unexpected ( )

30 Which of the following memoryallocation scheme suffers from external

fragmentation

(A) Segmentation

(B) Pure demand paging

(C) Swapping

(D) Paging

31 Basis path testing falls under

(A) system testing

(B) white box testing

(C) black box testing

(D) unit testing

32 The User Work Area (UWA) is a setof Program variables declared in the

host program to communicate the

contents of individual records between

(A) DBMS amp the Host record

(B) Host program and Host record

(C) Host program and DBMS

(D) Host program and Host language

33 Consider the tree given below

Using the property of eccentricity of avertex find every vertex that is the

centre of the given tree

(A) d amp h

(B) c amp k

(C) g b c h i m

(D) c amp h

34 The maximum number of keys storedin a B-tree of order m and depth d is

(A) md + 1 ndash 1

(B)md+1 ndash 1

m ndash 1

(C) (m ndash 1) (md + 1 ndash 1)

(D)md ndash 1

m ndash 1

35 Which of the following is the most powerful parring method

(A) LL(I)

(B) Canonical LR

(C) SLR

(D) LALR

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 610

Paper-II 6 D-87-12

36 In UNIX which of the followingcommand is used to set the task

priority

(A) init

(B) nice

(C) kill(D) PS

37 AES is a round cipher based on theRijndal Algorithm that uses a 128-bit

block of data AES has three different

configurations ______ rounds with akey size of 128 bits rounds

with a key size of 192 bits and

rounds with a key size of 256 bits

(A) 5 7 15(B) 10 12 14

(C) 5 6 7

(D) 20 12 14

38 Match the following IC families withtheir basic circuits

a TTL 1 NAND

b ECL 2 NOR

c CMOS 3 Inverter

Code

a b c

(A) 1 2 3

(B) 3 2 1

(C) 2 3 1

(D) 2 1 3

39 Match the following with respect to

C++ data types

a User defined type 1 Qualifier

b Built in type 2 Union

c Derived type 3 Void

d Long double 4 Pointer

Code

a b c d

(A) 2 3 4 1

(B) 3 1 4 2

(C) 4 1 2 3

(D) 3 4 1 2

40 Given an empty stack after performing push (1) push (2) Pop push (3) push

(4) Pop Pop push(5) Pop what is the

value of the top of the stack

(A) 4

(B) 3(C) 2

(D) 1

41 Enumeration is a process of

(A) Declaring a set of numbers

(B) Sorting a list of strings

(C) Assigning a legal values possiblefor a variable

(D) Sequencing a list of operators

42 Which of the following modedeclaration is used in C++ to open a

file for input

(A) ios app

(B) in ios

(C) ios file

(D) ios in

43 Data Encryption Techniques are particularly used for ______

(A) protecting data in Data

Communication System

(B) reduce Storage SpaceRequirement

(C) enhances Data Integrity

(D) decreases Data Integrity

44 Let L be a set accepted by a non-

deterministic finite automaton Thenumber of states in non-deterministic

finite automaton is |Q| The maximum

number of states in equivalent finiteautomaton that accepts L is

(A) |Q|

(B) 2|Q|

(C) 2|Q| ndash 1

(D) 2|Q|

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 210

Paper-II 2 D-87-12

1 Consider the circuit shown below In acertain steady state Y is at logical lsquolrsquo

What are possible values of A B C

(A) A = 0 B = 0 C = 1

(B) A = 0 B = C = 1

(C) A = 1 B = C = 0

(D) A = B = 1 C = 1

2 The worst case time complexity of

AVL tree is better in comparison to binary search tree for

(A) Search and Insert Operations

(B) Search and Delete Operations

(C) Insert and Delete Operations

(D) Search Insert and DeleteOperations

3 The GSM network is divided into the

following three major systems (A) SS BSS OSS(B) BSS BSC MSC

(C) CELL BSC OSS

(D) SS CELL MSC

4 The power set of the set is

(A)

(B)

(C) 0

(D) 0

5 If the disk head is located initially at32 find the number of disk moves

required with FCFS if the disk queue

of IO blocks requests are 98 37 14

124 65 67

(A) 239

(B) 310

(C) 321

(D) 325

6 Component level design is concerned

with

(A) Flow oriented analysis

(B) Class based analysis

(C) Both of the above

(D) None of the above

7 The lsquoCrsquo language is

(A) Context free language

(B) Context sensitive language

(C) Regular language

(D) None of the above

8 The Mobile Application Protocol(MAP) typically runs on top of which

protocol

(A) SNMP (Simple Network

Management Protocol)

(B) SMTP (Simple Mail TransferProtocol)

(C) SS7 (Signalling System 7)

(D) HTTP (Hyper Text TransferProtocol)

COMPUTER SCIENCE AND APPLICATIONS

Paper ndash II

Note This paper contains fifty (50) objective type questions of two (2) marks each All

questions are compulsory

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 310

D-87-12 3 Paper-II

9 If a packet arrive with an M-bit valueis lsquolrsquo and a fragmentation offset value

lsquo0rsquo then it is ______ fragment

(A) First

(B) Middle

(C) Last

(D) All of the above

10 The number of bit strings of length

eight that will either start with a 1 bitor end with two bits 00 shall be

(A) 32

(B) 64

(C) 128

(D) 160

11 In compiler design lsquoreducing thestrengthrsquo refers to

(A) reducing the range of values of

input variables

(B) code optimization using cheapermachine instructions

(C) reducing efficiency of program

(D) None of the above

12 In which addressing mode the

effective address of the operand is

generated by adding a constant value to

the contents of register

(A) Absolute

(B) Indirect

(C) Immediate

(D) Index

13 Which of the following is true

(A) A relation in BCNF is always in3NF

(B) A relation in 3NF is always in

BCNF

(C) BCNF and 3NF are same

(D) A relation in BCNF is not in3NF

14 Given memory partitions of 100 K500 K 200 K 300 K and 600 K (in

order) and processes of 212 K 417 K

112 K and 426 K (in order) using thefirst-fit algorithm in which partition

would the process requiring 426 K be placed

(A) 500 K

(B) 200 K

(C) 300 K

(D) 600 K

15 What is the size of the Unicode

character in Windows Operating

System

(A) 8-Bits

(B) 16-Bits

(C) 32-Bits

(D) 64-Bits

16 In which tree for every node the heightof its left subtree and right subtree

differ almost by one

(A) Binary search tree

(B) AVL tree(C) Threaded Binary Tree

(D) Complete Binary Tree

17 The design issue of Datalink Layer in

OSI Reference Model is

(A) Framing

(B) Representation of bits

(C) Synchronization of bits

(D) Connection control

18 Given the following expressions of agrammar

E E F F + E F

F F ndash F id

Which of the following is true

(A) has higher precedence than +

(B) ndash has higher precedence than

(C) + and ndash have same precedence

(D) + has higher precedence than

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 410

Paper-II 4 D-87-12

19 The maturity levels used to measure a process are

(A) Initial Repeatable DefinedManaged Optimized

(B) Primary Secondary Defined

Managed Optimized

(C) Initial Stating Defined

Managed Optimized

(D) None of the above

20 The problem of indefinite blockage of

low-priority jobs in general priority

scheduling algorithm can be solvedusing

(A) Parity bit

(B) Aging

(C) Compaction

(D) Timer

21 Which API is used to draw a circle

(A) Circle ( )

(B) Ellipse ( )

(C) Round Rect ( )

(D) Pie ( )

22 In DML RECONNCT command

cannot be used with

(A) OPTIONAL Set

(B) FIXED Set

(C) MANDATOR Set

(D) All of the above

23 Coaxial cables are categorized by

Radio Government rating are adapted

for specialized functions Category

RG-59 with impedance 75 used for

(A) Cable TV

(B) Ethernet

(C) Thin Ethernet

(D) Thick Ethernet

24 RAD stands for

(A) Rapid and Design

(B) Rapid Aided Development

(C) Rapid Application Development

(D) Rapid Application Design

25 Suppose that someone starts with a

chain letter Each person who receivesthe letter is asked to send it on to 4

other people Some people do this

while some do not send any letter

How many people have seen the letterincluding the first person if no one

receives more than one letter and if thechain letter ends after there have been

100 people who read it but did not sendit out Also find how many people

sent out the letter

(A) 122 amp 22

(B) 111 amp 11

(C) 133 amp 33

(D) 144 amp 44

26 A hash function f defined as f (key) =

key mod 13 with linear probing is

used to insert keys 55 58 68 91 27

145 What will be the location of 79

(A) 1

(B) 2

(C) 3(D) 4

27 Which of the following is true while

converting CFG to LL(I) grammar

(A) Remove left recursion alone

(B) Factoring grammar alone

(C) Both of the above

(D) None of the above

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 510

D-87-12 5 Paper-II

28 Identify the Risk factors which areassociated with Electronic payment

system

(A) Fraudulent use of Credit Cards

(B) Sending Credit Card details overinternet

(C) Remote storage of Credit Carddetails

(D) All of the above

29 Which of the following are two specialfunctions that are meant for handling

exception that occur during exceptionhandling itself

(A) Void terminate ( ) and Voidunexpected ( )

(B) Non void terminate ( ) and void

unexpected ( )

(C) Void terminate ( ) and non voidunexpected ( )

(D) Non void terminate ( ) and nonvoid unexpected ( )

30 Which of the following memoryallocation scheme suffers from external

fragmentation

(A) Segmentation

(B) Pure demand paging

(C) Swapping

(D) Paging

31 Basis path testing falls under

(A) system testing

(B) white box testing

(C) black box testing

(D) unit testing

32 The User Work Area (UWA) is a setof Program variables declared in the

host program to communicate the

contents of individual records between

(A) DBMS amp the Host record

(B) Host program and Host record

(C) Host program and DBMS

(D) Host program and Host language

33 Consider the tree given below

Using the property of eccentricity of avertex find every vertex that is the

centre of the given tree

(A) d amp h

(B) c amp k

(C) g b c h i m

(D) c amp h

34 The maximum number of keys storedin a B-tree of order m and depth d is

(A) md + 1 ndash 1

(B)md+1 ndash 1

m ndash 1

(C) (m ndash 1) (md + 1 ndash 1)

(D)md ndash 1

m ndash 1

35 Which of the following is the most powerful parring method

(A) LL(I)

(B) Canonical LR

(C) SLR

(D) LALR

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 610

Paper-II 6 D-87-12

36 In UNIX which of the followingcommand is used to set the task

priority

(A) init

(B) nice

(C) kill(D) PS

37 AES is a round cipher based on theRijndal Algorithm that uses a 128-bit

block of data AES has three different

configurations ______ rounds with akey size of 128 bits rounds

with a key size of 192 bits and

rounds with a key size of 256 bits

(A) 5 7 15(B) 10 12 14

(C) 5 6 7

(D) 20 12 14

38 Match the following IC families withtheir basic circuits

a TTL 1 NAND

b ECL 2 NOR

c CMOS 3 Inverter

Code

a b c

(A) 1 2 3

(B) 3 2 1

(C) 2 3 1

(D) 2 1 3

39 Match the following with respect to

C++ data types

a User defined type 1 Qualifier

b Built in type 2 Union

c Derived type 3 Void

d Long double 4 Pointer

Code

a b c d

(A) 2 3 4 1

(B) 3 1 4 2

(C) 4 1 2 3

(D) 3 4 1 2

40 Given an empty stack after performing push (1) push (2) Pop push (3) push

(4) Pop Pop push(5) Pop what is the

value of the top of the stack

(A) 4

(B) 3(C) 2

(D) 1

41 Enumeration is a process of

(A) Declaring a set of numbers

(B) Sorting a list of strings

(C) Assigning a legal values possiblefor a variable

(D) Sequencing a list of operators

42 Which of the following modedeclaration is used in C++ to open a

file for input

(A) ios app

(B) in ios

(C) ios file

(D) ios in

43 Data Encryption Techniques are particularly used for ______

(A) protecting data in Data

Communication System

(B) reduce Storage SpaceRequirement

(C) enhances Data Integrity

(D) decreases Data Integrity

44 Let L be a set accepted by a non-

deterministic finite automaton Thenumber of states in non-deterministic

finite automaton is |Q| The maximum

number of states in equivalent finiteautomaton that accepts L is

(A) |Q|

(B) 2|Q|

(C) 2|Q| ndash 1

(D) 2|Q|

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 310

D-87-12 3 Paper-II

9 If a packet arrive with an M-bit valueis lsquolrsquo and a fragmentation offset value

lsquo0rsquo then it is ______ fragment

(A) First

(B) Middle

(C) Last

(D) All of the above

10 The number of bit strings of length

eight that will either start with a 1 bitor end with two bits 00 shall be

(A) 32

(B) 64

(C) 128

(D) 160

11 In compiler design lsquoreducing thestrengthrsquo refers to

(A) reducing the range of values of

input variables

(B) code optimization using cheapermachine instructions

(C) reducing efficiency of program

(D) None of the above

12 In which addressing mode the

effective address of the operand is

generated by adding a constant value to

the contents of register

(A) Absolute

(B) Indirect

(C) Immediate

(D) Index

13 Which of the following is true

(A) A relation in BCNF is always in3NF

(B) A relation in 3NF is always in

BCNF

(C) BCNF and 3NF are same

(D) A relation in BCNF is not in3NF

14 Given memory partitions of 100 K500 K 200 K 300 K and 600 K (in

order) and processes of 212 K 417 K

112 K and 426 K (in order) using thefirst-fit algorithm in which partition

would the process requiring 426 K be placed

(A) 500 K

(B) 200 K

(C) 300 K

(D) 600 K

15 What is the size of the Unicode

character in Windows Operating

System

(A) 8-Bits

(B) 16-Bits

(C) 32-Bits

(D) 64-Bits

16 In which tree for every node the heightof its left subtree and right subtree

differ almost by one

(A) Binary search tree

(B) AVL tree(C) Threaded Binary Tree

(D) Complete Binary Tree

17 The design issue of Datalink Layer in

OSI Reference Model is

(A) Framing

(B) Representation of bits

(C) Synchronization of bits

(D) Connection control

18 Given the following expressions of agrammar

E E F F + E F

F F ndash F id

Which of the following is true

(A) has higher precedence than +

(B) ndash has higher precedence than

(C) + and ndash have same precedence

(D) + has higher precedence than

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 410

Paper-II 4 D-87-12

19 The maturity levels used to measure a process are

(A) Initial Repeatable DefinedManaged Optimized

(B) Primary Secondary Defined

Managed Optimized

(C) Initial Stating Defined

Managed Optimized

(D) None of the above

20 The problem of indefinite blockage of

low-priority jobs in general priority

scheduling algorithm can be solvedusing

(A) Parity bit

(B) Aging

(C) Compaction

(D) Timer

21 Which API is used to draw a circle

(A) Circle ( )

(B) Ellipse ( )

(C) Round Rect ( )

(D) Pie ( )

22 In DML RECONNCT command

cannot be used with

(A) OPTIONAL Set

(B) FIXED Set

(C) MANDATOR Set

(D) All of the above

23 Coaxial cables are categorized by

Radio Government rating are adapted

for specialized functions Category

RG-59 with impedance 75 used for

(A) Cable TV

(B) Ethernet

(C) Thin Ethernet

(D) Thick Ethernet

24 RAD stands for

(A) Rapid and Design

(B) Rapid Aided Development

(C) Rapid Application Development

(D) Rapid Application Design

25 Suppose that someone starts with a

chain letter Each person who receivesthe letter is asked to send it on to 4

other people Some people do this

while some do not send any letter

How many people have seen the letterincluding the first person if no one

receives more than one letter and if thechain letter ends after there have been

100 people who read it but did not sendit out Also find how many people

sent out the letter

(A) 122 amp 22

(B) 111 amp 11

(C) 133 amp 33

(D) 144 amp 44

26 A hash function f defined as f (key) =

key mod 13 with linear probing is

used to insert keys 55 58 68 91 27

145 What will be the location of 79

(A) 1

(B) 2

(C) 3(D) 4

27 Which of the following is true while

converting CFG to LL(I) grammar

(A) Remove left recursion alone

(B) Factoring grammar alone

(C) Both of the above

(D) None of the above

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 510

D-87-12 5 Paper-II

28 Identify the Risk factors which areassociated with Electronic payment

system

(A) Fraudulent use of Credit Cards

(B) Sending Credit Card details overinternet

(C) Remote storage of Credit Carddetails

(D) All of the above

29 Which of the following are two specialfunctions that are meant for handling

exception that occur during exceptionhandling itself

(A) Void terminate ( ) and Voidunexpected ( )

(B) Non void terminate ( ) and void

unexpected ( )

(C) Void terminate ( ) and non voidunexpected ( )

(D) Non void terminate ( ) and nonvoid unexpected ( )

30 Which of the following memoryallocation scheme suffers from external

fragmentation

(A) Segmentation

(B) Pure demand paging

(C) Swapping

(D) Paging

31 Basis path testing falls under

(A) system testing

(B) white box testing

(C) black box testing

(D) unit testing

32 The User Work Area (UWA) is a setof Program variables declared in the

host program to communicate the

contents of individual records between

(A) DBMS amp the Host record

(B) Host program and Host record

(C) Host program and DBMS

(D) Host program and Host language

33 Consider the tree given below

Using the property of eccentricity of avertex find every vertex that is the

centre of the given tree

(A) d amp h

(B) c amp k

(C) g b c h i m

(D) c amp h

34 The maximum number of keys storedin a B-tree of order m and depth d is

(A) md + 1 ndash 1

(B)md+1 ndash 1

m ndash 1

(C) (m ndash 1) (md + 1 ndash 1)

(D)md ndash 1

m ndash 1

35 Which of the following is the most powerful parring method

(A) LL(I)

(B) Canonical LR

(C) SLR

(D) LALR

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 610

Paper-II 6 D-87-12

36 In UNIX which of the followingcommand is used to set the task

priority

(A) init

(B) nice

(C) kill(D) PS

37 AES is a round cipher based on theRijndal Algorithm that uses a 128-bit

block of data AES has three different

configurations ______ rounds with akey size of 128 bits rounds

with a key size of 192 bits and

rounds with a key size of 256 bits

(A) 5 7 15(B) 10 12 14

(C) 5 6 7

(D) 20 12 14

38 Match the following IC families withtheir basic circuits

a TTL 1 NAND

b ECL 2 NOR

c CMOS 3 Inverter

Code

a b c

(A) 1 2 3

(B) 3 2 1

(C) 2 3 1

(D) 2 1 3

39 Match the following with respect to

C++ data types

a User defined type 1 Qualifier

b Built in type 2 Union

c Derived type 3 Void

d Long double 4 Pointer

Code

a b c d

(A) 2 3 4 1

(B) 3 1 4 2

(C) 4 1 2 3

(D) 3 4 1 2

40 Given an empty stack after performing push (1) push (2) Pop push (3) push

(4) Pop Pop push(5) Pop what is the

value of the top of the stack

(A) 4

(B) 3(C) 2

(D) 1

41 Enumeration is a process of

(A) Declaring a set of numbers

(B) Sorting a list of strings

(C) Assigning a legal values possiblefor a variable

(D) Sequencing a list of operators

42 Which of the following modedeclaration is used in C++ to open a

file for input

(A) ios app

(B) in ios

(C) ios file

(D) ios in

43 Data Encryption Techniques are particularly used for ______

(A) protecting data in Data

Communication System

(B) reduce Storage SpaceRequirement

(C) enhances Data Integrity

(D) decreases Data Integrity

44 Let L be a set accepted by a non-

deterministic finite automaton Thenumber of states in non-deterministic

finite automaton is |Q| The maximum

number of states in equivalent finiteautomaton that accepts L is

(A) |Q|

(B) 2|Q|

(C) 2|Q| ndash 1

(D) 2|Q|

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 410

Paper-II 4 D-87-12

19 The maturity levels used to measure a process are

(A) Initial Repeatable DefinedManaged Optimized

(B) Primary Secondary Defined

Managed Optimized

(C) Initial Stating Defined

Managed Optimized

(D) None of the above

20 The problem of indefinite blockage of

low-priority jobs in general priority

scheduling algorithm can be solvedusing

(A) Parity bit

(B) Aging

(C) Compaction

(D) Timer

21 Which API is used to draw a circle

(A) Circle ( )

(B) Ellipse ( )

(C) Round Rect ( )

(D) Pie ( )

22 In DML RECONNCT command

cannot be used with

(A) OPTIONAL Set

(B) FIXED Set

(C) MANDATOR Set

(D) All of the above

23 Coaxial cables are categorized by

Radio Government rating are adapted

for specialized functions Category

RG-59 with impedance 75 used for

(A) Cable TV

(B) Ethernet

(C) Thin Ethernet

(D) Thick Ethernet

24 RAD stands for

(A) Rapid and Design

(B) Rapid Aided Development

(C) Rapid Application Development

(D) Rapid Application Design

25 Suppose that someone starts with a

chain letter Each person who receivesthe letter is asked to send it on to 4

other people Some people do this

while some do not send any letter

How many people have seen the letterincluding the first person if no one

receives more than one letter and if thechain letter ends after there have been

100 people who read it but did not sendit out Also find how many people

sent out the letter

(A) 122 amp 22

(B) 111 amp 11

(C) 133 amp 33

(D) 144 amp 44

26 A hash function f defined as f (key) =

key mod 13 with linear probing is

used to insert keys 55 58 68 91 27

145 What will be the location of 79

(A) 1

(B) 2

(C) 3(D) 4

27 Which of the following is true while

converting CFG to LL(I) grammar

(A) Remove left recursion alone

(B) Factoring grammar alone

(C) Both of the above

(D) None of the above

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 510

D-87-12 5 Paper-II

28 Identify the Risk factors which areassociated with Electronic payment

system

(A) Fraudulent use of Credit Cards

(B) Sending Credit Card details overinternet

(C) Remote storage of Credit Carddetails

(D) All of the above

29 Which of the following are two specialfunctions that are meant for handling

exception that occur during exceptionhandling itself

(A) Void terminate ( ) and Voidunexpected ( )

(B) Non void terminate ( ) and void

unexpected ( )

(C) Void terminate ( ) and non voidunexpected ( )

(D) Non void terminate ( ) and nonvoid unexpected ( )

30 Which of the following memoryallocation scheme suffers from external

fragmentation

(A) Segmentation

(B) Pure demand paging

(C) Swapping

(D) Paging

31 Basis path testing falls under

(A) system testing

(B) white box testing

(C) black box testing

(D) unit testing

32 The User Work Area (UWA) is a setof Program variables declared in the

host program to communicate the

contents of individual records between

(A) DBMS amp the Host record

(B) Host program and Host record

(C) Host program and DBMS

(D) Host program and Host language

33 Consider the tree given below

Using the property of eccentricity of avertex find every vertex that is the

centre of the given tree

(A) d amp h

(B) c amp k

(C) g b c h i m

(D) c amp h

34 The maximum number of keys storedin a B-tree of order m and depth d is

(A) md + 1 ndash 1

(B)md+1 ndash 1

m ndash 1

(C) (m ndash 1) (md + 1 ndash 1)

(D)md ndash 1

m ndash 1

35 Which of the following is the most powerful parring method

(A) LL(I)

(B) Canonical LR

(C) SLR

(D) LALR

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 610

Paper-II 6 D-87-12

36 In UNIX which of the followingcommand is used to set the task

priority

(A) init

(B) nice

(C) kill(D) PS

37 AES is a round cipher based on theRijndal Algorithm that uses a 128-bit

block of data AES has three different

configurations ______ rounds with akey size of 128 bits rounds

with a key size of 192 bits and

rounds with a key size of 256 bits

(A) 5 7 15(B) 10 12 14

(C) 5 6 7

(D) 20 12 14

38 Match the following IC families withtheir basic circuits

a TTL 1 NAND

b ECL 2 NOR

c CMOS 3 Inverter

Code

a b c

(A) 1 2 3

(B) 3 2 1

(C) 2 3 1

(D) 2 1 3

39 Match the following with respect to

C++ data types

a User defined type 1 Qualifier

b Built in type 2 Union

c Derived type 3 Void

d Long double 4 Pointer

Code

a b c d

(A) 2 3 4 1

(B) 3 1 4 2

(C) 4 1 2 3

(D) 3 4 1 2

40 Given an empty stack after performing push (1) push (2) Pop push (3) push

(4) Pop Pop push(5) Pop what is the

value of the top of the stack

(A) 4

(B) 3(C) 2

(D) 1

41 Enumeration is a process of

(A) Declaring a set of numbers

(B) Sorting a list of strings

(C) Assigning a legal values possiblefor a variable

(D) Sequencing a list of operators

42 Which of the following modedeclaration is used in C++ to open a

file for input

(A) ios app

(B) in ios

(C) ios file

(D) ios in

43 Data Encryption Techniques are particularly used for ______

(A) protecting data in Data

Communication System

(B) reduce Storage SpaceRequirement

(C) enhances Data Integrity

(D) decreases Data Integrity

44 Let L be a set accepted by a non-

deterministic finite automaton Thenumber of states in non-deterministic

finite automaton is |Q| The maximum

number of states in equivalent finiteautomaton that accepts L is

(A) |Q|

(B) 2|Q|

(C) 2|Q| ndash 1

(D) 2|Q|

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 510

D-87-12 5 Paper-II

28 Identify the Risk factors which areassociated with Electronic payment

system

(A) Fraudulent use of Credit Cards

(B) Sending Credit Card details overinternet

(C) Remote storage of Credit Carddetails

(D) All of the above

29 Which of the following are two specialfunctions that are meant for handling

exception that occur during exceptionhandling itself

(A) Void terminate ( ) and Voidunexpected ( )

(B) Non void terminate ( ) and void

unexpected ( )

(C) Void terminate ( ) and non voidunexpected ( )

(D) Non void terminate ( ) and nonvoid unexpected ( )

30 Which of the following memoryallocation scheme suffers from external

fragmentation

(A) Segmentation

(B) Pure demand paging

(C) Swapping

(D) Paging

31 Basis path testing falls under

(A) system testing

(B) white box testing

(C) black box testing

(D) unit testing

32 The User Work Area (UWA) is a setof Program variables declared in the

host program to communicate the

contents of individual records between

(A) DBMS amp the Host record

(B) Host program and Host record

(C) Host program and DBMS

(D) Host program and Host language

33 Consider the tree given below

Using the property of eccentricity of avertex find every vertex that is the

centre of the given tree

(A) d amp h

(B) c amp k

(C) g b c h i m

(D) c amp h

34 The maximum number of keys storedin a B-tree of order m and depth d is

(A) md + 1 ndash 1

(B)md+1 ndash 1

m ndash 1

(C) (m ndash 1) (md + 1 ndash 1)

(D)md ndash 1

m ndash 1

35 Which of the following is the most powerful parring method

(A) LL(I)

(B) Canonical LR

(C) SLR

(D) LALR

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 610

Paper-II 6 D-87-12

36 In UNIX which of the followingcommand is used to set the task

priority

(A) init

(B) nice

(C) kill(D) PS

37 AES is a round cipher based on theRijndal Algorithm that uses a 128-bit

block of data AES has three different

configurations ______ rounds with akey size of 128 bits rounds

with a key size of 192 bits and

rounds with a key size of 256 bits

(A) 5 7 15(B) 10 12 14

(C) 5 6 7

(D) 20 12 14

38 Match the following IC families withtheir basic circuits

a TTL 1 NAND

b ECL 2 NOR

c CMOS 3 Inverter

Code

a b c

(A) 1 2 3

(B) 3 2 1

(C) 2 3 1

(D) 2 1 3

39 Match the following with respect to

C++ data types

a User defined type 1 Qualifier

b Built in type 2 Union

c Derived type 3 Void

d Long double 4 Pointer

Code

a b c d

(A) 2 3 4 1

(B) 3 1 4 2

(C) 4 1 2 3

(D) 3 4 1 2

40 Given an empty stack after performing push (1) push (2) Pop push (3) push

(4) Pop Pop push(5) Pop what is the

value of the top of the stack

(A) 4

(B) 3(C) 2

(D) 1

41 Enumeration is a process of

(A) Declaring a set of numbers

(B) Sorting a list of strings

(C) Assigning a legal values possiblefor a variable

(D) Sequencing a list of operators

42 Which of the following modedeclaration is used in C++ to open a

file for input

(A) ios app

(B) in ios

(C) ios file

(D) ios in

43 Data Encryption Techniques are particularly used for ______

(A) protecting data in Data

Communication System

(B) reduce Storage SpaceRequirement

(C) enhances Data Integrity

(D) decreases Data Integrity

44 Let L be a set accepted by a non-

deterministic finite automaton Thenumber of states in non-deterministic

finite automaton is |Q| The maximum

number of states in equivalent finiteautomaton that accepts L is

(A) |Q|

(B) 2|Q|

(C) 2|Q| ndash 1

(D) 2|Q|

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 610

Paper-II 6 D-87-12

36 In UNIX which of the followingcommand is used to set the task

priority

(A) init

(B) nice

(C) kill(D) PS

37 AES is a round cipher based on theRijndal Algorithm that uses a 128-bit

block of data AES has three different

configurations ______ rounds with akey size of 128 bits rounds

with a key size of 192 bits and

rounds with a key size of 256 bits

(A) 5 7 15(B) 10 12 14

(C) 5 6 7

(D) 20 12 14

38 Match the following IC families withtheir basic circuits

a TTL 1 NAND

b ECL 2 NOR

c CMOS 3 Inverter

Code

a b c

(A) 1 2 3

(B) 3 2 1

(C) 2 3 1

(D) 2 1 3

39 Match the following with respect to

C++ data types

a User defined type 1 Qualifier

b Built in type 2 Union

c Derived type 3 Void

d Long double 4 Pointer

Code

a b c d

(A) 2 3 4 1

(B) 3 1 4 2

(C) 4 1 2 3

(D) 3 4 1 2

40 Given an empty stack after performing push (1) push (2) Pop push (3) push

(4) Pop Pop push(5) Pop what is the

value of the top of the stack

(A) 4

(B) 3(C) 2

(D) 1

41 Enumeration is a process of

(A) Declaring a set of numbers

(B) Sorting a list of strings

(C) Assigning a legal values possiblefor a variable

(D) Sequencing a list of operators

42 Which of the following modedeclaration is used in C++ to open a

file for input

(A) ios app

(B) in ios

(C) ios file

(D) ios in

43 Data Encryption Techniques are particularly used for ______

(A) protecting data in Data

Communication System

(B) reduce Storage SpaceRequirement

(C) enhances Data Integrity

(D) decreases Data Integrity

44 Let L be a set accepted by a non-

deterministic finite automaton Thenumber of states in non-deterministic

finite automaton is |Q| The maximum

number of states in equivalent finiteautomaton that accepts L is

(A) |Q|

(B) 2|Q|

(C) 2|Q| ndash 1

(D) 2|Q|

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 710

D-87-12 7 Paper-II

45 What is the result of the followingexpression

49 Identify the operation which iscommutative but not associative

(1 amp 2) + (3 amp 4) (A) OR

(A) 1 (B) NOR

(B) 3 (C) EX-OR(C) 2 (D) NAND

(D) 0

50 Given a Relation POSITION (Posting- No Skill) then query to retrieve all

distinct pairs of posting-nos requiring

skill is

46 Back propagation is a learningtechnique that adjusts weights in the

neural network by propagating weight

changes (A) Select pposting-No pposting-

No(A) Forward from source to sink

from position p(B) Backward from sink to source

where pskill = pskill(C) Forward from source to hiddennodes and pposting-No lt pposting-No

(D) Backward from since to hiddennodes

(B) Select p1posting-No p2posting-

No47 Match the following

from position p1 position p2 a TTL 1 High fan out

b ECL 2 Low propagation delay

c CMOS 3 High power dissipation

where p1skill = p2skill

(C) Select p1posting-No p2posting-

NoCode

a b cfrom position p1 position p2

(A) 3 2 1

where p1skill = p2skill(B) 1 2 3

and p1posting-No lt p2posting-

No

(C) 1 3 2

(D) 3 1 2

(D) Select p1posting-No p2posting-

No

48 ______ is an ldquoumbrellardquo activity that is

applied throughout the softwareengineering process

from position p1 position p2 (A) Debugging

where p1skill = p2skill(B) Testing

and p1posting-No = p2posting-

No

(C) Designing

(D) Software quality assurance

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 810

Space For Rough Work

Paper-II 8 D-87-12

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 910

983121983086983118983151983086 983123983107983096983095

983121983088983089 983105

983121983088983090 983108983121983088983091 983105

983121983088983092 983106

983121983088983093 983107

983121983088983094 983107

983121983088983095 983105

983121983088983096 983107

983121983088983097 983105

983121983089983088 983108

983121983089983089 983106

983121983089983090 983108983121983089983091 983105

983121983089983092 983108

983121983089983093 983107

983121983089983094 983106

983121983089983095 983105

983121983089983096 983106

983121983089983097 983105

983121983090983088 983106

983121983090983089 983106

983121983090983090 983106

983121983090983091 983105

983121983090983092 983107

983121983090983093 983107

983121983090983094 983108

983121983090983095 983107

983121983090983096 983108

983121983090983097 983105

983121983091983088 983105

983121983091983089 983106

983121983091983090 983107

983121983091983091 983108

983121983091983092 983105

983121983091983093 983106

983121983091983094 983106

983121983091983095 983106

983121983091983096 983105

983121983091983097 983105

983121983092983088 983108

983121983092983089 983107

983121983092983090 983108

983121983092983091 983105983121983092983092 983108

983121983092983093 983108

983125983111983107 983085 983118983109983124 983108983109983107983109983117983106983109983122 983090983088983089983090

983105983118983123983127983109983122 983115983109983129983123 983080983120983105983120983109983122 983113983113983081

983123983125983106983114983109983107983124 983098 983080 983096983095 983081983107983119983117983120983125983124983109983122 983123983107983113983109983118983107983109 983105983118983108 983105983120983120983116983113983107983105983124983113983119983118983123

wwwexamracecom

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com

8132019 UGC Computer Science Paper 2 Solved December 2012

httpslidepdfcomreaderfullugc-computer-science-paper-2-solved-december-2012 1010

983121983092983094 983106

983121983092983095 983105

983121983092983096 983108

983121983092983097 983108

983121983093983088 983107

www examrace com