SYLLABUS MASTER OF COMPUTER APPLICATIONS (MCA) · (MCA-652) L T P Total Credits 0 0 06 3 Guidelines...

SYLLABUSMASTER OF COMPUTER APPLICATIONS (MCA)

SESSION-2016 onwards

IEC School of Computer Science and Applications

IEC University, Atal Shiksha Nagar (Kallujhanda)PO- Mandhala, Village- Nanakpura, Pinjore-Nalagarh Highway

District- Solan, Himachal Pradesh- 174103

IEC School of Computer Science and ApplicationsScheme of Studies for MCA Degree Program

MCA 1st Year / 1st Semester

Course Period Evaluation Scheme Course Total

L T P Sessional Marks Exam Marks

Max. MarksCreditsSr.

No. Code TitleMSE CA P Total ESE Marks Credits

Theory

1 MCA-101

Elements of digital electronics

and Computer Organization

4 1 0 40 20 0 60 40 100 4.5

4 MCA-102

Fundamentals of Computers &

Problem Solving Using “C”

3 0 0 30 15 0 45 30 75 3

3 MCA-103 Database Systems 4 0 0 40 20 0 60 40 100 4

2 MCA-104Discrete

Mathematical Structure

3 1 0 40 20 0 60 40 100 3.5

5 ENG-701 Business Communication 3 0 0 30 15 0 45 30 75 3

PRACTICAL

1 MCA-102PFundamentals of

Computers & Problem Solving

Using “C”

0 0 4 15 15 10 25 2

2 ENG-701P Business Communication 0 0 2 15 15 10 25 1

Total Credits 21

ELEMENTS OF DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION (MCA-101)

L T P Total Credit

4 1 0 4.5Total Contact Hours: 42

Maximum Marks: 100 Time: 3 hours

Note: Examiner will be required to set the question paper in three sections. Section A (compulsory) will contain question no 1 with 15 sub questions and all the sub questions carrying weightage of 2 marks.Section B will contain question no 2. Each question will have 8 sub questions and candidate will attempt any 5 questions weightage of 8 marks. Section C will contain question no 3. Each question will have four sub questions and candidates will attempt any 2 questions from each question carrying weightage of 15 marks.

UNIT-IInformation Representation: Number systems, BCD codes, Character codes – ASCII, EBCDIC, Unicode, Error Detecting and Correcting codes, Fixed-point and Floating-point representation of numbers. Binary arithmetic.Binary Logic: Boolean algebra, Boolean functions, truth tables, canonical and standard forms, simplification of Boolean functions, Digital logic gates. [12 Hours]

UNIT-IICombinational Logic: Design procedure, Adders, Subtractors, Code Conversion, Analysis procedure, Multilevel NAND & NOR Circuits, XOR & XNOR functions Encoders, Decoders, Multiplexers, Demultiplexers and Comparators, Binary Parallel Adder, BCD Adder. [10 Hours]

UNIT-IIISequential Logic: Flip-flops, Shift registers and Counters.Memory System: Memory parameters, Semiconductor RAMs, ROMs, Magnetic and Optical storage devices, Flash memory. [10 Hours]

UNIT-IVCPU Organization: Processor organization, Machine instructions, instruction cycles, instruction formats and addressing modes, microprogramming concepts, and micro program sequencer. [5 Hours]

UNIT-VI/O Organization: I/O interface, Interrupt structure, transfer of information between CPU/memory and I/O devices, and IOPs. [5 Hours]

Text Books:1. Mano, M. Morris Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd.2. Rajaraman, V., Radhakrishanan,T., An Introduction To Digital Computer Design, Prentice Hall of India Pvt. Ltd.

Reference Books:1. Hayes, J.P., Computer Architecture and Organization, McGraw Hill2. Tanebaum A.S., Structured Computer Organization, Prentice Hall of India Pvt. Ltd.3. Stallings W., Computer Organization and Architecture, Prentice Hall of India Pvt. Ltd.

FUNDAMENTALS OF COMPUTERS & PROBLEM SOLVING USING “C” (MCA-102)

L T P Total Credits

3 0 0 3

Total Contact Hours: 42Maximum Marks: 100 Time: 3 hours


UNIT-IAn Overview of Computer System: Anatomy of a digital Computer, Memory Units, Main and Auxiliary Storage Devices, Input Devices, Output Devices, Classification of Computers, Introduction to microprocessor, commonly used CPUs, Input/output ports and connectors. [10 Hours]

UNIT-IIOperating System & Networking Basics: The user Interface, Running Programmes, Managing files, Introduction to PC operating Systems: Unix/Linux, DOS, and Windows 2000. Introduction to the basic concepts of Networks and Data Communications, Network topologies, Network Types (LAN, WAN and MAN), How Internet works, Major features of internet, Emails, FTP, Using the internet. [10 Hours]

UNIT-IIIProgramming Languages: Machine-, Assembly-, High Level- Language, Assembler, Compiler, Interpreter, debuggers, Programming fundamentals: problem definition, algorithms, flow charts and their symbols, introduction to compiler, interpreter, assembler, linker and loader and their inter relationship. [6 Hours]

UNIT-IV C Programming language: C fundamentals, formatted input/ output, expressions, selection statements, loops and their applications; Basic types, arrays, union, structure, functions, including recursive functions, program organization: local and external variables and scope, pointers & arrays. [6 Hours]

UNIT-VStrings: strings literals, string variables, I/O of strings, arrays of strings; applications. Structures, Unions and Enumerations: Structure variables and operations on structures; Structured types, nested array structures; unions; enumeration as integers, tags and types. Standard library: Input / output; streams, file operations, formatted I/O, character I/O, line I/O, block, string I/O, Library support for numbers and character data, error Handling: [10 Hours]

TEXT BOOKS: 1. Using Information Technology, 5th Edi, Brian K Williams & Stacey C. Sawyer, 2003, TMH

2. The C Programming Language by Dennis M Ritchie, Brian W. Kernigham, 1988, PHI.

3. C Programming – A modern approach by K.N. King, 1996, WW Norton & Co.

4. Fundamentals of Computing and C Programming, R. B. Patel, Tech Publications, New Delhi.

REFERENCE BOOKS: 1. Information technology, Dennis P. Curtin, Kim Foley, Kunal Sen, Cathleen Morin, 1998, TMH.

2. Theory and problem of programming with C, Byron C Gottfried, TMH.

3. Teach yourself all about computers by Barry Press and Marcia Press, 2000, IDG Books India.

4. Using Computers and Information by Jack B. Rochester, 1996, Que Education & Training.

Fundamentals of Computers & Problem Solving Using “C” (MCA-102P)

L T P Total Credits

0 0 4 2

List of Program:

1. WAP to add two numbers.2. WAP to swap two numbers.3. WAP to find simple interest.4. WAP to check no is odd/even.5. WAP to find greatest no. out of three numbers.6. WAP to find greatest & second greatest out of three numbers.7. WAP to find year is century/leap year or not.8. WAP to find grade with percentage.9. WAP to find income tax from total salary.10. WAP to print day of weeks using switch statement.11. WAP to print no of days of months using switch statement.12. WAP to print ‘n’ natural numbers using while loop.13. WAP to find number of digits in an integer using while loop.14. WAP to find reverse of an integer using while loop.15. WAP to check whether number is palindrome or not using while loop.16. WAP to find sum of an integer using do-while loop.17. WAP to use goto & continue statement18. WAP for linear search19. WAP for binary search20. WAP for bubble sort21. WAP to find addition of two matrices22. WAP to find multiplication of two matrices23. WAP to find transpose of a matrix24. WAP to find whether the matrix is symmetric or not25. WAP to print address using pointers26. WAP for structure

DATABASE SYSTEMS (MCA-103)

L T P Total Credits

4 0 0 4



UNIT- IBasic Concepts: File Systems vs. DMBS, Characteristics of the Data Base Approach, Abstraction and Data Integration, Database users, Advantages and Disadvantages of a DBMS. Data Base Systems Concepts and Architecture: Data Models, Schema and Instances, DBMS architecture and Data Independence, Data Base languages and Interfaces, DBMS functions and component modules. Entity Relationship Model: Entity Types, Entity Sets, Attributes & keys, Relationships, Relationships Types, Roles and Structural Constraints, Design issues, E-R Diagrams, Design of an E-R Database Schema, Reduction of an E-R schema to Tables. Relational Data Model: Relational model concepts, Integrity constraints over Relations, Relational Algebra – Basic Operations. [14 Hours]

UNIT- IISQL: DDL, DML, and DCL, views& Queries in SQL, Specifying Constraints & Indexes in SQL. Conventional Data Models: An overview of Network and Hierarchical Data Models. [5 Hours]

UNIT-IIIRelational Data Base Design: Functional Dependencies, Decomposition, Normal forms based on primary keys (1 NF, 2 NF, 3 NF, & BCNF), Multi-valued Dependencies, 4 NF, Join dependencies, 5 NF, Domain key normal form. [8 Hours]

UNIT-IVTransaction Processing Concepts: Introduction to Transaction Processing, Transaction & System Concepts, Properties of Transaction, Schedules and Recoverability, Serializability of Schedules. [5 Hours]

UNIT-VConcurrency Control Techniques: Locking Techniques, Time stamp ordering, Multi-version Techniques, Optimistic Techniques, Granularity of Data items. Recovery Techniques: Recovery concepts, Recovery Techniques in centralized DBMS. Data Base Security: Introduction to Data base Security issues.[8 Hours]

Text Books:

1. Elmasri & Navathe: Fundamentals of Database systems, 5th edition, Pearson Education.

