SYLLABUS

2010-09-25T06:33:00.000-07:00

SYLLABUS OF MCA COURSE

III^rd Semester

C-301 Data Base Management Systems

Unit I

Basic Concepts: Database and database users, Database Systems Concepts & Architecture, Data Modeling using the Entity Relationship Model, Record Storage & Primary File Organizations.

Unit II

Relational Model, Languages & Systems. The Relational Data Model, Relational Constraints and the Relational Algebra, SQL – The relational Database Standard.

Unit III

Data base Design Theory and Methodology Functional Dependencies and Normalization for Relational Databases, Relational Database Design Algorithms and Further Dependencies.

System Implementation Techniques

Unit IV

Database System Architecture and the System Catalog, Transaction Processing Concepts (Introduction to Transaction Processing, Transaction & System Concepts) Con-Currency Control Techniques (Locking Techniques for Con-currency Control, Con-Currency Control Bases on Time Stamp Ordering) Database Recovery Techniques (Recovery Concepts) Database Security and Authorization (Introduction to Data Base Security Issues)

Unit V

Advanced Data Base Concepts & Emerging Application

Distributed Databases and Client server Architecture, Data Ware housing and Data mining, Emerging Database Technologies and Application

Reference Books

1. “Fundamental of Database System” by “Elmasri Navathe”, 4^th Edition, First Indian Reprint, (2004), Published by “Perarson Education”.

2. “Database System Concepts” by “Silberschatz, Korth, Sudarshan”, 4^th Edition, Fourth Edition, International Edition (2002), Published by “McGraw – Hill Publication”.

SYLLABUS OF MCA COURSE

III^rd Semester

C- 302 Computer Communication Networks

UNIT-I

Introduction to computer Network, Distributed System Advantages of Networks, Point to Point and Multi-drop Circuits. Network Topologies-Star, Ring, Bus, Mesh, Tree, Synchronous and Asynchronous transmission. Serial and Parallel Transmission simplex Half duplex, full duplex transmission modes.

UNIT - II

Wide area Networks, Local Area Networks, Multiplexing Time Division Multiple Access, Time Division Multiplexing, (TDM). Frequency Division Multiplexing (FDM) Connection-Oriented and Connection-less Networks. Goals of Layered Protocols, Communication between Layers Introduction to the OSI reference Model Data transmission in the OSI Model.

UNIT – III

LANs , Primary attributes of LANs. Broad band and base band LANS. LAN topologies and Protocols CSMA/CD, Token Ring, Token Bus Metropolitan Area Networks & ANSI (FDDI) Fiber Distributed Data Interface Aloha protocol- pure and slotted.

UNIT- IV

Switching, Message Switching , Circuit Switching, Packet Switching. Routing – Centralized routing, Distributed routing, static routing, Adaptive routing. Signals :- Analog and digital Signals Bit rate and baud rate.

UNIT – V

Polling and Selection Protocols: -The meaning of polling Solution Protocols Character and Bit Oriented Protocols Binary Synchronous High Level Data Link Control (HDLC). HDLC frame format code transparency and synchronization. Sliding Window Protocol Frame format , Go-back –n - protocol selective repeat protocol.

UNIT – VI

TCP / IP and Internet working concept of ports and sockets IP address structure Major features of IP. IP data gram major IP services TCP Major features of TCP. TCP segment UDP (User data gram protocol). Application Layer protocol –Telnet, TFTP, FTP

Reference Books

1. Computer Network by – Tanenbaum

2. Computer Network by _ Frozen

SYLLABUS OF MCA COURSE

III^rd Semester

C-303 Theory of Computation

UNIT – I

Conceptual model of a computer machine, digital and analog automata, theory of automata, Numerical Computation and automata. Language and aiphabets of the automata, finite and non-finite automata.

UNIT – II

Classification of automation, man, machines and automata, language accepted by automata, deterministic automata, theories and axioms of DFA. Conversion of DFA to NDFA and vice-versa.

UNIT – III

