Course Structure Syllabus for Master of Computer ... · Course Structure & Syllabus for . Master of...

SINGHANIA UNIVERSITY

Course Structure

&

Syllabus for

Master of Computer Application

MCA

SINGHANIA UNIVERSITY 1


Introduction Master of Computer Applications is a computer science degree whose curriculum is primarily based on the development of application software in diverse areas.

Objective 1. To progress career productively in software industry, academia, research, entrepreneurial pursuit, government, consulting firms and other Information Technology enabled services.

2. To achieve peer-recognition; as an individual or in a team; by adopting ethics and professionalism and communicate effectively to excel well in cross culture and inter-disciplinary teams.

3. To continue a lifelong professional development in computing that contributes in self and societal growth.



Course Structure

Semester 1 -

Subject Code

Subject Name Examination Credits

MCA11 Fundamentals of Computer Theory 6

MCA12 C Programming with Data Structure

Theory 6

MCA13 Software Engineering Theory 6

MCA14 Database Management System Theory 6

MCA15 Principles & Practices of Management & Organizational Behavior

Theory 6

Semester 2 -

Subject Code Subject Name Examination Credits

MCA21 Essentials of Operating System Theory 6

MCA22 Web Technologies Theory 6

MCA23 Core Java Theory 6

MCA24 Essentials of Networking Theory 6

MCA25 Discrete Mathematics Theory 6



Semester 3 -

Subject Code


MCA31 Advanced Data Base Management System (ADBMS)

Theory 6

MCA32 Data Communication & Computer Networking

Theory 6

MCA33 Data Structure Using C++ Theory 6

MCA34 Object Oriented Analysis & Design Theory 6

MCA35 Web Technologies Theory 6

Semester 4 -

Subject Code


MCA41 Design & Analysis of Algorithms

Theory 6

MCA42 Information Security & Audit Theory 6

MCA43 Java Programming Theory 6

MCA44 Mobile Computing Theory 6

MCA45 Optimization Technique Theory 6



Semester 5 -

Subject Code


MCA51 Software Testing Theory 6

MCA52 Advanced Operating System Theory 6

MCA53 Distributed Database System Theory 6

MCA54 Network Programming Theory 6

MCA55 Principles of Programming Languages

Theory 6

Semester 6 -

Subject Code


MCA61 Project Work Practical 10



Syllabus –

Semester 1:

Following Subjects-

1. MCA11 | Fundamentals of Computer

2. MCA12 | C Programming with Data Structure

3. MCA13 | Software Engineering

4. MCA14 | Database Management System

5. MCA15 | Principles & Practices of Management &

Organizational Behavior



Semester 1:

1. Fundamentals of Computer (MCA11)

Description of the Units included in the above subject:

Unit No.

Unit Name Description

1 Introduction to Digital Computer

Concept of Digital Computer Types of Software – System software Application software / Utility Software. Compilers, Interpreters, Assemblers, Linker, Loader

2 Data Representation & Boolean Algebra

Binary, Octal, Hexadecimal & their inter conversion 1’s & 2’s complement.

Binary Arithmetic. & Number Systems – BCD, EBCDIC, ASCII, De-Morgan’s Theorem, Duality Theorem, K Map, Sum of product, Product of Sum, Algebra Rules, Laws, Logic Circuits, NOT,&, OR, NAND, NOR, XOR, XNOR, Gated diagrams.

3 Combinational Circuits

Half / Full Adder Decoder / Encoder Multiplexer / DE Multiplexer

4 Sequential Circuit Flip Flops - SR, D, JK, Master – Slave, Edge Triggered D flip-flop with timing diagram Shift Registers

Counters, Synchronous & Asynchronous counter, Binary counter, mod-10counter

5 Memory System 5.1 Memory Hierarchy 5.2 Primary Memory – DRAM, SDRAM, DDR, RDRAM. ROM, PROM, EPROM, EEPROM

Cache memory Structure DMA, DMA interfacing with processor



6 CPU Organization CPU Building Blocks

CPU Registers, System bus Characteristics, Interface basics with interface block diagram, concept of local bus with name of different local buses (only types) Addressing Modes Interrupt Concept, Interrupt types Instruction & Execution cycle Hardwired & Micro Program control RISC vs. CISC Pipelining – Data Path, Time Space Diagram, Hazards



Topics | Fundamentals of Computer (MCA11)

Unit Sub Unit Topic

1 1.0 Introduction to Digital Computer 1.1 Types of Software 1.2 System Development Tools

2 2.0 Data Representation & Boolean Algebra 2.1 Number System & Computer Codes 2.2 Conversion of Numbers 2.3 1’s Complement & 2’s Complement 2.4 Binary Arithmetic 2.5 Boolean Algebra 2.6 Logic Circuits

3 3.0 Combinational Circuits 3.1 Sequential Logic Basics 3.2 Flip-Flops 3.3 Registers 3.4 Counters

4 4.0 Memory System 4.1 Memory Unit 4.2 Memory Hierarchy



4.3 Primary Memory 4.4 Cache Memory Structure 4.5 Direct Memory Access (DMA)

5 5.0 CPU Organization 5.1 CPU Building Blocks 5.2 CPU Registers 5.3 System Bus 5.4 Interface Basics 5.5 Addressing Modes 5.6 Interrupt 5.7 Instruction & Execution Cycle 5.8 Hardwired & Micro Program Control 5.9 RISC Vs. CISC 5.10 Pipelining



Semester 1:

2. C Programming with Data Structure (MCA12)


Unit No.


1 An Overview of C A Brief History of C Features & characteristics of C Structure of a ‘C’ Program Program Development Life Cycle Complier Vs Interpreters

Compilation & Execution of C Program On DOS & UNIX, Linux

2 Variables, Data Types, Operator & Expression

Character Set , C Tokens - Keywords & Identifiers Constants, Integer, Floating Point, Character, String, Enumeration Backslash characters / Escape sequences

Data Types in C, Variables-Declaration & Definition, User- Defined Type declarations Operators & Expressions - Arithmetic, Relational, Logical, Increment , Decrement , Bit wise, Assignment, Conditional, Type conversions in Expressions – Implicit Type Conversion, Explicit Type Conversions Precedence & Associability of Operators.

Built in I/O Functions - Introduction, Console Input & Output functions, Formatted Input & Output (scanf/printf), sprintf & sscanf

3 Control Statements Introduction Selection Statements If, Nested if, if....else, else if Ladder



ternary operator, switch, Nested switch, conditional

expression Iterative Statements - while loop, do-while loop, for loop, break & continue, Jump Statements - Goto & label, exit() function Compound Statements, Null Statements.

4 Array & String Single Dimension Arrays - Declaration, Initialization, Accessing array Elements, Memory Representation Multidimensional Arrays - Declaration, Initialization, Accessing array Elements, Memory Representation. String (character array) - Declaration, Initialization, String Manipulation Functions.

5 Pointers Introduction- Basics of Pointer, Memory Organization, Application of Pointer, Declaration Of pointer, Initializing Pointer Pointer Expressions, De-referencing Pointer Void Pointer, Pointer Arithmetic Precedence of &, * operators , Pointer to Pointer, Constant Pointer, Pointers & Arrays, Pointers & character string, Array of pointers Dynamic Memory Allocation - sizeof(), malloc(), calloc(), realloc(), free()

6 Function Introduction - Types of functions , Declaration & Definition, Arguments & local variables Parameter passing – Call by value & Call by reference Passing arrays, strings to functions, Pointers to functions Recursion

7 Structure, Union, Enumeration & typedef

7.1 Structures - Declaration & Initializing Structure, Accessing Structure members, Structure Assignments, Array



of Structures, Nested structure, Passing Structure to

function, Structure Pointer, typedef keyword Unions - Declaration & Initializing Union Accessing union members, Difference between Structure & Union, Enumerated data type

8 Introduction to File Handling

Introduction Opening a File Closing a File Input/output Operations on Files Error Handling During I/O Operation Random Access To Files

9 Searching & Sorting Linear search & Binary search Sorting- Selection sort, Insertion sort, Bubble sort

10 Basics of Data Structure

Data Structure Implementation of Data Structure

11 Array as Data Structure

Storage Representation of Arrays Applications of Arrays

Polynomial Representation Using Arrays Addition of Two Polynomial Multiplication of Two Polynomial Sparse Matrices Addition of Sparse Matrices Transpose of a Sparse Matrix

12 Stack Introduction Definition Operation on Stack Static Implementation of a Stack Application of Stack Recursion Infix, Prefix & Postfix expression

13 Queue Introduction Definition of a Queue Operation on a Queue Static Implementation of Queue Types of Queue - Circular Queue, Priority Queue DEQueue Application of Queue Reversing Stack using Queue



Topics | C Programming with Data Structure (MCA12)

Unit Sub Unit Topic

1 1.0 An Overview of C 1.1 A Brief History of C 1.2 Features & Characteristics of C 1.3 Structure of a ‘C’ Program 1.4 Program Development Life Cycle (PDLC) 1.5 Compilers Vs. Interpreters 1.6 Compilation & Execution of C Program

2 2.0 Variables, Data Types, Operator & Expression 2.1 C Character Set 2.2 C Tokens 2.3 Variables 2.4 Data Types in C 2.5 Operators & Expressions in C 2.6 Type Conversions in Expressions 2.7 The Precedence & Associability of Operators 2.8 Built in I/O Functions

3 3.0 Control Statements 3.1 Introduction to Control Statements 3.2 Selection Statements 3.3 Iterative Statements 3.4 Jump Statements



3.5 exit () function 3.6 Compound & Null Statements

4 4.0 Array & String 4.1 Introduction to Arrays 4.2 Single Dimensional Arrays 4.3 Multidimensional Arrays 4.4 String Array (Character Array)

5 5.0 Pointers 5.1 Basics of Pointer 5.2 Pointer Expressions 5.3 De-referencing & Void Pointer 5.4 Pointers & Arrays 5.5 Dynamic Memory Allocation

6 6.0 Functions 6.1 Introduction to Function 6.2 Declaration & Definition of Function 6.3 Types of Functions 6.4 Parameter Passing 6.5 Passing Arrays to Functions 6.6 Pointers to Functions 6.7 Recursion



7 7.0 Structure, Union, Enumeration & typedef 7.1 Structure 7.2 typedef Keyword 7.3 Unions 7.4 Enumerated Data Type

8 8.0 Introduction to File Handling 8.1 Introduction (Data Organization) 8.2 Input / Output Operations on File 8.3 Error Handling During I/O Operation 8.4 Random Access to Files

9 9.0 Searching & Sorting 9.1 Searching (Linear Search & Binary Search) 9.2 Sorting (Selection Sort, Insertion Sort & Bubble Sort)

10 10.0 Basics of Data Structure 10.1 Data Structure 10.2 Implementation of Data Structure

11 11.0 Array as Data Structure 11.1 Array 11.2 Array as Data Structure 11.3 Storage Representation of Arrays 11.4 Applications of Arrays



11.5 Sparse Matrices

12 12.0 Stack 12.1 Operations on Stack 12.2 Implementation of Stack 12.3 Applications of Stacks

13 13.0 Queue 13.1 Operations of Queue 13.2 Static & Dynamic Implementation of Queue 13.3 Types of Queue 13.4 Application of Queues 13.5 Reversing Stack using Queue



Semester 1:

3. Software Engineering (MCA13)


Unit No.


1 Overview of systems Analysis & design

Basic System Development Life Cycle Different approaches & models for System Development: Waterfall Prototyping Spiral (including WIN Spiral) RAD Group Based Approach: JAD Role & Skills of system Analyst.

2 Software Requirements Specification Techniques

Requirements Anticipation Requirements Investigation Fact finding methods

Requirements Specifications Software requirement Specification (SRS) Structure & contents of the requirements Specification types of requirements - functional & non- functional Quality criteria, requirements definition, IEEE standard SRS format, Fundamental problems in defining requirements Case studies on SRS should be covered

3 Information requirement Analysis

Decision Analysis Tools Decision Tree, Decision Table, Structured English Functional Decomposition Diagram Process modeling with Data Flow Diagrams

Entity Relationship Diagram: Identify Entity & Relationships Data dictionary Case Studies on Decision analysis tools FDDs, DFDs should be covered



4 Designing of Input,

Output & Program Design of input & Control Objectives of Input Design, Data Capture Guidelines Design of Source Document, Input Validations Design of output Objectives of Output Design Types Of Output User Interface design: Elements of good design, Design issues Features of modern GUI, Menus, Scroll bars windows, buttons, icons, panels, error messages etc. Design of program Specification Code Design Case studies should be covered on the above topic

5 Maintenance Types of Maintenance & maintenance cost Introduction to legacy systems Reverse Engineering

Role of documentation in maintenance & types of Documentation

6 CASE Tools Introduction to CASE tools, Types of CASE tools Project Management Tools. Analysis tools, Design tools, Programming tools, Prototyping tools, Maintenance tools Advantages & disadvantages of CASE Tools

7 Current trends in Software Engineering

7.1 Software Engineering for projects & products. Introduction to Web Engineering & Agile Methodology Scrum, Extreme Programming



Topics | Software Engineering (MCA13)

Unit Sub Unit Topic

1 1.0 Overview of Systems Analysis & Design 1.1 Software Development Life Cycle (SDLC) 1.2 Waterfall Model 1.3 Prototyping Model 1.4 Spiral Model 1.5 Rapid Application Development (RAD) Model 1.6 Group Based Approach : JAD 1.7 System Analyst

2 2.0 Software Requirements Specification Techniques 2.1 Requirements Determination 2.2 Fact Finding Methods 2.3 Software Requirements Specification (SRS)

3 3.0 Information Requirement Analysis 3.1 Decision Analysis Tools 3.2 Decision Tree 3.3 Decision Tables 3.4 Structured English 3.5 Functional Decomposition Diagram (FDD) 3.6 Data Flow Diagram (DFD)



3.7 Entity Relationships Diagram 3.8 Data Dictionary (DD)

4 4.0 Designing of Input, Output & Program 4.1 Design of Input & Control 4.2 Design of Output 4.3 User Interface Design 4.4 Graphical User Interface (GUI) 4.5 Design of Program Specification 4.6 Code Design

