MCAPREP
Home > CUET PG MCA > Syllabus

CUET PG MCA Syllabus 2026 (SCQP09)

Official NTA Syllabus for Computer Science and Information Technology (Paper Code: SCQP09) for MCA and M.Sc. admissions at JNU, DU, BHU, HCU & Central Universities.

Verified Official NTA Document Paper Code: SCQP09 75 Domain Questions 300 Marks

📄 Official NTA Syllabus Document (SCQP09)

This syllabus is directly extracted from the National Testing Agency (NTA) official notification.

Download Official NTA PDF

Official SCQP09 Examination Blueprint

As per the official NTA notification, the question paper contains 75 questions, all of which are compulsory and evaluate subject-specific knowledge across three core sections:

Section NameCore Areas IncludedQuestion CountTotal Marks
1. Thinking & Decision Making Creative thinking, verbal reasoning, pattern completion, syllogisms, figure assessments ~15 Questions 60 Marks
2. Mathematics Set Theory, Probability & Statistics, Algebra, Coordinate Geometry, Calculus ~25–30 Questions 100–120 Marks
3. Computer Operating System, Data Structure, Digital Fundamentals ~30–35 Questions 120–140 Marks
Total Paper (SCQP09) All Subject-Specific Questions (Bilingual: English & Hindi) 75 Questions 300 Marks

📌 Official NTA Instructions (Verbatim from Notification):

  • i. The Question Paper will have 75 questions.
  • ii. All questions will be based on Subject-Specific Knowledge.
  • iii. All questions are compulsory.
  • iv. The Questions will be Bilingual (English/Hindi).
  • Marking Scheme: +4 marks for each correct response, -1 mark deducted for incorrect responses, 0 for unattempted questions. Test duration is 90 minutes.

Section 1: Thinking and Decision Making

Evaluates candidate's analytical reasoning, logic extraction, and spatial pattern identification.

Verbatim NTA Topics

Thinking & Logic
  • Creative thinking, unfamiliar relationships, verbal reasoning: Finding patterns trends and assessment of figures & diagrams.
  • Geometrical designs & Identification: Visual decomposition and symmetry recognition.
  • Selection of related letters / words / numbers / figures: Analogies and relationship mapping across pairs.
  • Identification of odd thing / item out: Spotting discrepancies and outliers from a defined set or group.
  • Completion of numerical series: Detecting patterns and logic governing arithmetic and geometric number sequences.
  • Fill in the blanks of the series: Determining missing values based on the numerical pattern and logic of the sequence.
  • Syllogisms (logic-based questions): Identification of deductive logic & selection of correct conclusion based on premises.

Section 2: Mathematics

Covers undergraduate-level foundational mathematics across 5 defined chapters.

1. Set Theory

Mathematics
  • Concept of Sets: Union, Intersection, Cardinality.
  • Counting Principles: Elementary counting; Permutations and Combinations.

2. Probability and Statistics

Mathematics
  • Probability Theory: Basic concepts of probability theory, dependent and independent events.
  • Descriptive Statistics: Averages, frequency distributions, measures of central tendencies (mean, median, mode) and measures of dispersions (variance, standard deviation).

3. Algebra

Mathematics
  • Foundational Operations: Fundamental operations in algebra, expansions, factorization.
  • Equations: Simultaneous linear and quadratic equations.
  • Indices & Logarithms: Properties of indices and logarithmic equations.
  • Progressions: Arithmetic Progression (AP), Geometric Progression (GP), and Harmonic Progression (HP).
  • Matrices: Determinants and matrices (types, properties, and basic operations).

4. Coordinate Geometry

Mathematics
  • Points & Lines: Rectangular Cartesian coordinates, distance formulae, equation of a line, and intersection of lines.
  • Pair of Lines: Pair of straight lines and angles between them.
  • Conic Sections: Equations of a circle, parabola, ellipse, and hyperbola.

5. Calculus

