MCA-305 COMPUTER NETWORKS SYLLABUS

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA

  (University of Technology of Madhya Pradesh)

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA)

W.E.F. 2005-2006

MCA-305 COMPUTER NETWORKS SYLLABUS

 

UNIT-I

Introduction: Computer Network, Layered Network Architecture-Review of ISO-OSI Model., Transmission Fundamentals-, Communication Media-Conductive Metal (Wired Cable), Optical Fiber links, Wireless Communication-Radio links, Setellite Links, Communication Services & Devices, Telephone System., Integrated Service Digital Network (ISDN)., Cellular Phone., ATM,  Modulation & Demodulation-, Digital to Analog Conversion-Frequency Modulation (FM), Amplitude, Modulation (AM), Phase  Modulation (PM)., Analog to Digital Conversion-Pulse Amplitude Modulation(PAM), Pulse Code Modulation (PCM), Differential Pulse Code Modulation, (DPCM)., Modem  &   Modem Types., Multiplexing-, Frequency Division Multiplexing (FDM)., Time Division Multiplexing (TDM), Statistical Time Division Multiplexing (STDM)., Contention Protocol-, Stop-Go-Access Protocol, Aloha Protocol-Pure aloha & Slotted aloha, Carrier sense multiple access with collision detection (CSMA/CD)

UNIT-II

Data Security and Integrity: Parity Checking Code, Cyclic redundancy checks (CRC), Hemming Code, Protocol Concepts –, Basic flow control, Sliding window rotocol-Go-Back-N protocol and selective repeat protocol, Protocol correctness- Finite state machine

UNIT-III

Local Area Network: Ethernet : 802.3 IEEE standard, Token Ring   :  802.5 IEEE standard, Token Bus :  802.4 IEEE standard, FDDI Protocol, DQDB Protocol, Inter Networking, Layer 1 connections- Repeater, Hubs, Layer 2 connections- Bridges, Switches, Layer 3 connections- Routers, Gateways.

UNIT-IV

Wide Area Network: Introduction, Network routing, Routing Tables, Types of routing, Dijkstra’s Algorithm, Bellman-Ford Algorithm, Link state routing, Open shortest path first, Flooding, Broadcasting, Multicasting, Congestion & Dead Lock, Internet Protocols, Overview of TCP/IP, Transport protocols, Elements of Transport Protocol, Transmission control protocol (TCP), User data-gram protocol (UDP).

UNIT-V

Network Security, Virtual Terminal Protocol, Overview of DNS, SNMP, email, WWW, Multimedia.

BOOKS

1.    A.S.Tanenbaum, “Computer Network”, 4^th addition,PHI

2.    Forouzan “Data Communication and Networking 3ed”, TMH

3.    J.F.Hayes, “Moduling and Analysis of Computer Communication Networks”, Plenum Press

4.    D.E.Comer, “Internetworking with TCP/IP”, Volume Ist & IInd, PHI

5.  Willium Stalling, “Data & Computer communications”,Maxwell Macmillan International Ed.

6.    D.Bertsekas and R.Gallager,”Data Networks”,  2^nd Ed. ,PHI.

7.    G.E. Keiser ,”Local Area Networks “, McGraw Hill, International Ed.

Note : Paper is to be set unit wise with internal choice.

 

MCA-304 THEORY OF COMPUTATION SYLLABUS

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA

  (University of Technology of Madhya Pradesh)

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA)

W.E.F. 2005-2006

MCA-304 THEORY OF COMPUTATION SYLLABUS

 

UNIT-I

Review of Mathematical Priliminaries : Set, Relations and functions, Graphs and trees, string, alphabets and languages. Principle of induction,  predicates and propositional calculus.

Theory of Automation : Definition, description, DFA,NFA, Transition systems,2DFA, equivalence of DFA & NDFA, Regular expressions, regular grammer, FSM with output (mealy and moore models), Minimisation of finite automata.

UNIT-II

Formal Languages : Definition & description, Pharse structured grammars & their classification, Chomskey classification of languages, closure properties of families of language,  regular grammar, regular set & their closure properties, finite automata, equivalence of FA and regular expression, equivalence of two way finite automata, equivalence of regular expressions.

 

UNIT -III

Context-Free grammar & PDA  : Properties unrestricted grammar & their equivalence, derivation tree simplifying  CFG, unambiguifying CFG, Î-productions, normal form for CFG, Pushdown automata, 2 way PDA, relation of PDA with CFG, Determinism & Non determinism in PDA & related theorems, parsing and pushdown automata.

UNIT-IV

