CUET Computer Science Syllabus 2025: Section Wise Syllabus

Overview: Dive into the CUET Computer Science Syllabus 2025. A concise overview of key topics and study resources for aspiring tech undergrads. Unlock the essentials of Python, databases, and more to score 200/200!

The CUET computer science syllabus 2025 is prescribed by NTA and commonly followed across 260 CUET universities. These universities offer several undergraduate programs, such as B.Sc, B.Tech, and BCA courses, in computer science specialization, and most universities include CS in their exam pattern.

Read through the CUET Computer Science Syllabus 2025: important topics to focus on, reference books, and exam pattern to unlock your success in this exam! 

Download FREE Study Materials for CUET 2025 By SuperGrads

Important facts about CUET Computer Science Syllabus 2025

Computer Science is one of the 29 domain subjects in CUET 2025. The details include: 

• Computer Science is a one-question paper with two sections: Section A and Section B [B1 and B2].
• The Computer Science CUET syllabus will cover topics such as programming languages, algorithms and data structures.

The important highlights of the exam include: 

Particulars	Description
Exam Duration	60 minutes
No. Of questions to be attempted	40 out of 50
Exam mode	Computer-based test
Total Marks	200

Detailed CUET Computer Science Syllabus (Informatics Practices - 308)

The CUET Computer Science syllabus is based on what you have studied until class 12th only. The CUET cutoff for this exam is highly competitive, as it is one of the most in-demand courses for a career.

Here's a detailed CUET Computer Science syllabus to plan your preparations: 

Section A

Exception and File Handling in Python

• Exception Handling: syntax mistakes, exceptions, exception managing necessity, user-defined exceptions, raising exceptions, handling exceptions, catching exceptions, Try - except - otherwise clause, Try - finally clause, recovering and continuing with finally, built-in exception classes.
• Text file and binary files, file types, open and close files, reading and writing text files, reading and writing binary files using the pickle module, and file access modes are covered in File Handling.

Database Theory

• Introduction to database concepts, Difference between database and file system, relational data model: domain, tuple, relation, candidate key, primary key, alternate key, and foreign key;
• Relational algebraic operations: selection, projection, union, set difference, and cartesian product

Some universities may require you to appear for subjects like Mathematics to pursue science courses. In this case, you might also want to check the CUET Mathematics Exam Syllabus with the CUET Computer Science Syllabus to be well-prepared for the exam and secure your seat in your desired university.

SQL stands for Structured Query Language

• Structured Query Language, Data Definition Language, Data Query Language, and Data Manipulation Language: Presentation of MySQL, Creating a database using MySQL, Data Types
• Data Definition: CREATE TABLE, DROP TABLE, ALTER TABLE
• Data Query: SELECT, FROM, and WHERE are the three components of a SELECT statement.
• Data Manipulation: ADD, CHANGE, DELETE
• Mathematical operations: POWER (), ROUND (), and MOD ().
• Text functions: LENGTH (), LEFT (), RIGHT (), INSTR (), LTRIM (), RTRIM (), TRIM (). ().
• NOW (), DATE (), MONTH (), MONTHNAME (), YEAR (), DAY (), DAYNAME () are Date functions ().
• Aggregate Functions: Using COUNT (*) with the aggregate functions MAX (), MIN (), AVG (), SUM (), and COUNT (). Data manipulation and querying utilizing Group by, Having, and Order by
• Relationship Operations - Union, Intersection, Subtraction, Cartesian Product join

Computer Systems Networks

• A primer on computer networks, The development of networking,
• Types of networks: LAN, WAN, and MAN
• Network devices include a modem, Ethernet Card, Repeater, Hub, Switch, Router, and Gateway.
• Network Topologies: Mesh, Ring, Bus, and Tree are examples of Conceptualization of MAC and IP Address Distinction between the Internet and web

CUET Computer Science Syllabus: Section B1: Information Technology

Chapter 1: Handling Exceptions and Files in Python

• Syntax mistakes, exceptions, the requirement for exception handling, user-defined exceptions, raising exceptions, handling exceptions, and catching exceptions.
• Try - except - otherwise clause, Try - finally clause, recovering and continuing with finally, and predefined exception classes.
• Text file and binary files, file types, open and close files, reading and writing text files, reading and writing binary files using the pickle module, and file access modes are covered in File Handling.

Chapter 2: Stack

• Stack (List Implementation): An introduction to stack (LIFO Operations), stack operations (PUSH and POP), and its Python implementation.
• Expressions in Prefix, Infix, and postfix notations; stack-based evaluation of arithmetic expressions; conversion of an Infix expression to a postfix expression.

Chapter 3: Queue

