vjti mca syllabus sem 3 and 4
DESCRIPTION
Semester 3 and Semester 4 SyllabusTRANSCRIPT
VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE
[ Autonomous Institute affiliated to University of Mumbai ]
SYLLABUS
FOR
S.Y. M.C.A.
VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE,
[V.J.T.I.]
MATUNGA, MUMBAI 400 019.
[ YEAR 2010-2011 ]
2
Scheme of Teaching and Evaluation
M C A (Semester III)
Theory Courses
Course
Code Course Name Hr/Week Credits Examination Scheme
(Evaluation in % Weightage)
L T P TA IST ESE Total ESE
(W)
(hrs)
MC0201 Data Base Management
Systems
3 - - 3 20 20 60 100 3
MC0202 Data Communication
Networks
3 - - 3 20 20 60 100 3
MC0203 Principles of Management 3 - - 3 20 20 60 100 3
MC0204 Optimization Techniques 3 - - 3 20 20 60 100 3
MC0205 Software Engineering 3 - - 3 20 20 60 100 3
Total 15 - - 15
Laboratory Courses
Course
Code Course Name Hr/Week Credits Examination Scheme
(Evaluation in % Weightage)
L T P TA ESE (O / P)
Total ESE
(P)
(hrs)
MC1201 Database laboratory - - 3 1.5 50 50 100
MC1202 Optimization techniques
laboratory
- - 3 1.5 50 50 100
MC1203 Networks laboratory I - - 3 1.5 50 50 100
MC2201 Seminar - - 3 1.5 50 50 100
Total - - 12 6
Co-curricular Activities
Course
Code Course Name Hr/Week Credits
L T P
CC4331 Industry Interaction - - 2 A/NA
CC4332 E-library - - 2 -
CC4333 Internet - - 2
Total - - 6 -
Total for
Semester
L T P Total Hours Credits
15 - 18 33 21
Abbreviations: L: Lectures, T: Tutorial, P: Practical, TA: Teacher Assessment, ESE (P):End Semester Practical Examination, ESE (O): End Semester Oral Examination, IST: In Semester Test/s, ESE (W):End Semester Written Examination, ESE (W) (hrs):End Semester Written Examination duration, ESE (O) (hrs):End Semester Examination Practical (duration), A/NA: Attended/Not Attended
Notes: TA for Theory and Laboratory courses shall carry 25 marks IST: One mid semester test (20 marks, one hour duration) and two surprise tests/quizzes (5 marks each). ESE(W) shall be of 100 marks and of 3 hours, ESE(P) and ESE(O) shall be decided as per course requirement. ESE(O) and ESE (P) shall together carry 25 marks.
3
Scheme of Teaching and Evaluation
M C A (Semester IV)
Theory Courses
Course
Code Course Name Hr/Week Credits Examination Scheme
(Evaluation in % Weightage)
L T P TA IST ESE Total ESE
(W)
(hrs)
MC0211 Object Oriented Analysis
and Design
3 - - 3 20 20 60 100 3
MC0212 Modeling and Simulation 3 - - 3 20 20 60 100 3
MC0213 Systems and Unix
Programming
3 - - 3 20 20 60 100 3
MC0214 Management Information
systems
3 - - 3 20 20 60 100 3
- Elective 3 - - 3 20 20 60 100 3
Total 17 - - 15
Laboratory Courses
Course
Code Course Name Hr/Week Credits Examination Scheme
(Evaluation in % Weightage)
L T P TA ESE (O / P)
Total ESE
(P)
(hrs)
MC1211 Object Oriented Designing
Lab
- - 3 1.5 50 50 100
MC1212 Modeling and Simulation
lab II
- - 3 1.5 50 50 100
MC1213 Systems Lab II - - 3 1.5 50 50 100
MC2341 Seminar - - 3 1.5 50 50 100
Total - - 12 6
Co-curricular Activities
Course
Code Course Name Hr/Week Credits
L T P
CC4341 Industry Interaction - - 2 P/NP
CC4342 E-library - - 2 -
CC4343 Internet - - 2
Total - - 6 -
Total for
Semester
L T P Total Hours Credits
15 - 18 33 21
Abbreviations: L: Lectures, T: Tutorial, P: Practical, TA: Teacher Assessment, ESE (P):End Semester Practical Examination, ESE (O): End Semester Oral Examination, IST: In Semester Test/s, ESE (W):End Semester Written Examination, ESE (W) (hrs):End Semester Written Examination duration, ESE (O) (hrs):End Semester Examination Practical (duration), P/NP: Attended/Not Attended
Notes: TA for Theory and Laboratory courses shall carry 25 marks IST: One mid semester test (20 marks, one hour duration) and two surprise tests/quizzes (5 marks each). ESE(W) shall be of 100 marks and of 3 hours, ESE(P) and ESE(O) shall be decided as per course requirement. ESE(O) and ESE (P) shall together carry 25 marks.
4
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC0201
Course Title : Database Management Systems
Course Contents:-
1. Introduction
Introduction, Characteristics of Database approach; Actors on the screen; Workers behind the scene; Advantages of using DBMS approach; A brief history of database applications; when not to use a DBMS. Data models, schemas and instances; Three-schema architecture and data independence; Database languages and interfaces; The database system environment; Centralized and client-server architectures; Classification of Database Management systems.
2. Entity – Relationship Model
Using High-Level Conceptual Data Models for Database Design; Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design; ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.
3. Relational Model and Relational Algebra
Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Update Operations, Transactions and dealing with constraint violations; Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational Operations : JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra; Relational Database Design Using ER- to-Relational Mapping.
4. SQL
SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in SQL; Basic queries in SQL; More complex SQL Queries. Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views (Virtual Tables) in SQL; Additional features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL / PSM.
5. Database Design
Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form
6. Transaction Management
The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock- Based Concurrency Control; Performance of locking; Transaction support in SQL; Introduction to crash recovery 2PC, 3PC protocol, Introduction to Query optimization
5
Text Books :-
1. Fundamentals of Database Systems
- Elmasri and Navathe, 5th Edition, Pearson Education, 2007.
2. Database Management Systems - Raghu Ramakrishnan and Johannes Gehrke, 3rd Edition,
McGraw-Hill, 2003
Reference Books :-
1. Database System Concepts - Silberschatz, Korth and Sudharshan, 5th Edition, McGraw-Hill,
2006.
2. A Introduction to Database Systems - C.J. Date, A. Kannan, S. Swamynatham, 8th Edition, Pearson
Education, 2006.
6
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC0202
Course Title : Data Communication Networks
Course Contents:-
1. Introduction
Introduction to Internet and Protocol, The Network Age, The Network Core, Circuit Switching, Packet Switching, and Message Switching, Routing in Data Networks, Access Networks and Physical Media, Delay and Loss in Packet-Switched Networks, Protocol Layers and Their Service Models
Internet Backbones, NAPs, and ISPs
2. Application Layer
Principles of Application Layer Protocols, The World Wide Web: HTTP, File Transfer: FTP, Electronic
Mail in the Internet, DNS--The Internet's Directory Service, Socket Programming with TCP, Socket Programming with UDP, Building a Simple Web Server
3. Transport Layer
Transport-Layer Services and Principles, Multiplexing and Demultiplexing Applications, Connectionless
Transport: UDP, Principles of Reliable Data Transfer, Connection-Oriented Transport: TCP, Principles of Congestion Control, TCP Congestion Control
4. Network Layer and Routing
Introduction and Network Service Models, Routing Principles, Hierarchical Routing, Internet Protocol, Routing in the Internet, Router internals, IPv4 and IPv6, Unicast, Multicast Routing
5. Link Layer and Local Area Networks
The Data Link Layer: Introduction, Services, Error Detection and Correction Techniques, Multiple Access Protocols and LANs, LAN Addresses and ARP, Ethernet, Hubs, Bridges, and Switches, IEEE 802.11 LANs; PPP: The Point-to-Point Protocol, Asynchronous Transfer Mode (ATM), X.25 and Frame Relay
6. Security in Computer Networks
What is Network Security?, Principles of Cryptography, Authentication: Who are You?, Integrity, Key Distribution and Certification, Secure E-Mail, Internet Commerce, Network Layer Security: IPsec
7. Network Management
What is Network Management?, The Infrastructure for Network Management, The Internet Network-Management Framework, Structure of Management Information: SMI, Management Information Base: MIB, SNMP Protocol Operations and Transport Mappings, Security and Administration, ASN.1, Firewalls
Text Books :-
1. Computer Networking: A Top-Down Approach
- James F. Kurose and Keith W. Ross, Addison Wesley, second edition, 2004.
2. Data and Computer Communications
- William Stallings, Seventh Edition, Pearson Education, 2004.
Reference Books :-
1. Computer Networks - Andrew S. Tanenbaum, PHI, Fourth Edition, 2003.
2. Computer Networks - Larry L. Peterson and Peter S. Davie, Harcourt Asia Pvt. Ltd.,
Second Edition.
7
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC0203
Course Title : Principles of Management
Course Contents:-
1. Management
Definition, functions, Systems approach to management, Social responsibility of management.
2. Planning and Decision Making
Types of plans, Steps in planning. Decision making: Decision making process. Rationality in decision making, Programmed and non-programmed decisions, decision making under uncertainty.
3. Organizing
Formal and informal organization, departmentalisation, span of management, decentralization of authority and delegation of authority.
4. Staffing
Staffing function, matching the person with the job, selection process. Performance appraisal, objectives and techniques. Career planning. Management development, on the job training, internal and external training.
5. Leading
Motivation, Maslow‟s need hierarchy, Herzberg‟s maintenance theory, expectancy theory, equity theory, McClelland‟s need theory, monetary incentives, job enrichment. Leadership definition, leadership continuum, managerial grid, Hersey Blanchard‟s situational leadership theory. Communication process, upward, downward and lateral communication. Grapevine in organizations. Barriers to effective communications.
6. Controlling
Control process, critical control points and standards, feedback, concurrent and feed forward control, requirements for effective control.
Text Books :-
1. Essentials of Management - Koontz Harold and Weihrich Heinz, Tata McGraw Hill, 8th edition.
2. Principles of Management - Tripathy PC And Reddy PN, Tata McGraw-Hill, 1999.
Reference Books :-
1. Personnel and Human Reasons Management
- Decenzo David, Robbin Stephen A, Prentice Hall of India, 1996
2. Essentials of Management - Joseph L Massie , Prentice Hall of India, Fourth Edition, 2003
3. Principles and Practice of Management - L.M. Prasad, Sultan chand Publications, New Delhi 6th edition, 2001
4. Marketing Management - S. Namakumari, V.S. Ramaswamy, MacMillon Publishers, India, 4th
edition
5. International Marketing - Francis Cherunilam, Himalaya Publishing House
8
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC0204
Course Title : Optimization Techniques
Course Contents:-
1. Nature of Operations Research
History, Nature of OR, Impact of OR, Application areas
2. Overview of Modeling Approach
Formulating the problem, Constructing a Mathematical model, Deriving a solution, Testing the Model
and the Solution, Establishing Control over the solution ( sensitivity analysis), Implementation issues
3. Linear Programming
Linear Programming model, Assumptions of Linear Programming, Formulation of LPP, Graphical
Solution to LPP, Graphical Sensitivity Analysis ( The meaning of these results and their use in decision
making), The essence of Simplex method, The Algebra of Simplex method, The setting up of tables and
solution using tabular method - Primal Simplex method, Sensitivity Analysis and their comparison with
numbers obtained in graphical method, The Big M method, The Two phase simplex technique, The
revised Simplex method, The Dual simplex method, The Duality theory and dual of the LPP/ Economic
interpretation of the Dual, Role of duality in Sensitivity Analysis/ Essence of Sensitivity Analysis,
Parametric programming
4. Special Cases in LP
Transportation problem, optimization techniques for TP (Modi Method, Stepping stone method),
Sensitivity Analysis for TP, Assignment Problem: Hungarian Method, Travelling salesman problem
(Branch and bound technique, Hungarian method), Sequencing Problem (2 machines n jobs, 3 machines
n jobs, n machines m jobs, n machines 2 jobs graphical method), GOAL programming: Non Preemptive,
Preemptive models, solution methods
5. Dynamic Programming
Characteristics of DPP, Deterministic DPP, Case Problems
6. Game Theory
Formulation of two person, zero sum games, Solving simple games, Graphical solution procedure,
Solving by Linear Programming
7. Network Analysis including PERT CPM
Terminology of networks, The shortest path problem, The minimum spanning tree problem, The
maximum flow problem, The network simplex method, drawing of the network, Definition of various
times involved in PERT network, Calculation of slacks, Critical path, variances and standard deviation,
Times associated with CPM network, floats, Critical path, Updating the network, Crashing the network,
Resource leveling and Resource loading, Application to networks.
8. Queuing Theory
Basic terminology. Introduction to queuing models.
9. Inventory Control
Concepts and terminology. Deterministic models. Probabilistic models
Text Books :-
1. Introduction to Operations research - Hamdy Taha, 8th edition Pearson Education, 2008
2. Operations Research - S.D. Sharma, R. K. Malhotra, Anmol Publisher, 1997
Reference Books :-
1. Quantitative Techniques in Management - N.D.Vora, Tata McGraw-Hill, 2008.
2. Introduction to Operations Research - Hiller Leiberman , Tata McGraw-Hill, 2008
9
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC0205
Course Title : Software Engineering
Course Contents:-
1. Introduction
Programs vs. Software Products, Software Characteristics.
Emergence of Software of Software Engineering.
Notable Changes in Software Development Process.
Software life cycle/process models: Classical waterfall model, Iterative waterfall model, RAD model,
prototyping model, Evolutionary model, spiral model, concurrent model.
Comparison of Different Life Cycle Models.
2. Software Project Management
Project Planning - problem, process.
Project Size Estimation Metrics: Measure, Metrics and Indicators, Lines of Code (LOC), Function Point
Metric, Feature Point Metric.
3. Software Project Planning
Software Scope.
Decomposition Techniques.
Software Estimation Techniques - COCOMO Model, Heuristic Techniques.
Analytical Estimation Techniques - Expert Judgment, make-buy decision.
4. Project Scheduling and Tracking
Relationship between People and Effort: Staffing Level Estimation, Effect of schedule change on cost.
Selecting Software Engineering Tasks: Degree of rigor, Task set selector, Task Network.
Schedules, work break down structures, Task Network/Activity Networks, Gantt Charts, PERT charts.
Organization and Team Structures.
5. Software Risk Management
Risk Identification, Risk Assessment and Risk Projection, Risk Containment, Risk Mitigation,
Monitoring and Management.
6. Software Configuration Management
Necessity of Software Configuration Management baselines, SCM Process and SCL Configuration,
Audit Version Control Source Code Control Systems (SCCS).
7. Overview of Requirement Analysis and Specification
Requirement Analysis, Software Requirement Specification (SRS): SRS Documents, Characteristics of
a good SRS Documents, Organization of the SRS Documents, Techniques for representing complex
logic formal systems development techniques.
8. Software Design
Introduction to Good Software Design, Cohesion and Coupling: Classification of Cohesiveness,
Classification of Coupling, Software Design Approaches, Function-oriented design.
9. Function Oriented Software Design
Overview of the SA/SD Methodology, Structured Analysis, Data Flow Diagrams(DFDs), Extending the
DFD Techniques to Real Time Systems, Structured Design.
10
10. Software Testing
Testing Overview: Verification vs. Validation, Designs of Test cases
Black-box testing: Equivalence Class Partitioning, Graph based testing, Boundary value analysis.
White-box testing: Statement coverage, branch coverage, Condition coverage, Path coverage,
Cyclomatic complexity, Metric Data Flow based testing.
Testing Specialized Environments, Testing GUI Testing Client Server Architectures.
Integration Testing: Top Down Testing, Bottom Up Testing, Regression Testing, Phased vs Incremental
Integration Testing.
System Testing: Stress Testing, Recovery Testing, Security Testing.
11. Software Reliability
Software Reliability.
Reliability Metrics.
Reliability Growth Modeling.
12. Software Quality Concepts
Software Quality Management System.
Software Quality Assurance.
Software Reviews.
Formal Technical Reviews.
Overview of ISO 9000.
SEI Capability Maturity Model.
13. Software Maintenance
Software Reverse Engineering.
Software Maintenance Costs.
Estimation of Maintenance Costs.
Text Books :-
1. Software Engineering: A Practitioner‟s Approach
- Pressman, Sixth Edition, McGraw-Hill, 2009.
2. An Integrated Approach to Software Engineering
- Pankaj Jalote , Third Edition, Narosa Publishing House, 2009.
Reference Books :-
1. Software Engineering - Ian Sommerville , 8th Edition, Pearson Education, 2007.
2. Fundamentals of Software Engineering - Rajib Mall , Third Edition, Prentice Hall of India, 2009.
11
Programme Name : S.Y. M.C.A. SEMESTER –III
Course Code : MC1201
Course Title : Database Laboratory [Lab. Course]
Title of the Experiment
1. Analyze the given problem statement.
2. Design the E-R diagram.
3. Perform normalization.
4. Create the database in MySQL / SQLServer/ Oracle/DB2
5. Write single table queries
6. Write multiple table queries with various JOINS
7. Write multiple table queries with Select Qualifiers, constraints
8. Write full blown queries
9. Write full nested queries
10. Write full embedded queries along with cursors
11. Importing, exporting features of databases
12
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC1202
Course Title : Optimization Techniques Laboratory [ Lab. Course ]
Title of the Experiment
1. Graphical method to solve two dimensional Linear Programming Problem.
2. Revised Simplex method to solve n-dimensional Linear Programming Problem.
3. Dual Simplex method to solve n-dimensional Linear Programming Problem.
4. Solution of Transportation Problem.
5. Gomory cutting plane methods for Integer Programming Problems.
6. Branch and Bound method to solve Integer Programming Problem.
7. M1M/I/N and M/M/C queuing problems.
8. Single item deterministic inventory model problems with/without shortage and finite/infinite production rate.
9. To draw the PERT/CPM networks.
10. Calculations of PERT analysis.
11. Calculation of CPM analysis.
13
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC1203
Course Title : Networks Laboratory I [Lab. Course]
Title of the Assignment:
1. Familiarization of simple networking commands like ping, etc.
2. Write a program to find the essential traffic flow through the network.
3. Write a program for sliding window algorithm
4. Write a program for error detecting code using CRC-CCITT (16-bits).
5. Write a program for distance vector algorithm to find suitable path for transmission.
6. Using TCP/IP sockets, write a client – server program to make the client send the file name and to make the server send back the contents of the requested file if present.
7. Implement the above program using as message queues or FIFOs as IPC channels.
8. Write a program for simple RSA algorithm to encrypt and decrypt the data.
9. Write a program for congestion control using leaky bucket algorithm.
14
Programme Name : S.Y. M.C.A. SEMESTER – IV
Course Code : MC0211
Course Title : Object Oriented Analysis & Design
Course Contents:-
1. Introduction to OO Methodology
Overview of prominent OO Methodologies. Initial developments. OMT(Rumbaugh), Booch methodology,
OOSE(Jacobson), Responsibility Driven Design(Rebecca WirfBrock)
2. Introduction to UML
An overview of UML concepts and details of their various stages
3. Use Case and Activity Diagrams
Describing system functional requirements with use case diagrams and activity diagrams. Relationships Between use
cases in the use case diagrams. Describing temporal sequencing of use cases with Activity Diagrams.
4. Basic Concept and Notations
Basic concepts and Notation for Class Diagram, Classes, Attributes, methods, Associations, Aggregation and composition. Class specialization. Inheritance, type promotion and polymorphism.
5. Advanced concepts and Notations
Advanced concepts and notation for class diagrams, Association rules, Qualified associations, Association classes, Dependencies, refinements, Extension mechanisms.
6. Class Modeling and Design Approaches
Three approaches for identifying classes, class relationships, etc. comparison of approaches, Using combination of approaches.
7. UML Extension Mechanisms
The use of properties, constraints and stereotypes to extend the UML notation.
8. Flexibility guidelines for Class Design UML Extension Mechanisms
Guidelines that lead to more extensible and reusable class designs. Coupling and cohesion in object oriented programs. Guidelines for increasing Cohesion and reducing coupling. Guidelines for the use of inheritance. Using aggregation versus using inheritance.
9. Concepts and Notation for Interaction Diagrams
The concepts and notation for collaboration and sequence diagrams. Denoting iteration, branching and Object creation and destruction in each type of diagram. The relationship of interaction diagrams to the class diagrams.
10. Concepts and notations for State Transition Diagrams
When to use state transition diagrams. The notation for the diagrams, including composite states, history states, and concurrent state machines.
15
11. Behavioral Design Approaches
The “Top-Down” versus the “Bottom-Up” approaches to designing class behaviors. Use cases revisited: Three approaches for identifying a problem‟s use cases. The top-down process of identifying required scenarios, then turning those scenarios into interaction diagrams, object methods and state machines. The “Bottom-Up” approach of concentrating on class responsibilities.
12. Flexibility Guidelines for Behavioral Design
Guidelines for allocating and designing behaviors that lead to more flexible designs. Coupling revisited. Avoiding centralized control. The overuse of accessor methods. Trading off extensibility versus reuse.
13. System Architecture
Layered architecture. The package concept. And it‟s UML notation. Defining layers and subsystems as Packages. How to decompose a system into subsystems. The UML component diagram
14. Concurrency and Synchronization
Threads and processes. Managing concurrent access to objects. Scheduling approaches. Introducing Concurrency in UML interaction diagrams.
15. Physical distribution and the UML deployment diagram
16. Framework and Design Patterns
An introduction to reuse through class libraries, framework and design patterns.
Text Books :-
1. Designing Flexible Object Oriented systems with UML
- Charles Richter, Alpha Books.
2. UML user‟s guide - Booch, Rumbaugh, Jacobson, Addison Wesley
Reference Books :-
1. Object Oriented Systems Development - Ali Bahrami, Tata McGraw-Hill, 1999 (Unit I, III, IV, V).
2. UML Distilled - Martin Fowler, Second Edition, PHI/Pearson Education, 2002. (UNIT II)
Wesley,1999.
3. UML Toolkit - Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, OMG
Press Wiley Publishing.,2004.
4. Introduction to Object Oriented Analysis and Design
- Stephen R. Schach, Tata McGraw-Hill, 2003.
16
Programme Name : S.Y. M.C.A. SEMESTER –IV
Course Code : MC0212
Course Title : Modeling and Simulation
Course Contents:-
1. Introduction
Introduction to Simulation, its use as proper tool; Advantages and disadvantages of Simulation; Areas of application; Systems and system environment; Components of a system; Discrete and continuous systems; Model of a system; Types of Models; Discrete-Event System Simulation; Steps in a Simulation Study. The basics of Spreadsheet simulation, Simulation example: Simulation of queuing systems in a spreadsheet.
2. General Principles, Simulation Software
Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance Algorithm, World Views, Manual simulation Using Event Scheduling; List processing. Simulation in Java; Simulation in GPSS
3. Statistical Models in Simulation
Review of terminology and concepts; Useful statistical models; Discrete distributions; Continuous distributions; Poisson process; Empirical distributions.
4. Queuing Models
Characteristics of queuing systems; Queuing notation; Long-run measures of performance of queuing systems; Steady-state behavior of M/G/1 queue; Networks of queues; Rough-cut modeling: An illustration..
5. Random-number generation, Random-value generation
Properties of random numbers; Generation of pseudo-random numbers; Techniques for generating random numbers; Tests for Random Numbers Random-Variate Generation: Inverse transform technique; Acceptance-Rejection technique; Special properties.
6. Input Modeling
Data Collection; Identifying the distribution with data; Parameter estimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without data; Multivariate and Time-Series input models.
7. Estimation of Absolute Performance
Types of simulations with respect to output analysis; Stochastic nature of output data; Absolute measures of performance and their estimation; Output analysis for terminating simulations; Output analysis for steady-state simulations.
8. Verification, Calibration, and Validation Optimization
Model building, verification and validation; Verification of simulation models; Calibration and validation of models, Optimization via Simulation
Text Books :-
1. Discrete-Event System Simulation - Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol, 5th Edition, Pearson, 2010.
2. Discrete – Event Simulation - A First Course-Lawrence M. Leemis, Stephen K. Park, Pearson, 2006.
Reference Books :-
1. System simulation with digital computers - Narsing Deo PHI.
2. Simulation Modeling and Analysis - Averill M.Law, 4th Edition,Tata McGraw-Hill, 2007.
17
Programme Name : S.Y. M.C.A. SEMESTER –IV
Course Code : MC0213
Course Title : System and Unix Programming
Course Contents:-
1. Language Processing
Fundamentals of Language Processing Development Tools – System Software and Machine Architecture – Hypothetical Computer – CISC and RISC Machines.
2. Basic Assembler Functions
Machine-dependent and Machine-independent Assembler features – Assembler Design options – Implementation Examples.
3. Basic Macro Processor Functions
Machine-independent Macro Processor features – Design options and Examples.
4. Basic Loader Functions
Machine-dependent and Machine-independent Loader features – Design options – Linkage Editors, Dynamic Linking and Bootstrap Loaders. Implementation Examples.
5. MS-DOS linker, SUN-OS Linkers and Cray MPP linker
Comparison of compilers and Interpreters – Software Tools – Tools for programming development – Editors – Debug monitors – Programming Environments – User Interfaces – Devices Drivers – Windows NT internals – UNIX Shell Programming and Batch Processing in MS-DOS.
6.Scanning And Parsing
Introduction to Regular Expressions and Finite State Automata. Optimization of DFA Based Pattern Matchers. Top-down and Bottom-up Parsing Techniques. Recursive Descent Parsing. LL (1) Parsing. LALR Parsing and Operator Precedence Parsing. LEX and YACC. Syntax Directed Translation.
7.Compilers And Interpreters
Aspects of Compilation. Memory Allocation: Run time storage organization, Static, Dynamic, Heap Storage and Garbage Compaction. Phases of Compilation: Lexical Analysis; Syntax Analysis; Intermediate Code Generation; Machine Independent and Machine Independent Code Optimization. Compilation of Expressions and Control Structures. Interpreters. Java Compiler and Environment. YACC Compiler-Compiler.
8. UNIX programming
File system and attributes, General purpose utilities and commands, Vi editor, shell programming, process, filters and regular expressions
Text Books :-
1. An Introduction to System Programming - Leland L. Beck, 3rd Edition, 1999, Addison Wesley
2. Systems Programming and Operating Systems
- D.M.Dhamdhere, 2nd Edition, 1997, TMH
Reference Books :-
1. Compilers Principles and Techniques - A.V. Aho, Ravi Sethi & J.D. Ullman, Pearson Education.
2. Systems Programming - J.J Donovan, TMH
3. Unix Concepts and applications - Sumitabha Das, TMH
4. Unix and shell programming - Behrouz A. Forouzan, Richard F. Gilberg, Cengage
18
Programme Name : S.Y. M.C.A. SEMESTER –IV
Course Code : MC0214
Course Title : Management Information Systems
Course Contents:-
1. System Engineering
System concepts, system control, types of systems, handling system complexity, Classes of systems, General
model of MIS, Need for system analysis for existing system & new requirement, system development model, MIS & system analysis.
2. Information and Knowledge
Information concepts, classification of information, methods of data and information collection, value of information, information: A quality product, General model of a human as information processor.
3. Introduction of MIS
MIS: Concept, Definition, Role of the MIS, Impact of MIS, MIS and the user, Management as a control system, MIS support to the management, Management effectiveness and MIS, Organization as a system. MIS: organization effectiveness.
4. Strategic Management of Business
Concept of corporate planning, Essentiality of strategic planning, Development of the business strategies, Type of strategies, short-range planning, tools of planning, MIS: strategic business planning
5. Development of MIS
Development of long range plans of the MIS, Ascertaining the class of information, Determining the information requirement, Development and implementation of the MIS, Management of information quality in the MIS, Organization for development of MIS, MIS development process model
6. Developing Business/IT Strategies/IT Solutions
Planning fundamentals (real world cases), Organizational planning, planning for competitive advantage,(SWOT Analysis), Business models and planning. Business/IT planning, identifying business/IT strategies, Implementation Challenges, Change management., Developing business systems, (real world case), SDLC, prototyping, System development process, implementing business system
7. Business Process Re-Engineering
Introduction, Business process, process model of the organization, value stream model of the organization, what delay the business process, relevance of information technology, MIS and BPR
8. Technology of Information System
Introduction, Data processing, Transaction processing, Application processing, information system processing, TQM of information systems, Human factors & user interface, Strategic nature of IT decision, MIS choice of information technology
9. Decision Making and DSS
Decision making concepts; decision making process, decision-making by analytical modeling, Behavioral concepts in decision making, organizational decision-making, Decision structure, DSS components, Management reporting alternatives.
10. Data Resource Management
Managing data sources, Foundation concepts of data, types of databases, traditional file processing, DBMS approach, Database structure, Database development
11. Electronic Business Systems
Enterprise business system – Introduction, cross-functional enterprise applications, real world case, Functional business system, - Introduction, marketing systems, sales force automation, CIM, HRM, online accounting system, Customer relationship management, ERP, Supply chain management (real world cases for the above)
19
12. Enterprise Business Systems
Electronic commerce fundamentals, e-Commerce applications and Issues, (real world cases)
13. Client Server Architecture and E-Business Technology
Client server architecture, implementation strategies, Introduction to E-business, model of E-business, internet and World Wide Web, Intranet/Extranet, Electronic, Impact of Web on Strategic management, Web enabled business management, MIS in Web environment.
Text Books :-
1. Management Information Systems for Information Age
- Haag, Cummins, Dawkins, 4th Edition, TMH
2. Management Information Systems - Jawadekar W.S., 2nd Edition, TMH
3. IS Management in Practice Barbara McNurlin, 5th Edition, Pearson
Reference Books :-
1. Database Systems: Design, Implementation and Management
Rob, Coronel, 5th Edition, Thomson Learning.
2. Management Information Systems Ralph Stair/George Reynold, 5th Edition, Thomson Learning
20
Programme Name : S.Y. M.C.A. SEMESTER –IV
Course Code : MC1211
Course Title : Object Oriented Designing Lab [Lab. Course]
Title of the Experiment
Select any application area to develop an appropriate information system using object oriented approach.. Students have to find a real source of data and go through the following stages.
1. Preliminary investigation.
2. Collection of data and understanding the system and requirements.
3. Development of Use case diagrams.
4. Development of activity diagrams.
5 Development of class diagrams
6 Development of collaboration/communication diagrams.
7 Development of state machine diagram.
8 Development of component and deployment diagrams.
9 Using the above analysis, develop the software/information system
21
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC1212
Course Title : Modeling and Simulation [ Lab. Course ]
Title of the Experiment
1. Simulation and study of the queuing system with Poisson arrivals and departures.
2. Simulation and study of a queuing system with non Poisson arrivals and departures.
3. Simulation and study of a project network with activity time not fixed but following a probability distribution
4. Simulation of any game
5. Application of simulation for job scheduling
6. Study of resource allocation on project network using simulation
7. Student should explore at least one problem in any of the simulation software
8. Project: Students have to search and find a real life application themselves and develop the software for a
solution using simulation
22
Programme Name : S.Y. M.C.A. SEMESTER – III
Course Code : MC1213
Course Title : Systems Lab II [Lab. Course]
Title of the Experiment
Design, develop, and execute the following programs using LEX:
1. a) Program to count the number of characters, words, spaces and lines in a given input file.
b) Program to count the numbers of comment lines in a given C program. Also eliminate them and copy the resulting program into separate file.
2. a) Program to recognize a valid arithmetic expression and to recognize the identifiers and operators present. Print
them separately. b) Program to recognize whether a given sentence is simple or compound.
3. Program to recognize and count the number of identifiers in a given input file.
Design, develop, and execute the following programs using YACC:
4. a) Program to recognize a valid arithmetic expression that uses operators +, -, * and /.
b) Program to recognize a valid variable, which starts with a letter, followed by any number of letters or digits.
5. a) Program to evaluate an arithmetic expression involving operators +, -, * and /.
b) Program to recognize strings „aaab‟, „abbb‟, „ab‟ and „a‟ using the grammar (anbn, n>= 0). 6. Program to recognize the grammar (anb, n>= 10).
UNIX Programming: Design, develop, and execute the following programs:
7. a) Non-recursive shell script that accepts any number of arguments and prints them in the Reverse order, (For example, if the script is named rargs, then executing rargs A B C should produce C B A on the standard output). b) C program that creates a child process to read commands from the standard input and execute them (a minimal implementation of a shell – like program). You can assume that no arguments will be passed to the commands to be executed.
8. a) Shell script that accepts two file names as arguments, checks if the permissions for these files are identical and if the permissions are identical, outputs the common permissions, otherwise outputs each file name followed by its permissions. b) C program to create a file with 16 bytes of arbitrary data from the beginning and another 16 bytes of arbitrary data from an offset of 48. Display the file contents to demonstrate how the hole in file is handled.
9. a) Shell script that accepts file names specified as arguments and creates a shell script that contains this file as well as the code to recreate these files. Thus if the script generated by your script is executed, it would recreate the original files(This is same as the “bundle” script described by Brain W. Kernighan and Rob Pike in “ The Unix Programming Environment”, Prentice – Hall India). b) C program to do the following: Using fork( ) create a child process. The child process prints its own process-id and id of its parent and then exits. The parent process waits for its child to finish (by executing the wait( )) and prints its own process-id and the id of its child process and then exits.
23
Programme Name : S.Y. M.C.A. SEMESTER – IV
Course Code : MC0271
Course Title : Artificial Intelligence
Course Contents:-
1. Scope of AI
Games theorem proving, natural language processing, vision and speech processing, robotics, expert systems, AI techniques search knowledge, abstraction
2. Problem/Solving
Intelligent agents, State space search: Production systems, Search space control: Depth first, breadth search, heuristic search- Hill climbing, best first search, branch and bound. Minimax search: Alpha-Beta cut offs.
3. Knowledge Representation
Predicate logic: Skolemizing queries, Unification, Modus pones, Resolution dependency directed backtracking. Rule Based Systems : Forward reasoning : Conflict resolution , Backward reasoning : Use of no backtrack Structures Knowledge Representations : Semantic Net: slots, exception and defaults Forms
4. Handling Uncertainty
Probabilistic reasoning. Use of certainty factors, fuzzy logic.
5. Learning
Concept learning automation, genetic algorithm, learning by induction, neural nets back propagation
6. Expert Systems
Need of justification for expert systems. Knowledge acquisition. Case studies: MYCIN, RI, Planning.
Text Books :-
1. Artificial Intelligence - Russell, Norvig, 2nd Edition, Pearson Education, 2007.
2. Artificial Intelligence - Rich. E. and Knight K., 2nd Edition, Tata McGraw-Hill.
Reference Books :-
1. Artificial Intelligence: A new Synthesis - Nils J. Nilsson, Harcourt Asia Pvt. Ltd., 2000.
2. Artificial Intelligence-Structures And Strategies For Complex Problem Solving
- George F. Luger, Pearson Education / PHI, 2002.
24
Programme Name : S.Y. M.C.A. SEMESTER – IV
Course Code : MC0272
Course Title : Wireless Technology
Course Contents:-
1. Introduction and Overview
Fundamental concepts of Wireless technology, Its need and evolution
2. Communication and Fundamentals Review and Wireless Communications
Technology, Transmission Fundamentals, Communication Networks, TCP/IP suite, Antena and propagation
3. Wireless Communication Technology
Signals, Spread Spectrum, coding and error control
4. Wireless Web
Internet, Mobile IP,Web, Wireless Web
5. Cellular Networks
First Generation, Second Generation, Third Generations systems
6. Introduction to Fixed Wireless Access Protocol
7. Mobile IP and Wireless Access Protocol
8. Satellite Communications
Satellite Orbits, Use of Satellite for Communication, Satellite Parameters and Configuration, Capacity Allocation (Frequency Division and Time Division)
9. Wireless LANs
Overview, Infra res LANS, Spread spectrum LANS, Narrow Band Micowave LANs
10. IEEE 802.11
802 Protocol Architecture 802.11- Architecture and Services, MAC and physical layer
11. Bluetooth
Overview Radio Specification, Baseband Specification, Link Manager Specification, Logical link Control and adaptation
12. Mobile Computing Applications
13. Special Topics: Wireless Security, The future of Wireless
Text Books :-
1. Wireless Communications Networks - William Stallings, Prentice Hall, 2002
2. Mobile Computing and Wireless Networks
- Umer A., NGE Solutions, July 2004
Reference Books :-
1. Wireless Communication Technology - Black Roy, Chartrand Leo, Delmar Cengage Learning; 1 edition, 2000
2. Mobile Communications - Jochen Schiller, Second Edition, Addison Wesley
25
Programme Name : S.Y. M.C.A. SEMESTER – IV
Course Code : MC0274
Course Title : Data Structures and Algorithms
Course Contents:-
1. Algorithm Analysis
Mathematical Background; The Model; The Time Complexity: How to Analyze and Measure; Big-Oh and Big-
Omega Notations; Best Case, Average Case and Worst Case Analyses.
2. Lists
Abstract Data Types; Stacks: ADT; Representation; Operations; Examples; Applications; Queues: ADT; Representation; Operations; Circular and Priority Queues; Examples; Applications; Other Lists and their Implementations.
3. Linked Lists
ADT; Dynamic Memory and Pointers; Dynamic Representation: Insertion and Deletion of Nodes; Linked Stacks and Queues; Linked Lists as Data Structures; Array Implementation of Linked List; Comparison of Dynamic and Array Representations.
4. Binary Tree
Binary Tree Operations and Applications; Binary Tree Representations: Node Representation; Array Representation; Binary Tree Traversals; The Huffinan Algorithm; Representing Lists as Binary Trees: Finding and Deleting Elements, Tree-Represented Lists
5. Sorting Methods
Efficiency Considerations in Sorting; Different Sorting Methods: Bubble Sort; Quicksort; Straight Selection Sort; Binary Tree Sort; Heaps and Heap sort; Heap as Priority Queue; Insertion Sort; Shell Sort; Bucket Sort; Merge Sort; Radix Sort; Time Complexity Calculation: Best Case, Worst Case and Average Case Calculations of the Different Sorting Methods.
6. Searching Methods
Efficiency Considerations in Searching; Basic Searching Techniques: Sequential Search; Efficiency Considerations for Sequential Search; Searching Ordered Table; Indexed Sequential Search; Binary Search; Interpolation Search; Binary Search Tree: Implementation; Insertions and Deletions; Efficiency Considerations; General Search Trees: Multiway Search Trees; B- Trees; Hashing: Hash Functions; Resolving Clashes (Open and Closed Hashing); Hashing in External Storage; Dynamic Hashing.
7. Graph as a Data Structure
Representation and Construction of a Graph; Operations on Graph.
8. Algorithms
Greedy Method; Divide and Conquer Method; Dynamic Programming; Back-Tracking Method.
26
Text Books :-
1. Introduction to Algorithms - Corman, Leiserson, Rivest, Stein, Eastern Economy
Edition, 2005
2. Algorithm Design - Klienberg, Eva Tardos, Pearson Education
Reference Books :-
1. Fundamentals of Algorithms - G. Brassard and P. BratIey, Prentice-Hall India
2. Data Structures: A Pseudocode Approach with C - R. F. Gilberg, Thomson Learning
3. Data Structures and Algorithms - Aho, J. E. Hopcroft and J. D. Ullman, Addison Wesley,
Low Price Edition
4. Data Structures and Algorithms in C++ - M. A. Weiss, Addison Wesley Longman, International
Student Edition.
5. Data Structures and Program Design in C - R. Kruse, Prentice-Hall India.
6. Data Structures and Algorithms - Tremble and Sorenson, Tata McGraw-HilI.
7. Fundamentals of computer algorithms - Ellis Horwitz, Sartaj Sohoni ,Galgotia Publication 501