vit cse btech course plan

2

VIT U N I V E R S I T Y

(Estd. u/s 3 of UGC Act 1956)

Vellore - 632 014, Tamil Nadu, India

School of Computing Sciences

B.Tech. (CSE) Curriculum & Syllabus : 2008-09

Annexure –I

II. University/Management Elective (6

Credits)

S. No.

Subject Name L T P C Prerequisites/

Exposure

1 University Elective 3 0 0 3

2 Management Elective 3 0 0 3

I. University Core (17 Credits)

S. No. Subject Name L T P C Prerequisites/

Exposure

1 ENG 001 Effective English (English deficient students

only) 3 0 0 3

2 ENG 101 English for Engineers – I 3 0 0 3

3 ENG 102 English for Engineers – II 3 0 0 3 I. 2 Effective English (English deficient students only)

( or) English for Engineers – I

4 CHY 104 Environmental Studies 3 0 0 3

5 Foreign 2 0 0 2

6 CSE 101 Computer Programming and Problem Solving 2 0 2 3

7 MGT 301 Ethics and Values 3 0 0 3

3

IV. Program Core (110 Credits)

S. No.


Exposure

1. Basic Electrical and Electronics Engineering 3 0 2 4

2. Electronics 3 0 2 4 IV.1 Basic Electrical and Electronics Engineering

3. Programming Fundamentals 3 0 0 3 I.6 Computer Programming and Problem Solving

4. The Object – Oriented Paradigm 3 1 0 4 IV. 3 Programming Fundamentals

5. Object- Oriented Programming Lab 0 0 3 2 IV. 3 Programming Fundamentals

6. Digital Logic 3 0 0 3 I.6 Computer Programming and Problem Solving

7. Digital Logic Lab 0 0 3 2 I.6 Computer Programming and Problem Solving

8. Data Structures and Algorithms 3 1 0 4 IV. 3 Programming Fundamentals

9. Data Structures and Algorithms Lab 0 0 3 2 IV. 3 Programming Fundamentals

10. Computer Architecture and Organization 3 0 0 3 IV.6, IV.7 Digital Logic, Digital Logic Lab

11. Algorithm Design and Analysis 3 0 0 3 IV.8 Data Structures and Algorithms

12.

Embedded Systems 3 0 0 3 IV.26, IV.27 Microprocessor and Interfacing

Microprocessor and Interfacing Lab

III. Science (38 Credits)

S. No.


Exposure

1

Multivariable Calculus and Differential

Equations 3 1 0 4

2 Differential and Difference Equations 3 1 0 4 III.1 Multivariable Calculus and Differential Equations

3

Applied Probability, Statistics and Reliability 3 1 0 4 III. 2 Multivariable Calculus and Differential Equations

Differential and Difference Equations

4

Linear Algebra 3 1 0 4 III.1, III.6 Multivariable Calculus and Differential Equations

Discrete Mathematical Structures

5 Modern Physics 3 0 2 4

6 Discrete Mathematical Structures 3 1 0 4 IV.6 Digital Logic

7

Theory of Computation 3 1 0 4 III.6,IV.11 Discrete Mathematical Structures

Algorithm Design and Analysis

8 Graph Theory and its Applications 3 0 0 3 III.7 Theory of Computation

9 Numerical Analysis 3 0 0 3 III.2 Differential and Difference Equations

10 Engineering Chemistry 2 1 2 4

4

13.

Embedded Systems Lab 0 0 3 2 IV.26, IV.27 Microprocessor and Interfacing


14. Operating Systems 3 0 0 3 IV.10 Computer Architecture and Organization

15. Operating Systems Lab 0 0 3 2 IV.10 Computer Architecture and Organization

16.

Computer Networks 3 0 0 3 IV.14, IV.15 Operating Systems

Operating Systems Lab

17.

Computer Networks Lab 0 0 3 2 IV.14, IV.15 Operating Systems


18.

Programming Language Translators 3 0 0 3 III.7, IV.10 Theory of Computation

Computer Architecture and Organization

19.

Computer Graphics 3 0 0 3 III.4, IV.3 Linear Algebra

Programming Fundamentals

20.

Database Systems 3 0 0 3 IV.8, IV.11 Data Structures and Algorithms


21.

Database Systems Lab 0 0 3 2 IV.11, IV.9 Algorithm Design and Analysis

Data Structures and Algorithms Lab

22.

Software Engineering 3 0 0 3 III.8,IV.18 Graph Theory and its Applications

Programming Language Translators

23.

Software Engineering Lab 0 0 3 2 IV.3,IV.21 Programming Fundamentals

Database Systems Lab

24. Internet & Web Programming 3 0 0 3 IV.16 Computer Networks

25.

Internet & Web Programming lab 0 0 3 2 IV.16,IV.17 Computer Networks

Computer Networks Lab

26. Microprocessor and Interfacing 3 0 0 3 IV.10 Computer Architecture and Organization

27. Microprocessor and Interfacing Lab 0 0 3 2 IV.10 Computer Architecture and Organization

28.

Digital Signal Processing 3 0 0 3 IV.16, IV.10 Computer Networks


29. Resource Management 3 0 0 3

30. Engineering Graphics 0 0 4 2

31. Workshop Practice 0 0 2 1

32. Comprehensive Exam 0 0 0 2 Mini Project Mini Project

33. Mini Project 0 0 0 2 Prog. Elec. I Prog. Elec. I

34. In plant Training 0 0 0 2

35. Project 0 0 0 20 Mini Project Mini Project

5

FINAL SUMMARY

S. No. Area Courses No. of % Recommended

Credits Share Share%

1 Humanities and Social Sciences 4 11 6.11 8

2 Management 4 12 6.67 8

3 Science 11 38 21.11 20

4 Engineering 37 119 66.11 64

Total 56 180 100.00 100

V. Program Electives (9 Credits)

S. No.


Exposure

1. Artificial Intelligence 3 0 0 3 IV.8 Data Structures and Algorithms

2. Bio- informatics 3 0 0 3

3.

Parallel Algorithms 3 0 0 3 IV.3, IV.10 Programming Fundamentals


4.

Advanced Computer Architecture 3 0 0 3 IV.10, IV.18 Computer Architecture and Organization


5. Concurrent and Distributed Systems 3 0 0 3 IV.14 Operating Systems

6. Software Practice and Testing 3 0 0 3 IV.22 Software Engineering

7. Data Warehousing and Data Mining 3 0 0 3 IV.20 Database Systems

8. Scripting Languages 3 0 0 3 IV.16 Computer Networks

9.

Human Computer Interaction 3 0 0 3 IV.19,IV.22 Computer Graphics

Software Engineering

10. Multimedia Systems and Algorithms 3 0 0 3 IV.19 Computer Graphics

11. Database Design 3 0 0 3 IV.20 Database Systems

12. Modeling and Simulation 3 0 0 3 III.3 Applied Probability, Statistics and Reliability

13. Hardware Software Co-design 3 0 0 3 IV.12 Embedded Systems

14. Computer Organization and Design 3 0 0 3 IV.10 Computer Architecture and Organization

15. Data Communications 3 0 0 3 IV.16 Computer Networks

16. Image Processing 3 0 0 3 III.4 Linear Algebra

Note: The students of 2008-09 batch only are not required to undergo Basic Electrical and Electronics Engineering. Instead they will have a tutorial hour

each added in Operating Systems, Algorithm Design and Analysis, Programming Language Translators and Computer Graphics.

6

B.Tech. (CSE) Program – Curriculum 2008-09

Semester Wise Break-up

Semester I

S. No. Course Code Course Title L T P C Prerequisites/

Exposure

1 ENG 101

ENG 001

English for Engineers – I or

Effective English (English deficient students only) 3 0 0 3

2 MAT 101 Multivariable Calculus and Differential Equations 3 1 0 4

3 PHY 101 Modern Physics 3 0 2 4

4 EEE 101 Basic Electrical and Electronics Engineering 3 0 2 4

5 CSE 101 Computer Programming and Problem Solving 2 0 2 3

6 MEE 101 Engineering Graphics 0 0 4 2

7 MEE 102 Workshop Practice 0 0 2 1

Total Credits 21

Semester II


Exposure

1 ENG 102 English for Engineers – II 3 0 0 3 ENG 101 Effective English (English deficient students only)

(or)English for Engineers – I

2 MAT 105 Differential and Difference Equations 3 1 0 4 MAT 101 Multivariable Calculus and Differential Equations

3 CHY 101 Engineering Chemistry 3 0 2 4

4 EEE 103 Electronics 3 0 2 4 EEE 101 Basic Electrical and Electronics Engineering

5 CSE 103 Programming Fundamentals 3 0 0 3 CSE 101 Computer Programming and Problem Solving

6 Digital Logic 3 0 0 3 CSE 101 Computer Programming and Problem Solving

7 Digital Logic Lab 0 0 3 2 CSE 101 Computer Programming and Problem Solving

Total Credits 23

7

Semester III


Exposure

1 Discrete Mathematical Structures 3 1 0 4 SII.6 Digital Logic

2 Numerical Analysis 3 0 0 3 MAT 105 Differential and Difference Equations

3 The Object - Oriented Paradigm 3 1 0 4 CSE 103 Programming Fundamentals

4 Object- Oriented Programming Lab 0 0 3 2 CSE 103 Programming Fundamentals

5 Computer Architecture and Organization 3 0 0 3 SII.6, SII.7 Digital Logic, Digital Logic Lab

6 Data Structures and Algorithms 3 1 0 4 CSE 103 Programming Fundamentals

7 Data Structures and Algorithms Lab 0 0 3 2 CSE 103 Programming Fundamentals

Total Credits 22

Semester IV


Exposure

1

Linear Algebra 3 1 0 4 MAT 101,

SIII.1

Multivariable Calculus and Differential Equations

Discrete Mathematical Structures

2 Applied Probability, Statistics and Reliability 3 1 0 4 SIII.1

3 Microprocessor and Interfacing 3 0 0 3 SIII.5 Computer Architecture and Organization

4 Microprocessor and Interfacing Lab 0 0 3 2 SIII.5 Computer Architecture and Organization

5 Operating Systems 3 0 0 3 SIII.5 Computer Architecture and Organization

6 Operating Systems Lab 0 0 3 2 SIII.5 Computer Architecture and Organization

7 Algorithm Design and Analysis 3 0 0 3 SIII.6 Data Structures and Algorithms

8 Environmental Studies 3 0 0 3 CHY 101

Total Credits 24

8

Semester V

Semester VI


Exposure

1 Graph Theory and its Applications 3 0 0 3 SV.1 Theory of Computation

2 Internet and Web Programming 3 0 0 3 SV.6 Computer Networks

3 Internet and Web Programming Lab 0 0 3 2 SV.6 Computer Networks

4 Resource Management 3 0 0 3

5 Programming Language Translators 3 0 0 3 SIII.5, SV.1 Computer Architecture and Organization

Theory of Computation

6 Digital Signal Processing 3 0 0 3 SIII.5,SV.6 Computer Architecture and Organization

Computer Networks

7 Program Elective-I 3 0 0 3 SV.4, SV.6

8 University Elective 3 0 0 3

Total Credits 23


Exposure

1

Theory of Computation 3 1 0 4 SIII.1,SIV.7 Discrete Mathematical Structures


2

Embedded Systems 3 0 0 3 SIV.3, SIV.4 Microprocessor and Interfacing


3

Embedded Systems Lab 0 0 3 2 SIV.3, SIV.4 Microprocessor and Interfacing


4

Database Systems 3 0 0 3 SIII.6, SIV.7 Data Structures and Algorithms


5

Database Systems Lab 0 0 3 2 SIV.6, SIV.7 Data Structures and Algorithms


6

Computer Networks 3 0 0 3 SIV.5, SIV.6 Operating Systems


7

Computer Networks Lab 0 0 3 2 SIV.5, SIV.6 Operating Systems


8 Ethics and Values 3 0 0 3

Total Credits 22

9

Semester VII


Exposure

1 Foreign Language 2 0 0 2

2 Management Elective 3 0 0 3

3 Software Engineering 3 0 0 3 SVI.1,SVI.5 Graph Theory and its Applications


4 Software Engineering Lab 0 0 3 2 SVI.2

5 Computer Graphics 3 0 0 3 SVI.1

6 Program Elective- II 3 0 0 3 SVI.5

7 Program Elective- III 3 0 0 3 SVI.5

8 Mini Project 0 0 0 2 Prog. Elec.-I Prog. Elec.-I

Total Credits 21

Semester VIII

S. No. Course Code Course Title L T P C Prerequisites

1 Comprehensive Exam 0 0 0 2 Mini Project

2 Project 0 0 0 20 Mini Project

Total Credits 22

10

Credit Summary:

Semester I 21

Semester II 23

Semester III 22

Semester IV 24

Semester V 22

Semester VI 23

Semester VII 21

Semester VIII 22

In plant Training 02

Total 180

11

Foreign Language Management Elective Software Engineering Software Engineering Lab Computer Graphics Program Elective- II Program Elective- III Mini Project

English for Engineers – I

(or) Effective English

Multivariable Calculus and

Differential Equations Modern Physics Basic Electrical and Electronics

Engineering Computer Programming and

Problem Solving Engineering Graphics Workshop Practice

English for Engineers – II Differential and Difference

Equations Engineering Chemistry Electronics Programming Fundamentals Digital Logic Digital Logic Lab

Discrete Mathematical

Structures Numerical Analysis The Object - Oriented

Paradigm Object- Oriented Programming

Lab Computer Architecture and

Organization Data Structures and Algorithms Data Structures and

Algorithms Lab

Linear Algebra Applied Probability, Statistics

and Reliability Microprocessor and

Interfacing Microprocessor and Interfacing

Lab Operating Systems Operating Systems Lab Algorithm Design and Analysis Environmental Studies

Theory of Computation Embedded Systems Embedded Systems Lab Database Systems Database Systems Lab Computer Networks Computer Networks Lab Ethics and Values

Graph Theory and its

Applications Internet and Web

Programming Internet and Web

Programming Lab Resource Management Programming Language

Translators Digital Signal Processing Program Elective-I University Elective

Comprehensive Exam Project

12

ENG001 EFFECTIVE ENGLISH

L T P C

3 0 0 3

1. Objectives 2. To help the second language learners to acquire confidence in their basic writing and speaking.

3. To enable the students to acquire structure and written expressions required for their profession.

Expected Outcome

The learners will get the required training in LSRW through the given tasks.

Prerequisites/Exposure

English at + 2 level

Contents

Speaking: Introduction and greetings - asking/offering information - requesting/inviting

Writing: Making meaningful sentences from the jumbled words - development of basic writing skills applying

studied grammatical structures - hints development

Communication & Functional skills: Fundamentals of communication and barriers to effective communication.

Corrective Grammar I - parts of speech

Speaking: Integrated interrogative and discourse use with targeted vocabulary and functions; Communicative and

decision making activities based on authentic reading materials; Authentic video materials to improve extraction of

information from the given source.

Writing: Rewriting the given texts following the prompts - instructional writing skills - illustrative and descriptive

writing.

Communication & Functional skills: Non-verbal communication

Corrective Grammar II - concord

Speaking: Role-plays in various life like situations - debating to express points of view - project development in

groups and pair-work to increase communication practice.

Writing: Critical appreciation of the given text - narrative written structures to express past events - written

communication for task oriented goals.

Communication & Functional skills: Listening and negotiating

Corrective Grammar III - tenses & error detection

Text/Reference Books

1. Sunitha Mishra and C. Muralikrishna, Communication Skills for Engineers, Pearson Education.

2. A.J. Thomson and A.V. Martinet, A Practical English Grammar,OUP, Delhi1.Michael McCarthy and Felicity

(2003), English Vocabulary in Use - Advanced, CUP.

3. Andrea J. Rutherford, Basic Communication Skills for Technology, Pearson Education Asia.

4. Murphy, Murphy‟s English Grammar with CD, Cambridge University Press.

5. English Skills for Technical Students, WBSCTE with British Council, Orient Longman.

6. Robert J. Dixson (2006), Everyday Dialogues in English, Prentice-Hall of India Ltd.

7. Bhaskaran and Horsburgh, Strengthen Your English,Oxford University Press.

8. M. Ashraf Rizvi, Effective Technical Communication,McGraw-Hill.

9. Adrian Doff and Chris Jones (2006), Language in Use, Cambridge

Mode of Evaluation

Writing and speaking skills, tests, quizzes, assignments and seminars.

13

ENGLISH FOR ENGINEERS – I

L T P C

3 0 0 3

Objectives

To help the second language learners to acquire fluency in spoken and written English.

To make students communicate with clarity and precision in the workplace.

To give the students a perspective to appreciate life in its variables by exposing them to comprehension

texts to enrich their word power.

Expected Outcome

Enable students to acquire structure and written expression required for their profession. The students will get the

required training in LSRW through the prescribed texts.

Contents

Communication Skills Aspects of Communication and Body Language

Textual Comprehension Text 1, 2

Structure and Word Magic Tenses, Concord, Tag Question; Word formation

Stylistic Expression Paragraph Writing, Cloze test, Informal letter writing and email

Communication Skills Listening and Interpersonal Communication Skills


Structure and Word Magic Voice Conditionals, Transformation of sentences; Work and Study

Stylistic Expression General Essay, Note making

Communication Skills Speaking and Group discussion


Structure and Word Magic Answer as Directed; Leisure and lifestyle

Stylistic Expression Reading Comprehension

Text / Reference Books

1. English for Professionals - Book 1, Faculty of English, SSH, VIT.

2. Sunita Mishra and C. Muralikrishna, Communication Skills for Engineers.

3. R. Srinivasan and M. Sahul Hameed (2008), Functional Grammar & Composition, VIT Workbook.

4. Michael McCarthy and Felicity (2003), English Vocabulary in Use - Advanced, Cambridge University Press.

5. Krishna Mohan and Meera B. Annerji (1997), Developing Communication Skills, Macmillan India Ltd.

6. Murphy (2006), Essential English Grammar, CUP.

7. Adrian Doff and Chris Jones (2006), Language in Use, Cambridge University Press.

8. Kris Cole (2005), Crystal Clear Communication, East West Book.

Mode of Evaluation Writing and speaking skills, tests, quizzes, assignments and seminars.

14

Subject Code:

ENG102

Title : English for Engineers – II L T P C

3 0 0 3 Version No. 1.0

Course Prerequisites Effective English (English deficient students only) ( or) English for Engineers – I

Objectives 1. To make the students communicate in English for academic and social purpose.

2. To develop the ability to write assignments in a style that is appropriate for university study or within a

training context.

3. To develop the ability to understand spoken language in both lecture format, formal and informal

conversational styles.

4.To develop the ability to speak on general and specific topics in real life situations.

Expected Outcome

The learners will get the required training in LSRW through the prescribed texts. They will also have a

holistic outlook as they go into the world.

Unit Nos. Unit Title Number of hours (per Unit)

Unit 1

Communication Skills 14

Team Talk, Negotiation and Emotional Intelligence

Textual

Comprehension Text 1, 2

Structure and Word Magic

Error Detection (Errors in Formation of Sentences : Tenses, Passivity, Conditionals, Synthesis of Sentences,

Direct & Indirect Speeches, Degrees of Comparison, Affirmative & Negative Sentences, Begin with the

given word) (- based on workbook); Technology

