MANONMANIAM SUNDARANAR UNIVERSITY

M.C.A. Degree Course under CBCS

3 Years – Six Semesters

I Semester
Components Hours Credits
Core Subjects
MFCS I 4 3
Object Oriented Programming using C++ 4 3
Visual Programming I 4 3
Digital Principles And Computer Architecture 4 3
Elective I
Introduction to Multimedia 4 3
Lab
OOP Lab 5 4
Visual Programming lab 5 4
Total       (7 Courses) 30 23
II Semester
Core Subjects
MFCS II 4 3
Data Structures And Algorithms Using C++ 4 3
Java Programming 4 3
Operating Systems 4 3
Elective
Internet Programming – I 4 3
Lab
Data structures lab 5 4
Java lab 5 4
Total       (7 Courses) 30 23


Each theory paper shall carry an internal assessment component (External:Internal=75:25)
Each practical paper shall carry an internal assessment component (External:Internal=60:40)

Internal Assessment Practical Marks:
Completion of exercises within the stipulated time prescribed by the teacher who handles the course 20 marks
Model Exam 10 marks
Record Neatness 10 marks
Total 40 marks


MCA – MFCS I

Unit – I:
Logic – Statement – Proposition and its types – Negation, Disjunction, Conjunction and connectives – Truth table construction – Tautology and contradictions – bi-conditional propositions – Logical equivalence – Logical implications – Principle disjunctive and conjunctive normal forms.

Unit – II :
Set theory and relations: Basic operations on sets – power set – Properties of set operations – Properties of subsets – Basic set identities – Functions – Inverse functions – composition of functions – Relations on sets – properties of relations – Equivalence relations.

Unit-III:
Algebraic structures : Algebraic systems – Properties – Semi groups – Monoids – Homomorphisms – Substructures of semigroups and monoids – Groups – Subgroups – Homomorphisms – Cosets – Lagrange’s theorem.

Unit-IV :
Lattices and Boolean Algebra: Partial order relations – Posets – Hassae diagram – Lattices – Sublattices – Modular lattices – distributive lattices – Boolean algebra - Direct product and homomorphism.

Unit-V:
Graph theory : Definition – Connectedness – path – cycle – components – Matrix representation of graphs – Trees and basic properties – Rooted and binary trees – Spanning trees .

Reference Books:
  1. J.P. Trembley and R. Manokar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill Publications.


  2. Narasingh Deo, Graph Theory and its Applications. Tata McGraw Hill Publications.


  3. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill Publications.


  4. Brikhoff and Barte, Modern Applied Algebra, John-Wiley Ltd.


Introduction to Multimedia

Unit – I:
Multimedia elements – Multimedia applications – Multimedia systems architecture – Evolving Technologies for multimedia systems – Defining objects for multimedia systems – multimedia data interface standards – multimedia databases.

Unit – II:
The need for Data compression – types of Compression – Binary image compression schemes colour, Gray scale and stillloping- Video image compression – Video image compression – Audio compression.

Unit –III
Rich-Text format – TIFF file format – Resource interchange file format – MIDI file format – JPEG DIB file format for still and motion images – AVI indeo file format – MPEG standards.

Unit IV
Multimedia Input/Output key technology issues – Pen Input – Video and Image display systems – Print Output Technologies – Image Scanners –Digital Camera – Video Images and animation –

Unit V
Magnetic media technology – Optical media Hierarchical storage management – Cache management for storage systems – Memory systems.
Developing multimedia titles : planning, creating, testing

Text Books:
  1. Multimedia systems design – Prabhat K. Andleigh, Kiran Thakrar – Prentice Hall of India Pvt. Ltd. 2007.


  2. Multimedia in action – James E Shuman, Vikas publishing house


Object Oriented Programming using C++

Unit I:
Object Oriented Technology – Problems with conventional programming – Programming paradigms – Key concepts in OOP – input and output in C++ - streams – predefined streams – buffering – stream classes – unformatted i/o operations – type casting with cout statements member function of I stream class-formatted console i/o operations – manipulators.

