MCA Third Semester 2019-2020

DEPARTMENT OF COMPUTER SCIENCE

MANIPUR UNIVERSITY

MCA Third Semester Syllabus

THIRD SEMESTER
Course Code Title L-T-P Total Full Marks
H/W Credit
Internal External
MCA-301B Design and Analysis of Computer 3-1-0 4 25 75
Algorithms
MCA-302B Problem Solving with Python 3-1-0 4 25 75
MCA-303B Data Communication & Computer Networks 3-1-0 4 25 75
MCA-304B Operating Systems 3-1-0 4 25 75
(CBCS paper) Elective I (To opt to other 3-1-0 4 25 75
Departments/Institutes)
MCA-306B Programming Lab III (A:301, B:302,303)B 0-1-6 4 25 75
Semester Total 600

CBCS papers that to be offered to the students of other Departments in III Sem.
Course Code Title L-T-P Total Full Marks
H/W Credit
Internal External
CS-O3.1 IT Tools and Applications 3-1-0 4 25 75
CS-O3.2 Object Oriented Programming in C++ 3-1-0 4 25 75

NB : Minimum Credit required : 4

Total Hours : 4(L/T)×4(weeks)×4(months)=64 Hrs
30 Hrs of Practical =1 Credit
15 Hrs of Lecture/Tutorial=1 Credit
 MCA Third Semester 2019-2020

Subject : Design and Analysis of Computer Algorithms

Subject Code :MCA-301B

Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week

Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour
UNIT – 1: 6+2=8 Hours
INTRODUCTION : Notion of Algorithm, Review of Asymptotic Notations, Mathematical
Analysis of Non-Recursive and Recursive Algorithms, Recurrence, Brute Force Approaches:
Introduction, Selection Sort and Bubble Sort, Sequential Search and Brute Force String Matching.
UNIT - 2: 6+2=8 Hours
DIVIDE AND CONQUER : Divide and Conquer: General Method, Defective Chess Board, Binary
Search, Merge Sort, Quick Sort, Heap sort and its performance.
UNIT - 3: 6+2=8 Hours
THE GREEDY METHOD : The General Method, Amortized Complexity, Knapsack Problem, Job
Sequencing with Deadlines, Minimum-Cost Spanning Trees: Prim’s Algorithm, Kruskal’s
Algorithm; Single Source Shortest Paths.
UNIT – 4: 6+2= 8 Hours
DYNAMIC PROGRAMMING : The General Method, Warshall’s Algorithm, Floyd’s Algorithm for
the All-Pairs Shortest Paths Problem, Single-Source Shortest Paths: General Weights, 0/1 Knapsack,
The Traveling Salesperson problem.
UNIT – 5: 6+2=8 Hours
DECREASE-AND-CONQUER APPROACHES, SPACE-TIME TRADEOFFS : Decrease-and-
Conquer Approaches: Introduction, Insertion Sort, Depth First Search and Breadth First Search,
Topological Sorting, Space-Time Tradeoffs: Introduction, Sorting by Counting, Input Enhancement
in String Matching.
UNIT – 6 6+2=8 Hours
LIMITATIONS OF ALGORITHMIC POWER AND COPING WITH THEM : Lower-Bound
Arguments, Decision Trees, P, NP, and NP-Complete Problems, Challenges of Numerical
Algorithms.
UNIT - 7 6+2=8 Hours
COPING WITH LIMITATIONS OF ALGORITHMIC POWER : Backtracking: n - Queens
problem, Hamiltonian Circuit Problem, Subset – Sum Problem. Branch-and-Bound: Assignment
Problem, Knapsack Problem, Traveling Salesperson Problem. Approximation Algorithms for NP-
Hard Problems, Traveling Salesperson Problem, Knapsack Problem.
 MCA Third Semester 2019-2020
UNIT – 8 6+2=8 Hours
PRAM ALGORITHMS:Introduction, Computational Model, Parallel Algorithms for Prefix
Computation, List Ranking, and Graph Problems.