5 5.0 Maintenance 5.1 Software Maintenance 5.2 Legacy System 5.3 Reverse Engineering 5.4 Maintenance Documentation

6 6.0 CASE Tools 6.1 Computer-Aided Software Engineering (CASE) 6.2 Architecture of CASE Environment 6.3 Building Blocks for CASE 6.4 Types of Computer-Aided Software Engineering Tools

6.5 Advantages of Computer-Aided Software Engineering (CASE) Tools



6.6 Disadvantages of Computer-Aided Software Engineering (CASE) Tools

7 7.0 Current Trends in Software Engineering

7.1 Software Engineering for Project & Products

7.2 Introduction to Web Engineering 7.3 Agile Software Engineering



Semester 1:

4. Database Management System (MCA14)


Unit No.


1 Basic concepts Database & Need for DBMS Characteristics of DBMS Database Users

3-tier architecture of DBMS (its advantages over 2- tier) Views of data-schemas & instances Data Independence

2 Data Models Introduction to various data models – Record based & Object based

Cardinality Ratio & Relationships 2.4.Representation of entities, attributes, relationship attributes, relationship set Generalization, aggregation Structure of relational Database & different types of keys Structure of no-SQL database

3 Relational Model Codd’s rules Relational data model & relational algebra Relational model concept Relational model constraints Relational Algebra Relational database language 3.4.Data definition in SQL, Views & 3.5.Queries in SQL, Specifying constraints & Indexes in SQL, Specifying constraints management systems Postgre SQL / MySQL



4 Relational Database

design 4.1.Database Design – ER to Relational 4.2.Functional dependencies

Normalization Normal forms based on primary keys (1 NF, 2 NF, 3 NF, BCNF, 4 NF, 5 NF) Loss less joins & dependency preserving decomposition

5 Transaction & Concurrency control

Concept of transaction, ACID properties 29 Serializibility States of transaction, Concurrency control Locking techniques Time stamp based protocols Granularity of data items Deadlock

6 Crash Recovery & Backup

Failure classifications storage structure Recovery & Atomicity Log base recovery Recovery with concurrent transactions Failure with loss of Non-Volatile storage

Database backup & recovery from catastrophic failure Remote Backup System

7 Security & privacy Database security issues Discretionary access control based on grant & revoking privilege Mandatory access control & role based access control for multilevel security Encryption & public key infrastructures

8 Non-SQL Database No- SQL Database-Introduction, Types of NOSQL, Need of NoSQL databases, Use Cases



Topics | Database Management System (MCA14)

Unit Sub Unit Topic

1 1.0 Basic Concepts 1.1 Database & Need for DBMS 1.2 Characteristics of DBMS 1.3 Database Users 1.4 3 - Tire Architecture of DBMS 1.5 Views of Data-schemas & Instances 1.6 Data Independence

2 2.0 Data Models 2.1 Introduction to Various Data Models 2.2 Classification of Data Model 2.3 Cardinality Ratio & Relationships 2.4 Entity Relationship Model 2.5 Generalization & Aggregation 2.6 Relational Database 2.7 Structure of Non SQL Database

3 3.0 Relational Model 3.1 Codd’s Rule 3.2 Relational Data Model 3.3 Relational Algebra



3.4 Relational Database Language (SQL) 3.5 Oracle / Ingres / SQL Server

4 4.0 Relational Database Design 4.1 Database Design – ER to Relational 4.2 Functional Dependencies 4.3 Normalization 4.4 Decomposition

5 5.0 Transaction & Concurrency Control 5.1 Concept of Transaction, ACID properties 5.2 Serializibility 5.3 States Of Transaction 5.4 Concurrency Control 5.5 Locking Techniques(Lock-Based Protocols) 5.6 Time Stamp Based Protocols 5.7 Granularity Of Data Items 5.8 Deadlock

6 6.0 Crash Recovery & Backup 6.1 Failure Classifications 6.2 Storage Structure 6.3 Recovery & Atomicity 6.4 Recovery Techniques



6.5 Recovery with Concurrent Transactions 6.6 Failure with Loss Of Non-Volatile Storage 6.7 Database Backup & Recovery From Catastrophic Failure 6.8 Remote Backup System

7 7.0 Security & Privacy 7.1 Database Security 7.2 Database Security Issues

7.3 Discretionary Access Control Based On Grant & Revoking Privilege

7.4 Mandatory Access Control & Role Based Access Control For

Multilevel Security 7.5 Encryption & Public Key Infrastructure

8 8.0 Non-SQL Database 8.1 Non-SQL 8.2 Advantages & Disadvantages of Non- SQL Database 8.3 Examples of Non-SQL Database



Semester 1:

5. Principles & Practices of Management & Organizational

Behavior (MCA15)


Unit No.


1 Management The need, scope Meaning & Definition The process of Management Managerial levels/Hierarchy

Managerial functions : Planning, Organizing, Staffing, Directing, Controlling Managerial skills : Technical, Conceptual, Human Resource Types of managers : Functional, Specialize, Generalize Line & staff managers

2 Evolution of Management Thought

Historical perspective Classical Theories : Taylor, Fayol

Behavioral: HR Approach, Behavioral Science & Approach Management Science Approach

System approach-with reference to management, organization & MIS Contingency approach

3 Managerial Decision Making

Introduction Decision making environment : Open Systems, Closed system Decision making under certainty, under uncertainty, under risk



Decision Types /models : Structured , Unstructured ,

Programmable & Non programmable Decisions Classical Model Administrative model Decision making tools : Autocratic, Participative, Consultative Decision Making Tools Herbert Simon’s Model Principle of Rationality / Bounded Rationality

4 Organization Introduction -definition Need for Organization Process of Organizing

Organizational structure, Functional organization, Product Organization, Territorial Organization

5 Organizational Behavior

Definition / Concepts Need /importance/ relevance An overview

6 Individual Behavior & Understanding Self

Ego State Transactional Analysis

6.2 Johari Window

7 Group & Group Dynamics

8 Team Building

9 Leadership

10 Conflict Management

11 Motivation Concept, Theory X, Y & Z



Topics | Principles & Practices of Management & Organizational

Behavior (MCA15)

Unit Sub Unit Topic

1 1.0 Management 1.1 Process of Management 1.2 Levels of Management 1.3 Managerial Functions 1.4 Managerial Skills 1.5 Types of Managers 1.6 Line & Staff Manager / Authority

2 2.0 Evolution of Management Thought 2.1 Historical Perspective of Management Thoughts 2.2 Management Thoughts 2.3 Classical Theories 2.4 Neo-Classical Approach (Behavioral Approach) 2.5 Modern Approach

3 3.0 Managerial Decision Making 3.1 Decision Making Environment 3.2 Types of Decisions 3.3 Decision Making Models / Theories 3.4 Decision Making Tools / Styles



3.5 Herbert Simon’s Model 3.6 Rationality / Bounded Rationality

4 4.0 Organization 4.1 Organizing Process 4.2 Types of Organizational Structure

5 5.0 Organizational Behavior 5.1 Need of Organizational Behavior 5.2 Importance of Organizational Behavior 5.3 Limitations of Organizational Behavior 5.4 Criticism of Organizational Behavior

6 6.0 Individual Behavior & Understanding Self 6.1 Ego State 6.2 Transactional Analysis 6.3 Johari Window

7 7.0 Group & Group Dynamics 7.1 Group 7.2 Group Dynamics

8 8.0 Team Building 8.1 Team



9 9.0 Leadership 9.1 Styles of Leadership 9.2 Theories of Leadership

10 10.0 Conflict Management

11 11.0 Motivation 11.1 Human Nature Theories of Motivation



Semester 2:

Following Subjects-

1. MCA21 | Essentials of Operating System

2. MCA22 | Web Technologies

3. MCA23 | Core Java

4. MCA24 | Essentials of Networking

5. MCA25 | Discrete Mathematics



Semester 2:

1. Essentials of Operating System (MCA21)


Unit No.


1 Introduction OS Definition, features & functionalities Logical View , User View,

Concept of System Calls & System Programs (Only concept) Concept of OS structure Concept of Virtual Machine

2 Process Management Process Concept Process Control Block

Process operations : Create, Kill, suspend, resume, wakeup, Interposes Communication, IPC types IPC in Client-Server, RTOS

3 CPU Scheduling Scheduling Concept Scheduling Criteria Scheduling algorithms Numerical exercise based on algorithms Scheduling Evaluation Simulation Concept

4 Process Synchronization & Deadlock

Synchronization concept Synchronization Requirement Critical Section Problem & Solutions Monitors Deadlock concepts



Deadlock prevention & avoidance with single

instance & multiple instances of resources Deadlock Detection with single instance & multiple instances of resources Numerical exercise based on Deadlock Deadlock Recovery

5 Memory Management Concept Memory Management Techniques Contiguous & Non Contiguous allocation Logical & Physical Memory Conversion of Logical to Physical address MFT & MVT with search algorithms Numerical exercise based on search algorithms Paging, Segmentation

Numerical exercise based on logical to physical address conversion using Paging & segmentation. Segment with paging Virtual Memory Concept

Demand paging Page Replacement algorithm with numerical exercises Allocation of Frames Thrashing

6 File Management File Structure Protection FILE system Implementation Directory structure Free Space Management Allocation Methods Efficiency & Performance Recovery

7 Disk Management Disk Structure Disk Scheduling algorithm Numerical exercise based on Disk algorithms Disk management Swap Space concept & Management RAID structure Disk performance issues



Topics | Essentials of Operating System (MCA21)

Unit Sub Unit Topic

1 1.0 Introduction 1.1 Operating System 1.2 Views of Operating System 1.3 System Calls & System Programs 1.4 Operating System Structure 1.5 Virtual Machine

2 2.0 Process Management 2.1 Process Concept 2.2 Process Control Block 2.3 Process Operations 2.4 Interprocess Communication 2.5 IPC in Client-Server

3 3.0 CPU Scheduling 3.1 Scheduling Concept 3.2 Scheduling Criteria 3.3 Scheduling Algorithms 3.4 Numerical Exercise Based on Algorithms 3.5 Scheduling Evaluation 3.6 Simulation Concept



4 4.0 Process Synchronization & Deadlock 4.1 Synchronization concept 4.2 Synchronization Requirement 4.3 Critical Section Problem & Solutions 4.4 Monitors 4.5 Deadlock concepts

4.6 Deadlock prevention & avoidance with single instance & multiple instances of resources

4.7 Deadlock Detection with single instance & multiple

instances of resources 4.8 Numerical exercise based on Deadlock 4.9 Deadlock Recovery

5 5.0 Memory Management 5.1 Concept 5.2 Memory Management Techniques 5.3 Contiguous & Non Contiguous allocation 5.4 Logical & Physical Memory 5.5 Conversion of Logical to Physical address 5.6 MFT & MVT with search algorithms 5.7 Numerical exercise based on search algorithms 5.8 Paging, Segmentation

5.9 Numerical exercise based on logical to physical address conversion using Paging & segmentation.

5.10 Segment with paging



5.11 Virtual Memory Concept

5.12 Demand paging Page Replacement algorithm with numerical exercises Allocation of Frames

5.13 Thrashing

6 6.0 File Management 6.1 File Structure 6.2 Protection 6.3 FILE system Implementation 6.4 Directory structure 6.5 Free Space Management 6.6 Allocation Methods 6.7 Efficiency & Performance 6.8 Recovery

7 7.0 Disk Management 7.1 Disk Structure 7.2 Disk Scheduling algorithm 7.3 Numerical exercise based on Disk algorithms 7.4 Disk management 7.5 Swap Space concept & Management 7.6 RAID structure 7.7 Disk performance issues



Semester 2:

2. Web Technologies (MCA22)


Unit No.

Unit Name

Description

1 HTML Introduction To HTML, WWW, W3C, Common HTML Tags & attributes, Ordered & Unordered Lists, Inserting image Client server image mapping Text & image links Tables Frames Forms

Introduction with text box, text area, buttons, List box, radio, checkbox etc.

2 CSS Introduction to Style Sheet Types of style Sheets Inline, External, Embedded CSS.

CSS Border, margin, Positioning, color, text, link, background, list, table, padding, image, display properties Use of Id & classes in CSS use of <div>&<span>

Introduction of CSS3 : Gradients, Transitions, Animations, multiple columns

3 JavaScript 3.1Concept of script, Types of Scripts, Introduction to JavaScript 3.2Variables, identifiers constants in JavaScript & examples of each.

Operators in java scripts, various types of JavaScript operator Examples on JavaScript operators,

Control & looping structure, examples on control & looping structures (if, if...else, for, while, do while, switch, etc....)



Concept of array, how to use it in JavaScript , types of an array,

examples Methods of an array, examples on it. Event handling in JavaScript with examples Math & date object & examples on it. String object & examples on it, & some predefined functions DOM concept in JavaScript, DOM objects Window navigator, History object & its methods, Location object with methods & examples Validations in JavaScript, examples on it.

4 ASP Introduction to ASP How to install IIS ASP syntax ,variables, procedures ASP Forms ASP Session & Cookies ASP Global.asa ASP Objects- Request, Response, Application, Server.

ASP Database related operations Insert, Retrieve, Update, Delete. Programs on Database related operations



Topics | Web Technologies (MCA22)

Unit Sub Unit Topic

1 1.0 HTML 1.1 HTML Tags 1.2 HTML Attributes 1.3 HTML Lists 1.4 HTML Images 1.5 HTML Text Links 1.6 HTML Image Links 1.7 HTML Tables 1.8 Frames 1.9 Forms 1.10 World Wide Web (WWW)

2 2.0 CSS 2.1 Cascading Style Sheets (CSS) 2.2 CSS Formatting Properties 2.3 Use of Id & Classes in CSS 2.4 Use of <div> & <span> Tag 2.5 Style Sheets 2.6 Introduction to CSS3

3 3.0 JavaScript



3.1 Variables, Constants, Identifiers & Operators 3.2 Control & Looping Structures 3.3 Array in JavaScript 3.4 Event Handling in JavaScript 3.5 Objects in JavaScript 3.6 Document Object Model (DOM) 3.7 Validations in JavaScript

