West Bengal Council of Higher Secondary Education Computer Science Syllabus

Hello sir I am here as I want to get the detailed syllabus of Computer Science of Class XI of West Bengal Council of Higher Secondary Education so will you please provide me the syllabus?

[Shaleen]

West Bengal Council of Higher Secondary Education is the West Bengal state government administered autonomous examining authority for the Standard 12 examination (or Higher secondary level or Pre-university level examination) of West Bengal, India.
As per your demand here I am providing you detailed syllabus of Computer Science of Class XI
A. Brief Review of Computer Systems:
i) Computer Organization: (10 Marks)
ƒ History of Computers
ƒ Computer Generations
ƒ Functions of Computer
ƒ Block Diagram of a Computer System
ƒ Brief description of each functional block of a computer –
¾ Input Devices (Keyboard, Mouse, Touch Screen, OMR, OCR, MICR, Punch Tape, Punch Card, Graphic Tablet, Barcode Reader,
Light Pen)
¾ Output Devices (Monitor – CRT, LCD; Printer)
¾ CPU (CU, ALU)
¾ Memory – Primary [ROM (PROM,EPROM, EEPROM), RAM (SRAM, DRAM)] and Secondary( HDD, FDD, CD-ROM) and Cache
Memory
¾ Bus : Definition and Types
ii) Data Representation: (8 Marks)
ƒ Number Systems – Decimal, Binary, Octal and Hexadecimal Number
ƒ Conversion (whole numbers and fractions) of
¾ Binary to Decimal, Octal, Hexadecimal and vice versa
ƒ Addition, Subtraction, Multiplication, Division in all the above number systems
ƒ Different methods of Negative Number Representation
¾ Signed Magnitude
¾ One’s Complement
¾ Two’s Complement
iii) Topics on Boolean Algebra: (12 Marks)
ƒ Logical Operations – OR, AND, NOT logic
ƒ Laws and Identities of Boolean Algebra
ƒ De’ Morgan’s Theorems and Basic Principle of Duality
ƒ Proof using Identities and Truth Tables
ƒ Combinational logic functions, SOP and POS expressions
ƒ Logic Gates – OR, AND, NOT, XOR, X-NOR Gates
ƒ Universal Gates – NAND and NOR Gate; Basic gates using Universal Gates
ƒ Simple combinational circuit design using gates and simple cases of minimization
ƒ Combinational Circuits (conversion is not necessary)
¾ Half Adder & Full Adder (definition and representation)
¾ Half Subtractor & Full Subtractor (definition and representation)
¾ Multiplexer (4x1) and Demultiplexer (1x4)
¾ Decoder and Encoder (Maximum 3 bits)
ƒ Multiplication and Booth’s Algorithm

B. Operating Systems: (10 Marks)
ƒ Function and role of Operating System
ƒ Booting(cold and hot)
ƒ Directory and File Structure, Path and Pathname
ƒ File naming system, System files, Batch files, executable files
ƒ Familiarities with different commands and utilities of MS-DOS and MS-Windows
ƒ Familiarities with GUI
ƒ Study of UNIX / Linux with respect to commands and utilities

C. Programming in C: (30 Marks)
ƒ Concept of Algorithm and Flowchart (Time & Space requirements)
ƒ Introduction to C
ƒ Character Sets, Keywords, Constants, Variables, Operators in C
ƒ Data types in C
ƒ Header files
ƒ Input/Output operations
ƒ Control structures
ƒ Loop structures
ƒ Array
ƒ String
ƒ Functions (user-defined and common library functions) including recursive function
ƒ Structures
ƒ Simple problem solving