ISC Class 12 Computer Science Syllabus 2026-27

The ISC (Indian School Certificate) Class 12 Computer Science syllabus for the academic session 2026-27 is prescribed by the Council for the Indian School Certificate Examinations (CISCE). Designed to build strong foundational knowledge in computing, programming, and digital citizenship, this syllabus prepares students for higher education in engineering, computer applications, and information technology.

The subject is assessed across two components: a three-hour theory paper worth 70 marks and a practical examination worth 30 marks. Together, these components test conceptual understanding, logical reasoning, programming ability, and hands-on application skills. This page provides a complete, chapter-wise breakdown of all topics, the marking scheme, exam pattern, and expert preparation tips for ISC 2027 students.

Quick Facts: ISC Class 12 Computer Science 2026-27

ISC Class 12 Computer Science Exam Pattern 2026-27

The ISC Class 12 Computer Science examination follows a two-paper format. Paper 1 is the written theory examination, and Paper 2 is a practical examination conducted at the school level. Understanding the exam structure is essential for effective preparation and time management.

Paper 1 (Theory) is divided into two sections. Section A contains short-answer and compulsory questions, while Section B contains longer, descriptive questions from which students must select a specified number. Paper 2 (Practical) involves writing and executing programs using Java, covering topics from the theory syllabus along with project work and viva voce assessment.

ISC Class 12 Computer Science Syllabus 2026-27: Detailed Chapter-Wise Breakdown

The theory syllabus is structured into four major units. Each unit covers distinct aspects of computer science, ranging from mathematical foundations and hardware architecture to object-oriented programming and digital networking. The detailed topic breakdown is provided below.

Unit 1: Boolean Algebra

Boolean Algebra forms the mathematical backbone of digital computing. This unit explores the logical operations, identities, and circuit simplification techniques that underlie all digital hardware design.

1.1 Review of Number Systems

•        Binary, Octal, and Hexadecimal number systems

•        Conversion between number systems (binary to decimal, decimal to binary, octal, hexadecimal)

•        Binary arithmetic: addition, subtraction using 1's complement and 2's complement

1.2 Boolean Algebra Fundamentals

•        Basic Boolean operations: AND, OR, NOT

•        Boolean laws and identities: Commutative, Associative, Distributive, Identity, Complement, Idempotent, Involution, and Absorption laws

•        De Morgan's theorem and its application

•        Principle of duality

1.3 Logic Gates and Circuit Simplification

•        Basic gates: AND, OR, NOT

•        Universal gates: NAND, NOR

•        Exclusive gates: XOR, XNOR

•        Sum of Products (SOP) and Product of Sums (POS) forms

•        Karnaugh Map (K-Map) for simplification of 2, 3, and 4 variable Boolean expressions

•        Half adder and full adder circuits

Unit 2: Computer Hardware

This unit introduces the internal architecture and data communication pathways of modern computer systems. Students gain insight into how the CPU executes instructions, how memory is organised, and how computers communicate through networks.

2.1 The Central Processing Unit (CPU)

•        Components of the CPU: ALU (Arithmetic Logic Unit), Control Unit, and Registers

•        Instruction cycle: Fetch, Decode, Execute

•        Types of registers: Accumulator, Program Counter, Memory Address Register, Memory Buffer Register, Instruction Register

•        Concept of bus: data bus, address bus, control bus

2.2 Memory Organisation

•        Primary memory: RAM (Static and Dynamic), ROM (PROM, EPROM, EEPROM)

•        Cache memory: levels (L1, L2, L3), purpose, and operation

•        Secondary storage: HDDs, SSDs, optical disks, flash storage

•        Memory hierarchy and the concept of virtual memory

2.3 Input and Output Devices

•        Categories of input devices: keyboard, mouse, scanner, biometric readers, touchscreens

•        Categories of output devices: monitors (CRT, LCD, LED), printers (inkjet, laser, dot matrix), plotters

•        I/O interfaces: serial, parallel, USB, Bluetooth

2.4 Computer Networks

