ISC EXAM CLASS 12TH LATEST UPDATE

Finally, wait is over and The Council for the Indian School Certificate Examinations (CISCE) has officially released the date sheet for ISC (Class 12) board examinations for 2025. This year class 12th board exam will be started from 13 February 2025 and will last upto 05 April 2025, it will take around 52 days to complete the class 12th board exam. The first exam will be held on 13 February 2025 for Environmental Science subject and the last exam will be held on 05 April 2025 for Art subject. The Indian School Certificate Examination results will be declared in the month of May.

Official Syllabus

There will be two papers in the subject:

Paper I: Theory of 3 hours and of 70 marks

Paper II: Practical of 3 hours and of 30 marks

PAPER I –THEORY – 70 MARKS

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

1. Boolean Algebra

(a) Propositional logic, well-formed formulae, truth values and interpretation of well-formed formulae (wff), truth tables, satisfiable, unsatisfiable, and valid formulae. Equivalence laws and their use in simplifying wffs.

(b) Binary valued quantities; basic postulates of Boolean algebra; operations AND, OR, and NOT; truth tables.

(c) Basic theorems of Boolean algebra (e.g. duality, idempotence, commutativity, associativity, distributivity, operations with 0 and 1, complements, absorption, involution); De Morgan’s theorem and its applications; reducing Boolean expressions to the sum of products and product of sums forms; Karnaugh maps (up to four variables).

2. Computer Hardware

(a) Elementary logic gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and their use in circuits.

(b) Applications of Boolean algebra and logic gates to half adders, full adders, encoders, decoders, multiplexers, NAND, and NOR as universal gates.

SECTION B

The programming element in the syllabus (Sections B and C) 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, and ease of use and because it is very well suited for an ‘objects first’ approach.

3. Implementation of algorithms to solve problems

The students are required to do lab assignments in the computer lab concurrently with the lectures. Programming assignments should be done such that each major topic is covered in at least one assignment. Assignment problems should be designed so that they are sufficiently challenging. Students must do algorithm design, address correctness issues, implement and execute the algorithm in Java and debug where necessary.

4. Programming in Java

(Review of Class XI Sections B and C) -

Note that items 4 to 13 should be introduced almost simultaneously along with classes and their definitions.

While reviewing, ensure that new higher-order problems are solved using these constructs.

5. Objects

(a) Objects as data (attributes) + behavior (methods); object as an instance of a class. Constructors.

(b) Analysis of some real-world programming examples in terms of objects and classes.

(c) Basic input/output using Scanner from JDK; input/output exceptions. Tokens in an input stream, the concept of whitespace, extracting tokens from an input stream (String Tokenizer class).

6. Primitive values, Wrapper classes, Types, and casting Primitive values and types: Byte, int, short, long, float, double, boolean, char. Corresponding wrapper classes for each primitive type. Class as a type of object. Class as a mechanism for user-defined types. Changing types through user-defined casting and automatic type coercion for some primitive types.

7. Variables, Expressions Variables as names for values; Named constants (final), expressions (arithmetic and logical), and their evaluation (operators, associativity, precedence). Assignment operation; the difference between the left-hand side and right-hand side of an assignment.

8. Statements, Scope Statements; Conditional (if, if else, if else if, switch case, ternary operator), looping (for, while, do while, continue, break); grouping statements in blocks, scope, and visibility of variables.

9. Methods

Methods (as abstractions for complex user-defined operations on objects), formal arguments, and actual arguments in methods; Static method and variables. This Operator. Examples of algorithmic problem solving using methods (number problems, finding roots of algebraic equations, etc.).

