CBSE - Class 12 - Computer Science - CBSE Syllabus

Test Generator for Teachers

Create question papers online in minutes with your name and logo. 3,00,000+ questions to choose from.

Test Generator

CBSE Syllabus for Class 12 Computer Science

Free CBSE Syllabus Link
CBSE Syllabus 2019-20 Class 12 Computer Science New Download
CBSE Syllabus 2019-20 Class 12 Computer Science(old) Download
CBSE Syllabus 2018-19 Class 12 Computer Science New Download
CBSE Syllabus 2018-19 Class 12 Computer Science Old Download
CBSE Syllabus 2017-18 Class 12 Computer Science Download
Free CBSE Syllabus Link
CBSE class-12 Computer Science Syllabus 2016-17
CBSE class-12 Computer Science Syllabus 2015-16
CBSE class 12 Syllabus for Computer Science 2014-2015 (updated)
CBSE class 12 Syllabus for Computer Science 2014-2015
CBSE class 12 Syllabus for Computer Science 2013-2014
CBSE class 12 Syllabus for Computer Science 2012-2013
CBSE Syllabus for 2012-2013 : Computer Science
CBSE Syllabus for 2011-2012 : Computer Science
Computer Science Syllabus for 2010-2011
Computer Science Syllabus for 2009-2010

Latest CBSE Syllabus for Class 12 Computer Science

Latest CBSE Syllabus for Class 12 Computer Science

CBSE syllabus for class 12 Computer Science 2018, 2019, 2020 as per cbse.nic.in new curriculum. CBSE syllabus is available for free download in PDF format. Download latest CBSE syllabus of 12th Computer Science as PDF format. Chemisty syllabus for cbse class 12 is also available in myCBSEguide app, the best app for CBSE students. 

CBSE Academics Unit - Curriculum Syllabus

CBSE has special academics unit to design curriculum and syllabus. The syllabus for CBSE class 12 Chemistry is published by cbse.nic.in Central Board of Secondary Education, Head Office in New Delhi. The latest syllabus for class 12 Computer Science includes list of topics and chapters in Computer Science. CBSE question papers are designed as per the syllabus prescribed for current session. 

CBSE Syllabus category

  • Secondary School Curriculum (class 9 and class 10)
  • Senior School Curriculum (class 11 and class 12)
  • Vocational Courses (Class 11 and class 12)

COMPUTER SCIENCE (THEORY)
Class XII (Theory) – Python

Duration: 3 Hours (Total Marks: 70)

Unit No.

Unit Name

Marks

1

Object Oriented Programming with Python

24

2

Advances Programming with Python

20

3

Database Management System and SQL

08

4

Boolean Algebra

08

5

Communicational Technologies

10

TOTAL

70

Unit 1: Object Oriented Programming with Python  (50 theory + 40 practical) periods

REVIEW: Python covered In Class-XI
Concept of Object Oriented Programming: Data Hiding, Data Encapsulation, Class and Object, Polymorphism, inheritance, advantages of Object Oriented Programming over earlier programming methodologies,
Classes: Defining classes (attributes, methods), creating instance objects, accessing attributes and methods, using built in class attributes (dict, doc, name, module, bases), Constructor( _ _init()_ _, _ _del()_ _ and _ _ str()_ _) methods in a class, private attributes (limited support), importance of “self” (acts as a pointer to current calling object) operator overloading with methods.
Inheritance:
Concept of base class and derived class
: Single, multilevel and multiple inheritance- Overriding methods, using super( ) in derived class to invoke _ _init()_ _ or overridden methods of parent class.

Unit 2: Advance Programming with Python (42 Theory + 36 Practical) Periods

