ISC Syllabus Computer Science 2013. Download the latest syllabus to do your studies as per the latest guidelines issued by CBSE NCERT. The syllabus, weightage of chapters, blue print of question papers and the design of question papers is issued every year for the benefit of students. Access all syllabus for all subjects here

**Aims (Conceptual)**

**(1)** To understand algorithmic problem solving using data abstractions, functional and procedural abstractions, and object based and object oriented abstractions.

**(2)** To understand:

**(a)** how computers represent, store and process data by studying the architecture and machine language of a simple microprocessor and the different levels of abstraction that mediate between the machine and the algorithmic problem solving level and

**(b)** how they communicate with the outside world.

**(3)** To create awareness of ethical problems and issues related to computing.

**Aims (Skills)**

To devise algorithmic solutions to problems and to be able to code, validate, document, execute and debug the solution using the Java programming system.

**CLASS XI**

There will be two papers in the subject:

**Paper I: **Theory - 3 hours ….100 marks

**Paper II: **Practical - 3 hours ….100 marks

**PAPER I -THEORY**

Paper 1 shall be of 3 hours duration and be divided into two parts.

**Part I (30 marks): **This part will consist of compulsory short answer questions, testing knowledge, application and skills relating to the entire syllabus.

**Part II (70 marks): **This part will be divided into three Sections, A, B and C. Candidates are required to answer **three **questions out of **four **from Section A and **two **questions out of **three **in each of the Sections B and C. Each question in this part shall carry 10 marks.

**SECTION A**

**Basic Computer Hardware and Software**

**1. Numbers**

Representation of numbers in different bases and interconversion between them (e.g. binary, octal, decimal, hexadecimal). Addition and subtraction operations for numbers in different bases.

Introduce the positional system of representing numbers and the concept of a base. Discuss the conversion of representations between different bases using English or pseudo code. These algorithms are also good examples for defining different functions in a class modelling numbers (when programming is discussed). For addition and subtraction use the analogy with decimal numbers, emphasize how carry works (this will be useful later when binary adders are discussed).

**2. Encodings**

**(a)** Binary encodings for integers and real numbers using a finite number of bits (signmagnitude, twos complement, mantissaexponent notation). Basic operations on integers and floating point numbers. Limitations of finite representations.

Signed, unsigned numbers, least and most significant bits. Sign-magnitude representation and its shortcomings (two representations for 0, addition requires extra step); twos-complement representation. Operations (arithmetic, logical, shift), discuss the basic algorithms used for the arithmetic operations. Floating point representation: normalized scientific notation, mantissaexponent representation, binary point (discuss trade-off between size of mantissa and exponent). Single and double precision.

Arithmetic operations with floating point numbers. Properties of finite representation: overflow, underflow, lack of associativity (demonstrate this through actual programs).

**Please click the link below to download ****ISC Syllabus Computer Science 2013****.**

**Click for more Computer Science Study Material**

**›**