4 4.0 ASP 4.1 Active Server Pages (ASP) 4.2 How to Install Internet Information Services (IIS) 4.3 ASP Syntax, Variables & Procedures 4.4 ASP Forms 4.5 ASP Session & Cookies 4.6 ASP Global 4.7 ASP Objects 4.8 ASP Database



Semester 2:

3. Core Java (MCA23)


Unit No.


1 Fundamentals of OOP What is OOP Difference between Procedural & Object oriented programming Basic OOP concept - Object, classes, abstraction, encapsulation, inheritance, polymorphism

2 Introduction to JAVA History of Java Features of Java Difference between C++ & JAVA JDK Environment Java Virtual Machine Java Runtime environment

3 Programming Concepts of Basic Java

Identifiers & Keywords Data Types in Java Java coding Conventions Expressions in Java Control structures, decision making statements Arrays & its methods Garbage collection & finalize() method

4 Java classes Define class with instance variables & methods Object creation of class Accessing member of class Argument passing, Constructors Method overloading static data, static methods, static blocks this keyword Wrapper Classes, String (String Arrays, String Methods, StringBuffer)



5 Inheritance Super class & subclass Abstract method & classes

Method overriding final keyword super keyword Down casting & up casting Dynamic method dispatch

6 Packages & Interfaces Importing classes User defined packages Modifiers & Access control (Default, public, private, protected, private protected) Implementing interfaces User defined interfaces Adapter classes

7 Exception handling Types of Exceptions try, catch, finally, throw, throws keywords Creating your own exception Nested try blocks Multiple catch statements User defined exceptions

8 Java Input Output Java IO package File Class Byte/Character Stream Buffered reader / writer File reader / writer Print writer File Sequential / Random Serialization & de serialization

9 Multithreading Multithreading Concept Thread Life Cycle Creating multithreading Application Thread Priorities Thread synchronization Inter thread communication



10 Abstract Window

Toolkit Components & Graphics Containers, Frames & Panels Layout Managers a. Border Layout b. FlowLayout c. Grid Layout d. CardLayout AWT all Components Event Delegation Model e. Event Source & Handlers f. Event Categories, Listeners, adapters Anonymous Classes

11 Applets Applet life cycle Creating applet Displaying it using Web Browser with appletwiewer.exe The HTML APPLET Tag with all attributes. Passing Parameters to applet Event handling in applet Advantages & Disadvantages of Applet Vs Applications

12 Swing Features of swing Model view Controller design pattern Swing components JButton, JRadioButton, JtextArea, JComboBox, JTable, JProgessBar, JSlider,JDialog

13 Java Collection Framework

Collections Overview The Collection Interfaces a. Collection Interface, List Interface, SetInterface, b. Sorted Set Interface c. The Collection Classes d. Array List Class, Linked List Class, Hash’s Class, Tree Set Class e. Accessing a Collection via an Iterator The Map Interfaces f. Map Interface, Sorted Map Interface g. The Map Classes h. Hash Map, Tree Map The Legacy Interfaces i. Enumeration Interface j. The Legacy Classes Vector, Stack Hash table



Topics | Core Java (MCA23)

Unit Sub Unit Topic

1 1.0 Fundamentals of OOP 1.1 Object Oriented Programming 1.2 Procedural Vs. Object Oriented Programming 1.3 Basic Concepts of Object Oriented Programming

2 2.0 Introduction to JAVA 2.1 Difference Between C++ & Java 2.2 JDK Environment & Tools 2.3 Java Virtual Machine (JVM) 2.4 Java Runtime Environment (JRE)

3 3.0 Programming Concepts of Basic JAVA 3.1 Identifiers & Keywords 3.2 Data Types in Java 3.3 Java Coding Conventions 3.4 Expressions in Java 3.5 Control Structure 3.6 Arrays 3.7 Garbage Collection & finalize () Method

4 4.0 Java Classes



4.1 Define Classes with Instance Variables & Methods 4.2 Object Creation 4.3 Accessing Member of Class 4.4 Argument Passing in Java 4.5 Constructors 4.6 Method Overloading 4.7 Static Data, Static Methods, Static Blocks 4.8 this Keyword 4.9 Nested Class & Inner Class 4.10 Wrapper Classes 4.11 String

5 5.0 Inheritance 5.1 Superclass & Subclass 5.2 Abstract Methods & Classes 5.3 Method Overloading 5.4 Final Keyword 5.5 Super Keyword 5.6 Down Casting & Up Casting 5.7 Dynamic Method Dispatch

6 6.0 Packages & Interfaces 6.1 Packages 6.2 Modifiers & Access Control



6.3 Interfaces 6.4 Adapter Classes

7 7.0 Exception Handling 7.1 Exception Handling Mechanisms 7.2 User Defined Exceptions

8 8.0 JAVA Input Output 8.1 Java IO Package 8.2 Stream Byte / Character 8.3 Buffered Reader / Writer 8.4 File Reader / Writer 8.5 Print Writer 8.6 File Sequential / Random 8.7 Serialization & De-serialization

9 9.0 Multithreading 9.1 Multithreading Concept 9.2 Thread Life Cycle 9.3 Creating Multithreaded Application 9.4 Thread Priorities 9.5 Thread Synchronization 9.6 Inter Thread Communication (ITC)



10 10.0 Abstract Window Toolkit 10.1 Interfaces & Classes 10.2 AWT Components 10.3 Graphics 10.4 Containers, Frames & Panels 10.5 Layout Managers 10.6 Event Handling

11 11.0 Applets 11.1 Applet 11.2 Applet Life Cycle 11.3 Creating an Applet 11.4 Applet Tags 11.5 Passing Parameters to Applet 11.6 Event Handling in Applet 11.7 Advantages & Disadvantages of Applet Vs Application

12 12.0 Swing 12.1 Swing Components

13 13.0 Java Collection Framework 13.1 Collections Overview 13.2 The Collection Interfaces 13.3 The Collection Classes 13.4 Accessing a Collection Via an Iterator 13.5 The Map Interfaces 13.6 The Legacy Classes



Semester 2:

4. Essentials of Networking (MCA24)


Unit No.


1 Introduction What is a Computer communication, communication System, Signal & Data, Channel Characteristics, Transmission Modes, Synchronous & asynchronous transmission. Transmission Media: a) Guided Media – Twisted Pair, Coaxial & Fiber- optic cables, b) Unguided Media: Radio, VHF, Micro Waves & Satellite Multichannel Data Communication: Circuits, channels & multichanneling Multiplexing: FDM, TDM, CDM & WDM

2 Common Network Architecture

Connection oriented N/Ws vs Connectionless N/Ws Peer to peer networks X.25 networks Ethernet (Standard & Fast): frame format & specifications Wireless LANs - 802.11(Architecture, issues, features etc.), 802.11x

3 The OSI Reference Model

Protocol Layering ISO/OSI reference Model TCP/IP Model OSI vs.TCP/IP

4 Local Area Networks

Components & Technology, Access Technique, Transmission Protocol & Media



5 Broad Band

Networks Integrated Service Digital Networks (ISDN), Broad Band ISDN, ATM & ATM Traffic Management Very Small Aperture Terminal (VSAT)

6 IP Addressing & Routing

IP addresses – Network part & Host Part Network Masks, Network addresses & Broadcast addresses, Address Classes, Loop back address, IP routing concepts, Routing Tables, Stream & Packets Sliding Windows Role & Features of IP, TCP TCP Connections types & working. IPV6: The next generation Protocol

7 Application Layer

Domain Name System (DNS) & DNS servers, Electronic Mail: Architecture & services, Message Formats, MIME, message transfer, SMTP, Mail Gateways, Relays, Configuring Mail Servers, File Transfer Protocol, General Model, commands World Wide Web: Introduction, Architectural overview, static & dynamic web pages, WWW pages & Browsing, HTTP



Topics | Essentials of Networking (MCA24)

Unit Sub Unit Topic

1 1.0 Introduction to Networking 1.1 Computer Communication 1.2 Transmission Media 1.3 Multichannel Data Communication 1.4 Multiplexing

2 2.0 Common Network Architecture

2.1 Connection Oriented Networks v/s Connectionless Networks

2.2 Peer to Peer (P2P) Networks 2.3 X.25 Networks 2.4 Ethernet 2.5 Wireless LANs – 802.11

3 3.0 The OSI Reference Model 3.1 Protocol Layering 3.2 ISO/OSI Reference Model 3.3 TCP/IP Model 3.4 OSI Model vs. TCP/IP Model

4 4.0 Local Area Network 4.1 Local Area Network (LAN)



4.2 LAN Access Techniques 4.3 Local Area Network (LAN) Protocols 4.4 LAN Transmission Media

5 5.0 Broadband Networks 5.1 Integrated Service Digital Networks (ISDN) 5.2 Broadband ISDN 5.3 Asynchronous Transfer Mode (ATM) 5.4 ATM Traffic Management 5.5 Very Small Aperture Terminal (VSAT)

6 6.0 IP Addressing & Routing 6.1 IP Addresses 6.2 IP Routing 6.3 IP / TCP 6.4 IPV6: The Next Generation Protocol

7 7.0 Application Layer 7.1 Domain Name System (DNS) 7.2 Electronic Mail 7.3 File Transfer Protocol (FTP) 7.4 General Model 7.5 World Wide Web 7.6 Hypertext Transfer Protocol (HTTP)



Semester 2:

5. Discrete Mathematics (MCA25)


Unit No.


1 MATHEMATICAL LOGIC

Propositions (Statements), Logical connectivity’s, Compound statements form, truth tables, tautology, implications & equivalence of statements forms logical identities. Normal forms: disjunctive normal form &, simplification. Conjunctive normal form, logical implications, valid arguments, methods of proof. Theory of inference of statement calculus, predicate calculus, qualifiers free & bound variables, theory of inference of predicate calculus.

2 RELATIONS & FUNCTIONS

Relation defined as ordered n-tuple, Unary, binary, ternary, n-ary, Restrict to binary relations, Complement of a relation, converse Relation, compositions, matrix representation & its properties, Graphical representation of relation –Digraphs Properties of binary relation –Reflexive, reflexive, symmetric, Asymmetric, transitive, Equivalence, equivalence classes, partitions, covering, compatible relation, maximal compatibility block, transitive closure– Warshall’s algorithm. Partial ordering relation – Hasse diagram, minimal elements, upper bound , lower bound, definitions Functions – definitions, Partial function, hashing functions, characteristic functions, floor functions, ceiling functions, surjective, injunctive & bijective functions, Inverse functions, Non-denumerable sets.



3 ALGEBRAIC

STRUCTURES Operations on sets – Unary, binary, ternary. Definitions of Algebraic systems (Restrict to binary operations). Properties closure, idempotent, communicative, associative, commutative, identity, inverse. Semigroup, sub-semigroup, Monoid, sub-monoid group, abelian group, permutation group, multiplicative abelian group, cyclic group Subgroups: Cosets, right cosets, left cosets, normal subgroups, quotient groups, isomorphism, homomorphism. Group codes: Weight & Hamming distance, minimum distance of code , generation of codes using parity checks – even parity, odd parity , parity check matrix – Hamming code, for detection & correction errors , formation of encoding function, decoding, Application of residue –arithmetic to computers group codes.

4 GRAPH THEORY Basic terminology, simple & weighted graph, adjacency & incidence, hand-shaking lemma, underlying graph of a digraph, complete graph, regular graph, bipartite graph, complete bipartite, Isomorphism, complement of graph, connected graphs, paths-simple, elementary, circuit – simple, elementary Edge connectivity, vertex connectivity, Eulerian path & Eulerian circuit, planar graph – regions Euler’s formula Trees : Definition – leaf, root, branch node, internal node, Rooted & binary trees, regular m-ary tree



Topics | Discrete Mathematics (MCA25)

Unit Sub Unit Topic

1 1.0 Mathematical Logic 1.1 Propositional Logic 1.2 Logical Connectives or Sentence Connectives 1.3 Kind of Statements 1.4 Truth Table, Tautology, Contradiction, Contingency 1.5 Equivalence of Statements Forms Logical Identities 1.6 Normal Forms 1.7 Theory of Inference of Statement Calculus 1.8 Inference Theory of Predicate Calculus 1.9 Methods of Proof 1.10 Qualifiers Free Variables & Bound Variables

2 2.0 Relations & Functions 2.1 Relations 2.2 Properties of Binary Relations 2.3 Partial Ordering Relations 2.4 Functions

3 3.0 Algebraic Structures 3.1 Sets 3.2 Algebraic Systems (Restrict To Binary Operations)



3.3 Group Codes 3.4 Parity Bit/ Check Bit 3.5 Subgroup

4 4.0 Graph Theory 4.1 Trees



Semester 3:

Following Subjects-

1. MCA31 | Advanced Data Base Management System

2. MCA32 | Data Communication & Computer Networking

3. MCA33 | Data Structure Using C++

4. MCA34 | Object Oriented Analysis & Design

5. MCA35 | Web Technologies



Semester 3:

1. Advanced Data Base Management System (MCA31)


Unit No.


1 Concepts & Architectures Centralized Client-Server

Server system Transaction servers Data servers Cloud based servers Parallel Distributed Web based system Web architecture (2 tier , 3 tier, N-tier Architecture) Web services – SOAP

2 Parallel Databases Introduction I/O parallelism Inter-query & Intra-query parallelism, Inter-operational &

Intra-operational parallelism Design of parallel systems Parallelism on Multicore processors

3 Distributed Databases Introduction, Homogeneous & Heterogeneous Databases Distributed data storage, Distributed transactions Commit protocols Concurrency control Availability

Cloud based databases, 3.9Directory systems



4 Specialty Databases &

Applications 4.1 Object based Databases – OR & OO - Overview of Object- Oriented concepts & characteristics -Database design for OODBMS - Objects, OIDs & reference \ types - Database design for ORDBMS - Comparing RDBMS, OODBMS & ORDBMS

Temporal databases Spatial data & Geographic database Multimedia data Mobility & Personal databases

5 Data Warehousing Introduction to Data warehousing Architecture Warehouse schemas,