Linear List Manipulation: Sequential allocation, traversal,insertion of an element in a sorted list, deletion of an element from the list, searching (linear, binary), sorting (insertion, selection, bubble).
Stacks (List Implementation): Introduction to stack (LIFO Operations ), operations on stack (PUSH and POP ) and its implementation in python.
Converting expression from infix to postfix notation and evaluation of postfix expression.
Queues (List implementation) – Introduction to Queue(FIFO) , Operations on Queue (INSERT and DELETE) and its implementation in Python.

Data File
Need for non bold for data file, types of data file–text and binary,
opening and closing filesopen( ), close( ), access modes (output, input, default), file object, access_modes, reading and writing a file Read(), readline(), readlines(), write(), writeliness file positions (seek(), tell()), renaming and deleting a file.,flush();
Implementation of basic file operations on text and binary file in Python: Creating/writing data into file, reading and displaying data from file, searching for particular data from a file, insertion and deletion of data from an already existing file, modification of data in file.
Error and Exceptions – NameError, IndexError, TypeError, IO Error, ImportError, ValueError, EOFError.
Generator function using Yield.

Unit 3: Databases and SQL (20 Theory + 20 Practical) Periods

Data base Concepts: Introduction to data base concepts and its need.
Relational data model: Concept of domain, tuple, relation, key, primary key, alternate key, candidate key;
Relational algebra : Selection, Projection, Union and Cartesian product;
Structured Query Language:
General Concepts
: Advantages of using SQL, Data Definition Language and Data Manipulation Language;
Data Types: NUMBER/DECIMAL, CHARACTER/VARCHAR/VARCHAR2, DATE;
SQL COMMANDS: CREATE TABLE, DROP TABLE, ALTER TABLE, UPDATE ….SET…., INSERT, DELETE; SELECT, DISTINCT, FROM, WHERE, IN, BETWEEN, GROUP BY, HAVING, ORDER BY;
SQL functions: SUM ( ), AVG ( ), COUNT ( ), MAX ( ) AND MIN ( ); Obtaining results (SELECT query) from 2 tables using equi-join, Cartesian product and Union

Note: Implementation of the above mentioned commands could be done on any SQL supported software on one or two tables.

Unit 4: Boolean Algebra (16 Theory + 0 Practical) Periods

Role of Logical Operations in Computing.
Binary-valued Quantities, Boolean Variable, Boolean Constant and Boolean Operators: AND, OR, NOT; Truth Tables; Closure Property, Commutative Law, Associative Law, Identity law, Inverse Law, Principle of Duality, Idempotent Law, Distributive Law, Absorption Law, Involution Law, DeMorgan's Law and their applications;
Obtaining Sum of Product (SOP) and Product of Sum (POS) form the Truth Table, Reducing Boolean Expression (SOP and POS) to its minimal form, Use of Karnaugh Map for minimization of Boolean expressions (up to 4 variables);
Application of Boolean Logic: Digital electronic circuit design using basic Logic Gates (NOT, AND, OR, NAND, NOR)
Use of Boolean operators (NOT, AND, OR) in SQL SELECT statements
Use of Boolean operators (AND, OR) in search engine queries.

Unit 5: Communication Technologies (16 Theory + 3 Practical) Periods

Evolution of Networking: ARPANET, Internet, Interspace Different ways of sending data across the network with reference to switching techniques (Circuit and Packet switching).
Data Communication terminologies: Concept of Channel, Bandwidth (Hz, KHz, MHz) and Data transfer rate (bps, Kbps, Mbps, Gbps, Tbps).
Transmission media: Twisted pair cable, coaxial cable, optical fiber, infrared, radio link, microwave link and satellite link.
Network devices: Modem, RJ45 connector, Ethernet Card, Router, Switch, Gateway, wifi card.
Network Topologies and types: Bus, Star, Tree, PAN, LAN, WAN, MAN.
Network Protocol: TCP/IP, File Transfer Protocol (FTP), PPP, SMTP, POP3 Remote Login (Talent), and Internet Wireless/Mobile Communication protocol such as GSM, CDMA, GPRS, and WLL.
Mobile Telecommunication Technologies : 1G, 2G, 3G and 4G; Mobile processors;
Electronic mail protocols such as SMTP, POP3
Protocols for Chat and Video Conferencing VOIP
Wireless technologies such as Wi-Fi and WiMax