Stylistic Expression

Lab Report; Polite Expression; Dialogue Writing; Case Study

Unit 2


Creativity And Leadership skills

Textual



Error Detection (errors in use of words : Nouns, Pronouns, Verbs, Adjectives, Adverbs, Prepositions,

Articles, Antonyms / Synonyms, Homonyms, Affixes (from General Study); Health and Travel


Technical Reports, Transcoding, Business Letter Writing, Technical description.

Unit 3


Mind Mapping and Career Planning (Self-efficacy skills)

Textual



Error Detection – contd.; Idioms and Phrasal Verbs


Tackling Situations / Argumentative Essays

Text Books 1. English for Professionals, Book II Ed., Faculty, English – SSH, VIT.

2. Mishra, Sunita & C. Muralikrishna, Communication Skills for Engineers, Pearson

Education, Delhi, 2004.

3. Functional Grammar & Composition: VIT Workbook, 2005.

(for Semesters I & II) by R. Srinivasan, M.A. Sahul Hameed.

Reference Books English Vocabulary in Use Advanced, Michael McCarthy and Felicity, Cambridge University Press, 2003.

Developing Communication Skills, Krishna Mohan and Meera Bannerji, Macmillan India Ltd. 1990 Essential English Grammar, Raymond Murphy, Cambridge University Press, 2006.

Language in Use, Adrian Doff and Chris Jones, Cambridge University Press, 2006.

Corporate Soft skills,Sarvesh Gulati, 2006.

Effective Communication, John Adair , Macmillan Ltd.1997.

Mode of Evaluation Written Tests & Examinations, Quizzes, Assignments, Seminars. Speaking skills will be tested through

assignments.

15

CHY 104 ENVIRONMENTAL STUDIES

L T P C

3 0 0 3

Objectives Awareness of environmental factors affecting human population

Expected Outcome

Basic understanding of the major causes of environmental degradation.

Influence of ecological disturbances on human health.

Social and other related factors influencing the human population.

Contents

Environment & Natural Resources Improvement

Definition, scope, importance, need for public, Natural Resources – forest resources – use, exploitation,

deforestation, construction of multipurpose dams – effect on forests, Water resources – use of surface and

subsurface water; effect of floods, drought, water conflicts, food resources – food problems, advantage and

disadvantage of fertilizers & pesticides, effect on environment, Energy resources – need to develop renewable

energy.

Ecology & Bio-diversity

Concept of ecosystem, structure & function of an ecosystem, producers, consumers and decomposers, energy flow,

ecological succession, food chains, food webs and ecological pyramids. Bio diversity: Definition, genetic, species

and ecosystem diversity, bio-geographical classification of India, hotspots, threats related to habitat loss, poaching

of wildlife, man-wildlife conflicts, Conservation of bio-diversity.

Environmental Pollution

Definition – Causes, pollution effects and control measures of air, water, soil, marine, noise, thermal, nuclear

hazards. Solid waste management: causes, effects and control measures of urban and industrial wastes, pollution

Language measures, case studies, Disaster management: floods, earthquake, cyclone and landslides.

Social Issues and the Environment

Urban problems related to energy & sustainable development, water conservation, rain water harvesting, watershed

management, problems related to rehabilitation – case studies, Wasteland reclamation, Consumerism and waste

products – Environment Protection Act, air, water, wildlife, Forest Conservation Act, Environmental legislation and

public awareness.

Human Population and the Environment

Population growth, variation among nations, Population explosion – Family Welfare Programme, Environment and

human health, Human Rights, Value Education, HIV/ AIDS, Women and Child Welfare, Role of Information

Technology – Visit to local polluted site / Case Studies.

Text Book/ Reference Books

1. Kurian Joseph & R. Nagendran, “Essentials of Environmental Studies”, 1st Edition, Pearson Education, 2004.

2. Keerthinarayana & Daniel Yesudian,”Environmental Science and Engineering”, 1st Edition, Hi-Tech

publications, 2004.

3. Erach Bharucha, “A Text Book for Environmental Studies”, Text Book of University Grants Commission,

2004.

4. Peavy, H.S., D.R. Rowe & T.George, “Environmental Engineering”, New York: Mc Graw Hill, 1987.

5. Metcalf & Eddy,”Wastewater Engineering: Treatment and Reuse”, New Delhi, Tata Mc Graw Hill, 2003.

Mode of Evaluation:

Continuous Assessment (Written Exam) and Assignment

16

CSE101 COMPUTER PROGRAMMING AND PROBLEM SOLVING

L T P C

2 0 2 3

Objectives

To provide an overview of computers and problem solving techniques using „C‟ Language that serve as a

foundation for the study of different programming languages.

Expected Outcome

By the end of the course, the students are expected to learn,

Various problems solving technique

Implementation of the problem solving techniques using „C‟ language.

Contents

INTRODUCTION TO COMPUTERS AND ALGORITHMS

Parts of a computer – Overview of operating systems, compilers, interpreters and programming languages.

Algorithms for exchanging the values of two variables, counting, summation of a set of numbers, factorial

computation, sine function computation, generation of the Fibonacci sequence, reversing the digits of an integer,

base conversion and character to number conversion.

CONSTRUCTS OF C

Lexical elements – Operators - data types – I/O statements – format specifications – control statements – decision

making and looping.

ARRAYS

Array handling in C – declaration – single dimensional arrays, two – dimensional arrays, multi-dimensional arrays,

sorting and searching on single and two dimensional arrays. Array order reversal, array counting or histogramming,

finding the maximum number in a set, removal of duplicates from an ordered array, partition an array, finding the

kthsmallest element strings: Character array – string handling functions – manipulation on strings.

FUNCTIONS

Prototype – declaration - arguments (formal and actual) – return types – types of functions difference between built-

in and user-defined functions.

STRUCTURES

Declarations - nested structures- array of structures - structure to functions - unions- difference between structure

and union


1.Alexis Leon and Mathews Leon (2001), Introduction to Information Technology, Tata McGraw-Hill.

2.R.G. Dromey (2001), How to Solve it by Computer, Prentice Hall of India.

3.Al Kelley and Ira Pohl (1998), A Book on C Programming in C, 4thEdition, Pearson Education.

Mode of Evaluation Written examinations, seminar, assignments, surprise tests and quizzes

17

MGT301 ETHICS AND VALUES

L T P C

3 0 0 3

Objectives: To understand the moral problems faced in the corporate setting and wider philosophical

frameworks along with social importance and their intellectual challenges are given its due placement.

Expected Outcome: The students will have hands-on experience with the day-to-day problems and their allied

alternative decision making towards social and business environment

CONTENTS

Unit Description Hours

1

Scope and aims of Professional Ethics. – What is Ethics? - Why Study Ethics? –

Professions and Professionalism.-Ethical reasoning and theories – Professional ideals and

virtues – Study of reasoning – Theories about right action – Self interest – Customs and

religion.

15

2

Social Experimentation and Environmental Ethics – Experiments and responsible

experimentation‟s and moral autonomy and accountability - Code of Ethics and balanced

outlook- Responsibility towards employers

15

3

Safety and Risk Management – Safety – Risk – Assessment – Risk reduction analysis –.

Global Issues in Ethics – Loyalty – Authority - Collective bargaining – Conflicts of

Interest – Occupational Crime.

15

Text Books :

1. L.H. Newton & Catherine K.D. – Classic cases in Environmental Ethics, Belmont: California Wadsworth,

2006.

Reference Books:

1. Mike W Martin & Ronald Schnizinger, Engineering Ethics, New Delhi: Tata McGraw Hill,Latest Edition

2. OC Ferrell, John Paul Frederich,Linda Ferrell; Business Ethics – Ethical Decision making and Cases- 2007

Edition, Biz Tantra, New Delhi

Mode of Evaluation: CAT I/CAT II, End Term Tests, Assignments and any of these following components

Mini projects/Seminars/ Quizzes /Case Discsussion/Term Ppaer/Class Participation/Assessment of class Notes

18

MAT101 MULTIVARIABLE CALCULUS AND DIFFERENTIAL EQUATIONS

L T P C

3 1 0 4

Objectives

To provide the requisite and relevant background necessary to understand other important engineering

mathematics courses offered for Engineers and Scientists.

To introduce three important topics of applied mathematics, viz., multiple integrals, Vector calculus and

Laplace transforms.

Expected Outcome

By the end of the course, the students are expected to learn

How to evaluate multiple integrals in Cartesian, Cylindrical and Spherical geometries.

Vector calculus with application in Fluid Dynamics and Electromagnetic fields.

To solve ordinary differential equations.


Mathematics at 10+2 level (or) Basic Mathematics (MAT001)

Contents

MULTIVARIABLE CALCULUS

Functions of two variables - limits and continuity - partial derivatives – total differential – Taylor‟s expansion for

two variables – maxima and minima –constrained maxima and minima - Lagrange‟s multiplier method - Jacobians

MULTIPLE INTEGRALS

Evaluation of double integrals – change of order of integration – change of variables between Cartesian and polar

co-ordinates - evaluation of triple integrals - change of variables between Cartesian and cylindrical and spherical

polar co-ordinates - beta and gamma functions – interrelation - evaluation of multiple integrals using gamma and

beta functions - error function and its properties.

VECTOR CALCULUS

Scalar and vector valued functions – gradient – physical interpretation - total derivative – directional derivative -

divergence and curl – physical interpretations - vector identities (without proof) - scalar and vector potentials -line,

surface and volume integrals - Green‟s, Stoke‟s and Gauss divergence theorems (without proof) -verification and

evaluation of vector integrals using them.

ORDINARY DIFFERENTIAL EQUATIONS

Linear higher order ordinary differential equation with constant coefficients – solutions of homogenous and non-

homogenous ODEs - method of undetermined coefficients – method of variation of parameters – equations reducible

to linear equations with constant coefficients.

LAPLACE TRANSFORMS

Definition: Laplace transforms of functions - properties of Laplace transforms - initial and final values theorems -

inverse transforms - transforms of periodic functions - convolution theorems – step functions, impulse functions -

concept of transfer functions – applications to the solution of differential equations.


1. G.B. Thomas and R.L. Finney (2002), Calculus and Analytical Geometry, 9thEdition, Pearson Education.

2. Michale D. Greenberg (2002), Advanced Engineering Mathematics, 2nd Edition, Pearson Education.

3. Peter V.O‟ Neil (2003), Advanced Engineering Mathematics, 5thEdition, Thomson Brook/Cole.

4. Erwin Kreyszig (2004), Advanced Engineering Mathematics, 8th Edition., John Wiley & Sons.

5. B.S. Grewal (2005), Higher Engineering Mathematics, 38thEdition, Khanna Publications.

Mode of Evaluation

Continuous Assessment Tests, assignments, tutorial sheets, class Tests, quizzes

19

Course Code:

MAT 105

DIFFERENTIAL AND DIFFERENCE EQUATIONS

L T P C

3 1 0 4

Version No. 1.1

Course Prerequisites Multivariable Calculus and Differential Equations (MAT101)

Objectives This course is designed to give a comprehensive coverage at an introductory level to the subject

of ordinary differential equations and difference equations. Matrix methods and eigenvalue

problems are integrated in to the course. Sufficient emphasis is laid on mathematical modeling

and analysis of simple engineering problems.

Expected Outcome By the end of the course, the students are expected to know how to model simple physical

problems in the form of a differential and difference equations, analyze and interpret the

solutions. Further the students are expected to acquire necessary background in matrix methods

and Eigenvalue problems so as to appreciate their importance to engineering systems.

Unit Nos. Unit Title Number of hours (per Unit)

Unit 1 Matrix methods to Linear Differential Equations 9 + 3 hours

The eigen value problem- eigen values and eigen vectors - Cayley-Hamilton theorem and its applications- symmetric

matrices- properties of eigen values and eigen vectors-similarity of matrices - diagonalisation of a real symmetric matrix-

quadratic form.

Solution of equations of type X11

+ AX=0 - reduction of nth order system to a system of first order equations by

diagonalization.

Unit 2 Power Series Solutions 9 + 3 hours

The Strum-Liouville Problem-orthogonality of eigen functions- Bessel‟s and Legendre‟s equations- power series solutions –

method of Frobenius.

Unit 3 Fourier Series 9 + 3 hours

Fourier series -Euler‟s formulae- Dirichlet‟s conditions - change of interval- half range series – RMS value – Parseval‟s

identity – computation of harmonics.

Unit 4 Difference Equations and Z-transforms 9 + 3 hours

Difference equation-first and second order difference equations with constant coefficients-Fibonacci sequence-solution of

difference equations-complementary functions - particular integrals by the method of undetermined coefficients.

Z-transform-relation to Laplace transforms - Z-transforms of standard functions-inverse Z-transforms by partial fraction

method-by convolution- solution of simple difference equations using Z-transforms.

Unit 5 Applications of Differential Equations 9 + 3 Hours

First order equations: Newton‟s law of cooling – radioactive decay, L-R and C-R circuits-Equation of motion for a

particle in gravitational field – Terminal velocity.

Second order equations: Free undamped and damped vibrations, Forced oscillations-Resonance phenomenon, series LCR

circuit - Model of a vibrating systems with two masses – Solutions by matrix methods.

Text Books 1. Erwin Kreysizing, Advanced Engineering Mathematics, 8th Edition, John Wiley & Sons,

(Wiley student Edison)(2004).

2. B.S.Grewal, Higher Engineering Mathematics, 40th Edition. Khanna Publications(2007).

Reference Books

1. W.E.Boyce and R.C. Diprima, Elementary differential equations, 7th Edition. John Wiley &

Sons, Inc.(2002).

2. Michale D. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson Education,

First Indian reprint (2002).

3. Peter V. O‟ Neil, Advanced Engineering Mathematics, 5th Edition, Thomson, Book/Cole

(2003).

4. C. Ray Wylie, Advanced Engineering Mathematics, 6th Edn, McGraw Hill (1995).

5. Gary L. Peterson, Linear Algebra and Differential Equations, Addison-Wesley (2002).

6. James C. Robinson, “An introduction to ordinary differential equations”, Cambridge Univ.

Press(2000).

Mode of Evaluation Continuous Assessment Tests, Assignments, Tutorial sheets, Class Tests, Quizzes.

Recommended by the Board of Studies on 04-04-2009.

Date of approval by the Academic

Council

http://mail.vit.ac.in/exchange/vmchandrasekaran/Sent%20Items/catalog/academic/product/0,1144,0201662124,00.html

20

APPLIED PROBABILITY, STATISTICS AND RELIABILITY

Objectives

To provide principles of statistical methods and probability concepts that serves the foundations for the applications

of methods in their engineering works.

Expected Outcome

After completion of this course student able to incorporate statistical methods and probability concepts in their

engineering works


Multivariable Calculus and Differential Equations, Differential and Difference Equations

Contents

History and overview: Indicate some reasons for studying probability and statistics; Highlight some people that

influenced or contributed to the area of probability and statistics; Indicate some important topic areas such as

discrete probability, continuous probability, expectation, sampling, estimations, stochastic process, correlation, and

regression; Describe the meaning of discrete probability; Describe the meaning of continuous probability; Contrast

discrete from continuous probability; Provide a context for considering probabilistic expectation; Indicate the reason

for using sampling distributions; Define a stochastic process; Mention the need for considering stochastic processes;

Describe the need for probabilistic estimation in computer engineering; Highlight the importance of correlation;

Provide examples for using regression; Explore some additional resources associated with probability and statistics;

Explain the purpose and role of probability and statistics in computer engineering.

Discrete probability: Randomness, finite probability space, probability measure, events; Conditional probability,

independence, Bayes‟ theorem; Discrete random variables; Binomial, Poisson, geometric distributions; Mean and

variance: concepts, significance, computations, applications; Integer random variables.

Continuous probability: Continuous random variables, the nature of these, illustrations of use; Exponential and

normal distribution: probability density functions, calculation of mean and variance; the central limit theorem and

the implications for the normal distribution; Joint distribution.

Expectation: Moments, transform methods, mean time to failure; Conditional expectation, examples; Imperfect

fault coverage and reliability.

Stochastic processes: Introduction: Bernoulli and Poisson processes, renewal process, renewal model of program

behavior; Discrete parameter Markov chains: transition probabilities, limiting distributions; Queuing: M/M1 and

M/G/1, birth and death process; Finite Markov chains, program execution times.

Sampling distributions: Purpose and the nature of sampling, its uses and applications; Random approaches to

sampling: basic method, stratified sampling and variants thereof, cluster sampling; Non-random approaches:

purposive methods, sequential sampling; Data analysis; tools; graphical and numerical summaries; Multivariate

distributions, independent random variables.

Estimation: Nature of estimates: point estimates, interval estimates; Criteria to be applied to single point estimators:

unbiased estimators, consistent estimators, efficiency and sufficiency of estimators; Maximum likelihood principle

approach, least squares approach; applicability conditions for these; Confidence intervals; Estimates for one or two

samples.

Hypothesis tests: Development of models and associated hypotheses, the nature of these; Hypothesis formulation:

null and alternate hypotheses; Testing hypothesis based on a single parameter, choice of test statistic; choice of

samples and distributions; Criteria for acceptance of hypothesis; t-test, chi-squared test; applicability criteria for

these.

Correlation and regression: The nature of correlation and regression, definitions; Definition and calculation of

correlation coefficients; Approaches to correlation: the linear model approach, the least squares fitting approach,

strengths and weaknesses of these and conditions for applicability.


1. Cornell, J.A.,, experiments with mixtures: Designs, Models and the Analysis of Mixture Data, 3rd Edition, John

Wiley & Sons, Inc., New York

2. Blake, An Introduction to Applied Probability, John Wiley

3. S.M. Ross, Introduction to Probability Models, 6th edition

4. A M Yagolam, I.M. Yagolam Probability and Information, Hindustan Pub. Corp.

5. J. Jacob, P. Protter, Probability Essentials, Springer Verlag

Mode of Evaluation: Written examinations, seminar, assignments, surprise tests and quizzes

L T P C

3 1 0 4

21

Subject Code

MAT202

Title : LINEAR ALGEBRA L T P C

3 1 0 4

Version No. 1.0

Course Prerequisites MAT101 Multivariable Calculus and Differential

Equations

Objectives Linear algebra is one of the most important subjects in the study of

engineering because of its widespread applications in electrical,

communications and computer science. The objective of this course is

to give a presentation of basic concepts of linear algebra to illustrate

its power and utility through applications to computer science and

engineering.

Expected Outcome

By the end of the course the students are expected to learn the

concepts of vector space, linear transformations, matrices and inner

product space. Further the students are expected to solve problems in

cryptography, computer graphics and some physical problems.

Unit Nos. Unit Title Number of hours (per

Unit)

Unit 1 Linear Equations and Matrices 10+3 hours

System of linear equations- Gaussian elimination/Jordan – block matrices- elementary matrices-

finding inverse of matrices-permutation matrix-- LDU factorization- applications to cryptography

and electrical network.

Unit 2 Vector space 10+3 hours

Vector spaces- sub spaces – -bases-spanning space-dimensions-linear combination-linearly

dependent-independent -finite dimensional-row and column spaces – Rank and nullity – invertibility-

application to interpolation.

Unit 3 Linear transformations 13 +4 Hours

Linear transformations – invertible linear transformation- matrices of linear transformations – vector

space of linear transformations – change of bases – similarity – application to computer graphics.

Unit 4 Inner product spaces 13 +4 Hours

Inner products – the lengths and angles of vectors – matrix representations of inner products- Gram-

Schmidt orthogonalization – projection-orthogonal projections – relations of fundamental subspaces

– orthogonal matrices and isometrics – applications to least square solutions.

Text Book Jin Ho Kwak and Sungpyo Hong, Linear Algebra, Second edition,

Springer (2004). (Chapters 1,3,4 and 5).

Reference Books

1. Stephen Andrilli and David Hecher, Elementary Linear Algebra,

3rd

Edition, Academic Press(2006)

2. Charles W. Curtis, Linear Algebra, Springer (2004)

3. Howard Anton and Robert C Busby, Contemporary linear algebra,

John Wiley (2003).

4. Gilbert Strang, Introduction to Linear Algebra, 4th

Edition,

Wellesley-Cambridge Press (2009).

Mode of Evaluation Continuous assessment Examination, Assignments, Tutorial sheets,

Class Test, Quiz.

http://www.wellesleycambridge.com/

22

PHY101 MODERN PHYSICS

L T P C

3 0 2 4

Objectives

To enable the students to understand the basics of the latest advancements in Physics, viz., Quantum Mechanics,

Lasers, Fiber Optics, Ultrasonic‟s, Microwaves and Nanotechnology.

Expected Outcome

At the end of the course, students will acquire the necessary knowledge about modern physics and its applications in

various engineering and technology disciplines.


Physics as one subject in 12thStandard or equivalent level.

Contents

QUANTUM PHYSICS

Dual nature of electron magnetic radiation - de Broglie waves – Compton Effect experimental verification -

Heisenberg uncertainty principle – Schrodinger equation – application - particle in a box (ID) – Spectroscopy.

Application of Quantum Mechanics - Scanning Tunneling Microscope - Atomic Force Microscope problems.

LASER

Laser characteristics - Einstein‟s coefficients - its significance - population inversion - three level, four level laser –

Schawlow and Townes condition – Nd. YAG, He-Ne-CO2laser – welding, drilling, cutting – optical disk systems –

recording – data readout from optical disks – Holography – Recording and Reconstruction – Problems.

FIBER OPTICS Light propagation through fibers – Acceptance angle - numerical aperture – types of fibers – step index, graded

index – single mode, multimode – dispersion– intermodal, intramodal – application of fiber optics in communication

– source LED – Laser diode – Detector – PIN photodiode – endoscope – problems.

ULTRASONIC AND MICROWAVES Properties – generation – Magnetostriction method – Piezo-electric method – detection of ultrasonic – applications-

NDT Characteristic features of micro waves – TE and TM modes – Klystron – Gunn diode – applications of

microwaves.

NANO TECHNOLOGY

Nanoscale – Nanomaterials – properties of Nanomaterials – Moore‟s Law Semiconductor nanoparticles –

Nanocomposites – Quantum well – Wire – Dots – Nanolithography – Applications of Nanotechnology – Aerospace

components – sensors – Medicine.


1. B.B. Laud, Lasers and Non-Linear Optics, 2ndEdition, New Ages International.

2. Ghatak and K. Thyagarajan (2002), Introduction to Fiber Optics, Cambridge University Press.

3. William Silfvast (2002), Laser Fundamentals, Cambridge University Press.

4. Djafar K. Mynbaeu (2004), Fibre Optic Communication Technology, Pearson Education Asia.

5. Kittel (2001), Solid State Physics, 7thEdition, John Wiley & Sons.

6. K.C. Gupta (2002), Microwaves, New Age International.

7. Arthur Beiser (2003), Concepts of Modern Physics, 6thEdition, Tata-McGraw Hill.

8. Charles P. Poole, Jr. and Frank J. Owens (2003), Introduction to Nanotechnology, John Wiley & Sons

9. Edward L. Wolf (2006), Nano Physics and Nanotechnology – An introduction to Modern Concepts in

Nanoscience, Wiley VCH verlagambh & Co., Weinheim.

Mode of Evaluation

Written examinations, surprise test, quizzes, assignments, seminar, group discussion

23

MAT 106 DISCRETE MATHEMATICAL STRUCTURES

L T P C

3 1 0 4

Objectives

The aim of this course is to motivate the students to address the challenge of the relevance of inference theory,

Algebraic structures and graph theory to computer science and engineering problems.

Expected Outcome

By the end of the course, the students are expected to use inference theory in circuit models, and algebraic theory in

computer science problems, graph theory in net work models and lattices & Boolean algebra in Boolean functions.


Digital Logic

Contents

SETS, RELATIONS AND FUNCTIONS

Sets (Venn diagrams, complements, Cartesian products, power sets); Pigeonhole principle; Cardinality and

countability; Relations (reflexivity, symmetry, transitivity, equivalence relations); Functions (surjections, injections,

inverses, composition).

BASIC LOGIC

Propositional logic; Logical connectives; Truth tables; Normal forms (conjunctive and disjunctive); Validity;

Predicate logic; Universal and existential quantification; Modus ponens and modus tollens; Limitations of predicate

logic.

PROOF TECHNIQUES

Notions of implication, converse, inverse, contrapositive, negation, and contradiction; The structure of formal

proofs; Direct proofs; Proof by counterexample; Proof by contraposition; Proof by contradiction; Mathematical

induction; Strong induction; Recursive mathematical definitions; Well orderings.

BASICS OF COUNTING

Counting arguments – Sum and product rule, Inclusion-exclusion principle, Arithmetic and geometric progressions,

Fibonacci numbers; the pigeonhole principle; Permutations and combinations – Basic definitions, Pascal‟s identity,

and the binomial theorem; solving recurrence relations – Common examples, The Master theorem.

GRAPHS AND TREES

Trees; Undirected graphs; Directed graphs; Spanning trees; Traversal strategies.

DISCRETE PROBABILITY

Finite probability space, probability measure, events; Conditional probability, independence, Bayes‟ theorem;

Integer random variables, expectation.


1. Kolman and Busby, Discrete Mathematical Structures for Computer Science

2. J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata

McGraw Hill – 13th reprint (2001).

3. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education (2001).

4. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2nd Edition (2000).

5. B.Kolman, R.C.Busby and S.C.Ross, Discrete Mathematical structures, 4th Edition, PHI(2002).

6. C.L.Liu, Elements of Discrete Mathematics, 2nd Edition, Tata McGraw Hill (2002).

Mode of Evaluation

Written examinations, assignments, surprise tests and quizzes

24

THEORY OF COMPUTATION

L T P C

3 1 0 4

Objectives

To provide an understanding of the basic concepts in theoretical computer science.

To comprehend complex concepts and formal proofs in theoretical computer science in order to improve

reasoning and problem solving skills.

To prepare students for more advanced courses in automation theory, formal languages, algorithms & logic

Expected Outcome

At the end of the course students should able to

Understand the essence of computing through simple computational models;

Apply these models in practice to solving problems in diverse areas such as pattern matching,

cryptography, and language design;

Understand the limitations of computing, the relative power of formal languages and the inherent

complexity of many computational problems of practical importance;


Discrete Mathematical Structures, Algorithm Design and Analysis

Contents

AUTOMATA

Strings, Alphabet, Language, Operations, Finite State Machine, definitions, finite automation model, acceptance of

strings and languages, on deterministic finite automation, deterministic finite automation, equivalence between NFA

and DFA, Conversion of NFA into DFA, minimization of FSM ,equivalence between two FSM's, Moore and Malay

machines.

REGULAR EXPRESSIONS

Regular sets, regular expressions, identity rules, manipulation of regular expressions, equivalence between RE and

FA, inter conversion, Pumping lemma, Closure properties of regular sets(proofs not required),regular grammars,

right linear and left linear grammars equivalence between regular linear grammar and FA, inter conversion between

RE and RG.

CONTEXT FREE GRAMMARS

Context free Grammars, Derivation trees, Left Most Derivations, Right Most Derivations, Ambiguity in Context-

Free Grammars, Specifications of Context Free Grammars, Normal Forms, Chomsky Normal Form (CNF),

Greibach Normal Form (GNF)

TURING MACHINE

Turing machine, definition, model, design of TM, Computable Functions, recursive enumerable language, Church‟s

Hypothesis, Counter machine, types of TM's(Proofs not required).

CLASSES OF PROBLEMS

Chomsky hierarchy of languages, linear bounded automats and context sensitive language, Introduction to DCFL

and DPDA,LR(O) Grammar, decidability of problems, Universal Turing Machine, undecidability of post‟s

correspondence problem. Turing reducibility, definition of P and NP problems, NP complete and NP hard problems


1. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation,

Addison- Wesley, 2006.

2. Krishna Murthy E.V. "introduction to theory of Computer Science", Afiiliate Easte West Press

3. Lewis H.P. & Papadimition C.H. "Elements of Theory of Computation", Prentice Hall

Mode of Evaluation

Written examinations, seminar, assignments, surprise tests and quizzes

25

GRAPH THEORY AND ITS APPLICATIONS

Objectives

This subject aims to cover basic concepts of Graph theory

Expected Outcome

The students would be able to understand and explain fundamentals of Graph Theory their applications.


Theory of Computation

Contents

INTRODUCTION

Definitions, importance, isomorphism, walk, paths, circuits, connected, disconnected graphs, operation on graphs

operation on graphs, Euler and Hamiltonian graphs.

TREES

Properties, distance and centers, trees, spanning trees, fundamental circuits, minimal spanning tree, Cut sets

Properties, fundamental circuits and cut sets, connectivity, separatability, network flows, 1-2 isomorphism ,Planar

and dual graphs, Combinatorial representation, planar graphs, kuratowski‟s graphs, detection of planarity, dual

graphs.

MATRIX REPRESENTATION OF GRAPHS

Incidence matrix, circuit matrix, cut set matrix, fundamental matrices, relationships amongst matrices, path matrix,

and adjacency matrix.

COLORING, COVERING AND PARTITIONING

Chromatic number, chromatic partitioning, matching, covering, four color problem

DIRECTED GRAPHS

Different types, directed paths and connectedness, Euler digraphs, trees-matrix representation, tournament.

Graph theoretic algorithms , Computer representation of graphs – input & output, algorithms for connectedness,

spanning tree, fundamental circuits, cut vertices, directed circuits and shortest paths.

TEXT / REFERENCE BOOKS

1. Narasing Deo, Graph Theory With Application To Engineering And Computer Science, Prentice Hall India,

1995. (Chapters 1 To 5,7 To 9,11.1 To11.5)

2. Tulasiraman And M.N.S. Swamy, Graph, Networks And Algorithms, John Wiley, 1981.

3. F.Harary, Graph Theory, Addison Wesley/ Narosa, 1998.

4. E.M.Reingold, J.Nievergelt, N.Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, N.J.1977.

Mode of Evaluation Written examinations, assignments, surprise tests and quizzes

L T P C

3 0 0 3

26

MAT 203 NUMERICAL ANALYSIS

L T P C

3 0 0 3

Objectives

To provide concepts of numerical methods that can cab used in many engineering applications.

Expected Outcome

On completion of this course student able to apply numerical algorithms concepts in engineering applications


Differential and Difference Equations

Contents

SOLUTION OF EQUATIONS AND EIGEN VALUE PROBLEMS

Iterative method, Newton – Raphson method for single variable and for simultaneous equations with two variables.

Solutions of a linear system by Gaussian, Gauss-Jordan, Jacobi and Gauss – Seidel methods. Inverse of a matrix by

Gauss – Jordan method. Eigen value of a matrix by Power and Jacobi methods.

INTERPOLATION

Newton‟s divided difference formulae, Lagrange‟s and Hermite‟s polynomials. Newton forward and backward

difference formulae. Stirling‟s and Bessel‟s Central difference formulae.

NUMERICAL DIFFERENTIATION AND INTEGRATION

Numerical differentiation with interpolation polynomials, Numerical integration by Trapezoidal and Simpson‟s

(both 1/3rd and 3/8th) rules. Two and Three point Gaussian quadrature formula. Double integrals using Trapezoidal

and Simpson‟s rule.

INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS

Single step Methods – Taylor Series, Euler and Modified Euler, Runge – Kutta method of order four for first and

second order differential equations. Multistep Methods-Milne and Adam‟s Bashforth predictor and corrector

methods.

BOUNDARY VALUE PROBLEMS FOR ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS

Finite difference solution for the second order ordinary differential equations. Finite difference solution for one

dimensional heat equation (both implicit and explicit), One-dimensional wave equation and two-dimensional

Laplace and Poisson equations.

TEXT / REFERENCES BOOKS

1. Sastry, S.S., “Introductory Methods of Numerical Analysis (Third Edition)”, Prentice Hall of India, New Delhi,

1998.

2. Kandasamy, P.,Thilakavthy, K. and Gunavathy, K. “Numerical Methods”, S.Chand and Co., New Delhi ,1999.

3. Grewal B.S., Grewal J.S., “Numerical Methods in Engineering and Science”, Khanna Publishers, New Delhi,

1999.

4. Jain M.K., Iyengar S.R.K and Jain R.K., “Numerical Methods for Engineering and Scientific Computation

(Third Edition)”, New Age International (P) Ltd., New Delhi, 1995.

5. Gerald C.F., Wheatley P.O., Applied Numerical Analysis (Fifth Edition), Addison – Wesley, Singapore, 1998.

6. Narayanan S., Manickavachakam Pillai K. and Ramanaiah G., “Advanced Mathematics for Engineering

Students-Vol.-III”, S.Viswanathan Pvt. Ltd., Chennai, 1993.

Mode of Evaluation

Written examinations, assignments, surprise tests and quizzes

27

Course

Code:CHY101

Title: Engineering Chemistry L T P C

2 1 2 4

Version No. 1.0

Course Prerequisites Basic Chemistry at 12thStandard or equivalent level.

Objectives •To impart technological aspects of modern chemistry

•To lay foundation for the application of chemistry in engineering and

technology disciplines.

Expected Outcome At the end of the course, the students will be familiar with the fundamentals

of water technology; corrosion and its control; applications of polymers in

domestic and engineering areas; types of fuels and their applications; and

recent trends in electrochemical energy storage devices.

Unit No. Unit Title No. of hours (per Unit)

Unit I Water Technology 8

Hardness of water: Hard and soft water, Units of Hardness (numerical problems). Disadvantages of

hard water: Scale and sludge, caustic embrittlement, priming and foaming, corrosion. Estimation of

hardness: EDTA, alkali titration method (numerical problems). Softening methods: Lime soda

(numerical problems), zeolite, ion exchange, mixed bed deionizer, treatment of municipal water.

Desalination: Desalination of sea water, brakish water, electrodialysis, reverse osmosis.

Unit II Corrosion & Corrosion Control 8

Corrosion: Types and causes of corrosion, factors influencing corrosion, corrosion inhibitors.

Corrosion control: Protective coatings, electroplating, metal finishing, physical vapour deposition,

chemical vapour deposition. High energy coating processes: Ion implantation.

Unit III Polymers 8

Classification of polymers: Thermoplastics, thermosetting plastics - properties and industrial

applications of important thermoplastic, thermosetting plastics. Moulding of plastics into articles:

Compression, injection, transfer and extrusion methods. Conducting polymers: Properties and

applications - biodegradable polymers.

Unit IV Fuels and Combustion 8

Fuels: Classification of fuels, calorific value - LCV, HCV; measurement of calorific value using bomb

calorimeter (numerical problems). Combustion: Calculation of air qualities (problems). Liquid Fuels:

Knocking and anti-knocking for petrol and diesel (octane number and cetane number) - diesel index.

Gaseous fuels: LPG, natural gas, CNG: Composition and applications. Biofuels: Biodiesel and Biogas

-composition and applications.

Unit V Electrochemical Energy systems 8

Electrochemical energy systems: Basic concepts of electrochmical energy systems. Conventional

primary batteries: Dry cell. Advanced primary batteries: Lithium and alkaline primary batteries.

Conventional secondary batteries: Lead-acid, nickel-cadmium secondary batteries. Advanced

secondary batteries: Nickel-Metal hydride and lithium-ion secondary batteries. Fuel cells: Key issues

– Hydrogen-oxygen fuel cells - new generation fuel cells – electric vehicle application – solid oxide

fuel cells.

Text Books 1.P.C. Jain and M. Jain (2006), Engineering Chemistry, 15th Edition,

Dhanpat Rai Publishing Co., New Delhi.

2.S.S. Dara (2006), A Text book of Engineering Chemistry, 11th Revised

Edition, S. Chand & Co Ltd., New Delhi.

28

Reference books 1.B.R. Puri and L.R. Sharma (2004), Principles of Physical Chemistry, 27th

Edition, Vishal Publishing Co.

2.J.C. Kuriacose and J. Rajaram (1996), Chemistry in Engineering and

Technology, Vol. 1, Tata McGraw-Hill Publishing Company, New Delhi.

3.David Linden (2002), Hand Book of Batteries, 3rdEdition, McGraw Hill

Publishers.

Mode of Evaluation Written examinations, seminar, assignments, surprise tests and quizzes.

29

EEE101 BASIC ELECTRICAL AND ELECTRONICS ENGINEERING

L T P C

3 0 2 4

Objectives To provide overview of electrical and electronics engineering that serve the foundation for advanced studies in the

area of electrical and electronics engineering

Expected Outcome

On completion of this course student able to understand the concepts of electrical and electronics engineering


Physics at +2 or equivalent level.

Contents

Elementary Circuit Analysis Ohm‟s law, KCL, KVL, node voltage analysis, mesh current, circuits with dependant and controlled sources,

Thevenin‟s & Norton‟s equivalent, maximum power transfer and superposition theorem, VI characteristics for

capacitors and inductors.

Analysis of DC and AC Circuits

Steady state DC analysis, RL and RC transients in circuits with DC source, analysis of a second order circuit with a

DC source, RMS values, the use of phasors for constant frequency sinusoidal sources, steady state AC analysis of a

series circuit, series and parallel combinations of complex impedances, AC power calculations.

Digital Systems

Basic logic circuit concepts, representation of numerical data in binary form - combinatorial logic circuits, synthesis

of logic circuits, minimization of logic circuits - sequential logic circuits - computer organization, memory types,

digital process control, computer based instrumentation systems, measurement concepts and sensors, signal

conditioning, analog to digital conversion.

Semiconductor Devices

Basic diode concepts, zener diode voltage regulator concepts, ideal diode model, rectifier and wave-shaping circuits,

linear small signal equivalent circuits, basic amplifier concepts, cascaded amplifiers, ideal amplifiers, differential

amplifiers, NMOS and PMOS transistors, bias circuits, small signal equivalent circuits, CMOS logic gates, bipolar

junction transistors, current and voltage relationship, common emitter characteristics, large signal DC circuit

models, small signal equivalent circuits, ideal operational amplifiers, inverting and non-inverting amplifiers,

integrators & differentiators.

Electromechanics

Magnetic fields and circuits, self and mutual inductance, ideal and real transformers, principles of rotating DC

machines, shunt, separately excited and series connected DC motors, speed control of DC motors, 3-phase induction

motors, synchronous machines and single phase induction motors, stepper motors and brushless DC motors.

Text /Reference Books

1. Allan R. Hambley (2008),Electrical Engineering-Principles and Applications, Pearson Education.

2. D.P. Kothari and I.J. Nagrath (2002), Basic Electrical Engineering, 2nd Edition, Tata McGraw-Hill.

3. D.P. Kothari and I.J. Nagrath (1998), Theory and Problem of Basic Electrical Engineering, Prentice Hall of

India, New Delhi.

4. R.A. DeCarlo and Pen-Min Lin (2001), Linear Circuit Analysis, 2ndEdition, Oxford University Press, New

Delhi.

5. W.H. Hayt, J.E. Kemmerly and S.M. Durbin (2002),Engineering Circuit Analysis, 6thEdition, Tata McGraw-

Hill, New Delhi.

Mode of Evaluation Assignments, seminars, written examinations

30

ELECTRONICS

L T P C

3 0 2 4

Objectives

1. To give an insight into the field of Electronics through basic electronic devices.

2. To get to know the intricacies of design and operation of some basic electronic circuits.

3. To enable to freely work with the devices in Labs.

Expected Outcome

1. The students will acquire full knowledge of the devices they will be handling.

2. Will come to know the trouble shooting methodology while working with devices and circuits.


Basic Electrical and Electronics Engineering

Contents

SEMICONDUCTOR BASICS

Semiconductor Devices: Intrinsic, Extrinsic, Drift and diffusion currents – PN junction – PN junction Diode – VI

characteristics – Diode equation– Problems – Diffusion and Transition Capacitances Equivalent circuit – Half wave

rectifier – Full – Wave rectifiers – Filters (C,L,LC, &RC) – PN Diode clippers & clampers and problems –

Avalanche and Zener breakdown – Zener diode.

Special purpose Diodes :- Varactor diode – Tunnel diode – PIN diode

BIPOLAR JUNCTION TRANSISTOR

Transistor action – current components – I/o characteristics of CB, CE, CC configuration – Transistor Biasing – Bias

stability – problems – operating point – Load line analysis problems – Bias compensation – Thermal run-away in

Transistor – Use of heat sinks.

FET AND OTHER DEVICES

Constructional features of JFET – MOSFET – handling precautions of MOSFET – FET Biasing methods –

MOSFET biasing methods –Problems,Construction and characteristics of UJT, SCR, DIAC and TRIAC.

PHOTO ELECTRIC DEVICES

Photo emissivity, Photo diode, photo voltaic cells, LED, LCD, Photo transistor, PN junction Laser, Solar energy

converters.

OPERATIONAL AMPLIFIERS

Ideal op-amp, common mode and differential mode signals, CMRR, Applications of Op-amps: Inverting and Non-

Inverting amplifier, summing amplifier, differentiator, integrator, comparator.


1. Robert Boylestad & Louis Nashelsky „Electronic Devices & Circuit Theory‟ Pearson Education, 2007.

2. Theodore F. Boghert, „Electronic Devices & Circuits‟, Pearson Education, 6/e, 2003.

3. Allen Mottershead, „Electronic Devices and Circuits – An Introduction‟, Prentice Hall of India, New Delhi,

2003


31

CSE 103 PROGRAMMING FUNDAMENTALS

L T P C

3 0 0 3

Objectives

1. To help the students understand the fundamental concepts of programming Languages.

2. To teach students about the need and use of data structures

3. To prepare students to identify and apply data structures for problem solving.

Expected Outcome


Understand the programming constructs of various languages.

Know and work with fundamental data structures.

Improve the problem solving skill using data structures.


Computer Programming and Problem Solving

Contents

FUNDAMENTAL PROGRAMMING CONSTRUCTS

Basic syntax and semantics of a higher-level language, Variables, types, expressions, and assignment, Simple I/O,

Conditional and iterative control structures, Functions and parameter passing, structured decomposition.

ALGORITHMS AND PROBLEM-SOLVING

Problem-solving strategies, Role of algorithms in the problem-solving process, Implementation strategies for

algorithms, Debugging strategies, The concept and properties of algorithms.

FUNDAMENTAL DATA STRUCTURES

Primitive types, Arrays, Records, Strings and string processing, Data representation in memory, Static, stack, and

heap allocation, Runtime storage management, Pointers and references, Linked structures, Implementation strategies

for stacks, queues, and hash tables, Strategies for choosing the right data structure.

RECURSION

The concept of recursion, Recursive mathematical functions, Simple recursive procedures, Divide-and-conquer

strategies, Recursive backtracking, Implementation of recursion

EVENT-DRIVEN PROGRAMMING

Event-handling methods, Event propagation, Exception handling.


1. S. Sahni, Data structures, algorithms, & applications in C++, McGraw-Hill.

2. R.W. Sebasta , Concepts of Programming Languages, Fifth Edition Addison Wesley, 2002

3. Jeri R. HanlyElliot B. Koffman, Problem Solving and Program Design in C, Addison-Wesley5/E

4. Jean-Paul Tremblay Paul G. SorensonAn Introduction to Data Structures with Applications, Tata McGraw-Hill

Publicatons2nd Edition

Mode of Evaluation Written examinations, Seminar, Programming assignments, Surprise tests and Quizzes

32

THE OBJECT – ORIENTED PARADIGM

L T P C

3 1 0 4

Objectives

To understanding the principles of object oriented programming

To introduce the object oriented way of problem solving.

To provide a familiarity with the syntax, class hierarchy, environment and simple application construction

for an object-oriented programming language

Expected Outcome


Acquire a full Object Oriented Thinking.

Have a clear understanding of the object-oriented concepts such as objects, classes, inheritance, and

Polymorphism.

Apply the object oriented concepts in application development



Contents

OVERVIEW OF PROGRAMMING LANGUAGES

History of programming languages; Brief survey of programming paradigms – Procedural languages, Object-

oriented languages, Functional languages, Declarative, non-algorithmic languages, Scripting languages; the effects

of scale on programming methodology.

VIRTUAL MACHINES

The concept of a virtual machine; Hierarchy of virtual machines; Intermediate languages; Security issues arising

from running code on an alien machine.

INTRODUCTION TO LANGUAGE TRANSLATION

Comparison of interpreters and compilers; Language translation phases (lexical analysis, parsing, code generation,

optimization); Machine-dependent and machine-independent aspects of translation.

DECLARATIONS AND ABSTRACTION MECHANISM

The conception of types as a set of values with together with a set of operations; Declaration models (binding,

visibility, scope, and lifetime); Overview of type-checking; Garbage collection. Abstraction Mechanisms:

Procedures, functions, and iterators as abstraction mechanisms; Parameterization mechanisms (reference vs. value);

Activation records and storage management; Type parameters and parameterized types; Modules in programming

languages.

OBJECT-ORIENTED PROGRAMMING

Object-oriented design; Encapsulation and information-hiding; Separation of behavior and implementation; Classes

and subclasses; Inheritance (overriding, dynamic dispatch); Polymorphism (subtype polymorphism vs. inheritance);

Class hierarchies; Collection classes and iteration protocols; Internal representations of objects and method tables.


1. Budd T., An Introduction to Object-oriented Programming, Addison-Wesley 3rd Ed, 2001

2. Shalloway A. and Trott J., Design Patterns Explained: A New Perspective on Object-oriented Design, Addison-

Wesley ,2nd Ed, 2004

3. Eckel B., Thinking in C++, Prentice Hall, 2004

4. Robert W.SEBESTA ,Programming languages ,4th Edition 2001.

Mode of Evaluation

Written examinations, Seminar, Programming assignments, Surprise tests and Quizzes

33

OBJECT – ORIENTED PROGRAMMING LAB

L T P C

0 0 3 2

Objectives

To make the students learn object oriented way of solving problems.

To teach the student to write programs in C++ to solve the problems

Expected Outcome


Improve their programming skill.

Apply the object oriented technology for application development



1. Program illustrating function overloading feature.

2. Programs illustrating the overloading of various operators

Ex : Binary operators, Unary operators, New and delete operators etc.

3. Programs illustrating the use of following functions :

a) Friend functions b) Inline functions c) Static Member functions

