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

Similar documents
KENDRIYA VIDYALAYA SANGATHAN

KENDRIYA VIDYALAYA SANGATHAN

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

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

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

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

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

REVISED SYLLABUS UNIT 5

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

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

ONE MARKS QUESTION AND ANSWERS

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

(Structured Query Language)

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

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

Downloaded from

HIGER SECONDARY FIRST YEAR COMPUTER SCIENCE

COMPUTER SCIENCE 2002 (Delhi Board)

SAMPLE PAPER. Class: XII SUBJECT COMPUTER SCIENCE. Time: 3 Hours MM: 70

Networks. Computer Technology

LIST OF EXPERIMENTS. (1) (Office Automation)

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

DELHI PUBLIC SCHOOL BOKARO STEEL CITY

SCIENCE ENTRANCE ACADEMY III PREPARATORY EXAMINATION SCHEME OF VALUATION

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

Previous Year Questions

Chapter 2. Boolean Expressions:

Syllabus for Computer Science General Part I

Chapter 7. Telecommunications, the Internet, and Wireless Technology

(d) Observe the following C++ code very carefully and rewrite it after removing any/all syntactical errors: [2] Include < iostream.

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

KENDRIYA VIDYALAYA SANGATHAN, COMPUTER SCIENCE (THEORY) I PRE-BOARD TIME 3 HRS CLASS XII M. Marks 70

HALF YEARLY SYLLABUS CLASS XII

Özgür ZEYDAN (PhD.)

COMPUTER SCIENCE. Time allowed : 3 hours Maximum Marks : 70

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

Assignment 3 Class XII (Computer Science 083) Topic Array

Sai Nath University. Assignment For MCA 2nd Sem.

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

COMMUNICATION AND NETWORK CONCEPTS

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

COMPUTER SCIENCE

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

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

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

ISC 2006 COMPUTER SCIENCE PAPER 1 THEORY PART I Answer all questions in this part

List of Practical for Class XII Computer Science

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

Chapter 4: Networking and the Internet


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

COMPUTER NETWORKING. Terminology of Network:

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

Typical Network Uses

Chapter 4: Networking and the Internet

B.Sc II Year Computer Science (Optional)

ก ก Information Technology II

COMPUTER SCIENCE SAM PLE PAPER 2-HALF YEARLY EXAMINATION

2016 COMPUTER SCIENCE

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct.

B.Sc. Computer Science (Ancillary)

COMPUTER SCIENCE 1998 (Delhi Board)

VISUAL SUMMARY COMMUNICATION CHANNELS COMMUNICATIONS. Communications and Networks

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

CLASS XII COMPUTER SCIENCE(083) TimeAllowed : 3 HrsMax Marks : 70

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Department Curriculum and Assessment Outline

COMMUNICATION AND NETWORK CONCEPTS TYPE A: VERY SHORT ANSWER QUESTION

ASHOK GARG MOBILE :

IMPORTANT QUESTIONS WITH ANSWERS FOR II PU FINAL EXAMINATION

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

COMPONENTS OF DATA COMMUNICATION

CBSE GUESS PAPER. Roll No. Computer Sc. XII(083)/

SAURASHTRA UNIVERSITY

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

Downloaded from

DELHI PUBLIC SCHOOL BOKARO STEEL CITY ASSIGNMENT FOR THE SESSION

Homework Identify a suitable project topic that conforms to project requirements

Computer Networks and Internet

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

Core Syllabus. Version 2.6 C OPERATE KNOWLEDGE AREA: OPERATION AND SUPPORT OF INFORMATION SYSTEMS. June 2006

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

Computer Science Engineering Sample Papers

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

INTRODUCTION TO ICT.

Edexcel GCSE in Computer Science Microsoft IT Academy Mapping

Question Bank Class XII Subject : Computer Science

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

Transcription:

KENDRIYA VIDYALAYA SANGATHAN BHUBANESWAR REGION SPLITUP SYLLABUS FOR COMPUTER SCIENCE 2015-16 CLASS XII MONTH PORTION TO BE COVERED THEORY PRACTICAL April-May 2015 June-July 2015 Aug-2015 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; Function Overloading: Need for Function Overloading, Declaration and Definition, Restrictions on Overloaded Functions, Calling Overloaded Functions (Monthly Test 1) 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 andwithin 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). (Monthly Test 2) 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 22 18 33 15 23 9

