★★★★★
"The one step solution for my son. Modern Age Coders make learning coding so simple that kids love it. The teachers explain complex concepts clearly with practical exercises and interactive content."
Ria Mukherjee
Parent
ICSE Class 10 · Computer Applications (Java) · Revision notes 2027
These ICSE Computer Applications notes cover the eight Class 10 chapters in the order the 2027 syllabus lists them. Each chapter is one sheet: the terms you must define in a line, the rules Java follows, a short program that was compiled and run in Java 21, and the slip that most often costs a mark. Use them after a chapter is taught, not instead of it. In our live mini batch every chapter ends with a timed Section A set and one Section B program built from the same sheet.
Live online · 8 chapters, 8 sheets · 2027 syllabus order · Java examples run in BlueJ · Section A and B practice weekly · first class free
Start here
The ICSE Java course where each sheet on this page is taught, practised and tested live, the Class 11 and 12 Computer Science course for students heading to ISC, and the data structures course for the student who finishes the arrays chapter wanting more.

The batch / ICSE CA
All eight chapters in syllabus order in a mini batch of up to six, with a Section A set and a BlueJ program closing each chapter.
Open the course →
Next step / ISC
For students going on to ISC Computer Science, where classes, arrays and strings are the starting point rather than the end.
Open the course →
Beyond the syllabus / DSA
For the student who liked binary search and sorting and wants to see why some methods are faster than others.
Open the course →Ans. The short version
ICSE Computer Applications notes for Class 10 should follow the eight chapters of the 2027 syllabus in order: Revision of Class IX, Class as the basis of all computation, User-defined methods, Constructors, Library classes, Encapsulation, Arrays and String handling. Good notes give each chapter one sheet: one-line definitions for Section A, the rules Java applies, one short tested program, and the common slip. The paper is two hours for 100 marks, 40 compulsory in Section A and four of six 15-mark programs in Section B. Modern Age Coders revises every chapter live in a Tuesday and Wednesday mini batch in India, or one to one.
Q1. What are the chapters, and in what order?
There are eight, and the 2027 syllabus lists them in this order. The order matters for revision: every chapter leans on the one before it, so a gap in chapter 3 shows up again in chapters 4, 7 and 8.
| # | Chapter | What the sheet holds | Where it scores |
|---|---|---|---|
| 1 | Revision of Class IX syllabus | OOP terms, data types, operators, input, Math methods, if, switch, loops | Most of the Section A outputs and loop counts |
| 2 | Class as the basis of all computation | Class, object, state, behaviour, primitive and composite types | Definitions and one-mark MCQs |
| 3 | User-defined methods | Prototype, signature, parameters, return, pure and impure, overloading | Section B overloading programs |
| 4 | Constructors | Default and parameterised constructors, constructor against method | Class skeleton programs, difference questions |
| 5 | Library classes | Wrapper classes, parse and valueOf, Character tests, autoboxing | Two-mark outputs, string and menu programs |
| 6 | Encapsulation | Access specifiers, scope of variables | Definitions and "will it compile" questions |
| 7 | Arrays | 1D and 2D arrays, linear and binary search, bubble and selection sort | A Section B program in almost every paper |
| 8 | String handling | String methods, character-by-character processing | The other near-certain Section B program |
Recursion is not in the 2027 Computer Applications syllabus, so it has no sheet here. Each unit is explained with its marks pattern on the ICSE Computer Applications syllabus page.
Q2. What should the first two sheets say?
Chapter 1 is the Class 9 course in compressed form, and the paper treats it as fully examinable. Chapter 2 then names the idea everything else is built on: a class is a blueprint, and an object is one thing made from it.
int marks = 87;
char grade = marks >= 90 ? 'A'
: marks >= 75 ? 'B' : 'C';
int sum = 0;
for (int d = 4721; d > 0; d /= 10)
sum += d % 10;
System.out.println(grade + " " + sum);
// Output: B 14
Two Class 9 habits in seven lines: a nested ternary read right to left, and a digit loop that peels the last digit with % 10 and drops it with / 10.
| Term | The one-line note |
|---|---|
| Data types | Eight primitives: byte, short, int, long, float, double, char, boolean. char is 2 bytes in Unicode. |
| Type conversion | Implicit widens on its own (int to double); explicit needs a cast and may lose data. |
| Precedence | Unary, then * / %, then + -, then relational, then &&, then ||, then ?:, then assignment. |
| Input | Scanner: nextInt, nextDouble, next for one word, nextLine for a whole line. |
| Math methods | sqrt, cbrt, pow, ceil, floor return double; round of a double returns long. |
| Loops | for and while test first (entry controlled); do-while runs once before testing (exit controlled). |
The slip: writing 4 for Math.sqrt(16). The answer is 4.0, and the missing decimal is marked wrong. Students whose Class 9 base is thin should start with the Class 9 Java revision for Class 10 before anything else.
class Lamp {
boolean on; // state
int watts; // state
void toggle() { // behaviour
on = !on;
}
}
// in main:
Lamp desk = new Lamp();
desk.watts = 9;
desk.toggle();
System.out.println(desk.on + " " + desk.watts);
// Output: true 9
The object starts with default values (false and 0). One call to toggle changes its state.
| Term | The one-line note |
|---|---|
| Class | A user-defined data type that describes what its objects hold and do. |
| Object | An instance of a class, made with new, with its own copy of the instance variables. |
| State | The values held in the data members at a moment. |
| Behaviour | What the methods let the object do. |
| Primitive type | Built in, holds one value, fixed size: int, char, double and the rest. |
| Composite type | Built from other types: a class, an array, a String. |
The slip: calling a class an object. The class is the plan; each object made from it is separate, so changing desk.watts changes nothing in any other Lamp.
Q3. What do the middle four chapters need on paper?
These four chapters are where Section A finds its definitions and where Section B finds its class skeletons. Each sheet below is short because the terms are precise: learn the exact wording and the marks follow.
static int area(int s) { return s * s; }
static int area(int l, int b) { return l * b; }
static double area(double r) { return 3.14 * r * r; }
// in main:
System.out.println(area(5) + " " + area(4, 6)
+ " " + area(2.0));
// Output: 25 24 12.56
Java picks the version whose parameter list matches the call. The return type alone can never tell two versions apart.
| Term | The one-line note |
|---|---|
| Prototype | The first line of a method: access, return type, name, parameter list. |
| Signature | The name with the number, type and order of the parameters. |
| Actual and formal | Actual parameters are in the call; formal parameters are in the definition. |
| Pure method | Returns a value and changes nothing outside itself. |
| Impure method | Changes the object's data or an array it was given. |
| Overloading | Same name, different parameter lists, in one class. |
Overloading programs in board format are worked on user-defined methods and overloading.
class Ticket {
String name;
int seats;
Ticket() { name = "Guest"; seats = 1; }
Ticket(String n, int s) { name = n; seats = s; }
}
// in main:
Ticket t1 = new Ticket();
Ticket t2 = new Ticket("Asha", 3);
System.out.println(t1.name + " " + t1.seats + " "
+ t2.name + " " + t2.seats);
// Output: Guest 1 Asha 3
Two constructors in one class is constructor overloading. Which one runs depends on the arguments after new.
| Term | The one-line note |
|---|---|
| Constructor | A member with the class's name and no return type, run automatically when an object is made. |
| Default constructor | Takes no parameters; Java supplies one only if you write none. |
| Parameterised | Takes parameters and sets the data members from them. |
| Against a method | No return type, same name as class, called by new; a method is called by name. |
The slip: writing void before a constructor. It then becomes an ordinary method and never runs on new. More on ICSE constructor questions.
String s = "42";
int n = Integer.parseInt(s) + 8;
Integer boxed = n; // autoboxing
char c = 'g';
System.out.println(n + " " + Character.toUpperCase(c)
+ " " + Character.isDigit('7') + " " + (boxed + 1));
// Output: 50 G true 51
boxed + 1 unboxes the Integer back to an int, adds, and prints 51.
| Term | The one-line note |
|---|---|
| Wrapper class | A class that holds one primitive as an object: Integer, Double, Character, Boolean and the rest. |
| Autoboxing | Java turns a primitive into its wrapper object on its own. |
| Unboxing | Java takes the primitive back out of the wrapper on its own. |
| parseInt | Turns a String of digits into an int; "4a" throws an error at run time. |
| Character tests | isLetter, isDigit, isLetterOrDigit, isUpperCase, isLowerCase, isWhitespace. |
Every wrapper method in the syllabus, with its return type, is on wrapper and library classes.
class Account {
private double balance;
public void deposit(double amt) {
if (amt > 0) balance += amt;
}
public double getBalance() { return balance; }
}
// in main:
Account acc = new Account();
acc.deposit(500);
acc.deposit(-200);
System.out.println(acc.getBalance());
// Output: 500.0
The negative deposit is refused by the method, and no outside code can write to balance directly. That guard is the point of encapsulation.
| Term | The one-line note |
|---|---|
| Encapsulation | Wrapping data and the methods that use it into one class, and hiding the data. |
| private | Visible only inside its own class. |
| default (no keyword) | Visible inside the same package. |
| protected | Same package, plus subclasses in other packages. |
| public | Visible everywhere. |
| Scope | Local: inside its block. Instance: one per object. Class (static): one shared by all objects. |
Scope questions with worked examples are on encapsulation and access specifiers.
Q4. What goes on the last two sheets?
Arrays and strings are revised last because they use everything before them, and because together they supply the bulk of Section B. Both chapters come down to one skill: walking through a sequence one index at a time without stepping off the end.
int[] a = {3, 8, 15, 21, 30, 42};
int key = 21, lo = 0, hi = a.length - 1, pos = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
if (a[mid] == key) { pos = mid; break; }
else if (a[mid] < key) lo = mid + 1;
else hi = mid - 1;
}
System.out.println(pos);
// Output: 3
mid is 2 (15, too small), then 4 (30, too big), then 3 (found). Three checks instead of four, and the gap grows with the array.
| Term | The one-line note |
|---|---|
| Array | A set of values of one type under one name, reached by index from 0 to length - 1. |
| length | A field, no brackets: a.length. For a 2D array m, m.length is rows and m[0].length is columns. |
| Linear search | Checks each element in turn; works on any array. |
| Binary search | Halves a sorted array each step; needs the array in order. |
| Bubble sort | Swaps neighbours that are out of order; the largest settles at the end each pass. |
| Selection sort | Finds the smallest of the unsorted part and swaps it into place once per pass. |
The slip: a loop that runs while i <= a.length. The last index is a.length - 1, and the extra pass throws ArrayIndexOutOfBoundsException. Full search and sort programs are on sorting and searching programs.
String w = "Level";
String r = "";
for (int i = w.length() - 1; i >= 0; i--)
r += w.charAt(i);
System.out.println(r + " " + r.equalsIgnoreCase(w)
+ " " + r.equals(w));
// Output: leveL true false
The reverse differs only in case, so it is a palindrome when case is ignored and not one when case counts. Read the question for which it wants.
| Method | The one-line note |
|---|---|
| length(), charAt(i) | Number of characters; the character at index i. |
| indexOf, lastIndexOf | First or last position of a character or substring, -1 if absent. |
| substring(a, b) | Characters from a up to, not including, b. |
| equals, equalsIgnoreCase | Compare contents; return boolean. |
| compareTo | Returns 0, a negative or a positive int by dictionary order. |
| toUpperCase, trim, replace, concat | Return a new String; the original never changes. |
The slip: comparing two Strings with ==, which checks whether they are the same object, not the same text. Word, vowel and palindrome programs are worked on ICSE Class 10 string programs.
Q5. How should a student revise from notes?
Read a sheet, close it, and write it back from memory. Notes that are only read feel familiar on the day and then fail under the clock; notes that are rewritten stay.
Take one chapter, cover the right-hand column of the table, and say each definition aloud. Any you cannot say in one sentence go on a short list for the next day.
Run each program in BlueJ, then change one value and predict the new output before running it again. That small step turns a note into an output question.
Chapters 3, 4, 7 and 8 each deserve one full Section B answer in your own hand, with a variable description table, before the chapter counts as revised.
Once all eight sheets are done, revise two unrelated chapters together. The paper never asks them in order, and switching is what the real Section A feels like.
Collect every "the slip" line from this page, add your own from mock tests, and read that single page the night before the exam.
Two hours for 100 marks leaves about a minute a mark. Timed mock papers in the last six weeks tell you which sheet needs one more pass.
Q6. How is each chapter revised in class?
Each sheet on this page is the summary a student should be able to write after a week of live work on that chapter, not a substitute for the week.
At the 5:30 PM IST class the teacher builds the chapter's sheet on screen with the group, asking each student to define a term before it is written down, then runs the example in BlueJ.
Ten short questions from that chapter only: definitions, outputs, a difference, an error to find. Answers are marked on screen against the way the board credits them.
At the 8:00 PM IST class each student writes a Section B program from the chapter, with comments and a variable description, and the teacher reads it line by line.
The last part of Wednesday is kept for questions on any earlier chapter, so a gap is caught before the next chapter depends on it.
When all eight chapters are done, the batch moves to complete two-hour mock papers marked like the board, and each mistake is sent back to the sheet it came from.
With no more than six students, every definition and every program gets read by the teacher, not sampled.
Batch or personalised: you choose
The eight sheets, the timed sets and the BlueJ programs are the same either way. In India a family can pick the fixed Tuesday and Wednesday mini batch or a private slot; ICSE students outside India are taught one to one. Monthly billing, no admission fee.
Option 1 · Fixed batch timings
₹2,999
per month, two live classes a week
Option 2 · Choose your own timing
₹4,999
per month, one private class a weektwo private classes a week, at a time set with you
Outside India: the ICSE Computer Applications course runs as personalised one to one, two private classes a week at a time set in your own time zone. The mini batch is taught for families in India.
A student who has been taught every chapter but forgets definitions and slips on outputs usually needs a short run of one to one sessions on the weak sheets. A student who wants the whole syllabus revised in order, with a program every week, does better in the two batch classes. Fees appear in your own currency.
Studying outside India?
ICSE schools outside India teach the same eight chapters for the same Computer Applications paper. Abroad, the chapter sheets are revised one to one in an evening slot that suits the student's own clock.
| Where you live | Time difference | Usual class window, local time | Format |
|---|---|---|---|
| India (IST) every Indian city | IST | Tue 5:30 PM, Wed 8:00 PM | Mini batch or 1-on-1 |
| United Arab Emirates Dubai, Sharjah | 1 h 30 min behind India | 3:00 PM to 9:00 PM | Personalised 1-on-1 |
| Indonesia and Thailand West Java, Bangkok area | 1 h 30 min ahead of India | 3:30 PM to 9:00 PM | Personalised 1-on-1 |
| Singapore Singapore | 2 h 30 min ahead of India | 3:30 PM to 9:00 PM | Personalised 1-on-1 |
The slot is fixed after the free demo and can shift around school exams. Families overseas can read more on ICSE Computer Applications classes in the Gulf and abroad.
What families say
Real reviews from real families. We neither write nor commission them.
★★★★★
"The one step solution for my son. Modern Age Coders make learning coding so simple that kids love it. The teachers explain complex concepts clearly with practical exercises and interactive content."
Ria Mukherjee
Parent
★★★★★
"Modern Age Coders has been a game-changer for me. I struggled to grasp IT concepts and coding before joining, but their classes transformed everything. I can now confidently write complex programs with ease."
Samriddha Mondal
Student
★★★★★
"One of the most wonderful education centres out there. Education is not limited to school syllabus but focuses on skill development."
Vansh Agarwal
Student
★★★★★
"My child Dhairya is really enjoying the Modern Age Coders classes. This is his first online class and he eagerly looks forward to it. I can already see his improvement, and the teachers are very cooperative."
Sonam Oswal
Parent of Dhairya
★★★★★
"Modern Age Coders have wonderful teachers who teach in a clear, easy and practical way. The teacher boosts students' confidence and inspires them to learn without hesitation."
Sonu Goyal
Parent
★★★★★
"I highly recommend this computer coding class! The teachers are incredibly knowledgeable and passionate about coding."
Ritu Kedia
Parent
The rest of the Class 10 series
Every page in the ICSE Class 10 Computer Applications series, grouped by what you need: classes, each chapter, Section B programs, question practice, notes and revision, and the exam itself.
CBSE Class 10 AI (417): The Mon and Wed 9 PM AI batch CBSE AI 417 syllabus explained CBSE AI important questions Sample paper and mock tests
Questions about the notes
Eight in the 2027 syllabus: Revision of Class IX syllabus, Class as the basis of all computation, User-defined methods, Constructors, Library classes, Encapsulation, Arrays and String handling. Textbooks sometimes split the first one into several smaller chapters, such as operators, input and loops, so a book may show more chapter numbers for the same syllabus.
For marks, arrays and string handling, because between them they supply most Section B programs. For understanding, the Class IX revision chapter, because Section A outputs and loop counts come from it and every program depends on it. User-defined methods and constructors come next, since class skeleton questions need both.
Notes are a revision tool, not the whole preparation. They help a student recall definitions and rules quickly. Marks in Section B come from writing complete programs by hand, so each sheet should be followed by at least one program written without help and then run in BlueJ to check it.
No. Recursion does not appear in the 2027 Class 10 Computer Applications syllabus, so these notes leave it out. Some older books and websites still carry it as an extra topic. For the board paper, spend that time on 2D arrays and wrapper classes, which are in.
Spend the first five days on two chapters a day using one sheet each, writing every definition from memory and one program per day. Use day six for a full timed paper and day seven for the mistakes it showed. Do not start new topics in the final week; deepen the ones you have.
A class is the design that says what data and methods its objects will have. An object is one instance created from that design with new, holding its own values. One class can produce many objects, and changing the data of one object does not change any other.
Not word for word, but the key terms must be present. A definition of encapsulation that does not mention binding data with methods and hiding the data loses marks, however well it is phrased. Learn the one-line version on each sheet and you will have the words examiners look for.
The mathematical library methods from Class 9 carry into the revision chapter: Math.pow, sqrt, cbrt, ceil, floor, round, abs, max, min and random. The marks usually turn on the return type. Most of them return double, round of a double returns long, and abs, max and min follow the type they are given.
This page is meant to be used on screen or printed from your browser. Better still, copy each sheet by hand into your own notebook: writing it once is itself revision. The tables are short on purpose, so the whole set fits on eight sides of paper.
Yes. The mini batch covers one chapter a week in syllabus order: the sheet on Tuesday at 5:30 PM IST with a timed Section A set, and a full program on Wednesday at 8:00 PM IST. Students abroad, or those whose timings clash, take the same plan one to one at a time the family chooses.
Start
In the free demo your child picks a chapter they find hard. The mentor builds that chapter's sheet with them, asks for definitions before giving them, runs the example in BlueJ, and ends with three quick questions. You then hear plainly which chapters look secure and which need work, and whether the mini batch or one to one fits better.
Want to practise first? Try the chapter-wise worksheets with answers or the difference between questions.
WhatsApp us · +91 91233 66161 · connect@modernagecoders.com
Every class is live video. The form requests a callback and reserves nothing.
A full live class of about 45 to 60 minutes at a slot you pick, with a written skill report and learning roadmap on WhatsApp afterwards. The fee is adjusted against your first month if you enrol.
Book a priority demo