d) Functions with default arguments.

4. Programs illustrating the use of destructor and the various types of constructors (no arguments, constructor,

constructor with arguments, copy constructor etc).

5. Programs illustrating the various forms of inheritance : Ex. Single, Multiple, multilevel, hierarchical

inheritance etc.

6. Write a program having student as on abstract class and create many derived classes such as Engg. Science,

Medical, etc. from students class. Create their objects and process them.

7. Write a program illustrating the use of virtual functions.

8. Write a program which illustrates the use of virtual base class.

9. Write programs to illustrating file handling operations:

Ex. a) Copying a text files b) Displaying the contents of the file etc.

10. Write programs illustrating how exceptions are handled (ex: division-by-zero, overflow and underflow in stack

etc)

34

DIGITAL LOGIC

L T P C

3 0 0 3

Objectives

1. To give an knowledge of number system and arithmetic and logic operation of different number system

2. To get to know the intricacies of design and operation of some basic digital electronic circuits.

3. To enable to understand and freely work with the digital electron devices.

Expected Outcome

The students will be able to

1. The students will acquire full knowledge of the computer they will be handling.

2. Will acquire the design skills of various computing device circuits.

3. Will come to know the function of computer and microprocessor and they will be able to design their own

circuit and make that to work with computer.



Contents

