COMPUTER SCIENCE SYLLABUS

STD XII
ACADEMIC YEAR-2023-2024

( MARKS:- 70)

UNIT MAX
NO NAME OF UNIT MARKS

I PROGRAMMING IN C++ 20
II DATA STRUCTURE IN C++ 20
III FILE HANDLING IN C++ 10
IV BOOLEAN ALGEBRA 10
V NETWORK (PART-II) 10
TOTAL 70

FORMATIVE I
(MARKS-20)

UNIT MAX
NO NAME OF UNIT MARKS

PROGRAMMING IN C++
I 10
(Sub Units:-01 to 06)
IV BOOLEAN ALGEBRA 10
TOTAL 20
 FORMATIVE II
(MARKS-20)

UNIT MAX
NO NAME OF UNIT MARKS

PROGRAMMING IN C++
I 10
(Sub Units:-07 to 10)
II DATA STRUCTURE IN C++ 10
TOTAL 20
 UNIT-I:

PROGRAMMING IN C++ (20MARKS)

1. C++ Fundamentals:
 C++ character set
 Identifiers and Keywords
 Data Types: int, float, char, double, void
 Qualifiers: short, long, signed, unsigned, const
 Constants (Integer, Floating point, character, string, enumeration
constants, symbolic constants
 Escape Sequence (\b, \t, \n, \v, \a, \f,\r, \0)
 Variables and Declaration, Dynamic initialization of variables,
reference Variables
2. Operators and Expressions:
 Unary Operators: unary minus,++, - -, !, sizeof(),typecast
 Arithmetic Operators: *, /, %,+,-
 Relational Operators: <, <=, >, >=
 Equality Operators: ==, !=
 Logical Operators: &&, ||
 Conditional Operator: ?:
 Assignment Operator: =, +=, -=, *=, /=, %=
 Scope resolution operators(::)
 Memory management operators: new(), delete()
 Operator precedence and associativity
3. Data Input and Output
 Header file <iostream.h>
 Using cin and cout with Insertion and extraction operators
 Manipulators: Definition, Header file <iomanip.h>
setw, endl, setprecision, setfill, setiosflags, resetiosflags
Flags : ios::left, ios::right, ios::scientific, ios::fixed,
ios::showpos, ios::showpoint, ios::skipus, ios::unitbuf.
4. Use of editor, basic commands of editor, Compilation, Linking and
Execution of Program, Debugging.
5. Control Statements:
If-else statement, while statement, do-while statement, for statement,
switch statement. break statement, continue statement Comma operator.
6. Functions:
Definition, Concept, General Form, Function Declaration, Function
Definition,Scope of a variable, Local and Global variables
 Function Call (pass by value, pass by reference using pointers and pass by
reference using reference variable) Calling Function with arrays as parameters,
Return by Reference, Inline Functions,
Functions with Default Parameters, Function overloading
Built-in Functions:
<string.h>: strlen(), strcmp(), strcat(), strcpy()
<math.h> : log(), log10(), pow(), sqrt(), sin(), cos(), abs()
<ctype.h>: isalnum(), isdigit(), islower(), isupper(), tolower(),
toupper(), isalpha(),isspace()
<stdio.h>: gets(),puts(),getchar(),putchar()
<conio.h>: clrscr(),getch()
7. Basic concepts of Object Oriented Programming:
Definition, Objects, Classes, Data Abstraction, Data Encapsulation,
Inheritance, Polymorphism Characteristics of Object Oriented
Programming
8. Classes and Objects:
Definition of class and object, Declaration of class, Defining member functions
(inside the class and outside the class), Creating Objects, Accessing Class
Members, Array of objects, Objects as function argument, Functions returning
objects.
9. Constructors and Destructors
Definition and characteristics of constructors, Default Constructor, Constructor
with Default Arguments, Parameterized constructors (explicit call, implicit call),
Constructer overloading, Copy Constructor, Dynamic Constructor, Dynamic
Initialization of objects, Destructor Definition and characteristics.
10. Inheritance:
Definition, Concept of Inheritance: Base , and derived classes,
Abstract classes Type of Inheritance: single, multiple, multilevel, hierarchical
and hybrid. Defining Derived Class: Visibility modes (public, private, protected)
Public Derivation, Private Derivation, Protected Derivation, Constructors in
Derived classes, Containership Virtual base classes.

UNIT II :
DATA STRUCTURES USING C++ (20 MARKS)
1) Arrays:-
 One Dimensional arrays Definition, Declaration, Reading, Displaying, Accessing.
Algorithm and Program for inserting and deleting an element in an array.
Memory allocation. Sorting: Definition, sorting techniques (Insertion Sort,
Selection Sort, Bubble Sort algorithms and programs) Searching: Definition,
Searching Techniques (Linear Search, Binary Search Algorithms and Programs)
Merging: Definition, Algorithm and Program to merge two sorted arrays
Applications: Insertion of an element in a sorted array, Displaying common
elements of two single dimensional arrays and other applications. •
 Two Dimensional Arrays Definition, Declaration, Reading, Displaying,
Accessing. Applications: Matrix Addition, Transpose of a matrix, Matrix
Multiplication, Representation of sparse matrix in 3- Tuple form, and other
applications.
2) Structures and Pointers:
 Pointers- Definition, Concept, Declaration, Pointer to one and two dimensional
array.
 Structures- Definition, Concept, Declaration, Structure variable, array of
