Mca Syll

Anx.
31 I - MCA (CBCS) 2007-08 Page 1 of 57
Annexure No. 31 I
SCAA Dated 29.02.2008
BHARATHIAR UNIVERSITY, COIMBATORE – 641 046
MASTER OF COMPUTER APPLICATIONS – MCA (CBCS)
with Compulsory Diploma course in Open Systems
(Effective from the academic Year 2007-2008)
1. Eligibility for Admission to the Course

Candidates for admission to the first year programme leading to the Degree of Master
of Computer Applications (M.C.A.) will be required to posses the qualification as per AICTE
norms: a) Pass in any degree with Mathematics at +2 level (or) b) Any degree with at
least one paper in Mathematics or Statistics at degree level.
2. Duration of the Course

The programme shall be offered on a full-time basis. The programme will consist of
five semesters of course work and laboratory work and the sixth semester consists of project.
An additional Diploma course in Open Systems shall also be offered along with
this MCA course.
3. Regulations
The general Regulations of the Bharathiar University Choice Based Credit System
Programme are applicable to this programme.
4. The Medium of Instruction and Examinations

The medium of instruction and Examinations shall be in English.
5. Submission of Record Notebooks for Practical Examinations & Project Viva-Voce.

Candidates taking the Practical Examinations should submit bonafide Record Note Books
prescribed for the Examinations. Otherwise the candidates will not be permitted to take the
Practical Examinations.
Candidates taking the Project Viva Examination should submit Project Report prescribed for
the Examinations. Otherwise the candidates will not be permitted to take the Project Viva-
voce Examination.
6. Ranking
A candidate who qualifies for the PG Degree Course passing all the Examinations in the first
attempt, within the minimum period prescribed for the Course of Study from the date of
admission to the Course and secures 1st or 2nd Class shall be eligible for ranking and such
ranking will be confined to 10% of the total number of candidates qualified in that particular
subject to a maximum of 10 ranks.
7. Revision of Regulations and Curriculum
The above Regulation and Scheme of Examinations will be in vogue without any change for
a minimum period of three years from the date of approval of the Regulations. The University
may revise /amend/ change the Regulations and Scheme of Examinations, if found necessary.
8. Transitory Provision
Candidates who have undergone the Course of Study prior to the Academic Year 2007-2008
will be permitted to take the Examinations under those Regulations for a period of four years
i.e. up to and inclusive of the Examination of April 2012 thereafter they will be permitted to
take the Examination only under the Regulations in force at that time.
*******
Anx.31 I - MCA (CBCS) 2007-08 Page 2 of 57
SCHEME OF EXAMINATION
Master of Computer Applications (MCA) with
Compulsory Diploma course in Open Systems (CBCS)
(Effective from the academic Year 2007-2008)
Core/
Credits
Elective/ Suggested
Sem
Title of the Paper L P Marks
Supportive/ Code
Project
Core 07CSEAC01 I Computer Organization And Architecture 4 0 4 100
Core 07CSEAC02 I Programming In C 2 4 4 100
Core 07CSEAC03 I Foundations of Computer Science 4 0 4 100
Core 07CSEAC04 I Data Structures 2 4 4 100
Elective 07CSEAC05 I Unix Programming 2 4 4 100
Supportive 07CSEGSXX I General Supportive 2 50
Dip.Paper I I Diploma Paper I 4 100
Core 07CSEAC06 II System Analysis And Design 4 0 4 100

Core 07CSEAC07 II Operating Systems 3 2 4 100
Core 07CSEAC08 II Design And Analysis of Algorithms 4 0 4 100
Core 07CSEAC09 II Object Oriented Programming 2 4 4 100
Elective 07CSEAC10 II Database Management System 2 4 4 100
Supportive 07CSEGSXX II General Supportive 2 50
Dip.Paper II II Diploma Paper II 4 100
Core 07CSEAC11 III Java Programming 2 4 4 100

Core 07CSEAC12 III Object Oriented Analysis And Design 4 0 4 100
Core 07CSEAC13 III Computer Networks 3 2 4 100
Core 07CSEAC14 III Software Engineering 4 0 4 100
Elective 07CSEAC15 III Computer Graphics 2 4 4 100
Supportive 07CSEGSXX III General Supportive 2 50
Dip.PaperIII III Diploma Paper III 4 100
Core 07CSEAC16 IV Visual Programming 2 4 4 100

Core 07CSEAC17 IV Software Project Management 4 0 4 100
Core 07CSEAC18 IV System Programming And CompilerDesign 3 2 4 100
Elective 07CSEAEXX IV Elective - I 4 100
Elective 07CSEAEXX IV Elective - II 4 100
Dip.PaperIV IV Diploma Paper IV 4 100
Core 07CSEAC19 V Internet Programming And Web Designing 2 4 4 100

Core 07CSEAC20 V Enterprise Java Programming 2 4 4 100
Elective 07CSEAEXX V Elective – III 4 100
Elective 07CSEAEXX V Elective - IV 4 100
Project 07CSEAC21 VI Project Work And Viva Voce 6 150
Total Master of Computer Applications 124 2700

Diploma course 16 400
Electives for MCA (CBCS)

Suggested
Title of the Paper L P Credits Marks
Elective Code
Elective 07CSEAE22 E - Commerce 4 4 100
Elective 07CSEAE23 Microprocessor And Assembly 4 4 100
Programming
Elective 07CSEAE24 Enterprise Networking 4 4 100
Elective 07CSEAE25 Enterprise Resource Planning 4 4 100
Elective 07CSEAE26 Client / Server Architecture 4 4 100
Elective 07CSEAE27 Principles Of Programming Languages 4 4 100
Elective 07CSEAE28 Speech Processing 4 4 100
Elective 07CSEAE29 Image Processing 3 2 4 100
Elective 07CSEAE30 Computer Peripherals And Interfacing 4 4 100
Elective 07CSEAE31 Neural Networks 4 4 100
Elective 07CSEAE32 Data Mining 4 4 100
Artificial Intelligence And Expert
Elective 07CSEAE33 Systems 4 4 100
Elective 07CSEAE34 Parallel Processing 4 4 100
Elective 07CSEAE35 Distributed Systems 4 4 100
Elective 07CSEAE36 Security In Computing 4 4 100
Elective 07CSEAE37 Knowledge Based Systems 4 4 100
Elective 07CSEAE38 Parallel Algorithms 4 4 100
Management Concepts And
Elective 07CSEAE39 Communications 4 4 100
Elective 07CSEAE40 Data Compression 4 4 100
Elective 07CSEAE41 Embedded Systems And Real Time 4 4 100
Operating Systems
Elective 07CSEAE42 Software Testing 4 4 100
Elective 07CSEAE43 Data Warehousing 4 4 100
Elective 07CSEAE44 Cryptography 4 4 100
Elective 07CSEAE45 VB And Net 3 2 4 100
Elective 07CSEAE46 Natural Language Processing 4 4 100
Elective 07CSEAE47 Virtual Reality 4 4 100
Elective 07CSEAE48 Web Services 4 4 100
Elective 07CSEAE49 Multimedia Systems 4 4 100
Elective 07CSEAE50 TCP / IP 4 4 100
DIPLOMA IN OPEN SYSTEMS (DOS)

(Offered compulsorily with PG Courses in Computer Science)
(Effective from the Academic Year 2007-2008)
SCHEME OF EXAMINATION
University
Instructional
Examinations
Subject and Paper Hours per
Duration Max
week/Credits
in Hrs Marks
Introduction to Open Source
Paper I 3/4 3 100
Tools
Introduction to Open Source
Paper II 3/4 3 100
Environment
Advanced Programming in
Paper III Open Source - PHP 3/4 3 100
Web Application in PHP

Paper IV 3/4 3 100
Programming-lab
Total 12/16 400
Suggested
Supportive Title of the Paper L P Credits Marks
Code
Supportive 07CSEGS01 Windows And MS-Word 1 2 2 50
Supportive 07CSEGS02 Internet And Html Programming 1 2 2 50
Supportive 07CSEGS03 MS - Access 1 2 2 50
Supportive 07CSEGS04 Excel And Power Point 1 2 2 50
Supportive 07CSEGS05 Programming In C 1 2 2 50
L – Lecture Hour P – Practical Hour

Subject Title: COMPUTER ORGANIZATION AND ARCHITECTURE
Course Number: 07CSEAC01 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
REFERECE BOOK
1. M Morris Mano, ‘Computer System Architecture’, Prentice-Hall India, Third

Edition,1999
2. John P Hayes, ‘Computer Architecture and Organization’, McGraw-Hill Book
Company
3. M Morris Mano, ‘Digital Logic and Computer Design’, Prentice-Hall India
Subject Title: PROGRAMMING IN C
Course Number: 07CSEAC02 Number of Credits : 4
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:
• 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, 4th edition.
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, 1992.
4. S. Thamaraiselvi G. Murugesahan, ‘C for all’, Anuradha agencies.
5. Robert A. Radcliffe, 'Encyclopedia C' BPB Publications.
6. Brain W. Kernighan, Dennis M.R. Chie, 'The C Programming Language' Prentice
Hall, 1990.
7. Gottfried, B. 'Theory and Problems of Programming with C', McGraw Hill, 1990.
Subject Title: FOUNDATIONS OF COMPUTER SCIENCE

Course Number: 07CSEAC03 Number of Credits :4
This course presents the set theory, Introduction to Probability Theory, Automata Theory,
Mathematical Logic, and Numerical Methods.
Goal:
To enable the students to learn the basic functions, principles and concepts of mathematical
foundations of computer science.
Objectives:
• Understood the set theory and Probability Theory
• Understood the Automata Theory, Mathematical Logic and Numerical Methods.
Contents:
UNIT I
Set Theory: Basic set operations, relations and functions, relation matrices, transitive closure
relation, 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, Bayer’s 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. Trembley and Manohar, “Discrete Mathematical Structures with Application to

Computer Science”, McGraw-Hill.
2. M.K. Venkatraman, “Engineering Mathematics”, vol. II, National Publishing
Company, Chennai.
3. S.C. Gupta and V.K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan
Chand and Sons New Delhi.
4. Hopcroft and Ullman, “Introduction to Automata Theory, Languages and
Computation”, 2nd edition, 2001, Pearson education.
5. Prof. V. Sunderasen, K. S. Ganapathy Subramanian, K. Ganesan, ‘Discrete
Mathematics’,A. R. Publications, 2001
Subject Title: DATA STRUCTURES