Dimensional data modeling- star, snowflake schemas, fact constellation OLAP & data cubes Operations on cubes Data preprocessing -need for preprocessing, data cleaning, data integration & transformation, data reduction

6 Knowledge Base Systems & Data Mining

Data mining as a part Knowledge Discovery process Introduction to machine learning & data mining Association rules

Market-basket Model, support & confidence Apriority Algorithm Sampling Algorithm Frequent-pattern Tree Algorithm Partition Algorithm Other types of Association rules

Classification Decision tree induction Bayesian classifiers



6.5 Clustering

k-means Algorithm Approaches to other data mining problems Discovery of sequential patterns Discovery of patterns in time series Regression Neural Networks Genetic Algorithms Text mining Data-visualization Applications of Data Mining

7 Data exchange through XML Structure of XML data XML schema

XML Document & Databases schema Storing & Extracting XML document XML Querying XML data, XPath, XQuery Application Program Interface to XML XML Applications



Topics | Advanced Data Base Management System (MCA31)

Unit Sub Unit Topic

1 1.0 Advanced Database Management System- Concepts & Architectures

1.1 Database Management System 1.2 Centralized System 1.3 Client/Server System 1.4 Server System 1.5 Parallel Databases System 1.6 Distributed Databases System 1.7 Web based System

2 2.0 Parallel Databases 2.1 I/O Parallelism 2.2 Inter-Query Parallelism 2.3 Intra-Query Parallelism 2.4 Intra-Operation Parallelism 2.5 Inter- Operation Parallelism 2.6 Design of Parallel Systems 2.7 Parallelism on Multicore Processors

3 3.0 Distributed Databases 3.1 Distributed Database System 3.2 Homogeneous & Heterogeneous Databases



3.3 Distributed Data Storage 3.4 Distributed Transactions 3.5 Commit Protocols 3.6 Concurrency Control 3.7 Availability 3.8 Cloud-Based Databases 3.9 Directory Systems

4 4.0 Specialty Databases & Applications 4.1 Object Based Databases 4.2 Temporal Databases 4.3 Spatial Data & Geographic Database 4.4 Multimedia Data 4.5 Mobility & Personal Database

5 5.0 Data Warehousing 5.1 Architecture of Data Warehousing 5.2 Warehouse Schemas 5.3 Dimensional Data Modeling 5.4 OLAP & Data Cubes 5.5 Operations on Cubes 5.6 Data Preprocessing



6 6.0 Knowledge Base System & Data Mining 6.1 Data Mining as a Part of the Knowledge Discovery Process 6.2 Association Rules 6.3 Classification 6.4 Clustering 6.5 Approaches to other Data Mining Problems 6.6 Applications of Data Mining

7 7.0 Data Exchange through XML 7.1 XML 7.2 XML Schema 7.3 XML Document & Databases Schema 7.4 XML Querying XML Data 7.5 Application Program Interface to XML 7.6 XML Applications



Semester 3:

2. Data Communication & Computer Networking (MCA32)


Unit No.


1 Data Communication Networks & Reference Models

Centralized Client-Server

Server system Transaction servers Data servers Cloud based servers Parallel Distributed Web based system Web architecture (2 tier , 3 tier, N-tier Architecture) Web services – SOAP

2 Physical communication Introduction I/O parallelism Inter-query & Intra-query parallelism, Inter-operational &

Intra-operational parallelism Design of parallel systems Parallelism on Multicore processors

3 Link Layer Communication 3.1 Introduction, 3.2 Homogeneous & Heterogeneous Databases

Distributed data storage, Distributed transactions Commit protocols 3.6 Concurrency control

3.7 Availability 3.8 Cloud based databases, 3.9 Directory systems



4 IP Addressing & Routing 4.1 Object based Databases – OR & OO

- Overview of Object- Oriented concepts & characteristics -Database design for OODBMS - Objects, OIDs & reference \ types - Database design for ORDBMS - Comparing RDBMS, OODBMS & ORDBMS

Temporal databases Spatial data & Geographic database Multimedia data Mobility & Personal databases

5 IPv6 Introduction to Data warehousing Architecture Warehouse schemas,

Dimensional data modeling- star, snowflake schemas, fact constellation OLAP & data cubes Operations on cubes Data preprocessing -need for preprocessing, data cleaning, data integration & transformation, data reduction

6 Domain Network Services (DNS)

Data mining as a part Knowledge Discovery process Introduction to machine learning & data mining Association rules

Market-basket Model, support & confidence Apriority Algorithm Sampling Algorithm Frequent-pattern Tree Algorithm Partition Algorithm Other types of Association rules

Classification Decision tree induction Bayesian classifiers



6.5 Clustering

k-means Algorithm Approaches to other data mining problems Discovery of sequential patterns Discovery of patterns in time series Regression Neural Networks Genetic Algorithms Text mining Data-visualization Applications of Data Mining

7 Network Applications (HTTP, Email, etc.)

Structure of XML data XML schema

XML Document & Databases schema Storing & Extracting XML document XML Querying XML data XPath XQuery Application Program Interface to XML XML Applications

8 Network Security Threat : Active attack, Passive Attack, Cryptography : Symmetric & Asymmetric key cryptography, Security services, Digital signature, IPsec, SSL, VPN, Firewall: Packet filter, application gateway, Unicode.

9 Advance Network Technologies

9.1 Wi-Fi-IEEE standards 802.3,802.4,802.5,802.11, 802.11x, WiMAX, LTE, Cloud Computing, Grid computing, HSPA, IPTV, FTTH, GPON



Topics | Data Communication & Computer Networking (MCA32)

Unit Sub Unit Topic

1 1.0 Data Communication Networks & Reference Models 1.1 Data Communication 1.2 Network 1.3 Connection Oriented Network 1.4 Connectionless Network 1.5 Interconnection of Network : Internetwork 1.6 Protocol Layering

2 2.0 Physical Communication 2.1 Hardware Architecture 2.2 Topologies Media 2.3 Device Transmission Techniques 2.4 Switching

3 3.0 Link Layer Communication 3.1 Error Detection & Correction 3.2 Framing 3.3 Flow & Error Control 3.4 High-level Data Link Control (HDLC) 3.5 Point-to-Point (P2P) Protocol



4 4.0 IP Addressing & Routing 4.1 Internet Protocol (IP) 4.2 Addressing 4.3 IP Addresses 4.4 Routing 4.5 IP Routing 4.6 TCP

5 5.0 IPv6 5.1 Features of IPv6 5.2 Packet Format 5.3 Addressing Scheme 5.4 Security 5.5 Applications & Limitations of Ipv6 5.6 IPv4 Vs IPv6

6 6.0 Domain Network Services (DNS) 6.1 Domain Names 6.2 Authoritative Host 6.3 Delegating Authority 6.4 Resource Records 6.5 SOA Records 6.6 DNS Protocol 6.7 DHCP & Scope



6.8 Resolution

7 7.0 Network Applications (HTTP, Email, etc.) 7.1 Hypertext Transfer Protocol (HTTP) 7.2 HTTP Communication 7.3 Status & Error Codes 7.4 E-mail 7.5 Multipurpose Internet Mail Extensions (MIME) 7.6 Simple Mail Transfer Protocol (SMTP) 7.7 Mail Exchangers 7.8 Post Office Protocol (POP) 7.9 Internet Message Access Protocol (IMAP) 7.10 File Transfer Protocol (FTP) 7.11 Telnet- Remote Communication Protocol 7.12 Proxy Server

8 8.0 Network Security 8.1 Network Security Model 8.2 Threat 8.3 Cryptography 8.4 Security Services 8.5 Digital Signature 8.6 IPsec 8.7 SSL



8.8 VPN 8.9 Firewall

9 9.0 Advance Network Technologies 9.1 Wi-Fi 33-IEEE Standards 9.2 WiMAX 9.3 Long Term Evolution (LTE) 9.4 Cloud Computing 9.5 Grid Computing 9.6 High Speed Packet Access (HSPA) 9.7 Internet Protocol Television (IPTV) 9.8 Fiber to the Home (FTTH) 9.9 Gigabit Passive Optical Network (GPON)



Semester 3:

3. Data Structure Using C++ (MCA33)


Unit No.


1 Introduction Data Definition Data Object Data Types Built-in Data Type Derived Data Type Data Structure Implementation of Data Structure

2 Array Array as Data Structure Storage Representation of Arrays Applications of Arrays

Polynomial Representation Using Arrays Addition of 2 Polynomial Multiplication of Two Polynomial Sparse Matrices Addition of Sparse Matrices Transpose of a Sparse Matrix

3 Linked List 3.1 Introduction 3.2 Drawback of Sequential Storage Concept of Linked List Implementation of Linked List

Operation of Linked List Creating a List Displaying a List Inserting an element in the List Deleting an element Other Operation & Applications Reversing a Linked List Concatenation of Two Lists

Representation of Polynomial 3.10Circular Linked List & Operation 3.11Doubly Linked List & Operation 3.12Doubly Circular Linked List & Operation 3.13Difference between an array & Linked list 3.14Generalized Linked List 3.15Header Linked List



4 Stack Introduction

Definition Operation on Stack Static & Dynamic Implementation of a Stack Application of Stack Recursion Infix, Prefix & Postfix expression

Matching Parentheses in an 4.9Expression

5 Queue Introduction Definition of a Queue Operation on a Queue Static & Dynamic Implementation of Queue Types of Queue Circular Queue Priority Queue DEQueue Application of Queue Job Scheduling Reversing Stack using Queue

6 Tree Tree Terminology Binary Tree Binary Tree Representation

Binary Search Tree (BST) Creating a BST Binary Search Tree Traversal Preorder Traversal In order Traversal Post order Traversal

7 Binary Threaded Tree

AVL tree B tree

introduction to B tree insertion in B tree deletion from B tree introduction to B+, B* tree

Expression Tree Threaded Binary Tree

8 Graph Introduction Graph Representation Adjacency Matrix Adjacency List

Graph Traversals Depth First Search Breadth First Search Applications of Graph



Topics | Data Structure Using C++ (MCA33)

Unit Sub Unit Topic

1 1.0 Introduction 1.1 Data 1.2 Data Object 1.3 Data Types 1.4 Data Structure 1.5 Implementation of Data Structure

2 2.0 Array 2.1 Arrays as Data Structure 2.2 Storage Representation of Arrays 2.3 Applications of Array

3 3.0 Linked List 3.1 Sequential Storage 3.2 Implementation of Linked List 3.3 Operation of Linked List 3.4 Representation of Polynomial 3.5 Types of Linked List 3.6 Difference between an Array & Linked List 3.7 Generalized Linked List 3.8 Header Linked List



4 4.0 Stack 4.1 Operation on Stack 4.2 Implementation of Stack 4.3 Applications of Stacks

5 5.0 Queue 5.1 Operations of Queue 5.2 Static & Dynamic Implementation of Queue 5.3 Types of Queue 5.4 Application of Queues 5.5 Job Scheduling 5.6 Reversing Stack using Queue

6 6.0 Tree 6.1 Binary Tree 6.2 Binary Tree Representation 6.3 Binary Search Tree 6.4 Binary Search Trees Traversal

7 7.0 Binary Threaded Tree 7.1 AVL Tree 7.2 B Tree 7.3 Expression Tree



7.4 Threaded Binary Tree

8 8.0 Graph 8.1 Graph Representation 8.2 Graph Traversals 8.3 Applications of Graph



Semester 3:

4. Object Oriented Analysis & Design (MCA34)


Unit No.


1 Introduction Two views of software Developments: SSAD & OOAD. Why Object – Orientation? The Object Paradigm

Object & classes Abstraction & encapsulation Methods & Message Interfaces, Inheritance & Polymorphism Access Control – The Business case for OO Developments

2 Object Oriented Methodologies

Some of the object Oriented Methodology:- Object Oriented Design -Booch Object Modeling Techniques - Rumbaugh Object – Oriented Analysis - Cood Yourdon

Object – Oriented Software engineering – Ivar Jacobson Unified Approach

Diagramming & Notational Techniques using the UML UML Notation

{Analysis Diagramming Techniques.} == Introduction to all (ten) Diagram { Design Diagramming Techniques} 2.10Generalization / Specialization. 2.11Aggregation & composition 2.12 Association, Cardinality, Navigability, Icons, Relationships & adornments.



3 Object-Oriented Systems

Development Process Rational Unified Process Four Major phases:- Inception , Elaboration, Construction, Transition Requirements Engineering Problem analysis.

Understanding Stockholders need Type of requirements. Use-case Model: Writing Requirements

4 Analysis Behavioral Analysis Domain Analysis or Business Object Analysis Use-case Driven Object Oriented analysis The UML approach.

Develop use-case Model Use-case Description Documentation Activity Diagram

Identify the classes. Introduction to different approaches for identifying classes “Noun Phrase” approach “Conman Class Pattern” approach “CRC” approach Use case Driven Approach.

Containment & Composition Aggregation Inheritance, Subtypes & IS-A Hierarchies. Association & Link Relationships.

Diagramming System Events.

5 Design Phases Translating Analysis Concept into Design. Optimizing classes & Objects: The Multi-tiered Architecture View Mapping System functions to objects. Object-to-Object Visibility. Collaboration Diagram Sequential Diagram Specification Class Diagram



Specifying Object Interfaces.

Designing the Data Access layer. 5.10Design User Interface layer 5.11Designing System Interfaces, Controls & Security.

6 Design Refinement Designing for Extensibility Design for reusability. Portioning class space Checking Completeness & correctness.

7 Persistent Object & Database Issues

The Cood Data Management Domain. Object Persistence Object-oriented Database Management System Object- Oriented verses Relational Database. Mapping object to Relational Data structure.

8 Testing of Object oriented applications

Introduction to Testing Strategies. Impact of Object Orientation on Testing. Testing Business Process. Design Matrix Discovering reusable pattern.

9 Patterns Benefits of patterns. Using patterns During Analysis. Using Pattern During Design



Topics | Object Oriented Analysis & Design (MCA34)

Unit Sub Unit Topic

1 1.0 Introduction 1.1 Software Development 1.2 The Object Paradigm 1.3 The Business Case for Object Oriented Development

