UGC NET Past Year Question Paper II: Computer Science (2014) | UGC NET Past Year Papers PDF Download

 Page 1


1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of fifty multiple-choice type of questions.
3. 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 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 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 below on
the correct response against each item.
Example :
where (C) is the correct response.
5. Your responses to the items are to be indicated 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 instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
8. If you write your Name, Roll Number, Phone Number or put
any mark on any part of the OMR Sheet, except for the space
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
9. You have to return the test question booklet and Original
OMR Sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall. Y ou are, however, allowed to carry original
question booklet and 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 Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
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)
J 1 4
J-87-14 1 P.T.O.
Page 2


1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of fifty multiple-choice type of questions.
3. 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 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 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 below on
the correct response against each item.
Example :
where (C) is the correct response.
5. Your responses to the items are to be indicated 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 instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
8. If you write your Name, Roll Number, Phone Number or put
any mark on any part of the OMR Sheet, except for the space
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
9. You have to return the test question booklet and Original
OMR Sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall. Y ou are, however, allowed to carry original
question booklet and 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 Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
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)
J 1 4
J-87-14 1 P.T.O.
Paper-II 2  J-87-14 
 
 
 
 
 
1. Infrared signals can be used for short 
range communication in a closed 
area using _______ propagation. 
 (A) ground (B) sky 
 (C) line of sight (D) space  
 
2. A bridge has access to _______ 
address in the same network. 
 (A) Physical (B) Network 
 (C) Datalink (D) Application 
 
3. The minimum frame length for            
10 Mbps Ethernet is _______ bytes 
and maximum is _______ bytes. 
 (A) 64 & 128 (B) 128 & 1518 
 (C) 1518 & 3036 (D) 64 & 1518 
 
4. The bit rate of a signal is 3000 bps. If 
each signal unit carries 6 bits, the baud 
rate of the signal is _______. 
 (A) 500 baud/sec  
 (B) 1000 baud/sec 
 (C) 3000 baud/sec 
 (D) 18000 baud/sec. 
 
5. Match the following : 
List – I List – II 
a. Physical 
layer 
i. Allow resources to 
network access  
b. Datalink 
layer 
ii. Move packets from 
one destination to 
other  
c. Network 
layer 
iii. Process to process 
message delivery 
d. Transport 
layer 
iv. Transmission of 
bit stream 
e. Application 
Layer 
v. Formation of 
frames 
 Codes : 
  a b c d e 
 (A) iv v ii iii i 
 (B) v iv i ii iii  
 (C) i iii ii v iv 
 (D) i ii iv iii v 
 
 
 
 
 
6. A grammar G is LL(1) if and only if 
the following conditions hold for two 
distinct productions A ? a | ß 
 I. First (a) n First (ß) ? {a} where 
a is some terminal symbol of the 
grammar. 
 II. First (a) n First (ß) ? ? 
 III. First (a) n Follow (A) = f if ? ? 
First (ß)  
 (A) I and II (B) I and III 
 (C) II and III (D) I, II and III 
 
7. Which of the following suffices to convert 
an arbitrary CFG to an LL(1) grammar ? 
 (A) Removing left recursion alone 
 (B) Removing the grammar alone 
 (C) Removing left recursion and 
factoring the grammar 
 (D) None of the above 
 
8. A shift reduce parser suffers from  
 (A) shift reduce conflict only 
 (B) reduce reduce conflict only 
 (C) both shift reduce conflict and 
reduce reduce conflict 
 (D) shift handle and reduce handle 
conflicts 
 
9. The context free grammar for the 
language L = {a
n
b
m
c
k
 | k = |n – m|,               
n > 0, m > 0, k > 0} is 
 (A) S ? S
1
S
3
, S
1
 ? aS
1
c | S
2
| ?,            
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4 
| ?, 
S
4
 ? bS
4
c|? 
 (B) S ? S
1
S
3
, S
1
? aS
1
S
2
c | ?,              
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4
 |?, 
S
4
 ? bS
4
c|? 
 (C) S ? S
1
|S
2
, S
1
? aS
1
S
2
c | ?,          
S
2
 ? aS
2
b | ?, S
3
 ? aS
3
b | S
4
 |?, 
S
4
 ? bS
4
c|? 
 (D) S ? S
1 
| S
3
, S
1
? aS
1
c|S
2 
| ?,               
S
2
 ? aS
2
b | ?, S
3
 ? a S
3
b| S
4
 | ?, 
S
4
 ? bS
