WBCHSE Class 12 Syllabus for Computer Science

COMPUTER SCIENCE (COMS)
Class - XII
Full Marks 100
THEORY (70 Marks)
A. Sequential Logic Circuits: (15 Marks)
ƒ 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 Registers :
o SISO, SIPO, PIPO, PISO
ƒ Concept of Asynchronous and Synchronous Counters
o Block diagram and working of Asynchronous Counter (Up / Down Ripple Counter)
o Block diagram and working of Decode Counter
o Block diagram and working of Synchronous Counter
o Block diagram and working of Ring Counter
o Block diagram and working of Johnson Counter
B. Programming in C and Data Structures: (15 Marks)
ƒ Pointers in C- Definition, Pointers and Arrays, Array of Pointers, Pointer to an Array,
Pointer and Strings, Pointer and 2D array, Pointer and Structures, Pointers and Functions,
Dynamic Memory Allocation
ƒ Command Line Arguments
ƒ I/O File Handling in C (Text Files and Binary Files)
o Concept of File Pointer
o Modes of opening in file
o Use of functions open, close, put, puts, print, fgetc, gets, scan, tell, seek, rewind,
write, read
ƒ Data Structures in C (Both Algorithm and Program)
o Single Linked List– Create, Display, Add and Delete Nodes from a List, Search
from a list, Reverse a list (physically reverse a list, display list in reverse order)
o Stack using Arrays; Push and Pop Operations
o Queue using Arrays; Store and Retrieve Operations (only simple linear queue)
o Application of Linked List :
ƒ Creating Stack and Queue using Linked List

197

o Application of Stack:
ƒ Infix, Prefix and Postfix notations
ƒ Infix to Postfix conversion (only conversion using rules, program not
required)
ƒ Evaluation of Postfix expression (only evaluation using rules, program not
required)

C. Networking: (15 Marks)
ƒ Introduction to Networking (Definition, Advantage, Disadvantage, Application)
o Analogue and Digital Communication
o Modes of Communication: Simplex, Half Duplex and Full Duplex Communication
o Types of Network – LAN, MAN, WAN
o Network Architecture : Client Server & Peer-to-Peer Networks
o Serial and Parallel Communication
o Bandwidth, Channel Capacity, Baud
o Synchronous and Asynchronous Transmission Modes
o Baseband and Broadband Networks
ƒ Components of a Network
o Servers (File server, Communication Server, Print Server) and Workstation
o NIC
o Guided Media
ƒ Cables – UTP, STP, Co-axial, Fibre Optic
o Unguided Media
ƒ Infra-red, Radio & Microwave Communication, Satellite
o Network Operating System – Characteristics
ƒ Network Topologies -
o Bus
o Ring
o Star
o Mesh

ƒ Network Connecting Devices –
o Hub
o Repeater
o Bridge
o Switch
o Router
o Gateways

198

ƒ LAN Protocols
o Ethernet (CSMA /CD) and Token Ring Protocol
ƒ Switching Technique
o Circuit, Message and Packet Switching
ƒ Use of MODEM
ƒ TCP / IP Protocols
o TCP, IP, UDP, FTP, HTTP, TELNET
ƒ IP Addressing
o Class A, Class B, Class C IP addresses
ƒ Domain Name System
ƒ URL
ƒ Introduction to Internet
o Basic requirement for connecting to the Internet, ISP
o Services provided by Internet– www, browser, e-mail, search engine, social
networking
o Networking Security – Computer Virus, Concept of Firewall, Password

ƒ HTML
o Basic Page Design, Using Ordered and Unordered Lists, Using Image,
Hyperlinking, Using Tables

D. Database Management System (15 Marks)
ƒ Introduction of Database :
o Definition of Database
o Database Languages (DDL, DML, DCL)
o DBMS and its components
o Various Data Models – ER Model, Hierarchical Model, Network Model, Relational
Model (only concepts)

ƒ Relational Model
o Concept of Relation, Tuple, Attribute, Domain, Degree, Cardinality
o Concept of Keys – Key, Super Key, Candidate Key, Primary Key, Alternate Key
o Concept of Relationships – 1:1, 1:N, N:M relationships
o Database Constraints – Equity Integrity Constraint, Domain Constraint, Referential
Integrity Constraint and Concept of Foreign Key
o Functional Dependency – Full, Partial, Transitive and Trivial Dependencies
o Database Anomalies – Insertion, Deletion and Updation Anomaly

199

o Normalisation – Definition, Different Normal Forms (Normalising a Relation up
to 3NF)
ƒ Relational Algebra
o Selection Operation
o Projection Operation
o Set Operation
o Cartesian Product
o Natural Join Operation

ƒ SQL
o CREATE TABLE, ALTER TABLE, DROP TABLE
o INSERT, DELETE, UPDATE
o SELECT (DISTINCT, FROM, WHERE, AND, OR , IN, NOT, IN, BETWEEN,
LIKE, GROUP BY, HAVING, ORDER BY)
o SUM, AVG, COUNT, MAX, MIN
o GRANT, REVOKE, ROLLBACK
E. Introduction to Object Oriented Programming (10 Marks)
ƒ Basic Concept of OOP
o Data Abstraction
o Encapsulation
o Inheritance
o Polymorphism
ƒ Implementing OOP using C++
o Basic input / output, branching, looping (simple programs)
o Definition of a Class
o Members of Class – Data Members and Member Functions;
o Concept of Constructor and Destructor (Programming not required)
o Object Creation and accessing members of a Class (simple programs)

F. Practical (30 marks)
ƒ Programming in C (Coding, Execution) (10 marks)
o One programming problem in C to be developed and tested in computer during
the examination. Marks are allotted on the basis of the following:
ƒ Logic (5 marks)
ƒ Documentation (2 marks)
ƒ Output presentation (3 marks)
o Types of problems to be given will be of application type from the following
topics:

200

ƒ Linked List manipulation
ƒ Stack using array and linked implementation
ƒ Queue using array and linked implementation (only linear queue)
ƒ Text and Binary File operations (creation, display, searching, modification)
ƒ Web Page design using HTML and SQL (command as per theory syllabus) (5 marks)

ƒ Project Work (one project using C and one project using HTML) (5 marks)

o Suggestive Topics:
ƒ Application of C (Program on any one of following topics):
ƒ Problem related to Numerical Analysis–Bisection Method,
Trapezoidal Rule
ƒ
Creation and manipulation of telephone index using concept of
files
ƒ Creation and addition of polynomials using Linked Lists
ƒ Web page designing using HTML (minimum 5 linked pages)
ƒ Travel and Tourism
ƒ Festivals
ƒ Book Catalogue
ƒ Pollution and pollution control

ƒ Laboratory Copy (5 marks)

ƒ Viva Voce (5 marks)

201