UNIVERSITY OF MADRAS

DEGREE OF MASTER OF COMPUTER APPLICATIONS (M.C.A.)

REVISED REGULATIONS
(Effective from the academic year 2015-2016 onwards)

1. Eligibility for Admission

Candidate who has passed the under-mentioned degree examinations of this University or an
examination of other institution recognized by this University as equivalent thereto provided they
have undergone the course under 10+2+3 or 11+1+3 or 11+2+2 pattern or under the Open
University System, shall be eligible for admission to the M.C.A. Degree Course.

(a) B.C.A/B.E.S/B.Sc. in Computer Science/Mathematics/Physics/ Statistics / Applied

Sciences OR (b) B.Com / Bachelor of Bank Management/B.B.A/B.L.M/B.A Corporate
Secretary-ship / B.A. Economics/ any other Bachelor‟s Degree in any discipline with Business
Mathematics and Statistics or Mathematics/Statistics in Main/Allied level OR (c) B.Sc.
Chemistry with Mathematics and Physics as allied subjects OR (d) B.E/B.Tech./M.B.A OR (e) A
Bachelor‟s Degree in any discipline with Mathematics as one of the subjects at the Higher
Secondary level (i.e. in +2 level of the 10+2 pattern)

2. Duration of the Course

The Course duration shall be three years consisting of six semesters. In order to be
eligible for the award of the degree the candidate shall successfully complete the course in a
maximum period of five years reckoned from the date of enrolment for the first semester of the
course.

3. Structure of the Course and Evaluation Pattern

The duration of University examination for theory and practical subjects shall be 3
hours. The maximum mark for each theory is 100 with 25 for Internal Assessment(IA) and 75
for University Examination. The distribution of internal marks for theory papers shall be: Two
tests out of three - 15 marks, Attendance – 5 marks, and Assignment/Seminar - 5 marks. The
maximum mark for each practical is 100 with 40 for Internal Assessment and 60 for University
Examination. The distribution of internal marks for practical papers shall be: Practical tests
Two out of three - 30 marks, Attendance – 5 marks, and Record - 5 marks. For project work
the marks assigned shall be

Internal Two out of three presentations 20 marks

Project report 60 marks
Viva-voce 20 marks

For the conduct of University Examinations in Practical subjects the University will
appoint one external examiner one internal examiner who shall normally be the concerned

1
practical in-charge. The University will set the questions and distribute to the colleges. The
examiners will conduct the examinations and award the marks on the same day and forward to
the University. The College Principal/Head of the department will coordinate and provide the
laboratory and other facilities for conducting the examination.

Project work shall be carried out individually in an R&D section of any Industry or University or
in the Institute in which the candidate is studying. The Project Work/Dissertation report shall be
submitted through the guides/supervisors to the Head of the Department and then to the
University not latter than 31st May/31st December. If he/she fails to submit the Project
Work/Dissertation within the stipulated date for a particular semester, he/she may be permitted
with the approval of the Head of the Department to submit the Project Work/Dissertation report
during the succeeding semesters, within the maximum period of FIVE years from the date of
admission to the first semester. Project/Dissertation evaluation and Viva-Voce shall be
conducted by one external examiner and one internal examiner who shall normally be the project
guide.
List of courses, Scheme of evaluation and their associated credits are given below:
First Semester
Course Name of Course Max.

Credits

Duratio
Exam.
components Marks TOTAL
IA* UE*

n
Core-1 Programming in C and C++ 4 3 25 75 100
Core-2 Digital Computer Fundamentals 4 3 25 75 100
Core-3 Open Source Software 4 3 25 75 100
Core-4 Practical – I: Programming in C and C++ 2 3 40 60
100
Lab
Core-5 Practical –II: Open Source Software Lab 2 3 40 60 100
Extra
Disciplinary Mathematics for Computer Science 4 3 25 75 100
Elective -1
SoftSkill-1 2 3 40 60 100
Second Semester
Course Name of Course Max.
Credits

Duratio
Exam.

components Marks TOTAL

IA UE
n

Core-6 Data Structures 4 3 25 75 100

Core-7 Programming in Java 4 3 25 75 100
Core-8 System Software 4 3 25 75 100
Core-9 Practical – III: Data Structures using C++ 2 3 40 60
100
Lab
Core-10 Practical – IV: Programming in Java Lab 2 3 40 60 100
Extra
Disciplinary Statistical Methods 4 3 25 75 100
Elective -2
Soft Skill-2 2 3 40 60 100

2
 Third Semester

Course Name of Course Max. TOTAL

Credits

Duratio
Exam.
components Marks
CIA UE

n
Core– 11 Design and Analysis of Algorithms 4 3 25 75 100
Core- 12 Computer Graphics 4 3 25 75 100
Core- 13 Advanced Java Programming 3 3 25 75 100
Core- 14 Operating Systems 3 3 25 75 100
Extra – Accounting & Financial Management 3 3 25 75
Disciplinary- III 100
Core- 15 Practical–V: Advanced Java Programming 2 3 40 60
100
Lab
Core- 16 Practical–VI: Operating Systems and 2 3 40 60
100
Computer Graphics Lab.
Soft Skill-3 2 3 40 60 100

Fourth Semester

Course Name of Course Max.

Credits

Duratio
Exam.
components Marks TOTAL
CIA UE

n
Core - 17 Computer Networks 4 3 25 75 100
Core -18 Database Management Systems 4 3 25 75 100
Core - 19 Software Engineering 3 3 25 75 100
Core - 20 Multimedia Systems 3 3 25 75 100
Elective Elective – I-Choose any one 3 3 25 75 100
Core - 21 Practical – VII: RDBMS Lab. 2 3 40 60 100
Core - 22 Practical – VIII: Multimedia Systems Lab 2 3 40 60 100
Soft Skill-4 2 3 40 60 100
Soft Skill-5 2 3 40 60 100
Internship During summer vacation 6 to 8 weeks 100

Fifth Semester

Course Name of Course Max. TOTAL

Credits

Duratio
Exam.

components Marks
CIA UE
n

Core - 23 Object Oriented Analysis and Design 3 3 25 75 100

Core - 24 Web Based Application Development 3 3 25 75 100
Elective Elective – II – Choose any one 4 3 25 75 100
Elective Elective – III – Choose any one 4 3 25 75 100
Core– 25 Practical – IX: Web Based Application 2 3 40 60
100
Development Lab.

3
Core -26 Practical – X: Mini project 2 3 40 60 100
Soft Skill-6 2 3 40 60 100
Internship During II year summer vacation 6 to 8 3
100
weeks

Sixth Semester

Course Name of Course Max. Marks

Duration
Credits
components TOTAL

Exam.
CIA UE
Core-27 Project & viva-voce 20 - 20 60+20 100
* IA = Internal Assessment, UE = University Examination

List of Electives
Elective –I: Digital Image Processing OR E-Commerce OR Information Security
Elective – II: Big Data Analytics OR Software Testing OR Theory of Computation
Elective –III: Mobile Computing OR Cloud Computing OR Artificial Neural Networks

4. Passing Requirements

a) For all subjects the passing requirement is as follows: i) candidate secures not less than 50%
of marks in University examination(U.E.) and not less than 50% in aggregate of the total
maximum marks prescribed in each theory & practical, and in Project work minimum 50% each
in dissertation and Viva-Voce examination and not less than 50% in aggregate of the total
maximum marks prescribed, shall be declared to have passed in the respective subject.

b) A candidate who passes in all subjects and in the project work earning 135 credits(including
soft Skills and Internship) within the maximum period of five years reckoned from the date of
admission to the course shall be declared to have qualified for the degree.
c) The relative overall performance of the candidate shall be determined by the overall
percentage of Marks obtained in all subjects evaluated as follows:

Sum of all (marks obtained X Credit) ∑ Mi *Ci

WAM = ---------------------------------- ---------- = ------------------
Sum of all (maximum marks X Credit) ∑ Ci

where Mi is the mark obtained in the ith subject with credit Ci .

This score shall be entered in the transcript given to the candidate on successful completion of
the course calculated to two decimal points.

5. Classification of successful candidates

4
(a) A Candidate who qualifies for the Degree and secures WAM of not less than 75% shall be
declared to have passed the examination in FIRST CLASS WITH DISTINCTION provided
he/she has passed the examination in every subject he/she has registered as well as in the project
work in the first appearance.
(b) A candidate who qualifies for the degree as per the regulations for passing requirements and
secures a weighted average of not less than 60% shall be declared to have passed the
examination in
FIRST CLASS.
(c) All other successful candidates shall be declared to have passed in SECOND CLASS.
(d) Only those candidates who have passed all the papers including practical and project work in
the first appearance shall be considered for the purpose of RANKING.
(e) The candidates admitted in the lateral entry system shall not be considered for Rankin.
However, those candidates shall be considered for classification.

6. Procedure in the event of failure

(a) If a candidate fails in a particular subject (other than Project work) he/she may reappear for
the University examination in the subject in subsequent semesters and obtain passing marks.
(b) In the event of failure in Project Work, the candidate shall reregister for Project Work and
redo the Project Work in a subsequent semester and resubmit the dissertation afresh for
evaluation. The internal assessment marks shall be freshly allotted in this case.

7. Attendance
A candidate who has attendance of less than 75% overall in a semester shall not be permitted to
take the University examination. However, it shall be open to the Academic Dean/Principal to
grant exemption to a candidate if he/she possess 65% or more attendance but less than 75% after
paying the required condonation fee to the University for valid reasons and such exemptions
should not under any circumstances be granted for attendance below 65%. Candidates who have
less than 65% and those who have less than 75% but have not got the exemption as above, has to
repeat the semester from the next academic year.

8. Grading system
In addition to the above marking system, grading system is also adopted as detailed below:
1. (a) Passing Minimum is 50% of the ESE and also 50% of the maximum of that
paper/course.
2. Minimum Credits to be earned:

For THREE Year Programme : Best 135 Credits :