2 2.0 Object Oriented Methodologies 2.1 Object Oriented Methodologies 2.2 Object Oriented Design – Booch 2.3 Object Modeling Technique – Rumbaugh 2.4 Object Oriented Analysis-Cood Yourdon

2.5 Object Oriented Software Engineering-Ivar Jacobson Unified Approach

2.6 UML Notation 2.7 Analysis Diagramming Techniques 2.8 Design Diagramming Technique

3 3.0 Object Oriented Systems Development Process 3.1 Rational Unified Process 3.2 Phases of Rational Unified Process 3.3 Problem Analysis 3.4 Understanding Stockholders Need & Type of Requirement 3.5 Use Case Model : Writing Requirement



4 4.0 Analysis 4.1 Behavioral Analysis 4.2 Domain Analysis or Business Object Analysis 4.3 Use Case Driven Object Oriented Analysis 4.4 The UML Approach 4.5 Different Approaches for Identifying Classes 4.6 Aggregation ,Containment & Composition 4.7 Inheritance, Subtypes & IS-A Hierarchies 4.8 Association & Link Relationship 4.9 Diagramming System Events

5 5.0 Design Phases 5.1 Design 5.2 Translate The Analysis Model into the Design Model

5.3 Optimizing Classes & Objects: The Multi- tiered Architecture View

5.4 Mapping System Function to objects 5.5 Object to Object Visibility 5.6 Interaction Diagrams 5.7 Specification Class Diagram 5.8 Specifying Object Interfaces 5.9 Designing Data Access Layer 5.10 Designing User Interface Layer 5.11 Designing System interfaces, Controls, & Security



6 6.0 Design Refinement 6.1 Designing for Extensibility 6.2 Designs for Reusability 6.3 Partitioning Class Space 6.4 Checking Completeness & Correctness

7 7.0 Persistent Object & Database Issues 7.1 The Coad Data Management Domain 7.2 Object Persistence 7.3 Object Oriented Database Management System 7.4 Object Oriented Verses Relational Database. 7.5 Mapping Object to Relational Data Structure

8 8.0 Testing of Object Oriented Applications 8.1 Object Oriented Testing 8.2 Testing Strategies 8.3 Impact of Object Oriented On Testing 8.4 Testing Business Process 8.5 Design Matrix 8.6 Discovering Reusable Pattern

9 9.0 Patterns 9.1 Using Patterns During Analysis 9.2 Using Patterns During Design



Semester 3:

5. Web Technologies (MCA35)


Unit No.


1 HTML & CSS WWW, W3C,Common HTML Tags, Types of HTML tags, Text formatting tags, List tags, Image Mapping, Tables, Frames, Forms

Concept of style sheet, Types of Style sheet Inline Style Sheet, External Style sheet & examples on it Embedded Style Sheet & Examples Text formatting properties, Border Properties in CSS

& examples 1.6 <div> & <span> tag, use of it, Color property in CSS 1.7 Use of Classes in CSS, more Examples on CSS

2 JavaScript 2.1 Concept of script, Types of Scripts, Introduction to JavaScript 2.2 Variables, identifiers constants in JavaScript & examples of each. 2.3 Operators in java scripts, various types of JavaScript Operators 2.4 Examples on JavaScript operators,

Control & looping structure, examples examples on control & looping structures (if, if…else, for, while, do while, switch, etc.….) Concept of array, how to use it in JavaScript, types of an array, examples 2.8 methods of an array, examples on it. 2.9 Event handling in JavaScript with examples 2.10Math & date object & examples on it.

String object & examples on it, & some predefined functions DOM concept in JavaScript, DOM objects 2.13Window navigator, History object & its methods, 2.14Location object with methods & examples 2.15Validations in JavaScript, some examples on it. 2.16Some form validation programs.



3 jQuery&

AJAX Introduction to jQuery, Syntax Overview Anatomy of a jQuery Script, Creating first jQuery script 3.3Traversing the DOM, Selecting Elements with jQuery, 3.4 Refining & Filtering Selections, Selecting Form Elements 3.5 Working with Selections - Chaining, Getters & Setters

CSS, Styling, & Dimensions Manipulating Elements - Getting & Setting Information about Elements, Moving, Copying, & Removing Elements, Creating New Elements 3.8 Manipulating Attributes, Utility Methods Events - Connecting Event to Elements, Name spacing Events, Event handling, Triggering Event handlers, Event Delegation Animating effects - animate(), click(), hover(), toggle()

Plugins - Create a basic plugin, Finding & Evaluating Plugins, Writing Plugins, Tabs, Panels & Panes examples jQuery UI & Forms

AJAX Overview, jQuery’s AJAX related methods, Ajax & Forms, Ajax Events

4 Apache HTTP Server

Concept of Web Server, Obtaining & Installing Apache Http Server on Windows & Linux Editing httpd.conf configuration file, Configuration directives in httpd.conf - Server Root, PidFile, Server Name, Add site to /etc./hosts file, Document Root, Error Log, Listen, Directory, Files, Location, Redirect, Virtual Hosts, Modules 4.4 Creating .htaccess, .htpasswd file, Configuring httpd.conf to allow authentication via .htaccess 4.5 Secure Web server - Editing ssl.conf configuration file, Create SSL certificate, Certificate Authority (CA), server key, Certificate Signing Request (CSR),

5 XML Concept of XML, features of XML Writing XML elements, attributes, etc. XML with CSS, programs on it. XML with DSO, programs on it. XML Namespace, XML DTD, programs on it. XML schemas, writing simple sheet using XSLT SAX Parser, DOM Parser Introduction to SOAP, Examples on XML



Topics | Web Technologies (MCA35)

Unit Sub Unit Topic

1 1.0 HTML & CSS 1.1 HTML 1.2 HTML Tags 1.3 World Wide Web (WWW) 1.4 Cascading Style Sheet (CSS) 1.5 Style Sheets 1.6 Examples on CSS

2 2.0 JavaScript 2.1 Variables, Constants, Identifiers & Operators 2.2 Control & Looping Structures 2.3 Array in JavaScript 2.4 Event Handling in JavaScript 2.5 Objects in JavaScript 2.6 Document Object Model (DOM) 2.7 Validations in JavaScript

3 3.0 jQuery & Ajax 3.1 jQuery 3.2 jQuery Traversing 3.3 jQuery Selectors



3.4 CSS, Styling & Dimensions 3.5 Manipulating Elements 3.6 Utility Methods 3.7 Events 3.8 Animating Effects 3.9 Plugins 3.10 jQuery UI & Forms 3.11 Ajax

4 4.0 Apache HTTP Server 4.1 Apache 4.2 httpd.conf 4.3 Configuration Directives in httpd.conf 4.4 htacess & .htpasswdFile 4.5 Secure Web Server

5 5.0 XML 5.1 XML with CSS 5.2 XML with DSO 5.3 XML Namespaces 5.4 XML DTD 5.5 XML Schema 5.6 SAX Parser 5.7 DOM Parser 5.8 SOAP (Simple Object Access Protocol)



Semester 4:

Following Subjects-

1. MCA41 | Design & Analysis of Algorithms

2. MCA42 | Information Security & Audit

3. MCA43 | Java Programming

4. MCA44 | Mobile Computing

5. MCA45 | Optimization Technique



Semester 4:

1. Design & Analysis of Algorithms (MCA41)


Unit No.


1 Introduction Algorithm, analysis Time complexity & space complexity

O-notation,Omega notation & Theta notation, Heaps & Heap sort, Sets & disjoint set, union

& find algorithms. Sorting in linear time. Tower of Hannoi.

2 Sets & Sorting Heaps & Heap sort Sets & disjoint set Union & find algorithms. Sorting in linear time.

3 Divide & Conquer Divide & Conquer General Strategy Exponentiation. Binary Search Quick Sort Merge Sort

4 Greedy Method General Strategy, Knapsack problem Job sequencing with Deadlines Optimal merge patterns Minimal Spanning Trees Dijkstra’s algorithm.



5 Dynamic Programming General Strategy

Multistage graphs OBST, 0/1 Knapsack Traveling Salesperson Problem Flow Shop Scheduling

6 Backtracking Backtracking: General Strategy N- Queen’s problem Graph Coloring Hamiltonian Cycles, 0/1 Knapsack

7 Branch & Bound General Strategy, 0/1 Knapsack Traveling Salesperson Problem

8 NP-HARD & NP-COMPLETE PROBLEMS

Basic concepts, of NP-Hard & NP-Complete Problems (Only concepts should be covered)



Topics | Design & Analysis of Algorithms (MCA41)

Unit Sub Unit Topic

1 1.0 Introduction 1.1 Algorithm 1.2 Performance Analysis: Time & Space Complexity 1.3 O-notation, Omega Notation & Theta Notation 1.4 Heaps & Heap Sort 1.5 Tower of Hannoi

2 2.0 Sets & Sorting 2.1 Sets 2.2 Sorting in Linear Time

3 3.0 Divide & Conquer 3.1 Exponentiation 3.2 Binary Search 3.3 Sorting: Merge Sort, Quick Sort

4 4.0 Greedy Method 4.1 Knapsack Problem 4.2 Job Sequencing with Deadlines 4.3 Optimal Merge Patterns 4.4 Minimal Spanning Trees



4.5 Dijkstra’s Algorithm

5 5.0 Dynamic Programming 5.1 Multistage Graphs 5.2 Optimal Binary Search Trees (OBST) 5.3 0/1 Knapsack Problem 5.4 Travelling Salesperson Problem 5.5 Flow Shop Scheduling

6 6.0 Backtracking 6.1 N-Queen’s Problem 6.2 Graph Coloring 6.3 Hamiltonian Cycles 6.4 0/1 Knapsack Problem using Backtracking

7 7.0 Branch & Bound 7.1 O/1 Knapsack 7.2 Traveling Salesperson Problem

8 8.0 NP-Hard & NP-Complete Problems 8.1 NP-Hard Problems 8.2 NP-Complete Problems 8.3 Relationship Between NP-Hard & NP-Complete Problems



Semester 4:

2. Information Security & Audit (MCA42)


Unit No.


1 Introduction to Information Security

History & evaluation of Information security CIA triangle. Components of IS, Control in IT environment, Information security Management system, components of ISMS & conceptual framework. Steps for developing ISMS.

2 Need of Information security

Threats to information security, Risk to Information systems Information security in organization, Introduction to cybercrimes & attacks Information security policy, policy definition & security life cycle.

3 Information Security Policy & Standards

Security principles Types of Information security policies Administrative & Technical A structure & framework of compressive security policy, policy infrastructure, policy design life cycle & design processes, PDCA model, Security policy standards & practices -BS7799, ISO/IEC 17799, ISO 27001. Auditing tools such as ISO 27001 ISMS TOOL KIT, NGS AUDITOR, Windows password auditor, ISO IES 27002 2005 IS AUDIT TOOL



4 Domains of IT

security User/accepted usage/ access, data access, physical access Internet access, e-mail, digital signature, outsourcing, software development & acquisition, hardware acquisition Network & telecom, BCP & DRP, security organization structure. Domains related security based case studies.

5 IT Governance What is IT Governance, good governance, objectives & dimensions, foundation, structure, processes IT governance framework- COBIT, ITIL, ISO 17799 IT Governance maturity model.

6 Information Security Audit

Auditing concepts ISA need, concept, standards, performance, steps, Techniques, methodologies, around & through Computer, Controls – Concept objectives, types, risk.

7 Controls Input, process, validation, output, logical access, physical access Database, network, environment, BCP, Evidence Collection, evaluation & Reporting methodologies.

8 Ethical hacking



Topics | Information Security & Audit (MCA42)

Unit Sub Unit Topic

1 1.0 Introduction to Information Security 1.1 Information Security 1.2 Information Security Management System (ISMS)

2 2.0 Need of Information Security 2.1 Threats to Information Security 2.2 Risk to Information System 2.3 Information Security in Organization 2.4 Introduction to Cyber Crimes & Attacks 2.5 Information Security Policy

3 3.0 Information Security Policy & Standards 3.1 Information Security Policy 3.2 Security Policy Standards & Practices 3.3 PDCA Model 3.4 ISO/IES 27002

4 4.0 Domains of IT Security 4.1 Physical Access 4.2 Internet Access 4.3 E-mail Security Domain



4.4 Digital Signature 4.5 Outsourcing 4.6 Software Development & Acquisition 4.7 Network & Telecom 4.8 Security Organization Structure 4.9 BCP & DRP

5 5.0 IT Governance 5.1 IT Governance Frameworks 5.2 Constructing IT Governance Framework

6 6.0 Information Security Audit 6.1 IS Audit 6.2 IS Auditing Standards 6.3 Techniques of IT Security Audit 6.4 Methodologies 6.5 Auditing through Computer & Around Computer 6.6 Controls of IS Audit

7 7.0 Controls 7.1 Information Security Controls 7.2 Categories of Controls 7.3 Control Techniques 7.4 User Controls



8 8.0 Ethical Hacking 8.1 Hacking 8.2 Ethical Hacking



Semester 4:

3. Java Programming (MCA43)


Unit No.


1 Introduction to Core Java

Features of JAVA JDK Environment & Tools (javac, java, applet viewer, Javadoc, jdb) Object Oriented concepts with respect to Java Difference between C++ & JAVA Java Programming Fundamentals Structure of java program, data types, variables, Operators, Keywords, Naming conventions, Decision making statements, Iterative statements, Type casting, Arrays (One dimensional & Multidimensional) String (String Arrays, String Methods, StringBuffer)

Creating classes & objects Constructors (with all types) Garbage collection & finalize () method.

Implementation of Inheritance Single, Multilevel, Hierarchical, Use of super keyword, super constructor, this keyword Implementation of polymorphism Method overloading, Method overriding Nested & inner classes

Modifiers & Access control (Default, public, private, protected, private protected) Final variables, Methods & classes Abstract methods & classes Interfaces Packages Packages concept, Creating user defined package, Java built in packages (Java. Lang, java.util)



1.14 Exception Handling Exception types, Using try catch,

Multiple catch, Nested try, throw, throws, finally, user defined exceptions

2 Applet As Java Applications

