Page 1 :
COMPUTER SCEINCE, CLASS-XI, THEORY PAPER, One Paper, Unit No., 1, 2, 3, 4, 5, , 3 Hours, Unit Name, COMPUTER FUNDAMENTALS, , PROBLEM SOLVING, INTRODUCTION TO PYTHON, PROGRAMMING WITH PYTHON, EMERGING TRENDS AND SOCIETAL IMPACTS, , 7O Marks, Marks, 10, 07, 30, 15, , 08, , A minimum of 180 periods including practicals, UNIT- I: COMPUTER FUNDAMENTALS, Chapter 1:Computer System, , 10 Marks, 20 Periods, , Introduction to computer and computing: evolution of computing devices, data and, information, types of data, functional components of a computer system and their, interconnections, I/O devices, data transfer through systembus., Computer Memory: Units of memory, types of memory – primary and secondary; data, deletion, its recovery and related security concerns., Microprocessor: Evolution, features of microprocessor including memory size, word size,, clock speed, introduction to microcontrollers., Software: purpose and types – system and application software, operating system, language, translators, device drivers, programming tools, generic and specific purpose software,, classification of programming languages (high level language, machine language)., Operating System (OS): Need for operating system, brief introduction to functions of OS,, user interface., Chapter 2: Encoding Schemes and Number System, , 10 Periods, , Encoding schemes: American Standard Code for Information Interchange (ASCII),, UNICODE, Indian Script Code for Information Interchange (ISCII), Number system: Decimal, Binary, Octal and Hexadecimal number system and converting a, number from a number system to another, including its fractional part.

Page 2 :
UNIT – II: PROBLEM SOLVING, Chapter 4:Problem Solving, , 7 Marks, 18 Periods, , Introduction to Problem Solving: problem solving cycle - analyzing a problem, designing, algorithm, implementation through coding, testing the solution, Algorithms: what is an algorithm, need of algorithm in problem solving, characteristics of, algorithm, representation of algorithm using flowchart and pseudo-code, Programming: concept of a program, need for writing programs, process of conceptualizing, a solution to a problem and moving from algorithm to programming., Programming Constructs: Sequence, Selection and Iteration; Simulation (dry run) of program, for better understanding of algorithm; Comparison and Analysis of Algorithms through, simulations., Decomposition: concept, need for decomposing a problem, examples of problem-solving, using decomposition., UNIT – III: INTRODUCTION TO PYTHON, Chapter 5: Getting started with Python, , 30 Marks, 35 Periods, , Basics of Python programming, working with Python interpreter in interactive mode and, script mode, structure of a program, debugging-errors and exceptions, identifiers, keywords,, constants, variables, types of operators, precedence of operators, data types, mutable and, immutable data types, statements, expressions, evaluation and comments, input and output, statements, data type conversion, debugging, Chapter 6 : Flow of control, , 15 Periods, , Control structures: Sequence, selection (decision) and repetition (iteration) Selection: if, ifelse, and nested if statement, indentation, Repetition: for, while, and nested loops, break,continue;, Chapter 7: Functions, , 20 Periods, , Introduction to functions, need of functions, User defined functions: passing arguments to a function, returning values from functions,, scope of variables,, Standard library: using built-in functions, importing modules-math, random, statistics,, creating and importing user defined module.

