KENDRIYA VIDYALAYA SANGATHAN, KOLKATA REGION SPLIT-UP SYLLABUS ( ) CLASS XII : COMPUTER SCIENCE (THEORY)

Similar documents
KENDRIYA VIDYALAYA SANGATHAN

KENDRIYA VIDYALAYA SANGATHAN

KENDRIYA VIDYALAYA SANGATHAN. Regional Office Delhi Split-up Syllabus Session Subject:-Computer Science Subject Code:-083

4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session

KENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SPLITUP SYLLABUS FOR COMPUTER SCIENCE CLASS XII

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


COMPUTER SCIENCE (THEORY) Class XII ( Theory) - Python. Unit No. Unit Name MARKS UNIT 1: PROGRAMMING WITH PYTHON

UNIT 1: OBJECT ORIENTED PROGRAMMING IN C++

CLASS XII ( ) (Theory)

Strictly Based on the Latest Syllabus issued by CBSE Board for 2015 Examination QUESTION BANK. Chapter-Wise Solutions.

Government of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS

KENDRIYA VIDYALAYA SANGATHAN ERNAKULAM REGION Split up syllabus Computer Science (083)

COMPUTER SCIENCE (Code No. 083) (For the session only)

Sample Question Papers

CLASS XII INFORMATICS PRACTICES ACADEMIC SESSION FORTNIGHTLY BREAKUP OF SYLLABUS. Main Topic Sub Topics Pds Total Pds

REVISED SYLLABUS UNIT 5

ONE MARKS QUESTION AND ANSWERS

(Structured Query Language)

COMMUNICATION. Exchange of ideas, messages, or information between two communicating parties. SIMPLEX HALF DUPLEX FULL DUPLEX

2 SEMESTER EXAM CLASS : 12 DECEMBER 2016 TIME : 3 Hrs MAX MARKS : 70

Punjab Technical University Bachelor in Mobile Computing & Internet Batch 2014 onwards THIRD SEMESTER

Downloaded from

ACADEMIC YEAR PLANNING - F.Y.J.C. ( ) F.Y.J.C. COMPUTER SCIENCE (Theory)

Sample Paper 2015 Class XII Subject COMPUTER SCIENCE. Some Important Questions Networking

1) What is information system? Describe the basic concepts of information systems.

Networks. Computer Technology

Area Covered is small Area covered is large. Data transfer rate is high Data transfer rate is low

Sai Nath University. Assignment For MCA 2nd Sem.

Syllabus for Computer Science General Part I

HALF YEARLY SYLLABUS CLASS XII

Chapter 7. Telecommunications, the Internet, and Wireless Technology

Chapter 4: Networking and the Internet. Network Classifications. Network topologies. Network topologies (continued) Connecting Networks.

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

Answer key SUBJECT : COMPUTER SCIENCE Time : 3 hour 15 min Max. marks : 70

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

COMPUTER SCIENCE 2002 (Delhi Board)

Özgür ZEYDAN (PhD.)

Chapter 2. Boolean Expressions:

Computer Networks. Computer Networks. Telecommunication Links. CMPUT101 Introduction to Computing - Spring Chapter 12: Computer Networks 1

Homework Identify a suitable project topic that conforms to project requirements

Computer Networks and Internet

Previous Year Questions

COMMUNICATION AND NETWORK CONCEPTS

IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION

Typical Network Uses

Object Oriented Programming

Objectives. Learn how computers are connected. Become familiar with different types of transmission media

B.Sc II Year Computer Science (Optional)

ก ก Information Technology II

CLASS XII SUBJECT: - INFORMATICS PRACTICES (065) I.P. (Theory)

HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE


16/06/56. Communications and Networks. Communications and Networks. Communications and Networks

Autumn Break 2017 Exam Oriented Assignment Class-XII B, Computer Science

SECOND SEMESTER JAVA PROGRAMMING

ROYAL INSTITUTE OF INFORMATION & MANAGEMENT

COMMUNICATION AND NETWORK CONCEPTS TYPE A: VERY SHORT ANSWER QUESTION

SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION

ASHOK GARG MOBILE :

Technology in Action. Chapter 12 Behind the Scenes: Networking and Security. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

COMPUTER NETWORKING. Terminology of Network:

Downloaded from

Networking. Networking and Communication Trends Convergence (Accessibility) Speed Stability Simplicity* Embeddedness

Venkateshwar International School Sector-18, Dwarka, New Delhi-78 SAT- PRELIMINARY ROUND Class XII

Chapter 9 Introduction to Networks

Chapter 4: Networking and the Internet

Chapter 4: Networking and the Internet. Figure 4.1 Network topologies. Network Classifications. Protocols. (continued)

Chapter 4: Networking and the Internet

COMPONENTS OF DATA COMMUNICATION

Seth Jai Parkash Polytechnic, Damla

Department Curriculum and Assessment Outline

B.Sc. Computer Science (Ancillary)

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Computer Science, Class XII ( ) Chapter No.14 (Networking Concepts)

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.5) Sessional Unit Code. Theory Unit Course

Syllabi & Scheme of Examination BCA-2 nd Year. Website:-

VISUAL SUMMARY COMMUNICATION CHANNELS COMMUNICATIONS. Communications and Networks

Expected Learning Objective Activities/FAs Planned

DELHI PUBLIC SCHOOL BOKARO STEEL CITY

LIST OF EXPERIMENTS. (1) (Office Automation)

INFORMATION TECHNOLOGY

SPLIT UP SYLLABUS SUBJECT : INFORMATICS PRATICES (065) SESSION: CLASS XII ( ) (THEORY)

