WEST BENGAL COUNCIL OF HIGHER SECONDARY EDUCATION

SYLLABUS FOR CLASSES XI AND XII

SUBJECT : COMPUTER SCIENCE (COMS)

 COMS

Course Overview:

This course covers the fundamental concepts of computer system organization, programming fundamental along
with its theoretical analysis, data structure, computer networks, the value of technology in societies, e-commerce,
python programming, database management system, and artificial intelligence for the students from science
background only.

Course Objective:

This course enables students to-

 develop an understanding of how computer system works; the components of computer systems and how
they interrelate, including software, data, hardware, communications and users.
 analyse a computing problem and to apply principles of computing to identify solutions.
 use of efficient data storing and retrieval technique along with basic programming skill.
 gather the fundamental knowledge on computer networks and web page designing.
 appreciate the ethical implications relating to the use of computing technology and information and identify
the impact of technology on personal life and society.
 develop the knowledge, skills, and competencies needed to leverage the opportunities presented by the
digital economy and to navigate the challenges and risks associated with online business operations.
 understand the basics of artificial intelligence and its subfields.
 develop an understanding of database management systems, with an emphasis on how to organize,
maintain and retrieve - efficiently, and effectively.
 Class XI

Total Contact Hours: 200 (Theory & Practical: 180 ; Remedial & Home Assignment:20)

SEMESTER – I
Course Code: COMS (Theory)

Full Marks: 35 Contact Hours: 100

Unit – 1 Computer System and Organisation 15 Marks Total 30 Hours
 Basic Computer Organisation 4 hours
 CPU, Primary Memory (RAM, ROM, Cache), Secondary storage device,
I/O devices, units of memory (bit, byte, KB, MB, GB, TB, PB).
 Classification of Computers
 Super, Mainframe, Mini, PC.

 Concepts of Software 9 hours

 Definition of software, types of software – System Software
(Translator: assembler, interpreter, compiler, Loader, Linker, Operating
System: Definition and functions, types of OS- Single use, Multiuse,
Multiprogramming, Multiprocessing, Time sharing), Application
Software (Definition and example), Utility Software, concept of GUI and
CUI with examples using LINUX (Basic Commands).

 Number System 7 Hours

 Binary, Octal, Decimal, Hexadecimal number system, conversion
between number system, Weighted Code (BCD, Binary, 84-2-1 code),
non-weighted code (GREY, Excess-3), encoding schemes (ASCII, ISCII,
unicode), 1’s complement, 2’s complement.

 Boolean Algebra 10 Hours

 Postulates, logic gates: NOT, AND, OR, NAND, XOR, XNOR, truth tables,
De Morgan theorem, SOP, POS, Simplifications using K-Map and
Boolean algebra, logic circuits.

Unit – 2 Programming Fundamentals 10 Marks Total 25 Hours

 Concept of Programming 2 Hours

 Instruction (Definition, Example), Program (definition, example),
Programming Language (concept of high level, low level and assembly
language), Procedural and Non-procedural programming, Concept of
Structured Programming, Object Oriented Programming

 Algorithm fundamentals 18 Hours

 Definition, characteristic of algorithm, recursive and non-recursive
algorithms, representation of algorithm using flowchart, pseudo code,
efficiency of algorithm, space complexity, time complexity, asymptotic
notation- big O, big Omega, big Theta.

 Introduction to Problem Solving 5 Hours

 Steps for Problem Solving (analysing the problem, developing an
algorithm, coding, testing, debugging).
Unit – 3 Introduction to C 10 Marks Total 45 Hours

 Basic Structure 2 Hours

 Character set, keywords, identifiers, constants, variables and type
declaration, Sample programs, pre-processor.

 Operators 3 Hours
 Arithmetic, Relational, Logical, Assignment, Increment and Decrement,
Conditional, comma; operator precedence and associatively; arithmetic
expression-evaluation and type conversion. Character I/O, Escape
sequence and formatted I/O.

 Branching and Looping 3 Hours

 if, if-else, while, do-while, for.

 Arrays and Structure 12 Hours

 One-dimensional and Two-dimensional, Different types of uses. String
handling with arrays – read and write, concatenation, comparison,
string functions.
 Structures: Initialization; arrays of a structure, arrays within structures,
