WhatsApp

ISC Class 12 – Computer Science

Master algorithmic problem-solving, Java programming, data structures, and object-oriented concepts with practical coding exercises.

Java Programming Data Structures & OOP
✔ Object-Oriented Concepts
✔ Arrays, Strings & Recursion
✔ Stacks, Queues & Algorithm Practice
70 Marks
Theory Paper
30 Marks
Practical / Lab
Enquire Now
ISC Computer Science Laptop int[] arr = new int[n]; for(int i=0; i<n; i++) while(!stack.isEmpty()) public void compute()

ISC Computer Science – Frequently Asked Questions

Clear answers to help students and parents understand ISC Class 12 Computer Science

💻 What topics are covered in ISC Computer Science? +
  • Boolean Algebra, Propositional Logic, and Karnaugh Maps.
  • Java Programming: OOP concepts, arrays, strings, and recursion.
  • Data Structures: Stack, Queue, Circular Queue, Deque, and Expression conversion.
🧠 What is the difference between Semester 1 and Semester 2? +
  • Semester 1 focuses on Boolean algebra, computer hardware, Java basics, arrays, and strings.
  • Semester 2 covers recursion, inheritance, polymorphism, and data structures.
  • Both semesters include practical implementation in Java.
🧪 What programming language is used? +
  • Java (version 5.0 or later) is used for all programming exercises.
  • BlueJ is recommended, but Eclipse or NetBeans can also be used.
  • Focus is on problem-solving and algorithm implementation.
🖥 What is the exam pattern? +
  • Paper I (Theory) – 70 marks, 3 hours, with compulsory and optional questions.
  • Paper II (Practical) – 30 marks, 3 hours, one programming problem evaluated externally.
  • Emphasis on algorithmic thinking, programming, and data structures.
📊 How are practicals assessed? +
  • Students attempt one programming problem from a set of three.
  • Assessment is based on code correctness, logic, and documentation.
  • Externally evaluated by a certified examiner.
🎓 How does ISC Computer Science help for further studies? +
  • Prepares students for engineering, IT, and computer science courses.
  • Develops problem-solving and analytical thinking skills.
  • Acts as a strong foundation for competitive exams and university entrance.

IB Computer Science Highlights

Core concepts and skills across IB chapters

Swipe → to explore chapters

💾 A1: Computer Fundamentals

SL: 11h | HL: 18h
CPU architecture, GPUs, pipelining, memory, fetch–decode–execute cycle, OS, SaaS/PaaS, binary & hex, logic gates, truth tables, compilers & interpreters

📡 A2: Networks

SL: 11h | HL: 18h
Network devices, client–server vs P2P, topologies, TCP/IP, IPv4/IPv6, HTTP, DNS, switching, routing, cybersecurity, encryption, digital certificates

🗄 A3: Databases

SL: 11h | HL: 18h
Database schema, relational DBs, ER diagrams, normalization (1NF–3NF), SQL (joins, aggregates, views), transactions, data warehousing

🤖 A4: Machine Learning

SL: 5h | HL: 18h
Types of ML, preprocessing, regression, classification, clustering, reinforcement learning, genetic algorithms, neural networks (ANN, CNN), ethical issues

🧠 B1: Computational Thinking

SL & HL: 5h
Abstraction, decomposition, algorithm design, pattern recognition, tracing algorithms, flowcharts

💻 B2: Programming

SL: 40h | HL: 42h
Data types, selection & iteration, functions, arrays/lists, stacks, queues, recursion, sorting/searching algorithms, file handling, Big-O notation

🖥 B3: Object-Oriented Programming

SL: 7h | HL: 23h
Classes, objects, constructors, encapsulation, inheritance, polymorphism, abstract classes, composition, design patterns

🔘 B4: Abstract Data Structures (HL only)

Linked lists, binary search trees, hash maps, sets

📄 Case Study

SL: 15h | HL: 30h
Annually changing case study on emerging technology. SL: 2 research challenges, HL: 4 research challenges

Watch the video for details of the subject

IB Computer Science Highlights

Core concepts and skills across IB chapters

Swipe → to explore chapters

💾 A1: Computer Fundamentals

CPU architecture, GPUs, pipelining, memory, FDE cycle, OS, SaaS/PaaS, binary/hex, logic gates, truth tables, compilers & interpreters

📡 A2: Networks

Network devices, client-server vs P2P, topologies, TCP/IP, IPv4/IPv6, HTTP, DNS, switching, routing, cybersecurity, encryption

🗄 A3: Databases

Database schema, relational DBs, ER diagrams, normalization (1NF–3NF), SQL joins/aggregates/views, transactions, data warehousing

🤖 A4: Machine Learning

Types of ML, preprocessing, regression, classification, clustering, reinforcement learning, genetic algorithms, ANNs/CNNs, ethical issues

📚 Case Study

Annually changing emerging tech study; SL: 2 challenges | HL: 4 challenges

🧠 B1: Computational Thinking

Abstraction, decomposition, algorithm design, pattern recognition, tracing algorithms & flowcharts

⌨️ B2: Programming

Data types, selection & iteration, functions, arrays/lists, stacks, queues, recursion, sorting & searching, file handling, Big-O

🖥 B3: Object-Oriented Programming

Classes, objects, constructors, encapsulation, inheritance, polymorphism, abstract classes, composition, design patterns

🗂 B4: Abstract Data Structures (HL)

Linked lists, binary search trees, hash maps, sets

Exam Paper Overview

Paper 1 – Computer Systems

Topics: A1–A4 + Case Study
SL: 1 hr 15 min, 50 marks | HL: 2 hrs, 80 marks

  • ✔ Weighting: SL 35%, HL 40%
  • ✔ Short-answer & structured questions
View Sample Paper

Paper 2 – Algorithms & Programming

Topics: B1–B4 | Separate Python/Java versions | Algorithmic thinking

  • ✔ Weighting: SL 35%, HL 40%
  • ✔ Scenario-based & practical questions
View Sample Paper

Internal Assessment (IA)

35 hours recommended | Student-designed project | Algorithm & development focus

  • ✔ Criteria A–E revised
  • ✔ ~2000 words + diagrams + 5-min video
  • ✔ Choice of programming language
View Sample IA

Top Student Scores