Computer Science (COMS)

Class – XI
Full Marks – 100
Theory – 70 Marks Practical – 30 Marks

A. Computer Fundamentals 25

Evolution of Computers
Evolution of Computers
Fixed Program Computers
Stored Program Computers Von Neumann Concept/Architecture
Classification of Computers
Analog Digital, Hybrid Computers Mainframe and Super
Computers Mini, Micro Laptop Computers
Concept of Data and Information Data processing
Description of each Functional Block of a Computer
Block Diagram of a Computer System
Input Devices (Keyboard , Mouse , Scanner, Touch Screen,OMR,OCR, MICR
Graphic Tablet, Barcode Reader, Light Pen Microphone Joystick) Output Devices
Monitor: CRT LCD
Printer: Impact Printers (Dot Matrix), Non Impact Printers (Inkjet, Laser) Plotter
Central Processing Unit: Control Unit, Arthmetic and Logic Unit
Storage Devices
Primary Memory
RAM (DRAM SRAM)
ROM (PROM EPROM EEPROM UVPROM)
Secondary Memory
Magnetic Media (HDD FDD)
Optical Media (CD DVD)
Solid State Devices
Cache Memory
Flash Memory
Communication Bus
System Bus: Address Bus Data Bus Control Bus Power Bus
Personal Computer Hardware Specification

Data Representation
Number Systems
Non-Positional Number Systems Positional Number
Systems Conversion
Arithmetic
Negative Number Representation Signed Magnitude
One’s Complement
Two’s Complement
Subtraction using Complements Various Binary Coding
Systems
BCD
EBCDIC
ASCII
ISCII
Gray Code
Excess-3
Fixed and Floating Point Numbers
Difference between Fixed and Floating Point Numbers
Concept of Normalised Numbers Floating Point
Arithmetic

Boolean Algebra
Definitions and Postulates
Boolean Operations – AND, OR, NOT
Proof using Identities and Truth Tables
De’ Morgan’s Theorem and Basic Principle of Duality
Deriving Truth Table from Boolean Expression and Vice-Versa
Sum of Products (SOP) Expressions (Using Min-Terms)
Product of Sum (POS) Expressions (Using Max-Terms)
Canonical Form of Boolean Expressions and Their Complements
 Simplifications (Algebraic Method, K-Map Method Upto 4 Variables) Use
of Don’t Care Terms
Logic Gates – AND, OR, NOT, XOR, X-NOR Gates
Universal Gates – NAND and NOR Gate
Implementing Basic Gates using Universal Gate

B. Software and Languages 10

Definition of Software
Programming Languages: Concept of High Level, Low Level and Assembly Language
Types of Software
System Software
Translators: Assembler, Compiler, Interpreter
Operating Systems
Definition and Functions
Types of OS: Single User, Multi User, Multiprogramming, Multi Processing, Time Sharing
Booting (Cold and Warm), Spooling, Buffering, Concept of Virtual Memory
Directory and File Structure, Path and Pathname
Concept of GUI, CUI with Examples
Using Linux
Basic Commands: ls, cd, cp, cat, mv, mkdir, rmdir, who, Use of Wildcard
Text Editors: vi, gedit
File Permissions
Command Line Pipes
Concept of Loaders and Linkers
Application Software (Definition and Example) Utility
Software (Definition and Example)

C. Python – I 20

Programming Fundamentals Algorithms

and Flow Charts Programming
Methodologies
Python Overview
The Python Interpreter Anatomy
of a Python Program
Python Data Types
Numeric: Integer, Float
Boolean
Sequence Types: Strings, Lists, Tuples
Expressions, Operators and Precedence
Control Flow
Conditionals
Loops
Functions
Parameter Passing Python’s
Built-In Functions Simple Input
and Output
Console Input and Output File
Input and Output Exception
Handling
Raising an Exception
Catching an Exception
Iterators and Generators
Scopes and Namespaces Modules
and Import Statements

