14.

COMPUTER SCIENCE (CODE: 083)

Note: Schools may choose from option 1 (Python) or option 2 (C++) and teach accordingly
Learning Objectives:
1. To understand basics of computers.
2. To develop logic for Problem Solving.
3. To develop problem solving skills and their implementation through Python (version: 2.7) or to implement
Object Oriented Programming using C++.
4. To understand and implement the concept of Object Oriented Methodology.
5. To understand the concept of working with Relational Database.
6. To understand the basic concept of Computing Logic.
7. To understand the basic concepts of Communication and Networking technologies.
8. To understand Open Source Software.
CLASS XI (Theory) - Python
Unit No.

Unit Name

MARKS

COMPUTER FUNDAMENTALS

10

PROGRAMMING METHODOLOGY

12

INTRODUCTION TO PYTHON

18

PROGRAMMING WITH PYTHON

30
70

UNIT 1: COMPUTER FUNDAMENTALS

(18 Theory + 6 Practical) Periods
Evolution of computers; Basics of computer and its operation; Functional Components and their
interconnections, concept of Booting. Classification of Computers.
Software concepts: Types of Software - System Software, Utility Software and Application Software
System Software: Operating System, Complier, Interpreter and Assembler
Operating System: Need for Operating System, Functions of Operating System (Processor Management,
Memory Management, File Management and Device Management), Types of Operating System-interactive
(GUI based), Time Sharing, Real Time and Distributed, Commonly used operating system: UNIX, LINUX,
Windows, Solaris, BOSS (Bharat Operating System Solutions); Mobile OS - Android, Symbian.
Utility Software: Anti Virus, File Management tools, Compression tools and Disk Management tools
(Disk Cleanup, Disk Defragmenter, Backup).
Open Source Concepts: Open Source Software, Freeware, Shareware, Proprietary Software.
Application Software: Office Tools - Word Processor, Presentation Tool, Spreadsheet Package, Database
Management System; Domain Specific tools - School Management System, Inventory Management System,
Payroll System, Financial Accounting, Hotel Management, Reservation System and Weather Forecasting
System.
Number System: Binary, Octal, Decimal, Hexadecimal and conversion between two different number
systems.
Internal Storage encoding of Characters: ASCII, ISCII (Indian scripts Standard Code for Information
Interchange), and UNICODE (for multilingual computing)
Microprocessor: Basic concepts, Clock speed (MHz, GHz), 16 bit, 32 bit, 64 bit processors; 128 bir processors;
Types - CISC Processors (Complex Instruction set computing), RISC Processors (Reduced Instruction set
computing), and EPIC (Explicitly parallel Instruction computing).
Memory Concepts: Units: Byte, Kilo Byte, Mega Byte, Giga Byte, Tera Byte, Peta Byte, Exa Byte, Zetta
Byte, Yotta Byte.
Primary Memory: Cache, RAM, ROM
Secondary Memory: Fixed and Removable storage - Hard Disk Drive, CD/DVD Drive, Pen Drive, Blue
Ray Disk.

185