Mathematics
  • Limits & Continuity: Limit of functions, continuous function.
  • Differentiation: Differentiation of functions, tangents and normal, simple examples of maxima and minima.
  • Integration: Integration of functions by parts, by substitution, and by partial fraction.
  • Definite Integrals: Definite integrals and applications of definite integrals to areas under curves.

Section 3: Computer Concepts

The highest-weightage section in SCQP09, divided into 3 major technical domains.

1. Operating System

Core CS
  • OS Foundations: Main functions of operating systems, DOS, UNIX, and Windows architectures.
  • Process Management: Processes, Threads, Interprocess communication (IPC), concurrency, Synchronization.
  • Deadlock Handling: Deadlock conditions, prevention, avoidance, detection, and Banker's algorithm for deadlock handling.
  • Scheduling: CPU scheduling algorithms, I/O scheduling, Resource scheduling, Deadlock and scheduling algorithms.
  • Memory Management: Memory management schemes, virtual memory, paging, and segmentation.
  • Storage & I/O: File systems, directory structures, and I/O systems.

2. Data Structure

Core CS
  • Linear Data Structures: Arrays and their Applications; Sparse Matrix; Stacks, Queues, and Priority Queues; Linked Lists (singly, doubly, circular).
  • Tree Structures: Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree (BST), AVL Tree, B Tree, B+ Tree, and B* Tree.
  • Advanced Structures: Data Structure for Sets, Graphs (traversals, representations), Hashing techniques and collision resolution.
  • Algorithms: Sorting and Searching Algorithms.
  • Programming Concepts: Functions, Recursion, Parameter passing mechanisms.

3. Digital Fundamentals

Digital Logic & Hardware
  • Data Representation: Data Types, Number Systems (Binary, Octal, Decimal, Hexadecimal) and Conversions, Complements (1's & 2's complement), Fixed Point Representation, Floating Point Representation, Error Detection Codes.
  • Computer Arithmetic: Addition, Subtraction, Multiplication, and Division Algorithms.
  • Logic & Boolean Algebra: Digital Computers, Logic Gates, Boolean Algebra, Map Simplifications (K-Maps).
  • Circuits & Components: Combinational Circuits (Adders, Decoders, Multiplexers), Flip-Flops (SR, JK, D, T), Sequential Circuits, Integrated Circuits.
  • Registers & Memory: Registers and Counters, Memory Unit hierarchy.

Ready to Practice SCQP09 Questions?

Test your knowledge with chapter-wise tests covering Operating Systems, Trees, Digital Logic, and Higher Math on the MCA Prep platform.

Start Free SCQP09 Mock Test → View Solved PYQs

Frequently Asked Questions (FAQs)

1. What is the official paper code for CUET PG MCA? ▼
The official NTA paper code for CUET PG MCA is SCQP09 (titled "Computer Science and Information Technology"). All participating central universities like JNU, DU, BHU, and HCU admit MCA students through this single paper code.
2. Is there any General Knowledge or English paper (Part A)? ▼
No. NTA completely eliminated Part A (general section). The entire paper consists of 75 subject-specific questions covering Thinking & Decision Making, Mathematics, and Computer Concepts.
3. Are Advanced Trees like AVL, B-Tree, and Threaded Trees in syllabus? ▼
Yes. As per the official NTA SCQP09 syllabus, Data Structures explicitly lists Threaded Binary Tree, AVL Tree, B Tree, B+ Tree, and B* Tree in addition to standard Binary Search Trees and Graphs.
4. What is the marking scheme and time duration? ▼
Each correct answer awards +4 marks, and every incorrect answer incurs a penalty of -1 mark (negative marking). Unattempted questions receive 0 marks. The test duration is 90 minutes for 75 questions.
5. Where can I download the authentic syllabus PDF? ▼
You can download the authentic NTA syllabus PDF using the direct download link at the top of this page or from the official portal (cdnbbsr.s3waas.gov.in / pgcuet.samarth.ac.in).

Explore CUET PG MCA Resources

🎯 CUET PG MCA Overview → ⏱️ Exam Pattern & Marking → 📚 Best SCQP09 Books → 📝 Solved Past Papers →