Unit –II:
Declarations in C++ - Parts of a C++ program Keywords & identifiers – Datatypes : Basic & derived types – type casting and implicit conversion – constants – constant pointers – operators & precedence – control structures: If-else, jump, goto, break and continue statements, switch-case, loop statement: for, while & do-while statements.

Unit III:
Functions parts of a function – Passing arguments, Return-by-Reference, L values R values – default arguments – constant arguments. In-line functions, Function Overloading, Structures, Classes and Objects, Defining member functions – objects and memory – Static member variables and functions – friend class and friend functions – constructors and destructors –types of constructors.

Unit IV:
Operator Overloading: The operator keyword, Overloading unary and binary operators – Rules for overloading operators – Inheritance – types of inheritances: single, multilevel, multiple & Hierarchical Inheritances, Virtual base classes, Constructor, destructors in inheritance, Abstract Classes – Advantages & disadvantages of Inheritance.

Unit V:
Pointers and Arrays, Pointer declaration, void painters, pointer to class, pointer to object, this pointer, pointer to members, accessing private members with functions. Binding in C++, pointer to derived class objects, virtual functions – rules for virtual functions, Array of printers, pure virtual functions, and Abstract classes – Virtual destructors – File stream classes – steps of file operations – templates – function templates and class templates.

Text and Reference:
  1. Object Oriented Programming with ANSI and Turbo C++ by Ashok. N. Kamthane – Pearson Education Asia – 2003.


  2. Object Oriented Programming with C++ by E. Balagurusamy, TMH publication, 4th Edn. – 2003.


Visual Programming I

Unit –I
Integrated Development Environment:
        Introduction, Overview, Project Window, Toolbox, Form Layout Window, Properties Window, Menu Bar and Tool Bar.
Control Structure: Part I
        Introduction, If/Then, If/Then/Else, While, Do While, Do Until
Control Structure: Part II
        Introduction, For, For/Next, Select Case, Do/Loop While, Do/Loop Until, Exit Do, Exit For, Boolean Data Type, Constant Variables, Logical Operators, Visual Basic Data Types.

Unit –II
Sub Procedures and Function Procedures:
        Introduction, Form Modules, Sub Procedures, Function Procedures, Call By Value Vs Call By Reference, Exit Sub and Exit Function, Storage Classes, Scope Rules, Recursion, Optional Arguments, Named Arguments, Visual Basic Math Functions, Code Modules.
Arrays:
        Introduction, Arrays, Declaring Arrays, Passing Arrays to Procedures, Sorting Arrays, Searching Arrays, Multidimensional Arrays, Control Arrays, Dynamic Arrays, Paramarray, Function Array.

Unit –III
Basic Graphical User Interface Concepts:
        Controls, TextBox , MaskEdit, ComboBox, ListBox, ScrollBars, Slider, Menus, Pop-up Menus, Function Msgbox.
Advanced Graphical User Interface Concepts:
        MDI, Multiple Forms, Template Forms, RichTextBox, UpDown, ImageList, ImageCombo.
Mouse and KeyBoard:
        Changing the shape of the Mouse Pointer, Mouse Events, Mouse Buttons, Shift-Ctrl-Alt Keys, Drag and Drop, Key Events, KeyPreview Property.

Unit –IV
Object Oriented Programming:
        Introduction, Data Abstraction and Information Hiding, Implementing a Time Abstract Data Type with a class, Class Members, Objects as instance variables of other classes, Introduction to Object Oriented Programming, Type Fields and Select Case Statements, Polymorphism, Visual Basic Interfaces, Polymorphism Examples, Case Study 1-IShape-CPoint-CCircle, Case Study 2 – A Payroll system using Polymorphism, Case Study 3- Polymorphic Processing of Shapes.

Unit –V
Database Management:
       ADO Data Control, DAO Data Control, RDO Data Control, Accessing the Data Base using ADO, DAO and RDO object codes, Structured Query Language, Data Grid Control, Hierarchical Flex Grid Control, DataList and DataCombo Controls, Using the Data Environment Designer.

Text
        Book: Visual Basic 6 How to Program
        Authors: H.M.Deital. P.J.Deital and T.R.Neito
        Publishers: Pearson Education Asia
        Edition: 1999 or afterwards.

