CUET PG MCA Syllabus 2025 Changes: New Topics Added in Computer Subject

CUET PG MCA Syllabus 2025 Changes: New Topics Added in Computer Subject

7 mins readComment FOLLOW US
Manisha
Manisha Kumari
Associate Senior Executive
New Delhi, Updated on Jan 6, 2025 15:57 IST

NTA has changed the CUET PG MCA Syllabus 2025 for the candidates preparing for a masters degree in Computer Science and Information Technology. More topics were observed to be added to the Computer subject of the CUET PG MCA Syllabus 2025. Candidates can check out the newly added topics and CUET PG syllabus comparison (2024 vs 2025) in this Shiksha article.

CUET PG MCA Syllabus 2025 Changed

With the start of CUET PG Application form 2025 from January 2, 2025, NTA has further made amendments to the admission process. It has been observed that NTA has changed the CUET PG MCA syllabus 2025 for the candidates preparing for the Computer Science and Information Technology master's degree programme. Earlier in 2024, the CUET PG MCA syllabus covered the topics like Thinking and Decision Making, Mathematics and Computers. For the academic session 2025-2026, the exam officials have added a few more topics in Computer subjects like computer networks, routing algorithms, DNS, Database Management Systems and Virtual systems.

CUET PG MCA Syllabus 2025 was released NTA on January 2, 2025 in the pdf format on the exam official website i.e., exams.nta.ac.in/CUET-PG. The syllabus will help the candidates in shortlisting the topics of the course to which they applied and make their CUET PG 2025 preparation accordingly. Candidates can check out the complete MCA syllabus 2025 here in this Shiksha article. CUET PG Exam pattern 2025 has also been revised, and now candidates will get 90 minutes to solve 75 question MCQ questions asked in the CUET PG exam 2025 instead of 105 minutes. The General paper syllabus of LLB and MBA courses will also be redesigned to cater to skill-based. 

CUET PG MCA Syllabus 2025

Candidates can check out the CUET PG MCA Syllabus 2025 from here:

Subject Name Syllabus
Decision and Thinking Making
  •  Creative thinking, unfamiliar relationships, verbal reasoning, finding  patterns trends and Assessment of figures & diagrams.
  • Geometrical designs &Identification
  • Selection of related letters / words / numbers /figures
  • Identification of odd thing / item out from a group
  • Completion of numerical series based on the pattern /logic
  • Fill in the blanks of the series based on the numerical pattern and logic of the series
  • Syllogisms (logic-based questions), Identification of logic & selection of correct answers based on the logic
Mathematics
  • Set Theory: Concept of sets – Union, Intersection, Cardinality, Elementary counting; permutations and combinations. • Probability and Statistics: Basic concepts of probability theory, Averages, Dependent and independent events, frequency distributions, measures of central tendencies and dispersions.
  • Algebra: Fundamental operations in algebra, expansions, factorization, simultaneous linear /quadratic equations, indices, logarithms, arithmetic, geometric and harmonic progressions, determinants and matrices.
  • Coordinate Geometry: Rectangular Cartesian coordinates, distance formulae, equation of a line, and intersection of lines, pair of straight lines, equations of a circle, parabola, ellipse and hyperbola.
  • Calculus: Limit of functions, continuous function, differentiation of function, tangents and normal, simple examples of maxima and minima. Integration of functions by parts, by substitution and by partial fraction, definite integrals, applications of definite integrals to areas.
Computer
  • Operating System: Main functions of operating systems, Processes, Threads, Interprocess communication, concurrency, Synchronization, Deadlock, CPU scheduling, I/O scheduling, Resource scheduling. Deadlock and scheduling algorithms, banker’s algorithm for deadlock handling. Memory management and virtual memory. File Systems, I/O systems, DOS, UNIX and Windows.
  • Computer networks: OSI Model, TCP/IP model, LAN technologies (Ethernet, Token ring), Transmission media – twisted pair, coaxial cables fiber–optic cables, Flow and error control techniques,
  • Routing algorithms, Congestion control, IP (v4), Application layer protocols (icmp, dns, smtp, pop,
  • ftp, http); Sliding window protocols; Internetworking: Switch /Hub, Bridge, Router, Gateways,
  • Concatenated virtual circuits, Firewalls: Network Security; Cryptography- public key, secret key.
  • Domain Name System (DNS)-Electronic Mail and World Wide Web (WWW). 
  • Database Management System: Data Models, Schemas, and Instances; Three-Schema Architecture and Data Independence; Database Languages and Interfaces; Centralized and Client/Server Architectures for DBMS, Functional Dependencies and Normalization; Algorithms for Query Processing and Optimization; Transaction Processing, Concurrency Control Techniques, Database Recovery Techniques, Object and Object-Relational Databases; Database Security and
    Authorization. Entity-Relationship Diagram, Relational Model - Constraints, Languages, Design, and Programming, Relational Database Schemas, Update Operations and Dealing with Constraint Violations; Relational Algebra and Relational Calculus; Codd Rules.
  • Data Structure: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching Algorithms; Hashing. Functions, Recursion, Parameter passing, and Definition of data structure. Arrays, Stacks, Queues linked lists, trees, priority queues and heaps, Binary search trees.Data Structure: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching Algorithms; Hashing. Functions, Recursion, Parameter passing, and Definition of data structure. Arrays, Stacks, Queues linked lists, trees, priority queues and heaps, Binary search trees.

CUET PG MCA Syllabus: 2024 vs 2025

Candidates must know that the only change found in the CUET PG MCA syllabus from previous year is that the exam officials added more topics in the Computer subject. Rest topics like Mathematics and Decision Making and Thinking Skills contain the same topics. Candidates can check out the difference from here:

CUET PG MCA Syllabus:

Subject: Computer

2025 2024
  • Operating System
  • Computer networks: OSI Model, TCP/IP model, LAN technologies (Ethernet, Token ring), Transmission media – twisted pair, coaxial cables fiber–optic cables, Flow and error control techniques,
  • Routing algorithms, Congestion control, IP (v4), Application layer protocols (icmp, dns, smtp, pop,
  • ftp, http); Sliding window protocols; Internetworking: Switch /Hub, Bridge, Router, Gateways,
  • Concatenated virtual circuits, Firewalls: Network Security; Cryptography- public key, secret key.
  • Domain Name System (DNS)-Electronic Mail and World Wide Web (WWW). 
  • Database Management System: Data Models, Schemas, and Instances; Three-Schema Architecture and Data Independence; Database Languages and Interfaces; Centralized and Client/Server Architectures for DBMS, Functional Dependencies and Normalization; Algorithms for Query Processing and Optimization; Transaction Processing, Concurrency Control Techniques, Database Recovery Techniques, Object and Object-Relational Databases; Database Security and
    Authorization. Entity-Relationship Diagram, Relational Model - Constraints, Languages, Design, and Programming, Relational Database Schemas, Update Operations and Dealing with Constraint Violations; Relational Algebra and Relational Calculus; Codd Rules.
  • Data Structure: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching Algorithms; Hashing. Functions, Recursion, Parameter passing, and Definition of data structure. Arrays, Stacks, Queues linked lists, trees, priority queues and heaps, Binary search trees.Data Structure: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching Algorithms; Hashing. Functions, Recursion, Parameter passing, and Definition of data structure. Arrays, Stacks, Queues linked lists, trees, priority queues and heaps, Binary search trees.
  • Operating System: Main functions of operating systems, Processes, Threads, Interprocess communication, concurrency, Synchronization, Deadlock, CPU scheduling, I/O scheduling, Resource scheduling. Deadlock and scheduling algorithms, banker’s algorithm for deadlock handling. Memory management and virtual memory. File Systems, I/O systems, DOS, UNIX and Windows.
  • Data Structure: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching Algorithms; Hashing. Functions, Recursion, Parameter passing.
  • Digital Fundamentals: Data Types, Number Systems and Conversion, Complements, Fixed Point
    Representation, Floating Point Representation, Error Detection Codes, Computer Arithmetic - Addition,
    Subtraction, Multiplication and Division Algorithms, Digital Computers, Logic Gates, Boolean Algebra,
    Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits, Integrated Circuits,
    Decoders, Multiplexers, Registers and Counters, Memory Unit.

CUET PG Application process 2025 is underway. The last date to fill out the CUET PG registration form is February 1, 2025 till 11:50 pm. Candidates will also get the oppurtunity to edit the application form for the incorrect details earlier filled by them. CUET PG applictaion correction 2025 window will open on February 3, 2025 and the last date to correct the details will be February 5, 2025 till 11:50 pm. NTA will conduct the CUET PG 2025 exam from March 13, 2025 to March 31, 2025 at 312 exam centres across the nation and overseas.

Q:   Where can I get the CUET PG Syllabus?

A:

CUET PG 2025 syllabus released by NTA on January 2, 2025. Candidates preparing for CUET PG 2025 can download the CUET PG syllabus 2025 pdf by visiting the official website of CUET PG 2025 or can check out in this Shiksha page.

It is also observed that the CUET PG syllabus doesn't this year, so candidates are suggested to either go to the CUET PG 2024 official website and search for CUET PG syllabus there.

NOTE: As per the new changes introduced by NTA in the CUET PG examination for the academic session 2025-2026, the General paper syllabus of LLB and MBA courses will be redesigned to cater to skill-based. 

 

Q:   Has CUET PG 2025 syllabus been released?

A:

Yes, NTA has released the CUET PG 2025 syllabus. 

Every year, the CUET PG Syllabus is released subject-wise and uploaded in the PDF format on the CUET PG official website. Test takers, with the help of the subject code of the course applied, can check and download the CUET PG syllabus 2025 from the official website.

CUET PG 2025 aspirants can also prepare from the CUET PG 2024 syllabus or previous years syllabus, as the frequency of change in the CUET PG syllabus is negligible. 

Q:   Who sets the CUET PG syllabus?

A:

Common University Entrance Test (CUET) will be introduced for admission into UG/ PG programmes in Central and participating Universities for academic session 2025-26. The Common University Entrance Test (CUET) will
provide a common platform and equal opportunities to candidates across the country, especially those from NorthEast and from rural and other remote areas and help to establish better connect with the Universities. 

The CUET PG 2025 examination will be conducted by the examination authority i.e., NTA (National Testing Agency) in the various CUET PG examination centres across the nation and also to short listed foreign countries. The Syllabus for the master's courses for which the examination will be conducted is set by the exam conducting authority, which is National Testing Agency here. The subject experts after taking all the probable suggestions from all the participating universities, will set the syllabus for the master's degree programmes on the basis of what students have studied in their under graduate courses.

Follow Shiksha.com for latest education news in detail on Exam Results, Dates, Admit Cards, & Schedules, Colleges & Universities news related to Admissions & Courses, Board exams, Scholarships, Careers, Education Events, New education policies & Regulations.
To get in touch with Shiksha news team, please write to us at news@shiksha.com

About the Author
author-image
Manisha Kumari
Associate Senior Executive

Being a post-graduate and BEd degree holder, I'm an innovative, task-driven and immensely motivated science enthusiast, making me a passionate content writer. I love providing meaningful and constructive articles in... Read Full Bio

Next Story