INTRODUCTION TO ICT.

S Y B Voc Software Development Syllabus

M.C.A. FIRST YEAR DEGREE

Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical

Lesson Plan for Even semester

CERTIFICATE IN WEB PROGRAMMING

An Introduction to JavaScript & Bootstrap Basic concept used in responsive website development Form Validation Creating templates

Introduction to Computer Science. William Hsu Department of Computer Science and Engineering National Taiwan Ocean University

Edexcel GCSE in Computer Science Microsoft IT Academy Mapping

Jianhui Zhang, Ph.D., Associate Prof. College of Computer Science and Technology, Hangzhou Dianzi Univ.

JAIPUR NATIONAL UNIVERSITY, JAIPUR

COMPUTER TECHNIQUE. ( Vocational Stream ) Paper : V. ( Computer Network ) ( Theory )

: Chapter 2 Networking Fundamentals.

Communications and Networks The McGraw-Hill Companies, Inc. All rights reserved.

COMPUTER SCEINCE CLASS-XI THEORY PAPER

CGS 2405 Advanced Programming with C++ Course Justification

Transcription:

KENDRIYA VIDYALAYA SANGATHAN, KOLKATA REGION SPLIT-UP SYLLABUS (2017-) CLASS XII : COMPUTER SCIENCE (THEORY) MONTH PORTION TO BE COVERED THEORY PRACTICAL APRIL- MAY Unit 1 Object Oriented Programming in C++ 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, Function Overloading: Need for Function Overloading, Declaration and Definition, Restrictions on Overloaded Functions, Calling Overloaded Functions 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 JUNE-JULY 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 20 20 22 16

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(); PERIODIC TEST I PORTION: 1. REVIEW: C++ covered In Class XI, Function Overloading (14) 2. Implementation of Object Oriented Programming concepts in C++ (02 + 04 = 06) 3. Constructor and Destructor (02 + 02 = 04) 4. Inheritance (06) 5. Data File Handling(10) MAXIMUM MARKS: [ 14 + 6 + 4 + 6 + 10 = 40 Marks] DURATION: 90 Minutes AUG Pointers: Introduction to Pointer, Declaration and Initialization of Pointer; Dynamic memoryallocation/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; 8 4 UNIT-2 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. 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 22

and Column elements in a two dimensional array; PERIODIC TEST II PORTION: 1. Data File Handling (10) 2. Pointers(10) 3. Arrays (20) MAXIMUM MARKS: [10 + 10 + 20 = 40 Marks] DURATION: 90 Minutes SEP 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. 20 OCT UNIT-3 DATABASES AND SQL 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; DataTypes: 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 (SELECTquery) 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. 6 14 2 UNIT-4 BOOLEAN ALGEBRA Role of Logical Operations in Computing.Binary-valued 16 0

Quantities, Boolean Variable, Boolean Constant and Boolean Operators: AND, OR,NOT; Truth Tables; Closure Property, Commutative Law, Associative Law, Identity law, InverseLaw, 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 BooleanExpression (SOP and POS) to its minimal form, Use of Karnaugh Map for minimization of Booleanexpressions (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. HALF YEARLY EXAMINATION PORTION 1. Up to Unit 4 (Boolean Algebra) MAXIMUM MARKS: 70 DURATION: 0 Minutes NOV UNIT-5 COMMUNICATION TECHNOLOGIES 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(Telnet), and Internet Wireless/Mobile Communication protocol such as GSM, CDMA, GPRS, andwll. 16 3

Mobile Telecommunication Technologies : 1G, 2G, 3G and 4GElectronic mail protocols such as SMTP, POP3; Protocols for Chat and Video Conferencing VOIPWireless 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.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,javascript,PHP) and server side(asp,jsp,php),web 2.0(for social networking) NOV-DEC JAN FEB Revision and Project Completion PRE BOARD I (Whole Syllabus) Revision and Project Submission PRE BOARD II (Whole Syllabus) Revision AISSCE Practical

SPLIT-UP SYLLABUS COMPUTER SCIENCE PRACTICAL MONTH PORTION TO BE COVERED PRACTICAL APRIL-MAY Unit 1: Object Oriented Programming in C++ Class Creation and object implementation in C++ Constructor and Destructor 20 JUNE-JULY AUG SEP OCT Inheritance Data File Handling: Text File, Binary File 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 (withor without using eof() function), tellg(), tellp(), seekg().seekp(); Pointers: Introduction to Pointer, Declaration and Initialization of Pointer; Dynamic memoryallocation/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: Dereference/Deference operator: *, ->; self-referential structure; UNIT-2 Data Structures Arrays 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): 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) Operations on Queue (Insert and Delete and its Implementation in C++, circular queue using array. STRUCTURED QUERY LANGUAGE: General Concepts: Advantages of using SQL, Data Definition 16 4 20

NOV NOV-DEC JAN FEB Language and Data Manipulation Language; DataTypes: 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 (SELECTquery) 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. 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 Network devices: Modem, RJ45 connector, Ethernet Card, Router, Switch, Gateway, wifi card. Network Topologies and types: Bus, Star, Tree, PAN, LAN, WAN, MAN. Showing and setting up LAN Architecture and Client Server Architecture. Mobile Telecommunication Technologies :Email and other communication technologies such as Chatting and Video Conferencing using VOIPWireless 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.India IT Act, Cyber Law, Cyber Crimes, IPR issues, hacking. Introduction To Web services: Hyper Text Markup Language (HTML), Extensible Markup Language (XML); 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) Revision and Project Completion Revision and Project Submission Revision AISSCE Practical 3