M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 1 of 28 SCAA Dt. 23.03.

2011
BHARATHIAR UNIVERSITY, COIMBATORE 641 046.
Master of Computer Applications (MCA) Univ. Dept.

(Effective from the academic Year 2010-2011)

Scheme of Examinations

Core/
Elective/
Supportive/
Project
Suggested
Code S
e
m

Title of the Paper L P
C
r
e
d
i
t
s

M
a
r
k
s

Core 10CSEAC01 I Computer Organization And
Architecture
4 0 4 100

Core 10CSEAC02 I Programming In C 2 4 4 100
Core 10CSEAC03 I Foundations of Computer Science 4 0 4 100
Core 10CSEAC04 I Data Structures 3 2 4 100
Elective 10CSEAE01 I Unix and Network Programming 2 4 4 100
10CSEGSXX I English for Professional
Communication
2 4 4 100
Supportive 10CSEGSXX I General Supportive 2 50

Core 10CSEAC05 II Principles of Compiler Design 3 2 4 100
Core 10CSEAC06 II Operating Systems 4 0 4 100
Core 10CSEAC07 II Design And Analysis of Algorithms 3 2 4 100
Core 10CSEAC08 II Object Oriented Programming 2 4 4 100
Core 10CSEAC09 II Open Source Software 4 0 4 100
Elective 10CSEAE02 II Database Management System 2 4 4 100
Supportive 10CSEGSXX II General Supportive 2 50

Core 10CSEAC10 III Java Programming 2 4 4 100
Core 10CSEAC11 III Advance Programming in Open
Source - PHP
3 2 4 100
Core 10CSEAC12 III Computer Networks 3 2 4 100
Core 10CSEAC13 III Software Engineering 4 0 4 100
Core 10CSEAC14 III Operations Research 4 0 4 100
Elective 10CSEAE03 III Computer Graphics 2 4 4 100
Supportive 10CSEGSXX III General Supportive 2 50
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 2 of 28 SCAA Dt. 23.03.2011


Core 10CSEAC15 IV Visual Programming 2 4 4 100
Core 10CSEAC16 IV Software Project Management 4 0 4 100
Core 10CSEAC17 IV Multimedia Systems 2 4 4 100
Core 10CSEAC18 IV Information Retrieval 4 0 4 100
Elective 10CSEAEXX IV Elective I Distributed Systems 4 100
Elective 10CSEAEXX IV Elective II Programming in C# 4 100
Supportive 10CSEGSXX IV Supportive 2 50

Core 10CSEAC19 V Internet Programming And Web
Designing
2 4 4 100
Core 10CSEAC20 V Enterprise Java Programming 2 4 4 100
Core 10CSEAC21 V Data Analysis and Business
Intelligence
3 2 4 100
Elective 10CSEAEXX V Elective III 4 100
Elective 10CSEAEXX V Elective - IV 4 100
Mini
Project
10CSEAC22 Mini Project and Viva Voce 1 25

Project 10CSEAC23 VI Project Work And Viva Voce 10 250

Total 135 3375








M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 3 of 28 SCAA Dt. 23.03.2011
Subject Title: COMPUTER ORGANIZATION AND ARCHITECTURE
Course Number: 10CSEAC01
Number of Credits: 4
Subject Description:
This course presents the architecture and organization of computers.

Goal:
To enable the students to learn the basic functions, principles and concepts of Computer
architecture.
Objectives:
On successful completion of the course the students should have:
Understood data representation
Understood computer arithmetic, register and I/O organization

Contents:
Unit I
Data representation: Data types Complements Fixed-point representation Floating-point
representation - Logic gates - Combinational circuits- Flip-flops Multiplexers Decoders
Unit II
Registers Shift registers Binary counters Register transfer Bus and memory transfers
Arithmetic microoperations- Logic and shift microoperations- Arithmetic logic shift unit
Unit III
CPU: Register and stack organization Instruction formats Addressing modes Data transfer
and manipulation Program control RISC
Unit IV
Computer arithmetic: Addition, subtraction, multiplication and division of signed-magnitude
data Parallel processing: Pipelining Arithmetic and instruction pipeline RISC pipeline
Array Processors
Unit V
Input-output organization: Peripheral devices I/O interface Asynchronous data transfer
Memory organization: Memory hierarchy Main memory Auxiliary memory Associative
memory Cache memory Virtual memory
REFERENCE BOOKS
1. M Morris Mano, Computer System Architecture, Prentice-Hall India, 2003.
2. John P Hayes, Computer Architecture and Organization, McGraw-Hill Book Company,
2003
3. M Morris Mano, Digital Logic and Computer Design, Prentice-Hall India
4. Malvino A. P. and Donald P. Leach, Digital Principles and Applications, Tata
McGrawHill, 2002.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 4 of 28 SCAA Dt. 23.03.2011
Subject Title: PROGRAMMING IN C
Course Number: 10CSEAC02 Number of Credits : 4
Subject Description:
This course presents the Programming techniques in C, explains data types, arrays, pointers,
files.
Goal:
To enable the students to learn the basic functions, principles and concepts of programming in C
fundamentals.
Objectives:
On successful completion of the course the students should have:
Understood the Programming in C language
Contents:
UNIT I
Introduction to computers - problem solving - structured approach - top-down design, stepwise
refinement - modularity - hierarchy charts - flow charts - algorithms - expressing algorithms - a
solution methodology and an overview of algorithmic language - programming paradigms -
program structure - implementation ideas.
UNIT II
An overview of C - data types and sizes - declarations - variables - constants - arithmetic
operators - relational and logical operators - hierarchy of operators - C expressions - precedence
and order of evaluation - program control structure - the loop control structures. Storage classes
automatic - register static external - typedef.
UNIT III
Arrays - strings Functions - scope rules of functions - function arguments - function prototypes
- recursion - variable number of arguments - structures - array of structures additional features
of structures - difference between array and structures - structure in functions - self referential
structures - unions difference between structure and union.
UNIT IV
Pointers array of pointers pointers to an array pointer to pointers pointers to functions
function returning pointers - pointers to structure - problems with pointers.
UNIT V
Streams and files - command line arguments - C preprocessor - conditional computation
directives - defining macros - standard library functions (including system functions) I/O
functions (Console, disk port I/O) I/O redirection bit fields - usage of inline assembly.
REFERENCE BOOK
1. Yashvant P. Kanetkar, Let Us C, BPB Publications, 2002.
2. Hughes, J.K. and Michtom J.I. 'A Structured approach programming' Prentice Hall, 1977
3. E. Balagurusamy, 'Programming in ANSI C', Tata McGraw Hill, 2004
4. Byron C Gottried, Programming with C, Schuams outline series, 2nd edition, Tata
McGraw Hill,2006..
5. S. Thamaraiselvi G. Murugesahan, C for all, Anuradha agencies.
6. Robert A. Radcliffe, 'Encyclopedia C' BPB Publications.
7. Brain W. Kernighan, Dennis M.R. Chie, 'The C Programming Language' Prentice Hall,
1990.
8. Gottfried, B. 'Theory and Problems of Programming with C', McGraw Hill, 1990.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 5 of 28 SCAA Dt. 23.03.2011
Subject Title: FOUNDATIONS OF COMPUTER SCIENCE
Course Number: 10CSEAC03
Number of Credits: 4

