master of computer applications - rvs mcamca.rvscas.ac.in/upload/mca_2011_2012-1.pdf · master of...

MASTER OF COMPUTER APPLICATIONS

REGULATIONS, SCHEME AND SYLLABI

RVS College of Arts and Science (Autonomous)

(Affiliated to Bharathiar University,

NAAC Reaccredited and ISO 9001:2008 Certified)

Sulur, Coimbatore – 641 402, Tamil Nadu, India.

No. Particulars Page No.

1 Preamble i

2 Vision i

3 Mission i

4 Objectives of the Course ii

5 Eligibility for Admission ii

6 Duration of the Course ii

7 Attendance and Progress ii

Examinations iii

A. Continous Internal Assessment (CIA) iii 8

B. End of Semester Examinations v

9 Passing Requirements vi

10 Classification vi

11 Procedure for Completing the Course vi

12 Award of the Degree vii

Scheme of Examinations / Subject Syllabi and

Description of Curricular Components vii

Semester-I viii

Semester-II ix

Semester-III x

Semester-IV xi

Semester-V xii

Semester-VI and Consolidated Scheme at a glance xiii

Additional Credits xiv

13

List of Electives xv

SEMESTER – I

Digital Computer Organization and Architecture 1

Relational Database Management Systems 3

Computing Skills and Programming in C 5

Accounting and Financial Management 8

Essentials of Mathematics for Computer Applications 10

Employability Skills-I 12

Practical-I: C Programming 14

Practical-II: Oracle 15

SEMESTER – II

Object Oriented Programming with C++ 16

Data Structures and Algorithms through C++ 18

Operating Systems 20

Computer Networks 22

Software Engineering 24

Employability Skills-II 26

Practical-III: OOPs and Data Structures through C++ 28

Practical-IV: Operating Systems 29

SEMESTER – III

Java Programming 30

Visual Programming 32

Principles of Compiler Design 34

Unified Modeling Language 36

Operations Research 38

Employability Skills-III 40

Practical-V: Java Programming 42

Practical-VI: VB and VB.NET Programming 43

SEMESTER – IV

C# Programming 44

J2EE Programming 45

Software Testing 47

Elective-I

e-Commerce 49

Mobile Computing 51

Embedded Systems 53

Internet and Web Design 55

Elective-II

PHP Programming 57

Python Programming 59

Perl Programming 61

SQL Server 63

Employability Skills-III 65

Practical-VII: C# and J2EE Programming 67

Practical-VIII: Software Testing 68

SEMESTER – V

Digital Image Processing 69

J2ME 71

ASP.NET 73

Elective-II

Network Security 75

Web Services 77

Data Mining and Data Warehousing 79

Artificial Intelligence and Expert Systems 81

Employability Skills-V 83

Practical-IX: J2ME Programming and MATLAB 85

Practical-X: ASP.NET Programming 86

SEMESTER – VI

Project Work and Viva voce ---

RVS College of Arts and Science (Autonomous), Coimbatore


Effective from the Academic Year: 2011-2012

i

1. PREAMBLE

The Department of Master of Computer Applications (MCA) is one of the pioneer

Departments started in 1989. Since then under the eminent guidance of the management,

it has grown and has become one of the biggest Departments in the College.

Under its roof are dynamic, well-qualified, experienced teaching and non-teaching

members of staff. Close to 180 students are studying in the MCA course.

The Department has constantly shown progress towards the benefit of the students. The

course highlights the overall development of a student through various co-curricular and

extra curricular activities. The Department organises various activities such as Seminars,

Workshops, Conferences, Guest Lectures and Technical Sessions, which enable the

students to equip them with the latest trends in the IT industry. The Department also

organizes foundation courses which help the students orient and develop various skills

such as personality, communication, leadership quality, interpersonal relationship, etc.

The Department catalyses the organizing skills of the students through the inter-collegiate

and inter-departmental events such as RADIANCE and SANKALP. Software

development and paper presentation contests are quite frequently organised in the

Department to enable the students develop their technical skills. The Department has

well-equipped state-of-the-art computer laboratory and spacious classrooms which enable

a healthy teaching-learning process. The Department holds 100% results since 2007. The

Department has constantly bagged University Ranks when the College was non-

autonomous. The Department has a separate placement cell and has an excellent

placement record. Most of the students who have passed out have been placed in reputed

firms.

2. VISION

To create a centre of excellence for the students, prepare them to be industry-ready and

achieve academic excellence by continuous upgradation of the members of faculty in

terms of research.

3. MISSION

The Department of Computer Applications (MCA) strives to provide quality and

competency-based education through necessary infrastructure and fine-tune the younger

generation to encounter the challenges ahead with courage.




ii

4. OBJECTIVES OF THE COURSE

• Introduce at least one paper that enhances the employability skills of the students.

• Introduce at least two new teaching methodologies namely demonstrative

teaching and teaching with case studies along with the existing methods.

• Achieve the best position in at least two events at the

intercollegiate/university/state/national level technical meets, in the co-curricular

stream.

• Strengthen the alumni network by holding an alumni meet every year to support

the placement activities.

• Focus on 100% placement of the student aspirants.

• Achieve 100% results in the final examination.

• Ensure that each member of the faculty attends at least one training program

every year based on his/her specialization.

• Ensure that there are at least five research publications (national/international)

from the Department every year.

5. ELIGIBILITY FOR ADMISSION

A Pass in any Degree with Mathematics at +2 level or a pass in any Degree with at least

one paper in Mathematics or Statistics at Degree level.

Tamil Nadu Common Entrance Test (TANCET) and Common Entrance Test (CET) are

the exams that would be conducted in the month of May and September respectively. To

get admission in MCA Programme, taking any one of the above mentioned exams and

producing the scores obtained is mandatory.

6. DURATION OF THE COURSE

The course shall be offered on a full-time basis. The course consists of five semesters of

course work along with laboratory work and the sixth semester shall be major project

work.

7. ATTENDANCE AND PROGRESS

Students will be required to secure at least 75% of attendance in a semester to be

permitted to appear for the examination of that semester. Students who earn 65%-74% of

attendance will be eligible for condonation of the shortfall, up to 10%, upon application




iii

citing proper and genuine grounds, at the discretion of the Principal. Students who have

attendance between 55% and 64% in a semester will not be allowed to write the regular

End of Semester Examinations (EOSE) of the semester, but may be permitted to proceed.

They may be permitted to proceed to the next semester where they shall be required to

put up additional attendance to make up for the previous semester’s shortage of

attendance as a condition for being allowed to write the following semester examinations,

failing which they shall redo the course beginning from the semester of first default.

Those who put in less than 55% of attendance in a semester shall not be eligible to

proceed with the course and shall be required to redo the course of the semester when it

is offered next. The provision for proceeding to the next semester despite attendance

shortfall for those in the 55% to 64% range of attendance shall be available to a student

only once during the course of study.

8. EXAMINATIONS

Students are evaluated in each Theory and Practical paper through two components:

A. Continuous Internal Assessment (CIA)

B. End of Semester Examinations (EOSE)

Students are evaluated in their Major Project through two components:

A. Continuous Internal Assessment (CIA) carrying a maximum of 80 marks

B. Viva voce Examination towards the End of Semester carrying a maximum of 120

marks

A. CONTINUOUS INTERNAL ASSESSMENT (CIA):

CIA has the following components with necessary break up of marks:

i). Theory

Components Marks

Mid-Term Examination 05

Domain Knowledge Test 05

Model Examination 10

Seminar/Assignment 05

Total 25




iv

ii). Practical

Components Marks

Model Examination 20

Observation 15

Attendance 05

Total 40

ii). Major Project

Components Marks

Review-1 10

Review-2 15

Review-3 30

Industry Assessment 25

Total 80

iii). CONDUCT OF MID-TERM, MODEL AND EOS EXAMINATIONS

Each semester would have a Mid-Term Examination and a Model Examination. The

Mid-Term Examination will be conducted at the end of the 45th day and the Model

Examination at the end of the 90th day from the commencement of the course. The

duration of the Mid-Term Examination is 2 hours with each subject being awarded a

maximum 50 marks and that for the Model Examination is 3 hours with each subject

being awarded a maximum of 75 marks. Question papers for both the examinations

would be set by the respective subject teachers in the pattern prescribed for the same. The

question papers for the Mid-Term and the Model Examinations are secured from the

respective subject teachers a week before the scheduled date of the examinations. The

answer scripts would be valued and handed over to the students within a week after the

examinations are over.

Students shall register for their regular subjects at the End of Semester Examinations and

for such of their arrear subjects as may be scheduled at that examination. Candidates

failing at the End of Semester Examinations shall register for the failed subjects at the




v

next End of Semester Examinations opportunity. A score that is less than the minimum

mark required to pass in a subject and absence at an examination opportunity shall lead to

a ‘RA’ (To Reappear) result and shown as such in the mark sheet.

B. END OF SEMESTER EXAMINATION (EOSE)

• End of Semester Examinations (EOSE) would be conducted at the end of each

semester after the completion a minimum of 90 working days.

• End of Semester Examinations for the Odd Semester would be held during

November/December and for the Even Semester it would be during April/May.

• The question papers for all the courses will be set by the External Examiners for

the EOSE.

• To keep the identity of the student’s confidential dummy number system will be

adopted.

• EOSE Question Paper Pattern (Theory):

Section Marks Type

A 5*2=10 Short Answer type

B 5*5=25 Either or Type

C 5*8=40 Either or Type

Due importance would be given to all the units in the Syllabi while setting the

Question Paper for EOSE.

• Practical Examinations/Project Viva voce: Practical examinations will be

conducted with one internal examiner and one external examiner. The question

paper for practical examinations will be jointly set by both internal and external

examiners. Project Viva voce would be held during the Even Semester, where

the students are required to defend their project in the presence of their internal

supervisors and external examiners.

• Retotaling: A candidate may request for retotaling of his/her answer scripts by

addressing to the Controller of Examinations through the Principal, paying the

prescribed fees. This provision will be available for all theory papers taken in

the current semester examination.




vi

• Revaluation: A candidate may request for revaluation of his/her answer scripts

by addressing to the Controller of Examinations through the Principal, paying

the prescribed fees. This provision will be available for all theory papers taken

in the current semester examination.