Turing Machine : Model, design, representation of TM, language accepted by TM, universal tuning machine, determine & non-determinism in TM, TM as acceptor/generator/algorithms, multidimentional, multitracks, multitape, Two way infinite tape, multihead, Halting problems of TM.

UNIT-V

Computability : Concepts, Introduction to complexity theory, Introduction to undecidaibility, recursively enumerable sets, primitive recursive functions, recursive set, partial recursive sets, concepts of linear bounded Automata, context sensitive grammars & their equivalence.

BOOKS

1.      Hopcroft & Ullman  “Introduction to Automata theory, languages & Computation” , Narosha Publishing house.

2.      Lewish Papadimutrau “Theory of Computation” , Prentice Hall of India, New Delhi.

3.      Peter linz, “An Introduction to formal language and automata”, Third edition, Narosa publication.

4.      Marvin L. Minskay “Computation : Finite & Infinite Machines”, PHI.

5.      Mishra & Chander Shekhar “Theory of Computer Science (Automate, Language & Computations), PHI.

Note : Paper is to be set unit wise with internal choice.

 

MCA-303 OBJECT ORIENTED METHODOLOGY AND C++ SYLLABUS

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA

  (University of Technology of Madhya Pradesh)

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA)

W.E.F. 2005-2006

MCA-303 OBJECT ORIENTED METHODOLOGY AND C++ 

 

UNIT-I

C++ basics, loops and decisions, structures and functions, object and classes, object arrays, constructor  and  destructor functions.

UNIT-II

Operator and function overloading, pointers, pointers to base and derived classes inheritance, public and private inheritance, multiple inheritance.

UNIT-III

Polymorphism, virtual functions, abstract base classes and pure virtual function, friend function, early  and late binding.

UNIT-IV

C++ I/O system, formatted I/O, creating insertors  and extractors, file I/O basis,  creating disk files and file manipulations using seekg(), seekp(), tellg() and tellp() functions, exception handling: try, catch and throw.

UNIT-V

UML concepts, object-oriented paradigm and visual modeling, UML diagrams, UML specifications, object model, object oriented design, identifying classes and object, object diagrams.

BOOKS

1.                Lafore R.  “Object Oriented Programming in C++”, Galotia Pub.

2.                Lee “UML & C++ a practical guide to Object Oriented Development 2 ed, Pearson.

3.                Schildt “C++ the complete reference 4ed, 2003.

4.                Hans Erit Eriksson “UML 2 toolkit” Wiley.

5.                Balagurusawmy  “Object Orienter Programming with C++”.

6.                B.G., Boach   “Object Oriented Analysis & Design with Applications”, Addision Wesly.

7.                S. Parate  “C++ Programming”, BPB.

8.                Boggs  “Mastering UML”  BPB Publications.

Note : Paper is to be set unit wise with internal choice.

 

MCA-302 SOFTWARE ENGINEERING METHODOLOGIES SYLLABUS

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA

  (University of Technology of Madhya Pradesh)

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA)

W.E.F. 2005-2006

MCA-302 SOFTWARE ENGINEERING METHODOLOGIES

 

UNIT -I

System concepts and Information system environment:

The system concept, characteristics of system, elements of system, The System Development Life Cycle, The Role of System Analyst.  Introduction system planning & initial investigation, various information gathering tools feasibility study conretions & structures tools of system analysis, various methods of process design, form design methodologies, introduction to information system testing, quality assurance  security & diastruct computer various  (deleting recovery)

UNIT -II

Software Process, Product and Project:

The Product : Software, Software Myths, The process : Software Engineering : A Layered Technology, Software Process Models, The Linear Sequential Model, The Prototyping Model, The RAD Model, Evolutionary Software Process Models, Component – Based Development, Fourth Generation Techniques, Software process and Project Metrics : Software measurement

UNIT-III

Software Project Planning and Design:

Software Project Planning : Project planning objectives, Decomposition Techniques, Empirical estimation models, The Make/Buy Decision., Risk analysis.

Software Design: Design Principles, Cohesion & Coupling, Design notation and specification, structure design methodology.           

UNIT-IV

Software Quality Assurance and Testing:

Software Quality Assurance : Quality Concepts,  The Quality Movement, Software Quality Assurance, Software Reviews, Formal Technical Reviews, Formal Approaches to SQA, Statistical Software Quality Assurance, Software Reliability, Mistake Proofing for Software,  Introduction to ISO standard.

Testing Strategies: A strategic approach of software testing strategic issues, unit testing, integration testing, validation testing, system testing, the art of debugging. OOA, OOD.

UNIT-V

Advanced Topics:

MIS & DSS:Introduction to MIS, long range planning, development and implementation of an MIS, applications of MIS in manufacturing sector and in service sector.