4
c | ? 
COMPUTER SCIENCE AND APPLICATIONS  
Paper – II 
 
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All 
questions are compulsory. 
 
Page 3


1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of fifty multiple-choice type of questions.
3. 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 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 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 below on
the correct response against each item.
Example :
where (C) is the correct response.
5. Your responses to the items are to be indicated 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 instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
8. If you write your Name, Roll Number, Phone Number or put
any mark on any part of the OMR Sheet, except for the space
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
9. You have to return the test question booklet and Original
OMR Sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall. Y ou are, however, allowed to carry original
question booklet and 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 Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
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)
J 1 4
J-87-14 1 P.T.O.
Paper-II 2  J-87-14 
 
 
 
 
 
1. Infrared signals can be used for short 
range communication in a closed 
area using _______ propagation. 
 (A) ground (B) sky 
 (C) line of sight (D) space  
 
2. A bridge has access to _______ 
address in the same network. 
 (A) Physical (B) Network 
 (C) Datalink (D) Application 
 
3. The minimum frame length for            
10 Mbps Ethernet is _______ bytes 
and maximum is _______ bytes. 
 (A) 64 & 128 (B) 128 & 1518 
 (C) 1518 & 3036 (D) 64 & 1518 
 
4. The bit rate of a signal is 3000 bps. If 
each signal unit carries 6 bits, the baud 
rate of the signal is _______. 
 (A) 500 baud/sec  
 (B) 1000 baud/sec 
 (C) 3000 baud/sec 
 (D) 18000 baud/sec. 
 
5. Match the following : 
List – I List – II 
a. Physical 
layer 
i. Allow resources to 
network access  
b. Datalink 
layer 
ii. Move packets from 
one destination to 
other  
c. Network 
layer 
iii. Process to process 
message delivery 
d. Transport 
layer 
iv. Transmission of 
bit stream 
e. Application 
Layer 
v. Formation of 
frames 
 Codes : 
  a b c d e 
 (A) iv v ii iii i 
 (B) v iv i ii iii  
 (C) i iii ii v iv 
 (D) i ii iv iii v 
 
 
 
 
 
6. A grammar G is LL(1) if and only if 
the following conditions hold for two 
distinct productions A ? a | ß 
 I. First (a) n First (ß) ? {a} where 
a is some terminal symbol of the 
grammar. 
 II. First (a) n First (ß) ? ? 
 III. First (a) n Follow (A) = f if ? ? 
First (ß)  
 (A) I and II (B) I and III 
 (C) II and III (D) I, II and III 
 
7. Which of the following suffices to convert 
an arbitrary CFG to an LL(1) grammar ? 
 (A) Removing left recursion alone 
 (B) Removing the grammar alone 
 (C) Removing left recursion and 
factoring the grammar 
 (D) None of the above 
 
8. A shift reduce parser suffers from  
 (A) shift reduce conflict only 
 (B) reduce reduce conflict only 
 (C) both shift reduce conflict and 
reduce reduce conflict 
 (D) shift handle and reduce handle 
conflicts 
 
9. The context free grammar for the 
language L = {a
n
b
m
c
k
 | k = |n – m|,               
n > 0, m > 0, k > 0} is 
 (A) S ? S
1
S
3
, S
1
 ? aS
1
c | S
2
| ?,            
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4 
| ?, 
S
4
 ? bS
4
c|? 
 (B) S ? S
1
S
3
, S
1
? aS
1
S
2
c | ?,              
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4
 |?, 
S
4
 ? bS
4
c|? 
 (C) S ? S
1
|S
2
, S
1
? aS
1
S
2
c | ?,          
S
2
 ? aS
2
b | ?, S
3
 ? aS
3
b | S
4
 |?, 
S
4
 ? bS
4
c|? 
 (D) S ? S
1 
| S
3
, S
1
? aS
1
c|S
2 
| ?,               
S
2
 ? aS
2
b | ?, S
3
 ? a S
3
b| S
4
 | ?, 
S
4
 ? bS
4
c | ? 
COMPUTER SCIENCE AND APPLICATIONS  
Paper – II 
 
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All 
questions are compulsory. 
 
 J-87-14 3  Paper-II 
10. The regular grammar for the language 
L = {w|n
a
(w) and n
b
(w) are both even, 
w ? {a, b}*} is given by : 
 (Assume, p, q, r and s are states) 
 (A) p ? aq | br | ?, q ? bs | ap  
  r ? as | bp, s ? ar | bq, p and s 