structure within structure.

 User defined functions 10 Hours

 Need, Call by Reference, call by value, return value and types, nesting
of functions, recursion.

 Pointers 15 Hours
 Declaration and initialization, operators, pointer arithmetic’s, accessing
variables, pointer & arrays, strings, functions.
 SEMESTER – II

Course Code: COMS (Theory)

Full Marks: 35 Contact Hours: 80

Unit – 1 Data Structure 15 Marks Total 45 Hours

 Definition, types of data structure-linear and non-linear. 1 Hour

 Abstract Data types. 1 Hour

 Arrays: 1D, 2D and their applications. 7 Hours

 Linked List: Single, circular and double link list. 10 Hours

 Stack
 Stack operations (push and pop), implementation using array and list, 6 Hours
application of Stack.

 Queue
 Queue operation implementation using array and list, circular queue, 6 Hours
de-queue, priority queue.

 Recursion
 Definition. 4 Hours
 Advantages and limitations of recursion.
 Understanding what goes behind recursion (internal stack
implementation), tail recursion.

 Searching and Sorting 10 Hours

 Linear Search, Binary Search and their comparison.
 Bubble Sort and its implementation.

Unit – 2 Computer Networks 10 Marks Total 20 Hours

 Introduction to Networking 6 Hours

 Analogue and digital Communication.
 Mode of Communication- Simplex, half duplex and full duplex.
 Network Architecture- Client server, Peer to Peer.
 Serial and Parallel Communication.
 Measuring Capacity of Communication Media (bandwidth, channel
capacity, baud).
 Synchronous and asynchronous Transmission Mode.
 Baseband and Broadband network.
  Transmission Media 3 Hours
 Wired Communication Media (Twisted Pair, Co-axial cable, Fiber
Optic).
 Wireless Communication Media (Radio wave, Microwave, Infrared,
Satellite).

 Network Connecting Devices 2 Hours

 Modem, Ethernet Card, RJ45, Repeater, Hub, Switch, Router,
Gateway, Wifi card.

 Network Type and Topologies 3 Hours

 Types of Network-LAN, MAN, WAN.
 Network Topologies- Bus, Star, Ring, Tree.

 Network Protocols -HTTP, FTP, PPP, SMTP, TCP/IP, POP3, TELNET, HTTPS, 2 Hours
VolP.

 Referential Model- OSI Model (Basic Concept, use of devices and protocols at 1 Hour
different layers).

 Introduction to Web Services: WWW, HTML, XML, IP Addresses, Domain 3 Hours

names, URL, ISP, Website, Web browser, Web Server, Web Hosting.

Unit – 3 Ethics 10 Marks Total 15 Hours

 Digital Footprints. 1 Hour

 Data Protection: Intellectual property rights (copyright, patent, trademark),

violation of IPR (plagiarism, copyright infringement, trademark infringement), 5 Hours
open-source software and licensing (Creative Commons, GPL and Apache).

 Cyber Crime: Definition, hacking, eavesdropping, phishing and fraud emails,

ransomware, cyber trolls, cyber bullying. 3 Hours

 Cyber safety: Safely browsing the web, identity protection, confidentiality. 2 Hours

 Malware: Viruses, trojans, adware. 1 Hour

 E-waste management: Proper disposal of used electronic gadgets. 2 Hours

 Information Technology Act: (IT Act). 1 Hour

 Class XII

Total Contact Hours: 200 (Theory & Practical: 180; Remedial & Home Assignment:20)

SEMESTER – III

Course Code: COMS (Theory)

Full Marks: 35 Contact Hours: 100
Unit – 1 Python Programming 25 Marks Total 80 Hours

 Familiarization with the basics of Python programming 2 Hours

 Introduction to Python, Features of Python, executing a simple “hello
world" program, execution modes: interactive mode and script
mode, Python character set, Python tokens (keyword, identifier,
literal, operator, punctuator), variables, concept of l-value and r-
value, use of comments.

 Knowledge of data types 1 Hour

 Number(integer, floating point,complex), boolean, sequence(string,
list, tuple), None, Mapping(dictionary), mutable and immutable data
types.

 Operators 2 Hours
 Arithmetic operators, relational operators, logical operators,