Text Books:
1. Anany Levitin: Introduction to The Design & Analysis of Algorithms, 2nd Edition, Pearson
Education, 2007. (Listed topics only from the Chapters 1, 2, 3, 5, 7, 8, 10, 11).
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of Computer Algorithms,
2nd Edition Universities Press, 2007. (Listed topics only from the Chapters 3, 4, 5, 13)
Reference Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: Introduction to
Algorithms, 3rd Edition, PHI, 2010.
 MCA Third Semester 2019-2020

Subject : Problem Solving with Python

Subject Code :MCA-302B

Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week

Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour

UNIT – I 6+2=8 Hours

Introduction: History of Python, Need of Python Programming, Applications, Basics of Python

Programming Using the REPL(Shell), Running Python Scripts, Variables, Assignment, Keywords,
Input-Output, Indentation.

UNIT – II: 8+2=10 Hours

Types, Operators, and Expressions: Types – Numbers, Strings, Booleans; Operators- Arithmetic
Operators, Comparison (Relational) Operators, Assignment Operators, Logical Operators, Bitwise
Operators, Membership Operators, Identity Operators, Expressions and order of evaluations Control
Flow- if, if-elif-else, for, while, break, continue, pass.

UNIT – III: 7+3=10 Hours

Data Structures: Lists, Tuples, Sets, Dictionaries, Sequences. Operations on Data Structures.
Slicing, Methods. List Comprehensions.

UNIT – IV: 9+3=12 Hours

Functions: Defining Functions, Calling Functions, Passing Arguments, Keyword Arguments,

Default Arguments, Variable-length arguments, Scope of the Variables in a Function, Global and
Local Variables, Lambda Expression, Anonymous Functions.

Modules: Using Python Packages - Creating modules, import statement, namespacing, Python
packages, Introduction to PIP, Installing Packages via PIP.

UNIT – V: 9+3=12 Hours

Object-Oriented Programming in Python: Classes, self-variable, Methods, Constructor Method,

Inheritance, Overriding Methods, Data hiding.

Error, and Exceptions: Difference between an error and Exception, Handling Exception, try
 MCA Third Semester 2019-2020
except for block, Raising Exceptions, User Defined Exceptions

UNIT – VI: 9+3=12 Hours

Brief Tour of the Standard Library – Operating System Interface – String Pattern Matching,
Mathematics, Internet Access, Dates and Times, Multithreading, GUI Programming, Testing: Why
testing is required ?, Basic concepts of testing, Unit testing in Python, Writing Test cases, Running
Tests.

Text/Reference.

1. The Fundamentals of Python: First Programs, by Kenneth A. Lambert, 2 Edition,Cengage

Learning India Pvt. Ltd., 2019.

2. W3schools.com/python
 MCA Third Semester 2019-2020

Subject: Operating Systems

Subject Code :MCA-304B
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour

UNIT-1: Introduction and Operating-System Structures:- 6+2=8 Hours

Introduction: What Operating Systems Do, Computer-System Organization, Computer-
System Architecture, Operating-System Operations, Resource Management, Security and
Protection, Virtualization, Distributed Systems, Kernel Data Structures, Computing Environments,
Free and Open-Source Operating Systems, Operating-System Structures: Operating-System
Services, User and Operating-System Interface, System Calls, System Services, Linkers and
Loaders, Why Applications Are Operating-System Specific, Operating-System Design and
Implementation, Operating-System Structure, Building and Booting an Operating System,
Operating-System Debugging

UNIT-2: Process Management :- 6+2=8 Hours

Processes: Process Concept, Process Scheduling, Operations on Processes, Interprocess
Communication, IPC in Shared-Memory Systems, IPC in Message-Passing Systems, Examples of
IPC Systems, Communication in Client – Server Systems, Threads & Concurrency: Overview of
Threads, Multicore Programming, Multithreading Models, Thread Libraries, Implicit Threading,
Threading Issues, CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms,
Thread Scheduling, Multi-Processor Scheduling, Real-Time CPU Scheduling, Operating-System
Examples, Algorithm Evaluation

