COMPUTER SCIENCE (868)

CLASS XI

CLASS XI
There will be two papers in the bases using English or pseudo code. These
subject:
Paper I: Theory………….. 3 hours…70 marks
algorithms are also good examples for defining
Paper II: Practical………. 3 hours…30 different functions in a class modelling numbers
marks (when programming is discussed). For addition and
subtraction (1’s complement and 2’s complement)
use the analogy with decimal numbers, emphasize
PAPER I –THEORY – 70
how carry works (this will be useful later when
MARKS
binary adders are discussed).
Paper I shall be of 3 hours duration and be divided
into two parts.
Part I (20 marks): This part will consist of
compulsory short answer questions, testing
knowledge, application and skills relating to the
entire syllabus.
Part II (50 marks): This part will be divided into
three Sections, A, B and C. Candidates will be
required to answer two questions out of three from
Section A (each carrying 10 marks) and two
questions out of three from Section B (each carrying
10 marks) and two questions out of three from
Section C (each carrying 5 marks). Therefore, a total
of six questions are to be answered in Part II.
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

1
1. Encodings
(a) Binary encodings for integers and real
numbers using a finite number of bits (sign-
magnitude, 2’s complement, mantissa-
exponent notation).
Signed, unsigned numbers, least and most
significant bits. Sign-
magnitude representation and its
shortcomings (two representations for 0,
addition requires extra step); two’s-
complement representation. Operations
(arithmetic, logical, shift), discuss the basic
algorithms used for the arithmetic
displayed if fonts are available) – a simple
table lookup for local language equivalents
for Latin (i.e. English) character strings may
be done. More details on Unicode are
available at www.unicode.org.
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,
4.
operations. Floating point representation:
normalized scientific notation, mantissa-
exponent representation, binary point
(discuss trade-off between size of mantissa
and exponent). Single and double precision.
(b) Characters and their encodings (e.g. ASCII,
ISCII, Unicode).
Discuss the limitations of the ASCII code in
representing characters of other languages.
Discuss the Unicode representation for the
local language. Java uses Unicode, so strings
in the local language can be used (they can
be
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.
3. Introduction to Object Oriented Programming
using Java
Note that topics 5 to 12 should be introduced
almost simultaneously along with Classes and
their definitions.
Objects
(a) Objects as data (attributes) + behaviour
(methods or methods); object as an instance of
a class.
Difference between object and class should be
made very clear. BlueJ (www.bluej.org) and
Greenfoot (www.greenfoot.org) can be used for
this purpose.
(b) Analysis of some real-world programming
examples in terms of objects and classes.
Use simple examples like a calculator, date,
2
 number etc. to illustrate how they can be (d) Compile time and run time errors; basic
treated as objects that behave in certain well- concept of an exception, the Exception class,
defined ways and how the interface provides try-catch, throw, throws and finally.
a way to access behaviour. Illustrate
Differentiate between compile time and run
behaviour changes by adding new methods,
time errors. Run time errors crash the
deleting old methods or modifying existing
program. Recovery is possible by the use of
methods.
exceptions. Explain how an exception object is
(c) Basic concept of a virtual machine; Java created and passed up until a matching catch is
Virtual Machine (JVM); compilation and found. This behaviour is different from the one
execution of Java programs (the javac and where a value is returned by a deeply nested
java programs). method call.
The JVM is a machine but built as a program 5. Primitive values, Wrapper classes, Types and
and not through hardware. Therefore it is casting
called a virtual machine. To run, JVM Primitive values and types: byte, int, short, long,
machine language programs require an float, double, boolean, char. Corresponding wrapper
interpreter. The advantage is that such JVM classes for each primitive type. Class as type of the
machine language programs (.class files) are object. Class as mechanism for user defined types.
portable and can run on any machine that Changing types through user defined
has the java program.
casting and automatic type coercion for some 7. Statements, Scope
primitive types.
Statements; conditional (if, if else, if else if, switch
Ideally, everything should be a class; primitive case) ternary operator, looping (for, while, do
types are defined for efficiency reasons; each while), continue, break; grouping statements in
primitive type has a corresponding wrapper class. blocks, scope and visibility of variables.
Classes as user defined types. In some cases types
Describe the semantics of the conditional and
are changed by automatic coercion or casting –
looping statements in detail. Evaluation of the
e.g. mixed type expressions. However, casting in
condition in conditional statements.
general is not a good idea and should be avoided,
if possible. Nesting of blocks. Variables with block scope,
method scope, class scope. Visibility rules when
6. Variables, Expressions variables with the same name are defined in
different scopes.
Variables as names for values; named constants
(final), expressions (arithmetic and logical) and 8. Methods and Constructors
their evaluation (operators, associativity,
Methods and Constructors (as abstractions for
precedence). Assignment operation; difference
complex user defined operations on objects),
between left-hand side and right-hand side of
methods as mechanisms for side effects; formal
assignment.
arguments and actual arguments in methods;
Variables denote values; variables are already
defined as attributes in classes; variables have
types that constrain the values it can denote.
Difference between variables denoting primitive
values and object values – variables denoting
objects are references to those objects. The
assignment operator = is special. The variable on
the LHS of = denotes the memory location while
the same variable on the RHS denotes the contents
of the location e.g. i=i+2.
NOTE: Library functions for solving expressions
may be used as and when required.

3
 different behaviour of primitive and object arguments.
Static methods and variables. The this operator. Examples
of algorithmic problem solving using methods (number
problems, finding roots of algebraic equations etc.).
Methods are like complex operations where the
object is implicitly the first argument. Operator this
denotes the current object. Methods typically return
values. Illustrate the difference between primitive
values and object values as arguments (changes
made inside methods persist after the call for object
values). Static definitions as class variables and
class methods visible and shared by all instances.
Need for static methods and variables. Introduce
the main method – needed to begin execution.
Constructor as a special kind of method; the new
operator; multiple constructors with different
argument structures; constructor returns a
reference to the object.
9. Arrays, Strings
Structured data types – arrays (single and multi-
dimensional), strings. Example algorithms that use
structured data types (searching, finding
maximum/minimum, sorting techniques, solving
systems of linear equations, substring,
concatenation, length, access to char in string, etc.).
Storing many data elements of the same type
requires structured data types – like arrays. Access
in arrays is constant time and does not depend on
the number of elements. Sorting techniques (bubble,
selection, insertion), Structured data types can be
defined by classes – String. Introduce the Java
library String class and the basic operations on
strings (accessing individual characters, various
substring operations, concatenation, replacement,
index of operations).
SECTION C
10. Basic input/output Data File Handling
(Binary) and Text)
(c) Basic input/output using Scanner and Printer
classes.
(a) Input/output exceptions. Tokens in an input
stream, concept of whitespace, extracting
tokens from an input stream (String Tokenizer
class). The Scanner class can be used for input
of various types of data (e.g. int, float, char
etc.) from the standard input stream. Only basic
input and output using scanner classes should
be covered.

