Syllabus of Andhra University MCA - MCA 2.2.1 Data Communications and NetworksWith effect from 2004-05 admitted batchInstruction: 3 Periods/weekSessional Marks: 50Univ-Exam-Marks:100Time: 3 Hours1. Introduction:Data communications. Networks. The Internet. Protocol & Standards2. communicate Models:Layered tasks. Internet model. OSI model3. Physical forge:3.1 Signals: Analog and digital signals data evaluate limits. Transmission impairment. communicate measurements like throughput propagation speed and measure gesticulate length3.2 Digital Transmission: lie coding block coding sampling transmission mode3.3 Analog Transmission: Modulation digital data telephone modem. Modulation analog signals3.4 Multiplexing: FDM. WDM. TDM3.5 Transmission Media: Guided media unguided media3.6 Circuit Switching & Telephone Network: Circuit switching telephone communicate4. Data cerebrate Layer:4.1 Error detection and Correction: write of errors detection and correction of errors4.2 Data cerebrate Control & Protocol: Flow & error hold back. Stop-And-Wait ARQ. Go-Back-N ARQ. Select Repeat ARQ. HDLC4.3 Point-To-Point Access: Point-to-point protocol. PPP stack4.4 Local Area Network: Traditional Ethernet abstain and gigabit Ethernets4.5 Connecting LANs. Backbone Networks and Virtual LANs: Connecting devices. Backbone networks. Virtual LANs5. Network forge:5.1 Internetworks. Addressing. Routing5.2 communicate forge Protocols: ARP. IP. ICMP. IPV65.3 Unicast routing. Unicast routing protocols. Multi routing. Multicast routing protocols6. displace Layer:6.1 Process-To-Process delivery user data gram. Transmission control protocol7. Application Layer:7.1 Client-Server Model: Client-Server model. Socket interface7.2 A brief introduction to DNS. SMTP. FTPText Book:Data Communications and Networking. Behrouz A. Forouzan. 3rd Edition. Tata Mcgraw-Hill Publishing CoReference Book:Understanding Data Communications and Networks. William A Shay. 2nd Edition. Vikas Publishing HouseSyllabus of Andhra University MCA - MCA 2.2.2 Database Management SystemsWith effect from 2004-05 admitted batchInstruction: 3 Periods/weekSessional Marks: 50Univ-Exam-Marks:100Time: 3 Hours1. Database Systems Concepts And Architecture:Introduction data models schemas and instance; three-schema architecture and data independence; database language and interface the database system environment; centralized and client/server architecture of DBMSs; classification of DBMSs.2. Data Modeling Using The E-R copy:High- level conceptual data models for database design; Entity types entity sets attributes and keys; relationship types relationship sets roles and structural constraint; weak entity types. ER diagrams naming conventions and design issues; Notation for UML class diagrams3. Enhanced ER And UML Modeling:Subclasses super classes and inheritance; specialization and generalization; constraints and characteristics of specialization and generalization modeling of union types using categories; representing specialization/ generalization and inheritance in UML class diagrams; relationship types of degree higher than two; data abstraction knowledge representation and ontology concepts4. The Relational Data Model And Relational Database Constraints:Relational model concepts relational model constraints and relational database schemas; updating operations and dealing with constraints violations5. The Relational Algebra And Relational CalculusUnary relational operations: SELECT and communicate; relational algebra operations from set theory; binary relational operations: connect and DIVISION; additional relational operations; the tuple relational calculus; the domain relational calculus6. Relational Database Design By ER And EER-To-Relational Mapping:Relational database create by mental act using ER-to-Relational mapping; mapping EER model constructs to relations7. Functional Dependencies And Normalization For Relational Databases:Informal design guidelines for relational schemas; functional dependencies; normal forms based on primary leys; general definitions of 2nd and 3rd normal forms; Boyce-Codd normal forms8. Transaction Processing Concepts:Introduction to transaction processing; transaction and system concepts; desirable properties of transaction; characteristics plan based on recoverability; characteristics schedule based on serializability.9. Concurrency hold back Techniques:Two phase locking techniques for concurrency control; concurrency control based on timestamp ordering; multi-version concurrency control techniques; validation(optimistic) concurrency hold back techniques; granularity of data items and multi granularity locking.10. Database Recovery Techniques:Recovery concepts; recovery techniques based on deferred updates; recovery techniques based on immediate update; follow paging; the ARIES recovery algorithm. Text Book:Fundamentals of Database Systems Ramez Elmasri and Shamkant B. Navathe. 4th edition. Pearson education. Reference:Database Concepts. Abraham Silberschatz. Henry F Korth. S. Sudarshan. McGraw-HillSyllabus of Andhra University MCA - MCA 2.2.3 Operations ResearchWith cause from 2004-05 admitted batch Instruction: 3 Periods/weekSessional Marks: 50Univ-Exam-Marks:100measure: 3 HoursOverview of operations investigate: OR models – OR TechniquesLinear Programming: Introduction – Graphical solution; Graphical sensitivity analysis– The standard form of linear programming problems – Basic feasible solutions -unrestricted variables – simplex algorithm – artificial variables – Big M and two phasemethod – Degeneracy - alternative optima – unbounded solutions – infeasible solutions. Dual problems: Relation between primal and dual problems – Dual simplex methodTransportation model: starting solutions. North West command Rule - lowest be method–Vogels approximation method – Transportation algorithms –Assignment problem –Hungarian Method. communicate Models : Definitions – CPM and PERT – Their Algorithms Integer Programming : grow and Bound Algorithms cutting plan algorithm. Dynamic Programming: Recursive nature of dynamic programming – Forward andBackward RecursionDeterministic list Models : Static EOQ Models – Dynamic EOQ models. Game theory: Two person Zero Sum Games – Mixed strategy games and theirAlgorithms. Text Books:1. Operations Research – An Introduction. Handy A Taha – Pearson Education.[Chapter 1,2,3,4,5 and 6.1. 6.2. 6.7. 9,10. 11. 14]2. Operations Research Panneer Selvan Prentice Hall of India. Syllabus of Andhra University MCA - MCA 2.2.4 Artificial IntelligenceWith cause from 2004-05 admitted batchInstruction: 3 Periods/weekSessional Marks: 50Univ-Exam-Marks:100Time: 3 Hours1. Problems and examine: What is Artificial Intelligence?. The AI Problems,The Underlying Assumption. What is an AI Technique. The Level of the copy. Criteria for Success. Some General References. One Final Word.2. Problems. Problem Spaces and Search: Defining the Problem as a express lay Search. Production systems. Problem Characteristics. Production System Characteristics. Issues in the Design of Search Programs. Additional Problems.3. Heuristic Search Techniques: Generate-and- Test. Hill Climbing. Best-First examine. Problem Reduction. Constraint Satisfaction. Means-Ends Analysis.4. Knowledge Representation:- Knowledge Representation Issues,Representations and Mappings. Approaches to knowledge Representation,Issues in Knowledge Representation. The Frame.
Forex Groups - Tips on Trading
Related article:
http://student2036.blogspot.com/2007/10/iind-year-iind-semister.html
comments | Add comment | Report as Spam
|