assignment operators, augmented assignment operators, identity
operators (is, is not), membership operators (in not in).

 Expressions, statement, type conversion, and input/output 3 Hours

 Precedence of operators, expression, evaluation of an expression,
type-conversion (explicit and implicit conversion), accepting data as
input from the console and displaying output.

 Errors: Syntax errors, logical errors, and run-time errors. 2 Hours

 Flow of Control
 Introduction, use of indentation, sequential flow, conditional and 4 Hours
iterative flow.

 Conditional statements 5 Hours

 if, if-else, if-elif-else, flowcharts, simple programs: e.g.: absolute
value, sort 3 numbers and divisibility of a number.

 Iterative Statement 7 Hours

 For loop, range(), while loop, flowcharts, break and continue
statements, nested loops, suggested programs: generating pattern,
summation of series, finding the factorial of a positive number, etc.

 Strings
 Introduction, string operations (concatenation, repetition, 10 Hours
membership and slicing), traversing a string using loops, built-in
functions/methods–len(), capitalize(), title(), lower(), upper(),
count(), find(), index(), endswith(), startswith(), isalnum(), isalpha(),
isdigit(), islower(), isupper(), isspace(),lstrip(), rstrip(), strip(),
replace(), join(), partition(), split().
  Lists
 Introduction, indexing, list operations (concatenation, repetition,
membership and slicing), traversing a list using loops, built-in 10 Hours
functions/methods–len(), list(), append(), extend(), insert(), count(),
index(), remove(), pop(), reverse(), sort(), sorted(), min(), max(),
sum(); nested lists, suggested programs: finding the maximum,
minimum, mean of numeric values stored in a list; linear search on
list of numbers and counting the frequency of elements in a list.

 Tuples
 Introduction, indexing, tuple operations (concatenation, repetition,
membership and slicing); built-in functions/methods – len(), tuple(), 5 Hours
count(), index(), sorted(), min(), max(), sum(); tuple assignment,
nested tuple.

 Dictionary
 Introduction, accessing items in a dictionary using keys, mutability of
a dictionary (adding a new term, modifying an existing item), 5 Hours
traversing a dictionary, built-in functions/methods – len(), dict(),
keys(), values(), items(), get(), update(), del(), del, clear(), fromkeys(),
copy(), pop(), popitem(), setdefault(), max(), min(), sorted().

 Introduction to Python modules

 Importing module using ‘import <module>’ and using from
statement, importing math module (pi, e, sqrt(), ceil(), floor(), pow(),
fabs(), sin(), cos(), tan()); random module (random(), randint(), 10 Hours
randrange()), statistics module (mean(), median(), mode()).

 Functions
 Types of function (built-in functions, functions defined in module,
user defined functions), creating user defined function, arguments
and parameters, default parameters, positional parameters, function 7 Hours
returning value(s), flow of execution, scope of a variable (global
scope, local scope).

 Exception Handling
 Introduction, handling exceptions using try-except-finally blocks. 7 Hours

Unit – 2 E-Commerce 10 Marks Total 20 Hours

 An introduction to Electronic Commerce 8 Hours

 What is E-Commerce (Introduction And Definition), Main activities E-
Commerce, Goals of E-Commerce, Technical Components of E-
Commerce, Functions of E-Commerce, Advantages and disadvantages
of E-Commerce, Scope of E-Commerce, Electronic Commerce
Applications, Electronic Commerce and Electronic Business (C2C,
C2G,G2G, B2G, B2P, B2A, P2P, B2A, C2A, B2B, B2C).
 Internet, Intranet & Extranet, Role of Internet in B2B Application,
Web promotion, Banner, Exchange, Shopping Bots.

 Electronic Data Exchange 4 Hours

 Introduction, Concepts of EDI and Limitation, Applications of EDI,
Disadvantages of EDI, EDI model.
 Electronic Payment System
 Introduction, Types of Electronic Payment System, Payment Types, 4 Hours
Value Exchange System, Credit Card System, Electronic Fund Transfer,
Paperless bill, Modern Payment Cash, Electronic Cash.

 Internet Marketing
 The PROS and CONS of online shopping, The cons of online shopping, 4 Hours