This course gives an introduction of algorithms, linked lists, internal sorting, symbol tables
with case study.
Goal:
To enable the students to learn the data structure fundamentals, principles and concepts.
Objectives:
• Understood the various Data Structures, Algorithms for sorting 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. Lists: List Specification, Implementation of Lists,
Strings, Linked Lists in Arrays
UNIT III
Sorting & Searching: Searching - Introduction & Notation, Sequential Search, Binary
Search. Sorting: Introduction & Notation, Insertion Sort, Selection Sort, Divide &
Conquer Sorting : Merge sort, Quick Sort, Heaps & Heap Sort.
UNIT IV
Tables & Information Retrieval, File Structures: Tables & Information Retrieval -
Introduction, Rectangular Arrays, Tables of various shapes, Abstract Tables, Hashing.
File Structures: Concept of Fields, Records & Files, Sequential File Organization,
Variable Length Records & Text Files.
UNIT V
Trees & Graphs: Binary Trees - Binary Trees- Binary Search Trees- Building a
Binary Search Tree, Height Balance: AVL Trees, Splay Trees Multiway Trees: Tries,
B-Trees , Red Black Tree. Graphs: Definitions, Undirected & Directed Graphs,
Traversal
REFERENCE BOOKS
1. Robert L Kruse, “Data Structures & Program Design”, 2nd edition2001, pearson
education
2. Dromey, “Problem Solving & Algorithm Design”.
3. Ellis Horowitz & Sartaj Sahni, “Fundamentals of Data Structures
4. Sartaj Sahni “Data Structures , Algorithms and Applications in C++ ,2nd edition
5. Jean Paul Tremblay, Paul G. Sorenson, ‘An Introduction to Data Structures with
Applications’, Tata McGraw Hill, Second Edition.
Subject Title: UNIX PROGRAMMING
This course presents the introduction, inter process communication, classical IPC problems,
shell programming and system programming in UNIX.
Goal:
To enable the students to learn the basic fundamentals of UNIX operating system, and UNIX
programming
Objectives:
• Understood the UNIX file system.
• Learnt shell programming & system programming in UNIX
Contents:
UNIT I
Unix – Introduction – Basic commands – files – permissions – directories – processes – pipes
– redirection – filters – vi editor – unix file system – unix file structure.
UNIT II
Shell programming – Shell Syntax : Variables – conditions – control structures – functions –
commands – command execution – simple programs
UNIT III
Unix System Programming – System calls and device drivers – Library functions – low level
file access – system calls for managing files – files and directory maintenance – scanning
directories.
UNIT IV
Process and signals – process – process structure – starting new processes – signals
UNIT V
Interprocess communication – Pipes: process pipes – pipe call – parent and child processes -
Semaphores: Definition – example – facilities – shared memory: overview – functions –
message queue: overview – functions – Sockets: socket connections.
REFERENCE BOOK
1. Peter Dyson, Stan Kelly – Bootle, John Heilborn, “UNIX Complete”, BPB
Publications, 1999
2. Richard Stones, Neil Matthew, “Beginning Linux Programming”, WROX, 1999
3. Uresh Vahalia, “UNIX Internals, The New Frontiers”, Pearson Education Limited,
2002
Subject Title: SYSTEM ANALYSIS AND DESIGN

This course presents the systems analysis overview, system requirement specification,
process specification and Data input methods.
Goal:
To enable the students to learn the basic types of system, planning and investigation, system
design & documentation
Objectives:
• Understood the analysis & design of systems
• Learnt the system and process specifications and various data input methods
Contents:
UNIT I
INTRODUCTION- System Concepts - Subsystems - Types of Systems - Systems and the
System analyst - Business as a systems - Information systems - systems Lifecycle - Systems
Development Stages - Role of system Analyst - Characteristics of System Analyst.
UNIT II
SYSTEM PLANNING AND INVESTIGATION- Approaches to system Development -
Methods of Investigation - Recording the investigation.
UNIT III
SYSTEM DESIGN- Analyzing user requirements - Logical system Definition - Physical
Definition - Physical Design of Computer subsystem - File Design - Database Design -
Output and Input Design - Computer Procedure Design - system security.
System implementation - Changeover – Maintenance and review.
UNIT IV
PROJECT DOCUMENTATION- Communication skills - Problems in communication
written reports - Principles of report writing with structure - Standard documentation -
System Proposal - User system Specification – Program and Suit Specification - User Manual
- Operational Manual - Test Data file - Changeover – Instructions - System audit report.
UNIT V
Control in Information systems, Audit of Information systems, Testing of Information
systems, Security of Information systems. Quality Assurance: Reviews, walkthroughs and
Inspections.
REFERENCE BOOKS
1. Lee, Introducing Systems Analysis and Design, Galgotia Booksource, Reprint 2003.
2. James A Senn, Analysis and Design of Information Systems, McGraw Hill,1989.,
3. Igor Hawryszkiewycz, Introduction to system analysis and design, PHI, New
Delhi,2000.
4. V.Rajaraman,Analysis and Design of information Systems, PHI, New Delhi,2000.
Subject Title: OPERATING SYSTEMS
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:
• 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.
Subject Title: DESIGN AND ANALYSIS OF ALGORITHMS
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:
• 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, Strassen’s 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”, 1995.

2. Baase, ‘computer algorithms’ , 2000, pearson education.
3. S. Lakshmivarahan, Sundarshan K. Dhall., “Analysis and Design of Parallel
Algorithms”
4. Mark Allen Weiss “Data Structures and Algorithm Analysis in C”
Subject Title: OBJECT ORIENTED PROGRAMMING
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:
• 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, Booch’s Object-
oriented design, Class design, How to build reliable code, OO software performance tuning.
REFERENCE BOOK
1. Stroustrup, “The C++ Programming Language”, (3rd edition), AW.

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.
Subject Title: DATABASE MANAGEMENT SYSTEM
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:
• Understood the basic principles of database management systems, parallel &
distributed databases.
• Gained knowledge over various database models, schemas and SQL statements.
Contents:
UNIT I
Introduction – purpose of database system- data models – database languages-Transaction
management – Storage management - DBA – database users-system structure.
UNIT II
E-R model – Hierarchical model – Network Model.
UNIT III
Structure of Relational databases - Relational Algebra – Tuple Relational Calculus – Domain
Relational Calculus. Relational Commercial Languages (SQL, QBE, Quel, etc.) – Integrity
Constraints - Normalization.
UNIT IV
Indexing and Hashing – Query Processing – Concurrency Control – Security.
UNIT V
Advanced Database Concepts and Emerging Applications.
REFERENCE BOOKS
1. Abraham Silberchatz, Henry K.Forth, Sudharshan, “Database system Concepts” – (3

rd edition), McGraw Hill.
2. Elisa Bertino, “Object Oriented Databases”, Addison Wesley.
3. Navethe / Elmasri, “Fundamentals of Database Systems”, Pearson education, 1999.
Subject Title: JAVA PROGRAMMING

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:
• Gained Java programming skills.
Contents:
UNIT-I
Basic concepts of object oriented programming – benefits & applications of oop. JAVA
evolution: java features – java and c – java and C++ - java and internet Overview of JAVA
language: introduction- implementation of java program – creating, compiling, running the
program. JVM .
UNIT – II
Data Types – operators and Expressions – Branching: Decision making with if statement,
if…else statement, nesting if…else 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 – III
Classes and Objects: Introduction; adding variables, creating and adding methods,
constructors, overloading; Inheritance – defining a subclass, multilevel inheritance,
hierarchical inheritance, overriding methods, visibility control, rules of thumb.
UNIT – IV
Packages – 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 – new born state, running state, blocked state, dead state; using thread
methods, thread exceptions, thread priority.
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.
UNIT –V
Overview of JDBC API: ODBC and JDBC, JDBC drivers – native-API-partly-java
driver, JDBC-Net-all-java driver, two-tier and three-tier client/server models. JDBC
fundamentals: Seven steps to JDBC, importing java.sql package, loading and registering the
driver, establishing the connection, creating and executing statements, retriving results.
JDBC driver interface: Loading and registering JDBC driver, loading multiple driver,
JDBC URL’s. The Connection Interface:Creating a connection interface, the statement
object, prepared statement object, callable statement object: managing transaction - getting
connected.
REFERENCE BOOKS
1. The JAVA Programming Language by Ken Arnold, James Gosslings.
2. The Complete Guide to JAVA Database Programming by Matthew siple,TMH
3. Programming with JAVA a Primer – E.Balagurusamy,TMH
4. JAVA For you by Koparkar,TMH
Subject Title: OBJECT ORIENTED ANALYSIS AND DESIGN

This course presents the object model, classes and objects, UML overview, state machine
view and model management view.
Goal:
To enable the students to learn the basic functions, principles and concepts of object oriented
analysis and design.
Objectives:
• Understood the object oriented system development and different views.
Contents:
UNIT I
The Object Model: The evolution of the object model – Elements of the object model –
Applying object model. Classes and Objects: The nature of an object – Relationships among
objects.
UNIT II
Classes and objects: The nature of the class – Relationship among classes – The Interplay of
Classes and Objects – On building quality classes and objects. Classification: The
importance of proper classification – Identifying proper classes and objects – Key abstraction
mechanism.
UNIT III
UML Overview : UML History – Goals of UML – UML concept areas – Syntax of
Expressions and Diagrams.Nature and purpose of Models : A Model – Levels of Models –
Meaning of Model – UML Walkthrough : UML views – Static views – use case view –
interaction views – state machine view – activity view – physical view – model management
view – extensibility constructs Static View : Overview – classifiers – relationships –
associations – generalization – realization – dependencies – constraints – instances Use Case
View : Overview – actor – use case.
UNIT IV
State machine view : Overview – state machine – event – state – transition – composite state
activity view : overview – activity diagram – activities and other views interaction view :
overview – collaboration – interaction – sequence diagram – activation – collaboration
diagram – patterns physical views : overview – component – node.
UNIT V
Model Management View : Package – Dependencies on Packages – Access and import
dependency – model and subsystem.Extension Mechanism : Constraints – tagged value –
stereotypes – tailoring UML. UML Environment : Semantics responsibilities – notation
responsibilities – programming language responsibilities – modeling with tools.
REFERENCE BOOKS
1. Grady Booch, " Object Oriented Analysis And Design", Addison Wesley, 1994.
2. Martin Fowler, Kendall Scott, "UML Distilled", Addison Wesley, 1997.
3. James Rumbaugh, Ivar Jacobson, Grady Booch, “ The Unified Modeling Language
Reference Manual “, Addison Wesley, 1999.
4. Erich Gamma, "Design Patterns", Addison Wesley.
5. James Rumbough et al, "Object Oriented Modeling and Design", 1991.
6. Ivar Jacobson, "Object Oriented Software Engineering; A Use Case Driven Approach",
Addison Wesley, 1994.
7. Eriksson, "UML Tool Kit", Addison Wesley.
Subject Title: COMPUTER NETWORKS
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:
• Understood the functionality of networks protocols and layers
Contents:
UNIT-I
INTRODUCTION TO NETWORKS & COMMUNICATION MEDIA: Uses – Network
hardware – Network software – Reference Models – Novel NetWare, ARPAnet, Internet
networks – Data Communication services - Standardization. Transmission media – Wireless
Transmission – Telephone system – ISDN, ATM communication – satellite communication.
UNIT–II
DATA TRANSFER & ACCESS PROTOCOLS: Data Link Layer issues – Error detection
and correction methods – Elementary protocols – Sliding window protocols – Protocol
specification and verification methods. Channel allocation – Multiple access – IEEE 802
standards – High speed LANs.
UNIT–III
NETWORK LAYER PROTOCOLS: Network layer issues – Routing algorithms –
Congestion control – Internetworking - Network layer in Internet, ATM.
UNIT–IV
TRANSPORT PROTOCOLS: Transport service – Transport protocols – Transport protocols
in Internet and ATM – Performance issues.
UNIT–V
PRESENTATION LAYER: Design issues - abstract syntax notations - data
compression techniques - cryptography. APPLICATION LAYER ISSUES: Network security
– Domain Name System – Simple Network Management protocol – Electronic mail – World
Wide Web - Multimedia.
REFERENCE BOOK
1. Andrew S.Tanenbaum –Computer Networks, Prentice Hall of India, 3rd edition, 1996.
Subject Title: SOFTWARE ENGINEERING

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:
• 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.
UNIT II
System Analysis: Requirements analysis - Analysis principles - Prototyping - Software
requirement specification - Data modeling, functional modeling and behavioral modeling.
UNIT III
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
UNIT IV
Design Methods: Data design - Architectural design process: transform mapping and
transaction mapping - interface design - procedural design. Design for Real-Time Systems:
System considerations - real time systems - analysis and simulation of real time systems
UNIT V
Software Testing Methods: Software testing fundamentals. White box testing: basis path
testing and control structure testing - black box testing - testing for specialized environments.
Software Testing Strategies: A strategic approach to software testing - unit testing -
integration testing - validation testing - system testing
REFERENCE BOOK
1. R. S. Pressman, “Software Engineering”, (5th edition), Tata McGraw Hill, 1997.
Subject Title: COMPUTER GRAPHICS