( Part A (120 Credits ) : Core, Electives and Extra Disciplinary and part B ( 15 Credits ) :
Soft skills and Internship )

3. Marks and Grades:

The following table gives the marks, grade points, letter grades and classification to indicate
the performance of the candidate.

5
 Conversion of Marks to Grade Points and Letter Grade (Performance in a Course /
Paper )

RANGE OF GRADE LETTER DESCRIPTION

MARKS POINTS GRADE
90-100 9.0-10.0 O Outstanding
80-89 8.0-8.9 D+ Excellent
75-79 7.5-7.9 D Distinction
70-74 7.0-7.4 A+ Very Good
60-69 6.0-6.9 A Good
50-59 5.0-5.9 B Average
00-49 0.0 U Re-appear
ABSENT 0.0 AAA ABSENT

Ci = Credits earned for course i in any semester.

Gi = Grade Point obtained for course i in any semester.

n refers to the semester in which such courses were credited.

For a Semester :

GRADE POINT AVERAGE [GPA] = ∑i Ci Gi / ∑i Ci

Sum of the multiplication of grade points by the credits of the courses

GPA = ----------------------------------------------------------------------------------
Sum of the credits of the courses in a semester

For the entire programme:

CUMULATIVE GRADE POINT AVERAGE [CGPA] = ∑n ∑i Cni Gni / ∑n∑i Cni

Sum of the multiplication of grade points by the credits of the entire programme
CGPA= -----------------------------------------------------------------------------------------------
Sum of the credits of the courses of the entire programme

CGPA GRADE CLASSIFICATION OF FINAL

RESULT
9.5-10.0 O+ First Class - Exemplary *

6
9.0 and above but below 9.5 O

8.5 and above but below 9.0 D++ First Class with Distinction *
8.0 and above but below 8.5 D+
7.5 and above but below 8.0 D
7.0 and above but below 7.5 A++
6.5 and above but below 7.0 A+ First Class
6.0 and above but below 6.5 A
5.5 and above but below 6.0 B+ Second Class
5.0 and above but below 5.5 B
0.0 and above but below 5.0 U Re-appear

* The candidates who have passed in the first appearance and within the prescribed
semester of the PG Programme (Core, Elective and Extra Disciplinary courses alone) are
eligible.

9. Provision for Lateral Admission

(i) Candidates with PGDCS of this University or any other University as equivalent
thereto, provided he/she satisfies the eligibility condition as above, shall be admitted
to the Second year of the M.C.A. Degree Course.
(ii) Students who have completed Bachelor‟s Degree of Minimum 3 years duration in
B.C.A./ B.Sc. (Computer Science) with mathematics as a course at 10+2 level or at
graduate level shall alone be eligible for admission to Second year M.C.A. Course
(Lateral Entry) up to a maximum of 20% of sanctioned intake which will be
supernumerary of the approved intake. The sanction of supernumerary seats shall be
considered based on the additional facility available in the respective college.

PATTERN OF QUESTION PAPER (THEORY)

Time 3 hours Max Marks 75

Part - A: ( 50 words) 10 simple questions (10 x 1 = 10 Marks)

At least two questions from each unit.

Part – B: (200 words) 5 Out of 7 questions (5 x 5 = 25 Marks)

At least one question from each unit.
Part –C: (500 words) 4 Out of 6 questions (4 x 10 = 40 Marks)
At least one question from each unit.

PATTERN OF QUESTION PAPER (PRACTICAL)

Time: 3 Hours Max: 60 Marks.
One compulsory problem (may contain subdivisions) to be solved within 3 hours.
*****

7
 UNIVERSITY OF MADRAS
DEGREE OF MASTER OF
COMPUTER APPLICATIONS (M.C.A.)
REVISED SYLLABUS
(Effective from the academic year 2015-2016 onwards)

Title of the Programming in C and C++

Course/ Paper
Core - 1 I Year & First Semester Credit: 4

Unit 1: Basic Elements of C – Data Types – Operator – Control Statements – Branching, Looping, Nested
Control Structures – Prototypes and Functions – Parameter Passing Methods – Recursion – Storage Classes –
Library Functions – Arrays – Passing Arrays to Functions – Multi-Dimensional Arrays – Strings Operations
– Enumerated Data Types.
Unit-2: Structures –User Defined Data Types – Union - Nested Structure, Passing Structures to Functions –
Pointer Concept – Declaration – Accessing Variable through Pointer – Initializing Pointer Variable –
Pointers and Functions – Pointers and Arrays – Pointers and Structures – Example Programs using Pointers
with Function, Arrays and Structures – Command Line Arguments – Self Referential Structures. File
Handling - File Pointer – High Level File Operations – Opening and Closing of File – Creating, Processing
and Updation on Files – Simple File Handling Programs.
Unit 3: Introduction to OOP – Overview of C++ - Classes – Structures – Union – Friend Functions – Friend
Classes – Inline functions – Constructors – Destructors – Static Members – Scope Resolution Operator –
Passing objects to functions – Function returning objects. Arrays – Pointers – this pointer – References –
Dynamic memory Allocation – functions Overloading – Default arguments – Overloading Constructors –
Pointers to Functions – Ambiguity in function overloading.
Unit 4: Operator Overloading – Members Operator Function – Friend Operator Function – Overloading
some special operators like [ ] , ( ) , a and comma operator – Inheritance – Types of Inheritance – Protected
members – Virtual base Class – Polymorphism – Virtual functions – Pure virtual functions. Class templates
and generic classes – Function templates and generic functions – Overloading function templates – power of
templates

8
Unit 5: Exception Handling – Derived class Exception – overhandling generic functions – Exception
handling Functions – terminate () unexpected () – Uncaught – exception ()

Streams – Formatted I/O with ios class functions and manipulators – creating own manipulator – overloading
<< and >> - File I/O – Name spaces – conversion functions – Array based I/O .
Recommended Texts:
1) B. W. Kernighan and D. M. Ritchie, 1990, The C Programming Language, Second Edition, PHI, New
Delhi.

2) H. Schildt, 2003, C++ The Complete Reference, 4th Edition, Tata McGraw-Hill, New Delhi.
Reference Books
(1) A. N. Kanthane, 2005, Programming with ANSI and Turbo C, Pearson Education, Delhi.
(2) J. R. Hanly and E. B. Koffman, 2005, Problem solving and program design in C, Fourth
Edition, Pearson Education India.
(3) J.P. Cohoon and J.W. Davidson, 1999, C++ Program Design – An Introduction to
Programming and Object-oriented Design, 2nd Edition, Tata McGraw-Hill, New Delhi.
(4) Johnston, 2002, C++ programming today, PHI, New Delhi.
(5) A. N Kanthane, 2005, Object Oriented Programming with ANSI & Turbo C++ , Pearson
Education, New Delhi.
(6) Farrel , 2001, Object Oriented Programming using C++ , 2 nd Edition, Thomson Learning,
Singa[pore.
Website and e-Learning Source
http://www.cs.cf.ac.uk/Dave/C/CE.html
http://www.doc.ic.ac.uk/~wjk/C++Intro/
http://www.fredosaurus.com/notes-cpp/oop-classes/oop.html

Title of the Digital Computer Fundamentals

Course/ Paper
Core - 2 I Year & First Semester Credit: 4

Unit 1 : Number System – Converting numbers from one base to another – Complements – Binary Codes –
Integrated Circuits – Boolean algebra – Properties of Boolean algebra – Boolean functions – Canonical and
Standard forms – Logical Operations – Logic gates – Karnaugh Map up to 6 variables – Don‟t Care
Condition – Sum of Products and Products of Sum simplification – Tabulation Method.
Unit-2 : Adder – Subtractor – Code Converter – Analyzing a combinational Circuit – Multilevel NAND and
NOR circuits – Properties of XOR and equivalence functions – Binary Parallel Adder – Decimal Adder –
Magnitude Comparator – Decoders – Multiplexers – ROM – PLA.

9
Unit 3 : Flip Flops – Triggering of flip-flops – Analyzing a sequential circuit – State reduction – excitation
tables – Design of sequential circuits – Counters – Design with state equation – Registers – Shift Registers –
Ripple and synchronous Counters.
Unit-4 : Memory Unit – Processor Organization - Bus Organization – Scratch Pad memory – ALU – Design
of ALU – Status Register – Effects of Output carry – Design of Shifter – Processor Unit –
Microprogramming – Design of specific Arithmetic Circuits
Unit-5 : Accumulator – Design of Accumulator – Computer Design – System of Configuration – Instruction
and Data formats – Instruction sets – Timing and Control – Execution of Instruction – Design of Computer –
Hardwired control – PLA Control and Microprogram control
Recommended Texts

1) M. Morris Mano, 2011, Digital Logic and Computer Design, Thirteenth Impression, Pearson
Education, Delhi
Reference Books

1) M. M. Mano and C.R.Kime, 2001, Logic and Computer Design Fundamentals, 2nd Edition,
Pearson Education, Delhi.
2) Givone, 2002, Digital Principles Design, Tata McGraw Hill, New Delhi.
th
3) C. H. Roth , Jr, 2005, Fundamentals of Logic Design ,5 Edition, Thomson Learning,
Singapore.

Title of the Open Source Software

Course/ Paper
Core – 3 I Year & First Semester Credit: 4

Unit 1 : Introduction : Open Source – Open Source vs. Commercial Software – Introduction to Linux -
Linux Distributions - Operating Systems and Linux - Open Source Software - Software Repositories - Third-
Party Linux Software Repositories - Linux Office and Database Software - Internet Servers - Development
Resources - Online Linux Information Sources - Install Issues - accessing Your Linux System - The
Display Managers: GDM and KDM - Switching Users -Accessing Linux from the Command Line Interface-
Command Line Interface - Help Resources - Context-Sensitive Help - Application Documentation -The Man
Pages - The Info Pages - Software Repositories.
Unit-2: The Shell - The Command Line - History - Filename Expansion: *, ?, [ ] - Standard Input/Output
and Redirection - Pipes - Redirecting and Piping the Standard Error: >&, 2> - Jobs: Background, Kills, and
Interruptions - Ending Processes: ps and kill - The C Shell: Command Line Editing and History - The TCSH