Network Security Concepts:
Threats and prevention from Viruses, Worms, Trojan horse, Spams
Use of Cookies, Protection using Firewall, https;
India IT Act, Cyber Law, Cyber Crimes, IPR issues, hacking.

Introduction To Web services: WWW, Hyper Text Markup Language (HTML), Extensible Markup Language (XML); Hyper Text Transfer Protocol (HTTP); Domain Names; URL; Website, Web browser, Web Servers; Web Hosting, Web Scripting – Client side (VB Script, Java Script, PHP) and Server side (ASP, JSP, PHP), Web 2.0 (for social networking)

E-commerce payment transactions using online banking, mobile banking and payment apps and services.

Class XII (Practical)
Python

Duration: 3 hours (Total Marks: 30)

1. Programming in Python (marks 10)
One programming problem in Python to be developed and tested in Computer Lab during the Examination. Marks are allotted on the basis of following:
Logic : 6 Marks
Documentation/Indentation : 2 Marks
Output presentation : 2 Marks

Note: The types of problems to be given will be of application type developed using classes from the following topics

  • String
  • Lists/Tuples
  • Dictionary
  • File Operations

2. SQL Commands (marks 05)
Five Query questions based on a particular Table/Relation to be tested practically on Computer during the examination. The command along with the result must be written in the answer sheet.

3. Project Work (marks 05)
The project has to be developed in Python language with Object Oriented Technology.
(The project is required to be developed in a group of 2-4 students)

  • Presentation on the computer
  • Project report (Listing, Sample, Outputs, Documentation)
  • Viva

4. Practical File (marks 06)
Must have minimum 20 programs from the following topics

  • Lists (general, stack, queue)
  • File Handling
  • Programs based on Object Oriented Concepts
  • 15 SQL commands along with the output based on any table/relation

*1 mark is for innovating while developing programme.

5. Viva Voce (marks 04)
Viva will be asked from syllabus covered in class XII and the project developed by student.

GUIDELINES FOR PROJECTS (Class XI and XII)

1. Preamble
1.1 The academic course in Computer Science includes one Project in each year. The Purpose behind this is to consolidate the concepts and practices imparted during the course and to serve as a record of competence.
1.2 A group of 2-4 students as team may be allowed to work on one project.

2. Project content
2.1 Project for class XI can be selected from the topics mentioned in the syllabus or domains on similar lines.
2.2 Project for class XII should ensure the coverage of following areas of curriculum:
a) Problem Solving
b) Object Oriented Programming in Python
c) File Handling
Theme of the project can be

  • Any Scientific or a fairly complex algorithmic situation
  • Quizzes/Games
  • Tutor/Computer Aided Learning Systems

2.3 The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, systematic documentation and other associated aspects of Software Development.

2.4 The assessment would be through the project demonstration and the Project Report, which should portray Programming Style, Structured Design, Good documentation of the code to ensure readability and ease of maintenance.


Class XII (Theory) – C++

Duration: 3 hours (Total Marks: 70)

Unit No.

Unit Name

Marks

1.

OBJECT ORIENTED PROGRAMMING IN C++

30

2.

DATA STRUCTURE

14

3.

DATABASE MANAGEMENT SYSTEM AND SQL

08

4.

BOOLEAN ALGEBRA

08

5.

COMMUNICATION TECHNOLOGIES

10

TOTAL

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.

Unit 3: Database Management Systema and SQL

Common to both the options. Refer to unit 3 DATABASE AND SQL mentioned in case of Python for further details.

Unit 4: Boolean Algebra

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

Unit 5: Networking and Open Source Software

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


Class XII (Practical) - C++

