CUET MCA Syllabus

Pursuing a Master of Computer Applications (MCA) degree provides unrivaled chances in the rapidly developing industry of IT. Candidates preparing for the CUET PG MCA test can gain a better understanding of the CUET PG Computer syllabus and Exam Structure, increasing their chances of admission to their preferred university/college. A thorough understanding of the exam pattern and CUET PG syllabus for MCA can significantly improve a candidate’s preparation process.

CUET MCA SYLLABUS

The CUET MCA syllabus is divided into three sections: Thinking and Decision Making, Mathematics, and Computer Awareness. To pass the exam, aspirants must have a good command of all the sections. Let’s have a look at the themes and subtopics covered in each unit of the CUET PG MCA syllabus.

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 an 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: of sets – Union, Intersection, Carombinations.

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.L

Coordinate Geometry: Rectangular Cartesian coordinates, distance formulae, equation of a line, and the 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: The main functions of operating systems are processes, Threads, Interprocess communication, concurrency, Synchronization, Deadlock, CPU scheduling, I/O scheduling, and 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 MCA Eligibility

The CUET PG eligibility criteria are available on the official NTA website. To be eligible for CUET PG, candidates must have a bachelor’s degree in the relevant field from a recognized educational institution. Additionally, they must have obtained the minimum percentage of marks required by the concerned institute.