UNIT I
Set Theory: Basic set operations, relations and functions, relation matrices, transitive
closurerelation, principal of mathematical induction. Matrices: Properties of determinants,
inverse of a matrix, Eigen values and Cayley Hamilton theorem.

UNIT II
Introduction to Probability Theory: Sample space and events, axioms of probability, conditional
probability, Bayers theorem, independence of events.

UNIT III
Introduction to Automata Theory: Finite State Automata Deterministic and Non-Deterministic,
NDFSA with E- Transitions, Equivalence of These without Proofs, Regular Expressions.

UNIT IV
Mathematical Logic: Connectives NAND And NOR Connectives, Functionally Complete Set
Of Connectives, Logical Networks, Principle Conjunctive And Disjunctive Normal Forms,
Equivalence Of Statements, Formulae Derivations Conditional Proof, Indirect Method Of
Proof, Automatic Theorem Proving.

UNIT V
Numerical Methods: Finding Roots, Bisection, Regula-Falsi, Newton Raphson Methods,
Solutions of Simultaneous Linear Equations, Gaussian Elimination, Gauss-Siedal Methods.

REFERENCE BOOKS
1. William A. R. Weiss An Introduction to Set Theory Publisher: University of
Toronto 2008.
2. Raf Vandebril, Marc Van Barel, Nicola Mastronardi, Matrix Computations and
Semiseparable Matrices: Eigenvalue and Singular Value Methods, JHU Press, 2009.
3. By Vijay K. Rohatgi, A.K. Md. Ehsanes Saleh. An Introduction To Probability And
Statistics, 2Nd Ed , 2009.
4. Jacques Sakarovitch, Elements of Automata Theory, Cambridge University Press,
2009.
5. Charles E. Roberts, Jr, Introduction to Mathematical Proofs A Transition Denny
Gulick, 2009.
6. John R. Hauser, Numerical Methods for Nonlinear Engineering Models, 2009 -
Technology & Engineering - 1013 pages.





M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 6 of 28 SCAA Dt. 23.03.2011
Subject Title: DATA STRUCTURES
Course Number: 10CSEAC04
Number of Credits :4
Subject Description:
This course gives an introduction of algorithms- linked lists- Searching Techniques - symbol
tables with case study.
Goal:
To enable the students to learn the data structure fundamentals- principles and concepts.
Objectives:
On successful completion of the course the students should have:
Understood the various Data Structures- Algorithms for representation of structures and
searching.
Contents:
UNIT I
Introduction to Problem Solving: Problem Analysis- Flowcharts- Pseudocodes &
Algorithms- Program design- Structured Programming. Data Structures: Arrays -
Representation of arrays- Sparse matrices- Multi - dimensional Arrays.
UNIT II
Stacks & Recursion: Stacks- Introduction to Recursion- Principles of Recursion - Polish
Notation - Evaluation of Polish Expression - Translation from Infix form to Polish form.
Queues: Definitions- Implementations of Queues- Circular queues- Application of
Queues- Linked Queues- Polynomial Arithmetic.

UNIT III
Linked Lists: Pointers and Linked Allocation - Single Linked List - Circular Linked List -
Doubly Linked list. Applications of Lists : Polynomial Manipulation .Binary Trees
Representation of Binary Tree Binary Tree Traversal Applications.
UNIT IV
Search Trees & Graphs: Binary Search Trees- Building a Binary Search Tree- Height
Balance: AVL Trees- B-Trees. Graphs: Definitions- Undirected & Directed Graphs-
Traversal- Topological Sorting- Shortest Paths.
UNIT V
Tables & Information Retrieval- File Structures: Tables & Information Retrieval -
Introduction- Rectangular Arrays- Tables of various shapes- Abstract Tables- Radix sort-
Hashing. File Structures: Concept of Fields- Records & Files- Sequential File
Organization- Variable Length Records & Text Files.

REFERENCE BOOKS
1. Robert L Kruse- Data Structures & Program Design- 2
nd
edition2001- Pearson
education
2. Dromey- Problem Solving & Algorithm Design.
3. Ellis Horowitz & Sartaj Sahni- Fundamentals of Data Structures.
Subject Title: UNIX and Network Programming
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 7 of 28 SCAA Dt. 23.03.2011
Course Number: 10CSEAE01
Number of Credits: 4

Unit I
UNIX Introduction Basic commands processes pipes redirection filters -vi editor.
Shell programming Shell Syntax : Variables conditions control structures functions
command execution simple programs

Unit II
File I/O File Descriptors File sharing - Files and directories File types - File access
permissions File systems Symbolic links - Standard I/O library Streams and file objects
Buffering.

Unit III
UNIX process Process termination command line arguments - Process control Process
identifiers - Process relationships terminal logins Signals -threads.

Unit IV
Interprocess Communication Introduction- pipes FIFO message queues semaphores
Shared Memory.

Unit V
Sockets - introduction - TCP sockets -TCP echo client server UDP sockets - UDP echo client
server - Socket options.

REFERENCE BOOKS
1. Peter Dyson, Stan Kelly Bootle, John Heilborn, UNIX Complete, BPB Publications, 1999
2. W.Richard Stevens, Stephen A. Rago, Advanced programming in the UNIX environment,
Second edition, Addison Wesley, 2005.
3. W. Richard Stevens, Bill Fenner, Andrew Rudoff, "UNIX Network Programming", Volume
1,The Sockets Networking API,3rd Edition, Pearson education, Nov 2003.










M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 8 of 28 SCAA Dt. 23.03.2011
Subject Title: ENGLISH FOR PROFESSIONAL COMMUNICATION
Course Number: 10CSEGSXX
Number of Credits: 4

Spoken English: Basics like English Sounds, Stress, Rhythm and Intonation.

Meeting your English: Common Errors in Speaking and Writing Grammar and Usage

Effective Writing Skills: Pre-Writing Techniques Paragraph Writing Different Types
Essay Writing

Work Place Correspondence: Memos Circulars Letters Job Applications with Resume
Different Kinds of Reports including Self-Appraisal Research Papers

Lab:
Comprehension: Listening Reading Audio Visuals
Speaking: Self-Introduction Face-to-face conversations Telephone Conversations
Interviews Group Discussions Short Speeches Debates Role Plays Presentations
Public Speaking

TEXT BOOKS/ REFERENCES