Reference
        Visual Basic 6 The complete reference- noel Jerke – Tata McGraw Hill edition

Digital Principles and Computer Architecture

Unit –I
Fundamental Concepts: Digital signal, NAND, NOR and Exclusive–OR operation, Boolean Algebra, Basic Digital Circuits. Number system and Codes: Binary, Octal, Hexadecimal, Signed numbers. Combinational Logic Design: K-map representation of logical functions and simplification using K-map.

Unit –II
Multiplexers, Demultiplexers, Adders and Subtracters, multipliers, Encoders, Decoders. Flip-Flops: Clocked RS flip flop, D-type flip flop, Sequential Logic Designs: Registers, Shift registers, Asynchronous counters, synchronous counters, RAM, ROM.

Unit –III
Data Representation - Fixed point representation, floating point representation. Basic Computer Organization and Design: Instruction codes, computer registers, computer instructions, timing & control, instruction cycle, memory reference instructions, input- output and interrupts, design of basic computer, design of accumulator logic.

Unit –IV
Central Processing Unit: Introduction, general registers organization, stack organization, instruction formats, and addressing modes. Computer Arithmetic: addition and subtraction, multiplication algorithms, division algorithms, floating point arithmetic operations.

Unit –V
Input/Output Organization: Peripheral devices, input – Output interface, asynchronous data transfer, modes of data transfer, priority interrupt, direct memory access, input – output processor. Memory Organization: Memory hierarchy, main memory, auxiliary memory, associative memory, cache memory, virtual memory, Introduction to memory management.

Text Books
For Units 1 & 2
Digital Principles and Applications, Malvino,Tata McGraw Hill,
Units 3-5
M. Mano, Computer System Architecture, Prentice-Hall India

Additional References
William Stallings, Computer Organisation and Architecture, Prentice-Hall India,
Harry, Jordan, Computer Systems Design & Architecture, Addison Wesley
J.D. Carpinelli, Computer Systems Organization & Architecture, Addison Wesley,
J.P. Hayes, Computer Architecture and Organisation, McGraw Hill
M.M. Mano and Charles, Logic and Computer Design Fundamentals, Pearson Education Asia

MCA – MFCS II

Unit-I:
OR methodology – Modeling through OR methodology – History of OR – Linear Programming – problem formulation – Graphical method – Simplex method – BigM method.

Unit-II :
Transportation problem – Formulation – Methods to find initial basic feasible solutions – North West corner rule – Least Cost method – penalty method – Modi method to find optimal solution – Degeneracy – Unbalanced transportation.

Unit-III :
Assignment problem: Formulation – Hungarian method – Unbalanced assignment problem – Travelling salesman problem.

Unit-IV :
Game theory: Two person zero sum game – saddle points and value of the game – Games without saddle points – Mixed strategies – Algebraic method for 2 x 2, Graphical method to 2 x n and m x 2 game – Method of domination.

Unit-V :
Roots of algebraic and transcendental equations : Bisection method – Newton Raphson Method – numerical interpolation: Newton’s formula – Legrange’s interpolation.

Reference Books:
  1. Kanti Swarup, Gupta, P.K., and Man Mohan, Operations Research, Sultan Chand & sons.
  2. Sundaresan, K.S. Ganapathy Subramanian, K. Ganeson, “Operations Research”, A.R. Publications.
  3. Sharma, J.K., Mathematical Models in Operations Research, Tata McGraw Hill publications of India.
  4. S.S.Sastry, “Introductory Numerical Analysis” Prentice Hall of India (4th Edition)
  5. M.K. Venkatraman, “Numerical methods in science and Engineering National Publishing Company, 5th Edition.


Data Structures and Algorithms Using C++

Unit I:
Program Performance:
Introduction – Space Complexity – Time Complexity – Asymptotic Notations – Practical Complexities
Arrays:
One-Dimensional Arrays – Multidimensional Arrays – Pointer Arrays. Linked
Lists:
Singly Linked List – Circular Linked List – Doubly Linked List-Application of Linked Lists (Polynomial Representation).