Subject Description: This course presents the origin of compute graphics, vector generating
techniques, transformations, interactive graphics, raster graphics.
Goal:
To enable the students to learn basic transformations, algorithms and concepts of Computer
Graphics.
Objectives:
• Understood the Computer Graphics and the various graphic algorithms.
• Understood the 2D and 3D transformations, models and generation techniques
Contents:
UNIT I
The origin of computer graphics – Interactive graphics display new display devices.
General-purpose software display of solid objects.
UNIT II
Vector Generating Techniques: Co-ordinate systems points and lines Incremental methods
line drawing algorithms Digital differential analyzers Binary rate multiplier, character
generator – Displaying the frame buffer. Graphics Primitives: Operations windowing
functions Miscellaneous functions Graph plotting program Transformation processor Display
code generation, Display file interpreter, Display file structure Display file algorithms
Display control Text applications.
UNIT III
Transformation: Scaling transformations Rotations Rotations about an arbitrary point
Transformation routines concentration Matrix representations. Clipping and windowing:
Line clipping algorithms, midpoint subdivision clipping other graphics entries polygon
clipping viewing transformations implementation windowing transformations. Segments:
The segment table segment creation closing a segment deleting a segment renaming a
segment visibility Image transformations saving and showing segments other display file
structures some raster techniques.
UNIT IV
Interactive Graphics: Graphical Input devices pointing and positioning devices tablets light
pen three dimensional input devices, graphical input techniques positioning techniques
pointing and selection inking and pointing on line character recognition event handling
dragging and fixing fit detection.
UNIT V
Raster Graphics: Generating a raster image, Scan converting line drawing displaying
characters speed of scan conversion natural images, solid area scan conversion geometric
representation of areas scan converting polygons priority The X-Y algorithms, interactive
raster graphics Updating the display the painting model moving parts of an image feed
images.
REFERENCE BOOKS
1. Donald Hearn & M.Pauline Baker, “Computer Graphics”, Prentice Hall, Englewood
Cliffers, New Jersy, 1986.
2. H.M.Neumann and R.F.Sproul, “ Principles of Interactive computer Graphics”,
McGraw Hill, 1981(2nd Edn)
3. Steven Harrington, “Computer Graphics – A Programming Approach”, McGraw Hill,
1983.
4. Harry Katyon, Jn., “Microcomputer Graphics and Programming Techniques”, Van No
strand Reinhold, 1982.
Subject Title: VISUAL PROGRAMMING

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:
• 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 C–Wide Characters and Windows-Windows and Messages: A window of
one’s 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.
2.John Paul Mueller, “Visual C++ 5 from the Ground Up”, Tata McGraw Hill, 1997.
Subject Title: SOFTWARE PROJECT MANAGEMENT

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:
• 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 Study – PRINCE Project Management.
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.
Subject Title: SYSTEM PROGRAMMING AND COMPILER DESIGN

This course presents the introduction to machine structures, macroinstructions, introduction
to compilers, syntax analysis, and code generations.
Goal:
To enable the students to learn the basic functions, principles and concepts of system
programming and compiler design.
Objectives:
• Understood the Machine structure, syntax analysis and run time environments
Contents:
UNIT I
Background: Machine structure, Evolution of the Components and Operating systems(Evolution
of operating system).Operating system user view point : functions-batch control language-
Machine Structure, Machine language and Assembly Language: General Machine Structure –
Machine Language-Assembly Language-Assemblers: General Design Procedure-Design of
Assembler-Table Processing : Searing and Sorting.
UNIT II
Macro Instructions-features of a macro facility-Implementations Loader: Loader schemes-design
of an absolute loader-design of a Direct Linking loader-Programming Languages-Importance and
features of high level languages-Data types and Data structures-Storage allocation and scope of
names – accessing feasibility – functional modularity – Asynchronous operations - Extensibility
and Compile – Time macros
UNIT III
Introduction to compilers: Compilers – Analysis of source program – The Phases of
compilers – Cousins of Compilers – The grouping of phases – A simple one-pass compiler;
Overview – Syntax Definition – Syntax-directed translation – Parsing – 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 – based pattern matchers.
UNIT IV
Syntax Analysis: The role of a parser – Context Free Grammar – Top-down parsing –
Bottom-up parsing – Operator – LR Parsers – Precedence parsing.
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.
UNIT V
Run-time environments-Storage Organization-Storage - Allocation Strategies – Symbol
Tables – Dynamic Storage allocation techniques. Intermediate Code Generation: Intermediate
languages – Declarations – Back patching – Procedure Calls. Code Generation: A simple
code generator – the Dag representation of basic blocks – Peephole optimization – Code
Generator generators. Code Optimization: Introduction – Principal sources of optimization –
Optimization of basic blocks.
REFERENCE BOOKS
1. John J. Donovan “System Programming’, Tata Mc Graw Hill Edition,1991
2. Alfred V.Aho, Ravi Sethi, Jeffery D.Ullman, Sethi “Compilers, Principles and
Techniques and Tools’, Addison-Wesley,1999
Subject Title: INTERNET PROGRAMING AND WEB DESIGNING

This course presents the Internet basics, XML, Java script and ASP concepts.
Goal:
To enable the students to learn the principles of Internet programming.
Objectives:
• Gained knowledge in Internet basics and XML
• Understood Java Script and ASP programming.
UNIT I
Internet Basics: Introduction – Getting Connection – Services - Mail – News Groups – FTP –
Telnet – WAIS – Archive – Gopher – Veronica – HTML: Basic Structural Elements and their
usage – Traditional text and formatting – Using tables, images, frames, links and forms –
Merging multimedia and plug-Ins – Cookies – Creating dynamic HTML pages – Cascading
Style Sheets – Scripting basics and the validation process
UNIT II
XML: Need for XML – Documentation – Elements and Attributes – Valid Documents –
Objects Checking Validity – Links – Advanced Addressing – Viewing – Processing – XML
Document – Object Model Using Meta Data – Rendering XML with XSL
UNIT III
SCRIPTING LANGUAGE- Java Script programming -Dynamic HTML - Cascading style
sheets - Object model and collections - Event model - Filters and Transitions - ActiveX
controls - Multimedia - Client side scripting
UNIT IV
Active server pages: Introduction – client side scripting versus server side scripting – using
personal web server and internet information server – active server page onjects – an example
– server side activex components – file system objects – session tracing and cookies –
database, sql, Microsoft UDA and ADO – accessing a database from an active server page –
internet and world-wide web resources
UNIT V
ASP.NET: Introduction to .Net Framework – Components of .Net – ASP.Net - .net Web
services - .net Languages - .net Data Services ADO.Net
REFERENCE BOOKS
1. Peter Kent, “10 Minute Guide to the Internet“, Prentice Hall of India, 1996.
2. Java How to program,Deitel & Deitel, Prentice Hall 1999.
3. Scott Mitchell and James Atkinson, “Teach Yourself XML in 21 days”, Sams
Publishing, 1999.
4. Nicholas Chase, “ASP 3.0 from Scratch”, Prentice Hall India Ltd, 2000.
Subject Title: ENTERPRISE JAVA PROGRAMMING

This course presents the RMI, Java Servlets, JSP, EJB, and JSF.
Goal:
To enable the students to learn the advanced concepts of java programming.
Objectives:
• Gained enterprise Java programming skills.
Contents:
Unit I
REMOTE METHOD INVOCATION-Distributed Application Architecture- Creating stubs
and skeletons- Defining Remote objects- Remote Object Activation-Object Serialisation-Java
Spaces-Java IDL and ORBs.
Unit II
JAVA SERVLETS- Servlet Basics-Servlet chaining-Servlet initialization-Server Side
includes-Cookies-Session Tracking-Databases and non-HTML content.
Unit III
JAVA SERVER PAGES-JSP Overview-Installation-JSP tags-Components of a JSP page-
Expressions-Scriptlets-Directives-Declarations-A complete example
Unit IV
ENTERPRISE JAVA BEANS- Introduction-Standards-EJB roles-Transaction management-
Implementing an EJB object, Session Beans, Entity Beans- Deploying an EJB object.
Unit V
JAVA SERVER FACES- JSF Technology-Benefits-JSF Application-Framework roles-A
Simple JSF Application example-User Interface-Component model-Navigation model-
Backing Bean management-Lifecycle of a JSF page.
REFERENCE BOOKS
1.Jamie Jaworskie,”Java 2 Platform Unleashed”, Techmedia SAMS.

2.David Flanagan,Jim Farley,William Crawford, Kris Magnusson,” Java Enterprise in a
Nutshell”, O’Reilly SPD,1999.
3.Phil Kanna,” The Complete Reference JSP 2.0”, Tata McGrawHill Publishing Company
Ltd,2003.
4.Jim Keogh,” The Complete Reference J2EE”, Tata McGrawHill Publishing Company
Ltd,2002.
5. www.java.sun.com/j2ee/1.4/docs/tutorial/doc/JSFIntro.html
ELECTIVE PAPERS
Subject Title: E-COMMERCE

Course Number: 07CSEAE22 Number of Credits :4
This course presents the introduction to E-Commerce, Network Infrastructure, Information
publishing technology, Securing network transaction, search engines.
Goal:
To enable the students to learn the basic functions, principles and concepts of E-Commerce.
Objectives:
• Understood the E-Commerce framework
Contents:
UNIT I
Introduction to E-Commerce : Benefits-Impacts-Classification and Application of E-
Commerce-Business Model-Architectural Frame Work
UNIT II
Network Infrastructure: Local Area Network-Ethernet-Wide Area Network-Internet-TCP/IP
Reference Model-Domain Name System-Internet Industry structure-Information Distribution
and Messaging: FTP Application-Electronic Mail-World Wide Web Server-HTTP-Web
Server Implementations
UNIT III
Information Publishing Technology: Information publishing-Web Browsers-HTML-CGI-
Multimedia Content - Other Multimedia Objects-VRML- Securing the Business on Internet-
Why Information on Internet is vulnerable?-Security Policy-Procedures and Practices-Site
Security-Protecting the Network-Firewalls-Securing the Web Service
UNIT IV
Securing Network Transaction-Electronic Payment Systems: Introduction –Online Payment
Systems-Pre-paid Electronic Payment System- Post-paid Electronic Payment System-
Requirement Metrics of a Payment System
UNIT V
Search Engines and Directory Services : Information Directories –Search Engines –Internet
Adverting- Agents in Electronic Commerce : Needs and Types of Agents-Agent
Technologies-Agents Standards and Protocols-Agents Applications-Case Study.
REFERENCE BOOK
1.Bharat Bhasker, “ Electronic Commerce Framework, Technologies and Applications ”,