NUMBER SYSTEM AND BOOLEAN ALGEBRA

Number System – Converting numbers from one base to another – Complements – Binary Codes – Integrated

Circuits – representation and manipulation of switching circuits – Boolean algebra – Properties of Boolean algebra –

Boolean functions – Canonical and Standard forms – Logic operations – Logic gates – Physical properties of logic

gates (technology, fan-in, fan-out, propagation delay) – Karnough Map up to 6 variables – Don't Care Condition –

Sum of Products and Products of sum simplification – Tabulation Method.

COMBINATIONAL CIRCUITS

Adder – Subtractor – Code Converter – Analyzing a Combinational Circuit – Multilevel NAND and NOR circuits –

Properties of XOR and equivalence function – Binary Parallel Adder – Decimal Adder – Magnitude Comparator –

Decoders – Multiplexers – ROM – PLA.

SEQUENTIAL CIRCUITS

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, Timing sequences – Johnson counters.

ARITHMETIC LOGIC UNIT

Memory Unit – 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.

COMPUTER DESIGN

Accumulator – Design of Accumulator – Computer Configuration – Instructions and Data formats – Instruction sets

– Timing and control – Execution of Instruction – Design of Computer – H/W Control – PLA control and

Microprogram control.


1. M. Morris Mano – Digital Logic and Computer Design PHI – 5th Edition- 2004.

2. A.D.Friedman, Fundamentals of Logic Design and switching Theory, Computer Science Press, 1986

3. A.P. Malvino and D.P. Leach – Digital Principles and Applications – Tata McGraw Hill 4th Edition – 1999.

4. Thomas Floyd – Fundamentals of Digital System – Pearson Education.-3rd Edition – 2003.

Mode of Evaluation


35

DIGITAL LOGIC LAB

L T P C

0 0 3 2



1. Study of Logic Gates.

a. Logic gates using discrete Components.

b. Verification of truth table for AND, OR, NOT, NAND, NOR and XOR gates.

c. Realization of NAND and NOR gates

2. Implementation of Logic Circuits.

a. Verification of Boolean laws.

b. Verification of DeMorgan‟s law

3. Adder and Subtractor

a. Implementation of Half-Adder and Full-Adder

b. Implementation of Half-Subtractor and Full-Subtractor

4. Combinational Circuit Design

a. Design of Decoder and Encoder

b. Design of Code Converter.

c. Design of multiplexers and de multiplexers.

5. Sequential Circuit Design

a. Implementation of Shift registers, Serial Transfer.

b. Ring Counter

c. 4-bit Binary Counter

d. BCD Counter.

36

DATA STRUCTURES AND ALGORITHMS

L T P C

3 1 0 4

Objectives

To teach various efficient algorithms for solving fundamental problems.

To impart techniques for designing algorithms using appropriate data structures.

To analyze the correctness and performance of algorithms.

Expected Outcome


Perform algorithm analysis.

Acquire knowledge of various algorithmic strategies.

Understand and implement the solution for different types of problem using suitable algorithm and data

structures.



Contents

BASIC ALGORITHMIC ANALYSIS

Asymptotic analysis of upper and average complexity bounds; Identifying differences among best, average, and

worst case behaviors; Big O, little o, omega, and theta notation; Standard complexity classes; Empirical

measurements of performance; Time and space tradeoffs in algorithms; Using recurrence relations to analyze

recursive algorithms.

ALGORITHMIC STRATEGIES

Brute-force algorithms; Greedy algorithms; Divide-and-conquer; Backtracking; Branch-and-bound; Heuristics;

Pattern matching and string/text algorithms; Numerical approximation algorithms.

FUNDAMENTAL COMPUTING ALGORITHMS

Simple numerical algorithms, Sorting and Searching Algorithm: Sequential and binary search algorithms; Quadratic

sorting algorithms (bubble, selection, insertion); O (N log N) sorting algorithms (Quick sort, heap sort); Hashing:

Hash tables, including collision-avoidance strategies;

DATA STRUCTURES & ALGORITHMS

Non-Linear Data Structures: Binary trees; Binary Search Trees; General Tree;

GRAPHS

Representations of graphs (adjacency list, adjacency matrix, Sparse Matrix); Topological Sorting; Shortest-path

algorithms (Single source shortest path; Dijkstra‟s and Floyd‟s algorithms); Minimum spanning tree (Prim‟s and

Kruskal‟s algorithms);


1. S. Sahni, Data structures, algorithms, & applications in Java, McGraw-Hill,2005

2. J. P. Trembly et al, An introduction to data structures with applications,2007

3. D. E. Knuth, Art of computer programming, Volume 1: Fundamental algorithms, Addison-Wesley.2004

4. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein, Introduction to Algorithms,

2nd Edition, PHI, 2006

Mode of Evaluation

Written examinations, Assignments, Surprise tests and Quizzes

37

DATA STRUCTURES AND ALGORITHMS LAB

L T P C

0 0 3 2

Objectives

Learn how to implement some useful data structures.

Understand the effect of data structures on an algorithm‟s complexity.

Expected Outcome The students will be able to

Identify, implement and use the appropriate data structures for a given problem

Develop an understanding of algorithm and program performance analysis.

Execute program, testing to verify the actual performances and measures against theoretical

predictions and analyses.



Implementing Stacks and queues.

Implementation and processing in lists.

Sorting:

a. Insertion sort

b. Merge sort

c. Quick sort

d. Selection sort

e. Heap sort

f. Shell sort

Searching:

a. Linear search

b. Binary search

Binary Search Trees

Graphs:

a. BFS

b. DFS

c. Topological Sort

Spanning Trees

a. Prim‟s Algorithm

b. Kruskal‟s Algorithm

Shortest Path Algorithms

a. Dijkstra‟s Algorithm

b. Floyd‟s Algorithm

38

COMPUTER ARCHITECTURE AND ORGANIZATION

L T P C

3 0 0 3

Objectives

To Gain an understanding of computer data representation and manipulation

To understand the basic organization for data storage and access across various media. To provide knowledge of interfacing techniques and subsystem devices.

Expected Outcome


Understand number systems, instruction sets, addressing modes, and data/instruction

formats.

Write program using assembly language programming.

Understand memory control, direct memory access, interrupts, and memory organization


Digital Logic and its lab

Contents

FUNDAMENTALS OF COMPUTER ARCHITECTURE

Organization of the von Neumann machine; Instruction formats; The fetch/execute cycle, instruction decoding and

execution; Registers and register files; Instruction types and addressing modes; Subroutine call and return

mechanisms; Programming in assembly language; I/O techniques and interrupts; Other design issues.

COMPUTER ARITHMETIC

Data Representation, Hardware and software implementation of arithmetic unit for common arithmetic operations:

addition, subtraction, multiplication, division( Fixed point and floating point); Conversion between integer and real

numbers; The generation of higher order functions from square roots to transcendental functions; Representation of

non-numeric data (character codes, graphical data);

MEMORY SYSTEM ORGANIZATION AND ARCHITECTURE

Memory systems hierarchy; Coding, data compression, and data integrity; Electronic, magnetic and optical

technologies; Main memory organization, Types of Main memories, and its characteristics and performance;

Latency, cycle time, bandwidth, and interleaving; Cache memories (address mapping, line size, replacement and

write-back policies); Virtual memory systems; Reliability of memory systems; error detecting and error correcting

systems.

INTERFACING AND COMMUNICATION

I/O fundamentals: handshaking, buffering; I/O techniques: programmed I/O, interrupt-driven I/O, DMA; Interrupt

structures: vectored and prioritized, interrupt overhead, interrupts and reentrant code; Buses: bus protocols, local and

geographic arbitration.

DEVICE SUBSYSTEMS

External storage systems; organization and structure of disk drives and optical memory; Basic I/O controllers such

as a keyboard and a mouse; RAID architectures; Video control; I/O Performance; SMART technology and fault

detection; Processor to network interfaces.


1. J. L. Hennessy & D.A. Patterson, Computer architecture: A quantitative approach, Fourth Edition, Morgan

Kaufman, 2004.

2. W. Stallings, Computer organization and architecture, Prentice-Hall,2000

3. M. M. Mano, Computer System Architecture, Prentice-Hall

4. J. P. Hayes, Computer system architecture, McGraw Hill


39

ALGORITHM DESIGN AND ANALYSIS

L T P C

3 0 0 3

Objectives

1. To teach the methods of advanced algorithm analysis

2. To teach advanced algorithms such as cryptographic algorithms, Geometric Algorithm and Parallel

Algorithm.

Expected Outcome


1. Apply the algorithms and design techniques to solve problems

2. Have a sense of the complexities of various problems in different domains


Data Structures and Algorithms

Contents

BASIC COMPUTABILITY

Finite-state machines; Context-free grammars; Tractable and intractable problems; Uncomputable functions; the

halting problem; Implications of uncomputability.THE COMPLEXITY CLASSES P AND NP: Definition of the

classes P and NP; NP-completeness (Cook‟s theorem); Standard NP-complete problems; Reduction techniques.

ADVANCED ALGORITHMIC ANALYSIS

Amortized analysis; Online and offline algorithms; Randomized algorithms; Dynamic programming; combinatorial

optimization.

CRYPTOGRAPHIC ALGORITHMS

Historical overview of cryptography; Private-key cryptography and the key-exchange problem; Public-key

cryptography; Digital signatures; Security protocols; Applications (zero-knowledge proofs, authentication, and so

on).

GEOMETRIC ALGORITHMS

Line segments: properties, intersections; convex hull finding algorithms.

PARALLEL and Distributed ALGORITHMS

PRAM model; Exclusive versus concurrent reads and writes; Pointer jumping; Brent‟s theorem and work efficiency.

DISTRIBUTED ALGORITHMS: Consensus and election; Termination detection; Fault tolerance; Stabilization.