1. Strunk & White, Elements of Style, 4
th
Edition, Longman, 2008.
2. Murphy, Raymond, Murpys English Grammar, III Ed. New Delhi, Brihbasi Art Press
Ltd., 2004
3. Huckin N., Thomas ND, Leslie A. Olsen, Technical Writing and Professional
Communicatin, 2
nd
Edition, Singapore, McGraw Hill International Edition, 1991.
4. Garside, Barbara and Tony Garside, Essential Telephoning in English, U.K.: CUP,
2002.
5. Michael Swan, Practical English Usage, 4
th
Impression, International Students edition
OUP.2000.












M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 9 of 28 SCAA Dt. 23.03.2011
Subject Title: PRINCIPLES OF COMPILER DESIGN
Course Number: 10CSEAC05
Number of Credits: 4
OBJECTIVES
To understand lexical analyzer, parser, code generation schemes and optimization of codes and
environments.
Unit I
Introduction to compilers: Compilers Analysis of source program The Phases of compilers
Cousins of Compilers The grouping of phases compiler construction tools.
Lexical analysis Incorporating a symbol table The role of lexical analyzer Finite Automata
From a regular expression to an NFA Design of a Lexical Analyzer Generator Optimization
of DFA
Unit II
Syntax Analysis: The role of a parser Context Free Grammar Top-down parsing Recursive
Descent parsing predictive parsing Bottom up parsing - shift reduce parsing - Operator
Precedence parsing LR parsing.

Unit III
Syntax- directed Translation: Syntax directed definitions Construction of Syntax trees
Bottom-up evaluation of S-attributed definitions Top-down translation Recursive evaluators
Type checking Type system Specification of a simple Type Checker Type conversions
An algorithm for unification.
Intermediate languages Declarations Assignment Statements Boolean Expressions Case
Statements Back patching Procedure calls.

Unit IV
Issues in the design of code generator The target machine Runtime Storage management
Basic Blocks and Flow Graphs A simple Code generator DAG representation of Basic
Blocks Peephole Optimization.

Unit V
Introduction Principal Sources of Optimization Optimization of basic Blocks Introduction to
Global Data Flow Analysis Runtime Environments Source Language issues Storage
Organization Storage Allocation strategies Access to non-local names Parameter Passing.

REFERENCE BOOKS
1. Alfred Aho, Ravi Sethi, Jeffrey D Ullman, Compilers Principles, Techniques and
Tools, Pearson Education Asia, 2003.

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 10 of 28 SCAA Dt. 23.03.2011
Subject Title: OPERATING SYSTEMS
Course Number: 10CSEAC06
Number of Credits: 4
Subject Description:
This course presents the Introduction about operating systems, process management, CPU
scheduling, memory management, secondary storage management.
Goal:
To enable the students to learn the basic functions, principles and concepts operating system.
Objectives:
On successful completion of the course the students should have:
Understood the operating system principles
Understood the Principles of Deadlock, processor scheduling and memory management.
Learnt case studies in different OS
Contents:
UNIT I
Introduction: Early Operating Systems Buffering and Spooling Multiprogramming time-
sharing Protection Operating System Structures. Process Management: Process Concept
Hierarchy of Process Critical Section Problem Semaphores Process Co-ordination
Problems Inter Process Communication.
UNIT II
CPU Scheduling: Scheduling Concepts Scheduling Algorithms Algorithm Evaluation
Multiple Processor Scheduling. Deadlock: Deadlock Problem Characterization - Prevention
Avoidance detection Recovery Combined Approach to Deadlock Handling.
UNIT III
Memory Management: Introduction Multiple Partition Paging Segmentation Paged
Segmentation Virtual Memory Concept Overlays Demand Paging and Performance Page
Replacement Algorithms Allocation Algorithms Thrashing.
UNIT IV
Secondary Storage Management: Physical Characteristics Disk Scheduling Disk Scheduling
Algorithm Sector Queuing. File Systems: File Operations Access Methods Allocation
Methods directory Systems File Protection Implementation Issues.
UNIT V
Comparative study Introduction to DOS, UNIX/LINUX, Windows 9X, Windows NT.

REFERENCE BOOK
1. James L.Peterson, Abraham Silberchatz, Operating System Concepts, Addison Wesley,
1985.
2. Harvey M.Deitel, An Introduction to Operating System, Addison Wesley, 1984.
3. Andrew S. Tanenbaum, Operating Systems Design and Implementation, Prentice
Hall, 1987.
4. Silberschatz A., Galvin P. and Gagne G., Operating System Concepts, John Wiley,
2002.
5. William Stallings, Operating Systems, Prentice-Hall, 2004.


M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 11 of 28 SCAA Dt. 23.03.2011
Subject Title: DESIGN AND ANALYSIS OF ALGORITHMS
Course Number: 10CSEAC07
Number of Credits: 4
Subject Description: This course presents the Introduction to algorithms, greedy method,
dynamic programming, basic search and parallel models.
Goal: To enable the students to learn the algorithm fundamentals, principles and concepts.
Objectives: On successful completion of the course the students should have:
Understood the various algorithms for sorting and searching, dynamic programming and
parallel models.

Contents:
UNIT I
Introduction: Introduction to algorithms, Analyzing algorithms.
Divide and Conquer: General Method, Binary Search, Finding the maximum and minimum,
Merge sort, Quick sort, Selection sort, Strassens matrix multiplication.

UNIT II
The Greedy Method: General method, Optimal storage on tapes, Knapsack problem, Job
sequencing with deadlines, Optimal merge patterns, Minimum spanning trees, Single source
shortest paths.

UNIT III
Dynamic Programming: General method, Multistage graphs, All pairs shortest paths, Optimal
binary search trees, 0/1 Knapsack, Travelling salesperson problem, Flow-shop Scheduling.

UNIT IV
Basic Search and Traversal Techniques: Techniques, Code optimization, AND/OR graphs, Game
trees.Back Tracking: General method, 8-queens problem, Sum of subsets, Graph coloring,
Hamiltonian cycles, Knapsack problem. Branch and Bound: General method, Travelling
salesperson problem.

UNIT V
Parallel models: Basic concepts Performance measure parallel algorithms Parallel complexity
Analysis of parallel addition Parallel multiplication and division, Parallel Evaluation of
general arithmetic expressions, First order Linear recurrence.

