Curriculum And Syllabus For Classes XI & XII

3 Hours

100 Marks

1.

 Historical/Technological Evolution of Components and their Applications

(a) Basic concepts about data, information and related terms, stages involved in data processing ;Types of data processing systems and their characteristics ; Manual, Batch, Interactive, On-line, distributed.

(b) Binary, Octal and Hexadecimal number systems and their arithmetic ; Representation of numeric data using signed bit magnitude, one's complement, two’s complement ; Coding alphanumeric characters-EBCDIC, ASCII-8 and BCD Codes ; Bits and Bytes, Computer words and Internal data representation of numerical data and floating point decimal representation
Data precision ; Representing data on magnetic Tapes and Discs.

(a) Block diagram of Computer system showing the flow of data and control information. Functional description of the basic units.

(b) Input/Output devices : Punched card and Paper Tape : Mark sense reading ; MICR, OCR :Remote terminals, Mouse, Light pen, Voice input, Key-to-Magnetic media. Printed output through Line/Serial./ Laser printers ; Graphical output, VDU, COM, Audio response unit.

(c) Central Processing Unit : Control unit, Primary storage unit, Registers Instruction Decoder, Program counter.

(d) Stored-Program Concept, Primary storage, magnetic core/semiconductor storage, RAM and ROM, fast access memories e.g. Cache and Catent addressable storage. Auxiliary storage devices :Magnetic tape, Magnetic disk, Floppy disk and Winchester disk.

(e) Instruction types and formats. Types of registers, different modes of addressing schemes (including direct, indirect, immediate and indexed) and their merits. Fetch and execution cycle in a single address system.

(a) Categories of Programming languages ; Machine language, Assembly Language, High Level Language Fourth generation Language, Procedural versus Nonprocedural Languages. Major High-level Languages ; their basic strengths and areas of application including BASIC, FORTRAN, COBOL, PASCAL, ADA, C Advantages of high level languages.

(b) Writing small programs in machine and assembly language for a hypothetical machine.

(c ) Conceptual understanding of assemblers, compilers, interpreters, application and system software ; Major steps involved in the process of compilation and execution. Overview of facilities available in popular application. Software Packages : Word Processors, Data Managers, Spreadsheets, Graphic Packages.

(d) Conceptual understanding of multiprogramming, time sharing multiprocessing, networking, distributed processing environments.

Problem solving process, defining the problem input, processing and output ; Designing a solution. Basic control structures ; Sequence. selection looping and branching. Developing Algorithms. Elements of structured Programming. Molecular Programming, Top down Programming. Advantages of Structured programming. Programming in BASIC. Representation of integers, reals, characters, instructions, data types, constants, variables ; Arithmetic expressions. Sequencing alternation and iteration ; Arrays, sub-programs and parameters, simple I/0, Principles of algorithms development and good programming style; Realisation of structured programming concepts.

String processing ; Internal searching and sorting ; Efficiency of Algorithms. Debugging, testing, verification. Case studies and applications.

PRACTICAL
(BASIC PROGRAMMING)

The practical involves program writing, executing and debugging in BASIC programming. The problems are separated in the following sections.

1. Formula type problems :e.g. Calculating area of surfaces, volume, simple and compound interest calculations etc.
2. Problems using control statements ;e.g. Summation of series, calculation of mean, mode, median, deviations, standard deviation, finding of maximum and minimum, searching.
3. Problems on string processing : e. g. CHRS, LEFTS, RIGHTS, MIDS, LEN, SPACES, STRS, VAL, ASC, etc.
4. Problems using loops or repeated interation, nested loops, ( Finding of factorial of any integer ), subscripted variables.
   e.g. Problems given in 2 may be repeated.
5. Problems using subprograms e.g. using GOSUB.

Computer Science

CLASS XII

THEORY PAPER

Units

1. Binary-valued quantities ; Basic postulates of boolean algebra and the operations AND, OR and NOT.

2. Basic theorems of boolean algebra : Principle of duality, Idempotent law, commutative law, associative law, distributive law operations with 0, 1 and complements, absorption law Involution, Demorgan's theorem and applications.

3. Reducing boolean expression to canonical form and to minimum sum of product form ; Simple Karnaugh map and its applications.
4. Basic logic gates ( NOT, AND, OR, NAND, NOR )and their uses in computers.

1. Components of a file ( character, field, record ) : Types of files ( master, transaction, updated, dump, work files ). Logical record ( fixed length and variable length ). Logical File Organisations ( sequential, index sequential, direct access ) and their strengths and weaknesses ; Creating, accessing and using sequential file ; Rewriting processed data into a new file Generation of a file.