Tata McGraw Hill Publication, 2003.
Subject Title: MICROPROCESSOR AND ASSEMBLY PROGRAMMING

This course presents the introduction to Microcomputer systems and hardware, programming
the 8085/8080A, code conversion, interfacing data converters.
Goal:
To enable the students to learn the basic functions, principles and concepts of microprocessor
and Assembly Programming.
Objectives:
• Understood the Microprocessor and Assembly Programming.
Contents:
UNIT I
Microcomputer systems and hardware :Microcomputers, Microprocessors and Assembly
languages : Digital Computers – Computer Languages-From large computers to Single Chip
Microcomputers .Microprocessor Architecture and Microcomputer Systems-Microprocessor
architecture and its operations – Memory – Input/Output – Example of a Microcomputer system-
Interfacing Devices – 8085/8080A- The 8085 Microprocessor – An example of 8085 based
Microcomputer – The 8080A Microprocessor – Instruction Classification – Instruction Format –
Write and Execute a Simple Program – Instruction Timing – Operation Status – Overview of
8085/8080A Instruction Set.
UNIT II
Programming the 8085/8080A :Introduction to 8085/8080A basic instructions – Data Transfer
Instructions – Arithmetic Operations- Logic Operations – Branch Operations – Writing
Assembly Language Programs – Debugging a Program – Programming techniques with
additional instructions – Counter and timing delays – Stack and subroutines.
UNIT III
Code Conversion, BCD Arithmetic and 16 bit data operations – Software development systems
and assemblers . Interfacing peripherals and applications- parallel input / output and interfacing
applications – Interrupts.
UNIT IV
Interfacing data converters – Digital to Analog converters – Analog to Digital converters – SDK
85 Programmable interface devices – Basics in Programmable I/Os – The 8155/ 8156 and
8855/8755 multipurpose programmable devices – 8279 programmable keyboard/ display
interface – General purpose programmable peripheral devices.
UNIT V
Serial I/ O and Data Communication – Microprocessor applications – Trends in Microprocessor
Technology and Bus Standards.
REFERENCE BOOK
1. Ramesh S. Gaonkar, “ Microprocessor Architecture, Programming and Application with

the 8085/8080A”, Wiley Eastern Limited ,1986.
Subject Title: ENTERPRISE NETWORKING

This course presents the introduction to enterprise networking needs, determine the micro to
mainframe link, LAN, Distributed processing and LANs and issues.
Goal:
To enable the students to learn the basic functions, principles and concepts of Enterprise
Networking.
Objectives:
• Understood the Organizational Problems and Opportunities
• Understood Distributed Processing, LANs & Enterprise Networking.
Contents:
UNIT I
Needs – Organizational Problems and Opportunities – System Dependent Issues – Features,
Facilities – Mainframe Requirements – Micro Requirements – Functional Requirements –
Single Vendor/Multi Vendor Environments – Services.
UNIT II
Determine the Micro-to-Mainframe Link – Connective versus Dedicated Networks – Micros,
Mainframes and Networks. Network Security – OSI Security Architecture – Network
Security Systems – The Impact of Security Measures.
UNIT III
LAN – Services and Servers – LAN Access Methods – Collision Avoidance and etection –
Bandwidth - Broadband, Baseboard – Telephony – The Physical Medium – Reliability –
IBM’s Impact on Microcomputer LANs – Micros as Mainframe Peripherals – Mainframes as
Micro Peripherals.
UNIT IV
Distributed Processing and LANs – Distributed Computing – LANs and Mans – LANs and
The Internet – IBM and EWC – LANs in a Digital DNA Environment – Protocol Conversion
– Protocol Conversion on the Micro – Protocol Conversion between the Micro and
Mainframe – Protocol Conversion at the Mainframe – LANs Protocol Converters – Backward
Emulation.
UNIT V
Issues – Asynchronous Modes of Transfer – Synchronous File Transfers – Other Important
Data-Link and File Transfer Protocols – Higher Layer File-Transfer Mechanisms –
Reflections on the File Transfer Process. Accessing Common Databases – Client-Host Data
Format Issues – Application-Specific Micro-To-Mainframe Systems – Multimedia Systems
Successful Networks for EWC. Networks and EWC – Open Issues – Finding the “Right”
Solution for the Enterprise – Facing the Organizational Problem.
REFERENCE BOOK
1.Thomas W. Madron, “Enterprise-Wide Computing - How to Implement and
Manage LANs”, John Wiley & Sons., 1991.
Subject Title: ENTERPRISE RESOURCE PLANNING
This course presents the introduction to ERP, ERP and related technologies, ERP Market,
Vendors
Goal:
To enable the students to learn the basic functions, principles and concepts of
Enterprise Resource Planning.
Objectives:
• Understood the Enterprise Resource Planning and related technologies
Contents:
UNIT I
Introduction to ERP : Evolution of ERP-ERP-Reason for the growth of the ERP market-
Advantage-Enterprise-An overview: Integrated Management Information-Business
modeling-integrated Data Model
UNIT II
ERP and Related Technologies: Business Process Reengineering-Management Information
System-Decision Support System-Executive Information Data ware housing-data mining-
OLAP-Supply Chain Management-A Manufacturing Perspective: CAD/CAM-MRP-BOM-
Closed Loop MRP-Data Management –Benefits of PDM-Make to order-Assembler-Engineer
to order-Configure-ERP Modules.
UNIT III
ERP Market- Implementation LifeCycle: Introduction-Pre-Evaluation Screening-Package
Evaluation-Project Planning Phase-Gap Analysis-Reengineering-Configuration-
Implementation Team Training -Testing –End User Training-Post -Implementation
UNIT IV
Vendors, Consultant and Users- Future Directions in ERP: New Markets-New Channels-
Faster Implementation Methodologies-Business Models and BAPIs-Convergence on
Windows NT-New Business Segments-More Features-Web Enabling Markets -Snapshot
UNIT V
ERP Case Studies: SAP R/3 ,Oracle, People soft
REFERENCE BOOKS
1. Alexis Leon,” “Enterprise Resource Planning”, Tata McGRAW-Hill Edition,2003

2. Michael Hammer, “Enterprise Resource Planning”, 1998.
3. K.Nagappan, “Digital Computers and Data Processing “, 1996.
4. J.A.Hernandez, “The SAP R/3 Handbook”, 1998.
Subject Title: CLIENT/ SERVER ARCHITECTURE

This course presents the overview of client/server computing, client/server hardware and
software requirements, application development and production environments.
Goal:
To enable the students to learn the concept of client/server computing
Objectives:
• Understood the client/server computing techniques
• Understood the client/server application development and production environments
Contents:
UNIT I
Overview of Client/Server computing: What is Client/Server Computing-Benefits of
Client/Server Computing-Evolution of Client/server Computing: Hardware and Software
Trends-Overview of Client /Server Applications: Components of Client/Server Application-
Classes of client/server application-Categories of Client/Server Applications-Understanding
Client /Server Computing: Obstacles-Open systems and standards-Factor for success
UNIT II
The Client Hardware and Software : Client Components-Client operating systems-GUI-X
Windows versus Windowing–Database access-Application logical-Client Software Products:
GUI Environment-Database access tools Client Requirements-The Server- Categories –
Features of Server Machines-Classes of Server Machines-Server Environment.
UNIT III
Server Requirements-Server Data Management and Access Tools-Data Manager Features-
Data Management Software-Database Gateways-Overview of Networking-LAN Hardware
and Software: LAN Hardware-Network Operating Sytems
UNIT IV
Applications Development Environments-Managing the Production Environment-Distributed
Transaction Management-Integrating Multivendor Environments-
UNIT V
Production Requirements: System Management-Network Management-Runtime
Specifications-Distributing Software Updates-Hardware and Software Trends
REFERENCE BOOKS
1. Dawna Travis Dewire, “ Client Computing”, Tata McGRAW-Hill Edition, 2003
2. Robert Orfali, Dan Harkey and Jerri Edwards, “Essential Client/Server
3. Survival Guide”, John Wiley & Sons Inc., 1996.
4. Joe Salemi, “Client/Server Databases”.
5. Patrick Smith et al., “Client/Server Computing”.
6. Larry I.Vaughn, “Client/Server System Design and Implementation”.
7. Alex Berson, “Client/Server Architecture”.
8. Neil Jenkins et al., “Client/Server Unleashed”.
Subject Title: PRINCIPLES OF PROGRAMMING LANGUAGES
This course presents the overview of Language design issues , data types, sequence control,
inheritance, logic programming.
Goal:
To enable the students to learn the basic functions, principles and concepts of Principles of
Programming Languages.
Objectives:
• Understood the Language design Issues, data types, sequence control and inheritance,
logic programming
Contents:
UNIT I
Language design Issues: The structure and operation of computer-virtual computers and
binding times - language paradigms. Language Translation Issues: Programming language
syntax - stages in translation-formal translation models.
UNIT II
Data types: Properties of types and objects - elementary data types - structured data types.
Abstraction: Abstract data types - encapsulation by subprograms - type definitions - storage
management.
UNIT III
Sequence Control: Implicit and explicit sequence control - sequencing with arithmetic and
non-arithmetic expressions - sequence control between statements. Subprograms Control:
Subprogram sequence control-attributes of data control-shared data concepts.
UNIT IV
Inheritance: Inheritance - polymorphism. Advances in language design: Variations on
subprogram control - language constructs for parallel processing - language semantics -
software architecture.
UNIT V
Logic Programming: Formal logical systems -PROLOG. Functional Programming: Features
of functional languages -LISP - Implementing functional languages.
REFERENCE BOOKS
1. Terrance W.Pratt, Marvin V Zelkowitz, "Programming Languages, Design and

Implementation”, Pearson education, 2001, (4rd edition).
2. D. Appleby, J.J. VandeKopple, "Programming languages - Paradigm and practice", McGraw
Hill, International Editions, (2nd edition), 1997.
3. A.B.Tucker, "Programming languages", McGraw Hill.
Subject Title: SPEECH PROCESSING
Course Number: 07CSEAE28 Number of Credits : 4
This course presents the overview of signals and System, fundamentals of speech recognition,
pattern and homomorphism
Goal:
To enable the students to learn the basic functions, principles and concepts of Speech
processing.
Objectives:
• Understood signals and Systems
• Understood the Fundamentals of speech recognition, patterns, speech processing
Contents:
Unit – I
Overview of signals and Systems – Review of One-dimensional and two dimensional signal
processing and discrete Fourier transforms and digital filters – domain models for speech
processing.
Unit-II
Fundamentals of speech recognition. The speech signal – production, perception and
Acoustic-Phonetic characterization .Signal processing and analysis methods for speech
recognition: Bank-of-filters-front-end processor-linear predictive coding model for speech
recognition- vector quantization – auditory based spectral analysis models.
Unit – III
Pattern – comparison techniques. Speech recognition system analysis and implementation
issues: Application of source- coding techniques- template training methods- performance
analysis and recognition enhancements.
Unit-IV
Homomorphic speech processing -Speech Recognition Algorithm: Pattern Recognition based
and knowledge based – Discrete utterance and continuous speech recognition systems –
Principles of speaker recognition - projects
Unit-V
Speech recognition based on connected word models-Large vocabulary continuous Speech
recognition – Task oriented applications of automatic speech recognition.
REFERENCE BOOKS
1. Rabiner & Schaffer, “Digital processing of speech signals”, Prentice Hall, 1980.
2. Lawrence Rabiner, “Fundamentals of Speech recognition”, Prentice Hall
3. Samuel D.Stearns and Ruth A. David, “Signal Processing algorithms”, Prentice Hall
of India, 1988.
4. D.Shanghessuy, “Speech Communication”, Prentice Hall, 1987.
Subject Title: IMAGE PROCESSING

