{"id":25914,"date":"2019-04-23T11:32:49","date_gmt":"2019-04-23T06:02:49","guid":{"rendered":"http:\/\/mycbseguide.com\/blog\/?p=25914"},"modified":"2019-04-23T11:41:34","modified_gmt":"2019-04-23T06:11:34","slug":"cbse-syllabus-for-class-12-old-computer-science-2019-20","status":"publish","type":"post","link":"https:\/\/mycbseguide.com\/blog\/cbse-syllabus-for-class-12-old-computer-science-2019-20\/","title":{"rendered":"CBSE Syllabus for Class 12 Old Computer science 2019-20"},"content":{"rendered":"

CBSE Syllabus for Class 12 Old Computer science 2019-20<\/strong> 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.<\/a>\u00a0<\/strong>The curriculum for March 2020 exams is designed by CBSE, New Delhi as per NCERT textbooks for the session 2019-20.<\/p>\n

CBSE Syllabus for class 12\u00a0Computer science<\/strong>\u00a02019-20<\/b><\/p>\n

Download as PDF<\/a><\/strong><\/p>\n

CBSE Syllabus of Class 12 Old Computer science<\/strong><\/b>\u00a0\u2013 in PDF<\/h2>\n

Duration: 3 hours
\nTotal Marks: 70<\/strong><\/p>\n

\n\n\n\n\n\n\n\n\n\n\n
Unit No.<\/th>\nUnit Name<\/th>\nMarks<\/th>\n<\/tr>\n<\/thead>\n
1<\/td>\nOBJECT-ORIENTED PROGRAMMING IN C++<\/td>\n30<\/td>\n<\/tr>\n
2<\/td>\nDATA STRUCTURE<\/td>\n14<\/td>\n<\/tr>\n
3<\/td>\nDATABASE MANAGEMENT SYSTEM AND SQL<\/td>\n8<\/td>\n<\/tr>\n
4<\/td>\nBOOLEAN ALGEBRA<\/td>\n8<\/td>\n<\/tr>\n
5<\/td>\nCOMMUNICATION TECHNOLOGIES<\/td>\n10<\/td>\n<\/tr>\n
<\/td>\nTotal<\/td>\n70<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

Unit 1: Object-Oriented Programming in C++ (50 Theory + 40 Practical) Periods<\/strong>
\nReview: C++ covered in class XI,
\nObject-Oriented Programming:<\/strong>\u00a0Concept of Object Oriented Programming \u2013 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.
\nImplementation of Object Oriented Programming concepts in C++:<\/strong>\u00a0Definition of a class, Member of a class \u2013 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\u2013pass by value and pass by reference.\u200b\u200b\u200b\u200b\u200b\u200b\u200b
\nConstructor and Destructor:<\/strong>\u00a0Constructor: special characteristics, declaration and definition of a constructor, default constructor, overloaded constructors, copy constructor, the constructor with default arguments.\u200b\u200b\u200b\u200b\u200b\u200b\u200b
\nDestructor:<\/strong>\u00a0Special Characteristics, declaration and definition of destructor;
\nInheritance (Extending Classes):<\/strong>\u00a0Concept 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);
\nData File Handling:<\/strong>\u00a0Need for a data file, Types of data files \u2013 Text file and Binary file;
\nText File:<\/strong>\u00a0Basic file operations on text file: Creating\/Writing text into file, Reading and Manipulation of text from an already existing text File (accessing sequentially).
\nBinary File:<\/strong>\u00a0Creation 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;
\nImplementation of above-mentioned data file handling in C++;
\nComponents of C++ to be used with file handling: Header file:
\nfstream.h; ifstream, ofstream, classes;
\nOpening a text file in\u2014in, out, and app modes;
\nUsing cascading operators (>>,<<) for writing text to the file and reading text from the file; open (), get (), read (), put (), write(), getline() and close() functions;
\nDetecting end-of-file (with or without using eof() function), tellg(), tell(), seekg(), seekp();
\nPointers:<\/strong>
\nIntroduction to Pointer<\/strong>, Declaration and Initialization of Pointer; Dynamic memory allocation\/deallocation operators:\u00a0new, delete;<\/strong>\u00a0Pointers 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;<\/p>\n

Unit 2: Data Structures (42 Theory + 36 Practical) Periods<\/strong>
\nIntroduction to data structure- array, stack queues primitive and non-primitive data structure, linear and non-linear structure, static and dynamic data structure.
\nArrays:\u00a0<\/strong>One and two Dimensional arrays: Sequential allocation and address calculation;
\nOne 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)
\nTwo-dimensional arrays: Traversal Finding sum\/difference of two NxM arrays containing numeric values, Interchanging Row and Column elements in a two-dimensional array;
\nStack (Array and Linked implementation of Stack):\u00a0<\/strong>Introduction to stack (LIFO: Last in First out Operations)
\nOperations on a stack (PUSH and POP) and its Implementation in C++, Converting expressions from INFIX to POSTFIX notation and evaluation of Postfix expression;
\nQueue: (Array and Linked Implementation):\u00a0<\/strong>Introduction to Queue (FIFO: First in First out operations)
\nOperations on Queue (Insert and Delete and its Implementation in C++, circular queue using array.<\/p>\n

Unit 3: Database Management System and SQL
\n(20 Theory + 20 Practical) Periods
\nDatabase Concepts:<\/strong>\u00a0Introduction to database concepts and its need.
\nRelational data model:<\/strong>\u00a0Concept of the domain, tuple, relation, key, primary key, alternate key, candidate key;
\nRelational algebra:<\/strong>\u00a0Selection, Projection, Union and Cartesian product;
\nStructured Query<\/strong>\u00a0Language:<\/strong>
\nGeneral Concepts:<\/strong>\u00a0Advantages of using SQL, Data Definition Language and Data Manipulation Language;
\nData Types:<\/strong>\u00a0NUMBER\/DECIMAL, CHARACTER\/VARCHAR\/VARCHAR2, DATE;
\nSQL COMMANDS:\u00a0<\/strong>CREATE TABLE, DROP TABLE, ALTER TABLE, UPDATE \u2026.SET\u2026., INSERT, DELETE; SELECT, DISTINCT, FROM, WHERE, IN, BETWEEN, GROUP BY, HAVING, ORDER BY;
\nSQL functions:<\/strong>\u00a0SUM ( ), AVG ( ), COUNT ( ), MAX ( ) AND MIN ( ); Obtaining results (SELECT query) from 2 tables using equi-join, Cartesian product and Union
\nNote:<\/strong>\u00a0Implementation of the above-mentioned commands could be done on any SQL supported software on one or two tables.<\/p>\n

Unit 4: Boolean Algebra
\n(16 Theory + 0 Practical) Periods
\nRole of Logical Operations in Computing<\/strong>.
\nBinary-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\u2019s Law and their applications;
\nObtaining 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);
\nApplication of Boolean Logic: Digital electronic circuit design using basic Logic Gates (NOT, AND, OR, NAND, NOR)
\nUse of Boolean operators (NOT, AND, OR) in SQL SELECT statements
\nUse of Boolean operators (AND, OR) in search engine queries.<\/p>\n

