Syllabus of Andhra University
MCA - MCA 2.2.1 Data Communications and Networks
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
1. Introduction:
Data communications, Networks, The Internet, Protocol & Standards
2. Network Models:
Layered tasks, Internet model, OSI model
3. Physical layer:
3.1 Signals: Analog and digital signals, data rate limits, Transmission impairment, Signal measurements like throughput, propagation speed and time, wave length
3.2 Digital Transmission: Line coding, block coding, sampling, transmission mode
3.3 Analog Transmission: Modulation digital data, telephone modem, Modulation analog signals
3.4 Multiplexing: FDM, WDM, TDM
3.5 Transmission Media: Guided media, unguided media
3.6 Circuit Switching & Telephone Network: Circuit switching, telephone network
4. Data Link Layer:
4.1 Error detection and Correction: Type of errors, detection and correction of errors
4.2 Data Link Control & Protocol: Flow & error control, Stop-And-Wait ARQ, Go-Back-N ARQ, Select Repeat ARQ, HDLC
4.3 Point-To-Point Access: Point-to-point protocol, PPP stack
4.4 Local Area Network: Traditional Ethernet, fast and gigabit Ethernets
4.5 Connecting LANs, Backbone Networks and Virtual LANs: Connecting devices, Backbone networks, Virtual LANs
5. Network Layer:
5.1 Internetworks, Addressing, Routing
5.2 Network Layer Protocols: ARP, IP, ICMP, IPV6
5.3 Unicast routing, Unicast routing protocols, Multi routing, Multicast routing protocols
6. Transport Layer:
6.1 Process-To-Process delivery, user data gram, Transmission control protocol
7. Application Layer:
7.1 Client-Server Model: Client-Server model, Socket interface
7.2 A brief introduction to DNS, SMTP, FTP
Text Book:
Data Communications and Networking, Behrouz A. Forouzan, 3rd Edition, Tata Mcgraw-Hill Publishing Co
Reference Book:
Understanding Data Communications and Networks, William A Shay, 2nd Edition, Vikas Publishing House
Syllabus of Andhra University MCA - MCA 2.2.2 Database Management Systems
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
1. 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 Model:
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 diagrams
3. 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 concepts
4. The Relational Data Model And Relational Database Constraints:
Relational model concepts, relational model constraints and relational database schemas; updating operations and dealing with constraints violations
5. The Relational Algebra And Relational Calculus
Unary relational operations: SELECT and PROJECT; relational algebra operations from set theory; binary relational operations: JOIN and DIVISION; additional relational operations; the tuple relational calculus; the domain relational calculus
6. Relational Database Design By ER And EER-To-Relational Mapping:
Relational database design using ER-to-Relational mapping; mapping EER model constructs to relations
7. 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 forms
8. Transaction Processing Concepts:
Introduction to transaction processing; transaction and system concepts; desirable properties of transaction; characteristics schedule based on recoverability; characteristics schedule based on serializability.
9. Concurrency Control Techniques:
Two phase locking techniques for concurrency control; concurrency control based on timestamp ordering; multi-version concurrency control techniques; validation(optimistic) concurrency control 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; shadow 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-Hill
Syllabus of Andhra University MCA - MCA 2.2.3 Operations Research
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
Overview of operations Research: OR models – OR Techniques
Linear 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 method
Transportation model: starting solutions. North West corner Rule - lowest cost method–Vogels approximation method – Transportation algorithms –Assignment problem –Hungarian Method.
Network Models : Definitions – CPM and PERT – Their Algorithms Integer Programming : Branch and Bound Algorithms cutting plan algorithm.
Dynamic Programming: Recursive nature of dynamic programming – Forward andBackward Recursion
Deterministic Inventory 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 Intelligence
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
1. Problems and Search: What is Artificial Intelligence?, The AI Problems,The Underlying Assumption, What is an AI Technique, The Level of the Model, Criteria for Success, Some General References, One Final Word.
2. Problems, Problem Spaces, and Search: Defining the Problem as a State Space 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 Search, 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 Problem.
5. Using Predicate Logic:- Representing Instance and Isa Relationships, Computable Functions and Predicates, Resolution, Natural Deduction.
6. Representing Knowledge Using Rules:- Procedural Versus Declarative knowledge, Logic Programming, Forward versus Back ward Reasoning, Matching, Control Knowledge.
7. Symbolic Reasoning under Uncertainty:- Introduction to Nonmonotonic Reasoning, Logics for Nonmonotonic Reasoning, Implementation Issues, Augmenting a Problem solver, Implementation:Depth-First Search, Implementation: Breadth_First Search.
8. Statstical Reasoning:- Probability and Baye’s Theorem, CertaintyFactors and Rule-Based Systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy Logic.
9. Weak Slot-and-Filler Structures:- Semantic Nets, Frames.
10. Strong Slot-and Filler Structures: Conceptual Dependency, Scripts, CYC.
11. Knowledge Representation Summary:- Syntactic-Semantic Spectrum of Representation, Logic and Slot-and-Filler Structures, Other Representational Techniques, Summary of the Role of Knowledge.
Text Book:
Artificial Intelligence, Elaine Rich, Kevin Knight, Tata McGrawHill
Reference:
Artificial Intelligence – A modern approach , Stuart Russel, Peter Norwig, Pearosn Education.
Syllabus of Andhra University MCA - MCA 2.2.5 Image Processing (Elective I)
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
1. Fundamentals of Image Processing : Image Acquisition, Image Model, Sampling, Quantization, Relationship between pixels, distance measures, connectivity , Image Geometry, Photographic film. Histogram: Definition, decision of contrast basing onhistogram, operations basing on histograms like image stretching, image sliding, Image classification. Definition and Algorithm of Histogram equalization.
2. Image Transforms : A detail discussion on Fourier Transform, DFT,FFT, propertiesA brief discussion on WALSH Transform , WFT, HADAMARD Transform, DCT.
3. Image Enhancement: (by SPATIAL Domain Methods)
a. Arithmetic and logical operations, pixel or point operations, size operations,
b. Smoothing filters-Mean, Median, Mode filters – Comparative study
c. Edge enhancement filters – Directorial filters, Sobel, Laplacian, Robert, KIRSCHHomogeneity & DIFF Filters, prewitt filter, Contrast Based edge enhancementtechniques. – Comparative study
d. Low Pass filters, High Pass filters, sharpening filters. – Comparative Study
e. Comparative study of all filters
f. Color image processing.
4. Image enhancement : (By FREQUENCY Domain Methods) -esign of Low pass,High pass, EDGE Enhancement, smoothening filters in Frequency Domain. Butter worthfilter, Homomorphic filters in Frequency Domain Advantages of filters in frequencydomain, comparative study of filters in frequency domain and spatial domain.
5. Image compression: Definition: A brief discussion on – Run length encoding,contour coding, Huffman code, compression due to change in domain, compression dueto quantization Compression at the time of image transmission. Brief discussion on:-Image Compression standards.
6. Image Segmentation: Definition, characteristics of segmentation.Detection of Discontinuities, Thresholding Pixel based segmentation method. Regionbased segmentation methods – segmentation by pixel aggregation, segmentation by subregion aggregation, histogram based segmentation, spilt and merge technique. Use ofmotion in segmentation (spatial domain technique only)
7. Morphology: - Dilation, Erosion, Opening, closing, Hit-and-Miss transform, Boundary extraction,Region filling, connected components, thinning, Thickening, skeletons , Pruning Extensions to Gray –Scale Images Application of Morphology in I.P
Text Book:
Digital Image Processing, Rafael C. Gonzalez and Richard E. Woods Addision Wesley
Reference books:
1. Fundamentals of Electronic Image Processing by Arthyr –R – Weeks, Jr. (PHI)
2. Image processing, Analysis, and Machine vision by Milan Sonka vaclan Halavac Roger Boyle, Vikas Publishing House.
Syllabus of Andhra University MCA - MCA 2.2.5 Distributed Systems (Elective I)
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
1. Characterization of Distributed Systems:- Introduction, Examples of distributed systems, Resource sharing and the Web, Challenges.
2. System models:- Introduction, Architectural models, Fundamental models.
3. Networking and Internetworking:- Introduction, Types of network, Network principles, Internet protocols, Network case studies: Ethernet,wireless LAN and ATM.
4. Interprocess communication:- Introduction, The API for the Internet protocols, External data representation and marshalling, Client-server communication, Group communication, Case study: Interprocess communication in UNIX.
5. Distributed Objects and Remote Invocation:- Introduction,Communication between distributed objects, , Remote procedure call, Eventsand notifications, Java RMI case study.
6. Distributed File Systems:- Introduction, File service architecture, Sun Network file system, The Andrew File System, Recent advances.
7. Name Services:- Introduction, Name services and the Domain Name System,Directory and discovery services, Case study of the Global Name Service, Case study of the X.500 Directory Service.
8.Time and Global States:- Introduction, Clocks, events and process states,Synchronizing physical clocks, Logical time and logical clocks, Global states,Distributed debugging.
9. Coordination and Agreement:- Introduction, Distributed mutual exclusion,Elections, Multicast communication, Consensus and related problems.
10. Transactions and Concurrency Control: - Introduction, Transactions, Nested transactions, Locks, Optimistic concurrency control, Timestamp ordering, Comparison of methods for concurrency control.
11. Distributed Transactions:- Introduction, Flat and nested distributed transactions, Atomic commit protocols, Concurrency control in distributedtransactions, Distributed deadlocks, Transaction recovery.
12. Replication:- Introduction, system model and group communication, fault tolerant services, Highly available services, Transactions with replicated data.
Text Book:
Distributed Systems – Concepts and Design, George Coulouris, Jean Dollimore, Tim Kindberg, Pearson Education.
Reference Book:
Distributed Systems – Principles & Paradigms, Andrew S. TenenBaum, Marten Van Steen, Pearson Education.
Syllabus of Andhra University MCA - MCA 2.2.6 Visual Programming Lab
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
Experiments using java AWT/swing (JFC)
Reading Data From Key Board
Handling Buttons, Labels, Text Fields, Text Areas, Scroll Bar
Handling Check Boxes, Radio, List Box, Sliders
Handling Menu
Handling Swing Components Like Progress Bars
Handling Databases Using JDBC Native Driver
Experiments using VC++
Reading Data From Key Board
Handling Buttons, Labels, Text Fields
Handling Check Boxes, Radio, List Box, Sliders.
Handling Menu. Tool Bars
File Handling
Internet Programming
Creative Active X Controls
Books
VC++, Steven Holzner , BPB publisher
Syllabus of Andhra University MCA - MCA 2.2.7 DBMS Lab
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
Course Description: This course explores database programming using both native andembedded ANSI-standard Structured Query Language (SQL). Topics include enterprisedatabase management systems, database middleware, data definition language, datamanipulation language, data control language, database queries reporting, queryoptimization, and database views. Student assignments include database creation, querydesign and programming, and database manipulation via embedded SQL calls from aprogramming language.
Course Goal: Successful graduates of this course should be able to:
Understand the fundamentals of a relational database
Understand the fundamentals of client-server and multi-tiered applications
Understand the use of Structured Query Language (SQL) as a data definition language, data manipulation language, and data control language
Understand and write SQL /PL_SQL queries to create, report, and update data in a relational database
Understand the purpose of and be able to create views, scripts, triggers, and transactions
Understand and be able to implement the fundamentals of security and permissions in SQL Server
Design entity relationship models for a business problem and develop a normalized database structure
Using Oracle under Windows platform and MySQL under Linux/Unix platform
Reference Books:
1. Introduction to Relational Databases and SQL Programming, Christopher Allen, Simon Chatwin, Catherine A. Vreary Tata McGraw-Hill
2. Oracle SQL and PL/SQL Hand book, John Adolph Palinski, Pearson Education
3. Oracle 9i PL/SQL Programming, Scott Urman, Tata McGraw-Hill
4. MySQL: The Complete Reference, Vikram Vaswani, Tata Mcgraw-Hill
5. MySQL Bible, Steve Suehring, Wiley
No comments:
Post a Comment