Sunteți pe pagina 1din 1

MCA301: OOPS with C++ Trade-Offs, Scheduling and Controlling Projects costs, An evaluation of

1. Introduction to Computer and C++ Programming 2. Control Game Theory: The formation of Two-Person, Zero-Sum Games, Solving Simple
Structures 3. Functions 4. Arrays Games, Games with mixed Strategies, Graphical Solution Procedures, Solving
Unit:-II by L.P.
5. Pointers and strings 6. Classes and Data Abstraction. 7. Inventory Theory: Components of Inventory Models, Deterministic Continuous
Review Models, A Deterministic periodic review model, A Stochastic Continuous
Classes Review Model.
Unit:-III Text Books
8. Operator overloading 9. Inheritance 10. Virtual Functions Hiller and Liberman, Introduction to Operations Research. (Seventh
and Polymorphism Edition)TMH:
Unit:-IV Chapter 3: 3.2, 3.3, 3.4 Chapter 4: 4.1 to 4.6 & 4.9 Chapter7: 7.1 to
7.4 Chapter 8: 8.1, 8.2, 8.3 Chapter 9: 9.3 to 9.6
11. C++ stream Input/ Output 12. Templates 13. Exception Chapter 10: 10.3 to 10.5 Chapter 11: 11.2 to 11.4
Handling 14. File Processing Chapter 14: 14.1 to 14.5 Chapter 17: 17.2, 17.4 to
Text Books 17.6
Deitel & Deitel, C++ how to Program, Third Edition (Pearson) Chapter 19: 19.2 to 19.5
(Chapter 1 through14) Reference Books
Reference Books 1. Ravindran Philips and Solberg, Operation Research Principles and
1. Tony Gaddis, Starting out with C++, third Edition Practice (Second Edition) John Wiley & Sons.
2. E. Balaguruswamy, Object Oriented Programming with C++, 2. Parameswaran, Operations Research, PHI
MCA302: Computer Networks Unit - I
Unit – I Introductory Fundamentals: Introduction, Video Display Devices, Raster Scan System, Random–
Uses of Computer Networks: Network Hardware: Network Software: Scan System, Graphics monitors & work stations, Input Devices,
Reference Models Example Networks, Example of Data Hardcopy Devices, Three Dimensional Viewing Devices, Graphical
Communications Services. User Interfaces and Interactive Input methods.
The Physical Layer & Data Link Layer Preliminaries: Unit - II
a. The maximum Data rate of a channel: Switching: Packet Switching: Line-drawing Algorithms – DDA, Bresenham’s Line, Circle and
Message Switching :Circuit Switching: Virtual Circuits versus Circuit Ellipse Generating Algorithms, Character Generation, Two
Switching b. The Data Link Layer Design Issues c. Sliding
window Protocols
Dimensional Geometric Transformations: Computer Animation.
Unit – II Medium Access Sublayer: Unit - III
a. IEEE STANDARD 802 for LAN’s and MAN’s. b. Bridges c. High Attributes of Output Primitives- Line, Curve, Area Fill, Character and
Speed LANs Bundled Attributes, Antialiasing, Two-Dimensional Viewing:
Unit – III The Network Layer & the Transport Layer: Unit - IV
a. Network Layer Design issues: b. Routing Algorithms: c. Internet Three-Dimensional concepts: Three-Dimensional object
working. d. Network Layer in the Internet: the I.P. protocol: I.P
Addresses: Subnets: Internet Control Protocols. e. The transport
representations- Polygon Surfaces, Curved Lines and Surfaces,
service. f. The Internet Transport protocol (TCP & UDP ) Quadric Surfaces: Three-Dimensional Geometric and Modeling
Unit – IV The Application Layer: Transformations, Three-Dimensional Viewing – Viewing Co-
a. DNS-Domain Name System b. SNMP-Simple Network ordinates, Projections, Transformations and Clipping.
Management Protocol c. Electronic Mail d. World Wide Web Text Books
e. Multimedia: Audio: Video. Computer Graphics-Donald Hearn and M. Paulin Baker, PHI (Second
Text Books Edition)
Tanenbaum A.S: Computer Networks (third Edition EEE, PHI, Reference Books:
1998) Computer Graphics Principles & Practices- “Foley, Vandam, Feiner,
Chapter I: 1.1 to 1.6 Chapter 2: 2.1, 3, 2.4, 5, 2.6.1 Hughes”, Addison Wesley.
Chapter 3: 3.1, 3.4 Chapter 4: 4.3, 4.4, 4.5
Chapter 5: 5.1, 5.2, 5.4, 5.5.1, 5.5.2, 5.5.3, 5.5.4 Chapter 6: 6.1, 6.4
Chapter 7: 7.2, 7.3, 7.4, 7.6, 7.7.1, 7.7.2. MCA305: ARTIFICIAL INTELLIGENCE
Reference Books Unit - I
1. Behrouz. A. Forouzan: Data Communications and Networking TMH 1. What is Artificial Intelligence 2. Items, Problem
2000. spaces & Search 3. Heuristic Search Techniques
TECHNIQUES 4. Knowledge Representation 5. Using Predicate
Unit-I Logic 6. Representing Knowledge using rules
Introduction to Linear Programming: The Linear Programming Model, Unit - III
Assumption of Linear Programming, Additional Examples, Solving LPP: The 7. Symbolic Reasoning 8. Week Slot –and-Filler
simplex method, the essentials of simplex methods, setting up the simple
method, The Algebra of the simplex method, the simplex methods in Tabular
Structures 9. Planning
form. Tie Breaking in simplex method, Adapting to the other model forms. Unit - IV
UNIT - II 10. Natural Language Processing 11. Common
Duality Theory: Primal Dual Relationships, Other Algorithm for linear sense 12. Expert System
programming, The dual simplex method, Text Books
The Transportations & Assignment Problems: The transportation Problems, A Rich & Knight: Artificial Intelligence: TMH (1991)
Streamlined simplex method for the transportation problems, The Assignment Chapter: One through Seven, Nine, Thirteen, Fifteen, Nineteen, and
UNIT - III Reference Books:
Network optimization Models, The shortest path Problem, the minimum
Winston. P.H.: Artificial Intelligence, Addison Wesley (1993)
spanning tree problem, the maximum flow problem, the minimum cost flow
problem, The Project Management with PERT/CPM, Scheduling a problem with
PERT / CPM, Dealing with uncertain activity durations, considering Time cost