are initial and final states. 
 (B) p ? aq | br, q ? bs | ap 
  r ? as | bp, s ? ar | bq, p and s 
are initial and final states. 
 (C) p ? aq | br | ?, q ? bs | ap 
  r ? as | bp, s ? ar | bq 
  p is both initial and final states. 
 (D) p ? aq | br, q ? bs | ap 
  r ? as | bp, s ? ar | bq 
  p is both initial and final states. 
 
11. KPA in CMM stands for 
 (A) Key Process Area 
 (B) Key Product Area 
 (C) Key Principal Area 
 (D) Key Performance Area  
 
12. Which one of the following is not a 
risk management technique for 
managing the risk due to unrealistic 
schedules and budgets ? 
 (A) Detailed multi source cost and 
schedule estimation. 
 (B) Design cost 
 (C) Incremental development 
 (D) Information hiding 
 
13. _______ of a system is the structure or 
structures of the system which 
comprise software elements, the 
externally visible properties of these 
elements and the relationship amongst 
them. 
 (A) Software construction  
 (B) Software evolution 
 (C) Software architecture 
 (D) Software reuse 
 
14. In function point analysis, the number 
of complexity adjustment factors is 
 (A) 10 (B) 12 
 (C) 14 (D) 20 
15. Regression testing is primarily related to 
 (A) Functional testing 
 (B) Development testing 
 (C) Data flow testing 
 (D) Maintenance testing 
 
16. How many different truth tables of the 
compound propositions are there that 
involve the propositions p & q ? 
 (A) 2 (B) 4 
 (C) 8 (D) 16 
 
17. A Boolean function F is called self- 
dual if and only if  
 F(x
1
, x
2
, … x
n
) = F(
–
x
1
, 
–
x
2
, … 
–
x
n
) 
 How many Boolean functions of 
degree n are self-dual ? 
 (A) 2
n
 (B) (2)
2
n
 
 (C) (2)
 n
2
 (D) (2)
 2
n–1 
 
18. Which of the following statement(s) is 
(are) not correct ? 
 i. The 2’s complement of 0 is 0. 
 ii. In 2’s complement, the left most 
bit cannot be used to express a 
quantity. 
 iii. For an n-bit word (2’s 
complement) which includes the 
sign bit, there are 2
n–1
 positive 
integers, 2
n+1
 negative integers 
and one 0 for a total of 2
n
 unique 
states. 
 iv. In 2’s complement the significant 
information is contained in the 
1’s of positive numbers and 0’s 
of the negative numbers. 
 (A) i & iv (B) i & ii 
 (C) iii  (D) iv  
 
19. The notation ?!xP(x) denotes the 
proposition “there exists a unique x 
such that P(x) is true”. 
 Give the truth values of the following 
statements : 
 I. ?!xP(x) ? ?xP(x) 
 II. ?!x ¬ P(x) ? ¬?xP(x) 
 (A) Both I & II are true. 
 (B) Both I & II are false. 
 (C) I – false, II – true 
 (D) I – true, II – false 
Page 4


1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of fifty multiple-choice type of questions.
3. 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 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 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 below on
the correct response against each item.
Example :
where (C) is the correct response.
5. Your responses to the items are to be indicated 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 instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
8. If you write your Name, Roll Number, Phone Number or put
any mark on any part of the OMR Sheet, except for the space
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
9. You have to return the test question booklet and Original
OMR Sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall. Y ou are, however, allowed to carry original
question booklet and 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 Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
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)
J 1 4
J-87-14 1 P.T.O.
Paper-II 2  J-87-14 
 
 
 
 
 
1. Infrared signals can be used for short 
range communication in a closed 
area using _______ propagation. 
 (A) ground (B) sky 
 (C) line of sight (D) space  
 
2. A bridge has access to _______ 
address in the same network. 
 (A) Physical (B) Network 
 (C) Datalink (D) Application 
 
3. The minimum frame length for            
10 Mbps Ethernet is _______ bytes 
and maximum is _______ bytes. 
 (A) 64 & 128 (B) 128 & 1518 
 (C) 1518 & 3036 (D) 64 & 1518 
 
4. The bit rate of a signal is 3000 bps. If 
each signal unit carries 6 bits, the baud 
rate of the signal is _______. 
 (A) 500 baud/sec  
 (B) 1000 baud/sec 
 (C) 3000 baud/sec 
 (D) 18000 baud/sec. 
 