Input Output Ports/ Connections: Serial, Parallel and Universal Serial Bus, PS-2 port, Infrared port,
Bluetooth, Firewire.
UNIT 2: PROGRAMMING METHODOLOGY
(28 Theory + 10 Practical) Periods
General Concepts: Modular Approach, Clarity and Simplicity of Expressions, Use of proper names for
Identifiers, Comments, Indentation; Documentation and Program Maintenance; Running and Debugging
programs, Syntax Errors, Run-Time Errors, Logical Errors
Problem solving Methodologies: Understanding of the problem, solution for the problem, identifying
minimum number of inputs required for output, writing code to optimizing execution time and memory
storage, step by step solution for the problem, breaking down solution into simple steps (modular approach),
identification of arithmetic and logical operations required for solution; Control Structure- conditional
control and looping (finite and infinite).
Problem Solving: Introduction to Algorithms/Flowcharts.
UNIT 3: INTRODUCTION TO PYTHON
(44 Theory + 36 Practical) Periods
Getting Started: Introduction to Python- an interpreted high level language, interactive mode and script
mode.
Variables, Expressions and Statements: Values, Variables and keywords; Operators and Operands in
Python: (Arithmetic, relational and logical operators), operator precedence, Expressions and Statements
(Assignment statement); Taking input (using raw_input() and input()) and displaying output(print statement);
Putting Comments.
Functions: Importing Modules (entire module or selected objects), invoking built in functions, functions
from math module (for e.g. ceil, floor, fabs, exp, log, log10, pow, sqrt, cos, sin, tan, degrees, radians), using
random() and randint() functions of random module to generate random numbers, composition.
Defining functions, invoking functions, passing parameters (default parameter values, keyword arguments),
scope of variables, void functions and functions returning values, flow of execution
Conditional constructs and looping: if else statement
While, For (range function), break, continue, else, pass, Nested loops, use of compound expression in
conditional constructs and looping
UNIT 4: PROGRAMMING WITH PYTHON
(50 Theory + 48 Practical) Periods
Strings: Creating, initialising and accessing the elements; String operators: +, *, in, not in, range slice
[n:m]; Comparing strings using relational operators;
String functions & methods: len, capitalize, find, isalnum, isalpha, isdigit, lower, islower, isupper, upper,
lstrip, rstrip, isspace, istitile, partition, replace, join, split, count, decode, encode, swapcase, Pattern Matching
Lists: Concept of mutable lists, creating, initializing and accessing the elements, traversing, appending,
updating and deleting elements;
List operations (joining, list slices);
List functions & methods: len, insert, append, extend, sort, remove, reverse, pop
Dictionaries: Concept of key-value pair, creating, initializing and accessing the elements in a dictionary,
traversing, appending, updating and deleting elements
Dictionary functions & Methods: cmp, len, clear(), get(), has_key(), items(), keys(), update(), values()
Tuples: Immutable concept, creating, intialising and accessing the elements in a tuple; Tuple functions:
cmp(), len(), max(), min(), tuple()

Class XI (Practical) -- Python

Duration: 3 hours

Total Marks: 30

1.

Programming in Python
12
One programming problem in Python to be developed and tested on Computer during the examination. Marks
are allotted on the basis of following:
Logic
:
7 Marks
Documentation
:
2 Marks
Output presentation
:
3 Marks

2.

Project Work
08
Problems related to String and List manipulation
General Guidelines: Initial requirement, developing an interface for user (it is advised to use textbased interface

186

screen), developing logic for playing the game and developing logic for scoring points

Hollywood/Hangman: A word Guessing game

Cows 'N Bulls: A word/number Guessing game

Random Number Guessing Game (High\Low)

A game to check whether a word does not use any of the forbidden letters
or
Similar projects may be undertaken in other domains
(As mentioned in general guidelines for project, given at the end of the curriculum in a group of 2-4 students)
3.

Practical File
05
(a)
Record of the configuration of computer system used by the student in the computer lab (by exploring
inside computer system in the first 2 lab classes).
(b) Must have minimum 20 programs from the topics covered in class XI course.

5 Programs on Control structures

5 Programs on String manipulations

5 Programs on List Manipulations

5 Programs on Dictionaries and Tuples

4.

Viva Voce
Viva will be asked from the syllabus covered in class XI and the project developed by the student(s).
OR

05

Class XI (Theory) C++

Duration: 3 hours

Total Marks: 70

Unit No.

Unit Name

MARKS

1.

COMPUTER FUNDAMENTALS

10

2.

INTRODUCTION TO C++

14

3.

PROGRAMMING METHODOLOGY

12

4.

PROGRAMMING IN C++

34
70

UNIT 1:

Common to both the options. Refer to unit 1 mentioned in case of Python for further details

UNIT 2:

INTRODUCTION TO C++
(44 Theory + 36 Practical) Periods
Getting Started: C++ character set, C++ Tokens (Identifiers, Keywords, Constants, Operators,),
Structure of a C++ Program (include files, main function), Header files - iostream.h, iomanip.h, cout,
cin; use of I/O operators (<<and>>), Use of endl and setw (), Cascading of I/O operators, Error
Messages; Use of editor, basic commands of editor, compilation, linking and execution.
Data Types, Variables and Constants: Concept of Data types; Built-in Data types: char, int, float
and double; Constants: Integer Constants, Character constants - \n, \t, \b), Floating Point Constants,
String Constants; Access modifier: const; Variables of built-in-data types, Declaration/Initialization of
variables, Assignment statement, Type modifier: signed, unsigned, long
Operator and Expressions: Operators: Arithmetic operators (-,+,*,/,%), Unary operator (-), Increment
(++) and Decrement (--) Operators, Relation operator (>,>=,<=,=,!=), Logical operators (!,&&,II),
Conditional operator: <condition>?<if false>; Precedence of Operators; Automatic type conversion
in expressions, Type casting; C++ shorthands (+=,- =,*=,/=,%=)
PROGRAMMING METHODOLOGY -- common to both the options. Refer to unit 2 mentioned
in case of Python for further details

UNIT 3:
UNIT 4:

PROGRAMMING IN C++
(50 Theory + 48 Practical) Periods
Flow of control:
Conditional statements: if else, Nested if, switch..case..default, use of conditional operator, Nested
switch..case, break statement (to be used in switch..case only); Loops: while, do - while, for and
Nested loops

187

Inbuilt Functions
Header file Categorization

Header File

Function

Standard input/output functions

stdio.h

gets ( ), puts ( )

Character Functions

Ctype.h

isalnum ( ), isalpha ( ),

String Function

string.h

isdigit ( ), islower ( ),
isupper ( ), tolower ( ),
toupper ( )
strucy ( ), strcat ( ),

Mathematical Functions

math.h

strlen ( ), strcmp ( ),
strcmpi ( ), strev ( ),
strlen ( ), strupur ( ),
strlwr ( )
fabs ( ), pow ( ), sgrt ( ),

Other Functions

stdlib.h

sin ( ), cos ( ), abs ( )

randomize ( ), random ( )

User Defined Functions :

Introduction to user-defined function and its requirements.
Defining a function; function prototype, Invoking/calling a function, passing arguments to function, specifying argument
data types, default argument, constant argument, call by value, call by reference, returning values from a function,
calling functions with arrays, scope rules of functions and variables local and global variables.
Structured Data Type:
Arrays: Introduction to Array and its advantages.
One Dimensional Array : Declaration/initialization of One-dimensional array, inputting array elements, accessing
array elements, manipulation of array elements (sum of elements, product of elements, average of elements, linear
search, finding maximum/minimum value)
Declaration / Initialization of a String, string manipulations (counting vowels/ consonants/ digits/ special characters,
case conversion, reversing a string, reversing each word of a string)
Two-dimensional Array
Declaration/initialization of a two-dimensional array, inputting array elements accessing array elements, manipulation
of array elements (sum of row element, column elements, diagonal elements, finding maximum / minimum values)
User-defined Data Types: Introduction to user defined data types.
Structure
Defining a Structure (Keyword Structure), declaring structure variables, accessing structure elements, passing structure
to functions as value and reference argument/parameter, function returning structure array of structure, passing an
array of structure as an argument/ a parameter to a function.
Defining a symbol name using typedef keyword and defining a macro using #define preprocessor directive.
Class XI (Practical) - C++
Duration: 3 hours

Total Marks : 30

Programming in C++
12
One programming problem in C++ to be developed and tested in Computer during the examination. Marks
are allotted on the basis of following:
Logic
:
7 Marks
Documentation/Indentation
:
2 Marks
Output presentation
:
3 Marks

Project Work
08
Problems related to String, Number and Array manipulation
General Guidelines; Initial Requirement, developing an interface for user (it is advised to use text based interface
screen), developing logic for playing the game and developing logic for scoring points
1.
Memory Game : A number guessing game with application of 2 dimensional arrays containing randomly
generated numbers in pairs hidden inside boxes.

188

2.
3.
4.

Cross 'N Knots Game: A regular tic-tac-toe game

Hollywood/Hangman: A word Guessing game
Cows 'N Bulls: A word / number Guessing game
or
Similar projects may be undertaken in other domains
(As mentioned in general guidelines for project, given at the end of the curriculum in a group of 2-4 students)
3.

Presentation based on research