Introduction Applet Life Cycle Applets specific methods & Related HTML references An Applet Skeleton The HTML APPLET Tag with all attributes. Creating an Applet Displaying it using Web Browser, appletwiewer.exe Passing parameters to applet

Advantages & Disadvantages of Applet Vs Applications

3 Abstract Windows Toolkit

Components & Graphics Containers, Frames & Panels Layout Managers Border layout, Flow layout, Grid layout, Card layout AWT all components Event delegation Model Event source

& handler Event categories, Listeners, interfaces Anonymous classes, Adapter Classes Swing Libraries Model view Controller design pattern Different layout, menus dialog boxes, text input

4 Java Input Output

Java IO package Byte/Character Stream Buffered reader / writer File reader / writer Print writer File Sequential / Random

5 Java Collection Framework

Collections Overview The Collection Interfaces Collection Interface, List Interface, Set Interface, Sorted Set Interface The Collection Classes Array List Class, Linked List Class, Hash Set Class, Tree Set Class Accessing a Collection via an Iterator The Map Interfaces Map Interface, Sorted Map Interface The Map Classes Hash Map, Tree Map



The Legacy Interfaces Enumeration Interface The Legacy

Classes Vector , Stack Hash table

6 JDBC 6.1Java database connectivity, JDBC Architecture, JDBC API, 6.2 Types of JDBC drivers

Steps to create JDBC Application Writing first JDBC applications

Types of statement objects (Statement, Prepared Statement & Callable Statement)

Types of result set, ResultSetMetadata Inserting & updating records JDBC & AWT

Connection pooling 7 Multithreading Multithreading concepts

Thread Life cycle Creating multithreaded application

(Using Thread Class & Using Runnable Interface) Thread priorities Thread synchronization Inter thread communication

8 Networking with Java

Networking basics Sockets, port Proxy servers Internet addressing 7 URL java.net – networking classes & interfaces Implementing TCP/IP based Server & Client Datagrams – Datagram packet, Datagram server & client URL connections

9 RMI Introduction & Architecture of RMI Stubs & skeleton Java rmi classes & interfaces Writing simple RMI application

Parameter passing in remote methods (marshalling & unmarshalling)

10 Java Beans Java Beans Introduction, design pattern Writing simple bean Beans persistence & introspection



Topics | Java Programming (MCA43)

Unit Sub Unit Topic

1 1.0 Introduction to Core Java 1.1 Introduction to Java 1.2 JDK Environment & Tools 1.3 Object Oriented Concepts with respect to Java 1.4 Difference between C++ & Java 1.5 Java Programming Fundamentals 1.6 Control Structure 1.7 Creating Class & Objects 1.8 Constructors 1.9 Garbage Collection & finalize() method 1.10 Implementation of Inheritance 1.11 Implementation of Polymorphism 1.12 Nested & Inner Classes 1.13 Modifiers & Access Controls 1.14 Final Variables, Methods & Classes 1.15 Abstract Methods & Classes 1.16 Interfaces 1.17 Packages 1.18 Exception Handling



2 2.0 Applet As Java Applications 2.1 Applet 2.2 Applet Life Cycle 2.3 Applet Methods 2.4 An Applet Skeleton 2.5 Applet Tags 2.6 Creating an Applet 2.7 Passing Parameters to Applet 2.8 Advantages & Disadvantages of Applet Vs Application

3 3.0 Abstract Windows Toolkit 3.1 Interfaces & Classes 3.2 AWT Components 3.3 Graphics 3.4 Containers, Frames & Panels 3.5 Layout Managers 3.6 Event Handling 3.7 Swing Libraries

4 4.0 Java Input Output 4.1 Java IO Package 4.2 Stream Byte / Character 4.3 Buffered Reader / Writer 4.4 File Reader / Writer



4.5 Print Writer 4.6 File Sequential / Random

5 5.0 Java Collection Framework 5.1 Collections Overview 5.2 The Collection Interfaces 5.3 The Collection Classes 5.4 Accessing a Collection Via an Iterator 5.5 The Map Interfaces 5.6 The Legacy Classes

6 6.0 JDBC 6.1 JDBC Drivers 6.2 Creating JDBC Application 6.3 Statement Objects 6.4 Result Set & ResultSetMetadata 6.5 Inserting & Updating Records 6.6 JDBC & AWT 6.7 Connection Pooling

7 7.0 Multithreading 7.1 Multithreading Concepts 7.2 Thread Life Cycle 7.3 Creating Multithreaded Application



7.4 Thread Priorities 7.5 Thread Synchronization 7.6 Inter Thread Communication (ITC)

8 8.0 Networking with Java 8.1 Networking Basics 8.2 Java.net – Networking Classes & Interfaces 8.3 Implementing TCP/IP based Server & Client 8.4 Datagrams 8.5 URL Connections

9 9.0 RMI 9.1 RMI Architecture 9.2 Stubs & Skeleton 9.3 Wiring Simple RMI Application 9.4 Classes & Interfaces in RMI 9.5 Parameter Passing in Remote Methods

10 10.1 Java Beans 10.2 Design Patterns for Java Beans 10.3 Writing Simple Bean 10.4 Beans Persistence & Introspection



Semester 4:

4. Mobile Computing (MCA44)


Unit No.


1 Introduction to Mobile Communications & Computing

Mobile Computing (MC): Introduction to MC, applications, Limitations, & architecture. Cellular Overview Cellular networks, Cellular concept, location management, Handoffs

2 Wireless LANs & Application overview

WLAN Wireless applications

Mac issues(Hidden & exposed terminals, Near & far terminals), Mobile IP Mobile ad-hoc networks(MANET) TCP Issues Disconnected operations Data broadcasting Mobile agents

3 GSM 3.1 GSM · Air-interface, channel structure, timing, ·Mobile Services (Bearer, Tele-& supplementary services) · System Architecture - Radio subsystem - Network & switching subsystem - Operation subsystem · Protocols

Localization & calling Handover



3.3 Value Added Services

- SMS - Cell Broadcast Service - MMS - Location Services 3.2 WAP · Architecture · Protocol stack · Application environment, - application demo

4 Access Technologies Blue Tooth, GPRS, 802.11, CDMA 3 Mobile Phone Technologies (1G, 2G, 2.5G, 3G)

5 Database Issues Hoarding techniques Caching invalidation mechanisms

Client server computing with adaptation, Power-aware & context-aware computing, Transactional models, query processing, recovery, & quality of service issues.

6 Platform/Operating Systems for application development

Palm OS Windows CE Embedded Linux J2ME (Introduction) Symbian (Introduction)

7 Android application development Overview of Android Devices running android Why Develop for Android Features of android Architecture of Android, Libraries Software development kit

8 Designing the user interface. Introducing views & view groups, Introducing layouts, Creating new views, Creating & using Menus

9 Starting with Application Coding 9.1 Introducing Intents



Introducing Adapters

Using Internet Resources Introducing Dialogs Capturing Date & Time Validating & Handling Input data

10 Accessing Location Based Services Application

Selecting Location Provider Finding your location. Creating map based activities

11 Data Storage, retrieval & Sharing File system in android Internal & external storage Saving & loading files File Management tools

12 Introduction to SQLite Creating SQLite database, Editing Tasks with SQLite Cursors & content values Working with Android database.

13 Peer to peer to communication Accessing Telephony Hardware Introducing Android Instant Messaging

GTalk Service : Using, binding & Making connection

Managing chat Sessions Sending & receiving Data messages Introducing SMS

Using, sending & Listening SMS Messages

14 Accessing Android Hardware Audio, Video & Using the camera. Introducing Sensor Manager Android Telephony Using Bluetooth Manage network & Wi-Fi connections

15 Publishing Android Application to Market

Understanding the Release Process Preparing the Release Candidate Build Testing the Application Release Candidate Packaging & Signing an Application Testing the Signed Application Package



Topics | Mobile Computing (MCA44)

Unit Sub Unit Topic

1 1.0 Introduction to Mobile Communications & Computing 1.1 Mobile Computing 1.2 Cellular Overview

2 2.0 Wireless LANs & Application Overview 2.1 WLAN 2.2 Wireless Applications 2.3 MAC Issues 2.4 Mobile IP 2.5 Mobile Ad-hoc Networks 2.6 TCP Issues 2.7 Disconnected Operations 2.8 Data Broadcasting 2.9 Mobile Agents

3 3.0 GSM 3.1 GSM Overview 3.2 Mobile Services 3.3 System Architecture 3.4 Protocols 3.5 Value Added Services



3.6 WAP

4 4.0 Access Technologies 4.1 Bluetooth 4.2 GPRS 4.3 802.11 4.4 CDMA 3 4.5 Mobile Phone Technologies

5 5.0 Database Issues 5.1 Database Hoarding 5.2 Data Caching 5.3 Client-Server Computing 5.4 Context-Aware Computing 5.5 Transaction Models 5.6 Query Processing

6 6.0 Platform/Operating System for Application Development 6.1 Palm OS 6.2 Windows CE 6.3 Embedded Linux 6.4 J2ME 6.5 Symbian



7 7.0 Android Application Development 7.1 Overview of Android 7.2 Devices Running Android 7.3 Why Develop for Android 7.4 Features of Android 7.5 Architecture of Android 7.6 Software Development Kit

8 8.0 Designing the User Interface 8.1 Fundamental User Interface 8.2 Introducing Views 8.3 Introducing Layouts 8.4 Creating & Using Menus

9 9.0 Starting with Application Coding 9.1 Introducing Intents 9.2 Introducing Adapters 9.3 Using Internet Resources 9.4 Introducing Dialogs 9.5 Capturing Date & Time 9.6 Validating & Handling Input Data

10 10.0 Accessing Location Based Service 10.1 Using Location-Based Services



10.2 Selecting Location Provider 10.3 Finding Your Location 10.4 Creating Map Based Activities 10.5 Creating & Using Overlays

11 11.0 Data Storage, Retrieval & Sharing 11.1 File System in Android 11.2 Internal & External Storage 11.3 Saving & Loading Files 11.4 File Management Tools

12 12.0 Introduction to SQLite 12.1 Creating SQLite Database 12.2 Editing Tasks with SQLite 12.3 Cursors & Content Values 12.4 Working with Android Databases

13 13.0 Peer to Peer Communication 13.1 Accessing Telephony Hardware 13.2 Introducing Android Instant Messaging 13.3 GTalk Services 13.4 Managing Chat Sessions 13.5 Sending & Receiving Data Messages 13.6 Introducing SMS



14 14.0 Accessing Android Hardware 14.1 Using the Media APIs 14.2 Using the Camera 14.3 Introducing the Sensor Manager 14.4 Android Telephony 14.5 Using Bluetooth 14.6 Managing Network & Wi-Fi Connections

15 15.0 Publishing Android Application to Market 15.1 Understanding the Release Process 15.2 Preparing the Release Candidate Build 15.3 Testing the Application Release Candidate 15.4 Packaging & Signing an Application 15.5 Testing the Signed Application Package



Semester 4:

5. Optimization Technique (MCA45)


Unit No.


1 Linear Programming Various definitions, statements of basic theorems & properties, Advantages,

Limitations & Application areas of Linear Programming Linear Programming. The Graphical method. Graphical Solution methods of Linear Programming problem, Problems, Phase II of the Simplex Method, Primal & Dual Simplex Method, Big .M method. Transportation Problem & its solution,

Assignment Problem & its solutions by Hungarian Method

2 Sequential model & related Problems

Processing n jobs through A) 1 machine & B) 2 machines

3 Queuing Theory Characteristics of Queuing Models Transient & Steady states of the System

3.3 Model. I [ (M/M/1) : (FCFS / / ) ] 3.4 Model II . Generalization of Model 3.5[(M/M/1) : (FCFS / / ) ] (Birth-Death Process) 3.6 Miscellaneous Problems



4 Replacement Theory Replacement of items that deteriorates.

When money value is consider & Problems Replacement of items that fails suddenly

Individuals & Group Replacement-Miscellaneous Problems

5 INVENTORY THEORY Inventory Model Building Single item deterministic Model Inventory Control Models without strategies Inventory Control Models with shortages

6 PERT & CPM Basic differences between PERT & CPM. Arrow Networks, time estimates, Earliest expected time Latest. allowable occurrences time Forward Pass Computation Backward Pass Computation Representation in Tabular Form Critical Path

Probability of meeting scheduled date of completion, Calculation on CPM network. Various floats for activities Critical path updating projects. Operation time cost trade off Curve project Time cost. trade off Curve-

Selection of schedule based on Cost Analysis, Crashing the network



Topics | Optimization Technique (MCA45)

Unit Sub Unit Topic

1 1.0 Linear Programming 1.1 Linear Programming Problem 1.2 Applications Area of Linear Programming Method 1.3 Linear programming – The Graphical Method 1.4 Simplex Method 1.5 Primal & Dual simplex Method 1.6 Big – M method 1.7 Transportation Problem & its Solution 1.8 Assignment problems & its Solution by Hungarian Method

2 2.0 Sequential Model & Related Problems 2.1 Sequential Model 2.2 Processing n Jobs through 1 Machine 2.3 Processing n Jobs through 2 Machines

3 3.0 Queuing Theory 3.1 Queuing Model & its Characteristics 3.2 Transient & Steady States of the System 3.3 Model- I [ (M/M/1):(FCFS / ∞ /∞) ] 3.4 Model- II Generalization of Model 3.5 [ (M/M/1):(FCFS / ∞ /∞) ] (Birth – Death Process)



3.6 Problems

4 4.0 Replacement Theory 4.1 Replacement Models

4.2 Replacement of Items that Deteriorates, when Money Value is Consider

4.3 Replacement of Items that Fails Suddenly 4.4 Individuals & Group Replacement 4.5 Problems

5 5.0 Inventory Theory 5.1 Inventory 5.2 Inventory Model Building 5.3 Single Item Deterministic Model 5.4 Inventory Control Models without Strategies 5.5 Inventory Control Models with Shortages

6 6.0 PERT & CPM 6.1 Network Techniques 6.2 Critical Path Method (CPM) 6.3 Program Evaluation & Review Technique (Pert) 6.4 Arrow Networks 6.5 Time Estimates 6.6 Earliest Expected Time 6.7 Latest Allowable Occurrences Time