5. Match the following : 
List – I List – II 
a. Physical 
layer 
i. Allow resources to 
network access  
b. Datalink 
layer 
ii. Move packets from 
one destination to 
other  
c. Network 
layer 
iii. Process to process 
message delivery 
d. Transport 
layer 
iv. Transmission of 
bit stream 
e. Application 
Layer 
v. Formation of 
frames 
 Codes : 
  a b c d e 
 (A) iv v ii iii i 
 (B) v iv i ii iii  
 (C) i iii ii v iv 
 (D) i ii iv iii v 
 
 
 
 
 
6. A grammar G is LL(1) if and only if 
the following conditions hold for two 
distinct productions A ? a | ß 
 I. First (a) n First (ß) ? {a} where 
a is some terminal symbol of the 
grammar. 
 II. First (a) n First (ß) ? ? 
 III. First (a) n Follow (A) = f if ? ? 
First (ß)  
 (A) I and II (B) I and III 
 (C) II and III (D) I, II and III 
 
7. Which of the following suffices to convert 
an arbitrary CFG to an LL(1) grammar ? 
 (A) Removing left recursion alone 
 (B) Removing the grammar alone 
 (C) Removing left recursion and 
factoring the grammar 
 (D) None of the above 
 
8. A shift reduce parser suffers from  
 (A) shift reduce conflict only 
 (B) reduce reduce conflict only 
 (C) both shift reduce conflict and 
reduce reduce conflict 
 (D) shift handle and reduce handle 
conflicts 
 
9. The context free grammar for the 
language L = {a
n
b
m
c
k
 | k = |n – m|,               
n > 0, m > 0, k > 0} is 
 (A) S ? S
1
S
3
, S
1
 ? aS
1
c | S
2
| ?,            
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4 
| ?, 
S
4
 ? bS
4
c|? 
 (B) S ? S
1
S
3
, S
1
? aS
1
S
2
c | ?,              
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4
 |?, 
S
4
 ? bS
4
c|? 
 (C) S ? S
1
|S
2
, S
1
? aS
1
S
2
c | ?,          
S
2
 ? aS
2
b | ?, S
3
 ? aS
3
b | S
4
 |?, 
S
4
 ? bS
4
c|? 
 (D) S ? S
1 
| S
3
, S
1
? aS
1
c|S
2 
| ?,               
S
2
 ? aS
2
b | ?, S
3
 ? a S
3
b| S
4
 | ?, 
S
4
 ? bS
4
c | ? 
COMPUTER SCIENCE AND APPLICATIONS  
Paper – II 
 
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All 
questions are compulsory. 
 
 J-87-14 3  Paper-II 
10. The regular grammar for the language 
L = {w|n
a
(w) and n
b
(w) are both even, 
w ? {a, b}*} is given by : 
 (Assume, p, q, r and s are states) 
 (A) p ? aq | br | ?, q ? bs | ap  
  r ? as | bp, s ? ar | bq, p and s 
are initial and final states. 
 (B) p ? aq | br, q ? bs | ap 
  r ? as | bp, s ? ar | bq, p and s 
are initial and final states. 
 (C) p ? aq | br | ?, q ? bs | ap 
  r ? as | bp, s ? ar | bq 
  p is both initial and final states. 
 (D) p ? aq | br, q ? bs | ap 
  r ? as | bp, s ? ar | bq 
  p is both initial and final states. 
 
11. KPA in CMM stands for 
 (A) Key Process Area 
 (B) Key Product Area 
 (C) Key Principal Area 
 (D) Key Performance Area  
 
12. Which one of the following is not a 
risk management technique for 
managing the risk due to unrealistic 
schedules and budgets ? 
 (A) Detailed multi source cost and 
schedule estimation. 
 (B) Design cost 
 (C) Incremental development 
 (D) Information hiding 
 
13. _______ of a system is the structure or 
structures of the system which 
comprise software elements, the 
externally visible properties of these 
elements and the relationship amongst 
them. 
 (A) Software construction  
 (B) Software evolution 
 (C) Software architecture 
 (D) Software reuse 
 
14. In function point analysis, the number 
of complexity adjustment factors is 
 (A) 10 (B) 12 
 (C) 14 (D) 20 
15. Regression testing is primarily related to 
 (A) Functional testing 
 (B) Development testing 
 (C) Data flow testing 
 (D) Maintenance testing 
 
16. How many different truth tables of the 
compound propositions are there that 
involve the propositions p & q ? 
 (A) 2 (B) 4 
 (C) 8 (D) 16 
 