• Answer Script Verification: To protect the interests of students against

indifferent, indiscriminate and vindictive valuation, the copies of the valued

answer scripts of the EOS Examinations could be obtained by the students for

verification. This will enable them to satisfy themselves that all the questions

have been valued, correct marks awarded and totalling has been done correctly.

• Improvement: Candidates who have passed in a subject would be permitted to

appear once again for an examination to enable them to improve their marks in

that subject only once for the papers written in the previous semester.

9. PASSING REQUIREMENTS

The passing requirements for MCA course is as follows:

• Minimum pass marks in each paper is 50% (EOSE+CIA)

• Minimum pass marks in semester examination is 50%

• No minimum pass marks for CIA

10. CLASSIFICATION

Based on percentage of aggregate marks in the subjects counting for classification of all

semesters, successful candidates will be classified as follows:

75% of marks and above – I class with Distinction provided all examinations are cleared

in the first attempt (first eligible occasion). (A candidate who is ‘absent’ for an

examination and clears it in any of the subsequent semester examinations is not eligible

for the award of distinction).

60% and above, but below 75% - I Class

50% and above, but below 60% - II Class

11. PROCEDURE FOR COMPLETING THE COURSE

Candidates who complete the course fulfilling the requirements of attendance and

progress of all semesters and satisfying the passing requirements of all the subjects within

n + 2 years of their admission shall be declared to have qualified for the degree.




vii

A student who fails to clear any arrear subject/s within this n+2 years period will be

required to take the examinations thereafter only on the current syllabuses of the new

scheme. If such current scheme/syllabus does not contain the subject of the same title as

the one in which he/she has to appear, a paper may be set for him/her on the old syllabus

or he/she may be required to take the examination on an equivalent subject to be decided

by the Chairman of the Board of Studies/the Academic Council.

12. AWARD OF THE DEGREE

Students who successfully complete the course will be awarded the Degree of Master of

Computer Applications by the Bharathiar University on the recommendation of the

College.

13. SCHEME OF EXAMINATIONS / SUBJECT SYLLABI AND DESCRIPTION

OF CURRICULAR COMPONENTS




viii

Scheme of Examinations

Master of Computer Applications (MCA)

Effective from 2011-2012 batch onwards

(Under Choice Based Credit System)

SEMESTER – I

Marks No. Category Subject Hours/Week Credits

Examination Duration (in hours) CIA EOS Total

1 Major Theory Digital Computer Organization and Architecture 4 3 3 25 75 100

2 Major Theory Relational Database Management Systems 4 3 3 25 75 100

3 Major Theory Computing Skills and Programming in C 4 3 3 25 75 100

4 Non-major Theory Accounting and Financial Management 4 2 3 25 75 100

5 Non-major Theory Essentials of Mathematics for Computer Applications 4 2 3 25 75 100

6 Non-major Theory Employability Skills-I 4 3 3 25 75 100

7 Major Practical Practical-I: C Programming 5 4 3 40 60 100

8 Major Practical Practical-II: Oracle 5 4 3 40 60 100

Total 34 24 --- 230 570 800




ix

SEMESTER – II



9 Major Theory Object Oriented Programming with C++ 4 3 3 25 75 100

10 Major Theory Data Structures and Algorithms through C++ 4 3 3 25 75 100

11 Major Theory Operating Systems 4 3 3 25 75 100

12 Major Theory Computer Networks 4 3 3 25 75 100

13 Major Theory Software Engineering 4 3 3 25 75 100

14 Non-major Theory Employability Skills-II 4 3 3 25 75 100

15 Major Practical Practical-III: OOPs and Data Structures through C++ 5 4 3 40 60 100

16 Major Practical Practical-IV: Operating Systems 5 4 3 40 60 100

Total 34 26 --- 230 570 800




x

SEMESTER – III



17 Major Theory Java Programming 4 3 3 25 75 100

18 Major Theory Visual Programming 4 3 3 25 75 100

19 Major Theory Principles of Compiler Design 4 3 3 25 75 100

20 Major Theory Unified Modeling Language 4 3 3 25 75 100

21 Non-major Theory Operations Research 4 2 3 25 75 100

22 Non-major Theory Employability Skills-III 4 3 3 25 75 100

23 Major Practical Practical-V: Java Programming 5 4 3 40 60 100

24 Major Practical Practical-VI: VB and VB.NET Programming 5 4 3 40 60 100

Total 34 25 --- 230 570 800




xi

SEMESTER – IV



25 Major Theory C# Programming 4 3 3 25 75 100

26 Major Theory J2EE Programming 4 3 3 25 75 100

27 Major Theory Software Testing 4 3 3 25 75 100

28 Elective Theory Elective-I 3 3 3 25 75 100

29 Elective Theory Elective-II 3 3 3 25 75 100

30 Non-major Theory Employability Skills-IV 4 3 3 25 75 100

31 Major Practical Practical-VII: C# and J2EE Programming 5 4 3 40 60 100

32 Major Practical Practical-VIII: Software Testing 5 4 3 40 60 100

33 Mini-project Project Work and Viva voce 2 3 3 40 60 100

Total 34 26 --- 270 630 900




xii

SEMESTER – V



34 Major Theory Digital Image Processing 5 3 3 25 75 100

35 Major Theory J2ME 5 3 3 25 75 100

36 Major Theory ASP.NET 5 3 3 25 75 100

37 Elective Theory Elective-III 5 3 3 25 75 100

38 Non-major Theory Employability Skills-V 4 3 3 25 75 100

39 Major Practical Practical-IX: J2ME Programming and MATLAB 5 4 3 40 60 100

40 Major Practical Practical-X: ASP.NET Programming 5 4 3 40 60 100

Total 34 23 --- 205 495 700




xiii

SEMESTER – VI



41 Major Project Project Work and Viva voce --- 13 --- 080 120 200

Total --- 13 --- 080 120 200

CONSOLIDATED SCHEME AT A GLANCE

Marks Major Theory Elective Theory Non-major Theory Major Practical Project Credits CIA EOS Total

17 03 09 10 02 140 1245 2955 4200




xiv

ADDITIONAL CREDITS

No. Semester Type Title of the Paper No. of credits

Examination Duration (in hours)

Total Marks

1 II ACI-A Online Test I 2 (Optional) 2 (Purely Internal) 100

2 II ACII-A

ALCTA (Human Resource Management ) (Optional )

4 3 100

3 III ACII-B ALCTA (Animation Techniques) (Optional)

4 3 100

4 IV ACI-B Online Test II 2 (Optional) 2 (Purely Internal) 100

5 VI ACVI International Certification

(Optional) 10 -- -

Total 22 -- 400

• Online Tests I and II

o Online Test I would be conducted during the end of II Semester

o Online Test II would be conducted during the end of IV Semester

o The online tests will be conducted for 2 hours and for 50 marks each

o There would be 50 objective type questions based on the subjects of the I

and II Semesters

o The students have to earn a minimum of 25 marks to get through the paper.

In case of the students fail to earn the minimum marks, they would be given

the opportunity to reappear only during the consequent year

o Evaluation is done by the internal examiner appointed for the purpose

• ALCTA – Advanced Learners Course in Thrust Area

o Basically a paper introduced for fast learners

o Has only End of Semester Examination for 100 marks

o Students who are interested must clear the paper in single attempt

o Two ALCTA courses are offered in the II and III semesters. Student, on

passing will get 4 credits per ALCTA course




xv

• International Certification

o Students successfully acquiring International Certification in the field of

Computer Science and Applications are eligible for 10 additional credits




xvi

LIST OF ELECTIVES

SEMESTER – IV

ELECTIVE – I

• e-Commerce

• Mobile Computing

• Embedded Systems

• Internet and Web Design

ELECTIVE – II

• PHP Programming

• Python Programming

• Perl Programming

• SQL Server

SEMESTER – V

ELECTIVE – III

• Network Security

• Web Services

• Data Mining and Data Warehousing

• Artificial Intelligence and Expert Systems

RVS College of Arts and Science (Autonomous), Sulur, Coimbatore



1

First Semester

Major Theory: DIGITAL COMPUTER ORGANIZATION AND ARCHITECTURE

Objectives

• To demonstrate an understanding of the basic building blocks and their role in the

historical development of computer architecture

• To use mathematical expressions to describe the functions of simple

combinational and sequential circuits

Pedagogy

Lecturing, Group Discussion, LCD, OHP, Seminars, Mini-projects and

Assignments

Number of Credits: 3 Total Lecture Hours: 48

UNIT – I (8 Hours)

Introduction: Evaluations of Computer generations of Computers- Basics of Computer

Architecture –Stored program Architecture (Von Neumann Architecture) - Instruction

formats and types – addressing modes – stack organization.

UNIT – II (10 Hours)

Processor Design: Processor basics – CPU organization –data representation –

instruction sets – data path design – ALU – Floating point arithmetic –control design –

basic concepts – hard wired control – micro programmed control – pipeline control.

UNIT – III (10 Hours) Memory and I/O Systems: Memory technology-memory systems –virtual memory – high speed memories – interleaved memories- caches – design methods – associative memories – input / output system – programmed I/O – DMA and interrupts – I/O processor. UNIT – IV (10 Hours)

Parallel Processing: Parallelism in uni-processor system – parallel computer structures –

architectural classification schemes – pipelining – instruction and arithmetic pipelining–

principles of designing pipelined processors.




2

UNIT – V (10 Hours)

Advanced Computer Architecture: RISC machines – design principles – RISC versus

CISC – examples RISC architecture – fault tolerance computer.

References 1. Atul P Godse, Deepali A Godse, Computer Architecture, Technical Publications, 2nd

Edition.

2. Thomas L Floyd, Digital Fundamentals, Technical Publications, 8th Edition.




3

First Semester

Major Theory: RELATIONAL DATABASE MANAGEMENT SYSTEMS

Objectives

• To design, to implement and to query object-oriented databases

• To understand the fundamental concepts related to the database

• To understand the main solutions related to the strategies for storing objects,

transaction management, and security

Pedagogy


Assignments



Introduction to Database Systems: Overview – File Processing system VS DBMS -

Data Abstraction – Data Models – Database System Architecture – Instances and

Schemes – Data independence – DDL – DML – Database Users – Entity-Relationship

Model - Entity Sets – Keys – ER diagram – Structure – Extended E-R features


