CUET – 2026 (Common University Entrance Test 2026)

CUET – 2026 (Common University Entrance Test 2026) Notification by Jitendra Mishra Academy (JMA), Indore
India’s No. 1 Institute for MCA Entrance Preparation…… Best MCA Entrance Coaching in India…. Top MCA Entrance Coaching in India….

Admission for Master of Computer Application (MCA) – 2026

Month of Examination March 2026

Educational Qualification

Candidates who have passed a Bachelor’s degree or equivalent examination or Candidates who are pursuing their Bachelor’s degree or equivalent Examination and appearing in the Final Year of their Bachelor’s degree/equivalent examination in 2026, are eligible to appear in CUET (PG)- 2026


University-Specific Age Criteria:

There is NO age limit for candidates appearing in the CUET (PG)-2026 examination. However, Candidates are advised to verify the age requirements of the university to which they wish
to apply before submitting their applications.

Eligibility : JNU MCA 2026
BCA/ Bachelor’s Degree in Computer Science Engineering or equivalent Degree with at least 55% marks
OR
B.Sc./ B.Com./ B.A. with Mathematics at 10+2 Level or at Graduation Level with at least 55% marks.
(All OBC category (non creamy layer) candidates are eligible to 10% relaxation in the percentage of marks in the qualifying examination in relation to open category. The SC/ST and Person with Disability (PWD) candidates who have passed the qualifying examination irrespective of their percentage of marks are eligible to appear in the Entrance Examination).

Eligibility : BHU MCA 2026
For NEP-based Graduates
Bachelor of Computer Applications / Bachelor of Science (Honours) in Computer Science or IT as the major subject, with a minimum of 50% of the total credits earned in Computer Science at the
Bachelor’s programme with an aggregate of at least 60% marks or equivalent CGPA .
OR
Bachelor of Arts (Honours) / Bachelor of Science (Honours) in Mathematics or Statistics as the major subject (both will be required to take bridge courses as per University rules), with a
minimum of 50% of the total credits earned in Mathematics or Statistics at the Bachelor’s programme with an aggregate of at least 60% marks or equivalent CGPA.
For Non-NEP Graduates
Bachelor of Computer Applications /Bachelor of Science (Honours) or Bachelor of Science in Computer Science or IT with a minimum aggregate of 60% marks or an equivalent CGPA.
OR
Bachelor of Science (Honours)/ Bachelor of Arts (Honours)/ Bachelor of Science/Bachelor of Arts in Mathematics or Statistics as a major subject (both will be required to take bridge courses as per University rules),and an aggregate of at least 60% marks or equivalent CGPA

Mode of Examination

The Examination shall be conducted in Computer Based Test (CBT) mode only. mode.

Structure of Examination

The following is the structure of the Examination for CUET (PG) – 2026:
1. Choice of Question Paper Codes: Candidates may select up to FOUR question paper codes from the list provided at Appendix-II as per the question paper codes mapped against Degree /Programme offered by the university/ies where admission is sought. The details are available at the NTA website: https://exams.nta.nic.in/cuet-pg/.
2. Examination Duration: The duration of the examination will be 90 minutes.
3. Number of Questions: Each question paper will comprise 75 questions.
Marking Scheme:
1. Each question carries 04 (four) marks.
2. For each correct response, the candidate will get 04 (four) marks.
3. For each incorrect response, 01 (one) mark will be deducted from the total score.
4. No marks will be given for questions unanswered/ unattempted/marked for Review.
5. To answer a question, the candidate needs to choose one option as the most appropriate option.
6. Final Reference for Questions: For question papers, except those related to language subjects and Acharya papers, the English version will be considered final in case of any discrepancies
While every effort will be made to ensure that each question has one unique answer, in case, it is found that a question has more than one option, it will be dealt with in the following manner:
(i) If more than one option is found to be correct then Four marks (+4) will be awarded to only those who have marked any of the correct options.
(ii) If none of the options is found correct or a Question is found to be wrong or a Question is dropped then all candidates who have appeared will be given four marks (+4) irrespective of the fact whether the question has been attempted or not attempted by the candidate.

Syllabus : CUET 2026

Thinking and Decision 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 normals, 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.

IMPORTANT INFORMATION AND DATES AT A GLANCE

Activities

Tentative Date(s)

Online registration and submission of Application Form
(complete in all respects) through NTA Website

14 December 2025 to 14 January 2026
(up to 11:50 P.M.)

Last date for successful transaction of Examination fee (through
Credit Card/ Debit Card/Net Banking/UPI Payment Modes)

14 January 2026
(up to 11:50 P.M.)

Correction in the Particulars of the Application Form online
only

18 January 2026 to 20 January 2026
(up to 11:50 P.M.)

Intimation of the Cities of exam centres

To be Intimated Later

Downloading of the e-Admit Card by the Candidate from the
NTA Website

To be Intimated Later

Month of Examination

March 2026

Duration of Examination

90 minutes

Timing of Examination

To be Intimated Later

Exam Centre, Date and Shift

Will be indicated on the e-Admit Card

Display of Recorded Responses and Provisional Answer Keys on
the Website for inviting challenge(s) from Interested candidates.

To be announced later on website

Declaration of Result on the NTA website

To be Intimated Later

Website(s)

https://exams.nta.nic.in/cuet-pg/,
www.nta.ac.in

Email

helpdesk-cuetpg@nta.ac.in

Helpline Number

011-40759000

For Online Registration CUET PG 2026, Click hereClick here,

For Detailed Information, Click here,Click here

For Download INFORMATION BROCHOURE, Click here,Click here

For Previous year Question Paper, Click here,Click here

 

Jitendra Mishra Academy (JMA), Indore
India’s No. 1 Institute for MCA Entrance Preparation
Training for NIMCET (NIT), JNU MCA, BIT MCA, BHU MCA, HCU MCA, PUNE MCA, DU MCA, VIT MCA & Others National Level MCA Entrance Exam
Best MCA Entrance Coaching in India….
Top MCA Entrance Coaching in India….