top of page

ICSE Class 10 Computer Applications Syllabus 2026-27

ICSE Class 10 Computer Applications Syllabus 2026-27


Board: CISCE | Examination Year: 2028 | Subject: Computer Applications


Exam Structure

Component

Marks

Theory (Written Paper — 2 hours)

100

Internal Assessment (Practical)

100

Total

200

Note: Computer Applications follows a 100 + 100 scheme, NOT the standard 80+20 used by other ICSE subjects. It is a Group III elective subject.

THEORY — 100 Marks


1. Revision of Class IX Syllabus


The following Class IX topics are to be revised:

  1. Introduction to Object Oriented Programming concepts

  2. Elementary Concept of Objects and Classes

  3. Values and Data types

  4. Operators in Java

  5. Data processing in Java

  6. Mathematical Library Methods

  7. Conditional statements in Java

  8. Looping / Iterative statements in Java

  9. Nested for loops


2. Library Classes

Introduction to wrapper classes, methods of wrapper class and their usage with respect to numeric and character data types. Auto boxing and Unboxing in wrapper classes.

Class as a composite type, distinction between primitive data type and composite data type or class types. Class may be considered as a new data type created by the user, that has its own functionality. The distinction between primitive and composite types should be discussed through examples. Show how classes allow user defined types in programs. All primitive types have corresponding class wrappers.

Introduce Auto boxing and unboxing with their definition and simple examples.


The following methods are to be covered (exact CISCE list):

Method

Return Type

parseInt(String)

int

parseLong(String)

long

parseFloat(String)

float

parseDouble(String)

double

isDigit(char)

boolean

isLetter(char)

boolean

isLetterOrDigit(char)

boolean

isLowerCase(char)

boolean

isUpperCase(char)

boolean

isWhitespace(char)

boolean

toLowerCase(char)

char

toUpperCase(char)

char


3. Arrays

Definition of an array, types of arrays, declaration, initialization and accepting data of single dimensional arrays, accessing the elements of single dimensional arrays.

Arrays and their uses, programs related to accessing the elements of the array [all data types], sorting techniques — selection sort and bubble sort; Search techniques — linear search and binary search, Array as a composite type, length statement to find the size of the array.

Sorting and searching techniques are specified for single dimensional array only.

4. String Handling

String class, methods of String class, implementation of String class methods, String array.

The following String class methods are to be covered (exact CISCE list):

Method

Return Type

trim()

String

toLowerCase()

String

toUpperCase()

String

length()

int

charAt(int)

char

indexOf(char)

int

lastIndexOf(char)

int

concat(String)

String

equals(String)

boolean

equalsIgnoreCase(String)

boolean

compareTo(String)

int

compareToIgnoreCase(String)

int

replace(char oldChar, char newChar)

String

substring(int beginIndex)

String

substring(int beginIndex, int endIndex)

String

startsWith(String)

boolean

endsWith(String)

boolean

valueOf(all types)

String

Programs based on the above methods, extracting and modifying characters of a string, alphabetical order of the strings in an array [Bubble and Selection sort techniques], searching for a string using linear search technique.


5. Class as the Basis of all Computation

Objects and Classes:

Objects encapsulate state and behavior — numerous examples; member variables; attributes or features. Variables define state; member methods; Operations/methods/messages/methods define behavior. Classes as abstractions for sets of objects; class as an object factory; primitive data types, composite data types. Variable declarations for both types; difference between the two types. Objects as instances of a class.

Consider real life examples for explaining the concept of class and object.


6. Constructors

Definition of Constructor, characteristics, types of constructors, use of constructors, constructor overloading.

Default constructor, parameterized constructor, constructor overloading. Difference between constructor and method.


7. Custom Methods

Need of methods, syntax of methods, forms of methods, method definition, method calling, method overloading, declaration of methods.

Ways to define a method, ways to invoke the methods:

  • Call by value (with programs)

  • Call by reference (only definition with an example)

Object creation — invoking the methods with respect to use of multiple methods with different names to implement modular programming, using data members and member methods. Actual parameters and formal parameters. Declaration of methods — static and non-static, method prototype/signature. Pure and impure methods. Pass by value (with programs) and pass by reference (only definition with an example). Returning values from the methods, use of multiple methods and more than one method with the same name (polymorphism — method overloading).

FLAG: Call by reference / pass by reference is marked "only definition with an example" — programs based on call by reference are NOT required in theory.

8. Disruptive Technologies

Definition, types and uses of each of the following:

  • Cyber hygiene

  • Cyber laws

  • Artificial intelligence

  • Block chain technology

  • Internet of things

  • Robotics

  • 5G technology

  • Cloud computing