Relational Model:- Structure of Relational Databases – Relational Algebra – Extended

Relational Algebra Operations – Modification of Database – Views SQL :- Background

– Basic Structure – Set Operations - Aggregate Functions – Null Values – Nested Sub

queries – Complex Queries – Joined Relations – Data-definition language.

UNIT – III (10 Hours)

Integrity and Security: - Domain Constraints – Referential Integrity – Assertions –

Triggers – Security and Authorization – Authorization in SQL – Encryption and

Authentication. Relational Database Design: - Decomposition - Normalisation with

functional dependencies, Multi valued dependencies, join dependencies – Normal Forms




4

UNIT – IV (10 Hours)

PL/SQL : Introduction - Packaged Procedures - Creating Packaged Programs -

Cursors – Procedure Variables- Scalar Data types – Composite Data Type - Processing

Control – Exception Handling – Comments – Stored Procedures – The Standard Package

– Additional Topics


Oracle Forms: Introduction to Developer 2000 - Oracle Form Environment

References

1. Silberschatz, Korth, Sudarshan, Database System Concepts, 4th Edition, Tata

McGraw Hill Publications, 2002.

2. Oracle Corporation, Oracle Unleashed, 2nd Edition, Tech Media Publications.

3. Fred R McFadden, Jeffery A Hoffer, Mary B Prescott, Modern Database

Management, 5th Edition.




5

First Semester

Major Theory: COMPUTING SKILLS AND PROGRAMMING IN C

Objectives

• To impart the basic aspects in computing that are essential for a candidate from a

non-computing background

• To impart the programming skills needed for writing programs from basic to

advanced level

Pedagogy


Assignments



Introduction to Computers, Number Systems and Internet: History and Generations

of computers – Classification of programming languages – Operating Systems and their

types. Definitions: Compiler, Linker, Loader, Assembler, Interpreter, Algorithm, Flow

Chart and its components. General format for representing a number – Classification of

Number Systems: Positional and Non-positional. Positional Number Systems: Decimal,

Binary, Octal and Hexadecimal Number Systems – Conversion from one number system

to another – ASCII Coding. Internet: Evolution – Terminologies: WWW, FTP, HTML,

HTTP, Gopher, e-mail, browsers and protocol, Archie, Telnet and Search Engines.


Essentials of C Programming: Introductory Concepts: History of C, Significant features

of C. Building Blocks of C: Methodology of learning C, The C character set, C tokens –

Keywords and Identifiers, Rules for naming an identifier, Data types, Operators.

Instructions: type declaration, I/O, arithmetic, control, the function main (), conditional

branching, multiway branching, unconditional branching, why one shall not use goto

statement. Loop controls. Basic Programming Techniques: Editor and editing, Installing




6

the C compiler, Saving the work, the C compilation model, Executing a C program,

Using console I/O functions, First program in C, Simple programs involving calculations.

Understanding and debugging a C program.


Arrays, Structures and Unions: Introduction to Arrays. Single - dimensional and Multi-

dimensional numerical arrays, Simple programs. How character arrays are different from

that of numerical arrays, Single - dimensional and Multi - dimensional character arrays.

Simple programs. Structures and Unions: Why structures, Structure operators, Forms of

structure: Structure without a tag, Structure with a tag. Structure as a new data type.

Initializing structure variables. Structures within structures. Mutually referential

structures, Self - referential structures, Structures with bit fields. Array of structures.

Unions. Simple programs.


Pointers and Functions: Introduction: Why pointers, Pointer operators, Storing

addresses using pointers, Basic programming using pointers, Pointer arithmetic. Simple

programs. Pointers and Arrays: Pointers and numerical arrays, Pointers and character

arrays. Simple programs. Pointers and Structures: Accessing structure elements using

pointers, Linked lists-Implementation of singly linked lists. Functions: Why we need

functions, Types of functions, Function header, Function prototyping. Writing simple

functions. Functions and Arrays: Functions and numerical arrays, Functions and character

arrays. Functions and Pointers: Writing simple programs by passing pointers to functions

and receiving pointers from the functions. Functions, Pointers and Arrays: Functions,

pointers and one-dimensional numerical arrays, Functions, pointers and one-dimensional

character arrays. Recursive Functions: Why recursion, How recursive functions work and

writing simple programs using recursive logic.


Files, Command Line Arguments, Miscellaneous Topics: Introduction to Files: File

positions, High level file handling functions. File Operations: Opening a file, Outputting

to a file, Closing a file, Simple programs in files. Command line arguments, Simple

programs using command line parameters. Miscellaneous Topics: The C Pre-processor,




7

Pre-processor Directives, Writing macros in C, Storage Classes, Dynamic memory

allocation, coercion, enumeration, type definition, C debugging techniques.

References

1. Thiagarajan B, C For You, MJP Publishers, Chennai, June 2010.

2. Leon A, Leon M, Fundamentals of Information Technology, Vikas Publishing House

Pvt. Ltd., India, 2000

3. Kanetkar Y, Let Us C, 1st Edition, BPB Publications, New Delhi, 1991.

4. Kanetkar Y, Understanding Pointers in C, 3rd Edition, BPB Publications, New Delhi,

2001.

5. Sudha T, Poornima B, C Programming with Data Structures, Anmol Publications

Private Limited, New Delhi, 2005.

6. Venugopal K R, Prasad S R, Mastering C, Tata McGraw Hill Publications, New

Delhi, 2007.




8

First Semester

Non-major Theory: ACCOUNTING AND FINANCIAL MANAGEMENT

Objectives

• To learn the different accounting and financial management techniques and

methods

Pedagogy


Assignments



Accounting: Definition, Objectives, Advantages, accounting concepts and conventions,

methods of accounting – Journal and Ledger – Preparation of Trial Balance.


Trading A/c, Profit and Loss A/c and Balance Sheet – Depreciation – meaning, Methods

and Importance.


Ratio Analysis: Meaning – Advantages – Limitations – Classification of Ratio:

Profitability, Turnover and Solvency Ratios.


Budget and Budgetary Control: Meaning and Definition, Objectives of budgetary control

– Advantages and Limitations, Preparation of different types of budgets.


Marginal Costing: Meaning, Advantages – CVP analysis – BEP analysis – Uses and

Assumptions – Applications of Marginal Costing.




9

References

1. Murthy A, Chokalingam S M, Business Accounting, Emerald Publishers, 2005.

2. Ganeson S, Kalavathi S R, Financial and Management Accounting, Thirumalai

Publications, Nagercoil, 2006.

3. Jayachandran R, Financial and Management Accounting, Rudhra Publications, 2005.




10

First Semester

Non-major Theory: Essentials of Mathematics for Computer Applications

Objectives

• To provide with the essential ideas of Mathematics required for Computer

Applications and explain how they relate to scientific problem solving

• To understand how the mathematical concepts afford a means to generate

solutions in a manner that can be implemented on a digital computer

Pedagogy


Assignments



Note: No Derivations or Book Works shall be covered

The solution of numerical, algebraic and transcendental equations: The bisection

method – Iteration method – Regula falsi method – Newton-Raphson method - Horner’s

method. Solution of simultaneous linear algebraic equations: Gauss elimination

method – Gauss-Jordan method – Gauss-Jacobi method – Gauss-Seidel method.



Interpolation: Newton’s forward and backward interpolation formula for equal intervals

- Lagrange’s interpolation formula for unequal intervals. Numerical differentiation and

integration: Newton’s forward and backward difference formula to compute the

derivative – Trapezoidal rule - Simpson’s one-third rule - Romberg’s method. Numerical

solution of ordinary differential equations: Runge-Kutta method. Iterative method

for Eigen values: Power method.




11



Graph theory: Basic concept – Digraph - incidence and degree – subgraph - Graph

isomorphism, paths, cycles and connectedness. Trees: Centres in a tree. Logic: TF

Statements – connectives - atomic and compound Statement – Well formed formulae -

The truth table of a formula- Tautology.



Correlation Analysis: Karl Pearson’s coefficient of correlation - Spearman’s rank

correlation coefficient. Regression Analysis: Regression equations - Y on X and X on Y

only. Probability: Definitions of various terms - Addition and multiplication theorems -

Baye’s theorem (Simple problems only).



Sampling and tests of significance: Sampling of variables-Large samples - sampling of

variables-small samples - Chi-Square test. Analysis of Variance: One-way classification

- two-way classification.

References

1. Kandasamy P, Thilagavathy K, Gunavathi K, Numerical Methods, S Chand and

Company Limited, New Delhi, 3rd Revised Edition, 2005. (Units 1 and 2)

2. Venkatraman M K, Sridharan N, Chandrasekaran N, Discrete Mathematics, The

National Publishing Company, Chennai. (Unit 3)

3. Gupta S P, Statistical Methods (Revised Edition), Sultan Chand and Sons, New Delhi,

1979. (Units 4 and 5)




12

First Semester

Non-major Theory: EMPLOYABILITY SKILLS - I

Objectives

• To demonstrate an understanding of the basic building blocks of

employability skills

• To develop Technical Skills to excel in current industry needs

Pedagogy


Assignments



Articles, Past actions, Current and Regular actions, Future actions, Active and Passive

voice, Reported speech, Prepositions, Connectors


Subject-verb agreement, Determiners and Pronouns, Common grammar mistakes,

Punctuation, Modals, Conditionals & comparisons, Questions


Rearranging sentences, Guess who I am., Story making, Crossword puzzles


General Awareness


Advanced Oracle Applications: Triggers – Clustering Applications.

References

1. Raymond Morphy, Essential English Grammar (Intermediate), Cambridge University

Press, 2004.




13

2. Michael McCarthy, Felicity O’Dell, English Vocabulary in Use (Intermediate),

Cambridge University Press, 2009.

3. Sundaresan R, Everybody’s Guide to English, Emerald Publishers, 2005.

4. Job List India, Looking for JOB? Job Seeker’s Hand Book, Wintelligence Systems

Private Limited, December 2010.

5. Robert M Sherfield, Rhonda J Montgomrey, Patricia G Moody, Developing Soft

Skills, Pearson Publishing, 2010.




14

First Semester

Major Practical: PRACTICAL-I: C PROGRAMMING

Objectives

• Understand the concepts of programming language