17. A Boolean function F is called self- 
dual if and only if  
 F(x
1
, x
2
, … x
n
) = F(
–
x
1
, 
–
x
2
, … 
–
x
n
) 
 How many Boolean functions of 
degree n are self-dual ? 
 (A) 2
n
 (B) (2)
2
n
 
 (C) (2)
 n
2
 (D) (2)
 2
n–1 
 
18. Which of the following statement(s) is 
(are) not correct ? 
 i. The 2’s complement of 0 is 0. 
 ii. In 2’s complement, the left most 
bit cannot be used to express a 
quantity. 
 iii. For an n-bit word (2’s 
complement) which includes the 
sign bit, there are 2
n–1
 positive 
integers, 2
n+1
 negative integers 
and one 0 for a total of 2
n
 unique 
states. 
 iv. In 2’s complement the significant 
information is contained in the 
1’s of positive numbers and 0’s 
of the negative numbers. 
 (A) i & iv (B) i & ii 
 (C) iii  (D) iv  
 
19. The notation ?!xP(x) denotes the 
proposition “there exists a unique x 
such that P(x) is true”. 
 Give the truth values of the following 
statements : 
 I. ?!xP(x) ? ?xP(x) 
 II. ?!x ¬ P(x) ? ¬?xP(x) 
 (A) Both I & II are true. 
 (B) Both I & II are false. 
 (C) I – false, II – true 
 (D) I – true, II – false 
Paper-II 4  J-87-14 
20. Give a compound proposition 
involving propositions p, q and r that is 
true when exactly two of p, q and r are 
true and is false otherwise. 
 (A) (p?q?¬r) ? (p?¬q?r) ? (¬p?q?r) 
 (B) (p?q?¬r) ? (p?q?¬r) ? (¬p?q?r) 
 (C) (p?q?¬r) ? (p?¬q?r) ? (¬p?q?r) 
 (D) (p?q?¬r) ? (p?¬q?r) ?  (¬p?q?r) 
 
21. Consider the graph given below as : 
 
 Which one of the following graph is 
isomorphic to the above graph ? 
 (A)  
 
 (B)  
 
 (C)  
 
 (D)  
 
22. The upper bound and lower bound for 
the number of leaves in a B-tree of 
degree K with height h is given by : 
 (A) K
h
 and 2?
K
/
2
?
h–1
 
 (B) K
*
h and 2?
K
/
2
?
h–1
 
 (C) K
h
 and 2?
K
/
2
?
h–1
 
 (D) K
*
h and 2?
K
/
2
?
h–1
 
23. Consider a complete bipartite graph 
k
m,n
. For which values of m and n does 
this, complete graph have a Hamilton 
circuit  
 (A) m = 3, n = 2 (B) m = 2, n = 3 
 (C) m = n > 2 (D) m = n > 3 
 
24. Big-O estimates for the factorial 
function and the logarithm of the 
factorial function i.e. n! and log n! is 
given by 
 (A) O(n!) and O(n log n) 
 (B) O(n
n
) and O(n log n) 
 (C) O(n!) and O(log n!) 
 (D) O(n
n
) and O(log n!) 
 
25. How many cards must be chosen from 
a deck to guarantee that atleast 
 i. two aces of two kinds are chosen. 
 ii. two aces are chosen. 
 iii. two cards of the same kind are 
chosen. 
 iv. two cards of two different kinds 
are chosen. 
 (A) 50, 50, 14, 5 (B) 51, 51, 15, 7 
 (C) 52, 52, 14, 5 (D) 51, 51, 14, 5 
 
26. Match the following with respect to the 
mobile computing technologies : 
List – I List – II 
a. GPRS i. An integrated digital 
radio standard 
b. GSM ii. 3G wireless/Mobile 
technology 
c. UMTS iii. Nine different 
schemes for 
modulation and error 
correction 
d. EDGE iv. An emerging wireless 
service that offers a 
mobile data 
 Codes : 
  a b c d 
 (A) iii iv ii i 
 (B) iv i ii iii 
 (C) ii iii iv i 
 (D) ii i iv iii 
Page 5