UNIT-3: Process Synchronization:- 6+2=8 Hours

Synchronization Tools: Background, The Critical-Section Problem, Peterson’s Solution,
Hardware Support for Synchronization, Mutex Locks, Semaphores, Monitors, Liveness, Evaluation
Synchronization Examples: Classic Problems of Synchronization, Synchronization within the
Kernel, POSIX Synchronization, Synchronization in Java, Alternative Approaches, Deadlocks:
System Model, Deadlock in Multithreaded Applications, Deadlock Characterization,
Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection,
Recovery from Deadlock

UNIT-4: Memory Management:- 6 +2=8 Hours

Main Memory: Background ,Contiguous Memory Allocation ,Paging ,Structure of the Page
Table ,Swapping ,Example: Intel 32- and 64-bit Architectures ,Example: ARMv8 Architecture
,Virtual Memory :Background ,Demand Paging ,Copy-on-Write ,Page Replacement ,Allocation of
Frames ,Thrashing ,Memory Compression ,Allocating Kernel Memory ,Other Considerations
,Operating-System Examples
 MCA Third Semester 2019-2020
UNIT-5: Storage Management: 6+2=8 Hours
Mass-Storage Structure: Overview of Mass-Storage Structure ,HDD Scheduling ,NVM
Scheduling ,Error Detection and Correction ,Storage Device Management ,Swap-Space
Management ,Storage Attachment ,RAID Structure ,I/O Systems : Overview ,I/O Hardware
,Application I/O Interface ,Kernel I/O Subsystem ,Transforming I/O Requests to Hardware
Operations ,STREAMS ,Performance

UNIT-6: File System:- 6+2=8 Hours

File-System Interface: File Concept, Access Methods ,Directory Structure ,Protection ,Memory-
Mapped Files,File-System Implementation: File-System Structure ,File-System Operations
,Directory Implementation ,Allocation Methods ,Free-Space Management ,Efficiency and
Performance ,Recovery ,Example: The WAFL File System,File-System Internals: File Systems
,File-System Mounting ,Partitions and Mounting ,File Sharing ,Virtual File Systems ,Remote File
Systems ,Consistency Semantics ,NFS

UNIT-7: Security And Protection:- 6+2=8 Hours

Security :The Security Problem ,Program Threats ,System and Network Threats ,Cryptography as a
Security Tool ,User Authentication ,Implementing Security Defenses ,An Example: Windows 10
,Protection :Goals of Protection ,Principles of Protection ,Protection Rings ,Domain of Protection
,Access Matrix ,Implementation of the Access Matrix ,Revocation of Access Rights ,Role-Based
Access Control ,Mandatory Access Control (MAC) ,Capability-Based Systems ,Other Protection
Improvement Methods ,Language-Based Protection

UNIT-8: Case Studies :- 6+2=8 Hours

The Linux System :Linux History ,Design Principles ,Kernel Modules ,Process Management
,Scheduling ,Memory Management ,File Systems ,Input and Output ,Interprocess Communication
,Network Structure ,Security,Windows 10 :History ,Design Principles ,System Components
,Terminal Services and Fast User Switching ,File System, Networking, Programmer Interface

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Concepts, 10th
Edition, Wiley India, 2018.(Listed topics only from Chapters 1 to 17, 20,21)
Reference Books:
1. William Stallings, Operating Systems: Internals and Design Principles, 9th Edition,
Pearson,2018
2. Andrew S.Tanenbaum, Herbert Bos, Modern Operating Systems, Fourth Edition,
Pearson,2014
 MCA Third Semester 2019-2020

Subject : Programming Lab III

Subject Code : MCA-306A
Credit : 4 Class Hour : (L-0+ T-1+ P-6=7)/ week
Tutorial Hours (T) : 16 Practical Hour (P) : 96
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 04
Unit T+P Hour

Problems are based on