Page 3 :
UNIT – IV: PROGRAMMING WITH PYTHON, Chapter 8: Strings, , 15 Marks, 10 Periods, , Strings: initializing strings and accessing strings, string operations, built-in functions for, string manipulation, string traversal, string as argument to function, Chapter 9: Lists, 12 Periods, Lists: list operations - creating, initializing, traversing and manipulating lists, list methods, and built-in functions, nested lists, list as argument to a function., Chapter 10: Tuples and Dictionary, , 20 Periods, , Tuples: Creating, initializing, accessing elements, tuple assignment, operations on tuples,, tuple methods and built-in functions, nested tuples., Dictionary: concept of key-value pair, mutability, creating, initializing, traversing, updating, and deleting elements; dictionary methods and built-in functions., UNIT – V: EMERGING TRENDS AND SOCIETAL IMPACTS, Chapter 3: Emerging Trends, , 15 Marks, 10 Periods, , Brief understanding of the following emerging trends:, Artificial Intelligence, Machine learning, Natural Language Processing, Immersive, experience, Robotics, Big data and its characteristics, Internet of Things (IoT), Sensors,, Smart cities, Cloud Computing and Cloud Services (SaaS, IaaS, PaaS); Grid Computing,, Blockchain technology, Chapter 11: Societal Impacts, 10 Periods, Digital footprint, Etiquettes for Net surfing and for communicating through social medias,, data protection, Intellectual Property Rights (IPR) and their violation, plagiarism and, copyrights, Free and Open Source Software (FOSS), Cyber crime and cyber laws, hacking,, phishing, cyber bullying, Indian IT Act, preventing cyber crime., Awareness about health concerns related to usage of technology like effect on eyesight,, physiological issues and ergonomic aspects., PRESCRIBED TEXTBOOK:, Computer Science for class XI, Published by : NCERT, New Delhi, REFERENCE BOOK :, Saraswati Computer Science for Class XI, By Reeta Sahoo and Gagan Sahoo, Published by New Saraswati House (India) Private Limited,, New Delhi – 110002, , 

Page 4 :
DESIGN OF, QUESTION PAPER, SUBJECT: COMPUTER SCIENCE, PAPER: THEORY, CLASS: XI, FULL MARK : 70, TIME: 3 HOURS, WEIGHTAGE TO OBJECTIVES:, Objectives, , I, , Marks, 14, 32, 21, 03, 70, , Knowledge (K), Understanding (U), Application (A), Skill (S), , Percentage, 20, 46, 30, 04, 100, , WEIGTHAGE OF FORM OF QUESTIONS:, Form of Questions, , II, , Essay/Long Answer (E/LA), Short Answer (SA-I), Short Answer (SA-II), Very Short Answer (VSA), MCQ, Total, , No. of, questions, 04, 05, 10, 10, 05, 34, , Time, (in minutes), 60, 30, 50, 30, 10, 180, , Marks, , Percentage, , 20, 15, 20, 10, 05, 70, , 29, 21, 29, 14, 07, 100, , WEIGHTAGE OF CONTENTS, , III, , IV, V, VI, , UNIT, 1, 2, 3, 4, 5, , TOPIC, COMPUTER FUNDAMENTALS, PROBLEM SOLVING, INTRODUCTION TO PYTHON, PROGRAMMING IN PYTHON, EMERGING TRENDS AND SOCIETAL IMPACTS, TOTAL, , MARKS, 10, 07, 30, 15, 08, 70, , SCHEME OF SECTION : Nil, SCHEME OF OPTION: Nil, DIFFICULTY LEVEL:, Difficulty, : 30%, Average, : 50%, Easy, : 20%, , Abbreviation: K (Knowledge), U (Understanding), S(Skill), E (Essay Type),, SA(Short Answer Type), VSA (Very Short Answer Type), MCQ(Multiple Choice, Question)

Page 5 :
COMPUTER SCIENCE, CLASS- XI, PRACTICAL, , One Paper, , 3 Hours, , UNIT, , TOPICS, , 30 Marks, MARKS, , Programming in Python, One programming problem in Python to be developed and tested in, Computer., 1, , During the examination. Marks are allotted on the basis of, following:, Logic, : 5 Marks, Documentation/Indentation : 2 Marks, Output presentation, : 3 Marks, Notes: The types of problems to be given will be of application type, from the following topics:, , 10, , Project work, 2, , As mentioned in general guidelines for project, given at the end of, the curriculum), , 10, , Practical File, 3, , Must have minimum 15 programs from the topics covered in Class, XI course., , 05, , Viva voce, 4, , Viva will be asked from syllabus covered in Class XI and the, project developed by the student, , ——§§§——, , 05

