BHARATHIAR UNIVERSITY: COIMBATORE - 641 046.
MASTER OF COMPUTER APPLICATIONS (MCA) (Colleges)
(For Regular ad Distance Education except University Department)
(FOR THE CADIDATES ADMISTTED DURING THE ACADEMIC YEAR 2005-2006)
Bharathiar University, which was established in the year 1982 by the Government of Tamil
Nadu, is situated near the Marudhamalai hills. The campus is ten kilometers away from the city. The
University offers various master‟s degree Curses and offers facilities for fundamental and advance
ELIGIBILITY FOR ADMISSION:
Candidates for admission to the first year course leading to the Degree of Master of
Computer Applications (M.C.A) will be required to posses:
A pass in any degree with Mathematics at +2 level or any degree with at least one paper in
Mathematics or Statistics at degree level.
In case of SC/ST candidates, a mere pass in any of the above Bachelor's degree will be
DURATION OF THE COURSE
The course shall be offered on a full-time basis. The course will consist of five semesters of
course work and laboratory work and the sixth semester shall be Project work.
REQUIREMENTS OF EXAMS AND ATTENDANCE
A candidate will be permitted to appear for the University examinations if, he/she secures not
less than 75% of attendance in the number of working days during the semester and that the
candidate‟s character has been satisfactory. If a candidate fails to secure 75% attendance and
conduct has been satisfactory it shall be open to the syndicate or any authority delegated such
powers to grant exemption to a candidate for valid reasons subject to usual conditions.
University examinations shall be conducted at the end of each Semester for the subjects of
study undergone by the students in that Semester. The question paper pattern for theory
examination is give below.
Question Paper Pattern
Section – A 10 Marks (10 Objective type Questions of 1 Mark each;
Section – B 15 Marks (5 Question either or type of 3 Marks each)
Section – C 50 Marks (5 Question either or type of 10 Marks each)
Practical examinations will be conducted with one internal examiner and one external
examiner. The question paper for practical examination will jointly be set by both internal & external examiners. One external examiner for every 15 students will be appointed to conduct viva-voce examinations during sixth semester.
Sessional marks will be awarded to the candidates in both theory and practical. The award shall be on the basis of assessment made by the faculty from the candidate's performance in tests and laboratory work.
1. Double valuation (One Internal and one External) system will be followed to award marks.
2. A candidate shall be declared to have passed the examinations in a subject if he/she secures not less than 50% of the total prescribed marks for the subject in sessional and University examinations put together, subject to his/her getting a minimum of 50% of the marks in the University examination.
3. A candidate who successfully completes the course and passes the examinations prescribed in all the subjects of study and practical examinations shall be declared to have been qualified for the degree.
4. If a candidate does not complete the course successfully within a period of 6 years (12 semesters) from the date of his/her joining, he/she will be disqualified from the course.
5. Candidates who have passed 75% with and more aggregate and have cleared all the papers in the first attempt be classified as first class with distinction.
CLASSIFICAITON OF SUCCESSFULL CANDIDATES
1. All Candidates securing not less than 60% of the aggregate marks including sessional shall be declared to have passed the Degree in FIRST CLASS provided they have passed the examination in every subject including practical, project work and Viva-Voce within three years of joining the course.
2. Other successful candidates shall be declared to have passed the examinations in SECOND
SCHEME OF EAMINATIONS.
MASTER OF COMPUTER APPLICATIONS (MCA)
SYLLABUS EFFECTIVE FROM THE ACADEMIC YEAR 2005-2006
SEM SUBJECT AND PAPER INSTRUCTIONAL UNIVERSITY HRS PER WEEK EXAMINATION
in Hrs. Mark
1 13A Introduction to information Technology 4 3 100
13B Computer Organization & Architecture 4 3 100
13C Problem Solving in C 4 3 100
13D Numeric Algorithms & Statistics 4 3 100
13E Accounting & Financial Management 4 3 100
I3P Information Technology Lab 5 3 100
13Q Problem solving using C Lab 5 3 100
II 23A Data Structures & Algorithms 4 3 100
23B Relational Database Management 4 3 100
23C System Software & Introduction to 4 3 100
23D Computer Graphics 4 3 100
23E Foundation of Computer Science 4 3 100
23P Data Structures & Algorithms Lab 5 3 100
23Q RDBMS Lab 5 3 100
III 33A Object Oriented Analysis and design & 4 3 100
C++ 33B Advanced Operating System 4 3 100
33C Analysis & Design of information 4 3 100
4 3 100 33D Computer Networks
4 3 100 33E Operation Research
5 3 100 33P OOPs & C++ Lab
5 3 100 33Q Network & OS Lab
UNIVERSITY INSTRUCTIONAL SEM SUBJECT AND PAPER EXAMINATION HRS PER WEEK
in Hrs. Mark
IV 43A Visual Programming 4 3 100
43B Java Programming 4 3 100
43C Management Concepts & 4 3 100
4EE Elective - I 4 3 100
4EF Elective - II 4 3 100
43P Visual Programming Lab 5 3 100
43Q Java Programming Lab 5 3 100
V 53A Software Engineering 4 3 100
53B Internet & Web programming 4 3 100
53C Data Mining & Warehousing 4 3 100
5EE Elective - III 4 3 100
5EF Elective – IV 4 3 100
53P Mini Project 5 3 100
53Q Internet & Web Lab 5 3 100 VI PROJECT WORK 200
Project and Viva-Voce (150+50)
* Includes 25% continuous internal assessment marks.
ELECTIVES FOR FORTH SEMESTER
ELECTIVE – I
E,1,1 Analysis & Design of algorithms
E.1.2 Digital Image Processing
E.1.3. Neural Networks
ELEVTIVE – II
E,2,1 Multimedia and its applications
E.2.2 Distributed Computing
E.2.3 Simulation and Model
ELECTIVE FOR FIFTH SEMESTER
ELECTIVE – III
E.3.1 Software Project Management
E.3.2 Embedded Systems
E.3.3 Bio Informatics
ELEVTIVE – IV
E.4.1 WAP & XML
E.4.3 AI & Expert Systems
SEMESTER I PAPER I INTRODUCTION TO INFORMATION TECHNOLOGY
UNIT - I
Data and Information : Types of data simple model of a computer – Desktop Computer, Acquisition of numbers and textual data : Introduction – Input units – internal representation of numeric data, representation of characters in computers – error detecting codes.
UNIT - II
Acquiring graphical data : introduction – Acquisition of textual data, pictures – Storage format for pictures – Image compression Fundamentals – Image acquisition with digital camera. Acquiring audio
data – Acquisition of video – Processing multimedia data – processing and displaying textual data.
UNIT - III
Data Storage : Introduction – Memory cell – RAM, ROM, Floppy Disk Drive, CD ROM, Archival
Memory – Central Processing Unit – Output Devices.
UNIT - IV
Computer software – Computer networks – Data organization.
UNIT - V
Some Internet applications – Email – WWW – Information Browsing Service – Information retrieved from World Wide Web – Audio on internet – Business information system : Introduction – Types of information needed by organization – Why should we use computer in business – Design of operational information system – System life cycle – Computer systems for transaction processing.
1. V. Rajaraman, “ Introduction to Information Technology”, Prentice Hall of India, 2003.
1.Ajoy Kumar Ray & Tinku Acharya, "Information Technology – Principles and Application”, Prentice Hall of India, 2004.
2. Research and Development Wing ITL Education, “IT Tools and Applications”, Macmillan India Ltd.,
3. S.K. Sarkar & A.K. Gupta, “Element of Computer Science”, S. Chand & Co., 2002.
PAPER II COMPUTER ORGANIZATION AND ARCHITECTURE
UNIT - I
Number systems: Binary, Decimal, Octal, Hexadecimal - Conversion from one to another – Complements – Binary codes.
Basic Logic Gates – Basic Theorems and Properties of Boolean algebra NAND, NOR
implementation – Sum of products- Product of Sums – Karnaugh map – Tabulation Method – Don‟t Care conditions.
UNIT - II
Combinational Logic Circuits Design : Multiplexers – Demultiplexers – Decoders – Encoders – Hall Adder – Full Adder – Subtractor – Parallel Adders.
Flip-flops : RS, D, JK Flip-flops – Registers – Shift Registers – Ripple Counters – Synchronous counters.
UNIT - III
Register Transfer and Micro Operations : Arithmetic circuits – Logic Circuit – Shift Circuits – Arithmetic logic shift unit – Stack organization – Instruction formats – Addressing modes – Data transfer, Manipulation and program control instructions.
UNIT - IV
Input – Output organization : Peripheral Devices – Input – Output interface – Asynchronous Data Transfer (Strobe & Handshaking Method) – Modes of Transfer – Priority interrupt – DMA – IOP.
UNIT - V
Memory organization : Memory Hierarchy – Main memory – Auxiliary memory – Associative memory – Cache Memory – Virtual Memory.
2. Morris Mano, “ Digital Logic and Computer Design”, PHI.
3. Morris Mano, “ Computer system architecture”, Third Edition, Pearson education.
1.Albert Paul Malvino, Donald P. Leach, "Digital Principles and applications”, Tata Mc Graw Hill Pub,
2.J.P. Hayes “Computer Architecture and organization” Tata Mc Graw Hill Pub, Company Ltd.,
3. William Stallings, “Computer Organization & Architecture – Designing for performance”, Pearson
Education, Sixth edition.
PAPER III PROBLEM SOLVING IN C
UNIT - I
Planning the Computer Program – Flow chart – Types of logic used in flowchart – Computer Language – Hierarchy of programming languages - Classification of programming language – Popular programming language – Program development process – Characteristics of a Good program – Program development process – error in programming.
UNIT - II
An overview of C - data types and sizes - declarations - variables - constants - Operators -
Expressions - Storage classes - Program control structures - Loop control structures – C formatted Input/Output - Arrays - Strings.
UNIT - III
Function - Function Arguments - Function prototype - Recursion - Structure – Unions – Bit Manipulations and Enumerations – Self-Referential Structures – Dynamic Memory Allocation.
UNIT - IV
Pointers – Introduction – Pointer and Arrays – Pointers and Strings – Pointer and Structures – Pointers and Data structures.
File processing – C Preprocessors – Command Line Arguments – Low Level Programming in C – Calling BIOS and DOS interrupts – Port I/O functions to access CMOS – Keyboard and Speaker – Writing into Video Buffer.
1. Yeswanth Kanetkar, “Let us C”
2. Yeswanth Kanetkar, “Pointers in C”
3. Yeswanth Kanetkar, “TSR through C”
4. D.P.Nagpal “Computer Fundamentals – Concepts system & Applications”
1. Ashok N.Kamthane, “Programming with ANSI and Trubo C”. Pearson Education Asia, 2003. 2. E. Balagurusamy, 'Programming in ANSI C',Tata McGraw Hill.
3 Deitel & Deitel, “C How to program”, Third Edition, Pearson Education Asia. 4. Tenenbaum, Langsam and Augenstein, “Data Structures Using C”, PHI, ISBN:81-203-0696-1.
PAPER IV NUMERICAL ALGORITHMS & STATISTICS
Matrix – Rank of a matrix – Consistency and inconsistency of systems of linear algebraic
Numeric methods : Curve fitting by methods of least squares – Fitting of a straight line –
Parabola and exponential curve.
Numerical methods : Finite difference operators – Difference table – Numerical interpolation –
Finding missing values – Langrange‟s interpolation. Numerical differentiation – Numerical integration rdth– Trapezoidal and Simpson‟s 1/3 rule and 3/8 rule.
Solution of numerical algebraic & transcendental equations – Bisection methods – Methods of false position – Newton – Raphson method – iterative method.
Methods of solving simultaneous linear algebraic equations – Gauss elimination method –
Gauss Seidal iterative methods.
Univariate distribution – Frequency distribution – Grouped and Ungrouped distributions –
Measures of central tendency – Measures of dispersion – Coefficient of variation.
Bivariate distribution : Correlation – Types of correlation – Karl Pearson‟s coefficient of correlation – Rank correlation – Regression – Regression equations - Methods of solving regression
Probability : Introduction to probability – Addition and multiplication theorems conditional
probability – Baye‟s theorem – Probability distribution – Binomial poisson, Uniform, Exponential and
normal distribution. (No derivations – simple problems only)
1. M.K. Venkatraman, "Numerical Methods in Science and Engineering”, National Publishing company.
2. S.C. Gupta and V.K.Kapoor, "Fundamentals of Mathematical Statistics", Sultan Chand and Sons
1. P. Kandaswamy K. Thilakavathy and K. Gunavathi, “Numerical Methods”, S. Chand & Company Limited, New Delhi, 2
PAPER V ACCOUNTING AND FINANCIAL MANAGEMENT
Accounting : Definition, Objectives, Advantages, Accounting, Accounting Concepts,
Accounting Conventions, Methods of Accounting – Single Entry and Double Entry System. Basic
Books of accounts – Journal and Ledger – Preparation of Trial Balance.
Final Accounts : Trading and Profit and Loss Account and Balance sheet of Sole Proprietary
UNIT - II
Radio Analysis : Meaning – Advantages – Limitations – Classification of Ration : Profitability,
Turnover and Solvency Ratios.
Fund flow Statement : Concept of Funds – Funds flow statement – Uses and limitations – Preparation of fund flow statement – Cash flow statement.
Budget and Budgetary Control : Meaning and definition, Objectives of Budgetary control,
Advantages and Limitations preparation of different types of budgets.
Costing : Definition, Nature and importance Advantages and limitations of Cost accounting – Classifications of Cost – Preparation of Cost sheet.
Marginal Costing : Meaning, Advantages – cost – Volume profit analysis – Break Even analysis – Uses and assumptions – Applications of Marginal Costing.
Text Books :
1. Vinayakam, Mani Nagarajan, “Principles of Accuntancy”, Eurasia Publishing House, New Delhi. 2. S.N. Maheswari - "Principles of Management Accounting", Sultan and Chand Co.
1. Sharma and Sasi K.Gupta, “ Management Accuonting” Kalyani Publishers.
2. T.S. Grewal, Introduction to Accountancy”, Sultan Chand & Co.
3. Ramachandran and Srinivasan, “Management Accounting”, Sri Ram Publications, TRichy.