• Understand the basic programming concepts

• To learn the programming concepts using the syntax and semantics of C

Pedagogy

Demonstration, group discussion, LCD, OHP and seminars

Executing the list of programs using the syntax and semantics of C

Number of Credits: 4 Total Practical Hours: 60




15

First Semester

Major Practical: PRACTICAL-II: ORACLE

Objectives

• Understand the concepts of Relational Database

• To learn the schemas and the table constraints

• Enable to learn about the normalization

Pedagogy

Using demonstrations, group discussion, LCD, OHP and seminars, developing

programs for various applications





16

Second Semester

Major Theory: OBJECT ORIENED PROGRAMMING WITH C++

Objectives

• To understand the complexities of the real world

• To formulate the problems in a better way giving high reliability, adaptability and

extensibility to the applications

• To implement the various concepts of object orientation

Pedagogy


Assignments



Introduction and Features: Fundamentals of object oriented programming – Procedure

oriented programming versus object oriented programming (OOP). Object oriented

programming concepts – Classes, Reusability, Encapsulation, Inheritance,

Polymorphism, Dynamic binding, Message passing. variables, types and type

declarations, user defined data types; increment and decrement operators, relational and

logical operators; if-else clause; conditional expressions, input and output statement,

loops, switch case, arrays, structure, unions, functions, pointers; pre-processor directives.


Classes, Objects and Member Function: Creation, accessing class members, Private

versus Public, Constructor and destructor, Objects. Member functions, Method definition,

Inline implementation, Constant member functions.


Overloading: Overloading member functions, Need for operator overloading, Prefix and

postfix, Overloading binary operators, Operator overloading, Instream / outstream

operator overloading.




17


Inheritance, Polymorphism and Virtual Functions: Definition of inheritance,

Protected, private and public data, Inheriting constructors and destructors, Constructor for

virtual base classes, Constructors and destructors of derived classes, Virtual functions,

Size of a derived class, Order of invocation, Types of Inheritance: Single inheritance,

Hierarchical inheritance, Multiple inheritance, Hybrid inheritance, Multilevel inheritance.

Virtual Functions: Importance of virtual function, Function call binding, Implementing

late binding, Need for virtual functions, Abstract base classes and pure virtual functions,

Virtual destructors.


Files: Components, Operations, Communication, Creation of file streams. Stream classes,

Header files, Updating files, Opening and closing a file, File pointers and their

manipulations. Detecting end-of file. Simple programs.

References

1. Herbert Schildt, C++: The Complete Reference, 3rd Edition, Tata McGraw Hill

Publications, New York, 2001.

2. Robert Lafore, Object Oriented Programming in C++, Galgotia Publications Pvt.

Ltd., Daryaganj, New Delhi, 2001.

3. Venugopal K R, Rajkumar, Ravishankar T, Mastering C++, Tata McGraw Hill

Publications, New Delhi, 1997.




18

Second Semester

Major Theory: DATA STRUCTURES AND ALGORITHMS THROUGH C++

Objectives

• To know the basic concepts of stack and queue

• To understand the fundamentals of algorithm design, including algorithm

Analysis, abstract data types, and techniques for algorithmic problem solving

• To analyse new problems and develop programs that solve them, expressed in an

imperative or functional programming language

Pedagogy

Lecturing, Group Discussion, LCD, OHP, Seminars and Assignments



Data Representation: Linear Lists-Formula Based Representation-Linked

Representation-Indirect Addressing – Applications: Bin sort, Radix sort, Heap sort,

Quick sort.


Arrays and Matrices: Arrays – Matrices- Special Matrices – Sparse Matrices - Stacks -

Queues – Hashing- Hash Table Representation .


Trees: Binary Trees – Representation of Binary Trees – Operations – ADT Binary Tree –

ADT Class Extensions – Applications – Search Trees: Binary Search Trees – AVL Trees.


Graph Representation: Graph and Digraphs -Representation of Networks –Class

Definitions-Graph - Iterators - Language Features-Search Methods-Applications.




19


Algorithms: Greedy Method – Applications –Topological – Minimum Cost Spanning

Trees – Divide and Conquer – Applications-Defective Chess Board – Merge - Selection-

Dynamic Programming- Backtracking.

References

1. Sartaj Sahni, Data Structures, Algorithms and Applications in C++, Tata McGraw

Hill Publications, 2000.

2. Timothy Budd, An Introduction to Object Oriented Programming, Pearson

Education, 2nd Edition.




20

Second Semester

Major Theory: OPEARTING SYSTEMS

Objectives


Perl Programming

• To use the functions of simple combinational and sequential implementations

Pedagogy


Assignments



Introduction: Computer System Structures – Computer System operation- I/O Structure-

Storage Structure- Storage Hierarchy- Hardware Protection and Network Structure.

Operating System Structures: System Components- Operating System Services- System

Calls - System Programs- System Structure- Virtual Machines- System Design and

Implementation- System Generation.


Process Management: Process Concept- Process scheduling- Operations on Processes-

Cooperating Processes- Inter-process Communication in Client Server Systems. CPU

Scheduling: Scheduling Concepts- Scheduling Algorithms- Algorithm Evaluation-

Multiple Processor Scheduling. Deadlock: Deadlock Problem- Characterization-

Prevention- Avoidance- Detection- Recovery- Combined Approach to Deadlock

Handling.


Memory Management: Background - Swapping- Contiguous Memory Allocation-

Paging, Segmentation with Paging- Virtual Memory – Demand Paging- Page




21

Replacement Thrashing. File System Interface: File Concept - Access Methods-

Directory Structure - File System Mounting- File System Protection.


I/O Systems: I/O Hardware - Kernel I/O Subsystem. Mass: Storage Structure – Disk

Structure - Disk Scheduling - Disk Management- Swap- Space Management - RAID

Structure - Disk Attachment- Stable – Storage Implementation- Tertiary - Storage

Structure.


Case Study: LINUX- Windows NT. Comparative Study of LINUX- Windows NT-

Installation of Multiple Operating Systems.

References

1. Silberschatz, Galvin and Gagne, Operating System Concepts, John Wiley & Sons,

Inc, 7th Edition, 2006.




22

Second Semester

Major Theory: COMPUTER NETWORKS

Objectives

• To know the basic concepts of computer networks

• To Learn the architecture of the network protocols

• Enable to learn the various routing algorithms

Pedagogy




Introduction: Use of computer networks – Network Hardware – Network software –

Reference models.


The Physical Layer: The Theoretical basis for data communication - transmission

Media – Wireless transmission – PSTN - Communication satellites– Mobile telephone

system.


Data link layer: Data link layer design issues – Error detection and correction –

Elementary data link protocols – Sliding window protocols – Protocol Verification-

Example data link Protocols. The Medium Access Control sub layer – The channel

allocation problem – Multiple access protocols- Ethernet- Wireless LANS - Bluetooth-

Data Link layer Switching.


Network layer: Network layer design issues – Routing algorithms – Congestion, Control

algorithms – Network layer in the internet. Transport layer: The transport service –

Elements of transport protocol – A simple transport protocol.




23


Transport layer: The internet Transport Protocols: UDP, TCP - Performance issues.

Application Layer – DNS - Electronic Mail - The World Wide Web - Multimedia.

References

1. Andrew S Tanenbaum, Computer Networks, 4th Edition, Pearson Education, 2005.

2. Green P, Computer Network Architectures and Protocols, Plenum Press, 1992.

3. Harry Katzan, Petrocelli A, An Introduction to Distributed Data Processing,

Princeton Publications, 2005.

4. Tittel, Schaum, Theory and Problems of Computer Networking, Tata McGraw Hill

Publications, 2004.

5. Godbole, Data Communication and Networking, Tata McGraw Hill Publications,

2002.




24

Second Semester

Major Theory: SOFTWARE ENGINEERING

Objectives

• To develop in students a critical understanding of issues related to the

engineering of large complex software systems

• To know how to develop a set of requirements

• To apply rigorous software analysis

• To design, code and test their work

Pedagogy




Introduction to Software Engineering: The Evolving Role of Software-A Generic

View of Software Engineering-A Layered Technology-Software Myths-Process Models-

Waterfall Model-Incremental Process Model-Evolutionary Process Models-Specialized

Process Models- Project Scheduling-Risk Management.


Software Metrics and Estimation: Software Measurements - Metrics for Software

Quality - Integrating Metrics within software process - Metrics for Analysis model -

Metrics for Design Model - Metric for Object-Oriented Design - Metrics for Source

Code-Metrics for Testing - Metrics for Maintenance - Observations on Estimation - The

Resources - Software Project Estimation - Decomposition Techniques - Software sizing -

Problem Based Estimation - Process Based Estimation - LOC and FP Based Estimation -

Empirical Estimation Models - COCOMO Model.


Design Concepts: Abstraction - Architecture – Modularity - Information Hiding -

Functional Independence – Refinement - Cohesion-Coupling - Design Model - Software




25

Architecture - Data Design - Alternative Design - Mapping Dataflow into a Software

Architecture - User Interface Design - The Golden Rules -Interface Design Steps -

Design Evaluation.


Testing Techniques: Software Testing Fundamentals - White box testing - Basis Path

Testing - Control Structure Testing-Black Box Testing - Overview of Object Oriented

Testing - Testing Strategies - Unit Testing-Integration Testing-Validation Testing -

System Testing-Art of Debugging - Test Case Design.


Advanced Software Engineering: Formal Methods - Basic Concepts – Component -

based Development - Domain Engineering - Software Reengineering - Reverse

Engineering – Restructuring - Forward Engineering - Web Engineering.

References

1. Roger S. Pressmen, Software Engineering-A Practitioners Approach, McGraw Hill,

6th Edition.

2. Richard Fairley, Software Engineering, McGraw Hill, 2005.

3. Engle Wood Cliffs, Software Engineering Economics, Prentice Hall of India.




26

Second Semester

Non-major Theory: EMPLOYABILITY SKILLS-II

Objectives

• To demonstrate an understanding of the basic building blocks of employability

skills


Pedagogy


Assignments



Names of things, places, etc, Actions words, Description of actions, Describing things,

people etc, 100 common phrases for everyday conversations, Idioms and phrases, Phrasal

verbs, Comprehension, Word endings, Tongue twisters, Common mistakes in

pronunciation.