2. Thomas Connolly Carolyn Begg: Database Systems, 3/e, Pearson Education.

Reference Books:

1. Korth & Silberschatz: Database System Concept, 4th Edition, McGraw Hill International Edition.

2. Database Systems: A practical Approach to Design, Implementation and Management, Pearson Education- 3e

3. C.J. Date: An Introduction to Data Bases Systems 7th Edition, Addison Wesley N. Delhi.

4. Bipin C. Desai: An Introduction to Database System, Galgotia Publication, N. Delhi.

5. Abbey, Abramson & Corey: Oracle 8i-A Beginner’s Guide, Tata McGraw Hill.

6. Ivan Bayross: SQL, PL/SQL- The Program Language of ORACLE, BPB Publication.

Discrete Mathematical Structure (MCA-104)

L T P Total Credit

3 1 0 3.5



UNIT –ISets: Definition, Representation of Set, Types of Sets, Set operations, Subset and Super Sets, Cardinality of Set, Cartesian Products of Two Sets, Principle of Mathematical Induction.

Relations: Binary Relation, Domain of Relation, Representation of Relation, Equivalence Relations,

Functions: Definition, Domain of Function, Co-Domain of a Function, Properties of Functions, Types of functions, Countable & Uncountable Sets, Pigeon-hole Principle, Composition of Functions. [12 Hours]

UNIT –IIGraph Theory: Graphs – Directed, Undirected, Simple. Adjacency & Incidence. Degree of Vertex, Sub graph, Complete graph, Cycle & Wheel Graph, Bipartite & Complete Bipartite Graph, Weighed Graph, and Union of Simple Graphs. Complete Graphs. Isomorphic Graphs, Path, Cycles & Circuits Euclerian & Hamiltonian Graphs. Planar Graph: Kuratowski’s Two Graphs, Euler’s Formula, Trees: Spanning trees, Finding Spanning Tree, Complexity of Graph, and Minimal Spanning Tree. [10 Hours]

UNIT –IIILatices and boolean algebra: Permutations and Combinations, Principle of Inclusion and Exclusion, Mathematical Logic, Partial Order Set, Bounding Elements, Lattices, Principle of Duality, Bounded, Distributed, and Complemented Lattices, Proposition and Propositional Calculus. [10 Hours]

UNIT –IVGroup: Definitions and Properties, Coset & Subgroup, Normal subgroup, Homomorphism of groups, Cyclic Group, Permutation Group. [5 Hours]

UNIT –VLanguage of Logic: Proposition, Compound Proposition, Conjunction, Disjunction, Implication, Converse, Bi-conditional Statements, tautology, Contradiction & Contingency, Logical Equivalences, Quantifiers, Arguments.

[5 Hours]Text Books:

1. Discrete Mathematical Structures with applications to Computer Science Author: J.P. Jrencbla and R. Manohar Publisher, Tata Mc-Graw Hill

2. Discrete Maths and its application, Author: Bhupinder singh Publisher, Tata Mc-GrawHill

Reference Books:

1. Olympia Nicodemy, “ Discrete Mathematics ”, Cbs Publisher, Delhi2. C. L. Liu, “Elements of Discrete Mathematics”, Tata Mcgrraw- Hill Publishing Company Limited, New Delhi.3. Bernard Kolman And Robert C. Busby, “Discrete Mathematical Structures For Computer Science”, rentice- Hall

Of India Pvt. Ltd., New Delhi.4. Kenneth G. Rosen, “Discrete Mathematics And Its Applications”, Mcgrraw- Hill International Editions,

Mathematics Series, New York.

Business Communication(ENG-701)

L T P Total Credits

3 0 0 3

Maximum Marks: 100 Time: 3 hours


Unit IINTRODUCTION :

Introduction and Principles of Communication: Meaning and Process, Barriers and Gateway in communication. Models of Communication: Linear and Non-Linear models, Murphy model, Thill and Bovee models and Berol’s model.

Unit IIWRITTEN COMMUNICATION :

Guidelines for Technical writing, Report writing, Preparation of Bibliography, Glossaries, Appendixes and Index. Proposal, Technical Articles, Memos, Advertisements, Editing and Proof Reading, Business Correspondence- types and layout.

Unit IIIPRESENTATION SKILLS : Elements of Presentation, designing a presentation, types of Visual aids, Appearance and Posture, Time Management, Practicing delivery of Presentation.

Unit IVEMPLOYMENT COMMUNICATION :

Resume Writing, Job Application Letter, Job Interview- Process, Stages, Types, Desirable Qualities and Tips. Negotiation Skill. Case Method: Understanding the case method, Types, Overcoming the difficulties of the case study. Communication Network: Internet, E-mail, Tele Conferencing, Video Conferencing.

Unit VGROUP COMMUNICATION :

Public Speaking: Choosing an appropriate Pattern, selecting an appropriate method. Meeting: Objectives, Planning, timing, venue of meeting. Media Management: Press Release, Press Conference, Seminars , Workshop.

SUGGESTED READINGS :

1. M.K. Sehgal & V. Khetrapal – Business Communication (Excel Books).2. Rajendra Pal – Business Communication (Sultanchand & Sons Publication).3. P.D. Chaturvedi – Busines Communication (Pearson Education, 1st Edition 2006).4. Lesikar RV & Pettit Jr. JD – Basic Business Communication : Theory & Application (Tata Mc Grow Hill, 10th Edition).

BUSINESS COMMUNICATION LAB(ENG-701 P)

a) Group Discussion

b) Just a minutes session: Speaking Extempore for one minutes on given topics

c) Reading aloud of newspaper headlines and important articles.

d) Improving pronunciation through tongue twisters.

e) Mannerism or Etiquette.

f) Mock Interview


MCA 1st Year / 2nd Semester





Theory

1 MCA-201Operating System &

Linux4 0 0 40 20 0 60 40 100 4

4 MCA-202/206 Elective* 3 0 0 30 15 0 45 30 75 3

2 MCA-203 Data Structure

Using C ++3 0 0 30 15 0 45 30 75 3

3 MCA-204 E-Commerce 3 1 0 40 20 0 60 40 100 3.5

4 MCA-205 Operation Research 3 1 0 40 20 0 60 40 100 3.5

PRACTICAL

2 MCA-202P/206P Elective* 0 0 4 15 15 10 25 2

2 MCA-203PData

Structure Using C ++

0 0 4 15 15 10 25 2

Total Credits 21

Elective Subjects List





Theory

MCA-202Information Technology and application

3 0 0 30 15 0 45 30 75 3

1

MCA-206

Microprocessor & Computer Architecture-8086

3 0 0 30 15 0 45 30 75 3

OPERATING SYSTEM & LINUX(MCA-201)

L T P Total Credits

4 0 0 4



UNIT-IIntroduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines. [5 Hours]

UNIT-IIProcess Management: Process concept, Process scheduling, Cooperating processes, Threads, Interprocess communication, CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation. [6 Hours]

UNIT-IIIProcess Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling. [9 Hours]

UNIT-IVStorage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with paging in MULTICS and Intel 386, Virtual Memory, Demand paging and its performance, Page replacement algorithms, Allocation of frames, Thrasing, Page Size and other considerations, Demand segmentation, File systems, secondary Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space management, Disk reliability. [10 Hours]

UNIT-VSecurity & Case Study: Protection and Security-Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program threats, System threats, Threat Monitoring, Encryption.

Windows NT- Design principles, System components, Environmental subsystems, File system, Networking and program interface,

Linux system - design principles, Kernel Modules, Process Management, Scheduling, Memory management, File Systems, Input and Output, Inter process communication, Network structure, security. [12 Hours]

REFERENCES BOOKS1. Abraham Siberschatz and Peter Baer Galvin, “Operating System Concepts”, Fifth Edition, Addison-Wesley 2. Milan Milankovic, “Operating Systems, Concepts and Design”, McGraw-Hill. 3. Harvey M Deital, "Operating Systems", Addison Wesley 4. Richard Peterson, “Linux: The Complete Reference”, Osborne McGraw-Hill.

INFORMATION TECHNOLOGY AND APPLICATIONS (MCA-202) * Elective

L T P Total Credits

3 0 0 3



UNIT-I

Essentials of Computer: Concept of data, information and data processing; Levels of information; Electronic data processing. Computer Processing System: Definition of computer, Generation of computers, classification of computers; Insights into a digital computer system; Advantages of computers. [8 Hours]

UNIT –II

Input/output devices: “Keyboard”, “Mouse”, MICR, digitizer, scanners, OCR, microphone, Impact and Non-impact printers, Dot-Matrix printers, Laser printers, Plotters, Monitors. Memory and Mass Storage Devices: characteristics of memory systems, Memory Hierarchy, Types of Memory-Primary, secondary and backup; RAM and ROM; Magnetic Disks-Characteristics, classification of magnetic disks; Optical disks, Magnetic Tapes.

[8 Hours]

UNIT –III

Software Concepts: Types of software and their role, Different system software types-operating systems, Translators, System utilities; concept of Application Packages; Os and Its types. Internet and Its Applications: History of Internet, benefits of Internet, H/W and S/W requirements for Internet, Applications of Internet, Internet Addressing, ISD Internet in India. Information Revolution and IT; [8 Hours]

UNIT -IV

MS-Word: Fundamentals of MS-Word, Features of MS-Word, Menus, Formatting and Standard Toolbars, Ruler, Scroll Bar, Creating Editing, Saving, export and import files, inserting and copying the files, Working with frames, Paragraph formatting, Columns, Pictures, Tables, Macros and Mail Merge. [8 Hours]