Unit 5: Communication Technologies
\n(16 Theory + 3 Practical) Periods
\nEvolution of Networking:<\/strong>\u00a0ARPANET, Internet, Interspace Different ways of sending data across the network with reference to switching techniques (Circuit and Packet switching).\u00a0Data Communication terminologies:<\/strong>\u00a0Concept of Channel, Bandwidth (Hz, KHz, MHz) and Data transfer rate (bps, Kbps, Mbps, Gbps, Tbps).
\nTransmission media:<\/strong>\u00a0Twisted pair cable, coaxial cable, optical fiber, infrared, radio link, microwave link and satellite link.
\nNetwork devices:<\/strong>\u00a0Modem, RJ45 connector, Ethernet Card, Router, Switch, Gateway, wifi card.
\nNetwork Topologies and types:<\/strong>\u00a0Bus, Star, Tree, PAN, LAN, WAN, MAN.
\nNetwork Protocol:<\/strong>\u00a0TCP\/IP, File Transfer Protocol (FTP), PPP, SMTP, POP3 Remote Login (Talent), and Internet Wireless\/Mobile Communication protocol such as GSM, CDMA, GPRS, and WLL.
\nMobile Telecommunication Technologies:<\/strong>\u00a01G, 2G, 3G and 4G; Mobile processors; Electronic mail protocols such as SMTP, POP3
\nProtocols for Chat and Video Conferencing VOIP
\nWireless technologies such as Wi-Fi and WiMax
\nNetwork Security Concepts:<\/strong>\u00a0Threats and prevention from Viruses, Worms, Trojan horse, Spams Use of Cookies, Protection using Firewall, https;
\nIndia IT Act, Cyber Law, Cyber Crimes, IPR issues, hacking.
\nIntroduction To Web services:<\/strong>\u00a0WWW, 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 \u2013 Client side (VB Script, Java Script, PHP) and Server side (ASP, JSP, PHP), Web 2.0 (for social networking)
\nE-commerce payment transactions using online banking, mobile banking and payment apps and services.<\/p>\n

\n

Practical<\/strong><\/p>\n

Duration: 3 Hours
\nTotal Marks: 30<\/strong><\/p>\n

    \n
  1. Programming in C++<\/strong>
    \nOne programming problem in C++ to be developed and tested in Computer during the examination. Marks are allotted on the basis of the following:
    \nLogic: 6 Marks
    \nDocumentation\/Indentation : 2 Marks
    \nOutput presentation: 2 Mark
    \nNotes: The types of problem to be given will be of application type from the following topics<\/strong><\/p>\n