This course presents the Introduction, image enhancement, image filtering and restoration,
image data compression and image segmentation.
Goal:
To enable the students to learn the basic functions, principles and concepts of Image
processing.
Objectives:
• Understood the Image processing.
• Understood the image enhancement, image filtering and restoration
Contents:
UNIT I
Introduction: Fundamental Steps in Image processing – Elements – Digital Image
Fundamentals – Image representation – Modeling – Image enhancement – Image restoration
– Image analysis – Image reconstruction from projections – Image data compression – Two-
Dimensional Systems and Mathematical Preliminaries: Notation and definitions – Discrete
and Fast Fourier Transform
UNIT II
Image Enhancement: Point operations – Enhancement by point processing – Histogram
modeling – Spatial operations – Enhancement in Frequency Domain – Transform operations
– Multispectral Image Enhancement – Color Image Enhancement
UNIT III
Image Filtering and Restoration: Degradation model – Diagonalization of circulant and block
circulant matrices - Algebriac approach to restoration – Inverse and Wiener filtering – Finite
impulse response Wiener filters – Other Fourier Transform Filters – Smoothing splines and
Interpolation – Least square filters – Recursive and semirecursive filtering – Maximum
entropy restoration – Bayesian methods – Coordinate transformation and Geometric
correction – Blind deconvolution – Extrapolation of band-limited signals
UNIT IV
Image Data compression: Fundamentals – Image compression models – Elements of
information theory – Pixel coding – Predictive techniques – Transform coding theory –
Transform coding of images – Hybrid coding and vector DPCM – Inter frame coding –
Image coding in the presence of channel errors – Coding of two tone images – color and
multi-spectral Image coding – Lossless and lossy compressions - standards
UNIT V
Image Segmentation – Representation and Description – Recognition – Interpretation –
Image analysis and Computer vision – Image reconstruction from Projections – Artificial
Neural networks for color classification - Realization for real time processing – Three-
dimensional Filters
REFERENCE BOOKS
1. Anil K. Jain, “Fundamentals of Digital Image Processing”, Second Edition, Prentice-
Hall of India Private Limited, New Delhi, 1995.
2. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Addison-
Wesley Publishing Company, Newyark, 1993.
3. Maher A. Sid-Ahmed, “Image Processing – Theory, Algorithms and Architectures”,
McGraw Hill, Inc, Newyark, 1995.
Subject Title: COMPUTER PERIPHERALS AND INTERFACING

This course presents the Digital recording, typical specification of magnetic tape drive, video
terminal, S-100 and IEEE 488 and interfacing Non TTL voltages.
Goal:
To enable the students to learn the basic functions, principles and concepts of Computer
Peripherals and Interfacing.
Objectives:
• Understood the Computer Peripherals and Interfacing.
• Understood the Digital recording, typical specification of magnetic tape and so on.
Contents:
UNIT I
Digital recording – RZ – RB – NRZ – MFM – MFM methods and their comparison –
Features of floppy disc drive – data formats – Typical interface signals between floppy disc
drive and floppy disc controller – Functional description – Intel 8271 FDC operation – Hard
disc – Theory of operation – Track division – Control sections of hard disk – Disk drive
commands – Seek operation – Head selection – Read/Write section – Typical interface status
signals
UNIT II
Typical specification of magnetic tape drive – operational details – Interfacing signals with
main computer – Dot-matrix printers – Theory of operation – Input, Output signals – Typical
handshaking/Control Signals – Intel 8295 dot matrix printer controller
UNIT III
Video terminal – interfacing to a TV receiver – Generating horizontal sync., blanking pulses
– vertical sync. And blanking pulses – Character generation – Formatting the display 8275
CRT Controller
UNIT IV
S-100 and IEEE 488 – parallel buses – RS 232C serial bus and 20 MA current loop –
Generation of system control signals – Interfacing keyboard and a remote device to S-100 bus
– Serial vs Parallel interface – parallel to serial conversion – Intel 8251 USART
UNIT V
Interfacing Non TTL voltages – Interfacing to keyboards – keyboard encoder – Interfacing a
scanned seven-segment display – Intel 8279 keyboard controller
REFERENCE BOOKS
1. James W. Coffron, “Practical Interfacing Techniques for Microprocessor System”,

Prentice Hall, 1983.
2. Redone Zaka and Auston Lesca, “Microprocessor Interfacing Techniques”, Sybex
Publications, (3rd edition), 1973.
Subject Title: NEURAL NETWORKS

This course presents the introduction, the basic neuron, kohenen self- organizing network,
hop field networks, associative memory.
Goal:
To enable the students to learn the basic functions, principles and concepts of Neural
Networks.
Objectives:
• Understood the pattern classification in Neural Networks
• Understood the Self-organizing Network and Hopfield Networks
Contents:
UNIT I
Introduction: Humans and Computers – The structure of brain – Learning in machines – The
differences - Pattern Recognition: Introduction – Pattern recognition in perspective – Pattern
recognition – a definition – Feature vectors and feature space – Discriminant functions –
Classification techniques – Linear classifiers – Statistical techniques – Pattern recognition: a
summary
UNIT II
The Basis Neuron: Introduction – Modelling the single neuron – Learning in simple neurons
– The perceptron: a vertical perceptive – The perceptron learning rules – Proof – Limitations
of perceptron
UNIT III
Kohenen Self-organizing Network: Introduction – the Kohenen algorithm – Weight training –
Neighbourhoods – Reducing the neighbourhood – Learning vector quantization – The
phonetic type writer
UNIT IV
Hopfield Networks: The Hopfield model – The energy landscape – The boltzman machine –
Constraint satisfaction – Adaptive resonance memory: Adaptive resonance theory –
Architecture and operations - ART algorithm – Training the ART network – Clarification –
Conclusion – Summary of ART
UNIT V
Associative Memory: Standard computer memory – Implementing associative memory –
Implementation in RAMs, FAMs & n-tupling – Willshaw’s associative networks
REFERENCE BOOKS
1. P.D. Wasserman, “Neural Computing: Theory and Practice”, Van Nostran

Reinhold, New York, 1991.
2. Limin Fu, “Neural Network in Computer Intelligence”, McGraw Hill International
Editions, 1994.
3. R. Beale, T. Jackson and Adam Hilger, “Neural Computing: An introduction”,
Addison Wesley, 1990.
Subject Title: DATA MINING

This course presents the introduction to data mining; clustering techniques, web mining,
temporal and sequential data mining.
Goal:
To enable the students to learn the basic functions, principles and concepts of Data Mining
Objectives:
• Understood the data mining techniques, classification and web mining.
Contents:
UNIT I
Introduction – Data mining as a subject – Data warehousing: Introduction – Definition –
Multidimensional data model – OLAP operations – Warehouse schema – Data Warehousing
architecture – Warehouse server – Meta data – OLAP engine – Data Warehouse Backend
process – Other features
UNIT II
Data mining: Introduction – Definitions – KDD vs. Data Mining – DBMS vs. DM – DM
techniques – Association Rules: Concepts – Methods to discover Association rules – A priori
algorithm – Partition algorithm – Pioneer search algorithm – Dynamic Item set Counting
algorithm – FP-tree growth algorithm – Incremental algorithm – Border algorithm –
Generalized association rule
UNIT III
Clustering techniques: Clustering paradigms – Partitining algorithm – K-Medeoid algorithms
– CLARA – CLARANS – Hierarchical clustering DBSCAN – BIRCH – CURE – Categorical
clustering algorithms – STIRR – ROCK – CACTUS – Other techniques: Introduction to
neural network – Learning in NN – Genetic algorithm – Case studies
UNIT IV
Web mining: Basic concepts – Web content mining – Web structure mining – Web usage
mining – text mining – text clustering
UNIT V
Temporal and Sequential Data mining: Temporal Association rules – Sequence Mining – The
GSP algorithm – SPADE – SPIRIT – WUM – Spatial mining – Spatial mining tasks – Spatial
clustering – Spatial trends
REFERENCE BOOKS
1. Arun K. Pujari, “Data mining Techniques”, Universities Press (India) Limited,

Hyderabad, 2001.
2. Pieter Adriaans, Dolf Zantinge, “Data Mining”, Addison Wesley, 1998.
Subject Title: ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS
Course Number: 07CSEAE33 Number of Credits: 4

This course presents the introduction to Problem solving and AI, state space search methods,
problem reduction, predicate calculus in problem solving, expert systems.
Goal:
To enable the students to learn the basic functions, principles and concepts of Artificial
intelligence and expert systems
Objectives:
• Understood the Artificial intelligence and expert systems
• Learnt the Heuristic techniques and reasoning
Contents:
UNIT I
Problem solving and AI – Puzzles and Games – Problem States and Operators – Heuristic
programming – state space representations – state descriptions – graph notations – non-
deterministic programs.
UNIT II
State space search methods – breadth first and depth first search – heuristic – admissibility –
optimality of algorithms – performance measures – problem reduction representations –
AND/OR graphs and higher level state space.
UNIT III
Problem reduction search methods – cost of solution trees ordered search – alpha beta and
minimum procedure – theorem proving in predicate calculus – syntax, semantics – Herbrand
universe: variables, qualifiers, unification, resolvents.
UNIT IV
Predicate calculus in problem solving – answer extraction process – resolution – automatic
program writing – predicate calculus – proof finding methods.
UNIT V
Expert systems: Expert systems and conventional programs – expert system organization –
Knowledge engineering: knowledge representation techniques – knowledge acquisition –
acquiring knowledge from experts – automating knowledge acquisition. Building an expert
system: Architecture of an expert system – ask in building an expert system – difficulties in
developing an expert system.
REFERENCE BOOKS
1. E. Charnail, C. K. Reiesbeck and D. V. Mcdermett, “Artificial Intelligence

Programming”, Lawrence Erlbaum Associates, N.J., 1980.
2. N. J. Nilson, “Principles of Artificial Intelligence”, Tiega Press, Polo Alto, 1980.
Elain Rich and Kevin Knight, “Artificial Intelligence”, McGraw Hill, 1991.
3. Donald A. Waterman, “A Guide to Expert Systems”, Tech-knowledge series in
knowledge engineering, 1986.
Subject Title: PARALLEL PROCESSING