Unit II:
Stacks:
Representations of Stack (Array and Linked List) – Operations on Stacks – Application of Stacks (Parenthesis matching, Tower of Hanoi)
Queues:
Representations of Queues (Array and Linked List) – Circular Queues

Unit III:
Trees:
Basic Terminologies – Definition and Concepts (Binary Trees and Properties of Binary Tree) – Representation of Binary Tree (Linear, Linked representation, Physical Implementation of Binary Tree in Memory) – Operations on Binary Tree – Types of Binary Trees (Expression Tree & Binary Search Tree).

Unit IV:
Graphs: Graph Terminologies – Representation of Graphs –Graph search methods – Breadth first search, Depth first search – Application of Graph Structures (shortest Path Problem, Minimum Spanning Trees, Connected graphs and components).

Unit V:
Algorithm – Design Methods: The Greedy Method – Divide and Conquer Method – Dynamic Programming Back tracking – Branch and bound Applications: The greedy method (container loading) – Divide and conquer method (Merge sort) - (0/1 Knapsack Problem) – backtracking (Traveling Sales Person).

Text and References:
  1. Data Structures, Algorithms and Applications in C++, Sartaj Sahni – Universities press pvt. Ltd. 2005.
  2. Classic Data Structures – D. Samantha – Prentice Hall of India Pvt Ltd, 2002.
  3. Data Structures with C++, John R. Hubbard – Tata McGraw Hill Edition – (Schaum’s Outlines) – 2004.
  4. Data Structures & Algorithm Analysis in C+, Mark Allen Weiss, Pearson Blussion – 2002.


M.C.A Java Programming

Unit I:
OOP and Java: Introduction – Objects & classes – Java Language – Creating and Executing a Java application.
The Primaries: Introduction – Character Set – Tokens- Constants – Variables – Operators & Expressions – Library Methods – Strings – I/O Statements – Simple Programs – Formatting the O/P values.
Control Statements: Introduction – if statement – switch – while- do while – for statements. Arrays and Methods: Introduction – One dimensional arrays – Two dimensional arrays – Methods – Method overloading – Recursion.
Classes & Objects : Introduction – General Form of a class – Creation of objects – Usage of Constructors –‘this’ keyword – Constructor overloading – Copy Constructors – Static Data Members – Static methods – Finalize( ) method – Inner Classes and Anonymous Inner Classes.

Unit II:
Inheritance & Polymorphism: Introduction – Inheriting the variables in a class – Inheriting the methods in a class – Inheritance and Constructions – Abstract Classes – Final Classes.
Interfaces & Packages: Introduction – Interfaces – Structures of an interface – Implementation of an interface – Interface Inheritance – Packages – The Package Statement – Placing the classes in a Package – Package Hierarchy – Import Statement – Hiding the classes in a Package Access Control Modifiers.
Applets: Introduction – The Life Cycle of Applet – The Applet Class – Development and Execution of a simple Applet – Syntax of Applet Tag – Methods in the Graphics Class.

Unit III:
Abstract Windowing Toolkit – I: Introduction – Events – Listeners – Event Handling Methods – Inheritance Hierarchy of Control Classes – Labels – Button Control – Check Box – Radio Button, Choice, List, Scroll Bars Control – Flow Layout – Border Layout – Grid Layout – Card Layout – Grid bag Layout- Panels.
Abstract Windowing toolkit – II: Introduction – Windows and frames – Menus – Dialogs – Mouse events and their listeners – Adapter classes – Inner classes – Anonymous Inner classes. Swing: Introduction – JApplet Class – Icons – JLable Control – JOption Pane Class – JTextfield Control – JButton, JCheckbox, JRadiobutton Controls – Menus – JSlider, JCombobox, JTabbed Pane, JScrollpane controls – Tables.

Unit IV:
Exception Handling: Introduction – Default Exception Handling – User defined Exception Handling mechanism – Exception and Error Classes – Catch Block Searching Pattern – ‘throw’ Statement - - ‘throw’ Clause – Custom exceptions.
Multithreading: Introduction – Life Cycle of a Thread – Creating and Running Threads – Methods in the Thread Class – Setting the priority of a Thread – Synchronization – Deadlock – Inter Thread Communication – Applets involving Threads.
Networking: Introduction – Networks, Domain Names and Protocols – Layers in Network Communication Ports – TCP – UDP Approach – Accessing Resources on the Internet.