"A project on this topic should be done." — A written project on Disruptive Technologies is a mandatory component of the Internal Assessment.

INTERNAL ASSESSMENT — 100 Marks


Programming Assignments

Students must complete a minimum of 15 laboratory assignments during the whole year, along with one written project on Disruptive Technologies.

Assignments must embody one or more concepts discussed in theory. Good assignments should require design, implementation and testing.


Sample assignment areas (indicative, not exhaustive):


Custom Methods

  • Programs depicting the concept of pure, impure, static, non-static methods, void and return

  • Programs based on overloaded methods including iterative, selection, character and strings

  • Programs involving data members, member methods invoking the methods with respect to the object created

  • Slab based programs with object creation


Constructors

  • Programs based on different types of constructors mentioned in the scope of the syllabus

  • Outputs based on constructor overloading


Library Classes

  • Programs based on conversion of String to numeric and vice versa

  • Converting character to lower case or uppercase

  • Outputs based on all the methods mentioned in the scope of the syllabus

  • Programs to check whether a given character is an uppercase/lowercase/digit etc.


Arrays

  • Accessing the elements of an array

  • Sort techniques mentioned in the scope of the syllabus for arrays of all data types

  • Search techniques mentioned in the scope of the syllabus for arrays of all data types

  • Count the number of even/odd numbers, sum of even/odd numbers

  • Display the array in reverse order, square root of each element

  • Count number of upper case letters and lower case letters in a character array, sum of ASCII code of each character in an array


String Handling

  • Outputs based on all the string methods mentioned in the scope of the syllabus

  • Programs based on extracting the characters from a given string and manipulating the same


Evaluation — Internal Assessment (100 Marks)

Evaluator

Assignments

Written Project

Total

Subject Teacher (Internal Examiner)

40 marks

10 marks

50 marks

External Examiner

40 marks

10 marks

50 marks

Grand Total

80 marks

20 marks

100 marks

Note: The External Examiner shall be nominated by the Head of the School and may be a teacher from the faculty, but not teaching the subject in the relevant section/class. For example, a Computer Teacher of Class IX and above may be deputed as External Examiner for Class X.

Written Project Evaluation Criteria (10 marks per examiner):

Criteria

Marks

Introduction

2

Content

4

Presentation

2

Conclusion/Summary

2

Total

10

Assignment Evaluation Criteria (40 marks per examiner):

Criteria (Total — 40 marks)

Excellent

Good

Fair

Poor

Class design (10 marks)

10

8

6

4

Variable description (10 marks)

10

8

6

4

Coding and Documentation (10 marks)

10

8

6

4

Execution OR Output (10 marks)

10

6

2

2

FLAG: Execution/Output carries 10 marks (not 20). Good = 6, Fair = 2, Poor = 2.

The total marks obtained out of 100 (80 marks assignment + 20 marks written project) are to be sent to CISCE by the Head of the school via the CAREERS portal.


Equipment Requirements (as specified by CISCE)

  • Minimum 4 periods of ~40 minutes duration per week: 2 periods lecture/demonstration + 2 periods assignments/practical

  • At least ¾ of available time to be used for programming and assignments

  • One computer per student in laboratory

  • Minimum 2 GB RAM, at least P-V or Equivalent Processor

  • Multimedia Projector/LCD + OHP attached to computer (demonstration room)

  • White board with white board markers

  • Good quality printers; scanner; webcam/digital camera (if possible)


Software

  • Any suitable Operating System

  • BlueJ environment (version 5.4.2 or higher) compatible with JDK 11 or higher, OR any other editor/IDE compatible with JDK 11 or higher

  • Use latest versions of software


Flags Summary

#

Flag

Details

1

Call by reference / pass by reference

"Only definition with an example" — programs NOT required

2

Sorting & searching

Specified for single dimensional arrays only

3

Double dimensional arrays

NOT in the official syllabus — removed entirely from 2028 document

4

Marks scheme

100 + 100 (NOT 80+20) — Computer Applications is a Group III subject

5

Unit 7 name

"Custom Methods" — NOT "User-defined Methods"

6

Unit 8

"Disruptive Technologies" — NOT "Encapsulation and Inheritance"

7

Minimum assignments

15 (not 20) + 1 written project on Disruptive Technologies

8

Execution/Output marks

10 marks (not 20); Good=6, Fair=2, Poor=2

9

Equipment

2 GB RAM, P-V processor, BlueJ 5.4.2+, JDK 11+ (not 1GB/P-IV/BlueJ 3.2/JDK 5.0)

10

Written project

Mandatory — 20 marks total (10 internal + 10 external); marked on Introduction/Content/Presentation/Conclusion


bottom of page