1. Aho et al, The design and analysis of computer algorithms, Addision Wesley.

2. M. J. Quinn, Parallel computing – theory and practice, McGraw Hill.

3. M. J. Quinn, Designing efficient algorithms for parallel computers, McGraw Hill.

Mode of Evaluation


40

EMBEDDED SYSTEMS

L T P C

3 0 0 3

Objectives

To teach the fundamentals of embedded system

To understand programs and tools for embedded system.

To impart knowledge about real time operating system

To elucidate knowledge of embedded system types and its interfacing mechanisms

Expected Outcome


1. Understand and use embedded system and device drivers.

2. Understand the societal impact of embedded systems and technological solutions.

3. Improve their skills in hardware programming


Microprocessor and Interfacing and its Lab

Contents

EMBEDDED MICROCONTROLLERS

Introduction: Contrast between an embedded system and other computer systems; the role of programming and its

associated languages as applied to embedded systems; the purpose and role of embedded systems in computer

engineering. Microcontrollers: Structure of a basic computer system: CPU, memory, I/O devices on a bus; CPU

families used in microcontrollers: 4-bit, 8-bit, 16-32-bit; Basic I/O devices: timers/counters, GPIO, A/D, D/A;

Polled I/O vs. interrupt-driven I/O; Interrupt structures: vectored and prioritized interrupts; DMA transfers; Memory

management units; Memory hierarchies and caches.

EMBEDDED PROGRAMS AND TOOLS

The program translation process: compilation, assembly, linking; Representations of programs: data flow and

control flow; Fundamental concepts of assembly language and linking: labels, address management; Compilation

tasks: mapping variables to memory, managing data structures, translating control structures, and translating

expressions; What can and cannot be controlled through the compiler; when writing assembly language makes

sense. Tool support: Compilers and programming environments; Logic analyzers; RTOS tools; Power analysis;

Software management tools; Project management tools.

REAL-TIME OPERATING SYSTEMS

Real-time operating systems: Context switching mechanisms; Scheduling policies; Rate-monotonic scheduling:

theory and practice; Priority inversion; other scheduling policies such as EDF; Message-passing vs. shared memory

communication; Interprocess communication styles such as mailbox and RPC; Low-power computing: Sources of

energy consumption: toggling, leakage; Instruction-level strategies for power management: function unit

management; Memory system power consumption: caches, off-chip memory; Power consumption with multiple

processes; System-level power management: deterministic, probabilistic methods.

NETWORKED EMBEDDED SYSTEMS

Why networked embedded systems; Example networked embedded systems: automobiles, factory automation

systems; The OSI reference model; Types of network fabrics; Network performance analysis; Basic principles of the

Internet protocol; Internet-enabled embedded systems; Controller Area Network; Embedded Ethernet Controller;

Inter Integrated Circuits(I2C)

INTERFACING AND MIXED-SIGNAL SYSTEMS

Digital-to-analog conversion; Analog-to-digital conversion; How to partition analog/digital processing in interfaces;

Digital processing and real-time considerations. ARM Controllers;


1. Wayner Wolf, Computers as components – Principles of embedded computing system design, Morgan

Kaufman,2001

2. Rajkamal, “Embedded Systems-Application, Practice & Design”, Tata McGraw Hill, 2003

3. Arnold S. Berger, “Embedded Systems Design”, CMP Books, 1997

41

EMBEDDED SYSTEMS LAB

L T P C

0 0 3 2

Objectives

To teach microcontroller programming

To write, assemble, link, execute, and debug programs running on a single board

microcomputer.

To Interface the single board microcomputer to a variety of peripheral devices using

serial and parallel communications.

Expected Outcome


Understand microcontroller programming

Perform interfacing of different hardware with single board microcomputer


Microprocessor and Interfacing, and its Lab

Programming in 8051

a. Handling Port

b. Waveform generation

c. ADC; DAC

d. Interrupt Programming

e. Stepper Motor Interfacing


42

OPERATING SYSTEMS

L T P C

3 0 0 3

Objectives

To provide a grand tour of the major operating system components.

To impart knowledge of process, memory and device management

To teach security issues related to OS.

Expected Outcome


Understand how the operating system abstractions can be implemented

Understand the principles of concurrency and synchronization, and apply them to write correct

concurrent programs/software.

Understand basic resource management techniques (scheduling or time management, space

management) and how they can be implemented. Use Linux system, windows 2000.



Contents

FUNDAMENTALS

Overview: Role and purpose of operating systems; history of operating system development; functionality of a

typical operating system; design issues (efficiency, robustness, flexibility, portability, security, compatibility).

Basic principles: Structuring methods; abstractions, processes, and resources; design of application programming

interfaces (APIs); device organization; interrupts; user/system state transitions.

PROCESS MANAGEMENT

Scheduling: Preemptive and non-preemptive scheduling; scheduling policies; processes and threads; real-time

issues; Concurrency: The idea of concurrent execution; states and state diagrams; implementation structures (ready

lists, process control blocks, and so forth); dispatching and context switching; interrupt handling in a concurrent

environment; Mutual exclusion: Definition of the “mutual exclusion” problem; deadlock detection and prevention;

solution strategies; models and mechanisms (semaphores, monitors, condition variables, rendezvous); producer-

consumer problems; synchronization; multiprocessor issues.

MEMORY MANAGEMENT

Review of physical memory and memory management hardware; overlays, swapping, and partitions; paging and

segmentation; page placement and replacement policies; working sets and thrashing; caching.

SECONDARY STORAGE MANAGEMENT

Device management: Characteristics of serial and parallel devices; abstracting device differences; buffering

strategies; direct memory access; recovery from failures.

File systems: Fundamental concepts (data, metadata, operations, organization, buffering, sequential vs.

nonsequential files); content and structure of directories; file system techniques (partitioning, mounting and

unmounting, virtual file systems); memory-mapped files; special-purpose file systems; naming, searching, and

access; backup strategies.

SECURITY AND PROTECTION

Overview of system security; policy/mechanism separation; security methods and devices; protection, access, and

authentication; models of protection; memory protection; encryption; recovery management.


1. A. Silberschatz, P.B. Galvin & G. Gagne, Operating system concepts, John Wiley,2005

2. W. Stallings, Operating systems, Prentice-Hall,2005

Mode of Evaluation


43

OPERATING SYSTEMS LAB

L T P C

0 0 3 2

Objectives

To implement the basic resource management technique [Processor, Memory]

To design and implement synchronization, concurrency related problems.

Expected Outcomes


Simulate the principles of resource management [Processor, Memory]

Install and use operating systems [Windows, Linux etc.,]



1. Program to report the behavior of the OS to get the CPU type and model, kernal version.

2. Program to get the amount of memory configured into the computer, amount of memory currently available.

3. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round – robin.

4. Implement the solution for reader – writer‟s problem.

5. Implement the solution for dining philosopher‟s problem.

6. Implement banker‟s algorithm.

7. Implement the first fit; best fit and worst fit file allocation strategy.

8. Write a program to create processes and threads.

9. Write a program that uses a waitable timer to stop itself K. Sec. After it started where K is a command line

parameter.

44

COMPUTER NETWORKS

L T P C

3 0 0 3

Objectives

To study the foundational principles, architectures, and techniques employed in computer

networks.

To study the concepts of communication networks, protocols and their performance.

Expected Outcome

Students shall be able to

1. Understand about working of Intranet, LAN, WAN, MAN setups, different topologies.

2. Gain familiarity with common networking protocols and algorithms

3. Implement network protocols and analyze its performance.


Operating Systems and its lab

Contents

INTRODUCTION TO COMPUTER NETWORKS

Networking principles; switching - circuit switching, packet switching, frame relay, cell switching, multiple access.

COMMUNICATIONS NETWORK PROTOCOLS

Network protocol (syntax, semantics, and timing); Protocol suites (OSI and TCP/IP); Layered protocol software

(stacks): Physical layer networking concepts; data link layer concepts; network layer concepts; transport and

application layer concepts; Network Standards and standardization bodies.

LOCAL AND WIDE AREA NETWORKS

LAN topologies (bus, ring, star), LAN technologies (Ethernet, token Ring, Gigabit Ethernet), Error detection and

correction, Carrier sense multiple access networks (CSMA), Large networks and wide areas, Protocols (addressing,

congestion control, virtual circuits, quality of service). Internet - addressing, routing, end point control; Internet

protocols - IP, TCP, UDP, ICMP, HTTP, CIDR

ROUTING AND CONGESTION CONTROL ALGORITHMS Flooding; Minimal spanning trees; Bellman Ford, Dijkstra's, OSPF, BGP shortest path algorithms; The leaky bucket,

floyd warshall and Random Early Detection congestion methods; Data security and integrity: Fundamentals of

secure networks; cryptography; Encryption and privacy: Public key, private key, symmetric key; Authentication

protocols; Packet filtering; Firewalls; Virtual private networks; Transport layer security.

NETWORK MANAGEMENT AND PERFORMANCE ANALYSIS OF NETWORKS

Overview of the issues of network management; Domain names and name services; Issues for Internet service

providers (ISPs); Quality of service issues: performance, failure recovery.


1. W. Stallings, Data & Computer Communications, Prentice-Hall, 2005.

2. A. S. Tanenbaum, Computer networks, Prentice-Hall,2005.

3. Behrouz A Forouzan, Data Communications and Networking, Tata Mc-grawhill, 2007.

4. I. Mitrani, Modelling of Computer and Communication Systems, Cambridge, 1987.

5. J.Walrand and P.Varaiya, High Performance Communication Networks, Harcourt Asia (Morgan Kaufmann),

2000.

6. J.F.Kurose and K.W.Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Pearson

Education, 2001.

7. D. E. Comer and D.L. Stevens, Internetworking with TCP/IP, Vol.1, Prentice-Hall

45

COMPUTER NETWORKS LAB

L T P C

0 0 3 2

Objectives

To write programs to configure LAN,WAN

To analyze protocols and their performance

Expected Outcome

Students shall be able to

Implement network protocols and analyze its performance.

Configure Networks.


Operating Systems and its lab

1. Write a program to display the server‟s date and time details at the client end.

2. Write a program to display the client‟s address at the server end.

3. Write a program to implement an echo UDP server.

4. Write a program to develop a simple Chat TCP and UDP application.

5. Write a program to capture each packet and to examine its checksum field.

6. Network layer concepts; to be done with only computer

a. Configuration of IP addresses

b. Configuration of Subnet mask

c. Configuration of Gateway

d. Setting up LAN

e. Connecting two or more different LAN with different subnet mask

f. Making computer to work like router/gateway with the help of IP address

7. Protocol analyzer using ethereal

a. Capturing and analyzing Ethernet frames

b. HTTP GET/response interaction

c. Analysis of ICMP and Ping

d. Analysis of ICMP and Traceroute

e. Capturing a bulk TCP transfer from your computer to a remote

server

8. Additional activities (Optional)

a. Compute checksum fields using CRC-12 and examine the same during the frame transmission.

b. Implementation of sliding window protocol as part of DLC.

c. IPv4 and IPv6 protocol testing and implementation.

d. TCP and UDP protocol testing and implementation.

e. SNMP implementation

f. SMTP implementation

g. RSA public key and private key encryption and decryption

h. Data compression using Huffman codes.

46

PROGRAMMING LANGUAGE TRANSLATORS

L T P C

3 0 0 3

Objectives

1. To improve the programming skills by learning the working principles of compiler.

2. To provide knowledge for design and development of phases of compiler for a sample programming

language.

Expected Outcome


1. work with compiler tools such as LEX, YACC

2. Design a compiler for a sample language.


Theory of Computation, Computer Architecture and Organization

Contents

INTRODUCTION TO COMPILATION AND LEXICAL ANALYSIS

Introduction to programming language translators, classification of programming languages, overview of various

programming language translators, Compiler Vs Interpreter, cross compiler, bootstrap arrangement, logical phases

of compiler, pass Vs phase-cousins of compilers, Lexical Analysis phase: - Design issues-patterns, lexemes, Tokens-

attributes- specification of tokens, Regular expressions-Overview of automata-Thompson construction NFA-DFA-

minimized DFA-lexical errors- Lex

SYNTAX ANALYSIS

Role of parser- Formal definition of grammars; BNF and EBNF -Parse Tree- Ambiguity- Elimination of ambiguity-

Top down parsing: Recursive-Descent parsing, Non- recursive predictive parsing; LL(1) grammars, Bottom-Up

parsing:- Shift-Reduce parsers, Operating precedence parsing: design of operator precedence table, parsing –LR

parsers:- Construction of SLR parser tables and parsing , CLR parsing-LALR parsing- Syntax errors-YACC

SEMANTICS & RUNTIME ENVIRONMENTS Syntax Directed Translations: Syntax-directed definitions, Translation Schemes, construction of syntax trees,

DAG‟S- bottom-up evaluation of s-attributed definitions, l-attributed definitions; Run-time environments: Source

language issues, storage organization, storage-allocation strategies, symbol tables: local and global symbol table

structures and management. Type checking Systems: Data type as set of values with set of operations; data types;

type checking models; semantic models of user-defined types; parametric polymorphism; subtype polymorphism;

type-checking algorithms.

INTERMEDIATE CODE GENERATION & OPTIMIZATION

Intermediate languages, Three Address code: declarations, assignment statements, addressing array elements,

Boolean expressions, case statements, back patching. Code optimization: The principle source of optimization,

optimization of basic blocks, Loop optimizations.

CODE GENERATION & OTHER TRANSLATIONS ISSUES

Issues in the design of a code generator, the target machine, Reducing the memory access times by exploiting

addressing modes- peephole optimizations, basic blocks, DAG‟s- Iterative vs. recursive interpretation; Elements of

Assembly language- assemblers- Passes of an assembler-Macros- design of macro processors- passes of a macro

processor


1. A. V. Aho et al, Compilers: Principles, techniques, & tools, Second Edition, Pearson Education, 2007.

2. K. D. Cooper and L. Torczon, Engineering a compiler, Morgan Kaufmann, 2004.

3. Steven S.Muchnick “ Advanced Compiler design implementation” Elsevier Science India.

4. D.M. Dhamdhere “Systems programming and operating systems” Tata McGraw-Hill Pub.

47

COMPUTER GRAPHICS

L T P C

3 0 0 3

Objectives

1. To teach fundamentals concepts of computer graphics

2. To delineate knowledge of 2D and 3D modeling

3. To introduce the advanced techniques in graphics

Expected Outcome


1. Understand the fundamental concepts of graphics

2. Implement 2D and 3D algorithms.

3. Know advanced concepts such as rendering, animation etc.,


Linear Algebra, Programming Fundamentals

Contents

FUNDAMENTALS

Graphic systems: Raster and vector graphics systems; video display devices; physical and logical input devices;

issues facing the developer of graphical systems. Fundamental techniques in graphics: Hierarchy of graphics

software; using a graphics API; simple color models; homogeneous coordinates; affine transformations (scaling,

rotation, translation); viewing transformation; clipping.

GRAPHICAL ALGORITHMS and GEOMETRIC MODELLING

Graphical algorithms: Line generation algorithms; structure and use of fonts; font generation: outline vs. bitmap;

polygonal representation of 3D objects; parametric polynomial curves and surfaces; introduction to ray tracing; ray

tracing algorithms; image synthesis, sampling techniques, and anti-aliasing; image enhancement.; Geometric

modeling: Polygonal representation of 3D objects; Parametric polynomial curves and surfaces; Constructive Solid

Geometry (CSG) representation; Implicit representation of curves and surfaces; Spatial subdivision techniques;

Procedural models; Deformable models; Subdivision surfaces; Multiresolution modeling; Reconstruction

BASIC RENDERING

Line generation algorithms (Bresenham); Font generation: outline vs. bitmap; Light-source and material properties;

Ambient, diffuse, and specular reflections; Phong reflection model; Rendering of a polygonal surface; flat, Gouraud,

and Phong shading; Texture mapping, bump texture, environment map; Introduction to ray tracing; Image synthesis,

sampling techniques, and anti-aliasing.

ADVANCED TOPICS

Advanced techniques: Color quantization; Scan conversion of 2D primitive, forward differencing; Tessellation of

curved surfaces; Hidden surface removal methods; Z-buffer and frame buffer, color channels (a channel for

opacity); Advanced geometric modeling techniques; Computer animation: Key-frame animation; Camera

animation; Scripting system; Animation of articulated structures: inverse kinematics; Motion capture; Procedural

animation; Deformation.; Visualization: Basic viewing and interrogation functions for visualization; Information

visualization: projection and parallel-coordinates methods; Virtual reality: Stereoscopic display; Force feedback

simulation, hap tic devices; Viewer tracking; Collision detection; User interface issues; Applications in medicine,

simulation, and training.

Computer vision: Image acquisition; The digital image and its properties;


1. Donald Hearn and Pauline Baker Computer Graphics, Prentice Hall, New Delhi, 2003.

2. Steven Harrington, "Computer Graphics- A programming approach", McGraw Hill, 1986.

3. Foley J.D., Van Dam A, "Fundamentals of Interactive Computer Graphics", Addison Wesley, 1990


48

DATABASE SYSTEMS

L T P C

3 0 0 3

Objectives

1. To teach role of data, files and databases in information systems.

2. To impart knowledge of data modeling techniques.

3. To provide the fundamentals of front-end and back-end of databases

Expected Outcome


1. Understand fundamental concepts of database management system, database modeling, design, SQL,

PL/SQL, and system implementation techniques.

2. Model and implement database applications

3. Understand transaction processing of Databases


Data structures and Algorithms, Algorithm Design and Analysis

Contents

DATABASE SYSTEMS History and motivation for database systems; components of database systems; DBMS functions; database

architecture and data independence.

DATA MODELING

Data modeling; conceptual models; object-oriented model; relational data model.; Database query languages:

Overview of database languages; SQL; query optimization; 4th-generation environments; embedding non-

procedural queries in a procedural language; introduction to Object Query Language.

RELATIONAL DATABASES

Mapping conceptual schema to a relational schema; entity and referential integrity; relational algebra and relational

calculus; Relational database design: Database design; functional dependency; normal forms; multivalued

dependency; join dependency; representation theory.

TRANSACTION PROCESSING

Transactions; failure and recovery; concurrency control

PHYSICAL DATABASE DESIGN

Storage and file structure; indexed files; hashed files; signature files; b-trees; files with dense index; files with

variable length records; database efficiency and tuning.


1. A. Silberschatz, H. F. Korth & S. Sudershan, Database system concepts, McGraw Hill, 4th Edition 2002.

2. R. Elmasri & S. B. Navathe, Fundamentals of database systems, Addison Wesley, 2005.

3. C. J. Date, An introduction to database systems, Addison Wesley,2003.

4. H. Garcia et al., Database system implementation, Prentice Hall


49

DATABASE SYSTEMS LAB

L T P C

0 0 3 2

Objectives

To model data for different applications.

To teach implementation concepts of databases in information systems.

To teach implementation of front-end and back-end of databases

Expected Outcome


To perform database modeling, design,

To create databases and pose complex SQL queries of relational

Model and implement database applications.


Algorithm Design and Analysis, Data Structures and Algorithms Lab

1. a) Create a table EMP with the following fields.

EName

Eno.

Salary

DeptNo

