Class -11 Computer Science

There will be two papers in the subject:

Paper I: Theory………….. 3 hours…70 marks
Paper II: Practical………. 3 hours…30 marks
PAPER I –THEORY – 70 MARKS
Paper I shall be of 3 hours duration and be divided
into two parts.
Part I (20 marks): This part will consist of compulsory short
answer questions, testing knowledge, application and skills relating
to the entire syllabus.
Part II (50 marks): This part will be divided into three Sections,
A, B and C. Candidates will be required to answer two questions
out of three from Section A (each carrying 10 marks) and two
questions out of three from Section B (each carrying 10 marks)
and two questions out of three from Section C (each carrying 5
marks). Therefore, a total of six questions are to be answered in
Part II
SECTION A
Basic Computer Hardware and Software
Chater-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
Chapter-2 Encodings:
• Binary encodings for integers and real numbers using a finite
number of bits • Characters and their encodings (e.g. ASCII,
ISCII, Unicode)
Chapter-3 . Propositional logic, Hardware implementation,
Arithmetic operations:
• Propositional logic • Logic and hardware
Section – B
Chapter-4 Introduction to Object Oriented Programming
using Java
chapter-5 Objects:
• Objects as data (attributes) + behavior (methods or methods)
• Analysis of some real-world programming examples in terms of
objects and classes
• Basic concept of a virtual machine • Compile time and run time
errors
Chapter-6 Primitive values, Wrapper classes, Types and
casting:
• Primitive values and types
Chapter-7 Variables, Expressions:
• Variables as names for values • named constants (final)
• Assignment operation • Difference between left-hand side and
right-hand side of assignment.
Chapter-8 Statements, Scope:
• Statements • Grouping statements
chapter-9 Methods and Constructors:
• Methods and Constructors • methods as mechanisms for side
effects • formal arguments and actual arguments in methods.
• different behavior of primitive and object arguments. • Static
methods and variables. • Examples of algorithmic problem-solving
using methods (number problems, finding roots of algebraic
equations etc.)
Chaper-10 Arrays, Strings:
• Structured data types – arrays • Strings • Example algorithms that
use structured data types
Section-C
Chapter-11 Basic input/output Data File Handling (Binary and
Text):
• Basic input/output using Scanner and Printer classes • Data File
Handling.

Chapter-12 Recursion:
• Concept of recursion • Simple recursive methods
Chapter-13 Implementation of algorithms to solve problems:
• Address correctness issues • implement and execute the algorithm
in Java and debug where necessary.
Chapter-14 Packages:
• Definition • creation of packages • Importing user defined
packages • Interaction of objects across packages.
Chapter-15 Trends in computing and ethical issues:
• Artificial Intelligence, Internet of Things, Virtual Reality and
Augmented Reality • Cyber Security, privacy, netiquette, spam,
phishing. • Intellectual property, Software copyright and
patents and Free Software Foundation

PAPER II: PRACTICAL – 30 MARKS

This paper of three hours duration will be evaluated internally by
the school.
The paper shall consist of three programming problems from which
a candidate has to attempt any one. The practical consists of the
two parts:
(1) Planning Session
(2) Examination Session
The total time to be spent on the Planning session and the
Examination session is three hours. A maximum of 90 minutes is
permitted for the Planning session and 90 minutes for the
Examination session. Candidates are to be permitted to proceed
to the Examination Session only after the 90 minutes of the
Planning Session are over.
Planning Session
The candidates will be required to prepare an algorithm and a
hand-written Java program to solve the problem.
Examination Session
The program handed in at the end of the Planning session shall be
returned to the candidates. The candidates will be required to key-
in and execute the Java program on seen and unseen inputs
individually on the Computer and show execution to the examiner.
A printout of the program listing, including output results should
be attached to the answer script containing the algorithm and
handwritten program. This should be returned to the examiner. The
program should be sufficiently documented so that the algorithm,
representation and development process is clear from reading the
program. Large differences between the planned program and the
printout will result in loss of marks.
Teachers should maintain a record of all the assignments done as
part of the practical work throughout the year and give it due credit
at the time of cumulative evaluation at the end of the year. Students
are expected to do a minimum of twenty assignments for the year
and ONE project based on the syllabus.
List of Suggested Projects:
PRESENTATION / MODEL BASED/ APPLICATION
BASED
1. Creating an expert system for road-traffic management (routing
and re-routing of vehicles depending on congestion).
2. Creating an expert system for medical diagnosis on the basis of
symptoms and prescribe a suitable treatment.
3. Creating a security system for age-appropriate access to social
media.
4. Simulate Adders using Arduino Controllers and Components.
5. Simulate a converter of Binary to Decimal number systems
using Arduino Controllers and Components.
6. Develop a console-based application using Java for Movie
Ticket Reservation.
7. Develop a console-based application using Java to encrypt and
decrypt a message (using cipher text, Unicode-exchange, etc).
8. Develop a console-based application using Java to find name of
the bank and branch location from IFSC.
9. Develop a console-based application using Java to calculate
taxable income (only direct tax).
10. Develop a console-based application using Java to develop a
simple text editor (text typing, copy, cut, paste, delete).