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

Similar documents
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

KENDRIYA VIDYALAYA SANGATHAN

KENDRIYA VIDYALAYA SANGATHAN

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

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

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

UNIT 1: OBJECT ORIENTED PROGRAMMING IN C++

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


CLASS XII ( ) (Theory)

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

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

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

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

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

Sample Question Papers

COMPUTER SCIENCE 2002 (Delhi Board)

Syllabus for Computer Science General Part I

Object Oriented Programming

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

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

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

ONE MARKS QUESTION AND ANSWERS

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

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

DELHI PUBLIC SCHOOL BOKARO STEEL CITY

B.Sc II Year Computer Science (Optional)

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

SAURASHTRA UNIVERSITY

(Structured Query Language)

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

Sai Nath University. Assignment For MCA 2nd Sem.

S Y B Voc Software Development Syllabus

SECOND SEMESTER JAVA PROGRAMMING

B.Sc. Computer Science (Ancillary)

SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION

Previous Year Questions

COMPUTER MCQs. 1. DOS floppy disk does not have 1) a boot record 2) a file allocation table 3) a root directory

COMPUTER SCEINCE CLASS-XI THEORY PAPER

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

IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION

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

Chapter 2. Boolean Expressions:

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

Assignment 3 Class XII (Computer Science 083) Topic Array


Seth Jai Parkash Polytechnic, Damla

ก ก Information Technology II

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

COMPUTER APPLICATION

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

Fundamental of I.T. (c) Application of computer *************

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

Networks. Computer Technology

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

Computer Networks and Internet

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

SUBJECT COMPUTER SCIENCE PAGE 1

LIST OF EXPERIMENTS. (1) (Office Automation)

HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE

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

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

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

(d) Rewrite the following program after removing all the syntax error(s), if any. [2] include <iostream.h> void main ( )

ASHOK GARG MOBILE :

Computer Programming C++ (wg) CCOs

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

BACHELOR OF COMPUTER APPLICATIONS (BCA)

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

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

CERTIFICATE IN WEB PROGRAMMING

DBMS Lesson Plan. Name of the faculty: Ms. Kavita. Discipline: CSE. Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F)

BHARATIYA VIDYA BHAVAN S V.M.PUBLIC SCHOOL, VADODARA. Class : XII SAMPLE PAPER Max Marks : 70

REVISED SYLLABUS UNIT 5

WYSE Academic Challenge Regional Computer Science 2008 Solution Set

Computer Science (330)

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

And Even More and More C++ Fundamentals of Computer Science

Typical Network Uses

Downloaded from

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034

CGS 2405 Advanced Programming with C++ Course Justification

COMPUTER SCIENCE

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION

VALLIAMMAI ENGINEERING COLLEGE

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

CS201 Latest Solved MCQs

Introduction to Programming Using Java (98-388)

SUBJECT: INFORMATION TECHNOLOGY

Sample Paper, 2015 Subject: Computer Science Class 12 th

Lesson Plan. Subject: OBJECT ORIENTED PROGRAMMING USING C++ :15 weeks (From January, 2018 to April,2018)

Absolute C++ Walter Savitch

Copyleft 2005, Binnur Kurt. Objectives

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

Writing an ANSI C Program Getting Ready to Program A First Program Variables, Expressions, and Assignments Initialization The Use of #define and

OBJECT ORIENTED PROGRAMMING USING C++ CSCI Object Oriented Analysis and Design By Manali Torpe

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

XII- COMPUTER SCIENCE VOL-II MODEL TEST I

Question Bank Class XII Subject : Computer Science

Transcription:

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session 2008-09 Sr.No. Duration Number of Working Days From To Topic to be Covered Nos. of Periods required CAL/TAL Classes Required Programs for Practice* 1

1 1 st April 3 rd May 26 REVIEW: C++ COVERED IN CLASS XI Defining a symbol name using typedef keyword and defining a macro using #define directive; Need for User defined data type; STRUCTURES: Defining a Structure, Declaring structure variables, Accessing structure elements, Passing structure to Functions as value and reference argument/parameter, Function returning structure, Array of structures, passing an array of structure as an argument/ a parameter to a function; 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, Members 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 5 12 7 10 2 Periods Through Power Point Presentation or any other Media Program to define a macro using # define directive Program to use the typedef to define the type double, unsigned int, float and unsigned char. Program to define and use nested structures Program to define and use array of structures. Program to define class, data members and member functions (inside and outside the class). visibility modes Program to use scope resolution operator (::) objects as function 2