Justify an Internet business, Internet marketing techniques, The E-
cycle of Internet marketing, Personalization e-commerce.
 SEMESTER – IV
Course Code: COMS (Theory)
Full Marks: 35 Contact Hours: 80
Unit – 1 Database Management System 20 Marks Total 50 Hours

 Introduction 3 Hours
 Drawbacks of Legacy System, Advantages of DBMS, Layered
Architecture of Database, Data Independence, Data Models, Schemas
and Instances, Database Languages, Database Users, DBA, Data
Dictionary.

 Entity Relationship (ER) Modelling 10 Hours

 Entity, Attributes and Relationship, Structural Constraints, Keys (Super
Key, Key, Candidate Key, Alternate Key, Primary Key), ER Diagram of
Some Example Database, Weak and strong Entity Set, Specialization
and Generalization, Constraints of Specialization and Generalization,
Aggregation.

 Relational Model 10 Hours

 Basic Concepts of Relational Model, Relational Algebra.

 Integrity Constraints 2 Hour

 Domain Constraints, Referential Integrity, View.

 SQL
 Introduction, Data Definition Language and Data Manipulation 25 Hours
Language, Data type (char(n), varchar(n), int, float, date), constraints
(not null, unique, primary key), create database, use database, show
databases, drop database, show tables, create table, describe table,
alter table (add and remove an attribute, add and remove primary
key), drop table, insert, delete, select, operators (mathematical,
relational and logical), aliasing, distinct clause, where clause, in,
between, order by, meaning of null, is null, is not null, like, update
command, delete command, aggregate functions (max, min, avg, sum,
count), group by, having clause, joins: cartesian product on two tables,
equi-join and natural join .

Unit – 2 Foundation of Artificial Intelligence (AI) 15 Marks Total 30 Hours

 Introduction to Artificial Intelligence 4 Hours

 Definition and scope of AI.
 Historical overview and key milestones.
 Differentiating AI from human intelligence.

 AI Subfields and Technologies

 Machine learning: Supervised, unsupervised, and reinforcement 10 Hours
learning.
 Deep learning and neural networks.
 Natural language processing (NLP) and computer vision.
 Search as Optimization (only Basic Concepts) 10 Hours
 Strategies for State Space Search.
 Data Driven and Gold Driven Search.
 Heuristic Search, Breadth First Search and Depth First Search.
 A* Search.

 Applications of AI
 AI in finance: Fraud detection, algorithmic trading, and risk 3 Hours
assessment.
 AI in customer service and chatbots.
 AI in education: Personalized learning and intelligent tutoring systems.

 Ethical and Social Implications of AI

 Bias and fairness in AI systems. 3 Hours
 Impact of AI on employment and the workforce.
 AI and social inequality.
 CLASS XI

COURSE CODE: COMS (PRACTICAL)

Full Marks: 30
1. Experiments with basic Linux Commands 5 Marks
 Use of Simple commands-ls, cd, cp, cat, mv, mkdir, rmdir, who, use of wildcard etc.

2. C programming 17 Marks
 Flowchart 3 marks
 Program coding 10 marks
 Output 4 marks

3. Lab Book 3 Marks

4. Viva 5 Marks

List of Suggestive C Programs