1. Write your roll number in the space provided on the top of
this page.
2. This paper consists of fifty multiple-choice type of questions.
3. 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 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 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 below on
the correct response against each item.
Example :
where (C) is the correct response.
5. Your responses to the items are to be indicated 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 instructions given inside carefully.
7. Rough Work is to be done in the end of this booklet.
8. If you write your Name, Roll Number, Phone Number or put
any mark on any part of the OMR Sheet, except for the space
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means such as change of response by scratching or using
white fluid, you will render yourself liable to disqualification.
9. You have to return the test question booklet and Original
OMR Sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall. Y ou are, however, allowed to carry original
question booklet and 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 Questions in this Booklet : 50
Instructions for the Candidates ¯Ö¸üßõÖÖÙ£ÖµÖÖë Ûêú ×»Ö‹ ×®Ö¤ìü¿Ö
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)
J 1 4
J-87-14 1 P.T.O.
Paper-II 2  J-87-14 
 
 
 
 
 
1. Infrared signals can be used for short 
range communication in a closed 
area using _______ propagation. 
 (A) ground (B) sky 
 (C) line of sight (D) space  
 
2. A bridge has access to _______ 
address in the same network. 
 (A) Physical (B) Network 
 (C) Datalink (D) Application 
 
3. The minimum frame length for            
10 Mbps Ethernet is _______ bytes 
and maximum is _______ bytes. 
 (A) 64 & 128 (B) 128 & 1518 
 (C) 1518 & 3036 (D) 64 & 1518 
 
4. The bit rate of a signal is 3000 bps. If 
each signal unit carries 6 bits, the baud 
rate of the signal is _______. 
 (A) 500 baud/sec  
 (B) 1000 baud/sec 
 (C) 3000 baud/sec 
 (D) 18000 baud/sec. 
 
5. Match the following : 
List – I List – II 
a. Physical 
layer 
i. Allow resources to 
network access  
b. Datalink 
layer 
ii. Move packets from 
one destination to 
other  
c. Network 
layer 
iii. Process to process 
message delivery 
d. Transport 
layer 
iv. Transmission of 
bit stream 
e. Application 
Layer 
v. Formation of 
frames 
 Codes : 
  a b c d e 
 (A) iv v ii iii i 
 (B) v iv i ii iii  
 (C) i iii ii v iv 
 (D) i ii iv iii v 
 
 
 
 
 
6. A grammar G is LL(1) if and only if 
the following conditions hold for two 
distinct productions A ? a | ß 
 I. First (a) n First (ß) ? {a} where 
a is some terminal symbol of the 
grammar. 
 II. First (a) n First (ß) ? ? 
 III. First (a) n Follow (A) = f if ? ? 
First (ß)  
 (A) I and II (B) I and III 
 (C) II and III (D) I, II and III 
 
7. Which of the following suffices to convert 
an arbitrary CFG to an LL(1) grammar ? 
 (A) Removing left recursion alone 
 (B) Removing the grammar alone 
 (C) Removing left recursion and 
factoring the grammar 
 (D) None of the above 
 
8. A shift reduce parser suffers from  
 (A) shift reduce conflict only 
 (B) reduce reduce conflict only 
 (C) both shift reduce conflict and 
reduce reduce conflict 
 (D) shift handle and reduce handle 
conflicts 
 
9. The context free grammar for the 
language L = {a
n
b
m
c
k
 | k = |n – m|,               
n > 0, m > 0, k > 0} is 
 (A) S ? S
1
S
3
, S
1
 ? aS
1
c | S
2
| ?,            
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4 
| ?, 
S
4
 ? bS
4
c|? 
 (B) S ? S
1
S
3
, S
1
? aS
1
S
2
c | ?,              
S
2
 ? aS
2
b|?, S
3
 ? aS
3
b| S
4
 |?, 
S
4
 ? bS
4
c|? 
 (C) S ? S
1
|S
2
, S
1
? aS
1
S
2
c | ?,          
S
2
 ? aS
2
b | ?, S
3
 ? aS
3
b | S
4
 |?, 
S
4
 ? bS
4
c|? 
 (D) S ? S
1 
| S
3
, S
1
? aS
1
c|S
2 
| ?,               
S
2
 ? aS
2
b | ?, S
3
 ? a S
3
b| S
4
 | ?, 
S
4
 ? bS
4
c | ? 
COMPUTER SCIENCE AND APPLICATIONS  
Paper – II 
 
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All 
questions are compulsory. 
 
 J-87-14 3  Paper-II 
10. The regular grammar for the language 
L = {w|n
a
(w) and n
b
(w) are both even, 
w ? {a, b}*} is given by : 
 (Assume, p, q, r and s are states) 
 (A) p ? aq | br | ?, q ? bs | ap  
  r ? as | bp, s ? ar | bq, p and s 