Page 6 :
COMPUTER SCIENCE, CLASS- XI, PRACTICAL, , Marks Allotted, , Estimated Time (Min), , 4., , Operational Skills, , 3., , Debugging skills, , 2., , Project Record, Algorithm/ Program, Major, Writing, Short, Viva-Voce, Sessional, Record File of, Record, Program/Algorithm, , Program Presentation, , Short, , Nature of Exercise, , 30 Marks, , Program correctness, , Form of Exercise, , 1., , 3 Hours, , Booting skills, , Sl. No., , One Paper, , 0, , 2, , 4, , 2, , 2, , 10, , 60, , 0, , 5, , 2, , 2, , 1, , 10, , 100, , 0, , 0, , 1, , 2, , 2, , 5, , 20**, , 0, , 3, , 2, , 0, , 0, , 5, , x, , N.B. : Only one python program is to be performed by each student., ** No fixed time is allotted for Viva-Voce. It is to be performed during the course of, the examination., , ——§§§——

Page 7 :
FOR THE ACADEMIC SESSION 2021-2022, COMPUTER SCEINCE, CLASS-XII, THEORY PAPER, One Paper, Unit No., 1, 2, 3, 4, 5., , 3 Hours, Unit Name, PROGRAMMING IN C++, DATA STRUCTURES, DATA BASE & SQL, BOOLEAN ALGEBRA, COMMUNICATION & NETWORK CONCEPTS, , 7O Marks, Marks, 26, 16, 10, 10, 08, , Unit 1 : PROGRAMMIN IN C++, 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 from object (s), Array of type class, 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, argumnets;, 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, Publicity derived and Protectedly derived class,, accessibility of members from objects and within derived class(es);

Page 8 :
Date File Handling :, Need for a date 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); 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, fstream 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(), put(), getline() 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 : Arraly 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;, Unit 2 : 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 : (Cricular Array and Linked Implementation) :, Operations on Queue (Insert and Delete) and its Implementation in C++,, Unit 3 : 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;

Page 9 :
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;, Note : Implementation of the above mentioned commands could be done on any SQL, supported software., Unit 4 : BOOLEAN ALGEBRA, Evolution of 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,, 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 from the Truth Table,, Reducing Boolean Expression (SOP and POS) to its minimal form, Use of Karnaugh, Map for minimisation of Boolean expressions (up to 4 variables); Basic Logic Gates, (NOT, AND, OR, NAND, NNOR) and their use in circuits., Unit 5 : 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, GSM, CDMA, WLL, 3G, SMS, Voice mail,, Application Electronic Mail, Chat, Video Conferencing; Network Security Concepts :, Cyber Law, Firewall, Cookies, Hackers and Crackers;, 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., 

