Signature and Name of Invigilator 1. (Signature) OMR Sheet No. : .......................................................... (To be filled by the Candidate) (Name) Roll No. 2. (Signature) (Name) N0 8 7 1 7 Time : 2½ hours] (In figures as per admission card) PAPER - III Roll No. COMPUTER SCIENCE AND APPLICATIONS Number of Pages in this Booklet : 20 Instructions for the Candidates ¬⁄UËˇÊÊÁÕ¸ÿÙ¢ ∑§ Á‹∞ ÁŸŒ¸‡Ê Example : where (3) is the correct response. 5. Your responses to the items are to be indicated in the OMR Sheet given inside the Booklet only. If you mark your response 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 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 are no negative marks for incorrect answers. !N-08717-PAPER-III! [Maximum Marks : 150 Number of Questions in this Booklet : 75 1. Write your roll number in the space provided on the top of this page. 2. This paper consists of seventy five 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 Test Booklet Number should be entered on the OMR Sheet and the OMR Sheet Number should be entered on this Test Booklet. 4. Each item has four alternative responses marked (1), (2), (3) and (4). You have to darken the circle as indicated below on the correct response against each item. N-08717 (In words) 1 ß‚ ¬ÎDU ∑§ ™§¬⁄U ÁŸÿÃ SÕÊŸ ¬⁄U •¬ŸÊ ⁄UÙ‹U Ÿê’⁄U Á‹Áπ∞– ß‚ ¬˝‡Ÿ-¬òÊ ◊¢ ¬ø„ûÊ⁄U ’„ÈÁﬂ∑§À¬Ëÿ ¬˝‡Ÿ „Ò¥– 3. ¬⁄UËˇÊÊ ¬˝Ê⁄êU÷ „ÙŸ ¬⁄U, ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê •Ê¬∑§Ù Œ ŒË ¡ÊÿªË– ¬„‹U ¬UÊ°ø Á◊Ÿ≈U •Ê¬∑§Ù ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê πÙ‹Ÿ ÃÕÊ ©‚∑§Ë ÁŸêŸÁ‹ÁπÃ ¡Ê°ø ∑§ Á‹∞ ÁŒÿ ¡Êÿ¢ª, Á¡‚∑§Ë ¡Ê°ø •Ê¬∑§Ù •ﬂ‡ÿ ∑§⁄UŸË „Ò — (i) ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê πÙ‹Ÿ ∑§ Á‹∞ ¬ÈÁSÃ∑§Ê ¬⁄U ‹ªË ∑§Êª¡ ∑§Ë ‚Ë‹ ∑§Ê »§Ê«∏ ‹¢U– πÈ‹Ë „Èß¸ ÿÊ Á’ŸÊ S≈UË∑§⁄U-‚Ë‹U ∑§Ë ¬ÈÁSÃ∑§Ê SﬂË∑§Ê⁄U Ÿ ∑§⁄¢U– (ii) ∑§ﬂ⁄U ¬ÎDU ¬⁄U ¿U¬ ÁŸŒ¸‡ÊÊŸÈ‚Ê⁄U ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§ ¬ÎDU ÃÕÊ ¬˝‡ŸÙ¢ ∑§Ë ‚¢ÅÿÊ ∑§Ù •ë¿UË Ã⁄U„ øÒ∑§ ∑§⁄U ‹¢U Á∑§ ÿ ¬Í⁄U „Ò¢U– ŒÙ·¬ÍáÊ¸ ¬ÈÁSÃ∑§Ê Á¡Ÿ◊¢ ¬ÎDU/¬˝‡Ÿ ∑§◊ „Ù¢ ÿÊ ŒÈ’Ê⁄UÊ •Ê ªÿ „Ù¢ ÿÊ ‚ËÁ⁄Uÿ‹U ◊¢ Ÿ „Ù¢ •ÕÊ¸Ã˜ Á∑§‚Ë ÷Ë ¬˝∑§Ê⁄U ∑§Ë òÊÈÁ≈U¬ÍáÊ¸ ¬ÈÁSÃ∑§Ê SﬂË∑§Ê⁄U Ÿ ∑§⁄¢U ÃÕÊ ©‚Ë ‚◊ÿ ©‚ ‹Uı≈UÊ∑§⁄U ©‚∑§ SÕÊŸ ¬⁄U ŒÍ‚⁄UË ‚„Ë ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ‹ ‹¢– U ß‚∑§ Á‹∞ •Ê¬∑§Ù ¬Ê°ø Á◊Ÿ≈U ÁŒÿ ¡Êÿ¢ª– ©‚∑§ ’ÊŒ Ÿ ÃÙ •Ê¬∑§Ë ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ﬂÊ¬‚ ‹Ë ¡ÊÿªË •ı⁄U Ÿ „Ë •Ê¬∑§Ù •ÁÃÁ⁄UQ§ ‚◊ÿ ÁŒÿÊ ¡ÊÿªÊ– (iii) ß‚ ¡Ê°ø ∑§ ’ÊŒ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§Ê Ÿ¥’⁄U OMR ¬òÊ∑§ ¬⁄U •¢Á∑§Ã ∑§⁄¢U •Uı⁄U OMR ¬òÊ∑§ ∑§Ê Ÿ¥’⁄U ß‚ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ¬⁄U •¢Á∑§Ã ∑§⁄U Œ¢– 4. ¬˝àÿ∑§ ¬˝‡Ÿ ∑§ Á‹∞ øÊ⁄U ©ûÊ⁄U Áﬂ∑§À¬ (1), (2), (3) ÃÕÊ (4) ÁŒÿ ªÿ „Ò¢– •Ê¬∑§Ù ‚„Ë ©ûÊ⁄U ∑§ ﬂÎûÊ ∑§Ù ¬Ÿ ‚ ÷⁄U∑§⁄U ∑§Ê‹Ê ∑§⁄UŸÊ „Ò ¡Ò‚Ê Á∑§ ŸËø ÁŒπÊÿÊ ªÿÊ „Ò– ¡’Á∑§ (3) ‚„Ë ©ûÊ⁄U „Ò– ©ŒÊ„⁄UáÊ — 5. ¬˝‡ŸÊ¥ ∑§ ©ûÊ⁄U ∑§ﬂ‹ ¬˝‡Ÿ ¬ÈÁSÃ∑§Ê ∑§ •ãŒ⁄U ÁŒÿ ªÿ OMRU ¬òÊ∑§ ¬⁄U „Ë •¥Á∑§Ã ∑§⁄UŸ „Ò¥– ÿÁŒ •Ê¬ OMRU ¬òÊ∑§ ¬⁄U ÁŒÿ ªÿ ﬂÎûÊ ∑§ •‹ÊﬂÊ Á∑§‚Ë •ãÿ SÕÊŸ ¬⁄U ©ûÊ⁄U ÁøqÊ¢Á∑§Ã ∑§⁄UÃ „Ò¥, ÃÙ ©‚∑§Ê ◊ÍÀUÿÊ¢∑§Ÿ Ÿ„Ë¢ „ÙªÊ– 6. •ãŒ⁄U ÁŒÿ ªÿ ÁŸŒ¸‡ÊÙ¢ ∑§Ù äÿÊŸ¬Íﬂ¸∑§ ¬…∏¢U– 7. ∑§ìÊÊ ∑§Ê◊ (Rough Work) ß‚ ¬ÈÁSÃ∑§Ê ∑§ •ÁãÃ◊ ¬ÎDU ¬⁄U ∑§⁄¢U– 8. ÿÁŒ •Ê¬ OMR ¬òÊ∑§ ¬⁄U ÁŸÿÃ SÕÊŸ ∑§ •‹ÊﬂÊ •¬ŸÊ ŸÊ◊, ⁄UÊ‹ Ÿê’⁄U, »§ÊŸ Ÿê’⁄U ÿÊ ∑§Êß¸ ÷Ë ∞‚Ê Áøq Á¡‚‚ •Ê¬∑§Ë ¬„øÊŸ „Ê ‚∑§, •¥Á∑§Ã ∑§⁄UÃ „Ò¥ •ÕﬂÊ •÷Œ˝ ÷Ê·Ê ∑§Ê ¬˝ÿÊª ∑§⁄UÃ „Ò¥, ÿÊ ∑§Êß¸ •ãÿ •ŸÈÁøÃ ‚ÊœŸ ∑§Ê ¬˝ÿÊª ∑§⁄UÃ „Ò¥, ¡Ò‚ Á∑§ •¥Á∑§Ã Á∑§ÿ ªÿ ©ûÊ⁄U ∑§Ê Á◊≈UÊŸÊ ÿÊ ‚»§Œ SÿÊ„Ë ‚ ’Œ‹ŸÊ ÃÊ ¬⁄UËˇÊÊ ∑§ Á‹ÿ •ÿÊÇÿ ÉÊÊÁ·Ã Á∑§ÿ ¡Ê ‚∑§Ã „Ò¥– 9. •Ê¬∑§Ù ¬⁄UËˇÊÊ ‚◊Ê# „ÙŸ §¬⁄U ◊Í‹ OMR ¬òÊ∑§ ÁŸ⁄UËˇÊ∑§ ◊„ÙŒÿ ∑§Ù ‹Uı≈UÊŸÊ •Êﬂ‡ÿ∑§ „Ò •ı⁄U ¬⁄UËˇÊÊ ‚◊ÊÁ# ∑§ ’ÊŒ ©‚ •¬Ÿ ‚ÊÕ ¬⁄UËˇÊÊ ÷ﬂŸ ‚ ’Ê„⁄U Ÿ ‹∑§⁄U ¡Êÿ¢– „Ê‹Ê¥Á∑§ •Ê¬ ¬⁄UËˇÊÊ ‚◊ÊÁ# ¬⁄U ◊Í‹ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ÃÕÊ OMR ¬òÊ∑§ ∑§Ë «ÈUå‹Ë∑§≈U ¬˝ÁÃ •¬Ÿ ‚ÊÕ ‹ ¡Ê ‚∑§Ã „Ò¥– 10. ∑§ﬂ‹ ŸË‹/∑§Ê‹ ’Ê‹U åﬂÊßZ≈U ¬Ÿ ∑§Ê „Ë ¬˝ÿÊª ∑§⁄¢U– 11. Á∑§‚Ë ÷Ë ¬˝∑§Ê⁄U ∑§Ê ‚¢ªáÊ∑§ (∑Ò§‹∑È§‹≈U⁄U) UÿÊ ‹Êª ≈U’‹ •ÊÁŒ ∑§Ê ¬˝ÿÙª ﬂÁ¡¸Ã „Ò– 12. ª‹Ã ©ûÊ⁄UÊ¥ ∑§ Á‹∞ ∑§Êß¸ Ÿ∑§Ê⁄UÊà◊∑§ •¥∑§ Ÿ„Ë¥ „Ò¥– 1. 2. P.T.O.
COMPUTER SCIENCE AND APPLICATIONS PAPER - III Note : 1. In 8085 microprocessor which of the following flag(s) is (are) affected by an arithmetic operation ? (1) 2. AC flag Only (2) CY flag Only (3) Z flag Only (4) AC, CY, Z flags (4) 32 In 8085 microprocessor the address bus is of __________ bits. (1) 3. This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are compulsory. 4 (2) 8 (3) 16 In the architecture of 8085 microprocessor match the following : (a) Processing unit (i) Interrupt (b) Instruction unit (ii) General purpose Register (c) Storage and Interface unit (iii) ALU (iv) Timing and Control Code : 4. (a) (b) (c) (1) (iv) (i) (ii) (2) (iii) (iv) (ii) (3) (ii) (iii) (i) (4) (i) (ii) (iv) Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations ? (1) Indexed addressing mode (2) Base Register addressing mode (3) Relative address mode (4) Displacement mode N-08717 !N-08717-PAPER-III! 2 Paper-III
5. 6. Which of the following is correct statement ? (1) In memory - mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to manipulate memory words. (2) The isolated I/O method isolates memory and I/O addresses so that memory address range is not affected by interface address assignment. (3) In asynchronous serial transfer of data the two units share a common clock. (4) In synchronous serial transmission of data the two units have different clocks. A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven distinct micro-operations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field ADF. The address space is of 128 memory locations. The size of micro-instruction is : (1) 7. 17 bits (2) 20 bits (3) 24 bits (4) 32 bits Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable ? S1 : r1(X); r2(X); w1(X); r3(X); w2(X) S2 : r2(X); r1(X); w2(X); r3(X); w1(X) S3 : r3(X); r2(X); r1(X); w2(X); w1(X) S4 : r2(X); w2(X); r3(X); r1(X); w1(X) (1) 8. 9. S1 (2) S2 (3) S3 (4) S4 Suppose a database schedule S involves transactions T 1, T 2, .............,T n. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ? (1) Topological order (2) Depth - first order (3) Breadth - first order (4) Ascending order of transaction indices If every non-key attribute is functionally dependent on the primary key, then the relation is in __________ . (1) First normal form (2) Second normal form (3) Third normal form (4) Fourth normal form N-08717 !N-08717-PAPER-III! 3 Paper-III
10. Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist. CH → G A → BC B → CFH E→A F → EG The relation R is __________ . 11. (1) in 1NF but not in 2NF (2) in 2NF but not in 3NF (3) in 3NF but not in BCNF (4) in BCNF Given two relations R1(A, B) and R2(C, D), the result of following query Select distinct A, B from R1, R2 is guaranteed to be same as R1 provided one of the following condition is satisfied. 12. (1) R1 has no duplicates and R2 is empty. (2) R1 has no duplicates and R2 is non - empty. (3) Both R1 and R2 have no duplicates. (4) R2 has no duplicates and R1 is non - empty. Consider a schema R(A, B, C, D) and following functional dependencies. A→B B→C C→D D→B Then decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is __________ . (1) Dependency preserving and lossless join. (2) Lossless join but not dependency preserving. (3) Dependency preserving but not lossless join. (4) Not dependency preserving and not lossless join. N-08717 !N-08717-PAPER-III! 4 Paper-III