6.8 Forward Pass Computations 6.9 Backward Pass Computations 6.10 Calculation on CPM Networks 6.11 Time Cost – Trade Off Curve 6.12 Various Floats For Activities 6.13 Probability Of Meeting Scheduled Date Of Completion 6.14 Operation Time Cost Trade Off Curve Project 6.15 Selection Of Schedule Based On Cost Analysis 6.16 Crashing The Network



Semester 5:

Following Subjects-

1. MCA51 | Software Testing

2. MCA52 | Advanced Operating System

3. MCA53 | Distributed Database System

4. MCA54 | Network Programming

5. MCA55 | Principles of Programming Languages



Semester 5:

1. Software Testing (MCA51)


Unit No.


1 Software Testing Introduction, Nature of errors, Testing principles & Testing fundamentals, Debugging

2 Approaches to Testing - I

White Box Testing, Black Box Testing, Gray Box Testing, Unit Testing Integration- Top-down ,Bottom up Big Bang Sandwich

3 Testing for Specialized Environments

Testing GUI’s, Testing of Client/Server Architectures, Testing Documentation & Help Facilities, Testing for Real-time Systems

4 Software Testing Strategies &Software metrics

Validation Testing, System Testing, verification, Performance Testing, Regression Testing, Agile testing, Acceptance testing ,Smoke Testing ,Load Testing, Introduction, Basic Metrics, Complexity Metrics

5 Specialized Testing & Testing Tools (Introduction)

Test Case Design, Junit, Apache Jmeter, Winrunner Loadrunner, Rational Robot



Topics | Software Testing (MCA51)

Unit Sub Unit Topic

1 1.0 Software Testing 1.1 Software Testing Fundamentals 1.2 Debugging

2 2.0 Approaches to Testing - I 2.1 White Box Testing 2.2 Black Box Testing 2.3 Gray Box Testing 2.4 Levels of Testing

3 3.0 Testing for Specialized Environment 3.1 Testing Graphical User Interfaces (GUIs) 3.2 Testing of Client/Server Architectures 3.3 Testing Documentation & Help Facilities 3.4 Testing for Real-Time Systems

4 4.0 Software Testing Strategies & Software Metrics 4.1 Software Testing Strategy 4.2 Software Metrics



5 5.0 Specialized Testing & Testing Tools (Introduction) 5.1 Test Case Design 5.2 Junit 5.3 Apache Jmeter 5.4 WinRunner 5.5 LoadRunner 5.6 Rational Robot



Semester 5:

2. Advanced Operating System (MCA52)


Unit No.


1 Introduction to UNIX/Linux Kernel

System Structure, User Perspective, Assumptions about Hardware, Architecture of UNIX Operating System Concepts of Linux Programming- Files & the Filesystem, Processes, Users & Groups, Permissions, Signals, Interprocess Communication

2 File & Directory I/O Buffer headers, structure of the buffer pool, scenarios for retrieval of a buffer, reading & writing disk blocks, inodes, structure of regular file, open, read, write, lseek, close, pipes, dup open, create, file sharing, atomic operations, dup2, sync, fsync, & fdatasync, fcntl, /dev/fd, stat, fstat, Istat, file types, Set-User-ID & Set-Group-ID, file access permissions, ownership of new files & directories, access function, umask function, chmod & fchmod, sticky bit, chown, fchown, & lchown, file size, file truncation, file systems, link, unlink, remove, & rename functions, symbolic links, symlink & readlink functions, file times, utime, mkdir & rmdir, reading directories, chdir, fchdir, & getcwd, device special files Scatter/Gather I/O, Mapping Files into Memory, Advice for Normal File I/O, I/O Schedulers & I/O Performance, Directories, Copying & Moving files, Device Nodes, Out-of- Band Communication

3 Process Environment, Process Control & Process Relationships

Process states & transitions, layout of system memory, the context of a process, saving the context of a process, sleep, process creation, signals, process termination, awaiting process termination, invoking other programs, the user id of



a process, changing the size of the process, The Shell,

Process Scheduling Process termination, environment list, memory layout of a C program, shared libraries, environment variables, setjmp & longjmp, getrlimit & setrlimit, process identifiers, fork, vfork, exit, wait & waitpid, waitid, wait3 & wait4, race conditions, exec, changing user IDs & group IDs,system function, user identification, process times The Process ID, Running a New Process, Terminating a Process, Waiting for Terminated Child Processes, Users & Groups, Daemons, Process Scheduling, Yielding the Processor, Process Priorities, Processor Affinity

4 Memory Management

The Process Address Space, Allocating Dynamic Memory, Managing Data Segment, Anonymous Memory Mappings, Advanced Memory Allocation, Debugging Memory Allocations, Stack-Based Allocations, Choosing a Memory Allocation Mechanism, Manipulating Memory, Locking Memory, Opportunistic Allocation Swapping, Demand Paging

5 Signal Handling Signal concepts, signal function, unreliable signals, interrupted system calls, reentrant functions, SIGCLD semantics, reliable-signal technology, kill & raise, alarm & pause, signal sets, sigprocmask, sigpending, sigsetjmp & siglongjmp, sigsuspend, abort, system function revisited, sleep Signal Concepts, Basic Signal Management, Sending a Signal, Reentrancy, Signal Sets, Blocking Signals, Advanced Signal Management, Sending a Signal with a Payload

6 Windows Thread Management

Thread Internals Data Structures, Kernel Variables, Performance Counters, Relevant Functions, Birth of a l Thread Examining Thread Activity : Limitations on Protected Process Threads, Worker Factories (Thread Pools) Thread Scheduling Overview of Windows Scheduling, Priority Levels, Windows Scheduling APIs, Relevant Tools, Real- Time Priorities, Thread States, Dispatcher Database, Quantum, Scheduling Scenarios, Context Switching, Idle Thread, Priority Boosts



Topics | Advanced Operating System (MCA52)

Unit Sub Unit Topic

1 1.0 Introduction to UNIX / Linux Kernel 1.1 System Structure 1.2 User Perspective 1.3 Assumptions about Hardware 1.4 Architecture of UNIX Operating System 1.5 Concepts of Linux Programming

2 2.0 File & Directory I/O 2.1 Buffer Cache 2.2 Internal Representation of Files 2.3 System Calls for the File System 2.4 File I/O 2.5 Files & Directories 2.6 Advanced File I/O 2.7 File & Directory Management

3 3.0 Process Environment, Process Control & Process Relationships

3.1 Structure of Process 3.2 Process Control 3.3 Process Scheduling 3.4 Process Environment



3.5 Process Control 3.6 Process Management 3.7 Advanced Process Management

4 4.0 Memory Management 4.1 The Process Address Space 4.2 Allocating Dynamic Memory 4.3 Managing Data Segment 4.4 Anonymous Memory Mappings 4.5 Advanced Memory Allocation 4.6 Debugging Memory Allocations 4.7 Stack-based Allocations 4.8 Choosing a Memory Allocation Mechanism 4.9 Manipulating Memory 4.10 Locking Memory 4.11 Opportunistic Allocation 4.12 Swapping 4.13 Demand Paging 4.14 Concepts of Linux Programming

5 5.0 Signal Handling 5.1 Introduction to Signal Concepts 5.2 Signal Function 5.3 Unreliable Signals 5.4 Interrupted System Calls



5.5 Reentrant Functions 5.6 SIGCLD Semantics 5.7 Reliable Signal Terminology & Semantics 5.8 kill & raise Functions 5.9 alarm & pause Functions 5.10 Signal Sets 5.11 sigprocmask Function 5.12 sigpending Function 5.13 sigsetjmp & siglongjmp Functions 5.14 Sigsuspend 5.15 abort Function 5.16 System Function 5.17 Sleep Function 5.18 Signal Concepts 5.19 Basic Signal Management 5.20 Sending a Signal 5.21 Reentrancy 5.22 Signal Sets 5.23 Blocking Signals 5.24 Advanced Signal Management (sigaction()) 5.25 Sending a Signal with a Payload (sigqueue( ))

6 6.0 Windows Thread Management 6.1 Thread Internals 6.2 Thread Scheduling



Semester 5:

3. Distributed Database System (MCA53)


Unit No.


1 Distributed databases: An overview

Features of distributed Vs centralized databases Features of distributed Vs centralized databases Promises / problem areas in implementing a DDB

2 DDBMS Architecture DBMS Standardization Architectural models for DDBMS DDBMS architecture Distributed catalog management

3 Distributed database design Alternative design strategies Distributed design issues Concepts of join graphs Fragmentation & allocation

4 Overview of Query processing Objectives of query processing Complexity of relational algebra operators Characterization of query processors Layers of query processing

5 Query decomposition & data localization

Query decomposition Localization of distributed data



6 Optimization of distributed

queries Query optimization Centralized query

Ordering in fragment queries. Distributed query optimization algorithms

Centralized query optimization Join ordering in fragment queries Distributed query optimization algorithms

7 Management of distributed transactions

Framework for transaction management Supporting atomicity of distributed transactions Concurrency control of distributed transactions Architectural aspects of distributed transactions

8 Concurrency control Foundations of distributed concurrency control Distributed deadlocks Concurrency control based on timestamps

Optimistic methods for distributed concurrency control

9 Distributed DBMS reliability Failures & fault tolerance in distributed systems Failures in DDBMS Local reliability protocols Distributed reliability protocols Dealing with site failures Network partitioning



Topics | Distributed Database System (MCA53)

Unit Sub Unit Topic

1 1.0 Distributed Databases: An Overview 1.1 Distributed Database 1.2 Features of Distributed Versus Centralized Databases 1.3 Why Distributed Databases? 1.4 Distributed Database Management Systems (DDBMS) 1.5 Promises / Problem Areas in Implementing a DDB

2 2.0 DDBMS Architecture 2.1 DBMS Standardization 2.2 Architectural Models for DDBMS 2.3 DDBMS Architecture 2.4 Distributed Catalog Management

3 3.0 Distributed Database Design 3.1 Distribution of Data 3.2 Alternative Design Strategies 3.3 Distribution Design Issues 3.4 Fragmentation 3.5 Allocation



4 4.0 Overview of Query Processing 4.1 Query Processing Problems 4.2 Objectives of Query Processing 4.3 Complexity of Relational Algebra Operators 4.4 Characterization of Query Processors 4.5 Layers of Query Processing

5 5.0 Query Decomposition & Data Localization 5.1 Query Decomposition 5.2 Localization of Distributed Data

6 6.0 Optimization of Distributed Queries 6.1 Query Optimization 6.2 Centralized Query Optimization 6.3 Join Ordering in Fragment Queries 6.4 Distributed Query Optimization Algorithms

7 7.0 The Management of Distributed Transactions 7.1 A Framework for Transaction Management 7.2 Supporting Atomicity of Distributed Transactions 7.3 Concurrency Control for Distributed Transactions 7.4 Architectural Aspects of Distributed Transactions



8 8.0 Concurrency Control 8.1 Foundations of Distributed Concurrency Control 8.2 Distributed Deadlocks 8.3 Concurrency Control Based on Timestamps 8.4 Optimistic Methods for Distributed Concurrency Control

9 9.0 Distributed DBMS Reliability 9.1 Reliability Concepts & Measures 9.2 Failures in DDBMS 9.3 Local Reliability Protocols 9.4 Distributed Reliability Protocols 9.5 Dealing with Site Failures 9.6 Network Partitioning



Semester 5:

4. Network Programming (MCA54)


Unit No.


1 Introduction A Simple Daytime Client, Protocol Independence, Error Handling: Wrapper Functions, A Simple Daytime Server

2 Sockets Introduction

Socket Address Structures, Value-Result Arguments, Byte Ordering Functions, Byte Manipulation Functions, inet_aton, inet_addr, & inet_ntoa Functions, inet_pton & inet_ntop Functions, sock_ntop & Related Functions, readn, writen, & readline Functions, isfdtype Function What is a Socket?, Using Sockets

3 Elementary TCP Sockets

socket Function, connect Function, bind Function, listen Function, accept Function, fork & exec Functions, Concurrent Servers, close Function, getsockname & getpeername Functions

4 TCP Client-Server Example

TCP Echo Server: main Function, TCP Echo Server: str_echo Function, TCP Echo Client: main Function, TCP Echo Client: str_cli Function, Normal Startup, Normal Termination, Connection Abort before accept Returns, Termination of Server Process, SIGPIPE Signal, Crashing of Server Host, Crashing & Rebooting of Server Host, Shutdown of Server Host

5 I/O Multiplexing: The select & poll Functions

I/O Models, select Function, str_cli Function (Revisited), Batch Input, shutdown Function, str_cli Function (Revisited Again), TCP Echo Server (Revisited), pselect Function, poll Function, TCP Echo Server



getsockopt & setsockopt Functions, Checking If an Option Is

Supported & Obtaining the Default, Socket States, Generic Socket Options, IPv4 Socket Options, ICMPv6 Socket Option, IPv6 Socket Options, TCP Socket Options

Elementary UDP Sockets

recvfrom & sendto Functions, UDP Echo Server: main Function, UDP Echo Server: dg_echo Function, UDP Echo Client: main Function, UDP Echo Client: dg_cli Function, Lost Datagrams, Verifying Received Response, Server Not Running, Summary of UDP example, connect Function with UDP, dg_cli Function (Revisited), Lack of Flow Control with UDP, Determining Outgoing Interface with UDP, TCP & UDP Echo Server Using select User Datagram Protocol, File Transfer, Error Handling

Protocols, Sessions, State, & Implementing Custom Protocols

State vs. Stateless, Methods for Maintaining State, What Is a Protocol?, Designing a Custom Protocol, Our Chat Protocol, Protocol Registration

Elementary Name, Address Conversions & design decisions

Domain Name System, gethostbyname Function, RES_USE_INET6 Resolver Option, gethostbyname2 Function & IPv6 Support, gethostbyaddr Function, uname Function, gethostname Function, getservbyname & getservbyport Functions TCP vs. UDP, Application Protocol Choices, Client- Server Architecture, Client-Side Considerations, Server- Side Considerations



Topics | Network Programming (MCA54)

Unit Sub Unit Topic