REFERENCE BOOK
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Computer Algorithms, 2007.
2. Sara Baase, Allen Van Gelder, Computer algorithms, Pearson education, 2003.
3. S.Lakshmivarahan and Sudarshan K.Dhall, Analysis and Design of Parallel
Algorithms - Arithmetic and Matrix Problems, McGraw-Hill Publishing Company,
1990.
4. Mark Allen Weiss Data Structures and Algorithm Analysis, Benjamin/Cummings Pub.
Co, 2007

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 12 of 28 SCAA Dt. 23.03.2011
Subject Title: OBJ ECT ORI ENTED PROGRAMMI NG
Course Number: 10CSEAC08
Number of Credits :4
Subject Description:
This course presents the features of object oriented programming structure, overloading, files,
exception handling, OO analysis.
Goal:
To enable the students to learn the basic functions, principles and concepts of
Object oriented programming.
Objectives:
On successful completion of the course the students should have:
Understood the Object model and relationship among objects
Gain knowledge in C++ programming
Contents:
(NOTE: Programming examples are to be given in C++)
UNIT I
Drawback of structured programming object oriented language characteristics and
fundamentals programming basics loops, decisions, structures and functions objects and
classes.
UNIT II
Overloading Inheritance Polymorphism.
UNIT III
Files - Streams - Templates.
UNIT IV
Exception Handling Introduction, Error Handling, Handling model, Handling constructs , List
of Exceptions, catch all exceptions, Exceptions in constructors and destructors, Handling
Uncaught Exceptions, Operator overloaded functions, Inheritance tree, Class templates , Fault
tolerant Design techniques, Memory allocation failure exception, Ten rules for handling
exceptions.
UNIT V
OO Analysis, Design and Development Software Life Cycle , Cost of Error correction, Change
management, Reusable components , Fountain flow model Object-oriented notations, Object-
oriented methodologies, coad and Yourdon Object-oriented analysis, Boochs Object-oriented
design, Class design, How to build reliable code, OO software performance tuning.
REFERENCE BOOK
1. Stroustrup, The C++ Programming Language, Addison Wesley, 2004.
2. K.R. Venugopal T. Ravishankar, Rajmumar ,Mastering C++, Tata McGraw-Hill
Publishing Company Limited, 1977.
3. Robert Lafore, Object Oriented Programming in Turbo C++, Galgotia publications Ltd.
1996.
4. Stanley B Lippman, Josee Lajoie, The C++ Primer, Addison Wesley, 2005.

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 13 of 28 SCAA Dt. 23.03.2011
Subject Title: OPEN SOURCE SOFTWARE
Course Number: 10CSEAC09
Number of Credits :4
Unit I
Overview of Free/ Open Source Software: The Open Source Definition - Examples of OSD
Compliant Licenses - Examples of Open Source Software Product The Open Source Software
Development Process A History of Open Source software: The Berkeley Software Distribution
The Free Software Foundation Linux Apache Mozilla Open Source Software.
Unit II
Qualification: Defining Open Source Software Categorizing Defining Open Source Software
Specific Characteristics of Open Source Software Transformation: The OSS Development
Process Taboos and Norms in OSS Development The OSS Development Life Cycle
Deriving a Framework for Analyzing OSS Zachmans Framework for IS Architecture
CATWOE and Soft System Method Deriving the Analytical Framework for OSS.
Unit III
Environment: The where of OSS the when of OSS World View: A Framework for
classifying OSS Motivations Technological Micro-level (individual) motivation Economic
Micro-level and Macro-level (individual) Motivation Socio-political Micro-level and Macro-
level (individual) Motivation.
Open Source Server Applications: Infrastructure Services Web Services Database Servers
Mail Servers Systems Management Open Source Desktop Applications: Introduction
Graphical Desktops Web Browsers The Office Suite Mail and Calendar Clients Personal
Software Cost of OSS: Total Cost of Ownership Types of Costs Licensing: Types of
Licenses Licenses in Use Mixing Open and Close Code Dual Licensing.
Unit IV
Perl Programming
Perl - Introduction, Perl Basics: - Syntax, Variables, Strings, Numbers, Operators, Arrays: -
Using Arrays, Manipulating Arrays, Associative Arrays, Chop, Length, and Sub string. Hashes,
Arguments, Logic, Looping, Files, Pattern Matching, Environment Variables, Using cgilib for
Forms.
File Management PERL: - File Handling, Reading From Files, Appending Files, Writing to
Files, File Checking, Reading Directories.
Databases PERL: - DBI Module, DBI Connect, DBI Query, MySQL Module, MySQL Connect,
MySQL SelectDB, MySQL Query.
Unit V
PHP Programming Basics
PHP - Introduction, PHP Basics: - Syntax- Variables- Controls and functions - Strings. Arrays: -
Using Arrays, Manipulating Arrays, Associative Arrays
OOP with PHP Advanced Array functions-Sessions-cookies and HTTP.
Reference Books
1. Joseph Feller, Brain Fitzgerald, Eric S. Raymond, Understanding Open Source Software
Development, Addison-Wesley Professional, 1
st
Edition, 2001.
2. Perl CookBook Tom Christinasen & Nathan Torkington , ORelliy ,SPD Pvt ltd,2006
Edition.
3. PHP 5 and MySQL Bible Wiley Dream teck India Pvt.ltd 2006 Edition.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 14 of 28 SCAA Dt. 23.03.2011
Subject Title: DATABASE MANAGEMENT SYSTEM
Course Number: 10CSEAE02
Number of Credits :4
Subject Description:
This course presents the introduction of database management systems , explains ER model,
structure of relational database, indexing and advance data base concepts.
Goal:
To enable the students to learn the basic functions, principles and concepts of database
management systems.
Objectives:
On successful completion of the course the students should have:

distributed databases.

Contents:

UNIT I
Introduction purpose of database system- data models database languages-Transaction
management Storage management - DBA database users-system structure.
E-R model.
UNIT II
Relational Database Design: Anomalies in a Database Functional Dependency Lossless Join
and Dependency-Preserving Decomposition Third Normal Form Boyce Codd Normal Form
Multivalued Dependency Fourth Normal Form Join Dependency Project Join Normal
Form Domain Key Normal Form.
SQL: Data Definition Data Manipulation Integrity Constraints Views PL/SQL.
UNIT III
Indexing and Hashing Query Processing Transaction Processing - Concurrency Control and
Recovery.
UNIT IV
Advanced Database Concepts and Emerging Applications: Distributed Databases-Object
Oriented Databases-Object Relational Databases- Data mining and Data Warehousing.
UNIT V
DBMS Case Studies : Application of DB concepts in Hospitals or any small and medium scale
Industry DBMS in Hospital management System, Small and Medium Scale Enterprises
Application of DBMS in Marketing

(For Unit V, students are expected to do a survey and study and submit a report)

REFERENCE BOOKS
1. Abraham Silberchatz, Henry K.Forth, Sudharshan, Database system Concepts (5
th

edition), McGraw Hill.
2. Elisa Bertino, Object Oriented Databases, Addison Wesley.
3. Ramez Elmasri, Shamkant B.Navathe, " Fundamentals of Database Systems ", 3rd Edition,
Addison Wesley-2000.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 15 of 28 SCAA Dt. 23.03.2011
Subject Title: JAVA PROGRAMMING
Course Number: 10CSEAC10
Number of Credits : 4
Subject Description:
This course presents the basic concepts of object oriented programming, data types, class and
objects, packages, overview of JDBC.
Goal:
To enable the students to learn the basic functions, principles and concepts of java programming.
Objectives: On successful completion of the course the students should have:
Gained Java programming skills.

