ISC YEAR 2027

INDIAN SCHOOL CERTIFICATE

EXAMINATION

COMPUTER SCIENCE
(868)
February 2025
____________________________________________________________________________________________

© Copyright, Council for the Indian School Certificate Examinations

All rights reserved. The copyright to this publication and any part thereof solely vests in the Council for the Indian
School Certificate Examinations. This publication and no part thereof may be reproduced, transmitted, distributed or
stored in any manner whatsoever, without the prior written approval of the Council for the Indian School Certificate
Examinations.
Council for the Indian School Certificate Examinations (CISCE)

MISSION STATEMENT

The Council for the Indian School Certificate

Examinations is committed to serving the nation's
children, through high quality educational
endeavours, empowering them to contribute towards
a humane, just and pluralistic society, promoting
introspective living, by creating exciting learning
opportunities, with a commitment to excellence.

ETHOS OF CISCE

Trust and fair play.

Minimum monitoring.
Allowing schools to evolve their own niche.
Catering to the needs of the children.
Giving freedom to experiment with new ideas
and practices.
Diversity and plurality - the basic strength for
evolution of ideas.
Schools to motivate pupils towards the
cultivation of:
Excellence - The Indian and Global
experience.
Values - Spiritual and cultural - to be the bedrock
of the educational experience.
Schools to have an 'Indian Ethos', strong roots in
the national psyche and be sensitive to national
aspirations.
 COMPUTER SCIENCE (868)

Aims (Conceptual) (3) To create awareness of ethical issues related to

computing and to promote safe, ethical
(1) To understand algorithmic problem solving
behavior.
using data abstractions, functional and
procedural abstractions, and object based and (4) To make students aware of future trends in
object-oriented abstractions. computing.
(2) To understand: (a) how computers represent, Aims (Skills)
store and process data at different levels of
To devise algorithmic solutions to problems and to
abstraction that mediate between the machine
be able to code, validate, document, execute and
and the algorithmic problem solving level and
debug the solution using the Java programming
(b) how they communicate with the outside
system.
world.

CLASS XI
There will be two papers in the subject: 2. Encodings
Paper I: Theory………….. 3 hours…70 marks (a) Binary encodings for integers and real
Paper II: Practical………. 3 hours…30 marks numbers using a finite number of bits (sign-
magnitude, 2’s complement, mantissa-
exponent notation).
Signed, unsigned numbers, least and most
PAPER I –THEORY – 70 MARKS significant bits. Sign-magnitude
SECTION A representation and its shortcomings (two
representations for 0, addition requires extra
Basic Computer Hardware and Software step); two’s-complement representation.
Operations (arithmetic, logical, shift),
1. Numbers
discuss the basic algorithms used for the
Representation of numbers in different bases and arithmetic operations. Floating point
interconversion between them (e.g. binary, octal, representation: normalized scientific
decimal, hexadecimal). Addition and subtraction notation, mantissa-exponent representation,
operations for numbers in different bases. binary point (discuss trade-off between size
of mantissa and exponent). Single and double
Introduce the positional system of representing precision.
numbers and the concept of a base. Discuss the
conversion of representations between different (b) Characters and their encodings (e.g. ASCII,
bases using English or pseudo code. These ISCII, Unicode).
algorithms are also good examples for defining Discuss the limitations of the ASCII code in
different functions in a class modelling numbers representing characters of other languages.
(when programming is discussed). For addition Discuss the Unicode representation for the
and subtraction (1’s complement and 2’s local language. Java uses Unicode, so
complement) use the analogy with decimal strings in the local language can be used
numbers, emphasize how carry works (this will be (they can be displayed if fonts are available)
useful later when binary adders are discussed). – a simple table lookup for local language

ISC Examination Year 2027

1
 equivalents for Latin (i.e. English) character 5. Objects