•        Types of networks: LAN, MAN, WAN, PAN

•        Network topologies: Bus, Star, Ring, Mesh, Hybrid

•        Network devices: Hub, Switch, Router, Bridge, Gateway, Repeater, Modem

•        Network protocols: TCP/IP, HTTP, HTTPS, FTP, SMTP, POP3

•        IP addressing: IPv4, IPv6, subnetting basics

•        Wireless networking: Wi-Fi standards (802.11), Bluetooth, 4G, 5G

Unit 3: Programming in Java (Object-Oriented Programming)

This is the most extensive unit of the syllabus and carries the highest weightage. It covers the principles of Object-Oriented Programming (OOP) using Java, data structures, searching and sorting algorithms, and computational problem solving. Students must demonstrate practical programming skills in the board examination.

3.1 Object-Oriented Programming Concepts

•        Principles of OOP: Encapsulation, Inheritance, Polymorphism, and Abstraction

•        Classes and objects: definition, instantiation, and the new keyword

•        Constructors: default, parameterised, and constructor overloading

•        Methods: instance methods, static methods, method overloading

•        Access modifiers: public, private, protected, default

•        The this keyword and its applications

3.2 Inheritance

•        Single-level inheritance and multi-level inheritance in Java

•        The extends keyword and super keyword

•        Method overriding and runtime polymorphism

•        Abstract classes and abstract methods

•        Interfaces and the implements keyword

•        The final keyword: final variables, methods, and classes

3.3 Arrays and Strings

•        Single-dimensional and two-dimensional arrays: declaration, initialisation, traversal

•        Arrays as function parameters and return types

•        String class methods: length(), charAt(), indexOf(), substring(), toUpperCase(), toLowerCase(), trim(), compareTo(), equals(), replace()

•        StringBuilder and StringBuffer: basic methods and use cases

•        Character handling: Character class methods (isDigit, isLetter, isUpperCase, etc.)

3.4 Data Structures

•        Stack: LIFO principle, push, pop, peek operations; implementation using arrays

•        Queue: FIFO principle, enqueue, dequeue, front, rear; implementation using arrays

•        Linked List: concept of nodes, head pointer; singly linked list operations (insertion, deletion, traversal)

•        Recursion: base case, recursive case; recursive solutions for factorial, Fibonacci, tower of Hanoi, binary search

3.5 Searching and Sorting Algorithms

•        Linear Search: algorithm, complexity O(n)

•        Binary Search: algorithm, pre-condition (sorted array), complexity O(log n)

•        Bubble Sort: algorithm, pass analysis, complexity O(n^2)

•        Selection Sort: algorithm, finding minimum/maximum, complexity O(n^2)

•        Insertion Sort: algorithm, shifting and inserting, complexity O(n^2)

3.6 Exception Handling and File I/O

•        Exceptions in Java: checked and unchecked exceptions

•        try, catch, finally, throw, and throws keywords

•        Common exceptions: ArithmeticException, ArrayIndexOutOfBoundsException, NullPointerException

•        File handling basics: FileReader, FileWriter, BufferedReader classes

Unit 4: Cyber Ethics and IT Trends

This unit addresses responsible and ethical use of technology, digital literacy, and awareness of emerging trends in the IT industry. While this unit carries relatively fewer theory marks, it holds significant real-world relevance and is often assessed through short-answer questions.

4.1 Cyber Ethics and Digital Safety

•        Ethics in computing: intellectual property rights, privacy, digital security

•        Cybercrime categories: phishing, hacking, identity theft, cyberbullying, cyberstalking

•        Information Technology Act, 2000 (India): key provisions and amendments

•        Digital footprint and responsible online behaviour

4.2 Emerging Trends in Computing

•        Cloud computing: IaaS, PaaS, SaaS; advantages and limitations

•        Artificial Intelligence and Machine Learning: basic concepts, applications

•        Internet of Things (IoT): architecture, applications, challenges

•        Big Data: characteristics (5Vs), processing tools (Hadoop, Spark overview)

•        Blockchain technology: concept, distributed ledger, applications