Letter writing, Role play, Short movies documentaries, Create newspaper headlines,

Press conference, Debate


Verbal reasoning, Numerical reasoning, Non-verbal reasoning


General Awareness


Debugging Techniques in C: Declarations and Initializations, Control Instructions,

Floating Point Issues, Expressions, Functions, Pointers, Arrays, Strings, Bitwise

Operators, Memory Allocation.




27

References


Press, 2004.











28

Second Semester

Major Practical: PRACTICAL-III: OOPs AND DATA STRUCTURES THROUGH C++

Objectives

• To know the basic concepts of object oriented programming

• To learn the controls structures and the functionalities

• Enable to learn how to implement the logical usage of the language

Pedagogy

Using demonstration group discussion, LCD, OHP and seminars

Execute the list of programs in C++ (based on OOPs and DS)





29

Second Semester

Major Practical: PRACTICAL-IV: OPERATING SYSTEMS

Objectives

• To know the basic concepts of OS

• To implement the concepts of Shell Programming in UNIX

Pedagogy

Demonstration, group discussion, LCD, OHP and seminars

List of programs toe be executed in different OS





30

Third Semester

Major Theory: JAVA PROGRAMMING

Objectives

• To provide JAVA language fundamentals

• To enable them to write program using various packages

• It provides knowledge about web application

Pedagogy




The Genesis of Java: Java’s Lineage – Creation of Java – The Byte code – Data types,

Variables and arrays – Operators and Expressions – Decision Making and Looping:

while, do, for -Control Statements.


Introducing Classes: Class Fundamentals – Declaring Objects – Assigning Object

reference variables – Introducing Methods – Constructors – The this Keyword – String

Handling: String Methods – String Buffer - Garbage Collection.


Overloading Methods: Recursion – Static – final – Nested and Inner Classes –

Inheritance: Basics – Super – Multilevel Hierarchy – Method Overriding – Dynamic

Method Dispatch – Abstract Classes.


Packages and Interfaces: Packages – Access Protection – Importing Packages –

Interfaces – Exception Handling: Exception Handling Fundamentals – Exception Types –

Uncaught Exceptions – try and catch – Nested try – Java’s Built in Exceptions –

Multithreaded Programming: The Java Thread Model –Creating Multiple Thread –

Alive() and join() - Thread Priorities.




31


I/O and Applets: I/O Basics - Streams - Byte Streams and Character Streams - The

Predefined Streams - Reading Console Input - Writing Console Output – The Print Writer

Class – Reading and writing files – Applet Fundamentals.

References

1. Herbert Schildt, The Complete Reference Java 2, Tata McGraw Hill Publications, 5th

Edition.

2. Patrik Naughton, The Complete Reference Java, Tata McGraw Hill Publications, 7th

Edition.

3. Keyur Shab, Java 2 programming, Tata McGraw hill Publications, 2002

4. C. Xavier, Programming with Java 2, SciTech Publications (India) Pvt. Ltd., 2001.




32

Third Semester

Major Theory: VISUAL PROGRAMMING

Objectives

• To know the concepts and trends in Visual programming.

• To understand about the control structures and database connectivity.

Pedagogy




Elements of Visual Basic – Literals – Constants – Data Types – Variables – Operators –

Subroutines and Functions – Looping and decision control structures – If/Then/Else,

Select, For/Next, Do/Loop, While/Wend structures.


Intrinsic controls: Pointer, Label, Frame, Checkbox, Combo Box, HscrollBar, Timer,

DirListBox, Shape, Image, OLE, PictureBox, TextBox, Command Button, Option

Button, List Box, VscrollBar, DriveListBox, FileListBox, Line Controls usage and

properties – Adding controls to the Form – SDI & MDI Forms – Using Forms as objects

– Building classes and collections.


DDE – Methods, Properties, Events – Database Programming Data Tools – DAO, ADO,

OLEDB and RDO Database connections – ActiveX commands.


Essentials of VB.Net – Operators – Conditionals – Loops.


Windows Forms - Controls – Procedure - Scope – Exception Handling.




33

References

1. Content Development Group, Visual Basic 6.0, Tata McGraw Hill Publications, 2002.

2. Content Development Group, Visual Basic.NET Programming Black Book, Dream

Tech Publications, 2005.

3. Brian Siler, Jeff Spots, Learning Visual Basic 6.0, Enterprise Edition, Que

Publications, USA, 2000.




34

Third Semester

Major Theory: PRINCIPLES OF COMPILER DESIGN


Objectives

• To understand design and implement a lexical analyser

• To understand design and implement a parser

• To understand design code generation schemes

Pedagogy

Lecturing, Group Discussion, LCD, OHP and Seminar


Compilers - Analysis of the source program -Phases of a compiler -Cousins of the

Compiler - Grouping of Phases-Compiler construction tools -Lexical Analysis -Role of

Lexical Analyser - Input Buffering - Specification of Tokens.


Role of the parser -Writing Grammars -Context-Free Grammars - Top Down parsing -

Recursive Descent Parsing -Predictive Parsing -Bottom-up parsing - Shift Reduce Parsing

- Operator Precedent Parsing -LR Parsers -SLR Parse- Canonical LR Parser- LALR

Parser.


Intermediate languages -Declarations -Assignment Statements - Boolean Expressions -

Case Statements - Back patching - Procedure calls.


Issues in the design of code generator- The target machine -Runtime Storage

management -Basic Blocks and Flow Graphs - Next-use Information - A simple Code

generator - DAG representation of Basic Blocks - Peephole Optimization.


Introduction- Principal Sources of Optimization - Optimization of basic Blocks -




35

Introduction to Global Data Flow Analysis -Runtime Environments -Source Language

issues -Storage Organization - Storage Allocation strategies - Access to non-local names -

Parameter Passing.

References

1. Alfred Aho, Ravi Sethi, Jeffrey, Ullman, Compilers Principles, Techniques and

Tools, Pearson Education Asia, 2003.

2. Allen I. Holub, Compiler Design in C, Prentice Hall of India, 2003.

3. Henk Alblas and Albert Nymeyer, Practice and Principles of Compiler Building with

C, Prentice Hall of India, 2002.




36

Third Semester

Major Theory: UNIFIED MODELING LANGUAGE

Objectives

• To enable the students to draw various class diagrams using ATM Networks


Pedagogy




Introduction: UML – Notations and Meta model – Why do analysis and design? - An

outline development process - inception – elaboration – planning the construction phase –

construction – transition. Case Study: Diagrammatic representation of a dice game using

UML.


Use Cases: Use cases diagrams – actors – relationships –Use cases. Class Diagrams:

Perspectives – associations – attributes – operations – generalization – constraint rules.

Interaction Diagram: Sequence diagrams – collaboration diagrams – comparing sequence

& collaboration diagrams. Case Study: USE CASE diagram & CLASS diagram for

ATM, Sequence diagrams & collaboration diagrams for ATM


Class Diagrams Advanced concepts :- Stereotypes – Object diagram –Class Scope

Operations & Attributes – Multiple & Dynamic classification – Aggregation and

Composition – Derived Associations and attributes – Interfaces and abstract classes –

Reference objects and value objects – collections of multivalued associations ends –

frozen – Classification & generalization – qualified associations – associations class –

parameterized class – visibility. Case Study: Diagrammatic representation Multiple and

Dynamic classification, Aggregation and Composition.




37


Packages and collaborations – Packages – collaborations. State diagram – Concurrent

state diagrams. Case Study: Diagrammatic representation packages


Activity diagram – Decomposing an activity – Dynamic Concurrency – Swim lanes -

when to use activity diagrams. Physical diagram: Deployment diagram – component

diagram – combining Deployment & Component diagram. Case study: Patient

observation: Domain model, Specification model

References

1. Martin Fowler and Kendall Scott, UML Distilled, 2nd Edition, Pearson Education,

2002

2. Ram Baugh, UML Distilled, Tata McGraw Hill Publications, 2004

3. Grady Booch, Object Oriented Analysis and Design, Tata McGraw Hill Publications,

2004




38

Third Semester

Non-major Theory: OPERATIONS RESEARCH

Objectives

• To get the fundamental ideas of the OR problems which is of interest in Computer

Applications

Pedagogy

Lecturing, Group Discussion, LCD, OHP, Seminars, Mini-projects and Assignments




Linear Programming : Formulation of LPP – Graphical Solutions to LPP Canonical

And Standard Forms of LPP – Simplex Method – Big M Method – Two – Phase Simplex

Method – Duality In Linear Programming: Primal & Dual Problems Duality And Dual

Simplex Method.



The Transportation Problem: Introduction – Mathematical Formulation – Finding

Initial Basic Feasible Solutions- Test for Optimality – Unbalanced Transportation

Problems- Degeneracy. The Assignment Problem: Introduction – Mathematical

Formulation – Hungarian Assignment Method – Maximization in Assignment Problem –

The Travelling Salesman Problem.



Inventory Control: Introduction - Costs involved in inventory – Deterministic models:

EOQ models without and with shortage – Price break models Sequencing Problem:

Processing n jobs through two machines – Processing n jobs through k machines.




39



Replacement Model: Introduction – Replacement of items that deteriorate gradually:

value of money does not change with time – value of money changes with time –

Replacement of items that fails suddenly.

PERT/CPM: Introduction – Construction of Network – CPM Calculations – PERT

Calculations.



Simulation: Monte Carlo simulation – simulation of inventory problems – simulation of

a queuing system. Games and Strategies: Two Person Zero Sum – Games – The

Maxima and Mini max Principle – Mixed Strategies – Graphical Solution – Dominance

Property.

References

1. Kanti Swarup, P.K.Gupta, Man Mohan, Operations Research, Sultan Chand and

Sons, New Delhi.

2. Dharani Venkatakrishnan S, Operations Research, Keerthi Publishing House Pvt.

Ltd, 2004.




40

Third Semester

Non-major Theory: EMPLOYABILITY SKILLS – III

Objectives




Pedagogy


Assignments



Numerical Reasoning UNIT – II (9 Hours)

CV, Body Language, Stress Management, Self Introduction, Team Work


Barriers in Communication, Presentation Skills, Grooming, Common HR Questions


General Awareness


Unix and Linux: Shell Programming and its Applications.

References


Press, 2004.







41








42

