Page 632 - ComputerScience_Class_11
P. 632

COMPUTER SCIENCE


                                                   SAMPLE PAPER


                                                             (THEORY)

                                                         Maximum Marks: 70
                                                         Time Allowed: 3 Hrs.
                                       (Candidates are allowed additional 15 minutes for only reading the paper.
                                                  They must NOT start writing during this time).
                                        Answer all questions in Part I (compulsory) and six questions from 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 as the
                                      The intended marks for questions or parts of questions are given in brackets [ ].

                                                           PART I (20 Marks)
                                                          Answer all questions.
                          While answering questions in this Part, indicate briefly your working and reasoning, wherever required.
              Question 1.                                                                                    [10 × 1 = 10]
                    (i)  Which one of the following symbols represents equivalence operation?                       [1]
                       (a)  ʌ                              (b)  →
                       (c)  v                              (d)  ↔
                   (ii)  Inverse  of conditional  a →b’ is                                                          [1]
                       (a)  a’ → b                         (b)   b →a’
                       (c)   b ‘ → a                       (d)   b’ → a’
                   (iii)  Complement of  A ʌ 0  is                                                                  [1]
                       (a)  tautology                      (b)  contradiction
                       (c)  contingency                    (d)  equivalent
                   (iv)  The Boolean expression for a two variable XOR gate is                                      [1]
                       (a)  A’.B+ A.B’                     (b)  A’.B ‘+ A.B’
                       (c)  A.B + A’.B                     (d)  A’.B’ + A.B
                   (v)  The given Truth table represents which connective?                                          [1]
                                                          A      B     Output
                                                          0      0       1
                                                          0      1       0
                                                          1      0       0
                                                          1      1       1
                       (a)  Conjunction                    (b)  Disjunction
                       (c)  Conditional                    (d)  Bi conditional
                   (vi)   In which of the following gates the output is 0  when all  inputs are 1?                  [1]
                       (a)  AND                            (b)  XOR
                       (c)  NAND                           (d)  OR
                  (vii)   Predict the output of the Java expression:
                       System.out.println(“ARTIFICIAL INTELLIGENCE”.charAt(“JAVA”.lastIndexOf(‘A’)));               [1]
                  (viii)  Write a JAVA statement to store number of rows  and columns of a two dimensional array arr[ ][ ].   [1]






                  630  Touchpad Computer Science (Ver. 3.0)-XI
   627   628   629   630   631   632   633   634   635   636   637