I & Ii Semesters Curriculum and Syllabi: Anna University:: Chennai - 600 025 University Departments R - 2008
I & Ii Semesters Curriculum and Syllabi: Anna University:: Chennai - 600 025 University Departments R - 2008
I & Ii Semesters Curriculum and Syllabi: Anna University:: Chennai - 600 025 University Departments R - 2008
UNIVERSITY DEPARTMENTS
R - 2008
SEMESTER - I
SEMESTER II
1
HS 9111 TECHNICAL ENGLISH I L T P C
(Common to all branches of B.E. / B.Tech. Programmes) 3 1 0 4
AIM:
To help students specialising in the field of Engineering and Technology develop their
proficiency in oral and written communication in Technical English.
OBJECTIVES:
To enable students improve their vocabulary and employ the words
appropriately in different academic and professional contexts.
To make students comprehend classroom lectures and technically oriented
passages.
To enable students develop suitable reading strategies that could be adopted
while reading science related texts.
To enable students acquire the ability to speak effectively in English in real
life situations and work-related situations.
To train students in academic and professional writing.
UNIT I 9+3
Vocabulary - using words in context - use of suffixes to form nouns from verbs and
adjectives – adjectives, adverbs - matching words with meanings - Active and passive
voices – tenses - simple present, present continuous - comparative adjectives –
adverbial forms - Reading text: skimming for general information - specific details - note
making - cloze reading – Listening and transferring of information from text to graphic
forms - bar charts, flow-charts - Paragraph writing - descriptions using descriptive words
and phrases - organising information - Role play - conversational techniques –
discussions - oral reporting.
UNIT II 9+3
Vocabulary items - words with prefixes (“multi-“, “under-“) - Asking and answering
questions, error correction - spelling and punctuation - Reading Comprehension -
scanning for information – inferring meaning from context - Listening and guided note-
taking - paragraph writing - using notes – giving suitable headings / subheadings for
paragraphs – Comparing and contrasting using expressions of comparison - Discussion
using creative ideas
UNIT IV 9+3
Expanding nominal compounds – words with multiple meanings – Error correction -
prepositions - use of the prefix “trans-“ - compound adjectives - modal verbs to express
probability - simple past and present prefect - Reading – prediction of content -
understanding advertisements - scanning the text and comprehension check - Listening
for details - Writing definitions – expression of use and purpose - Role-play – discussion
- speculating about the future
2
UNIT V 9+3
Formation of nouns, verbs and adjectives from root words – some useful phrases and
expressions - cloze exercises - ‘If’ conditional clauses – gerunds (verbal nouns) -
Reading for comprehension - intensive reading - Accuracy in listening – listening to
discussion on specific issues - Group discussion - role-play (stating, discussing
problems and proposing solutions) - Planning a tour - Writing an itinerary - Writing
formal letters - letter to the editor
TEXTBOOKS
REFERENCES
1. Day, R.A, Scientific English, Second Edition, Hyderabad: Universities Press, 2000.
2. Mitra, B.K, Effective Technical Communication: A Guide for Scientists & Engineers,
New Delhi: Oxford University Press, 2006.
3. Website: www.uefap.co.uk
MA 9111 MATHEMATICS – I L T P C
(Common to all branches of B.E. / B.Tech. Programmes) 3 1 0 4
AIM:
To make available the basic concepts of engineering mathematics, to prepare the
student for new concepts to be introduced in the subsequent semesters and to provide
the necessary mathematical skills that are needed in modeling physical processes by an
engineer.
OBJECTIVES:
To develop the use of matrix algebra techniques this is needed by engineers for
practical applications.
To make the student knowledgeable in the area of infinite series and their
convergence so that he/ she will be familiar with limitations of using infinite series
approximations for solutions arising in mathematical modeling
To familiarize the student with functions of several variables which is needed in
many branches of engineering
To introduce the concepts of improper integrals, Gamma, Beta and Error
functions which are needed in engineering applications
To acquaint the student with mathematical tools needed in evaluating multiple
integrals and their usage
3
UNIT I MATRICES 9+3
Characteristic equation – Eigenvalues and Eigenvectors of a real matrix – Properties of
eigenvalues and eigenvectors – Cayley-Hamilton Theorem – Diagonalization of
matrices – Reduction of a quadratic form to canonical form by orthogonal transformation
– Nature of quadratic forms.
TEXT BOOKS
REFERENCES
1. Jain R.K. and Iyengar S.R.K., Advanced Engineering Mathematics (3rd Edition),
Narosa Publications, Delhi (2007).
2. Bali N., Goyal M. and Watkins C., Advanced Engineering Mathematics (7th Edition),
Firewall Media, New Delhi (2007).
3. Greenberg M.D., Advanced Engineering Mathematics (2nd Edition), Pearson
Education, New Delhi (1998).
4
PH 9111 ENGINEERING PHYSICS L T P C
(Common to ALL Branches of B.E. / B.Tech. Programmes) 3 0 0 3
OBJECTIVE:
To introduce the basic physics concepts relevant to different branches of Engineering
and Technology
TOTAL : 45 PERIODS
TEXT BOOKS:
1. Palanisamy, P.K., Engineering Physics, Scitech Publications (P) Lt, 2006.
5
2. Arumugam, M., Engineering Physics, Anuradha Publ., 2000.
REFERENCES:
1. Gaur R.K., and Gupta, S.L Engineering Physics, Dhanpat Raj Publ., 2003.
2. Sankar B.N., Pillai.S.O., Engineering Physics, New age International (P) Ltd, 2007
AIM:
To gain a sound knowledge of thermodynamics, phase rule, surface chemistry and
catalysis, basic organic reaction mechanisms and principles and applications of
spectroscopy and nanochemistry.
OBJECTIVES:
UNIT I THERMODYNAMICS 9
Statement of second law of thermodynamics – Clausius and Kelvin – definition of
entropy – entropy change for a reversible process – entropy change for flow of heat in
an irreversible process – entropy change for an isothermal expansion of an ideal gas –
problems – entropy of phase transitions- problems – definition of free energy and work
function – Gibbs Helmholtz equation – applications – problems – derivation of Maxwell
relations – van’t Hoff isotherm and isochore – applications – problems – chemical
potential – variation of chemical potential with temperature and pressure - significance.
UNIT V NANOCHEMISTRY 9
Introduction to nanochemistry – preparations and properties of nanomaterials - nanorods
– nanowires – nanotubes – carbon nanotubes and their applications – nanocomposites –
sensors and electronic devices – nanochemistry in biology and medicines –
nanocatalysis.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. Puri B.R., Sharma L.R. and Madhan S. Pathania, Principles of Physical Chemistry,
Shoban Lal Nagin Chand & Co. Jalandar –2000.
2. Jain P.C. and Renuka Jain, Physical Chemistry for Engineers, Dhanpet Rai &Sons,
New Delhi, 2001.
REFERENCES
1. Bahl B.S., Tuli G.D., and Arun Bahl, Essentials of Physical Chemistry, S. Chand
& Company Ltd., New Delhi, 2004.
2. Morrison R.T., & Boyd R.N., Organic chemistry, Prentice-Hall of India Private
Limited, New Delhi, 1992.
3. Sanyal S.N., Reactions, Rearrangements and Reagents Bharati Bhawan Publishers
& Distributors New Delhi, 2006.
4. G. B. Sergeev, Nanochemistry, Elsevier Science, New York, 2006
OBJECTIVES:
To develop in students the graphic skills that would enable them to communicate the
concepts, ideas and design of engineering products
To provide an exposure to the national/international standards related to technical
drawings
INTRODUCTION 2
Importance of graphics in engineering applications – use of drafting instruments – BIS
specifications and conventions – size, layout and folding of drawing sheets – lettering
and dimensioning
7
UNIT I FREE HAND SKETCHING OF ENGG OBJECTS AND
CONSTRUCTION OF PLANE CURVE 3+9=12
Pictorial representation of engineering objects – representation of three dimensional
objects in two dimensional media – need for multiple views – developing visualization
skills through free hand sketching of three dimensional objects.
Projection of simple solids like prism, pyramid, cylinder and cone when the axis is
inclined to one plane of projection –change of position & auxiliary projection methods-
sectioning of above solids in simple vertical positions by cutting plane inclined to one
reference plane and perpendicular to the other and above solids in inclined position with
cutting planes parallel to one reference plane – true shapes of sections
TEXT BOOKS
8
REFERENCES
1. There will be five questions one from each unit covering all units of the syllabus
2. All questions will carry equal marks of 20 each making a total of 100
3. Answer paper shall consist of drawing sheets of A3 size only. The students will be
permitted to use appropriate scale to fit solutions within A3 size
4. The examination will be conducted in appropriate sessions on the same day
OBJECTIVES:
UNIT I 9
Computer systems – Exploring computers – Inside the system – Processing data –
CPUs – Types of storage devices - Operating systems basics – Networking basics.
UNIT II 9
The internet and the WWW – Internet services – connecting to the internet - Working
with applications software – productivity software – graphics and multimedia – Data base
Management systems – Creating computer program.
9
UNIT III 9
C programming fundamentals – compilation process – variables – Data types –
Expressions – looping – decisions.
UNIT IV 9
Arrays - Working with functions – structures – character strings – pre processor.
UNIT V 9
Pointers – Dynamic memory allocation – linked list - Applications
TOTAL: 45 PERIODS
TEXT BOOKS
1. Peter Norton, “Introduction to Computers”, Sixth Edition, Tata McGraw Hill, 2007.
2. Stephen G. Kochan, “Programming in C”, Third Edition, Pearson Education, 2007.
REFERENCES
TOTAL: 30 PERIODS
10
CY9112 CHEMISTRY LABORATORY L T P C
(Common to all branches of Engineering and Technology) 0 0 2 1
2. WATER ANALYSIS
i) Determination of total hardness, temporary & permanent hardness of water
by EDTA method.
i) Determination of DO content by Winkler’s method.
ii) Determination of alkalinity in a water sample.
iii) Determination of chloride content of water sample by argentometric method.
3. PH-METRY
To find out the strength of given hydrochloric acid by sodium hydroxide.
4. CONDUCTOMETRY
i) Conductometric titration of mixture of acids
ii) Conductometric precipitation titration using BaCl2- Na2SO4
5. POTENTIOMETRY
i) Redox titration – Iron Vs. dichromate
6. SPECTROPHOTOMETRY
i) To determine max of a colored solution such as potassium permanganate.
ii) To determine the iron content of an unknown solution (1,10- phenanthroline/
thiocyanate method)
7. FLAME PHOTOMETRY
i) To determine sodium and potassium in water.
8. VISCOMETRY
i) Determination of molecular weight of a polymer
9. WATER POLLUTION
i) COD analysis of a waste water by dichromate method.
10. KINETICS
i) Determination of reaction rate constant of acid catalyzed hydrolysis of ester.
11. ADSORPTION
i) Adsorption of acetic acid on activated charcoal.
TOTAL: 30 PERIODS
11
REFERENCE BOOKS
OBJECTIVE
To provide exposure to the students with hands-on experience on various basic
engineering practices in Civil, Mechanical, Electrical and Electronics Engineering.
Plumbing
Basic pipe connections involving the fittings like valves, taps, coupling, unions,
reducers, elbows and other components used in household fittings. Preparation of
plumbing line sketches.
Practice in mixed pipe connections: Metal, plastic and flexible pipes used in
household appliances.
Wood Work
Sawing, planning and making common joints: T-Joint, Mortise and Tennon joint,
Dovetail joint.
Study
12
Preparation of wiring diagrams
Welding
Basic Machining
Demonstration on
TOTAL: 45 PERIODS
13
GE 9114 COMPUTER PRACTICE LABORATORY L T P C
(Common to all branches of B.E. / B.Tech. Programmes) 0 0 3 2
AIM:
The aim is to teach the use of computer applications related to office automation
and to teach implementation of C programs.
OBJECTIVES:
TOTAL: 45 PERIODS
14
HS 9161 TECHNICAL ENGLISH II L T P C
(For all branches of B.E. / B.Tech. Programmes) 2 0 2 3
AIM:
To help students specialising in the field of Engineering and Technology develop their
proficiency in oral and written communication in Technical English.
OBJECTIVES:
UNIT I 6
Word formation using prefixes ‘self’ – modified cloze – contextual meanings -
Sequencing words - future simple passive form - Predicting content – Intensive reading –
interpreting advertisements – Listening and completing table – Writing extended
definition – describing a process using sequence words – developing ideas into
paragraphs – writing about the future.
UNIT II 6
Identifying objects and their use – word puzzles using words with suffixes – Prepositions
– adverbs – structures that express purpose - adjectives – group discussion – Reading -
skimming for content and analysis of style – modes of non verbal communication –
Listening and categorising data in tables – Writing formal letter – writing paragraphs on
various issues.
UNIT III 6
Stress and intonation - Cause and effect expressions - Tense forms - simple past and
past continuous - Different grammatical forms of the same word - Critical reading -
guided note-making and evaluating content - Listening – guided note-taking –
completing a table – Role-play – group discussion techniques - discussing an issue –
offering suggestions – Sequencing jumbled sentences using coherence markers–
Writing a report – Writing recommendations – Writing a letter of complaint.
UNIT IV 6
Numerical adjectives - Prepositions – use of intensifying prefixes – phrasal verbs -
different grammatical forms of the same words – cloze exercise - Reading a text and
evaluating the content - advertisements – analysing style and language - Listening and
entering classified information – Intensive listening and completing the steps of a
process - Role-play - Group discussion expressing opinions and convincing (agreeing
and disagreeing) - Giving oral instructions – Descriptive writing - writing based on hints
– writing argumentative paragraphs – formal letter writing – letter of application with
biodata / CV Writing safety instructions - warnings and notices – preparing checklist –
email communication.
15
UNIT V 6
Identifying problems, their causes and finding solutions using case studies – creative
and critical thinking – levels of thinking – thinking strategies – brainstorming - analytical
reasoning skills – evaluative essay – decision making – conflict resolution
1. Listening: (10)
Recognising English sounds – accents - listening & answering questions - gap filling -
listening & note making - listening to telephonic conversations - listening to speeches.
2. Speaking: (10)
3. Reading: (5)
4. Writing: (5)
TOTAL : 60 PERIODS
TEXTBOOK
1. Department of Humanities & Social Sciences, Anna University. English for Engineers
and Technologists, Combined edition Vols. I & II. Chennai: Orient Longman, Pvt. Ltd.
2006, Themes 5 to 8 (for Units 1 – 4)
2. Sunita Mishra & C. Muralikrishna, Communication Skills for Engineers, Pearson
Education, Second Impression, 2007. ( for Unit 5)
REFERENCES
1. Ashraf, R.M, Effective Technical Communication, New Delhi: Tata McGraw Hill,
2007.
2. Thorpe, E & Thorpe, S, Objective English, New Delhi : Pearson Education, 2007.
3. Joan Van, Emden, A Handbook of writing for Engineers, Cambridge University
Press, 1997
4. Website: www.englishclub.com
LAB REQUIREMENTS
16
MA 9161 MATHEMATICS - II LTPC
(Common to all branches of B.E. / B.Tech Programmes) 310 4
AIM:
To introduce the effective mathematical tools needed for solving engineering problems
and to emphasize the underlying mathematical principles in specific situations
confronting practicing engineers.
OBJECTIVES:
17
transforms – Convolution theorem – Transform of periodic functions – Application to
solution of linear ordinary differential equations with constant coefficients.
TEXT BOOKS
1. Grewal, B.S. “Higher Engineering Mathematics”, Khanna Publications (2007)
2. Ramana, B.V. “Higher Engineering Mathematics” Tata McGraw Hill (2007).
REFERENCES
1. Glyn James, “Advanced Modern Engineering Mathematics, Pearson Education
(2007)
2. Jain R.K. and Iyengar S.R.K., Advanced Engineering Mathematics (3rd Edition)
Narosa Publications, Delhi (2007).
UNIT II SEMICONDUCTORS 9
Intrinsic semiconductors: energy band-diagram - direct and indirect band gap
semiconductors - carrier concentrations and conductivity - extrinsic semiconductors: n,
p-type doping, compensation doping - temperature dependence of conductivity -
degenerate and nondegenerate semiconductors - recombination and minority carrier
injection: direct and indirect recombination - minority carrier lifetime - diffusion and
conduction equations and random motion - continuity equation: time-dependent
continuity equation, steady-state continuity equation - optical absorption - Hall effect and
devices - Ohmic contacts - Schottky diode and solar cell.
18
UNIT III DISPLAY DEVICES 9
Photoluminescence, cathodoluminescence, electroluminescence, injection luminescence
– plasma displays - LED construction and working – organic LEDs – principles of
quantum well laser – liquid crystals and LCD construction and working – numeric
displays
TOTAL : 45 PERIODS
TEXT BOOKS
1. Palanisamy, P.K., Materials Science for Electronics Engineers, SCITECH, 2005.
2. Arumugam, M., Materials Science, Anirutha Publ., 2002.
REFERENCES
1. Jasprit Singh, Optoelectronics: An introduction to Materials and Devices, McGraw
Hill, 1998.
2. Wilson, J and Hawkes, J.F.B, Optoelectronics, Printice Hall, 2002
3. Bhattacharya, B., Semiconductor optoelectronic devices, Printice Hall of India, 1995.
4. Kittel, C., Introduction to Solid State Physics, John Wiley, 1996
5. Kasap, S.O. Principles of Electronic Materials and Devices, Tata McGraw-Hill, 2007.
OBJECTIVE:
At the end of this course the student should be able to understand the vectorial and
scalar representation of forces and moments, static equilibrium of particles and rigid
bodies both in two dimensions and also in three dimensions. Further, the student should
understand the principle of work and energy. The student should be able to comprehend
the effect of friction on equilibrium. The student should be able to understand the laws of
motion, the kinematics of motion and the interrelationship. The student should also be
19
able to write the dynamic equilibrium equation. All these should be achieved both
conceptually and through solved examples.
TEXT BOOK
1. Beer,F.P and Johnson Jr. E.R, “Vector Mechanics for Engineers”, Vol. 1 Statics and
Vol. 2 Dynamics, McGraw-Hill International Edition, 2007.
REFERENCES
20
4. J.L. Meriam & L.G. Kraige, Engineering Mechanics Vol. I & Vol. II, V edition, John
Wiley & Sons, 2006.
5. P. Boresi & J. Schmidt, Engineering Mechanics Statics & Dynamics, Micro Print Pvt.
Ltec., Chennai, 2004.
OBJECTIVES:
UNIT I 8
Pr ogramming Style: Names – Expressions and Statements – Consistency and Idioms –
Function Macros – Magic Numbers – Comments – Review of C Programming: Types,
Operators and Expressions – Control Flow – Functions and Program Structure
UNIT II 8
C Programming: Pointers and Arrays – Structures – Input and Output - Files –
Preprocessor.
UNIT III 10
Lists, Stacks, and Queues: Abstract Data Types (ADTs) – List ADT – Stack ADT –
Queue ADT
UNIT IV 9
Trees: Preliminaries – Binary Trees – Search Tree ADT – Binary Search Trees –
Hashing: ADT – Hash Function – Separate Chaining – Open Addressing – Rehashing –
Extendible Hashing
UNIT V 10
Sorting: Insertion Sort – Shell Sort – Heap Sort – Merge Sort – Quick Sort – External
Sorting
TOTAL: 45 PERIODS
TEXT BOOKS
1. Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, 2 nd ed.,
Pearson Education, 1988. (Units 1 and 2)
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed., Pearson
Education, 1997. (Units 3, 4, 5)
21
REFERENCES
1. Brian W. Kernighan and Robert Pike, “The Practice of Programming”, Pearson
Education, 1999.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,
1983.
3. Stephen G. Kochan, “Programming in C”, 3rd ed., Pearson Education, 2005.
4. Herbert Schildt, “C: The Complete Reference”, 4th ed., Tata McGraw-Hill, 2000.
5. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein, “Data Structures
using C”, Pearson Education, 1998.
6. Robert Kruse, C.L. Tondo, Bruce Leung, “Data Structures,Program Design in C”, 2 nd
ed., Pearson Education, 1997.
AIM :
To provide an understanding of the fundamentals of digital logic and digital circuit design
OBJECTIVES :
To understand Boolean algebra, Boolean functions and realization of functions
with basic gates.
To design combinational and sequential circuits.
To design circuits with MSI devices.
To learn the use of HDL for designing larger systems.
L: 45 + T: 15 TOTAL : 60 PERIODS
22
TEXT BOOK
1. M. Morris Mano, “Digital Design”, IV edition, Pearson Education, 2006.
REFERENCES
1. Charles H.Roth Jr, “Fundamentals of Logic Design”, V edition – Jaico Publishing
House, Mumbai,2003.
2. Donald D. Givone, “Digital Principles and Design”, Tata MCGraw Hill, 2003.
TOTAL: 45 PERIODS
AIM:
OBJECTIVES :
Shift –registers
Synchronous and asynchronous counters
24
UNIVERSITY DEPARTMENTS
ANNA UNIVERSITY CHENNAI :: CHENNAI 600 025
REGULATIONS – 2008
CURRICULUM FROM III TO VIII SEMESTERS FOR
B.E. COMPUTER SCIENCE AND ENGINEERING
SEMESTER III
CODE NO COURSE TITLE L T P C
THEORY
MA9211 Mathematics III 3 1 0 4
EC9213 Electronic Devices and Circuits 3 0 0 3
CS9201 Design and Analysis of Algorithms 3 0 0 3
CS9202 Database Management Systems 3 0 0 3
CS9203 Programming and Data Structures II 3 0 0 3
CS9204 Computer Architecture 3 1 0 4
PRACTICAL
CS9205 Database Management Systems Laboratory 0 0 3 2
CS9206 Programming and Data Structures Laboratory II 0 0 3 2
CS9207 Algorithms Laboratory 0 0 3 2
TOTAL 18 2 9 26
SEMESTER IV
CODE NO COURSE TITLE L T P C
THEORY
EE9262 Electrical Engineering and Control Systems 3 0 0 3
CS9251 Microprocessors and Micro controllers 3 0 0 3
CS9252 Operating Systems 3 0 0 3
CS9253 Web Technology 3 0 0 3
MA9265 Discrete Mathematics 3 1 0 4
CS 9254 Software Engineering 3 0 0 3
PRACTICAL
CS9255 Microprocessors Laboratory 0 0 3 2
CS9256 Web Technology Laboratory 0 0 3 2
CS9257 Operating Systems Laboratory 0 0 3 2
TOTAL 18 1 9 25
SEMESTER V
CODE NO COURSE TITLE L T P C
THEORY
CS9301 Object Oriented Analysis and Design 3 0 0 3
CS9302 Theory of Computation 3 0 0 3
CS9303 System Software Internals 3 0 0 3
CS9304 Artificial Intelligence 3 0 0 3
CS9305 Data Communication and Computer Networks 3 1 0 4
Elective I 3 0 0 3
PRACTICAL
CS9306 Computer Networks Laboratory 0 0 3 2
CS9307 Case Tools Laboratory 0 0 3 2
GE9371 Communication Skills and Soft Skills lab 0 0 2 1
TOTAL 18 1 8 24
1
SEMESTER VI
SEMESTER VII
SEMESTER VIII
2
LIST OF ELECTIVES FOR B.E. COMPUTER SCIENCE AND ENGINEERING
SEMESTER V
CODE NO COURSE TITLE L T P C
IT9304 Distributed Systems 3 0 0 3
CS9022 Internet Programming 3 0 0 3
CS9023 UNIX Internals 3 0 0 3
CS9024 Advanced Database Technology 3 0 0 3
SEMESTER VI
CODE NO COURSE TITLE L T P C
CS9025 Software Requirements Management 3 0 0 3
CS9026 Software Design and Architecture 3 0 0 3
CS9027 Data Warehousing and Data Mining 3 0 0 3
CS9028 Middleware Technologies 3 0 0 3
CS9029 .Net and C# programming 3 0 0 3
CS9030 Digital Image Processing 3 0 0 3
CS9031 Cyber Forensics 3 0 0 3
CS9032 Graph Theory 3 0 0 3
CS9033 Advanced Computer Architecture 3 0 0 3
CS9034 TCP/IP Design and implementation 3 0 0 3
CS9035 Free/Open Source Software 3 0 0 3
SEMESTER VII
CODE NO COURSE TITLE L T P C
CS9036 Soft Computing 3 0 0 3
CS9037 Knowledge Management 3 0 0 3
CS9038 Database Tuning 3 0 0 3
CS9039 Grid Computing 3 0 0 3
CS9040 Language Technologies 3 0 0 3
CS9041 Visualization Techniques 3 0 0 3
CS9042 Software Project Management 3 0 0 3
CS9043 Multi-core Programming 3 0 0 3
EC9073 Bio Informatics 3 0 0 3
IT 9401 Software Testing 3 0 0 3
IT9351 Service Oriented Architecture 3 0 0 3
CS9046 System Modelling and Simulation 3 0 0 3
CS9047 Adhoc and Sensor Networks 3 0 0 3
CS9048 Embedded Systems 3 0 0 3
CS9049 Programming In .Net 3 0 0 3
CS9050 Routers and Network Processors 3 0 0 3
SEMESTER VIII
CODE NO COURSE TITLE L T P C
CS9071 High Speed Networks 3 0 0 3
CS9072 Semantic Web 3 0 0 3
CS9073 Scientific Computing Techniques 3 0 0 3
CS9074 Software Agents 3 0 0 3
CS9075 Network Analysis and Management 3 0 0 3
CS9077 Real Time Systems 3 0 0 3
GE9022 Total Quality Management 3 0 0 3
GE9021 Professional Ethics in Engineering 3 0 0 3
GE9023 Fundamentals of Nanoscience 3 0 0 3
3
MA 9211 MATHEMATICS III LTPC
(Common to all branches of BE / B.Tech Programmes) 31 0 4
AIM:
To facilitate the understanding of the principles and to cultivate the art of formulating
physical problems in the language of mathematics.
OBJECTIVES:
To introduce Fourier series analysis which is central to many applications in
engineering apart from its use in solving boundary value problems
To acquaint the student with Fourier transform techniques used in wide variety of
situations in which the functions used are not periodic
To introduce the effective mathematical tools for the solutions of partial differential
equations that model physical processes
To develop Z- transform techniques which will perform the same task for discrete time
systems as Laplace Transform, a valuable aid in analysis of continuous time systems
REFERENCES:
1. Glyn James, “Advanced Modern Engineering Mathematics”, Pearson Education
(2007)
2. Ramana B.V., “Higher Engineering Mathematics” Tata McGraw Hill (2007).
3. Bali N.P. and Manish Goyal, “A Text Book of Engineering” 7th Edition (2007) Lakshmi
Publications (P) Limited, New Delhi.
4
EC 9213 ELECTRONIC DEVICES AND CIRCUITS LTPC
30 03
AIM:
The aim of this is to introduce the concept of Circuit theory, Electronic Devices and their
applications.
REFERENCES:
1. Denal A.Neamar, “Electronic Circuit Analysis and Design”, Second Edition, Tata
MCGraw Hill, 2002.
2. Adel S.Sedia Keanath “C with Micro Electronic Circuit”-Fourth Edition-Oxford
University Press-1998.
OBJECTIVES:
To introduce the basic concepts of algorithm analysis
To introduce the design paradigms for algorithm design
To introduce the basic complexity theory.
5
UNIT I PRELIMINARIES 9
The Role of Algorithms in Computing-Getting Started-Growth of Functions –
Recurrences-The Substitution Method- The Recurrence Tree Method-The Master
Method -Probabilistic Analysis and Randomized Algorithms-The Hiring Problem-
Random Variables-Randomized Algorithms
UNIT IV APPLICATIONS 9
Linear Programming-Standard and slack forms-Formulating problems-Simplex
algorithm-Duality-Initial basic feasible solution - String Matching-Naive string matching
algorithm-Knuth-Morris-Pratt algorithm.
UNIT V NP PROBLEMS 9
NP-completeness-Polynomial time-Polynomial-time verification-NP-completeness and
reducibility-NP-completeness proofs - NP-completeness problems. Approximation
Algorithms-The vertex-cover problem-The traveling-salesman problem.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, Cliford Stein,
“Introduction to Algorithms”, Second Edition, Prentice Hall of India, 2007.
REFERENCES:
1. Jon Kleinberg, Eva Tardos, “Algorithm Design”, Pearson Education, 2006.
2. Michael T. Goodrich, Toberto Tamassisa, “ Algorithm Design: Foundations, Analysis
and Internet Examples”, Wiley Student Edition, 2007.
3. Anany Levitin, “Introduction to Design and Analysis of Algorithms”, Pearson
Education, 2003.
6
OBJECTIVES:
To learn the fundamentals of data models and to conceptualize and depict a
database system using ER diagram.
To make a study of SQL and relational database design.
To understand the internal storage structures using different file and indexing
techniques which will help in physical DB design.
To know the fundamental concepts of transaction processing- concurrency control
techniques and recovery procedure.
To have an introductory knowledge about the Storage and Query processing
techniques
UNIT I INTRODUCTION 9
Purpose of Database System -– Views of data – Data Models – Database Languages ––
Database System Architecture – Database users and Administrator – Entity–
Relationship model – E-R Diagrams -- Introduction to relational databases
UNIT IV TRANSACTIONS 9
Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery –
Media Recovery – Two Phase Commit - Save Points – SQL Facilities for recovery –
Concurrency – Need for Concurrency – Locking Protocols – Two Phase Locking –
Intent Locking – Deadlock- Serializability – Recovery Isolation Levels – SQL Facilities
for Concurrency.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database SystemConcepts”,
Fifth Edition, Tata McGraw Hill, 2006.
2. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database
Systems”, Eighth Edition, Pearson Education, 2006.
7
REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”,
FourthEdition , Pearson / Addision wesley, 2007.
2. Raghu Ramakrishnan, “Database Management Systems”, Third Edition, McGraw
Hill, 2003.
3. S.K.Singh, “Database Systems Concepts, Design and Applications”, First Edition,
Pearson Education, 2006.
AIM:
The aim is to introduce the concept of Object Oriented Programming and analyse the
implementation of Advanced Data Structures using Object Oriented Programming
Language.
OBJECTIVES:
To introduce the concepts of Object Oriented Programming language.
To introduce the concepts of Templates and Error Handling.
To introduce the concepts of Advanced Data Structures.
UNIT II INHERITANCE 9
Type Conversion Operators – Friends – Large Objects – Essential Operators –
Subscripting – Function Call – Dereferencing – Increment and Decrement – String Class
– Derived Classes – Abstract Classes – Design of Class Hierarchies
8
UNIT V SET AND GRAPHS 9
Disjoint Set ADT – Graph Algorithms – Topological Sort – Shortest-Path Algorithm –
Network Flow Problems – Minimum Spanning Tree – Applications of Depth-First Search
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Bjarne Stroustrup, “The C++ Programming Language”, 3 rd ed., Pearson Education,
2007.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 2 nd ed.,
Pearson Education, 2005.
REFERENCES:
1. Ira Pohl, “Object-Oriented Programming using C++”, 2nd ed., Pearson Education,
1997.
2. Goodrich, Michael T., Roberto Tamassia, David Mount. “Data Structures and
Algorithms in C++”. 7th edition, Wiley, 2004.
AIM:
To understand the organization of a computer, and the hardware-software interface.
OBJECTIVES:
To know about the various components of a computer and their internals.
To comprehend the importance of the hardware-software interface, and instruction-
set architecture.
To understand the architectural features of superscalar processors.
9
UNIT IV MEMORY SYSTEM 9+3
Basic concepts – Semiconductor RAM – ROM – Speed – Size and cost – Cache
memories – Improving cache performance – Virtual memory – Memory management
requirements – Associative memories – Secondary storage devices.
UNIT V I/O ORGANIZATION 9+3
Accessing I/O devices – Programmed Input/Output -Interrupts – Direct Memory Access
– Buses – Interface circuits – Standard I/O Interfaces (PCI, SCSI, USB), I/O devices and
processors.
L: 45, T: 15, TOTAL = 60 PERIODS
TEXT BOOKS:
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, “Computer Organization”, Fifth
Edition, Tata McGraw Hill, 2002.
2. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The
Hardware/Software interface”, Third Edition, Elsevier, 2005.
REFERENCES:
1. William Stallings, “Computer Organization and Architecture – Designing for
Performance”, Sixth Edition, Pearson Education, 2003.
2. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata
McGraw Hill, 1998.
3. V.P. Heuring, H.F. Jordan, “Computer Systems Design and Architecture”, Second
Edition, Pearson Education, 2004.
4. Behrooz Parhami, “Computer Architecture”, Oxford University Press, 2007.
AIM:
To implement different data structures and their algorithms for storing, accessing and
manipulating data using an object oriented programming language.
OBJECTIVES:
To implement the concepts of object oriented programming.
To implement different data structures using object oriented programming language.
To use standard template library in the implementation of standard data structures.
5. Operator Overloading.
6. Templates.
8. AVL Tree.
9. Splay Tree.
10. B Tree.
TOTAL: 45 PERIODS
11
CS 9207 ALGORITHMS LABORATORY LTPC
0 032
AIM:
To understand the running time of algorithms.
OBJECTIVES:
To understand the need for analyzing algorithms.
To understand that algorithms execution speed cannot be expressed as a fixed time
quantity.
To know the ways of estimating time speed for different algorithms
To study about applications of the different algorithms.
To know about the various tools available for analyzing algorithms.
TOTAL: 45 PERIODS
OBJECTIVES:
To impart knowledge on Network theorems.
Principle of electrical machines.
Different system representation, block diagram reduction and Mason’s rule.
Time response analysis of LTI systems and steady state error.
State variable analysis.
12
UNIT I ELECTRIC CIRCUITS 9
Dependent and independent sources – Kirchoff’s laws – mesh current and node voltage
methods – theorems – Thevenin’s – Norton’s - superposition - maximum power transfer-
Phasors – sinusoidal steady state response of simple RLC circuits.
REFERENCES:
1. Vincent Del Toro, “Electrical Engineering Fundamentals”, 2nd Edition, Prentice-Hall,
(Pearson Education Inc.), 2007
2. John Bird, “Electrical and Electronics Principles and Technology”, 3rd Edition,
Elsevier, New Delhi.
3. Joseph J. Distefano, Allen R. Stubberud, Iran J.Williams, “Feedback and Control
Systems”, 2nd Edition, Tata McGraw Hill, New Delhi, 2007.
13
CS 9251 MICROPROCESSORS AND MICROCONTROLLERS LTPC
3 003
AIM:
To have an in depth knowledge of the architecture and programming of 8-bit and 16-
bit Microprocessors, Microcontrollers and to study how to interface various peripheral
devices with them.
OBJECTIVES:
To study the basic architectures and operational features of the processors and
controllers
To learn the assembly language programming
To design and understand the multiprocessor configurations
To understand the interfacing concepts of the peripheral devices with that of the
processors
UNIT V MICROCONTROLLERS 9
Architecture of 8051 microcontroller – Signals – Operational features – Memory and I/O
addressing – Interrupts – Instruction set – System design using microcontrollers.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Ramesh S. Gaonkar, “Microprocessor – Architecture, Programming and
Applications with the 8085”, Fifth Edition, Prentice Hall.,2002.
2. Yu-cheng Liu, Glenn A. Gibson, “Microcomputer systems: The 8086 / 8088 Family
architecture, Programming and Design”, Second edition, Prentice Hall of India,
2006.
3. Mohamed Ali Mazidi, Janice Gillispie Mazidi, “The 8051 microcontroller and
embedded systems using Assembly and C”, Second Edition, Pearson Education /
Prentice Hall of India, 2007.
14
REFERENCES:
1. Barry B. Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286, 80386,
80486, Pentium, PentiumPro Processor, PentiumII, PentiumIII, PentiumIV,
Architecture, Programming & Interfacing”, Seventh Edition, Pearson Education /
Prentice Hall of India, 2007.
2. Douglas V. Hall, “Microprocessors and Interfacing: Programming and Hardware”,
Second edition, Tata Mc Graw Hill, 2006.
3. A.K. Ray & K. M. Bhurchandi, “Advanced Microprocessors and peripherals –
Architectures, Programming and Interfacing”, Tata Mc Graw Hill, 2006.
4. Peter Abel, “IBM PC Assembly language and programming”, Fifth edition, Pearson
Education / Prentice Hall of India Pvt. Ltd,2007 .
AIM:
The course introduces the students to the basic principles of operating systems.
OBJECTIVES:
To be aware of the evolution of operating systems
To learn what processes are, how processes communicate, how process
synchronization is done and how to manage processes
To have an understanding of the main memory and secondary memory management
techniques.
To understand the I/O Subsystem
To have an exposure to Linux and Windows 2000 operating systems
15
UNIT III STORAGE MANAGEMENT 9
Memory Management – Swapping – Contiguous memory allocation – Paging –
Segmentation – Segmentation with paging. Virtual Memory: Background – Demand
paging – Process creation – Page replacement – Allocation of frames – Thrashing.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Silberschatz, Galvin and Gagne, “Operating System Concepts”, Sixth Edition, John
Wiley & Sons Inc 2003.
REFERENCES:
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison
Wesley, 2001.
2. Gary Nutt, “Operating Systems”, Second Edition, Addison Wesley, 2003.
3. H M Deital, P J Deital and D R Choffnes, “Operating Systems”, Pearson Education,
2004.
OBJECTIVES:
To introduce the features of object oriented programming languages using Java
To design and create user interfaces using Java frames and applets
To have a basic idea about network programming using Java
To create simple Web pages and provide client side validation
To create dynamic web pages using server side scripting
16
UNIT II JAVA IO AND NETWORKING 9
I/O – AWT – Event handling – Introduction to Threads - Basics of Networking –TCP and
UDP sockets – Connecting to the Web
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Deitel and Deitel, “Java – How to program”, 3rd ed., Pearson Education, 2001.
2. Robert W. Sebesta, “Programming the World Wide Web”, 3 rd ed., Pearson
Education, 2006.
REFERENCES:
1. Herbert Schildt, “Java – The Complete Reference”, 7th ed., Tata McGraw Hill,
2007.
2. Chris Bates, “Web Programming”, 3rd ed., Wiley, 2006.
3. Black Book, “Java 6 Programming”, Dreamtech Press, 2007.
4. Deitel, “Java How to Program”, Pearson Education, 2003.
5. W Clay Richardson, et al, “Professional Java JDK 6 Edition”, Wrox, 2007.
OBJECTIVES:
At the end of the course, students would
Have knowledge of the concepts needed to test the logic of a program.
Have an understanding in identifying structures on many levels.
Be aware of a class of functions which transform a finite set into another finite set
which relates to input output functions in computer science.
Be aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as semi
groups, monoids and groups.
17
UNIT I LOGIC AND PROOFS 9
Propositional Logic – Propositional equivalences-Predicates and quantifiers – Nested
Quantifiers – Rules of inference-introduction to proofs – proof methods and strategy.
UNIT II COMBINATORICS 9
Mathematical induction – Strong induction and well ordering – The basics of counting -
The pigeonhole principle – Permutations and combinations – Recurrence relations-
Solving linear recurrence relations-generating functions – Inclusion and exclusion and
applications.
[
UNIT III GRAPHS 9
Graphs and graph models – Graph terminology and special types of graphs - presenting
graphs and graph isomorphism – connectivity – Euler and Hamilton paths.
REFERENCES
1. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied
Introduction”, Fourth Edition, Pearson Education Asia, Delhi, (2002).
2. Thomas Koshy, ”Discrete Mathematics with Applications”, Elsevier Publications,
(2006).
3. Seymour Lipschutz and Mark Lipson, ”Discrete Mathematics”, Schaum’s Outlines,
Tata McGraw – Hill Pub. Co. Ltd., New Delhi, 2007,Second edition, Fifth reprint,
(2007).
OBJECTIVES:
To be aware of generic models to structure the software development process.
To understand fundamental concepts of requirements engineering and requirements
specification.
To understand different notion of complexity at both the module and system level.
To be aware of some widely known design methods.
To understand the role and contents of testing activities in different life cycle phases.
18
UNIT I SOFTWARE PROCESS MODELS 9
The Evolving role of Software – Software – The changing Nature of Software – Legacy
software ––A generic view of process– A layered Technology – A Process Framework –
The Capability Maturity Model Integration (CMMI) – Process Assessment – Personal
and Team Process Models - Product and Process - Process Models – The Waterfall
Model – Incremental Process Models – Incremental Model – The RAD Model –
Evolutionary Process Models – Prototyping – The Spiral Model – The Concurrent
Development Model – Specialized Process Models – the Unified Process.
UNIT II REQUIREMENTS ENGINEERING 9
Software Engineering Practice – communication Practice – Planning practice Modeling
practice– Construction Practice –Deployment - Requirements Engineering -
Requirements Engineering tasks – Initiating the requirements Engineering Process-
Eliciting Requirements – Developing Use cases – Building the Analysis Models –
Elements of the Analysis Model – Analysis pattern – Negotiating Requirements –
Validating Requirements.
REFERENCES:
1. Stephan Schach, “Software Engineering”, Tata McGraw Hill, 2007
2. Pfleeger and Lawrence “Software Engineering: Theory and Practice”, Pearson
Education, second edition, 2001
OBJECTIVES:
To implement the assembly language programming in 8085,8086 and 8051
To study the system function calls like BIOS/DOS.
To experiment the interface concepts of various peripheral device with the processor
19
EXPERIMENTS IN THE FOLLOWING:
1. Programming with 8085 – 2 Experiments.
2. Programming with 8086 – 3 Experiments including BIOS/DOS Calls: Keyboard
Control, Display, File Manipulation.
3. Interfacing with 8085/8086-8255, 8253.
4. Interfacing with 8085/8086-8279, 8251.
5. 8051 Micro controller based experiments – assembly language programs.
6. 8051 Micro controller based experiments – control applications.
7. Mini – Project.
TOTAL: 45 PERIODS
OBJECTIVES:
To write simple programs using Java.
To design and create user interfaces using Java frames and applets.
To write I/O and network related programs using Java.
To create simple Web pages and provide client side validation.
To create dynamic web pages using server side scripting.
TOTAL: 45 PERIODS
20
CS 9257 OPERATING SYSTEMS LABORATORY LT PC
0 0 3 2
AIM:
To have hands-on experience in operating system concepts and programming in the
UNIX environment.
OBJECTIVES:
To learn shell programming and the use of filters in the UNIX environment.
To learn to program in C using system calls.
To learn to use the file system related system calls.
To have a knowledge in how processes are created and processes communicate.
To learn how process synchronization is done using semaphores.
EXPERIMENTS IN THE FOLLOWING:
1. Basic UNIX commands.
2. Shell Programming.
3. Grep, sed, awk.
4. File system related system calls.
5. Process management – Fork, Exec.
6. Message queues.
7. Pipes, FIFOs.
8. Signals.
9. Shared memory.
10. Semaphores.
TOTAL: 45 PERIODS
OBJECTIVES:
To study the concepts of modelling in object oriented context.
To learn about the Object Constraint Language.
To study and learn how to apply analysis techniques and methodologies including
Use cases, System Sequence Diagrams.
To study and learn how to apply design techniques and methodologies including
Interaction Diagrams, Class Diagrams.
To study implementation related issues.
To study and learn how to apply advanced techniques including Architectural Analysis
and Design Patterns.
UNIT I INTRODUCTION 8
Introduction – Modelling as a design technique – UML diagrams - Class modeling –
Object Constraint Language – State modeling – Interaction Modeling
21
UNIT II OVERVIEW OF USECASES 9
Inception – Evolutionary Requirements – Use Cases – Other Requirements – Domain
Models – System Sequence Diagrams – Operation Contracts
UNIT IV MAPPING 8
Mapping designs to code – Test Driven development and refactoring – UML Tools and
UML as blueprint
UNIT V PATTERNS 10
More Patterns – Analysis update – Objects with responsibilities – Applying design
patterns – Architectural Analysis – Logical Architecture Refinement – Package Design –
Persistence framework with patterns
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Michael Blaha and James Rumbaugh, “Object-oriented modeling and design with
UML”, Prentice-Hall of India, 2005. (Unit 1)
2. Craig Larman. “Applying UML and Patterns – An introduction to Object-Oriented
Analysis and Design and Iterative Development”, 3rd ed, Pearson Education, 2005.
REFERENCES:
1. Booch, Grady,”Object Oriented Analysis and Design”, 2 nd ed. Pearson Education.
2000.
2. Ali Bahrami, “Object Oriented Systems Development”, McGraw-Hill, 1999.
3. Fowler, Martin. UML Distilled. 3rd ed. Pearson Education. 2004.
4. Lunn, Ken, “Software development with UML”,Palgrave Macmillan. 2003.
5. O’Docherty, Mike,”Object-Oriented Analysis & Design”,Wiley. 2005.
AIM:
To have foundation on automata languages and grammar.
OBJECTIVES:
Develop the concepts and skills necessary to be able to evaluate the compatibility
and undecidability.
UNIT I AUTOMATA 9
Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite
Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite
Automata (NFA) – Finite Automata with Epsilon transitions.
22
UNIT III CONTEXT-FREE GRAMMARS AND LANGUAGES 9
Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages –
Definition of the Pushdown automata – Languages of a Pushdown Automata –
Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata.
UNIT V UNDECIDABILITY 9
A language that is not Recursively Enumerable (RE) – An undecidable problem that is
RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem –
The classes P and NP.
TOTAL: 45 PERIODS
TEXT BOOK
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computations”, second Edition, Pearson Education, 2003.
REFERENCES:
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”,
Second Edition, Pearson Education, 2003.
2. J. Martin, “Introduction to Languages and the Theory of Computation”, Third Edition,
Tata Mc Graw Hill, 2003.
3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole,
1997.
OBJECTIVES
To study the design and implementation issues in implementing assemblers.
To study the role of linkers and loaders and the interaction with hardware.
To study how macroprocessors work, and a brief introduction to compilers.
To study various issues in the design of Virtual Machines
To study the techniques used in other system software contexts such as emulators,
process virtual machines, profiling, migration and grids.
UNIT I ASSEMBLERS 9
Review of Computer Architecture – Machine Instructions and Programs – Assemblers –
Basic Assembler Functions – Assembler Features – Assembler Design Options
23
UNIT III MACROPROCESSORS AND COMPILERS 8
Macroprocessors – Basic Macro Processor Functions – Machine-Independent Macro
Processor Features – Macro Processor Design Options – Basic Compiler Functions –
Grammars – Lexical Analysis – Syntactic Analysis – Code Generation
REFERENCES:
1. Alfred V Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers”, Pearson Education, 1986.
2. Robert W. Sebesta, “Concepts of Programming Languages”, 7 th ed., Pearson
Education, 2006.
3. Terrance W Pratt, Marvin V Zelkowitz, T V Gopal, “Programming Languages”, 4th
ed., Pearson Education, 2006.
4. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “Computer Organization”, 5 th ed.,
McGraw Hill, 2002.
5. Silberschatz, Galvin, Gagne, “Operating System Concepts”, 6 th ed., Wiley, 2003.
OBJECTIVES:
To be familiar with the history of AI, philosophical debates, and be able to discuss
the potential and limitations of the subject in its current form.
To identify the kind of problems that can be solved using AI technique: to know the
relation between AI and other areas of computer science.
To have knowledge of generic problem-solving methods in AI.
To understand the basic techniques of knowledge representation and their use.
To know what the basic components of an intelligent agent are, and how this relates
to other advanced subjects such as information retrieval, database systems,
computer vision, robotics, human-computer interaction, reactive systems etc.
To be able to implement basic decision making algorithms, including search-based
problem solving techniques, and first-order logic.
24
To know the basic issues in machine learning, and be able to apply straightforward
techniques to learn from observed data.
To be able to explain the difficulty of computer perception with examples from
different modalities, and be able to show how perception affects intelligent systems
design.
UNIT I INTRODUCTION 9
Intelligent Agents –Environments – Behavior – Structure – Artificial Intelligence –
Present and Future - Problem Solving –agents – examples– uninformed search
strategies – Avoiding repeated states – searching with partial information.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Second
Edition, Pearson Education, 2004.
REFERENCES:
1. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd.,
2000.
2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Second Edition, Tata McGraw
Hill, 2003.
3. George F. Luger, “Artificial Intelligence-Structures And Strategies For Complex
Problem Solving”, Pearson Education, 2002.
25
CS 9305 DATA COMMUNICATION AND COMPUTER NETWORKS LT PC
310 4
AIM :
To understand the concepts of data communication and computer networks
OBJECTIVES:
To grasp the principles of data communication.
To understand the layering concepts in computer networks.
To understand the functions of each layer.
To have knowledge in different applications that use computer networks.
REFERENCES:
1. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007.
2. Douglas E. Comer, “Computer Networks and Internets with Internet Applications”,
Fourth Edition, Pearson Education, 2003.
3. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, Pearson Education,
2003.
4. Wayne Tomasi, “Introduction to Data Communications and Networking”, Pearson
Education, First Edition, 2002.
26
CS 9306 COMPUTER NETWORKS LABORATORY LTPC
00 3 2
AIM:
To have hands-on experience in network programming and to use simulation tools to
analyse network protocols.
OBJECTIVES:
To learn socket programming.
To use simulation tools.
To analyse the performance of protocols in different layers in computer networks
using simulation tools.
EXPERIMENTS IN THE FOLLOWING
1. Applications using TCP Sockets like
a. Echo client and echo server.
b. File transfer.
c. Remote command execution.
d. Chat.
e. Concurrent server.
2. Applications using UDP Sockets like
a. DNS.
b. SNMP.
4. RPC
TOTAL: 45 PERIODS
AIM:
Scope of this lab is to understand the application of case tools, which focuses on the
software engineering activities.
OBJECTIVES:
• Software requirements analysis and specification
• Software design
• Software implementation
• Software testing and maintenance
• Communication skills and teamwork
• Modeling techniques and CASE tools
• Software project planning and management
27
EXPERIMENTS IN THE FOLLOWING TOPICS
1. Study of case tools such as rational rose or equivalent tools.
2. Requirements
Implementation of requirements engineering activities such as elicitation,
validation, management using case tools
4. Analysis and design
Implementation of analysis and design using case tools.
5. Study and usage of software project management tools for cost estimation and
scheduling
6. Documentation generators - Study and practice of Documentation generators.
7. Data modeling using automated tools.
8. Practice reverse engineering and re engineering using tools.
9. Exposure towards test plan generators, test case generators, test coverage and
software metrics.
10. Meta modeling and software life cycle management.
TOTAL: 45 PERIODS
AIM
To enhance the overall capability of students and to equip them with the necessary
Communication Skills and Soft Skills that would help them excel in their profession.
OBJECTIVES
To equip students of engineering and technology with effective speaking and listening
skills in English.
To help them develop their soft skills and interpersonal skills, which will make the
transition from college to workplace smoother and help them excel in their jobs.
To enhance the performance of students at Placement Interviews, Group Discussions
and other recruitment exercises.
2. Presentation skills 1
Elements of effective presentation – Structure of presentation - Presentation tools
– Body language.
3. Soft Skills
Time management – Stress management – Assertiveness – Negotiation strategies.
28
4. Group Discussion 1
Group discussion as part of selection process, Structure of group discussion –
Strategies in group discussion – Mock group discussions.
5. Interview Skills 1
Kinds of interviews – Interview techniques – Corporate culture – Mock interviews.
(Career Lab Software may be used for this section).
Note: Career Lab software may be used to learn the skills, to be applied in the
practice session.
TOTAL : 30 PERIODS
REFERENCES
1. Anderson, P.V, “Technical Communication”, Thomson Wadsworth, Sixth Edition,
New Delhi, 2007.
2. Prakash P, “Verbal and Non-Verbal Reasoning”, Macmillan India Ltd., Second
Edition, New Delhi, 2004.
3. John Seely, “The Oxford Guide to Writing and Speaking”, Oxford University Press,
New Delhi 2004.
4. David Evans, “Decisionmaker”, Cambridge University Press, 1997.
5. Thorpe, E and Thorpe, “S Objective English”, Pearson Education,
Second Edition, New Delhi 2007.
6. Turton, N.D and Heaton, J.B, “Dictionary of Common Errors”, Addision Wesley
Longman Ltd., Indian reprint 1998.
AIM
To provide the required mathematical support in real life problems and develop
probabilistic models which can be used in several areas of science and engineering.
OBJECTIVES
The students will have a fundamental knowledge of the probability concepts.
Acquire skills in analyzing queueing models.
It also helps to understand and characterize phenomenon which evolve with respect
to time in a probabilistic manner.
29
UNIT I RANDOM VARIABLES 9+3
Discrete and Continuous random variables – Moments – Moment generating functions –
Binomial, Poisson, Geometric, Uniform, Exponential, Gamma, Weibull and Normal
distributions - Functions of a random variable.
REFERENCES
1. Allen, A.O., “Probability, Statistics and Queueing Theory with Computer
Applications”, Elsevier, 2nd edition, (2005).
2. Taha, H.A., “Operations Research”, Pearson Education”, Asia, 8 th edition, (2007).
3. Trivedi, K.S., “Probability and Statistics with Reliability, Queueing and Computer
Science Applications”, John Wiley and Sons, 2 nd edition, (2002).
4. Hwei Hsu, “Schaum’s Outline of Theory and Problems of Probability, Random
Variables and Random Processes”, Tata McGraw Hill edition, New Delhi, (2004).
AIM:
To give an understanding on the study that deals with the representation of signals as
ordered sequences of numbers and how to process those ordered sequences.
OBJECTIVES:
To understand the basics of signals and system by analyzing the various
transformations available and determine their use to DSP
To study on the various digital filtering techniques and how to apply to DSP
To study on the ways to estimate signal parameters, and transform a signal into a
form that is more informative.
To give students a flavour on the applications of DSP in the areas of speech and
image
30
UNIT I SIGNALS AND SYSTEMS 9
Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling
theorem – Discrete – time signals, systems – Analysis of discrete time LTI systems – Z
transform – Convolution (linear and circular) – Correlation.
UNIT V APPLICATIONS 9
Multirate signal processing – Speech compression – Adaptive filter – Musical sound
processing – Image enhancement.
TOTAL: 45 PERIODS
TEXT BOOKS :
1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles,
Algorithms & Applications”, Fourth edition, Pearson education / Prentice Hall, 2007.
2. Emmanuel C..Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second
edition, Pearson Education / Prentice Hall, 2002.
REFERENCES:
1. Sanjit K. Mitra, “Digital Signal Processing – A Computer Based Approach” ,Tata
McGraw Hill, Third Edition, 2007 .
2. Alan V.Oppenheim, Ronald W. Jchafer & Hohn. R.Back, “Discrete Time Signal
Processing”, Pearson Education, Second Edition, 2001.
3. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill,2006.
AIM:
To introduce the students to the current challenges and insight regarding the way how
mobile computing is evolving towards the world of pervasive computing.
OBJECTIVES:
Understand and identify requirements issue limitation parameters and components in
computing
Using such a knowledge, understand the rationale for the solution adopted in existing
or emerging systems
Able to participate in the development and proposal of future systems.
31
UNIT I MOBILE NETWORKS 9
Media Access Control – SDMA, FDMA, TDMA, CDMA – GSM – Architecture, Protocols,
Connection Establishment, Frequency Allocation , Localization, Handover, Security –
GPRS.
UNIT II WIRELESS NETWORKS 9
Wireless LANs and PANs – IEEE 802.11 Standard – Architecture – Services –Network –
HiperLAN – Blue Tooth- Wi-Fi – WiMAX
UNIT III ROUTING 9
Mobile IP – DHCP – AdHoc– Proactive and Reactive Routing Protocols – Multicast
Routing.
UNIT IV TRANSPORT AND APPLICATION LAYERS 9
Mobile TCP– WAP – Architecture – WWW Programming Model– WDP – WTLS – WTP –
WSP – WAE – WTA Architecture – WML – WMLScripts.
UNIT V PERVASIVE COMPUTING 9
Pervasive computing infrastructure-applications- Device Technology - Hardware,
Human-machine Interfaces, Biometrics, and Operating systems– Device Connectivity –
Protocols, Security, and Device Management- Pervasive Web Application architecture-
Access from PCs and PDAs - Access via WAP
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
2. Jochen Burkhardt, “Pervasive Computing: Technology and Architecture of Mobile
Internet Applications”, Addison-Wesley Professional; 3rd edition, 2007
REFERENCES:
1. Frank Adelstein, Sandeep KS Gupta, Golden Richard, “Fundamentals of Mobile and
Pervasive Computing”, McGraw-Hill 2005
2. Debashis Saha, “Networking Infrastructure for Pervasive Computing: Enabling
Technologies”, Kluwer Academic Publisher, Springer; First edition, 2002
3. “Introduction to Wireless and Mobile Systems” by Agrawal and Zeng, Brooks/ Cole
(Thomson Learning), First edition, 2002
4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober,
“Principles of Mobile Computing”, Springer, New York, 2003.
AIM:
To understand the design and implementation of a simple compiler.
OBJECTIVES:
To understand the functions of the various phases of a complier
To learn the overview of the design of lexical analyzer and parser
To study the design of the other phases in detail.
To learn the use of compiler construction tools.
32
UNIT II TYPE CHECKING AND RUNTIME ENVIRONMENTS 9
Syntax directed definitions – Construction of syntax trees – Type systems – Specification
of a simple type checker - Equivalence of type expressions – Type conversions –
Attribute grammar for a simple type checking system – Runtime Environments: Source
language issues – Storage organization – Storage allocation strategies – Parameter
passing.
33
UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 14
Definition, scope and importance of environment – need for public awareness - concept
of an ecosystem – structure and function of an ecosystem – producers, consumers and
decomposers – energy flow in the ecosystem – ecological succession – food chains,
food webs and ecological pyramids – Introduction, types, characteristic features,
structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desert
ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) –
Introduction to biodiversity definition: genetic, species and ecosystem diversity –
biogeographical classification of India – value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and option values – Biodiversity at global,
national and local levels – India as a mega-diversity nation – hot-spots of biodiversity –
threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts –
endangered and endemic species of India – conservation of biodiversity: In-situ and ex-
situ conservation of biodiversity.
Field study of common plants, insects, birds
Field study of simple ecosystems – pond, river, hill slopes, etc.
UNIT II ENVIRONMENTAL POLLUTION 8
Definition – causes, effects and control measures of: (a) Air pollution (b) Water pollution
(c) Soil pollution (d) Marine pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear
hazards – soil waste management: causes, effects and control measures of municipal
solid wastes – role of an individual in prevention of pollution – pollution case studies –
disaster management: floods, earthquake, cyclone and landslides.
Field study of local polluted site – Urban / Rural / Industrial / Agricultural.
UNIT III NATURAL RESOURCES 10
Forest resources: Use and over-exploitation, deforestation, case studies- timber
extraction, mining, dams and their effects on forests and tribal people – Water
resources: Use and over-utilization of surface and ground water, floods, drought,
conflicts over water, dams-benefits and problems – Mineral resources: Use and
exploitation, environmental effects of extracting and using mineral resources, case
studies – Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging,
salinity, case studies – Energy resources: Growing energy needs, renewable and non
renewable energy sources, use of alternate energy sources. case studies – Land
resources: Land as a resource, land degradation, man induced landslides, soil erosion
and desertification – role of an individual in conservation of natural resources – Equitable
use of resources for sustainable lifestyles.
Field study of local area to document environmental assets – river / forest / grassland /
hill / mountain.
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 7
From unsustainable to sustainable development – urban problems related to energy –
water conservation, rain water harvesting, watershed management – resettlement and
rehabilitation of people; its problems and concerns, case studies – role of non-
governmental organization- environmental ethics: Issues and possible solutions –
climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
holocaust, case studies. – wasteland reclamation – consumerism and waste products –
environment production act – Air (Prevention and Control of Pollution) act – Water
(Prevention and control of Pollution) act – Wildlife protection act – Forest conservation
act – enforcement machinery involved in environmental legislation- central and state
pollution control boards- Public awareness.
UNIT V HUMAN POPULATION AND THE ENVIRONMENT 6
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 in environment and
human health – Case studies.
TOTAL: 45 PERIODS
34
TEXT BOOKS:
1. Gilbert M.Masters, “Introduction to Environmental Engineering and Science”, 2nd
edition, Pearson Education (2004).
2. Benny Joseph, “Environmental Science and Engineering”, Tata McGraw-Hill,
New Delhi, (2006).
REFERENCES:
1. R.K. Trivedi, “Handbook of Environmental Laws, Rules, Guidelines, Compliances
and Standards”, Vol. I and II, Enviro Media.
2. Cunningham, W.P. Cooper, T.H. Gorhani, “Environmental Encyclopedia”, Jaico
Publ., House, Mumbai, 2001.
3. Dharmendra S. Sengar, “Environmental law”, Prentice hall of India PVT LTD,
New Delhi, 2007.
4. Rajagopalan, R, “Environmental Studies-From Crisis to Cure”, Oxford University
Press (2005)
OBJECTIVES:
To implement a lexical analyzer, syntax analyzer using tools.
To implement a code generator and the necessity for code optimization.
To know about compiler simulation tools.
35
CS 9355 MOBILE AND PERVASIVE COMPUTING LABORATORY LTPC
003 2
AIM:
The course aims at providing a sound conceptual knowledge in area of mobile and
pervasive computing.
OBJECTIVES:
To provide the students with the competencies required to simulate and understand
the mobile wireless network.
Teach the students to analyse and design web applications.
TOTAL: 45 PERIODS
OBJECTIVES:
To learn the setting up of GNU/Linux-based servers and workstation
To learn shell programming
To learn to configure application and server software
To learn to perform system administration tasks
To learn to use free and open source components.
2. Basic shell commands - logging in, listing files, editing files, copying/moving files,
viewing file contents, changing file modes and permissions, process management.
3. User and group management, file ownerships and permissions, PAM authentication,
Introduction to common system configuration files & log files.
36
5. Configuring additional hardware - sound cards, displays & display cards, network
cards, modems, usb drives, CD writers.
6. Performing every day tasks using GNU/Linux - accessing the Internet, playing music,
editing documents and spreadsheets, sending and receiving email, copy files from
disks and over the network, playing games, writing CDs.
7. Setting up email servers - using postfix (for SMTP services), courier (for IMAP &
POP3 services), squirrelmail (for webmail services).
8. Setting up web servers - using Apache (for HTTP services), Setting up proxy
services, printer services, firewall.
9. Using the GNU Compiler Collection - getting acquainted with the the GNU compiler
tools - the C preprocessor (cpp), the C compiler (gcc) and the C++ compiler (g++),
and the assembler (gas).
10. Understanding build systems - constructing makefiles and using make, using
autoconf and autogen to automatically generate makefiles tailored for different
development environments, Using flex (lex) and bison (yacc) to design parsers.
TOTAL: 45 PERIODS
OBJECTIVES:
Explain two and three dimensional concepts and their applications
Identify all techniques related to modern graphics programming concepts
Identify the media used in multimedia systems and to assess their relative
advantages and disadvantages relative to both user and system points of view.
Explain the interaction problems introduced by multimedia (e.g., compression and
synchronization)
UNIT I 2D PRIMITIVES 12
Output primitives – Line, Circle and Ellipse drawing algorithms - Attributes of output
primitives – Two dimensional Geometric transformation - Two dimensional viewing –
Line, Polygon, Curve and Text clipping algorithms
UNIT II 3D CONCEPTS 12
Parallel and Perspective projections - Three dimensional object representation –
Polygons, Curved lines, Splines, Quadric Surfaces,- Visualization of data sets - 3D
transformations – Viewing -Visible surface identification.
37
UNIT III GRAPHICS PROGRAMMING 12
Color Models – RGB, YIQ, CMY, HSV – Animations – General Computer Animation,
Raster, Keyframe - Graphics programming using OPENGL – Basic graphics primitives –
Drawing three dimensional objects.
UNIT IV MULTIMEDIA BASICS 12
Introduction and definitions – applications - elements - Compression – Types of
compressions - Lossless, Lossy – Video compression – Image Compression – Audio
compression - Data and file format.
UNIT V MULTIMEDIA SYSTEMS 12
Multimedia Authoring Systems – Hypermedia Design considerations – User Interface
Design – Object Display and Play back issues- Hypermedia Messaging- Distributed
Multimedia Systems – Components – multimedia Object Servers – Managing Distributed
Objects.
L: 45, T: 15, TOTAL = 60 PERIODS
TEXT BOOKS:
1. Donald Hearn, M.Pauline Baker, “Computer Graphics – C Version”, second
edition, Pearson Education,2004
2. Prabhat K Andleigh, Kiran Thakrar, “Multimedia systems design”, PHI, 2007.
REFERENCES
1. F.S.Hill, “Computer Graphics using OPENGL” , Second edition, Pearson
Education,2003.
2. Ralf Steinmetz and Klara, “Multimedia Computing, Communications and
Applications”, Pearson Education, 2004.
38
UNIT IV NETWORK SECURITY PRACTICE 9
Authentication applications – Kerberos, X.509, PKI – Electronic Mail security – PGP,
S/MIME – IP security – Web Security – SSL, TLS, SET – system security.
TOTAL: 45 PERIODS
TEXT BOOKS :
1 Wade Trappe, Lawrence C Washington, “ Introduction to Cryptography with coding
theory”, 2nd ed, Pearson, 2007.
2 William Stallings, “Cryptography and Network security Principles and Practices”,
Pearson/PHI, 4th ed, 2006.
3 Pfleeger and Pfleeger, “Security in computing”, 3 rd ed, PHI/Pearson, 2003.
REFERENCES :
1. Wenbo Mao, “Modern Cryptography Theory and Practice”, Pearson 2004.
OBJECTIVES:
To train basic and applied fields of Management
To improve the Managerial skills
To prepare the students on the functional areas of Management, and analytical skills
To prepare the students to expose to the management world.
39
UNIT IV DIRECTING 9
Creativity and Innovation - Motivation and Satisfaction - Motivation Theories Leadership
- Leadership theories - Communication - Hurdles to effective communication -
Organization Culture - Elements and types of culture - Managing cultural diversity.
UNIT V CONTROLLING 9
Process of controlling - Types of control - Budgetary and non-budgetary control
techniques - Managing Productivity - Cost Control - Purchase Control - Maintenance
Control - Quality Control - Planning operations.
TOTAL: 45 PERIODS
REFERENCES:
1. Hellriegel, Slocum & Jackson, “ Management - A Competency Based Approach”,
Thomson South Western, 10th edition, 2007.
2. Harold Koontz, Heinz Weihrich and Mark V Cannice,”'Management - A global &
Entrepreneurial Perspective”, Tata Mcgraw Hill, 12th edition, 2007.
3. Stephen P. Robbins and Mary Coulter, “Management”, Prentice Hall of India,
8th edition.
4. Charles W L Hill, Steven L McShane,”Principles of Management”, Mcgraw Hill
Education, Special Indian Edition, 2007.
5. Andrew J. Dubrin, “Essentials of Management”, Thomson Southwestern, 7th
edition, 2007.
AIM:
This course will help students in understanding the implementation of two and three
dimensional objects using OPENGL Graphics programming library suite. It also helps
students in designing animations, hand lying images and implementing various
compression algorithms.
OBJECTIVES:
Student will be able to construct and manipulate multi dimensional objects.
Students will be able to handle image files and can also create animations
TOTAL: 45 PERIODS
40
CS 9405 SOFTWARE DEVELOPMENT LABORATORY LTPC
0 032
AIM:
The aim of this laboratory is to ensure that students understand and are able to apply
the basic principles of software development. The course aims to inculcate the correct
practices of software development among the students.
OBJECTIVES:
The following salient points to be included in each system development:
Identification of Use cases for each application system and SRS preparation.
Identification of reusable Components/Frameworks from open source and
customizing them for each application.
Coding/Customizing/Wrapping for components/subsystems.
Testing – Scenario testing and test case preparation for each
components/subsystems
Integration of subsystems and Testing
Simulation of datasets and load testing to analyze performance of the system.
OBJECTIVES:
To understand the importance of communication in distributed environment and the
actual implementation of various communication mechanisms
To study how a distributed operating system works and how it differs from the single
processor OS.
To learn how to manage the resources in a distributed environment
To learn how to make a distributed systems fault tolerant
To study how the above-mentioned techniques have been used in actual, real-life
distributed systems.
41
UNIT II DISTRIBUTED OPERATING SYSTEMS 12
Issues in Distributed Operating System – Threads in Distributed Systems – Clock
Synchronization – Causal Ordering – Global States – Election Algorithms –Distributed
Mutual Exclusion – Distributed Transactions – Distributed Deadlock – Agreement
Protocols
TOTAL: 45 PERIODS
TEXT BOOKS:
1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts
and Design”, Third Edition, Pearson Education Asia, 2002.
2. Hagit Attiya and Jennifer Welch, “Distributed Computing: Fundamentals, Simulations
and Advanced Topics”, Wiley, 2004.
REFERENCES:
1. Mukesh Singhal, “Advanced Concepts In Operating Systems”, McGrawHill Series in
Computer Science, 1994.
2. A.S.Tanenbaum, M.Van Steen, “Distributed Systems”, Pearson Education, 2004.
3. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Addison
Wesley, 2004.
OBJECTIVES:
To introduce the feature of the J2EE framework and the usage of MVC architecture.
To design and create user interfaces using JSP.
To write the business logic for the middle tier.
To provide transaction and security support for enterprise applications.
To study the features of other frameworks.
42
UNIT II WEB APPLICATIONS 9
Presentation tier and EIS tier – servlet programming – JSP – Java Mail – JMS – Java
transactions – JNDI – Java authentication and authorization services – Java
cryptography (9)
UNIT IV WEBSERVICES 9
Web Services – J2EE Web Services – patterns – presentation, service tier and Data tier
patterns – J2ME
REFERENCES
1. Cay S Horstmann, Gary Cornell, “Core Java 2” Vol II, 7 th ed, Pearson Education,
2005.
2. W Clay Richardson, et al, “Professional Java JDK 6 Edition”, Wrox, 2007
AIM:
To understand file system, process, memory management and I/O in Unix.
OBJECTIVES:
To Understand the Interface Between Hardware And Software
To Understand the Process Subsystem
To Understand the Memory Subsystem
To Understand Memory Management
To Study the I/O Subsystem, Device Drivers And Ipc
UNIT I OVERVIEW 8
General Overview of the System : History – System structure – User perspective –
Operating system services – Assumptions about hardware. Introduction to the Kernel :
Architecture of the UNIX operating system – Introduction to system concepts. The Buffer
Cache: Buffer headers – Structure of the buffer pool – Scenarios for retrieval of a buffer
– Reading and writing disk blocks – Advantages and disadvantages of the buffer cache.
UNIT IV PROCESSES 10
Process states and transitions – Layout of system memory – The context of a process –
Saving the context of a process – Manipulation of the process address space - Sleep.
Process Control : Process creation – Signals – Process termination – Awaiting process
termination – Invoking other programs – user id of a process – Changing the size of a
process - Shell – System boot and the INIT process– Process Scheduling.
TEXT BOOK:
1. Maurice J. Bach, “The Design of the Unix Operating System”, First Edition, Pearson
Education, 1999.
REFERENCES:
1. B. Goodheart, J. Cox, “The Magic Garden Explained”, Prentice Hall of India, 1986.
2. S. J. Leffler, M. K. Mckusick, M. J. .Karels and J. S. Quarterman., “The Design And
Implementation of the 4.3 BSD Unix Operating System”, Addison Wesley, 1998.
3. Uresh Vahalia, “Unix Internals: The New Frontiers”, Pearson Education, 1996.
OBJECTIVES:
To understand about different data models that can be used for specialized
applications
To make the students to get familiarized with transaction management of advanced
database models
To develop in-depth knowledge about web and intelligent database systems.
To provide an introductory concept about the way in which data can be stored in
multimedia databases.
44
UNIT I RELATIONAL MODEL ISSUES 9
ER Model - Normalization – Query Processing – Query Optimization – Transaction
Processing - Concurrency Control – Recovery - Database Tuning.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Thomas Connolly and Carlolyn Begg, “Database Systems, A Practical Approach to
Design, Implementation and Management”, Third Edition, Pearson Education 2003.
REFERENCES:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition,
Pearson Education, 2006.
2. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System
Concepts”, Fifth Edition, Tata McGraw Hill, 2006.
3. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”,
EighthEdition, Pearson Education, 2006.
AIM:
This course brings out the importance of Software Requirement and management in
Software development.
OBJECTIVES:
To know several dimensions of problem analysis
To explain important management concepts
To be aware of different methods of refining systemic definition
To know about change management and its impact on software development
45
UNIT I INTRODUCTION 9
Introduction - Requirements Problem – Requirements management – Requirements
and software life cycle-software team.
REFERENCES:
1. Suzanne & James Robertson,”Mastering the Requirements Process”, Second
Edition, Pearson.Education, 2007.
2. Swapna Kishore, Rajesh Naik, “Software Requirements and Estimation”, Tata
McGraw Hill, 2001
3. K.Weigers,”Software Requirements”, Microsoft Press, 1999.
4. Ian Sommerville & P Sawyer, “Requirements engineering a good practice Guide”,
Wiley India, 1997
OBJECTIVES
46
UNIT I INTRODUCTION 9
Nature of design process – Characteristics of design activities, Essential elements of
design- Factors affecting design quality - Design Quality models – Design
principles – Notion of Software architecture – Simple case studies.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Hong Zhu, “ Software Design Methodology – From principles to Architectural styles”,
Elsevier, 2006.
2. Mary Shaw and David Garlan, “Software Architecture – Perspectives on an emerging
Discipline”, PHI, 2003. (UNIT I and II)
3. David Budgen, “Software Design”, Pearson Education, 2004.(UNIT –III to V)
4. Bass, L., Clements P. and Kazman, R., “Software Architecture in Practice”, Addison
Wesley, 1998.
OBJECTIVES:
This course has been designed with the following objectives:
To introduce the concept of data mining with detail coverage of basic tasks, metrics,
issues, and implication. Core topics like classification, clustering and association
rules are exhaustively dealt with.
To introduce the concept of data warehousing with special emphasis on architecture
and design.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Alex Berson and Stephen J. Smith, “ Data Warehousing, Data Mining & OLAP”, Tata
McGraw – Hill Edition, Tenth Reprint 2007.
2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Second
Edition, Elsevier, 2007.
REFERENCES:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “ Introduction To Data Mining”,
Person Education, 2007.
2. K.P. Soman, Shyam Diwakar and V. Ajay ,”Insight into Data mining Theory and
Practice”, Easter Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta, “ Introduction to Data Mining with Case Studies”, Easter Economy
Edition, Prentice Hall of India, 2006.
4. Soumendra Mohanty, “Data Warehousing Design, Development and Best Practices”,
Tata McGraw – Hill Edition, 2006.
48
CS 9028 MIDDLEWARE TECHNOLOGIES LT PC
3 0 03
AIM:
The aim of the course is to teach the role of middleware in the distributed
environment and its common services.
OBJECTIVES:
To study the set of services that a middleware system constitutes of.
To understand how middleware facilitates the development of distributed
applications in heterogeneous environments.
To study how it helps to incorporate application portability, distributed
application component interoperability and integration
To learn the object oriented middleware basics through the example of the
following CORBA objects.
To understand the basics of Web services that is the most often used
middleware technique.
UNIT I INTRODUCTION 7
Emergence of Middleware – Objects, Web Services – Middleware Elements – Vendor
Architecture – Interoperability – Middleware in Distributed Applications – Types of
Middleware – Transaction-Oriented Middleware – MOM – RPC.
REFERENCES:
1. Qusay H. Mahmoud, “Middleware for Communications”, John Wiley and Sons, 2004.
2. Gerald Brose, Andreas Vogel, Keith Duddy, “JavaTM Programming with CORBATM:
Advanced Techniques for Building Distributed Applications”, Wiley, 3rd edition,
January, 2004.
3. Michah Lerner, “Middleware Networks: Concept, Design and Deployment of Internet
Infrastructure”, Kluwer Academic Publishers, 2000.
49
CS 9029 .NET AND C# PROGRAMMING LT PC
3 0 03
AIM:
To provide an introduction to the .NET framework and enable the student to program in
C#.
OBJECTIVES:
To study basic and advanced features of the C# language
To create form based and web based applications
To study the internals of the .NET framework
UNIT I C# BASICS 9
C# and the .NET framework – C# basics – Objects and types – Inheritance – Arrays –
Operators and casts – Indexers
REFERENCES:
1. Jesse Liberty, “Programming C#”, O’Reilly, 2001.
2. Andrew Troelson, “Pro C# with .NET 3.0”, Apress, 2007.
3. Kevin Hoffman, “Visual C# 2005”, Pearson Education, 2006.
4. S. Thamarai Selvi, R. Murugesan, “A Text Book on C#”, Pearson Education, 2003.
OBJECTIVES:
To introduce basic concepts in acquiring, storage and Processing of images
To introduce for enhancing the quality of images.
To introduce techniques for extraction and processing of region of interest
To introduce case studies of Image Processing.
50
UNIT I FUNDAMENTALS OF IMAGE PROCESSING 9
Introduction – Steps in Image Processing Systems – Image Acquisition – Sampling and
Quantization – Pixel Relationships – Colour Fundamentals and Models, File Formats,
Image operations – Arithmetic, Geometric and Morphological.
REFERENCES:
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing,
AnalysisandMachine Vision”, Second Edition, Thomson Learning, 2001
2. Anil K.Jain, “Fundamentals of Digital Image Processing”, PHI, 2006.
3. Sanjit K. Mitra, & Giovanni L. Sicuranza, “Non Linear Image Processing” Elsevier,
2007.
4. Richard O. Duda, Peter E. HOF, David G. Stork, “Pattern Classification” Wiley
Student Edition, 2006.
OBJECTIVES:
To study the fundamentals of computer forensics
To have an overview of techniques for Data Recovery and Evidence Collection
To study various threats associated with security and information warfare
To study the tools and tactics associated with cyber forensics.
51
UNIT I FUNDAMENTALS OF FORENSICS 9
Computer Forensics Fundamentals – Types of Computer Forensics Technology – Types
of Vendor and Computer Forensics Services
TOTAL: 45 PERIODS
TEXTBOOK:
1. John R. Vacca, “Computer Forensics”, Firewall Media, 2004.
REFERENCES:
1. Chad Steel, “Windows Forensics”, Wiley India, 2006.
2. Majid Yar, “Cybercrime and Society”, Sage Publications, 2006.
3. Robert M Slade, “Software Forensics”, Tata McGrawHill, 2004.
OBJECTIVES:
Acquiring knowledge of the basic concepts in Graph Theory. .
UNIT I INTRODUCTION 9
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –
Connectedness – Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees
– Properties of trees – Distance and Centers in Tree – Rooted and Binary Trees.
52
UNIT III MATRICES, COLORING AND DIRECTED GRAPH 9
Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix –
Chromatic Number – Chromatic partitioning – Chromatic polynomial – Matching –
Covering – Four Color Problem – Directed Graphs – Types of Directed Graphs –
Digraphs and Binary Relations – Directed Paths and Connectedness – Euler Graphs –
Adjacency Matrix of a Digraph.
UNIT IV ALGORITHMS- I 9
Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning
Trees of a Graph – Set of Fundamental Circuits – Cut Vertices and Separability –
Directed Circuits.
UNIT V ALGORITHMS- II 9
Algorithms: Shortest Path Algorithm – DFS – Planarity Testing – Isomorphism.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer
Science”, Prentice Hall of India, 2003.
REFERENCE:
1. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education,
2003.
AIM:
To comprehend the advancements in computer architecture in all aspects – from implicit
to explicit parallelism.
OBJECTIVES:
To understand the principle and various dimensions of instruction-level parallelism,
and thread-level parallelism.
To appreciate the move towards multi-core architectures and realize the challenges
in dealing with such architectures.
To get a feel of programming for such architectures.
53
UNIT III MEMORY AND I/O 9
Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time –
Main memory and performance – Memory technology. Types of storage devices –
Buses – RAID – Reliability, availability and dependability – I/O performance measures –
Designing an I/O system.
TOTAL: 45 PERIODS
TEXT BOOKS:
1 John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative
approach”, Morgan Kaufmann / Elsevier Publishers, 4 th. edition, 2007.
2. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006.
REFERENCES:
1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A hardware/
software approach” , Morgan Kaufmann /Elsevier Publishers, 1999.
2. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata McGraw
Hill, 2003.
3. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, New
Delhi, 2003.
www.intel.com/products.
OBJECTIVES:
To understand the IP addressing schemes which provides the base for Layer 2 and
Layer 3 header field detection, error reporting and dynamic address mapping.
To develop data structures for basic protocol functions of TCP/IP and to understand
and use the various members in the respective structures.
To design and implement data structures for maintaining multiple local and global
timers that will govern over various modules of TCP and IP software.
UNIT I INTRODUCTION 9
Internetworking concepts and architecture model – classful Internet address – CIDR –
Subnetting and Supernetting – AARP – RARP- IP- IP Routing – ICMP – IPV6.
54
UNIT II TCP 9
Services – header – connection establishment and termination – interactive data flow –
bulk data flow – timeout and retransmission – persist timer – keep alive timer – futures
and performance.
REFERENCES:
1. Forouzan, “ TCP/IP Protocol Suite” Second Edition, Tata MC Graw Hill, 2003.
2. W.Richard Stevens “TCP/IP Illustrated” Volume 2, Pearson Education 2003
OBJECTIVES:
To impart a first hand knowledge on the FOSS philosophy and methodology
To enable the students to install and use Linux distribution
To train the students in Linux desktop usage and some commonly used programs
To encourage students to apply OSS philosophy and migrate to FOSS in their own
domains
To develop application programs using FOSS
55
UNIT II SYSTEM ADMINISTRATION 10
GNU/Linux OS installation--detect hardware, configure disk partitions & file systems and
install a GNU/Linux distribution ; Basic shell commands -logging in, listing files, editing
files, copying/moving files, viewing file contents, changing file modes and permissions,
process management ; User and group management, file ownerships and permissions,
PAM authentication ; Introduction to common system configuration files & log files ;
Configuring networking, basics of TCP/IP networking and routing, connecting to the
Internet (through dialup, DSL, Ethernet, leased line) ; Configuring additional hardware -
sound cards, displays & display cards, network cards, modems, USB drives, CD writers ;
Understanding the OS boot up process ; Performing every day tasks using gnu/Linux --
accessing the Internet, playing music, editing documents and spreadsheets, sending
and receiving email, copy files from disks and over the network, playing games, writing
CDs ; X Window system configuration and utilities--configure X windows, detect display
devices ; Installing software from source code as well as using binary packages
TOTAL: 45 PERIODS
REFERENCES:
1. N. B. Venkateshwarlu (Ed); “Introduction to Linux: Installation and Programming”, B S
Publishers; 2005.
2. Matt Welsh, Matthias Kalle Dalheimer, Terry Dawson, and Lar Kaufman, “Running
Linux”, Fourth Edition, O'Reilly Publishers, 2002.
3. Carla Schroder, “Linux Cookbook”, First Edition, O'Reilly Cookbooks Series, 2004.
ON-LINE MATERIAL:
1. Open Sources: Voices from the Open Source Revolution, First Edition,
January1999,ISBN:1-56592-582-3.
URL: Http://www.oreilly.com/catalog/opensources/book/toc.html
2. The Linux Cookbook: Tips and Techniques for Everyday Use, First Edition, Michael
Stutz, 2001. URL: http://dsl.org/cookbook/cookbook_toc.html
3. The Linux System Administrators' Guide, Lars Wirzenius, Joanna Oja,
StephenStafford,andAlexWeeks,December2003.
56
URL: http://www.tldp.org/guides.html
4. Using GCC, Richard Stallman et al. URL: http://www.gnu.org/doc/using.html
5. An Introduction to GCC, Brian Gough. URL: http://www.network-
theory.co.uk/docs/gccintro/
6. GNU Autoconf, Automake and Libtool, Gary V. Vaughan, Ben Elliston, Tom Tromey
and Ian Lance Taylor. URL: http://sources.redhat.com/autobook/
7. Open Source Development with CVS, Third Edition, Karl Fogel and Moshe Bar. URL:
http://cvsbook.red-bean.com/
8. Advanced Bash Scripting Guide, Mendel Cooper, June 2005. URL:
http://www.tldp.org/guides.html
9. GTK+/GNOME Application Development, Havoc Pennington. URL:
http://developer.gnome.org/doc/GGAD
Python Tutorial, Guido van Rossum, Fred L. Drake, Jr., Editor. URL:
http://www.python.org/doc/current/tut/tut.html
AIM:
To give an overall understanding on the theories that are available to solve hard real-
world problems
OBJECTIVES:
To give the students an overall knowledge of soft computing theories and
fundamentals
To give an understanding on the fundamentals of non-traditional technologies and
approaches to solving hard real-world problems
Fundamentals of artificial neural networks, fuzzy sets and fuzzy logic and genetic
algorithms.
Use of ANN, Fuzzy sets to solve hard real-world problems
To given an overview of Genetic algorithms and machine learning techniques to
solving hard real-world problems
To study about the applications of these areas
UNIT I INTRODUCTION 9
Evolution of Computing - Soft Computing Constituents – From Conventional AI to
Computational Intelligence – Neural Networks - Scope and Evolution – Models of
Neural Networks – Feed forward Networks – Supervised Learning Neural Networks –
Associative memory networks – Unsupervised learning networks – Special Networks
57
UNIT III FUZZY MEASURES AND REASONING 9
Fuzzy arithmetic and measures – Fuzzy reasoning – approximate reasoning –
categorical, qualitative, syllogistic, dispositional – Fuzzy inference systems – fuzzy
decision making – individual, multiperson, multi objective, Bayesian – fuzzy logic control
system – architecture, model and application
TOTAL: 45 PERIODS
TEXT BOOK:
1. S.N. Sivanandam and S.N. Deepa, “Principles of Soft Computing”, Wiley India Ltd.,
First Indian Edition, 2007
REFERENCES:
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft
Computing”, Prentice-Hall of India, 2003.
2. James A. Freeman and David M. Skapura, “Neural Networks Algorithms,
Applications, and Programming Techniques”, Pearson Edn., 2003.
3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and
Applications”, Prentice Hall, 1995.
4. Amit Konar, “Artificial Intelligence and Soft Computing”, First Edition,CRC Press,
2000.
5. Simon Haykin, “Neural Networks: A Comprehensive Foundation”, Second Edition
Prentice Hall, 1999.
6. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
7. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine
Learning”, Addison Wesley, 1997.
OBJECTIVES
The students will be exposed to deep knowledge in designing a knowledge
management system.
Current trends in information technology such as electronic markets, digital library,
E auction, E governance etc can be developed and deployed effectively using
knowledge management issues.
KM strategies will improve future organizational structures.
58
UNIT I KNOWLEDGE MANAGEMENT 9
KM Life Cycle – Understanding Knowledge – Knowledge, intelligence – Experience –
Common Sense – Cognition and KM – Types of Knowledge – Expert Knowledge –
Human Thinking and Learning.
OBJECTIVES:
On completion of the course each student trained in this course will develop effective
query execution plans, tune the recovery sub system, tune nested queries,
procedures and functions, identify where denormalization is required and tune the
application interface.
In addition to the above the student will gain knowledge on tuning in the most
popularly used Database Servers Oracle, SQL Server and DB2 UDB. Tuning on
distributed database implementation is also part of this course
59
UNIT I FUNDAMENTALS OF TUNING 8
Review of Relational Databases – Relational Algebra - Locking and Concurrency Control
– Correctness Consideration – Lock Tuning – Logging and the Recovery Subsystem –
Principles of Recovery – Tuning the Recovery Subsystem – Operating Systems
Considerations – Hardware Tuning.
REFERENCES:
1. Thomas Connoly and Carlolyn Begg, “Database Systems, A Practical Approach to
Design, Implementation and Management”, Third Edition, Pearson Education 2003.
2. M.Tamer Ozsu, Patrick Valduriez and S.Sridhar “Principles of Distributed Database
Systems”, Pearson Education 2007.
REFERENCES:
1. Ian Foster & Carl Kesselman, “The Grid 2 – Blueprint for a New Computing
Infrastructure”, Morgan Kaufman – 2004
2. Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson Education 2004.
3. Fran Berman, Geoffrey Fox, “Anthony J.G.Hey”, Grid Computing: Making the Global
Infrastructure a Reality”, John Wiley and Sons, 2003
4. URLs : www.globus.org and glite.web.cern.ch
OBJECTIVES:
To understand the issues and challenges in natural language and the various
modules of a typical natural language processing system
To learn the indexing and searching processes of a typical information retrieval
system and to study NLP based retrieval systems
To gain knowledge about typical text categorization and clustering techniques
To know about evaluation techniques for information retrieval and text mining
To comprehend Multimodality and multilingualism issues
To gain knowledge about translation, dialog agents and Generation systems
61
UNIT I INTRODUCTION 9
Natural Language Processing – Linguistic Background- Spoken language input and
output Technologies – Written language Input - Mathematical Methods - Statistical
Modeling and Classification Finite State methods Grammar for Natural Language
Processing – Parsing – Semantic and Logic Form – Ambiguity Resolution – Semantic
Interpretation.
UNIT II INFORMATION RETRIEVAL 9
Information Retrieval architecture - Indexing- Storage – Compression Techniques –
Retrieval Approaches – Evaluation - Search engines- commercial search engine
features- comparison- performance measures – Document Processing - NLP based
Information Retrieval – Information Extraction.
UNIT III TEXT MINING 9
Categorization – Extraction based Categorization- Clustering- Hierarchical Clustering-
Document Classification and routing- finding and organizing answers from Text search –
use of categories and clusters for organising retrieval results – Text Categorization and
efficient Summarization using Lexical Chains – Pattern Extraction (evaluation).
UNIT IV GENERIC ISSUES 9
Multilinguality – Multilingual Information Retrieval and Speech processing - Multimodality
– Text and Images – Modality Integration - Transmission and Storage – Speech coding-
Evaluation of systems – Human Factors and user Acceptability.
UNIT V APPLICATIONS 9
Machine Translation – Transfer Metaphor - Interlingua and Statistical Approaches -
Discourse Processing – Dialog and Conversational Agents – Natural Language
Generation – Surface Realization and Discourse Planning.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Daniel Jurafsky and James H. Martin, “ Speech and Language Processing” , 2000.
2. Gerald J. Kowalski and Mark.T. Maybury, “Information Storage and Retrieval
systems”, Kluwer academic Publishers, 2000.
REFERENCES:
1. Tomek Strzalkowski “ Natural Language Information Retrieval “, Kluwer academic
Publishers, 1999.
2. Christopher D.Manning and Hinrich Schutze, “Foundations of Statistical Natural
Language Processing “, MIT Press, 1999.
3. Michael W. Berry “ Survey of Text Mining: Clustering, Classification and Retrieval”,
Springer Verlag, 2003.
4. James Allen “ Natural Language Understanding“, Benjamin/ Cummings Publishing
Co. 1995.
62
CS 9041 VISUALIZATION TECHNIQUES LT PC
3 0 03
AIM:
This course aims at understanding Information and Scientific visualization techniques
and give a clear picture of various abstraction mechanisms
OBJECTIVES:
At the end of the course the student will be able to understand basic visualization and
interaction techniques in the information visualization fields, as well as basic
approaches to visually exploring large databases
Students will also understand the various abstraction mechanisms and to create
interactive visual interfaces
REFERENCES:
1. Thomas Strothotte, “ Computer Visualization–Graphics Abstraction and Interactivity”,
Springer Verlag Berlin Heiderberg 1998.
63
CS 9042 SOFTWARE PROJECT MANAGEMENT L TPC
3 00 3
AIM:
This course aims at the role of software developers in getting exposure on planning and
controlling aspect of software development
OBJECTIVES:
To understand the roles of the project manager
To understand the threats and opportunities in project management
To gain Expertise in size, effort and cost estimation techniques
To understand the techniques available with which a project's aims and objectives,
timetable, activities, resources and risks can be kept under control
To understand the social and political problems a project will encounter--against
which the technical problems pale into insignificance--and to begin to understand
how to approach non-technical problems
To appreciate management issues like team structure, group dynamics
64
REFERENCES:
1. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001.
2. Royce, “Software Project Management”, Pearson Education, 1999.
3. Jalote, “Software Project Management in Practice”, Pearson Education, 2002.
4. Robert T. Futrell, Donald F. Shefer and Linda I. Shefer, “Quality Software Project
Management”, Pearson Education, 2003.
TEXT BOOKS:
1. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006.
2. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata
MacgrawHill, 2003.
REFERENCES:
1. John L. Hennessey and David A. Patterson, “ Computer architecture – A
quantitative approach”, Morgan Kaufmann/Elsevier Publishers, 4 th. edition, 2007.
2. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A
hardware/ software approach” , Morgan Kaufmann/Elsevier Publishers, 1999.
65
EC 9073 BIOINFORMATICS LTPC
300 3
AIM:
By using the well-tested and successful approach of problem-based learning, students
will learn through applying the strategies and tools used in bioinformatics to topical
problems drawn from ongoing research and applications in a variety of fields.
OBJECTIVES:
To emphasize how to use the computer as a tool for biomedical research.
To understand the use of Databases and Data mining concepts in the field of biology
To study and understand the various modeling techniques that are used for
modeling biological data
To explore visualization techniques for DNA and RNA molecules
To be aware of the microarray technology for genome expression study
UNIT I INTRODUCTION 9
Need for Bioinformatics technologies – Overview of Bioinformatics technologies –
Structural bioinformatics – Data format and processing – secondary resources and
applications – Role of Structural bioinformatics - Biological Data Integration System.
UNIT II DATAWAREHOUSING AND DATAMINING IN BIOINFORMATICS 9
Bioinformatics data – Datawarehousing architecture – data quality – Biomedical data
analysis – DNA data analysis – Protein data analysis – Machine learning – Neural
network architecture and applications in bioinformatics
UNIT III MODELING FOR BIOINFORMATICS 9
Hidden markov modeling for biological data analysis – Sequence identification –
Sequence classification – multiple alignment generation – Comparative modeling –
Protein modeling – genomic modeling – Probabilistic modeling – Bayesian networks –
Boolean networks - Molecular modeling – Computer programs for molecular modeling
UNIT IV PATTERN MATCHING AND VISUALIZATION 9
Gene regulation – motif recognition – motif detection – strategies for motif detection –
Visualization – Fractal analysis – DNA walk models – one dimension – two dimension –
higher dimension – Game representation of Biological sequences – DNA, Protein, Amino
acid sequences
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Yi-Ping Phoebe Chen (Ed), “BioInformatics Technologies”, First Indian Reprint,
Springer Verlag, 2007.
2. Zoe lacroix and Terence Critchlow, “BioInformatics – Managing Scientific data”, First
Indian Reprint, Elsevier, 2004
REFERENCES:
1. Zoe Lacroix and Terence Critchlow, “Bioinformatics – Managing Scientific Data”,
First Edition, Elsevier, 2004
2. Bryan Bergeron, “Bio Informatics Computing”, Second Edition, Pearson Education,
2003.
3. Arthur M Lesk, “Introduction to Bioinformatics”, Second Edition, Oxford University
Press, 2005
66
IT 9401 SOFTWARE TESTING LTPC
3 0 03
AIM:
The course looks at the role of developers in areas such as test planning,
implementation, and defect tracking. It explains how to review and manage test
requirements and how to incorporate testing into the software development life cycle.
OBJECTIVES:
To determine software testing objectives and criteria
To develop and validate a test plan
To select and prepare test cases
To identify the need for testing
To prepare testing policies and standards
To use testing aids and tools
To test before buying a software package
Test after maintenance and enhancement changes
To measure the success of testing efforts
UNIT I INTRODUCTION 8
Testing as an Engineering Activity – Testing as a Process – testing axioms - Basic
Definitions – Software Testing Principles – The Tester’s Role in a Software Development
Organization – Origins of Defects – cost of defects - Defect Classes – The Defect
Repository and Test Design – Defect Examples – Developer/Tester Support for
Developing a Defect Repository – Defect Prevention Strategies
UNIT II TEST CASE DESIGN 11
Test Case Design Strategies – Using Black Box Approach to Test Case Design -
Random Testing – Requirements based testing – Boundary Value Analysis – Decision
tables - Equivalence Class Partitioning - State-based testing – Cause-effect graphing –
Error guessing - Compatibility testing – User documentation testing – Domain testing
Using White Box Approach to Test design – Test Adequacy Criteria – static testing vs.
structural testing – code functional testing - Coverage and Control Flow Graphs –
Covering Code Logic – Paths – Their Role in White–box Based Test Design – code
complexity testing – Evaluating Test Adequacy Criteria.
TOTAL: 45 PERIODS
67
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “ Software Testing – Principles and
Practices”, Pearson education, 2006.
2. Ilene Burnstein, “Practical Software Testing”, Springer International Edition, 2003.
REFERENCES:
1. Ron Patton, “ Software Testing”, Second Edition, Sams Publishing, Pearson
education, 2007
2. Renu Rajani, Pradeep Oak, “Software Testing – Effective Methods, Tools and
Techniques”, Tata McGraw Hill, 2004.
3. Edward Kit, “Software Testing in the Real World – Improving the Process”, Pearson
Education, 1995.
4. Boris Beizer, “Software Testing Techniques” – 2nd Edition, Van Nostrand Reinhold,
New York, 1990.
5. Aditya P. Mathur, “Foundations of Software Testing – Fundamental algorithms and
techniques”, Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2008
OBJECTIVES:
To study the importance of Service Oriented Architecture.
Implementation of SOA in the Java and .NET frameworks.
To study the advanced features of SOA.
REFERENCES:
1. Thomas Erl, “Service Oriented Architecture”, Pearson Education, 2005.
2. Frank Cohen, “FastSOA”, Elsevier, 2007.
3. Scott Campbell, Vamsi Mohun, “Mastering Enterprise SOA”, Wiley, 2007.
4. Eric Pulier, Hugh Taylor, “Understanding Enterprise SOA”, Dreamtech Press, 2007.
5. Jeff Davies, “The Definitive Guide to SOA”, Apress, 2007.
6. Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services”,
Pearson Education, 2004.
AIM:
The aim of this course is to study the system modeling and simulation techniques, which
finds application in diverse fields.
OBJECTIVE:
The objective of this course is to introduce the fundamental principles and concepts
in the general area of systems and simulation. The purpose is to learn about the
overview of computer simulation concepts, overview of modeling theory, review of
probability distributions and queuing theory, random number generation, probability
distribution generation, data collection and input analysis, discrete modeling and
simulation concepts, state based models, Markov models, model validation and
verification and some simulation systems and languages.
REFERENCES
1. Frank L. Severance, “ System Modeling and Simulation”, Wiley, 2001.
2. Averill M. Law and W.David Kelton, “Simulation Modeling and Analysis”, Third
Edition, McGraw Hill, 2006.
3. Jerry Banks, “Handbook of Simulation: Principles, Methodology, Advances,
Applications and Practice”, Wiley, 1998.
OBJECTIVES:
To understand the issues of MAC layer and routing protocols
To study about the different types of adhoc routing protocols
To learn about the QoS aware adhoc routing protocols
To study about power and energy management in adhoc networks
To understand the routing and models of mesh networks.
To study about the architecture and protocols of wireless sensor networks
UNIT I ROUTING 9
Cellular and Ad hoc wireless networks – Issues of MAC layer and Routing – Proactive,
Reactive and Hybrid Routing protocols – Multicast Routing – Tree based and Mesh
based protocols – Multicast with Quality of Service Provision
70
UNIT V SENSOR NETWORKS 9
Introduction – Sensor Network architecture – Data Dissemination – Data Gathering –
MAC Protocols for sensor Networks – Location discovery – Quality of Sensor Networks
– Evolving Standards – Other Issues – Recent trends in Infrastructure less Networks
TOTAL: 45 PERIODS
TEXT BOOK:
1. C. Siva Ram Murthy and B.S.Manoj, “Ad hoc Wireless Networks – Architectures and
Protocols”, Pearson Education, 2004
REFERENCES:
1. Feng Zhao and Leonidas Guibas, “Wireless Sensor Networks”, Morgan
Kaufman Publishers, 2004.
2. C.K.Toh, “Adhoc Mobile Wireless Networks”, Pearson Education, 2002.
3. Thomas Krag and Sebastin Buettrich, “Wireless Mesh Networking”, O’Reilly
Publishers, 2007.
OBJECTIVES:
To provide in-depth knowledge about embedded processor, its hardware and
software.
To explain programming concepts and embedded programming in C and assembly
language.
To explain real time operating systems, inter-task communication and an embedded
software development tool.
71
TEXT BOOKS:
1. Andrew N Sloss, D. Symes, C. Wright, ” Arm system developers guide”, Morgan
Kauffman/ Elsevier, 2006.
2. Michael J. Pont, “Embedded C”, Pearson Education , 2007.
REFERENCES:
1. Wayne Wolf, “Computers as Components:Principles of Embedded Computer
System Design”, Elsevier, 2006.
2. Steve Heath, “Embedded System Design” , Elsevier, 2005.
72
CS 9050 ROUTERS AND NETWORK PROCESSORS LTPC
3 003
AIM:
To understand the internals of a router and get an experience of designing such
systems.
OBJECTIVES:
To learn the functions of a router, and its architecture.
To learn about Network processors – their architecture, programming issues,
and design issues.
UNIT IV NP ARCHITECTURES 9
Issues In Scaling A Network Processor (processing hierarchy and scaling)– examples of
commercial Network Processors : Multi-Chip Pipeline, Augmented RISC Processor,
Embedded Processor Plus Coprocessors, etc. - Design Tradeoffs and consequences
(Programmability Vs. Processing Speed , speed vs functionality. etc).
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Douglas E. Comer ”Network System Design using Network Processors”
Prentice Hall, 2006.
2. Deepankar Medhi, Karthikeyan Ramasamy, “Network Routing : Algorithms,
Protocols, and Architecture”, Elsevier, 2007.
REFERENCES:
1. Patrick Crowley, M A Franklin, H Hadimioglu, PZ Onufryk, “Network
Processor Design, Issues and Practices Vol - I”, Morgan Kauffman, 2002.
2. http://www.npforum.org/
3. http://www.intel.com/design/network/products/npfamily/
73
CS 9071 HIGH SPEED NETWORKS LTPC
3 003
AIM:
To provide an understanding of the networking standards that can be adopted with the
current day requirements of complex and voluminous content transfer over
heterogeneous platforms.
OBJECTIVES:
To know about the various standards adopted for handling high traffic.
To have a primitive level performance analysis for few network constraints for
various amount traffic with different networking standards.
To get a feel of designing a High speed network setup with specialized hardware and
optimization approaches like parallelism and pipelining.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. William Stallings, “High speed networks and internet”, Second Edition, Pearson
Education, 2002. (Unit 1,2 and 3)
2. Warland, Pravin Varaiya, “High performance communication networks”, Second
Edition , Jean Harcourt Asia Pvt. Ltd., , 2001. (Unit 4)
3. James P.G Sterbenz and Joseph D.Touch “High Speed Networking: A Systematic
approach to high-bandwidth low latency communication”Wiley,2001 (Unit 5).
REFERENCES:
1. Irvan Pepelnjk, Jim Guichard, Jeff Apcar, “MPLS and VPN architecture”, Cisco
Press, Volume 1 and 2, 2003.
2. Abhijit S. Pandya, Ercan Sea, “ATM Technology for Broad Band Telecommunication
Networks”, CRC Press, New York, 2004.
74
CS 9072 SEMANTIC WEB LTPC
3 0 03
AIM:
The aim of this course is to understand the fundamentals of ontologies and the role of
ontologies in the web. The course also outlines the issues and languages of semantic
web.
OBJECTIVES:
To understand the fundamentals of ontologies.
To know about the Semantic Web and the different languages used in the context of
semantic web.
To learn the methodologies used for ontology learning for semantic web.
To know about ontology management and tools used for Ontology annotation.
To comprehend the role of semantics in web services and to discuss some of the
security issues.
UNIT I INTRODUCTION 9
Components – Types – Ontological Commitments – Ontological Categories –
Philosophical Background - Knowledge Representation Ontologies – Top Level
Ontologies – Linguistic Ontologies – Domain Ontologies – Semantic Web – Need –
Foundation – Layers – Architecture.
UNIT V APPLICATIONS 7
Web Services – Semantic Web Services - Case Study for specific domain – Security
issues – current trends.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Asuncion Gomez-Perez, Oscar Corcho, Mariano Fernandez-Lopez, “Ontological
Engineering: with examples from the areas of Knowledge Management, e-
Commerce and the Semantic Web” Springer, 2004
2. Grigoris Antoniou, Frank van Harmelen, “A Semantic Web Primer (Cooperative
Information Systems)”, The MIT Press, 2004
75
REFERENCES:
1. Alexander Maedche, “Ontology Learning for the Semantic Web”, Springer; 1 edition,
2002
2. John Davies, Dieter Fensel, Frank Van Harmelen, “Towards the Semantic Web:
Ontology – Driven Knowledge Management”, John Wiley & Sons Ltd., 2003.
3. Dieter Fensel (Editor), Wolfgang Wahlster, Henry Lieberman, James Hendler,
“Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential”, The
MIT Press, 2002
4. Michael C. Daconta, Leo J. Obrst, Kevin T. Smith, “The Semantic Web: A Guide to
the Future of XML, Web Services, and Knowledge Management”, Wiley, 2003
5. Steffen Staab (Editor), Rudi Studer, “Handbook on Ontologies (International
Handbooks on Information Systems)”, Springer 1st edition, 2004
OBJECTIVES:
This course uses fitting, PDEs, Integrating etc. , and introduce the student to
practical/real world systems which require understanding and defy complete (if any)
analytical methods towards their analysis and hence the requirement to form deep
knowledge and create skills for numerical treatment of mathematical models
governed by curve for modeling and simulation. This will include the mathematical,
statistical and language tools required for specifying a model, running the simulation
and analyzing the results.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Jerry Banks and John Carson, “Discrete Event System Simulation”, Third Edition,
PHI, 2002.
2. Steven C. Chapra, Raymond P. Canale, “Numerical Methods for Engineering”,
Second Edition, McGraw-Hill, 1989.
REFERENCES:
1. Sastry S.S ”Introductory Methods of Numerical Analysis”, Third Edition, Prentice Hall
India, 1998
2. Geoffery Gordon, “System Simulation”, Second Edition, PHI, 2002.
OBJECTIVES:
The student can well understand the philosophy and psychology of both human
agents and software agents regarding co ordinations operation and communication.
Intelligent / Cognitive aspects are dealt with software knowledge support.
UNIT I AGENTS – OVERVIEW 9
Agent Definition – Agent Programming Paradigms – Agent Vs Object – Aglet – Mobile
Agents – Agent Frameworks – Agent Reasoning.
77
UNIT IV INTELLIGENT SOFTWARE AGENTS 9
Interface Agents – Agent Communication Languages – Agent Knowledge
Representation – Agent Adaptability – Belief Desire Intension – Mobile Agent
Applications- Argumentaic and Knowledge Sharing Agent.
REFERENCES:
1. Russel, Norvig, "Artificial Intelligence: A Modern Approach", Second Edition,
Pearson Education, 2003.
2. Richard Murch, Tony Johnson, "Intelligent Software Agents", Prentice Hall, 2000.
3. Gerhard Weiss, “Multi Agent Systems – A Modern Approach to Distributed Artificial
Intelligence”, MIT Press, 2000.
AIM:
To introduce the performance analysis of networks and to understand the features and
structures required for network management.
OBJECTIVES:
To make a quantitative analysis and performance of network
To explore critical design issues and approaches to meet the communication
requirements
To manage today’s systems effectively and to plan intelligently for the future use of
network management system
TOTAL: 45 PERIODS
TEXT BOOKS:
1. James D.McCabe, “Network Analysis, Architecture and Design”, 2nd Edition,Elsevier
2. Nader F.Mir “Computer and Communication Networks”, Pearson Education.
3. Stallings, William, “SNMP, SNMPv2 and CMIP”, Addison-Wesley, Reading, Mass.,
1993
REFERENCES:
1. Bertsekas & Gallager ,”Data Networks”, second edition ,Pearson Education, 1991
2. William Stallings,”High-Speed Networks”, Prentice-Hall, 1998
3. Mauro and Schmidt,”Essential SNMP”, O'Reilly, 2001
OBJECTIVES:
To characterize the problem space real-time systems address and what are the
specialized requirements of real-time systems
To describe the solutions for standard problems of real-time systems
To characterize the solution space real-time systems employ and how these
solutions tend to differ from other systems
To describe and justify adaptations to the development process to support real-time
systems
To understand the evaluation of real time systems
UNIT I INTRODUCTION 9
Introduction - Issues in Real Time Computing, Structure of a Real Time System. Task
Classes, Performance Measures for Real Time Systems, Estimating Program Run
times. Task Assignment and Scheduling - Classical Uniprocessor scheduling algorithms,
UniProcessor scheduling of IRIS Tasks, Task Assignment, Mode Changes, and Fault
Tolerant Scheduling.
79
UNIT III REAL TIME DATABASES 9
Real time Databases - Basic Definition, Real time Vs General Purpose Databases, Main
Memory Databases, Transaction priorities, Transaction Aborts, Concurrency Control
Issues, Disk Scheduling Algorithms, Two-phase Approach to improve Predictability,
Maintaining Serialization Consistency, Databases for Hard Real Time systems.
UNIT IV COMMUNICATION 9
Real-Time Communication - Communications Media, Network Topologies Protocols,
Fault Tolerant Routing. Fault Tolerance Techniques - Fault Types, Fault Detection. Fault
Error containment Redundancy, Data Diversity, Reversal Checks, Integrated Failure
handling.
OBJECTIVES:
To understand the various principles, practices of TQM to achieve quality.
To learn the various statistical approaches for Quality control.
To understand the TQM tools for continuous process improvement.
To learn the importance of ISO and Quality systems.
UNIT I INTRODUCTION 9
Introduction - Need for quality - Evolution of quality - Definition of quality - Dimensions of
manufacturing and service quality - Basic concepts of TQM - Definition of TQM – TQM
Framework - Contributions of Deming, Juran and Crosby – Barriers to TQM.
80
UNIT II TQM PRINCIPLES 9
Leadership – Strategic quality planning, Quality statements - Customer focus Customer
orientation, Customer satisfaction, Customer complaints, Customer retention - Employee
involvement – Motivation, Empowerment, Team and Teamwork, Recognition and
Reward, Performance appraisal - Continuous process improvement – PDSA cycle, 5s,
Kaizen - Supplier partnership – Partnering, Supplier selection, Supplier Rating.
OBJECTIVES:
Identify the core values that shape the ethical behavior of an engineer.
Utilize opportunities to explore one’s own values in ethical issues.
Become aware of ethical concerns and conflicts.
Enhance familiarity with codes of conduct.
Increase the ability to recognize and resolve ethical dilemmas.
81
UNIT I ENGINEERING ETHICS 9
Senses of ‘Engineering Ethics’ – Variety of moral issues – Types of inquiry – Moral
Dilemmas – Moral Autonomy – Kohlberg’s theory – Gilligan’s theory – Consensus and
Controversy – Professions and Professionalism – Professional Ideals and Virtues –
Uses of Ethical Theories
REFERENCES:
1. Charles D Fleddermann, “Engineering Ethics”, Prentice Hall, New Mexico, (1999).
2. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, (2003)
3. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists
and Engineers”, Oxford University Press, (2001)
4. Prof. (Col) P S Bajaj and Dr. Raj Agrawal, “Business Ethics – An Indian
Perspective”, Biztantra, New Delhi, (2004)
5. David Ermann and Michele S Shauf, “Computers, Ethics and Society”, Oxford
University Press, (2003)
OBJECTIVES:
Study the basic nano technology and nano science.
Understand interdisciplinary nature of this field.
Understand the important role of physics, chemistry ,biology.
Recognize that the rules of nano science are fundamentally different than those
we experience.
Study the basic fabrication strategies of nano science.
82
UNIT I INTRODUCTION 10
Nanoscale Science and Technology- Implications for Physics, Chemistry, Biology and
Engineering-Classifications of nanostructured materials- nano particles- quantum dots,
nanowires-ultra-thinfilms-multilayered materials. Length Scales involved and effect on
properties: Mechanical, Electronic, Optical, Magnetic and Thermal properties.
Introduction to properties and motivation for study (qualitative only).
,
TOTAL: 45 PERIODS
TEXT BOOKS:
1. A.S. Edelstein and R.C. Cammearata, eds., “Nanomaterials: Synthesis, Properties
and Applications”, Institute of Physics Publishing, Bristol and Philadelphia, 1996.
2. N John Dinardo, “Nanoscale charecterisation of surfaces & Interfaces”, 2 nd Edition,
Weinheim Cambridge, Wiley-VCH, 2000
REFERENCES:
1. G Timp (Editor), “Nanotechnology”, AIP press/Springer, 1999
2. Akhlesh Lakhtakia (Editor), “The Hand Book of Nano Technology,Nanometer
Structure”, Theory, Modeling and Simulations, Prentice-Hall of India (P) Ltd,
New Delhi, 2007.
83