576 Department of Computer Applications MCA - Part Time Curriculum Course Code Course Title L T P C Semester - I - Theory MCA603 Digital Computer Fundamentals 3 0 0 3 MMA613 Discrete Structures 3 1 0 4 Practical.
576 Department of Computer Applications MCA - Part Time Curriculum Course Code Course Title L T P C Semester - I - Theory MCA603 Digital Computer Fundamentals 3 0 0 3 MMA613 Discrete Structures 3 1 0 4 Practical.
Direitos autorais:
Attribution Non-Commercial (BY-NC)
Formatos disponíveis
Baixe no formato PDF, TXT ou leia online no Scribd
576 Department of Computer Applications MCA - Part Time Curriculum Course Code Course Title L T P C Semester - I - Theory MCA603 Digital Computer Fundamentals 3 0 0 3 MMA613 Discrete Structures 3 1 0 4 Practical.
Direitos autorais:
Attribution Non-Commercial (BY-NC)
Formatos disponíveis
Baixe no formato PDF, TXT ou leia online no Scribd
MCA - Part Time Curriculum Course Code Course Title L T P C Semester - I - Theory MCA603 Digital Computer Fundamentals 3 0 0 3 MCA607 SoItware Engineering 3 0 0 3 MMA613 Discrete Structures 3 1 0 4 Practical MCA611 Digital Lab 0 0 4 2 Total 12 Semester - II - Theory1 MCA606 Microprocessor and its Applications (8086) 3 0 0 3 MCA608 Object Oriented Analysis and Design (RE & LA) 3 1 0 4 MCA614 Java Programming 3 0 0 3 MMA614 Computer Oriented Numerical & Statistical methods 3 0 0 3 Practical MCA618 Java Programming Lab 0 0 4 2 Total 15 Semester - III -Theory MCA701 Computer System Architecture 3 1 0 4 MCA703 COBOL Programming 3 0 0 3 MMG707 Accounting & Financial Management 3 0 0 3 Practical MCA707 Accounting and Financial Management problems using COBOL 0 0 4 2 Total 12 Course Code Course Title L T P C Semester - IV - Theory MCA706 Computer Graphics 3 0 0 3 MCA708 Principles oI Complier Design 3 0 0 3 MCA714 J2EE 3 0 0 3 MCAE19/E21/E23 Elective I (.NET Frame Work) 3 0 0 3 Practical MCA711 Practical in Elective I (.NET Lab) 0 0 4 2 Total 14 Semester - V - Theory MCA613 Programming in C 3 0 0 3 MCA615 Data Structures and Algorithms 3 1 0 4 MCA803 Data Communication & Networks 3 1 0 4 Practical MCA617 Data Structures using C Lab (RE & LA) 0 0 4 2 Total 13 Semester - VI-Theory MCA616 Database Management System (RE & LA) 3 1 0 4 MCA702 Operating System 3 0 0 3 MCA708 Principles oI Compiler Design 3 0 0 3 MCAE08/E04/E06 Elective-II 3 0 0 3 Practical MCA710 Unix Lab 0 0 4 2 Total 15 Semester - VII-Theory MCA713 SoItware Testing Techniques 3 1 0 4 MCA811 ERP 3 0 0 3 MCA813 Web Technology 3 0 0 3 MCAE07/E09/E11 Elective III 3 0 0 3 Practical MCA815 Web Technology Lab 0 0 4 2 Total 15 Semester - VIII-Theory MCAE13/ MMGE17/E25 Elective IV 3 0 0 3 MCA802 Project Work 0 0 40 20 Total 23 577 List oI Electives
Course Code Course Title L T P C Elective I MCAE19 Dot Net Frame work 3 0 0 3 MCAE21 Grid Programming 3 0 0 3 MCAE23 Network Administration 3 0 0 3 Elective II MCAE08/805 Bio-InIormatics 3 0 0 3 MCAE04 Embedded Systems 3 0 0 3 MCAE06 Network Security and Management 3 0 0 3 Elective III MCAE07 ArtiIicial Neural Networks 3 0 0 3 MCAE09 Image Processing 3 0 0 3 MCAE11 Data Mining & Warehousing 3 0 0 3 Elective IV MCAE13 Optimization Techniques 3 0 0 3 MCAE25 J2ME 3 0 0 3 MMGE17 Customer Relationship Marketing (CRM) 3 0 0 3
MCA603 DIGITAL COMPUTER FUNDAMENTALS 3 0 0 3
UNIT -I 10 Number systems Conversion Irom one system to another Compliments - 1`s, 2`s, 9`s, 10`s Binary codes - Binary storage and registers - Binary logic - Logic gates Truth tables.
UNIT-III 10 Block diagram oI a digital computer Input unit, Output unit - Combinatorial Logic - Adders, Subtractors, Decoders, Encoders, Multiplexer, Demultiplexer.
UNIT-IV 5 Processor design - Arithmetic logic unit Design oI arithmetic circuit Design oI logic circuit - Status register Design oI accumulator.
UNIT-V 10 Computer design - System conIiguration Computer instructions - Design oI computer registers Design oI control - Computer console. TOTAL NUMBER OF PERIODS: 45 REFERENCE : 1. Morris Mano, Digital Logic and Computer Design, Prentice hall-1994. 2. A.P.Malvino and D.P.Leech , Digital Principles and Application, McGraw Hill International Editions 1999.
MCA607 SOFTWARE ENGINEERING 3 0 0 3
UNIT-I: 9 The Process-The SoItware Process, SoItware process, SoItware Process Models, Linear Sequential Model, Prototyping Model, RAD Model, Evolutionary SoItware Process Models. Project Management Concepts-The Management Spectrum, People, The Product, The Process.
UNIT-II: 9 SoItware Process And Project Metrics-Measures, Metrics and Indicators, Metrics in the Process and Project domains, SoItware measurement , Metrics Ior SoItware Quality. SoItware Project Planning -Project Planning Objectives, Resources, SoItware Project Estimation, Decomposition Techniques, Empirical Estimation Models, Risk Analysis-SoItware Risks, Risk Projection.
UNIT-III: 9 Project Scheduling And Tracking -Basic concepts, The relationship b/w people and EIIort , DeIining a Task Set Ior SoItware Project, Scheduling. SoItware Quality Assurance Quality Concepts, Quality movement, SoItware quality assurance, SoItware Reviews. SoItware ConIiguration Management - The SCM Process, IdentiIication oI Objects in the soItware conIiguration, Version Control, Change Control, SCM standards.
UNIT-IV: 9 Analysis Concepts And Principles-Requirement Analysis, Requirement Elicitation Ior SoItware-Analysis Principles - SoItware Prototyping, SpeciIication. Analysis Modeling- Data Modeling, Functional modeling and InIormation Flow, Behavioral Modeling, The mechanics oI Structured Analysis, The Data Dictionary.
UNIT-V: 9 SoItware Testing Techniques - SoItware Testing Fundamentals, White-Box Testing, Basis Path Testing, Control Structure Testing, Black-Box Testing. SoItware Testing Strategies - A strategic approach to SoItware Testing , Strategic Issues, Unit Testing, Integration Testing ,Validation Testing, System Testing, The Art OI Debugging. TOTAL NUMBER OF PERIODS: 45
UNIT-I: Logic and Predicate Calculus 12 Introduction Connectives WII-Duality Principle Laws oI Logic Tautologies and Contradictions Normal Forms Theory oI InIerence Predicate Calculus InIerence theory oI the Predicate Calculus.
UNIT-II: Set Theory & Groups 10 Basic Notion oI sets Operations oI sets Binary and n-ary Relations Functions Basic Concepts Groups - DeIinition and examples Subgroups.
UNIT-III: Graph Theory 12 Basic Concepts oI Graph Path and Circuits Matrix Representation oI Graphs Connected Graph Euler and Hamiltonian Graph Weighted Graph Traveling Salesman Problem.
UNIT-IV: Trees and its Applications 14 DeIinition oI Tree Five Equivalent Conditions on Tree Spanning Trees Minimal Spanning Tree Directed Graph Binary Trees.
UNIT-V: Combinatory 12 Pigeon hole Principle - Counting Principle Permutation and Combination Recursion Recurrence Relations Solving Homogenous and Non- Homogenous Recurrence Relation. TOTAL NUMBER OF PERIODS: 60 REFERENCE: 1. 'Discrete Mathematical Structures with Applications to Computer Science By Tremblay J.P. & Manohar .R, Tata McGraw Hill, India 1997. 2. 'Graph theory with Applications to Engineering and Computer Science By Narasingh Deo, Prentice Hall oI India, Tenth Edition,1974
MCA611 DIGITAL LAB 0 0 4 2 1. VeriIication oI Truth tables oI Logic Gates-AND, OR, NOT, NAND. NOR. 2. NAND and NOR as Universal gates. 3. VeriIication oI De-Morgan`s laws. 4. Implementation oI Boolean expressions using logic circuits. 5. SimpliIication using K-Map technique. 6. HalI Adder / Full Adder using gates. 7. HalI Subtractor / Full Subtractor using gates 8. Study oI shiIt registers(Serial shiIt, LeIt shiIt & Right shiIt). 9. Study oI Modulus Counter. 10. Study oI Up/Down counters. 11. Study oI RAM & ROM. TOTAL PERIODS NEEDED TO COMPLETE THE LAB : 60
MCA606 MICROPROCESSOR AND ITS APPLICATIONS (8086) 3 0 0 3
UNIT-I 9 Introduction to 8086 assembly language programming - Development steps Construction - Writing Programs and Development Tools - Standard program structures- Simple Programs - Jumps - While do - repeat-until - Delay loops.
UNIT -IV 9 Parallel Ports - Handshaking - InterIacing Digital Devices - Analog InterIacing -Industrial Control.
UNIT -V 9 DMA - DRAMS - Cache Memories - Co-Processors - EDA Tools - 80286,80386 and 80486 microprocessors. TOTAL NUMBER OF PERIODS: 45 REFERENCE : 1. Douglas V.Hall Microprocessors and InterIacing Programming and Hardware - TMH-1999. 2 K.Udaya Kumer nad B.S.Umashankar Advanced microprocessors and IBM-PC Assembly Language programming TMH -1998.
MCA608 OB1ECT ORIENTED ANALYSIS & DESIGN 3 1 0 4
UNIT-I 9 System Development-Object Basics-Development LiIe Cycle-Methodologies-Patterns-Frameworks-UniIied Approach-UML.
579 UNIT-II 9 Use Case Models-Object Analysis-Object Relations-Attributes -Methods-Class and Object Responsibilities-Case Studies.
UNIT-IV 9 User InterIace Design-View Layer Classes- Micro-Level Processes-View Layer InterIace-Case Study
UNIT-V 9 Quality Assurance Tests-Testing Strategies-Object Orientation on testing-Test Cases-Test Plans-Continuous Testing-Debugging Principles-System Usability Measuring User SatisIaction-Case Study. TOTAL NUMBER OF PERIODS: 45 TUTORIAL PERIODS - 15 BOOKS FOR STUDY: 1. Ali Bahrami Object Oriented Systems Development McGraw Hill International Edition 1999. 2. R.S.Pressman SoItware Engineering-4 th Edition-McGraw Hill International Edition-1997. 3. James Rumbaugh, Ivan Jacobson, Grady Booch- The UniIied Modeling Language ReIerence Manual, Addison Wesley, Low price Edition.
MCA614 1AVA PROGRAMMING 3 0 0 3
UNIT -I 9 Introduction to Java Features oI Java Object Oriented Concepts Lexical Issues Data types Variables Arrays Operators Control Statements.
UNIT -II 9 Classes Objects Constructors Overloading method Access Control Static and Iixed methods Inner Classes String Class Inheritance Overriding methods Using super Abstract class.
UNIT-III 9 Packages Access Protection Importing packages InterIaces Exception Handling Throw and Throws Thread Synchronization Messaging Runnable InterIace Inter thread communications Deadlock Suspending, Resuming and stopping threads Multithreading.
UNIT -V 9 Basics Socket programming Proxy Servers TCP / IP Sockets Net Address URL Datagrams Working with windows using AWT Classes AWT Controls Layout Managers and Menus. TOTAL NUMBER OF PERIODS: 45 REFERENCE: 1. P. Naughton and H. Schildt Java 2 (The Complete ReIerence) Third Edition TMH 1999 2. K. Arnold and J. Gosling The Java Progrmming Language Second Edition.
Unit I: Numerical Methods I 12 Introduction to Numerical Methods Solution oI algebraic and transcendental equations Newton`s method Bisection Method Regula Ialsi method Secant method Newton Raphson Method Iteration Method.
Unit II: Numerical Methods II 14 Solution oI simultaneous equations Gauss Elimination Method Euler`s ModiIied Methods Solution oI ordinary diIIerential equations Taylor`s Method Predictor and Corrector Method Runge Kutta Method Basic Concepts oI Interpolation Quadature Formula Simpson`s, Trapezoidal Rule.
Unit III: Statistics 10 Introduction oI Statistics Mean, Median, Mode, - Concept oI quartile, Percentile , S.D., Skew ness and Kurtosis with some simple applications Simple Correlation and Regression.
Unit IV: Probability Distribution 12 DeIinition oI Probability Basic Properties oI Probability Conditional Probability Baye`s Theroem Discrete and continuous Random Variables and their Probability Distributions - Standard Distributions Binomial, Poisson, Normal Distributions Some Simple Applications.
Unit V: Sampling Techniques 12 Introduction to Sampling Random sampling Standard error Testing oI Hypothesis - Level oI SigniIicance ConIidence Interval Large Sample and Small Sample Test t-,F-,Chi Square Tests. TOTAL NUMBER OF PERIODS: 60 REFERENCE: 1. Kapur J.N. and Saxena ,H.C. - Mathematical Statistics S.Chand & Company. 2. S.C.Gupta & Kapur V.K. Fundamentals oI Mathematical Statistics Sultan Chand & Sons (1999). 3. S.P.Gupta Statistical Methods - Sultan Chand & Sons. 4. Computer Oriented and Numerical Methods V.Rajaraman Prentice Hall oI India. 5. Numerical Methods in Engineering M.K. Venkataraman National Pub.House.
580 MCA618 1AVA PROGRAMMING LAB 0 0 4 2
APPLICATION 1. Finding area and Perimeter oI a circle. Use BuIIered Reader Class 2. Substring Removal Irom a string. Use String BuIIer Class 3. Determining the order oI numbers generated randomly using Random Class 4. Implementation oI Point Class Ior Image manipulation 5. Usage oI Calendar Class and manipulation 6. String Manipulation using Char Array 7. Database Creation Ior storing e-mail addresses and manipulation. 8. Usage oI Vector Classes 9. Implementing Thread based applications & Exception Handling 10. Application using synchronization such as Thread based, class based and synchronized statements APPLETS 11. Working with Frames and Various controls 12. Working with Dialogs and Menus 13. Working with Panel and Layout 14. Incorporating Graphics 15. Working with colors and Font. TOTAL PERIODS NEEDED TO COMPLETE THE LAB: 60
MCA701 COMPUTER SYSTEM ARCHITECTURE 3 1 0 4
UNIT-I 9 Central Processing Unit: General Register and Stack Organization Instruction Formats Addressing Modes Data TransIer and manipulation program Control RISC.
UNIT-III 9 Computer Arithmetic Addition and Subtraction Multiplication and Division Algorithms Floating Point and decimal Arithmetic operations.
UNIT-IV 9 Input-Output Organisation Peripheral devices I/O InterIace Asynchronous Data TransIer Modes oI TransIer priority Interrupt Direct Memory Access I/O Processor Serial Communications.
UNIT-V 9 Memory Organization Memory Hierarchy Main Memory Auxiliary Memory Associative Cache and Virtual Memory Interconnection Structures Interprocessor Arbitration. TOTAL NUMBER OF PERIODS : 45 TUTORIAL PERIODS - 15 REFERENCE: 1. M.M.Mano Computer System Architecture 3 rd Edition PHI 1994. 2. J.P.Hayes Computer Architecture and Organization Mc Graw Hill 1988.
MCA703 COBOL PROGRAMMING 3 0 0 3
UNIT - I 9 Introduction to COBOL - History oI COBOL Coding Format Ior COBOL programs- Structure oI a COBOL program-character set-COBOL words-Data names and IdentiIiers Literals Figurative Constants-Continuation oI Lines-Language description Notation-Implementation DiIIerences.
UNIT - II 9 IdentiIication, Environment, Data & Procedure Division IdentiIication Division- Environment division- Data division: level stricture - Data description entries, File section-working-storage section-editing-Classes & Categories oI Data- usage clause-Synchronized, JustiIied, redeIines, renames, sign clause-qualiIication oI data names-Procedure division: structure oI the procedure division.
UNIT - III 9 Basic verbs, Data movement verb, arithmetic, conditional & sequence control verbs Data movement verb, arithmetic verbs-sequence control verbs-Input output verbs-conditional verb- Elementary and group moves-corresponding option-rounded option on size error option-computer verb condition-IF statement GOTO with DEPENDING phrase-ALTER,PERFORM, EXIT statement - Sample program.
UNIT - IV 9 Table Handling OCCURS Clause- Assigning values to table elements-PERFORM verb & table handling- Indexing- set, Search verb- Occurs depending clause, sorting & Indexing-Structured Programming in Cobol.
UNIT - V 9 Files in COBOL Sequential Iiles-sorting & merging Iiles-direct access Iiles COBOL subroutines-character string manipulation-report writer. TOTAL NUMBER OF PERIODS : 45 REFERENCES: 1. COBOL Programming Roy Dastidar Tata McGrahil Edition. 2. Programming with Structured COBOL Grover Macmillan series in computer science.
581 MMG707 ACCOUNTING & FINANCIAL MANAGEMENT 3 0 0 3 UNIT - I 9 Principles of Accounting - Principles oI Double entry Journalising, Ledger Posting and preparation oI Trial Balance Preparation oI Trading Account, ProIit and Loss Account and Balance sheet including Adjustments (SIMPLE PROBLEMS ONLY) UNIT - II 9 Analysis and Interpretation oI Financial Statements : Ratio Analysis Uses oI ratios in Interpreting the Final Accounts (Trading A/c ProIit and Loss A/c and Balance Sheet) Final Accounts to Ratios as well as Ratios to Final Accounts Problems.
UNIT - III 9 Break-even Analysis and Marginal Costing: Meaning oI Variable cost and Fixed cost Cost Volume ProIit Analysis Calculation oI Break-even point, ProIit Planning, Sales planning and other decision Making Analysis involving Break-even Analysis Computer Accounting and Algorithm. (DiIIerential Cost Analysis to be omitted)
UNIT - IV 9 Budget / Forecasting : Preparation oI and Characteristics oI Iunctional Budgets Production, Sales, Purchases, Cash and Flexible Budgets.
UNIT - V 9 Project Appraisal : Method oI Capital investment decision making : Pay back method, ARR Method Discounted Cash Flow Methods including Net Present value and IRR method. TOTAL NUMBER OF PERIODS : 45 REFERENCE: 1. M.Y.Khan and P.K.Jain- Financial Management New Delhi Tata McGraw Hill Publishing Company Limited- Third Edition. 2. M.C. Shukla and T.S.Grewal Advanced Accounts New Delhi S.Chand & Co., -1991
MCA707 Accounting and Financial Management problems Using COBOL 0 0 4 2 1. Preparation oI Balance Sheet 2. Ratio Analysis- ProIit and Loss accounts. 3. Cash Flow Statements. 4. Fund Flow Statements. 5. Marginal Costing. 6. Cost Volume Analysis. 7. Overheads Cost. 8. Break-Even analysis. 9. Working Capital 10. Cash Budgeting. TOTAL PERIODS NEEDED TO COMPLETE THE LAB : 60
MCA706 COMPUTER GRAPHICS 3 0 0 3
UNIT-I 9 Video Display Devices Raster Scan Systems Input Devices Hard Copy Devices Graphics SoItware Output Primitives Attributes oI Output Primitives.
UNIT-II 9 Two Dimensional TransIormation window to viewport coordinate TransIormations.
UNIT-III 9 User dialogue Input oI Graphical Data Input Functions Input Device Parameters Picture Construction Techniques Virtual Reality Environments.
UNIT-IV 9 Three Dimensional Concepts 3D TransIormations 3Dviewing.
UNIT-V 9 Visible SurIace Detection: Back-Face Detection Depth BuIIer Method Scan Line Method A BuIIer Method Properties oI Light InIinitive Colour Concepts RGB Color Models Computer Animation. TOTAL NUMBER OF PERIODS : 45 REFERENCE: 1. Hearn and M.P.Baker Computer Graphics Second Edition PHI 1996. 2. M. Neumann and R.F.Sproull Principle of Interactive Computer Graphics McGraw Hill 1979.
MCA708 PRINCIPLES OF COMPILER DESIGN 3 0 0 3
UNIT - I - INTRODUCTION 9 Basic Concepts Grammar Language Parts oI a compiler.
UNIT - II - LEXICAL ANALYSIS 9 Role oI the lexical analyzer SpeciIication and Recognition oI tokens Error recovery Use oI a lexical analyzer generator.
UNIT - III - SYNTAX ANALYSIS 9 Role oI the parser Formalism Ior speciIying grammar Top-Down parsing Bottom-UP parsing Use oI a parser Generator.
UNIT - IV - INTERMEDIATE CODE GENERATION 9 Intermediate languages Declarations Assignment statements Boolean Expressions Flow control statements Back patching. 582
UNIT - V - CODE GENERATION 9 Issues in the design oI a code Generator Runtime Storage Management Design oI a simple Code Generator. TOTAL NUMBER OF PERIODS : 45 REFERENCE: 1. Aho, Ravi Sethi, J.D. Ullman, Compilers Principles,
MCA714 12EE 3 0 0 3
UNIT - I 9 Introduction to Java Java Byte Code Adv. oI Java J2EE and J2SE J2EE Multi-Tier Architecture J2EE Best Practices J2EE Design Patterns and Frameworks
UNIT - II 8 JNI - J2EE Database concepts JDBC Objects JDBC and Embedded SQL
UNIT - III 10 Remote Method Invocation Activation- Object serialization Distributed garbage collection- RMI IIOP-InterIace deIinition language .Java and XML Java Servlets JSP Enterprise Java Beans
UNIT - IV 9 J2EE Interconnectivity - Java Mail API Java IDC and CORBA Java RMI Java Message Service Security Java Naming & Directory InterIace API
UNIT - V 9 WEB SERVICES - SOAP UDDI Electronic Business XML Java API Ior XML Registries (JAXR) Web Services Description Language. (WSDL) TOTAL NUMBER OF PERIODS:45 TEXT BOOK: 1. J2EE, THE COMPLETE REFERENCE, Tata McGraw Hill. 2. Deitel & Deitel , 'Java how to program, Prentice Hall, 4 th Edition,2000. 3. Stephen Asbury, Scott R. Weiner, Wiley, Developing Java Enterprise Applications, 1998.
MCAE19/E21/E23 .NET FRAME WORKS 3 0 0 3
UNIT - I 9 Introduction to .NET - . NET architecture, .NET languages- MicrosoIt intermediate language (MSIL) Just-in-Time Compiler working with assemblies class Library Introduction to Visual Studio .NET Modules, classes, Iorms and namespaces variables- declarations, data types, initializes, assignments arrays and structures. UNIT - II 9 Execution flow control commands, Iunctions and constants error handling debugging .NET applications- class fundamentals Iields - methods- properties constructors Object LiIetime Events shared members Inheritance inheritance in .NET overloading members in the base class sealed and virtual classes scope Interfaces using .NET interIaces delegates. UNIT - III 9 Array class the system collections namespace Custom collection and string dictionary classes-Iiles, directories and streams- the directory and Iile classes- the directory inIo and Iile inIo classes the path class the stream class Object Serialization Basic serialization Custom serialization XML serialization
UNIT - IV 9 Windows Iorms applications Iorm basics the Iorm object - Iorm inheritance advanced Iorm techniques other useIul objects Controls - windows Iorms controls data binding custom control creation hosting custom controls in internet explorer ADO.NET in connected mode the transition to ADO.NET the connection object the command object the data Reader object ADO.NET in Disconnected mode the dataset object the data adapter class
UNIT - V 9 Internet applications web Iorms and controls basic web Iorms concepts the page class web Iorms controls template controls ASP.NET Applications State management and catching -User controls and custom controls - user controls custom controls XML web services introduction to XML web services XML web services up close advanced topics TOTAL NUMBER OF PERIODS: 45 REFERENCE: Programming .NET by JeIIprosise , ISDN No. 81-7853-076-7 Programming MicrosoIt VISUAL BASIC .NET Francesco Balena.
MCA711 .NET LAB 0 0 4 2 1. C# program to implement the Inheritance Concept. 2. To perIorm the Bank Transaction using InterIace concept. 3. Create a User deIined exception and handle it . 4. To implement the idea about thread 5. To implement a calculator using Windows Application 6. To implement the Book shop details (Stock) using Double Queue. 7. To maintain student record using ADO.NET. 8. To implement the Library Management System using ADO.NET 9. To implement the Inventory Control using Web Applications(ASP.NET) 10. To implement the Building a Iorm, Button.event using XML. TOTAL PERIODS NEEDED TO COMPLETE THE LAB : 60 583 MCA613/602 C++ PROGRAMMING 3 0 0 3
UNIT - I 9 IdentiIiers, Keywords, Constants, C Operators, Statements, Manipulator Functions, Control & Loop Statements, Functions and Program Structures, Recursive Functions, Pre-processors, Header Files, Standard Functions, Multi Function Program, Conditional Compilation.
UNIT - II 9 Processing with Arrays, Multidimensional Arrays, Character Arrays, Pointer Arithmetic, Array oI Pointers, Pointers to Pointers, Array oI Structures, Nested Structure, Unions, Bit Fields, Enumerations.
UNIT - III 9 Classes, Objects, Structures, Declaration oI Class, Member Functions, Pointers, Unions, Nested Class, Copy and DeIault Constructors, Destructors, Inline Member Functions, Static Class members, Friend Iunctions, Inheritance, Ambiguity in Single Inheritance, Multiple Inheritance Container Classes, Member Access Control
UNIT - IV 9 Function Overloading Operators Overloading, Overloading oI Binary Operators, Overloading oI Unary Operators, Polymorphism with Pointers, Virtual Functions, Late Binding, Abstract Base Classes, Constructors under Inheritance, Destructors under Inheritance, Virtual Destructors, Virtual Base Classes.
UNIT - V 9 Function Template, Class Template, Exception Handling, Opening and Closing oI Files, Binary File Operations, Random Access File Processing, Various Turbo C and Borland C Streams and File Processing Commands TOTAL NUMBER OF PERIODS:45 REFERENCE: 1. Balaguruswamy.E, 'Object Oriented Programming with C Tata McGraw Hill, Second Edition. 2. LaIore.R., ' Object Oriented Programming in MicrosoIt C, Galgotia, New Delhi, 1993. 3. Venugopal, Ravishanker and Rajkumar, 'Mastering C, Tata McGraw-Hill First edition, 1998.
MCA604/615 DATA STRUCTURES AND ALGORITHMS 3 1 0 4
UNIT - I 9 Arrays-Stacks and Queues Linked Lists
UNIT - II 9 Trees Introduction-Binary Trees Traversal-Binary Search Trees-Balanced Trees.
UNIT - III 9 Sorting Insertion sort Quick sort Merge sort- Heap sort- Sorting on several keys- External sorting.
UNIT - IV 9 Graphs: Representation Operations-Minimum Cost Spanning Trees-Shortest Path-Static Hashing-Dynamic Hashing.
UNIT - V 9 Algorithms: Divide and Conquer Greedy Method-Backtracking-Branch and Bound. TOTAL NUMBER OF PERIODS: 45 TUTORIAL PERIODS - 15 REFERENCE: 1. E. Horowitz, S. Sahni and Mehta-Fundamentals oI Data Structures in C-Galgotia- 2002 2. E.Horowitz, S.Sahni and S.Rajasekaran-Computer Algorithms-Galgotia- 2002 3. M.A.Weiss, Data structures & Algorithm Analysis in c, Benjamin Cummings, 1994. 4. Sara Baase , Computer Algorithms Introduction to Design and Analysis ,AW, 1998. 5. Gregory L.Heileman Data Structures , Algorithms and Object Oriented Programming Mc Graw Hill International Editions - 1996
MCA803 DATA COMMUNICATION & NETWORS 3 1 0 4
UNIT- I 9 Introduction to Data Communication, Network, Protocols & standards and standards organizations Line ConIiguration Topology Transmission mode ClassiIication oI Network OSI Model Layers oI OSI Model.
UNIT - II 9 Parallel and Serial Transmission DTE / DCE such as EIA-449, EIA-530, EIA-202 and x.21 interIace InterIace standards Modems Guided Media Unguided Media PerIormance Types oI Error Error Detection Error Corrections.
UNIT - III 9 Multiplexing Types oI Multiplexing Multiplexing Application Telephone system Project 802 Ethernet Token Bus Token Ring FDDI IEEE 802.6 SMDS Circuit Switching Packet Switching Message switching Connection Oriented and Connectionless services.
UNIT - IV 9 History oI Analog and Digital Network Access to ISDN ISDN Layers Broadband ISDN X.25 Layers Packet Layer protocol ATM ATM Topology ATM Protocol.
UNIT - V 9 Repeaters Bridges Routers Gateway Routing algorithms TCP/IP Network, Transport and Application Layers oI TCP/IP World Wide Web. TOTAL NUMBER OF PERIODS :45 TUTORIAL PERIODS - 15
584 REFERENCE: 1. Behrouz and Forouzan, Introduction to Data Communication and Networking, TMH -1999 2. Jean Walrand Communication Network (A Iirst course). Second Edition WCB/McGraw hill 1998
MCA610/617 DATA STRUCTURES USING C++ LAB 0 0 4 2 1. Usage oI Classes 2. Usage oI Friend Functions 3. Inheritance 4. Polymorphism 5. Exception Handling 6. Polynomial Object and necessary Overloaded Operators 7. Singly Linked Lists 8. Doubly Linked Lists 9. Circular Linked Lists 10. Implementation oI Stack (Using Arrays & Pointers) 11. Implementation oI Queue (Using Arrays & Pointers) 12. Implementation oI Circular Queue (Using Arrays & Pointers) 13. Evaluation oI Expressions 14. Binary Tree Traversals 15. Binary Search Trees. TOTAL PERIODS NEEDED TO COMPLETE THE LAB: 60
MCA616 DATABASE MANAGEMENT SYSTEM 3 1 0 4
UNIT - I INTRODUCTION 9 DeIinition - Need Ior a DBMS - Uses oI DBMS-Advantages and disadvantages oI DBMS - Database and database users- view oI data-Architecture data models data dictionary database languages
UNIT - II RELATIONAL APPROACH 9 Relational model Structure oI a relational database Relational algebra Tuple relational calculus Domain relational calculus SQL Embedded SQL Query languages
UNIT - III RELATIONAL DATABASE DESIGN 9 Relational database design Integrity constraint PitIalls and design Functional dependency Normalization Entiry relationship model Storage and Iile structure Indexing and hashing Basic concepts B
tree index Iile B tree index Iile Static hashing Dynamic hashing
UNIT -IV OB1ECT ORIENTED RELATIONAL DATABASE TECHNOLOGY 9 Concepts Ior Object oriented data model Object oriented database Languages Persistent programming language Object relational Databases. System Implementation techniques: - Query processing Transaction processing Concurrency control Recovery system
UNIT -V ENHANCED DATA MODELS FOR ADVANCED APPLICATIONS 9 Database system architecture Client server system centralized systems parallel systems Distributed system Distributed databases. TOTAL NUMBER OF PERIODS: 45 TUTORIAL PERIODS - 15 REFERENCE: 1. Abraham Silberschatz, Henry F.Korth, S.Sudharshan, 'Database system concepts 4 th Edition, Tata McGraw-Hill, 1997 2. Ramez Elmasri, Shamkant B.Navathe, 'Fundamentals oI database systems, 4 th edition Pearson Education 2002
MCA702 OPERATING SYSTEM 3 0 0 3
UNIT - I - INTRODUCTION 9 Multiprogramming-Time Sharing-Distributed System-Real Time Systems-I/O structure-Dual Mode operation Hardware Protection- General System Architecture-Operating System Services-System Calls-System Programs-System Design and Implementation.
UNIT - II - PROCESS MANAGEMENT 9 Process Concept concurrent Process-Scheduling Concepts-CPU scheduling-Scheduling Algorithms-Multiple Processor Scheduling
UNIT - III - PROCESS SYCHRONIZATION 9 Critical Section-Synchronization Hardware-Semaphores, Classical Problems oI Synchronization-Interprocess communication-deadlock - characterization, Prevention, Avoidance, Detection
UNIT - IV - STORAGE MANAGEMENT 9 Swapping , Single and Multiple partition Allocation-Paging-Segmentation-Paged Segmentation, Virtual Memory Demand Paging-Page Replacement Algorithms-Thrashing-Secondary Storage Management-Disk Structure-Free Space Management-Allocation Methods-Disk Scheduling-PerIormance and Reliability Improvements-Storage Hierarchy.
UNIT -V - FILES AND PROTECTION 9 File System Organization-File Operations-Access Methods-Consistency Semantics Directory Structure Organization-File Protection-Implementation Issues Security-Encryption-User authentication-Case Study-UNIX and Windows 2000. TOTAL NUMBER OF PERIODS: 45 REFERENCE: 1. Silberschatz and Galvin, Operating System Concepts, 4 th Edition, Addison Wesley Publishing Co,1995 2. Deital, An Introduction to Operating Systems, Addison Wesley Publishing Co.,1985 3. Stuart E. Madnick, John J. Donovan, Operating Systems, Tata McGraw Hill, 1997 585 MCAE08/E04/E06 NETWORK SECURITY AND MANEGEMENT 3 0 0 3
UNIT - I: Principle of network and design 9 Design objectives understanding the networking environment achieving the design goals important oI being predictable and Iundamental design principles.- designing the campus LAN campus network design goals understanding the campus network designing the LAN topology campus hierarchical design. UNIT - II: Designing the WAN 9 Designing the WAN topology Ilat versus hierarchical, Ilat WAN topology limitations oI a Ilat design hierarchical WAN topology PVC and leased line Aggregation - issues with hierarchical design hierarchical layers WAN design parameters- choosing the WAN technology design considerations Ior serial links designing IP over Irame relay , and ISDN design issues with IP Iundamental IP routing design designing an IP addressing plan categorizing IP routing protocol and RIP. UNIT - III: Security problem and cryptography 9 Security attacks services and mechanism conventional encryption model Steganography classical encryption techniques simpliIied DES block Cipher principles- The DES standards principles oI public key cryptosystems RSA algorithm key management DiIIie- Hellman key exchange authentication requirements and Iunctions authentication codes Hash Iunctions Kerberos. UNIT - IV: Network security 9 E-mail security pretty good privacy S/MIME IP security overview and architecture authentication header encapsulating security payload combing security associations web security requirements SSL TLS secure electronic transactions intruders- Iire wall design principles trusted systems. UNIT -V: Network Management 9 Network management requirements and systems network monitoring architecture perIormance monitoring Iault monitoring account monitoring conIiguration control security control SNMP background and concepts structure oI management inIormation SNMP protocol basic concepts speciIications transport level support groups. TOTAL NUMBER OF PERIODS:45 REFERENCE: 1. Cormac Long, IP network design, Tata McGraw Hill, 2001. 2. William Stallings, Cryptography and network security Principles and practice, Pearson education Asia, Prentice Hall, 2000. 3. William Stallings,SNMP,SNMPv2,SNMPv3and RMON1 and 2, Pearson education Asia, 3 rd edition,2001. 4. Bruce Schneier, Applied Cryptography, John Wiely &sons Inc, Second edition, 2001.
MCA710 UNIX LAB 0 0 4 2
1. Process Communication (IPC) using Message Queues. 2. IPC using pipes. 3. Implementation oI waits and signal using counting semaphores. 4. Implementation oI waits and signal using binary semaphores. 5. Atomic Counter update problem. 6. Counting Semaphores at the user level using binary semaphores. 7. Signaling processors. 8. Deadlock detection (Ior processes passing messages). 9. Process Scheduling: FCFS 10. Process Scheduling: Least Frequently Used. 11. Process Scheduling: Round Robin. 12. Producer-Consumer problem with limited oIIers. 13. Dining-Philosopher Problem. 14. Reader-Writer problem. 15. Two Process Mutual Exclusion. TOTAL PERIODS NEEDED TO COMPLETE THE LAB :60
MCA713 SOFTWARE TESTING TECHNIQUES 3 1 0 4
UNIT - I: 9 Introduction: The purpose oI testing Some dichotomies a model Ior testing Playing pool and consulting Oracles Is complete testing possible?-Flow graphs and Path Testing: Path Testing basics Predicates, Path Predicates, and Achievable Paths Path sensing Path Instrumentation Implement and Applications oI Path Testing Testability Tips.
UNIT - II: 9 Transaction-Flow Testing: Generalization transaction-Ilow testing techniques Implementation comments Testability tips. Data-flow Testing: Data Flow Testing Basics Data Flow Testing strategies Applications, Tools, EIIectiveness Some tips. Domain Testing: Domain and Paths Nice Domains and Ugly Domains Domain Testing Domains and InterIace Testing Domains and Testability.
UNIT - III: 9 Syntax Testing: Why, What and How A grammar Ior Formats Test Case Generation Implementation and Application Testability tips. Logic-based Testing: Motivational overview Decision Tables Path Expressions KV Charts SpeciIications some tips. Metrics and Complexity: Metrics, what and why Linguistic Metrics Structural Metrics Hybrid Metrics Metrics Implementation some tips.
UNIT - IV: 9 Paths, Path Products, and Regular Expression: Motivation Path Products and Path Expressions A Reduction Procedure Applications Regular Expressions Flow anomaly Detection. States, State Graphs and Transition Testing: Overview State Graphics Good State Graphs and Bad State Testing Tips. Graph, Matrices and Applications : Motivational overview The Matrix oI a Graph Relations The Powers oI a Matrix Node Reduction Algorithm Building tools.
UNIT - V: 9 586 Implementation: Overview Strategies Ior Programmers Strategies Ior Independent Testers Tests as SoItware Products Tools-WinRunner- LoadRunner- Java Junit Java Ants Test management tools TestDirector Bugzilla xPlanner. TOTAL NUMBER OF PERIODS: 45 REFERENCE: 1. SoItware Testing Techniques Boris Beizer Dream tech Press. 2. SoItware Engineering Pressman Prentice Hall oI India
MCA811 ERP (SAP ) 3 0 0 3
UNIT - I - INTRODUCTION 9 Enterprise Resource Planning (ERP) Evolution, concepts, Integration and advantages, Architecture oI various ERP products like SAP, J.D. Edwards, PeoplesoIt Etc. Overview oI modules in SAP (Functional and Technical).
UNIT - II - CLIENT/SERVER IN R/3 ARCHITECTURE 9 Basics in Client/Server in R/3 Applications & Systems administration, R/3 System Features, DeIinition oI Client & Server etc.,
UNIT - III - TYPES OF SERVERS 9 Types oI Servers in SAP (Presentation, Application, Database, Message Server, Gateway Server) etc.,
UNIT - IV - WORK PROCESS 9 DeIinition oI Work Process and overview oI diIIerent types oI work processes and Work processes architecture, Work & responsibilities oI Basis Administrator
UNIT - V - PROCEDURES ON INSTALLATION 9 Procedures on installation oI SAP BASIS and Technical Overview oI ABAP/4 etc. TOTAL NUMBER OF PERIODS:45 REFERENCE: 1. Enterprise Resource Planning by ALEXIS LEON, TMH 2. SAP R/3 System Administration by LIANE WILL by BPB 3. SAMS Teach YourselI ABAP/4 in 21 days by KEN GREENWOOD 4. ERP DemystiIied by ALEXIS LEON, TMH 5. SAP R/3 SAP Architecutre, Basis ABAP Programming with MM and SD Modules by DREAMTECH SOFTWARE TEAM
MCA813 WEB TECHNOLOGY 3 0 0 3
UNIT - I 9 Purpose and nature oI XML-XML`s syntax and structure rules-XML Document Type Declaration-External and Internal DTDs-XML and Data binding-XML`s linking Mechanisms-XLINK and XPOINTER-XML`s Style language-Converting HTML Documents into XML Documents.
UNIT - II 9 ASP Fundamentals Introducing Internet InIormation Server Working with ASP Sending data to the user Retrieving InIormation Irom the User Managing User sessions and Applications Persisting InIormation about the User Advanced use oI Intrinsic ASP Objects.
UNIT - III 9 Working with Components Using IIS`s Installable Components Sending and Receiving Email Working with Files Data Access Basics Retrieving Data Irom a Database Inserting Data into a Table ModiIying Table Data Paging through Recordsets Using stored Procedures.
UNIT - IV 9 Model 1 Architecture- Model 2 Architecture-MVC- MVC with ConIigurable Controller- Iirst look at Struts-Tomcat and Struts installation-Struts request LiIe Cycle-Struts ConIiguration Iile-View Components-First struts Application-All about Actions-Iorm validation-Struts tag libraries-Struts HTML tags-Using Images Ior Iorm submissions-Struts Bean Tags-Logic Tags-Struts-EL-List based Iorms-Multipage Lists and Page traversal Irameworks.
UNIT - V 9 Struts and Tiles-First Tile Application-Tiles and multiple modules-Struts and I18N-Java I18N and L10N API-Internationalizing Tiles Applications- Internationalizing Tiles Applications-Processing Localized Input-Character Encodings-Struts and Exception Handling-Principles oI Exception Handling- Logging Exceptions-Strategies Ior Centralized logging-Reporting Exceptions-EIIectively Extending Struts. TOTAL NUMBER OF PERIODS: 45 REFERENCE: 1. Teach YourselI Web technologies BPB Publications- Ivan Bayross. 2. Active Server Pages by Christoph Wille and Christian Koller , BPB Publications. 3. Struts Survival Guide by Srikanth Shenoy, Object Source LLC .
MCAE07/E09/E11 DATA MINING AND WAREHOUSING 3 0 0 3
UNIT - I - INTRODUCTION 9 Relation to Statistics, Databases, Machine Learning-Taxonomy oI data Mining Tasks Steps in Data Mining Process-Overview OI Data Mining Techniques.
UNIT - II - VISUALIZATION AND STATISTICAL PERSPECTIVES 9 Visualization-Dimension Reduction techniques-Data Summarization Methods-Statistical Perspective-Probabilistic and Deterministic Models-Clustering- regression Analysis-Time Service Analysis-Bayesian Learning.
UNIT - III - PREDICTIVE MODELLING 9 587 Predictive Modelling ClassiIication-Decision trees-Patterns-Association rules-Algorithms.
UNIT - IV - DATA WAREHOUSING 9 Design Dimensional Modeling Meta data-PerIormance Issues and Indexing VLDB Issues Development LiIe Cycle Merits.
UNIT - V - APPLICATIONS 9 Tools-Applications-Case Studies. TOTAL NUMBER OF PERIODS : 45 BOOKS FOR STUDY: 1. Usama M.Fayyad ,Gregory Piatetsky Shapiro, Padhrai Smyth and Ramasamy Uthurusamy, Advances in Knowledge Discovery and Data Mining, the M.I.T Press ,1996. 2. Jiawei Han ,Micheline Kamber, Data Mining: Concepts and Techniques, Morgan KauImann Publishers,2000. 3. Ralph Kimball ,The Data Warehouse LiIe Cycle Toolkit, John Wiley & Sons Inc.,1998. 4. Sean Kelly ,Data Warehousing in Action, John Wiley &Sons Inc.,1997
MCA815 Web Technology Lab 0 0 4 2 1. Displaying XML document`s elements in Table`s cells. 2. Navigating through the Data Island Record Set. 3. Retrieving multiple recordsets using ASP. 4. Adding records using Insert command. 5. Retrieving data using the Recordset object. 6. Sending data using Get Method. 7. Retrieving data using Stored Procedures. 8. Struts application that uses DispatchAction. 9. Using Commons Validator with Struts. 10. Developing a custom tag to generate the error indicator. 11. Constructing a web page using Tiles. 12. Exception handling in Struts. TOTAL PERIODS NEEDED TO COMPLETE THE LAB: 60
MCAE13/ MMGE17/E25 12ME 3 0 0 3
UNIT - I 9 Introduction to Java Environment Types J2ME Java Virtual Machine Wireless Devices Wireless Technology Radio Data Networks Microwave and Mobile Radio Networks Messaging Personal Data Assistants
UNIT - II 9 J2ME Architecture Run-Time Environment MIDlet Programming Multiple MIDlets Java Language and SoItware Development Kits Wireless Toolkit Best Practices and Patterns J2ME User InterIaces
UNIT - III 9 High Level Display Low Level Display Record Management System Data, Databases Databases Schema Indexing JDBC Driver Packages Database Connection Transaction Processing
UNIT - IV 9 JDBC and Embedded SQL Tables Inserting Data Selecting Data Metadata Updating and Deleting Data Calculating and Grouping Data Viewing Data - Personal InIormation Manager
UNIT - V 9 J2ME Networking Connection HTTP Communication Management Session Management Web Services Basics Multi-Tier, Client Tier and Web Tier Architecture WSDL SOAP TOTAL NUMBER OF PERIODS: 45 REFERENCE: 1. James Keogh, ~The Complete Reference - 12ME, Tata McGraw Hill, ISBN 0-07-053415-2 2. Jonathan Knudsen and Sing Li, ~Beginning 12ME - Novice To Professional, APRESS 3. Kim Toply, ~12ME in a Nutshell, O`Relly