are initial and final states. 
 (B) p ? aq | br, q ? bs | ap 
  r ? as | bp, s ? ar | bq, p and s 
are initial and final states. 
 (C) p ? aq | br | ?, q ? bs | ap 
  r ? as | bp, s ? ar | bq 
  p is both initial and final states. 
 (D) p ? aq | br, q ? bs | ap 
  r ? as | bp, s ? ar | bq 
  p is both initial and final states. 
 
11. KPA in CMM stands for 
 (A) Key Process Area 
 (B) Key Product Area 
 (C) Key Principal Area 
 (D) Key Performance Area  
 
12. Which one of the following is not a 
risk management technique for 
managing the risk due to unrealistic 
schedules and budgets ? 
 (A) Detailed multi source cost and 
schedule estimation. 
 (B) Design cost 
 (C) Incremental development 
 (D) Information hiding 
 
13. _______ of a system is the structure or 
structures of the system which 
comprise software elements, the 
externally visible properties of these 
elements and the relationship amongst 
them. 
 (A) Software construction  
 (B) Software evolution 
 (C) Software architecture 
 (D) Software reuse 
 
14. In function point analysis, the number 
of complexity adjustment factors is 
 (A) 10 (B) 12 
 (C) 14 (D) 20 
15. Regression testing is primarily related to 
 (A) Functional testing 
 (B) Development testing 
 (C) Data flow testing 
 (D) Maintenance testing 
 
16. How many different truth tables of the 
compound propositions are there that 
involve the propositions p & q ? 
 (A) 2 (B) 4 
 (C) 8 (D) 16 
 
17. A Boolean function F is called self- 
dual if and only if  
 F(x
1
, x
2
, … x
n
) = F(
–
x
1
, 
–
x
2
, … 
–
x
n
) 
 How many Boolean functions of 
degree n are self-dual ? 
 (A) 2
n
 (B) (2)
2
n
 
 (C) (2)
 n
2
 (D) (2)
 2
n–1 
 
18. Which of the following statement(s) is 
(are) not correct ? 
 i. The 2’s complement of 0 is 0. 
 ii. In 2’s complement, the left most 
bit cannot be used to express a 
quantity. 
 iii. For an n-bit word (2’s 
complement) which includes the 
sign bit, there are 2
n–1
 positive 
integers, 2
n+1
 negative integers 
and one 0 for a total of 2
n
 unique 
states. 
 iv. In 2’s complement the significant 
information is contained in the 
1’s of positive numbers and 0’s 
of the negative numbers. 
 (A) i & iv (B) i & ii 
 (C) iii  (D) iv  
 
19. The notation ?!xP(x) denotes the 
proposition “there exists a unique x 
such that P(x) is true”. 
 Give the truth values of the following 
statements : 
 I. ?!xP(x) ? ?xP(x) 
 II. ?!x ¬ P(x) ? ¬?xP(x) 
 (A) Both I & II are true. 
 (B) Both I & II are false. 
 (C) I – false, II – true 
 (D) I – true, II – false 
Paper-II 4  J-87-14 
20. Give a compound proposition 
involving propositions p, q and r that is 
true when exactly two of p, q and r are 
true and is false otherwise. 
 (A) (p?q?¬r) ? (p?¬q?r) ? (¬p?q?r) 
 (B) (p?q?¬r) ? (p?q?¬r) ? (¬p?q?r) 
 (C) (p?q?¬r) ? (p?¬q?r) ? (¬p?q?r) 
 (D) (p?q?¬r) ? (p?¬q?r) ?  (¬p?q?r) 
 
21. Consider the graph given below as : 
 
 Which one of the following graph is 
isomorphic to the above graph ? 
 (A)  
 
 (B)  
 
 (C)  
 
 (D)  
 
22. The upper bound and lower bound for 
the number of leaves in a B-tree of 
degree K with height h is given by : 
 (A) K
h
 and 2?
K
/
2
?
h–1
 
 (B) K
*
h and 2?
K
/
2
?
h–1
 
 (C) K
h
 and 2?
K
/
2
?
h–1
 
 (D) K
*
h and 2?
K
/
2
?
h–1
 
23. Consider a complete bipartite graph 
k
m,n
. For which values of m and n does 
this, complete graph have a Hamilton 
circuit  
 (A) m = 3, n = 2 (B) m = 2, n = 3 
 (C) m = n > 2 (D) m = n > 3 
 