strings may be done. More details on
Unicode are available at www.unicode.org. (a) Objects as data (attributes) + behaviour
(methods or methods); object as an instance
3. Propositional logic, Hardware of a class.
implementation, Arithmetic operations
Difference between object and class should
(a) Propositional logic, well-formed formulae, be made very clear. BlueJ (www.bluej.org)
truth values and interpretation of well formed and Greenfoot (www.greenfoot.org) can be
formulae, truth tables. used for this purpose.
Propositional variables; the common logical
(b) Analysis of some real-world programming
connectives ((not)(negation), ∧
examples in terms of objects and classes.
(and)(conjunction), ∨ (or)(disjunction),
⇒ (implication), ⇔ (equivalence)); definition Use simple examples like a calculator, date,
of a well-formed formula (wff); number etc. to illustrate how they can be
representation of simple word problems as treated as objects that behave in certain well-
wff (this can be used for motivation); the defined ways and how the interface provides
values true and false; interpretation of a wff; a way to access behaviour. Illustrate
truth tables; satisfiable, unsatisfiable and behaviour changes by adding new methods,
valid formulae. deleting old methods or modifying existing
methods.
(b) Logic and hardware, basic gates (AND,
NOT, OR) and their universality, other gates (c) Basic concept of a virtual machine; Java
(NAND, NOR, XOR, XNOR), half adder, Virtual Machine (JVM); compilation and
full adder. execution of Java programs (the javac and
Show how the logic in (a) above can be java programs).
realized in hardware in the form of gates. The JVM is a machine but built as a program
These gates can then be combined to and not through hardware. Therefore it is
implement the basic operations for called a virtual machine. To run, JVM
arithmetic. Tie up with the arithmetic machine language programs require an
operations on integers discussed earlier in 2 interpreter. The advantage is that such JVM
(a). machine language programs (.class files) are
SECTION B portable and can run on any machine that
has the java program.
The programming element in the syllabus is aimed
at algorithmic problem solving and not merely rote (d) Compile time and run time errors; basic
learning of Java syntax. The Java version used concept of an exception, the Exception class,
should be 5.0 or later. For programming, the try-catch, throw, throws and finally.
students can use any text editor and the javac and Differentiate between compile time and run
java programs or any other development time errors. Run time errors crash the
environment: for example, BlueJ, Eclipse, NetBeans program. Recovery is possible by the use of
etc. BlueJ is strongly recommended for its exceptions. Explain how an exception object
simplicity, ease of use and because it is very well is created and passed up until a matching
suited for an ‘objects first’ approach. catch is found. This behaviour is different
4. Introduction to Object Oriented from the one where a value is returned by a
Programming using Java deeply nested method call.

Note that topics 5 to 12 should be introduced

almost simultaneously along with Classes and
their definitions.

ISC Examination Year 2027

2
6. Primitive values, Wrapper classes, Types and 9. Methods and Constructors
casting
Methods and Constructors (as abstractions for
Primitive values and types: byte, int, short, long, complex user defined operations on objects),
float, double, boolean, char. Corresponding methods as mechanisms for side effects; formal
wrapper classes for each primitive type. Class as arguments and actual arguments in methods;
type of the object. Class as mechanism for user different behaviour of primitive and object
defined types. Changing types through user arguments. Static methods and variables. The this
defined casting and automatic type coercion for operator. Examples of algorithmic problem
some primitive types. solving using methods (number problems,
finding roots of algebraic equations etc.).
Ideally, everything should be a class; primitive
types are defined for efficiency reasons; each Methods are like complex operations where the
primitive type has a corresponding wrapper class. object is implicitly the first argument. Operator
Classes as user defined types. In some cases types this denotes the current object. Methods typically
are changed by automatic coercion or casting – return values. Illustrate the difference between
e.g. mixed type expressions. However, casting in primitive values and object values as arguments
general is not a good idea and should be avoided, (changes made inside methods persist after the
if possible. call for object values). Static definitions as class
7. Variables, Expressions variables and class methods visible and shared
by all instances. Need for static methods and
Variables as names for values; named constants variables. Introduce the main method – needed to
(final), expressions (arithmetic and logical) and begin execution. Constructor as a special kind of
their evaluation (operators, associativity, method; the new operator; multiple constructors
precedence). Assignment operation; difference with different argument structures; constructor
between left-hand side and right-hand side of returns a reference to the object.
assignment.
10. Arrays, Strings
Variables denote values; variables are already
defined as attributes in classes; variables have Structured data types – arrays (single and multi-
types that constrain the values it can denote. dimensional), strings. Example algorithms that
Difference between variables denoting primitive use structured data types (searching, finding
values and object values – variables denoting maximum/minimum, sorting techniques, solving
objects are references to those objects. The systems of linear equations, substring,
assignment operator = is special. The variable on concatenation, length, access to char in string,
the LHS of = denotes the memory location while etc.).
the same variable on the RHS denotes the contents
of the location e.g. i=i+2. Storing many data elements of the same type
requires structured data types – like arrays.
NOTE: Library functions for solving expressions Access in arrays is constant time and does not
may be used as and when required. depend on the number of elements. Sorting
8. Statements, Scope techniques (bubble, selection, insertion),
Statements; conditional (if, if else, if else if, Structured data types can be defined by classes –
switch case) ternary operator, looping (for, while, String. Introduce the Java library String class
do while), continue, break; grouping statements in and the basic operations on strings (accessing
blocks, scope and visibility of variables. individual characters, various substring
Describe the semantics of the conditional and operations, concatenation, replacement, index of
looping statements in detail. Evaluation of the operations).
condition in conditional statements.
Nesting of blocks. Variables with block scope,
method scope, class scope. Visibility rules when
variables with the same name are defined in
different scopes.