Chapter-Wise Overview Table

The table below summarises all four units of the ISC Class 12 Computer Science 2026-27 syllabus, their major topics, and the approximate weightage in Paper 1.

ISC Class 12 Computer Science Marking Scheme 2026-27

The marking scheme for ISC Computer Science 2026-27 allocates 70 marks to the theory paper and 30 marks to the practical examination. The practical component is further broken down as follows:

To pass the ISC examination, a student must secure at least 33% of the total marks in both the theory and practical components separately. The theory and practical marks are assessed independently, and failure in either component results in the student not clearing the subject.

Preparation Tips for ISC Class 12 Computer Science 2026-27

Succeeding in ISC Computer Science requires disciplined study, regular programming practice, and conceptual clarity. The following strategies are recommended for students targeting high scores in the 2027 board examination.

Mastering Java Programming

Java programming carries the highest weightage in both Paper 1 and Paper 2. Students should write at least two to three programs daily, covering OOP concepts, data structures, and algorithms. Using an IDE such as BlueJ or Eclipse will help build practical coding fluency. Reviewing past ISC programming questions and solving them within timed conditions is strongly advised.

Strengthening Boolean Algebra and K-Maps

Boolean Algebra and Karnaugh Maps are frequently asked in theory questions. Students should practice simplifying Boolean expressions both algebraically and using K-Maps. Drawing logic gate diagrams neatly and verifying them against truth tables will help avoid calculation errors in the examination.

Revising Networking and Hardware Concepts

Computer Hardware and Networking questions are primarily factual and definition-based. Creating concise revision notes on network topologies, OSI model layers, types of memory, and CPU components will make last-minute revision faster and more effective.

Practical and Project Excellence

The 30-mark practical component is an opportunity to score full marks with thorough preparation. Students should ensure their practical file is complete, well-commented, and includes a variety of programs. The project should demonstrate creativity, structured planning, and proper documentation. Practising viva voce answers on all syllabus topics will build confidence.

Using CISCE Specimen Papers and Past Papers

CISCE releases specimen papers and past year question papers that closely reflect the actual examination pattern. Solving these under timed conditions helps with time management, identifies weak areas, and familiarises students with the question style. Marking your own answers against model solutions improves self-assessment skills.

Frequently Asked Questions (FAQs)

What is the subject code for ISC Class 12 Computer Science?

The subject code for ISC Class 12 Computer Science is 868, as assigned by the Council for the Indian School Certificate Examinations (CISCE).

How many marks is the ISC Class 12 Computer Science exam?

The ISC Class 12 Computer Science examination is worth a total of 100 marks: 70 marks for Paper 1 (Theory) and 30 marks for Paper 2 (Practical).

What programming language is used in ISC Class 12 Computer Science?

Java is the prescribed programming language for ISC Class 12 Computer Science. Students are expected to write, compile, and execute Java programs during both the practical examination and as part of their project work.

Is Boolean Algebra difficult for ISC Computer Science?

Boolean Algebra is considered moderately difficult by many students, particularly the Karnaugh Map simplification method. However, with regular practice of simplification problems and a solid understanding of Boolean identities, it becomes very manageable and can be a reliable scoring area in the examination.

What is the passing marks for ISC Class 12 Computer Science?

Students must secure a minimum of 33% marks separately in both the theory (Paper 1) and practical (Paper 2) components. This means at least 24 out of 70 in theory and at least 10 out of 30 in practicals are required to pass.

Where can I download the official ISC Class 12 Computer Science syllabus?

The official ISC Class 12 Computer Science syllabus for 2026-27 can be downloaded from the official CISCE website at www.cisce.org under the Publications or Syllabus section for ISC Year 12 examinations.

Does the ISC Computer Science syllabus include data structures?

Yes. Data structures form a significant part of Unit 3 (Programming in Java). The syllabus includes Stack, Queue, Linked Lists, and Recursion, along with associated algorithms for insertion, deletion, and traversal. These topics are assessed in both the theory paper and practical examination.