24. Big-O estimates for the factorial 
function and the logarithm of the 
factorial function i.e. n! and log n! is 
given by 
 (A) O(n!) and O(n log n) 
 (B) O(n
n
) and O(n log n) 
 (C) O(n!) and O(log n!) 
 (D) O(n
n
) and O(log n!) 
 
25. How many cards must be chosen from 
a deck to guarantee that atleast 
 i. two aces of two kinds are chosen. 
 ii. two aces are chosen. 
 iii. two cards of the same kind are 
chosen. 
 iv. two cards of two different kinds 
are chosen. 
 (A) 50, 50, 14, 5 (B) 51, 51, 15, 7 
 (C) 52, 52, 14, 5 (D) 51, 51, 14, 5 
 
26. Match the following with respect to the 
mobile computing technologies : 
List – I List – II 
a. GPRS i. An integrated digital 
radio standard 
b. GSM ii. 3G wireless/Mobile 
technology 
c. UMTS iii. Nine different 
schemes for 
modulation and error 
correction 
d. EDGE iv. An emerging wireless 
service that offers a 
mobile data 
 Codes : 
  a b c d 
 (A) iii iv ii i 
 (B) iv i ii iii 
 (C) ii iii iv i 
 (D) ii i iv iii 
 J-87-14 5  Paper-II 
27. Object Request Broker (ORB) is 
 I. A software program that runs on 
the client as well as on the 
application server. 
 II. A software program that runs on 
the client side only. 
 III. A software program that runs on 
the application server, where 
most of the components reside.  
 (A) I, II & III (B) I & II 
 (C) II & III (D) I only 
 
28. A software agent is defined as 
 I. A software developed for 
accomplishing a given task. 
 II. A computer program which is 
capable of acting on behalf of the 
user in order to accomplish a 
given computational task. 
 III. An open source software for 
accomplishing a given task. 
 (A) I  
 (B) II 
 (C) III  
 (D) All of the above 
 
29. Match the following : 
List – I List – II 
a. Classification i. Principal 
component 
analysis 
b. Clustering ii. Branch and Bound 
c. Feature 
Extraction 
iii. K-nearest 
neighbour 
d. Feature 
Selection 
iv. K-means 
 Codes : 
  a b c d 
 (A) iii iv ii i 
 (B) iv iii i ii 
 (C) iii iv i ii 
 (D) iv iii ii i 
 
30. SET, an open encryption and security 
specification model that is designed for 
protecting credit card transactions on 
the internet, stands for 
 (A) Secure Electronic Transaction 
 (B) Secular Enterprise for Transaction 
 (C) Security Electronic Transmission 
 (D) Secured Electronic Termination  
 
31. In a paged memory management 
algorithm, the hit ratio is 70%. If it takes 
30 nanoseconds to search Translation 
Look-aside Buffer (TLB) and 100 
nanoseconds (ns) to access memory, the 
effective memory access time is 
 (A) 91 ns (B) 69 ns 
 (C) 200 ns (D) 160 ns 
32. Match the following : 
List – I List – II 
a. Multilevel 
feedback queue 
i. Time-slicing 
b. FCFS ii. Criteria to 
move processes 
between queues 
c. Shortest 
process next 
iii. Batch 
processing 
d. Round robin 
scheduling 
iv. Exponential 
smoothening  
 Codes : 
  a b c d 
 (A) i iii ii iv 
 (B) iv iii ii i 
 (C) iii i iv i 
 (D) ii iii iv i 
 
33. Consider a system with five processes 
P
0
 through P
4
 and three resource types 
R
1
, R
2
 and R
3
. Resource type R
1
 has 
10 instances, R
2
 has 5 instances and R
3 
has 7 instances. Suppose that at time 
T
0
, the following snapshot of the 
system has been taken : 
 Allocation 
 R
1
 R
2
 R
3
 
P
0
 0 1 0 
P
1
 2 0 0 
P
2
 3 0 2 
P
3
 2 1 1 
P
4
 0 2 2 
  
Max 
R
1
 R
2
 R
3
 
7 5 3 
3 2 2 
9 0 2 
2 2 2 
4 3 3 
 
Available 
R
1
 R
2
 R
3
 
3 3 2 
 Assume that now the process P
1
 requests 
one additional instance of type R
1
 and 
two instances of resource type R
3
. The 
state resulting after this allocation will be 
 (A) Ready state (B) Safe state 
 (C) Blocked state (D) Unsafe state