Advertisement Remove all ads

Computer Science (C++) Class 12 CBSE (Science) CBSE Topics and Syllabus

Advertisement Remove all ads

CBSE Syllabus For Class 12 Computer Science (C++): Knowing the Syllabus is very important for the students of Class 12. Shaalaa has also provided a list of topics that every student needs to understand.

The CBSE Class 12 Computer Science (C++) syllabus for the academic year 2021-2022 is based on the Board's guidelines. Students should read the Class 12 Computer Science (C++) Syllabus to learn about the subject's subjects and subtopics.

Students will discover the unit names, chapters under each unit, and subtopics under each chapter in the CBSE Class 12 Computer Science (C++) Syllabus pdf 2021-2022. They will also receive a complete practical syllabus for Class 12 Computer Science (C++) in addition to this.

Academic year:

CBSE Class 12 Computer Science (C++) Revised Syllabus

CBSE Class 12 Computer Science (C++) and their Unit wise marks distribution

CBSE Class 12 Computer Science (C++) Course Structure 2021-2022 With Marking Scheme

Advertisement Remove all ads
Advertisement Remove all ads
Advertisement Remove all ads


600 Object Oriented Programming in C++

Object Oriented Programming:- Concept of Object Oriented Programming – Data hiding, Data encapsulation, Class and Object, Abstract class and Concrete class, Polymorphism (Implementation of polymorphism using Function overloading as an example in C++); Inheritance, Advantages of Object Oriented Programming over earlier programming methodologies,

Implementation of Object Oriented Programming concepts in C++:- Definition of a class, Member of a class – Data Members and Member Functions (methods), Using Private and Public visibility modes, default visibility mode (private); Member function definition: inside class definition and outside class definition using scope resolution operator (::); accessing members from object (s), Objects as function arguments–pass by value and pass by reference;

Constructor and Destructor:- Constructor: special characteristics, declaration and definition of a constructor, default constructor, overloaded constructors, copy constructor, constructor with default arguments;

Destructor:- Special Characteristics, declaration and definition of destructor;

Inheritance (Extending Classes):- Concept of Inheritances, Base Class, Derived classes, protected visibility mode; Single level inheritance, Multilevel inheritance and Multiple inheritance, Privately derived, publicly derived and Protectedly derived class, accessibility of members from objects and within derived class (es);

Data File Handling:- Need for a data file, Types of data files – Text file and Binary file;

Text File:- Basic file operations on text file: Creating/Writing text into file, Reading and Manipulation of text from an already existing text File (accessing sequentially).

Binary File:- Creation of file, Writing data into file, Searching for required data from file, Appending data to a file, Insertion of data in sorted file, Deletion of data from file, Modification of data in a file;

Implementation of above mentioned data file handling in C++;

Components of C++ to be used with file handling:

Header file: fstream.h; ifstream, ofstream, classes;

Opening a text file in—in, out, and app modes;

Using cascading operators (>>,<<) for writing text to the file and reading text from the file; open (), get (), read (), put (), write(), getline() and close() functions; Detecting end-of-file (with or without using eof() function), tellg(), tellp(), seekg(), seekp();


Introduction to Pointer, Declaration and Initialization of Pointer; Dynamic memory allocation/deallocation operators: new, delete; Pointers and Arrays: Array of Pointers, Pointer to an array (1 dimensional array), Function returning a pointer, Reference variables and use of alias; Function call by reference. Pointer to structure: De-reference/Deference operator: *, ->; self referential structure;

700 Data Structures

Introduction to data structure- array, stack queues primitive and non-primitive data structure, linear and non-linear structure, static and dynamic data structure.


One and two Dimensional arrays: Sequential allocation and address calculation;

One dimensional array: Traversal, Searching (Linear, Binary Search), Insertion of an element in an array, deletion of an element from an array, Sorting (Insertion, Selection, Bubble)

Two-dimensional arrays:- Traversal Finding sum/difference of two NxM arrays containing numeric values, Interchanging Row and Column elements in a two dimensional array;

Stack (Array and Linked implementation of Stack):- Introduction to stack (LIFO: Last in First out Operations)

Operations on stack (PUSH and POP) and its Implementation in C++, Converting expressions from INFIX to POSTFIX notation and evaluation of Postfix expression;

Queue: (Array and Linked Implementation)

Introduction to Queue (FIFO: First in First out operations)

Operations on Queue (Insert and Delete and its Implementation in C++, circular queue using array.

1000 Networking and Open Source Software

Common to both the options. Refer to unit 5 COMMUNICATION TECHNOLOGIES mentioned in case of Python for further details.

Advertisement Remove all ads
Advertisement Remove all ads

View all notifications

      Forgot password?
View in app×