UNIT-I
JAVA evolution: Java features Java and C Java and C++ - Overview of JAVA language:
Introduction- implementation of java program creating, compiling, running the program. JVM .
Data Types operators and Expressions Branching: Decision making with if statement,
ifelse statement, nesting ifelse statements, the else if ladder, switch statement. Looping: The
while statement, do statement, for statement- additional features of for loop: nesting of for loops;
jumps in loops jumping out of a loop; skipping a part of loop; labeled loops
UNIT II
Classes and Objects: Introduction; adding variables, creating and adding methods, constructors,
overloading; Inheritance defining a subclass, multilevel inheritance, hierarchical inheritance,
overriding methods, visibility control.
UNIT III
Packages & Interfaces Multithreaded Programming: creating threads, extending the thread
class- implementing the run() method, starting new thread, stopping and blocking a thread- life
cycle of a thread thread states- using thread methods, thread exceptions, thread priority-
Exception Handling.

UNIT - IV
Applet Programming: Local and remote applets; differences of applet and application programs.
Designing a web page comment, body, head section. Applet tag, adding applet to HTML file.
Event Handling: Mechanisms-Event classes-Sources-Event Interfaces.
UNIT V
Introduction to AWT: Window fundamentals-AWT classes-Working with windows-Working
with Graphics-Working with Color- Working with Fonts- Fundamentals of AWT controls.

REFERENCE BOOKS
1. Herbert Schildt, The Complete Reference Java , Tata McGraw-Hill Edition, 2009.
2. Rajkumar Buyya, S Thamaraiselvi, Xingchen Chu, Object Oriented Programming with
JAVA , Tata McGraw-Hill Edition, 2009.
3. Jamie Jaworski, JAVA 2 Platform Unleashed, Techmedia SAMS publishing, 2008.

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 16 of 28 SCAA Dt. 23.03.2011

Subject Title: Advanced Programming in Open Source PHP

Course Number: 10CSEAC11
Number of Credits: 4
Subject Description : This Course presents Advanced programming in Open Source

Goals : To enable the students to learn the Concepts PHP in MySQL, AJAX, Smarty, SOAP,
CMS(Joomla)
Objectives : On successful completion of the course the students should have:
Understood the concepts of using MySQL with PHP
Understood the concepts of using AJAX with PHP
Understood the concepts of using Smarty with PHP
Understood the concepts of PHP SOAP
Understood the concept of PHP and CMS(Joomla)

Contents
Unit 1: PHP and MySQL Part II: SQL tutorial - PHP/MySQL function Displaying Queries in
Tables- Building forms from Queries.

Unit 2: PHP and AJAX: AJAX Introduction, History of AJAX, How does AJAX work, IE
memory leaks, XML HTTP Request - GET or POST?, XML Http Request in IE FireFox,
callback URL and URL rewriters, Problems and Challenges, Benefits of AJAX, How and when
to use AJAX, Selecting the right tools and framework for Ajax.

Unit 3: PHP and Smarty: What is Smarty?, Basic Syntax, Variables, Variable Modifiers,
Combining Modifiers, Built-in Functions, Custom Functions, Config Files, Debugging Console,
Constants, Smarty Class Variables, Smarty Class Methods, Caching, Advanced Features,
Extending Smarty With Plugins, Troubleshooting: Smarty/PHP errors, Tips & Tricks, Resources,
BUGS.

Unit 4: PHP and SOAP: Introduction to Web Services SOAP, Creating and Consuming Web
Services With PHP, XML-RPC, Creating an XML-RPC Web service, Consuming an XML-RPC
Web service, NuSOAP and PHP, Creating a NuSOAP Client using PHP, Creating a NuSOAP
Web service, Creating a NuSOAP Web Service Client, REST, Consuming an XML Web service
using REST.

Unit 5: PHP and CMS(Joomla): Types of CMS Open source web CMS packages, All Inclusive
web CMSs, Micro CMS, Other Helpful Resources.

Reference Books
1. PHP 5 and MySQL Bible Wiley Dream teck India Pvt.ltd 2006 Edition.
2. Professional LAMP Linux, Apache ,MySQL and PHPs Web Development Wiley dream
teach 2006 Edition.
3. Beginning Ajax with PHP: From Novice to Professional, Apress, 2007 Edition
4. Smarty- PHP Template Programming and Applications, PACKT Publishing 2006 Edition.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 17 of 28 SCAA Dt. 23.03.2011
5. SOAP Version 1.2 Part 1: Messaging Framework (Second Edition)
http://www.w3.org/TR/soap12-part1/
6. Professional Joomla, Wiley Publication, 2007.
7. www.phpfreaks.com - Smarty
8. www.w3schools.com - AJAX
9. www.php.net/manual/en - PHP notes




Subject Title: COMPUTER NETWORKS
Course Number: 10CSEAC12
Number of Credits: 4
Subject Description:
This course presents the introduction to networks and communication media, data transfer,
network layer protocols, transport protocols and presentation layer.
Goal:
To enable the students to learn the basic functions, principles and concepts of computer
networks.
Objectives: On successful completion of the course the students should have:
Understood the functionality of networks protocols and layers
Understood network simulation using NS2
Contents:
UNIT-I
INTRODUCTION TO NETWORKS & COMMUNICATION MEDIA: Uses Network
hardware Network software Reference Models Example Networks: Internet X.25 -ATM -
Transmission media Wireless Transmission Telephone system ISDN, ATM communication
satellite communication.

UNITII
DATA TRANSFER & ACCESS PROTOCOLS: Error detection and correction methods
Elementary protocols Sliding window protocols - IEEE 802.2 Logical Link Control
Bluetooth: architecture protocol stack radio layer baseband layer L2CAP layer frame
structure.

UNITIII
NETWORK LAYER PROTOCOLS: Routing algorithms Congestion control: Principles
policies Congestion control in VC subnets congestion control in datagram subnets - Network
layer in Internet: Architecture IP protocol- IP Address IPv6.

UnitIV
TRANSPORT PROTOCOLS: Transport service Transport protocols Transport protocols in
Internet : TCP and UDP .
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 18 of 28 SCAA Dt. 23.03.2011

UNITV
APPLICATION LAYER ISSUES:-Domain Name System Electronic mail - Network security.
Network Simulator: Basics of Computer Network Simulation Introduction to Network
Simulator 2 (NS2) Basic Architecture Installation Directories and Convention Running
NS2 Simulation Simulation Examples

REFERENCE BOOKS

1. Andrew S. Tanenbaum, Computer Networks, PHI, Fourth Edition, 2003
2. Behrouz A. Forouzan, Data communication and Networking, Tata McGraw-Hill, 2004
3. William Stallings, Data and Computer Communication, Sixth Edition, Pearson
Education, 2000
4. Teerawat Ussaruyakul, Ekram Hossain, Introduction to Network Simulator NS2,
Springer, 2009


Subject Title: SOFTWARE ENGINEERING
Course Number: 10CSEAC13
Number of Credits: 4
This course presents the role of software, system analysis, design concepts, methods, testing
methods and strategies