251
 char etc.) from Stream, Output Emphasize that any correctness issues,
the standard Stream, Byte recursion must have
implement and
input stream. Stream a base case. execute the
Similarly, the (FileInputStrea Otherwise, the
algorithm in Java
Printer class m and computation can go and debug where
handles output. FileOutputStre into an infinite loop.
necessary.
Only basic am), Character
12. Implementation of
input and Stream Self-explanatory.
algorithms to solve
output using (FileReader,
problems
these classes FileWriter),
should be Operations- The students are required
covered. Creation, to do lab assignments in the
Discuss the Reading, computer lab concurrently
concept of a Writing, with the lectures.
token (a Appending, and Programming assignments
delimited Searching. should be done such that
continuous each major topic is covered
11. Recursion
stream of in at least one assignment.
characters that Concept of Assignment problems
is meaningful recursion, simple should be designed so that
in the recursive methods they are sufficiently
application (e.g. factorial, challenging and make the
program – e.g. GCD, binary student do algorithm
words in a search, conversion design, address
sentence where of representations
2. Packages the above and
the delimiter is of numbers between
their impact on
the blank different bases). Definition, creation of
Society.
character). packages, importing user
Many problems can
This naturally defined packages, (b) Cyber Security,
be solved very
leads to the interaction of objects privacy,
elegantly by
idea of across packages. netiquette, spam,
observing that the
delimiters and phishing.
solution can be Java Application
in particular Brief
composed of Programming
whitespace and understanding of
solutions to Interface (API),
user defined the above.
‘smaller’ versions development of
characters as of the same applications using (c) Intellectual
delimiters. As problem with the user defined property,
an example base version having packages. Software
show how the a known simple copyright and
StringTokenize solution. Recursion patents and Free
r class allows can be initially 13. Trends in Software
one to extract motivated by using computing and Foundation.
a sequence of recursive equations ethical issues
tokens from a Intellectual
to define certain (a) Artificial
string with property and
methods. These Intelligence,
user defined corresponding
definitions are Internet of
delimiters. laws and rights,
fairly obvious and Things, Virtual software as
(b) Data File are easy to Reality and intellectual
Handling. understand. The Augmented property.
definitions can be Reality.
Need for Data directly converted Brief Software
file, Input to a program. understanding of copyright and