D. Data Structures and Algorithms 15

Introduction
Abstract Data Types Algorithms
Algorithm Complexity Time Complexity Space
Complexity
Algorithmic Analysis Worst Case Best
Case
Average Case
Arrays
Linked Lists
Stacks and Queues Sorting Algorithms
Selection Sort
Bubble Sort
Insertion Sort
 Searching Algorithms Linear Search Binary
Search
Binary Trees and Binary Search Trees

E. Practical 30

Operating System 5
Experiments with basic Linux Commands
Experiments to check machine configuration
Programming in Python (Algorithm / Flow Chart, Coding, Execution) 15
One Program using Branching and Loop
One Program using Function, Array, String, List, Tuple
Laboratory Copy (Must Have Minimum 20 Programs from Topics in Class XI) 5
Six Programs on Control Structures
Four Programs on Array Manipulation
Three Programs on String Manipulation
Two Programs on List Manipulation
Two Programs on Tuple Manipulation
Three Programs on Functions
Viva Voce 5
Computer Science (COMS)
Class – XII
Full Marks – 100
Theory – 70 Marks Practical – 30 Marks

A. Computer Fundamentals 15
Digital Logic
Combinational Circuits
Half Adder and Full Adder
Full Adder using Half Adders only
Half Subtractor and Full Subtractor
4 – bit Adder and Subtractor Circuit
Multiplexor ( 4 X 1 ) and De-multiplexor (1X 4 )
Decoder ( max 3 bytes ) and Encoder ( decimal to binary , octal to binary )
Sequential Logic Circuits
Concept of Asynchronous and Synchronous circuits
Positive And Negative edge triggers
Concept of latch and flip-flops
SR flip-flops using NAND and NOR gates
D, JK , T and Master slave flip-flops
Serial and parallel Registors
SISO , SIPO , PIPO , PISO
Concept of Asynchronous and Synchronous counters
Block Diagram and working of Asynchronous counter [ Up/Down ripple counter]
Block Diagram and working of Synchronous counter
Using Linux
Advance command set : rename , top , chmod , passwd , find , ifconfig , ping

B. Computer Networks 20
Introduction to Networking
Analogue and Digital Communication
Modes of Communication : simplex , half-duplex and full-duplex
Types of Network – LAN , MAN , WAN
Network Architecture – client-server and peer-to-peer network
Serial and parallel Communication
Band width , Channel capacity , Baud
Synchronous and Asynchronous transmission mode
Baseband and Broadband Network
Networks
LAN , MAN , WAN
Wireless LAN
Internet
Components of a Network
Servers and Workstations
NIC
Guided Media
Cables- UTP , STP , Co-axial , Fibre optic
Unguided Media
Infra-red , Radio and Micro waves communication , Satellite
Network Operating System
Network Topologies
Bus , Ring , Star , Mess
Network connecting Devices
Switch
Router
LAN protocols
Ethernet [ CSMA/CD ] and Token Ring protocol
Internet Protocol
TCP/IP protocol stack
IP Addressing
IPV4 class A , Class B , Class C
Concept of subnet mask and default gateway
Domain Name System
Internet Applications
Email , WWW , Cloud computing
HTML
Basic page design using ordered and unordered list , using image , hyperlink , using tables
Configuration of Home , small office network with internet connectivity
Cyber security fundamentals
Type of attacks
Active/Passive attacks
Social Engineering
Malicious softwares
Virus , Malware , Trojan
Mobile Device Usage- Best practices
Password policies – Best practices
C.Python-II 20