Subject Description: This course presents the introduction to parallel processing, memory
and input/ output system, pipeline computers, array processors, multiprocessor architecture.
Goal:
To enable the students to learn the basic functions, principles and concepts of Parallel
processing.
Objectives:
• Understood the parallel processing
• Understood the pipeline computers, array processors, multiprocessor architecture
Contents:
UNIT I
Introduction to parallel processing – definition and functions of parallel processing – uni-
processor and parallel processing systems – parallel computers – pipeline computers – array
processor – multiprocessor systems – performance of parallel computers – application of
parallel processor.
UNIT II
Memory and input/output system – memory system for parallel processor computers –
hierarchical memory structures – virtual memory system – paged system – segmented system
with paged segments – memory management policies – fixed partitioning and variable
partitioning – cache memories and management – characteristics of cache memories – cache
memory organization – input/output subsystem – characteristics of I/O subsystem – Interrupt
Mechanism and special hardware – I/O processor and channel architecture.
UNIT III
Pipeline computers – principles of linear pipelining – pipelined structures of a typical central
processing unit – classification of pipeline processors – interleaved memory organization – S
access memory organization – C access memory organization – C & S access memory
organization – Static & dynamic pipelining – principles of designing static pipeline
processors – Instruction prefetch and branch handling – data buffering and busing structures
– Internal forwarding and register tagging – vector processing – requirements and
characteristics of pipelined vector processing methods.
UNIT IV
Array Processors – Single Instruction stream – Multiple data stream – SIMD processors –
Types of SIMD computer organization – Array processor organization and associative
processors – Array processor computer organization – SIMD interconnection networks –
Static and Dynamic networks – Linear array, mesh, ring, star, tree, systolic, completely
connected, chordal ring and cube networks – Parallel algorithms for array processors – SIMD
matrix multiplication – Parallel sorting on array processors.
UNIT V
Multiprocessor architecture – Functional structures of a multiprocessor system loosely and
tightly coupled multiprocessor – Processor characteristics of multiprocessing – Inter
processor communication mechanism – Instruction set – Interconnection networks – Time
shared or common bus – cross bar switch and multi port memories and multistage networks
for multiprocessor – Parallel memory organization – Interleaved memory configurations –
classification of multiprocessor operating system.
REFERENCE BOOK
1. Kai Hwang & Faye A.Briggs, “Computer Architecture and Parallel Processing”, Prentice
Hall of India, 1985.
Subject Title: DISTRIBUTED SYSTEMS
This course presents the introduction to distributed systems, design considerations,
client/server network model, and distributed database.
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, Client/Server Network Model
and Distributed databases.
Contents:
UNIT I
Distributed Systems: Fully distributed processing systems – Networks and Interconnection
structures – Designing a Distributed Processing System.
UNIT II
Distributed Systems: Pros and Cons of Distributed processing – Distributed databases – the
challenge of distributed data – loading factors – managing the distributed resources – division
of responsibilities.
UNIT III
Design Considerations: Communications line loading – Line loading Calculations –
Partitioning and allocation – Data flow systems – dimension analysis – network database
design considerations – ration analysis – database decision trees – synchronization of network
databases.
UNIT IV
Client/Server Network Model: Concept – file server – printer server – an e-mail server.
UNIT V
Distributed Databases: An overview – Distributed Databases – Principles of Distributed
Databases – levels of transparency – Distributed Database Design – The R* Project
Technique Problems of Heterogeneous Distributed Databases.
REFERENCE BOOKS
1. John A. Sharp, “An Introduction to Distributed and Parallel Processing”,

Blackwell Scientific Publications, 1987.
2. Uyless D. Black,“Data Communications & Distributed Networks”.
3. Joel M. Crichllow, “Introduction to Distributed & Parallel Computing”.
4. Stefans Ceri, Ginseppe Pelagatti, “Distributed Databases Principles and systems”,
McGraw Hill Book Co., New York, 1985.
Subject Title: SECURITY IN COMPUTING

This course presents the introduction, secure encryption systems, security, security programs,
and design of secure OS.
Goal:
To enable the students to learn the basic functions, principles and concepts of security in
computing.
Objectives:
• Understood the security problems
• Understood secure encryption systems
Contents:
UNIT I
Introduction: Security Problem in Problem Solving – Kinds of security breaches – People
involved – Methods of defense – Plane of attack. Encryption and Decryption: Terminologies
and Background – Methods – Mono alphabetic sub ciphers – Ply alphabetic sub ciphers –
Transpositions – Fractions morse code – Stream and block ciphers – characteristics of good
ciphers – Role of cryptanalyst.
UNIT II
Secure Encryption systems: NP complete problems – Properties of Arithmetic – Public key
systems – Merkle-Hellman knapsacks – Invest – Shamir – Adelman encryption – Single key
systems – Encryption standard – Uses of encryption – Enhance Cryptographic Security.
UNIT III
Security involving programs: Information alless problems – Service problems – Program
development control against program attacks – OS control on use of program –
Administrative controls. Protection Services: Security methods of OS – Memory and
addressing – File protecting mechanisms – User authentication.
UNIT IV
Design of secure OS: Models of securities – Separation. Isolation, kernel, layered design, ring
structures – penetration of OS – classification of secure OS – examples.
UNIT V
Levels of Security: Database security – Personal computer security – Computer network
security – Communication Security.
REFERENCE BOOK
1. Charles P.Pfleeger, “Security in Computing”, Prentice Hall, 1989.

Subject Title: KNOWLEDGE BASED SYSTEMS

This course presents the introduction to KBS, Use of Non classical logic, Production,
Functional approach to knowledge processing, Programming languages.
Goal:
To enable the students to learn the basic functions, principles and concepts of knowledge
based systems.
Objectives:
• Understood the knowledge-based systems rule based systems
• Understood the knowledge processing
Contents:
UNIT I
Introduction - knowledge base - knowledge base systems - Current Developments -
definitions - Knowledge representation, formalisms Database - Conventional Database -
Management systems - Limitations of existing DBMS - fifth generation DBMS formal
logic – pro-positional logic - First order predicate logic and automated theorem proving.
Logic and database systems.
UNIT II
Use of Non-classical logics - Many - sorted logics - Situational logic - Non-monotonic logic
- Many - valued logics - Fussy logic - Modal logic Temporal logic - Epistemic logic - Type
theoretic language and intersectional logic - Theories for dealing with uncertainty.
UNIT III
Production - rule based systems - Introduction - Approaches to problem - solving - Search
strategies - rule based expert systems - Slot and filler knowledge Representations - Semantic
Nets - Frame base systems - Scripts Conceptual dependency.
UNIT IV
Functional Approach to knowledge processing - Lambda calculus - Mc-Carthys’s approach -
database query language Data Definition and Manipulation language.
UNIT V
Programming languages and knowledge processing - Syntax - Recognizer - Contextual
constraints - Semantics - Translation - Interpreters - PS - ALGOL - Special purpose
Hardware for knowledge processing.
REFERENCE BOOK
1.Richard Frost, "Introduction of knowledge Base Systems", Macmillan Publishing

Company.
Subject Title: PARALLEL ALGORITHMS
This course presents the introduction, basic techniques, searching, graphs and randomized
algorithms.
Goal:
To enable the students to learn the basic functions, principles and concepts of Parallel
algorithms.
Objectives:
• Understood the Parallel models and algorithms.
• Understood Randomized algorithms
Contents:
UNIT I
Introduction – parallel models- performance of parallel algorithms- the work time
presentation framework of parallel algorithms- optimality notion.
UNIT II
Basic techniques – balance trees, pointer jumping, divide & conquer, pipelining, accelarated
cascading, symmetry breaking. Lists – trees.
UNIT III
Searching, merging and sorting
UNIT IV
Graphs, Planar geometry.
UNIT V
Randomized algorithms.
REFERENCE BOOKS
1. Joseph Jaja, “An introduction to parallel algorithms, Addison Wesley Publishing

Company.
2. Michael J. Quinn, “Parallel Computing Theory And Practice” (2nd edition), McGraw
Hill, 1994.
Subject Title: MANAGEMENT CONCEPTS AND COMMUNICATIONS

This course presents the management, organizing, directing, communication and written
communication.
Goal:
To enable the students to learn the basic functions, principles and concepts of management
concepts and communication.
Objectives:
• Understood the meaning and functions of management
• Understood organizing, directing, communication and written communication.
Contents:
Unit I
Management - Meaning and Functions- Management and Administration - management as an
art, Science and Profession – Management Hierarchy – Management process: POSDCORB –
Planning-Steps – Types – Premises –Forecasting – Objectives - M.B.O.
Unit II
Organising - Structure – Departmentation - Span of Management - Authority and
Responsibility – Delegation of Authority and Decentralisation – Making Effective Delegation
– Line and Staff relationship – Formal and Informal Organisation.
Unit III
Directing: -Meaning- Procedure – Principles, Leadership: Styles – Qualities of Leader –
Motivation: Theories of Maslow, Herzberg, Mcgregor, Vroom and Mcieland - Incentives.
Controlling Types - Budgetary and Non-budgetary Control Techniques – Staffing:
Selection and Recruitment – Training and Development – Performance Appraisal.
Unit IV
Communication- Meaning and importance – Principles objectives – Process of
communication – Types: Formal Vs Informal; Written Vs Oral; Downward Vs Upward;
Horizontal Vs Vertical; Grapevine – Communication Media. Barriers to Communication -
Overcoming barriers.
Unit V
Written Communication - Effective Drafting - Business letters- Layouts of business letter –
Drafting letters for Sales and Collection. Oral Communication: Interviews - Telephone
Conversation - Instruction – Dictation – Non Verbal Communication – Body Language –
Conducting Meetings: Notice , Agenda , Minutes.
REFERENCE BOOKS
1. Management – Koontz and Werich
2. Effective Business Communication – Asha Kual – P H I
3. Principles of Management – Tripathy and Reddy- Tata Mcgraw Hill
4. Principles of Practice of Management, L.M. Prasad- Sultan chand and Sons
5. Essentials of Business Communication Skills. Rajendran Paul and Korala Lalli
6. Developing Communication Skills, Krishna Mohan and Meera Banejee Mcmillan
India.
Subject Title: DATA COMPRESSION
This course presents the information and coding, Huffman coding, Predictive coding,
Compression of still Images, fourier analysis.
Goal:
To enable the students to learn the basic functions, principles and concepts of Data
compression.
Objectives:
• Understood the Data compression
• Understood the Huffman coding, Predictive coding, Compression of still Images,
fourier analysis.
Contents:
UNIT – I
Information and Coding: Information and Entropy – Noiseless and Memoryless Coding-
Shannon – Fano Coding: Shannon Coding – Shannon-Fano Coding.
UNIT – II
Huffman Coding – Arithmetic Coding - Dictionary Techniques - Sampling and Quantization
UNIT – III
Predictive Coding: Delta Modulation – Differential Pulse Code Modulation
Transform Coding: Defining a Transform – Interpretation of Transforms – Karhenun-Loeve
Transform – Hadamard Transform – Discrete Wavelet Transform
Subband Coding: Downsampling and Upsampling – Bit Allocation
UNIT – IV
Compression of Still Images: JPEG – The Baseline System – Progressive DCT-based Mode
of Operation – Hierarchical Mode of Operation – Sequential Losses Mode of Operation
Video Image Compression: MPEG – MPEG-1, MPEG-2, MPEG-4 and MPEG-7
UNIT – V
Fourier Analysis: Fourier Series – The Fourier Transform – The Discrete Fourier Transform
- The Sampling Theorem
Wavelets: Wavelet Transforms – Multiresolution Analysis
REFERENCE BOOKS
1. Adam Drozdek, “Elements of Data Compression”,Vikas Publishing House, 2002