Address

Dname

b) Insert 5 records into EMP

c) ALTER EMP table i) varying size of Eno field

ii) adding a new field job

d) Delete the table EMP

2. Create a table EMP with the above mentioned fields.

i) Insert 5 records into EMP

ii) Update the salary of the Employees by 10% hike

iii) Delete the employees whose name is „AAA‟

3. Create a table ORDER with the following fields and constraints.

ORDER

Column Name Constraint Name Constraint Type

Order-no pk-order-no PRIMARY KEY

Item-name itn UNIQUE

Qty ck-aty CHECK

(25<QTY<50)

rate-unit Nn-rate NOT NULL

4. Using Ex 3.

1. Drop unique constraint for item-name

2. Disable the constraint Nn-rate

3. Insert a record with NULL values for rate unit

4. Enable the constraint with NULL value existing on rate-unit

5. Create a table EMP mentioned above and test all the arithmetic functions and character functions

6.Add a field date-of-birth to EMP table and test all the date functions.

7. i) Modify EMP table adding a new field BONUS, update it using NVL

ii) Retrieve the employees whose name starts with S.

iii)Select all the employees who are working in IT department.

8. I) Using EMP table find the employee getting maximum salary

50

ii) Find the employee whose salary is minimum

iii) Find the sum of salaries of all the employees working in „ACCOUNTS‟ department.

9. Create a table DEPT with the following fields

DNo. Primary Key

DName

Modify EMP table adding a foreign key constraint on DeptNo.

i) Insert 6 records into Dept.

ii) Implement the following Join operations

a) Self Join

b) Equi Join

c) Non Equi Join

d) Outer Join

e) Natural Join

10. Using EMP and DEPT, implement all type of view techniques.

a) Row subset view

b) Column subset view

c) Row column subset view

d) Grouped view

e) Joined view

f) With check option

11. Using EMP and DEPT

a) Create a sequence to insert the empno in EMP table

b) Create a synonym for the above two tables

PART – B

1. Create a cursor to update the salary of employees in EMP table

2. a) Write a PL/SQL program to raise an Exception

i) When the bonus exceeds salary

b)Write a PL/SQL program to test the built-in Exceptions

3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check

whether that item exists.

4. Write a function to find substring.

Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into

EMP.

PART – C

Development of mini-projects with VB as front-end.

51

SOFTWARE ENGINEERING

L T P C

3 0 0 3

Objectives

1. To teach the concepts of process, product and project

2. To elucidate the knowledge of requirement analysis

3. To provide the knowledge of software design and testing

4. To introduce the project management techniques

Expected Outcome


1. Perform Requirement analysis.

2. Write Software Requirement Specification.

3. Model software system

4. Perform Testing on the developed software


Graph Theory and its Applications, Programming Language Translation

Contents

FUNDAMENTALS OF SE AND REQUIREMENT ENGINEERING

Software Engineering Fundamentals; Software processes: Software life-cycle and process models; Process

assessment models; Overview of Project Management activities; Software requirements and specifications:

Requirements elicitation; Requirements analysis modeling techniques; Functional and nonfunctional requirements;

User requirements, System requirements, requirement validation and software requirement specification document.

Prototyping - Basic concepts of formal specification techniques.

SOFTWARE DESIGN

Fundamental design concepts and principles; Design characteristics; System Models- Context, Behavioral, Data and,

Object models, Architectural design- System structuring, Control models; Structured design; Object-oriented

analysis and design; User interface design; Design for reuse; Design patterns;

SOFTWARE VALIDATION AND MAINTENANCE

Software validation: Validation planning; Testing fundamentals, including test plan creation and test case

generation; Black-box and white-box testing techniques; Unit, integration, validation, and system testing; Object-

oriented testing; Inspections. Software evolution: Software maintenance; Characteristics of maintainable software;

Reengineering; Legacy systems; Software reuse.

SOFTWARE PROJECT MANAGEMENT

Team management – Team processes, Team organization and decision-making, Roles and responsibilities in a

software team, Role identification and assignment, Project tracking, Team problem resolution; Project planning and

scheduling; Software measurement and estimation techniques; Risk analysis and management; Software quality

assurance; Software configuration management;.

SOFTWARE QUALITY PROCESS IMPROVEMENT

Overview of Quality management and Process Improvement; Overview of SEI-CMM, ISO 9000, CMMI, PCMM,

TQM and Six Sigma; overview of CASE tools. Software tools and environments: Programming environments;

Project management tools; Requirements analysis and design modeling tools; testing tools; Configuration

management tools;


1. R. S. Pressman, Software Engineering, a practitioner‟s approach, McGraw Hill, 2006

2. Ian Sommerville, "Software Engineering", Sixth Edition, Addison-Wesley, 2004

Mode of Evaluation


52

SOFTWARE ENGINEERING LAB

L T P C

0 0 3 2

Objectives

To teach various CASE tools for applying it in the software modeling and implementation.

To prepare students for performing requirement analysis and design of variety of applications.

Expected Outcome


Perform Requirement analysis and Write Software Requirement Specification.

Model any software system

Demonstrate testing mechanisms on the developed software


Programming fundamentals, Database systems Lab

The Students have to form a team size of 3 or 4. Each team is assigned System

Analyze, Coding, testing/.metrics tools like Code Comparison, Compiler-based

Analysis, Complexity-based Metric, Modeling , Review, Volume testing, Stress

Testing, Regression testing etc

This tool has to be used for testing and taking various metrics. Estimation for some application

Comparative Study of different tools have to be done

The above facts has to be documented and a report has to be submitted at the end of the semester

53

INTERNET & WEB PROGRAMMING

L T P C

3 0 0 3

Objectives

To provide fundamentals for the web system and internet programming.

To understand how the client-server model of Internet programming works.

To develop interactive, client-side, executable web applications.

Expected Outcome


Understand how Internet programming tasks are accomplished.

Build Internet tools that assist in automating data transfer over the net.

Develop software that performs automated data processing such as html forms data to file and

email systems.


Computer Networks

Contents

INTRODUCTION

Introduction to Internet applications, client-server, peer-to-peer, and web applications

CONCURRENT PROGRAMMING MODELS

Building scalable servers, synchronization of threads and processes using both semaphores and message passing

DEVELOPING METHODOLOGIES

Workload generation, experiment design, and choice of performance metrics.

WEB PROGRAMMING CONCEPTS

Database connectivity, security, and identity, traditional page-driven and asynchronous web application frameworks

LANGUAGES FOR INTERNET PROGRAMMING

C, Python, PHP and Ruby, relational database concepts for web programming, structuring data and making queries.

Reference:

1. W. Richard Stevens, Bill Fenner, and Andrew M. Rudoff, Unix Network Programming, Volume 1: The Sockets

Network API, 3rd Edition

2. Dave Thomas, with Chad Fowler and Andy Hunt, Programming Ruby: The Pragmatic Programmer's Guide,

Third Edition, 2008

3. Dave Thomas and David Heinemeier Hansson, Agile Web Development with Rails, Second Edition, 2006

4. Balachander Krishnamurthy and Jennifer Rexford, Web Protocols and Practice: HTTP/1.1, Networking

Protocols, Caching, and Traffic Measurement, Addison Wesley,1st Edition ,2001

5. Hugh E. Williams and David Lane, Web Database Applications with PHP, and MySQL, 2nd Edition,

O'Reilly,2004

Mode of Evaluation

Written of examinations, case analysis assignments and mini projects

54

INTERNET & WEB PROGRAMMING LAB

L T P C

0 0 3 2

Objectives

To understand the concepts, principles, strategies, and methodologies of Web applications and

development.

To write software and develop interactive, client-side, executable web applications

Expected Outcome


Demonstrate proficient use of Markup Languages

Create simple web pages using HTML and CSS;

Write simple programs using JavaScript.


Computer Networks and Computer Networks lab

1. Create the personal home page using HTML

2. Design a E-greetings page which has properly aligned paragraphs with images along with it.

3. Implement a Web site for Information Technology department Using

a) Frameset

b) Tables

c) Inernal Linking

d) Headers

e) List Items

f) Hyperlink for mailing

4. Using STYLE SHEETS:

1 .Set the Background Image Fixed and Foreground Scrolling

2. Set the Background Image without tiles and at the center of the screen.

3. Set the Background Color for the text using all the 4 methods of Style sheets

5. Using JavaScript create a web page for Online Testing (Quantitative Aptitude)

6. Develop a JavaScript program to get Register Number as Input and print the Student‟s total mark

and grades.

7. Develop a VBScript code to perform the functions of a Calculator.

8. Using VBScript, develop a web site for online counseling.

9. Create a Text Editor using VBScript.

10. Write a function that takes an integer value and returns the number with its digits reversed. For

Ex. Given the number 7631, the function should return 1367. Incorporate the function into a

VBScript that reads a value from the user. Display the result in the status bar of the browser

window.

11. Create a server-side include file containing the AdRotator code to display 4

advertisements.

12. Create an ASP application that allows the user to customize a web page. The

application should consist of three ASP files:

Ask the user name to login & read from a database to determine if the user is known. If the user is

not known, second ASP file is loaded asking the user to choose their preference for foreground

color, background color & image. Insert the new user & pREFERENCE to the database. Display

the page customized according to the pREFERENCE selected. If the user is known at login, the

customized page should be displayed.

13. Create an ASP application to display the students information from the Database

Note: Only 5 student‟s information per page should be displayed. Use Previous &

55

Next to retrieve the rest of the information.

14. Create an ASP application for sending E-Mails using CDO.

15. Design a web page for registering the following information into Oracle Database using ASP.

Name

Reg. No, Date of Birth, Date of Admission, E-Mail (check for validation)

Gender

Address

Branch & Year

16. Create a formatted business letter using XML & DTD.

17. Create a contact list database in XML using style sheets.

18. Develop a XML schema for the database document type.

19. Create a XML page for displaying staff details from the database

20. Connect to a database using XML & display its contents using HTML Page

56

MICROPROCESSOR AND INTERFACING

L T P C

3 0 0 3

Objectives

1. To introduce various features of 8086, 80286, 386, Pentium, processors, and peripheral devices.

Expected Outcome


1. Understand 8086 processor design and basic operations, Instruction set and aspects of assembly language

programming,

2. Interface peripherals with 8086 serial and parallel I/O (8251 A & 8255), PIT (8253), programmable DMA

controller (8257), programmable Interrupt controller (8259), Keyboard and display controller(8279)

3. Understand advanced microprocessors[80286,80386 and Pentium]



INRODUCTION

8086 Processor : 8086 architecture, Pin configuration, 8086 in min/max mode, Addressing modes, Instruction set of

8086, Assembler directives, Assembly language programming.

INTERFACING

Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255), Programmable interval timer (8253),

Programmable DMA controller (8257), programmable interrupt controller (8259A), Keyboard and display controller

(8279), ADC / DAC interfacing.

80286 PROCESSOR

80286 Processor-Features of 80286, internal architecture of 80286, real addressing mode, virtual addressing mode,

privilege, protection, basic bus operation of 80286, fetch cycles of 80286.

80386 AND 80486 PROCESSOR

Features of 80386Dx, internal architecture of 80386Dx, pin configuration of 80386, register organization of

80386Dx, features of 80486, register organization of 80486.

ADVANCED MICRO PROCESSORS

Overview of Advanced Microprocessors- Pentium processor, Pentium – I, Pentium – II, Pentium – III, Pentium – IV

and V.

Text/ Reference Books

1. A.K. Ray and K.M. Bhurchandi Advanced Microprocessors and Peripherals, First Edition, Tata McGra Hill,

2000.

2. K Uday Kumar, B S Umashankar, Advanced Micro processors & IBM-PC Assembly Language Programming,

Tata McGraw Hill, 2002

3. Barry B Bray , The Intel Micro processor 8086/8088, 80186,80286, 80386 and 80486-Arcitecture,

programming and interfacing, PHI, 5th Edition,2000

4. Douglas V. Hall,”Microprocessors and Interfacing Programming and Hardware”. Tata McGraw Hill, 1999.

5. Mohamed Rafiquazzaman, “Microprocessor and Microcomputer based system design,” Universal Book stall,

New Delhi, 3rd Indian reprint, 1991.


57

MICROPROCESSOR AND INTERFACING LAB

L T P C

0 0 3 2



1. Study Experiments

i) Study of 8086 Architecture

ii) Study of 8255 – PPI

iii) Study of 8253 – PIT

iv) Study of 8279 – PKI

v) Study of 8259 – PIC

2. Write an ALP to find out factorial of a given hexadecimal number using 8086 MP

Data: OAH, OFH, 1OH

3. Write an ALP to perform 16 bit arithmetic operations (ADD, SUB, MUL, DIV)

4. Write an ALP to generate the sum of first „N‟ natural numbers using 8086 MP

5. Write an ALP to convert given hexadecimal number to binary using 8086 MP

Data: ABH, CDH, 101H

6. Write an ALP to convert given binary number to hexadecimal number using 8086 MP

Data: 101010102, 111111112, 11002, 11112

7. Write an ALP to order give set of hexadecimal numbers in ascending and descending order

Data: 0AH, 0FH, 0DH, 10H,02H

8. Write an ALP to move block of data from locations 1200H-1205H to 2200H – 2205H

9. Write an ALP to reverse the given string

Data: WELCOME

10. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ ……..

11. Write an ALP to generate square wave using 8255 PPI

12. Write an ALP to generate rate generator using 8253 PIT

13. Write an ALP to interface keyboard with 8086 using 8279 PKI

14. Write an ALP to display the given message using 8279 PKI

Message: COMPUTER SCIENCES

15. Write an ALP to interface analog to digital converter.

58

DIGITAL SIGNAL PROCESSING

L T P C

3 0 0 3

Objective

1. To introduce the basic concepts and techniques of digital signal processing (DSP) and to demonstrate some

interesting and useful practical applications of DSP.

2. To impart the Knowledge of discrete mathematical tools, transforms, and algorithms used in DSP.

Expected Outcome The students will be able to

1. Describe the Sampling Theorem and how this relates to Aliasing and Folding.

2. Determine if a system is a Linear Time-Invariant (LTI) System.

3. Be able to take the Z-transform of a LTI system

4. Determine the frequency response of FIR and IIR filters.


Computer Networks, Computer Architecture and Organization

Content

ANALOG TO DIGITAL FILTER DESIGN THROUGH TRANSFORMATION

Analog filter responses. Z-Transformation and Inverse Z-Transformation. Transformation from analog to digital

filter-Difference method, impulse invariance method and Bilinear transformation

IMPLEMENTATION OF DISCRETE -TIME SYSTEMS

System realization through block-diagram representation and system inter connection. Recursive – Non-recursive

filters – Digital filter realization – Direct, canonic, cascade, parallel and lattice realizations. State space realization of

digital filters. Robust implementation of digital filters. Discrete Fourier Transforms: Discrete Fourier Transform

(DFT) definition – Properties of discrete Fourier transform, Convolution of sequences linear convolution.

FFT ALGORITHMS

Introduction to Radix 2 – Fast Fourier transform (FFT) – Properties of Radix 2 FFT – Decimation in time FFI –

Data shuffling and Bit reversal – Decimation in frequency FFT – Algorithms of Radix 2 FFT – Computing Inverse

DFT by doing a direct DFT.

THEORY AND DESIGN OF DIGITAL IIR FILTERS Review of design techniques for analog low pass filter, frequency transformation, Properties of IIR filter- IIR filter

design –Different methods of IIR filter Design; Theory and Design of Digital FIR Filters: Design characteristics of

FIR filters with linear- phase – Frequency response of linear phase FIR filters – Design of FIR filters using window

functions.

GENERAL PURPOSE DIGITAL SIGNAL PROCESSOR Introduction. Computer architectures for signal processing- Hardware architecture, Pipelining, Hardware multiplier,

accumulator, replication, On chip memory/cache and Extended parallelism. General-purpose digital signal

processors-Fixed point and floating point DSP. Selecting digital signal Processors. Implementation of DSP

algorithms on general purpose DSP-FIR digital filtering.


1. J.G.Proakis , D.G.Manolakis and D.Sharma, “Digital Signal Processing Principles, Algorithms and

Applications”, Pearson Education, 2006.

2. Roberto Cristi, “Modern Digital Signal Processing”, Thomson Brooks, 2004.

3. Oppenhiem V.A.V and Schaffer R.W, “Discrete – time Signal Processing”, Prentice Hall India, 1989.

4. Rabiner L.R and C.B Gold,”Theory and Applications of Digital Signal Processing”, Prentice Hall of India,

1987.

5. Leudeman L.C, “Fundamentals of Digital signal processing”, Harper & Row Publication, 1986.

Mode of Evaluation Continuous Assessment (Written Exam) and Assignment

Term End Examination (Written Exam)

59

RESOURCE MANAGEMENT

L T P C

3 0 0 3

Objective

To introduce the operations research techniques such as Linear Programming, Integer Programming.

Expected Outcomes

The students would be able to understand and use concepts of OR, such as Linear programming, dynamic

programming. They would be able to solve Inventory, maintenance and replacement problems.

INTRODUCTION Concept and scope of operations research (OR) – development of OR – phase of OR – models in (OR) –

Development of OR – phase of OR – Models in OR. Linear Programming-Methods of solution –

graphical and SIMPLEX methods of solution VARIATIONS – duality in LP – revised SIMPLEX method

– applications for business and industrial problem.

INTEGER PROGRAMMING-FORMULATION

graphical representation – Gomory‟s cutting plane method, Transportation And Assignment Problems-

Initial solution – methods of improving the initial solution – travelling salesman problems – dynamic

programming – principle of optimality.

SEQUENCING AD SCHEDULING PROBLEMS

Job sequencing – „n‟ jobs through two machines, two machines, two jobs through „m‟ machines and „n‟

jobs through „m‟ machines.

PERT & CPM Techniques – critical path – normal and crash time – resource allocation – resource

leveling and smoothing.

INVENTORY PROBLEMS

Deterministic model – costs decision variables – economic order quality – instantaneous and non –

instantaneous receipt of goods with and without shortage – quality discount – probabilistic inventory

model – inventory systems – safety stock – reorder level (ROL), reorder point (ROP) determination.

MAINTENANCE AND REPLACEMENT PROBLEMS

Models for routine maintenance and preventive maintenance decisions – replacement models that

deteriorate with time and those fail completely.


1. Taha. H.A. “Operation Research- An Introduction”, Macmillan, 2000.

2. Sharma. S.D., “Operation Research”, Keder Nath Ram Nath & co., 1989.

3. Billy. B. Gillet “Introduction to Operation Research”, Tata McGraw Hill 1982.

4. .S. Hamblin & Stevens Jr. “Operation Research”, McGraw Hill Co., 1974.

Mode of Evaluation Continuous Assessment (Written Exam) and Assignment

Term End Examination (Written Exam)

60

MEE101 ENGINEERING GRAPHICS

L T P C

0 0 4 2

Objectives

1.To create an awareness and emphasise the need for Engineering Graphics.

2.To teach basic drawing standards and conventions.

3.To develop skills in three-dimensional visualization of engineering components.

4.To develop an understanding of 2D and 3D drawings using the Solidworks software.

Expected Outcome

On completion of this course, the students will be able to