10
 Shell - The Z-shell
Unit 3: The Shell Scripts and Programming - Shell Variables - Shell Scripts - User-Defined Commands -
Environment Variables and Subshells: export and setenv - Conditional Control Structures - Linux Files,
Directories, and Archives- Linux Files - The File Structure - Listing, Displaying, and Printing File -
Managing Directories - File and Directory Operations - Archiving and Compressing Files – vi editor
Unit 4: PHP – Create and run PHP page – Mixing PHP and HTML – Printing text and HTML – Echo – Here
– Command Line PHP – Comments – Variables – Strings – Constants – Data types – Operators and flow
control.
Unit 5: String and Array – String functions – Convert and format string – Arrays – Creating function –
Reading data in web pages.
Recommended Texts:
1) R. Peterson , 2007, Linux: The Complete Reference, Sixth Edition, TMH
2) S. Holzner, 2008, PHP: The Complete Reference, TMH
Reference Book
1) R. Stones, N. Mattew, 2011, Beginning Linux Programming, 4th Edition, Wiley India Pvt. Ltd.-New
Delhi
2) R. Nixon, Learning PHP, MySQL, JavaScript, and CSS, 2012, 2nd Edition, O‟Reilly Media.

Title of the Practical – I: Programming in C and C++ Lab

Course/ Paper
Core – 4 I Year & First Semester Credit: 2

C Lab
1. String manipulation
2. Matrix multiplication
3. Finding determinant of a matrix
4. Euclidean‟s algorithm for finding gcd (towers of honai).
5. Implement insertion sort algorithm using pointers
6. Creating database for telephone numbers and related operations. Use file concepts.
C++ Lab
1. Write a C++ program to calculate income tax using default arguments.
Write a C++ program to categorize employees based on designation using static data members.
2. Write a C++ program to add two private data members using friend functions.

11
3. Write a C++ program to implement matrix vector multiplication using friend functions.
4. Write a C++ program to manipulate complex numbers using operator overloading and type conversions.
5. Write a C++ program to perform matrix addition and subtraction using dynamic memory allocation.
6. Write a C++ program to perform calculate student marks by overloading new and delete operators.
7. Write a C++ program to develop a template for linked list class and its methods.
8. Develop with suitable hierarchy classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle,
Polygon, etc. Design a simple test application to Demonstrate dynamic polymorphism and RTTI.

Title of the Practical – II: Open Source Software Lab

Course/ Paper
Core – 5 I Year & First Semester Credit: 2

1) Write a shell script that displays a list of all the files in the current directory to which the user has
read, write and execute permissions

2) Write a shell program to simulate

a. „cat’ command
b. „wc’ command to count the number of lines and number of words in the given input file.

3) Write a grep command that

a. Count the number blank lines in the file1

b. Select the lines from the file1 that have the string „LINUX‟.

4) Write a sed command that

a. Print lines numbers of lines beginning with “O”

b. Swap the first and second word in each line in the file

5) Write an awk script to

a. Count the number of lines in a file that do not contain vowels.
b. Find the number of characters, words and lines in a file.

6) Write a shell script to find out whether the given number is prime number or not

7) Write a shell program to find out factorial of the given number

8) Write a shell program to find out reverse string of the given string and check the given string is
palindrome or not

9) Write a shell script to search an element in the list

12
 10) Write a shell script to implement menu driven program to display list of users who are currently
working in the system, copying files (cp command), rename a file, list of files in the directory and
quit option.( Hint: use case structure)

PHP

11) Display strings and variables with the echo command

12) Display strings and variables with the print command

13) Create a simple HTML form and accept the user name and display the name through echo

command.

14) Write a PHP script, which change the color of first character of a word.

15) Write a PHP script, which will return the following components of the url

"http://www.example.com/myexercises/phplab.doc'. "

16) Write a PHP script to

i. get the first element of an array.

ii. insert a new item in an array on any position.

iii. sort an array

iv. merge two arrays.

17) Write a program to calculate and print the factorial of a number

18) Write a PHP program to generate and display the first n lines of a Floyd triangle.

19) Write a PHP script to

i. transform a string to all uppercase letters.

ii. transform a string to all lowercase letters.

iii. reverse a string

iv. count lines in a file.

20) Write a PHP script to

a. print the current date

b. calculate the difference between two dates.

13
 c. calculate number of days between two dates.

Title of the Mathematics for Computer Science

Course/ Paper
Extra I Year & First Semester Credit: 4
Disciplinary -1

Unit 1: Mathematical Logic: Statement Calculus – Connectives – normal forms – Predicate

Calculus – Theory of inference for statement Calculus – Predicate Calculus including theory of
inference.
Unit-2: Set Theory: Basic concepts of set theory – relations and ordering – functions –recursion.
Unit 3: Algebraic Structures: Semigroups – monoids- grammars and languages – groups and
subgroups – Polish experiments and their compilation.
Unit-4: Roots of Equations: Graphical Method – Bisection Method – False-Position Method –
Fixed-Point Iteration – Newton-Raphson Method – Secant Method – Roots of Polynomials:
Conventional Methods – Muller‟s Method – Bairstow‟s Method. Algebraic Equations: Gauss
Elimination –Gauss-Jordan – LU Decomposition – Matrix Inverse –Gauss-Seidel.
Unit-5 : Numerical Differentiation - Integration: Trapezoidal Rule – Simpson‟s Rule – Romberg
Integration – Differential equations: Taylor‟s method – Euler‟s method –Runge-Kutta 2nd and 4th
order methods – Predictor – corrector methods.

1. Recommended Texts
(i) J.P. Tremblay and R. Manohar, 1975, Discrete Mathematical Structures with
Applications to Computer Science, Tata McGraw-Hill, New Delhi
(ii) S.S. Sastri, 1977, Introductory Methods of Numerical Analysis, Prentice Hall India,
New Delhi

2. Reference Books
(i) J. Truss, 1999, Discrete Mathematics for Computer Scientists, 2nd Edn., Addison
Wesley, Boston.
(ii) S. C. Chapra and R. P.Canale, 2002, Numerical Methods for Engineers, Fourth
Edition, McGraw Hill International Edition.
(iii) Kolman, Busby and Ross, 2005, Discrete mathematical structures, 5th edition, PHI,
New Delhi.

Title of the Data Structures

Course/ Paper
Core – 6 I Year & Second Semester Credit: 4

Unit 1: Abstract data types - asymptotic notations – complexity analysis – Arrays- representation of arrays –
operations on arrays – ordered lists – polynomials.
Unit-2: Linked lists: Singly linked list- circular linked lists - doubly linked lists – general lists – stacks -

14
queues - circular queues – Evaluation of expressions.
Unit 3: Trees – Binary Trees – Binary Tree Traversals – Binary Tree Representations – Binary Search Trees
– Threaded Binary Trees – Application of Trees (Sets) – Representation of Graphs – Graph Implementation
– Graph Traversals- Application of Graph Traversals- Minimum Cost Spanning Trees – Shortest Path
Problem
Unit 4: Internal Sorting – Optimal Sorting Time – Sorting Large Objects – Sorting with Tapes- Sorting with
Disks.
Unit 5: Hashing – AVL Trees - Red-Black Trees – Splay Trees – B-Trees.
Recommended Texts:
1) E.Horowitz, S. Sahni and Mehta, 1999, Fundamentals of Data Structures in C++, Galgotia,
New Delhi
2) S. Sahni, 2001, Data structures, Algorithms & Applications, Tata McGraw-Hill, New Delhi.
Reference Books
1) G. L. Heileman, 1996, Data Structures, Algorithms and Object Oriented Programming, Tata
McGraw-Hill, New Delhi.
2) A.V.Aho, J.D. Ullman, J.E. Hopcraft, 1983, Data Structures and Algorithms, Addison
Wesley, Boston.
3) Yedidyah Langsam Augensteil, Tanenbaum, Data Structures using C and C++ , PHI, New
Delhi
4) Gilberg , Forouzan, 2002, Data Structures,Thomson Asia, Singapore.

Title of the Programming in Java

Course/ Paper
Core - 7 I Year & Second Semester Credit: 4

Unit 1: Introduction to Java - Features of Java - Object Oriented Concepts - Lexical Issues - Data Types -
Variables - Arrays - Operators - Control Statements. Classes - Objects - Constructors - Overloading method
- Access Control - Static and fixed methods – Nested Classes-Inner Classes - String Class - Inheritance -
Overriding methods - Using super-Abstract class.
Unit 2: Packages - Access Protection - Importing Packages - Interfaces - Exception Handling - Throw and
Throws – Multithreaded Programming-Thread Model- Thread Priorities- Synchronization - Messaging -
Runnable Interface - Inter thread Communication - Deadlock - Suspending, Resuming and stopping threads –
Using Multithreading.
Unit 3: I/O Streams – Byte and character streams – Reading Console Input- Writing Console Output- String
Handling- String Buffer- Simple Type Wrappers- Java Utilities.
Unit 4: Networks basics - Socket Programming – Reserved Sockets-Proxy Servers - TCP/IP Sockets - Net
Address - URL - Datagrams – Inet Address.
Unit 5: Applets – Event Handling – Working with Windows, Graphics and Text using AWT Classes – AWT

15
Controls – Layout Managers – Menus – User Interface Components with Swings: Controls, Menus, Dialog
Boxes – JDBC Connectivity.
Recommended Texts

1) H. Schildt, 2002, Java2 (The Complete Reference), Fifth Edition, McGraw-Hill.

2) C. S. Horstmann, G. Cornell, 2011, Core Java , Volume I- Fundamentals, Eighth Edition,
Pearson Education, Delhi.
Reference Books

1) H.M. Deital and P.J. Deital, 2005, Java: How to program, 5th Edition, Pearson Education, Delhi.