2. Mark Nelson, Jean-Loup Gailly, “The Data Compression Book”, BPB Publication,
Second Edition, 1996.
Subject Title: EMBEDDED SYSTEMS AND REAL TIME OPERATING SYSTEMS
This course presents the hardware fundamentals, interrupts and software architecture,
concepts of RTOS and software tools.
Goal:
To enable the students to learn the basic functions, principles and concepts of Embedded
Systems and Real Time Operating.
Objectives:
• Understood the Embedded Systems and Real Time Operating system concepts
Contents:
UNIT I: HARDWARE FUNDAMENTALS
Hardware Fundamentals: Terminology- Gates- Timing Diagrams-Memory.
Advanced Hardware Fundamentals: Microprocessors-Microprocessor architecture- Direct
Memory Access- Conventions used on Schematics.
UNIT II: INTERRUPTS & SOFTWARE ARCHITECTURE

Interrupts: Interrupt Basics- Interrupt Service Routines.
Survey of software Architectures: Round Robin with Interrupts- Function-Queue- Scheduling
Architecture- Real Time Operating Systems Architecture.
Introduction to Real Time Operating Systems – Selecting an RTOS- Tasks and Task States-
Tasks and Data- Semaphores and Shared Data.
UNIT III: CONCEPTS OF RTOS

MORE Operating Systems Services: Interrupt PROCESS Communication- Message Queues,
Mailboxes and Pipes – Timer Functions- Events-Memory Management-Interrupt Routines in
an RTOS Environment.
Basic Design Using a Real Time Operating Systems : Principles- Encapsulating Semaphores
and Queues-Hard Real Time Scheduling Considerations-Saving Memory Space and Power-
Introduction to RTL & QNX.
UNIT IV: SOFTWARE TOOLS

Embedded Software Development Tools: Hosts and Target Machines- Linker/Locators for
Embedded Software –Getting Embedded Software into the Target Systems.
Debugging Techniques: Testing on your Host Machine-Instruction Set Simulators- The
Assert Macro- Using Laboratory Tools.
UNIT V: CASE STUDY

Case Studies.
REFERENCE BOOK
1. David.E.Simson, “An Embedded Software Primer”, Addisons-Wesley- 2001
Subject Title: SOFTWARE TESTING
Course Number: 07CSEAE42 Number of Credits:4
Subject Description
This course provides principles of Software Testing and about tools.
Goal :
To enable the students to learn about the principle and tools of Software testing.
Objectives :
On successful completion of the course the students must have
• understood the concepts of Software testing
• got the skill of software testing
• exposed to software testing tools.
Contents
UNIT I
Purpose of Software testing – Some Dichotomies – a model for testing – Playing pool and
consulting oracles – Is complete testing possible – The Consequence of bugs – Taxonomy of
Bugs.
UNIT II
Software testing Fundamentals – Test case Design – Introduction of Black Box Testing and
White Box testing – Flow Graphs and Path testing – Path testing Basics - Predicates, Path
Predicates and Achievable Paths - Path Sensitizing – Path Instrumentation – Implementation
and Application of Path Testing.
UNIT III
Transaction Flow testing – Transaction Flows – techniques – Implementation Comments –
Data Flow Testing – Basics – Strategies – Applications, Tools and effectiveness – Syntax
Testing – Why, What, How – Grammar for formats – Implementation – Tips.
UNIT IV
Logic Based Testing – Motivational Overview – Decision tables – Path Expressions – KV
Charts – Specifications – States, State Graphs and transition Testing – State Graphs – Good
& bad states – state testing Metrics and Complexity.
UNIT V
Testing GUIs – Testing Client – Server Architecture – Testing for Real-time System – A
Strategic Approach to Software testing – issues – unit testing – Integration Testing –
Validation testing – System testing – The art of Debugging.
REFERENCES:
1. Boris Beizer, Software testing techniques, Dreamtech Press, Second Edition – 2003.
2. Myers and Glenford.J., The Art of Software Testing, John-Wiley & Sons,1979
3. Roger.S.Pressman, Software Engineering – A Practitioner’s Approach ,Mc-Graw Hill,
5th edition, 2001
4. Marnie.L. Hutcheson, Software Testing Fundamentals, Wiley-India,2007
Subject Title: DATA WAREHOUSING
This course presents the introduction, database schemas, metadata, security, capacity
planning.
Goal:
To enable the students to learn the basic functions, principles and concepts of data
warehousing.
Objectives:
• Understood the data warehousing
• Understood the database schemas and metadata
Contents:
Unit I
Introduction – Delivery process – System processes – Process architecture
Unit II
Database Schema – Partitioning strategy – Aggregations – Data Marting
Unit III
Metadata – System and Data warehouse process managers - Hardware architecture – Physical
layout
Unit IV
Security – Backup recovery – Service level agreement – Operating the data warehouse
Unit V
Capacity planning – Tuning the Data warehouse – Testing the Data warehouse – Data
warehouse futures
REFERENCE BOOK
1. “Data warehousing in the real world”, Sam Anahory, Dennis murray, Pearson
education, 2003
Subject Title: CRYPTOGRAPHY
This course presents the introduction cryptography, techniques, cryptographic algorithms,
pseudorandom sequence, public key algorithm.
Goal:
To enable the students to learn the basic functions, principles and concepts of cryptography.
Objectives:
• Understood the foundations and techniques of data cryptography.
Contents:
Unit I
Foundations – Protocol Building Blocks – Basic Protocols – Intermediate Protocols –
Advanced Protocols – Esoteric Protocols
Unit II
Techniques – Key length – Key Management – Algorithm types and modes – Using
algorithms
Unit III
Cryptographic Algorithm – Mathematical Background – Data Encryption Standards (DES) –
Other Block Ciphers – Still other Block Ciphers – Combining Block Ciphers
Unit IV
Pseudo random sequence generators and streams ciphers – Other stream ciphers and real
random sequence generators – One way hash function
Unit V
Public key algorithm – Public key digital signature algorithm – Identification schemes – Key
exchange algorithm – Special algorithm for protocol – Example implementation
REFERENCE BOOK
1. “Applied cryptography”, Schiener, Wiley Publications.

Subject Title: VB and NET

This course presents the introduction to VB and .NET, functions, monitoring mouse activity,
overview of .NET, .NET framework.
Goal:
To enable the students to learn the basic VB.NET and concepts of arrays
Objectives:
• Understood VB.net programming
Contents:
Unit I
Getting started – visual basic environment and help systems – customizing a form and writing
simple programs – first step in building the UI – First steps in programming – Displaying
information – controlling program flow – built in functions
Unit II
Writing your own functions and procedures – organizing information via code – organizing
information via controls – building larger projects – VB objects and an introduction to object
oriented programming – Finishing the interface – tools and techniques for testing, debugging
and optimization – Graphics
Unit III
Monitoring mouse activity – basic file handling – file system controls and file system objects
– communicating with other window applications – recursion – database development with
VB – Building ActiveX controls – VBscript and DHTML – packaging and deployment
Unit IV
An overview of .NET – Web services - The common language runtime - .NET languages –
events and delegates
Unit V
The .NET framework class library – Accessing data: ADO.NET – Building web applications:
ASP.NET - .NET my services
REFERENCE BOOKS
1. “Visual Basic 6 from the Ground Up”, Gary cornell, TMH, 1999
2. “Understanding .NET”, David Chappell, Pearson education, 2002
3. “Introducing Microsoft .Net”, David.S.Platt, PHI, 2003
Subject Title: NATURAL LANGUAGE PROCESSING

This course presents the introduction to natural language understanding, grammar for natural
language, linking syntax and semantics, knowledge representation and conversational agent.
Goal:
To enable the students to learn the basic functions, principles and concepts of Natural
Language Processing.
Objectives:
• Understood the Natural Language Processing, grammars, syntax and semantics,
knowledge representation etc.,.
Contents:
Unit I
Introduction to Natural language understanding – Linguistic background – Grammars and
Parsing – Features and Augmented grammars
Unit II
Grammars for Natural Languages – Towards Efficient Parsing – Ambiguity Resolution
Statistical Methods – Semantics and Logical forms
Unit III
Linking Syntax and Semantics – Resolution – Strategies for Semantic Interpretation –
Scoping and interpretation of noun phrases
Unit IV
Knowledge Representation and Reasoning – Local Discourse Context and Reference – World
Knowledge – Discourse Structure
Unit V
Conversational Agent – Logic and Natural Language – Model – Theoretic Semantics –
Semantics of Set Theoretic Models
REFERENCE BOOK:
1. “ Natural Language Understanding”, James Allen, Second Edition, Pearson
Education, 2003
Subject Title: VIRTUAL REALITY

This course presents the introduction Virtual reality, Human vision, Geometrical
Transformation, physical simulation and vr software
Goal:
To enable the students to learn the basic functions, principles and concepts of Virtual Reality.
Objectives:
• Understood the Virtual Reality environments and human perspectives.
Contents:
Unit I
Virtual Reality and Virtual Environments – Introduction – Computer graphics – Real Time
Computer Graphics – Flight Simulation – Virtual Environment – Benefits of Virtual Reality –
Historical Development of VR – Introduction – Scientific Landmarks – 3D computer graphic
– Virtual world space – Positioning the virtual observer – Perspective projection
Unit II
Human vision – Stereo perspective projection – 3D Clipping – Colour theory – Simple 3D
modeling – Illumination models – Reflection models – Shading algorithm – Radiocity –
Hidden Surface Removal – Realism – Stereographic images – Geometric Modeling – From
2D to 3D – 3D Space Curves – 3D Boundary Representation – Other Modeling Strategies
Unit III
Geometrical Transformations – Frames of reference – Modeling Transformations – Instances
– Picking – Flying – Scaling the VE – Collision Detection – Generic VR System – Virtual
Environment – Computer Environment – VR Technology – Modes of Interaction – VR
Systems – Animating the Virtual Environment – Dynamics of Numbers – Animation of
Objects – Shape and object intertwining – Freeform Deformation – Particle Systems
Unit IV
Physical Simulation – Objects falling in a gravitational field – Rotating Wheels – Elastic
Collision – Projectiles – Simple Pendulums – Springs – Flight Dynamics of an aircraft –
Human Factors – Equilibrium – Virtual reality hardware – Sensor Hardware – Head –
Coupled Displays – Acoustic Hardware – Integrated VR Systems
Unit V
VR software – Modeling Virtual Worlds – Physical Simulation – VR Toolkits – Virtual
Reality Applications – Engineering – Entertainment – Science – Training – The Future.
REFERENCE BOOK
1. “Virtual Reality Systems”, John Vince, Pearson Education, 2002

Subject Title: WEB SERVICES

This course presents an Overview of Distributed Computing, XML, web services
Goals:
To enable the student to be familiar with distributed services, XML and web services
Objectives:
On successful completion of the course the student should have:
• Understood the concepts of web services
Contents:
Unit - I
Introduction to web services – Overview of Distributed Computing- Evolution and
importance of web services-Industry standards, Technologies and concepts underlying web
services-Web services and enterprises-web services standards organization-web services
platforms.
Unit - II
XML Fundamentals – XML documents - XML Namespaces- XML Schema –Processing
XML
Unit - III
SOAP: The SOAP model- SOAP messages-SOAP encoding- WSDL: WSDL structure-
interface-definitions-bindings-services-Using SOAP and WSDL-UDDI: About UDDI- UDDI
registry-Specification- Core data structures-Accessing UDDI
Unit - IV
Advanced web services technologies and standards: Conversations overview-web services
conversation language-WSCL interface components.
Workflow: business process management-workflows and workflow management systems
Security: Basics-data handling and forwarding-data storage-errors-Web services security
issues.
Unit - V
Quality of Service: Importance of QoS for web services-QoS metrics-holes-design patterns-
QoS enabled web services-QoS enabled applications.
Web services management-web services standards and future trends.
Reference Books:
1. Sandeep Chatterjee, James Webber, ‘Developing Enterprise Web Services : An
Architects Guide’, Prentice Hall, Nov 2003.
Subject Title: MULTIMEDIA SYSTEMS
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:
• Understood the Multimedia animation and Desktop Computing.
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 Syatem.
Unit III
Creating Presentation : Script Writing and creating interactive and non interactive
presentation – Linear and Non Linear Editing – Authoring Tools – File Formates SOUND,
VIDEO, ANIMATION, Presentation Images. Multimedia Programming : Text Links – Hyper
Text system – Form Creation – File storing - Error Traping.
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.
Subject Title: TCP/IP