Goal:
To enable the students to learn the basic functions, principles and concepts of software
engineering.

Objectives: On successful completion of the course the students should have:
Understood the role of software engineering
Understood the design concepts, testing methods and strategies
Contents:
UNIT I
Introduction: Evolving role of software - Software characteristics, components and its
applications - Generic view of software engineering - Software process models.
System Analysis: Requirements analysis - Analysis principles - Prototyping - Software
requirement specification - Data modeling, functional modeling and behavioral modeling.
UNIT II
Design concepts: Design and software quality. Design concepts: Abstraction, refinement,
modularity, and software architecture control hierarchy, structural partitioning and information
hiding. Effective modular design: functional independence, cohesion and coupling - design
documentation
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 19 of 28 SCAA Dt. 23.03.2011
UNIT III
Design Methods: Data design - Architectural design process: transform mapping and transaction
mapping - interface design - procedural design.
UNIT IV
Software Testing Methods: Software testing fundamentals. White box testing: basis path testing
and control structure testing - black box testing - Software Testing Strategies: A strategic
approach to software testing - unit testing - integration testing - validation testing - system testing
UNIT V
Software Engineering Case Studies : Application of SE concepts in Hospitals or any small and
medium scale Industry SE in Hospital management System, Small and Medium Scale
Enterprises Application of SE in Marketing (For Unit V, students are expected to do a survey
and study and submit a report)
REFERENCE BOOK
1. R. S. Pressman, Software Engineering, (7th edition), Tata McGraw Hill, 2009, ISBN-
10: 0073375977
2. R. S. Pressman, Software Engineering, (5th edition), Tata McGraw Hill, 1997.


Subject Title: OPERATIONS RESEARCH
Course Number: 10CSEAC14

Subject Description:
This course presents the various principles and applications of operations research and trains the
students on solving problems using Operations research methods and EXCEL.

Goal:
To enable the students to learn the various principles and applications of operations research

Objectives: On successful completion of the course the students should have:
Understood linear programming methods
Understood network analysis methods

Unit-I
Linear Programming: Introduction, Mathematical Formulations, Solutions , Graphical Method,
Simplex Method, Artificial variables, Big M, Two phase methods, Variants in Simplex Method,
Duality Theory and Problems , Dual Simplex Method.

Unit-II
Transportation and its variants: Definition, Transportation Algorithms and Solutions,
Assignment Model, Hungarian Method, Traveling Salesman Problem, The Transshipment Model
- Queueing Theory:- Characteristic of Queueing System, Steady State M/M/I Model Finite.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 20 of 28 SCAA Dt. 23.03.2011

Unit-III
Inventory Theory: Cost Involved in Inventory Problems, Single Item Deterministic Models,
Economic Size Model with and without Shortages having Production Rate Infinite and Finite.

Unit-IV
PERT and CPM: Arrow Networks, Time Estimates, Various Expected Times, Critical Path,
Critical Path Computations, Various Floats of Activities, Updating Projects Operation Time
Cost.

Unit-V
Operations Research Models using Spreadsheets Linear Programming Models :A
Manufacturing Example - Computational Considerations - Terminology - Solution
Characteristics - Network Flow Programming Models :- Classical Models - Extensions of the
Basic Models - Minimum Cost Flow Problem - Distribution and Networks :- any one Case
Study from Routing of goods, electricity and digital data

REFERENCES:
1. Handy A Taha, Operations Research- An Introduction, Macmillan Publishing Co., 7
th

Edition(2004).
2. Sharma J K, Operations Research - Theory and Application, Mac Millan India: 2003.
3. Srivastava, U.K., Shenoy, G.V., and Sharma, S.C. (2009). Quantitative Techniques for
Managerial Decision, 2/e; New Delhi: New Age International
4. Paul A. Jensen and Jonathan F. Bard,Operations Research Models and Methods, John
Wiley Inc., 2003 http://www.me.utexas.edu/~jensen/ORMM, (for Unit V)



Subject Title: COMPUTER GRAPHICS

Course Number: 10CSEAE03
Number of Credits: 4
Subject Description: This course presents the origin of computer graphics, vector generating
techniques, transformations, interactive graphics and raster graphics.
Goal:
To enable the students to learn basic transformations, algorithms and concepts of Computer
Graphics.

Objectives: On successful completion of the course the students should have:
Understood the Computer Graphics and the various graphic algorithms.
Understood the 2D and 3D transformations, models and generation techniques

UNIT I
The origin of computer graphics Interactive graphics display new display devices. General-
purpose software display of solid objects.

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 21 of 28 SCAA Dt. 23.03.2011
UNIT II
Output Primitives: Points and Lines, DDA, Bresenhams Algorithms - Properties of Circles and
Ellipse Pixel Addressing - Two Dimensional Geometric Transformations: Basic
Transformations Matrix Representations - Composite Transformations. Two Dimensional
Viewing:- Line Clipping Polygon Clipping Curve Clipping Text Clipping.

UNIT III
Three-Dimensional Concepts - Three Dimensional object Representations: Polygon Surfaces
Curved Lines and Surfaces Quadric Surfaces Super Quadric - Blobby Objects Spline
Representations Cubic Spline Interpolation - B-Spline Curves and Surfaces Fractal Geometry
Methods Classification Dimension Uniform B-Spline.

UNIT IV
Three Dimensional Geometric and Modeling Transformations: Translation Rotation Scaling.
Three Dimensional Viewing: Viewing Pipeline Viewing Co-ordinates Projections Clipping.

UNIT V
VisibleSurface Detection Methods: Classification of Visible Surface Detection Algorithms
Back Face Detection - Depth-Buffer Method - A-Buffer Method. Illumination Models and
Surface-Rendering Methods: Basic Illumination Models Polygon Rendering Methods. Color
Models and Color Applications: RGB YIQ CMY HSV.

