NCST MCA Entrance Exam Syllabus


  • E Level
    The candidate must meet any one of the following eligibility criteria:
  1. A Bachelor’s degree in any subject.
  2. A diploma in Engineering with a minimum of 3 years’ study after the 10th standard or 2 years’ after the 12th standard. The diploma should be recognised by a state government or the central government as an engineering diploma.
  3. Other qualifications recognised by a state government or the central government as equivalent to a Bachelor’s degree. In such cases, the candidate should produce proof of Government recognition.

Note: Any software course of less than 1 year of full-time study or any software course done in parallel with undergraduate studies will not be considered as equivalent qualification for appearing for the G level.


  • Consists of three parts – general aptitude, computer concepts and computer programming in C. Duration of each paper will be 1 hour. All questions will be of multiple-choice type with 4 alternative answers. Each correct answer will carry 3 marks. Each wrong answer will carry 1 negative mark.


General Aptitude (GA)
The main objective of this paper is to assess the general aptitude of the candidate to pursue a technical profession.

The questions in this paper will cover: logical reasoning, quantitative reasoning, visuo-spatial reasoning, high school mathematics, vocabulary, English comprehension and verbal ability. The test looks for a sound understanding of concepts and their applications rather than for rote memory and routine arithmetic skills. A good grasp of the following topics of high school mathematics (up to the 12th standard) will be useful:

  • Arithmetic: ratios and proportions, problems on time-work, distance-speed, percentage, etc.
  • Basic Set Theory and Functions: Set, relations and mappings.
  • Algebra: fundamental operations in algebra, expansion, factorization, simultaneous linear/quadratic equations, indices, logarithms, permutations and combinations.
  • Geometry: angles at a point and parallel lines, triangles, polygons, circles, geometric transformations (particularly similarity, rotation and reflection), areas.
  • Trigonometry: trigonometric ratios, problems on heights and distances.
  • Coordinate Geometry: rectangular Cartesian coordinates, equations of a line, mid-point, intersections etc., equations of a circle, distance formulae, simple geometric transformations such as translation, rotation, scaling.
  • Mensuration: areas, triangles and quadrilaterals, area and circumference of circles, volumes and surface areas of simple solids such as cubes, spheres, cylinders and cones.

Computer Concepts (CC)

  • Computer basics: organization of a computer, characteristics of a computer, Central Processing Unit (CPU), types of instructions in CPU, input/output devices, computer memory, primary memory and secondary memory, memory organization, backup devices.
  • Data representation: representation of characters, integers and fractions, binary and hexadecimal representations.
  • Binary arithmetic: addition, subtraction, division, multiplication, signed arithmetic and two’s complement arithmetic, floating point representation of numbers, normalized floating point representations.
  • Foundations: Boolean algebra, truth tables and Venn diagrams.
  • Computer architecture: block structure of computers, communication between processor and memory, communication between processor and I/O devices, interrupts, multiprogramming, and virtual memory.
  • Computer languages: assembly language and characteristics of high-level languages.
  • Operating System basics: Multiprogramming and timesharing operating systems.
  • Programming using a subset of C: The candidate will not be required to write programs and there will not be any questions on syntax. But candidates should be able to read and understand programs involving the following: the assignment statement, blocks, the input-output statements (scanf and printf), relational and arithmetic operators, conditional statements and iterations.

Computer Programming in C (CP)

Data types, expression evaluation, precedence rules, type conversions, sequential structure, selective structure, repetitive structure, functions (including recursion), arrays, pointers, structures and unions, operations on bits, file processing, pre-processor. The syntax assumed will be that of ANSI C. Approximately 20% of the questions will test the candidate’s knowledge of the syntactical structure of ‘C’. The remaining questions will test the candidate’s working knowledge and understanding of the ‘C’.

TEST DATE : January 21, 2007 (Sunday)