1.prepare drawings as per standards (BIS).

2.solve specific geometrical problems in plane geometry involving lines, plane figures and special curves.

3.produce orthographic projection of engineering components working from pictorial drawings.

4. Prepare 2D Drawings using the Solidworks software.

Contents Introduction to engineering graphics – geometrical construction – conics and special curves – free hand sketching –

dimensioning principles – orthographic projection – projection of points, lines and solids in simple position only –

detailed views of simple 3D objects.


1.N.D. Bhatt (1998), Engineering Drawing, Charotar Publishing House.

2.French and Vierk (2002), Fundamentals of Engineering Drawing, McGraw-Hill.

3.K.V. Natarajan (2006), Engineering Graphics, Dhanalakshmi Publishers.

4.CAD Manual prepared by VIT Faculty.

Mode of Evaluation

Assignments, exercises and examinations.

61

MEE102 WORKSHOP PRACTICE – I

L T P C

0 0 2 1

Objectives 1. To train the students in hadling tools, equipement and machinery with safety.

2. To impart skill in fabricating simple components using sheet metal.

3. To cultivate safety aspects in handling of tools and equipment.

Expected Outcome

On completion of this course, the students will be able to

1. welding and soldering operations.

2. fabrication of simple sheet metal parts.

Contents

WELDING EXERCISES

•Introduction to BI Standards and reading of welding drawings.

•Butt Joint

•Lap Joint

•TIG Welding

•MIG Welding

SHEET METAL EXERCISES

•Making of Cube

•Making of Cone using development of surface.

•Making of control panel using development of surface.

SOLDERING EXERCISES

•Soldering and desoldering of resistor in PCB.

•Soldering and desoldering of IC in PCB.

•Soldering and desoldering of capacitor in PCB.

BOSCH TOOLS DEMONSTRATION

•Demonstration of all Bosch tools.

•Introduction to TIG, MIG welding.

•Aluminum welding - submerged and arc welding, wave soldering.

Text/Reference Book

Workshop Manual prepared by VIT Faculty

62

ARTIFICIAL INTELLIGENCE

L T P C

3 0 0 3

Objectives

1. To cover fundamentals of Artificial Intelligence,

2. To teach various knowledge representation techniques.

3. To provide knowledge of AI systems and its variants

Expected Outcome


1. Understand the basics of Artificial Intelligence,

2. Apply AI problem solving techniques, knowledge representation, and reasoning methods

3. Develop simple intelligent / expert system


Data Structures and Algorithms

Contents

INTRODUCTION

Introduction - Foundation and history of AI. AI Problems and techniques - AI programming languages –

Introduction to LISP and PROLOG – Problem spaces and searches -Blind search strategies; Breadth first - Depth

first –Heuristic search techniques Hill climbing - Best first – A* algorithm AO* algorithm – game trees- Minimax

algorithm – Game playing – Alpha beta pruning.

KNOWLEDGE REPRESENTATION

Knowledge representation issues – Predicate logic – logic programming – Sematic nets - Frames and inheritance -

constraint propagation –Representing Knowledge using rules – Rules based deduction system.

REASONING UNDER UNCERTAINTY

Introduction to uncertain knowledge review of probability – Baye‟s Probabilistic inferences and Dempster Shafer

theory –Heuristic methods – Symbolic reasoning under uncertainty- Statistical reasoning – Fuzzy reasoning –

Temporal reasoning- Non monotonic reasoning.

PLANNING AND LEARNING

Planning - Introduction, Planning in situational calculus - Representation for planning – Partial order planning

algorithm- Learning from examples- Discovery as learning – Learning by analogy – Explanation based learning –

Introduction to Neural nets – Genetic Algorithms.

APPLICATIONS

Principles of Natural Language Processing Rule Based Systems Architecture - Expert systems- Knowledge

acquisition concepts – AI application to robotics – Current trends in Intelligent Systems.


1. Patrick Henry Winston,” Artificial Intelligence”, Addison Wesley, Third edition, 2000.

2. George F Luger, Artificial Intelligence, Pearson Education, 4th edition, 2001.

3. Engene Charniak and Drew Mc Dermott,” Introduction to Artificial intelligence Addison Wesley 2000.

4. Nils J. Nilsson, ”Principles of Artificial Intelligence“, Narosa Publishing House, 2000.

Mode of Evaluation


63

BIO- INFORMATICS

L T P C

3 0 0 3

Objectives

1. To cover the basics of Bio informatics, Dynamic programming, Evolutionary trees & DNA sequencing.

Expected Outcome


1. Understand and explain the fundamentals of Bio-informatics,

2. Know Dynamic programming, searching algorithms, Evolutionary trees, DNA mapping, DNA sequencing

and Gene predictions

3. Implement evolutionary computing for the Bio-informatics domain

Contents

CODING

Common health care language - coding techniques – coded and quasi coded data – Medical vocabulary – industry

wide communication standards HL7 – unified medical language system – quality of care paradigms, risk

management bioethics.

PATIENT RECORD MAINTENANCE

Electronic patient record – models or ERP – environmental services – metrics – telemedicine – community networks

– telemedicine peripherals and equipment selection – anatomy of video conferencing technology.

PROTEIN INFORMATION RESSOURCES

Biological data basics – primary secondary data basics – protein pattern data basics – DNA sequences data basics -

DNA analysis - Genes structure and DNA sequences – interpretation of EST structures – different approach to EST

analysis.

ALIGNMENT TECHNIQUES

Data base searching - comparison of two sequences – identity and similarity – global and global similarity – global

and local alignment - multiple sequence alignment – data basis of multiple alignment – secondary data base.

Expert system

Principles of expert system – statistical decision trees – integration of decision support in clinical processors.


1. Dan Gusfield, "Algorithms On Strings Trees and Sequences", Cambridge University Press, 1997

2. Westhead, "Instant notes – Bioinformatics", Viva Publishers.

3. Bergeron Bryan, "Bioinformatics Computing", Prentice Hall of India

4. T.K. Attwood and D.J Perry – Smith, Introduction to Bio-Informatics, Long man, Essex.1999.

5. Coiera E, Guide to medical informatics, The internet and telemedicine, Chajsman & Hall medical, London

1997.

6. Bernser, E.S. Clinical decision support systems, Theory and practice, Springer- Verlag, New York, 1999.

Mode of Evaluation


64

PARALLEL ALGORITHMS

L T P C

3 0 0 3

Objectives

To provide fundamentals in design, analysis, and implementation, of high performance computational

science and engineering applications.

To teach parallel algorithms and their impact in engineering problem.

Expected Outcome


Develop knowledge and skills concerning applications of high-performance computing systems

Develop Hardware/software co-design for achieving performance on real-world applications.


Programming Fundamentals, computer architecture and organization

INTRODUCTION

Computational Science and Engineering Applications; characteristics and requirements, Review of Computational

Complexity, Performance: metrics and measurements, Granularity and Partitioning, Locality:

temporal/spatial/stream/kernel, Basic methods for parallel programming, Real-world case studies (drawn from

multi-scale, multi-discipline applications)

HIGH-END COMPUTER SYSTEMS

Memory Hierarchies, Multi-core Processors: Homogeneous and Heterogeneous, Shared-memory Symmetric

Multiprocessors, Vector Computers, Distributed Memory Computers, Supercomputers and Pataskala Systems,

Application Accelerators / Reconfigurable Computing, Novel computers: Stream, multithreaded, and purpose-built

PARALLEL ALGORITHMS

Parallel models: ideal and real frameworks, Basic Techniques: Balanced Trees, Pointer Jumping, Divide and

Conquer, Partitioning, Regular Algorithms: Matrix operations and Linear Algebra, Irregular Algorithms: Lists,

Trees, Graphs, Randomization: Parallel Pseudo-Random Number Generators, Sorting, Monte Carlo techniques

PARALLEL PROGRAMMING

Revealing concurrency in applications, Task and Functional Parallelism, Task Scheduling, Synchronization

Methods, Parallel Primitives (collective operations), SPMD Programming (threads, OpenMP, MPI), I/O and File

Systems, Parallel Matlabs (Parallel Matlab, Star-P, Matlab MPI), Partitioning Global Address Space (PGAS)

languages (UPC, Titanium, Global Arrays)

Achieving Performance

Measuring performance, Identifying performance bottlenecks, restructuring applications for deep memory

hierarchies, Partitioning applications for heterogeneous resources, Using existing libraries, tools, and frameworks


1. Ananth Grama, Anshul Gupta, George Karypis, and ,Vipin Kumar, Introduction to Parallel Computing, 2nd

edition, Addison-Welsey, 2003.

2. David A. Bader (Ed.), Petascale Computing: Algorithms and Applications, Chapman & Hall/CRC

Computational Science Series, 2007.


65

ADVANCED COMPUTER ARCHITECTURE

L T P C

3 0 0 3

Objective

1. To provide an overview of future computing architectures

2. To provide a foundation for more advanced studies of multi-core architecture.

Expected Outcome


1. Understand multi-core architectures.

2. Write parallel programs for scientific computations.

3. Know the issues of operating system, compiler for multi-core system.


Computer architecture, Programming Language Translators

INTRODUCTION

Introduction to parallel computing, need for parallel computing, parallel architectural classification schemes, Flynn‟s

, Fengs classification, performance of parallel processors, distributed processing, processor and memory hierarchy,

bus, cache & shared memory, introduction to super scalar architectures, quantitative evaluation of performance gain

using memory, cache miss/hits.

MULTI-CORE ARCHITECTURES

Introduction to multi-core architectures, issues involved into writing code for multi-core architectures, development

of programs for these architectures, program optimizations techniques, building of some of these techniques in

compilers, OpenMP and other message passing libraries, threads, mutex etc.

MULTI-THREADED ARCHITECTURES

Parallel computers, Instruction level parallelism (ILP) vs. thread level parallelism (TLP), Performance issues: Brief

introduction to cache hierarchy and communication latency, Shared memory multiprocessors, General architectures

and the problem of cache coherence, Synchronization primitives: Atomic primitives; locks: TTS, ticket, array;

barriers: central and tree; performance implications in shared memory programs; Chip multiprocessors: Why CMP