10. Arrays, Strings Structured data types – arrays (single and multidimensional), address calculations, strings. Example algorithms that use structured data types (e.g. 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. Address calculation (row major and column major), Sorting techniques (bubble, selection, insertion). Structured data types can be defined by classes – String. Introduce the Java library String class and the basic opera

ISC EXAM CLASS 12TH LATEST UPDATE

Finally, wait is over and The Council for the Indian School Certificate Examinations (CISCE) has officially released the date sheet for ISC (Class 12) board examinations for 2025. This year class 12th board exam will be started from 13 February 2025 and will last upto 05 April 2025, it will take around 52 days to complete the class 12th board exam. The first exam will be held on 13 February 2025 for Environmental Science subject and the last exam will be held on 05 April 2025 for Art subject. The Indian School Certificate Examination results will be declared in the month of May.

Official Syllabus

There will be two papers in the subject:

Paper I: Theory of 3 hours and of 70 marks

Paper II: Practical of 3 hours and of 30 marks

PAPER I –THEORY – 70 MARKS

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

1. Boolean Algebra

(a) Propositional logic, well-formed formulae, truth values and interpretation of well-formed formulae (wff), truth tables, satisfiable, unsatisfiable, and valid formulae. Equivalence laws and their use in simplifying wffs.

(b) Binary valued quantities; basic postulates of Boolean algebra; operations AND, OR, and NOT; truth tables.

(c) Basic theorems of Boolean algebra (e.g. duality, idempotence, commutativity, associativity, distributivity, operations with 0 and 1, complements, absorption, involution); De Morgan’s theorem and its applications; reducing Boolean expressions to the sum of products and product of sums forms; Karnaugh maps (up to four variables).

2. Computer Hardware

(a) Elementary logic gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and their use in circuits.

(b) Applications of Boolean algebra and logic gates to half adders, full adders, encoders, decoders, multiplexers, NAND, and NOR as universal gates.

SECTION B

The programming element in the syllabus (Sections B and C) 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, and ease of use and because it is very well suited for an ‘objects first’ approach.

3. Implementation of algorithms to solve problems

The students are required to do lab assignments in the computer lab concurrently with the lectures. Programming assignments should be done such that each major topic is covered in at least one assignment. Assignment problems should be designed so that they are sufficiently challenging. Students must do algorithm design, address correctness issues, implement and execute the algorithm in Java and debug where necessary.

4. Programming in Java

(Review of Class XI Sections B and C) -

Note that items 4 to 13 should be introduced almost simultaneously along with classes and their definitions.

While reviewing, ensure that new higher-order problems are solved using these constructs.

5. Objects

(a) Objects as data (attributes) + behavior (methods); object as an instance of a class. Constructors.

(b) Analysis of some real-world programming examples in terms of objects and classes.

(c) Basic input/output using Scanner from JDK; input/output exceptions. Tokens in an input stream, the concept of whitespace, extracting tokens from an input stream (String Tokenizer class).

6. Primitive values, Wrapper classes, Types, and casting Primitive values and types: Byte, int, short, long, float, double, boolean, char. Corresponding wrapper classes for each primitive type. Class as a type of object. Class as a mechanism for user-defined types. Changing types through user-defined casting and automatic type coercion for some primitive types.

7. Variables, Expressions Variables as names for values; Named constants (final), expressions (arithmetic and logical), and their evaluation (operators, associativity, precedence). Assignment operation; the difference between the left-hand side and right-hand side of an assignment.

8. Statements, Scope Statements; Conditional (if, if else, if else if, switch case, ternary operator), looping (for, while, do while, continue, break); grouping statements in blocks, scope, and visibility of variables.

9. Methods

Methods (as abstractions for complex user-defined operations on objects), formal arguments, and actual arguments in methods; Static method and variables. This Operator. Examples of algorithmic problem solving using methods (number problems, finding roots of algebraic equations, etc.).

10. Arrays, Strings Structured data types – arrays (single and multidimensional), address calculations, strings. Example algorithms that use structured data types (e.g. 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. Address calculation (row major and column major), 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, and index of operations).

11. Recursion - Concept of recursion, simple recursive methods (e.g. factorial, GCD, binary search, conversion of representations of numbers between different bases).

Many problems can be solved very elegantly by observing that the solution can be composed of solutions to ‘smaller’ versions of the same problem with the base version having a known simple solution. Recursion can be initially motivated by using recursive equations to define certain methods. These definitions are fairly obvious and easy to understand. The definitions can be directly converted to a program. Emphasize that any recursion must have a base case. Otherwise, the computation can go into an infinite loop.

The tower of Hanoi is a very good example of how recursion gives a very simple and elegant solution whereas non-recursive solutions are quite complex.

SECTION C

Inheritance, Interface, Polymorphism, Data structures, Computational complexity

12. Inheritance, Interfaces, and Polymorphism

(a) Inheritance; super and derived classes; member access in derived classes; redefinition of variables and methods in subclasses; abstract classes; class Object; protected visibility. Subclass polymorphism and dynamic binding.

Emphasize inheritance as a mechanism to reuse a class by extending it. Inheritance should not normally be used just to reuse some methods defined in a class but only when there is a genuine specialization (or subclass) relationship between objects of the superclass and that of the derived class.

(b) Interfaces in Java; (Conceptual)

Motivation for the interface: often when creating reusable classes some parts of the exact implementation can only be provided by the final end user. For example, in a class that sorts records of different types, the exact comparison operation can only be provided by the end user. Since only he/she knows which field(s) will be used for doing the comparison and whether sorting should be in ascending or descending order given by the user of the class.

Emphasize the difference between the Java language construct interface and the word interface often used to describe the set of method prototypes of a class.

13. Data structures

(a) Basic data structures (stack, queue, implementation directly through classes; definition through an interface and multiple implementations by implementing the interface. Conversion of Infix to Prefix and Postfix notations.

Basic algorithms and programs using the above data structures.

Data structures should be defined as abstract data types with a well-defined interface (it is instructive to define them using the Java interface construct).

(b) Single linked list (Algorithm and programming), binary trees, tree traversals (Conceptual).

The following should be covered for each data structure:

Linked List (single): insertion, deletion, reversal, extracting an element or a sublist, checking emptiness.

Binary trees: apart from the definition the following concepts should be covered: root, internal nodes, external nodes (leaves), height (tree, node), depth (tree, node), level, size, degree, siblings, sub-tree, completeness, balancing, traversals (pre, post and in-order).

14. Complexity and Big O notation

Concrete computational complexity; the concept of input size; estimating complexity in terms of methods; the importance of dominant term; constants, best, average, and worst case.

Big O notation for computational complexity; analysis of the complexity of example algorithms using the big O notation (e.g. Various searching and sorting algorithms, the algorithm for the solution of linear equations, etc.).

PAPER II:

PRACTICAL – 30 MARKS

This paper of three hours duration will be evaluated by the Visiting Examiner appointed locally and approved by the Council. The paper shall consist of three programming problems from which a candidate has to attempt any one.

The practical consists of two parts:

1. Planning Session

2. Examination Session

The total time to be spent on the Planning session and the Examination session is three hours. A maximum of 90 minutes is permitted for the Planning session and 90 minutes for the Examination session.

Candidates are to be permitted to proceed to the Examination Session only after the 90 minutes of the Planning Session are over.

Planning Session

The candidates will be required to prepare an algorithm and a handwritten Java program to solve the problem.

Examination Session

The program handed in at the end of the Planning session shall be returned to the candidates. The candidates will be required to key in and execute the Java program on seen and unseen inputs individually on the Computer and show execution to the Visiting Examiner. A printout of the program listing including 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 are clear from reading the program. Large differences between the planned program and the printout will result in a 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-five assignments for the year.

EVALUATION:

Marks (out of a total of 30) should be distributed as given below:

Continuous Evaluation

Candidates will be required to submit a work file containing the practical work related to programming assignments done during the year.

1. Programming assignments are done throughout the year (Internal Evaluation) - 10 marks

2. Programming assignments are done throughout the year (Visiting Examiner) - 5 marks

Terminal Evaluation

1. Solution to programming problem on the computer - 15 Marks

Marks should be given for the choice of algorithm and implementation strategy, documentation, and correct output on known inputs mentioned in the question paper, and correct output for unknown inputs is available only to the examiner.

NOTE: The algorithm should be expressed clearly using any standard scheme such as a pseudo code.

EQUIPMENT

There should be enough computers to provide for a teaching schedule where at least three-fourths of the time available is used for programming.

Schools should have equipment/platforms such that all the software required for practical work runs properly, i.e. it should run at acceptable speeds.

Since hardware and software evolve and change very rapidly, schools may have to upgrade them as required.

Following are the recommended specifications as of now:

The Facilities:

• A lecture cum demonstration room with a MULTIMEDIA PROJECTOR/ an LCD and O.H.P. is attached to the computer.

• A whiteboard with whiteboard markers should be available.

• A fully equipped Computer Laboratory that allows one computer per student.

• Internet connection for accessing the World Wide Web and email facility.

• The computers should have a minimum of 1 GB RAM and a P IV or higher processor. The basic requirement is that it should run the operating system and Java programming system (Java compiler, Java runtime environment, Java development environment) at acceptable speeds.

• Good Quality printers.

Software:

• Any suitable Operating System can be used.

• JDK 6 or later.

• Documentation for the JDK version being used.

• A suitable text editor. A development environment with a debugger is preferred (e.g. BlueJ, Eclipse, NetBeans). BlueJ is recommended for its ease of use and simplicity.

TO KNOW MORE

For Official Website: click here

For Time Table: click here