Skip to main content

IGNOU MCA 2012

Eligibility:

Any graduate from a recognized university. However, the students who have not pursued Mathematics as a distinct subject at 10+2 are required to pursue and pass the CS-60 course concurrently.

Note: Programme fee is per semester

Programme overview

The broad objective of the MCA programme is to prepare graduate students for productive careers in software industry and academia by providing an outstanding environment for teaching and research in the core and emerging areas of the discipline.

The Programme’s thrust is on giving the students a thorough and sound background in theoretical and application-oriented courses relevant to the latest computer software development. The programme emphasizes the application of software technology to solve mathematical, computing, communications/networking and commercial problems.

This Master’s Degree Programme has been designed with a semester approach in mind. The first year courses are aimed at skills development in computers using various technologies, the second year is more focused on core courses providing conceptual frame work and the third year provides the specialization and the project work.

Courses

First Semester

CourseCode    Course Name Credits 
MCS-011 Problem Solving and Programming 3
MCS-012 Computer Organisation and Assembly Language Programming 4
MCS-013 Discrete Mathematics 2
MCS-014 Systems Analysis and Design 3
MCS-015 Communication Skills 2
MCSL-016 Internet Concepts and Web design (Lab Course) 2
MCSL-017 Lab (C and Assembly Language Programming) (Lab Course) 2

Second Semester

CourseCode    Course Name Credits 
MCS-021 Data and File structures 4
MCS-022 Operating System concepts 4
MCS-023 Introduction to Database Management Systems 3
MCS-024 Object Oriented Technology and Java Programming 3
MCSL-025 Lab (Data Structures using C, WINDOWS 2000, LINUX / UNIX, Java and MS? ACCESS, My SQL) 4

Third Semester

CourseCode    Course Name Credits 
MCS-031 Design and Analysis of Algorithms 4
MCS-032 Object Oriented Analysis and Design 3
MCS-033 Advanced Discrete Mathematics 2
MCS-034 Software Engineering 3
MCS-035 Accountancy and Financial Management 3
MCSL-036 Laboratory Course (For Object Oriented Analysis and Design, Software Engineering and Accountancy and Financial Management) 3

Fourth Semester

CourseCode    Course Name Credits 
MCS-041 Operating Systems 4
MCS-042 Data Communication and Networks 4
MCS-043 Advanced Database Management Systems 4
MCS-044 Mini Project 4
MCSL-045 UNIX and DBMS LAB 2

Fifth Semester

CourseCode    Course Name Credits 
MCS-051 Advanced Internet Technologies 3
MCS-052 Principles of Management and Information Systems 2
MCS-053 Computer Graphics and Multimedia 4
MCSL-054 Laboratory Course (Advanced Internet Technologies & Computer Graphics and Multimedia) 2
MCSE-003 Artificial Intelligence and Knowledge Management 3
MCSE-004 Numerical and Statistical Computing 3
MCSE-011 Parallel Computing 3

Sixth Semester

CourseCode    Course Name Credits 
MCSP-060 Project 16

Comments

Popular posts from this blog

IGNOU Syllabus for interview/test for admission to PhD programme in Computer Science

COMPUTER SCIENCE AND APPLICATION (Syllabus for interview/test for admission to PhD programme in Computer Science) Computer Architecture: representation of numbers; Octal, Hexadecimal, and Binary 2’s complement and 1’s complement arithmetic, Floating point representation. Combinational Circuit Design, Sequential Circuit Design, Hardware and Microprogrammed processor design, Instruction formats, Addressing modes, Memory types and organisation, interfacing peripheral devices, Interrupts. Data Structures & Algorithms: Arrays, stacks, queues, lists, linked, trees, graphs priority queues, heaps, Binary tree, AVL tree, B-tree and Hash tables. Graphs : connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning tree of a graph, Eccentricity of a vertex, radius and diameter of a graph. Hamiltonian, Eulerian graphs and Planar graphs. Sorting and Searching Algorithms, Binary Search, Analysis of Algorithms, Asymptotic notation...