REFERENCE BOOKS
1. Donald Hearn & M.Pauline Baker, Computer Graphics, Second Edition, PHI/ Pearson
Education
2. H.M.Neumann and R.F.Sproul, Principles of Interactive computer Graphics, Second
Edition, McGraw Hill.
3. Steven Harrington, Computer Graphics A Programming Approach, McGraw Hill, 1983.
4. Shalini Govil, Principles of Interactive Computer Graphics, Pai, 2005, Springer.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 22 of 28 SCAA Dt. 23.03.2011
Subject Title: VISUAL PROGRAMMING
Course Number: 10CSEAC15 Number of Credits :4 L= 2 P= 4
Subject Description:
This course presents the Windows programming and Visual C++ programming techniques.
Goal:
To enable the students to learn the basic functions, principles and concepts of Visual
programming
Objectives:
On successful completion of the course the students should have:
Understood the Windows programming and Visual C++ programming techniques
Contents:
UNIT I
Windows Programming: Basic-An introduce to Unicode: a brief history of Character Sets-Wide
character and CWide Characters and Windows-Windows and Messages: A window of ones
own-The Windows Programming Hurdles- An exercise in text output-Painting and Repainting-
An Introduction to GDI-Scroll bars-Building a Better Scroll-Basic drawing: the structure of GDI-
The device Context-Drawing Dots and Lines-Drawing Filled Areas-The GDI Mapping Mode-
Rectangles, Regions and Clipping Keyboard: Basics-Keystroke Messages-Character Messages-
Keyboard Messages and Character Sets-The Caret
UNIT II
The Mouse : Mouse Basics-Client-Area Mouse Messages-Non Client-Area Mouse Messages-
Capturing the Mouse-The Timer : Basics-Using the Timer-Using the Timer for a Clock and
Status Report -Child Windows controls : The Button Class-Controls and Colors-The Static
Class- Menus and other Resources: Icons, Cursors and Custom Resources-Menus-Keyboard
Accelerators-Dialog Boxes: Modal Dialog Boxes-Modeless Dialog Boxes
UNIT III
The Clip board-Simple use of the Clipboard-Beyond Clipboard use-Becoming A Clipboard
Viewer-Using the Printer-Bitmaps and Bitblts-The Device independent bit map: The DIB File
Format-Displaying and Printing-The Union Of DIBs and DDBs-the palette manager-metafiles-
Advanced topics: The multiple-Document interface-Multitasking and multithreading-dynamic
link libraries-sound and music.
UNIT IV
Visual C++ Programming: Fundamental of MFC: MFC Class Hierarchy, Various Object
Properties Cobject, CwinApp, CWnd, Cfile, CGdiObject, CExcept, CDialog, Cstring, Cedit,
Clist. Resources: Menus, Accelerators, Dialogs, Icons, Bitmaps, Versions, AFX Functions,
Message Maps and Document/View Architecture.
UNIT V
Visual C++ Programming (contd.): Advanced MFC: DAO & ODBC Data access methods &
Data Controls for Database Applications with multiple document usage. Synchronization
Classes: Cthread, Csemaphore, Cmutex and Cevent.

REFERENCE BOOKS
1. Charle Petzold, Programming Windows , Microsoft Press, Fifth Edition, 1998.
2. John Paul Mueller, Visual C++ 5 from the Ground Up, Tata McGraw Hill, 1997.
3. David Kruglinksi, George Shepherd, Programming Visual C++, Microsoft Press, Fifth
Edition, 1998.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 23 of 28 SCAA Dt. 23.03.2011
Subject Title: SOFTWARE PROJECT MANAGEMENT
Course Number: 10CSEAC16
Number of Credits : 4 L= 4 P= 0
Subject Description:
This course presents the introduction to software projects, activity planning, risk management ,
software configuration management.
Goal:
To enable the students to learn the basic functions, principles and concepts of Software project
management.
Objectives:
On successful completion of the course the students should have:
Understood the Software configuration management
Understood the Activity Planning , Risk Management using case studies
Contents:
UNIT I
Introduction to Software Projects An Overview of Project Planning Project Evaluation
Selection of an appropriate Project approach Software effort Estimation.

UNIT II
Activity Planning Project Schedules Sequencing and Scheduling Projects Network
Planning Model forward and backward pass-Identifying the Critical path-Activity float-
Shortening Project Duration Identifying Critical Activities-precedence networks.

UNIT III
Risk Management Resource Allocation Monitoring and Control Managing People and
Organizing Teams Planning for Small Projects.

UNIT IV
Software Configuration Management Basic Functions Responsibilities Standards
Configuration Management Prototyping Models of Prototyping.

UNIT V
Case Studies - Application of SPM concepts in Hospital information systems or information
systems of any small and medium scale Industry SPM in Hospital information management
System, Small and Medium Scale Enterprises Application of SPM in Marketing

(For Unit V, students are expected to do a survey and study and submit a report)
REFERENCE BOOKS
1. Mike Cotterell, Bob Hughes, Software Project Management, Inclination/Thomas
Computer Press, 1995.
2. Darrel Ince, H.Sharp and M.Woodman, Introduction to Software Project Management
and Quality Assurance, Tata McGraw Hill, 1995.

WEB SITES
PMBOK, Project management body of knowledge www.pmi.org

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 24 of 28 SCAA Dt. 23.03.2011
Subject Title: MULTIMEDIA SYSTEMS
Course Number: 10CSEAC17
Number of Credits :4 L= 2 P= 4

Subject Description
This course presents the Introduction to Multimedia, Images & Animation.
Goals
To enable the students to learn the concepts of Multimedia.
Objectives
On Successful completion of the course the students should have:

Contents:

Unit I
Introduction : Introduction to Multimedia PCs Components of Multimedia Multimedia -
Tools Sound and Graphics : Digital Sound Editing and Mixing sound files MIDI creation
Tracking Procedure Interactive and Non Interactive Graphics High Resolution Graphics
Difference between TV and Computer Display.

Unit II
Video and Animation : Digital Image concepts Video Capturing Scanning Images Digital
Filters Morphing and Warping Two Dimensional and Three dimensional animation
Animation Tools Layering technique Blue Screen technique Latest movie technologies
Motion Tracking System Motion Capturing System.

Unit III
Creating Presentation : Script Writing and creating interactive and non interactive
presentation Linear and Non Linear Editing Authoring Tools File Formats SOUND, -
VIDEO, ANIMATION, Presentation Images. Multimedia Programming: Text Links Hyper -
Text system Form Creation File storing - Error Trapping.

Unit IV
Sound Links: Multimedia interfaces MCI- API- High Level Multimedia Functions WAVE ,
MIDI file processing. Animation : Color Palette Events ROPs.

Unit V
Imaging Special Visual Effects : Bitmap Brushes Dissolve Hotspot Editor Scorlling .
Media Control Interface : Simple Commands API functions CD Player Video Capturing
Form AVI Play Form.

REFERENCE BOOKS
1. Tay Vaughan, Multimedia Making it Work, McGraw Hill, 1994.
2. Scott Jarol, Visual Basic Multimedia , Galgotia 1995.
3. Jeffcoate, Judith, Multimedia in Practice, Prentice Hall, 2001.
4. Vince, John, Virtual Reality Systems, Pearsons Education, 1995.

M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 25 of 28 SCAA Dt. 23.03.2011
Subject Title : INFORMATION RETRIEVAL
Course Number : 10CSEAC18
Number of Credits : 4 L= 4 P= 0

Subject Description: This course presents the information retrieval techniques.
Goal: To enable the students to learn the basics of information retrieval techniques,
classification techniques and web search
Objectives: On successful completion of the course the students should have:
Understood the information retrieval techniques