Page 10 :
COMPUTER SCIENCE, , One Paper, , CLASS XII, PRACTICAL, 3 Hours, , Unit No., , Unit Name, , 30 Marks, Marks, , 1., , Programming in C++, 10, One programming problem in C++ to be developed and tested in Computer During the, examination. Marks are alloted on the basis of following :, Logic, :, 5 Marks, Documentation/Indentation :, 2 Marks, Output presentation, :, 3 Marks, Notes : The types of problems to be given will be of application type from the following, topics, , Arrays (One dimensional and two dimensional), , Array of structure, , Stack using arrays and linked implementation, , Queue using arrays (circular) linked implementation, , Binary File operations (Creation, Displaying, Searching and modification), , Text File operations (Creation, Displaying and modification), , 2., , SQL Commands, 05, Five Query questions based on a particular Table/Realtion to be tested practically on, Computer during the examination. The command along with the result must be written in, the answer sheet., , 3., , Project Work, 05, The project has to be developed in C++ language with Object Oriented Technology and, also should have use of Data files., , Presentation on the computer, , Project report (Listing, Sample, Outputs, Documentation, , Viva, , 4., , Practical File, 05, Must have minimum 20 programs from the following topics, , Arrays (One dimensional and two dimensional, sorting, searching, merging, deletion, & insertion of elements), , Arrays of structures, Arrays of Objects, , Stacks using arrays and linked implementation, , Queues using arrays (linear and circular) and linked implementation, , File (Binary and Text) operations (Creation, Updation, Query), , Any computational based problems, 15 SQL commands along with the output based on any table/relation :, , 5., , Viva Voce, 05, Viva will be asked from syllabus covered in class XII and the project developed by student.

Page 11 :
GUIDELINES FOR PROJECTS (Class XII), 1., , Preamble, , 1.1, , The academic course in Computer Science includes one Project in each year. The Purpose, behind this is to consolidate the concepts and practices imparted during the course and to, serve as a record of competence., , 1.2, , A group of two students/three students as teeam may be allowed to work on one project., , 2., , Project content, , 2.1, , Project for class XI can be selected from one of the topics given in event programming., , 2.2, , Project for class XII should ensure the coverage of following areas of curriculum :, a. Problem Solving, b. Data Structure, c. Object Oriented Programming in C++, d. Data File Handling, Theme of the project can be,  Any subsystem of a System Software or Tool,  Any Scientific or a fairly complex algorithmic situation,  Business oriented problems like Banking, Library information system., Hotel or Hospital management system, Transport query system,  Quizzes/Games;,  Tutor/Computer Aided Learning Systems, , 2.3, , The aim of the project is to highlight the abilities of algorithmic formulatin, modular, programming, optimized code preparation, systematic documentation and other associated, aspects of Software Development., , 2.4, , The assessment would be through the project demonstration and the Project Report, which, should portray Programming Style, Structured Design, Minimum Coupling, High Cohesion,, Good documentation of the code to ensure readability and ease of maintenance., , PRESCRIBED TEXTBOOK :, Computer Science for class XII, By : Preeti Gehlot, Charu Gupta,, Published by : Oxford University Press, , REFERENCE BOOKS :, Computer Organisation and boolean Algebra, 1. Rajaraman, FUNDAMENTALS OF COMPUTERS, Prentice Hall of India.

Page 12 :
2. C.W. Gear, COMPUTER ORGANISATION AND PROGRAMMING, McGraw Hill, Publishing., 3. A.P. Malvino, DIGITAL COMPUTER FUNDAMENTALS, Tata McGraw Hill Publishing, Co.Ltd., 4. J. Shelly & Roger Hunt, COMPUTER STUDIES, Wheeler's Publication., 5. C.S. French, COMPUTER STUDIES, Arnold Publishers., 6. Thomas C. Bartee, DIGITAL COMPUTER FUNDAMENTALS, McGraw Hill, International., Problem Solving and Programming in C++, Note : Prior knowledge of C is not required in the learning of C++, even though reference, about C are made in some of the books., 1. Robert Lofore, OBJECT ORIENTED PROGRAMMING IN TURBO C++, Galgotia, Publication Pvt. Ltd., 2. David Parsons, OBJECT ORIENTED PROGRAMMING WITH C++, BPB Publication., 3. Bjarne Stroutrup, THE C++ PROGRAMMING LANGUAGE, Adison Wesley., 4. AI Stevens, TEACH YOUR SELF C++ TECHNIQUES & APPLICATIONS, BPB, Publications., 5. Scott Robert Ladd, TURBO C++ TECHNIQUES & APPLICATIONS, BPB Publications., Operating Environment, 1. Ritchi, Operating Systems, BPB Publications., 2. James L. Peterson & Abraham S., OPERATING SYSTEM, Addision-Wesley Publishing, Company., Data Structures, 1. M.A., Weiss, Data Structures and Algorithm Analysis in C++, the Benjamin/Cummings, Pub. Co., Inc., 2. Scott Robert Ladd, C++ COMPONENTS AND ALGORITHMS, BPB Publications., Database Management System and SQL, 1. Martin Gruber, UNDERSTANDING SQL, BPB Publications., 2. Sheldon M. Dunn x Base Cross Reference Handbook, First Authorised Asian Edition 93,, Tech. Publications Pvt. Ltd., 3. C.J. Data, DATABASE PRIMER, Adison Wesley., Computer Network, 1. A.S. Tanenbaum, Computer Network, Prentice Hall of India P. Ltd., 2. Williams Stalling, Data Communication and Networks, Prentice Hall of India P. Ltd., 3. Hancock, Network Concept and Architecture, BPB Publications.

Page 13 :
Reference Magazines, PC WORLD, COMPUTER TODAY, PC QUEST, DATA QUEST, COMPUTER WORLD., Reference Manuals, OPERATING SYSTEM MANUAL, C++ COMPILER MANUAL, 

Page 14 :
DESIGN OF, QUESTION PAPER, Subject, Paper, Class, Full Mark, Time, , I., , WEIGHTAGE TO OBJECTIVES :, Objectives, Knowledge (K), Understanding (U), Application (A), Skill (S), , :, , COMPUTER SCIENCE, , :, :, :, :, , Theory, XII, 70, 3 Hours, Marks Percentage, 14, 20, 32, 46, 21, 30, 3, 4, Total, 70, 100, , :, WEIGHTAGE TO FORM OF QUESTIONS :, Form of Questions, No. of Questions Time (in minutes) Marks Percentage, Essay/Long Answer (E/LA), 4, 60, 20, 29, Short Answer (SA-I), 5, 30, 15, 21, II., Short Answer (SA-II), 10, 50, 20, 29, Very Short Answer (VSA), 10, 30, 10, 14, MCQ, 5, 10, 5, 7, Total :, 34, 180, 70, 100, WEIGHTAGE TO CONTENTS :, Unit, Tropics, Marks, 1, Programming in C++, 26, 2, Data Structures, 16, Database & SQL, 10, III. 3, 4, Boolean Algebra, 10, 5 Communication & Network Concepts, 8, 70, Total :, IV. SCEHEME OF SECTION : Nil, Nil, V. SCHEME OF OPTION :, DIFFICULTY LEVEL, :, Difficulty : 30% marks, VI., Average : 50% marks, Easy, : 20% marks, Abbreviation :, , K(Knowledge), U(Understanding ), C(Comprehension), Exp.(Expression),, Skill(S), E(Essay Type), SA (Short Answer Type), VSA (Very Short Answer, Type), MCQ(Multiple Choice Question)

Page 15 :
DESIGN, QUESTION PAPER/UNIT TEST, Subject, Unit/Paper, Class, Full Marks, Time, , :, :, :, :, :, , COMPUTER SCIENCE, Practical, XII, 30, 3 Hours, , Sl. No., , Form of Exercise, , Booting skills, , Program Correctness, , Program Presentation, , Debugging Skills, , Operational Skills, , Marks Allotted, , Estimated Time (Min), , Skills/Objectives to be tested., , 1., , Short, , Project Record, , 0, , 3, , 3, , 1, , 1, , 8, , 45, , 2., , Major, , Algorithm/Program, Writing, , 0, , 10, , 2, , 2, , 1, , 15, , 120, , Viva-Voce, , 0, , 0, , 1, , 1, , 0, , 2, , 15**, , 0, , 3, , 2, , 0, , 0, , 5, , x, , Nature of Exercise, , 3., , Short, , 4., , Sessional Record File of, Record, Program/Algorithm, , N.B. : Two programs are to be performed by each student and marks given at Sl. No. 2 (Major, Exercise) is to be distributed as 10 marks for one C++ program and 5 marks for 5 query, questions from SQL commands., ** No fixed time is allotted for Viva-Voce. It is to be performed during the course of the, examination., , 