Ashish Rai, profile picture
Uploaded byAshish Rai
189 views

Cbse ugc-net-computer-science-paper-2-december-2014

This document provides instructions for a 50 question multiple choice exam. It instructs students to write their roll number, check that their test booklet is complete and in order, and notify invigilators of any issues within 5 minutes. It describes that each question has 4 answer options labeled A-D and to fill in the corresponding bubble on the OMR sheet. It also provides instructions to only mark answers on the OMR sheet, not to write anywhere identifying, to return materials after the exam, and allows keeping the original booklet.

Educationā—¦

Embed presentation

Download to read offline
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.You 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 : 12 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 : 100Time : 1 1 /4 hours] PAPER-II COMPUTER SCIENCE (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 4 D-87-14 1 P.T.O. www.examrace.com
Paper-II 2 D-87-14 COMPUTER SCIENCE Paper ā€“ II Note : This paper contains fifty (50) objective type questions of two (2) marks each. All questions are compulsory. 1. Consider a set A = {1, 2, 3, ā€¦ā€¦.., 1000}. How many members of A shall be divisible by 3 or by 5 or by both 3 and 5 ? (A) 533 (B) 599 (C) 467 (D) 66 2. A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph ? (A) 5 (B) n ā€“ 3 (C) 20 (D) 11 3. Consider the Graph shown below : This graph is a __________. (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above 4. A computer program selects an integer in the set {k : 1 ā‰¤ k ā‰¤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68 www.examrace.com
D-87-14 3 Paper-II 5. If we define the functions f, g and h that map R into R by : f(x) = x4, g(x) = x2 + 1, h(x) = x2 + 72, then the value of the composite functions ho(gof) and (hog)of are given as (A) x8 ā€“ 71 and x8 ā€“ 71 (B) x8 ā€“ 73 and x8 ā€“ 73 (C) x8 + 71 and x8 + 71 (D) x8 + 73 and x8 + 73 6. The BCD adder to add two decimal digits needs minimum of (A) 6 full adders and 2 half adders (B) 5 full adders and 3 half adders (C) 4 full adders and 3 half adders (D) 5 full adders and 2 half adders 7. The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9ā€™s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10ā€™s complement is equal to 9. 8. How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A āˆ— B) + (C āˆ— D/E) ? (A) 4 PUSH and 3 POP instructions (B) 5 PUSH and 4 POP instructions (C) 6 PUSH and 2 POP instructions (D) 5 PUSH and 3 POP instructions 9. The range of representable normalized numbers in the floating point binary fractional representation in a 32-bit word with 1-bit sign, 8-bit excess 128 biased exponent and 23-bit mantissa is (A) 2ā€“128 to (1 ā€“ 2ā€“23) Ɨ 2127 (B) (1 ā€“ 2ā€“23) Ɨ 2ā€“127 to 2128 (C) (1 ā€“ 2ā€“23) Ɨ 2ā€“127 to 223 (D) 2ā€“129 to (1 ā€“ 2ā€“23) Ɨ 2127 10. The size of the ROM required to build an 8-bit adder/subtractor with mode control, carry input, carry output and twoā€™s complement overflow output is given as (A) 216 Ɨ 8 (B) 218 Ɨ 10 (C) 216 Ɨ 10 (D) 218 Ɨ 8 www.examrace.com
Paper-II 4 D-87-14 11. What will be the output of the following ā€˜Cā€™ code ? main ( ) { int x = 128; printf (ā€œn%dā€, 1 + x ++); } (A) 128 (B) 129 (C) 130 (D) 131 12. What does the following expression means ? char āˆ—(āˆ—(āˆ— a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a function return array of N pointers to functions returning pointers to characters (C) an array of n pointers to function returning pointers to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters. 13. Which of the following is not a member of class ? (A) Static function (B) Friend function (C) Const function (D) Virtual function 14. When an array is passed as parameter to a function, which of the following statements is correct ? (A) The function can change values in the original array. (B) In C, parameters are passed by value, the function cannot change the original value in the array. (C) It results in compilation error when the function tries to access the elements in the array. (D) Results in a run time error when the function tries to access the elements in the array. www.examrace.com
D-87-14 5 Paper-II 15. Which of the following differentiates between overloaded functions and overridden functions ? (A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. (B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding. (C) Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function. (D) Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding. 16. Division operation is ideally suited to handle queries of the type : (A) customers who have no account in any of the branches in Delhi. (B) customers who have an account at all branches in Delhi. (C) customers who have an account in atleast one branch in Delhi. (D) customers who have only joint account in any one branch in Delhi 17. Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct. 18. What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes 19. The best normal form of relation scheme R(A, B, C, D) along with the set of functional dependencies F = {AB ā†’ C, AB ā†’ D, C ā†’ A, D ā†’ B} is (A) Boyce-Codd Normal form (B) Third Normal form (C) Second Normal form (D) First Normal form 20. Identify the minimal key for relational scheme R(A, B, C, D, E) with functional dependencies F = {A ā†’ B, B ā†’ C, AC ā†’ D} (A) A (B) AE (C) BE (D) CE www.examrace.com
Paper-II 6 D-87-14 21. Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E ā€“ F) + G (A) ABD^ + EF ā€“ / G+ (B) ABD + ^EF ā€“ / G+ (C) ABD + ^EF / ā€“ G+ (D) ABD^ + EF / ā€“ G+ 22. You have to sort a list L, consisting of a sorted list followed by a few ā€˜randomā€™ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort 23. The directory can be viewed as ________ that translates filenames into their directory entries. (A) Symbol table (B) Partition (C) Swap space (D) Cache 24. Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575 25. A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n ā€“1 nodes (D) 2n nodes 26. The period of a signal is 10 ms. What is its frequency in Hertz ? (A) 10 (B) 100 (C) 1000 (D) 10000 27. In a classful addressing, first four bits in Class A IP address is (A) 1010 (B) 1100 (C) 1011 (D) 1110 www.examrace.com
D-87-14 7 Paper-II 28. Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above 29. An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element ? (A) 0.336 bits/baud (B) 3 bits/baud (C) 120,00,000 bits/baud (D) None of the above 30. How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19 31. Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree. 32. Which of the following is true ? (A) Canonical LR parser is LR (1) parser with single look ahead terminal (B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers. (C) Both (A) and (B) (D) None of the above www.examrace.com
Paper-II 8 D-87-14 33. In a two-pass assembler, symbol table is (A) Generated in first pass (B) Generated in second pass (C) Not generated at all (D) Generated and used only in second pass 34. Debugger is a program that (A) allows to examine and modify the contents of registers (B) does not allow execution of a segment of program (C) allows to set breakpoints, execute a segment of program and display contents of register (D) All of the above 35. The following Context-Free Grammar (CFG) : S ā†’ aB | bA A ā†’ a | as | bAA B ā†’ b | bs | aBB will generate (A) odd numbers of aā€™s and odd numbers of bā€™s (B) even numbers of aā€™s and even numbers of bā€™s (C) equal numbers of aā€™s and bā€™s (D) different numbers of aā€™s and bā€™s 36. Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III www.examrace.com
D-87-14 9 Paper-II 37. A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K 38. Which of the following conditions does not hold good for a solution to a critical section problem ? (A) No assumptions may be made about speeds or the number of CPUs. (B) No two processes may be simultaneously inside their critical sections. (C) Processes running outside its critical section may block other processes. (D) Processes do not wait forever to enter its critical section. 39. For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x 2 (B) xz 2 (C) 2xz (D) xz 2 40. In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec. 41. __________ are applied throughout the software process. (A) Framework activities (B) Umbrella activities (C) Planning activities (D) Construction activities www.examrace.com
Paper-II 10 D-87-14 42. Requirement Development, Organizational Process Focus, Organizational Training, Risk Management and Integrated Supplier Management are process areas required to achieve maturity level (A) Performed (B) Managed (C) Defined (D) Optimized 43. The software _________ of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. (A) Design (B) Architecture (C) Process (D) Requirement 44. Which one of the following set of attributes should not be encompassed by effective software metrics ? (A) Simple and computable (B) Consistent and objective (C) Consistent in the use of units and dimensions (D) Programming language dependent 45. Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions ā€“ 1 (B) E ā€“ N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) P ā€“ 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G. www.examrace.com
D-87-14 11 Paper-II 46. Consider the following statements S1 and S2 : S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. S2 : A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell is engaged. (A) S1 is true and S2 is not true. (B) S1 is not true and S2 is true. (C) Both S1 and S2 are true. (D) Both S1 and S2 are not true. 47. Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys 48. Which e-business model allows consumers to name their own price for products and services ? (A) B2 B (B) B2 G (C) C2 C (D) C2 B 49. __________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once. (A) Economic Order Quantity (B) Inventory (C) Data Mining (D) Demand-Sensitive Pricing 50. Match the following : List ā€“ I List ā€“ II a. Call control protocol i. Interface between Base Transceiver Station (BTS) and Base Station Controller (BSC) b. A-bis ii. Spread spectrum c. BSMAP iii. Connection management d. CDMA iv. Works between Mobile Switching Centre (MSC) and Base Station Subsystem (BSS) Codes : a b c d (A) iii iv i ii (B) iii i iv ii (C) i ii iii iv (D) iv iii ii i _______________ www.examrace.com
Space For Rough Work Paper-II 12 D-87-14 www.examrace.com

More Related Content

PDF
NET-CS-JUNE-2012-PAPER-III
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
UGC-NET-COMPUTER SCIENCE-JUNE-2011-PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
Special june-87-13-iii (comp. sci. & app.)
bysinglark
Ā 
PDF
UGC NET COMPUTER SCIENCE DEC- 2009 PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
NET-DEC-2012-CS-PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
NET-CS-DEC-2010- PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
NET-CS-DEC-2012-PAPER-III
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
D 0009 set-x
byDepartment Of Environment
Ā 
NET-CS-JUNE-2012-PAPER-III
byVIJAY TRIPATHI (DSS Basti)
Ā 
UGC-NET-COMPUTER SCIENCE-JUNE-2011-PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
Special june-87-13-iii (comp. sci. & app.)
bysinglark
Ā 
UGC NET COMPUTER SCIENCE DEC- 2009 PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
NET-DEC-2012-CS-PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
NET-CS-DEC-2010- PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
NET-CS-DEC-2012-PAPER-III
byVIJAY TRIPATHI (DSS Basti)
Ā 
D 0009 set-x
byDepartment Of Environment
Ā 

What's hot

PDF
9. ugc net commerce dec 2009 question paper
byKumar Nirmal Prasad
Ā 
PDF
2018 life sciences tsset (answers with explanations)
byswetha srigiriraju
Ā 
PDF
IIT JEE 2012 Solved Paper by Prabhat Gaurav
byPrabhatGaurav3
Ā 
PDF
4 ma0 3hr_que_20140514
byAnneRostom
Ā 
PDF
4 ma0 4hr_que_20150112
byAnneRostom
Ā 
PDF
4 chap
byAnantha Bellary
Ā 
PDF
ą¹€ąø„ąø‚ąø¢ąøąøąø³ąø„ąø±ąø‡ąøŠąøøąø” 2
bykanjana2536
Ā 
PDF
ą¹€ąø„ąø‚ąø¢ąøąøąø³ąø„ąø±ąø‡
bykuraek1530
Ā 
PDF
Economics learning question set in 6 years
byKishor Vp
Ā 
PDF
D 0009 set-z
byDepartment Of Environment
Ā 
PDF
2014 life sciences tsset paper III
byswetha srigiriraju
Ā 
PDF
D 0009 set-w
byDepartment Of Environment
Ā 
PDF
D 0009 set-y
byDepartment Of Environment
Ā 
PDF
04 apr 2015 c jee main exam JEE MAIN EXAM 2015 CODE -C QUESTION PAPER DT.04....
byudhayam99
Ā 
PDF
Round1: Maths Challenge organised by ā€˜rep2repā€™ research group at Sussex&Cambr...
byMohammedAlasmar3
Ā 
PDF
4 ma0 4hr_msc_20140821
byAnneRostom
Ā 
PDF
Foundation c2 exam may 2013 sols
byfatima d
Ā 
PDF
äŗŒå‰ęŸ„ę‰¾ę ‘čŒƒå›“ęŸ„čÆ¢ē®—ę³•
byInstitute of Computing Technology, Chinese Academy of Sciences
Ā 
PDF
ą¹€ąø„ąø‚ąø¢ąøąøąø³ąø„ąø±ąø‡ąøŠąøøąø”3
bykanjana2536
Ā 
9. ugc net commerce dec 2009 question paper
byKumar Nirmal Prasad
Ā 
2018 life sciences tsset (answers with explanations)
byswetha srigiriraju
Ā 
IIT JEE 2012 Solved Paper by Prabhat Gaurav
byPrabhatGaurav3
Ā 
4 ma0 3hr_que_20140514
byAnneRostom
Ā 
4 ma0 4hr_que_20150112
byAnneRostom
Ā 
4 chap
byAnantha Bellary
Ā 
ą¹€ąø„ąø‚ąø¢ąøąøąø³ąø„ąø±ąø‡ąøŠąøøąø” 2
bykanjana2536
Ā 
ą¹€ąø„ąø‚ąø¢ąøąøąø³ąø„ąø±ąø‡
bykuraek1530
Ā 
Economics learning question set in 6 years
byKishor Vp
Ā 
D 0009 set-z
byDepartment Of Environment
Ā 
2014 life sciences tsset paper III
byswetha srigiriraju
Ā 
D 0009 set-w
byDepartment Of Environment
Ā 
D 0009 set-y
byDepartment Of Environment
Ā 
04 apr 2015 c jee main exam JEE MAIN EXAM 2015 CODE -C QUESTION PAPER DT.04....
byudhayam99
Ā 
Round1: Maths Challenge organised by ā€˜rep2repā€™ research group at Sussex&Cambr...
byMohammedAlasmar3
Ā 
4 ma0 4hr_msc_20140821
byAnneRostom
Ā 
Foundation c2 exam may 2013 sols
byfatima d
Ā 
äŗŒå‰ęŸ„ę‰¾ę ‘čŒƒå›“ęŸ„čÆ¢ē®—ę³•
byInstitute of Computing Technology, Chinese Academy of Sciences
Ā 
ą¹€ąø„ąø‚ąø¢ąøąøąø³ąø„ąø±ąø‡ąøŠąøøąø”3
bykanjana2536
Ā 

Similar to Cbse ugc-net-computer-science-paper-2-december-2014

PDF
Cbse ugc-net-computer-science-paper-2-december-2013
byjinto johnson
Ā 
PDF
UGC NET COMPUTER SCIENCE JUNE 2010 PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
UGC-NET-JUNE-2012-PAPER-I-SET-W
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
NTA-NET-Computer-Science-Paper-3-Jan-2017.pdf
byvicepy
Ā 
PDF
UGC NET June 2014 Paper I
byBonala Kondal
Ā 
PDF
J 00-14-i set-w
bySridhar Sri
Ā 
PDF
NET-CS-JUNE-2012-PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
NTA-NET-Computer-Science-Paper-2-July-2016.pdf
byvicepy
Ā 
PDF
Previous paper economics paper II
byugcnetwork
Ā 
PDF
2014
bymeena109
Ā 
PDF
22222
bysnajeeta shirodkar
Ā 
PDF
J 17-14-ii commerce
byrenukasme
Ā 
PDF
Paper i set-w
byMahantappa Kumbar
Ā 
PDF
UGC NET - DEC-2009- PAPER-I-SET-W
byVIJAY TRIPATHI (DSS Basti)
Ā 
PDF
UGC Paper i (set-x)
byDepartment Of Environment
Ā 
PDF
UGC Paper i set-x (1)
byDepartment Of Environment
Ā 
PDF
UGC Paper i set-x
byDepartment Of Environment
Ā 
PDF
UGC Paper i (set-y)
byDepartment Of Environment
Ā 
PDF
UGC Paper i (set-x) (1)
byDepartment Of Environment
Ā 
PDF
UGC Paper i (set-y) (1)
byDepartment Of Environment
Ā 
Cbse ugc-net-computer-science-paper-2-december-2013
byjinto johnson
Ā 
UGC NET COMPUTER SCIENCE JUNE 2010 PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
UGC-NET-JUNE-2012-PAPER-I-SET-W
byVIJAY TRIPATHI (DSS Basti)
Ā 
NTA-NET-Computer-Science-Paper-3-Jan-2017.pdf
byvicepy
Ā 
UGC NET June 2014 Paper I
byBonala Kondal
Ā 
J 00-14-i set-w
bySridhar Sri
Ā 
NET-CS-JUNE-2012-PAPER-II
byVIJAY TRIPATHI (DSS Basti)
Ā 
NTA-NET-Computer-Science-Paper-2-July-2016.pdf
byvicepy
Ā 
Previous paper economics paper II
byugcnetwork
Ā 
2014
bymeena109
Ā 
22222
bysnajeeta shirodkar
Ā 
J 17-14-ii commerce
byrenukasme
Ā 
Paper i set-w
byMahantappa Kumbar
Ā 
UGC NET - DEC-2009- PAPER-I-SET-W
byVIJAY TRIPATHI (DSS Basti)
Ā 
UGC Paper i (set-x)
byDepartment Of Environment
Ā 
UGC Paper i set-x (1)
byDepartment Of Environment
Ā 
UGC Paper i set-x
byDepartment Of Environment
Ā 
UGC Paper i (set-y)
byDepartment Of Environment
Ā 
UGC Paper i (set-x) (1)
byDepartment Of Environment
Ā 
UGC Paper i (set-y) (1)
byDepartment Of Environment
Ā 

Recently uploaded

PPTX
How to use search_read method in Odoo 18
byCeline George
Ā 
PPTX
Pain. definition, causes, factor influencing pain & pain assessment.pptx
byPompi Begum
Ā 
PDF
DHA/HAAD/MOH/DOH OPTOMETRY MCQ PYQ. .pdf
byAnmol Singh
Ā 
PPTX
How to Configure Push & Pull Rule in Odoo 18 Inventory
byCeline George
Ā 
PDF
Models of Teaching - TNTEU - B.Ed I Semester - Teaching and Learning - BD1TL ...
byDr Raja Mohammed T
Ā 
PDF
1ST APPLICATION FOR ANNULMENT (4)8787666.pdf
bykonstantinantountoum1
Ā 
PPTX
Searching in PubMed andCochrane_Practical Presentation.pptx
bySystematic Reviews Network (SRN)
Ā 
PDF
Unit-III pdf (Basic listening Skill, Effective Writing Communication & Writin...
bySayyadTarannum
Ā 
PPTX
Details of Epithelial and Connective Tissue.pptx
byAshish Umale
Ā 
PPTX
Campfens "The Data Qualify Challenge: Publishers, institutions, and funders r...
byNational Information Standards Organization (NISO)
Ā 
PDF
Scalable-MADDPG-Based Cooperative Target Invasion for a Multi-USV System.pdf
byMan_Ebook
Ā 
PDF
Current Electricity for first year physiotherapy
byGanesh Jadhav
Ā 
PDF
All Students Workshop 25 Yoga Wellness by LDMMIA
byĀ©LDMMIA, Ā©Reiki Yoga
Ā 
PDF
Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Sh...
byMan_Ebook
Ā 
PPTX
The Cell & Cell Cycle-detailed structure and function of organelles.pptx
byAshish Umale
Ā 
PDF
APM Wessex Network: DEIB Policy into Practice
byAssociation for Project Management
Ā 
PPTX
ICH Harmonization A Global Pathway to Unified Drug Regulation.pptx
byDr. Smita Kumbhar
Ā 
PPTX
Introduction-to-Anatomy-and-Physiology.pptx
byAshish Umale
Ā 
PPTX
Limpitlaw "Licensing: From Mindset to Milestones"
byNational Information Standards Organization (NISO)
Ā 
PPTX
Filipino 11-Tekstong Prosidyural-Final.pptx
byMargieBAlmoza
Ā 
How to use search_read method in Odoo 18
byCeline George
Ā 
Pain. definition, causes, factor influencing pain & pain assessment.pptx
byPompi Begum
Ā 
DHA/HAAD/MOH/DOH OPTOMETRY MCQ PYQ. .pdf
byAnmol Singh
Ā 
How to Configure Push & Pull Rule in Odoo 18 Inventory
byCeline George
Ā 
Models of Teaching - TNTEU - B.Ed I Semester - Teaching and Learning - BD1TL ...
byDr Raja Mohammed T
Ā 
1ST APPLICATION FOR ANNULMENT (4)8787666.pdf
bykonstantinantountoum1
Ā 
Searching in PubMed andCochrane_Practical Presentation.pptx
bySystematic Reviews Network (SRN)
Ā 
Unit-III pdf (Basic listening Skill, Effective Writing Communication & Writin...
bySayyadTarannum
Ā 
Details of Epithelial and Connective Tissue.pptx
byAshish Umale
Ā 
Campfens "The Data Qualify Challenge: Publishers, institutions, and funders r...
byNational Information Standards Organization (NISO)
Ā 
Scalable-MADDPG-Based Cooperative Target Invasion for a Multi-USV System.pdf
byMan_Ebook
Ā 
Current Electricity for first year physiotherapy
byGanesh Jadhav
Ā 
All Students Workshop 25 Yoga Wellness by LDMMIA
byĀ©LDMMIA, Ā©Reiki Yoga
Ā 
Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Sh...
byMan_Ebook
Ā 
The Cell & Cell Cycle-detailed structure and function of organelles.pptx
byAshish Umale
Ā 
APM Wessex Network: DEIB Policy into Practice
byAssociation for Project Management
Ā 
ICH Harmonization A Global Pathway to Unified Drug Regulation.pptx
byDr. Smita Kumbhar
Ā 
Introduction-to-Anatomy-and-Physiology.pptx
byAshish Umale
Ā 
Limpitlaw "Licensing: From Mindset to Milestones"
byNational Information Standards Organization (NISO)
Ā 
Filipino 11-Tekstong Prosidyural-Final.pptx
byMargieBAlmoza
Ā 

Cbse ugc-net-computer-science-paper-2-december-2014

  • 1.
    1. Write yourroll 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.You 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 : 12 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 : 100Time : 1 1 /4 hours] PAPER-II COMPUTER SCIENCE (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 4 D-87-14 1 P.T.O. www.examrace.com
  • 2.
    Paper-II 2 D-87-14 COMPUTERSCIENCE Paper ā€“ II Note : This paper contains fifty (50) objective type questions of two (2) marks each. All questions are compulsory. 1. Consider a set A = {1, 2, 3, ā€¦ā€¦.., 1000}. How many members of A shall be divisible by 3 or by 5 or by both 3 and 5 ? (A) 533 (B) 599 (C) 467 (D) 66 2. A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph ? (A) 5 (B) n ā€“ 3 (C) 20 (D) 11 3. Consider the Graph shown below : This graph is a __________. (A) Complete Graph (B) Bipartite Graph (C) Hamiltonian Graph (D) All of the above 4. A computer program selects an integer in the set {k : 1 ā‰¤ k ā‰¤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68 www.examrace.com
  • 3.
    D-87-14 3 Paper-II 5.If we define the functions f, g and h that map R into R by : f(x) = x4, g(x) = x2 + 1, h(x) = x2 + 72, then the value of the composite functions ho(gof) and (hog)of are given as (A) x8 ā€“ 71 and x8 ā€“ 71 (B) x8 ā€“ 73 and x8 ā€“ 73 (C) x8 + 71 and x8 + 71 (D) x8 + 73 and x8 + 73 6. The BCD adder to add two decimal digits needs minimum of (A) 6 full adders and 2 half adders (B) 5 full adders and 3 half adders (C) 4 full adders and 3 half adders (D) 5 full adders and 2 half adders 7. The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9ā€™s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10ā€™s complement is equal to 9. 8. How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A āˆ— B) + (C āˆ— D/E) ? (A) 4 PUSH and 3 POP instructions (B) 5 PUSH and 4 POP instructions (C) 6 PUSH and 2 POP instructions (D) 5 PUSH and 3 POP instructions 9. The range of representable normalized numbers in the floating point binary fractional representation in a 32-bit word with 1-bit sign, 8-bit excess 128 biased exponent and 23-bit mantissa is (A) 2ā€“128 to (1 ā€“ 2ā€“23) Ɨ 2127 (B) (1 ā€“ 2ā€“23) Ɨ 2ā€“127 to 2128 (C) (1 ā€“ 2ā€“23) Ɨ 2ā€“127 to 223 (D) 2ā€“129 to (1 ā€“ 2ā€“23) Ɨ 2127 10. The size of the ROM required to build an 8-bit adder/subtractor with mode control, carry input, carry output and twoā€™s complement overflow output is given as (A) 216 Ɨ 8 (B) 218 Ɨ 10 (C) 216 Ɨ 10 (D) 218 Ɨ 8 www.examrace.com
  • 4.
    Paper-II 4 D-87-14 11.What will be the output of the following ā€˜Cā€™ code ? main ( ) { int x = 128; printf (ā€œn%dā€, 1 + x ++); } (A) 128 (B) 129 (C) 130 (D) 131 12. What does the following expression means ? char āˆ—(āˆ—(āˆ— a[N]) ( )) ( ); (A) a pointer to a function returning array of n pointers to function returning character pointers. (B) a function return array of N pointers to functions returning pointers to characters (C) an array of n pointers to function returning pointers to characters (D) an array of n pointers to function returning pointers to functions returning pointers to characters. 13. Which of the following is not a member of class ? (A) Static function (B) Friend function (C) Const function (D) Virtual function 14. When an array is passed as parameter to a function, which of the following statements is correct ? (A) The function can change values in the original array. (B) In C, parameters are passed by value, the function cannot change the original value in the array. (C) It results in compilation error when the function tries to access the elements in the array. (D) Results in a run time error when the function tries to access the elements in the array. www.examrace.com
  • 5.
    D-87-14 5 Paper-II 15.Which of the following differentiates between overloaded functions and overridden functions ? (A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding. (B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding. (C) Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function. (D) Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding. 16. Division operation is ideally suited to handle queries of the type : (A) customers who have no account in any of the branches in Delhi. (B) customers who have an account at all branches in Delhi. (C) customers who have an account in atleast one branch in Delhi. (D) customers who have only joint account in any one branch in Delhi 17. Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct. 18. What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes 19. The best normal form of relation scheme R(A, B, C, D) along with the set of functional dependencies F = {AB ā†’ C, AB ā†’ D, C ā†’ A, D ā†’ B} is (A) Boyce-Codd Normal form (B) Third Normal form (C) Second Normal form (D) First Normal form 20. Identify the minimal key for relational scheme R(A, B, C, D, E) with functional dependencies F = {A ā†’ B, B ā†’ C, AC ā†’ D} (A) A (B) AE (C) BE (D) CE www.examrace.com
  • 6.
    Paper-II 6 D-87-14 21.Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E ā€“ F) + G (A) ABD^ + EF ā€“ / G+ (B) ABD + ^EF ā€“ / G+ (C) ABD + ^EF / ā€“ G+ (D) ABD^ + EF / ā€“ G+ 22. You have to sort a list L, consisting of a sorted list followed by a few ā€˜randomā€™ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort 23. The directory can be viewed as ________ that translates filenames into their directory entries. (A) Symbol table (B) Partition (C) Swap space (D) Cache 24. Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575 25. A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n ā€“1 nodes (D) 2n nodes 26. The period of a signal is 10 ms. What is its frequency in Hertz ? (A) 10 (B) 100 (C) 1000 (D) 10000 27. In a classful addressing, first four bits in Class A IP address is (A) 1010 (B) 1100 (C) 1011 (D) 1110 www.examrace.com
  • 7.
    D-87-14 7 Paper-II 28.Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above 29. An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element ? (A) 0.336 bits/baud (B) 3 bits/baud (C) 120,00,000 bits/baud (D) None of the above 30. How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key ? (A) 16 (B) 17 (C) 18 (D) 19 31. Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree. 32. Which of the following is true ? (A) Canonical LR parser is LR (1) parser with single look ahead terminal (B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers. (C) Both (A) and (B) (D) None of the above www.examrace.com
  • 8.
    Paper-II 8 D-87-14 33.In a two-pass assembler, symbol table is (A) Generated in first pass (B) Generated in second pass (C) Not generated at all (D) Generated and used only in second pass 34. Debugger is a program that (A) allows to examine and modify the contents of registers (B) does not allow execution of a segment of program (C) allows to set breakpoints, execute a segment of program and display contents of register (D) All of the above 35. The following Context-Free Grammar (CFG) : S ā†’ aB | bA A ā†’ a | as | bAA B ā†’ b | bs | aBB will generate (A) odd numbers of aā€™s and odd numbers of bā€™s (B) even numbers of aā€™s and even numbers of bā€™s (C) equal numbers of aā€™s and bā€™s (D) different numbers of aā€™s and bā€™s 36. Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III www.examrace.com
  • 9.
    D-87-14 9 Paper-II 37.A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K 38. Which of the following conditions does not hold good for a solution to a critical section problem ? (A) No assumptions may be made about speeds or the number of CPUs. (B) No two processes may be simultaneously inside their critical sections. (C) Processes running outside its critical section may block other processes. (D) Processes do not wait forever to enter its critical section. 39. For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x 2 (B) xz 2 (C) 2xz (D) xz 2 40. In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec. 41. __________ are applied throughout the software process. (A) Framework activities (B) Umbrella activities (C) Planning activities (D) Construction activities www.examrace.com
  • 10.
    Paper-II 10 D-87-14 42.Requirement Development, Organizational Process Focus, Organizational Training, Risk Management and Integrated Supplier Management are process areas required to achieve maturity level (A) Performed (B) Managed (C) Defined (D) Optimized 43. The software _________ of a program or a computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. (A) Design (B) Architecture (C) Process (D) Requirement 44. Which one of the following set of attributes should not be encompassed by effective software metrics ? (A) Simple and computable (B) Consistent and objective (C) Consistent in the use of units and dimensions (D) Programming language dependent 45. Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions ā€“ 1 (B) E ā€“ N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) P ā€“ 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G. www.examrace.com
  • 11.
    D-87-14 11 Paper-II 46.Consider the following statements S1 and S2 : S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. S2 : A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell is engaged. (A) S1 is true and S2 is not true. (B) S1 is not true and S2 is true. (C) Both S1 and S2 are true. (D) Both S1 and S2 are not true. 47. Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys 48. Which e-business model allows consumers to name their own price for products and services ? (A) B2 B (B) B2 G (C) C2 C (D) C2 B 49. __________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once. (A) Economic Order Quantity (B) Inventory (C) Data Mining (D) Demand-Sensitive Pricing 50. Match the following : List ā€“ I List ā€“ II a. Call control protocol i. Interface between Base Transceiver Station (BTS) and Base Station Controller (BSC) b. A-bis ii. Spread spectrum c. BSMAP iii. Connection management d. CDMA iv. Works between Mobile Switching Centre (MSC) and Base Station Subsystem (BSS) Codes : a b c d (A) iii iv i ii (B) iii i iv ii (C) i ii iii iv (D) iv iii ii i _______________ www.examrace.com
  • 12.
    Space For RoughWork Paper-II 12 D-87-14 www.examrace.com