ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY

Guwahati

Course Structure
MASTER OF COMPUTER APPLICATIONS (MCA)

(From Academic Session 2018-19 onwards)

MCA 3rd Semester

 ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY
Guwahati
Course Structure

MASTER OF COMPUTER APPLICATIONS (MCA)

(From Academic Session 2018-19 onwards)
MCA 3rd Semester
Semester III/ MCA
Hours per Week Credits Marks
Sl. No. Sub-Code Subject
L T P C CE ESE
Theory
1 MCA182301 Operating Systems 3 0 0 3 30 70
Design and Analysis of
2 MCA182302 3 1 0 4 30 70
Algorithms
Database Management
3 MCA182303 3 0 0 3 30 70
Systems
Object Oriented
4 MCA182304 3 0 0 3 30 70
Programming and Design
Computer Graphics and
5 MCA182305 3 0 0 3 30 70
Multimedia
Practical
Laboratory-III
1 MCA182316 (DBMS, OOPD, 0 0 8 4 30 70
PYTHON, LINUX Lab)
TOTAL 15 1 8 20 180 420
Total Contact Hours per week : 24
Total Credits: 20

Assam Science and Technology University Page 1|8

 Course Code Course Title Hours per week Credit
L-T-P C
MCA182301 Operating Systems 3-0-0 3

MODULE 1: Historical perspective: (3 Lectures)

Batch processing, multiprogramming, time-sharing, distributed system, Functions, components and
structure of an operating system.
MODULE 2: (18 Lectures)
Process Management:
Support for concurrent processes -Trade-off sequential and concurrent processing with examples in
implementation Shared data, Critical sections, Mutual exclusion, Mutual exclusion, busy form of
waiting, lock and unlock primitives, semaphore, Synchronization, block and wakeup, Inter process
communication, message passing mechanism.
Threads:
Multithreading Models, Threading issues, kernel and user thread implementations Pthreads.
Scheduling :
Process states, interrupt mechanisms, Types of scheduling algorithms , implementation of concurrency
Primitives.
System deadlock : Causes o deadlock and deadlock handling strategies Prevention , detection and
avoidance .

MODULE 3: (5 Lectures)
I/O Management device controller I / O Software goals and structure, Device drivers , Terminal
handling, Block and character devices.

MODULE 4: Memory Management: (5 Lectures)

Static and dynamic memory management protection and sharing. Contiguous and non - contiguous
memory allocation; Swapping Virtual memory paging and Segmentation -page replacement and space
allocation policies. combined paging and segmentation page replacement policies

MODULE 5: File System: (5 Lectures)

System Structure, File management strategies, FAT and I- node structures, tradeoffs, Directory
structures, File system protection, Security, Integrity, Device independence. Protection domain and
protection matrix

MODULE 6: (4 Lectures)
Concepts of Distributed and Network Operating System. Fundamental concepts on Embedded/Real
time operating systems. Eg Rt LINUX
Text Books/Reference:
1. A, Gaivin P: Operating system concepts, 4th ed. Addision – Wesley Publishing Co.
2. Milenkovic M. : Operating System - Concepts and Design, McGraw Hill.
3. Tanenbaum A.S. : Operating System - Design and Implementation , PHI (EEE)
4. Bach, M. : Design of the UNIX operating system, PHI ( EEE) .

Assam Science and Technology University Page 2|8

 Course Code Course Title Hours per week Credit
L-T-P C
MCA182302 Design and Analysis of Algorithms 3-1-0 4

MODULE 1: Introduction: (8 Lectures)

Algorithms, Analysis of Algorithms, Design of Algorithms and complexity of Algorithms, Asymptotic
Notations, Growth of Function, Recurrences Sorting in Polynomial Time:
Insertion Sort, Merge Sort
MODULE 2 : Data structures: (6 Lectures)
Priority queues, binary heaps, binomial and Fibonacci heaps, binary search trees, Cost Amortization.
MODULE 3: Design and Analysis Techniques: (10 Lectures)
Divide and Conquer, merge sort, finding closest pair of points. Augmented Data Structure- Red-Black
tree, OS-Tree, Interval Tree, B-Tree, AVL tree
MODULE 4 : (10 Lectures)
Greedy Algorithms:
Coin charging, Kruskal’s, Prim and Dijkstra’s algorithm, Knapsack problem.
Dynamic Programming:
Coin charging problem, matrix multiplication, longest common subsequence, Floyd and War shall
algorithm. Application of Sorting and Searching.
MODULE 5: Graph Algorithms: (6 Lectures)
Topological sort, minimum spanning trees, shortest paths, maximum-flow – Flow networks, Ford-
Fulkerson method, Maximum bipartite matching.
MODULE 6: (5 Lectures)