Decision Suppost System concepts, types of DSS.

Object Oriented Software Engineering: Object Oriented Concepts, Identifying the Elements of an Object Model, Management of Object Oriented Software Projects.

CASE tools, Re-engineering 

BOOKS

1.      R. S. Pressman, “Software Engineering – A practitioner’s approach”, 6^th  ed., McGraw Hill Int. Ed., 2002.

2.      Pankaj Jalote “Software Engg” Narosa Publications.

3.      Ian Sommerville : Software Engineering 6/e (Addison-Wesley)

4.      Richard Fairley : Software Engineering Concepts (TMH)

5.      Elis Awad, "System Analysis & Design", Galgotia publications

6.      W.S. Jawadekar: Management Information Systems, TMH Publication, India

7.      Hoffer “ Modern System Analysis & Design” 3e, Pearson Edition

Note : Paper is to be set unit wise with internal choice.

MCA-301 COMPUTER ORIENTED OPTIMIZATION TECHNIQUES SYLLABUS

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA

  (University of Technology of Madhya Pradesh)

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA)

W.E.F. 2005-2006

MCA-301 COMPUTER ORIENTED OPTIMIZATION TECHNIQUES

 

 

UNIT-I

Introduction of operation research.             LP Formulations, Graphical method for solving LP’s with 2 variables, Simplex method, Duality theory in linear programming and applications,  Integer linear programming, dual simplex method,

UNIT-II

Transportation problem, Assignment problem.

Dynamic Programming :  Basic Concepts, Bellman’s optimality principles, Dynamics programming approach in decision making problems, optimal subdivision problem.

Sequencing Models: Sequencing problem, Johnson’s Algorithm for processing n jobs through 2 machines, Algorithm for processing n jobs through 3 or more machines, Processing 2 jobs through n machines.

UNIT-III

Project Management : PERT and CPM : Project management origin and use of PERT,  origin and use of CPM, Applications of PERT and CPM, Project Network, Diagram representation, Critical path calculation by network analysis and critical path method (CPM), Determination of floats, Construction of time chart and resource labelling, Project cost curve and crashing in project management, Project Evaluation and review Technique (PERT).

UNIT-IV

Queuing Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systems, classification of queuing models, solution of queuing M/M/1 :  ¥ /FCFS,M/M/1 : N/FCFS, M/M/S : ¥/FCFS, M/M/S :/FCFS

UNIT-V

Inventory Models : Introduction to the inventory problem, Deterministic Models, The classical EOQ (Economic Order Quantity) model,  Inventory models with deterministe  demands(no shortage & shortage allowed), Inventory models with probabilistic demand, multiitem determinise models.

BOOKS

1.    Gillet B.E. : Introduction to Operation Research, Computer Oriented Algorithmic approach -         Tata McGraw Hill Publising Co. Ltd. New Delhi.

2.      P.K. Gupta & D.S. Hira, “Operations Research”, S.Chand & Co.

3.      J.K. Sharma, “Operations Research: Theory and Applications”, Mac Millan.

4.      S.D. Sharma, “Operations Research”, Kedar Nath Ram Nath, Meerut (UP).

5.    S.S. Rao “Optimization Theory and Application”, Wesley Eastern.

6.    Tata Hamdy, A  “Operations Research - An Introduction”, Fifth Edition, Prentice Hall of India  Pvt. Ltd., New Delhi.

7.   Taha H.A. “Operations Research an Introduction” McMillan Publication.

Note : Paper is to be set unit wise with internal choice & emphasis is to be given on computerized implementation.

MCA-306 Programming Laboratory any two tools from VB, VC++, D2K etc.

RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA

  (University of Technology of Madhya Pradesh)

COURSE OF STUDY AND SCHEME OF EXAMINATION

MASTER OF COMPUTER APPLICATIONS (MCA)

W.E.F. 2005-2006

MCA-306 Programming Laboratory any two tools from VB, VC++, D2K etc.

 

MCA-306 Programming Laboratory any two tools from VB, VC++, D2K etc.

RGTU / RGPV MCA 3RD SEMESTER SYLLABUS

MCA-301 COMPUTER ORIENTED OPTIMIZATION TECHNIQUES SYLLABUS

MCA-302 SOFTWARE ENGINEERING METHODOLOGIES SYLLABUS

MCA-303 OBJECT ORIENTED METHODOLOGY AND C++ SYLLABUS

MCA-304 THEORY OF COMPUTATION SYLLABUS

MCA-305 COMPUTER NETWORKS SYLLABUS

MCA-306 Programming Laboratory any two tools from VB, VC++, D2K etc.