Duration: 3 hours (Total Marks : 30)

1. Programming in C++ (marks 10)
One programming problem in C++ to be developed and tested in Computer during the examination.
Marks are allotted on the basis of following:
Logic : 6 Marks
Documentation/Indentation : 2 Marks
Output presentation : 2 Marks

Notes: The types of problem to be given will be of application type from the following topics

  • Arrays (One dimensional and two dimensional)
  • Class(es) and objects
  • Stack using arrays and or linked implementation
  • Queue using arrays (circular) and or linked implementation
  • Binary File operations (Creation, Displaying, Searching and modification)
  • Text File operations (Creation, Displaying and modification)

2. SQL Commands (marks 05)
Five Query questions based on a particular Table / Relation to be tested practically on Computer during the examination. The command along with the result must be written in the answer sheet.

3. Project Work (marks 05)
The project has to be developed in C++ language with Object Oriented Technology and also should have use of Data files. (The project is required to be developed in a group of 2-4 students)

  • Presentation on the computer
  • Project report (Listing, Sample, Outputs, Documentations)
  • Viva

* 1 mark is for innovation while writing programme.

4. Practical File (marks 06)
Must have minimum 20 programs from the following topics

  • Arrays (One dimensional and two dimensional, sorting, searching, merging, deletion & insertion of elements)
  • Class(es) and objects
  • Stacks using arrays and linked implementation
  • Queue using arrays & linked implementation (circular aslo).
  • File (Binary and Text) operations (Creation, Updation, Query)
  • Any computational Based problems
  • 15 SQL commands along with the output based on any table/relation:

5. Viva Voce (marks 04)
Viva will be asked from syllabus covered in class XII and the project developed by student.

Guidelines for Projects (Class XI and XII)

1. Preamble
1.1 The academic course in Computer Science includes on Project in each year. The Purpose behind this is to consolidate the concepts and practices imparted during the course and to serve as a record of competence.
1.2 A group of 2-3 students as team may be allowed to work on one project.

2. Project content
2.1 Project for class XI can be selected from the topics mentioned in the syllabus or domains on the similar lines
2.2 Project for class XII should ensure the coverage of following areas of curriculum:
a) Flow of control
b) Data Structure
c) Object Oriented Programming C++
d) Data File Handling
Theme of the project can be

  • Any subsystem of a System Software or Tool
  • Any Scientific or a fairly complex algorithmic situation
  • School Management, Banking, Library Information System, Hotel or Hospital Management System, Transport query system
  • Quizzes / Games;
  • Tutor, Computer Aided Learning Systems

2.3 It is suggested to prepare a bilingual (English and other Indian language) user manual part of project file.

2.4 The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimized code preparation, systematic documentation and other associated aspects of Software Development.

Download CBSE Syllabus in PDF

Download CBSE Syllabus of Class 12th 

CURRICULUM / SYLLABUS OF VOCATIONAL COURSES

CURRICULUM / SYLLABUS

Scheme of Studies and List of Vocational Courses

Application form to offer vocational courses

Secondary School Curriculum (Under NSQF)

Senior School Curriculum (Vocational)

 

 



Buy Complete Study Pack

Subscribe complete study pack and get unlimited access to selected subjects. Effective cost is only ₹ 12.5/- per subject per month. Based on the latest CBSE & NCERT syllabus.

CBSE Guide App

Install myCBSEguide mobile app for FREE sample papers, Test Papers, Revision Notes, Previous year question papers, NCERT solutions and MCQ tests

myCBSEguide App

CBSE Test Generator

Create papers in minutes

Print with your name & Logo

Download as PDF

3 Lakhs+ Questions

Solutions Included

Based on CBSE Blueprint

Best fit for Schools & Tutors

Work from Home

  • Work from home with us
  • Create questions or review them from home

No software required, no contract to sign. Simply apply as teacher, take eligibility test and start working with us. Required desktop or laptop with internet connection