ISC Class 12 Computer Science Syllabus 2022-23: Download Class 12th Computer Science Syllabus PDF

ISC Class 12 Computer Science Syllabus 2023: Computer Science is one of the most popular elective subjects among ISC Class 12 students. Check here the ISC Class 12th Computer Science syllabus for both theory and project work for the 2022-23 exam session and download PDF.

ISC Board Class 12th Computer Science Syllabus for 2022-23 Session Year: Download Free PDF
ISC Board Class 12th Computer Science Syllabus for 2022-23 Session Year: Download Free PDF

ISC Class 12th Computer Science Syllabus 2023: The 21st century is often regarded as the "digital age," and for good reason. The advancement of technology has skyrocketed, and leading the fray is computers. We have come a long way from the first computer, consisting of almost rooms full of CPUs to the super accessible laptops. Computer Science is a constantly evolving field of study, which is why it’s one of the most desired subjects for ISC Class 12 students. The ISC Board Class 12 Computer Science syllabus lays the foundation for students to pursue the subject in higher studies and attain success in respective careers like software developer, gamer, ethical hacker, etc. Computer Science (Code: 868) is an elective subject available to all ISC Class 12 students. The ISC Class 12 computer science syllabus covers several essential topics that don’t require much prior knowledge. Read here and download the latest and revised ISC Class 12 Computer Science syllabus 2023 in pdf format.

ISC Class 12th Datesheet 2023: Check the full date sheet with the guidelines here

ISC Board Class 12 Computer Science Syllabus

The ISC class 12 Computer Science subject is divided into two papers: theory and practical. The Paper 1: Theory carries 70 marks and the duration will be 3 hours. The Practical will carry 30 marks and will also be of 3 hours duration. Check here the ISC Board Class 12 Computer Science Syllabus.

PAPER I –THEORY – 70 MARKS

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.

Propositional variables; the common logical connectives (~ (not)(negation), ∧ (and)(conjunction), ∨ (or)(disjunction), ⇒ (implication), ⇔ (biconditional); definition of a well-formed formula (wff); `representation of simple word problems as wff (this can be used for motivation); the values true and false; interpretation of a wff; truth tables; satisfiable, unsatisfiable and valid formulae.

Equivalence laws: commutativity of ∧, ∨; associativity of ∧, ∨; distributivity; De Morgan’s laws; law of implication (p ⇒ q ≡~p ∨ q); law of biconditional ((p ⇔ q) ≡(p ⇒ q) ∧ (q ⇒ p)); identity (p ≡p); law of negation (~ (~p) ≡p); law of excluded middle (p ∨~p ≡true); law of contradiction (p∧~p ≡false); tautology and contingency simplification rules for ∧, ∨. Converse, inverse and contra positive.

(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 sum of products and product of sums forms; Karnaugh maps (up to four variables).

Verify the laws of Boolean algebra using truth tables. Inputs, outputs for circuits like half and full adders, majority circuit etc., SOP and POS representation; Maxterms & Minterms, Canonical and Cardinal representation, reduction using Karnaugh maps and Boolean algebra.

  1. 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, NOR as universal gates.

Show the correspondence between Boolean methods and the corresponding switching circuits or gates. Show that NAND and NOR gates are universal by converting some circuits to purely NAND or NOR 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, ease of use and because it is very well suited for an ‘objects first’ approach.

  1. 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.

Self explanatory.

  1. 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.

  1. Objects

(a) Objects as data (attributes) + behaviour (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, concept of whitespace, extracting tokens from an input stream (String Tokenizer class).

  1. 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 type of the object. Class as mechanism for user defined types. Changing types through user defined casting and automatic type coercion for some primitive types.

  1. Variables, Expressions

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

  1. 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.

  1. Methods

Methods (as abstractions for complex user 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. Examples of algorithmic problem solving using methods (number problems, finding roots of algebraic equations etc.).

  1. Arrays, Strings

Structured data types – arrays (single and multi-dimensional), 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, index of operations).

  1. 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 are 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 where as non-recursive solutions are quite complex.

SECTION C

Inheritance, Interface, Polymorphism, Data structures.

  1. 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 super class and that of the derived class.

(b) Interfaces in Java (conceptual)

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.

  1. Data structures

(a) Basic data structures (stack, queue, dequeue); 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.

(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).

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 the 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 hand written 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 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 through 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.

Download and read the ISC Class 12th Computer Science Syllabus 2022-23 below

Download ISC Class 12th Computer Science Syllabus 2023 PDF

The ISC Class 12 final exams are quickly approaching and the date sheet has also been released. Check the ISC Class 12 mock tests here to practice the concepts learned in the ISC class 12 Computer Science syllabus.

ISC - Class 12 Mock Tests

FAQ

Where to download ISC Class 12 Computer Science syllabus 2022-23?

The ISC Board Class 12th Computer Science syllabus is available to download from the official website of the CISCE. You can also read and download the ISC Class 12 Computer Science syllabus pdf for free on Jagran Josh.

Is the ISC Board Class 12 Computer Science syllabus tough?

Yes, the ISC Board Class 12th Computer Science syllabus is considerably challenging than other boards and is more expansive as well. But it’s beneficial for students serious about pursuing careers in computer science rather than the ones casually opting for it, thinking it’ll come in handy in the future.

What topics are taught in the ISC Class 12 Computer Science syllabus?

The syllabus of ISC Class 12 Computer Science is larger than other boards and the topics taught in ISC Class 12 Computer Science syllabus include boolean algebra, computer hardware, implementation of algorithms to solve problems, programming in Java, objects, primitive values, wrapper classes types and casting, variables expressions, statements scope, methods, arrays, strings, recursion, inheritance, interfaces and polymorphism, and data structures.

Related Categories

    Jagran Play
    खेलें हर किस्म के रोमांच से भरपूर गेम्स सिर्फ़ जागरण प्ले पर
    Jagran PlayJagran PlayJagran PlayJagran Play

    Related Stories