UGC NET Exam  >  UGC NET Notes  >  UGC NET Past Year Papers  >  UGC NET Past Year Question Paper II: Computer Science (2010 December Session)

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

Download, print and study this document offline
Please wait while the PDF view is loading
 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). Y ou have to darken the oval as indicated below on the
correct response against each item.
Example :
where (C) is the correct response.
5. Y our responses to the items are to be indicated in the Answer
Sheet given inside the Paper I Booklet only. If you mark at
any place other than in the ovals in the Answer 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 or put any mark on any part of the test
booklet, except for the space allotted for the relevant entries,
which may disclose your identity, you will render yourself
liable to disqualification.
9. Y ou have to return the test question booklet and OMR Answer
sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall.
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 ¯Ö¸üß?ÖÖÙ£ÖµÖÖë ?êú ×»Ö‹ ×­Ö¤ìü¿Ö
A B C D
A B C D
D-87-10 1 P.T.O.
1. ¯ÖÆü»Öê ¯Öéšü ?êú ‰ú¯Ö¸ü ×­ÖµÖŸÖ Ã£ÖÖ ­Ö ¯Ö¸ü †¯Ö­ÖÖ ¸üÖê»Ö ­Ö´²Ö¸ü ×»Ö×?Ö‹ …
2. ‡ÃÖ ¯ÖÏ¿­Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾Ö?ú»¯ÖßµÖ ¯ÖÏ¿­Ö Æïü …
3. ¯Ö¸üß?ÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê­Öê ¯Ö¸ü, ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ †Ö¯Ö?úÖê ¤êü ¤üß •ÖÖµÖê?Öß … ¯ÖÆü»Öê ¯ÖÖÑ“Ö
×´Ö­Ö™ü †Ö¯Ö?úÖê ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ŸÖ£ÖÖ ˆÃÖ?úß ×­Ö´­Ö×»Ö×?ÖŸÖ •ÖÖÑ“Ö ?êú
×»Ö‹ פüµÖê •ÖÖµÖë?Öê, וÖÃÖ?úß •ÖÖÑ“Ö †Ö¯Ö?úÖê †¾Ö¿µÖ ?ú¸ü­Öß Æîü :
(i) ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ?êú ×»Ö‹ ˆÃÖ?êú ?ú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »Ö?Öß ?úÖ?Ö•Ö ?úß
ÃÖᯙ ?úÖê ±úÖ›Íü »Öë … ?Öã»Öß Æãü‡Ô µÖÖ ×²Ö­ÖÖ Ã™üß?ú¸ü-ÃÖᯙ ?úß ¯ÖãÛßÖ?úÖ
þÖß?úÖ¸ü ­Ö ?ú¸ëü …
(ii) ?ú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×­Ö¤ìü¿ÖÖ­ÖãÃÖÖ¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?êú ¯Öéšü ŸÖ£ÖÖ ¯ÖÏ¿­ÖÖë
?úß ÃÖÓ?µÖÖ ?úÖê †“”ûß ŸÖ¸üÆü “Öî?ú ?ú¸ü »Öë ×?ú µÖê ¯Öæ¸êü Æïü … ¤üÖêÂÖ¯Öæ?ÖÔ
¯ÖãÛßÖ?úÖ ×•Ö­Ö´Öë ¯Öéšü/¯ÖÏ¿­Ö ?ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ †Ö ?ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö
´Öë ­Ö ÆüÖë †£ÖÖÔŸÖ ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úß ¡Öã×™ü¯Öæ?ÖÔ ¯ÖãÛßÖ?úÖ Ã¾Öß?úÖ¸ü ­Ö
?ú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖµÖ ˆÃÖê »ÖÖî™üÖ?ú¸ü ˆÃÖ?êú ãÖÖ­Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß
¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ »Öê »Öë … ‡ÃÖ?êú ×»Ö‹ †Ö¯Ö?úÖê ¯ÖÖÑ“Ö ×´Ö­Ö™ü פüµÖê •ÖÖµÖë?Öê …
ˆÃÖ?êú ²ÖÖ¤ü ­Ö ŸÖÖê †Ö¯Ö?úß ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖµÖê?Öß †Öî¸ü ­Ö
Æüß †Ö¯Ö?úÖê †×ŸÖ׸üŒŸÖ ÃÖ´ÖµÖ ×¤üµÖÖ •ÖÖµÖê?ÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö ?êú ²ÖÖ¤ü OMR ¯Ö¡Ö?ú ?úß ?Îú´Ö ÃÖÓ?µÖÖ ‡ÃÖ ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¯Ö¸ü
†Ó×?úŸÖ ?ú¸ü ¤ëü …
4. ¯ÖÏŸµÖê?ú ¯ÖÏ¿­Ö ?êú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾Ö?ú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê ?ÖµÖê
Æïü … †Ö¯Ö?úÖê ÃÖÆüß ˆ¢Ö¸ü ?êú ¤üß‘ÖÔ¾Öé¢Ö ?úÖê ¯Öê­Ö ÃÖê ³Ö¸ü?ú¸ü ?úÖ»ÖÖ ?ú¸ü­ÖÖ Æîü •ÖîÃÖÖ
×?ú ­Öß“Öê פü?ÖÖµÖÖ ?ÖµÖÖ Æîü …
ˆ¤üÖÆü¸ü?Ö :
•Ö²Ö×?ú (C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿­ÖÖë ?êú ˆ¢Ö¸ü ?êú¾Ö»Ö ¯ÖÏ¿­Ö ¯Ö¡Ö I ?êú †­¤ü¸ü פüµÖê ?ÖµÖê ˆ¢Ö¸ü-¯Ö¡Ö?ú ¯Ö¸ü Æüß †Ó×?úŸÖ
?ú¸ü­Öê Æïü … µÖפü †Ö¯Ö ˆ¢Ö¸ü ¯Ö¡Ö?ú ¯Ö¸ü פüµÖê ?ÖµÖê ¤üß‘ÖÔ¾Öé¢Ö ?êú †»ÖÖ¾ÖÖ ×?úÃÖß †­µÖ
ãÖÖ­Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ­ÖÖÓ×?úŸÖ ?ú¸ŸÖê Æïü, ŸÖÖê ˆÃÖ?úÖ ´Ö滵ÖÖÓ?ú­Ö ­ÖÆüà ÆüÖê?ÖÖ …
6. †­¤ü¸ü פüµÖê ?ÖµÖê ×­Ö¤ìü¿ÖÖë ?úÖê ¬µÖÖ­Ö¯Öæ¾ÖÔ?ú ¯ÖœÍëü …
7. ?ú““ÖÖ ?úÖ´Ö (Rough Work) ‡ÃÖ ¯ÖãÛßÖ?úÖ ?êú †Û­ŸÖ´Ö ¯Öéšü ¯Ö¸ü ?ú¸ëü …
8. µÖפü †Ö¯Ö ˆ¢Ö¸ü-¯ÖãÛßÖ?úÖ ¯Ö¸ü †¯Ö­ÖÖ ­ÖÖ´Ö µÖÖ ‹êÃÖÖ ?úÖê‡Ô ³Öß ×­Ö¿ÖÖ­Ö ×•ÖÃÖÃÖê
†Ö¯Ö?úß ¯ÖÆü“ÖÖ­Ö ÆüÖê ÃÖ?êú, ×?úÃÖß ³Öß ³ÖÖ?Ö ¯Ö¸ü ¤ü¿ÖÖÔŸÖê µÖÖ †Ó×?úŸÖ ?ú¸üŸÖê Æïü ŸÖÖê
¯Ö¸üß?ÖÖ ?êú ×»ÖµÖê †µÖÖê?µÖ ‘ÖÖê×ÂÖŸÖ ?ú¸ü פüµÖê •ÖÖµÖë?Öê …
9. †Ö¯Ö?úÖê ¯Ö¸üß?ÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê­Öê ¯Ö¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ‹¾ÖÓ OMR ˆ¢Ö¸ü-¯Ö¡Ö?ú
×­Ö¸üß?Ö?ú ´ÖÆüÖê¤üµÖ ?úÖê »ÖÖî™üÖ­ÖÖ †Ö¾Ö¿µÖ?ú Æîü †Öî¸ü ¯Ö¸üß?ÖÖ ÃÖ´ÖÖÛ¯ŸÖ ?êú ²ÖÖ¤ü ˆÃÖê
†¯Ö­Öê ÃÖÖ£Ö ¯Ö¸üß?ÖÖ ³Ö¾Ö­Ö ÃÖê ²ÖÖÆü¸ü ­Ö »Öê?ú¸ü •ÖÖµÖë …
10. ?êú¾Ö»Ö ­Öß»Öê/?úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê­Ö ?úÖ Æüß ‡ÃŸÖê´ÖÖ»Ö ?ú¸ëü …
11. ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úÖ ÃÖÓ?Ö?Ö?ú (?îú»Ö?ãú»Öê™ü¸ü) µÖÖ »ÖÖ?Ö ™êü²Ö»Ö †Öפü ?úÖ
¯ÖϵÖÖê?Ö ¾ÖÙ•ÖŸÖ Æîü …
12. ?Ö»ÖŸÖ ˆ¢Ö¸üÖë ?êú ×»Ö‹ ?úÖê‡Ô †Ó?ú ?úÖ™êü ­ÖÆüà •ÖÖ‹Ñ?Öê …
[Maximum Marks : 100
Time : 1 
1
/
4
 hours]
PAPER-II
COMPUTER SCIENCE AND APPLICA TIONS
(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 0
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). Y ou have to darken the oval as indicated below on the
correct response against each item.
Example :
where (C) is the correct response.
5. Y our responses to the items are to be indicated in the Answer
Sheet given inside the Paper I Booklet only. If you mark at
any place other than in the ovals in the Answer 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 or put any mark on any part of the test
booklet, except for the space allotted for the relevant entries,
which may disclose your identity, you will render yourself
liable to disqualification.
9. Y ou have to return the test question booklet and OMR Answer
sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall.
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 ¯Ö¸üß?ÖÖÙ£ÖµÖÖë ?êú ×»Ö‹ ×­Ö¤ìü¿Ö
A B C D
A B C D
D-87-10 1 P.T.O.
1. ¯ÖÆü»Öê ¯Öéšü ?êú ‰ú¯Ö¸ü ×­ÖµÖŸÖ Ã£ÖÖ ­Ö ¯Ö¸ü †¯Ö­ÖÖ ¸üÖê»Ö ­Ö´²Ö¸ü ×»Ö×?Ö‹ …
2. ‡ÃÖ ¯ÖÏ¿­Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾Ö?ú»¯ÖßµÖ ¯ÖÏ¿­Ö Æïü …
3. ¯Ö¸üß?ÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê­Öê ¯Ö¸ü, ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ †Ö¯Ö?úÖê ¤êü ¤üß •ÖÖµÖê?Öß … ¯ÖÆü»Öê ¯ÖÖÑ“Ö
×´Ö­Ö™ü †Ö¯Ö?úÖê ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ŸÖ£ÖÖ ˆÃÖ?úß ×­Ö´­Ö×»Ö×?ÖŸÖ •ÖÖÑ“Ö ?êú
×»Ö‹ פüµÖê •ÖÖµÖë?Öê, וÖÃÖ?úß •ÖÖÑ“Ö †Ö¯Ö?úÖê †¾Ö¿µÖ ?ú¸ü­Öß Æîü :
(i) ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ?êú ×»Ö‹ ˆÃÖ?êú ?ú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »Ö?Öß ?úÖ?Ö•Ö ?úß
ÃÖᯙ ?úÖê ±úÖ›Íü »Öë … ?Öã»Öß Æãü‡Ô µÖÖ ×²Ö­ÖÖ Ã™üß?ú¸ü-ÃÖᯙ ?úß ¯ÖãÛßÖ?úÖ
þÖß?úÖ¸ü ­Ö ?ú¸ëü …
(ii) ?ú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×­Ö¤ìü¿ÖÖ­ÖãÃÖÖ¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?êú ¯Öéšü ŸÖ£ÖÖ ¯ÖÏ¿­ÖÖë
?úß ÃÖÓ?µÖÖ ?úÖê †“”ûß ŸÖ¸üÆü “Öî?ú ?ú¸ü »Öë ×?ú µÖê ¯Öæ¸êü Æïü … ¤üÖêÂÖ¯Öæ?ÖÔ
¯ÖãÛßÖ?úÖ ×•Ö­Ö´Öë ¯Öéšü/¯ÖÏ¿­Ö ?ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ †Ö ?ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö
´Öë ­Ö ÆüÖë †£ÖÖÔŸÖ ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úß ¡Öã×™ü¯Öæ?ÖÔ ¯ÖãÛßÖ?úÖ Ã¾Öß?úÖ¸ü ­Ö
?ú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖµÖ ˆÃÖê »ÖÖî™üÖ?ú¸ü ˆÃÖ?êú ãÖÖ­Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß
¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ »Öê »Öë … ‡ÃÖ?êú ×»Ö‹ †Ö¯Ö?úÖê ¯ÖÖÑ“Ö ×´Ö­Ö™ü פüµÖê •ÖÖµÖë?Öê …
ˆÃÖ?êú ²ÖÖ¤ü ­Ö ŸÖÖê †Ö¯Ö?úß ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖµÖê?Öß †Öî¸ü ­Ö
Æüß †Ö¯Ö?úÖê †×ŸÖ׸üŒŸÖ ÃÖ´ÖµÖ ×¤üµÖÖ •ÖÖµÖê?ÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö ?êú ²ÖÖ¤ü OMR ¯Ö¡Ö?ú ?úß ?Îú´Ö ÃÖÓ?µÖÖ ‡ÃÖ ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¯Ö¸ü
†Ó×?úŸÖ ?ú¸ü ¤ëü …
4. ¯ÖÏŸµÖê?ú ¯ÖÏ¿­Ö ?êú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾Ö?ú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê ?ÖµÖê
Æïü … †Ö¯Ö?úÖê ÃÖÆüß ˆ¢Ö¸ü ?êú ¤üß‘ÖÔ¾Öé¢Ö ?úÖê ¯Öê­Ö ÃÖê ³Ö¸ü?ú¸ü ?úÖ»ÖÖ ?ú¸ü­ÖÖ Æîü •ÖîÃÖÖ
×?ú ­Öß“Öê פü?ÖÖµÖÖ ?ÖµÖÖ Æîü …
ˆ¤üÖÆü¸ü?Ö :
•Ö²Ö×?ú (C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿­ÖÖë ?êú ˆ¢Ö¸ü ?êú¾Ö»Ö ¯ÖÏ¿­Ö ¯Ö¡Ö I ?êú †­¤ü¸ü פüµÖê ?ÖµÖê ˆ¢Ö¸ü-¯Ö¡Ö?ú ¯Ö¸ü Æüß †Ó×?úŸÖ
?ú¸ü­Öê Æïü … µÖפü †Ö¯Ö ˆ¢Ö¸ü ¯Ö¡Ö?ú ¯Ö¸ü פüµÖê ?ÖµÖê ¤üß‘ÖÔ¾Öé¢Ö ?êú †»ÖÖ¾ÖÖ ×?úÃÖß †­µÖ
ãÖÖ­Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ­ÖÖÓ×?úŸÖ ?ú¸ŸÖê Æïü, ŸÖÖê ˆÃÖ?úÖ ´Ö滵ÖÖÓ?ú­Ö ­ÖÆüà ÆüÖê?ÖÖ …
6. †­¤ü¸ü פüµÖê ?ÖµÖê ×­Ö¤ìü¿ÖÖë ?úÖê ¬µÖÖ­Ö¯Öæ¾ÖÔ?ú ¯ÖœÍëü …
7. ?ú““ÖÖ ?úÖ´Ö (Rough Work) ‡ÃÖ ¯ÖãÛßÖ?úÖ ?êú †Û­ŸÖ´Ö ¯Öéšü ¯Ö¸ü ?ú¸ëü …
8. µÖפü †Ö¯Ö ˆ¢Ö¸ü-¯ÖãÛßÖ?úÖ ¯Ö¸ü †¯Ö­ÖÖ ­ÖÖ´Ö µÖÖ ‹êÃÖÖ ?úÖê‡Ô ³Öß ×­Ö¿ÖÖ­Ö ×•ÖÃÖÃÖê
†Ö¯Ö?úß ¯ÖÆü“ÖÖ­Ö ÆüÖê ÃÖ?êú, ×?úÃÖß ³Öß ³ÖÖ?Ö ¯Ö¸ü ¤ü¿ÖÖÔŸÖê µÖÖ †Ó×?úŸÖ ?ú¸üŸÖê Æïü ŸÖÖê
¯Ö¸üß?ÖÖ ?êú ×»ÖµÖê †µÖÖê?µÖ ‘ÖÖê×ÂÖŸÖ ?ú¸ü פüµÖê •ÖÖµÖë?Öê …
9. †Ö¯Ö?úÖê ¯Ö¸üß?ÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê­Öê ¯Ö¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ‹¾ÖÓ OMR ˆ¢Ö¸ü-¯Ö¡Ö?ú
×­Ö¸üß?Ö?ú ´ÖÆüÖê¤üµÖ ?úÖê »ÖÖî™üÖ­ÖÖ †Ö¾Ö¿µÖ?ú Æîü †Öî¸ü ¯Ö¸üß?ÖÖ ÃÖ´ÖÖÛ¯ŸÖ ?êú ²ÖÖ¤ü ˆÃÖê
†¯Ö­Öê ÃÖÖ£Ö ¯Ö¸üß?ÖÖ ³Ö¾Ö­Ö ÃÖê ²ÖÖÆü¸ü ­Ö »Öê?ú¸ü •ÖÖµÖë …
10. ?êú¾Ö»Ö ­Öß»Öê/?úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê­Ö ?úÖ Æüß ‡ÃŸÖê´ÖÖ»Ö ?ú¸ëü …
11. ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úÖ ÃÖÓ?Ö?Ö?ú (?îú»Ö?ãú»Öê™ü¸ü) µÖÖ »ÖÖ?Ö ™êü²Ö»Ö †Öפü ?úÖ
¯ÖϵÖÖê?Ö ¾ÖÙ•ÖŸÖ Æîü …
12. ?Ö»ÖŸÖ ˆ¢Ö¸üÖë ?êú ×»Ö‹ ?úÖê‡Ô †Ó?ú ?úÖ™êü ­ÖÆüà •ÖÖ‹Ñ?Öê …
[Maximum Marks : 100
Time : 1 
1
/
4
 hours]
PAPER-II
COMPUTER SCIENCE AND APPLICA TIONS
(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 0
Paper-II 2 D-87-10
1. The number of integers between 1
and 250 that are divisible by 2, 5 and
7 is
(A) 2 (B) 3
(C) 5 (D) 8
2. An undirected graph possesses an
eulerian circuit if and only if it is
connected and its vertices are
(A) all of even degree
(B) all of odd degree
(C) of any degree
(D) even in number
3. A partially ordered set is said to be a
lattice if every two elements in the
set have
(A) a unique least upper bound
(B) a unique greatest lower bound
(C) both (A) and (B)
(D) none of the above
4. The minimum number of edges in a
connected graph with ‘n’ vertices is
equal to
(A) n (n – 1)
(B)
n (n – 1)
2
 
(C) n
2
(D) n – 1
5. Consider the problem of connecting
19 lamps to a single electric outlet
by using extension cords each of
which has four outlets. The number
of extension cords required is
(A) 4
(B) 5
(C) 6
(D) 7
6. The decimal number equivalent of
(4057.06)
8
 is
(A) 2095.75
(B) 2095.075
(C) 2095.937
(D) 2095.0937
7. AB + 
?
?
?
?
A + B is equivalent to
(A) A U B
(B) A XB
(C) (A U B) XA
(D) (A X B) U A
8. An astable multivibrator has
(A) one stable state
(B) two stable states
(C) no stable states
(D) none of these
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions, each question carrying two
(2) marks. Attempt all the questions.
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). Y ou have to darken the oval as indicated below on the
correct response against each item.
Example :
where (C) is the correct response.
5. Y our responses to the items are to be indicated in the Answer
Sheet given inside the Paper I Booklet only. If you mark at
any place other than in the ovals in the Answer 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 or put any mark on any part of the test
booklet, except for the space allotted for the relevant entries,
which may disclose your identity, you will render yourself
liable to disqualification.
9. Y ou have to return the test question booklet and OMR Answer
sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall.
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 ¯Ö¸üß?ÖÖÙ£ÖµÖÖë ?êú ×»Ö‹ ×­Ö¤ìü¿Ö
A B C D
A B C D
D-87-10 1 P.T.O.
1. ¯ÖÆü»Öê ¯Öéšü ?êú ‰ú¯Ö¸ü ×­ÖµÖŸÖ Ã£ÖÖ ­Ö ¯Ö¸ü †¯Ö­ÖÖ ¸üÖê»Ö ­Ö´²Ö¸ü ×»Ö×?Ö‹ …
2. ‡ÃÖ ¯ÖÏ¿­Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾Ö?ú»¯ÖßµÖ ¯ÖÏ¿­Ö Æïü …
3. ¯Ö¸üß?ÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê­Öê ¯Ö¸ü, ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ †Ö¯Ö?úÖê ¤êü ¤üß •ÖÖµÖê?Öß … ¯ÖÆü»Öê ¯ÖÖÑ“Ö
×´Ö­Ö™ü †Ö¯Ö?úÖê ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ŸÖ£ÖÖ ˆÃÖ?úß ×­Ö´­Ö×»Ö×?ÖŸÖ •ÖÖÑ“Ö ?êú
×»Ö‹ פüµÖê •ÖÖµÖë?Öê, וÖÃÖ?úß •ÖÖÑ“Ö †Ö¯Ö?úÖê †¾Ö¿µÖ ?ú¸ü­Öß Æîü :
(i) ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ?êú ×»Ö‹ ˆÃÖ?êú ?ú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »Ö?Öß ?úÖ?Ö•Ö ?úß
ÃÖᯙ ?úÖê ±úÖ›Íü »Öë … ?Öã»Öß Æãü‡Ô µÖÖ ×²Ö­ÖÖ Ã™üß?ú¸ü-ÃÖᯙ ?úß ¯ÖãÛßÖ?úÖ
þÖß?úÖ¸ü ­Ö ?ú¸ëü …
(ii) ?ú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×­Ö¤ìü¿ÖÖ­ÖãÃÖÖ¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?êú ¯Öéšü ŸÖ£ÖÖ ¯ÖÏ¿­ÖÖë
?úß ÃÖÓ?µÖÖ ?úÖê †“”ûß ŸÖ¸üÆü “Öî?ú ?ú¸ü »Öë ×?ú µÖê ¯Öæ¸êü Æïü … ¤üÖêÂÖ¯Öæ?ÖÔ
¯ÖãÛßÖ?úÖ ×•Ö­Ö´Öë ¯Öéšü/¯ÖÏ¿­Ö ?ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ †Ö ?ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö
´Öë ­Ö ÆüÖë †£ÖÖÔŸÖ ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úß ¡Öã×™ü¯Öæ?ÖÔ ¯ÖãÛßÖ?úÖ Ã¾Öß?úÖ¸ü ­Ö
?ú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖµÖ ˆÃÖê »ÖÖî™üÖ?ú¸ü ˆÃÖ?êú ãÖÖ­Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß
¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ »Öê »Öë … ‡ÃÖ?êú ×»Ö‹ †Ö¯Ö?úÖê ¯ÖÖÑ“Ö ×´Ö­Ö™ü פüµÖê •ÖÖµÖë?Öê …
ˆÃÖ?êú ²ÖÖ¤ü ­Ö ŸÖÖê †Ö¯Ö?úß ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖµÖê?Öß †Öî¸ü ­Ö
Æüß †Ö¯Ö?úÖê †×ŸÖ׸üŒŸÖ ÃÖ´ÖµÖ ×¤üµÖÖ •ÖÖµÖê?ÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö ?êú ²ÖÖ¤ü OMR ¯Ö¡Ö?ú ?úß ?Îú´Ö ÃÖÓ?µÖÖ ‡ÃÖ ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¯Ö¸ü
†Ó×?úŸÖ ?ú¸ü ¤ëü …
4. ¯ÖÏŸµÖê?ú ¯ÖÏ¿­Ö ?êú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾Ö?ú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê ?ÖµÖê
Æïü … †Ö¯Ö?úÖê ÃÖÆüß ˆ¢Ö¸ü ?êú ¤üß‘ÖÔ¾Öé¢Ö ?úÖê ¯Öê­Ö ÃÖê ³Ö¸ü?ú¸ü ?úÖ»ÖÖ ?ú¸ü­ÖÖ Æîü •ÖîÃÖÖ
×?ú ­Öß“Öê פü?ÖÖµÖÖ ?ÖµÖÖ Æîü …
ˆ¤üÖÆü¸ü?Ö :
•Ö²Ö×?ú (C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿­ÖÖë ?êú ˆ¢Ö¸ü ?êú¾Ö»Ö ¯ÖÏ¿­Ö ¯Ö¡Ö I ?êú †­¤ü¸ü פüµÖê ?ÖµÖê ˆ¢Ö¸ü-¯Ö¡Ö?ú ¯Ö¸ü Æüß †Ó×?úŸÖ
?ú¸ü­Öê Æïü … µÖפü †Ö¯Ö ˆ¢Ö¸ü ¯Ö¡Ö?ú ¯Ö¸ü פüµÖê ?ÖµÖê ¤üß‘ÖÔ¾Öé¢Ö ?êú †»ÖÖ¾ÖÖ ×?úÃÖß †­µÖ
ãÖÖ­Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ­ÖÖÓ×?úŸÖ ?ú¸ŸÖê Æïü, ŸÖÖê ˆÃÖ?úÖ ´Ö滵ÖÖÓ?ú­Ö ­ÖÆüà ÆüÖê?ÖÖ …
6. †­¤ü¸ü פüµÖê ?ÖµÖê ×­Ö¤ìü¿ÖÖë ?úÖê ¬µÖÖ­Ö¯Öæ¾ÖÔ?ú ¯ÖœÍëü …
7. ?ú““ÖÖ ?úÖ´Ö (Rough Work) ‡ÃÖ ¯ÖãÛßÖ?úÖ ?êú †Û­ŸÖ´Ö ¯Öéšü ¯Ö¸ü ?ú¸ëü …
8. µÖפü †Ö¯Ö ˆ¢Ö¸ü-¯ÖãÛßÖ?úÖ ¯Ö¸ü †¯Ö­ÖÖ ­ÖÖ´Ö µÖÖ ‹êÃÖÖ ?úÖê‡Ô ³Öß ×­Ö¿ÖÖ­Ö ×•ÖÃÖÃÖê
†Ö¯Ö?úß ¯ÖÆü“ÖÖ­Ö ÆüÖê ÃÖ?êú, ×?úÃÖß ³Öß ³ÖÖ?Ö ¯Ö¸ü ¤ü¿ÖÖÔŸÖê µÖÖ †Ó×?úŸÖ ?ú¸üŸÖê Æïü ŸÖÖê
¯Ö¸üß?ÖÖ ?êú ×»ÖµÖê †µÖÖê?µÖ ‘ÖÖê×ÂÖŸÖ ?ú¸ü פüµÖê •ÖÖµÖë?Öê …
9. †Ö¯Ö?úÖê ¯Ö¸üß?ÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê­Öê ¯Ö¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ‹¾ÖÓ OMR ˆ¢Ö¸ü-¯Ö¡Ö?ú
×­Ö¸üß?Ö?ú ´ÖÆüÖê¤üµÖ ?úÖê »ÖÖî™üÖ­ÖÖ †Ö¾Ö¿µÖ?ú Æîü †Öî¸ü ¯Ö¸üß?ÖÖ ÃÖ´ÖÖÛ¯ŸÖ ?êú ²ÖÖ¤ü ˆÃÖê
†¯Ö­Öê ÃÖÖ£Ö ¯Ö¸üß?ÖÖ ³Ö¾Ö­Ö ÃÖê ²ÖÖÆü¸ü ­Ö »Öê?ú¸ü •ÖÖµÖë …
10. ?êú¾Ö»Ö ­Öß»Öê/?úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê­Ö ?úÖ Æüß ‡ÃŸÖê´ÖÖ»Ö ?ú¸ëü …
11. ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úÖ ÃÖÓ?Ö?Ö?ú (?îú»Ö?ãú»Öê™ü¸ü) µÖÖ »ÖÖ?Ö ™êü²Ö»Ö †Öפü ?úÖ
¯ÖϵÖÖê?Ö ¾ÖÙ•ÖŸÖ Æîü …
12. ?Ö»ÖŸÖ ˆ¢Ö¸üÖë ?êú ×»Ö‹ ?úÖê‡Ô †Ó?ú ?úÖ™êü ­ÖÆüà •ÖÖ‹Ñ?Öê …
[Maximum Marks : 100
Time : 1 
1
/
4
 hours]
PAPER-II
COMPUTER SCIENCE AND APPLICA TIONS
(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 0
Paper-II 2 D-87-10
1. The number of integers between 1
and 250 that are divisible by 2, 5 and
7 is
(A) 2 (B) 3
(C) 5 (D) 8
2. An undirected graph possesses an
eulerian circuit if and only if it is
connected and its vertices are
(A) all of even degree
(B) all of odd degree
(C) of any degree
(D) even in number
3. A partially ordered set is said to be a
lattice if every two elements in the
set have
(A) a unique least upper bound
(B) a unique greatest lower bound
(C) both (A) and (B)
(D) none of the above
4. The minimum number of edges in a
connected graph with ‘n’ vertices is
equal to
(A) n (n – 1)
(B)
n (n – 1)
2
 
(C) n
2
(D) n – 1
5. Consider the problem of connecting
19 lamps to a single electric outlet
by using extension cords each of
which has four outlets. The number
of extension cords required is
(A) 4
(B) 5
(C) 6
(D) 7
6. The decimal number equivalent of
(4057.06)
8
 is
(A) 2095.75
(B) 2095.075
(C) 2095.937
(D) 2095.0937
7. AB + 
?
?
?
?
A + B is equivalent to
(A) A U B
(B) A XB
(C) (A U B) XA
(D) (A X B) U A
8. An astable multivibrator has
(A) one stable state
(B) two stable states
(C) no stable states
(D) none of these
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions, each question carrying two
(2) marks. Attempt all the questions.
D-87-10 3 Paper-II
9. 12-bit 2’s complement of –73.75 is
(A) 01001001.1100
(B) 11001001.1100
(C) 10110110.0100
(D) 10110110.1100
10. Encoding of data bits 0011 into 7-bit
even Parity Hamming Code is
(A) 0011110
(B) 0101110
(C) 0010110
(D) 0011100
11. How many of the following
declarations are correct ?
int z = 7.0;
double void = 0.000;
short array [2] = {0, 1, 2};
char c = “\n”;
(A) None
(B) One is correct
(C) Two are correct
(D) All four are correct
12. The value of the following
expression (13 / 4 * 3) % 5 + 1 is
(A) 5.75
(B) 2.95
(C) 1.4875
(D) 5
13. Which one of the following will set
the value of y to 5 if x has the value
3, but not otherwise ?
(A) if (x = 3) y = 5
(B) if x = = 3 (y = 5)
(C) if (x = = 3); y = 5
(D) if (x = = 3) y = 5
14. Which one of the following
sentences is true ?
(A) The body of a while loop is
executed at least once.
(B) The body of a do … while
loop is executed at least once.
(C) The body of a do … while
loop is executed zero or more
times.
(D) A for loop can never be used in
place of a while loop.
15. “Black” refers in the “Black-box”
testing means
(A) Characters of the movie
“Black”
(B) I – O is hidden
(C) Design is hidden
(D) Users are hidden
16. In generalisation, the differences
between members of an entity is
(A) maximized
(B) minimized
(C) both (A) & (B)
(D) None of these
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). Y ou have to darken the oval as indicated below on the
correct response against each item.
Example :
where (C) is the correct response.
5. Y our responses to the items are to be indicated in the Answer
Sheet given inside the Paper I Booklet only. If you mark at
any place other than in the ovals in the Answer 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 or put any mark on any part of the test
booklet, except for the space allotted for the relevant entries,
which may disclose your identity, you will render yourself
liable to disqualification.
9. Y ou have to return the test question booklet and OMR Answer
sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall.
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 ¯Ö¸üß?ÖÖÙ£ÖµÖÖë ?êú ×»Ö‹ ×­Ö¤ìü¿Ö
A B C D
A B C D
D-87-10 1 P.T.O.
1. ¯ÖÆü»Öê ¯Öéšü ?êú ‰ú¯Ö¸ü ×­ÖµÖŸÖ Ã£ÖÖ ­Ö ¯Ö¸ü †¯Ö­ÖÖ ¸üÖê»Ö ­Ö´²Ö¸ü ×»Ö×?Ö‹ …
2. ‡ÃÖ ¯ÖÏ¿­Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾Ö?ú»¯ÖßµÖ ¯ÖÏ¿­Ö Æïü …
3. ¯Ö¸üß?ÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê­Öê ¯Ö¸ü, ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ †Ö¯Ö?úÖê ¤êü ¤üß •ÖÖµÖê?Öß … ¯ÖÆü»Öê ¯ÖÖÑ“Ö
×´Ö­Ö™ü †Ö¯Ö?úÖê ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ŸÖ£ÖÖ ˆÃÖ?úß ×­Ö´­Ö×»Ö×?ÖŸÖ •ÖÖÑ“Ö ?êú
×»Ö‹ פüµÖê •ÖÖµÖë?Öê, וÖÃÖ?úß •ÖÖÑ“Ö †Ö¯Ö?úÖê †¾Ö¿µÖ ?ú¸ü­Öß Æîü :
(i) ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ?êú ×»Ö‹ ˆÃÖ?êú ?ú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »Ö?Öß ?úÖ?Ö•Ö ?úß
ÃÖᯙ ?úÖê ±úÖ›Íü »Öë … ?Öã»Öß Æãü‡Ô µÖÖ ×²Ö­ÖÖ Ã™üß?ú¸ü-ÃÖᯙ ?úß ¯ÖãÛßÖ?úÖ
þÖß?úÖ¸ü ­Ö ?ú¸ëü …
(ii) ?ú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×­Ö¤ìü¿ÖÖ­ÖãÃÖÖ¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?êú ¯Öéšü ŸÖ£ÖÖ ¯ÖÏ¿­ÖÖë
?úß ÃÖÓ?µÖÖ ?úÖê †“”ûß ŸÖ¸üÆü “Öî?ú ?ú¸ü »Öë ×?ú µÖê ¯Öæ¸êü Æïü … ¤üÖêÂÖ¯Öæ?ÖÔ
¯ÖãÛßÖ?úÖ ×•Ö­Ö´Öë ¯Öéšü/¯ÖÏ¿­Ö ?ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ †Ö ?ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö
´Öë ­Ö ÆüÖë †£ÖÖÔŸÖ ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úß ¡Öã×™ü¯Öæ?ÖÔ ¯ÖãÛßÖ?úÖ Ã¾Öß?úÖ¸ü ­Ö
?ú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖµÖ ˆÃÖê »ÖÖî™üÖ?ú¸ü ˆÃÖ?êú ãÖÖ­Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß
¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ »Öê »Öë … ‡ÃÖ?êú ×»Ö‹ †Ö¯Ö?úÖê ¯ÖÖÑ“Ö ×´Ö­Ö™ü פüµÖê •ÖÖµÖë?Öê …
ˆÃÖ?êú ²ÖÖ¤ü ­Ö ŸÖÖê †Ö¯Ö?úß ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖµÖê?Öß †Öî¸ü ­Ö
Æüß †Ö¯Ö?úÖê †×ŸÖ׸üŒŸÖ ÃÖ´ÖµÖ ×¤üµÖÖ •ÖÖµÖê?ÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö ?êú ²ÖÖ¤ü OMR ¯Ö¡Ö?ú ?úß ?Îú´Ö ÃÖÓ?µÖÖ ‡ÃÖ ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¯Ö¸ü
†Ó×?úŸÖ ?ú¸ü ¤ëü …
4. ¯ÖÏŸµÖê?ú ¯ÖÏ¿­Ö ?êú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾Ö?ú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê ?ÖµÖê
Æïü … †Ö¯Ö?úÖê ÃÖÆüß ˆ¢Ö¸ü ?êú ¤üß‘ÖÔ¾Öé¢Ö ?úÖê ¯Öê­Ö ÃÖê ³Ö¸ü?ú¸ü ?úÖ»ÖÖ ?ú¸ü­ÖÖ Æîü •ÖîÃÖÖ
×?ú ­Öß“Öê פü?ÖÖµÖÖ ?ÖµÖÖ Æîü …
ˆ¤üÖÆü¸ü?Ö :
•Ö²Ö×?ú (C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿­ÖÖë ?êú ˆ¢Ö¸ü ?êú¾Ö»Ö ¯ÖÏ¿­Ö ¯Ö¡Ö I ?êú †­¤ü¸ü פüµÖê ?ÖµÖê ˆ¢Ö¸ü-¯Ö¡Ö?ú ¯Ö¸ü Æüß †Ó×?úŸÖ
?ú¸ü­Öê Æïü … µÖפü †Ö¯Ö ˆ¢Ö¸ü ¯Ö¡Ö?ú ¯Ö¸ü פüµÖê ?ÖµÖê ¤üß‘ÖÔ¾Öé¢Ö ?êú †»ÖÖ¾ÖÖ ×?úÃÖß †­µÖ
ãÖÖ­Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ­ÖÖÓ×?úŸÖ ?ú¸ŸÖê Æïü, ŸÖÖê ˆÃÖ?úÖ ´Ö滵ÖÖÓ?ú­Ö ­ÖÆüà ÆüÖê?ÖÖ …
6. †­¤ü¸ü פüµÖê ?ÖµÖê ×­Ö¤ìü¿ÖÖë ?úÖê ¬µÖÖ­Ö¯Öæ¾ÖÔ?ú ¯ÖœÍëü …
7. ?ú““ÖÖ ?úÖ´Ö (Rough Work) ‡ÃÖ ¯ÖãÛßÖ?úÖ ?êú †Û­ŸÖ´Ö ¯Öéšü ¯Ö¸ü ?ú¸ëü …
8. µÖפü †Ö¯Ö ˆ¢Ö¸ü-¯ÖãÛßÖ?úÖ ¯Ö¸ü †¯Ö­ÖÖ ­ÖÖ´Ö µÖÖ ‹êÃÖÖ ?úÖê‡Ô ³Öß ×­Ö¿ÖÖ­Ö ×•ÖÃÖÃÖê
†Ö¯Ö?úß ¯ÖÆü“ÖÖ­Ö ÆüÖê ÃÖ?êú, ×?úÃÖß ³Öß ³ÖÖ?Ö ¯Ö¸ü ¤ü¿ÖÖÔŸÖê µÖÖ †Ó×?úŸÖ ?ú¸üŸÖê Æïü ŸÖÖê
¯Ö¸üß?ÖÖ ?êú ×»ÖµÖê †µÖÖê?µÖ ‘ÖÖê×ÂÖŸÖ ?ú¸ü פüµÖê •ÖÖµÖë?Öê …
9. †Ö¯Ö?úÖê ¯Ö¸üß?ÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê­Öê ¯Ö¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ‹¾ÖÓ OMR ˆ¢Ö¸ü-¯Ö¡Ö?ú
×­Ö¸üß?Ö?ú ´ÖÆüÖê¤üµÖ ?úÖê »ÖÖî™üÖ­ÖÖ †Ö¾Ö¿µÖ?ú Æîü †Öî¸ü ¯Ö¸üß?ÖÖ ÃÖ´ÖÖÛ¯ŸÖ ?êú ²ÖÖ¤ü ˆÃÖê
†¯Ö­Öê ÃÖÖ£Ö ¯Ö¸üß?ÖÖ ³Ö¾Ö­Ö ÃÖê ²ÖÖÆü¸ü ­Ö »Öê?ú¸ü •ÖÖµÖë …
10. ?êú¾Ö»Ö ­Öß»Öê/?úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê­Ö ?úÖ Æüß ‡ÃŸÖê´ÖÖ»Ö ?ú¸ëü …
11. ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úÖ ÃÖÓ?Ö?Ö?ú (?îú»Ö?ãú»Öê™ü¸ü) µÖÖ »ÖÖ?Ö ™êü²Ö»Ö †Öפü ?úÖ
¯ÖϵÖÖê?Ö ¾ÖÙ•ÖŸÖ Æîü …
12. ?Ö»ÖŸÖ ˆ¢Ö¸üÖë ?êú ×»Ö‹ ?úÖê‡Ô †Ó?ú ?úÖ™êü ­ÖÆüà •ÖÖ‹Ñ?Öê …
[Maximum Marks : 100
Time : 1 
1
/
4
 hours]
PAPER-II
COMPUTER SCIENCE AND APPLICA TIONS
(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 0
Paper-II 2 D-87-10
1. The number of integers between 1
and 250 that are divisible by 2, 5 and
7 is
(A) 2 (B) 3
(C) 5 (D) 8
2. An undirected graph possesses an
eulerian circuit if and only if it is
connected and its vertices are
(A) all of even degree
(B) all of odd degree
(C) of any degree
(D) even in number
3. A partially ordered set is said to be a
lattice if every two elements in the
set have
(A) a unique least upper bound
(B) a unique greatest lower bound
(C) both (A) and (B)
(D) none of the above
4. The minimum number of edges in a
connected graph with ‘n’ vertices is
equal to
(A) n (n – 1)
(B)
n (n – 1)
2
 
(C) n
2
(D) n – 1
5. Consider the problem of connecting
19 lamps to a single electric outlet
by using extension cords each of
which has four outlets. The number
of extension cords required is
(A) 4
(B) 5
(C) 6
(D) 7
6. The decimal number equivalent of
(4057.06)
8
 is
(A) 2095.75
(B) 2095.075
(C) 2095.937
(D) 2095.0937
7. AB + 
?
?
?
?
A + B is equivalent to
(A) A U B
(B) A XB
(C) (A U B) XA
(D) (A X B) U A
8. An astable multivibrator has
(A) one stable state
(B) two stable states
(C) no stable states
(D) none of these
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions, each question carrying two
(2) marks. Attempt all the questions.
D-87-10 3 Paper-II
9. 12-bit 2’s complement of –73.75 is
(A) 01001001.1100
(B) 11001001.1100
(C) 10110110.0100
(D) 10110110.1100
10. Encoding of data bits 0011 into 7-bit
even Parity Hamming Code is
(A) 0011110
(B) 0101110
(C) 0010110
(D) 0011100
11. How many of the following
declarations are correct ?
int z = 7.0;
double void = 0.000;
short array [2] = {0, 1, 2};
char c = “\n”;
(A) None
(B) One is correct
(C) Two are correct
(D) All four are correct
12. The value of the following
expression (13 / 4 * 3) % 5 + 1 is
(A) 5.75
(B) 2.95
(C) 1.4875
(D) 5
13. Which one of the following will set
the value of y to 5 if x has the value
3, but not otherwise ?
(A) if (x = 3) y = 5
(B) if x = = 3 (y = 5)
(C) if (x = = 3); y = 5
(D) if (x = = 3) y = 5
14. Which one of the following
sentences is true ?
(A) The body of a while loop is
executed at least once.
(B) The body of a do … while
loop is executed at least once.
(C) The body of a do … while
loop is executed zero or more
times.
(D) A for loop can never be used in
place of a while loop.
15. “Black” refers in the “Black-box”
testing means
(A) Characters of the movie
“Black”
(B) I – O is hidden
(C) Design is hidden
(D) Users are hidden
16. In generalisation, the differences
between members of an entity is
(A) maximized
(B) minimized
(C) both (A) & (B)
(D) None of these
Paper-II 4 D-87-10
17. The dependency preservation
decomposition is a property to
decompose database schema D, in
which each functional dependency
X ? Y specified in F,
(A) appeared directly in one of the
relation schemas Ri in the
decomposed D.
(B) could be inferred from
dependencies that appear in
some Ri.
(C) both (A) and (B)
(D) None of these
18. Which of the following is an
optimistic concurrency control
method ?
(A) Validation based
(B) Time stamp ordering
(C) Lock-based
(D) None of these
19. Optical storage is a
(A) high-speed direct access
storage device.
(B) low-speed direct access storage
device.
(C) medium-speed direct access
storage device.
(D) high-speed sequential access
storage device.
20. Which of the following is the
process by which a user’s access to
physical data in the application is
limited, based on his privileges ?
(A) Authorization
(B) Authentication
(C) Access Control
(D) All of these
21. What is the maximum number of
nodes in a B-tree of order 10 of
depth 3 (root at depth 0) ?
(A) 111
(B) 999
(C) 9999
(D) None of the above
22. A binary tree with 27 nodes has
_______ null branches.
(A) 54
(B) 27
(C) 26
(D) None of the above
23. The time complexity to build a heap
of n elements is
(A) 0(1)
(B) 0(lgn)
(C) 0(n)
(D) 0(nlgn)
24. Linear probing suffers from a
problem known as
(A) Secondary clustering
(B) Primary clustering
(C) Both (A) and (B)
(D) None of these
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). Y ou have to darken the oval as indicated below on the
correct response against each item.
Example :
where (C) is the correct response.
5. Y our responses to the items are to be indicated in the Answer
Sheet given inside the Paper I Booklet only. If you mark at
any place other than in the ovals in the Answer 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 or put any mark on any part of the test
booklet, except for the space allotted for the relevant entries,
which may disclose your identity, you will render yourself
liable to disqualification.
9. Y ou have to return the test question booklet and OMR Answer
sheet to the invigilators at the end of the examination
compulsorily and must not carry it with you outside the
Examination Hall.
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 ¯Ö¸üß?ÖÖÙ£ÖµÖÖë ?êú ×»Ö‹ ×­Ö¤ìü¿Ö
A B C D
A B C D
D-87-10 1 P.T.O.
1. ¯ÖÆü»Öê ¯Öéšü ?êú ‰ú¯Ö¸ü ×­ÖµÖŸÖ Ã£ÖÖ ­Ö ¯Ö¸ü †¯Ö­ÖÖ ¸üÖê»Ö ­Ö´²Ö¸ü ×»Ö×?Ö‹ …
2. ‡ÃÖ ¯ÖÏ¿­Ö-¯Ö¡Ö ´Öë ¯Ö“ÖÖÃÖ ²ÖÆãü×¾Ö?ú»¯ÖßµÖ ¯ÖÏ¿­Ö Æïü …
3. ¯Ö¸üß?ÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê­Öê ¯Ö¸ü, ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ †Ö¯Ö?úÖê ¤êü ¤üß •ÖÖµÖê?Öß … ¯ÖÆü»Öê ¯ÖÖÑ“Ö
×´Ö­Ö™ü †Ö¯Ö?úÖê ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ŸÖ£ÖÖ ˆÃÖ?úß ×­Ö´­Ö×»Ö×?ÖŸÖ •ÖÖÑ“Ö ?êú
×»Ö‹ פüµÖê •ÖÖµÖë?Öê, וÖÃÖ?úß •ÖÖÑ“Ö †Ö¯Ö?úÖê †¾Ö¿µÖ ?ú¸ü­Öß Æîü :
(i) ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?ÖÖê»Ö­Öê ?êú ×»Ö‹ ˆÃÖ?êú ?ú¾Ö¸ü ¯Öê•Ö ¯Ö¸ü »Ö?Öß ?úÖ?Ö•Ö ?úß
ÃÖᯙ ?úÖê ±úÖ›Íü »Öë … ?Öã»Öß Æãü‡Ô µÖÖ ×²Ö­ÖÖ Ã™üß?ú¸ü-ÃÖᯙ ?úß ¯ÖãÛßÖ?úÖ
þÖß?úÖ¸ü ­Ö ?ú¸ëü …
(ii) ?ú¾Ö¸ü ¯Öéšü ¯Ö¸ü ”û¯Öê ×­Ö¤ìü¿ÖÖ­ÖãÃÖÖ¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ?êú ¯Öéšü ŸÖ£ÖÖ ¯ÖÏ¿­ÖÖë
?úß ÃÖÓ?µÖÖ ?úÖê †“”ûß ŸÖ¸üÆü “Öî?ú ?ú¸ü »Öë ×?ú µÖê ¯Öæ¸êü Æïü … ¤üÖêÂÖ¯Öæ?ÖÔ
¯ÖãÛßÖ?úÖ ×•Ö­Ö´Öë ¯Öéšü/¯ÖÏ¿­Ö ?ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ †Ö ?ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö
´Öë ­Ö ÆüÖë †£ÖÖÔŸÖ ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úß ¡Öã×™ü¯Öæ?ÖÔ ¯ÖãÛßÖ?úÖ Ã¾Öß?úÖ¸ü ­Ö
?ú¸ëü ŸÖ£ÖÖ ˆÃÖß ÃÖ´ÖµÖ ˆÃÖê »ÖÖî™üÖ?ú¸ü ˆÃÖ?êú ãÖÖ­Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß
¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ »Öê »Öë … ‡ÃÖ?êú ×»Ö‹ †Ö¯Ö?úÖê ¯ÖÖÑ“Ö ×´Ö­Ö™ü פüµÖê •ÖÖµÖë?Öê …
ˆÃÖ?êú ²ÖÖ¤ü ­Ö ŸÖÖê †Ö¯Ö?úß ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¾ÖÖ¯ÖÃÖ »Öß •ÖÖµÖê?Öß †Öî¸ü ­Ö
Æüß †Ö¯Ö?úÖê †×ŸÖ׸üŒŸÖ ÃÖ´ÖµÖ ×¤üµÖÖ •ÖÖµÖê?ÖÖ …
(iii) ‡ÃÖ •ÖÖÑ“Ö ?êú ²ÖÖ¤ü OMR ¯Ö¡Ö?ú ?úß ?Îú´Ö ÃÖÓ?µÖÖ ‡ÃÖ ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ¯Ö¸ü
†Ó×?úŸÖ ?ú¸ü ¤ëü …
4. ¯ÖÏŸµÖê?ú ¯ÖÏ¿­Ö ?êú ×»Ö‹ “ÖÖ¸ü ˆ¢Ö¸ü ×¾Ö?ú»¯Ö (A), (B), (C) ŸÖ£ÖÖ (D) פüµÖê ?ÖµÖê
Æïü … †Ö¯Ö?úÖê ÃÖÆüß ˆ¢Ö¸ü ?êú ¤üß‘ÖÔ¾Öé¢Ö ?úÖê ¯Öê­Ö ÃÖê ³Ö¸ü?ú¸ü ?úÖ»ÖÖ ?ú¸ü­ÖÖ Æîü •ÖîÃÖÖ
×?ú ­Öß“Öê פü?ÖÖµÖÖ ?ÖµÖÖ Æîü …
ˆ¤üÖÆü¸ü?Ö :
•Ö²Ö×?ú (C) ÃÖÆüß ˆ¢Ö¸ü Æîü …
5. ¯ÖÏ¿­ÖÖë ?êú ˆ¢Ö¸ü ?êú¾Ö»Ö ¯ÖÏ¿­Ö ¯Ö¡Ö I ?êú †­¤ü¸ü פüµÖê ?ÖµÖê ˆ¢Ö¸ü-¯Ö¡Ö?ú ¯Ö¸ü Æüß †Ó×?úŸÖ
?ú¸ü­Öê Æïü … µÖפü †Ö¯Ö ˆ¢Ö¸ü ¯Ö¡Ö?ú ¯Ö¸ü פüµÖê ?ÖµÖê ¤üß‘ÖÔ¾Öé¢Ö ?êú †»ÖÖ¾ÖÖ ×?úÃÖß †­µÖ
ãÖÖ­Ö ¯Ö¸ü ˆ¢Ö¸ü דÖÅ­ÖÖÓ×?úŸÖ ?ú¸ŸÖê Æïü, ŸÖÖê ˆÃÖ?úÖ ´Ö滵ÖÖÓ?ú­Ö ­ÖÆüà ÆüÖê?ÖÖ …
6. †­¤ü¸ü פüµÖê ?ÖµÖê ×­Ö¤ìü¿ÖÖë ?úÖê ¬µÖÖ­Ö¯Öæ¾ÖÔ?ú ¯ÖœÍëü …
7. ?ú““ÖÖ ?úÖ´Ö (Rough Work) ‡ÃÖ ¯ÖãÛßÖ?úÖ ?êú †Û­ŸÖ´Ö ¯Öéšü ¯Ö¸ü ?ú¸ëü …
8. µÖפü †Ö¯Ö ˆ¢Ö¸ü-¯ÖãÛßÖ?úÖ ¯Ö¸ü †¯Ö­ÖÖ ­ÖÖ´Ö µÖÖ ‹êÃÖÖ ?úÖê‡Ô ³Öß ×­Ö¿ÖÖ­Ö ×•ÖÃÖÃÖê
†Ö¯Ö?úß ¯ÖÆü“ÖÖ­Ö ÆüÖê ÃÖ?êú, ×?úÃÖß ³Öß ³ÖÖ?Ö ¯Ö¸ü ¤ü¿ÖÖÔŸÖê µÖÖ †Ó×?úŸÖ ?ú¸üŸÖê Æïü ŸÖÖê
¯Ö¸üß?ÖÖ ?êú ×»ÖµÖê †µÖÖê?µÖ ‘ÖÖê×ÂÖŸÖ ?ú¸ü פüµÖê •ÖÖµÖë?Öê …
9. †Ö¯Ö?úÖê ¯Ö¸üß?ÖÖ ÃÖ´ÖÖ¯ŸÖ ÆüÖê­Öê ¯Ö¸ü ¯ÖÏ¿­Ö-¯ÖãÛßÖ?úÖ ‹¾ÖÓ OMR ˆ¢Ö¸ü-¯Ö¡Ö?ú
×­Ö¸üß?Ö?ú ´ÖÆüÖê¤üµÖ ?úÖê »ÖÖî™üÖ­ÖÖ †Ö¾Ö¿µÖ?ú Æîü †Öî¸ü ¯Ö¸üß?ÖÖ ÃÖ´ÖÖÛ¯ŸÖ ?êú ²ÖÖ¤ü ˆÃÖê
†¯Ö­Öê ÃÖÖ£Ö ¯Ö¸üß?ÖÖ ³Ö¾Ö­Ö ÃÖê ²ÖÖÆü¸ü ­Ö »Öê?ú¸ü •ÖÖµÖë …
10. ?êú¾Ö»Ö ­Öß»Öê/?úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ‡Õ™ü ¯Öê­Ö ?úÖ Æüß ‡ÃŸÖê´ÖÖ»Ö ?ú¸ëü …
11. ×?úÃÖß ³Öß ¯ÖÏ?úÖ¸ü ?úÖ ÃÖÓ?Ö?Ö?ú (?îú»Ö?ãú»Öê™ü¸ü) µÖÖ »ÖÖ?Ö ™êü²Ö»Ö †Öפü ?úÖ
¯ÖϵÖÖê?Ö ¾ÖÙ•ÖŸÖ Æîü …
12. ?Ö»ÖŸÖ ˆ¢Ö¸üÖë ?êú ×»Ö‹ ?úÖê‡Ô †Ó?ú ?úÖ™êü ­ÖÆüà •ÖÖ‹Ñ?Öê …
[Maximum Marks : 100
Time : 1 
1
/
4
 hours]
PAPER-II
COMPUTER SCIENCE AND APPLICA TIONS
(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 0
Paper-II 2 D-87-10
1. The number of integers between 1
and 250 that are divisible by 2, 5 and
7 is
(A) 2 (B) 3
(C) 5 (D) 8
2. An undirected graph possesses an
eulerian circuit if and only if it is
connected and its vertices are
(A) all of even degree
(B) all of odd degree
(C) of any degree
(D) even in number
3. A partially ordered set is said to be a
lattice if every two elements in the
set have
(A) a unique least upper bound
(B) a unique greatest lower bound
(C) both (A) and (B)
(D) none of the above
4. The minimum number of edges in a
connected graph with ‘n’ vertices is
equal to
(A) n (n – 1)
(B)
n (n – 1)
2
 
(C) n
2
(D) n – 1
5. Consider the problem of connecting
19 lamps to a single electric outlet
by using extension cords each of
which has four outlets. The number
of extension cords required is
(A) 4
(B) 5
(C) 6
(D) 7
6. The decimal number equivalent of
(4057.06)
8
 is
(A) 2095.75
(B) 2095.075
(C) 2095.937
(D) 2095.0937
7. AB + 
?
?
?
?
A + B is equivalent to
(A) A U B
(B) A XB
(C) (A U B) XA
(D) (A X B) U A
8. An astable multivibrator has
(A) one stable state
(B) two stable states
(C) no stable states
(D) none of these
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions, each question carrying two
(2) marks. Attempt all the questions.
D-87-10 3 Paper-II
9. 12-bit 2’s complement of –73.75 is
(A) 01001001.1100
(B) 11001001.1100
(C) 10110110.0100
(D) 10110110.1100
10. Encoding of data bits 0011 into 7-bit
even Parity Hamming Code is
(A) 0011110
(B) 0101110
(C) 0010110
(D) 0011100
11. How many of the following
declarations are correct ?
int z = 7.0;
double void = 0.000;
short array [2] = {0, 1, 2};
char c = “\n”;
(A) None
(B) One is correct
(C) Two are correct
(D) All four are correct
12. The value of the following
expression (13 / 4 * 3) % 5 + 1 is
(A) 5.75
(B) 2.95
(C) 1.4875
(D) 5
13. Which one of the following will set
the value of y to 5 if x has the value
3, but not otherwise ?
(A) if (x = 3) y = 5
(B) if x = = 3 (y = 5)
(C) if (x = = 3); y = 5
(D) if (x = = 3) y = 5
14. Which one of the following
sentences is true ?
(A) The body of a while loop is
executed at least once.
(B) The body of a do … while
loop is executed at least once.
(C) The body of a do … while
loop is executed zero or more
times.
(D) A for loop can never be used in
place of a while loop.
15. “Black” refers in the “Black-box”
testing means
(A) Characters of the movie
“Black”
(B) I – O is hidden
(C) Design is hidden
(D) Users are hidden
16. In generalisation, the differences
between members of an entity is
(A) maximized
(B) minimized
(C) both (A) & (B)
(D) None of these
Paper-II 4 D-87-10
17. The dependency preservation
decomposition is a property to
decompose database schema D, in
which each functional dependency
X ? Y specified in F,
(A) appeared directly in one of the
relation schemas Ri in the
decomposed D.
(B) could be inferred from
dependencies that appear in
some Ri.
(C) both (A) and (B)
(D) None of these
18. Which of the following is an
optimistic concurrency control
method ?
(A) Validation based
(B) Time stamp ordering
(C) Lock-based
(D) None of these
19. Optical storage is a
(A) high-speed direct access
storage device.
(B) low-speed direct access storage
device.
(C) medium-speed direct access
storage device.
(D) high-speed sequential access
storage device.
20. Which of the following is the
process by which a user’s access to
physical data in the application is
limited, based on his privileges ?
(A) Authorization
(B) Authentication
(C) Access Control
(D) All of these
21. What is the maximum number of
nodes in a B-tree of order 10 of
depth 3 (root at depth 0) ?
(A) 111
(B) 999
(C) 9999
(D) None of the above
22. A binary tree with 27 nodes has
_______ null branches.
(A) 54
(B) 27
(C) 26
(D) None of the above
23. The time complexity to build a heap
of n elements is
(A) 0(1)
(B) 0(lgn)
(C) 0(n)
(D) 0(nlgn)
24. Linear probing suffers from a
problem known as
(A) Secondary clustering
(B) Primary clustering
(C) Both (A) and (B)
(D) None of these
D-87-10 5 Paper-II
25. Which of the following can be the
sequence of nodes examined in
binary search tree while searching
for key 88 ?
(A) 90, 40, 65, 50, 88
(B) 90, 110, 80, 85, 88
(C) 190, 60, 90, 85, 88
(D) 65, 140, 80, 70, 88
26. Frequency shift keying is used
mostly in
(A) Radio transmission
(B) Telegraphy
(C) Telephone
(D) None of the above
27. The baud rate is
(A) always equal to the bit transfer
rate
(B) equal to twice the bandwidth
of an ideal channel
(C) not equal to the signalling rate
(D) equal to half of the bandwidth
of an ideal channel
28. How much bandwidth is there in
1 micron of spectrum at a
wavelength of 1 micron ?
(A) 300 MHz
(B) 3 GHz
(C) 300 THz
(D) 30 KHz
29. Which of the following file transfer
protocols use TCP and establishes
two virtual circuits between the local
and remote server ?
(A) FTP
(B) TFTP
(C) TELNET
(D) NFS
30. The threshold effect in demodulator
is
(A) exhibited by all demodulator,
when the input signal to noise
ratio is low.
(B) the rapid fall on output signal
to noise ratio when the input
signal to noise ratio fall below
a particular value.
(C) the property exhibited by all
A.M. suppressed carrier
coherent demodulator.
(D) the property exhibited by
correlation receiver.
31. Object code is the output of ______.
(A) Operating System
(B) Compiler or Assembler
(C) only Assembler
(D) only Compiler
32. ‘Macro’ in an assembly level
program is _______.
(A) sub program
(B) a complete program
(C) a hardware portion
(D) relative coding
Read More
794 docs

Top Courses for UGC NET

Explore Courses for UGC NET exam

Top Courses for UGC NET

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

shortcuts and tricks

,

video lectures

,

UGC NET Past Year Question Paper II: Computer Science (2010 December Session) | UGC NET Past Year Papers

,

study material

,

Extra Questions

,

ppt

,

Free

,

UGC NET Past Year Question Paper II: Computer Science (2010 December Session) | UGC NET Past Year Papers

,

MCQs

,

Objective type Questions

,

Exam

,

Viva Questions

,

UGC NET Past Year Question Paper II: Computer Science (2010 December Session) | UGC NET Past Year Papers

,

Summary

,

Semester Notes

,

Sample Paper

,

practice quizzes

,

pdf

,

Important questions

,

mock tests for examination

,

past year papers

,

Previous Year Questions with Solutions

;