Title of the System Software

Course/ Paper
Core - 8 I Year & Second Semester Credit: 4

Unit 1: Unit 1: Language processors – Language processing activities and fundamentals – Language
specification – Development Tools – Data Structures for Language processing- Scanners and Parsers.
Unit-2: Unit 2: Assemblers: Elements of Assembly language programming - Overview of the Assembly
process - Design of a Two-pass Assembler - A single pass Assembler for the IBM PC.
Unit 3: Macros and Macro processors – Macro definition, call , and expansion – Nested macro calls –
Advanced macro facilities - Design of a macro preprocessor - Compilers: Aspects of compilation .
Unit 4: Compilers and Interpreters – Memory allocation - Compilation of Expressions and Control
structures - Code optimization – Interpreters.
Unit 5: Unit 5 : Linkers: Linking and Relocation concepts – Design of a linker – Self relocating Programs –
A linker for MS DOS - Linking for overlays – loaders - Software tools: Software tools for program
development - Editors - Debug monitors - Programming environments – User interfaces.
Recommended Texts:
1) D. M. Dhamdhere, 1999, Systems Programming and Operating Systems, Second
Revised Edition, Tata McGraw-Hill, New Delhi.
Reference Books
1) L. L. Beck, 1996, System Software An Introduction to System Programming, 3rd
edition, Addison-Wesley.

16
Title of the Practical – III: Data Structures using C++ Lab
Course/ Paper
Core - 9 I Year & Second Semester Credit: 2

1. Implementation of Arrays (Single and Multi-Dimensional)

2. Polynomial Object and necessary overloaded operators.
3. Singly Linked Lists.
4. Circular Linked Lists.
5. Doubly Linked Lists.
6. General Lists.
7. Implementation of Stack (using Arrays)
8. Implementation of Queue (Using Pointers)
9. Implementation of Circular Queue (using Arrays and Pointers)
10. Conversion of Infix to Postfix
11. Evaluation of Expressions
12. Binary Tree Traversals using recursion.
13. Binary Search Trees – Insertion and Deletion
14. Shortest path (Dijkstra‟s)
15. Search methods in graphs (DFS & BFS) using recursion.
Title of the Practical – IV: Programming in Java Lab
Course/ Paper
Core - 10 I Year & Second Semester Credit: 2

APPLICATION
1. Generating random numbers using Random Class.
2. Implementation of Point Class for Image manipulation.
3. Usage of Calendar Class and manipulation.
4. String Manipulation using Char Array.
5. Database Creation for storing e-mail addresses and manipulation.
6. Usage of Vector Classes.
7. Implementing Thread based applications & Exception Handling (Synchronization & asynchronization).
APPLETS
8. Working with Frames and various controls.

17
9. Working with Dialogs and Menus.

10. Working with Panel and Layout.

11. Incorporating Graphics (Scaling Only).

12. Create a payroll application using Swings.

APPLICATION FOR EVENTS HANDLING

13. Application Using JDBC Connectivity

Title of the Statistical Methods

Course/ Paper
Extra I Year & Second Semester Credit: 4
Disciplinary-2

Unit 1: Sample spaces - events - Axiomatic approach to probability - conditional probability -

Independent events – Bayes‟ formula - Random Variables - Continuous and Discrete random
variables - distribution function of a random variable - Characteristics of distributions -
Expectation, variance - coefficient of variation, moment generation function - Chebyshev's
inequality
Unit 2: Bivariate distribution - conditional and marginal distributions - Discrete distributions -
discrete uniform, Binomial Poisson and geometric Distributions - Continuous distributions -
Uniform, Normal, Exponential and Gamma distributions.
Unit 3: Correlation coefficient - Rank correlation, coefficient of determination - Linear
Regression - Method of Least squares - Fitting of the curve of the form ax + b, ax2 + bx + c, abx
and axb - multiple and partial correlation (3 - variables only).
Unit 4: Concept of sampling – Methods of sampling - simple random sampling - Systematic
sampling and stratified random sampling (descriptions only) - concepts of sampling
distributions and standard error - point estimation (concepts only) - Interval Estimation of mean
and proportion. Tests of Hypotheses - Critical Region - two types of Errors - Level of
significance - power of the test - Large sample tests for mean and proportion - Exact tests based
on Normal, t, F and Chi-square distributions.
Unit 5 : Basic principles of experimentation - Analysis of variance - one way and two way
classifications - completly randomized design - Randomized Block design - Time series
Analysis - Measurement of Trend and Seasonal variations.

1. Recommended Texts
(i) Mood, A.M., Graybill, F. and Boes, 1974, Introduction to Mathematical Statistics,
McGraw-Hill.
(ii) Trivedi, K.S, 1994, Probability and Statistics with Reliability, Queuing and

18
 Computer Science Applications. Prentice Hall India, New Delhi.

2. Reference Books
(i) Arnold O. Allen, 1978, Probability, Statistics and Queuing Theory with Computer
Science Application.
(ii) Bajpai, A.C. Calus, I.M. Fairley, J.A., 1979, Statistical Methods for Engineers and
Scientists. John Wiley & Sons.
(iii) Doughlas, C.,Montagomery, Lynwood,A. & Johnson, 1976, Forecasting and Time
Series Analysis, Tata McGraw-Hill, New Delhi.
(iv) Baisnab, A.P. and Manoranjan Jas, 1993, Elements of Probability and Statistics, Tata
McGraw-Hill, New Delhi.
(v) Kossack, C.F. and Hensschkec, C.I., Introduction to Statistics and Computer
Programming, Tata McGraw-Hill, New Delhi.

Title of the Design and Analysis of Algorithms

Course/ Paper
Core - 11 II Year & Third Semester Credit: 4

Unit 1: Unit 1: Introduction - Definition of Algorithm – pseudocode conventions – recursive

algorithms – time and space complexity –big-“oh” notation – practical complexities – randomized
algorithms – repeated element – primality testing - Divide and Conquer: General Method - Finding
maximum and minimum – merge sort.
Unit-2: Unit 2: Divide and conquer contd. – Quicksort, Selection, Strassen's matrix multiplication –
Greedy Method: General Method –knapsack problem - Tree vertex splitting - Job sequencing with
dead lines – optimal storage on tapes.
Unit 3: Unit 3: Dynamic Programming: General Method - multistage graphs – all pairs shortest
paths – single source shortest paths - String Editing – 0/1 knapsack. Search techniques for graphs –
DFS-BFS-connected components – biconnected components.
Unit 4: Back Tracking: General Method – 8-queens - Sum of subsets - Graph Coloring –
Hamiltonian cycles. Branch and Bound: General Method - Traveling Salesperson problem.
Unit 5: Unit 5 : Lower Bound Theory: Comparison trees - Oracles and advisory arguments - Lower
bounds through reduction - Basic Concepts of NP-Hard and NP-Complete problems.
Recommended Texts:
1) E. Horowitz, S. Sahni and S. Rajasekaran, 2008, Computer Algorithms, 2nd Edition,
Universities Press, India.

19
Reference Books
1) G. Brassard and P. Bratley, 1997, Fundamentals of Algorithms, PHI, New Delhi.
2) A.V. Aho, J.E. Hopcroft, J.D. Ullmann, 1974, The Design and Analysis of
Computer Algorithms, Addison Wesley, Boston.
3) S.E.Goodman and S.T.Hedetniemi, 1977, Introduction to the Design and Analysis of
algorithms, Tata McGraw Hill Int. Edn, New Delhi.
E-learning resources
1) http://www.cise.ufl.edu/~raj/BOOK.html

Title of the Computer Graphics

Course/ Paper
Core - 12 II Year & Third Semester Credit: 4

Unit 1: Introduction to computer Graphics – Video display devices – Raster Scan Systems – Random Scan
Systems - Interactive input devices – Hard Copy devices - Graphics software – Area fill attributes –
Character attributes inquiry function - Output primitives – line drawing algorithms – initializing lines – line
function – Circle Generating algorithms – Ellipse Generating algorithms - Attributes of output primitives –
line attributes – Color and Grayscale style.
Unit 2: – Two dimensional transformation – Basic transformation – Matrix representation and
Homogeneous co-ordinates - Composite transformation – Matrix representation – other transformations –
two dimensional viewing – window – to- viewport co-ordinate transformation.
Unit 3: Clipping algorithms – Point clipping -line clipping - polygon clipping – Curve clipping - text
clipping – Exterior clipping –– Three dimensional transformations – translation- rotation- scaling –
composite-shears and reflections - Three dimensional viewing – Projection – Orthogonal and oblique parallel
projections.
Unit 4: – Viewing - perspective projection – Three dimensional clipping algorithms- Visible surface
detection methods -– backface detection, depth buffer, A-buffer, scan-line, depth sorting, BSP-tree, area
subdivision, octree and other methods.
Unit 5 : Computer Animation - Three dimensional object representations – Spline representation - Bezier
curves and surfaces – B-Spline curves and surfaces -– Color models and color applications.

Recommended Text
1) D. Hearn, M.P. Baker, and W.R. Carithers, 2011 – Computer Graphics with openGL, 4th
Edition, Pearson Education

20
Reference Books
1) W.M. Neumann and R. F. Sproull, Principles of Interactive Computer Graphics, Tata
McGraw-Hill, New Delhi.
2) S. Harrington, 1989, Fundamentals of Computer Graphics, Tata McGraw-Hill, New Delhi.
3) D. F. Rogers, J. A. Adams, 2002, Mathematical elements for Computer Graphics, 2nd
Edition, Tata McGraw-Hill, New Delhi.
4) D. F. Rogers, 2001, Procedural elements for Computer Graphics, 2nd Edition, Tata McGraw-
Hill, New Delhi.
5) Foley, Van Dan, Feiner, Hughes, 2000, Computer Graphics, Addison Wesley, Boston
Website and E-Learning Source
1) http://forum.jntuworld.com/showthread.php?3846-Computer-Graphics- Notes-All-8-Units
2) http://www.cs.kent.edu/~farrell/cg05/lectures/index.html