Regular and non regular grammar, DFA and regular expressions accepted by DFA, Arden’s theorems, Pumping Lemma of regular grammar, problems and practices based on pumping lemma.

UNIT – IV

Context free grammar, Chomskey’s hierarchies of different types of grammars, derivation tree, yield, left and right derivation trees, ambiguous grammar, normalization of grammar, null removal, unit production removal and optimization of CFG,BNF,CNF & GNF, pumping lemma of context free grammar.

UNIT – V

Push down memory automation, multiple stack automation, LBA and language accepted by LBA, Turing machine, designing and construction of Turing machine.

Reference Books-

1. theory of Computation, by KLP Mishra.

SYLLABUS OF MCA COURSE

III^rd Semester

C- 304 Internet & Web Technology

UNIT –I

History of the Web, growth of the web, protocols governing the web, web application, creating web sites for individual and corporate world internet, www, browses.

UNIT – II

Planning and developing a web site, contents of a web site, Technology and production planning, communication issues communication with client, communication breakdowns quality assurance and Testing Study of Technology Advances.

UNIT – III

Introduction to Java Language: Program structure, tokens, statements, JVM, constants, variables, data types, operators and expressions, decision making, branching, looping. Classes: Defining java class, objects, methods, constructors, method overloading, and static members. Inheritance: Extending class, levels of inheritance, overriding methods, abstract classes, Arrays, Strings, Vectors, Interfaces: Multiple Inheritance.

UNIT – IV

Packages: Introduction, system packages, new packages. Multithreaded Programming: Introduction to Threads, Multiple threads. Exception Handling. Error handling. Vectors

UNIT – IV

Applet Programming: Introduction, Images, drawing.Acknowledge window tool (AWT)

Reference Books-

1. Mastering java 2 (BPB Publications)

2. HTML by Ivan Byross (BPB Pulications)

SYLLABUS OF MCA COURSE

III^rd Semester

C-305 Optimization Techniques

UNIT – I

Linear Programming Graphical method for two dimensional problems central problems of linear programming various definitions- statements of basic theorems and properties – phase I and Phase II of the Simplex method – revised simplex method – primal and dual – dual simplex method – sensitivity analysis – transportation problem and its solution – assignment problem and its solution by Hungarian method.

UNIT- II

Integer Programming: Gomory cutting plane methods – Branch and Bound methods.

Queuing Theory: Characteristics of queuing systems – steady state M/M/1, M/M1/K and M/M/C queuing models. UNIT – III

Replacement Theory: Replacement Theory of items the deteriorate – replacement of items that fail. Group replacement and individual replacement.

UNIT – IV

Inventory theory: Costs involved in inventory problems-single item deterministic models-economic lot size models without shortages and shortage having production rate infinite and finite.

UNIT – V

PERT and CPM

Arrow networks – time estimates – earliest expected time, latest allowable occurrence time and slack – critical path – probability of meeting scheduled date of completion of project – calculations on CPM network- various floats for activities – critical path updating project operation time cost trade off curve project time cost trade off curve selection of schedule based on cost analysis.

Reference Books-

1. Operation Research by Kantiswroop.

Main university

2010-09-12T04:52:00.000-07:00

Dr. B. R. Ambedkar University, Agra is especially privileged to be situated in the city of Taj Mahal. It was established on 1st July 1927 as Agra University.

AGRA UNIVERSITY MCA(III)rdsem

SYLLABUS

Data base Design Theory and Methodology Functional Dependencies and Normalization for Relational Databases, Relational Database Design Algorithms and Further Dependencies.

System Implementation Techniques

IIIrd Semester

C- 302 Computer Communication Networks

Queuing Theory: Characteristics of queuing systems – steady state M/M/1, M/M1/K and M/M/C queuing models. UNIT – III

Replacement Theory: Replacement Theory of items the deteriorate – replacement of items that fail. Group replacement and individual replacement.

UNIT – IV

Inventory theory: Costs involved in inventory problems-single item deterministic models-economic lot size models without shortages and shortage having production rate infinite and finite.

UNIT – V

PERT and CPM

Main university

III^rd Semester