TU MCA Docs

Appearance

TUEE MCA Syllabus ​

Comprehensive syllabus for the Tezpur University MCA Entrance Examination (TUEE).

Exam Pattern ​

  • Mode: Computer Based Test (CBT)
  • Total Questions: 50
  • Marks per Question: 2
  • Negative Marking: 0.5
  • Total Duration: 90 minutes

Official Syllabus Topics ​

The entrance exam evaluates candidates across the following core areas:

1. Logical Reasoning and Analysis ​

  • Pattern recognition
  • Analytical reasoning
  • Deductive logic

2. Basic Mathematical Ability (10+2 Level) ​

  • Fundamental mathematics concepts
  • Problem-solving skills

3. Programming and Problem Solving ​

  • Number System
  • Boolean Algebra
  • Logic Gates

4. C Programming ​

  • Basics of C language
  • Problem-solving using C

5. English Vocabulary and Composition ​

  • Grammar and usage
  • Vocabulary
  • Reading comprehension

Extended Syllabus (Helpdesk Provided – Not Official) ​

The following topics are based on guidance from the helpdesk and past trends. These are not officially published but can help in deeper preparation.

1. Logical Reasoning and Analysis ​

Tests your ability to identify patterns, relationships, and logical conclusions.

Series Completion ​

  • Number series (Fibonacci, decimal patterns, doubling)
  • Letter series (alphabet shifts, grouping)

Analogy ​

  • Word relationships (e.g., GLOVE : HAND :: HELMET : HEAD)
  • Group relationships (FLOCK : BIRDS :: SWARM : BEES)

Coding-Decoding ​

  • Letter shifts (e.g., COMPUTER → AMKNSRCP)
  • Letter-number coding (e.g., TIER → 7163)

Blood Relations ​

  • Family trees and indirect relations

Logical Deductions ​

  • Syllogisms
  • Statement-based truth analysis
  • Comparison problems

Miscellaneous ​

  • Odd one out
  • Direction sense
  • Figure/shape sequences

2. Basic Mathematical Ability (10+2 Level) ​

Covers standard high school mathematics with emphasis on application.

Set Theory & Functions ​

  • Cartesian product (A × B)
  • Types of functions (bijective, relations)
  • Valid relations

Probability & Statistics ​

  • Basic probability (dice, outcomes)
  • Conditional probability
  • Averages

Algebra & Arithmetic ​

  • Linear equations
  • Quadratic equations
  • Permutations & combinations
  • Percentages, profit/loss, interest

Geometry & Mensuration ​

  • Triangles (Pythagoras theorem)
  • Circles (angles, arcs)
  • Volume & capacity problems

3. Programming and Problem Solving ​

Combines logic building with computing fundamentals.

Number System, Boolean Algebra & Logic Gates ​

  • Binary operations
  • Digital logic (shift registers: SIPO, PISO)
  • Data representation (8/16/32/64 bit, ASCII)
  • Memory organization problems

C/C++ Programming ​

  • Data types and variables
  • Control structures (if, for, while)
  • Preprocessor directives (#include, #define)
  • Functions and parameter passing
  • Code tracing and output prediction

Data Structures & Computing Fundamentals ​

  • Stacks, queues, linked lists
  • Hashing concepts
  • Networking basics (LAN, MAN, WAN, IPv6)
  • Hardware basics (CPU, motherboard)
  • Databases (SQL basics)

4. English Vocabulary and Composition ​

Focuses on language proficiency and comprehension.

Vocabulary ​

  • Synonyms (Rancorous → Acrimonious)
  • Antonyms (Assuage → Provoke)

Grammar ​

  • Subject-verb agreement
  • Tense usage
  • Prepositions

Composition & Syntax ​

  • Sentence completion
  • Error detection
  • Correct sentence formation

Reading Comprehension ​

  • Scientific and factual passages
  • Inference-based questions

Notes ​

  • The official syllabus is concise, but questions are often concept-based and application-oriented.
  • The extended syllabus reflects actual question trends and is highly recommended for preparation.
  • Students from non-CS backgrounds should focus on:
    • Basic programming logic
    • Data structures fundamentals