bseb computer science
bseb computer science
Class : XI-XII
nNorthy of exccllent men to lose hours like slaves in thbe labour of calculation which could
It is
lated to anyone else if machines were used.." said Leibnitz in the beginning of seventeenth
.
be regu
lely
tury. ghted vision,, in-depth study accompanied by target-oriented effort of such rchbearers have ushered
Farsi to
computers.
ence or Engineering, medical world or launching Space Shutles, Study of Universe or global
Be it Sci and Development of Edutainment - the core ingredient
ions, Research is computer.
aDmunicat :
jectives
aiag Ob
To understand the problem statement.
To develop logic for problem solving.
To understand the concept of Object Oriented Methodology.
To implement Object Oriented Programming using C++
To understand the concept of working with Relational Database.
To understand the basic concept of algebra of logic.
To understand and explore the world of communication and networks.
Competencies :
he student will be proficient in the following :
Jdentification of a Computer System.
1 Categorisation of parts of an objective system.
3 Problem Solving.
4 Designing an efficient logic using object oriented approach for solution development.
Database handling.
6 Logic Circuit designing.
CLASS-XI (THEORY)
Duration : 3 hours Total Marks : 70
Marks
Unit No.Unit Name
06
1. Computer Fundamentals
10
2. Programming Methodology
44
3. Introduction to Programming in C++
10
4. Computer System Organisation
70
(132]
tions :
Character Eunc
Header File : ctype.h
Functions : isalnum ), isalpha(), isdigit(), islower(), isupper), tolower), tou pper 0; strepy().
streat ), strlen(), stremp(), strempi();
Hathematical Functions :
Header File : math.h, stdlib.h:
Functions : fabs(), log0, log10(0, pow), sqrt0, sin), cos(), abs),
Oher Functions :
Header File : stdlib.h:
Functions : randomize(), random);
Teo-dimensional Array :
Declaration / initialisation 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 Functions :
Defiaing 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.
Event Programming : Games as examples
General Guideiines : 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.
2. Cross 'N Knots Game : A regular tic-tac-toe game.
3. Hollywood / Hangman : A word Guessing game.
4. Cows 'N Bulls : A word/number Guessing game.
UNIT-4 : Computer System Organisation
Number system : Binary, Octal, Decimal, Hexadecimal and conversion between two different number
systems, Integer, Floating Point, 2's complément of number from base-2;
Internal Storage encoding for Characters: ASCII, ISCII (Indian scripts Standar Code for Information
Interchange), and UNICODE, Microprocessor, Basic concepts, Clock speed (MIiz, GHz), 16 bi, 32 bit,
64 bit processors; Types - CISC, RISC; Concept of System Buses, Address bus, Data bus,
Concepts of Accumulator, Instruction Register, and Program Counter.
Commonly used CPUs and CPUrelated terminologies : Intel Pentium Series, Intel Celeron, Cyrix,
AMD Series, Xeon, Intel Mobile, Mac Series; CPUCache; Concept of sink and CPU fan,
Motherboard; Single, Dual and Multiple processors;
Types of Memory : Cache (L1, L2), Buffer, RAM (DRAM, SDRAM, RDRAM,- DRAM), ROM (PROM,
EPROM),Hard Disk Drive, Floppy Disk Drive, CD/DVD Drive; Access Time;
Input Output Ports / Connections : Power connector, Monitor Socket, Serial (COM) and Parallel
(LPT) port,Universal Serial Bus port, PS-2 Port, SCSI port, PCIMCIsocket, Keyboard socket, Infrared
port (IR), audio/speaker socket, Mic socket; data Bus; external storage devices connected using l/O
ports:
Keyboards : Qwerty, Inscript, Multilingual, Dvorak.
Printers : Dot Matrix Printer, Line Printer, Deskjet / Inkjet / Bubblejet Printer, Laser Printer;
Power Supply :Switched Mode Power Supply (SMPS): Elementary Concept of Power Supply :Voltage,
Current, Power (Volt, Ampere, Watt), SMPS supplies - Mother Board.
Power Conditioning Devices : Voltage Stabilizer, Constant Voltage Transformer (CVT), Uninterrupted
Power Supply (UPS) -Onliae and offline.
Note :Students should be asked to prepare a e-governance report of an orgänization describing the
Computer System Configuration, Input Output Mechanism, Encoding scheme and Software Installation.
(133])
CLASS-XL PRACTICAL) Total Marks :
0
Duration:3 hours
1. Programming in C+
d in Computer during the examination
One programming problem in C++ to be developed and leste
Marks are allotted on the basis of following:
05 Marks
Logic
Documentation / Indentation : 02 Marks
03 Marks
Output presentation 10
2. Project Work
ect, given at the end of the curriculum)
(As mentioned in general guidelines for proj
3. Practical File
topics covered in class-XI course.
Must have minimum 15 programs from the 05
4. Viva Voce student.
lbe ask ed fro m syl lab us cov ere d in Class-XI and the project developed by
Viva wil
4. Boolean Algebra
8
5. Communication and Network concepts
70
(134)
Constructor and Destructor :
Canstructor : Special Characteristics, Decl
aration and Definition of a constructor,
Overloaded Constructors, Copy Construc Default Constructor.
hestructor: Special Characteristics, tor, Constructor with default arguments.
Declaration and definition of destruct
Toheritance (Extending Classes) : Conc or:
ept of Inheritance, Base Class, Deri
lasses, protected visibility mode; Singl ved Class, Defining derived
e level inheritance, Multilevel inheritance
inheritance, Privately derived, Publically deri and Multiple
ved and Protectedly derived class, accessibil
from objccts and within derived classíes): ity of members
Data File Handling : Need for a data
file, Types of data files - Text file and
Basic file operations on text file : Creating Binary file.
/ Writing text into file, Reading and
from an already existing text File Manipulation of text
(accessing sequentially):
Binary File :Creation of file, Writing data
into file, Searching for required data from
data to a file, Insertion of data in sorted file, file, Appending
Deletion of data from file. Modification
Implementation of above mentioncd of data .n a file:
data file handling in C++;
Componcnts of C++ to be used with file handl
ing:
Header file : fstream.h; ifstream,
ofstream, fstream classes;
Opening a text file in in, our, and app modes
;
Using cascading operators for writing text to the
file and reading text from the file: open), get),
getline) and close() functions; Detecting
end-of-file (with or without using eof() function);
put0,
binary file using in, out, and app modes Opening a
;
Open(), read (), write) and close) functions; Detecti
ng end-of-file (with or without using eof() function):
tellg), tellp(), seekg(), seekp() functions.
Pointers : Declaration and Initialization ofPoin
ters; Dynamic memory allocation / deallocation
operations; new, delete; Pointers and Arrays : Array
of Pointers, Pointer to an array (I 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 allocati
on 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 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 or POSTFIX notation and evaluation
of
Postfix expression;
Queue (Circular Array and Linked Implementation) : Operations on Queue (Insert and Delete)
a.id
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;
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 : BOOLEANALGEBRA
I135)
tors: AND, OR. NO
Binary-valued Quantities, Boolean Variable, Boolean Constant and Boolean Opera
ive Law, ldentity law , Inverse law, Prine
Truth Tables: Closure Property, Commutative Law. Associat
Law, Involution law, Demorgan's Law a
of Duality, Idem potent Law, Distributive Law, Absorption
their applications;
) form from the Truth Table, Reducing Bonle
Obtaining Sum of Product (SOP) and Product cf Sum (POS
of Karnaugh Map for minimisation of Boole
Expression (SOP and POS) to its minimal forım, Use
expressions (up to 4 variables);
D, NOR)and their use in circuits.
Basic Logic Gates (NOT, AND,OR, NAN
UNIT-5 :CQMMUNICATION AND NETWORK CONCEPTS
Evolution of Networking: ARPANET, Internet, Interspace: g techniques;
the network with reference to switchin
Different ways of sending data across , KHz, MHz) and Dat.
cept of Channel, Baud, Bandwidth (Hz
Data Communication terminologies : Con
transfer rate (bps, kbps, Mbps, Gbps, Tbps): ared, radio link, microwave
cable, coaxial cable, optical fiber, infr
Transmission media : Twisted pair
link and satellite link. y;
tor, Ethernet Card, Hub, Switch, Gatewa
Network devices : Modem, Ri45 connec N, MA N;
: Concepts of LAN, WA
Different Topologies - Bus, Star Tree net), Internet, Wireless
P. Fil e Tra nsf er Pro toc ol (FTP), PPP, Level-Remote Login (Tel
Protoc ol :TC P/I Application Electronic Mail
ile Com mun ica tio n, GS M, CD MA, WLL, 3G, SMS, Voice Mail,
/Mob
Chat, Video Conferencing;
us threats and prevention, Firewall,
Cookies, Hacking;
cep ts : Cyb er Law , Vir
Network Securi ty Con L); Hyper Text
er Tex t Mar kup Lan gua ge (HT ML) , eXtensible Markup Language (XM
WebPages: Hyp ol Address; Website, Web browser, Web
Servers:
es; URL; Protoc
Transfer Protocol (HTTP); Domain Nam
Web Hosting.
CLASS-XII (PRACTICAL)
Total Marks: 30
Duration:3 hours
1. Programming in C++ ing the examination.
prog ramm ing prob lem in C++ to be developed and tested in Computer dur
One
g:
Marks are allotted on the basis of followin
05 Marks
Logic
02 Marks
Documentation / Indentation :
03 Marks
Output presentation
ation type from the following topics.
Notes: The types of problems to be givenwill be of aplic
l)
Arrays (One dimensional and two dimensiona
Array of structure
on
Stack using arrays and linked implementati
mentation.
Queue using arrays (circular) and linked imple
ication)
Binary File Operations (Creation, Displäying, Searching and modif
on).
Text-file operatións (Creation, Displaying and modificati 05
SQL Commands
to be tested practically on Computer during
Five Query questions based on a particular Table /Reaction answer sheet.
en in the
the examination. The command along with the result must be writt 05
Project Work
t Oriented Technology and also should have
The project has to be developed in C++ language wit Objec
h
use of Data files.
Presentation on the computer
n)
Project report (Listing, Sample, Outputs, Documentatio
Viva
(136)
4 Practical File
Must have minimum 20 programs from the
following topics -
Array s (One dimensional and two dimensional,
sorting, searching. merging. deletion & inser
elements) tion of
Arrays of structures, Arrays of Objects
Stacks using arrays and linked implementation
Oueues using arrays (linear and circular)
and linked implementation.
.File (Binary and Text) operations (Cre
ation, Updation, Query)
. Any computational based problems
15SOL Commands along with the output based
on any table /relation : 3 Marks
5. Viva Voce
05
Viva willbe asked from syllabus covered
in class-XIl and the project developed by
CUIDELINES FOR PROJECTS (Class XI and XII) student.
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
team may be allowed to work on one project.
2. Projeçt content
2.1 Project for class XI can be selected from one
of the topics given in event programming (or)
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 Scientificor a fairly complex algorithmic situation.
Business oriented problems like Banking, Library information system, Hotel or Hospital management system,
Transport query system
Qujzzes/Games;
Tutor/Computer Aided Learning Systems
2.3 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.
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.
Reference Books
Computer Organisation and Boolean Algebra
1. Rajaraman, FUNDAMENTALSOF COMPUTERS 4th Edition, Prentice Hallof India.
2. Peter Norton, INTRODUCTION TO COMPUTER 4th Edition, Tata MeGraw Hill
3. J. Shelly & Roger Hunt, COMPUTER STUDIES, Wheeler's Publication.
1371)