1. MCA-301B as Group A 8+48=56 Hours
2. MCA-302B & MCA-303B as Group B. 8+48=56 Hours
In the examination each student should perform two experiments; one from each group.
Selection should be on lottery basis.
 MCA Third Semester 2019-2020

Department of Computer Science, Manipur University

Syllabus for elective paper offered to students of other departments under CBCS
in 3rd Semester
Subject : IT Tools and Applications
Subject Code : CS-O3.1
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03

Unit L+T Hour

Unit 1: Computer Appreciation 5+1=6 Hours.
Characteristics of Computers, Input, Output, Storage units, CPU, Computer System, Binary number
system, Binary to Decimal Conversion, Decimal to Binary Conversion, ASCII Code, Unicode.
Unit 2: Computer Organization 6+1=7 Hours
Central Processing Unit - Processor Speed, Cache, Memory, RAM, ROM, Booting, Memory-
Secondary Storage Devices: Floppy and Hard Disks, Optical Disks CD-ROM, DVD, Mass Storage
Devices: USB thumb drive. Managing disk Partitions, File System Input Devices - Keyboard,
Mouse, joystick, Scanner, web cam, Output Devices- Monitors, Printers – Dot matrix, inkjet, laser,
Multimedia- What is Multimedia, Text, Graphics, Animation, Audio, Images, Video; Multimedia
Application in Education, Entertainment, Marketing. Names of common multimedia file formats,
Computer Software- Relationship between Hardware and Software; System Software, Application
Software, Compiler, names of some high level languages, free domain software.
Unit 3: Operating System 5+3=8 Hours
Microsoft Windows- An overview of different versions of Windows, Basic Windows elements, File
management through Windows. Using essential accessories: System tools – Disk cleanup, Disk
defragmenter, Entertainment, Games, Calculator, Imaging – Fax, Notepad, Paint, WordPad.
Command Prompt- Directory navigation, path setting, creating and using batch files. Drives, files,
directories, directory structure. Application Management: Installing, uninstalling, Running
applications. Linux- An overview of Linux, Basic Linux elements: System Features, Software
Features, File Structure, File handling in Linux: H/W, S/W requirements, Preliminary steps before
installation, specifics on Hard drive repartitioning and booting a Linux system.
Unit 4: Information Technology and Society 5+1=6 Hours
Internet and its applications, Web browsers, Web servers, URLs, HTTP, Security, Cyber laws,
Indian IT Act, Intellectual Property Rights – issues. Application of information Technology in
Railways, Airlines, Banking, Insurance, Inventory Control, Financial systems, Hotel management,
Education, Video games, Telephone exchanges, Mobile phones, Information kiosks, special effects
 MCA Third Semester 2019-2020
in Movies.
Unit 5: Word Processing 7 +3=10 Hours.
Word processing concepts: saving, closing, Opening an existing document, Selecting text, Editing
text, Finding and replacing text, printing documents, Creating and Printing Merged Documents,
Character and Paragraph Formatting, Page Design and Layout. Editing and Profiling Tools:
Checking and correcting spellings. Handling Graphics, Creating Tables and Charts, Document
Templates and Wizards.
Unit 6: Spreadsheet Package 7+3=10 Hours.
Spreadsheet Concepts, Creating, Saving and Editing a Workbook, Inserting, Deleting Work Sheets,
entering data in a cell / formula Copying and Moving from selected cells, handling operators in
Formulae, Functions: Mathematical, Logical, statistical, text, financial, Date and Time functions,
Using Function Wizard. Formatting a Worksheet: Formatting Cells – changing data alignment,
changing date, number, character or currency format, changing font, adding borders and colors,
Printing worksheets, Charts and Graphs – Creating, Previewing, Modifying Charts. Integrating
word processor, spread sheets, web pages.
Unit 7: Presentation Package 6+2=8 Hours.
Creating, Opening and Saving Presentations, Creating the Look of Your Presentation, Working in
Different Views, Working with Slides, Adding and Formatting Text, Formatting Paragraphs,
Checking Spelling and Correcting Typing Mistakes, Making Notes Pages and Handouts, Drawing
and Working with Objects, Adding Clip Art and other pictures, Designing Slide Shows, Running
and Controlling a Slide Show, Printing Presentations.
Unit 8: Data Base Operations 7+2=9 Hours.
Data Manipulation-Concept: Database, Relational Database, Integrity. Operations: Creating,
dropping, manipulating table structure. Manipulation of Data: Query, Data Entry Form, Reports.
RECOMMENDED BOOKS MAIN READING
1. P.K. Sinha and P. Sinha, “ Foundations of Computing” , BPB Publication, 2008.
2. Sagman S, “MS Office for Windows XP”, Pearson Education, 2007.
3. ITL Educational Society, “Introduction to IT”, Pearson Education, 2009.
4. Miller M, “Absolute Beginners Guide to Computer Basics”, Pearson Education, 2009.