It will be a group presentation based on a detailed study of at least two technology inventions in the field of
information technology, which may include Inventor's name with country, out of box contributions year of
invention, characteristics, social impact and uses. A partial list of inventors is in the Annexure.
(The project can be done in a group of 2-3 students)

Practical File
05
(a)
Record of the configuration of computer system used by the student in the computer lab (by exploring
inside computer system in the first 2 lab classes).
(b)
Must have minimum 15 programs from the topics covered in class XI course.

5 Programs on Control structures

4 Programs on Array manipulations

4 Programs on String manipulations

2 Programs on Structure manipulations

Viva Voce
Viva will be asked from the syllabus covered in class XI and the project developed by the student(s).

05

COMPUTER SCIENCE (THEORY)

Class XII ( Theory) - Python
Duration: 3 Hours
Unit No.

Total Marks:70
Unit Name

MARKS

PROGRAMMING WITH PYTHON

28

OBJECT ORIENTED PROGRAMMING

WITH PYTHON

16

DATABASES AND SQL

BOOLEAN ALGEBRA

COMMUNICATION TECHNOLOGIES

10
70

UNIT 1: PROGRAMMING WITH PYTHON

(50 Theory + 40 Practical) Periods
REVIEW: Python covered In Class-XI
Stacks and Queues with lists
Data File:Opening and closing files, file object, access_modes, reading and writing a file Read(), readline(),
readlines(), write(), file positions (seek(), tell()), renaming and deleting a file.
UNIT 2: OBJECT ORIENTED PROGRAMMING WITH PYTHON (42 Theory + 36 Practical) Periods
Concept of Object Oriented Programming: Data hiding, Data encapsulation, Class and Object,
Polymorphism, Inheritance, Advantages of Object Oriented Programming over earlier programming
methodologies,
Classes: Defining classes (attributes, methods), creating instance objects, accessing attributes & methods,
using Built in class attributes (dict, doc, name, module, bases), using _ _init_ _() , _ _del_ _() method and _
_ str_ _( ) in a class, private attributes (limited support), importance of "self" (acts as a pointer to current
calling object)

189

Inheritance: Single and multiple inheritance- Overriding methods, using super() in derived class to invoke
_init_() or overriden methods of parent class
UNIT 3: DATABASES AND SQL
(20 Theory + 20 Practical) Periods
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, GROUPBY, HAVING, ORDERBY;
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
(16 Theory + 0 Practical) Periods
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, 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);
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.
UNIT 5: COMMUNICATION TECHNOLOGIES
(16 Theory + 0 Practical) Periods
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, LAN, WAN, MAN;
Network Protocol: TCP/IP, File Transfer Protocol (FTP), PPP, Remote Login (Telnet), Internet Wireless/
Mobile Communication protocol such as GSM, CDMA, GPRS, WLL,
Mobile Telecommunication Technologies: 1G, 2G, 3G and 4G
Electronic mail protocols such as SMTP, POP3
Protocols for Chat and Video Conferencing VOIP
Wireless protocols 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, Java Script, PHP) and Server side (ASP,
JSP, PHP), Web 2.0 (for social networking)

190

Class XII (Practicals) -- Pythan

Duration: 3 hours

Total Marks: 30

1.

Programming in Python
10
One programming problem in Python to be developed and tested in Computer 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

String

Lists/Tuples

Dictionary

File Operations

2.

SQL Commands
05
Five Query questions based on a particular Table/Reaction 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
The project has to be developed in Python language with Object Oriented Technology.
(The project is required to be developed in a group of 2-4 students)

Presentation on the computer