Third Semester

Major Practical: PRACTICAL-V: JAVA PROGRAMMING

Objectives

• To provide JAVA language fundamentals

• To enable them to write program using various packages


Pedagogy

List of Programs to be executed in Java





43

Third Semester

Major Practical: PRACTICAL-VI: VB and VB .NET PROGRAMMING

Objectives

• Know the concepts VB technologies

• Understand about Intermediate language compiler

• Understand about application based features

Pedagogy

List of programs in Visual Basic programming and .NET





44

Fourth Semester

Major Theory: C# PROGRAMMING

Objectives

• To know the concepts and trends in Dot Net

• To get familiar with the C#

• To understand the web designing concepts

• To know the concepts of web service applications

Pedagogy

Lecturing, Group Discussion, LCD, OHP and Seminars



Introducing C# - Overview of C# - Literals – Variables and Data Types – Operators and

Expressions.


Decision Making: Branching – Looping – Methods in C# - Handling Arrays.


Manipulating Strings – Structures and Enumerations – Classes and Objects:

Introduction – Constructors - Destructors.


Inheritance and Polymorphism – Interfaces: Multiple Inheritances – Operator

Overloading.


Managing Console I/O Operations – Errors and Exceptions – Multithreading in C#.

References

1. Herbert Schildet, The Complete Reference C#, 2nd Edition, Tata McGraw Hill

Publications, 2002.




45

Fourth Semester

Major Theory: J2EE PROGRAMMING

Objectives

• To know the concepts java programming

• To understand about enterprise editions

• To understand about JNDI, EJB, JSP, Servlet

Pedagogy




Java Swing: - What is Swing – Swing components and packages - Icons and Labels -

Text fields - Buttons: - The JButtons class - Check Boxes - Radio Buttons - Combo

Boxes - Tabbed panes - Scroll panes-Trees – Tables - Exploring Swings.


Remote Method Invocation - Distributed Application Architecture- Creating stubs and

skeletons - Defining Remote objects - Remote Object Activation-Object Serialization


Java Servlets: Basics of servlet - Benefits of servlet - A simple Java Servlet – Life cycle

of servlet - UThe javax .servlet package - Handling HTTP Request and Response -

Working with cookies - Session Tracking.


Java Server Pages - JSP Overview – Installation - JSP tags - Components of a JSP page

– Expressions – Scriplets – Directives – Declarations - A complete example


XML – Introduction to XML Markup – Parsers and well formed XML Documents –

Characters :- Character set – Characters Vs markup – white space, Entity Reference and




46

Built-in Entities – Using Unicode in an XML document – Markup – CDATA sections –

XML Namespaces.

References

1. Jamie Jaworskie, Java 2 Platform Unleashed, Tech Media SAMS.

2. Jim Keogh, The Complete Reference J2EE, Tata McGraw Hill Publications, 2002.

3. Herbert Schildt, The Complete Reference Java 2, Tata McGraw Hill, 5th edition.

4. Deitel and Deitel, Nieto, Lin, Sadhu, XML How to program, Addison Wesley

Longman Publications, 2002.




47

Fourth Semester

Major Theory: SOFTWARE TESTING

Objectives

• To know the strategy in testing

• To understand the test methodologies

• To understand the testing techniques

• To know the concepts of Object oriented techniques

Pedagogy




Software testing background: Infamous Software Error Case Studies – What is a bug? –

The cost of Bugs- The realities of software testing: Testing Axioms-Software testing

terms and definitions.


Examining the specification: getting started- performing high level review of the

specification- low level specification test techniques. Testing the software with Blinders

On: Dynamic black-Box testing: Testing the software while blind folded.


Examining the code: static white-box testing: examining the design and code- formal

reviews- coding standards and guidelines – generic code preview checklist. Testing the

software with X-rays glasses: Dynamic white-box testing- dynamic white-box testing

versus debugging- testing the pieces – data coverage- code coverage.


Testing the Documentation: Types of Software Documentation – The importance of

Documentation Testing – What to look for when reviewing documentation – The

Realities of Documentation Testing. Website Testing: Web page fundamentals – Black-




48

Box Testing –Gray-Box Testing-White-Box Testing – Configuration and compatibility

Testing- Usability Testing – introducing Automation.


Planning Your Test Efforts: The Goal of Test planning – Test Planning Topics.

Writing and Tracking Test Cases: the goals of Test Case Planning – Test Case Planning

Overview – Test Case Organization and Tracking. Reporting what you find: Getting your

Bugs fixed- Isolating and Reproducing Bugs- Not all bugs are created equal-A Bug’s Life

cycle – Bug tracking systems.

References

1. Ron Patton, Software Testing, 2nd edition, Pearson education, 2004

2. Robert V.Binder, Testing Object Oriented Systems : Models, Patterns and Tools ,

Addision Wesley Publication, 2001.




49

Fourth Semester

Elective Theory: e-COMMERCE

Objectives

• Understand the e-Commerce framework

Pedagogy




Electronic Commerce framework – Electronic Commerce of Media convergence- The

Anatomy of e-commerce applications – Electronic Commerce Applications – Electronic

Commerce Organization Applications – Market Forces Influencing the I-way –

Components of the I-way – Network Access Equipment.


Architectural framework for electronic commerce – World Wide Web (WWW) as the

architecture – Web background: Hypertext publishing – Technology behind the web –

security and the web – Consumer-oriented applications.


Types of Electronic payment systems – Digital Token-Based Electronic Payment

Systems – Smart cards and Electronic Payment Systems – Credit Card based Electronic

Payment systems – Risk and Electronic Payment Systems – Designing electronic

payment systems - Electronic data interchange


Internal Information systems – Macro forces and Internal Commerce – Work Flow

Automation and Coordination Customization and Internal commerce – Supply chain

commerce systems – making a business case for a document Library – Types of digital

documents – Issues behind Document Infrastructure – corporate Data warehouses.




50


The New Age of Information-Based Marketing – Advertising on the Internet- charting

the Online Marketing process – Market Research – Search and Resource Discovery

Paradigms – Information search and Retrieval.

References

1. Ravi Kalakota, Andrew B Whinston, Frontiers of Electronic Commerce, Pearson

Education Asia, 2003.

2. Jeffery F Rayport, Bernard J. Jaworski, E- Commerce, TMCH, 2002.

3. Joseph P T, E- Commerce – A Managérial Perspective, Prentice Hall of India, 2003.




51

Fourth Semester

Elective Theory: Mobile Computing

Objectives

• Το understand the concept of wireless mobile computing

• To know the mobile technologies in detail

Pedagogy




Introduction – Vertical and applications of Wireless Networking – Positioning of

Wireless networking relative to wired networks – Wireless LAN and Wireless WAN –

Wireless PBXs map – The Radio Spectrum cell size and achievable throughput. Wireless

transmission – Frequencies for radio transmission – Regulations – Signals, Antennas,

Signal propagation, path loss of radio signals, Additional signal propagation effects-

Multi-path propagation – Multiplexing.


Space division multiplexing – Frequency division multiplexes – time division

multiplexing – Code division multiplexing. Spread spectrum – Direct sequence spread

spectrum– Frequency hopping spread spectrum – Cellular systems. Medium access

control – Hidden and exposed terminals – Near and far terminals – SDMA, FDMA,

TDMA, Fixed TDM, Classical Aloha, slotted Aloha, Carrier sense multiple access –

Reservation TDMA – Multiple access with collision avoidance – Polling – CDMA –

Spread Aloha multiple access.


Comparison of S/T/F/CDMA.GSM – Mobile services – System architecture – Radio

interface – Protocols – Localization and calling – Handover – Security – Location

Management for Mobile Cellular Systems – GPRS – Mobile services – System

Architecture.




52


UMTS and IMT – 2000 - Wireless LAN – Infra red vs. radio transmission –

Infrastructure and ad-hoc network – IEEE 802.11 – System architecture – Protocol

architecture – Physics layer – Medium access control layer – MAC management – Blue

tooth. Mobile network layer – Mobile IP – Goals, assumptions and requirements –

entities and terminology – packet delivery – Agent discovery – Registration – Tunneling

and encapsulation Recent technologies


World Wide Web - WAP – Architecture – wireless datagram Protocol, Wireless

transport layer security, Wireless transaction protocol, Wireless session protocol,

Wireless application environment, Wireless markup language, WML script – Mobile

computing applications using J2ME.

References

1. John Schiller, Mobile Communications, Addison Wesley publications, 2003.

2. Rifaat A. Dayen, Mobile Data and Wireless LAN Technologies, Prentice Hall, 1997.

3. Steve Mann and Scoot Schibli, The Wireless Application Protocol, John Wiley &Sons,

2000.

4. Steve Mann, Programming Applications with the Wireless Application Protocol, John

Wiley and Sons, 2000.




53

Fourth Semester

Elective Theory: EMBEDDED SYSTEMS

Objectives

• To learn about the basic concepts of Embedded System

• To develop the next generation of technologies

Pedagogy




Introduction to Embedded Systems: Embedded System – Processor in the system –

Other hardware units – software embedded into a system – Exemplary Embedded

systems – On chip and in VLSI Circuit. Processor and memory selection for embedded

system.


Devices and Buses for Device Networks: I/O devices – Timer and counting Devices.

Device Drivers and Interrupts Servicing Mechanism: Device drivers – Parallel Port

device drivers in a system – Serial Port device in a system – Device drivers for internal

programmable timing devices – Interrupt servicing mechanism – context and the periods

for context-switching, deadline and interrupt latency.


Program modelling concepts in single & Multiprocessor systems software-

Development Process: Modeling Processes for Software analysis before software

Implementation – Programming models for event controlled or response time constrained

real time programs – Modeling for microprocessor systems. Software Engineering

Practices in the Embedded Software Development Process: Software algorithm

complexity – Software Development process life cycle and its models – Software

analysis – Software design – Software implementation – Software Testing, Validating




54

and Debugging – Real time programming issues during the software development

process – Software project management – Software maintenance – UML


Inter-process communication & Synchronization of processes, Tasks and threads:

Multiple processes in an application – Problem of sharing data by multiple tasks and

routines – Inter Process communication. REAL TIME OPERATING SYSTEM:- Real

time and Embedded systems operating systems – Interrupt routines in RTOS environment