Concept of different Problem classes and Introduction to Approximation Algorithms

P, NP, NP-Complete, Easy vs Hard, Polynomial time, non-deterministic algorithms, reducibility.
Approximation Algorithms:
Traveling salesman problem, Parallel and Distributed algorithms.

Text Books/Reference:

1. Introduction to Algorithm by Thomas Corman , CE Leiserson Roland L Rivest, C Stein

2. Fundamentals of Algorithms - Ellis Horowitz, S Salini S. Rajasekaran

Assam Science and Technology University Page 3|8

 Course Code Course Title Hours per week Credit
L-T-P C
MCA182303 Database Management Systems 3-0-0 3

MODULE 1: Introduction: (5 Lectures)

What is DBMS, advantage of using DBMS, data models (object based logical models, record based
logical models), DBMS users, overall system structure.
Hierarchical and network data models and related data structures

MODULE 2: Entity Relationship models: (5 Lectures)

ER diagrams, generalization, specialization, aggregation. Database models - Network model,
Hierarchical model, and Relational model.

MODULE 3: Relational Database: (10 Lectures)

Underlying concepts, structure, study of relational languages (relational algebra, tuple relational
calculus, domain relational calculus, SQL, QBE), storage and file structure, file organization.

MODULE 4: Relational Data Base Design: (10 Lectures)

Integrity constraints (domain constraints, referential, assertions, triggers, functional dependencies),
Normalization (using FDs, multivalued dependencies, join dependencies), Domain -key normal form.

MODULE 5: Transactions: (15 Lectures)

Concept, state, ACID properties, serializability and recoverability, testing for serializability.
Concurrency Control:
Lock - based, protocols, timestamp based protocols, validation based protocols, multi version schemes,
deadlock handling.
Recovery System:
Log based recovery (deferred and immediate database modification), checkpoints, shadow paging,
recovery with concurrent with transactions, buffer managements in recovery, recovery from loss of
non - volatile storage, logical undo logging, transaction rollback, restart recovery, fuzzy
checkpointing.
Object Oriented Databases:
Object classes, inheritance, DAG representation, object identity and persistence (brief introduction to
ODMG C++ ), storage structure for object oriented databases.
Introduction to advanced database concepts, NoSQL etc

Text Books/Reference:

1. Elmarsi and Navathe, fundamentals of Database Systems, Norsa publishing Company,1989.

2. J.D . Ullman, Principles of Database Systems, Galgotia Publishing Private Limited
3. Silberschatz, Korth and Sudersan, Principles of Database Systems Mc GrawHill Publication
4. C.J. Date An Introduction to Database systems, Vol - I And Vol II Addison - Wesley Publishing
Company.

Assam Science and Technology University Page 4|8

 Course Code Course Title Hours per week Credit
L-T-P C
Object Oriented Programming and
MCA182304 3-0-0 3
Design

MODULE 1: Introduction (7 Lectures)

Object Oriented Concept:
Object, Class. State and Behavior of an object, Attributes and Operations of a class, Local attributes,
Object attributes, Class attributes.
Encapsulation and Data Hiding:
Interface, Implementation, Access modifiers: getter & setter, Operator overloading.
Constructor: Default Constructor, Multiple Constructor, Constructor overloading. Error Handling.

MODULE 2: Relationships in Objects (12 Lectures)

Inheritance:
Reusing, Is a relationship, Generalization, Specialization, superclass and subclass, Abstraction,
Polymorphism.
Composition:
Has a relationship, Aggregation, Association, Composition. Multiplicity and cardinality.

MODULE 3: Object Oriented Design (20 Lectures)