Title of the Advanced Java Programming

Course/ Paper
Core – 13 II Year & Third Semester Credit: 3

Unit 1: Servlet Overview – Servlet life cycle - The Java Web Server – Simple Servlet – Servlet Packages –
Using Cookies - - Session Tracking - Security Issues – using JDBC in Servlets – HTML to Servlet
Communication - applet to servlet communication.
Unit 2: Java Beans: The software component assembly model- The java bean development kit- developing
beans – notable beans – using infobus - Glasgow developments - Application Builder tool- JAR files-
Introspection-Bound Properties-Persistence-customizers - java beans API.
Unit 3: EJB: EJB architecture- EJB requirements – design and implementation – EJB session beans- EJB
entity beans-EJB Clients – deployment tips, tricks and traps for building distributed and other systems –
implementation and future directions of EJB-Variable in perl- perl control structures and operators –
functions and scope
Unit 4: RMI – Overview – Developing applications with RMI: Declaring & Implementing remote interfaces-
stubs & skeletons, Registering remote objects, writing RMI clients –Pushing data from RMI Servlet – RMI
over Inter-ORB Protocol
Unit 5: JSP –Introduction JSP-Examining MVC and JSP -JSP scripting elements & directives-Working with
variables scopes-Error Pages - using Java Beans in JSP Working with Java Mail-Understanding Protocols in
Java mail-Components-Java mail API-Integrating into J2EE-Understanding Java Messaging Services-
Introducing Java Transactions.

21
Recommended Text:

1) James McGovern, Rahim , Adatia, Yakor Fain, 2003, J2EE 1.4 Bible, Wiley-dreamtech
India Pvt. Ltd, New Delhi
2) Herbert Schildt, 2002, Java 2 Complete Reference, 5th Edition, Tata McGraw Hill, New
Delhi.
3) Jamie Jaworski, 1999, Java 2 Platform – Unleashed, First Edition, Techmedia-SAMS.
Reference books:

1) K. Moss, 1999, Java Servlets, Second edition, Tata McGraw Hill, New Delhi.
2) D. R.Callaway,1999, Inside Servlets, Addison Wesley, Boston
3) Joseph O‟Neil, 1998, Java Beans from the Ground Up, Tata McGraw Hill, New Delhi.
4) TomValesky, Enterprise JavaBeans, Addison Wesley.
5) Cay S Horstmann & Gary Cornell, Core Java Vol II Advanced Features, Addison Wesley.

Title of the Operating Systems

Course/ Paper
Core – 14 II Year & Third Semester Credit: 3

Unit 1: Defining a Operating System - Clustered Systems - Operating-System Structure - Operating-System

Operations - Process Management - Memory Management - Storage Management - Protection and Security
- Computing Environments - Open-Source Operating Systems - Operating system services - System Calls
- Types of System Calls - System Programs - Operating-System Structure - System Boot.
Unit-2: Process Management: Process concept – Process Scheduling - Operations on Processes -
Interprocess Communication - Communication in Client – Server Systems - Threads - Multithreading
Models - Basic Concepts – Scheduling Criteria – Scheduling Algorithms - Process Synchronization -
Critical section Problem - Peterson‟s Solution - Synchronization hardware – Semaphores, classical problem
of synchronization – System model - Deadlock Characterization - Methods for Handling Deadlocks -
Prevention, Avoidance, and Detection – Recovery.
Unit 3: Storage management – Background- Swapping - Contiguous Memory Allocation - Paging -
Structure of the Page Table - Segmentation - virtual memory background - demand paging - Copy-on-Write
- page replacement and algorithms -

Unit 4: Storage management – File system - File concept - access methods - directory and directory
structure - - protection - File-System Structure - File-System Implementation - Directory Implementation -

22
Allocation Methods - Free-Space Management - Secondary Storage structure - disk structure – disk
attachment - Disk scheduling
Unit 5: Protection - Goals of Protection - Principles of Protection - Access Matrix - Security - The Security
Problem - Program Threats - System and Network Threats - User Authentication – Implementing security
defenses - Firewalling to Protect Systems and Networks - Computer-Security Classifications.
Recommended Texts:
1) A. Silberschatz P.B. Galvin, G.Gagne, 2012, Operating System Concepts, 8th Edn., John Wiley &
Sons, Inc.

Reference Books
1) D.M. Dhamdhare , 2012, Operating Systems: A Concept Based Approach, 3rd Edn.Tata
McGraw-Hill, New Delhi.
2) A.S. Tanenbaum, H. Bos ,2014, Modern Operating Systems, 4th Edn, Prentice-Hall of India,
New Delhi.

Website and e-Learning Source

1) http://iit.qau.edu.pk/books/OS_8th_Edition.pdf

Title of the Accounting & Financial Management

Course/ Paper
Extra II Year & Third Semester Credit: 4
Disciplinary-3

Unit 1: Principles of Accounting: Principles of double entry -Assets and Liabilities - Accounting records
and systems - Trial balance and preparation of financial statements - Trading, Manufacturing, Profit and
Loss accounts, Balance Sheet including adjustments( Simple problems only).
Unit 2: Analysis and Interpreting Accounts and Financial Statements: Ratio analysis - Use of ratios in
interpreting the final accounts (trading accounts and loss a/c and balance sheet) - final accounts to ratios
as well as ratios to final accounts.
Unit 3: Break-even analysis and Marginal Costing: Meaning of variable cost and fixed cost -
Cost-Volume-Profit analysis – calculation of breakeven point, Profit planning, sales planning and other
decision – making analysis involving break - even analysis - Computer Accounting and
algorithm.(differential cost analysis to be omitted)
Unit 4: Budget/Forecasting: preparation of and Characteristics of functional budgets, Production, sales,
Purchases, cash and flexible budgets.

23
 Unit 5 : Project Appraisal: Method of capital investment decision making: Payback method , ARR
method - Discounted cash flows - Net Present values - Internal rate of return - Sensitivity analysis - Cost
of capital.

1. Reference Books
(i) Shukla M.C. & T.S. Grewal, 1991, Advanced Accounts, S.Chand & Co. New Delhi.
(ii) Gupta R.L. & M. Radhaswamy, 1991, Advanced Accounts Vol. II, Sultan Chand &
Sons, New Delhi.
(iii) Man Mohan & S.N. Goyal, 1987, Principles of Management Accounting, Arya
Sahithya Bhawan.
(iv) Kuchhal, S.C., 1980, Financial Management, Chaitanya, Allahabad.
(v) Hingorani, N.L. & Ramanthan, A.R, 1992, Management Accounting, 5th edition,
Sultan Chand, New Delhi.

Title of the Practical – V: Advanced Java Programming Lab

Course/ Paper
Core – 15 II Year & Third Semester Credit: 2

1. HTML to Servlet Applications

2. Applet to Servlet Communication
3. Designing online applications with JSP
4. Creating JSP program using JavaBeans
5. Working with Enterprise JavaBeans
6. Performing Java Database Connectivity.
7. Creating Web services with RMI.
8. Creating and Sending Email with Java
9. Building web applications

Title of the Practical – VI: Operating System and Computer Graphics Lab
Course/ Paper
Core – 16 II Year & Third Semester Credit: 2

Operating System Lab

1. Inter Process Communication (IPC) using Message Queues.

24
2. IPC using pipes.
3. Implementations of wait and signal using counting semaphores.
4. Atomic Counter update problem.
5. Signaling processes.
6. Deadlock detection (for processes passing messages)
7. Process Scheduling: FCFS
10. Process Scheduling: Least Frequently Used.
11. Process Scheduling: Round Robin.
12. Two Process Mutual Exclusion.
Computer Graphics Lab
1. Program to draw a line using DDA algorithm.
2. Program to draw a line using Bresenham‟s algorithm.
3. Program to draw a circle using Bresenham‟s algorithm.
4. Program to implement the Character generation algorithm.
5. Program to implement the Polygon clipping alogorithm.
6. Program to implement the Text clipping algorithm.
7. Program to implement the line Clipping algorithm.
8. Program to implement the 2D Translation, 2D Rotation and 2D scaling.
9. Program to implement the 3D Translation, 3D Rotation and 3D scaling.
10. Program to implement the Shearing and Reflection of an object.

Title of the Computer Networks

Course/ Paper
Core – 17 II Year & Fourth Semester Credit: 4

Unit 1: Introduction – Network Hardware – Software – Reference Models – OSI and TCP/IP models –
Example networks: Internet, 3G Mobile phone networks, Wireless LANs –RFID and sensor networks -
Physical layer – Theoretical basis for data communication - guided transmission media
Unit-2: Wireless transmission - Communication Satellites – Digital modulation and multiplexing -
Telephones network structure – local loop, trunks and multiplexing, switching. Data link layer: Design
issues – error detection and correction.
Unit 3: Elementary data link protocols - sliding window protocols – Example Data Link protocols – Packet
over SONET, ADSL - Medium Access Layer – Channel Allocation Problem – Multiple Access Protocols.
Unit 4: Network layer - design issues - Routing algorithms - Congestion control algorithms – Quality of

25
Service – Network layer of Internet- IP protocol – IP Address – Internet Control Protocol.
Unit 5: Transport layer – transport service- Elements of transport protocol - Addressing, Establishing &
Releasing a connection – Error control, flow control, multiplexing and crash recovery - Internet Transport
Protocol – TCP - Network Security: Cryptography.
Recommended Texts:
1) A. S. Tanenbaum, 2011, Computer Networks, Fifth Edition, Pearson Education, Inc.
Reference Books
1) B. Forouzan, 1998, Introduction to Data Communications in Networking, Tata McGraw
Hill, New Delhi.
2) F. Halsall, 1995, Data Communications, Computer Networks and Open Systems, Addison
Wessley.
3) D. Bertsekas and R. Gallagher, 1992, Data Networks, Prentice hall of India, New Delhi.
4) Lamarca, 2002, Communication Networks, Tata McGraw Hill, New Delhi.
Website, E-learning resources
1) http://peasonhighered.com/tanenbaum