– RTOS Task scheduling models, Interrupt latency and Response times of the Tasks as

performance metrics – performance Metric in scheduling models for periodic, sporadic

and Aperiodic Tasks – IEEE standard POSIX 1003.1b functions for Standardization of

RTOS and Inter-task communication functions – List of Basic actions in a pre-emptive

scheduler and Expected times taken at a processor – Filters – point strategy for

synchronization between the processes, ISRs, OS functions and tasks and for Resource

management – Embedded Linux Internals .


Hardware – Software co-design in an embedded System: Embedded System Project

Management – Embedded system design and co-design issues in system development

processes – Design cycle in the development phase for an Embedded system – Uses of

Target system, or its Emulator and In-circuit Emulator – Use of software tools for

development of an embedded system – Use of scopes and logic analysis for system

hardware tests – Issues in Embedded system design Case Study: An Embedded System

for an Adaptive cruise control system in a car, embedded system for a smart card.

References

1. Raj Kamal, Embedded Systems – Architecture, programming and design, Tata

McGraw Hill, 2003.

2. David E. Simon, An Embedded Software primer, Pearson Education Asia, 2003.




55

Fourth Semester

Elective Theory: INTERNET AND WEB DESIGN

Objectives

• To understand the fundamental concepts of Internet

• To enable them to learn the mark-up language

• To enable them to create web database

Pedagogy




Introduction : What is Internet – Internet source – a tour of the Internet – Internet

addressing – Using the web – the web advanced topics – Introduction to Usenet –

Gopher, Veronica & Jug head – FTP : Anonymous FTP – Telnet : Login into a remote

computer – Mail: SMTP, Mail addressing – signatures.


HTML: Introduction to HTML Part I & Part II – Dynamic HTML: Object model &

Collection – Event model – Filters & transitions.


Java Script: Introduction to Scripting – Control statement I – Control Statement II.

Functions: introduction – program modules in JavaScript – Programmer defined function

– Function definitions – Java Script global functions – recursion. Arrays: Introduction –

Thinking about objects – Math object – String Object – Date object – Boolean & number

object.


XML: Introduction to XML Mark-up – Parsers and well formed XML Documents –

Parsing a Document with msxml – Characters – Mark-up – CDATA Sections – XML

Namespaces – Case Study: A Day Planner Application.




56


XML Technologies and Applications : Introduction – XML Query Language –

Directory Services Mark-up Language – Resource Definition Framework – XML Topic

Maps – Virtual Glossary – Channel Definition Format – Information and Content

Exchange Protocol - Rich Site Summary.

References

1. Harley Hahn, The Internet Complete Reference, 2nd Edition, Tata McGraw Hill.

2. H M Deitel, P J Deitel, T R Nieto, Lin, P Sadhu , XML-How to program, Pearson

Education, 2001.

3. Deitel and Deitel Goldberg, Internet and World Wide Web, Pearson Education, 3rd

Edition.




57

Fourth Semester

Elective Theory: PHP PROGRAMMING

Objectives

• To understand the basic building blocks of PHP Programming

• To use the functions of My SQL, PHP XML and AJAX

Pedagogy


Assignments



PHP Basics- Introduction – PHP syntax – Variables- Strings – Operators – if, else-

switch-while-for loops-Arrays- Functions- Forms - $_GET, $_POST.


Advanced PHP: PHP Date-include-file-file upload – PHP cookies- Sessions- e-mail-

Secure mail- error- Exceptions-Filter.


PHP database - MYSQL Introduction- MY SQL connect – create – Insert –Where-

Order By- update- delete-ODBC.


PHP XML and AJAX: XML Parser – DOM- Simple XML- AJAX – Introduction –

AJAX and PHP- AJAX Database- AJAX and XML- AJAX live search-AJAX RSS

Reader-AJAX Poll.


PHP References – Array calendar – date – Directory – Error – File System- Filter – FTP

– HTTP – Lib XML – mail –math – misc- String – Zip.




58

References

1. Luke Welling and Laura Thompson, PHP and MY SQL Web Development, SAMS

Publications, 2004.




59

Fourth Semester

Elective Theory: PYTHON PROGRAMMING

Objectives

• To demonstrate an understanding the basic role of the Python Programming

• To use the simple implementations of Python Programming

Pedagogy


Assignments



Using the Python Interpreter - Interpreter and Its Environment - Introduction to Python

- Using Python as a Calculator – Numbers- Strings - Unicode Strings – Lists.


Control flow tools - Defining Functions – more on functions – del statement - Tuples

and Sequences – sets – Dictionaries – looping techniques – more on conditions –

comparing sequences and other types.


Modules – more on modules – Standard modules – packages – Directories - Input and

Output - Fancier Output Formatting - Reading and Writing Files - Errors and Exceptions.


Classes – Objects – Inheritances - Private Variables – Odds and ends - Exceptions Are

Classes Too –Iterators – Generators - Generator Expressions.


Standard Library – Operating Systems and Interface – File Wild cards – command line

Arguments.




60

References

1. Wesley J Chun, Core – Python Programming, Pearson education, 2001.

2. Steven M. Schafer and Wiley, HTML, CSS, Java script, Perl, Python and PHP,

Dream Tech, 2005.




61

Fourth Semester

Elective Theory: PERL PROGRAMMING

Objectives


Perl Programming

• To use the functions of simple combinational and sequential implementations

Pedagogy


Assignments



Fundamentals: Versions and naming conversions - Perl history – Main Perl features –

Compiler or Interpreter – similar programming languages. Perl overview: Installing and

using Perl – Perl components.


Perl Parsing Rules: The execution process – syntax and parsing rules – Perl coding

styles. Variable and data: Basic naming rules- scalar variables – literals – arrays – hashes

– lists – type globs.


Statement and controls structures: Code blocks – conditional styles – loops.

Subroutines, packages, and modules: Functions – packages – special blocks – modules –

scope – auto loading.


Working with Files: File handling – file management. Data manipulation: Working

with numbers – strings – regular expression – Unicode.




62


Errors and trapping: Adding error checking to scripts – reporting errors within scripts –

reporting errors within modules.

References

1. Martin C Brown, The complete references – Perl, 2nd edition, Tata McGraw Hill

Publications, 2006.

2. David Medinets, Perl 5 by example, Prentice Hall, 2005.

3. Eric C. Herrmann, Mastering Perl 5, BPB Publications, 2002.




63

Fourth Semester

Elective Theory: SQL SERVER

Objectives

• To demonstrate an understanding of the basic blocks of SQL Server Programming

• To use the functions and triggers in SQL Server implementations

Pedagogy


Assignments



Databases – master database – pub database – model database – Temp DB – MSDB-

installing MS- SQL Server - server level parameters.


Transferring Object – replication – Data Distribution models – terminology – server

roles – scenarios – event and processes – prerequisites for replication.


SQL – syntax – queries – aggregates and functions - system functions – calculated values

– optimizers hints – sub queries – unions- insert, update, delete statements – cursors.


Stored procedures – views – triggers – rules – defaults – constraints – and user defined

data types – error codes.


Performance tuning and optimization – query analyzer monitors –baselines – trace

flags – news group and internet – browsers- search engines –service packs and patches.




64

References

1. Patrick Dalton, Microsoft SQL Server Black book, Tech Media Publications, 2002.

2. Hans Ladanyi, Microsoft SQL Server 7.0 unleashed, Tech Media Publications, 2004.




65

Fourth Semester

Non-major Theory: EMPLOYABILITY SKILLS-IV

Objectives




Pedagogy


Assignments



Verbal Ability


Non-Verbal Ability


Telephonic interview, Dos and don’ts in an interview, Interview homework, Industry

awareness, Group discussion


General Awareness


Compiler Applications: PL / 1 Compiler and Pascal Compiler

References


Press, 2004.







66








67

Fourth Semester

Major Practical: PRACTICAL-VII: C# and J2EE PROGRAMMING

Objectives

To enable the students to:

• Know the concepts and trends in Dot Net

• Get familiar with the C#

• Understand the web designing concepts

• Know the concepts of web service applications

• Understand about distributed computing and application development

• Know the concepts of JAVA BEANS and SWING and application development

• Understand the techniques for deploying an application

Pedagogy

List of Programs to be executed in J2EE and C#





68

Fourth Semester

Major Practical: PRACTICAL-VIII: SOFTWARE TESTING

Objectives

• Aware of testing concepts that are managerial, technical and process oriented

• Know the role of manual and automated testing in development of high quality software

• Enhance the testing skills necessary to become a software tester

• Promote the growth and value of software testing as a profession

Pedagogy

Using List of programs in Software Testing Tools





69

Fifth Semester

Major Theory: DIGITAL IMAGE PROCESSING

Objectives

• To understand the web programming fundamentals

• To enable learner to use various asp objects

• To enable learner to develop simple web application

Pedagogy




Digital image processing – Digital Image Representation- Fundamental steps in image

processing – Elements of image processing systems. Digital image fundamentals:

Elements of Visual perception- A simple image model – sampling and quantization –

Some basic relationships between pixels.


Image Transforms - Introduction to Fourier transform– the discrete Fourier transform –

Some properties of the two-dimensional Fourier transform: Separability – Translation-

Periodicity and Conjugate Symmetry- Rotation- Distributive & Scaling- Average value-

Laplacian- convolution & Correlation. The Fast Fourier Transform: FFT Algorithm- No.

of Operations- the Inverse of FFT.


Image Enhancement: Spatial Domain Methods- Frequency Domain Methods -

Enhancement by point processing: Some simple Intensity Transformations – Histogram

Processing –Image Subtraction- Image Averaging. Spatial filtering: Back ground –

Smoothing Filters – Sharpening Filters.




70


Image restoration: Degradation model: Some definitions – Degradation model for

Continuous Functions – Effects of Diagonalization on the degradation model. Algebraic

approach to restoration: Unconstrained restoration –Constrained restoration – Inverse

filtering.


Image Compression: Fundamentals – Coding Redundancy – Inter pixel Redundancy –

Psycho visual redundancy – Fidelity Criteria. Image Compression Models – Error free

compression and lossy compression. Image Segmentation: detection of discontinuities-

Edge linking and boundary detection.

References

1. Rafael C. Gonzalez, Richard E. Woods, Digital Image processing, 2nd Edition,