This course presents the introduction to inter networking concepts, Internet protocol, routing
and routed protocol, TCP over ATM network and applications.
Goal:
To enable the students to learn the basic functions, principles and concepts of TCP/IP.
Objectives:
• Understood the inter networking concepts and internet protocols
Contents:
UNIT I
Introduction: Inter Networking concept – Application level – Network level Interconnection
– Internet Architecture – Routing Concept – Inter Connection through IP Routers, Internet
Addresses Mapping Internet Addresses to Physical Addresses (ARP) – implementing ARP -
Determining an Internet Address at start up (RARP)
UNIT II
Internet Protocol: Connection – Less Data – Gram delivery, routing IP datagrams, error and
control messages (ICMP) – Subnet & Super Net Addresses extensions user datagram protocol
(ODP)
UNIT III
Routing and Routed Protocols – Autonomous Systems – Exterior Gateway Protocol Multicast
Addresses – Internet Group Management Protocol (IGMP) and Implementation
UNIT IV
TCP/IP over ATM Networks: ATM, H/W, ATM Cell Transport, Adaption Layer, IP Address
binding in an ATM Network – Logical IP Subnet concept – ATMARP packet format. Socket
Interface: UNIX I/O – Paradigm and Networks I/O – Creating a socket – Inheritance &
Termination connecting sockets to destination addresses – Obtaining information about hosts,
networks, protocols, network services – Bootstraps & Auto configuration – Domain Name
System – Domain IP Address.
UNIT V
Applications: Remote Login (Telnet, Rlogin) – File Transfer & Access (FTP, TFTP, NFS) –
Electronic Mail (822, SMTP, MIME) – Internet Management (SNMP, SNMPV2) – Internet
Security & Firewall Design.
REFERENCE BOOK
1. Douglas E. Comer, “Internetworking with TCP/IP”, Pearson education, 2001.

DIPLOMA PAPER I: Introduction to Open Source Tools

(for the candidates admitted during 2007-08 batch only)
Course Number :
Number of Instruction Hours: 3 Number of Credits: 4
Subject Description :This Course presents the introduction to the open source tools ,
Goals :
To enable the students to learn the Introduction to Linux, Unix networking
programming, PHP programming Basics, and Perl programming.
Objectives :
• Understood the Linux concept
• Understood the Unix networking programming
• Understood the PFP programming Basics
• Understood Perl programming
Contents:
Unit 1: Introduction to Linux – What every Linux users knows- The shell-The X
windows system –Files and Directories.
Unit 2: Viewing Text – Editing Text – Pattern matching, Vi,Ex and Vim editors .
Unit 3: Unix Network Programming-Introduction to TCP/IP: Introduction –The

Transport Layer TCP and UDP.
Elementary sockets: Sockets Introduction, Elementary TCP sockets – I/O

multiplexing – Socket options
Unit 4: PHP Programming Basics
PHP - Introduction, PHP Basics: - Syntax- Variables- Controls and functions-

Strings. Arrays: - Using Arrays, Manipulating Arrays, Associative Arrays
Unit 5: 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 cgi-lib 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.
REFERENCES
1. Linux Ina Nutshell – A desktop Quick Reference – O’Reilly 5th Edition, Ellen sivever,
Aarom weber,Stephen Figgins, Robers Love and Arnold Robbins
2. Linux CookBook 2nd Edition Michael Stutz , SPD Pvt.ltd 2004 edition.
3. PHP 5 and MySQL Bibble Wiley Dream tech India Pvt.ltd 2006 Edition.
4. Perl CookBook –Tom Christinasen & Nathan Torkington , O’Relliy ,SPD Pvt
ltd,2006 Edition.
DIPLOMA PAPER II: Introduction to Open Source Environment

(for the candidates admitted during 2007-08 batch only)
Subject Description : This Course presents the Open Source environment
Goals : To enable the students to learn the Concepts OOP with PHP,PHP and
MySQL/Postgre SQL, Case studies in PHP and Ruby on Rails
Objectives :
• Understood the concepts OOP with PHP
• Understood the concepts of PHP and MySQL/Postgre SQL
• Understood the Open Source Projects case studies in PHP
• Understood the concepts of Ruby on Rails
Contents:
Unit 1: OOP with PHP –Advanced Array functions-Sessons-cookies and HTTP
Unit 2: String and regular Expression function –Files system and System function,
PEAR-Security-Apache Tricks.
Unit 3: PHP and MySQL/Postgre SQL
Unit 4: Open Source Projects- Case studies : Apache Software Foundation, Blender,
CodePlex, Debian, Drupal, Eclipse Foundation, Fedora Project, FreeBSD, GIMP, GNU,
Inkscape, Java, JBoss, LibreSource, Linux, Mozilla Foundation, MySQL, Gaia Ajax Widgets,
NetBSD, OpenBSD, Open-Xchange, OpenOffice.org, OpenSuse, Open solutions alliance,
Open Source Development Labs, Open Source Initiative, Open Source Geospatial
Foundation, PHP, Python, SourceForge, SugarCRM, SugarForge, Zimbra.
Unit 5: Ruby on Rails: How Ruby works - How Rails works Ruby – Informed Rails
Development.
Reference Book
1. PHP 5 and MySQL Bible Wiley Dreamtech India Pvt.ltd 2006 Edition
2. Professional LAMP Linux, Apache,MySQL and PHPs Web Development Wiley
dreamtech 2006 Edition
3 Ruby for Rails, David A Black Dream tech Press 2006
DIPLOMA PAPER III : Advanced Programming in Open Source – PHP
Number of Instruction Hours: 3 Number of Credits: 4

Subject Description : This Course presents the Advanced programming in Open Source
Goals : To enable the students to learn the Concepts PHP in MySQL, AJAX, Smarty,
SOAP, CMS(Joomla)
Objectives :
• Understood the concepts of PHP and My SQL
• Understood the concepts of PHP and AJAX
• Understood the concepts of PHP and Smarty
• 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 CMS’s, Micro CMS, Other Helpful Resources.
Reference Book
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. www.phpfreaks.com - Smarty
4. www.w3schools.com - AJAX
5. www.php.net/manual/en - PHP notes
DIPLOMA PAPER IV. Web Application in PHP Programming-lab
1. Write a program to send an HTML formatted Email with attachment in PHP.

2. Write a program for login authentication using PHP and MySQL .
3. Write a program to upload a file in PHP.
4. Write a program to create a RSS feed using PHP and MySQL .
5. Create a Pay slip for an employee using PHP and MySQL
6. Download a small project module and convert into our Requirement
Example website
1. www.phpclasses.com
2. www.codeguru.com

Mca Syll

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Mca Syll

Hochgeladen von

Copyright:

Verfügbare Formate

Anx.

31 I - MCA (CBCS) 2007-08 Page 1 of 57

1. Eligibility for Admission to the Course

2. Duration of the Course

4. The Medium of Instruction and Examinations

5. Submission of Record Notebooks for Practical Examinations & Project Viva-Voce.

Core 07CSEAC06 II System Analysis And Design 4 0 4 100

Core 07CSEAC11 III Java Programming 2 4 4 100

Core 07CSEAC16 IV Visual Programming 2 4 4 100

Core 07CSEAC19 V Internet Programming And Web Designing 2 4 4 100

Project 07CSEAC21 VI Project Work And Viva Voce 6 150

Total Master of Computer Applications 124 2700

Electives for MCA (CBCS)

DIPLOMA IN OPEN SYSTEMS (DOS)

Web Application in PHP

L – Lecture Hour P – Practical Hour

Subject Title: COMPUTER ORGANIZATION AND ARCHITECTURE

Course Number: 07CSEAC01 Number of Credits: 4

1. M Morris Mano, ‘Computer System Architecture’, Prentice-Hall India, Third

Subject Title: PROGRAMMING IN C

Course Number: 07CSEAC02 Number of Credits : 4

Subject Title: FOUNDATIONS OF COMPUTER SCIENCE

1. Trembley and Manohar, “Discrete Mathematical Structures with Application to

Subject Title: DATA STRUCTURES

Course Number: 07CSEAC04 Number of Credits :4

Subject Title: UNIX PROGRAMMING

Course Number: 07CSEAC05 Number of Credits :4

Subject Title: SYSTEM ANALYSIS AND DESIGN

Subject Title: OPERATING SYSTEMS

Course Number: 07CSEAC07 Number of Credits :4

1. James L.Peterson, Abraham Silberchatz, “Operating System Concepts”, Addison

Subject Title: DESIGN AND ANALYSIS OF ALGORITHMS

Course Number: 07CSEAC08 Number of Credits :4

1. Ellis Horowitz and Sartaj Sahni, “Fundamentals of Computer Algorithms”, 1995.

Subject Title: OBJECT ORIENTED PROGRAMMING

Course Number: 07CSEAC09 Number of Credits :4

1. Stroustrup, “The C++ Programming Language”, (3rd edition), AW.

Subject Title: DATABASE MANAGEMENT SYSTEM

Course Number: 07CSEAC10 Number of Credits: 4

1. Abraham Silberchatz, Henry K.Forth, Sudharshan, “Database system Concepts” – (3

Subject Title: JAVA PROGRAMMING

Course Number: 07CSEAC11 Number of Credits : 4

Subject Title: OBJECT ORIENTED ANALYSIS AND DESIGN

Course Number: 07CSEAC12 Number of Credits : 4

Subject Title: COMPUTER NETWORKS

Course Number: 07CSEAC13 Number of Credits: 4

Subject Title: SOFTWARE ENGINEERING

Course Number: 07CSEAC14 Number of Credits: 4

Subject Title: COMPUTER GRAPHICS

Subject Title: VISUAL PROGRAMMING

Subject Title: SOFTWARE PROJECT MANAGEMENT

1. Mike Cotterell, Bob Hughes, “Software Project Management”, Inclination/Thomas

Subject Title: SYSTEM PROGRAMMING AND COMPILER DESIGN

Subject Title: INTERNET PROGRAMING AND WEB DESIGNING

Subject Title: ENTERPRISE JAVA PROGRAMMING

1.Jamie Jaworskie,”Java 2 Platform Unleashed”, Techmedia SAMS.

Subject Title: E-COMMERCE

1.Bharat Bhasker, “ Electronic Commerce Framework, Technologies and Applications ”,

Subject Title: MICROPROCESSOR AND ASSEMBLY PROGRAMMING

1. Ramesh S. Gaonkar, “ Microprocessor Architecture, Programming and Application with

Subject Title: ENTERPRISE NETWORKING

Subject Title: ENTERPRISE RESOURCE PLANNING