UNIT -V

MS-Excel: Applications of Spreadsheet; Advantages of in Spreadsheet; Features of Excel; Rows, Columns, Cell, Menus, Creating worksheet, Formatting, Printing, establishing worksheet links, Table creating and printing graphs, Macros, Using Built-m-functions. [8 Hours]

Text Book1. Semdler, Teach Yourself MS-Office, BPB Publications, Delhi.

Reference Books

2. Knight A.V. and Silk, D.J., Managing Information, McGraw Hill Book Company, New Delhi. 3. Bangla, R., Learning MS-Office, 2000, Khanna Book Publishing Co.(P) Ltd., Delhi.

Information Technology and Application (MCA-202P) * Elective

L T P Total Credits

0 0 4 2

Total Contact Hours: 17

Documentation Using MS-Word - Creating & Editing Document, Formatting Document, Auto-text, Autocorrect, Spelling and Grammar Tool, Document Dictionary, Page Formatting, Bookmark, Advance Features of MS-Word-Mail Merge, Macros, Tables, File Management, Printing, Styles, linking and embedding object, Template.Electronic Spread Sheet using MS-Excel - Creating & Editing Worksheet, Formatting and Essential Operations, Formulas and Functions, Charts, Advance features of Linking and Consolidation, Filtering, Table, Validation, Goal Seek, Scenario.Presentation using MS-PowerPoint: Presentations, Creating, Manipulating & Enhancing Slides, Organizational Charts, Excel Charts, Word Art, Layering art Objects, Animations and Sounds, Inserting Animated Pictures or Accessing through Object, Inserting Recorded Sound Effect or In-Built Sound Effect.

DATA STRUCTURES USING C++(MCA-203)

L T P Total Credits

3 0 0 3



UNIT- I

Introduction to OOP, C++ Class Overview - Class Definition, Objects, Class Members, Access Control, Class Scope, Constructors and destructors, parameter passing methods, Inline functions, static class members, this pointer, friend functions, dynamic memory allocation and de allocation (new and delete), exception handling.

[8 Hours]

UNIT- II

Functions Overloading, Operator Overloading, Generic Programming - Function and class templates, Inheritance basics, base and derived classes, inheritance types, base class access control, runtime polymorphism using virtual functions, abstract classes, streams I/O. [8 Hours]

UNIT- III

Review of basic data structures - the list ADT, stack ADT, queue ADT, implementation using template classes in C++, Dictionary- Hash table representation, hash functions, collision resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing. [8 Hours]

UNIT- IV

Trees : Binary search trees, definition, ADT, implementation, operations-searching, insertion and deletion, Tree Traversals, Balanced search trees- AVL trees, definition, height of an AVL tree, representation, operations-insertion, deletion and searching, B-Trees-B-Tree of order m, height of a B-Tree, insertion, deletion and searching. [8 Hours]

UNIT- V

Graphs : Representation of Graphs, Topological Sort, Shortest Path Algorithms-Dijkstra’s Algorithms, Depth First Search and Breadth First Search, Minimum spanning trees-Prim’s and Kruskal’s Algorithms. [8 Hours]

TEXT BOOKS:

1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education, 2nd edition.2. Object Oriented Programming with C++, E Balagurusamy, Mcgraw Hill Higher Education, 2nd edition

REFERENCE BOOKS:

1. Object Oriented Programming with C++, Subhash K U, Pearson.2. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D.Mount, 7th Edition Wiley student

edition, John Wiley and Sons.3. Data Structures and Algorithms in C++, 3rd Edition, Adam Drozdek, Thomson, C++, The Complete Reference, 4th

Edition, Herbert Schildt, TMH.

Data Structure Using C ++ (MCA-203P)

L T P Total Credits

0 0 4 2

List of Program:

1. Write a program to search an element in a two-dimensional array using linear search. 2. Using iteration & recursion concepts write programs for finding the element in the array using

Binary Search Method 3. Write a program to perform following operations on tables using functions only

(a) Addition (b) Subtraction (c) Multiplication (d) Transpose 4. Using iteration & recursion concepts write the programs for Quick Sort Technique 5. Write a program to implement the various operations on string such as length of string

concatenation, reverse of a string & copy of a string to another. 6. Write a program for swapping of two numbers using ‘call by value’ and ‘call by reference

strategies. 7. Write a program to implement binary search tree.

(Insertion and Deletion in Binary search Tree) 8. Write a program to create a linked list & perform operations such as insert, delete, update,

reverse in the link list 9. Write the program for implementation of a file and performing operations such as insert,

delete, update a record in the file. 10. Create a linked list and perform the following operations on it

(a) add a node (b) Delete a node 11. Write a program to simulate the various searching & sorting algorithms and compare their

timings for a list of 1000 elements. 12. Write a program to simulate the various graph traversing algorithms. 13. Write a program which simulates the various tree traversal algorithms.

E-COMMERCE(MCA-204)

L T P Total Credits

3 1 0 3.5



UNIT-1Introduction: Electronic Commerce - Technology and Prospects, Definition of E- Commerce, Economic potential of electronic commerce, Incentives for engaging in electronic commerce, forces behind E-Commerce, Advantages and Disadvantages, Architectural framework, Impact of E-commerce on business. Network Infrastructure for E-Commerce: Internet and Intranet based E-commerce- Issues, problems and prospects, Network Infrastructure, Network Access Equipments, Broadband telecommunication (ATM, ISDN, and FRAME RELAY). [10 Hours]

UNIT-IIMobile Commerce: Introduction, Wireless Application Protocol, WAP technology, Mobile Information device, Mobile Computing Applications. [5 Hours]

UNIT-IIIWeb Security: Security Issues on web, Importance of Firewall, components of Firewall, Transaction security, Emerging client server, Security Threats, Network Security, Factors to consider in Firewall design, Limitation of Firewalls. [5 Hours]

UNIT-IVEncryption: Encryption techniques, Symmetric Encryption- Keys and data encryption standard, Triple encryption, Asymmetric encryption- Secret key encryption, public and private pair key encryption, Digital Signatures, Virtual Private Network. [10 Hours]

UNIT-VElectronic Payments: Overview, The SET protocol, Payment Gateway, certificate, digital Tokens, Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based EPS, online Banking. EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies and Agenda. [10 Hours]

Reference Books:

1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addison Wesley. 2. Bajaj and Nag, “E-Commerce the cutting edge of Business”, TMH 3. P. Loshin, John Vacca, “Electronic commerce”, Firewall Media, New Delhi

OPERATION RESEARCH (MATH-205)

L T P Total Credits

3 1 0 3.5



UNIT- I Hyperplane and hyperspheres, Convex sets and their properties, convex functions. Linear Programming Problem (LPP): Formulation and examples, Feasible, Basic feasible and optimal solutions, Extreme points. Graphical Methods to solve L.P.P., Simplex Method, Charnes Big M Method, Two phase Method, Degeneracy, Unrestricted variables, unbounded solutions, Duality theory, Dual LPP, fundamental properties of Dual problems, Complementary slackness, Dual simplex algorithin, Sensivity analysis. [8 Hours]

UNIT-II

Integer programming: Gomory’s Method, Branch and Bound Method.Transportation Problem (TP): Mathematical formulation, Basic feasible solutions of T.Ps by North – West corner method, Least cost-Method, Vogel’s approximation method. Unbalanced TP, optimality test of Basic Feasible Solution (BFS) by U-V method, Stepping Stone method, degeneracy in TP. [8 Hours]

UNIT-III

Assignment Problem(AP): Mathematical formulation, assignment methods, Hungarian method, Unbalanced AP.Goal programming Problem (GPP): formulation of G.P. Graphical Goal attainment method,simplex method for GPP. [8 Hours]

UNIT-IV

Game theory: Two-person, zero-sum games, The maximin – minimax principle, pure strategies, mixed strategies, Graphical solution of 2xn and mx2 games, Dominance property, General solution of m x n rectangular games, Linear programming problem of GP. [8 Hours]

UNIT-VNetwork Techniques: Shortest path model, Dijkastra algorithm, Floyd’s algorithm, Minimal Spanning tree, Maximal flow problem. [8 Hours]

Text Books:1. S.D. Sharma, Operations Research, Kedar Nath Ram Nath & Co. 14th Edition 2004.2. Kanti Swarup, P.K. Gupta and Manmohan, Operations Research, Sultan Chand & Sons 12th Edition,

2004.3. R. Panneerselvam, Operations Research, Prentice Hall of India Pvt. Ltd., 2004.

Reference Books:1. G. Hadley, Linear Programming, Narosa Publishing House (2002).2. H.A. Taha, Operations Research: An Introduction, Prentice Hall of India Pvt. Ltd., 7th Edition, 2004.

MICROPROCESSOR & COMPUTER ARCHITECTURE - 8086(MCA-206)*Elective

L T P Total Credits

3 0 0 3

Total Contact Hours : 40Maximum Marks: 100 Time: 3 hours


UNIT – IMicroprocessor and Its Architecture: Internal microprocessor architecture, real mode memory addressing, protected memory addressing, memory paging. Data, Program Memory and Stack Memory addressing modes.

[8 Hours]

UNIT – II 8086/8088 Microprocessors – pinouts and pin functions, clock generator (8284A), Bus buffering and latching, Bus timing, ready and wait state, minimum and maximum mode.

[8 Hours]