from object(s), Array of type class, Objects as function arguments - pass by value and pass by reference; 2 23 rd June 30 th June 7 CONSTRUCTOR AND DESTRUCTOR: CONSTRUCTOR: Special Characteristics, Declaration and Definition of a constructor, Default Constructor, Overloaded Constructors, Copy Constructor, Constructor with default arguments; 3 1 st July 31 st July 26 DESTRUCTOR: Special Characteristics, Declaration and definition of destructor; INHERITANCE (EXTENDING CLASSES): Concept of Inheritance, Base Class, Derived Class, Defining 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; Basic file operations on text file: Creating/Writing text into file, Reading and Manipulation of text from an already existing text File (accessing sequentially) handling in C++; Components of C++ to be used with file handling: arguments (pass by value and pass by reference) 9 declaration, definition and use of constructor and its various type. the order of constructor invocation. 5 declaration, definition and use of destructor. 15 the access control in public, private and protected derivation of a class. multiple and multilevel inheritance. 15 Program to read, manipulate and write to disk file using character and line feed. Header file: fstream.h; ifstream, ofstream, fstream classes; 3

4 1 st Aug. 31 st Aug. 24 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 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(),put(), getline() and close() functions; Detecting end-of-file (with or without using eof() function); Opening a binary file using in, out, and app modes;open(), read(), write() and close() functions; Detecting end-of-file (with or without using eof() function); tellg(), tellp(), seekg(), seekp() functions POINTERS: Declaration and Initialization of Pointers; 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 structures: Deference operator: *, ->; self referencial structures 18 14 Program to read, manipulate and write records to disk using binary file. Program to write and read object for file handling. Program to find, access and modify a record using file pointers. (PROJECT TO BE ASSIGNED TO STUDENTS) Program to use of pointer to find location of the data in the memory one dimensional variables. Program to invoke function by passing pointer and by passing references. Program to use new and delete operator. the use of structure pointers. pointer arithmetic. 4

5 1 st Sept. 30 th Sept. 26 DATA STRUCTURES 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 sort),concatenation of two linear arrays, merging of two sorted arrays; 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: (Circular Array and Linked Implementation): Operations on Queue (Insert and Delete) and its Implementation in C++. 34 3 Periods Through Power Point Presentation or any other Media basic operations (Insertion, Deletion, search &Sorting etc) in 1-D/2-D Array. POP & PUSH operation using array & linked list. Programs to illustrate INSERT & DELETE operations on a queue using array and linked list. operations in a Circular queue. 5

6 1 st Oct. 31 st Oct. 11 Autumn Break from 5 th October till 14 th October DATABASES AND SQL Database Concepts: 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, CHARACTER, 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; 15 2 Periods Through Power Point Presentation or any other Media SQL commands to create tables and perform various queries on those tables. 6

7 1 st Nov. 15 th Nov. 11 BOOLEAN ALGEBRA 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, Idem potent Law, Distributive Law, Absorption Law, Involution law, DeMorgan s Law and their applications; Obtaining Sum of Product (SOP) and Product of Sum (POS) form from 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); Basic Logic Gates (NOT, AND, OR, NAND, NOR) and their use in circuits COMMUNICATION AND NETWORK CONCEPTS Evolution of Networking: ARPANET, Internet, Interspace; Different ways of sending data across the network with reference to switching techniques; Data Communication terminologies: Concept of Channel, Baud, 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, Hub, Switch, Gateway; Different Topologies- Bus, Star, Tree; Concepts of LAN, WAN, MAN; Protocol: TCP/IP, File Transfer Protocol (FTP), PPP, Level-Remote Login (Telnet), Internet, Wireless/Mobile Communication, 7 10 7 3 Periods Through Power Point Presentation or any other Media

GSM, CDMA, WLL, 3G, SMS, Voice mail, Application Electronic Mail, Chat, Video Conferencing; Network Security Concepts: Cyber Law, Virus threats and prevention, Firewall, Cookies, Hacking; WebPages; Hyper Text Markup Language (HTML), extensible Markup Language (XML); Hyper Text Transfer Protocol (HTTP); Domain Names; URL; Protocol Address; Website, Web browser, Web Servers; Web Hosting. 8 16 th Nov. 30 th Nov. Revision of chapters to be done based on the requirement of students. 9 1 st Dec. 22 nd Dec. Revision for the preparation of First Preboard. 10 2 nd Jan 31 st Jan Revision for the preparation of Second Preboard. * These program will help students to understand the topics better. 8