252
 patents and the these are so that the algorithm, S
difference complex issues representation and E
between the and there are development process is D
two; multiple points clear from reading the 1. Creating an expert
trademarks; of view on many program. Large
system for road-traffic
software of them and differences between the
there is no planned program and the management (routing
licensing and and re-routing of
piracy. free single ‘correct’ printout will result in
or ‘right’ view. loss of marks. vehicles depending on
Software congestion).
Foundation and Teachers should
its position on PAPER II: maintain a record of all 2. Creating an expert
software, Open PRACTICAL – the assignments done as system for medical
Source 30 MARKS part of the practical diagnosis on the
Software.Softw work throughout the basis of symptoms
This paper of three hours and prescribe a
are, various year and give it due
duration will be suitable treatment.
types of credit at the time of
evaluated internally by
licensing (e.g. cumulative evaluation at 3. Creating a security
the school.
GPL, BSD). the end of the year. system for age-
The paper shall consist Students are expected to appropriate access to
Social impact
of three programming do a minimum of social media.
and ethical
issues should problems from which a fifteentwenty
be discussed candidate has to attempt assignments for the year
and debated in any one. The practical and ONE project based
class. The consists of the two parts: on the syllabus.
important thing (1) Planning Session
is for students List of Suggested
to realise that (2) Examination Session Projects:
The total time to be PRESENTATION /
Examination Session
spent on the Planning M
session and the The program handed in O
Examination session at the end of the D
is three hours. A Planning session shall E
be returned to the L
maximum of 90 minutes
candidates. The
is permitted for the candidates will be B
Planning session and 90 required to key-in and A
minutes for the execute the Java S
Examination session. program on seen and E
Candidates are to be unseen inputs D
permitted to proceed individually on the /
to the Examination Computer and show A
Session only after the execution to the P
90 minutes of the examiner. A printout of P
the program listing, L
Planning Session are
I
over. including output results
C
should be attached to
Planning Session A
the answer script T
The candidates will be containing the I
required to prepare an algorithm and O
algorithm and a hand- handwritten program. N
written Java program to This should be returned
solve the problem. to the examiner. The B
program should be A
sufficiently documented
253
 4. Simulate Adders Reservation. m t
using Arduino e i
7. Develop a console-
Controllers and o
based application
Components. ( n
using Java to
o
5. Simulate a encrypt and decrypt
n u
converter of Binary a message (using
l s
to Decimal cipher text,
y i
number systems Unicode-exchange,
n
using Arduino etc).
d g
Controllers and
8. Develop a console- i
Components.
based application r J
6. Develop a console- using Java to find e a
based application name of the bank c v
using Java for and branch location t a
Movie Ticket from IFSC.
9. D u t t
e s a o
v i x
e n ) d
l g . e
o v
10. D
p J e
e
a l
v
a v o
e
a p
l
c o
o t a
p
n o
s s
a
o c i
l a m
c
e l p
o
- c l
n
b u e
s
a l o
s a t
l
e t e
e
d e x
-
t
b
a t a
p a e
s
p x d
e
l a i
d
i b t
c l o
a
a e r
p
t p
i i (
l
o n t
i
n c e
c
o x
a
t
254
 C i
t t a l
y o n e
p t d
i a
n i c
l
g d o
, o a n
f t t
c e a
o 3 s i
p 0 n
y )
, w i
s i n
c h l g
u o l
t u t
, l b h
d e e
p
a b
s e r p
t e r
e d q a
, i u c
s i t
d t r i
e r
l e c
i
e d a
b
t u l
e t t
) e o w
. d o
EVALUATION s r
a u k
M s
b
a
g m r
r
k i i e
s v t l
e a
( n a t
o e
u b
w d
t e
l o
o o r t
f w k o
:
a Continuous Evaluation f p
255
r d
o
g O
r N
a E
m
m p
i r
n o
g j
e
a c
s t
s .
i
Programming assignments
g throughout the year
n
Project Work (based on any topic from the
m
syllabus)
e
n Terminal Evaluation
t
s Solution to programming problem on
the computer
d
(Marks should be given
o
for choice of algorithm
n
and implementation
e
strategy,
documentation, correct
d
output on known inputs
u
mentioned in the
r
question paper, correct
i
output for unknown
n
inputs available only to
g
the examiner).

t
h
e

y
e
a
r

a
n
256
259