Overview: Learn more about the CUET Computer Science Syllabus 2025 for prospective students. Learn about Python programming, database theory, networking, and other important topics. To excel in the Central Universities Common Entrance Test, learn about the computer science syllabus, exam pattern, essential subjects, and reference books.
The National Testing Agency will release the CUET computer science syllabus 2025, that is followed by all CUET central, state, deemed, and private universities. The Central Universities Common Entrance Test participating colleges offer a variety of undergraduate programmes in computer science specialisation, such as B.Sc, B.Tech courses, and so on, and most universities include CS in their test design.
If you want to study at these universities, it is strongly advised that you thoroughly read through the course outline, noting down the chapters that are considered essential and planning your CUET exam preparations appropriately.
The National Testing Agency has made it known to all candidates that the CUET computer science curriculum will be organized around topics covered in class till the 12th grade. Let's look at the CUET Computer Science Syllabus 2025 and the areas of importance to pay attention to.
Important facts about CUET Computer Science Syllabus 2025
Computer Science is divided into two sections: Section A and Section B (B1 and B2).
Section A requires you to answer all 15 questions about computer science and information practises. This component of the CUET 2025 entrance exam is required.
Section B1 will include 35 computer science questions, with just 25 of those questions need to be tried.
Section B2 will include 35 questions about information practises, but only 25 must be answered.
Exception Handling: syntax errors, exceptions, need of exception handling, user-defined exceptions, raising exceptions, handling exceptions, catching exceptions, Try - except - else clause, Try - finally clause, recovering and continuing with finally, built-in exception classes
File Handling: text file and binary file, file types, open and close files, reading and writing text files, reading and writing binary files using pickle module, file access modes.
Database Theory
Database Concepts Introduction to database concepts, difference between database and file system, relational data model: concept of domain, tuple, relation, keys - candidate key, primary key, alternate key, foreign key;
Relational algebra: selection, projection, union, set difference and cartesian product;
SQL stands for Structured Query Language
Advantages of using Structured Query Language, Data Definition Language, Data Query Language and Data Manipulation Language, Introduction to MySQL, Creating a database using MySQL, Data Types
Data Definition: CREATE TABLE, DROP TABLE, ALTER TABLE
Data Query: SELECT, FROM, WHERE
Data Manipulation: INSERT, UPDATE, DELETE
Math functions: POWER (), ROUND (), MOD ().
Text functions: UCASE ()/UPPER (), LCASE ()/LOWER (), MID ()/SUBSTRING ()/SUBSTR (), LENGTH (), LEFT (), RIGHT (), INSTR (), LTRIM (), RTRIM (), TRIM ().
Date Functions: NOW (), DATE (), MONTH (), MONTHNAME (), YEAR (), DAY (), DAYNAME ().
Aggregate Functions: MAX (), MIN (), AVG (), SUM (), COUNT (); using COUNT
(*). Querying and manipulating data using Group by, Having, Order by.
Operations on Relations - Union, Intersection, Minus, Cartesian Product, JOIN
Computer Networks
Introduction to computer networks, Evolution of networking,
Exception Handling: syntax errors, exceptions, need of exception handling, user-defined exceptions, raising exceptions, handling exceptions, catching exceptions, Try - except - else clause, Try - finally clause, recovering and continuing with finally, built-in exception classes.
File Handling: text file and binary file, file types, open and close files, reading and writing text files, reading and writing binary files using pickle module, file access modes.
Chapter 2: Stack
Stack (List Implementation): Introduction to stack (LIFO Operations), operations on stack (PUSH and POP) and its implementation in python. Expressions in Prefix, Infix and postfix notations, evaluating arithmetic expressions using stack, conversion of Infix expression to postfix expression
Chapter 3: Queue
Queue (List Implementation): Introduction to Queue (FIFO), Operations on Queue (INSERT and DELETE) and its implementation in Python.
Introduction to DQueue and its implementation in Python.
Chapter 4: Searching
Searching: Sequential search, Binary search, Analysis of Sequential and Binary Search. Dry run to identify best, worst and average cases. Implementation of searching techniques in Python.
Chapter 5: Sorting
Overview of sorting techniques, Bubble Sort, Selection Sort and Insertion Sort. Dry run to identify best, worst and average cases. Implementation of sorting techniques in Python.
Hashing: Hash Functions, Collision Resolution, Implementing the Map Abstract Data Type.
Chapter 6: Understanding Data
Data and its purpose, collection and organization; understanding data using statistical methods: mean, median, standard deviation, variance; data interpretation; visualization of data.
Chapter 7: Database Concepts
Introduction to database concepts, difference between database and file system, relational data model: concept of domain, tuple, relation, keys - candidate key, primary key, alternate key, foreign key;
Relational algebra: selection, projection, union, set difference and cartesian product;
Chapter 8: Structured Query Language
Advantages of using Structured Query Language, Data Definition Language, Data Query Language and Data Manipulation Language, Introduction to MySQL, Creating a database using MySQL, Data Types
Data Definition: CREATE TABLE, DROP TABLE, ALTER TABLE,
Data Query: SELECT, FROM, WHERE
Data Manipulation: INSERT, UPDATE, DELETE
Math functions: POWER (), ROUND (), MOD ().
Text functions: UCASE ()/UPPER (), LCASE ()/LOWER (), MID ()/SUBSTRING ()/SUBSTR (), LENGTH (), LEFT (), RIGHT (), INSTR (), LTRIM (), RTRIM (), TRIM ().
Date Functions: NOW (), DATE (), MONTH (), MONTHNAME (), YEAR (), DAY (), DAYNAME ().
Aggregate Functions: MAX (), MIN (), AVG (), SUM (), COUNT (); using COUNT (*). Querying and manipulating data using Group by, Having, Order by.
Operations on Relations - Union, Intersection, Minus, Cartesian Product, JOIN
Chapter 9: Computer Networks
Introduction to computer networks, Evolution of networking,
Text functions: UCASE ()/UPPER (), LCASE ()/LOWER (), MID ()/SUBSTRING ()/SUBSTR (),LENGTH (), LEFT (), RIGHT (), INSTR (), LTRIM (), RTRIM (), TRIM ().
Date Functions: NOW (), DATE (), MONTH (), MONTHNAME (), YEAR (), DAY (), DAYNAME ().
Aggregate Functions: MAX (), MIN (), AVG (), SUM (), COUNT (); using COUNT (*).
Querying and manipulating data using Group by, Having, Order by.
Operations on Relations - Union, Intersection, Minus, Cartesian Product, JOIN
Chapter 2: Data Handling using Pandas – I
Introduction to Python libraries- Pandas, NumPy, Matplotlib. Data structures in Pandas - Series and DataFrames.
Series: Creation of Series from – and array, dictionary, scalar value; mathematical operations; Head and Tail functions; Selection, Indexing, and Slicing.
DataFrames: creation - from the dictionary of Series, list of dictionaries, Text/CSV files; display; iteration; Operations on Rows and columns: add, select, delete, rename; Head and Tail functions; Indexing usingLabels, Boolean Indexing; Styling & Formatting data, Head and Tail functions; Joining, Merging and Concatenations.
Importing/Exporting Data between CSV files and DataFrames.
DataFrame operations: Aggregation, group by, Sorting, Deleting and Renaming Index, Pivoting. Handling missing values – dropping and filling.
Importing/Exporting Data between MySQL database and Pandas.
Chapter 4: Plotting Data using Matplotlib
Purpose of plotting; drawing and saving the following types of plots using Matplotlib – line plot, bargraph, histogram, pie chart, frequency polygon, box plot, and scatter plot.
Customizing plots: color, style (dashed, dotted), width; adding label, title, and legend in plots.
Chapter 5: Introduction to Computer Networks
Introduction to Networks, Types of networks: LAN, MAN, WAN.
Digital footprint, Etiquettes for Net surfing and for communicating through social media, data protection, Intellectual Property Rights (IPR) and their violation, plagiarism licensing and copyrights, Free and Open Source Software (FOSS), Cybercrime and cyber laws, hacking, phishing, cyberbullying, Overview of Indian IT Act, preventing cybercrime.
E-waste its a hazard and management
Awareness about health concerns related to the usage of technology like effect on eyesight, physiological issues, and ergonomic aspects.
Chapter 10: Data Communication
Concept of communication, Types of Data Communication, switching techniques
Candidates taking the CUET 2025 exam must be familiar with the CUET 2025 exam pattern. Knowing the CUET exam pattern not only helps students comprehend the concept of the CUET 2025 examination better, but it also gives them a basic notion of the exam's difficulty level.
CUET 2025 Exam Pattern
Details
Exam pattern
Topics
Section IA and IB: Language related questions (50 questions)
Section II: Domain specific questions (50 questions)
Section III: General test questions (75 questions)
Duration
Slot 1: 120 minutes
Slot 2: 120 minutes
Slot 3: 180 minutes
Medium of exam
English, Bengali, Hindi, Kannada, Malayalam, Urdu, Odia, Telegu, Tamil, Punjabi, Assamese, Marathi and Gujarati
Reference Books for CUET Computer Science Syllabus 2025
The CUET preparation books are of the utmost significance in order to pass the exam. You can find a list of the best books for CUET Computer Science preparation below:
Book Title
Author/Publication
Description
Rachna Sagar's Computer Science Class 12
Rachna Sagar
Recommended for comprehensive coverage.
Computer Science with Python Class 12
Sumita Arora
A valuable resource for Python programming.
NCERT Computer Science Textbook for Class 12th
National Council of Education Research and Training
Finally, a good comprehension of the CUET Computer Science Syllabus 2025 is critical for students wishing to pursue undergraduate computer science programmes at prestigious universities under CUET.
Students who understand the exam format and have access to approved reference books can confidently prepare to excel in the Central Universities Common Entrance Test and embark on a successful career in the field of computer science.
CUET Computer Science syllabus 2025 is essential for aspiring computer science students.
Topics covered include Python programming, database theory, networking, and more.
The exam has two sections: Section A (15 required questions) and Section B1/B2 (25 out of 35 questions).
CUET 2025 exam pattern consists of language-related, domain-specific, and general test questions.
Recommended reference books for CUET Computer Science preparation include "Rachna Sagar's Computer Science Class 12" and "NCERT Computer Science Textbook for Class 12th."