Title of the Database Management System

Course/ Paper
Core – 18 II Year & Fourth Semester Credit: 4

Unit 1: Introduction to Database Systems – Relational Model – Structure – Relational Algebra – Null Values
– SQL – Set Operation – Views – Advanced SQL – Embedded SQL – Recursive Queries – The Tuple
Relational Calculus – Domain Relational Calculus.

Unit 2: E-R Model – Constraints – E-R- Diagrams Weak Entity Sets – Reduction to Relational Schemes –
Relational Database Design – Features of Relational Design – Automatic Domains and First Normal Form –
Decomposition using Functional Dependencies – Multivalued Dependencies – More Normal Forms – Web
Interface – Object – Based Databases – Structured Types and inheritance in SQL – Table inheritance –
Persistent.
Unit 3: Storage and File Structure – RAID – File Organization – Indexing and Hashing – B Tree – B Tree
Index files - Static and Dynamic Hashing – Query Processing – Sorting & Join Operators – Query
Optimization – Choice of Evaluation Plans.
Unit 4: Transaction Management – Implementation of Atomicity and Durability – Serializability –

26
Recoverability – Concurrency Control – Dead Lock Handling – Recovery System – Buffer Management.
Unit 5 : Database – System Architecture – Client Server – Architectures – Parallel System – Network
Types – Distributed Database – Homogeneous and Hetrogeneous Database – Directory System – Case Study
– Oracle – MSSQL Server.
Recommended Text
1) A. Silberschatz, H.F. Korth and S. Sudharshan, 2006, Database System Concepts, 5th
Edition, Tata McGraw Hill, New Delhi.
Reference Books
1) J. D. Ullman,1988,Principles of Database Systems, Galgotia Publishers, New Delhi
2) C.J. Date, 1985, An Introduction to Database Systems, Third Edition, Narosa, New Delhi.
3) Elmasri and Navathe, 1999, Fundamentals of Database Systems, Third Edition, Pearson
Education, Delhi.
4) C. Ritchie, 2004, Relational Database Principals, 2 nd Edition,Thomson, Singapore.
Website and e-Learning Source :
1) http://www.cse.iitb.ac.in/dbms/DataPapers-Local/DBConceptsBook/slide-dir/
Title of the Software Engineering
Course/ Paper
Core - 19 II Year & Fourth Semester Credit: 3

Unit 1: Software Engineering - The nature of Software -Software Process Models- Waterfall Model-
Incremental process models- Evolutionary process models-– Concurrent models- Specialized process
models- Agile process –Agility principles
Unit 2: Requirements Engineering-Establishing the groundwork-Eliciting requirements-Building the
Requirements Model-Validating Requirements – Requirements analysis-Modeling Approaches – Data
Modeling Concepts- Modeling Strategies – Flow-Oriented Modeling-Behavioral Model.
Unit 3: Design concepts-The Design model-Architectural design-Component level design -User interface
design-Software Configuration Management -The SCM Process- Version Control- Change Control-
Configuration Audit
Unit 4: The Management spectrum – W5HH principle –Process and Project Metrics –Software Measurement
– Software Project Estimation – Decomposition Techniques – Project Scheduling –Risk Management –
Identification – Projection –Refinement- RMMM Plan.
Unit 5: Software Review Techniques:-Informal reviews-Formal Technical Reviews -Software Quality
Assurance- SQA Tasks, Goals and Metrics- -Software Reliability - A Strategic Approach to Software
Testing- Unit Testing- Integration Testing- Validation Testing - System Testing-The Art of Debugging –
Software Maintenance
Recommended Texts

1) Roger. S. Pressman, 2010, Software Engineering A Practitioner‟s approach, Seventh Edition,

Tata McGraw-Hill, New Delhi.
Reference Books

27
 1) I. Sommerville, 2001, Software Engineering, 6th Edition, Addison Wesley, Boston.
2) Rajib Mal, 2005, -Fundamental of Software engineering , 2 nd Edition , PHI, New
Delhi.
3) N. E. Fenton, S. L. Pfleenger, 2004, Software Metrics, Thomson Asia, Singapore.

Title of the Multimedia Systems

Course/ Paper
Core - 20 II Year & Fourth Semester Credit: 3

Unit 1: Introductory Concepts: Multimedia – Definitions, CD-ROM and the Multimedia Highway, Uses of
Multimedia, Introduction to making multimedia – The Stages of project, the requirements to make good
multimedia, Multimedia skills and training, Training opportunities in Multimedia. Motivation for multimedia
usage, Frequency domain analysis, Application Domain.
Unit 2: Multimedia-Hardware and Software: Multimedia Hardware – Macintosh and Windows production
Platforms, Hardware peripherals – Connections, Memory and storage devices, Media software – Basic tools,
making instant multimedia, Multimedia software and Authoring tools, Production Standards.
Unit 3: Multimedia – making it work – multimedia building blocks – Text, Sound, Images, Animation and
Video, Digitization of Audio and Video objects, Data Compression: Different algorithms concern to text,
audio, video and images etc., Working Exposure on Tools like Dream Weaver, Flash, Photoshop Etc.,
Unit 4: Multimedia and the Internet: History, Internet working, Connections, Internet Services, The World
Wide Web, Tools for the WWW – Web Servers, Web Browsers, Web page makers and editors, Plug-Ins and
Delivery Vehicles, HTML, VRML, Designing for the WWW – Working on the Web, Multimedia
Applications – Media Communication, Media Consumption, Media Entertainment, Media games.
Unit 5 : Multimedia-looking towards Future: Digital Communication and New Media, Interactive
Television, Digital Broadcasting, Digital Radio, Multimedia Conferencing, Assembling and delivering a
project-planning and costing, Designing and Producing, content and talent, Delivering, CD-ROM
technology.

Recommended Texts:
1. S. Heath, 1999, Multimedia & Communication Systems, Focal Press, UK.
2. T. Vaughan, 1999, Multimedia: Making it work, 4th Edition, Tata McGraw Hill, New Delhi.
3. K. Andleigh and K. Thakkar, 2000, Multimedia System Design, PHI, New Delhi.
Reference Books
1) Keyes, “Multimedia Handbook”, TMH, 2000.
2) R. Steinmetz and K. Naharstedt, 2001, Multimedia: Computing, Communications &

28
 Applications, Pearson, Delhi.
3) S. Rimmer, 2000, Advanced Multimedia Programming , PHI, New Delhi..
Website and e-Learning Source :
1) http://www.cikon.de/Text_EN/Multimed.html

Title of the Practical – VII: RDBMS Lab

Course/ Paper
Core - 21 II Year & Fourth Semester Credit: 2

1. Library Information Processing.

2. Students Mark sheet processing.
3. Telephone directory maintenance.
4. Gas booking and delivery system.
5. Electricity Bill Processing.
6. Bank Transactions (SB).
7. Pay roll processing.
8. Inventory
9. Question Database and conducting quiz.
10. Purchase order processing.

Title of the Practical – VIII: Multimedia Systems Lab

Course/ Paper
Core - 22 II Year & Fourth Semester Credit: 2

Flash:

1) To Move an object, to move an object in the path

2) Text flip, Text color change,
3) Creating a link using texts and objects, change the color of the object.
4) Shape Tweening and Using shape hints, Motion tweening, hybrid tweening.
5) Character Animation, Object Animation, Drawing Images
6) An application to show the masking effect.
7) Slide show presentation.

29
Photoshop:
1. To create a greeting card, Create background picture
2. Text effects, photo effects
3. Color , Buttons
4. Editing Images
5. Designing web page
Dream weaver
1. Text Management
2. Tables – Layers
3. Creating menu bar
4. Creating Pages and sites
5. Animation in images

Title of the Object Oriented Analysis and Design

Course/ Paper
Core - 23 III Year & Fifth Semester Credit: 3

Unit 1: System Development - Object Basics - Development Life Cycle - Methodologies - Patterns -
Frameworks - Unified Approach - UML.
Unit-2: Use-Case Models - Object Analysis - Object relations - Attributes - Methods – Class and Object
responsibilities - Case Studies.
Unit 3: Design Processes - Design Axioms - Class Design - Object Storage - Object Interoperability - Case
Studies.
Unit-4: User Interface Design - View layer Classes - Micro-Level Processes - View Layer Interface - Case
Studies.
Unit-5: Quality Assurance Tests - Testing Strategies - Object orientation on testing - Test Cases - test Plans -
Continuous testing - Debugging Principles - System Usability - Measuring User Satisfaction - Case Studies.
Recommended Texts

(i) Ali Bahrami, Reprint 2009, Object Oriented Systems Development, Tata McGraw Hill
International Edition.
Reference Books

30
 (i) G. Booch, 1999, Object Oriented Analysis and design, 2nd Edition, Addison Wesley, Boston
(ii) R. S.Pressman, 2010, Software Engineering A Practitioner‟s approach, Seventh Edition, Tata
McGraw Hill, New Delhi.
(iii) Rumbaugh, Blaha, Premerlani, Eddy, Lorensen, 2003, Object Oriented Modeling And
design , Pearson education, Delhi.

Title of the Web Based Application Development

Course/ Paper
Core - 24 III Year & Fifth Semester Credit: 3

Unit 1: Exploring Visual Studio IDE – Toolbox Control, user control creation – menus, Toolbars and Dialog
boxes. Programming fundamentals - Variables, formulas and .NET Framework- Decision Structures – Loops
and Timers.
Unit 2: Debugging Visual Basic programs – Structured Error Handling – Modules and Procedures – Arrays
– Collections and System. Collections Namespace. Exploring Text Files and String Processing. Managing
windows forms and controls – Inheriting forms and creating base classes.
Unit 3: Database – Introduction to ADO.NET – Bound Controls, SQL Statements, LINQ, Filtering data.
Data Representation using the DataGridView control.
Unit 4: Web Application Basics – ASP.NET Application Fundamentals – The Page Rendering Model –
Custom Rendering Controls – Composite Controls – Control potpourri – Web Parts – Configuration – Data
Binding – Web site navigation – personalization.
Unit 5 : Caching and State management – Session State – Application Data Caching – Caching Output –
Diagnostics and Debugging –The HTTP Application class and HTTP Modules – Custom Handlers.
ASP.NET Web services- windows communication foundation, Ajax, ASP.NET and WPF Content.