Sep-2015 Oct-2015 Nov-2015 to structure: De-reference/Deference operator: *, ->; self-referential structure; (Monthly Test 3) 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 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. (Monthly Test 4) Distribution of Project to groups 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; 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 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; (Monthly Test 5) 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); 23 9 17 9 21 9

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. 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 (Talent), and Internet Wireless/Mobile Communication protocol such as GSM, CDMA, GPRS, and WLL. Mobile Telecommunication Technologies : 1G, 2G, 3G and 4G 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. 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 (Half Yearly Exam) Dec-2015 Revision and Project Completion Pre-Board I 19 9 Jan-2016 Revision and Project Submission Pre-Board II 22 9 Feb-2016 Revision AISSCE Practicals 23 9 List of suggested Practicals for Class XII CS S No Name of Practical 1 Write a menu based C++ program to do the following (Use user defined functions in each case): 1. Check for Prime number 2.Reverse of a number 3.Sum of individual digits of a number 2 Write a menu based C++ program to do the following (Use user defined functions in each case): 1.Reversing the 1 D integer Array 2.Swapping the first half with the second half in an 1D integer array

3 Write a menu based C++ program to do the following (Use user defined functions in each case): 1. Swapping the top half rows with the bottom half rows in a 2D integer array 2.Swapping the left half columns with the right half columns in a 2D integer array. 3.Transpose of a 2D integer array 4 Write a menu based C++ program to do the following (Use user defined functions in each case): 1.Reverse of a String 2.Word count 3.Vowel count 5 Write a C++ function to return the largest string from an array of strings and implement in a program. 6 Write a c++ program to implement an array of structures for Student (rollno, name, marks). The program should contain functions to add a student, display the student list and display the student details having highest marks. 7 Write a class Hotel in c++ with following description: Private members: Rno // Data member to store Room No Name // Data member to store customer name Tarrif // Data member to store per day charges Days //Number of days of stay Calculate() // A function to calculate and return the amount days*tarrif. If the product is greater that 5000 then return 1.05*days*tarrif Public members: Checkin() // A function to enter Rno, Name, Tarrif and days Display() // A function to display Rno, Name, Tarrif, days and total amount as per the called Calculate() function Instantiate the class and write the main function as needed. 8 Write a class Student with the following description: Private members: Rollno Integer name String marks Integer getgrade() should return the grade as A if marks is greater than 90 or else return B Public members: Setdata() to insert the values to the private members. Display() to display the details along with grade. Write the main() function and invoke the object.

9 Write a menu driven program to do the following in text file handling: Write a C++ function to count the number of occurrence of character passed as the parameter of the function. Write a C++ Function that counts the number of articles( A, An and The ) in a given text files. Write a C++ function that transfers all the vowels from source.txt to target.txt. Write a C++ function to count the number of lines starting with an alphabet passed as parameters. Write a C++ function that counts the number of lines starting with the word the. Write a C++ function that calculates the average word count in a text file 10 Write a menu Based application to do the following on Binary file :- class Student{ int rollno; char name[20]; int marks; public: void setdata();//to acquire data for the student from user void showdata();// to display the student data for all students int getmarks(){ return marks;} void givegrace(){marks=33;}}; Write functions to insert objects in student.dat file. Write function to disply objects from the student.dat file Search all the objects whose marks are between 28 and 32, apply givegrace() function and write back to the file. 11 Write a program to perform the following in 1-D array. 1.Linear search. 2.Binary search. 12 Write a program to perform the following in 1-D array. 1. Selection sort. 2.Insertion sort. 3.Bubble Sort 13 Array implementation of Stack and Queue. 14 Array implementation of Circular Queue. 15 Linked List implementation of Stack. 16 Linked list implementation of Queue. 17 Questions on My SQL. My SQL queries based on student table.(10 Queries) My SQL queries based on staff table.(10 Queries) My SQL queries based on Employment(EMP) and Department(DEP) table.(10 Queries) My SQL queries based on Music store and album table.(10 Queries)