(Moore's law, wire delay); shared L2 vs. tiled CMP; core complexity; power/performance; Snoopy coherence:

invalidate vs. update, MSI, MESI, MOESI, MOSI; performance trade-offs; pipelined snoopy bus design; Memory

consistency models: SC, PC, TSO, PSO, WO/WC, RC; Chip multiprocessor case studies: Intel Montecito and dual-

core, Pentium4, IBM Power4, Sun Niagara

COMPILER OPTIMIZATION ISSUES

Introduction to optimization, overview of parallelization; Shared memory programming, introduction to OpenMP;

Dataflow analysis, pointer analysis, alias analysis; Data dependence analysis, solving data dependence equations

(integer linear programming problem); Loop optimizations; Memory hierarchy issues in code optimization.

OPERATING SYSTEM ISSUES AND APPLICATIONS

Operating System issues for multiprocessing Need for pre-emptive OS; Scheduling Techniques, Usual OS

scheduling techniques, Threads, Distributed scheduler, Multiprocessor scheduling, Gang scheduling;

Communication between processes, Message boxes, Shared memory; Sharing issues and Synchronization, Sharing

memory and other structures, Sharing I/O devices, Distributed Semaphores, monitors, spin-locks, Implementation

techniques on multi-cores; OpenMP, MPI and case studies Case studies from Applications: Digital Signal

Processing, Image processing, Speech processing.


1. Hwang, “ Advanced Computer Architecture”, New Age International,2004

2. Quin, “ Parallel Computing, Theory & Practices”, McGraw Hill

3. John L. Hennessy and David A. Patterson “ Quantative Approach –Computer Architecture” Morgan Kaufmann,

4th edition, 2006.

4. Shameem Akhter and Jason Roberts, Multi-Core Programming, Intel Press,1st Edition2006

Mode of Evaluation : Written examinations, seminar, assignments, surprise tests and quizzes

66

CONCURRENT AND DISTRIBUTED SYSTEMS

L T P C

3 0 0 3

Objectives

1. To cover parallel & distributed computing architecture, networked clusters of computers, utilization

and management of the expensive remote resources.

2. To present the principles underlying the functioning of concurrent and distributed systems;

3. To create an awareness of the major technical challenges in concurrent and distributed systems design

and implementation;

Expected Outcome


1. Understand and use different network models, security mechanisms and design methodologies of

Distributed systems

2. Know the conceptual models of Distributed Systems.

3. Have exposure on past and current research issues in the field of distributed systems.


1. Operating Systems

INTRODUCTION

Introduction to distributed computing system, evolution different models, gaining popularity, definition, issues in

design, DCE, message passing –introduction, desirable features of a good message passing system, issues in IPC,

synchronization, buffering, multigram messages, encoding and decoding of message data, process addressing,

failure handling, group communication.

REMOTE PROCEDURE CALLS

Introduction, model, transparency, implementation mechanism, stub generation, RPC messages, marshalling

arguments and results, server management, parameter - passing semantics, call semantics, communication protocols

for RPCs, client – server binding, exception handling, security, mini project using Java RMI

DISTRIBUTED SHARED MEMORY

General architecture of DSM systems, design and implementation issues of DSM systems, granularity, structure of

shared memory space, consistency model, replacement strategy, thrashing, advantages of DSM, clock

synchronization DFS and security- Desirable features of good DFS, file models, file accessing Models, file sharing

semantics, file catching schemes, file replication, fault Tolerance, atomic transaction, potential attacks to computer

system, cryptography, authentication, access control. Digital signatures, DCE security service

Parallel and Distributed Computing

Operating Systems, Client-Server Model, Distributed Database Systems, Parallel Programming Languages and

Algorithms. Distributed Network Architectures- Managing Distributed Systems. Design Considerations

METHODS AND TOOLS

For development, implementation & evaluation of distributed information systems, workflow, software processes,

transaction management, and data modeling, infrastructure e.g. middle-ware to glue heterogeneous, autonomous,

and partly mobile/distributed data systems, such as e.g. client/server-, CORBA-, and Internet-technologies. Methods

for building distributed applications.


1. Pradeep K. Sinha, "Distributed Operating Systems: Concepts & Design", PHI, 1997

2. Crichlow Joel M, "An Introduction to Distributed and Parallel Computing", PHI, 1997

3. Black Uyless, "Data Communications and Distributed Networks", PHI, 5th Edition


67

SOFTWARE PRACTICE AND TESTING

L T P C

3 0 0 3

Objectives

Provide a systematic overview of standards, techniques and tools in software testing.

Introduce core methodologies for the management and execution of the testing process.

Introduce practical techniques for testing and apply them to simple examples.

Expected Outcome


Describe key techniques and standards in software testing.

Evaluate strategies for software testing for both complete life cycles and individual

phases

Specify and design test cases and execute a test procedure for selected problems.


Software Engineering

Contents

SOFTWARE PROGRAMMING PRACTICE -I

Style: names, expressions, statement, consistency and idioms, function macros, constants, comments; interface:

CSV, prototype libraries, interface principles, resource management, user interfaces. Performance: Performance

bottlenecks, timing and profiling speed, spacy efficiency, estimation.

SOFTWARE PROGRAMMING PRACTICE -II

Portability: language, headers and libraries, program organization, isolation, data exchange, byte order, portability

and upgrade, internationalization. Formatting data, regular expressions, programming tools, interpreters and

compilers, program generators, macros. Debugging: debuggers, clues and bugs, debugging tools.

SOFTWARE TESTING PROCESS MATURITY AND FRAMEWORK FOR TEST PROCESS

IMPROVEMENT &TESTING METHODS

The six essentials of software testing: the state of the art and the state of the practice; the clean sheet approach to

getting started. Establishing a practical perspective; critical choices; what, when, and how to test; critical disciplines:

frameworks for testing. Verification testing : basic verification methods, getting leverage on verification, verifying

documents at different phases, getting the best from verification, three critical success factors for implementing

verification, recommendations;

TESTING METHODS

Validation testing: validation overview, validation methods, validation activities, and recommendation strategy for

validation testing; controlling validation costs; minimizing the cost of performance tests, minimizing the cost of

maintaining the tests, minimizing validation test ware development costs. Recommendations; testing tracks

deliverables, validation testing tasks and deliverables, a testing orphan- user manuals, product release criteria,

summary of IEEE/ANSI test related documents, life-cycle mapping of tasks and deliverables; software testing tools;

categorizing test tools, tool acquisition; measurement provide answers, useful measures and other interesting

measures, recommendations.

MANAGING TEST TECHNOLOGY, STANDARD CHECKLISTS Organizational approaches to testing: organizing and reorganizing, structural design elements, approaches to

organizing the test function, selecting the right approach; current practices, trends, challenges; GUIs: what‟s new

here? Usage testing, tester-to-developer ratios, software measures and practices benchmark study; getting

sustainable grains in place; getting gains to happen, getting help, follow-up; standards relevant to software

engineering and testing; verification checklists.


1. Brain W. Kernighan and Rob Pike : The Practice of Programming, Addison-Wesley, 2006

2. Ed Kit: Software Testing in the Real World, Addison-Wesley, 2006

3. William Perry : Effective Methods For Software Testing, Second Edition, John Wiley, 2006

4. Beizer B: Software Testing Techniques, Second Edition, Van Nostrand Reinhold, 2001

5. Srinivasan Desikan ,Gopalaswamy Ramesh :Software Testing Principles and Practices ,Pearson Education

2007.

Mode of Evaluation : Written examinations, seminar, assignments, surprise tests and quizzes

68

DATA WAREHOUSING AND DATA MINING

L T P C

3 0 0 3

Objectives

1. To describe and utilize a range of techniques for designing data warehousing and data mining systems.

2. To cover knowledge discovery process.

3. To design and populate a business data warehouse.

Expected Outcome


1. Know the concepts of data warehousing like meta-data, data mart, summary table, fact data and dimension

data.

2. Sail the various approaches in data mining.


Database Systems

DATA WAREHOUSE AND OLAP TECHNOLOGY FOR DATA MINING

Introduction to Data Warehouse- A multidimensional Data Model – Data Warehouse architecture – Data

preprocessing- Data cleaning – Data integration and Transformation.

DATA MINING INTRODUCTION

Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems, Major issues in

Data mining.

DATA MINING PRIMITIVES, LANGUAGES & SYSTEM ARCHITECTURE

Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge –

interestingness measures– presentation & visualization of discovered pattern - Data Mining Query language –

Designing Graphical User interfaces based on DMQL - Architecture of Data mining.

ASSOCIATION RULE MINING

Basic concepts – market basket analysis - Mining single dimensional Boolean association rules from transactional

databases. Classification & prediction: What‟s classification - issues regarding classification and prediction –

Bayesian classification – prediction: linear – non linear.

CLUSTER ANALYSIS

Types of Data in cluster analysis - Major clustering methods. Data mining applications.

Text/ Reference books

1. Han J. & Kamber, M, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2005.

2. Immon.W.H., “Building the Data Warehouse”, Wiley Dream Tech, 3rd Edition, 2003.

3. Anahory S., Murray, D, “Data Warehousing in the Real World”, Addison Wesley, 1st Edition, 1997.


69

SCRIPTING LANGUAGES

L T P C

3 0 0 3

Objectives

To teach the fundamental and advanced concepts of scripting languages

To create interactive Internet applications using scripts

Expected Outcome


1. Create applications using Java Script.

2. Create applications using VB Script.


Computer Networks.

Contents

VB SCRIPT FUNDAMENTALS

Introduction to HTML-VBScript Features-Data types-Variables- Constants-Operators-Using Conditional

Statements-Looping Through Code-Procedures- Coding Conventions, VB Script in Internet Explorer: A simple

VBScript Page-Using VBScript with Objects-VB Script and Forms-Adding VBScript Code to an HTML page

JAVA SCRIPT Definition-Learning JAVA Script Language-Running JAVA Script Scripts-Using JAVA Script in HTML.

FORM ELEMENTS

Verifying form inputs with JAVA Script – JAVA Script values, Variables and literal – JAVA Script expressions and

operators-JAVA Script object model - Using built in object and functions.

JAVA FRAMES

Overview of JAVA Script statements-Working with windows and frames-Status bar, dates Objects, Random

numbers.

CASE STUDY

Netscape Navigator Objects -Playing with JAVA Script-CASE Study.


1. John R Vacca,, JavaScript Development - Morgan Kaufmann 1997

2. Paul Lomax, Matt Childs, Ran Petrusha, VBScript in a nutshell –O‟Reilly, 2003

3. John Pollac, JavaScript, McGraw Hill, 2003

4. Adrian Kingley, VBScript Programmers Reference –Wrox, 2004

Mode of Evaluation


70

HUMAN COMPUTER INTERACTION

L T P C

3 0 0 3

Objectives

1. To introduce the fundamentals of user interface design

2. To teach of concepts and guidelines of user interface

Expected Outcome


1. Understand the Human Computer Interaction.

2. Design an effective user interface for software application.


Computer Graphics, Software Engineering

Contents

FOUNDATIONS OF HUMAN-COMPUTER INTERACTION

Motivation; contexts for HCI (tools, web hypermedia, communication); human centered development and

evaluation; human performance models: perception, movement, and cognition; human performance models: culture,

communication, and organizations; accommodating human diversity; principles of good design and good designers;

engineering tradeoffs; introduction to usability testing.

HUMAN-CENTERED SOFTWARE EVALUATION

Setting goals for evaluation; evaluation without users: walkthroughs, KLM, guidelines, and standards; evaluation

with users: usability testing, interview, survey, experiment.

HUMAN-CENTERED SOFTWARE DEVELOPMENT

Approaches, characteristics, and overview of process; functionality and usability: task analysis, interviews, surveys;

specifying interaction and presentation; prototyping techniques and tools – paper storyboards, Inheritance and

dynamic dispatch, Prototyping languages and GUI builders.

GRAPHICAL USER-INTERFACE DESIGN

Principles of graphical user interfaces, GUI toolkits; Choosing interaction styles and interaction techniques; HCI

aspects of common widgets; HCI aspects of screen design: layout, color, fonts, labeling; handling human failure;

beyond simple screen design: visualization, representation, metaphor; multi-modal interaction: graphics, sound, and

haptics; 3D interaction and virtual reality.

HCI ASPECTS OF MULTIMEDIA SYSTEMS

Categorization and architectures of information : hierarchies, hypermedia; information retrieval and human

performance – Web search, Usability of database query language, Graphics, Sound; HCI design of multimedia

information systems; speech recognition and natural language processing; information appliances and mobile

computing.


1. Ben Schneiderman, “Designing the User Interface ", Addison Wesley, 2000.

2. Jacob Nielsen, “Usability Engineering ", Academic Press, 1993.

3. Alan Dix et al, “Human - Computer Interaction ", Prentice Hall, 1993.

4. Alan Cooper, “The Essentials of User Interface Design ", IDG Books, 1995.


71

MULTIMEDIA SYSTEMS AND ALGORITHMS

L T P C

3 0 0 3

Objectives

1. To introduce multimedia computing and communications.

2. To impart knowledge of Sound/ Audio, video processing techniques.

Expected Outcome


1. Use multimedia computing hardware, software tools multimedia authoring and design process.

2. Identify the research issues involved in multimedia systems


Computer Graphics

Contents

INTRODUCTION

Branch-overlapping Aspects of Multimedia, Content, Global Structure, Multimedia- Media and Data Streams,

Medium, Main Properties of a Multimedia System, Traditional Data Stream Characteristics, Data Streams

Characteristics for Continuous Media, Information Units.

SOUND/AUDIO

Basic Sound Concepts, Music, Speech, Image and Graphics- Basic Concepts, Computer Image Processing,

Introduction to Optical Storage

VIDEO AND ANIMATION

Basic Concepts, Television, Computer-based Animation, Data Compression-Storage Space, Coding Requirements,

Source, Entropy, and Hybrid Coding, Some Basic Compression Techniques-JPEG, H.261, MPEG, DVI

MULTIMEDIA OPERATING SYSTEMS

Introduction, Real-time, Resource Management, Process Management, File Systems, Additional Operating System

Issues, System Architecture, Multimedia Communication Systems- Application Subsystem, Transport Subsystem,

Quality of Service and Resource Management

MULTIMEDIA DATABASE SYSTEMS

Multimedia Database Systems and its characteristics, Data Analysis, Data Structure, Operations on Data, Integration

in a Database Model, Introduction to Hypertext, Hypermedia, Document Architecture, SGML, ODA, MHEG, A

Reference Model for Multimedia Synchronization, Multimedia Applications- Media Preparation. Media

Composition, Media Integration, Media Communication, Media Consumption, Media Entertainment


1. Ralf Steinmetz and Klara Mahrstedt, "Multimedia computing, communications and Applications", Pearson

Education Asia, 1st reprint – 2001.

2. K. Rao, "Multimedia Communication Systems: Techniques, Standards, and Networks", Prentice Hall, 2002


72

DATABASE DESIGN

Objectives

1. To cover Distributed Database Design Concepts.

2. To teach Query processing, Query decomposition, Transaction management and Distributed DBMS

reliability.

Expected Outcome


1. Understand distributed databases,

2. Apply distributed concepts in database design

3. Implement distributed query processing, Query decomposition and Optimization.


Database systems

DISTRIBUTED DATABASE DESIGN

Promises of DDBSs. – Complicating Factors – Problem Areas, DBMS Standardization – Architectural models for

distributed DBMSs –Distributed DBMS Architecture – Global Directory issues, Alternative Design Strategies –

Distribution Design issues – Fragmentation – Allocation, Semantic Data Control: View Management – Data

Security – Semantic Integrity Control

OVERVIEW OF QUERY PROCESSING

Query processing problem – objectives of query processing – Complexity of Relational Algebra operations –

characterization of Query Processors – Layers of Query processing

QUERY DECOMPOSITION

Localization of Distributed Data, Query Optimization – Centralized Query Optimization – Join Ordering in fragment

queries – distributed query optimization algorithms.

TRANSACTION MANAGEMENT

Definition of a transaction – Properties of Transactions – Types of Transactions, Distributed concurrency control-

Serializability theory – Taxonomy of concurrency control mechanisms – Locking based concurrency control

algorithms Timestamp-based concurrency control algorithms – Optimistic concurrency control algorithms –

optimistic concurrency control algorithms – Deadlock management – Relaxed concurrency control .

DISTRIBUTED DBMS RELIABILITY

Reliability concepts and measures – Failures and fault tolerance in distributed systems – local reliability protocols –

distributed reliability protocols – dealing with site failures – Network partitioning – Architectural considerations


1. M. Tamer Ozsu, Patick Valduriesz, "Principles of Distributed Database Systems", PHI, 1999

2. Stefanoceri ,Giuseppe Pelagatti, "Distributed Database Principles and Systems", McGraw Hill publications, 1987

3. Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems, 4th Edition, Addison-Wesley, 2004

Mode of Evaluation


L T P C

3 0 0 3

73

MODELING AND SIMULATION

L T P C

3 0 0 3

Objectives

To teach various simulation models

To introduce deterministic system and its policies for problem modeling and solving.

To teach the method of input data analysis

Expected Outcome

The students would be able to

Understand and use discrete event simulation, simulation techniques, and statistical methods.

Apply modeling techniques for scientific applications


Applied Probability, Statistics and Reliability

Contents

INTRODUCTION

Introduction to Simulation-Advantages and disadvantages of simulation, areas of application, Systems and system

environment, Components of a system, Discrete and continuous systems, Model of a system. Types of models,

Discrete – events system simulation, Steps in a simulation study. Simulation Examples, Simulation of queuing

systems, Simulation of inventory systems, other examples of simulation, discrete event simulation, general

principles and computer simulation languages. Concepts in DES, Programming languages for DESS: FORTRAN,

GASP, SIMSCRIPT, GPSS, SLAM, Summary and comparison of simulations.

SIMULATION MODELS

Statistical Models in Simulation- Review of terminology & concepts, Useful statistical models, Discrete

distributions, Continuous distributions, Process, Empirical distributions. Queuing Models: Characteristics of

queuing systems, queuing notation, Transient & steady state behavior of queuing notation, Transient & steady state

behavior of queues, long run measures of performance of queuing systems, steady – state behavior of finite

population models.

INVETORY SYSTEMS

Inventory Systems- Measures of effectiveness, Inventory policies, Deterministic systems, and probabilistic systems,

Simulation in inventory analysis. Random Number Generation: Properties of random numbers, Generation of

Pseudo – random. Nos., techniques for generating random nos., tests for random nos. Random Variable Generation:

Inverse transforms technique, Direct Transformation for the normal distribution, Convolution method, Acceptance-

Rejection technique.

INPUT DATA ANALYSIS

Input Data Analysis-Data collection, identifying the distribution, parameter estimation, goodness-of-fit tests.

Verification and validation of simulation models: Model building, verification & validation, verification of

simulation models, calibration & validation of models.

OUTPUT ANALYSIS

Output Analysis For A Single Model- Stochastic nature of O/I data, types of simulations with respect to O/P

analysis, measures of performance and their estimation, O/p analysis for terminating simulations, O/P analysis for

steady-state simulations. Comparison and evaluation of alternative system designs: Comparison of two and several

system designs, statistical models for estimating the effect of design alternatives.

REFERENCE BOOKS:

1. Jerry Banks, John S. Carson, Discrete-event System Simulation, PHI, 3rd Edition

2. Karian, Z.A. and Dvdewicz. E.J., Modern Statistical Systems and GPSS Simulation, Freeman, 1991.

Mode of Evaluation


74

HARDWARE SOFTWARE CO-DESIGN

L T P C

3 0 0 3

Objectives

1. To educate the hardware, software, and system designer on the fundamentals of hardware/software

codesign for the construction of complex systems, particularly embedded systems.

Expected Outcome


1. Understand Current Hardware/Software Design Process

2. Deal Issues and Directions in Hardware/Software Co-design

3. Practice Hardware/Software Modeling Concepts


Embedded system

Contents

INTRODUCTION

Co-design Definition, Motivation for Codesign, Categories of Systems and the Codesign Problem, Embedded

Systems

UNIFIED HARDWARE/SOFTWARE REPRESENTATIONS

Components of the Current Codesign Process, Components of the Ideal Codesign Process, Unified

Hardware/Software Representations

HW/SW PARTITIONING TECHNIQUES

Partitioning Algorithms, Cost Metrics, Issues in Partitioning, Integrated HW/SW Modeling Methodologies

HW/SW SYNTHESIS METHODOLOGIES

Hardware Synthesis, Software Synthesis, Interface Synthesis, Cosynthesis

APPROACHES TO HW/SW CODESIGN

Industry Approaches, Research , Major Codesign Research Efforts: Chinook, COSYMA, Ptolemy, POLIS, Module

Summary


1. Wolf, Wayne , Hardware/Software Co-Design: Principles and Practice, Springer, 1997

2. Giovanni De Micheli, Rolf Ernst,Wayne Wolf, Readings in Hardware/Software Co-design , Systems

Silicon,2001

Mode of Evaluation


75

COMPUTER ORGANIZATION AND DESIGN

Objectives

1. To provide the fundamentals of computer organization

2. To provide foundations for the advanced studies in parallel computing.

3. To teach contemporary issues of computer organization

Expected Outcome


1. Understand parallel architecture and its performance.

2. Know the distributed system models of parallel computing



Contents

PERFORMANCE ISSUES

Metrics for computer performance; clock rate, MIPS, Cycles per instruction, benchmarks; Strengths and weaknesses

of performance metrics; averaging metrics: arithmetic, geometric and harmonic; The role of Amdahl‟s law in

computer performance.

INSTRUCTION SET ARCHITECTURE

Implementation of the von Neumann machine; Single vs. multiple bus datapaths; Instruction set architecture;

machine architecture as a framework for encapsulating design decisions; Relationship between the architecture and

the compiler; Implementing instructions;

CONTROL UNIT

Hardwired realization vs. micro programmed realization; Arithmetic units, for multiplication and division;

Instruction pipelining; Trends in computer architecture: CISC, RISC, VLIW, EPIC; Introduction to instruction-level

parallelism (ILP); Pipeline hazards: structural, data and control; reducing the effects of hazards.

DISTRIBUTED SYSTEM MODELS

Classification of models: parallel machine models (SIMD, MIMD, SISD, And MISD): Flynn‟s taxonomy, Handler‟s

classification, message passing; Granularity, levels of parallelism; Multiprocessors and multi-computers: Topology,

tightly coupled and loosely coupled architectures; Superscalar architecture; Branch prediction; Prefetching;

Speculative execution; Multithreading; Scalability; Short vector instruction sets: Streaming extensions, AltiVec,

relationship between computer architecture and multimedia applications.

CONTEMPORARY ARCHITECTURES:

Hand-held devices; over view of embedded systems; trends in processor architecture


1. D.A. Patterson & J.L. Hennessy, Computer organization & design: The hardware/ software interface,

Morgan Kaufmann, 4th Edition, 2007

2. D. Sima, T. Fountain, P. Kacsuk, "Advanced Computer Architectures: A Design Space Approach",

Addison Wesley, 1997..


L T P C

3 0 0 3

76

DATA COMMUNICATIONS

Objectives

1. To lay foundations for data and digital communication.

2. To describe about various transmission types.

3. To teach error control coding techniques

Expected Outcome


1. Be familiar with the fundamentals of data & digital communication sampling techniques.

2. Have an idea of transmission mechanisms

3. Understand error codlings, and spread spectrum systems


Computer Networks

Contents

INTRODUCTION

Key elements of communication model, Data communication, The effectiveness of data communication

dependents, Components, Classification of communication networks, The TCP/IP Protocol Architecture, OSI

Layers, Protocols in OSI reference model

ANALOG AND DIGITAL TRANSMISSION

Transmission terminology, Frequency, spectrum, and bandwidth, Frequency-domain concepts , Spectrum , Analog

and Digital Data Transmission , Transmission Impairments, Attenuation Distortion , Delay Distortion , Noise ,

Thermal Noise , Intermediation Noise , Crosstalk Noise , Impulse Noise , Channel Capacity

TRANSMISSION MEDIA

Guided media, Open Wire, Twisted Pair, Optical Fiber , Unguided transmission media; Ground wave propagation,

Line of sight propagation; Radio Frequencies , Microwave , Satellites

SYNCHRONOUS / ASYNCHRONOUS TRANSMISSION

Parallel and Serial Transmission, Parallel transmission, Serial Transmission, Synchronous transmission, Bit

synchronization, Character synchronization, Asynchronous transmission, Asynchronous Start-Stop Systems, Start

bit and bit synchronization; Line configuration: Topology, Point-to-point configuration, Multi point link, Mode of

transmission, Simplex, Half duplex, Full Duplex; Interfacing: Interface Standards: EIA-232 Interface, Dial-Up

operation using V.24/EIA-232; Null modem, ISDN interface, Balanced vs. Unbalanced Interfaces:

ENCODING SCHEMES

Digital-to-Digital encoding scheme: Unipolar, Polar,Non-Return –to- Zero (NRZ) encoding, Non Return-to-Zero-

Level (NRZ-L), Non Return-to-Zero Inverted (NRZ-I), Return-to-Zero, Biphase: Manchester, Differential

Manchester, Bipolar, Bipolar Alternate Mark Inversion(BAMI), Bipolar 8-Zeroes Substitution (B8ZS), High

Density bipolar-3 zeros (HDB3); Analog –to – Digital Encoding scheme: PCM (Pulse Code Modulation), Delta

Modulation (DM), ; Analog-to- Analog Encoding Scheme: Amplitude modulation (AM), Frequency modulation (FM)

, Phase modulation (PM), Digital -to- Analog Encoding scheme, Amplitude Shift Keying (ASK), Frequency Shift

Keying (FSK), Phase Shift Keying (PSK), Spread Spectrum

Text/Reference Book

1. Behrouz A Forouzan, Data Communications and Networking, Tata Mc-grawhill, 2007.

2. W. Stallings, Data & Computer Communications, Prentice-Hall, 2005

3. Simon Haykins, “Digital Communications”, John Wiley, 1988.

4. John.g.Proakis, „Digital Communication‟, McGraw-Hill Inc., Third edition, Malaysia, 1995.

5. M.K.Simen, „Digital Communication Techniques, Signal Design & Detection‟, Prentice Hall of India, 1999

L T P C

3 0 0 3

77

IMAGE PROCESSING

L T P C

3 0 0 3

Objectives

1. To teach the fundamental concepts of digital image processing

2. To impart knowledge of image transforms

3. To explore the image enhancement, Image segmentation and restoration techniques

Expected Outcome


1. Understand the fundamental image processing techniques.

2. Implement image processing applications


Linear Algebra

DIGITAL IMAGE FUNDAMENTAL

Elements of digital image processing systems, Elements of Visual perception, Image Acquisition systems, Image

sampling and quantization, Matrix and Singular Value representation of discrete images.

IMAGE TRANSFORMS

1D DFT, 2D DFT, Cosine, FFT, Sine Hadamard, Haar, Slant, KL, SVD transform and their properties.

IMAGE ENHANCEMENT

Histogram – Modification and specification techniques Image smoothing, Image sharpening, generation of spatial

masks from frequency domain specification, Noise models – Linear and Nonlinear filters, Homomorphic filtering,

Image Segmentation and its types, Morphological based operations, Color processing: false color, Pseudocolor and

color image processing.

IMAGE RESTORATION AND RECOGNITION

Image degradation models, Unconstrained and Constrained restoration, inverse filtering, least mean square filter,

Pattern Classes, optimal statistical classifiers

IMAGE COMPRESSION

Runlength, Huffman coding, Shift codes, arithmetic coding, bit plane coding, transform coding, JPEG Standard,

wavelet transform, predictive techniques, Block truncation coding schemes, Facet modeling.

Text/Reference Book

1. Anil K.Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India, 1997.

2. Rafel C. Gonzalez and Richard E. Woods, Digital Image Processing”, Addison Wesley, 1993.

3. William K. Pratt, “Digital Image Processing”, John Wiley, NJ, 1987.

4. Sid Ahmed M.A., “Image Processing Theory, Algorithm and Architectures”, McGraw-Hill, 1995.

5. Umbaugh, “Computer Vision”.


vit cse btech course plan

Documents