ISC Examination Year 2027

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

ISC Examination Year 2027

4
 important thing is for students to realise assignments for the year and ONE project based on
that these are complex issues and there are the syllabus.
multiple points of view on many of them and
there is no single ‘correct’ or ‘right’ view. LIST OF SUGGESTED PROJECTS:
PRESENTATION / MODEL BASED/
APPLICATION BASED
PAPER II - PRACTICAL – 30 MARKS 1. Creating an expert system for road-traffic
This paper of three hours duration will be evaluated management (routing and re-routing of vehicles
internally by the school. depending on congestion).
The paper shall consist of three programming 2. Creating an expert system for medical diagnosis
problems from which a candidate has to attempt any on the basis of symptoms and prescribe a suitable
one. The practical consists of the two parts: treatment.
(1) Planning Session 3. Creating a security system for age-appropriate
access to social media.
(2) Examination Session
4. Simulate Adders using Arduino Controllers and
The total time to be spent on the Planning session and Components.
the Examination session is three hours.
A maximum of 90 minutes is permitted for the 5. Simulate a converter of Binary to Decimal
Planning session and 90 minutes for the Examination number systems using Arduino Controllers and
session. Candidates are to be permitted to proceed Components.
to the Examination Session only after the 90 6. Develop a console-based application using Java
minutes of the Planning Session are over. for Movie Ticket Reservation.
Planning Session 7. Develop a console-based application using Java
The candidates will be required to prepare an to encrypt and decrypt a message (using cipher
algorithm and a hand-written Java program to solve text, Unicode-exchange, etc).
the problem. 8. Develop a console-based application using Java
Examination Session to find name of the bank and branch location
from IFSC.
The program handed in at the end of the Planning
session shall be returned to the candidates. The 9. Develop a console-based application using Java
candidates will be required to key-in and execute the to calculate taxable income (only direct tax).
Java program on seen and unseen inputs individually 10. Develop a console-based application using Java
on the Computer and show execution to the to develop a simple text editor (text typing, copy,
examiner. A printout of the program listing, including cut, paste, delete).
output results should be attached to the answer script
containing the algorithm and handwritten program.
This should be returned to the examiner. The
program should be sufficiently documented so that
the algorithm, representation and development
process is clear from reading the program. Large
differences between the planned program and the
printout will result in loss of marks.
Teachers should maintain a record of all the
assignments done as part of the practical work
throughout the year and give it due credit at the time
of cumulative evaluation at the end of the year.
Students are expected to do a minimum of twenty

ISC Examination Year 2027

5
EVALUATION Terminal Evaluation
Marks (out of a total of 30) should be distributed as Solution to programming problem on 15 Marks
given below: the computer
Continuous Evaluation
Candidates will be required to submit a work file (Marks should be given for choice of algorithm and
containing the practical work related to programming implementation strategy, documentation, correct
assignments done during the year and ONE project. output on known inputs mentioned in the question
paper, correct output for unknown inputs available
Programming assignments done 10 marks only to the examiner).
throughout the year
Project Work (based on any topic from 5 marks
the syllabus)

