MCA or Master of Computer Applications is a professional course of 3 years duration, aimed for students who want to enter the field of computers and IT field.
The MCA (Master of Computer Application) syllabus is inclusive of classroom training and practical training, including subjects such as programming, networking, computer graphics, and much more.
MCA course curriculum includes advanced training in terms of classroom learning and lab practicals. Apart from this, students are involved in group discussions, seminars, project work, summer training and report writing, which are compulsory in the MCA syllabus.
Theory subjects like Discrete Mathematics, Computer Networks, Operating Systems etc. and practical training is provided to students on the latest programming languages and tools like C Programming, PythonProgramming, JAVA Programming, SQL, and much more.
A semester wise breakup of MCA syllabus is given below:
|Semester I||Semester II|
|Computer Organisation & Architecture||Data Communication & Computer Networks|
|Business Systems and Applications||Information Systems Analysis & Design|
|Computer Programming with C||Data Structures with C|
|Discrete Mathematical Structure||Database Management System I|
|Business English and Communication||Object-Oriented Programming With C++|
|Micro Programming & Architecture Lab||Data structure lab|
|Programming lab||Database lab|
|Business presentation and language lab||Object-Oriented Programming lab (C++)|
|Semester III||Semester IV|
|Operating Systems and Systems Software||Software Engineering & TQM|
|Unix and Shell Programming||Graphics & Multimedia|
|Intelligent Systems||Database Management System II|
|Statistics and Numerical Techniques||Operation Research & Optimisation Techniques|
|Business Management||Environment and Ecology|
|Management Accounting||Software Project Management lab|
|Unix lab||Graphics & Multimedia Lab|
|Statistics and Numerical Analysis lab||Advanced Database lab|
|Accounting Systems lab||-|
|Semester V||Semester VI|
|Elective 1 (Any one): Distributed database management, Image Processing, Parallel Programming||Project Work|
|Elective 2 (Any one): System Administration and Linux, Windows Programming With VB,||Seminar|
|Elective 3 (Any one): Advanced Unix programming, Object Oriented Programming With Java|
|Elective 4 (Any one): Compiler Design, E-Commerce|
|Elective 2 Lab|
MCA syllabus varies from university to university, but the majority of colleges include a compulsory 6 months project training to get the industrial experience in the last semester. Based on this, students are judged as per their research work and their performance in the viva.
Electives are optional subjects that are present with the major subjects in the syllabus. Following is the list of some electives among which one can choose.
|Electives 1||Electives 2|
|Advanced Database Management Systems||Operational Research|
|Numerical and Scientific Computing||Distributed Systems|
|Software Project Management||Organizational Behaviour|
|Multimedia Technologies||Advanced Computer Architecture|
|Mobile Computing||Software Quality Management|
|Microprocessors||Digital Signal Processing|
Some of the major topics included in the common MCA subjects are listen below:
|Course Syllabus||Subjects/ Topics included|
|Computer Programming with C||Overview of C; Constants, Variables & Data Types; Operators and expressions; Managing input and output operators; Decision-making and branching/Looping; Arrays, handling of character Strings; User-defined functions; Structures and unions; Pointers, file management in C; Dynamic memory allocations in relation to array (Use malloc(), calloc(), realloc(), free() ); Overview of Preprocessor statements; Program through Command Line Arguments|
|Discrete Mathematical Structure||Set Theory foundation mapping (bijective, surjective, injective), Relations-equivalence, Poset, Lattice; Mathematical induction, Propositional logic, Logical equivalence; Permutation and combinations; Generating functions, Recurrence relations; Concepts of Graph Theory, sub-graphs, cyclic graphs; Trees, spanning trees, binary trees; Isomorphism, Homomorphism of Graphs; Finite automata – Construction & Conversion of NFA, DFA, State minimization, Mealy M/C, Moore M/C; Definition Of Grammars – Type 0,1,2,3; Fuzzy sets – basic properties|
|Database Management System||Introduction to DBMS, architecture, administration roles, data dictionary; Traditional models, three-level architecture, hierarchical model, network model and relational model; Relational model – definitions and properties, keys integrity rules, relational algebra, joins, set operations; Tuple relational calculus and Domain relational calculus; SQL constructs, PL/SQL,Query; Singled valued functional dependencies; Database design, conceptual, logical and physical models; ER diagram and model, normal forms (1,2,3,BCNF); Storage structure- Sequential, Indexed Sequential; B+ tree – creation, insertion & deletion; Indexing- Primary, Secondary, Multi Level.|
|Unix and Shell Programming||Overview of The UNIX Operating System General Purpose Utilities; File system & Handling ordinary Files; Shell commands & simple programming (Bourne Shell) Vi editor advanced Vi Editor. Basic & More File attributes; Concept of I-Node; Simple filters. grep command; Overview of process; Overview of sed & awk; Overview of TCP/IP networking- basic concept of 4 layers, network class, basic concepts of the applications, subnet.|
|Software Engineering & TQM||Introduction to Software Engineering, Software life cycles - different models; Software Project Management Structured system design; Cost Estimation-COCOMO; Data Oriented Analysis and Design Object Oriented Analysis & Design, Object Oriented modelling; Software quality assurance; Software testing techniques and strategies, test planning, reporting and bug fixing; Test automation, regression testing Software maintenance; Software Complexity & Reliability|
|Operation Research & Optimisation Techniques||Linear Programming-Simplex Method, Duality Method, Assignment Problem, Transportation Problem; Integer Programming-Cutting Plane, Branch & Bound Network Optimisation Models- The shortest path problem, Minimum Spanning Tree Algorithm, Maximal Flow Algorithms, PERT/ CPM; Dynamic Programming- Characteristics, Deterministic & Probabilistic Dynamic Programming; Queuing Theory- Basic Structure, Exponential distribution; Game Theory-Two person Zero Sum game, saddle point determination, algebraic method, graphical method etc.; Inventory Control- Determination of EOQ, Components, Deterministic Continuous & Deterministic Periodic Review Models, Stochastic Continuous & Stochastic Periodic Review Models; Sequencing- Two men two machines, Three Men Two Machines|
|Object Oriented Programming with Java||Oops Concept and Introduction to JAVA An overview of Java Data Types - variables and arrays Operators, Control statements; Classes and Objects, Inheritance, String and string buffer, Packages, Interfaces, Exception handling, Multithreaded Programming, Applets, Event handling Abstract Window Toolkit|
MCA Recommended Books
To learn the basics and gain knowledge of common subjects of computer applications, the following books are recommended.
|Name of the Book||Name of the Author|
|Computer System Architecture||Morris Mano|
|Management Information System||O’Brien|
|Theory of Computer Science||Mishra & Chandrasekharan|
|Discrete Mathematics With Applications||Rosen|
|Data Communication & Networking||Forouzan|
|Computer Communication Networks||Shanmugam & Rajeev|
|System Analysis & Design Hand Book||V.K. Jain, Wiley Dreamtech|
|Data Structure Using C||Radhakrishnan & Srinivasan|
|Database Management System||A.K. Pujari|
|Operating Systems||Galvin & Silverschatz|
|UNIX: Concepts & Applications||Sumitava Das|
Admissions to the MCA course generally take place through the entrance exams like NIMCET, IPU CET, JNU MCA Exam, etc. The following points shows some details of the pattern of different sections in these exams.
- Exam Pattern for Mathematics: This section consists of questions of maths of upto high school level, testing a candidate’s basic mathematical ability and skills.
- Exam Pattern for General English: This section checks the basic understanding of the language and grammar of the candidates.
- Exam Pattern for Analytical Ability and Logical Reasoning: The section of General Ability and Reasoning examines the thinking skills, non-verbal skills, and logical analytics skills of the candidates.
- Exam Pattern for Computer Awareness: This section checks the basic understanding of computer awareness in the exam testing candidate’s extent of knowledge about computers and their systems.
Though some colleges might have special cases, generally most of them follow the syllabus pattern as mentioned in the tables above.