Page 520 - computer science (868) class 11
P. 520

MODEL TEST PAPER



                                                               (Theory)
                                                         Maximum Marks: 70
                                                         Time Allowed: 3 Hrs.
                                         Answer all questions in Part I (compulsory) and six questions in Part II,
                                  choosing two questions from Section – A, two from Section – B and two from Section – C.
                                         All working, including rough work, should be done on the same sheet.
                                      The intended marks for questions or parts of questions are given in brackets [ ].


                                                          PART I (20 Marks)

                                                         Attempt all questions.
                                      Indicate briefly your working and reasoning, wherever required.

              Question 1:
              (i)  The Binary equivalent of a decimal number (345)  is                                              [1]
                                                              10
                  (a) 0001 1111 1001
                  (b) 0001 0101 1111

                  (c)  0001 0101 1001
                  (d) 1001 0111 1001

              (ii)  Assertion: A pure method is a non-returnable method.
                  Reason: In pure method, there is no change in the state of the function.                          [1]

                  (a)  Both Assertion and Reason are true, and Reason is the correct explanation for Assertion.
                  (b)  Both Assertion and Reason are true, but Reason is not the correct explanation for Assertion.

                  (c)  Assertion is true and Reason is false.
                  (d)  Assertion is false and Reason is true.
              (iii)  Consider the statements:                                                                       [1]

                  A = You study hard; B = You will succeed in life

                  What will be the sentence, if the symbolic expression is A => B?
                  (a) If you succeed in life, then you will study hard.
                  (b) If you study hard, then you will succeed in life.

                  (c)  You study hard and you succeed in life.
                  (d) You study hard or you succeed in life.

               (iv)  A                                                                                              [1]
                   B
                   C









                518518  Touchpad Computer Science-XI
   515   516   517   518   519   520   521   522   523   524   525