CONTENTS:
Unit I
Boolean Retrieval : An example information retrieval problem - A First take at building an
inverted index - Processing Boolean queries - The extended Boolean Model versus ranked
retrieval - The term vocabulary and postings lists - Document delineation and character
sequence decoding - Determining the vocabulary of terms - Faster postings list intersection via
skip pointers - Positional postings and phrase queries - Search Structures for dictionaries :
Wild Card queries-Spelling Correction-Phonetic correction

Unit II
Index construction : Hardware basics-Blocked sort-based indexing-Single pass in memory
indexing-Distributed indexing-Dynamic indexing-Other typer of indexes - Scoring, term
weighting and the vector space model : Parametric and zone indexes - Term frequency and
weighting - The vector space model for scoring - Varient tf-idf functions - Computing scores in
a complete search system : Efficient scoring and ranking - Components of an information
retrieval system - Vector space scoring and query operator interaction

Unit III
Relevance feedback and query expansion : Relevance feedback and pseudo relevance
feedback - Global methods for query reformulation - XML retrieval : Basic XML concepts -
Challenges in XML retrieval - A vector space model for XML retrieval - Evaluation of XML
retrieval - Text-centric versus data-centric XML retrieval - Probabilistic information retrieval:
Review of basic Probabilistic theory - The Probabilistic ranking principle - The binary
independence model - An appraisal and some extensions - References and further reading

Unit IV
Text classification and Nave Bayes : The text classification problem Nave Bayes text
classification The Bernoulli model Properties of Nave Bayes Feature selection
Evaluation of text classification Vector space classification : Document representations and
measures of relatedness in vector spaces k nearest neighbor Linear versus nonlinear
classifiers Classification with more than two classes The bias variance tradeoff

UNIT V
Web search basics: Background and history - Web characteristics - Advertising as the economic
model - The search user experience - Index size and estimation - Near-duplicates and shingling
References and further reading - Web crawling and indexes: Overview Crawling -
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 26 of 28 SCAA Dt. 23.03.2011
Distributing indexes - Connectivity servers - References and further reading - Link analysis:
The Web as a graph PageRank - Hubs and authorities

TEXT BOOKS / REFERENCES
1. Christopher D. Manning, Prabhakar Raghavan and Hinrich Schutze, Introduction to
Information Retrieval, Cambridge University Press, 2008.
2. Baeza-Yates, Ricardo and Berthier Ribeiro-Neto, Modern Information Retrieval, Addison-
Wesley 1999.
3. Beesley, Kenneth R. and Lauri Karttunen 2003, Finite State Morphology, CSLI
Publications.
4. C. J. Van Rijsbergen, Information Retrieval, Information Retrieval Group, University of
Glasgow.
5. David A. Grossman, Ophir Frieder, Information Retrieval: Algorithms and Heuristics,
Springer, 2
nd
Edition, 2004.


Subject Title: ELECTIVE 1 - DISTRIBUTED SYSTEMS
Course Number: 10CSEAE29
Number of Credits :4 L= 4 P= 0


Subject Description:
This course presents a detailed overview of distributed systems, design considerations,
distributed system models and distributed databases.

Goal:
To enable the students to learn the basic functions, principles and concepts of Distributed
Systems.

Objectives:
On Successful completion of the course the students should have:
Understood the Distributed Processing Systems Design, Distributed databases and
distributed transactions.
Contents:
UNIT I
Distributed Systems: Introduction-examples of distributed systems- resource sharing- challenges
of distributed systems- Pros and Cons of Distributed processing
UNIT II
System models: Architectural models - variations on client-server model - design requirements
for distributed architectures- Interaction model Failure model- Security model
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 27 of 28 SCAA Dt. 23.03.2011
UNIT III
Distributed objects and remote invocation: communication between distributed objects-remote
procedure call events and notifications - Java RMI case study
UNIT IV
Distributed databases- An overview distributed database management systems-reference
architecture for distributed databases-types of data fragmentation-distributed database design-
framework-design of database fragmentation-allocation of fragments
UNIT V
Distributed transactions: flat and nested distributed transactions-atomic commit protocols-
concurrency control- distributed deadlocks-transaction recovery.
REFERENCE BOOKS
1. George Coulouris, Jean Dollimore, Tim Kindberg, Distributed Systems Concepts
and design, Third edition, Pearson Education,2006.
2. Stefano Ceri, Giuseppe Pelagatti, Distributed Databases Principles and systems,
Tata McGraw Hill edition,2008.



Subject Title : ELECTIVE 2 - PROGRAMMING IN C#
Course Number : 10CSEAE37
Number of Credits : 4 L= 2 P= 4

Subject Description: This course presents the Visual C# programming techniques.
Goal: To enable the students to learn the basic functions, principles and concepts of Visual C#
programming
Objectives: On successful completion of the course the students should have:
Understood the Visual C# programming techniques

CONTENTS:
Unit I:
Introduction to Microsoft Visual C# Programming : A demonstration of Visual C# 2008
Sample C# Program Sample LINQ Program Common Elements in Visual C# 2008
Nmaespaces Main Entry Point Local Variables Nullable Types Expressions Selection
Statements Iterative Statements C# Core Language Features Symbols and Tokens
Identifiers Keywords. Types: Classes Class Members Member Functions Structures
Enumerations Bitwise Enumeration Equivalence versus Identity Class Refinement.

Unit II:
Inheritance : Inheritance Example System.Object - Employee Class Implementing
Inheritance Overriding Inherited Behavior The new Modifier Abstract Classes Sealed
Classes Constructors and Destructors Interfaces Polymorphism Casting Attribute
Inheritance Visual Studio 2008.
M.C.A. (Uni. Dept.) 2010-11 updated Jan. 2012 Page 28 of 28 SCAA Dt. 23.03.2011

Unit III:
Arrays and Collections : Array Elements Multidimensional Arrays Jagged Arrays
System.Array System.Array Properties params keyword Array Conversion Collections:
Array List Collection Bit Array Collection Hashtable Collection Queue Collection Stack
Collection Specialized Collections LINQ. Introduction to LINQ : C# Extension - LINQ
Essentials LINQ to Objects Examples of LINQ to Objectas LINQ Operators .

Unit IV:
Generics. Generic Types Type Parameters Type Arguments Constructed Types
Overloaded Methods Generic Methods Constraints Derivation Constraints Interface
Constraints Value Type Constraints Reference Type Constraints Default Constructor
Constraints Casting Inheritance Overriding Generic Methods Nested Types Static
Members Enumerators. Enumerators: Enumerable Objects Generic Enumerators Iterators


Unit V:
Operator Overloading: Mathematical and Logical Operators Conversion Operators A
Practical Example Operator Overloading Internals Delegates and Events. Exception
Handling : An exception handling example A standard exception model Structured
exception handling System.Exception Remote Exception Unhandled exception Managing
Exception in visual studio - Meta data and reflection.

Reference Book :
1. Donis Marshall, Programming Visual C# 2008 : The Language , Microsoft Press
Publication, 2008
2. Jason Price, Mike Gunderloy, Mastering Visual C# .Net , John Wiley & Sons Publication,
2002