OFFICE OF THE DEAN, ACADEMIC AFFAIRS ADIKAVI NANNAYA UNIVERSITY Zs RAJAMAHENDRAVARAM No. ANUR/Syllabi/MCA/2020-21/1 Date: 19-03-2021 PROCEEDINGS OF THE VICE-CHANCELLOR Sub:- ANUR- AA - MCA 2 years program (2020-21 AB onwards) - Syllabi -Model Question Papers and List of Paper Setters/Evaluators - Approved - Orders ~ Issued. Ref:- Lr. No. Nil dated 26.02.2021 from Dr. B. Kezia Rani, Convener, Board of Studies, University College of Engineering, ANUR, Rajamahendravaram Read:-Note orders of the Vice-Chancellor dated 18-03-2021 -00000- ORDERS With reference to the subject, having considered the recommendations of the Convener, Board of Studies, syllabi of Masters of Computer Application (2020-21 admitted batches onwards), the Vice-Chancellor has approved the Syllabus, Model Question Papers, Paper Setters/Evaluators of the course as given below. Submitted Syllabus, Model question papers, SLNo | Name of the Course aaa earn years 1 _ | MCA~ Masters of Computer T& I years (2020-21 AB Applications - 2 years program onwards) The fact be reported to the Academic Senate/Executive Council for ratification. (BY ORDER) si ‘A RAO) Dear, Academic Affairs To ‘The Convener, BOS, UCEngg ‘The Special Officer (Confidential) ‘The Dean, Examination The Controller of Examination ‘The Convener, Béard of Research Studies Copies to The Principal, UCEngg, ANUR for informationADIKAVI NANNAYAUNIVERSITY aw RAJAHMAHENDRAVARAM UNIVERSITY COLLEGE OF ENGINEERING Regulations, Course Structure, Syllabus & Model Question Papers MASTER OF COMPUTER APPLICATIONS 2 Years Course w.e.f. 2020-2021 A.B. Department of Computer Science and Engineering Board of Studies University College of EngineeringADIKAVI NANNAYA UNIVERSITY::RAJAMAHENDRAVARAM UNIVERSITY COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Name of the Program: Master of Computer Appl 1s (MCA) Year of Establishment: 2006 (1).Curriculum developed and implemented have relevance to the local, national, regional and global developmental needs which is reflected in Programme outcomes (POs), Programme Specific Outcomes(PSOs) and Course Outcomes(COs) of the Programmes offered by the Universit Adikavi Nannaya University has started Master of Computer Applications (MCA)pr in the year 2006 with an intake of 30 seats and is being successfully running, whi subsequently increased to 45 seats in the year 2017. This program gives exposure to its students, not only the regular curriculum but also to the aspirations of today’s corporate world by inculcating a professional attitude. This program has well-defined leaning objectives including program outcomes, program specific outcomes and course outcomes. Curriculum development and delivery guidelines and norms relating to Choice Based Credit System (CBCS) are as per AICTE and UGC guidelines. and norms. The course has been enriched by offering additional value-added courses and flexibility in choosing elective courses. The final semester students pursue dissertation/project \work/internships in National Institutes, R&D Laboratories and Industries. As a result, the program is well diversified and regularly upgraded to fulfill the needs of the ocal/ national/reuional and global development This program is focused towards enhancing. employability of the students, ‘The department has excellent research facil ies in the core and emerging areas of Computer Science like Data Structures, Computer Networks, Advanced algorithms, Advanced architectures, Advanced Operating Systems, Advanced Database System, Microprocessors etc. Program outcomes are focused on proactive learning leading to enhanced communication skills, team building and nurturing cross breeding of ideas. All the programs are designed and implemented to use ICT enabled learning across departments. The curriculum is also designed with Skill Development Courses, MOOCS, Summer Internship Programs for the effective outcome of the Student Community,Apply the knowledg Various real life applications to any given requirement PO2 Problem Analysis: Identify, formulate and solve complex computing problems iching substantiated conclu PO3 Development of Solutions: Design and evaluate solutions for complex computin problems with appropriate consideration. POs Investigations of complex Computing problems: Use research-based knowledge and research methods for analysis and interpretation of data, and synthesis of the information to provide valid conclusions POS Modern Tool Usage: Create, identi ‘modem computing tools to complex compl and apply appropriate techniques, resources, and ities, POG Professional Ethics: Understand and commit to professional ethics and cyber regulations for professional computing practices, | : Identify the need and have the ability. to engage in independent | | Tearning as a computing professional PO8 Project management and finance: Understand and apply computing, management | principles to manage multidisciplinary projects. | PO9 Communication Efficiency: Communicate effectively with the computing community and with society POI Societal and Environmental Concern: Understand and assess societal, | environmental, health, safety, legal, and cultural issue: | POI Individual and ‘Team Work: Function effectively in diverse teams and in| multidisciplinary environments. PO12 Innovation and Entrepreneurship: Identify a timely opportunity and using innovation to pursue that opportunity PROGRAM SPECIFIC OUTCOM PSOI: Apply the knowledge of computer application to find soh application PSO2: Ability to analyze, design, develop and maintain the software application with latest technologies PSO3: Utilize skills and knowledge for computing practice with commitment on social, ethical, eyber and leval values PSO4: Inculcate employability and entrepreneur skills among students who can develop customized solutions for small to large Enterprises.MASTER OF COMPUTER APPLICATIONS 2 Years Course w.e.f. 2020-2021 Department of Computer Science and Engineering INDEX S.No Deseription a 1 | Academie Regulations 1 2 Course Structure = - MW 3 | Syllabus “4 4 | Model Papers - a 86ADIKAVI NANNAYA UNIVERSITY 7 OED AGS ADEA, CGN som cmt % RAIAMAMENDRAVARAM-ANDHRA PRADESH, INDIA 538296 UNIVERSITY COLLEGE OF ENGINEERING ACADEMIC REGULATIONS MASTER OF COMPUTER APPLICATIONS 2 years course with effect from 2020-2021 A.B. Department of Computer Science and Engineering BOARD OF STUDIES University College of EngineeringBREO WAG OGQTR CALA 50 000: as cones RAIAMAHENDRAVARAM, ANDHRA PRADESH, INDIA - 533296, UNIVERSITY COLLEGE ADIKAVI NANNAYA UNIVERSITY & : OF ENG RING As per GO MS No 44, course duration for MCA hay been reduced from_3 years to 2 years and as per norms, Bridge course iy mandatory for General B.Sc/B.Com/B.A Students. 1. ACADEMIC REGULATIONS Applicable for the students of Master of Computer Applications-MCA, 2 years PG Programme admitted from the Academic Year 2020-21 onwards. The MCA Degree of Adikavi Nannaya University, Rajamahendravaram, shall be conferred on candidates who are admitted to the program and who fulfill all the requirements for the award of the Degree. H_ELIGIBILITY FOR ADMISSIONS The University College of Engineering offering MCA course since the inception of the University ie. from 2006, As per Gov G.O MS No 44, the duration of the course is reduced from 3 years to wears and should be implemented for 2020-2021 AB. Admission to the above program shall be made subject to eligibility, qualification and specialization as prescribed by the University from time to time. Admissions shall be made on the basis of merit rank obtained by the candidates at ICET examination, subject to reservations as laid down by the Govt. from time to time. HLLAWARD OF MCA DEGREE A student shall be declared eligible for the award of the MCA Degree, iff he/she pursues a course of study and completes it successfully in not less than Two academic years and not more than four academic years. IIL.1 The student shall register for all 100 credits and has to secure all the 100 credits. II.2 The minimum instruction days in each semester are minimum of 16 weeks, IIL3 A Student, who fails to fulfill all the academic requirements for the award of the degree Mher seat in MCA within 4 academic years from the year of their admission, shall forfeit course. IV. ATTENDANCE A Student shall be deemed to have eligibility to write End Semester examinations if the student has put in a minimum of 75% of attendance in aggregate of all the subjects. ae strat ais,SOSH HIGH DADA GAY 090: mss certes RAJAMAHENDRAVARAM, ANDHRA PRADESH, INDIA - 533296. LLEGE EERING i.e. 65% and above, and below 75% may a ADIKAVI NANNAYA UNIVERSITY & i IV.1 Condonation of shortage of attendance up to 10° be granted only on genuine and valid reasons on representations by the candidate with supporting evidenc 1V.2 Shortage of attendance below 65 % in aggr eligible to write their end semester examination of that class. IV.3 A candidate shall not be promoted to the next semester unless he/she fulfills the attendance requirements of the semester. A stipulated fee shall be payable towards condonation of shortage of attendance. IV4 A student shall not be promoted to the next semester unless he/she satisfies the attendance requirement of the present semester, as applicable. They may seek readmission into that semester when offered next. If any candidate fulfills the attendance requirement in the present semester, he/she shall not be eligible for readmission into the same class, YEVALUATION ¢ of the candidate in each semester shall be evaluated subject-wise, with a al Exams te shall in NO case be condoned and not The performan maximum of 100 marks for theory and 100 marks for practical’, on the basis of Inte and Semester End Examination. V.1 For the theory subjects 75 marks shall be awarded based on the performance in the End ‘Semester Examination and 25 marks shall be awarded based on the Intemal Evaluation. The internal evaluation shall be made based on the average of the marks secured in the 1wo Mid Term-Examinations conducted as per academic calender released by Dean Academic Affairs of the University V.2 For practical subjects,50 marks shall be awarded based on the performance in the End Semester Examinations and 50 marks shall be awarded as internal marks, based on the day to day work-15 marks, Record-10 marks and the remaining 25 marks to be awarded by conducting an internal laboratory test. The end examination shall be conducted by the examiners, with a breakup marks of Procedure-10, Experimentation-20, Results-10 , Vivavoce-10 V.3 A candidate shall be deemed to have secured the minimum academic requirement in a subject if he/she secures a minimum of 40% of marks in the Fnd semester Examination and a minimum aggregate of 50% of the total marks in the End Semester Examination and Internal Evaluation taken together. V4 In case the candidate does not secure the minimum academic requirement in any subject he/she has to reappear for the End semester Examination in that subject. V.5 Laboratory examination for MCA courses must be conducted with two Examiners, Internal Examiner is,Laboratory Class Teacher or teacher of the respective college and the External Examiner shall be appointed by the university BOS. oo ee 3é ADIKAVI NANNAYA UNIVERSITY & Ey SOSA MOG BEDE GAY spn mrscennes RAJAMAHENDRAVARAM, ANDHRA PRADESH, INDIA - 533296. UNIVERSITY COLLEGE OF ENGINEERING 1 Mandatory For students of General BA, B.Com, BSc, the students ha ete Bridge course us a ‘Students /tus co complete wo skill development courses as the part of their curriculu esigned by the Board of Studies the Skill Inthe second semester Python programming was introduced as a Skill Development VULEY. ~T/DISSI vw Every candidate shall be required to submit a thesis or dissertation on a topic approved by the Concerned guide, LIL LRegistration of Project Work A candidate is permitted to take the project work in the [Vth semester .candidate has to submit, in consultation with his/her project supervisor, the title, objective and plan of action of his project work to the Department with the concern of Guide allotted to them VIL2 The student can initiate the Project work, only after obtaining the approval from, the od guide after the [Ilrd semester end examinations, The duration of the project is for one semester. VIL3 ‘The work on the project shall be initiated at the beginning of the IVth semester and the duration of the project is one semester. A candidate is permitted to submit Project Thesis only afier the approval of Guide not earlier than 16 weeks from the date of registration of the project work. F £Grades The Marks thus obtained will be converted to grades on a 10.0 point scale and then to semester grade point average (SGPA) and subsequently cumulative grade point average (CGPA) is awarded at the end of the course,en aus RAIN so wnt 25 canon 533296. NIVERSITY COLLEGE OF ENGINEERING ey ADIKAVI NANNAYA UNIVERSITY & (S.No. [Range of Marks (%) | Grade | Grade Points | __ Description ] (or 290 =100 oT] 10 Outstanding 02 380 =<90 AE 9 Excellent 03 =70__<80 A 8 | Very Good mi 260 <70 _ BE 7 { Good 05 255 <60 B 6 Average 06 250 <55 Cc 5 Pass 08 <0 F 0 Fail | [09 Not Appeared for Exam (Ab)Absent Cumulative Grade Point Average (CGA) will be calculated from | semester onwards up to the final semester. CGPA multiplied by “10” gives aggregate percentage of marks obtained by a candidat ‘The performance of a student at the end of the each semester is indicated in terms of Semester PA is calculated as below: Grade Point Average (SGPA). The $ Calculation of CGEA(Cumslotive Grads Point Averaze) im of Pras of Gree Points ww Credits ofa ‘oF ered of al ie subjects in all ET (GP + cress) SGPA is calculated for the candidates who have passed in all the subjects in that semester.CGPA, is calculated for those who clear all the subjects in all the previous semesters,9 Soka Hak adamRedee RAJAMAHENDRAVARAM, ANDHRA PRADESH, INDIA - 533296, LLEGE RING ADIKAVI NANNAYA UNIVERSITY & UNIVERSITY 1X Award of Degree A candidate shall be declared to have passed in a subject / paper, if the candidate secures a minimum of “C™ grade in theory examination and the practical examination / Project / Field Work / Viva-Voce / Industrial Training / Seminar Further, a candidate has to secure a minimum of 40% in theory examination (excluding sessional marks) and a minimum of $0% (excluding sessional marks) in the practical examination / Project Field Work / Viva-Voce / Industrial Training / Seminar in Semester-end examinations, and a total of $0% of both internal and Extemal examinations. X dward of Class A candidate, who becomes eligible for the award of MCA Degree, shall be placed in one of the following classes. ‘S.No Class CGPA v First Class with Distinction CGPA2 7.0 * First Class 6.0 , | e 75 2 - MCA-20110 | (Fo, General BSC/B.A/B.Com S| 100 i “ Students) - ee =u} Bridge Course Lab* | | Fundamentals of Computers | MCA-20111 | Lab 50 50 100 - 3 2 | (For General BSe'B.A/B.Com | Students) | | Total Credits 30 Note: All the General B.Se/B.A./B.Com Students must pass the Bridge Course(MCA-20110) and + Bridge Course Lab (MCA-20111) with minimum 50% marks, but the credits allotted For that courses, will not be considered for SGPA calculation. dp te os vole a we? a "ienceltor Semester I ( Code Course Title | Max Marks Hours per week | Credits - Fsteral [Internal Theory | Practical “| MEA-20201 | Computer Newworks sla) 5 4 : 4 Object Oriented MCA-20202 | Programming through 13 | 2s | 10 | 4 s 4 | Lava © saca-zoany | Palsse agement = mio ics ead real aero : | MCA-20204 | romata Theory | too | 4 4 Mca-zoa0e | Bala Mining Coneepivand | > 7a i ae | Techniques —_ | lective | AmificialImlligence and MCA-20206 | Expert Systems Ee alee ea : 4 2Anteret of Things L Bimage Processing ‘Object Oriented | | MCA-20207 | Programming tough so | so | 10 | - 3 2 JAVA Lab MCA-20208 | Database Management so | so | io | - 3 2 | stems Lab FMcacpopos [Skill Development Course | Gy] sp) oo | 5 I with Python | t een Foal Credits 30 Note: ab His and 1 Theory Hrs/Week or 2 Theory Hrs! Week for Skill Development Course, @ ewky Gab Iam ‘Summer Internship (Mandatory) after First Year (to be evaluated during HIsemester), TL) ah Sal? 12Ap Semester 111 (Second Year) Curriculum - uo Josh call Chencallor Code | Course Title Max Marks | Total | Hours Per | Credits a - ju cian Marks Week External | Internal y | Practical | Mca-20301 | Information Security and P= a i " | Cryptography MGA-20302 | Big Data Analytics 5 [100 E - MCA-20303 | Obie Oriented Software = me . a Engineeriny MCA-20304 | Web Technologies B ~ 100 5 a Elective ll 1. Blockchain Technology | MCA-20305 2. Cloud Computing 8 woo | 4 4 3. Machine Learning and __Deep Learning - : 7 Blective-IIt | 1.Business Intelligence and | Visualization MCA-20306 5 "Rorice 75 wo | 4 fo. | 4 | 3.Foundations of Data | Science | | Web Technologies and MCA-20307 | Object Oriented Software so so | ia | - 3 2 | Engineering Lab | MCA-20308 Big Data Analytics lab | 50 so | 100 | = 3 2 | ~Tnnovation, | ] MCA-20309 | Enteprencushi and - | %0 | wo | 2) - | o _ Intellectual Property Rights | | Mca-20310 | Summer Internship 30 so | io | - | - 2 | Total Credits 30 ‘Note: Summer Internship 2 Months (Man ator) afer Fist Vear Go be evaluated during Wisemesten). ‘Semester IV (Second Year) Curriculum Code Course Title Max Marks T Total | Hours Per Week | Credits - Marks i Iniernal_| External Theory | Practical MCA-20401 | Project 150 | 200 | 350 z 5 10 | Total Credits 0 | ywsemester I (First ¥ ©) Curriculum Code | Course Title Max Marks | Total Marks Extemal_| Internal Discrete Mathematical MCA-20101 wo | 4 | - 4 2 Structures | MCA-20102,| Management A io | 4 é a | Mca-2o1as | C Programming & Data) 75 25 | 100 | 4 4 4 Structures | MCA-20104 | Computer Organization 15 23 | 100 | 4 : 4 | MCA-20105 | B 25 100. 4 - Design & Analysis of piace Algorithms: 8 25 100 4 : CC Programming & Data | Mca-20107 . ‘Operating Systems and MEA-20108 | Computer Orgunizationl ab 50 50 100 : 30 50. 100 : 3 Skill Development Course! MCA-20109 | oes 30 50 too | 3 | Bridge Course® lee Fundamentals of Computers | | MEA-20110 | Crop General B:SC/B.A,B.Com I tudents) j 78 25 100 4 : 4 | idge Course Lab™ | Fundamentals of Computers MCA.20111 | Lab | (For General B.Se/B.A/B.Com Students) Note: All the General B.Se/B.A/B.Com Students must pass the Bridge Course (MCA-20110) and Bridge Course Lab (MCA-20111) with minimum 50% marks, but the eredits allotted for that courses «will not be considered for SGPA calculation. 14[ Course Coe Site: MCA-20701 DISCRETE MATHEMATICAL STRUCTURES | semester Course nde 101 “Course Objectives: — | The learning objectives of this course are: | Course Obj Lear about introduction of diserete mathematical structures. ctives | [Lear the Counting Techniques and Recurrence relations, | Loam about in detail about Graphs and Trees. [Team about Boolean Algebra and Models of Computation ‘Course Outcomes: By the end of the course, the student will be “Course Index Course Outcomes: cion ‘Understand about introduction of discrete mathematical structures, “| [e102 Understand the Counting Vechniques and Recurrence relations “| C101.3 | Understand about in detail about Graphs and Tree | [C1014 [Understand about Boolean Algebra and Models of Computation. | 15MCA-20101 DISCRETE MATHEMATICAL STRUCTURES. Instruction: 4 Periods/week Time: 3 Hours, Credits: 4 Internal: 25 Marks Total: 100 Marks UNITI Introduction: Logic-Prepositional Fquivalences-Truth tables-Tautologies-Predicates and Quantifiers-Sets-Operations on sets-Sequences and Summations -Growth functions - relations ry relations and their applications - Representation of relations- and their properties- bir Closures of relations-Equivalence relations-Partial Orderings. UNIT Pi Combinations and Counting Techniques: Basics of Countin; conhole Principle: Permutations-Generalized Permutations and Combinations Recurrence relations: Solving Recurrence Relations-Divide and Conquer telations-Inclusion and Exclusion-Applications of Inclusion-F yelusion UNIT I Graphs: Introduction to Graphs-Terminology-Relations and Directed Graphs Representations of Graphs Isomorphism-Connectivity- Euler and Hamiltonian Paths- Shortest Path problems- Planar Graphs- Graph Coloring, ‘Trees: Introduction to trees- Applications of trees- Traversals-Trees and sorting Spanning Trees-Minimum Spanning Trees. UNITIV Boolean Algebra and Models of Computation: Boolean Functions- Representing Boolean Functions -Logie Gates-Minimizations of Circuits-Languages and Grammars- Finite State Machines with and with no output. Text Book: 1. Discrete Mathematics and its applications, Keneth. H. Rosen, Tata MeGraw-Hill Publishing Company, New Delhi Reference Books: 1. Discrete Mathematies for Computer Scientists & Mathematicians, Joe L.Mott, Abraham Kandel& T. P, Baker.Prentice Hall of India Ltd, New Delhi Discrete mathematics, Richard Johnsonbaug, Pearson Education, New Delhi 16Course Objectives: NT ACCOUNTANCY ‘The learning objectives of this course are: Course Objectives Lear the basic conc ;n of Principles Of Accounting and Final Accounts, Lear about in detail about Ratio Analysis. Learn about the concepts of Costing, Budget and Budgetary Control, Marginal Costing, Learning the Iniroduction To Computerized Accounting System. ‘Course Outcomes: By the end of the course, the student will he | Course Index Course Outcomes | 102.1 | Undrtand he tasic concep of Principles OF Accounting and Fra Acouns_| €102.2__[ Understand about in detail about Ratio Analysis. : e | 7 | Understand ubout the eonsspis of Costing. Budget and Budgetary Control 102.3 c aaey | C1023 | Marginal Costing Z nes | C1024 Understanding the Introduction To Computerized Accounting System | 7MCA-20102 MANAGEMENT ACCOUNTANCY Instruction: 4 Periods/week Time: 3 Hou Credits: 4 Internal: 25 Marks External: 75 Marks ‘Total: 100 Marks UNITT Principles of Accounting: Nature and Scope of Accounting, Double Entry System of Books of Accounts of Sole Proprietary Concern, closing of accounting introduction 10 B: books of accounts and Preparation of Trial Balance Final Accounts: Trading, Profit and Loss Accounts and Balance Sheet of Sole Proprietary ‘Concern with Normal Closing Entries (With numerical problems) UNIT HT Ratio Analysis: Meaning, Advantages. Limitations, Types of Ratio and their usefulness (Theory only)Fund Flow Statement: Meaning of the Term Fund, Flow of Fund, Working Capital C cle, Preparation and Inter-preparation of Statement UNIT Costing: Nature, Importance and Basie Principles. Budget and Budgetary Control: Nature and Scope, Importance, Method of Finalization and Master Budget, Functional Budgets. Marginal Costing: Nature, Scope, Importance, Construction of Break Even Chart, Limitations and uses of Break Even Chart, practical applications of marginal costing(with numerical problems), UNIT IV ystem: Coding Logic and Codes Required, Master Introduction to Computerized Accountin Files, Transaction Files, Introduction to documents used for data collection, processing of different files and outputs obtained. TEXTBOOKS: I Antroduction to Accountaney. T-S. Grewal 2.Management Accountancy, S.P.Jain REFERENCE BOOK: 1. Introduetion to Accounting,G.Agarwal 18| Course Code &Title: MCA-20103 C PROGRAMMING AND DATA S Semester: I ‘Course Index: C103 ‘Course Objectives: The leaming objectives of this course are Course Objectives | Team the Fundamentals and Basic concepts of C Programming, [Learn about in detail about Arrays, Funetions and Pointer. Lear the concepts of Derived Data Types and Data Structures. Team the concepts of Linked Lists, Trees, Graphs, Searching and Sorting | Course Outcomes: By the end of the course, the student will be Course Index Course Outcomes 103.1 Understand the Fundamentals and Basie concepts of Programming ~~ C103.2 | Understand about in detail about Arrays, Funetions and Pointers, €103.3__| Understand the concepts of Derived Data Types and Data Structures C103.4 | Understand the concepts of Linked Lists, Trees, Graphs, Searching and Sorting, 19MCA-20103: C PROGRAMMING AND DATA STRUCTURES Instruction: 4 Periods/week Time: 3 Hours Credits: 4 Internal: 25 Marks External: 75 Marks ‘Total: 100 Marks UNIT-1 Introduction to Computers. Algorithm, flowchart, program development steps, Structure of C program, A Simple C program, identifiers, basic data types and sizes, Constants, variables, arithmeti ope expressions, precedence and order of evaluation. Control structures such asi for statements, break, continue. UNIT-AL Arrays: Arrays - declaration, definition, accessing elements, storing elements, Strings and D and char storage classes relational and logical operators, increment and decrement operators, conditional ‘ator, bit-wise operators, assignment operators. expressions, type conversions, conditional g0 t0, labels, and, switch statements, Loops- while, do-whil string manipulations, 1- D arrays, 2-D arrays arrays, Funetions: basic scope rules, user defined functions, standard library functions, recursive functions, header files, C pre-processor. Pointers: Concepts, initialization of pointer variables. pointers and Function arguments, passing by address ~dangling memory, C dynamic memory management function ter arrays ~ Multidimensional parameter passing, aracter pointer s and functions, pointer s to pointers, ‘command line pointer s and multidimensional array argumen UNIT-IIL Derived types: structures- declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers. to tial structures, unions, typed of, bit-fields, Input and output ~ concept of a file, text files and binary files, Formatted Vo. file Vo operations. Data Structures: Introduction to Data Structures ~ Stacks: Definition, Stack implementation one application; Queues: Definition, Queue implementation and types of Queues, UNIT-IV Linked Lists: Single Linked List- Definition, implementation; Double Linked List- Definition, implementation, Trees: Binary Trees- representation, traversals. Graphs: Introduction, representation, traversals. Searehing: Linear Searching and Binary Searching. Sorting: Bubble Sort, Quick Sort and Merge Sort structures, self-refe ‘TEXT BOOK: 1.C and Data Structures: A snapshot oriented treatise using live engineer Venkateswarlu, E. V Prasad, S Chand &Co. 2-JLet Us C, YashwantKanetkar, BPB Publications 3. Computer science, A structured programming approach u R.FGilberg, Third edition, Thomson, REFERENCE BOOKS: 1. Fundamentals of Data Structures in C, Horowitz, Sahni, Anderson examples, NB h Edition. ing C, B.A. Forouzan andCourse Code &Title: MCA-20104 COMPUTER ORGANIZATION ] Semester: 1 | Conse tndex: C104 Course Objective The learning objectives of this course are: | Course Objectives | Learn the basies of Digital Logie Cireuits and Digital Components | Team about the Concepts of Data Representation, Register Transfer and Micro Operations. Learn the concept of Basie Computer Organization and Design and Central Processing Unit. | Team about the concept of Input /Ouput Organization and Memory Organization | Course Outcomes: | By the end of the course, the student will be | Course Index. Course Outcomes C1041 | Understand the basies of Digital Logie Cireuits and Digital Components Understand about the Concepts of Data Representation, Reiser Transfer and ce Micro Operations. a ame Understand the concept of Basie Computer Organization and Design and 2 ‘Central Processing Unit. aa Understand about the concept of Input (Output Organization and Memory Organization. aMCA-20104 COMPUTER ORGANIZATION Instruction: 4 Periodsiweek ‘Time: 3 Hi Cre Internal: 25 Marks External: UNIT Digital Logic Cireuits: on, Combinational Circuit ‘bra, Map Simpl Flip-flops Sequential Circuits, Digital Components: Integeated Circuits, Decoders, Multiplexes, Registers, Shift Registers, Counters, Memory Unit. UNIT-I Data Representation: Data Types, Complements, Fixed-point Representation, Floating point Representation, Register Transfer and Miero Operations: Register Transler Language, Register Transfer, Bus and Memory Transfer, Arithmetic Micro Operations, Assembly language Instructions, 8085 Microprocessor Instruction Set,8085 Architecture, Computer Organization and Desi Instruction Codes, Computer Register, Computer Instructions, Timing and Control, Instruction Cycle, Memory Reference Instructions, Input-Output, Interrupt Central Processing Unit: Introduction, General Rey addressing modes. fer Organization, Stack Organization, Instruction formats UNIT-IV Input /Output Organization: Peripherals Devices, VO Interface, Asynchronous Data Transfer, Mode of Transfer, Priority Interrupt, Direct memory access, Input ~ Output Processor(lOP). Memory Organization: Memory . Main memory, Auxiliary Memory, Associate Memory, Cache Memory and Virtual Memory. Text Books: LComputer System Architecture, M.Morris Mano, Prentice Hall of India Put.itd, Third Edition, Sept, 2008. 2. B. Ram, "Fundamentals of Microprocessors and Microcomputers", Dhanpat Rai Publications, Reference Book 1.Computer Architecture and Organization, William Stallings, PHI Pvt, Ltd. Eastem Feonomy Edition, Sixth Edition, 2003. 2.Computer System Architecture John P. Hayes.| Course Code & Title: MCA-20105 OPERATING SYSTEMS | Semester: | Course Inde cs | Course Objectives: i The learning objectives of this course are Course Objective: Learn th earn about the concept of Memory Management, File structure, [Learn the concept of Protection and Case Study ‘Course Outcomes: By the end of the course, the student will be Course Index Course Outcomes | Gros. | Understand the concept of Introduction to Operating | Management a - eee C1052 Understand about Process Synchronization ard Deadlocks in detail C1083 Understand about the concept of Memory Management, File System Implementation, Mass-storage structure, C1054 | Underst F Protection and Cas 23MCA-20105 OPERATING SYSTEMS, Instruction: 4 Periods/week Time: 3 Hours Credits: 4 Internal: 25 Marks External: 75 Marks ‘Total: 100 Marks UNITE Introduction: Definition of Operating System, Types of Operating Systems, Operating System Structures, Operating-System Services, System Calls, Virtual Machine Operating System Design and Implementation. Process Management: Process Concepts. Operations on Processes, Cooperating Processes, ‘Threads, Inter Process Communication, Process Scheduling, Scheduling Algorithms, Multiple - Processor Scheduling. Thread Scheduling. UNITIT Process Synchronization: The Critical Section Problem, Semaphores, And Classical Problems of Synchronization, Critical Re Deadlocks: Principles of Deadlocks, System Model, Deadlocks Chara Handling Deadlocks, Deadlock Prevention, Avoidance, Detection & Recovery from ms, Monitors, Synchronization examples Methods for erization Deadlocks. UNIT HT Memory Management: Logical Versus Physical Address, Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table. S entation, Virtual Memory, Demand Paging, Page Replacement Algorithms, Thrashi File System Implementation: Concept of a file, Access Methods, Directory Structure, File System Structure, Allocation Methods, Free Space Management, Directory Management, Device Drivers, Mass-s forage structure: overview of Mass-storage structure, Disk structure, disk attachment, disk scheduling, swap-space management UNITIV Protection: Goals and Principles of Protection, Access matrix implementation, Access control, Revocation of access rights. ‘Case study: LINUX, Windows Operating Systems, ‘Text Book: 1. Operating System Principles by Abraham Silberschatz, Peter Galvin, Greg Gagne. Seventh Edition, Wiley Publication Reference Books 1. Operating Systems, William Stallings 5th Edition - PHI 2. Modern Operating Systems, Andrew S.Tanenbaum, 2nd edition, 1995, PHL 3. Operating Systems - A concept based approach, Dhamdhere, 2nd Edition, TMH, 2006, 4. Understanding the Linux Kernel, Daniel P Bovet and Marco Cesati, 3rd Edition,’ Reilly 2005.| Course Code & Title: MCA-20106 DESIGN AND ANALYSIS OF ALGORITHMS Semester: 1 Course Index: C106 Course Objectives: “The learning objectives of this course are: Course Objectives To learn about the Asymptotic Notations, Mathematical Analysis of Non-recursive and recursive Algorithms and sorting techniques. To learn about the Divide-and-Conquer technique, Decrease-and- Conquer and Transfarmn-and- Conquer techniques. - “To learn about the Dynamic Programming and Greedy Technique To learn about the Decision Trees, P, NPand NP- complete problems, BaeKtracking, Branch-and- Bound, Approximation Algorithms for NP-hard Problems Course Outcomes: - By the end of the course. the student will be “T Understand about the Asymplotic Notations, Mathematical Analysis of Nom 106.1 recursive and recursive Algorithms and _ Selection Sort and Bubble sont, Sequential Search and Exhaustive Search. Understand about the Divide-and-Conquer technique, Decrease-and- |e Conquer and Transform-and-Conquer techniques. | Understand the Optimal Binary Search Trees, The Knapsack Problems eee Prim’s Algorithm, Kruskal’s Aluorithm, Dijkstra’s Algorithm. Understand about the Decision Trees. P, NP and NP- complete problems, | ©1064 Backtracking, Branch-and-Bound. Approximation Algorithms for NP-hard l Problems, 25MCA-20106 DESIGN AND ANALYSIS OF ALGORITHMS, Instruction: 4Periods/week je: 3Hours Cre Internal: 25Marks External: 73Marks Tota 100Marks UNITI Fundamentals of algorithmic problem solving, important problem types. Introdueti Fundamentals of analysis of algorithms and effi Analysis framework, Asymptotic Notations and Basie Efficiency classes, Mathematical Analysis of |Non-recursive Algorithms, Mathematical Analysis of recursive Algorithms, Empirical Analysis of Algorithms, Algorithm Visualization, Brute Force: Selection Sort and Bubble sort, Sequential Search and Exhaustive Search, UNIT IT nd-Conquer: Merge Sort. Quick sort, Binary Search, Binary Tree Traversals and Related Properties. Decrease-and-Conquer: Insertion Sort, Depth-First Search and Breadth-First Search= Topological Sorting, Decrease-by-a-Constant-Factor Algorithms. ‘Transform-and-« Conquer: Balanced Search ‘Trees, Heaps and Heap sort, Problem Reduction, UNIT HI je Programmi Warshall’s and Floyd's Algorithm, Optimal Binary Search Trees, The 0/1 Knapsack Problem and Memory Functions. Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm UNIT IV ns of Algorithm Power: Decision Trees, P, NP and NP- complete problems, Coping with the Limitations of Algorithms Power: Backtsacking-n-queens problem, Hamiltonian circuit problem, Subset-sum problem, Branch-and-Bound- The Knapsack Problem, Travelling salesperson problem, Approximation Algorithms. for NP-hard Problems, Text Book: 1. Introduction to Design & Analy Education, New Delhi, 2003, Reference Books: of Algorithms by Anany Levitin, Pearson 1, Introduction to Algorithms by Thomas I. Corman, Charles E. Leiserson, Ron ald R. Rivest& Clifford Stein, Prentice Hall of India, New Delhi 2, The Design and Analysis of computer Algorithms, Aho, Hoperoft & Ullman, Pearson Fducation, New Delhi, 2003, 3. Fundamentals of algorithmics, Gilles Brassard & Paul Bratley, Prentice Hall of India, NewDethiCourse Index: C107 : MCA-20107 © PROGRAMMING AND DATA STRUCTURES LAB. | [Course Objectives: The learning objectives of t sourse are: Course Objectives Team how to write code and own programs u ‘Course Outcomes: | By the end of the course, the student will be Course Index | ‘Lear how to write code for different types of programs using C Progranimir eee eee oe C Programming Course Ourcomes CIO7. | Able to write code for diferent iypes of programs using C Programming COTS] Aiea wr cade programs of Baa Smosh TOTS | The sudens are able wo wrie’Sade and own programs using C Programming aMCA-20107: C PROGRAMMING AND DATA STRUCTURES LAB Instruction: 3Hrsiweek ‘Time: 3Hours 7 ternal: 50) Marks 100Marks 1. Write a C program to read x, ¥ coordinates of 3 points and then calculate the area of a triangle formed by them and print the coordinates of the three points and the area of the triangle. What is the output from your program if the three given points are in a straight line? 2. Write a C program which generates 100 random numbers in the range of 1 10 100. Store n array and then print the array. Write 3 versions of the program using different loop. constructs (ex. for, while and do-while). 3. Write a program which determines the largest and the smallest number that can be stored in different data types like short, nt, long, float and double, What happens when you add | to the largest possible integer number that ean be stored? 4. Write a C program which generates 100 random real numbers in the range of 10.0 10 20.0and sort them in descending order. S. Write a C function for transporting a square matrix in place (in place means that you are not allowed to have full temporary matrix), 6: Write a € funetion, which will invert a matrix 7. Write a set of string manipulation functions eg, for getting a sub-string from a given position, copying one string to another, reversing a string and adding one string to another 8. Write a C program for sorting a list using Bubble sort and then apply binary search. 9. Write aC program to implement the operations on stacks. 10.Write a C program to implement the operations on circular queues. L1.Write a C program for the representation of polynomials using circular linked list and for the addition of two such polynomials. |2.Write a C program for quick sor. 13.Write a C program for Merge sort. 14.Write a C program to create a binary search tree and for implementi preorder, Post order traversal using recur 15.Write aC program for finding the Depth First Search of « graph, 16.Write a C program for finding the Breadth First Search ofa graph, REFERENCE BOOK: 1. Let Us C,Yashwant Kanetkar, BPB Publications, sth Edition 2.Computer Science, A structured programming approach using B.A.ForouzanandR.F.Gilberg, 3rd Edition, Thomson, 2007. 3. The C ~Programming Language” B.W. Kernighan, Dennis M. Ritchie, PHI 4. Data Structures and Algorithms, 2008,G.A.V.Pai, TMH Data Structures, 2e, Debasis, Samanta, PHI,2009"ORGANIZATION Semester: 1 pS e Course Objectives: The lear LAB ng objectives of this course are’ Course Objectives ‘code in UNIX operating system using some basic commands, ‘code some basie programs using Shell Programming. Learn how to write/code different types of algorithms using (C++/JAVA Learn how to do Digi ital Logie Design Experiments Lean how to do 8085/86AssemblyLanguage Programs | Course Outeom; [By the end of the course, the student will be Course Index Course Outcomes a ee ea C1082 ‘The students able to write code some basie programs using Shell Programming, Gr ee ea C1084 “The students able to do Digital Logie Design Experiments C1085 ‘The students able to write 8085/86 Assembly Language Programs 29MCA-20108 OPERATING SYSTEMS AND COMPUTER ORGANIZATION LAB Periods week ime: 3 Hours Cred Internal: 50 Marks External: 50 Marks ‘Total: 100 Marks OPERATING 1. Basie UNIX commands Implement the following using Shell Programming 2. Input number even or odd. 3. Count the number of lines in the input text. Implement the following using C/C+#/TAVA J, FCFS CPU scheduling algorithm, cheduling algorithm. CPU scheduling algorithm, 7. Priority CPU scheduling algorithm 8. Implement Semaphores. 9, Bankers Algorithm for Dead Lock Avoidance 10. FIFO Page Replacement Algorithm REFERENCE BOOKS: 1. Operating System Principles by Abraham Silberschat7, Peter Galvin, Greg Gagne. Seventh Edition, Wiley Publication 2. Understanding the Linux Kemel, Daniel P Bovet and Marco Cesati, 3x Fition Reilly, 2005, 3. Uni programming, Stevens, Pearson Education, 4. Shell programming. YashwanthKanetkar. COMPUTER ORGANIZATION LAB Digital Logie Design Experiments TTL Characteristics and TTL IC Gates Multiplexers & Decoders Flip-Flops Counters 5. Binary Adders &Subtractors 8085/86 Assembly LanguageProgramming: 1. Addition of two & bit numbers. 2. Addition of wo 16 bit numbers. 3. Sum of series of 8 bit numbers, 4. Subtraction of two 8 bit numbers. 5. Largest number in an array REFERENCE BOOKS: Computer System Architecture: Morris Mano, Advanced Micro Processor and Peripherals - Hall/ A K Ray ‘Computer Organization and Architecture ~ William Stallings Sixth Edition, Pearson/PHIL Structured Computer Organization and Design - Andrew S. Tanenbaum, 4th Eaition PHI/Pearson‘Title: MCA-20110 BRIDGE COURSE (FUNDAMENTALS OF COMPUTERS) (For | General BSeB.A,/B.Com Students) | “Course Index: C110 | Course Objectives The learning objectives of this course are | Course Objectives | [Explain the concepts of computers and classify based on type and generation | Demonstrate the techniques of writing algorithms pseudo codes & schematic flow of logic in software development process. Teach about Operating Systems and its concepts. [Teach about the purpose of networks and types of networks and media to connect the computers [Land learn about introduction to intemet and email [Course Outcomes: By the end of the course, the student will be Course Index Course Outcomes cna | EXtTsi he concept of put and ouput devises of Computers and how W works and recounize the basic terminology wsd in computer programing i102 | Able to develop techniques of writing algorithms pseudo codes and logic ~CH03 Summarize the concepts of Operating Systems crag) Resounize the Computer network, types of networks and topologies, network devices and get introduction to internet and email 3MCA-20110 - BRIDGE COURSE, (For General BSe/B.A/B.Com Students) FUNDAMENTALS OF COMPUTERS Theory Credits: 4 Internal: 25 Marks External: 75 Marks ‘Total: 100 Marks UNITT Introduction to Computers: History of Computers, Central processing unit, Characteristics and limitations of computer. Types of Computers, Types of memories. Block diagram of Computer. Peripheral Devices: Input, Output and storage, Input devices, Output devices Secondary devices, Communication between the CPU and Input/ Output devices. Software: Types of software, Number Systems (Binary, Octal, Hexadecimal UNIT-IT stem: Introduction to OS, Types of OS, Functions of OS, Evolution of Operating Multi programmed, time-shated, Parallel, Distributed Systems, Real internal Commands: chdir, els, path, prompt, label, ver, vol, echo, set. comp, format, backup, restore, Operating System Operai Systems - Simple Batch Time Systems. MSDOS External Commands: scandisk, discopy, dix installation steps. MS-Office Tools (Word, Excel & PowerPoint): Introduction of Word Processing, MSWord: Creating, Editing, printing, page formatting, inserting tables, pictures, Mail Merge. MS Excel: Introd usage of formulae, Graphs of 1s and animations. luction to spreadsheet, creating, formatting, pri worksheets. MS PowerPoint: Creating a presentation with de UNIT HT ‘Computer Networks: Introduction to computer Networks, Network topologies -Bus topology, star topology, Ring topology, Mesh topology, Hybrid topology. Types of Networks:Local area Network, Wide Area Networks, Metropolitan Networks, Campus/ Corporate Area Network, Personal Area Network, Network Devices: Hub, Repeater, Switch, Bridge, Router, Gateway, ‘Network interfuce Card. Introduction to Internet: Web Browsers, Searching and Surfing, Creating an E-Mail account, Creating an E-Mail sending and receiving E-Mails. Web Browsers, Searching and Surfin account, sending and receiving E-Mails. UNIT IV Problem Solving and Programming: Algorithm development, Floweharts, Looping, some programming features, Pseudo code, Structured Programming concepts, Programming Languages: Machine Language and assembly language, high-level and low level languages, Assemblers, Compilers and Interpreters. TEXT BOOKS: 1. An Introduction to Computer stuclies Noel Katie! 2, Fundamentals of Computers —ReemaThareja-Oxford, 3. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley. 4. Computer Networks: Tannenbaum. REFERENCE BOOK’ 1. Peter Norton_s, Introduct 2. Computer Fundamentals, Anit 1 to Computers, Tata MeGraw Hill, Goel, Pearson Education, 2017. 32| Course & Title: MCA-2011 BRIDGE COURS! B.Se/B.A/B.Com Students) 1 LAB) (For General Course Index: C11 Course Objectives: The learning object ives ofthis course are: Course Objectives AB (FUNDAMENTALS OF COMPUTERS Learn about the intern nal parts of a computer, peripherals, VO ports, connecting cables Team about Internet, / ean how to asl! Operating Syste, jonstrate basic command Tine interface eomam Browsing, Email Demonstrate Office Writing Algorithms, ‘Course Outcomes: By the end of the “Tools such as Word processors, Spreadsheets and Presentation tools Flow Charts for simple programs in C uurse, the student will be Course Index Course Outeomes Understand about the internal parts of a computer, peripherals, 1/O ports, connecting cunt cables ‘Able to install Operating System. able to write basic command Tine interface C1112 | commands on MSDOS cin Know about Intemet, Browsing, Fm ‘Able to work on Office Tools such as Word processors, Spreadsheets and cud Presentation tools - [-“GiTs [Able to Write Algorithms. Flow Charts for simple programs in C 33MCA-20111-BRIDGE COURSE LAB (For General BSe/B.A,/B.Com Students) FUNDAMENTALS OF COMPUTERS LAB. 3Hrs/Week Credits: 4 1: 50 Marks External: 50 Marks Total: 100 Marks Lal Inter Computer Hardware Experiment 1: Identification of peripherals of a PC, Laptop, Server and Smart Phones Experiment 2: Prepare a report containing the block diagram along with the configuration of ‘h component and its functionality. Input’ Output devices. VO ports and interfaces, main storage technologies, digital storage basies, networking ory, cache memory and second: components and speeds. Operating S Experiment 3: Operating System installation: Install ‘on Computer hardware, Experiment 4: MSDOS Operating S ver. vol, echo, set Experiment 5; MSDOS Operating System External Commands: seandisk, discopy, diskeomp. formar, backup, restore stems: ng an Operating System such as Windows sm Internal Commands: chdir, els, path, prompt, label Introduction of Internet: Experiment 6: Web Browsers, Searching and Sur Mails, Creating an E-Mail account, sending and receiving Office Tools: Experiment 7: Office Tools: Demonstration and practice on Microsoft Word. Experiment 8: Demonstration and practice on Microsoft Excel. Experiment 9; Demonstration and practice on Power Point. Introduetion to Programming: Experiment 10: Write simple C Pi vgrams with Algorithms and Flow Charts. TEXT BOOKS: |. Computer Fundamentals, Anita Goel, Pearson Education, 2017 2. PC Hardware Trouble Shooting Made Easy, TMH 3. C & Data Structures (A practical approach) - by G.S. Baluja and G.K.baluja, Dhanapatrai& Co publishers. 34Semester II (First Year) Cur Max Marks [ coate Course Title “Total | Hours per week External | Internal | Marks [Theory | Practical MCA-20201 [ComputerNewoks 75 «| 5 | 10 | 4 | | a ‘Object Oriented ] Mca-20202 ing though 3 | 3 |i) 4] - | 4 | | wcaaunos | Dasbsse Managemen >. | 95 gg Py PP Formal Languages and) ~~ aa 1 MCA-20204 ‘Automata Theor 75 25 | 100 | 4 - 4 sacacauzos | Pat Mining Concepisand | >] >, 1 a@p Toa) oP a Techniques j 1 | nile 4 lestive | Anita Intelligence and Meca-zoan6 | Exper Systems ws | as fim} a |. fa 2Lmernet of Things | 3.Image Processing, | ‘Object Oriented T MCA-20207 | Programming through | 50 50 100 - 3 2 | JAVA Lab + mica-zoaos | Dabass Management so | so fo | - | 3 | 2 Skill Development Couey) S [wca-zoans | Sil Devel 0 [9 fmf [2 [2 a Total Credits 30) Note:2 lab Hrs and | ‘Theory Hrs/Week or 2 Theory Hrs! Week for Skill Development Course. Fork Seb Goce Summer Internship (Mandatory) after First Year (to be evaluated during Illsemester) 35Course Code &Ti Semester: II Course Index: €201 Course Objectives: The learning objectives of this course are: le: MCA-20201 COMPUTER NETWORKS Course Objectives To learn about the basics of computer networks and Data Communication, To learn about Data Link Layer, IEEE Standards, design issues in networks, To learn about Internet Transport Protocols and different types of protocols To lear about various types of Network Devices and different types of Networks ‘Course Outcomes: By the end of the course, the student will be et ‘Understand the basics of computer networks and Data Communication 201.2 | Understand about Data Link Layer, IEE Standards design issues in neoworks, 201.3 | Understand Internet Transport Protocols and different types of protocols 2014 __| Overview of various ypes of Network Deviees and different ypes of Newworks 36