UNIT – IIIMemory Interface: Memory Devices, Address Decoding, 8-bit, 16-bit, 32-bit and 64-bit memory interfaces, Dynamic RAM. Basic I/O Interface: I/O Interface, I/O Port Address Decoding, Programmable Peripheral Interface, 8279 Programmable Keyboard/Display Interface, 8254 Programmable Interval Timer, 16550 Programmable Communication Interface, RS232C, SCSI adapter.

[8 Hours]

UNIT – IVInterrupts: Basic Interrupt Processing, Hardware Interrupts, Expanding the Interrupt Structure, 8259A Programmable Interrupt Controller.

[8 Hours]

UNIT – VDirect Memory Access (DMA): Basic DMA Operations, 8237 DMA Controller, Shared Bus Operations. Bus Interface: ISA, EISA, VESA Buses, PCI, USB Bus.386, 486, Pentium, Pentium Pro Microprocessors and Pentium IV: Register Configuration &Memory Management, Introduction to Core 2 Duo & Quadcore Processors.

[8 Hours]

Text Books:

1. The Intel Microprocessors 8086/8088, 80186/80188,80286, 80386, 80486, Pentium, Pentium Pro Processors, Pentium II, Pentium III, Pentium 4 and Core2 with 64-bit Extensions: Architecture, Programming and Interfacing, Barry B. Brey, 8th Edition, PearsonEducation-2009.

Reference Books:

2. The 80386, 80486, and Pentium Processors: Hardware, Software, and Interfacing, Walter Tribel, Prentice Hall, 1998, ISBN #0-13-533225-7

3. Microcomputer Systems: Architecture, Programming, and Design. By Liu and Gibson (PHI)

Microprocessor & Computer Architecture-8086 (MCA-206P)*Elective

L T P Total Credits

0 0 4 2

List of Programs

1. Program for 16-bit Addition & Subtraction in 8086 Microprocessor kit.

2. Program for 16-bit Division & Multiplication in 8086 Microprocessor kit.

3. Program for Ascending order and Descending order in 8086 Microprocessor kit.

4. Program for String copy.

5. Program for Reverse the String.

6. Program for Searching an Element.

7. Program for File Manipulation in 8086 Microprocessor kit.

8. Interfacing of Stepper Motor controller using 8086 Microprocessor kit.

9. Interfacing of Keyboard / Display (8279) using Microprocessor kit.

10. Interfacing of ADC with 8086 Microprocessor kit.

11. Interfacing of DAC with 8086 Microprocessor kit.

12. Interfacing of Timer with 8086 Microprocessor kit.


MCA 2nd Year / 3rd Semester





Theory

MCA-301Management Information

Systems4 0 0 40 20 0 60 40 100 4

2 MCA-302 Internet & Java Programming 3 0 0 30 15 0 45 30 75 3

3 MCA-303 ERP Systems 4 0 0 40 20 0 60 40 100 4

4 MCA-304/306 Elective 3 0 0 30 15 0 45 30 75 3

5 MCA-305 Software Engineering 4 0 0 40 20 0 60 40 100 4

PRACTICAL

1 MCA-304P/306P Elective 1 0 0 4 15 15 10 25 2

2 MCA-302P Internet & Java Programming 0 0 4 15 15 10 25 2

Total Credits 22




Max. MarksCreditsSr. No. Code Title

MSE CA P Total ESE Marks Credits

Theory

MCA-304 Computer Networks 3 0 0 30 15 0 45 30 75 31

(Elective-1)

MCA-306 Cryptography & Network Security 3 0 0 30 15 0 45 30 75 3

MANAGEMENT INFORMATION SYSTEMS(MCA-301)

L T P Total Credits

4 0 0 4



UNIT- IFoundation of Information Systems: Introduction to system and Basic System Concepts, Types of Systems, The Systems Approach, Information System: Definition & Characteristics, Types of information, Role of Information in Decision-Making, Sub-Systems of an Information system: EDP and MIS management levels, EDP/MIS/DSS. Solving business problems with information systems. [9 Hours]

UNIT- IIAn overview of Management Information Systems: Definition of a management information system, MIS versus Data processing, MIS & Decision Support Systems, MIS & Information Resources Management, End user computing, Concept of an MIS, Structure of a Management information system.

Model of decision-Making, Structured Vs Un-structured decisions, Formal vs. Informal systems. [9 Hours]

UNIT- IIIDeveloping Information Systems: Analysis & Design of Information Systems: Implementation & Evaluation, Pitfalls in MIS Development.

Concepts of planning & control: Concept of organizational planning, The Planning Process, Computational support for planning, Characteristics of control process, The nature of control in an organization. [8 Hours]

UNIT- IVFunctional MIS: A Study of Personnel, Financial and production MIS, Introduction to e-business systems, ecommerce – technologies, applications,

Business applications of information technology: Internet & electronic commerce, Intranet, Extranet & Enterprise Solutions, Information System for Business Operations. [8 Hours]

UNIT- VDecision support systems – support systems for planning, control and decision-making.

Managing Information Technology: Enterprise & global management, Security & Ethical challenges, Planning & Implementing changes. [8 Hours]

Text Books:1. Brian, “Management Information System”, TMH 2. Gordon B. Davis & Margrethe H. Olson, “Management Information System”, TMH.

Reference Books: 1. Brian, “Introduction to Information System”, MCGRAW HILL.2. Murdick, “Information System for Modern Management”, PHI.

INTERNET & JAVA PROGRAMMING(MCA-302)

L T P Total Credits

3 0 0 3



UNIT-1Internet: Internet, Connecting to Internet: Telephone, Cable, Satellite connection, Choosing an ISP, Introduction to Internet services, E-Mail concepts, Sending and Receiving secure E-Mail, Voice and Video Conferencing.

[6 hours]

UNIT- IICore Java: Introduction, Operator, Data type, Variable, Arrays, Control Statements, Methods & Classes, Inheritance, Package and Interface, Exception Handling, Multithread programming, I/O, Java Applet, String handling, Networking, Event handling, Introduction to AWT, AWT controls, Layout managers, Menus, Images, Graphics. [8 hours]

UNIT-IIIJava Swing: Creating a Swing Applet and Application, Programming using Panes, Pluggable Look and feel, Labels, Text fields, Buttons, Toggle buttons, Checkboxes, Radio Buttons, View ports, Scroll Panes, Scroll Bars, Lists, Combo box, Progress Bar, Menus and Toolbars, Layered Panes, Tabbed Panes, Split Panes, Layouts, Windows, Dialog Boxes, Inner frame. JDBC: The connectivity Model, JDBC/ODBC Bridge, java.sql package, connectivity to remote database, navigating through multiple rows retrieved from a database. [10 hours]

UNIT-IVJava Beans: Application Builder tools, The bean developer kit(BDK), JAR files, Introspection, Developing a simple bean, using Bound properties, The Java Beans API, Session Beans, Entity Beans, Introduction to Enterprise Java beans (EJB), Introduction to RMI (Remote Method Invocation): A simple client-server application using RMI. [10 hours]

UNIT-VJava Servlets: Servlet basics, Servlet API basic, Life cycle of a Servlet, Running Servlet, Debugging Servlets, Thread-safe Servlets, HTTP Redirects, Cookies, Introduction to Java Server pages (JSP). [6 hours]

References: 1. Margaret Levine Young, “The Complete Reference Internet”, TMH

2. Naughton, Schildt, “The Complete Reference JAVA2”, TMH

3. Balagurusamy E, “Programming in JAVA”, TMH

4. Dustin R. Callway, “Inside Servlets”, Addison Wesley

5. Mark Wutica, “Java Enterprise Edition”, QUE

Internet & Java Programming (MCA-302P)

L T P Total Credits

0 0 4 2


List of Experiments:

1. Write a program in Java for illustrating, overloading, over riding and various forms of inheritance.

2. Write programs to create packages and multiple threads in Java. 3. Write programs in Java for event handling Mouse and Keyboard events. 4. Using Layout Manager create different applications. 5. Write programs in Java to create and manipulate Text Area, Canvas, Scroll Bars,

Frames and Menus using swing/AWT. 6. Using Java creates Applets. 7. Use Java Language for Client Server Interaction with stream socket connections. 8. Write a program in java to read data from disk file.

ERP SYSTEMS(MCA-303)

L T P Total Credits

4 0 0 4



Unit-I

Enterprise wide information system, Custom built and packaged approaches, Needs and Evolution of ERP Systems, Common myths and evolving realities, ERP and Related Technologies, Business Process Reengineering and Information Technology, Supply Chain Management, Relevance to Data Warehousing, Data Mining and OLAP, ERP Drivers, Decision support system.

Unit-II

ERP Domain, ERP Benefits classification, Present global and Indian market scenario, milestones and pitfalls, Forecast, Market players and profiles, Evaluation criterion for ERP product, ERP Life Cycle: Adoption decision, Acquisition, Implementation, Use & Maintenance, Evolution and Retirement phases, ERP Modules.

Unit- III

Framework for evaluating ERP acquisition, Analytical Hierarchy Processes (AHP), Applications of AHP in evaluating ERP, Selection of Weights, Role of consultants, vendors and users in ERP implementation; Implementation vendors evaluation criterion, ERP Implementation approaches and methodology, ERP implementation strategies, ERP Customization, ERP-A manufacturing Perspective.

Unit- IV

Critical success and failure factors for implementation, Model for improving ERP effectiveness, ROI of ERP implementation, Hidden costs, ERP success inhibitors and accelerators, Management concern for ERP success, Strategic Grid: Useful guidelines for ERP Implementations.

Unit- V