Unit V:
Java Database Connectivity: Introduction – Establishing a connection – Creation of data tables – Entering data into the tables – Table updating – Use of Prepared statement – Obtaining Meta data – Using Transactions – Scrollable Result sets – Stored Procedures. Servlets: Introduction – Servlets and Dynamic Web Pages – Life Cycle of a Servlet – Constituents of javax.servlet Package – Retrieving the values of parameters – Retrieving the values of Initialization parameters – The javax.servlet.http package – cookies – Creating a cookie and sending it to the client – Retrieving the stored cookies – Session Tracking.

Text & Reference Books:
  1. Programming .java – Decker & Hirshfield – Thomson Learning & Vikas Publishing House , 2000.
  2. Programming with java – C.Muthu, Thomson Learning Series, 2004.
  3. Java 2 – The Complete Reference , Schildt – Tata McGraw Hill , 2005.


MCA – OPERATING SYSTEMS

Unit I:
Introduction – Definition – History – sample operating systems – protection mechanisms – operating system services, calls, structure of operating systems – virtual machines – system design, implementation. Overview of system programs – Assembler- linker and loader. Process management: Process Management: Process concepts, operations on process – process states transitions – co-operative process – inter process communication – threads and multi threading models.

Unit II:
CPU scheduling: process scheduling – basic concepts – scheduling algorithms – multiprocessor scheduling – real time scheduling – evaluation of scheduling algorithms. Process Synchronization –semaphores – classical synchronization problems – IPC mechanisms. Deadlock: what is? - system model – deadlock characterization – prevent a deadlock – docklock avoidance, detection – recover from a deadlock.

Unit III:
Memory management – requirements – memory partitioning – paging segmentation – virtual memory system – virtual memory basics – hardware and control structures – operating system software’s.

Unit IV:
I/O systems : I/O devices – concepts – organization of the I/O function – I/O design issues, buffering – input and output mechanisms – File Systems: concepts – descriptors – Access methods – directory structures – file systems – UNIX file systems – file handling in windows systems – file system mounting – file sharing – protection – file system structures – recovery – disc formatting. Secondary storage managements: allocation methods – directory implementation – free space managements – disc structure – access – space managements – device driver – disc controller – scheduling.

Unit V:
Linux: main difference between Unix and Linux – process management, scheduling – memory, file management – device drivers – security – CASE STUDY: Windows NT – process management – synchronization – memory management – wnn 32 application programming interface – windows registry Distributed Operating System: process migration – remote procedure call – distributed process, file management – issues in distributed database systems – distributed mutual exclusion – deadlock in distributed systems.

Reference Books:

  1. Operating Systems, Achyut S Godbole Atul Kahate, Tata McGraw Hill, 2005.
  2. Operating system principles, Abraham silverschatz, Peter Galvin, Greek Gagne, John Wiley Eastern Publication, 2006.
  3. Operating systems – William Stallings, Prentice Hall of India, 2005.
  4. An Introduction to Operating system concepts and practice, Pramod Chandra P. Bhatt, Prentice Hall of India, 2006.


Internet Programming – I

Unit I:
Basics of Internet Communication – Hardware elements associated with internet – Internet services – Internet protocols – TCP / IP, UDP, HTTP – other protocols – Web indexes – search engine.

Unit II:
Telnet – Gopher – Mail and its types – FTP – Remote access and Transaction – web server – proxy server – web browsers – Microsoft Internet explorer.

Unit III:
Introduction to HTML – Tags and Documents – Link documents using anchor tags – images and pictures – tables – HTML forms – Frames – Framesets.

Unit IV:
Introduction to scripting – Java script – Data types – operators – variable – conditional statements – loop structures.

Unit V:
Java script – Functions, Arrays, Objects

Reference
  1. Dieitel & Deitel – “Internet & WWW. How to Program” – Prentice Hall of India.
  2. Internet & Web Technologies – Raj Kamal – Tata McGraw Hill.