• Introduction to Queue (List Implementation), Queue Operations (INSERT and DELETE), and its Python implementation.
• Introduction to DQueue and its Python implementation.

Chapter 4: Searching

• Sequential search, Binary search, and sequential and binary search evaluation.
• A simulation to determine the best, worst, and average cases. Python implementation of searching strategies.

Chapter 5: Classifying

• A summary of the sorting methods Bubble Sort, Selection Sort, and Insertion Sort.
• A simulation to determine the best, worst, and average cases. Python implementation of sorting procedures.
• Hash Functions, Collision Resolution, and Map Abstract Data Type Implementation

Unlock CUET PYPs with solutions by SuperGrads

Chapter 6: Understanding Data

• Data's purpose, collection, and arrangement
• Data comprehension utilizing statistical methods: mean, median, standard deviation, and variance; data interpretation; data visualization.

Chapter 7: Concepts for Databases in CUET Computer Science Syllabus

• Difference between database and file system, relational data model: domain, tuple, relation, candidate key, primary key, alternate key, and foreign key
• Relational algebraic operations: selection, projection, union, set difference, and cartesian product;

Chapter 8: Structured Query Language

• Structured Query Language, Data Definition Language, Data Query Language, and Data Manipulation Language: Presentation of MySQL, Developing a database with MySQL, Data Types
• Data Definition: CREATE TABLE, DROP TABLE, ALTER TABLE, 
• Data Query: Data Definition SELECT, FROM, WHERE 
• Data Manipulation: ADD, CHANGE, DELETE 
• Mathematical operations: POWER (), ROUND (), and MOD ().
• Text functions: LENGTH (), LEFT (), RIGHT (), INSTR (), LTRIM (), RTRIM (), TRIM (). ().
• Date Functions: NOW (), DATE (), MONTH (), MONTHNAME (), YEAR (), DAY (), DAYNAME () are Date functions (). 
• Aggregate Functions: Using COUNT (*) with the aggregate functions MAX (), MIN (), AVG (), SUM (), and COUNT (). Data manipulation and querying utilizing Group by, Having, and Order by
• Relationship Operations - Union, Intersection, Subtraction, Cartesian Product JOIN

Chapter 9: Computer Networks

• A primer on computer networks, The development of networking,
• Types of networks: LAN, WAN, and MAN
• Network devices include a modem, Ethernet Card, Repeater, Hub, Switch, Router, and Gateway.
• Network Topologies: Mesh, Ring, Bus, and Tree are examples of
• The basic concept of MAC and IP Address Internet and web distinction 

CUET Computer Science Syllabus: Section B2: Information Practices

Chapter 1: Querying Databases with SQL

• Mathematical operations: POWER (), ROUND (), and 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 () are Date functions ().
• Aggregate Functions: Using COUNT (*) with the aggregate functions MAX (), MIN (), AVG (), SUM (), and COUNT ().
• Data manipulation and querying utilizing Group by, Having, and Order by
• Operations on Relations - Union, Intersection, Minus, Cartesian Product, and join our operations on relations.

Chapter 2: Data Handling using Pandas - I

• Pandas, NumPy, and Matplotlib, are introduced as Python libraries. Pandas data structures - Series and DataFrames
• Series: Creation of Series from arrays, dictionaries, and scalars; mathematical operations; Head and Tail functions; Selection, Indexing, and Slicing.
• DataFrames: construction - from the Series dictionary, the list of Series dictionaries, and Text/CSV files; display; iteration. Add, select, remove, rename; Operations on Rows and Columns: add, select, delete; Head and Tail functions; Indexing using Labels, Boolean Indexing; Styling and Formatting data; Head and Tail functions; Joining, Merging, and Concatenating.
• Importing and exporting data between CSV and DataFrame formats.

Chapter 3: Data Handling using Pandas – II

• Descriptive Statistics: Maximum, minimum, count, sum, mean, median, mode, quartile, standard deviation, and variance are descriptive statistics.
• DataFrame operations: Aggregation, group by, Sorting, Index deletion, renaming, and pivoting are DataFrame operations. Handling missing values — dropping and filling.
• Data import/export between the MySQL database and Pandas.

Chapter 4: Data Plotting with Matplotlib

• Purpose of charting; creating and storing line plots, bar graphs, histograms, pie charts, frequency polygons, box plots, and scatter plots using Matplotlib.
• Customize plot color, style (dashed, dotted), and width, and add a plot's label, title, and legend.

Attempt FREE CUET Computer Science Syllabus based Mock Tests 

Chapter 5: Introduction to Computer Networks