Technologies in ERP Systems and Extended ERP, Case Studies Development and Analysis of ERP Implementations in focusing the various issues discussed in above units through Soft System approaches or qualitative Analysis tools, Learning and Emerging Issues, ERP and E-Commerce.

References:

1. Lexis Leon, “Enterprise Resource Planning”, TMH2. Brady, Manu, Wegner, “ Enterprise Resource Planning”, TMH

COMPUTER NETWORKS (MCA-304) * Elective

L T P Total Credits

3 0 0 3



UNIT-IIntroductory Concepts: Goals and Applications of Networks, Network structure and architecture, the OSI reference model, services, networks topology, Physical Layer- transmission, switching methods, Integrated services digital networks, terminal handling. [8 hours]

UNIT-IIMedium access sub layer: Channel allocations, LAN protocols, ALOHA Protocols- Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision Detection, Collision free Protocols, IEEE standards, Ethernet, FDDI, Data Link Layer- basic design issues, error correction & detection algorithms, elementary data link layer protocols, sliding window protocols, error handling, High Level Data Link Control.

[10 hours]

UNIT-IIINetwork Layer: Point-to Point networks, concept of virtual circuit and LAN, routing algorithms, congestion control algorithms, internetworking, TCP/IP protocol, IP addresses, IPv6. [6 hours]

UNIT-IVTransport Layer: Design issues, connection management, Internet Transport Protocol (UDP), Ethernet transport Protocol, Transmission Control Protocol. (TCP). [6 hours]

UNIT-VApplication Layer: Domain Name System, Simple Network Management Protocol, Electronic mail, File Transfer Protocol, Hyper Text Transfer Protocol, Introduction to Cryptography and Network Security (DES, RSA algorithms), Communication Security (IPSec, Firewalls), Authentication protocols such as authentication based on shared key (Diffie Helleman Key exchanger), Introduction to multimedia and compression Techniques.

[10 hours]

Text Book:1. Computer Networks by A. S Tanenbaum, 4th Edition”, Pearson education

References:1. Data and Computer Communication by W. Stallings, Macmillan Press 2. Computer Networks & Internet with Internet Applications by Comer Pearson Education 3. Internetworking with TCP/IP by PHI

COMPUTER NETWORKS (MCA-304P)* Elective

L T P Total Credits

0 0 4 2


List of Experiments:

1. Program to set up a dialup connection for Internet access.2. Study of ISO OSI reference model.3. Program to set up a Broadband connection.4. Details of switches, its configuration, specifications and various product and different

manufacturers5. Design of a network for a computer lab.6. Study of wireless networks7. Study of various internet providers along with the present plans available for different type of

customers.8. Creating network cable using crimping tool.9. Program to simulate OSI model10.10 Study of TCP/IP

CRYPTOGRAPHY AND NETWORK SECURITY(MCA-306) * Elective

L T P Total Credits

3 0 4 5



Unit-I

Introduction to Cryptography: Introduction To Security: Attacks, Services & Mechanisms, Security, Attacks, And Security Services. Conventional Encryption: Classical Techniques, Conventional Encryption Model, and Steganography, Classical Encryption Techniques. Modern Techniques: Simplified DES, Block Cipher Principles, DES Standard, DES Strength, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes of Operation.

Unit-II

Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS, CAST-128, RC2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement Of Encryption Function.

Unit-III

Public Key Encryption: Public-Key Cryptography: Principles Of Public-Key Cryptosystems, RSA Algorithm, Key Management, Fermat’s & Euler’s Theorm, Primality, The Chinese Remainder Theorem.

Unit-IV

Hash Functions: Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Birthday Attacks, Security Of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signatures, Authentication Protocol, Digital Signature Standard (DSS), Proof Of Digital Signature Algorithm.

Unit-V

Network & System Security: Authentication Applications: Kerberos X.509, Directory Authentication Service, Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime, Security: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations, Key Management. Web Security: Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction (Set), System Security: Intruders, Viruses, Firewall Design Principles, Trusted Systems.

Text Book:

1. William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall, New Jersey.

Reference Books:

1. Johannes A. Buchmann, “Introduction to cryptography”, Springer- Verlag. 2. Atul Kahate, “Cryptography and Network Security”, TMH

SOFTWARE ENGINEERING(MCA-305)

L T P Total Credits

4 0 0 4

Total Contact Hours: 42Maximum Marks: 100 Time: 3 hoursNote: Examiner will be required to set the question paper in three sections. Section A (compulsory) will contain question no 1 with 15 sub questions and all the sub questions carrying weightage of 2 marks.Section B will contain question no 2. Each question will have 8 sub questions and candidate will attempt any 5 questions weightage of 8 marks. Section C will contain question no 3. Each question will have four sub questions and candidates will attempt any 2 questions from each question carrying weightage of 15 marks.

UNIT-IIntroduction: Introduction to Software Engineering, Software Components, Software Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences from Conventional Engineering Processes, Software Quality Attributes. Software Development Life Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary Development Models, Iterative Enhancement Models. [8 hours]

UNIT-IISoftware Requirement Specifications (SRS): Requirement Engineering Process: Elicitation, Analysis, Documentation, Review and Management of User Needs, Feasibility Study, Information Modeling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS Document, IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA Plans, Software Quality Frameworks, ISO 9000 Models, SEI-CMM Model. [8 hours]

UNIT-IIISoftware Design: Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down and Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures: Halestead’s Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity Measures: Control Flow Graphs. [8 hours]

UNIT-IVSoftware Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression Testing, Testing for Functionality and Testing for Performance, Top-Down and Bottom-Up Testing. Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing), Functional Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of Products. Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code Inspection, Compliance with Design and Coding Standards.[9 hours]

UNIT-VSoftware Maintenance and Software Project Management : Software as an Evolutionary Entity, Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, Software Re-Engineering, Reverse Engineering. Software Configuration Management Activities, Change Control Process, Software Version Control, An Overview of CASE Tools. Estimation of Various. Parameters such as Cost, Efforts, Schedule/Duration, Constructive Cost Models (COCOMO), Resource Allocation Models, Software Risk Analysis and Management. [9 hours]

Text Book:1. Pankaj Jalote, Software Engineering, Wiley

References:1. R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers.4. Carlo Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI Publication.5. Ian Sommerville, Software Engineering, Addison Wesley.6. Pfleeger, Software Engineering, Macmillan Publication.


MCA 2nd Year / 4th Semester





Theory

1 MCA-401 Design & Analysis of Algorithms 4 1 0 40 20 0 60 40 100 4.5

2 MCA-402 Mobile Computing 4 1 0 40 20 0 60 40 100 4.5

3 MCA -403 WEB Technology 3 0 0 30 15 0 45 30 75 3

4 MCA-404/406 Elective-1 3 0 0 30 15 0 45 30 75 3

5 MCA-405/407 Elective-2 4 0 0 40 20 0 60 40 100 4





MSE CA P Total ESE Marks Cred

itsTheory

MCA-404 Dot Net Framework& C# 3 0 0 30 15 0 45 30 75 3

2 Elective-1) MCA-406 Data Compression 3 0 0 30 15 0 45 30 75 3

MCA-405 Computer Graphics &Animation 4 0 0 40 20 0 60 40 100 43

Elective-2) MCA-407 Compiler Design 4 0 0 40 20 0 60 40 100 4

PRACTICAL

1 MCA-451P Mini Project 0 0 8 0 0 0 0 25 25 2

2 MCA -403P WEB Technology 0 0 2 0 0 15 15 10 25 1

3 MCA-404P/406P Elective-1 0 0 2 0 0 15 15 10 25 1

Total Credits 23

DESIGN AND ANALYSIS OF ALGORITHMS (MCA-401)

L T P Total Credits

4 1 0 4.5


UNIT-IIntroduction: Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity of Algorithms, Asymptotic Notations, Growth of function, Recurrences and their solution methods. Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort. Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort, Medians and order statistics. [10 hours]

UNIT-IIAdvanced Data Structure: Red Black Trees, Augmenting Data Structure, Binomial Heap, B-Tree, Fibonacci Heap, and Data Structure for Disjoint Sets, All kinds of Algorithms on these data structures, Dictionaries and priority Queues, mergeable heaps, concatenable queues. [9 hours]

UNIT-IIIAdvanced Design and Analysis Techniques: Dynamic programming, Greedy Algorithm, Backtracking, Branch-and-Bound, Amortized Analysis. [6 hours]

UNIT-IVGraph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth First Search, Minimum Spanning Tree, Kruskal’s Algorithms, Prim’s Algorithms, Single Source Shortest Path, All pair Shortest Path, Maximum flow and Traveling Salesman Problem. [6 hours]

UNIT-VRandomized Algorithms, String Matching, NP-Hard and NP-Completeness, Approximation Algorithms, Sorting Network, Matrix Operations, Polynomials and FFT, Number Theoretic Algorithms. [9 hours]

References:

1. Design and Analysis of Computer Algorithms, Aho, Pearson Education Pub. 2. Fundamentals of Computer Algorithms by Horowitz and Sahani, Galgotia 3. Introduction to Algorithms by Thomas H Cormen Leiserson et al, PHI 4. Computer Algorithms: Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Pearson

Education 5. Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education 6. Fundamental of Algorithms by Brassard Bratley, PHI 7. Algorithms Design by M T Goodrich et al, John Wiley 8. The Design and analysis of Algorithms by A V Aho et al, Pearson Education

MOBILE COMPUTING(MCA-402)

L T P Total Credits

4 1 0 4.5


UNIT – IIntroduction, issues in mobile computing, overview of wireless telephony: cellular concept, GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical, handoffs, channel allocation in cellular systems, CDMA, GPRS. [8 hours]

