ISC Class 11 Computer Science Syllabus 2024-25: The ISC Board has released the ISC Class 11 Computer Science syllabus for the academic year 2024-25. This article gives direct access to the Computer Science syllabus for class 11 students. The curriculum for ISC Class 11 Computer Science are available to see and download here. As the curriculum is taken directly from the official website of ISC board students can refer and download the PDF with confidence. The subject code for computer science is 868. Theory is covered in Part 1, while internal evaluation and project work are covered in Part 2. The evaluation will be based on the syllabus and pattern presented below in the article. To know the entire curriculum and syllabus, read the full article for more understanding and clarity:
ISC Class 11 Computer Science Syllabus: Aims
- To understand algorithmic problem solving using data abstractions, functional and procedural abstractions, and object based and object-oriented abstractions.
- To understand: (a) how computers represent, store and process data at different levels of abstraction that mediate between the machine and the algorithmic problem solving level and (b) how they communicate with the outside world.
- To create awareness of ethical issues related to computing and to promote safe, ethical behavior.
- To make students aware of future trends in 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.
ISC Class 11 Computer Science Syllabus Key Highlights
There will be two papers in the Computer Science Language:
| Paper I: Theory (3 hours) | 70 Marks |
| Paper II: Project Work (3 hours) | 30 Marks |
ISC Class 11 Computer Science Syllabus 2024-25
PAPER I: THEORY - 70 Marks
The ISC board has released the computer science syllabus for Class 11 for the academic year 2024-25. It consists of three sections A,B & C. Students can refer the table below for more understanding regarding the course structure:
| 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. |
| 2. Encodings (a) Binary encodings for integers and real numbers using a finite number of bits (signmagnitude, 2’s complement, mantissaexponent notation). (b) Characters and their encodings (e.g. ASCII, ISCII, Unicode). |
| 3. Propositional logic, Hardware implementation, Arithmetic operations (a) Propositional logic, well-formed formulae, truth values and interpretation of well formed formulae, truth tables. (b) Logic and hardware, basic gates (AND, NOT, OR) and their universality, other gates (NAND, NOR, XOR, XNOR), half adder, full adder. |
| SECTION B |
| 4. Introduction to Object Oriented Programming using Java Note that topics 5 to 12 should be introduced almost simultaneously along with Classes and their definitions. |
| 5. Objects (a) Objects as data (attributes) + behaviour (methods or methods); object as an instance of a class. (b) Analysis of some real-world programming examples in terms of objects and classes. (c) Basic concept of a virtual machine; Java Virtual Machine (JVM); compilation and execution of Java programs (the javac and java programs). (d) Compile time and run time errors; basic concept of an exception, the Exception class, try-catch, throw, throws and finally. |
| 6. Primitive values, Wrapper classes, Types and casting Primitive values and types: byte, int, short, long, float, double, boolean, char. Corresponding wrapper classes for each primitive type. Class as type of the object. Class as mechanism for user defined types. Changing types through user defined casting and automatic type coercion for some primitive types. |
| 7. Variables, Expressions Variables as names for values; named constants (final), expressions (arithmetic and logical) and their evaluation (operators, associativity, precedence). Assignment operation; difference 3 between left-hand side and right-hand side of assignment. |
| 8. Statements, Scope Statements; conditional (if, if else, if else if, switch case) ternary operator, looping (for, while, do while), continue, break; grouping statements in blocks, scope and visibility of variables |
| 9. Methods and Constructors Methods and Constructors (as abstractions for complex user defined operations on objects), methods as mechanisms for side effects; formal arguments and actual arguments in methods; different behaviour of primitive and object arguments. Static methods and variables. The this operator. Examples of algorithmic problem solving using methods (number problems, finding roots of algebraic equations etc.). |
| 10. Arrays, Strings Structured data types – arrays (single and multidimensional), strings. Example algorithms that use structured data types (searching, finding maximum/minimum, sorting techniques, solving systems of linear equations, substring, concatenation, length, access to char in string, etc.). |
| SECTION C |
| 11. Basic input/output Data File Handling (Binary and Text) (a) Basic input/output using Scanner and Printer classes. (b) Data File Handling. |
| 12. Recursion Concept of recursion, simple recursive methods (e.g. factorial, GCD, binary search, conversion of representations of numbers between different bases). |
| 13. Implementation of algorithms to solve problems The students are required to do lab assignments in the computer lab concurrently with the lectures. Programming assignments should be done such that each major topic is covered in at least one assignment. Assignment problems should be designed so that they are sufficiently challenging and make the student do algorithm design, address correctness issues, implement and execute the algorithm in Java and debug where necessary. |
| 14. Packages Definition, creation of packages, importing user defined packages, interaction of objects across packages. |
| 15. Trends in computing and ethical issues (a) Artificial Intelligence, Internet of Things, Virtual Reality and Augmented Reality (b) Cyber Security, privacy, netiquette, spam, phishing. (c) Intellectual property, Software copyright and patents and Free Software Foundation. |
PAPER II: PROJECT WORK - 30 Marks
Candidates will be required to have completed two projects from any topic covered in Theory. The written outcome of the project should be structured as given below:
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:
- Planning Session
- 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.
EVALUATION
Marks (out of a total of 30) should be distributed as given below:
Continuous Evaluation
Candidates will be required to submit a work file containing the practical work related to programming assignments done during the year and ONE project.
| Programming assignments done throughout the year | 10 marks |
| Project Work (based on any topic from the syllabus) | 5 marks |
Terminal Evaluation
| Solution to programming problem on the computer | 15 Marks |
(Marks should be given for choice of algorithm and implementation strategy, documentation, correct output on known inputs mentioned in the question paper, correct output for unknown inputs available only to the examiner).
List of suggested assignments for Project Work:
PRESENTATION / MODEL BASED/ APPLICATION BASED
- Creating an expert system for road-traffic management (routing and re-routing of vehicles depending on congestion).
- Creating an expert system for medical diagnosis on the basis of symptoms and prescribe a suitable treatment.
- Creating a security system for age-appropriate access to social media.
- Simulate Adders using Arduino Controllers and Components.
- Simulate a converter of Binary to Decimal number systems using Arduino Controllers and Components.
- Develop a console-based application using Java for Movie Ticket Reservation.
- Develop a console-based application using Java to encrypt and decrypt a message (using cipher text, Unicode-exchange, etc).
- Develop a console-based application using Java to find name of the bank and branch location from IFSC.
- Develop a console-based application using Java to calculate taxable income (only direct tax).
- Develop a console-based application using Java to develop a simple text editor (text typing, copy, cut, paste, delete).
Click the following link to download the above-mentioned material in PDF format:
Also Read: ISC Class 11 Syllabus 2024-25
-1753338773363.jpg)
Comments
All Comments (0)
Join the conversation