Syllabus For Class XII Computer Science

Class XII (Theory) – C++

Duration: 3 hours Total Marks: 70

Unit 1: Object Oriented Programming in C++ (50 Theory + 40 Practical) Periods

REVIEW: C++ covered In Class – XI,

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 (::); Declaration of objects

as instances of a class; 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();

Pointers:

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 referencial

structure;

Unit 2: Data Structures (42 Theory + 36 Practical) Periods

Introduction to data structure- array, stack queues primitive and non-primitive data structure,

linear and non-linear structure, static and dynamic data structure.

Arrays:

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.