structures, pointer to a structure variable, pointer to array of structures.
3) Linked lists
 Singly Linked list: Concept, Definition, Diagram, Operations (Creation, Display,
Deletion of a node at any position, Insertion of a node at any position).
 Circular Linked list: Concept, Definition, Diagram.
 Doubly Linked List: Concept, Definition, Diagram
 Applications of singly linked list- Linear search and other applications.
 Stacks: Concept, Definition, and implementation of a stack using linked
list(PUSH,POP and display). Applications of stacks (Infix, Postfix and Prefix
Notations of expressions, Conversion of infix to postfix using stacks [Algorithms
and problems only], Evaluation of postfix expressions[Algorithms and problems
only]).
 Queues: Linear queue- Concept, Definition, Implementation of queue using
linked list( Add, Delete and Display). Circular Queue- Concept, Definition.

UNIT III:
FILE HANDELING (10 MARKS)
 Files: Definition, Types of files-Text and Binary.
 Stream Classes and their Member Functions. Ifstream- get(), getline(), read(),
seekg(),tellg(), Open(),close(),eof() Ofstream- put(), seekp(), tellp(), write(),
Open(),close(). Fstream.
 File Modes-ios:: app, ios::ate, ios::in, ios::out, ios::binary, ios::trunc,
ios::nocreate, ios::noreplace
 Opening a file using constructor and using open member function.
 Closing a file.
 Detecting the end of a file.
 File Pointer and their manipulation.
 Text Files: Creation, Display and File Processing (Character and String based
processing)
 Binary Files: Creation, Display and File Processing (Appending, Inserting,
Deleting, Updating, Searching, Splitting and Merging)
UNIT IV:
BOOLEAN ALGEBRA (10 marks)
 Basics of Boolean Algebra :- Evolution of Boolean Algebra , Basic Terminology
– Logical Statements, Logical Constants, Binary Valued Quantities , Compound
Statements, Truth Table.
 Logical operators:- NOT, AND, OR , Switch, Switching Circuits (NOT, AND,
OR).
 Postulates of Boolean algebra:- Closure Property, Commutative Property ,
Associative Property Distributive Property , Identity Property , Inverse Property .
 Laws of Boolean Algebra : Idempotent Law, Distributive Law, Absorption Law,
Involution law.
 DeMorgan's Law and their applications.
 Principle of Duality in Boolean algebra.
 Derivation of Boolean expression:
 Minterm , Maxterm , Shorthand Notation, Canonical Form, Sum of Product form
(SOP), Product of Sum form (POS), Conversion of SOP to POS and vice versa,
simplification of boolean expressions using postulates and laws of Boolean
Algebra.
 Karnaugh Maps: Two variable K map, Three variable K map, Four variable K
map, Pairing , Quads, Octet in K map, Simplification of K maps up to four
variables , Overlapping groups , map rolling, eliminating redundant groups, use
of K map for simplification and conversion of Boolean expression.
 Logic gates: Fundamental gates: AND gate, OR gate, NOT gate (Definition,
Symbol, Truth table)
 Derived gates: NOR gate, NAND gate, X-OR gate, X-NOR gate (Definition,
Symbol, Truth Table), NAND and NOR gates as universal gates. Constructing
logic circuits using basic gates and universal gates.
 Adder circuits: Half Adder and Full Adder – Definition, Truth table, obtaining
simplified expression for sum and carry ,Circuit Diagrams, obtaining full adder
from half adders.

UNIT V-(10 MARKS)

COMPUTER NETWORKS

 Networks:
Definition, Components, Need for Networking, advantages, disadvantages.

 Types of Networks:
LAN, MAN, WAN ( definations)

 Communication Channel:
Physical Channel: Twisted Pair Cable, Co-axial Cable, Optical Fibre Cable
(Diagram, description, application).
Wireless Channel: Microwave, Radio wave, and Satellite Links.
 Data Switching Techniques:
 Circuit Switching, Message Switching and Packet Switching.
 Network Devices and their uses:
Modem, Hub, Repeaters, Bridge, Router, Gateway, Switch.

 Network Topologies:
Definition, Types of Topologies with advantages and disadvantages (Bus, Tree,
Star, Ring).

 Application of Networks:
Email, E-commerce, Chat Services, Video Conferencing, Usenet.
 Protocols:
Definition, File Transfer Protocol (FTP), Hyper Text Transfer
Protocol (HTTP), Transmission Control Protocol/Internet Protocol(TCP/IP),
Remote Login(Telnet).

 Internet Related Terminologies:

Internet, Internet Service Providers, Internet Addressing, World Wide
Web(WWW), Uniform Resource Locator(URL), Web Server, Web page,
Website, Web Browser, Hyper Text Mark-up Language ( HTML), Dynamic
Hyper Text Mark-up Language (DHTML), Search Engine, Downloading and
Uploading files, Hacking, Cracking,
SUGGESTED ASSIGNMENTS (any one)
1. Programs in C++ (Minimum 2), involving concepts related to Classes
& Objects, Function Overloading, Inheritance, Constructors and
Destructors.
2. Problem solving in Stack, Queues, Arrays and Linked list. For
Example-Evaluation of postfix expression Conversion from infix to postfix
expression Problems on Stacks and Queues etc.
3. Programs on basic file operations (Read,Write,Update, Search,
Append etc)
4. Problems based on: K-MAPS Implementation of NAND –NOR &
NOR-NAND logic Designing circuits using universal gates.
5. Presentations can be prepared on any topic related to computer
networks.

N.B. Viva can be conducted on any of the related topics The criteria for
the evaluation of the assignments should be based on the following. (As
applicable for the appropriate assignments).
1. Understanding of concepts
2. Knowledge w.r.t. the assignment given
3. Content (for presentations)
4. Logic (for programs)
5. Test Cases- Programs should be tested for different set of inputs.