Project report (Listing, Sample, Outputs, Documentation

Viva

05

4.

Practical File
Must have minimum 20 programs from the following topics

Lists (general, stack, queue)

Dictionary

Tuple

File Handling

Programs based on Object Oriented Concepts

15 SQL commands along with the output based on any table/relation

05

5.

Viva Voce
Viva will be asked from syllabus covered in class XII and the project developed by student.

05

GUIDELINES FOR PROJECTS (Class XI and 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 2-4 students as team may be allowed to work on one project.
2.
Project content
2.1
Project for class XI can be selected from the topics mentioned in the syllabus or domains on the similar
lines
2.2
Project for class XII should ensure the coverage of following areas of curriculum:
a. Problem Solving
b. Object Oriented Programming in Python
c. File Handling
Theme of the project can be
Any Scientific or a fairly complex algorithmic situation
Quizzes/Games

191

2.3
2.4

Tutor/Computer Aided Learning Systems

The aim of the project is to highlight the abilities of algorithmic formulation, modular programming,
systematic documentation and other associated aspects of software development.
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.
OR

Class XII (Theory) - C++

Duration : 3 hours

Total Marks: 70

Unit No.

Unit Name

MARKS

1.

OBJECT ORIENTED PROGRAMMING IN C++

30

2.

DATA STRUCTURE

14

3.

DATABASE MANAGEMENT SYSTEM AND SQL

4.

BOOLEAN ALGEBRA

5.

NETWORKING AND OEN SOURCE SOFTWARE

10
70

UNIT 1: OBJECT ORIENTED PROGRAMMING IN C++

(50 Theory + 40 Practical) Periods

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;
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 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 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);
Opening a binary file using in, out, and app modes;

192

open(), read(), write() and close() functions; Detecting end-of-file (with or without using eof() function);
tellg(), tellp(), seekg(), seekp() functions.
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
to structure: De-reference/Deference operator: *, ->; self referencial structure;
UNIT 2: DATA STRUCTURES

(42 Theory + 36 Practical) Periods

Introduction to data structure, 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)
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: (Circular Array and Linked Implementation): Introduction to Queue (FIFO - First in First out
operations) Operations on Queue (Insert and Delete and its Implementation in C++.
UNIT 3: DATABASE MANAGEMENT SYSTEM AND SQL common to both the options. Refer to unit 3
DATABASE AND SQL mentioned in case of Python for further details
UNIT 4: BOOLEAN ALGEBRA common to both the options. Refer to unit 4 mentioned in case of Python
for further details
UNIT 5: NETWORKING AND OPEN SOURCE SOFTWARE common to both the options. Refer to unit 5
COMMUNICATION TECHNOLOGIES mentioned in case of Python for further details

Class XII (Practical) -- C++

Duration : 3 hours

Total Marks : 30

Programming in C++

10

One programming problem in C++ to be developed and tested in Computer 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 problem to be given will be of application type from the following topics

Arrays (One dimensional and two dimensional)

Class(es) and objects

Stack using arrays and or linked implementation

Queue using arrays (circular) and or linked implementation

Binary File operations (Creation, Displaying, Searching and modification)

Text File operations (Creation , Displaying and modification)

2.

SQL Commands
Five Query questions based on a particular Table / Reaction to be tested practically on Computer during the
examination. The command along with the result must be written in the answer sheet.

193

3.

Project Work
The project has to be developed in C++ language with Object Oriented Technology and also should have use of
Data files. (The project is required to be developed in a group of 2-4 students)

4.

Presentation on the computer

Project report (Listing, Sample, Outputs, Documentations)

Viva

Practical File
Must have minimum 20 programs from the following topics

Arrays (One dimensional and two dimensional, sorting, searching, merging, deletion' & insertion of
elements)

Class(es) and objects

Stacks 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
Viva will be asked from syllabus covered in class XII and the project developed by student.

GUIDELINES FOR PROJECTS (Class XI and XII)

1. Preamble
1.1

The academic course in Computer Science includes on 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 2-3 students as team may be allowed to work on one project.

2. Project content
2.1

Project for class XI can be selected from the topics mentioned in the syllabus or domains on the similar lines

2.2

Project for class XII should ensure the coverage of following areas of curriculum:
a.

Flow of control

b.

Data Structure

c.

Object Oriented Programming 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

School Management, Banking, Library information system, Hotel or Hospital management system,
Transport query system

Quizzes / Games;

Tutor, Computer Aided Learning Systems

2.3

It is suggested to prepare a bilingual (English and other Indian language) user manual part of project file

2.4

The aim of the project is to highlight the abilities of algorithmic formulation, modular programming, optimized
code preparation, systematic documentation and other associated aspects of Software Development.

194