Tiêu đề COMPUTER SCIENCE & APPLICATIONS PAPER-II MAR-37223-A.pdf ✅

Time Allowed : 2 Hours] [Maximum Marks : 200 Number of Pages in this Booklet : 28 Number of Questions in this Booklet : 100 Signature and Name of Invigilator 1. (Signature) ......................................... (Name) ................................................ 2. (Signature) ......................................... (Name) ................................................ COMPUTER SCIENCE AND APPLICATIONS MAR - 37223 A Instructions for the Candidates 1. Write your Seat No. and OMR Sheet No. in the space provided on the top of this page. 2. This paper consists of 100 objective type questions. Each question will carry two marks. All questions of Paper II will be compulsory. 3. At the commencement of examination, the question booklet will be given to the student. In the first 5 minutes, you are requested to open the booklet and compulsorily examine it as follows : (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 or 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 missing pages/questions or questions repeated or not in serial order or any other discrepancy should not be accepted and correct booklet should be obtained from the invigilator within the period of 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra time will be given. The same may please be noted. (iii) After this verification is over, the OMR Sheet Number should be entered on this Test Booklet. 4. Each question 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 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 at the end of this booklet. 8. If you write your Name, Seat 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, you will render yourself liable to disqualification. 9. You have to return original OMR Sheet to the invigilator at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. You are, however, allowed to carry the Test 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 marking for incorrect answers. A B D 1. 2. 3. (i) (ii) (iii) 4. (A), (B), (C) (D) (C) 5. 6. 7. 8. 9. 10. 11. 12. A B D Test Booklet Code & Serial No. Seat No. (In figures as in Admit Card) Seat No. .............................................................. (In words) OMR Sheet No. (To be filled by the Candidate)

3 [P.T.O. MAR - 37223/II—A 1. V = {A, B, C, D, E, F, G, H, I} E = {e1 = (A, B), e2 = (A, C), e3 = (A, D), e4 = (B, C), e5 = (B, F), e6 = (B, H), e7 = (C, D), e8 = (C, E), e9 = (C, F), e10 = (D, E), e11 = (D, I), e12 = (E, F), e13 = (E, G), e14 = (F, G), e15 = (F, H), e16 = (G, H), e17 = (G, I), e18 = (H, I)} W = {22, 9, 12, 35, 36, 34, 4, 33, 30, 18, 23, 24, 39, 25, 21, 19} The weight of the shortest path from node A to I in the undirected graph is........... . (A) 2 (B) 3 (C) 42 (D) 43 Computer Science and Applications Paper II Time Allowed : 120 Minutes] [Maximum Marks : 200 Note : This Paper contains Hundred (100) multiple choice questions. Each question carrying Two (2) marks. Attempt All questions. 2. Group code are generated using 1 0 0 1 1 0 G 0 1 0 0 1 1 0 0 1 1 0 1 for communication. Then.......... is not code word. (A) 000000 (B) 000111 (C) 101100 (D) 111111 3. The number of code word possible using the generator G = 1 1 0 0 1 1 is : (A) 1 (B) 2 (C) 4 (D) 8 4. Let X and Y be random variables with joint distribution : Pr(X , Y ) i j 1 / 6 for 5,6 and 3,6,9 0 otherwise i j Then the conditional entropy H(X|Y) = .................. . (A) 0 (B) log(2) (C) log(3) (D) log(6)
4 MAR - 37223/II—A 5. Let X and Y be random variable with the following distributions respectively : X 1 2 3 4 5 P 0.1 0.2 0.4 0.2 0.1 Y 10 20 35 50 60 P 0.1 0.2 0.4 0.2 0.1 (A) Skewness of X and Y are same, Coefficient of Variations are the same (B) Skewness of distribution of X and Y are not same, Coefficient of Variations are the same (C) Skewness of distribution of X and Y are same, Coefficient of Variations are not same (D) Skewness of distribution of X and Y are not same, Coefficient of Variations are not same 6. Notation : C(n, r) = n!/(r!*(n-r)!)) n! is factorial n. |A| cardinality of set A s is negation of s The number of ways to place r indistinguishable balls in n(n < r) distinct boxes, with no box left empty, is........... . (A) C(r – 1, n – 1) (B) C(n + r – 1, n – 1) (C) C(n + r – 1, r – 1) (D) C(n – 1, r – 1) 7. Consider the following Linear Programming Problem : Maximize : Z = 5x1 + 6x2 + 4x3 Subject to 3x1 + x2 + 4x3 60 2x1 + 3x2 + 3x3 75 x1 , x2 , x3 0 The value of the decision variables after the first iteration will be : (A) x1 = 0, x2 = 0, x3 = 25 (B) x1 = 0, x2 = 25, x3 = 0 (C) x1 = 20, x2 = 0, x3 = 0 (D) x1 = 0, x2 = 37.5, x3 = 0