MASTER OF COMPUTER APPLICATION ( MCA ) (AS PER CREDIT SYSTEM EFFECTIVE FROM JUNE 2009) 0.576 "A candidate seeking admission to Master of Computer Application (MCA) should have passed Bachelor's Degree examination of any faculty with atleast 50% of marks, of Dr. Babasaheb Ambedkar Marathwada University or any other degree equivalent thereto and have Mathematics/Statistics as one of the subject at Degree level or HSC. level. However in case of students belonging to Backward Classes, a relaxation of 5% shall be available for admission.” O.577 The Master of Computer Application (MCA) shall be conferred on a candidate who has passed a regular course of study consisting of three years(Six Semesters) in the relevant subjects as prescribed and has appeared at and passed in all the examinations prescribed for Master of Computer Applications. R-794. The maximum number of students admitted for a theory calss shall be as approved by Govt. and University, AICTE and the number of students in a batch of practicals will depend upon the facilities available at the Centre. The student computer ratio for practical should be 1:1. R- 795 The course of study for the Master of Computer Application will be of three Years duration (six semester). R-796- The following shall be the scheme of examination MASTER OF COMPUTER APPLICATION (MCA) FIRST SEMESTER Pap Title Weekly Credit Marks Marks Total Duration er Th Pr Th Pr Theory Sessional M arks Theory No or Exam Practical S Pr I ICT Tools 3 4 3 2 60 40 100 2 Hrs II Computer 5 - 5 - 60 40 - 100 2 Hrs Organisation & Architecture III C Programming 3 4 3 2 60 - 40 100 2 Hrs IV Operating 3 4 3 2 60 - 40 100 2 Hrs Systems V Soft Skills 5 - 5 - 60 40 - 100 2 Hrs Development Total 19 12 19 + 6 300 80 120 500 -- = 25 SECOND SEMESTER Pap Title Weekly Credit Marks Marks Total Duration er Th Pr Th Pr Theory Sessional M arks Theory No or Exam Practical S Pr VI OOPS using 3 4 3 2 60 - 40 100 2 Hrs C++ VII Management 5 - 5 - 60 40 - 100 2 Hrs Process & OB VIII Data Structure 3 4 3 2 60 - 40 100 2 Hrs using Java IX Database 3 4 3 2 60 - 40 100 2 Hrs Management Systems X Mathematical 5 - 5 - 60 40 - 100 2 Hrs Foundation Total 19 12 19 + 6 300 80 120 500 -- = 25 THIRD SEMESTER Pap Title Weekly Credit Marks Marks Total Duration er Th Pr Th Pr Theory Sessional M arks Theory No or Exam Practical S Pr XI Visual 3 4 3 2 60 40 100 2 Hrs Programming XII Computer 5 - 5 - 60 40 - 100 2 Hrs Communication Networks XIII Accounting & 3 4 3 2 60 - 40 100 2 Hrs Management Control XIV I T Elective I 3 4 3 2 60 - 40 100 2 Hrs XV Resource 5 - 5 - 60 40 - 100 2 Hrs Management Techniques Total 19 12 19 + 6 300 80 120 500 -- = 25 FOURTH SEMESTER Pap Title Weekly Credit Marks Marks Total Duration er Th Pr Th Pr Theory Sessional M arks Theory No or Exam Practical S Pr XVI Artificial 3 4 3 2 - 40 100 2 Hrs Intelligence XVII Management 5 - 5 - 40 - 100 2 Hrs Support System XVII Web 3 4 3 2 - 40 100 2 Hrs I Technologies & .net XIX IT Elective II 3 4 3 2 - 40 100 2 Hrs XX Information 5 - 5 - 40 - 100 2 Hrs System Analysis & Design Total 19 12 19 + 6 80 120 500 -- = 25 FIFTH SEMESTER Pap Title Weekly Credit Marks Marks Total Duration er Th Pr Th Pr Theory Sessional M arks Theory No or Exam Practical S Pr XXI ERP Domain 3 4 3 2 60 40 100 2 Hrs XXII Software 5 - 5 - 60 40 - 100 2 Hrs Engineering XXII Data Mining & 3 4 3 2 60 - 40 100 2 Hrs I Data Ware housing XXI IT Elective III 3 4 3 2 60 - 40 100 2 Hrs V XX Probability & 5 - 5 - 60 40 - 100 2 Hrs V Combination Total 19 12 19 + 6 300 80 120 500 -- = 25 SIXTH SEMESTER The entire Sixth Semester is allotted to the Project. Every student is required to undertake a real life software project at any organisation and submit the Project report at the end of the semester. It will have 200 marks and 15 credits. Total Marks for MCA Degree – 2,700 Total Credit for MCA Degree - 140 List of IT Electives Elective I 1. Image Processing 2. Emerging Web Development Tools 3. 4. Elective II 1. Advanced Network Programming 2. Parallel Programming 3.. Web Engineering 4. Elective III 1. Software Quality Domain 2. Information system Audit & Governance 3. E-Business Process Domain 4. R –797. There will be 5 lectures for theory subject and three lectures for practical based subject. The practical hours are 12 per week. There shall be 5 credit for each paper. The total credit for the MCA Degree shall be 140. R- 798. In order to pass the examination of Master of Computer Application ( MCA ) a candidate must score atleast 40% marks in each sessional and project work and 50% in aggregate os all semester’s marks. R – 799 To clear a semester a student must have secured atleast 40% marks in each papers of theory and each sessional and project work. R – 800 a) The sessional work shall be assessed by Institute/ College and marks will be forwarded to the university. The sessional work shall be assessed on the following basis:- 1. Two Home Assignment 10 marks each 2. Two Class Tests 5 marks each 3. One Seminar 10 marks The sessional marks are subject to scaling down. The scale down will be in relation to performance in respective theory marks. A variation of ± 10% will be permitted. b) The university will appoint external examiner for assessment of the project. The project will be assessed by the external examiner and the guide separately on the basis of the following criteria:- 1. Preparation of report 100 Marks 2. Presentation 50 Marks 3. Viva Voce 50 Marks R – 801. A student who secures atleast 40% marks in each individual theory papers and project work and secures 50% or more marks but less than 60% of marks in aggregate of all semesters will be declared to have passed in Second Division. There shall be no pass class. R – 802. A student who has secured 40% of marks in each theory paper and each sessional and project work and 60% or more marks in aggregate of all semesters shall be declared to have passed in First Division. R – 803. A student who have failed to secure atleast 40% marks in any one or more papers will be declared to have failed in that/those papers and such students will have to reappear for such paper/papers and secure minimum passing marks. R – 804. If a student who has secured minimum 40% of marks in each paper but has failed to secure minimum of 50% of marks in aggregate for one or more semesters may choose to reappear for any one or more papers to secure 50% of aggregate marks in that/those semesters. “R-805 To be eligible for promotion to second year (Third Semester) of the MCA Course, a student must successfully clear atleast 75% papers offered during the first year (First & Second Semester) of the programme. For promotion to Third Year (Fifth Semester) a student must successfully clear 75% of the total papers offered upto fourth semester and must have cleared all the papers of First and Second Semester. However for promotion to Second, Fourth and Sixth Semesters, a mere appearance at the respective preceding semester exams is sufficient for promotion.” R – 806. Re-admission: a) If a student fails to complete has project work before the closure of semester to which it belongs he will have to take fresh admission to the course and pay Rs.1000/- per semester as fee. b) If a student fails in one or more subjects and desires to take a repeat course by taking regular admission, he must do so. In such a case he will be charged Rs. 500/- per theory course and per sessional work per semester. R – 807. The following shall be the syllabus for the examination. PAPER I -- INFORMATION COMMUNICATION TECHNOLOGY(ICT) TOOLS Theory 60 Sessional/ Practical 40 Credit 5 Unit I - ICT Fundamentals- Historical development – Computer Programming Languages Classification, machine code, assembly language, higher lever languages, Single user, multi-user, work station, client server systems, Computer networks, network protocols, LAN,WAN, Internet facilities through WWW, ISP, Internet Services, Mosiac,Gopher, URL, Browser etc. Unit II - Word: Creating word documents, menu, office assistant working with files , editing text, saving, printing , undo, redo, spelling, formatting, ruler, selecting, cutting, copying, numbering, bullets, page, orientation, margins, tables in a document, formatting text in table, addition deletion of rows columns, record handling, sorting, label, & envelop, using forms, Recycle bin. Protection of documents, mail merge. Unit III - Excel: Excel Sheet creation, entering data, layout and formatting of sheet preview & print, working with range, rows, columns, total, sorting using formatting toolbars, format cells, cell content moving & coping grouped & ungrouped worksheet alignment of text, border colors, page setup, chart, types of chart merging sizing printing chart objects, formatting charts, formula palette , functions & uses - Analysing data with excel. 4. Power Point: Creating a presentation, modifying visual elements, adding objects, applying transition, animation and linking, preparing layouts, presenting a slide show. 5. Front Page & HTML Developing Web Page with Front Page using built in facilities for document creation, navigation and links, bookmarks., HTML- Basic Elements , frame, table, formatting web page in HTML. Books:- 1. Courter Marquis - Office - 2000 2. Mansfield - MS- Office 3 Sanders - Computer Fundamentals 4. Sybex - HTML Complete 5. Monica & J D’Souza - Web Publishing PAPER II - COMPUTER ORGANIZATION AND ARCHITECTURE. Theory 60 Sessional/ Practical 40 Credit 5 Principles of Computer design – software, hardware interaction layers in computer architecture. Central processing unit. Machine language instructions, Addressing modes, instruction types, instruction set selection, Instruction cycle and execution cycle. Control unit, Data path and control path design, Microprogramming Vs hardwired control RISC Vs CISC, Pipelining in CPU designee Superscalar processors. Memory system, Storage technologics, Memory array organization, Memory hierarchy, interleaving, cache and virtual memories and architectural aids to implement these. Input- Output devices and characteristics. Input-output processing, bus interface, data transfer techniques, I/O interrupts, channels performance evaluation – SPEC marks, Transaction Processing benchmarks. Books:- Mano, M,” Computer System and Architecture” (3rd edition) Prentice Hall of India, New Delhi, 1994 Pal Chauduri, p., “ Computer Organisation and Design”, Prentice Hall of India, New Delhi, 1994. Rajraman V., and Radhakrishnan, T., “ Introduction to Digital Computer Designee” (4th edition), Prentice Hall of India, New Delhi, 1997. Stalling, W., “Computer Organization and Architecture. (2nd edition) Prentice Hall of India, New Delhi. PAPER III - C PROGRAMMING Theory 60 Sessional/ Practical 40 Credit 5 1. C Language – Character set Tokens of C - tokens-constant-keywords and identifiers - variables- data types- declaration and assignment of variables- defining symbolic constants.- Operators and Expressions: Types of Operators- Arithmetic, Relational and Logical Operators Assignment, increment and decrement of operators - conditional bitwise and special operators - arithmetic expression and its evaluation - hierarchy of arithmetic operations - evaluations, precedence and associatively - mathematical functions. 2. Control Branching and Decision-Making in C - If statement Switch statement - GOTO statement - The ? : Operators.- 3. Decision - Making and Looping nesting in a loop, statements in C WHILE DO, and FOR statements with variations. 4. Arrays in C Single Two - dimensional and Multi-dimensional arrays. 5. Handling of Character Set: Declaration & Initialization of string variables - reading from and writing to screen -Arithmetic operations - String handling functions. 6. Structures and Unions: Definitions initialization and assigning values to members arrays of structures and arrays within structures structure with in structure- unions - size of structures. 7. Pointers: Declaration and initialisation of pointers - pointer expression - pointer and arrays - pointer and character strings pointers and functions - pointers and structures pointer on pointers. 8. File Maintenance in “C” : Defining, Opening and closing a file - Input/Output operations on a file- random access to file - command line arguments. 9. User Defined Functions: Form of “C” functions- calling a function - nesting of functions - recursion - functions with arrays. Books: 1. Programming in “C” E Balgurusamy Tata Cm Graw-Hill 2. The “C” Programming Language :Briain W. Kenigham & Dennis Ritchie 3. The Spirit of “C”- Henrry Mulish, Herbert L. Cooper. 4. Mastering “C” - Crain Bolon.