Python Datatypes
Set
Dictionary
Basic Concept of OOP
Data Abstraction
Encapsulation
Inheritance
Polymorphism
Object oriented Programming using Python
Creating python classes
Member classes , Data attributes
Constructors
Encapsulation
Inheritance
Polymorphism
Numerial Analysis
Finding roots of non linear equations
Regression
Curve fitting
Solution to Simultaneous linear equations
D. Database Management Systems 15
Introduction of Database
Definition of Database
Database Language [ DDL , DML , DCL ]
DBMS and its components
Various data models : ER model , Hierarchial model , Network model
Relational model
Relational Database
Concept of Relation , Tuple , Attribute , Domain , Degree , Cardinality
Concept of Keys – Key , Super Key , Candidate Key , Primary Key , Alternate Key
Concept of Relationship : 1:1 , 1:n , n:m relations
Database constraints : integrity constraint , domain constraint , referential integrity
constraint , concept of foreign key
Simple ER diagram and mapping to relations
Relational Algebra
Selection operation
Projection operation
Set operation
Cartesian operation
Natural join operation
Structured Query language
CREATE TABLE , ALTER TABLE , DROP TABLE , INSERT , DELETE , UPDATE,
SELECT ( distinct , from , where , and , or , in , not in , between , like , group by ,
Having , order by sum , avg , count , max , min )
E.Practical 30

Operating System 5
Experiments with basic Linux Commands
Experiments to configure and check network connectivity for a PC
Demonstration of Home , small office Network configuration
Experiments with basic SQL – CREATE TABLE , DROP TABLE , INSERT , DELETE , SELECT
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 the following :
Logic 5
Documentation 2
Output presentaion 3
Types of Problems to be given will be of application type from the following topics :
Linked List Manipulation
Stack using Array and Linked implementation
Queue using array and linked implementation [ only linked queue ]
Text and Binary files operation [ creation , display , searching , modification ]
Numerical Analysis
Project Work ( one project using Python and one project using HTML ) 5
Suggestive Topics
Application Development using Python [ any one of the following topics ]
Problem related to Numerical Analysis
Creation and Manipulation of telephone index using concept of files
Creation and Addition of polynomials using Linked list
GUI Design using Python toolkits , example WX PYTHON , Tkinter
Webpage Design using HTML [ minimum 5 linked pages ]
Travel & Tourism , Festivals , Book catalogues , Pollution control
Laboratory Copy 5
Viva Voce 5
 QUESTION PATTERN OF COMPUTER SCIENCE
Question Pattern
Class XI ( New Syllabus )
Descriptive
MCQ SA
(5 Nos.)
Sl.no. Unit (21 Nos.) (14 Nos.) TOTAL
(7 marks)
(1 mark) (1 mark)
[4+3,2+2+3,5+2,7]
A. (i) Evolution of
1. 2Qx1M=2 2Qx1M=2
computers
A. (ii) Data 2Qx7M=14 25
2. 2x1=2 1x1=1
Representation
3. A.(iii) Boolean Algebra 2x1=2 2x1=2
B. Software and
4. 2x1=2 1x1=1 1x7=7 10
Languages
5. C. Python-I 8x1=8 5x1=5 1x7=7 20
D. Data Structures and
6. 5X1=5 3x1=3 1x7=7 15
Algorithms
21 marks 14 marks 35 marks Total – 70
SUMMARY
(21Questions) (14Questions) (5Questions) marks
 QUESTION PATTERN OF COMPUTER SCIENCE
Question Pattern
Class XII ( New Syllabus )
Descriptive
MCQ SA
(5 Nos.)
Sl no. Unit (21 Nos.) (14 Nos.) TOTAL
(7 marks)
(1 mark) (1 mark)
[4+3,2+2+3,5+2,7]
A . Computer
1 5QX1M=5 3QX1M=3 1QX7M=7 15
Fundamentals
2 B . Computer Networks 3X1=3 3X1=3 2X7=14 20
3 C. Python - II 8X1=8 5X1=5 1X7=7 20
D. Database
4 5X1=5 3X1=3 1X7=7 15
Management Systems
21 marks 14 marks 35 marks Total – 70
SUMMARY
(21Questions) (14Questions) (5Questions) marks