CBSE, NCERT, JEE Main, NEET-UG, NDA, Exam Papers, Question Bank, NCERT Solutions, Exemplars, Revision Notes, Free Videos, MCQ Tests & more.Install Now
CBSE Syllabus for Class 12 Old Computer science 2019-20 contains all the topics of this session. myCBSEguide provides you latest Syllabus for Class 12. Computer science is the study of processes that interact with data and that can be represented as data in the form of programs. Student can Download Latest CBSE Syllabus for class 12 in PDF format is now available in myCBSEguide mobile app. The curriculum for March 2020 exams is designed by CBSE, New Delhi as per NCERT textbooks for the session 2019-20.
CBSE Syllabus for class 12 Computer science 2019-20
CBSE Syllabus of Class 12 Old Computer science – in PDF
Duration: 3 hours
Total Marks: 70
|Unit No.||Unit Name||Marks|
|1||OBJECT-ORIENTED PROGRAMMING IN C++||30|
|3||DATABASE MANAGEMENT SYSTEM AND SQL||8|
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 (::); 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, the 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 inheritances, Privately derived, publicly derived and Protectedly derived a 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 a file, Searching for required data from the file, Appending data to a file, Insertion of data in sorted file, Deletion of data from the 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(), tell(), 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;
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 a 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 System and SQL
(20 Theory + 20 Practical) Periods
Database Concepts: Introduction to database concepts and its need.
Relational data model: Concept of the 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
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.
Duration: 3 Hours
Total Marks: 30
- Programming in C++
One programming problem in C++ to be developed and tested in Computer during the examination. Marks are allotted on the basis of the following:
Logic: 6 Marks
Documentation/Indentation : 2 Marks
Output presentation: 2 Mark
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)
- SQL Commands
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.
- Project Work
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)
- 1 mark is for innovation while writing the programme.
- Practical File
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 also).
- File (Binary and Text) operations (Creation, Updation, Query)
- Any computational Based problems
- 15 SQL commands along with the output based on any table/relation:
- Viva Voce
Viva will be asked from syllabus covered in class XII and the project developed by the student.
Download CBSE Syllabus of Class 12th
- Business studies
- English core
- Hindi core
- Political science
- Home science