SUPPLEMENTARY READING
1. Turban, Mclean and Wetherbe, “Information Technology and Management” John Wiely & Sons.
2. Balagurusamy E, “Fundamentals of Computers”, 2009, Tata McGraw-Hill
3. Kulkarni, “IT Strategy for Business”, Oxford University Press Refer: Open Office/ MS Office
Environment for practice.
4. Satish Jain, “O Level IT Tools and Business System”, BPB Publications, 2010
5. Pankaj Kumar, “IT Tools and Business Systems”, Choice International, Edn-2017
 MCA Third Semester 2019-2020

Department of Computer Science, Manipur University

Syllabus for elective paper offered to students of other departments under CBCS
in 3rd Semester
Subject : OBJECT ORIENTED PROGRAMMING IN C++
Subject Code : CS-O3.2
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03

Unit L+T Hour

PART - A
UNIT 1 :Introduction:- 6+2=8 Hours
Overview of C++, Sample C++ programs, Different data types, operators, expressions, and
statements, arrays and strings, pointers & user- defined types.
Function Components, argument passing, inline functions, function overloading, recursive
functions.
UNIT 2: Classes & Objects – I:- 6+2=8 Hours
Class Specification, Class Objects, Scope resolution operator, Access members, Defining member
functions, Data hiding, Constructors, Destructors, Parameterized constructors, Static data members,
Functions.
UNIT 3: Classes & Objects –II:- 6+2=8 Hours
Friend functions, Passing objects as arguments, Returning objects, Arrays of objects, Dynamic
objects, Pointers to objects, Copy constructors, Generic functions and classes, Applications.
Operator overloading using friend functions such as +, - , pre-increment, post-increment, [ ] etc.,
overloading <<, >>.
UNIT 4: Inheritance – I:- 6+2=8 Hours
Base Class, Inheritance and protected members, Protected base class inheritance, Inheriting multiple
base classes

PART – B
UNIT 5: Inheritance – II:- 6+2=8 Hours
Constructors, Destructors and Inheritance, Passing parameters to base class constructors, Granting
 MCA Third Semester 2019-2020
access, Virtual base classes.
UNIT 6: Virtual functions, Polymorphism:- 6+2=8 Hours
Virtual function, Calling a Virtual function through a base class reference, Virtual attribute is
inherited, Virtual functions are hierarchical, Pure virtual functions, Abstract classes, Using virtual
functions, Early and late binding.

UNIT 7: I/O System Basics, File I/0:- 6+2=8 Hours

C++ stream classes, Formatted I/O, I/O manipulators, fstream and the File classes, File operations.
UNIT 8: Exception Handling, STL:- 6+2=8 Hours
Exception handling fundamentals, Exception handling options STL: An overview, containers,
vectors, lists, maps.

Text Books:
1. Herbert Schildt: The Complete Reference C++, 4 Edition, Tata McGraw Hill, 2003.
Reference Books:

1. Balagurusamy, Object Oriented Programming with C++, 6th Edition McGraw 2013 by
2. K R Venugopal, Rajkumar Buyya, T Ravi Shankar: Mastering C++, Tata
McGraw Hill, 1999.