• Introduction to Networks, Network Types: LAN, MAN, and WAN 
• Network Devices: Modem, Hub, Switch, Repeater, Router, and Gateway are Network Devices. Network Topologies: Star, Bus, Tree, and Mesh Network Topologies
• Internet, URL, WWW, and its applications (Web, email, Chat, VoIP) are introduced.
• Website: Introduction, the distinction between a website and a webpage, static versus dynamic web page, web server, and website hosting.
• Web Clients: Introduction, commonly used browsers, browser settings, browser extensions, plug-ins, and cookies.

Chapter 6: Societal Consequences

• Digital footprint, Internet and social media etiquette, data protection, Intellectual Property Rights (IPR) and their breach, licensing for plagiarism, and plagiarism copyrights
• Free and Open Source Software (FOSS), cybercrime, cyber laws, hacking, phishing, and cyberbullying. A summary of the Indian IT Act, which prevents cybercrime.
• E-waste hazard and its management.
• Awareness of the effects of technology on eyesight, physiological difficulties, and ergonomic factors.

Chapter 10: Data Transmission

• Communication Concepts, Data Communication Types, Switching Techniques
• Communication Media: Wired Technologies — Twisted pair cable, Coaxial cable, Ethernet Cable, and Optical Fiber
• Introduction to Mobile Telecommunication Technologies Bluetooth, WLAN, Infrared, and Microwave are Wireless Technologies.
• Network Protocol: Need for Protocol, Categorization, and Examples of protocol, HTTP, FTP, IP, PPP; electronic mail protocol
• Concept of Channel, Bandwidth (Hz, kHz, and MHz), and Data Transfer rate (bps, Kbps, Mbps, Gbps, Tbps)

Chapter 11: Security Aspects

• Threats and defences: Viruses, Worms, Trojan horses, Spam, Cookies, Adware, Firewall, HTTP versus HTTPS
• Network Security Concepts: Firewall, Cookies, Hackers and Crackers Antivirus and their workings Network security threats: Denial of service, Intrusion problems, Snooping, Eavesdropping. 

How to prepare the CUET Computer Science Syllabus? 

The CUET Computer Science exam is 60 minutes long as per the CUET exam pattern. It consists of objective-type questions, including multiple-choice questions (MCQs)

Approaching Different Sections in CUET Computer Science Syllabus

• Section A: Focus on understanding and applying core concepts to solve problems.
• Section B1: Thoroughly grasp information technology's theoretical underpinnings and practical applications.
• Section B2: Demonstrate proficiency in data handling, plotting, and understanding the societal implications of technology.

Importance of Practical Application

In computer science, practical skills play a pivotal role alongside theoretical knowledge. You should strive to blend their theoretical understanding with practical application through projects, internships, or online coding challenges.

• This hands-on experience will enhance their problem-solving abilities and make them more competitive in the exam.
• Mastering the CUET Computer Science Syllabus 2025 is crucial for students aiming for top computer science programs. A blend of theoretical understanding and practical application is key.
• Success requires using the best CUET preparation books and online resources, engaging in practical exercises, and staying abreast of CUET computer science syllabus updates.
• This preparation readies students for this exam and lays a solid foundation for their future careers in the ever-evolving field of computer science.

Best Preparation Books & Strategies for CUET Computer Science Syllabus

To excel in the CUET Computer Science Syllabus, aspirants should adopt a comprehensive CUET preparation strategy that includes:

Recommended Textbooks and Reference Materials:

• "Computer Science with Python" by Rachna Sagar
• "Computer Science: A Modern Approach" by Sumita Arora
• In conjunction with Rachna Sagar's Computer Science Class 12
• NCERT Computer Science Textbook for Class 12th 

Online Resources and Study Materials for CUET Computer Science Syllabus

• Utilize online platforms and video materials for interactive learning and practice questions.
• Attempt practice questions and sample papers from expert-recommended preparation books. 

Effective Study Habits and Time Management:

• Create a structured study plan that allocates dedicated time to each topic.
• Practice solving CUET previous year's question papers to familiarize yourself with the exam pattern.
• Engage in active learning techniques such as concept mapping and mind mapping.

Direct Links: CUET Computer Science Syllabus PDF Download

English VersionHindi Version

Key Takeaways

The CUET Computer Science Syllabus is a comprehensive one. The right strategy and study plan are what will help you score 200/200 on the test. 

• The Computer Science syllabus for CUET will be based on topics studied until class 12th only. 
• The exam duration is 60 minutes and will be conducted in online mode. 
• The syllabus of CUET Computer Science is divided into 3 sections: Section A & Section B1 & B2. 
• Go through the previous year's papers and sample papers to practice well. 
• Attempt CUET mock tests regularly to boost your exam score.