Recommended Text
1) M. Halvorson, 2009, Microsoft Visual Basic 2008 Step by Step, Prentice Hall of India.
2) G. Shepherd, 2009,Microsoft ASP.NET 3.5 step by step, Prentice Hall of India
Reference Books
1. B. Evjen, S. Hanselman, D. Rader, 2008, Beginning ASP.NET 3.5 in C# and VB, Wrox
Publications.
2. M. MacDonald, 2007, Beginning ASP.NET in VB 2008 from Novice to professional, second edition,
Aprèss Publications

31
Website and e-Learning Source: http://docserve.wordpress.com/2011/04/18/complete-dot-net-notes/

Title of the Practical – IX: Web Based Application Development Lab

Course/ Paper
Core - 25 III Year & Fifth Semester Credit: 2

1) Write a VB.NET Desktop application and demonstrate the following (a) Link Label control that opens
a web browser in your Visual basic applications (b) Dialog box controls, toolbars and menus.
2) Write a VB.NET desktop application to demonstrate error handling and debugging options.
(3) Write a VB.NET desktop application to demonstrate .NET framework classes with mathematical
methods.
(4)Write a suitable VB.NET Desktop application and demonstrate the following: (a) Input Box (b)List
Box(c)Masked Textbox
(5)Write a VB.NET desktop application to demonstrate how to use a Timer control to create a logon
program with a password time-out feature
(6) Write a VB.NET desktop application to demonstrate how to create and manipulate large integer
arrays. And Demonstrates the Array. sort and Array. Reverse methods and how to use a Progress Bar
control to give the user visual feedback during long sorts.
(7)Write a VB.NET desktop application to demonstrate a simple note-taking utility that demonstrate the
how to manage Open. Copy, save As, Insert Date, Sort Text, and Exit commands in a program.
(8)Write a VB.NET desktop application to demonstrate how controls are added to a windows form at run
time by using program code (not the designer).
(9)Write a VB.NET desktop application to demonstrate the graphics methods in the system.Drawing
namespace, including DrawEcllipse, Fill Rectangle, and DrawCurve.
(10)Write a VB.NET desktop application to demonstrate how to create new classes, properties, and
method.
(11)Write a VB.NET desktop application to demonstrate how ADO.NET is used to establish a
connection to a MSAccess database and show how the DataGridView control is used to display
multiple tables of data on a form. Also demonstrate how navigation bars, datasets, and table adapters
are interconnected and bound to objects on a form.
(12)Create a web application and demonstrate rendering control tags and server-side controls and user
controls.
(13)Create a web application and demonstrate control validation, the TreeView, and the

32
 MultiView/View Controls.
(14)Create a web applications and demonstrate databinding to several different controls, including the
GridView. Also illustrate loading and saving data sets as XML and XML schema.
(15)Create a web application and demonstrate session state within a web application.

Title of the Practical – X:Mini Project

Course/ Paper
Core - 26 III Year & Fifth Semester Credit: 2

Each student will develop and implement individually application software based on any emerging
latest technologies.

Title of the Project & Viva-Voce

Course/ Paper
Core-27 III Year & Sixth Semester Credit: 20

The project work is to be carried out either in a software industry or in an academic institution for
the entire semester and the report of work done is to be submitted to the University.

List of Electives

Title of the Digital Image Processing

Course/ Paper
Elective - 1 II Year & Fourth Semester Credit: 3

Unit 1: Introduction – steps in image processing - Image acquisition - representation - sampling and
quantization - relationship between pixels. – color models – basics of color image processing.

Unit-2: Image enhancement in spatial domain – some basic gray level transformations – histogram
processing – enhancement using arithmetic, logic operations – basics of spatial filtering and smoothing.

Unit 3: Image enhancement in Frequency domain – Introduction to Fourier transform: 1- D, 2 –D DFT and
its inverse transform - smoothing and sharpening filters.

Unit 4: Image restoration: Model of degradation and restoration process – noise models – restoration in the
presence of noise- periodic noise reduction. - Image segmentation: Thresholding and region based
segmentation.
Unit 5: Image compression: Fundamentals – models – information theory – error free compression –Lossy
compression: predictive and transform coding - JPEG standard.

33
Recommended Texts:
1) R.C. Gonzalez, R.E. Woods, 2009, Digital Image processing, 3rd Edition, Pearson Education.
(http://www.imageprocesssingplace.com/DIP/dip-downloads)

Reference Books
1)Pratt. W.K., Digital Image Processing, 3rd Edition, John Wiley & Sons.

2) Rosenfled A. & Kak, A.C, 1982, Digital Picture Processing, vol .I & II, Academic Press.

Website and e-Learning Source: http://www.imageprocesssingplace.com/DIP/dip-downloads

Title of the E – Commerce

Course/ Paper
Elective - 1 II Year & Fourth Semester Credit: 3

Unit 1: Introduction to Electronic Commerce: Electronic Commerce Framework – Electronic Commerce

and Media Convergence – The Anatomy of E-Commerce Applications – Electronic Commerce Consumer
Applications – Electronic Commerce Organization Applications. The Network Infrastructure for Electronic
Commerce: Components of the I way – Network Access Equipment – Global information Distribution
Networks.
Unit 2: The Internet as a Network Infrastructure: The Internet Terminology – NSFNET: Architecture and
Components – National Research and Education Network – Globalization of the Academic Internet - Internet
Governance – An overview of Internet Applications.
The Business of Internet Commercialization: Telco/Cable/On-Line Companies - National Independent ISPs –
Regional Level ISPs – Local –level ISPs – Service Provider Connectivity - Internet Connectivity options.
Unit 3: Network Security and Firewalls: Client Server Network Security and Threats. Electronic Commerce
and the World Wide Web: Architectural Framework for Electronic commerce – World Wide Web (WWW)
as the Architecture – Hypertext Publishing - Technology behind the Web – Security and the Web. Consumer-
Oriented Electronic Commerce: Consumer-Oriented Applications – Mercantile process models – Mercantile
Models from the Consumers and the Merchant‟s Perspective.
Unit 4: Electronic Payment Systems: Types of Electronic Payment Systems – Digital Token based
Electronic Payment Systems – Smart Cards and Credit Card – Based Electronic Payment Systems – Risk and
Electronic Payment Systems – Designing Electronic Payment Systems. Inter-organizational Commerce and
EDI: Electronic Data Interchange –Applications in Business –Legal, Security and Privacy issues - Internet –
Based EDI.

34
Unit 5: Advertising and the Marketing on the Internet: The New Age of Information based marketing and
Advertising on the Internet – Consumer Search and Resource Discovery Paradigms and Retrieval -
Electronic Commerce Catalogs or Directories – Information filtering – Consumer – Data Interface :
Emerging Tools. On Demand Education and Digital Copyrights: Computer based Education and Training –
Technological Components of Education on demand. Software Agents: Characteristics and Properties of
Agents – The Technology behind Software Agents – Applets, Browsers and Software Agents- Software
Agents in Action.

Recommended Texts

1) Ravi Kalakota and Andrew B. Whinston, Eleventh Impression, 2011,, Frontiers of Electronic
Commerce, Pearson Education Inc., Delhi.
Reference Books

1) Daniel Minoli, and Emma Minoli, Seventh Reprint 2003, Web commerce Technology Handbook,
Tata McGraw Hill, New Delhi.
Title of the Information Security
Course/ Paper
Elective - 1 II Year & Fourth Semester Credit: 3

Unit 1: Introduction: Security- Attacks- Computer criminals- Method of defense Program Security: Secure
programs- Non-malicious program errors- Viruses and other malicious code- Targeted malicious code-
Controls against program threats
Unit 2: Operating System Security: Protected objects and methods of protection- Memory address
protection- Control of access to general objects- File protection mechanism- Authentication: Authentication
basics- Password- Challenge-response- Biometrics.
Unit 3: Database Security: Security requirements- Reliability and integrity- Sensitive data- Interface-
Multilevel database- Proposals for multilevel security
Unit 4: Security in Networks: Threats in networks- Network security control- Firewalls- Intrusion detection
systems- Secure e-mail- Networks and cryptography- Example protocols: PEM- SSL- Ipsec.
Unit 5: Administrating Security: Security planning- Risk analysis- Organizational security policies- Physical
security - Legal- Privacy- and Ethical Issues in Computer Security - Protecting programs and data-
Information and law- Rights of employees and employers- Software failures- Computer crime- Privacy-
Ethical issues in computer society- Case studies of ethics.
Recommended Text

35
 1) C. P. Pfleeger, and S. L. Pfleeger, Security in Computing, Pearson Education, 4th Edition,
2003
2) Matt Bishop, Computer Security: Art and Science, Pearson Education, 2003.
Reference Books
1) Stallings, Cryptography & N/w Security: Principles and practice, 4th Edition, 2006
2) Kaufman, Perlman, Speciner, Network Security, Prentice Hall, 2nd Edition, 2003
3) Eric Maiwald, Network Security : A Beginner‟s Guide, TMH, 1999
4) Macro Pistoia, Java Network Security, Pearson Education, 2nd Edition, 1999
5) Whitman, Mattord, Principles of Information Security, Thomson, 2nd Edition, 2005

Website and e-Learning Source

1) http://www.cs.gsu.edu/~cscyqz/courses/ai/aiLectures.html
2) http://www.eecs.qmul.ac.uk/~mmh/AINotes/

Title of the Big Data Analytics

