CBSE Class 11 Computer Science Syllabus 2023 For Term 1 & Term 2: With the latest CBSE Class 11 Computer Science Syllabus, you will get to know the chapters and concepts to be covered in all topics. It will also let you know the weightage in various topics for the board exam. You should have a depth concept in every topic of Class 11 Computer Science to score better marks Syllabus of Computer Science Class 11 CBSE 2023 Exam. In this article, you can check the detailed CBSE Class 11 Computer Science Syllabus for better preparation.
Detailed Unit-Wise CBSE Class 11 Computer Science Syllabus 2023 For Term 1 & Term 2
From the link below, students can get the most updated CBSE Class 11 Computer Science Syllabus for the academic year 2023. Along with the CBSE Syllabus, students can also access the board’s learning outcome pdf.
Download CBSE Class 11 Computer Science Syllabus 2023 For Term 1 & Term 2
Unit I: Computer Systems and Organisation
- Basic Computer Organisation: Introduction to a computer system, hardware, software, input device, output device, CPU, memory (primary, cache, and secondary), units of memory (Bit, Byte, KB, MB, GB, TB, PB)
- Types of software: system software (operating systems, system utilities, device drivers),
programming tools and language translators (assembler, compiler & interpreter), application software - Operating system (OS): functions of the operating system, OS user interface
- Boolean logic: NOT, AND, OR, NAND, NOR, XOR, truth table, De Morgan’s laws and logic circuits
- Number system: Binary, Octal, Decimal, and Hexadecimal number system; conversion between number systems.
- Encoding schemes: ASCII, ISCII, and UNICODE (UTF8, UTF32)
- Emerging trends: Cloud computing, cloud services (SaaS, IaaS, PaaS), blockchains, Artificial
Intelligence (AI), Machine Learning (ML), Internet of Things (IoT)
Unit II: Computational Thinking and Programming – 1
- Introduction to problem-solving: Steps for problem-solving (analyzing the problem, developing an algorithm, coding, testing, and debugging). representation of algorithms using flow chart and pseudo code, decomposition
- Familiarization with the basics of Python programming: Introduction to Python, features of Python, executing a simple “hello world” program, execution modes: interactive mode and script mode, Python character set, Python tokens (keyword, identifier, literal, operator, punctuator), variables, the concept of value and r-value, use of comments
- Knowledge of data types: number (integer, floating point, complex), boolean, sequence (string, list, tuple), none, mapping (dictionary), mutable and immutable data types
- Operators: arithmetic operators, relational operators, logical operators, assignment operators, augmented assignment operators, identity operators (is, is not), membership operators (in, not in)
- Expressions, statement, type conversion & input/output: precedence of operators, expression, evaluation of an expression, python statement, type conversion (explicit & implicit conversion), accepting data as input from the console and displaying output
- Errors: syntax errors, logical errors, runtime errors
- The flow of control: introduction, use of indentation, sequential flow, conditional and iterative flow control
- Conditional statements: if, if-else, if-elif-else, flowcharts, simple programs: e.g.: absolute value, sort 3 numbers and divisibility of a number
- Iterative statements: for loop, range function, while loop, flowcharts, break and continue statements, nested loops, suggested programs: generating pattern, summation of series, finding the factorial of a positive number, etc
- Strings: introduction, indexing, string operations (concatenation, repetition, membership & slicing), traversing a string using loops, built-in functions: len(), capitalize(), title(), lower(), upper(), count(), find(), index(), endswith(), startswith(), isalnum(), isalpha(), isdigit(), islower(), isupper(), isspace(), lstrip(), rstrip(), strip(), replace(), join(), partition(), split()
- Lists: introduction, indexing, list operations (concatenation, repetition, membership & slicing), traversing a list using loops, built-in functions: len(), list(), append(), extend(), insert(), count(), index(), remove(), pop(), reverse(), sort(), sorted(), min(), max(), sum(); nested lists, suggested programs: finding the maximum, minimum, mean of numeric values stored in a list; linear search on a list of numbers and counting the frequency of elements in a list
- Tuples: introduction, indexing, tuple operations (concatenation, repetition, membership & slicing), built-in functions: len(), tuple(), count(), index(), sorted(), min(), max(), sum(); tuple assignment, nested tuple, suggested programs: finding the minimum, maximum, mean of values stored in a tuple; linear search on a tuple of numbers, counting the frequency of elements in a tuple
- Dictionary: introduction, accessing items in a dictionary using keys, the mutability of dictionary (adding a new item, modifying an existing item), traversing a dictionary, built-in functions: len(), dict(), keys(), values(), items(), get(), update(), del(), clear(), from keys(), copy(), pop(), pop item(), set default(), max(), min(), count(), sorted(), copy(); suggested programs: count the number of times a character appears in a given string using a dictionary, create a dictionary with names of employees, their salary and access them
- Sorting techniques: Bubble and Insertion sort
- Introduction to Python modules: Importing module using ‘import ‘ and using from statement, Importing math module (pi, e, sqrt, ceil, floor, pow, sin, cos, tan); random module (random, randint, and range), statistics module (mean, median, mode)
Unit III: Society, Law, and Ethics
- Digital Footprints
- Digital society and Netizen: net etiquettes, communication etiquettes, social media etiquettes
- Data protection: Intellectual Property Rights (copyright, patent, trademark), violation of IPR (plagiarism, copyright infringement, trademark infringement), open source software and licensing (Creative Commons, GPL, and Apache)
- Cyber-crime: definition, hacking, eavesdropping, phishing and fraud emails, ransomware, preventing cybercrime
- Cyber safety: safely browsing the web, identity protection, confidentiality, cyber trolls, and bullying.
- Safely accessing websites: malware, viruses, trojans, adware
- E-waste management: proper disposal of used electronic gadgets
- Indian Information Technology Act (IT Act)
- Technology & Society: Gender and disability issues while Teaching and using computers
CBSE Class 11 Computer Science Syllabus: Exam Pattern 2023
| Unit No. | Unit Name | Marks | Periods | |
| Theory | Practical | |||
| 1. | Computer Systems and Organisation | 10 | 10 | 5 |
| 2. | Computational Thinking and Programming – 1 | 45 | 50 | 35 |
| 3. | Society, Law, and Ethics | 15 | 20 | — |
| Total | 70 | 80 | 40 | |
Marks Distribution of CBSE Class 11 Computer Science Syllabus 2023 For Term 1 & Term 2
| Unit No. | Unit Name | Term 1 | Term 2 |
| Marks | Marks | ||
| 1. | Computer Systems and Organisation | 10 | — |
| 2. | Computational Thinking and Programming – 1 | 25 | 20 |
| 3. | Society, Law, and Ethics | — | 15 |
| Total | 35 | 35 |
Practical Syllabus for Computer Science Along with Marking Scheme 2023 For Term 1 & Term 2
| S. No. | Area | Marks (Total=30) | Term 1 (15 Marks) | Term 2 (15 Marks) |
| 1. | Python program | 12 | 6 | 6 |
| 2. | Report file: Minimum 20 Python programs Term- 1: Minimum 10 programs based on Term – 1 Syllabus Term- 2: Minimum 10 programs based on Term – 2 Syllabus |
7 | 4 | 3 |
| Viva voce | 3 | 2 | 1 | |
| 3. | Project + Viva voce Term – 1: Synopsis of the project to be submitted by the students (documentation only) Term – 2: Final coding + Viva voce (Students will be allowed to modify their Term 1 document and submit the final executable code.) |
8 | 3 | 5 |
CBSE NCERT Textbook For Class 11 Computer Science 2023 For Term 1 & Term 2 PDF
Computer Science is an important subject in Class 11. The book has multiple benefits from class 11 exam preparation to exam preparation for various higher studies in the computer science field. Here you can download NCERT Textbook for Class 11 Computer Science.
Other Important Links Related to CBSE 11th Computer Science 2023 For Term 1 & Term 2
Here you can check links to various study materials related to the 11th Computer Science 2023 For Term 1 & Term 2
We have covered the detailed guide on CBSE Class 11 Computer Science Syllabus 2023 For Term 1 & Term 2. Feel free to ask any questions related to CBSE Class 11 Computer Science Syllabus in the comment section below.
FAQ: CBSE Class 11 Computer Science Syllabus 2023 For Term 1 & Term 2
Is computer science hard in class 11?
CBSE Class 11 Computer Science Syllabus is definitely easier than its counterparts like Maths, Physics, and Chemistry
What is the CBSE Class 11 Computer Science Syllabus?
You can refer to the above article to get the detailed CBSE Class 11 Computer Science Syllabus.
How many units are there in the CBSE Class 11 Computer Science Syllabus?
There are 4 units in the CBSE Class 11 Computer Science Syllabus.
How many chapters are there in a CBSE Class 11 Computer Science Syllabus?
As there are 4 units in 11th class computer including 38 chapters.
Is CBSE Class 11 Computer Science Syllabus involves a lot of math?
Studying Computer Science or Computer Engineering involves a lot of math, but this is not really necessary in the field.