Class Model:
Class and Object, Link and Association, Generalization and Inheritance, OCL. Enumeration,
Multiplicity, Scope, Visibility, Association End Name, Ordering, Bags and Sequences, aggregation,
Constraints on Objects, Generalization Sets and Links.
State Model:
Signal Events and Change Events; States, Transitions and Conditions. State Diagrams: Basic
notations, One-shot State Diagrams, Activity Effects, Do-Activities, Entry and Exit Activities,
Completion Transition, Sending Signals, Nested States, Concurrency and Synchronization of
Concurrent Activities
Interaction Model:
UML including Use Case Models with Include, Extend, Generalization, Sequence Models. Activity
Models, sending & receiving signals, swim lanes, Object flows.

MODULE 4: Development Stages and Life Cycles (6 Lectures)

System conception, Analysis, System design, Class design, Implementation, Testing, Training,
Deployment and Maintenance.
Text Books/Reference:

1. Matt Weisfeld: The Object Oriented Thought Process, Addison-Wesley.

2. Rambaugh et al.: Object Oriented Modeling and Design, PHI (EEE).
3. Rambaugh Booch, Jackobson : Unified Modelling Language Referance Mannual.
4. Barclay, Savage : Object-Oriented Design with UML and Java, Elsevier Butterworth- Heinemann

Assam Science and Technology University Page 5|8

 Course Code Course Title Hours per week Credit
L-T-P C
MCA182305 Computer Graphics and Multimedia 3-0-0 3

MODULE 1: (15 Lectures)

Overview of Graphics Systems:
Graphics input and display devices, functionality of colour CRT monitors, raster and random scan
displays, Flat panel and 3-D viewing devices, digital frame buffer.
Raster Scan Systems:
Video controller and raster scan display processor,
Output primitives:
Point and line drawing algorithms (DDA, Bresenham’s line drawing), Circle generating algorithms,
ellipse generating algorithms.
Attributes of Output Primitives:
line attributes, curve attributes, area fill attributes, character attributes.

MODULE 2: (15 Lectures)

2-D Graphics
Basic and Composite Transformations:
Translation, Rotation and Scaling.
Other Transformations:
Reflection and Shear
Viewing and Clipping:
Two dimensional viewing functions, window to viewport transformation, clipping operations, point
and line clipping algorithms (Cohen-sutherland). Polygon clipping algorithm (Sutherland-Hodgeman),
Curve clipping, text clipping, exterior clipping.

MODULE 3: (10 Lectures)

3-D Graphics:
Three dimensional display methods, 3-D transformation : translation, rotation and scaling.

Visible surface detection methods: Classification of visible surface detection algorithms (scan line
algorithm, depth buffer method, depth sorting method)

MODULE 4: Multimedia (5 Lectures)

Introduction to multimedia, Concept of hypertext and hypermedia, Multimedia applications, Basics of
Animation, Music and sounds , Audio basic concepts, Digital and Analog basic concepts, MIDI
hardware, MIDI messages, MIDI files, Video: Basic Concepts, Analog and digital video. Imaging
and graphics, Image formats, Graphic formats, file format, Image quality and Graphic systems,
Compression, Image Compression, Sound Compression, Video Compression.

Assam Science and Technology University Page 6|8

 Text Books/Reference:

1. Hearn D., Baker P.M.: Computer Graphics, Prentice-Hall,1986.

2. Computer Graphic and Multimedia – Anirban Mukhopadhyay and Arup Chattopadhyay
3. Foley, Van. Dam Fundamentals of Interactive Computer Graphics,AW1982.
4. Giloi, W.K.: Interactive Computer Graphics; Prentice-Hall, 1978.
5. Newman, W., Sproule, R.F.: Principles of Interactive Computer Graphics, MGH,
6. Rogers, D.F.: procedural Elements for Computer Graphics, McGraw-Hill, 1983.
7. Harrington, S.: Computer Graphics: A programming Approach, Tata McGraw-Hill,

Assam Science and Technology University Page 7|8

 Course Code Course Title Hours per week Credit
L-T-P C
Laboratory-III
MCA182316 0-0-8 4
(DBMS, OOPD, PYTHON, LINUX Lab)

1. Practical in DBMS
2. Practical in OOPD
3. Practical in PYTHON
4. Practical in LINUX

*************

Assam Science and Technology University Page 8|8