Course/ Paper
Elective - 2 III Year & Fifth Semester Credit: 4

Unit 1: Basic nomenclature - Analytics process model - Analytics model requirements - Types of data
sources – Sampling - types of data elements - Visual Data Exploration and Exploratory Statistical Analysis -
Missing Values - Outlier Detection and Treatment - Standardizing Data – Categorization - weights of
evidence coding - Variable selection -Segmentation.
Unit 2: Predictive Analytics: Target Definition - Linear Regression - Logistic Regression - Decision Trees -
Neural Networks - Support Vector machines - Ensemble Methods - Multiclass Classification Techniques -
Evaluating Predictive Models.
Unit 3: Descriptive Analytics: Association Rules - Sequence Rules - Segmentation. Survival Analysis:
Survival Analysis Measurements - Parametric Survival Analysis.
Unit 4: Social Network Analytics: Social Network Definitions - Social Network Metrics - Social Network
Learning -Relational Neighbor Classifier - Probabilistic Relational Neighbor Classifier -Relational logistic
Regression - Collective Inference.
Unit 5: Benchmarking - Data Quality - Software – Privacy - Model Design and Documentation - Corporate
Governance. Example applications: Credit Risk Modeling - Fraud Detection - Recommender Systems - Web
Analytics.
Recommended Text:

36
 1) Baesens, 2014, Analytics in a Big Data World: The Essential Guide to Data Science and Its
applications, Wiley India Private Limited

Reference Books
1) Michael Minelli, Michele Chambers, 2013, Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today‟s Businesses, Wiley CIO
2) Stephan Kudyba, 2014, Big Data, Mining and Analytics: Components of Strategic Decision
Making, CRC Press.
3) Frank J. Ohlhorst, 2013, Big data Analytics: Turning Big Data into Big Money, Wiley and SAS
Business Series.
4) Foster Provost, Tom Fawcett, 2013, Data Science for Business, SPD.

Title of the Software Testing

Course/ Paper
Elective - 2 III Year & Fifth Semester Credit: 4

Unit 1: Introduction: Purpose – Productivity and Quality in Software – Testing Vs Debugging – Model for
Testing – Bugs – Types of Bugs – Testing and Design Style
Unit 2: Flow/Graphs and Path Testing – Achievable paths – Path instrumentation – Application –
Transaction Flow Testing Techniques – Data Flow Testing Strategies
Unit 3: Domain Testing: Domains and Paths – Domains and Interface Testing – Linguistic –Metrics –
Structural Metric – Path Products and Path Expressions
Unit 4: Syntax Testing – Formats – Test Cases – Logic Based Testing – Decision Tables – Transition
Testing – States, State Graph, State Testing.
Unit 5: Verification and Validation – Fundamental Tools - Levels of Testing – Testing Approaches – Types
of Testing – Test Plan – Software Testing Tools: WinRunner – Silk Test
Recommended Text
1) B. Beizer , 2003, Software Testing Techniques, II Ed., DreamTech India, New Delhi.
2) K.V.KK. Prasad , 2005, Software Testing Tools, DreamTech. India, New Delhi.
Reference Books
1) I. Burnstein, 2003, Practical Software Testing, Springer International Edn.
2) E. Kit, 1995, Software Testing in the Real World: Improving the Process, Pearson Education, Delhi.
3) R.Rajani, and P.P.Oak, 2004, Software Testing, Tata Mcgraw Hill, New Delhi.
Website and e-Learning Source
1) http://www.amazon.com/gp/reader/0201877562/ref=sib_dp_pt/102-1957971- 9723354#reader -link

Title of the Theory of Computation

Course/ Paper

37
Elective - 2 III Year & Fifth Semester Credit: 4

Unit 1: Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite
Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite
Automata (NFA) – Finite Automata with Epsilon transitions.
Unit 2: Regular Expression – FA and Regular Expressions – Proving languages not to be
regular – Closure properties of regular languages – Equivalence and minimization of
Automata.
Unit 3: Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition
of the Pushdown automata – Languages of a Pushdown Automata –
Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata.
Unit 4: Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines
– Programming Techniques for TM. A language that is not Recursively Enumerable (RE)
Unit 5: – An undecidable problem RE – Undecidable problems about Turing Machine – Post‟s
Correspondence Problem – The classes P and NP.
Recommended Text
1.Peter Linz, “An Introduction to Formal Languages and Automata”, Third Edition ,Narosa, 2005
2. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages and
Computations”, second Edition, Pearson Education, 2007.
Reference Books
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”, Second Edition, Pearson
Education, 2003.
2. Thomas A. Sudkamp,” An Introduction to the Theory of Computer Science,Languages and Machines”,
Third Edition, Pearson Education, 2007.
3. Raymond Greenlaw an H.James Hoover, “ Fundamentals of Theory of Computation, Principles and
Practice”, Morgan Kaufmann Publishers, 1998.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.
5. J. Martin, “Introduction to Languages and the Theory of computation,” Third Edition, Tata Mc Graw Hill,
2007

Title of the Mobile Computing

Course/ Paper
Elective - 3 III Year & Fifth Semester Credit: 4

Unit 1: Introduction - Mobile and Wireless Devices – Simplified Reference Model – Need for Mobile
Computing –Wireless Transmissions –Multiplexing – Spread Spectrum and Cellular Systems- Medium
Access Control – Comparisons.
Unit 2: Telecommunication Systems – GSM – Architecture – Sessions – Protocols – Hand Over and
Security – UMTS and IMT – 2000 – Satellite Systems.
Unit 3: Wireless Lan - IEEE S02.11 – Hiper LAN – Bluetooth – Security and Link Management.

38
Unit 4: Mobile network layer - Mobile IP – Goals – Packet Delivery – Strategies – Registration – Tunneling
and Reverse Tunneling – Adhoc Networks – Routing Strategies
Unit 5: Mobile transport layer - Congestion Control – Implication of TCP Improvement – Mobility –
Indirect – Snooping – Mobile – Transaction oriented TCP - TCP over wireless – Performance.
Recommended Text
1) J. Schiller, 2003, Mobile Communications,2nd edition, Pearson Education, Delhi.

Reference Books
1) Hansmann, Merk, Nicklous, Stober, 2004, Principles of Mobile Computing, 2nd Edition, Springer
(India).
2) Pahlavan, Krishnamurthy, 2003(2002), Principle of wireless Networks: A unified Approach,
Pearson Education,Delhi.
3) Martyn Mallick, 2004, Mobile and Wireless Design Essentials, Wiley Dreamtech India Pvt. Ltd.,
NewDelhi.
4) W.Stallings, 2004, Wireless Communications and Networks, 2nd Edition, Pearson Education, Delhi.

Website and e-Learning Source

1) http://csbdu.in/pdf/mobile%20communication.pdf

Title of the Cloud Computing

Course/ Paper
Elective - 3 III Year & Fifth Semester Credit: 4

Unit 1: UNDERSTANDING CLOUD COMPUTING: Cloud Computing –History of Cloud Computing –

Cloud Architecture –Cloud Storage –Why Cloud Computing Matters –Advantages of Cloud Computing –
Disadvantages of Cloud Computing –Companies in the Cloud Today –Cloud Services
Unit 2: DEVELOPING CLOUD SERVICES: Web-Based Application –Pros and Cons of Cloud Service
Development –Types of Cloud Service Development –Software as a Service –Platform as a Service-
Infrastructure as a service –Web Services –On-Demand Computing –Discovering Cloud Services
Development Services and Tools –Amazon Ec2 –Google App Engine –IBM Clouds
Unit 3:CLOUD COMPUTING FOR EVERYONE: Centralizing Email Communications –Collaborating on
Schedules –Collaborating on To-Do Lists –Collaborating Contact Lists –Cloud Computing for the
Community –Collaborating on Group Projects and Events –Cloud Computing for the Corporation
Unit 4:USING CLOUD SERVICES: Collaborating on Calendars, Schedules and Task Management –
Exploring Online Scheduling Applications –Exploring Online Planning and Task Management –

39
Collaborating on Event Management –Collaborating on Contact Management –Collaborating on Project
Management –Collaborating on Word Processing -Collaborating on Databases –Storing and Sharing Files
Unit 5: OTHER WAYS TO COLLABORATE ONLINE: Collaborating via Web-Based Communication
Tools –Evaluating Web Mail Services –Evaluating Web Conference Tools –Collaborating via Social
Networks and Groupware –Collaborating via Blogs and Wikis
Recommended Text
1) Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and
Collaborate Online, Que Publishing, August 2008.
2) Kumar Saurabh, “Cloud Computing –Insights into New Era Infrastructure”, Wiley Indian Edition,
2011.
3) Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-
demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited,
July 2008

Title of the Artificial Neural Networks

Course/ Paper
Elective - 3 III Year & Fifth Semester Credit: 4

Unit 1: Introduction to Neural Networks – Basic Concepts of Neural Networks – Inference and Learning –
Classification Models – Association Models – Optimization Models – Self-Organization Models.
Unit 2: Supervised and Unsupervised Learning – Statistical Learning – AI Learning – Neural Network
Learning – Rule Based Neural Networks – Network Training – Network Revision- Issues- Theory of
Revision- Decision Tree Based NN – Constraint Based NN
Unit 3: Incremental learning – Mathematical Modeling – Application of NNKnowledge based Approaches.
Unit 4: Heuristics- Hierarchical Models – Hybrid Models – Parallel Models – Differentiation Models-
Control Networks – Symbolic Methods- NN Methods.
Unit 5: Structures and Sequences – Spatio-temporal NN – Learning Procedures – Knowledge based
Approaches.
Recommended Text
1) L. Fu, 1994, Neural Networks in Computer Intelligence, Tata McGraw Hill, New Delhi.
Reference Books
1) R. J. Schalkoff, 1997, Artificial Neural Networks, Tata McGraw Hill, New Delhi.
2) Anderson, 2001, An Introduction to Neural Network, PHI, New Delhi.
*****

40