ISC Examination Year 2027

6
 CLASS XII
There will be two papers in the subject: Verify the laws of Boolean algebra using
Paper I: Theory……….. 3 hours….70 marks truth tables. Inputs, outputs for circuits like
half and full adders, majority circuit etc.,
Paper II: Practical…….. 3 hours….30 marks
SOP and POS representation; Maxterms &
Minterms, Canonical and Cardinal
PAPER I –THEORY – 70 MARKS representation, reduction using Karnaugh
maps and Boolean algebra.
SECTION A
1. Boolean Algebra 2. Computer Hardware
(a) Propositional logic, well formed formulae, (a) Elementary logic gates (NOT, AND, OR,
truth values and interpretation of well formed NAND, NOR, XOR, XNOR) and their use in
formulae (wff), truth tables, satisfiable, circuits.
unsatisfiable and valid formulae. Equivalence
laws and their use in simplifying wffs. (b) Applications of Boolean algebra and logic
gates to half adders, full adders, encoders,
Propositional variables; the common logical decoders, multiplexers, NAND, NOR as
connectives (~ (not)(negation), ∧ universal gates.
(and)(conjunction), ∨ (or)(disjunction), ⇒
(implication), ⇔ (biconditional); definition Show the correspondence between Boolean
of a well-formed formula (wff); methods and the corresponding switching
`representation of simple word problems as circuits or gates. Show that NAND and NOR
wff (this can be used for motivation); the gates are universal by converting some circuits
values true and false; interpretation of a wff; to purely NAND or NOR gates.
truth tables; satisfiable, unsatisfiable and
valid formulae. SECTION B
Equivalence laws: commutativity of ∧, ∨; The programming element in the syllabus (Sections B
associativity of ∧, ∨; distributivity; De and C) is aimed at algorithmic problem solving and
Morgan’s laws; law of implication (p ⇒ q ≡ not merely rote learning of Java syntax. The Java
~p ∨ q); law of biconditional ((p ⇔ q) ≡ version used should be 5.0 or later. For programming,
(p ⇒ q) ∧ (q ⇒ p)); identity (p ≡ p); law of the students can use any text editor and the javac and
negation (~ (~p) ≡ p); law of excluded java programs or any other development
middle (p ∨~p ≡ true); law of contradiction environment: for example, BlueJ, Eclipse, NetBeans
(p∧~p ≡ false); tautology and contingency etc. BlueJ is strongly recommended for its simplicity,
simplification rules for ∧, ∨. Converse, ease of use and because it is very well suited for an
inverse and contra positive. Chain rule, ‘objects first’ approach.
Modus ponens.
3. Implementation of algorithms to solve
(b) Binary valued quantities; basic postulates problems
of Boolean algebra; operations AND, OR and
The students are required to do lab assignments
NOT; truth tables. in the computer lab concurrently with the
(c) Basic theorems of Boolean algebra lectures. Programming assignments should be
(e.g. duality, idempotence, commutativity, done such that each major topic is covered in at
associativity, distributivity, operations with 0 least one assignment. Assignment problems
and 1, complements, absorption, involution); should be designed so that they are sufficiently
De Morgan’s theorem and its applications; challenging. Students must do algorithm design,
reducing Boolean expressions to sum of address correctness issues, implement and
products and product of sums forms; execute the algorithm in Java and debug where
necessary. Self explanatory.
Karnaugh maps (up to four variables).

ISC Examination Year 2027

7
4. Programming in Java (Review of Class XI Examples of algorithmic problem solving using
Sections B and C) methods (number problems, finding roots of
algebraic equations etc.).
Note that items 4 to 13 should be introduced
almost simultaneously along with classes and 10. Arrays, Strings
their definitions.
Structured data types – arrays (single and multi-
While reviewing, ensure that new higher order dimensional), address calculations, strings.
problems are solved using these constructs. Example algorithms that use structured data types
(e.g. searching, finding maximum/minimum,
5. Objects
sorting techniques, solving systems of linear
(a) Objects as data (attributes) + behaviour equations, substring, concatenation, length,
(methods); object as an instance of a class. access to char in string, etc.).
Constructors.
Storing many data elements of the same type
(b) Analysis of some real-world programming requires structured data types – like arrays.
examples in terms of objects and classes. Access in arrays is constant time and does not
depend on the number of elements. Address
(c) Basic input/output using Scanner and Printer
calculation (row major and column major),
classes from JDK; input/output exceptions.
Sorting techniques (bubble, selection, insertion).
Tokens in an input stream, concept of
Structured data types can be defined by classes –
whitespace, extracting tokens from an input
String. Introduce the Java library String class
stream (String Tokenizer class).
and the basic operations on strings (accessing
6. Primitive values, Wrapper classes, Types and individual characters, various substring
casting operations, concatenation, replacement, index of
operations). The class StringBuffer should be
Primitive values and types: byte, int, short, long,
introduced for those applications that involve
float, double, boolean, char. Corresponding
heavy manipulation of strings.
wrapper classes for each primitive type. Class as
type of the object. Class as mechanism for user 11. Recursion
defined types. Changing types through user
Concept of recursion, simple recursive methods
defined casting and automatic type coercion for
(e.g. factorial, GCD, binary search, conversion of
some primitive types.
representations of numbers between different
7. Variables, Expressions bases).
Variables as names for values; named constants Many problems can be solved very elegantly by
(final), expressions (arithmetic and logical) and observing that the solution can be composed of
their evaluation (operators, associativity, solutions to ‘smaller’ versions of the same
precedence). Assignment operation; difference problem with the base version having a known
between left hand side and right hand side of simple solution. Recursion can be initially
assignment. motivated by using recursive equations to define
certain methods. These definitions are fairly
8. Statements, Scope
obvious and are easy to understand. The
Statements; conditional (if, if else, if else if, definitions can be directly converted to a
switch case, ternary operator), looping (for, program. Emphasize that any recursion must
while, do while, continue, break); grouping have a base case. Otherwise, the computation
statements in blocks, scope and visibility of can go into an infinite loop.
variables.
The tower of Hanoi is a very good example of
9. Methods how recursion gives a very simple and elegant
solution where as non-recursive solutions are
Methods (as abstractions for complex user
quite complex.
defined operations on objects), formal arguments
and actual arguments in methods; different
behaviour of primitive and object arguments.
Static method and variables. The this Operator.

ISC Examination Year 2027

8
 SECTION C (b) Single linked list (Algorithm and
programming), binary trees, tree traversals
Inheritance, Interface, Polymorphism, Data (Conceptual).
structures, Computational complexity The following should be covered for each
12. Inheritance, Interfaces and Polymorphism data structure:
(a) Inheritance; super and derived classes; Linked List (single): insertion, deletion,
member access in derived classes; reversal, extracting an element or a sublist,
redefinition of variables and methods in checking emptiness.
subclasses; abstract classes; class Object; Binary trees: apart from the definition the
protected visibility. Subclass polymorphism following concepts should be covered: root,
and dynamic binding. internal nodes, external nodes (leaves),
Emphasize inheritance as a mechanism to height (tree, node), depth (tree, node), level,
reuse a class by extending it. Inheritance size, degree, siblings, sub tree,
should not normally be used just to reuse completeness, balancing, traversals (pre,
some methods defined in a class but only post and in-order).
when there is a genuine specialization (or
14. Complexity and Big O notation
subclass) relationship between objects of the
super class and that of the derived class. Concrete computational complexity; concept of
input size; estimating complexity in terms of
(b) Interfaces in Java; implementing interfaces
methods; importance of dominant term;
through a class; interfaces for user defined
constants, best, average and worst case.
implementation of behaviour.
Big O notation for computational complexity;
Motivation for interface: often when creating
analysis of complexity of example algorithms
reusable classes some parts of the exact
using the big O notation (e.g. Various searching
implementation can only be provided by the
and sorting algorithms, algorithm for solution of
final end user. For example, in a class that
linear equations etc.).
sorts records of different types the exact
comparison operation can only be provided
by the end user. Since only he/she knows PAPER II - PRACTICAL – 30 MARKS
which field(s) will be used for doing the
This paper of three hours’ duration will be evaluated
comparison and whether sorting should be in
by the Visiting Examiner appointed locally and
ascending or descending order be given by
the user of the class. approved by CISCE.
Emphasize the difference between the Java The paper shall consist of three programming
language construct interface and the word problems from which a candidate has to attempt any
interface often used to describe the set of one. The practical consists of the two parts:
method prototypes of a class. 1. Planning Session
13. Data structures 2. Examination Session
(a) Basic data structures (stack, queue, circular The total time to be spent on the Planning session and
queue, dequeue); implementation directly the Examination session is three hours.
through classes; definition through an A maximum of 90 minutes is permitted for the
interface and multiple implementations by Planning session and 90 minutes for the Examination
implementing the interface. Conversion of session.
Infix to Prefix and Postfix notations.
Candidates are to be permitted to proceed to the
Basic algorithms and programs using the Examination Session only after the 90 minutes of
above data structures. the Planning Session are over.
Data structures should be defined as abstract Planning Session
data types with a well-defined interface (it is
instructive to define them using the Java The candidates will be required to prepare an
interface construct). algorithm and a hand written Java program to solve
the problem.

ISC Examination Year 2027

9
Examination Session EQUIPMENT
The program handed in at the end of the Planning There should be enough computers to provide for a
session shall be returned to the candidates. The teaching schedule where at least three-fourths of the
candidates will be required to key-in and execute the time available is used for programming.
Java program on seen and unseen inputs individually
on the Computer and show execution to the Visiting Schools should have equipment/platforms such that
Examiner. A printout of the program listing including all the software required for practical work runs
output results should be attached to the answer script properly, i.e. it should run at acceptable speeds.
containing the algorithm and handwritten program.
This should be returned to the examiner. The Since hardware and software evolve and change very
program should be sufficiently documented so that rapidly, the schools may have to upgrade them as
the algorithm, representation and development required.
process is clear from reading the program. Large Following are the recommended specifications as of
differences between the planned program and the now:
printout will result in loss of marks.
The Facilities:
Teachers should maintain a record of all the
assignments done as part of the practical work • A lecture cum demonstration room with a
through the year and give it due credit at the time of MULTIMEDIA PROJECTOR/ an LCD and
cumulative evaluation at the end of the year. Students O.H.P. attached to the computer.
are expected to do a minimum of twenty-five
assignments for the year. • A white board with white board markers should
be available.
EVALUATION:
• A fully equipped Computer Laboratory that
Marks (out of a total of 30) should be distributed as allows one computer per student.
given below:
Continuous Evaluation • Internet connection for accessing the World
Wide Web and email facility.
Candidates will be required to submit a work file
containing the practical work related to programming • The computers should have a minimum of
assignments done during the year. 1 GB RAM and a P IV or higher processor. The
Programming assignments done 10 marks basic requirement is that it should run the
throughout the year (Internal operating system and Java programming system
Evaluation) (Java compiler, Java runtime environment, Java
Programming assignments done 5 marks development environment) at acceptable speeds.
throughout the year (Visiting Examiner) • Good Quality printers.
Terminal Evaluation Software:
Solution to programming problem on 15 Marks
the computer • Any suitable Operating System can be used.
• JDK 6 or later.
Marks should be given for choice of algorithm and
implementation strategy, documentation, correct • Documentation for the JDK version being used.
output on known inputs mentioned in the question
• A suitable text editor. A development
paper, correct output for unknown inputs available environment with a debugger is preferred
only to the examiner. (e.g. BlueJ, Eclipse, NetBeans). BlueJ is
NOTE: recommended for its ease of use and simplicity.
Algorithm should be expressed clearly using any
standard scheme such as a pseudo code.

ISC Examination Year 2027

10
 SAMPLE TABLE FOR PRACTICAL WORK
Assessment of Assessment of the Practical Examination TOTAL MARKS
Practical File (To be evaluated by the Visiting Examiner only) (Total Marks are to
Unique be added and
Identification Internal Visiting Algorithm Java Program with Hard Output entered by the
S. No.
Number (Unique Evaluation Examiner internal Copy Visiting Examiner)
ID) of the candidate 10 Marks 5 Marks Documentation (printout)
3 Marks 7 Marks 2 Marks 3 Marks 30 Marks

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

Name of the Visiting Examiner:_________________________________

Signature: _______________________________
Date:___________________________________

ISC Examination Year 2027

11