1. WRITE A PROGRAM to print the sum and product of digits of an integer.
2.WRITE A PROGRAM to reverse a number.
3. WRITE A PROGRAM to compute the sum of the first n terms of the following series,
S=1+1/2+1/3+1/4+……
4. WRITE A PROGRAM to compute the sum of the first n terms of the following series, S =1-2+3-
4+5…………….
5. Write a function that checks whether a given string is Palindrome or not. Use this function
to find whether the string entered by user is Palindrome or not.
6.Write a function to find whether a given no. is prime or not. Use the same to generate the
prime numbers less than 100.
7. WRITE A PROGRAM to compute the factors of a given number.
8. Write a macro that swaps two numbers. WRITE A PROGRAM to use it.
9.WRITE A PROGRAM to print a triangle of stars as follows (take number of lines from user):
*
***
*****
*******
*********
10.WRITE A PROGRAM to perform following actions on an array entered by the user :
i) Print the even-valued elements
ii) Print the odd-valued elements
iii) Calculate and print the sum and average of the elements of array
iv) Print the maximum and minimum element of array
v) Remove the duplicates from the array
vi) Print the array in reverse order
The program should present a menu to the user and ask for one of the options. The menu
should also include options to re-enter array and to quit the program.
11. WRITE A PROGRAM that prints a table indicating the number of occurrences of each alphabet in the text
entered as command line arguments.
12. Write a program that swaps two numbers using pointers.
13. Write a program in which a function is passed address of two variables and then alter its
contents.
14. Write a program which takes the radius of a circle as input from the user, passes it to
another function that computes the area and the circumference of the circle and displays
the value of area and circumference from the main() function.
15. Write a program to find sum of n elements entered by the user. To write this program,
allocate memory dynamically using malloc() / calloc() functions or new operator.
16. Write a menu driven program to perform following operations on strings:
a) Show address of each character in string
b) Concatenate two strings without using strcat function.
c) Concatenate two strings using strcat function.
d) Compare two strings
e) Calculate length of the string (use pointers)
f) Convert all lowercase characters to uppercase
g) Convert all uppercase characters to lowercase
h) Calculate number of vowels
i) Reverse the string
17. Given two ordered arrays of integers, write a program to merge the two-arrays to get an
ordered array.
18. WRITE A PROGRAM to display Fibonacci series (i) using recursion, (ii) using iteration.
19. WRITE A PROGRAM to calculate Factorial of a number (i) using recursion, (ii) using iteration.
20. WRITE A PROGRAM to calculate GCD of two numbers (i) with recursion (ii) without recursion.
21. Write a menu-driven program to perform following Matrix operations (2-D array
implementation): a) Sum b) Difference c) Product d) Transpose
22. Copy the contents of one text file to another file, after removing all whitespaces.
23. Write a function that reverses the elements of an array in place. The function must accept
only one pointer value and return void.
24. Write a program that will read 10 integers from user and store them in an array.
Implement array using pointers. The program will print the array elements in ascending
and descending order.
25. Write a Program to implement stack operations using array.
26. Write a Program to implement queue operations using array.
27. Write a Program to search an element from a collection using Linear Search.
28. Write a Program to sort a collection of elements using Bubble Sort.
 CLASS XII

COURSE CODE : COMS (PRACTICAL)

Full Marks : 30
1. MYSQL 10 Marks
 Table creation 3 Marks
 Data insertion in table 2 Marks
 2 Queries 5 Marks
2. Python Program 12 Marks
 Coding 9 Marks
 Output 3 Marks
3. Lab Book 3 Marks
4. Viva 5 Marks

Suggested Practical List

List of Suggestive Python Programs

● Input a welcome message and display it.
● Input two numbers and display the larger / smaller number.
● Input three numbers and display the largest / smallest number.
● Generate the following patterns using nested loops:
Pattern-1 Pattern-2 Pattern-3
* 12345 A
** 1234 AB
*** 123 ABC
**** 12 ABCD
***** 1 ABCDE

● Write a program to input the value of x and n and print the sum of the following series:

● Determine whether a number is a perfect number, an Armstrong number or a palindrome.

● Input a number and check if the number is a prime or composite number.
● Display the terms of a Fibonacci series.
● Compute the greatest common divisor and least common multiple of two integers.

● Count and display the number of vowels, consonants, uppercase, lowercase characters in string.
● Input a string and determine whether it is a palindrome or not; convert the case of characters in a string.
● Find the largest/smallest number in a list/tuple
● Input a list of numbers and swap elements at the even location with the elements at the odd location.
● Input a list/tuple of elements, search for a given element in the list/tuple.
● Create a dictionary with the roll number, name and marks of n students in a class and display the names of
students who have marks above 75.
● Write a random number generator that generates random numbers between 1 and 6 (simulates a dice).

Database Management System

● Create a student table and insert data. Implement the following SQL commands on the student table:

o ALTER table to add new attributes / modify data type / drop attribute
o UPDATE table to modify data
o ORDER By to display data in ascending / descending order
o DELETE to remove tuple(s)

o GROUP BY and find the min, max, sum, count and average.

o LIKE, DISTINCT, NOT IN, IN, JOIN, CARTISIAN PRODUCT SET DIFFERENCE, UNION, INTERSECTION etc.