2. Tape File Organisation : header and trailer labels. IRG and IBG, blocking factor, storage capacity of a reel of tape ; Tape Fife processing activities ; creation, access, storage etc ; Update procedures.

3. Disk file Organisation : Physical Organisation of records, surfaces, cylinders ; basic types of file access methods ; sequential, direct and ISAM.

4. Guidelines for choosing the right type of device and right organisation for a given Application.

1. Concept of data structure, data type, primitive versus non-primitive data type, logical versus physical implementation.

2. Linear data structures and operations associated with them ( traversal, search, insertion, deletion ), Implementation techniques. Application such as Stack and table parsing. One and two dimensional arrays, Sequential allocation, address calculations ; Algorithms for one-dimensional array for traversal, search, insertion, deletion, sorting ( selection sort and bubble sort ), binary search.

3. Simple lists, group lists; circular lists ; operations on singly linked lists for traversal, searching, insertion and deletion, The free storage pool ( available list ) algorithm to select and return a free node.

4. Comparative study of sequential and linked storage in terms of memory utilisation, processing time and case of processing.

Introduction to PASCAL Language: Basic PASCAL concepts : scalar data types ( integers, reals, boolean, character ), operators for scalar data types, standard functions, PASCAL Program structure.

Declarations :  Label declaration ; const. declarations Type, declarations ; User defined scalar data type, sub-range data type, Array data type, Record data type, set data type, Pointer and File data types ; Var declaration ; Function and Procedure declaration, Executable statements in PASCAL : Assignment statements, input/output statements; compound statements : conditional statement : If/Then/ Else statement, case statement ; Go to statement ; Looping constructs . While, Repeat, For statements. Developing PASCAL programs ; Programming style. Data Structure Linear data structure ( arrays, records, stacks, queues Linked lists and trees, File3 Case studies and applications.

1. Introduction to Operating System (OS) ; Functions of an 0S as a resources manager . processor management, device management ; Multitasking concurrency of computations and 1/0 activity, concurrency between user programs. Types of OS; Single-program OS, Concurrent OS, Time Sharing OS, multiprocessing OS, Virtual storage 0S, Real-time 0S, Virtual-machine OS. Names of some popular Operating Systems for different classes of computers, Components of Operating Systems : Control programs ( job control program and I/O management system ) ;Processing programs ( language translators, linkage editor. library programs, utility programs; Additional software.

2. A brief history of ..MS-DOS what MS-DOS does and how it. uses disks and files DOS directory structure.

   MS-DOS commands for file maintenance, file output, simple disk maintenance, system setting, path maintenance, batch file etc.

   Line Editor ( EDLIN ).

PRACT1CAL
( PASCAL PROGRAMMING AND MS-DOS COMMANDS)

The Practical involves program writing , executing and debugging in PASCAL programming and MS-DOS commands. The problems are separated in the following sections

1. Formula type problems :

   e.g. Calculating area of surfaces, volume, simple and compound interest calculation etc.

2. Problems using control statements :

   e.g. summation of series, calculation of mean, mode, median, deviation, standard deviation, finding of maximum andminimum, searching.

3. Problems using loops or repeated iteration, nested loops, subscripted variable.

   e.g. problems given in 2 may be repeated

4. Problems using procedures
5. Exercises on MS-DOS commands like creating BAT file, MD, RD, CD, DEL. REN, etc.

Books Recommended for Class XI and XII

1. Programming with BASIC ( 3rd Edition )

   -by Byron S. Gottfried ( McGraw Hill International Book Company )

2. Introduction to Computers and BASIC programming

   -by C. Xavier

3. Text Books prescribed

   - by CBSE.

4. Introduction to Computer Science

   -by Thomas C. Bartee ( McGraw Hill International Book Company )

5. Programming with PASCAL

    -by Byron S. Gottfried ( MeGraw Hill International Book Company ).

6. Digital Principles and Applications

    –by Malvino-Leach.

7. Theory and Problems of Data Processing

   -by M. M. Lipschutz and S. Lipschutz ( McGraw HillI International Book Company ).

8. Progamrning in BASIC

   -by E Balagurusamy ( Tata McGraw Hill Publishirig Company Limited).

9. DOS Guide

   -by P. Norton ( Prentice-Hall of India Private Limited. )

10. Fundamentals of Computers

     -by V. Rajaraman ( Prentice-Hall of India Private Limited. )

11. Elements of Computer Science

     -by M. Chandrasekaran, S. Govindaraju, A. Abdul Hug, T.R. Narayanan (New Age International (P) Limited, Publishers)