Prentice Hall, NJ, 2002.

2. Russ J. C., The Image Processing Handbook, 3rd Edition, CRC Press, 1999.




71

Fifth Semester

Major Theory: J2ME

Objectives

• To understand the web programming fundamental



Pedagogy




J2ME Overview: Java 2 micro edition and the world of Java – Inside J2ME-J2ME and

wireless devices – Small Computing Technology: Wireless technology-Radio data

networks- Microwave technology – mobile radio networks-messaging-personal digital

assistants-mobile power – setup boxes – smart cards.


J2ME Architecture and Development Environment:J2ME Architecture–Runtime

environment – Java language for J2ME – Hello world J2ME Style-J2ME Wireless

toolkit–J2ME best practices and patterns – Commands – Items – Event processing.


High level Display: Screens: Alert class – form class- item class-list class-textbox class –

ticker class. Low level Display: canvas – user interactions – graphics – clipping regions –

animation.


Record Management System: Record storage – Writing and reading records – record

enumeration – sorting records - searching records – record listener.




72


J2ME database concepts: Data – data concepts – data base schema – the art of indexing.

JDBC Objects: JDBC and embed SQL – Personal Information manager – The generic

connection framework.

References

1. James Keogh, The Complete Reference, Tata McGraw Hill Publications, 2003.

2. Michael Juntao Yuan, Enterprise J2ME-Develoiping Mobile Java Applications,

Pearson Education, 2004.

3. Ray Rischpater, Beginning Java ME platform, A Press, 2008.




73

Fifth Semester

Major Theory: ASP.NET

Objectives

• To understand the web programming fundamental



Pedagogy




Getting Setup - what is ASP.NET- Setting up for ASP.NET- The development

environment – ASP & ASP.NET. An overview – ASP.NET Programming Languages.

Programming Basics: Basics of Programming - Program Flow –Effective Coding

Techniques –Designing Applications.


How Dynamic Website Applications Work? - Processing ASP.NET with Visual basic.

NET: VB.NET Programming Language Structures –Built in ASP.NET objects &

Interactivity- The response object –The ASP Server object.


Web Forms and ASP.NET: Web forms - ASP.NET Configuration, Scope and State:

ASP.NET and configuration- ASP.NET and state –The application object –ASP sessions

– The session object.


ASP.NET objects and components: The Scripting Object Model- Active Server

Components and Controls –More Active Server Components.




74


Web Services & ASP.NET – WSDL & SOAP- Web services Background – ASP.NET

& SQL server- using SQL server –using databases in ASP.NET applications- ActiveX

data objects- the ADO.NET objective model –coding structured query language.

References

1. Dave Mercer, ASP.NET A Beginner’s Guide, Tata McGraw Hill Publications, 2002.

2. Matt J. Couch, ASP.NET and VB.NET Web programming, Pearson Education, 2002.

3. Kirk Allen Evans, Ashwin Kamanna, XML and ASP.NET, Joel Mueller Pearson

Education, 2002.




75

Fifth Semester

Elective Theory: NETWORK SECURITY

Objectives

• To know the basic concepts of security attacks

• To study about various security services

• To learn about the various techniques/algorithms for encryption and decryption

Pedagogy




Introduction, Attacks, services and Mechanisms – security attacks – security services

– A model for internet work security – Internet standards and RFCS – The internet

society – Standardization process – RFC publications – Non Standard track documents.


Conventional Encryption Message confidentiality: conventional encryption principles

– Conventional Encryption Algorithms – Cipher Block modes of operation Location of

Encryption devices - Key Distribution.


Approaches to message authentication - Public Key Cryptography Principle - Public

key cryptography Algorithms - Digital Signatures – Key management - Authentication

Applications: X 509 Authentication service.


Electronic Mail security: Pretty good Privacy – S/ MIME 455 IP Security: IP Security

overview – IP Security Architecture – Authentication Header – Encapsulation security

Payload.




76


Web Security: Web Security Considerations – Secure Sockets Layer and Transport

Layer security – Secure Electronic Transactions. System Security: Intruders – Intrusion

detection – Password Management. Firewalls: Firewall Design Principles – Trusted

Systems.

References

1. William Stallings, Network Security Essential – Applications and Standards, Pearson

Education, 2003.

2. William Stallings, Cryptography and Network security – Principles and Practices,

Pearson Education, 3rd Edition, 2003.




77

Fifth Semester

Elective Theory: WEB SERVICES

Objectives

• To understand the fundamental concepts, visions and reality of web services

• To be familiar with the basic Web services standards

Pedagogy

Lecturing, Group Discussion, LCD, OHP and Seminars



Introduction to web services-What are web services, why web services are important,

Web services and enterprises, XML fundamentals-XML Documents-XML

Namespaces-XML Schema: XML Schema and namespaces-Inheritance-Substation

groups-global and local type declarations.


Introduction to SOAP-SOAP model, SOAP messages, SOAP encoding, SOAP RPC,

Using alternative SOAP encoding, Document, RPC, Literals, SOAP, Web services and

the REST architecture.


UDDI - UDDI Business registry, UDDI under the covers, Accessing UDDI. Advanced

web services technologies and standards: Conversations. Workflow-Business process

management, Workflows and workflow management system, Business Process Execution

Language for web services (BPEL).


Transactions: ACID transactions, OASIS business transaction protocol. Introduction to

security:-Everyday security basics-Security is an end-to-end process; web services

security issues, types of security attacks and treats, web services security roadmap, web

services security.




78


Introduction to quality of services:-What is QOS, Why QOS is important, QOS metrics

for web services, Holes, Design patterns and Best practices, QOS enabled web services,

QOS enabled applications.

References

1. Sandeep chatterjee, James Webber, Developing Enterprise Web Services: An

Architect’s Guide, Pearson Education, 2004.

2. Keith Ballinger, NET Web services: Architecture and Implementation with .Net,

Pearson Education, 2003.




79

Fifth Semester

Elective Theory: DATA MINING AND WAREHOUSING

Objectives

• To provide fundamental knowledge about data mining

• To familiarise in data mining techniques

• Can have sound knowledge about data mining tool

Pedagogy




Basic data mining tasks – data mining versus knowledge discovery in databases –data

mining issues –data mining metrics – social implications of data mining –data mining

from a database perspective. Data mining techniques: Introduction – a statistical

perspective on data mining –similarity measures – decision trees –neural networks –

genetic algorithms.


Classification: Introduction –Statistical –based algorithms- distance –based algorithms –

decision tree- based algorithms-neural network –based algorithms –rule-based algorithms

–combining techniques.


Clustering: Introduction – Similarity and Distance Measures – Outliers – Hierarchical

Algorithms- Partitioned Algorithms. Association rules: Introduction-large item sets- basic

algorithms – parallel and distributed algorithms –comparing approaches- incremental

rules –advanced association rules techniques –measuring the quality of rules.


Data Warehousing: An Introduction- characteristics of a data warehouse – data marts –

other aspects of data mart. Online analytical processing: introduction - OLTP and OLAP




80

systems – data modelling – star schema for multidimensional view – data modelling –

multi fact star schema or snow flake schema – OLAP TOOLS –State of the market –

OLAP TOOLS and the internet.


Developing a Data Warehouse: Why and how to build a data warehouse –data

warehouse architectural strategies and organization issues- design consideration –data

content –metadata distribution of data –tools for data warehousing –performance

considerations –crucial decisions in designing a data warehouse. Applications of data

warehousing and data mining in government: Introduction-national data warehouses –

other areas for data warehousing and data mining.

References

1. Margaret H. Dunham, Data mining introductory and advanced topics, Pearson

Education, 2003.

2. Prabhu C S R, Data warehousing- concepts, techniques, products and applications,

Prentice Hall of India, 2nd Edition.

3. Aler Berson, Stephen J. Smith, Data warehousing, data mining, & OLAP, Tata

McGraw Hill Publications, 2001.




81

Fifth Semester

Elective Theory: ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS

Objectives

• To know the basic concepts of Artificial Intelligence

• To learn various AI techniques

• To know about how to represent knowledge

• To study the concept of Expert Systems and how to acquire knowledge

Pedagogy




Introduction: AI Problems - Al techniques - Criteria for success. Problems, Problem

Spaces, Search: State space search - Production Systems - Problem Characteristics -

Issues in design of Search.


Heuristic Search techniques: Generate and Test - Hill Climbing- Best-First, Problem

Reduction, Constraint Satisfaction, Means-end analysis. Knowledge representation

issues: Representations and mappings -Approaches to Knowledge representations -Issues

in Knowledge representations - Frame Problem.


Using Predicate logic: Representing simple facts in logic - Representing Instance and Is

a relationships - Computable functions and predicates - Resolution - Natural deduction.


Representing knowledge using rules: Procedural Vs Declarative knowledge - Logic

programming - Forward Vs Backward reasoning - Matching - Control knowledge. Brief

explanation of Expert Systems.




82


Expert Systems – Introduction – Representation and using domain knowledge – Expert

system shell – Explanation – Knowledge acquisition.

References

1. Elaine Rich and Kevin Knight, Artificial Intelligence, Tata McGraw Hill

Publications, 2nd Edition, 2001.

2. George F Luger, Artificial Intelligence, 4th Edition, Pearson Education Publications,

2002.




83

Fifth Semester

Non-Major Theory: EMPLOYABILITY SKILLS-V

Objectives

• To demonstrate an understanding of the basic building blocks of employability

skills


Pedagogy


Assignments



General Reasoning


Logical Reasoning


Group Discussion, Mock Interviews, Placement Season Awareness


General Awareness


Artificial Intelligence Applications: MPEG, Inverse of Kinematic Problems

References


Press, 2004.







84








85

Fifth Semester

Major Practical: PRACTICAL-IX: J2ME PROGRAMMING AND MATLAB

Objectives

• To understand the application fundamentals

• To enable learner to use various controls in .NET

• To enable learner to develop simple application based projects

Pedagogy

List of programs to be executed in J2ME and MATLAB





86

Fifth Semester

Major Practical: PRACTICAL-X: ASP. NET PROGRAMMING

Objectives

• To understand about distributed computing and application development

• To know the concepts of JAVA BEANS and SWING and application

development

• To understand the techniques for deploying an application

Pedagogy

List of programs to be executed in ASP.NET
