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

SYLLABUS CLASS XI

                                                COMPUTER SCIENCE (868)




                   There will be two papers in the subject:
                   Paper I:  Theory…………..   3 hours…70 marks

                   Paper II: Practical……….   3 hours…30 marks



                                                  PAPER I – THEORY – 70 MARKS

                                                              SECTION A

                  Basic Computer Hardware and Software
                  1.   Numbers
                     Representation of numbers in different bases and interconversion between them (e.g. binary, octal, decimal,
                     hexadecimal). Addition and subtraction operations for numbers in different bases.

                     Introduce the positional system of representing numbers and the concept of a base. Discuss the conversion
                     of  representations  between  different bases using English or pseudo code. These algorithms are also good
                     examples for defining different functions in a class modelling numbers (when programming is discussed).
                     For addition and subtraction (1’s complement and 2’s complement) use the analogy with decimal numbers,
                     emphasize how carry works (this will be useful later when binary adders are discussed).

                  2.   Propositional logic, Hardware  implementation, Arithmetic operations
                     (a)   Propositional logic, well-formed formulae, truth values and interpretation of well formed formulae,
                         truth tables.
                           Propositional variables; the common logical connectives ((not)(negation),  ∧ (and)(conjunction),  ∨
                         (or)(disjunction),  ⇒ (implication),  ⇔  (equivalence));  definition of a well-formed  formula (wff);
                         representation of simple word problems as wff (this can be used for motivation); the values true and
                         false; interpretation of a wff; truth  tables; satisfiable, unsatisfiable and valid formulae.

                     (b)   Logic and hardware, basic gates (AND, NOT, OR) and their universality, other gates (NAND, NOR, XOR,
                         XNOR), half adder, full adder.
                         Show how the logic in (a) above can be realized in hardware in the form of gates. These gates can then
                         be combined to implement the basic operations for arithmetic. Tie up with the arithmetic operations on

                         integers discussed earlier in 2 (a).
                                                              SECTION B
                  The programming element in the syllabus is aimed at algorithmic problem solving and not merely rote learning of
                  Java syntax. The Java version used should be 5.0 or later. For programming, the students can use any text editor
                  and the javac and Java programs or any other development environment: for example, BlueJ, Eclipse, NetBeans

                  etc. BlueJ is strongly recommended for its simplicity, ease of use and because it is very well suited for an ‘objects
                  first’ approach.
   2   3   4   5   6   7   8   9   10   11   12