1 1.0 Introduction 1.1 Basics of Client-Server Modeling 1.2 A Simple Daytime Client 1.3 Protocol Independence 1.4 Wrapper Functions 1.5 A Simple Daytime Server

2 2.0 Sockets Introduction 2.1 Socket Address Structures 2.2 Value-result Arguments 2.3 Byte Ordering Functions 2.4 Byte Manipulation Functions

2.5 inet_aton, inet_addr & inet_ntoa Functions

2.6 inet_pton & inet_ntop Functions 2.7 sock_ntop & Related Functions 2.8 readn, writen & readline Functions 2.9 isfdtype Function 2.10 Socket

3 3.0 Elementary TCP Sockets 3.1 socket Function



3.2 connect Function 3.3 bind Function 3.4 listen Function 3.5 accept Function 3.6 fork & exec Functions 3.7 Concurrent Servers 3.8 close Function 3.9 getsockname & getpeername Functions

4 4.0 TCP Client-Server Example 4.1 TCP Echo Server: main Function 4.2 TCP Echo Server: str_echo Function 4.3 TCP Echo Client: main Function 4.4 TCP Echo Client: str_cli Function 4.5 Normal Startup 4.6 Normal Termination 4.7 Connection Abort before accept Returns 4.8 Termination of Server Process 4.9 SIGPIPE Signal 4.10 Crashing of Server Host 4.11 Crashing & Rebooting of Server Host 4.12 Shutdown of Server Host



5 5.0 I/O Multiplexing: The select & poll Functions 5.1 I/O Models 5.2 select Function 5.3 str_cli Function (Revisited) 5.4 Batch Input 5.5 shutdown Function 5.6 str_cli Function (Revisited Again) 5.7 TCP Echo Server (Revisited) 5.8 pselect Function 5.9 poll Function 5.10 TCP Echo Server (Revisited Again)

6 6.0 Socket Options 6.1 getsockopt & setsockopt Functions 6.2 Checking If an Option Is Supported & Obtaining the Default 6.3 Socket States 6.4 Generic Socket Options 6.5 IPv4 Socket Options 6.6 ICMPv6 Socket Option 6.7 IPv6 Socket Options 6.8 TCP Socket Options

7 7.0 Elementary UDP Sockets 7.1 recvfrom & sendto Functions



7.2 UDP Echo Server: main Function 7.3 UDP Echo Server: dg_echo Function 7.4 UDP Echo Client: main Function 7.5 UDP Echo Client: dg_cli Function 7.6 Lost Datagrams 7.7 Verifying Received Response 7.8 Server Not Running 7.9 Summary of UDP Example 7.10 connect Function with UDP 7.11 dg_cli Function (Revisited) 7.12 Lack of Flow Control with UDP 7.14 Determining Outgoing Interface with UDP 7.15 TCP & UDP Echo Server Using select 7.16 User Datagram Protocol 7.17 File Transfer 7.18 Error Handling

8 8.0 Protocols, Sessions, State, & Implementing Custom Protocols

8.1 State vs. Stateless 8.2 Methods for Maintaining State 8.3 What Is a Protocol 8.4 Designing a Custom Protocol 8.5 Our Chat Protocol 8.6 Protocol Registration



9 9.0 Elementary Name, Address Conversions & Design Decisions 9.1 Domain Name System (DNS) 9.2 gethostbyname Function 9.3 Obsolete IPv6 Address Lookup Functions 9.4 gethostbyaddr Function 9.5 uname Function & gethostname function

9.6 getservbyname & getservbyport Functions

9.7 TCP vs. UDP 9.8 Application Protocol Choices 9.9 Client-Server Architecture 9.10 Client-Side Considerations 9.11 Server-Side Considerations



Semester 5:

5. Principles of Programming Languages (MCA55)


Unit No.


1 Introduction The Art of Language Design The Programming Language Spectrum Why Study Programming Languages? Compilation & Interpretation Programming Environments

2 Non-Imperative Programming Models: Functional, Logic Languages

Common LISP Basic LISP Primitives ( FIRST, REST, SETF, CONS, APPEND, LIST, NTHCDR, BUTLAST,LAST, LENGTH, REVERSE, ASSOC) Procedure definition & binding, DEFUN, LE Predicates & Conditional, EQUAL, EQ, EQL, =, MEMBER, LISTP, ATOM, NUMBERP,SYMBOLP, NIL, NULL, IF, WHEN, UNLESS, COND, CASE Procedure Abstraction & Recursion Turbo Prolog Introduction, facts, Objects & Predicates, Variables, Using Rules, Controlling execution fail & cut predicates

3 Names, Scopes, & Bindings

The Notion of Binding Time Object Lifetime & Storage Management : Static Allocation, Stack-Based Allocation, Heap-Based Allocation, Garbage Collection Scope Rules Static Scoping, Nested Subroutines, Declaration Order, Dynamic Scoping



The meaning of Names in a Scope Aliases,

Overloading, Polymorphism & Related Concepts The Binding of Referencing Environments Subroutine Closures, First-Class Values & Unlimited Extent, Object Closures Macro Expansion

4 Control Flow Expression Evaluation Precedence & Associativity, Assignments, Initialization, Ordering Within Expressions, Short-Circuit Evaluation Structured & Unstructured Flow Structured Alternatives to Goto Sequencing Selection Short-Circuited Conditions, Case/Switch Statements Iteration Enumeration-Controlled Loops, Combination Loops, Iterators, Logically Controlled Loops Recursion Iteration & Recursion, Applicative- & Normal-Order Evaluation

5 Data Types Introduction Primitive Data Types Numeric Types Integer Floating point Complex Decimal Boolean Types Character Types Character String Types Design Issues Strings & Their Operations String Length Operations Evaluation Implementation of Character String Types User defined Ordinal types Enumeration types



Designs Evaluation Subrange types

Ada’s design Evaluation Implementation of used defined ordinal types Array types Design issues Arrays & indices Subscript bindings & array categories Heterogeneous arrays Array initialization Array operations Rectangular & Jagged arrays Slices Evaluation Implementation of Array Types Associative Arrays Structure & operations Implementing associative arrays Record types Definitions of records References to record fields Operations on records Evaluation Implementation of Record types Union Types Design issues Discriminated versus Free unions Evaluation Implementation of Union types Pointer & Reference Types Design issues Pointer operations Pointer problems Dangling pointers Lost heap dynamic variables Pointers in C & C++ Reference types Evaluation Implementation of pointer & reference types Representation of pointers & references



Solution to dangling pointer problem

Heap management

6 Subroutines & Control Abstraction

Fundamentals of Subprograms 1Design Issues for subprograms -vi- Local Referencing Environments Parameter-Passing Methods Parameters That are Subprograms Overloaded Subprograms Generic Subroutines Generic Functions in C++ Generic Methods in Java Design Issues for Functions User-Defined Overloaded Operators Coroutines The General Semantics of Calls & Returns Implementing “Simple” Subprograms Implementing Subprograms with Stack-Dynamic Local Variables Nested Subprograms Blocks Implementing Dynamic Scoping

Data Abstraction & Object Orientation

Object-Oriented Programming Encapsulation & Inheritance Modules, Classes, Nesting (Inner Classes), Type Extensions, Extending without Inheritance Initialization & Finalization Choosing a Constructor, References & Values, Execution Order, Garbage Collection Dynamic Method Binding Virtual- & Non-Virtual Methods, Abstract Classes, Member Lookup, Polymorphism, Object Closures



Multiple Inheritance Semantic Ambiguities,

Replicated Inheritance, Shared Inheritance, Mix-In Inheritance.

Concurrency Protocols Introduction Multiprocessor Architecture Categories of concurrency Motivations for studying concurrency Introduction to Subprogram-level concurrency Fundamental concepts Language Design for concurrency. Design Issues Semaphores Introduction Cooperation synchronization Competition Synchronization Evaluation Monitors Introduction Cooperation synchronization Competition Synchronization Evaluation Message Passing Introduction The concept of Synchronous Message Passing Java Threads The Thread class Priorities Competition Synchronization Cooperation Synchronization Evaluation



Topics | Principles of Programming Languages (MCA55)

Unit Sub Unit Topic

1 1.0 Introduction 1.1 The Art of Language Design 1.2 The Programming Language Spectrum 1.3 Why Study Programming Languages? 1.4 Compilation & Interpretation 1.5 Programming Environments

2 2.0 Non-imperative Programming Models: Functional, Logic Languages

2.1 Introduction 2.2 LISP 2.3 Procedure Definition & Binding 2.4 Predicates 2.5 LISP – Arrays 2.6 LISP – Strings 2.7 LISP – Lists 2.8 LISP – Set 2.9 LISP - Input & Output 2.10 LISP - File I/O 2.11 LISP – Structures 2.12 PROLOG (Programming in Logic)



3 3.0 Names, Scopes & Bindings 3.1 The Notion of Binding Time 3.2 Object Lifetime & Storage Management 3.3 Scope Rules 3.4 The meaning of Names in a Scope 3.5 The Binding of Referencing Environments 3.6 Macro Expansion

4 4.0 Control Flow 4.1 Expression Evaluation 4.2 Structured & Unstructured Flow 4.3 Sequencing 4.4 Selection 4.5 Iteration 4.6 Recursion

5 5.0 Data Types 5.1 Introduction to Data Types 5.2 Primitive Data Types 5.3 Character String Types 5.4 User-Defined Ordinal Types 5.5 Array Types 5.6 Associative Arrays 5.7 Record Types



5.8 Union Types 5.9 Pointer & Reference Types

6 6.0 Subroutines & Control Abstraction 6.1 Fundamentals of Subprograms 6.2 Design Issues for Subprograms 6.3 Local Referencing Environments 6.4 Parameter-Passing Methods 6.5 Parameters That are Subprograms 6.6 Overloaded Subprograms 6.7 Generic Subroutines 6.8 Design Issues for Functions 6.9 User Defined Overloaded Operators 6.10 Croutons 6.11 The General Semantics of Calls & Returns 6.12 Implementing “Simple” Subprograms

6.13 Implementing Subprograms with Stack- Dynamic Local Variables

6.14 Nested Subprograms 6.15 Blocks 6.16 Implementing Dynamic Scoping

7 7.0 Data Abstraction & Object Orientation 7.1 Object-oriented Programming 7.2 Encapsulation & Inheritance



7.3 Initialization & Finalization 7.4 Dynamic Method Binding 7.5 Multiple Inheritance

8 8.0 Concurrency 8.1 Introduction to Concurrency 8.2 Introduction to Subprogram-level concurrency 8.3 Semaphores 8.4 Monitors 8.5 Message Passing 8.6 Java Threads



Semester 6: Following Subject- MCA61 | Project Work TYPING The typing shall be standard 12 pts in double spaced using black ink only Margins must be Left 2 inches Right 1.5 inches Top 2 inches Bottom 1.5 inches Paper A4 size Bond Paper COPIES Two hard-bound copies ( Black Rexine with Golden Embossing as per format displayed herewith ) One original

and one clean Xerox Copy.

The Guidelines regarding the documentation and scope of project are mentioned here below: MCA-III SEM-VI ( COMMERCIAL SYSTEM PROJECTS )

Project Report should be submitted in following format for Commercial Application Projects viz. Payroll, Sales,

Purchase, Inventory, Book Shop, Examination system etc.Where VB, Access, Oracle, ASP and Java is used. 2 Blank Pages at beginning Title Page Certificate from Company Certificate from Guide Acknowledgement Index with printed Page Numbers

CHAPTER 1 : INTRODUCTION Company Profile Existing System and Need for System Scope of Work Operating Environment --- Hardware and Software

CHAPTER 2 : PROPOSED SYSTEM Proposed System Objectives of System User Requirements



CHAPTER 3 : ANALYSIS & DESIGN Data Flow Diagram (DFD) Functional Decomposition Diagram (FDD) Entity Relationship Diagram (ERD) Data Dictionary Table Design Code Design Menu Tree Menu Screens Input Screens Report Formats Test Procedures and Implementation

CHAPTER 4 : USER MANUAL User Manual Operations Manual / Menu Explanation Forms and Report Specifications Drawbacks and Limitations Proposed Enhancements Conclusion Bibliography

ANNEXURES : ANNEXURE 1 : INPUT FORMS WITH DATA Project report should be submitted in following format for project using OOAD, Embedded System, WAP and other technologies and Web Deployed Systems where C, C++, J2EE, .NET, OOAD and JAVA, SDK’s, API’s are used. ANNEXURE 2 : OUTPUT REPORTS WITH DATA ANNEXURE 3 : SAMPLE CODE 2 Blank Pages at the end.



MCA-III SEM VI *** TECHNICAL PROJECTS ****** 2 Blank Pages at beginning Title Page Certificate from Company Certificate from Guide Acknowledgement Index with printed Page Numbers CHAPTER 1 : INTRODUCTION Company Profile Existing System and Need for System Scope of Work Operating Environment --- Hardware and Software Detail Description of Technology Used CHAPTER 2 : PROPOSED SYSTEM Proposed System Objectives of System User Requirements CHAPTER 3 : ANALYSIS & DESIGN Object Diagram Class Diagram Use Case Diagrams Module Hierarchy Diagram Component Diagram Deployment Diagram ( in case of Web Deployment ) Module Specifications Interface Diagram ( in case of WAP and Embedded Systems ) Web Site Map Diagram ( in case of Web Site ) User Interface Design ( Screens etc. ) Table specifications ( in case back end is a database ) Test Procedures and Implementation CHAPTER 4 : USER MANUAL User Manual Operations Manual / Menu Explanation Program Specifications / Flow Charts Drawbacks and Limitations Proposed Enhancements Conclusion Bibliography ANNEXURES : ANNEXURE 1 : USER INTERFACE SCREENS ANNEXURE 2 : OUTPUT REPORTS WITH DATA ( if any ) ANNEXURE 3 : SAMPLE PROGRAM CODE ( which will prove sufficient development is done by the

student ) 2 Blank Pages at the end.



Date post:	25-Apr-2020
Category:	Documents
Upload:	others
View:	7 times
Download:	0 times

Course Structure Syllabus for Master of Computer ... · Course Structure & Syllabus for . Master of...

Documents