ICSE Class 9 Computer Applications Syllabus 2024-25
CISCE has released the Latest Updated Syllabus of the New Academic Session 2024-25, for ICSE Class 9 Computer Applications.
ICSE Class 9 Computer Applications Syllabus has been revised and updated for the new session 2024-25. It’s very important for both Teachers and Students to understand the changes and strictly follow the topics covered in ICSE Class 9 Computer Applications Syllabus 2024-25.
We have also updated Oswal Publishers Books as per the Latest Paper Pattern prescribed by CISCE Board for ICSE Class 9 Computer Applications Syllabus 2024-25.
Students can directly access the ICSE Computer Applications Syllabus for Class 9 of the academic year 2024-25 by clicking on the link below.
PDF download links to the latest ICSE Class 9 Computer Applications Syllabus for 2024-25 academic session
Please Click on Download Now
Latest ICSE Class 9 Computer Applications Syllabus 2024-25
There will be one written paper of two hours duration carrying 100 marks and Internal Assessment of 100 marks.
Theory – 100 Marks
Introduction to Object Oriented Programming concepts
Principles of Object Oriented Programming, (Difference between Procedure Oriented and Object oriented). All the four principles of Object Oriented Programming should be defined and explained using real life examples (Data abstraction, Inheritance, Polymorphism, Encapsulation)
- Principles of Object Oriented Programming, (Difference between Procedure Oriented and Object oriented). All the four principles of Object Oriented Programming should be defined and explained using real life examples (Data abstraction, Inheritance, Polymorphism, Encapsulation). Introduction to JAVA - Types of java programs – Applets and Applications, Java Compilation process, Java Source code, Byte code, Object code, Java Virtual Machine (JVM), Features of JAVA. Definition of Java applets and Java applications with examples, steps involved in compilation process, definitions of source code, byte code, object code, JVM, features of JAVA - Simple, Robust, secured, object oriented, platform independent, etc.
2. Elementary Concept of Objects and Classes
100 marks. THEORY – 100 Marks 1. Introduction to Object Oriented Programming concepts (i) (ii) Principles of Object Oriented Programming, (Difference between Procedure Oriented and Object oriented). All the four principles of Object Oriented Programming should be defined and explained using real life examples (Data abstraction, Inheritance, Polymorphism, Encapsulation). Introduction to JAVA - Types of java programs – Applets and Applications, Java Compilation process, Java Source code, Byte code, Object code, Java Virtual Machine (JVM), Features of JAVA. Definition of Java applets and Java applications with examples, steps involved in compilation process, definitions of source code, byte code, object code, JVM, features of JAVA - Simple, Robust, secured, object oriented, platform independent, etc. 2. Elementary Concept of Objects and Classes Modelling entities and their behaviour by objects, a class as a specification for objects and as an object factory, computation as message passing/method calls between objects (many examples should be done to illustrate this). Objects encapsulate state (attributes) and have behaviour (methods). Class as a user defined data type.
A class may be regarded as a blueprint to create objects. It may be viewed as a factory that produces similar objects. A class may also be considered as a new data type created by the user, that has its own functionality.
3.Values and data types
Character set, ASCII code, Unicode, Escape sequences, Tokens, Constants and Variables, Data types, type conversions.
Escape sequences [\n, \t, \\, \”, \’], Tokens and its types [keywords, identifiers, literals, punctuators, operators], primitive types and non-primitive types with examples, Introduce the primitive types with size in bits and bytes, Implicit type conversion and Explicit type conversion.
4.Operators in Java
Forms of operators, Types of operators, Counters, Accumulators, Hierarchy of operators, ‘new’ operator, dot ( . ) operator.
Forms of operators (Unary, Binary, Ternary), types of operators (Arithmetic, Relational, Logical, Assignment, Increment, Decrement, Short hand operators), Discuss precedence and associativity of operators, prefix and postfix, Creation of dynamic memory by using new operator, invoking members of using dot operator, Introduce System.out.println() and System.out.print() for simple output.
5. Input in Java
Initialization, Parameter, introduction to packages, Input streams (Scanner Class), types of errors, types of comments
Initialization – Data before execution, Parameters – at the time of execution, input stream – data entry during execution – using methods of Scanner class [nextShort(), nextInt( ), nextLong( ), nextFloat ( ), nextDouble( ), next( ), nextLine( ), next ( ) .charAt(0) ]
Discuss different types of errors occurring during execution and compilation of the program (syntax errors, runtime errors and logical errors).Single line comment (//) and multiline comment (/* … */ )
6. Mathematical Library Methods
Introduction to package java.lang [ default ], methods of Math class. pow(x,y), sqrt(x), cbrt(x), ceil(x), floor(x), round (x), abs(a), max(a, b), min(a,b), random( ).
Java expressions – using all the operators and methods of Math class.
7.Conditional constructs in Java
Application of if, if else, if else if ladder, switch-case, default, break. .
if, if else, if else if, Nested if, switch case, break statement, fall through condition in switch case, Menu driven programs, System.exit(0) - to terminate the program.
8. terative constructs in Java
Definition, Types of looping statements, entry controlled loops [ for, while], exit controlled loop [do while] , variations in looping statements, and Jump statements.
Syntax of entry and exit controlled loops, break and continue, Simple programs illustrating all three loops, inter conversion from for – while – do while, finite and infinite, delay, multiple counter variables (initializations and updations). Demonstrate break and continue statements with the help of loops. Loops are fundamental to computation and their need should be shown by examples.
9. Nested for loops
Introduce nested loops through some simple examples. Demonstrate break and continue statements with the help of nested loops.
Programs based on nested loops [ rectangular, triangular [right angled triangle only] patterns], series involving single variable.
10. Computing and Ethics
Ethical Issues in Computing.
Intellectual property rights; protection of individual’s right to privacy; data protection on the internet; protection against Spam; software piracy, cybercrime, hacking, protection against malicious intent and malicious code. The stress should be on good etiquette and ethical practices.
Internal Assessment - 100 Marks
This segment of the syllabus is totally practical oriented. The accent is on acquiring basic programming skills quickly and efficiently.
Programming Assignments (Class IX)
Students are expected to do a minimum of 20 assignments during the whole year to reinforce the concepts studied in the class.
Suggested list of Assignments:
he laboratory assignments will form the bulk of the course. Good assignments should have problems which require design, implementation and testing. They should also embody one or more concepts that have been discussed in the theory class. A significant proportion of the time has to be spent in the laboratory. Computing can only be learnt by doing.
The teacher-in-charge should maintain a record of all the assignments done as a part of practical work throughout the year and give it due credit at the time of cumulative evaluation at the end of the year. 158
Some sample problems are given below as examples. The problems are of varying levels of difficulty:
- Programs using Assignment statements. Example: Calculation of Area / Volume / Conversion of temperature / Swapping of values etc.
- Programs based on– Input through parameters. Example: Implementation of standard formula etc.
- Programs based on – Input through Scanner class. Example: Implementation of standard formula etc.
- Programs based on Mathematical methods. Example: larger/smaller of two numbers, cube root, square root, absolute value, power, etc.
- Programs based on if, if else, if else if ladder, nested if etc
- if programs
- Larger / smaller of two numbers.
- To check divisibility of a number, etc.
- if - else programs
- Odd or even number
- Eligibility to vote
- Upper case or lower case
- Positive or negative number
- Vowel or Consonant
- Buzz number etc.
- if-else-if programs
- Programs based on discount/interest/ bonus/ taxes/ commission.
- Programs based on slab system.
- Programs based on Nested if.
- Programs on Double dimensional arrays as given in the scope of the syllabus.
- if programs
- Programs on switch case.
- (a)Day of a week (b) Name of the month (c) Names of the seasons (d) Calculator (e) Vowel or consonant etc.
7. Programs based on Looping Statement
- Programs based on for looping statement.
- Programs based on printing simple series, summation of simple series, product of simple series.
- Prime number, perfect number, composite number, Fibonacci series. Lowest Common Multiple (LCM), Highest Common Factor (HCF) etc.
- To find the biggest and smallest number from n number of entered numbers.
- Program based on while loop like Armstrong number, Spy number, Niven number, Palindrome number, etc.
8. Programs based on nested loops [rectangular, triangular(right angled triangle only) patterns], series involving single variable.
9. Generate first n multiples of numbers from 1 to the limit input by the user.
10. Menu Driven programs.
Important: This list is indicative only. Teachers and students should use their imagination to create innovative and original assignments.
Evaluation
Proposed Guidelines for Marking
The teacher should use the criteria below to judge the internal work done. Basically, four criteria are being suggested: class design, coding and documentation, variable description and execution or output. The actual grading will be done by the teacher based on his/her judgment. However, one possible way: divide the outcome for each criterion into one of 4 groups: excellent, good, fair/acceptable, poor/unacceptable, then use numeric values for each grade and add to get the total.
Class design:
Has a suitable class (or classes) been used? Are all attributes with the right kinds of types present? Is encapsulation properly done? Is the interface properly designed?
Coding and Documentation:
Is the coding done properly? (choice of names, no unconditional jumps, proper organization of conditions, proper choice of loops, error handling code layout). Is the documentation complete and readable? (class documentation, variable documentation, method documentation, constraints, known bugs – if any).