UNIT – II

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, Wireless multiple access protocols, TCP over wireless, Wireless applications, data broadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment, applications. [10 hours]

UNIT – III

Data management issues, data replication for mobile computers, adaptive clustering for mobile wireless networks, File system, Disconnected operations. [6 hours]

UNIT – IV

Mobile Agents computing, security and fault tolerance, transaction processing in mobile computing environment.[6 hours]

UNIT – V

Adhoc networks, localization, MAC issues, Routing protocols, global state routing (GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance vector routing (AODV), Temporary ordered routing algorithm (TORA), QoS in Ad Hoc Networks, applications. [10 hours]

References:1. J. Schiller, Mobile Communications, Addison Wesley.2. Charles Perkins, Mobile IP, Addison Wesley.3. Charles Perkins, Ad hoc Networks, Addison Wesley.4. Upadhyaya, “Mobile Computing”, Springer

WEB TECHNOLOGY(MCA-403)

L T P Total Credits

3 0 2 4


UNIT IIntroduction: Introduction to web, protocols governing the web, web development strategies, Web applications, web project, web team. [6 hours]

UNIT IIWeb Page Designing: HTML: list, table, images, frames, forms, CSS; XML: DTD, XML schemes, presenting and using XML. [6 hours]

UNIT III Scripting: Java script: Introduction, documents, forms, statements, functions, objects; event and event handling; introduction to AJAX, VB Script. [8 hours]

UNIT IVServer Site Programming: Introduction to active server pages (ASP),ASP.NET, java server pages (JSP), JSP application design, tomcat server, JSP objects, declaring variables, and methods, debugging, sharing data between JSP pages, Session, Application: data base action , development of java beans in JSP, introduction to COM/DCOM. [10 hours]

UNIT VPHP (Hypertext Preprocessor): Introduction, syntax, variables, strings, operators, if-else, loop, switch, array, function, form ,mail, file upload, session, error, exception, filter, PHP-ODBC. [10 hours]

References:

1. Xavier, C, “ Web Technology and Design” , New Age International2. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication.3. Ramesh Bangia, “Internet and Web Design” , New Age International4. Bhave, “Programming with Java”, Pearson Education

DOT NET FRAMEWORK AND C# (MCA-404) * Elective-1

L T P Total Credits

3 0 2 4


UNIT-1

The .Net framework: Introduction, The Origin of .Net Technology, Common Language Runtime (CLR), Common Type System (CTS), Common Language Specification (CLS), Microsoft Intermediate Language (MSIL), Just-In –Time Compilation, Framework Base Classes. [10 hours]

UNIT-II

C -Sharp Language (C#): Introduction, Data Types, Identifiers, Variables, Constants, Literals, Array and Strings, Object and Classes, Inheritance and Polymorphism, Operator Overloading, Interfaces, Delegates and Events. Type conversion. [10 hours]

UNIT-III

C# Using Libraries: Namespace- System, Input-Output, Multi-Threading, Networking and sockets, Managing Console I/O Operations, Windows Forms, Error Handling. [5 hours]

UNIT-IV

Advanced Features Using C#: Web Services, Window Services, Asp.net Web Form Controls, ADO.Net. Distributed Application in C#, Unsafe Mode, Graphical Device interface with C#. [10 hours]

UNIT-V

.Net Assemblies and Attribute: .Net Assemblies features and structure, private and share assemblies, Built-In attribute and custom attribute. Introduction about generic. [5 hours]

References:

1. Wiley,” Beginning Visual C# 2008”,Wrox2. Fergal Grimes,” Microsoft .Net for Programmers”. (SPI)3. Balagurusamy,” Programming with C#”, (TMH)4. Mark Michaelis, “Essential C# 3.0: For .NET Framework 3.5, 2/e, Pearson Education5. Shibi Parikkar, “ C# with .Net Frame Work” , Firewall Media.

DATA COMPRESSION (MCA-406) * Elective-1

L T P Total Credits

3 0 2 4


Unit-I

Introduction: Compression Techniques: Loss less compression, Lossy compression, Measures of performance, Modeling and coding. Mathematical Preliminaries for Lossless compression: A brief introduction to information theory: - Models: -Physical models, Probability models, Markov models, composite source model, Coding? - Uniquely decodable codes, Prefix codes.

Unit-II

Huffman coding: The Huffman coding algorithm, minimum variance Huffman codes, length of Huffman codes, extended Huffman codes, non binary Huffman codes, Adaptive Huffman codes: Update procedure, Encoding procedure, decoding procedure, Golomb codes, Rice codes, Tunstall codes, Applications: loss less image compression, Text compression and Audio compression.

Unit-III

Arithmetic coding: Coding a sequence, generating a binary code, Comparison of Huffman and Arithmetic coding, Application: Bi –level image compression -The JBIG standard, JBIG2 Image compression, Dictionary Techniques:-Introduction, Static Dictionary: Diagram Coding, Adaptive dictionary: The LZ77 Approach, The LZ78 approach, Applications: File Compression-UNIX compress, Image compression: - The Graphics interchange Format (GIF), Predictive Coding: -Prediction with partial match (PPM): The basic algorithms, The ESCAPE SYMBOL, length of context, The Exclusion Principle, The Burrows-Wheeler Transform: Move-to-front coding, CALIC, JPEG-LS, Multiresolution Approaches, facsimile Encoding, Dynamic Markov Compression.

Unit-IV

Mathematical Preliminaries for Lossy Coding: -Distortion criteria, Models. Scalar Quantization, the Quantization problem, Uniform Quantization, adaptive Quantization, Non uniform Quantization.

Unit-V

Vector Quantization: Advantages of Vector Quantization over Scalar Quantization, The linde-Buzo-Gray algorithm, Tree stuctured Vector quantzers, Structured Vector Quantizers.

Text Book: Khalid Sayood, "Introduction to Data Compression", Morgan Kaufmann Publications.

Reference Book:Ralf Steinmetx and Klara Nahrstedt, “Multimedia Computing and communication and applications”, Prentice Hall

COMPUTER GRAPHICS AND ANIMATION (MCA- 405)* Elective-2

L T P Total Credits

4 0 0 4


UNIT – I

Introduction and Line Generation: Types of computer graphics, Graphic Displays- Random scan displays, Raster scan displays, Frame buffer and video controller, Points and lines, Line drawing algorithms, Circle generating algorithms, Mid point circle generating algorithm, and parallel version of these algorithms.[9 hours]

UNIT – II

Transformations: Basic transformation, Matrix representations and homogenous coordinates, Composite transformations, Reflections and shearing. Windowing and Clipping: Viewing pipeline, Viewing transformations, 2-D Clipping algorithms- Line clipping algorithms such as Cohen Sutherland line clipping algorithm, Liang Barsky algorithm, Line clipping against non rectangular clip windows; Polygon clipping –Sutherland Hodgeman polygon clipping, Weiler and Atherton polygon clipping, Curve clipping, Text clipping. [12 hours]

UNIT – III

Three Dimensional: 3-D geometric primitives, 3-D Object representation, 3-D Transformation, 3-D viewing, projections, 3-D Clipping. [5 hours]

UNIT – IV

Curves and Surfaces: Quadric surfaces, Spheres, Ellipsoid, Blobby objects, introductory concepts of Spline, Bspline and Bezier curves and surfaces.Hidden Lines and Surfaces: Back Face Detection algorithm, Depth buffer method, A- buffer method, Scan line method, basic illumination models – Ambient light, Diffuse reflection, Specular reflection and Phong model, Combined approach, Warn model, Intensity Attenuation, Color consideration, Transparency and Shadows.

[10 hours]

UNIT – V

Computer Animations : Conventional and computer assisted animation, design of animation sequences, interpolation, simple animation effects, animation languages ( Key Frame System, Parameterized systems), motion specifications, methods of controlling animation. [6 hours]

References:1. Donald Hearn and M Pauline Baker, “Computer Graphics C Version”, Pearson Education2. Amrendra N Sinha and Arun D Udai,” Computer Graphics”, TMH3. Donald Hearn and M Pauline Baker, “ Computer Graphics with OpenGL”, Pearson education4. Steven Harrington, “Computer Graphics: A Programming Approach”, PHI or TMH5. James D Foley, A V Dam, S K Feiner and John f Hughes, “Computer Graphics Principles and Practice”

2nd Ed. in C.

COMPILER DESIGN (MCA-407) * Elective-2

L T P Total Credits

4 0 0 4


Unit-1

Compiler Structure: Compilers and Translators, Various Phases of Compiler, Pass Structure of Compiler, Bootstrapping of CompilerProgramming Languages: High level languages, The lexical and syntactic structure of a language, Data elements, Data Structure, Operations, Assignments, Program unit, Data Environments, Parameter Transmission.Lexical Analysis: The role of Lexical Analyzer, A simple approach to the design of Lexical Analyzer, Regular Expressions, Transition Diagrams, Finite state Machines, Implementation of Lexical Analyzer, Lexical Analyzer Generator: LEX, Capabilities of Lexical Analyzer

Unit-II

The Syntactic Specification of Programming Languages: CFG, Derivation and Parse tree, Ambiguity, Capabilities of CFG.Basic Parsing Techniques: Top-Down parsers with backtracking, Recursive Descent Parsers, Predictive Parsers, Bottom–up Parsers, Shift-Reduce Parsing, Operator Precedence Parsers, LR parsers (SLR, Canonical LR, LALR) Syntax Analyzer Generator: YACC

Unit-III

Intermediate Code Generation: Different Intermediate forms: three address code, Quadruples & Triples. Syntax Directed translation mechanism and attributed definition.Translation of Declaration, Assignment, Control flow, Boolean expression, Array References in arithmetic expressions, procedure calls, case statements, postfix translation.

Unit-IV

Run Time Memory Management: Static and Dynamic storage allocation, stack based memory allocation schemes, Symbol Table managementError Detection and Recovery: Lexical phase errors, Syntactic phase errors, Semantic errors.

Unit-V

Code Optimization and Code Generation: Local optimization, Loop optimization, Peephole optimization, Basic blocks and flow graphs, DAG, Data flow analyzer, Machine Model, Order of evaluation, Register allocation and code selection

References:

1. Alfred V Aho , Jeffrey D. Ullman, “Principles of Compiler Design”, Narosa 2. A.V. Aho, R. Sethi and J.D Ullman, “Compiler: principle, Techniques and Tools”, AW 3. H.C. Holub “Compiler Design in C”, Prentice Hall Inc. 4. Apple, “Modern Computer Implementation in C: Basic Design”, Cambridge press


MCA 3rd Year / 5th Semester





Theory

1 MCA-501/506 Elective-1 4 0 0 40 20 0 60 40 100 4

2 MCA-502 Artificial Intelligence 4 0 0 40 20 0 60 40 100 4

4 MCA-503 Advance Database Management Systems 3 0 0 30 15 0 45 30 75 3

3 MCA-504/507 Elective-2 4 0 0 40 20 0 60 40 100 4

5 MCA-505/508 Elective-3 3 0 0 30 15 0 45 30 75 3

PRACTICAL

1 MCA-503P Advance Database Management Systems 0 0 4 15 15 10 25 2

2 MCA-505P/507P Elective-3 0 0 4 15 15 10 25 2

Total Credits 22





MSE CA P Total ESE Marks CreditsTheory

MCA-501

Data Mining & Warehousing 4 0 0 40 20 0 60 40 100 4

1(Elective-1) MCA-

506 Simulation and Modeling 4 0 0 40 20 0 60 40 100 4

MCA-504 Real Time Systems 4 0 0 40 20 0 60 40 100 4

1(Elective-2) MCA-

507Theory of Computation and formal language 4 0 0 40 20 0 60 40 100 4

MCA-505 Client Server Computing 3 0 0 30 15 0 45 30 75 3

1(Elective-3) MCA-

508 Neural Networks 3 0 0 30 15 0 45 30 75 3

Data Mining & Warehousing(MCA-501)* Elective-1

L T P Total Credits

4 0 0 4


Unit – I

Dss-Uses, definition, Operational Database. Introduction to DATA Warehousing. Data-Mart, Concept of Data-Warehousing, Multi Dimensional Database Structures. Client/Server Computing Model & Data Warehousing. Parallel Processors & Cluster Systems. Distributed DBMS implementations.

Unit – II

DATA Warehousing. Data Warehousing Components. Building a Data Warehouse. Warehouse Database. Mapping the Data Warehouse to a Multiprocessor Architecture. DBMS Schemas for Decision Support. Data Extraction, Cleanup & Transformation Tools. Metadata.

Unit – III

Business Analysis. Reporting & Query Tools & Applications. On line Analytical Processing(OLAP). Patterns & Models. Statistics. Artificial Intelligence.

Unit – IV

Knowledge Discovery, Data Mining. Introduction to Data-Mining. Techniques of Data-Mining. Decision Trees. Neural Networks. Nearest Neighbor & Clustering. Genetic Algorithms. Rule Introduction. Selecting & Using the Right Technique.

Unit – V

Multimedia Data-Mining, Multimedia-Databases, Mining Multimedia Data, Data-Mining and the World Wide Web, Web Data-Mining, Mining and Meta-Data. Data Visualization & Overall Perspective. Data Visualization. Applications of Data-Mining.

References:

1. Berson, “Data Warehousing, Data-Mining & OLAP”, TMH 2. Mallach, “Decision Support and Data Warehousing System”, TMH 3. Bhavani Thura-is-ingham, “Data-Mining Technologies, Techniques Tools & Trends”, CRC Press 4. Navathe, “Fundamental of Database System”, Pearson Education 5. Margaret H. Dunham, “Data-Mining. Introductory & Advanced Topics”, Pearson Education 6. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education

SIMULATION AND MODELING(MCA-506)* Elective-1

L T P Total Credits

4 0 0 4


UNIT-1

System definition and components, stochastic activities, continuous and discrete systems, system modeling, types of models, static and dynamic physical models, static and dynamic mathematical models, full corporate model, types of system study. [6 hours]

UNIT-II

System simulation, why & when to simulate, nature and techniques of simulation, comparison of simulation and analytical methods, types of system simulation, real time simulation, hybrid simulation, simulation of pure-pursuit problem, single-server queuing system and an inventory problem, Monte-Carlo simulation, Distributed Lag models, Cobweb model. [10 hours]

UNIT-III

Simulation of continuous systems, analog vs. digital Simulation, Simulation of water reservoir system, Simulation of a servo system, simulation of an autopilot, Discrete system simulation, fixed time-step vs. even to even model, generation of random numbers, test for randomness, Monte-Carlo computation vs. stochastic simulation.

[6 hours]

UNIT-IV

System dynamics, exponential growth models, exponential decay models, modified exponential growth models, logistic curves, generalization of growth models, system dynamic diagrams Introduction to SIMSCRIPT: Program, system concepts, origination, and statements, defining the telephone system model. [8 hours]

UNIT-V

Simulation of PERT Networks, critical path computation, uncertainties in activity duration , resource allocation and consideration. Simulation languages and software, continuous and discrete simulation languages, expression based languages, object oriented simulation, general purpose vs. application - oriented simulation packages, CSMP-III, MODSIM-III. [10 hours]

References:1. Geoftrey Gordon, “ System Simulation”, PHI2. Jerry Banks, John S. C Barry L. Nelson David M. Nicol, “Discrete Event System Simulation”, Pearson

Education3. V P Singh, “System Modeling and simulation”, New Age International.4. Averill M. Law, W. David Kelton, “System Modeling and simulation and Analysis”, TMH

ARTIFICIAL INTELLIGENCE(MCA-502)

L T P Total Credits

4 0 0 4


UNIT-IIntroduction : Introduction to Artificial Intelligence, Foundations and History of Artificial Intelligence, Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent Agents. Computer vision, Natural Language Possessing. [10 hours]

UNIT-IIIntroduction to Search : Searching for solutions, Uniformed search strategies, Informed search strategies, Local search algorithms and optimistic problems, Adversarial Search, Search for games, Alpha - Beta pruning.

[8 hours]

UNIT-IIIKnowledge Representation & Reasoning: Propositional logic, Theory of first order logic, Inference in First order logic, Forward & Backward chaining, Resolution, Probabilistic reasoning, Utility theory, Hidden Markov Models (HMM), Bayesian Networks. [6 hours]

UNIT-IVMachine Learning : Supervised and unsupervised learning, Decision trees, Statistical learning models, Learning with complete data - Naive Bayes models, Learning with hidden data – EM algorithm, Reinforcement learning.

[6 hours]

UNIT-VPattern Recognition : Introduction, Design principles of pattern recognition system, Statistical Pattern recognition, Parameter estimation methods - Principle Component Analysis (PCA) and Linear Discriminant Analysis (LDA), Classification Techniques – Nearest Neighbor (NN) Rule, Bayes Classifier, Support Vector Machine (SVM), K – means clustering. [10 hours]

References:1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson Education2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, McGraw-Hill3. E Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson Education4. Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of India

ADVANCED DATABASE MANAGEMENT SYSTEMS (MCA-503)

L T P Total Credits

3 0 0 3


UNIT-ITransaction and schedules, Concurrent Execution of transaction, Conflict and View Serializability, Testing for Serializability, Concepts in Recoverable and Cascadeless schedules. [8 hours]

UNIT –IILock based protocols, time stamp based protocols, Multiple Granularity and Multiversion Techniques, Enforcing serializablity by Locks, Locking system with multiple lock modes, architecture for Locking scheduler.

[6 hours]

UNIT IIIDistributed Transactions Management, Data Distribution, Fragmentation and Replication Techniques, Distributed Commit, Distributed Locking schemes, Long duration transactions, Moss Concurrency protocol. [6 hours]

UNIT –IVIssues of Recovery and atomicity in Distributed Databases, Traditional recovery techniques, Log based recovery, Recovery with Concurrent Transactions, Recovery in Message passing systems, Checkpoints, Algorithms for recovery line, Concepts in Orphan and Inconsistent Messages. [10 hours]

UNIT VDistributed Query Processing, Multiway Joins, Semi joins, Cost based query optimization for distributed database, Updating replicated data, protocols for Distributed Deadlock Detection, Eager and Lazy Replication Techniques. [10 hours]

References:

1. Silberschatz, Korth and Sudershan, Database System Concept’, Mc Graw Hill2. Ramakrishna and Gehrke,’ Database Management System, Mc Graw Hill3. Garcia-Molina, Ullman,Widom,’ Database System Implementation’ Pearson Education4. Ceei and Pelagatti,’Distributed Database’, TMH5. Singhal and Shivratri, ’Advance Concepts in Operating Systems’ MC Graw Hill

ADVANCED DATABASE MANAGEMENT SYSTEMS(MCA-503P)

L T P Total Credits

0 0 4 2


The program to be implemented using SQL:

1. Create Table, SQL for Insertion, Deletion, Update and Retrival using aggregating functions. 2. Write Programs in PL/SQL, Understanding the concept of Cursors. 3. Write Program for Join, Union & intersection etc. 4. Creating Views, Writing Assertions, Triggers. 5. Creating Forms, Reports etc. 6. Writing codes for generating read and update operator in a transaction using different

situations. 7. Implement of 2PL concerning central algorithm. 8. Developing code for understanding of distributed transaction processing.

REAL TIME SYSTEM (MCA-504) * Elective-2

L T P Total Credits

4 0 0 4


Unit-I

Introduction to Real Time Systems, Prioritites, Embedded Systems, Task, Classification & Requirements, Deadlines, Soft, Hard.

Unit-II

Firm Real Time Systems, Introduction to Real Time Operating Systems, Task Management, Inter Process Communication, Case Studies of Maruti II, HART OS, VRTX etc.

Unit-III

Characterizing Real Time Systems and Task, Task Assignment & Scheduling Theory, Fixed and Dynamic Priority Scheduling Uniprocessor (RM and EDF), Multiprocessor (Utilization Balancing, Next-fit for RM & Bin-Packing Assignment for EDF) Scheduling

Unit-IV

Programming Languages and Tools, Real Time Databases Real Time Communication, FDDI, Specification and Verification using Duration Calculus, Flow Control, Protocols for Real Time (VTCSMA, Window, IEEE 802.3, IEEE 802.4, IEEE 802.5, Stop and Go Protocol, Media Access Protocol),

Unit-V

Fault, Fault Classes, Fault Tolerant Real Time System, Clocks, Clock Synchronization, Issues in Real Time Software Design.

References:

1. Krishna, C.M, “Real Time Systems”, McGraw Hill 2. Jane W.S. Liu, “Real Time Systems”, Pearson Education Asia 3. Levi and Agarwal, “Real Time Systems”, McGraw Hill 4. Mathi & Joseph, “Real Time System: Specification, Validation & Analysis”, PHI

THEORY OF COMPUTATION AND FORMAL LANGUAGE (MCA-507)* Elective-2

L T P Total Credits

4 0 0 4


UNIT – I

Theory of Computation: Formal Language, Need for formal computational models, Non-computational problems, diagonal argument and Russel’s paradox. Deterministic Finite Automaton (DFA), Non-deterministic Finite Automaton (NFA), Regular Languages and regular sets, Equivalence of DFA and NFA. [8 hours]

UNIT – II

Kleen's characterization theory for sets accepted by finite automata, Minimizing the number of states of a DFA, Non-regular languages and pumping lemma. [8 hours]

UNIT – III

Pushdown Automaton (PDA), Deterministic Pushdown Automaton (DPDA), Non- equivalence of PDA and DPDA.[4 hours]

UNIT – IV

Context Free Grammars: Greibach Normal Form (GNF) and Chomsky Normal Form (CNF), Ambiguity, Parse Tree Representation of Derivations, Equivalence of PDA’s and CFG’s, Parsing techniques for parsing of general CFG’s-Early’s, Cook-Kassami-Younger (CKY), and Tomita’s parsing. [10 hours]

UNIT – V

Linear Bounded Automata (LBA): Power of LBA, Closure properties. Turing Machine (TM), One tape, multitape, the notion of time and space complexity in terms of TM, construction of TM for simple problems, Computational complexity. Chomsky Hierarchy of languages: Recursive and recursive-enumerable languages.

[10 hours]

Text Books:

1. Lewis, H.R. & Papadimitrious, C.H. Elements of the theory of computation. PHI2. Salomma, A.K. Formal languages, Academic press. Reference Books:

1. Hopcroft, J. E. & Ullman, J. D. Formal languages and their relation to Automata Addison-Wasley2. E. V. Krishnamurthy, Introductory theory of computer science East-West press Pvt. Ltd.3. Zoha Mauna, Mathematical theory of computation, Wiley inter-science.4. John Minsky, Theory of computation, PHI.

Client Server Computing(MCA-505) * Elective-3

L T P Total Credits

3 0 4 5


Unit I

Client/Server Computing: DBMS concept and architecture, Single system image, Client Server architecture, mainframe-centric client server computing, downsizing and client server computing, preserving mainframe applications investment through porting, client server development tools, advantages of client server computing.

Unit II

Components of Client/Server application: The client: services, request for services, RPC, windows services, fax, print services, remote boot services, other remote services, Utility Services & Other Services, Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE), Common Object Request Broker Architecture (CORBA). The server: Detailed server functionality, the network operating system, available platforms, the network operating system, available platform, the server operating system.

Unit III

Client/Server Network: connectivity, communication interface technology, Interposes communication, wide area network technologies, network topologies (Token Ring, Ethernet, FDDI, CDDI) network management, Client-server system development: Software, Client–Server System Hardware: Network Acquisition, PC-level processing unit, Macintosh, notebooks, pen, UNIX workstation, x-terminals, server hardware.

Unit IV

Data Storage: magnetic disk, magnetic tape, CD-ROM, WORM, Optical disk, mirrored disk, fault tolerance, RAID, RAID-Disk network interface cards. Network protection devices, Power Protection Devices, UPS, Surge protectors. Client Server Systems Development: Services and Support, system administration, Availability, Reliability, Serviceability, Software Distribution, Performance, Network management, Help Disk, Remote Systems Management Security, LAN and Network Management issues.

Unit V

Client/Server System Development: Training, Training advantages of GUI Application, System Administrator training, Database Administrator training, End-user training. The future of client server Computing Enabling Technologies, The transformational system.

References:

1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI 2. Dawna Travis Dewire, “Client/Server Computing”, TMH3. Majumdar & Bhattacharya, “Database management System”, TMH 4. Korth, Silberchatz, Sudarshan, “Database Concepts”, McGraw Hill 5. Elmasri, Navathe, S.B, “Fundamentals of Data Base System”, Addison Wesley

NEURAL NETWORK(MCA-508) * Elective-3

L T P Total Credits

3 0 4 5


Unit – I

Introduction: Neural network, Human brain, biological and artificial Neurons, model of Neuron Knowledge representation, Artificial intelligence and Neural network, Network architecture, Basic Approach of the working of ANN – training, Learning and generalization.

Unit – II

Supervised learning: Single- layer networks, perception -linear separability, limitations of multi layer network architecture, back propagation algorithm (BPA) and other training algorithms, applications of adaptive multi-layer network architecture, recurrent network, feed-forword networks, radial- basis-function (RBF) networks.

Unit – III

Unsupervised learning: Winner-takes-all networks, Hamming networks, maxnet, simple competitive learning vector-quantization, counter-propagation network, adaptive resonance theory, Kohonen’s self organizing maps, principal component analysis.

Unit – IV

Associated models: Hopfield networks, brain-in-a-box network, Boltzman machine.

Unit – V

Optimization methods: Hopfield networks for-TSP, solution of simultaneous linear equations, Iterated radiant descent, simulated annealing, fenetic algorithm.

Text Books:

1. Simon Haykin, “Neural Networks – A Comprehensive Foundation”, Macmillan Publishing Co., New York, 1994.

2. K. Mahrotra, C.K. Mohan and Sanjay Ranka, “Elements of Artificial Neural Networks”, MIT Press, 1997 – Indian Reprint Penram International Publishing (India), 1997

Reference Books:

1. A Cichocki and R. Unbehauen, “Neural Networks for optimization and Signal processing”, John Wiley and Sons, 1993.

2. J.M. Zurada, “Introduction to Artificial Neural networks”, (Indian edition) Jaico Publishers, Mumbai, 1997. 3. Limin Fu. “Neural Networks in Computer Intelligence”, TMH.


MCA 3rd Year / 6th Semester



Max. MarksCredits

Sr.

No.Code Title

MSE CA P Total ESE Marks Credits

(Theory)

1 MCA-651 Project 0 0 40 360 360 240 600 20

2 MCA-652

Colloquium(Seminar &

Conferences)0 0 6 120 120 60 200 3

Total 0 0 46 480 480 300 800 23

Total Credits=133

PROJECT(MCA-651)

L T P Total Credits

0 0 40 20

Guidelines & General Instruction:Every student is required to carry out project work under the supervision of a faculty member of the department. However, a student may also opt to pursue his project work in a reputed industry/institution with the consent of Department/Institute. In such cases, the department must look into the suitability of the projects and assign one internal guide/supervisor.The internal supervisor shall monitor progress of the student continuously. A candidate is required to present the progress of the project work (at least twice) during the semester at an appropriate time decided by the Department. There will a final presentation of the project work at the end of the semester.

COLLOQUIUM (MCA-652)

L T P Total Credits

0 0 06 3

Guidelines & General Instruction:The aim of the subject is to develop ability of a student to carryout literature survey & independent study of an advanced subject/topic/matters in the field of Computer Science and Information technology.At the beginning of semester a list of colloquium topic should be displayed on the notice board by the department and/or on the institution web site. Every Student must select a topic of his choice. The student is required to conduct rigorous study/survey on the subject under the supervision of the faculty member of the department, prepare a report and present this in presence of all the students of his class at the end of semester. The comments & criticism of the topic/subject will be discussed for the benefit of all the students. The evaluation will be carried out by the department based on the presentation.

SYLLABUS MASTER OF COMPUTER APPLICATIONS (MCA) · (MCA-652) L T P Total Credits 0 0 06 3 Guidelines...

Documents

Transcript of SYLLABUS MASTER OF COMPUTER APPLICATIONS (MCA) · (MCA-652) L T P Total Credits 0 0 06 3 Guidelines...