MEPCO SCHLENK ENGINEERING COLLEGE, SIVAKASI

(AUTONOMOUS)
AFFILIATED TO ANNA UNIVERSITY, CHENNAI 600 025
REGULATIONS: MEPCO - R2013 (FULL TIME)
B. E. COMPUTER SCIENCE AND ENGINEERING

Department Vision

Department Mission
o To produce globally competent and
quality computer professionals by
educating computer concepts and
techniques.

To become the centre of

excellence in computer
education & research and o To facilitate the students to work with
to create the platform for
recent tools and technologies.
industrial consultancy
o To mould the students by inculcating the
spirit of ethical values contributing to the
societal ethics.

Programme Educational Objectives (PEOs)

After 4 to 6 years of completing the Programme on Bachelor of
Computer Science and Engineering, the graduates will become:

1.

Competent Computer/Software Engineer rendering expertise to

the industrial and societal needs in an effective manner

2.

Sustained learner by adapting to societal change for improved

career opportunities in industries, academics and entrepreneurial
endeavours

3.

Team leader ethically committed to the profession in a multidisciplinary environment with positive attitude towards the
individual, industry and society

60

Programme Outcomes (POs)

During the course of the programme on Bachelor of Computer Science
and Engineering the learners will acquire the ability to:

PO
No.

POs

1.

Apply knowledge of mathematics, science and engineering

fundamentals in computer engineering

2.

Design a Computer system with components and

processes of desired needs within realistic constraints such
as economics, environmental, social, political, ethical,
health and safety.

3.

Identify and modify the functions of the internal software

components such as operating systems and compilers

4.

Apply Software Engineering principles, techniques and tools

for software development

5.

Acquire programming skills for application development in

real-world problem solving

6.

Create, collect, process, view, organize, store, mine and

retrieve data in both local and remote locations in a secure and
effective manner

7.

Design and conduct experiments, as well as to analyze and

interpret data laying foundation for solving complex
problems

8.

Develop project management techniques and to work in team

for successful reach of information to the end users

9.

Create technical
communication.

reports,

presentations,

for

effective

10.

Participate and succeed in various competitive examinations

11.

Realize professional and ethical responsibility and act in

accordance to social welfare

61

PO
No.

POs

12.

Engage
in life-long learning acquiring knowledge
contemporary issues so as to face the career challenges

of

13.

Apply the skills and techniques in computer engineering and

inter-disciplinary domains for providing solutions in a global,
economic, environmental, and societal context

CURRICULUM (I TO VIII SEMESTER)

SEMESTER I (Common to all UG Programmes)
SL.
NO

COURSE
CODE

COURSE TITLE

THEORY
1.

13HS101 Technical EnglishI

2.

13BS101

3.

13BS102 Engineering Physics

4.

13BS103 Engineering Chemistry

5.

13GE101 Engineering Graphics

6.

13GE102 Computer Programming

MathematicsI

PRACTICAL
7.

13BS151

Physics and Chemistry Laboratory

8.

13GE151 Engineering Practices Laboratory

9.

13GE152 Computer Practices Laboratory

TOTAL 17

13 27

62

SEMESTER II Computer Science and Engineering

SL.
NO

COURSE
CODE

COURSE TITLE

THEORY
1.

13HS201 Technical EnglishII*

2.

13BS201 MathematicsII*

3.

13BS202 Environmental Science*

4.

13BS204

5.

Electric Circuits and Electron

13EC201 Devices

7.

Applied Physics and Environmental

13BS251 Chemistry Laboratory (Common to
0
EEE/ECE/CSE/ MECH/IT/Bio-Tech)

8.

13IT251

9.

Linux Commands and Shell

Programming Laboratory
13CS251
0
(Common to EEE/ECE/CSE/IT/BioTech)

18 3

26

Material Science
(Common to EEE/ECE/CSE/IT)

(Common to CSE / IT)

6.

Digital Principles and System

13IT201 Design
(Common to CSE / IT)

PRACTICAL

Digital Circuits Laboratory

(Common to CSE / IT)

TOTAL
*Common to all UG Programmes

63

SEMESTER III
SL.
NO

COURSE
CODE

COURSE TITLE

THEORY
1.

13HS301

Professional Ethics and Moral

Values

2.

13MA301

Mathematics III
(Common to all branches)

3.

13CS301

Data Structures

4.

13CS302

Object Oriented Programming

5.

13CS303

Computer Organization and

Architecture
(Common to CSE / IT)

6.

13IT304

Principles of Communication
(Common to CSE / IT)

PRACTICAL
7.

13HS351

Presentation Skills Laboratory

(Common to Civil / EEE / CSE)

8.

13CS351

Data Structures Laboratory

(Common to CSE / IT)

9.

13CS352

Object Oriented Programming

Laboratory

TOTAL 17

24

64

SEMESTER IV
SL.
NO

COURSE
CODE

COURSE TITLE

Microprocessors and Micro

13CS451
Controllers Laboratory
7.
/
(Common to CSE / 3rd semester
13IT352
IT)

8. 13CS452 System Software Laboratory

18

25

THEORY
1. 13MA403

Discrete Mathematics
(Common to CSE / IT)

Microprocessors and Micro

13CS401 Controllers
2.
/ 13IT302 (Common to CSE / 3rd semester
IT)
3. 13CS402
4.

(Common to CSE / IT)

13CS403 System Software (Common to

/ 13IT506 CSE / 5th semester IT)

5. 13CS404
6.

Design and Analysis of Algorithms

13IT401

Principles of Programming
Languages
Database Management Systems
(Common to CSE / IT)

PRACTICAL

9.

13IT451

Database Management Systems

Laboratory
(Common to CSE / IT)
TOTAL

65

SEMESTER V
SL.
NO

COURSE
CODE

COURSE TITLE

(Common to CSE / 4th semester

IT)

THEORY
1. 13MA501
2.

13CS501

13CS502 /
3.
13IT403

Probability and Queuing Theory

Theory of Computation
Operating Systems

4.

13CS503

Client- Side Technologies

5.

13IT503

Computer Networks
(Common to CSE / IT)

6.

13IT504

Software Engineering
(Common to CSE / IT)

13CS551 /
7.
13IT453

Operating Systems Laboratory

(Common to CSE / 4th semester
IT)

8.

Networks Laboratory
(Common to CSE / IT)

TOTAL 18

24

PRACTICAL

13IT552

SEMESTER VI
SL. COURSE
NO
CODE

COURSE TITLE

THEORY
1. 13CS601

Multimedia Systems

2. 13CS602

Security in Computing

3. 13CS603

Server- Side Technologies

66

4. 13CS604

Compiler Design

5.

Object Oriented Analysis and

Design

Elective I

13HS651
7.
/
13HS551

Professional Communication
Skills Lab
(Common to CSE / IT / ME & BT)

8. 13CS651

Client Server Technologies

Laboratory

TOTAL 18

10

25

13IT602

(Common to CSE / IT)

6.
PRACTICAL

9.

13IT652

Object Oriented Analysis and

Design Laboratory
(Common to CSE / IT)

SEMESTER VII
SL. COURSE
NO CODE

COURSE TITLE

THEORY
1. 13CS701

Pattern Recognition

2. 13CS702

Advanced Computer
Architecture

3. 13CS703
4. 13CS704
5. 13IT703

Computer Graphics
(Common to CSE / IT)
Mobile and Pervasive
Computing
Cloud Computing and Services
(Common to CSE / IT)

67

6.

Elective II

7. 13CS751

Computer Graphics and

Multimedia Laboratory

8. 13CS752

Mobile Application
Development Laboratory

9. 13CS753

Innovative Application Project

(Internal Assessment Only)

18

24

COURSE TITLE

1. 13HS801

Principles of Management and

Engineering Economics

2. 13CS801

Parallel Programming

3.

Elective III

Project Work

12

13

16

PRACTICAL

TOTAL
SEMESTER VIII
SL. COURSE
NO
CODE
THEORY

PRACTICAL
4. 13CS851

TOTAL

TOTAL NO. OF CREDITS: 191

ELECTIVE I (Electives without Lab Component)
COURSE
CODE

COURSE TITLE

1.

13MA902

Combinatorics and Graph

Theory

2.

13CS902

Computational Intelligence

SL.NO.

68

3.

13CS903

System Modeling and

Simulation

4.

13CS904

Principles of Distributed
Systems

5.

13CS905

Database Tuning

6.

13CS906

E-Learning Techniques

7.

13CS907

Network Analysis and

Management

ELECTIVE II (Electives without Lab Component)

SL.NO.

COURSE
CODE

COURSE TITLE

1.

13CS908

Human Computer
Interaction
(Common to CSE / IT)

2.

13CS909

Green Computing

3.

13CS910

Bio Informatics
Technologies

4.

13CS911

Machine to Machine
Communication
(Common to CSE / IT)

5.

6.

13IT910

Cyber Forensics
(Common to CSE / IT)

13IT911

Natural Language
Processing
(Common to CSE / IT)

69

ELECTIVE III (Electives with Lab Component)

SL.NO.

1.

COURSE
CODE
13CS912

COURSE TITLE

Data Warehousing & Data

Mining

(Common to CSE / IT)

2.

13CS913

Software Quality and

Testing

3.

13CS914

Digital Image Processing

(Common to CSE / IT)

4.

13CS915

Semantic Web

13CS916

Digital Signal Processing

Algorithms and
Applications

6.

13IT905

Adhoc and Sensor

Networks
(Common to CSE / IT)

7.

13IT906

5.

Fundamentals of Big Data

(Common to CSE / IT)

OPEN ELECTIVES
Sl.

Subject
Code

Course Title

1.

13MA901 Operations Research

2.

13EE901

Professional Ethics in
Engineering

3.

13EC901 Automotive Electronics

4.

13CS901 Cyber Security

5.

13ME901 Industrial Safety Engineering

No.

70

6.

13ME902 Nano Materials

Intellectual Property Rights

7.

13IT901

8.

13BA901 Engineering Entrepreneurship

9.

13ME903 Human Behavior at Work

Total No. of Credits

: 191 (Regular)

Total No. of Credits

: 138 (LES)

13HS101: TECHNICAL ENGLISH I

LTPC

(Common to all UG Programmes)

3104

Course Objectives:
To enable the students of Engineering and Technology build up
vocabulary
To improve grammatical accuracy
To develop language functions
To understand the basic nuances of language
Course Outcomes:
The students of Engineering and Technology will be able to build
up their vocabulary
Grammatical accuracy will be improved
Language functions will be developed
The basic nuances of language will be understood
UNIT I

12

Listening - Introducing learners to GIE - Types of listening - Listening to

audio (verbal & sounds); Speaking - Speaking about ones place,
important festivals etc. Introducing oneself, ones family / friend;
Reading - Skimming a reading passage Scanning for specific
information - Note-making; Writing - Free writing on any given topic (My
favourite place / Hobbies / School life, etc.) - Sentence completion Autobiographical writing (writing about ones leisure time activities,
hometown, etc.); Grammar - Prepositions - Reference words - Wh71

questions - Tenses (Simple); Vocabulary - Word formation - Word

expansion (root words / etymology); E-materials - Interactive exercises
for Grammar & Vocabulary - Reading comprehension exercises Listening to audio files and answering questions.
UNIT II

12

Listening - Listening and responding to video lectures / talks; Speaking Describing a simple process (filling a form, etc.) - Asking & answering
questions - Telephone skills Telephone etiquette; Reading Critical
reading - Finding key information in a given text - Sifting facts from
opinions; Writing - Biographical writing (place, people) Process
descriptions (general / specific) - Definitions Recommendations;
Instruction; Grammar - Use of imperatives - Subject-verb agreement;
Vocabulary - Compound words - Word Association; E-materials Interactive exercises for Grammar and Vocabulary - Listening exercises
with sample telephone conversations / lectures Picture-based
activities.
UNIT III

12

Listening - Listening to specific task - focused audio tracks; Speaking Role-play Simulation - Group interaction - Speaking in formal situations
(teachers, officials, foreigners); Reading - Reading and interpreting
visual material; Writing - Jumbled sentences - Coherence and cohesion
in writing - Channel conversion (flowchart into process) - Types of
paragraph (cause & effect / compare & contrast / narrative / analytical) Informal writing (letter/e-mail/blogs) - Paraphrasing; Grammar - Tenses
(Past) - Use of sequence words - Adjectives; Vocabulary - Different
forms and uses of words, Cause and effect words; E-materials Interactive exercises for Grammar and Vocabulary - Excerpts from films
related to the theme and follow up exercises - Pictures of flow charts and
tables for interpretations
UNIT IV

12

Listening - Watching videos / documentaries and responding to

questions based on them; Speaking - Responding to questions Different forms of interviews - Speaking at different types of interviews;

72

Reading - Making inference from the reading passage - Predicting the

content of a reading passage; Writing - Interpreting visual materials (line
graphs, pie charts etc.) - Essay writing Different types of essays;
Grammar - Adverbs Tenses future time reference; Vocabulary Single word substitutes - Use of abbreviations & acronyms; E-materials Interactive exercises for Grammar and Vocabulary - Sample interviews
film scenes - dialogue writing.
UNIT V

12

Listening
Listening
to
different
accents,
Listening
to
Speeches/Presentations, Listening to broadcast & telecast from Radio &
TV; Speaking - Giving impromptu talks, Making presentations on given
topics; Reading - Email communication - Reading the attachment files
having a poem/joke/proverb - Sending their responses through email
Writing - Creative writing, Poster making; Grammar - Direct and indirect
speech; Vocabulary - Lexical items (fixed / semi fixed expressions); Ematerials - Interactive exercises for Grammar & Vocabulary - Sending
emails with attachment Audio / video excerpts of different accents, Interpreting posters.
TOTAL: 60 PERIODS
TEXTBOOKS:
1. Dept of English, Anna University, Chennai. Mindscapes: English
for Technologists and Engineers. Orient Black Swan, Chennai.
2012.
REFERENCE BOOKS:
1. Raman,
Meenakshi
&
Sangeetha
Sharma.
Technical
Communication: English Skills for Engineers. Oxford University
Press, New Delhi. 2011.
2. Dhanavel, S.P. English and communication skills for students of
science and Engineering.
Orient Black Swan publications, Chennai, 2011.
3. Rizvi M, Ashraf. Effective Technical Communication.
McGraw-Hill publishing company limited, New Delhi, 2007.

73

Tata

4. Rutherford, Andrea J. Basic Communication Skills for Technology.

Pearson Edition
(II Edition), New Delhi, 2001.
Extensive reading:
1. Roy, Arunthathi. The God of small things. Penguin Books India,
2002.
13BS101: MATHEMATICS I
(Common to all UG Programmes)

LTPC
3104

Course 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. This
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
Course Outcomes:
At the end of the course students are able to
Expertise matrix algebra
Apply tests of convergence
Understand and apply functions of several variables
Evaluate integrals using Beta and Gamma function
Expertise multiple integrals and their usage
UNIT 0

(Not for Examination)

5+0

74

Basic concepts on limits, continuity, derivative & integrals of a single

variable
UNIT I

MATRICES

9+3

Eigenvalues and Eigenvectors of a real matrix Characteristic equation

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
UNIT II

INFINITE SERIES

9+3

Sequences Convergence of series General properties Series of

positive terms Tests of convergence (Comparison test, Integral test,
Comparison of ratios and DAlemberts ratio test) Alternating series
Series of positive and negative terms Absolute and conditional
convergence Power Series Convergence of exponential, logarithmic
and Binomial Series.
UNIT III

FUNCTIONS OF SEVERAL VARIABLES

9+3

Limits and Continuity Partial derivatives Homogeneous functions and

Eulers theorem Total derivative Differentiation of implicit functions
Change of variables Jacobian Partial differentiation of implicit
functions Taylors series for functions of two variables Errors and
approximations Maxima and minima of functions of two variables
Lagranges method of undetermined multipliers
UNIT IV IMPROPER INTEGRALS

9+3

Improper integrals of the first and second kind and their convergence
Evaluation of integrals involving a parameter by Leibnitz rule Beta and
Gamma functions Properties Evaluation of integrals using Beta and
Gamma functions Error functions
UNIT V

MULTIPLE INTEGRALS

9+3

Double integrals Change of order of integration Double integrals in

polar coordinates Area enclosed by plane curves Triple integrals
Volume of Solids Change of variables in double and triple integrals
Area of a curved surface

75

TOTAL: 65 PERIODS
TEXT BOOKS:
1. Grewal B.S., Higher Engineering Mathematics,
Publishers, New Delhi, 40th Edition, 2007

Khanna

2. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley

& Sons (ASIA) Pte Ltd, Singapore, 8th Edition, 2002
REFERENCE BOOKS:
1. Ramana B.V., Higher Engineering Mathematics, Tata McGraw
Hill Co. Ltd.,New Delhi, 11th Reprint, 2010
2. Jain R.K. and Iyengar S.R.K., Advanced Engineering
Mathematics, Narosa Publications, New Delhi, 3rd Edition, 2007
3. Allen Jeffrey, Advanced Engineering Mathematics,Academic
press publications, Elseiver India, First edition 2003(For unit 0Section 1.8,1.9,1.11)
4. Greenberg M.D., Advanced Engineering Mathematics, Pearson
Education, New Delhi, 2nd Edition, 5th Reprint, 2009
5. Peter V.ONeil, Advanced Engineering Mathematics, Cengage
Learning India Pvt., Ltd, New Delhi, 2007

13BS102: ENGINEERING PHYSICS

LTPC

(Common to all UG Programmes)

3003

Course Objectives
To impart sound knowledge about basic concepts of physics.
To introduce the basic physics concepts relevant to different
branches of Engineering and Technology
To introduce the fundamentals of physics and its applications in
engineering.
Course Outcomes:
The students will be able to understand the elastic properties of
the materials.

76

 The students will acquire knowledge about solid state physics.

The students will acquire knowledge about the basic concepts of
physics in the topics such as acoustics, ultrasonics, thermal
physics, and applied optics.
UNIT I

PROPERTIES OF MATTER

Elasticity - Poissons ratio and relationship between moduli (qualitative) Stress-strain diagram - factors affecting elasticity - bending of beams cantilever - bending moment - theory and experiment of Youngs
modulus determination - Uniform and non-uniform bending - I shaped
girders - twisting couple - hollow cylinder - shaft - torsion pendulum determination of rigidity modulus- moment of inertia of a body (regular
and irregular).
UNIT II

ACOUSTICS AND ULTRASONICS

Classification of sound - loudness and intensity - Weber-Fechner Law standard intensity and intensity level - decibel - reverberation reverberation time - rate of growth and decay of sound intensity derivation of Sabines formula - absorption coefficient and its
determination factors affecting acoustics of buildings : focussing,
interference, echo, Echelon effect, resonance - noise and their remedies.
Ultrasonics - production - magnetostriction and piezoelectric methods detection of ultrasound - acoustic grating - industrial applications - NDT
Ultrasonic method: scan modes and practice.
UNIT III

THERMAL PHYSICS

Thermal expansion - thermal stress - expansion joints - bimetallic strips

- thermal conductivity- conductions in solids - Forbes and Lees disc
methods - Rectilinear flow of heat through a rod -flow of heat through a
compound materials - radial flow of heat thermal insulation of
buildings Laws of blackbody radiation: Kirchhoffs law, Stephens law,
Wiens law, Raleigh-Jeans law and Plancks law (derivation). Laws of
thermodynamics - Otto and diesel engines and their efficiency - entropy
- entropy of Carnots cycle - reverse Carnots cycle - refrigerator.
UNIT IV

APPLIED OPTICS

77

Interference - Michelson interferometer: construction, working,

determination of wave length and thickness - anti-reflection coating - air
wedge and its application - Lasers - Einsteins coefficients - CO2,
Nd:YAG and semiconductor lasers - homojunction and hetrojunction construction and working - applications - Optical fibres - classification
(index & mode based) - principle and propagation of light in optical fibres
- acceptance angle and numerical aperture - fibre optic communication
system - active and passive sensors.
UNIT V

SOLID STATE PHYSICS

Nature of bonding - growth of single crystals (qualitative) - unit cell,

crystal systems, Bravais space lattices - crystal planes and directions,
Miller indices - expressions for interplanar distance - coordination
number and packing factor for simple structures: SC, BCC, FCC and
HCP - structure and significance of NaCl, ZnS, diamond and graphite crystal imperfections: point defects, dislocations and stacking faults.
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Marikani A, Engineering Physics, PHI, New Delhi, 2013.
2. Gaur R.K., and Gupta, S.L., Engineering Physics, Dhanpat Raj
Publications, 2003
REFERENCE BOOKS:
1. Sankar, B.N., Pillai.S.O.,
International (P) Ltd., 2007.

Engineering

Physics,

New

Age

2. Palanisamy, P.K., Engineering Physics, Scitech Publications (P)

Ltd, 2006.
3. Arumugam, M., Engineering Physics, Anuradha Publications,
2000.
4. John W. Jewett. Jr, and Raymon A. Serway, Physics for Scientists
and Engineers with Modern Physics Seventh Edition, Cengage
Learnings, Delhi, India, 2008.
5. David Halliday, Robert Resnick and Jearl Walker, Fundamentals of
Physics, sixth edition, John Wiley and Sons, New Delhi, 2008.
78

13BS103: ENGINEERING CHEMISTRY

(Common to all UG Programmes)

LTPC
3003

Course Objectives:
To make the students familiar with
The treatment of water for potable and industrial purposes.
The principles of electrochemistry, electrochemical cells, emf and
applications of emf measurements.
The principles of corrosion and corrosion control techniques.
Different types of fuels and combustion.
Different materials and their engineering applications.
Course Outcomes :
At the end of the course the student will be able to
Understand the basic principles of water quality parameters, their
analysis and various water treatment processes for domestic and
industrial applications.
Understand the basic principles of electrochemistry and its
applications.
Know the principles, various types of corrosion and corrosion
control techniques.
Have a sound knowledge on various engineering materials and
their industrial applications.
Have a sound knowledge on different types of fuels.
UNIT I WATER TECHNOLOGY

Characteristics of water alkalinity types of alkalinity and

determination hardness types of hardness and estimation by EDTA
method (problems); Boiler feed water requirements disadvantages of
using hard water in boilers priming and foaming scales and sludges
Caustic embrittlement boiler corrosion external conditioning
(demineralization process) internal conditioning (colloidal, phosphate,

79

carbonate and calgon conditionings) Domestic water treatment

disinfection methods (Chlorination, Ozonation. UV treatment) break
point chlorination Salinity desalination by reverse osmosis.
UNIT II ELECTROCHEMISTRY

Electrochemical cells reversible and irreversible cells EMF

measurement of emf Single electrode potential Nernst equation
(problems) reference electrodes Standard Hydrogen electrode
Calomel electrode Ion selective electrode glass electrode and
measurement of pH Standard Cell electrochemical series
significance potentiometric redox titration conductometric titrations
(acid-base titrations).
UNIT III CORROSION AND ITS CONTROL

Chemical corrosion Pilling Bedworth rule electrochemical corrosion

differential aeration corrosion factors influencing corrosion different
types galvanic corrosion erosion corrosion pitting corrosion
crevice corrosion waterline corrosion stress corrosion corrosion
control sacrificial anode and impressed current cathodic methods
corrosion inhibitors Protective coatings metallic coating
pretreatment of surface hotdipping spraying cladding
cementation electroplating (Cr, Cu, Ni and Au) electrolessplating
(electroless nickel plating only).
UNIT IV ENGINEERING MATERIALS

Refractories classification acidic, basic and neutral refractories

properties (refractoriness, refractoriness under load, dimensional
stability, porosity, thermal spalling) manufacture of alumina, magnesite
and zirconia bricks.
Lubricants mechanism of lubrication, liquid lubricants properties
(viscosity index, flash and fire points, cloud and pour points, oiliness)
solid lubricants graphite and molybdenum disulphide semi solid
lubricants and emulsions.
Nanomaterials introduction to nano chemistry carbon nanotubes and
their applications.

80

UNIT V FUELS AND COMBUSTION

Fuels Classification Calorific value(Problems) Coal proximate

and ultimate analysis metallurgical coke manufacture by OttoHoffmann method Hydrogenation of coal Petroleum processing
and fractions cracking catalytic cracking and methods knocking
octane number and cetane number synthetic petrol Fischer Tropsch
and Bergius processes Gaseous fuels water gas, producer gas,
CNG and LPG, Flue gas analysis Orsat apparatus Combustion
theoretical calculation of air(Problems).
TOTAL: 45 PERIODS
TEXT BOOKS:
1. P. C. Jain and Monica Jain, Engineering Chemistry Dhanpat Rai
Pub, Co., New Delhi (2009).
2. S. S. Dara A text book of engineering chemistry S. Chand & Co.
Ltd., New Delhi (2010).
REFERENCES:
1. Mars G. Fontana, Corrosion Engineering, Tata McGraw Hill
Publishing Company (P) Ltd., New Delhi, 2009
2. B. K. Sharma Engineering chemistry Krishna Prakasan Media (P)
Ltd., Meerut (2006).
3. B. Sivasankar Engineering Chemistry Tata McGraw-Hill Pub. Co.
Ltd, New Delhi (2008).

13GE101: ENGINEERING GRAPHICS

(Common to all UG Programmes)

LTPC
2044

Course Objectives:
To gain knowledge on the basics of Engineering Drawing
construction procedures.
To understand the principles involved in graphic skill for
communication of concepts, ideas and design of Engineering
products.

81

 To draw the drawing of various solids.

To expose the above to existing national standards related to
technical drawings.
An ability to draw the drawing for any given object to the required
standard.
Course Outcomes:
Sketch multiple views of Engineering components
Create the projection of point, straight line and plane
Project the solid objects
Section the solid
Develop lateral surfaces of solids
Apply isometric and perspective projections
Concepts and Conventions
(Not for Examination)

Importance of graphics in engineering applications Use of

drafting instruments BIS conventions and specifications Lettering
and Dimensioning-Size, layout and folding of drawing sheets.
UNIT I

Plane Curves and

Orthographic Views

Pictorial

Views

to

14

Geometrical Constructions like bisection of a straight line, division of a

straight line into n equal parts, bisection of angles, Curves used in
engineering practices: Conics Construction of ellipse, parabola and
hyperbola by eccentricity method Construction of cycloid
construction of involutes of square and circle Drawing of tangents and
normal to the above curves.
Orthographic projection principles Principal planes- Representation
of Three Dimensional objects Layout of views Sketching of multiple
views (Front, Top and Side views) from pictorial views of simple objects
and Engineering Components.
UNIT II

Projection of Points, Lines and Plane Surfaces

82

14

First Angle projectionprojection of points in four quadrants. Projection

of straight lines (only First angle projection) inclined to both the principal
planes Determination of true lengths and true inclinations by rotating
line method and traces.
Projection of planes (polygonal and circular surfaces) inclined to both
the principal planes by change of position method.
UNIT III

Projection of Solids

14

Projection of simple solids like prisms, pyramids, cylinder and cone

when the axis is inclined to one of the principal planes by change of
position method.
UNIT IV Section of Solids and Development of Lateral
Surfaces of Solids

14

Sectioning of above solids in simple vertical position when the cutting

plane is inclined to the one of the principal planes and perpendicular to
the other obtaining true shape of the section.
Development of lateral surfaces of simple solids Prisms, pyramids,
cylinders and cones. Development of lateral surfaces of sectioned solids
and simple applications like funnel.
UNIT V

Isometric and Perspective Projections

14

Principles of isometric projection isometric scale Isometric View

Isometric projections of simple solids and cut solids Prisms, pyramids,
cylinders, cones combination of two solid objects in simple vertical
positions.
Perspective projection of simple solidsPrisms, pyramids and cylinders
by visual ray method.
TOTAL: 75 PERIODS
TEXT BOOKS:
1. N.D. Bhatt, Engineering Drawing Charotar Publishing House, 50th
Edition, (2010).

REFERENCE BOOKS:

83

1. Gopalakrishna K.R., Engineering Drawing (Vol. I&II combined),

Subhas Stores, Bangalore, 2007.
2. Luzzader, Warren.J, and Duff,John M., Fundamentals of
Engineering
Drawing
with
an introduction to Interactive
Computer Graphics for Design and Production, Eastern Economy
Edition, Prentice Hall of India Pvt. Ltd, New Delhi, 2005.
3. Shah M.B., and Rana B.C., Engineering Drawing, Pearson, 2nd
Edition, 2009.
4. Venugopal K. and Prabhu Raja V., Engineering Graphics, New
Age International (P) Limited, 2008.
5. Natrajan K.V., A text book of Engineering
Dhanalakshmi Publishers, Chennai, 2009.

Graphics,

6. Basant Agarwal and Agarwal C.M., Engineering Drawing, Tata

McGraw Hill Publishing Company Limited, New Delhi, 2008.
Publication of Bureau of Indian Standards:
1. IS 10711 2001: Technical products Documentation Size and
lay out of drawing sheets.
2. IS 9609 (Parts 0 & 1) 2001: Technical products Documentation
Lettering.
3. IS 10714 (Part 20) 2001 & SP 46 2003: Lines for technical
drawings.
4. IS 11669 1986 & SP 46 2003: Dimensioning of Technical
Drawings.
5. IS 15021 (Parts 1 to 4) 2001: Technical drawings Projection
Methods.
Special points applicable to End Semester Examinations on
Engineering Graphics:
1. There will be five questions, each of either or type covering all
units of the syllabus.
2. All questions will carry equal marks of 20 each making a total of
100.

84

3. The answer paper shall consist of drawing sheets of A3 size

only. The students will be permitted to use appropriate scale to fit
solution within A3 size.
4. The examination will be conducted in appropriate sessions on the
same day
13GE102: COMPUTER PROGRAMMING

LTPC

(Common to all UG Programmes)

3003

Course Objectives:
To gain knowledge on the basic concepts of a computer system
To get acquainted with the method of number system conversion
To learn how to write modular and readable C program
To learn to use pointers for storing data in the main memory
efficiently
To exploit the notion of derived data types
Course Outcomes:
Extrapolate the basics about computer
Recognize different types of number systems as they relate to
computers.
Develop modular C programs for a given problem
Explicitly manage memory using pointers
Capable of grouping different kinds of information related to a
single entity
Store a large homogeneous data and record like data
Process a text data
Store the data for future use in structured and unstructured format
UNIT I

COMPUTER FUNDAMENTALS

Generation and Classification of Computers - Basic Organization of a

Computer - Hardware - Classification of computer software Number
System: Binary, Decimal, Hexadecimal, Octal, and Conversion

85

Problem Solving Techniques: Introduction to Algorithm, Pseudo code,

Flow Chart Case Studies
UNIT II

C DATATYPES AND STATEMENTS

10

Structure of a C program, compilation and linking processes - C

Tokens: Constants, Variables Data Types: Primitive Data Types, Type
Definition, Enumeration, Qualifiers, Storage classes Operators and
Expressions - Managing Input and Output operations Decision Making:
Branching statements, Looping statements-Problem Solving with Basic
statements
UNIT III

ARRAYS AND STRINGS

Arrays: Declaration, Initialization, One dimensional, Two dimensional,

and Multidimensional arrays - String: String operations Manipulating
String Arrays Problem Solving with Arrays and Strings
UNIT IV

FUNCTIONS AND POINTERS

Function : Declaration, Definition, Parameter passing methods,

Recursion Pointers: Declaration, Definition, Pointers and Functions,
Pointer arithmetic, Pointer to an Array, Array of Pointers, Pointer to
Pointer, Pointer to Void (generic pointer), Pointer to function - Dynamic
Memory Allocation - Problem Solving with Functions and Pointers
UNIT V

STRUCTURES, UNIONS AND FILE HANDLING

Structure: Need for Structure, Declaration, Definition, Array of

Structures, Pointer to Structure, Structure within a Structure, Structures
and functions, Bit fields in Structure Structures and Union - Files: File
Management functions, Working with Text Files, and Binary Files -Preprocessor directives - Problem Solving with Structures, Unions and
Files
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Pradip Dey, Manas Ghosh, Fundamentals of Computing and
Programming in C, First Edition, Oxford University Press, 2009
2. Ashok N. Kamthane,
Education, 2007.

Computer

86

programming,

Pearson

3. Kernighan,B.W and Ritchie,D.M, The C Programming

language, Second Edition, Pearson Education, 2006
REFERENCE BOOKS:
1. Byron S Gottfried, Programming with C, Schaums Outlines,
Second Edition, Tata McGraw-Hill, 2006.
2. R.G. Dromey, How to Solve it by Computer, Pearson Education,
Fourth Reprint, 2007
3. Deitel.P.J and Deitel.H.M, C How to Program, Fifth Edition,
Prentice-Hall of India,2008
4. Yashavant P. Kanetkar. Let Us C, BPB Publications, 2011.
WEB REFERENCES:
1. www.w3schools.in/c-programming-language
2. http://www.tutorialspoint.com/cprogramming/index.htm
3. http://www.cprogramming.com/tutorial/c-tutorial.html
4. http://fresh2refresh.com/c-tutorial-for-beginners

13BS151: PHYSICS AND CHEMISTRY LABORATORY

(Common to all UG Programmes)
(Classes on Alternate Weeks for Physics and Chemistry
Laboratory)

LTPC
0032

Course Objectives:
To have a study on determination of rigidity modulus and Youngs
modulus
To be familiar with finding thickness of a thin paper
To deal with the determination of ultrasonic velocity
To have a study on estimation of hardness and alkalinity of water
To deal with Conductometric titration and Potentiometric titration

Course Outcomes:

87

 Find moment of inertia of disc and rigidity modulus of wire

Determine thickness of a thin sheet of paper
Find thermal conductivity of bad conductor
Estimate hardness and alkalinity of water sample
Do conductometric titration and Potentiometric titration
Find corrosion rate
LIST OF EXPERIMENTS FOR PHYSICS LABORATORY
(Any FIVE Experiments)
1.

Torsional pendulum Determination of rigidity modulus of wire and

moment of inertia of disc

2.

Non-uniform bending- Youngs modulus determination

3.

Air-wedge- Determination of thickness of a thin sheet of paper

4.

Spectrometer- Determination of wavelength of Hg spectrum using

grating

5.

Viscosity of liquids- Determination of co-efficient of viscosity of a

liquid by Poiseuilles method

6.

Lees disc-Determination of thermal conductivity of bad conductor

7.

Determination of ultrasonic velocity of sound and compressibility of

liquid Ultrasonic interferometer.

REFERENCE
1.

Physics Laboratory Manual, Department of Physics, Mepco

Schlenk Engineering College, Sivakasi.

LIST OF EXPERIMENTS FOR CHEMISTRY LABORATORY

(Any FIVE Experiments)
1.

Estimation of hardness of water by EDTA method

2.

Estimation of alkalinity of water sample

3.

pH-metric titration (acid & base)

4.

Conductometric titration (strong acid vs strong base)

5.

Conductometric titration (mixture of acids vs strong base)

88

6.

Potentiometric titration between ferrous ion and potassium

dichromate

7.

Determination of corrosion rate by weight loss method

REFERENCES
1. A.I. Vogel, A Text Book of Quantitative Inorganic Analysis, ELBS
London, 1995.
2. D.P. Shoemaker and C.W. Garland, Experiments in Physical
Chemistry, McGraw Hill, London, 2001.
TOTAL: 45 PERIODS

13GE151: ENGINEERING PRACTICES

LABORATORY

LTPC
0032

(Common to all UG Programmes)

Course Objectives:
To provide exposure to the students with hands on experience on
various basic engineering practices in Civil, Mechanical, Electrical
and Electronics Engineering.
To have a study and hands-on-exercise on plumbing and
carpentry components.
To have a practice on gas welding, foundry operations and fitting
To have a study on measurement of electical quantities, energy
and resistance to earth.
To have a practice on soldering
Course Outcomes:
Do pipe connections with different joining components.
Create joints for roofs, doors, windows and furniture
Prepare square fitting and vee fitting models
Do residential house wiring
Measure energy and resistance to earth of an electrical
equipment
89

 Apply soldering
GROUP A (CIVIL & MECHANICAL)
I

CIVIL ENGINEERING PRACTICE

Buildings:
Study of plumbing and carpentry components of residential and
industrial buildings, Safety aspects.
Plumbing Works:
1. Study of pipeline joints, its location and functions: valves, taps,
couplings, unions, reducers, and elbows in household fittings.
2. Study of pipe connections requirements for pumps and turbines.
3. Preparation of plumbing line sketches for water supply and
sewage works.
4. Hands-on-exercise: Basic pipe connections Mixed pipe material
connection Pipe connections with different joining components.
5. Demonstration of plumbing requirements of high-rise buildings.
Carpentry using Power Tools only:
1. Study of the joints in roofs, doors, windows and furniture.
2. Hands-on-exercise: Wood work, joints by sawing, planning and
cutting.
II

MECHANICAL ENGINEERING PRACTICE

13

Welding:
Preparation of arc welding of butt joints, lap joints and tee joints.
Basic Machining:
1. Simple Turning, Step turning
2. Drilling Practice using drilling machine.
Sheet Metal Work:
1. Forming & Bending:
2. Model making Trays, funnels, etc.
3. Different type of joints.

90

Machine assembly practice:

1. Study of centrifugal pump
2. Study of air conditioner
Demonstration on:
1. Gas welding practice
2. Smithy operations, upsetting, swaging, setting down and bending.
Example Exercise Production of hexagonal headed bolt.
3. Foundry operations like mould preparation for gear and step cone
pulley.
4. Fitting Exercises Preparation of square fitting and vee fitting
models.
GROUP B (ELECTRICAL AND ELECTRONICS)
III

ELECTRICAL ENGINEERING PRACTICE

10

1. Residential house wiring using switches, fuse, indicator, lamp and

energy meter.
2. Fluorescent lamp wiring.
3. Stair case wiring
4. Measurement of electrical quantities voltage, current, power &
power factor in RLC circuit.
5. Measurement of energy using single phase energy meter.
6. Measurement of resistance to earth of an electrical equipment.
IV

ELECTRONICS ENGINEERING PRACTICE

13

1. Study of Electronic components and equipments Resistor,

colour coding measurement of AC signal parameter (peak-peak,
rms period, frequency) using CRO.
2. Study of logic gates AND, OR, EXOR and NOT.
3. Generation of Clock Signal.
4. Soldering practice Components Devices and Circuits Using
general purpose PCB.
5. Measurement of ripple factor of HWR and FWR.

91

TOTAL: 45 PERIODS
REFERENCE BOOKS:
1. K.Jeyachandran, S.Natarajan & S, Balasubramanian, A Primer
on Engineering Practices Laboratory, Anuradha Publications,
(2007).
2. T.Jeyapoovan, M.Saravanapandian & S.Pranitha, Engineering
Practices Lab Manual, Vikas Publishing House Pvt. Ltd, (2006)
3. H.S. Bawa, Workshop Practice, Tata McGraw Hill Publishing
Company Limited, (2007).
4. A.Rajendra Prasad & P.M.M.S. Sarma, Workshop Practice,
Sree Sai Publication, (2002).
5. P.Kannaiah & K.L.Narayana, Manual on Workshop Practice,
Scitech Publications, (1999).
SEMESTER EXAMINATION PATTERN
The Laboratory examination is to be conducted for Group A & Group B,
allotting 90 minutes for each group, with a break of 15 minutes. Both
the examinations are to be taken together in sequence, either in the FN
session or in the AN session. The maximum marks for Group A and
Group B lab examinations will be 50 each, totaling 100 for the Lab
course. The candidates shall answer either I or II under Group A and
either III or IV under Group B, based on lots.
List of equipment and components
(For a Batch of 30 Students)
CIVIL ENGINEERING
1.

Assorted components for plumbing consisting of metallic 15 Sets.

pipes, plastic pipes, flexible pipes, couplings, unions,
elbows, plugs and other fittings.

2.

Carpentry vice (fitted to work bench)

15 Nos.

3.

Standard woodworking tools

15 Sets.

4.

Models of industrial trusses, door joints, furniture joints

5 each

5.

Power Tools:

92

(a) Rotary Hammer

2 Nos.

(b) Demolition Hammer

2 Nos.

(c) Circular Saw

2 Nos.

(d) Planer

2 Nos.

(e) Hand Drilling Machine

2 Nos.

(f) Jigsaw

2 Nos.

MECHANICAL ENGINEERING
1.

Arc welding transformer with cables and holders

5 Nos.

2.

Welding booth with exhaust facility

5 Nos.

3.

Welding accessories like welding shield, chipping 5 Sets.

hammer, wire brush, etc.

4.

Oxygen and acetylene gas cylinders, blow pipe and 2 Nos.

other welding outfit.

5.

Centre lathe

10 Nos.

6.

Drilling machine

2 Nos.

7.

Hearth furnace, anvil and smithy tools

2 Sets

8.

Moulding table, foundry tools

2 Sets

9.

Power Tool: Angle Grinder

2 Nos.

10.

Study-purpose items: centrifugal pump, air-conditioner

1 each.

ELECTRICAL
1.

Assorted electrical components for house wiring

10 Sets

2.

Electrical measuring instruments

15 Sets.

3.

Study purpose items: Iron box, fan and regulator, 1 each

emergency lamp

4.

Megger (250V/500V).

1 No.

5.

Power Tools:

(a) Range Finder

2 Nos.

(b) Digital Live-wire detector

2 Nos.

ELECTRONICS
1.

Soldering guns

10 Nos.

93

2.

Assorted electronic components for making circuits

50 Nos.

3.

Small PCBs

10 Nos.

4.

Multimeters

10 Nos.

5.

Study purpose items: Telephone, FM radio, low-voltage

power supply

2 Nos.

13GE152: COMPUTER PRACTICES LABORATORY

(Common to all UG Programmes)

LTPC
0032

Course Objectives:
To develop C programs using conditional and looping statements
To expertise in arrays and strings
To build modular programs
To explicitly manage memory using pointers
To group different kinds of information related to a single entity
To visualize and present data using office packages
Course Outcomes:
Implement program using control statements
Handle arrays and strings
Develop reusable modules
Store data in main memory effectively using pointers
Form heterogeneous data using structures
Use office packages for documentation and presentation
SYLLABUS FOR THE LABORATORY:
1.

Programs using simple statements

2.

Programs using decision making statements

3.

Programs using looping statements

4.

Programs using one dimensional and two dimensional arrays

5.

Solving problems using string functions

94

6.

Programs using user defined functions and recursive functions

7.

Programs using pointers

8.

Programs using functions and pointers

9.

Programs using structures and unions

10.

Word Processing

11.

Document Creation, Text Manipulation with Scientific Notation

Table creation, Table formatting and Conversion.

Mail merge and Letter preparation.

Drawing - Flow Chart

Spread Sheet

Chart - Line, XY, Bar and Pie.

Formula - formula editor.

12.

Inclusion of object, Picture and graphics, protecting the

document and sheet.

PowerPoint Presentation- Slides preparation using templates and

animation
TOTAL: 45 PERIODS

REFERENCE BOOKS:
1. Pradip Dey, Manas Ghosh, Fundamentals of Computing and
Programming in C, First Edition, Oxford University Press, 2009
2. Kernighan,B.W and Ritchie,D.M, The C Programming
language, Second Edition, Pearson Education, 2006
3. Byron S Gottfried, Programming with C, Schaums Outlines,
Second Edition, Tata McGraw-Hill, 2006.
4. Deitel.P.J and Deitel.H.M, C How to Program, Fifth Edition,
Prentice-Hall of India,2008
5. Yashavant P. Kanetkar. Let Us C, BPB Publications, 2011.
WEB REFERENCES:
1. http://www.w3schools.in/c-programming-language

95

2. http://www.tutorialspoint.com/cprogramming/index.htm
3. http://www.cprogramming.com/tutorial/c-tutorial.html
4. http://fresh2refresh.com/c-tutorial-for-beginners
List of Sample Exercises
1. A company XYZ pays their employers on a monthly basis. It pays
their employers with DA=50% of BP, HRA=10% of BP,
allowance=Rs.1000.The company needs to automate the salary
computation based on the basic pay. Develop an application to
compute the gross salary of an employee given their basic pay
2. Collecting money becomes increasingly difficult during periods of
recession, so companies may tighten their credit limits to prevent
their accounts receivable (money owed to them) from becoming too
large. In response to a prolonged recession, one company has cut
its customers credit limits in half. Thus, if a particular customer had
a credit limit of $2000, its now $1000. If a customer had a credit
limit of $5000, its now $2500. Write a program that analyzes the
credit status of a customer. For each customer youre given:
The customers account number
The customers credit limit before the recession
The customers current balance (i.e., the amount the
customer owes the company).
Your program should calculate and print the new credit limit for the
customer and should determine and print whether customer has
current balance that exceeds their new credit limits.
3. A right triangle can have sides that are all integers. The set of three
integer values for the sides of a right triangle is called a
Pythagorean triple. These three sides must satisfy the relationship
that the sum of the squares of two of the sides is equal to the
square of the hypotenuse. Find all Pythagorean triples for side1,
side2, and the hypotenuse all no larger than 500.Use a triple-nested
for loop that simply tries all possibilities (hypotenuse2 = side12 +
side22).

96

4. Write a program that simulates the rolling of two dice. The program
should use rand to roll the first die, and should use rand again to roll
the second die. The sum of the two values should then be
calculated. [Note: Since each die can show an integer value from 1
to 6, then the sum of the two values will vary from 2 to 12].Your
program should roll the two dice 1,000 times. Store the numbers of
times each possible sum appears and print the results in a tabular
format.
5. Dates are commonly printed in several different formats in business
correspondence. Two of the more common formats are 07/21/2003
and July 21, 2003.Write a program that reads a date in the first
format and prints it in the second format
6. A banking application need to be developed for a bank. The
operational features contain a list of the transactions that can be
performed. These transactions are as follows:

Deposit
funds
to
an
checking/savings, amount)

Withdraw funds from an

checking/savings, amount)

Transfer funds from one account to another (required info.:

checking/savings, amount, other account number, other
checking/savings)

Query the balance

checking/savings)

of

account

any

account

account

(required
(required

(required

info.:
info.:

info.:

Develop an application to automate the above operational features.

7. A class contains a total strength of 50 in which there 20 girls and 30
boys. The department needs to assign roll number for the students
based on their names in alphabetical order. Develop a software to
automate the task
8. A journal publication company wants to automate the review
process. The software should check for the number of prepositions
and conjunctions. If the count exceeds 30% of the content then it

97

should reject the paper. Develop the software.

9. A telephone directory contains information such as name, phone
number and address. For advertising a product a company needs
software to get the phone number of the people in a specific
location and display their name and phone number in sorted order
10. Word:
i) Create a new word document named Student Record and
Set left margin at 1.8 and right margin at 1.3.
Your heading should be in Times New Roman, Bold and
Italic with size 12.
Include the Page number at the top of every page
Type your personal details.
Table with details of 10 students with the following fields:
Student name, Department, Internal, External, total, result,
Examination held.
ii) Create a word document named Scientific Notation and type
one paragraph about the Equation editor with font size 10, and
in Calibri format. Apply page set up with line spacing of 1 and
type the following equations
2

b
b

4
ac
X

2
a

xn1
n
x
dx

n1

iii) Create an interview call letter as the main document and

create 10 records for 10 persons. Use mail merge to create
letters for the 10 persons
iv) Draw the flowchart using Open Office Write for checking
whether the given number is Armstrong or not and to find the
product of digits of a number
11. Excel
a) The following table shows the average number of vehicles per

98

hour for a week. Create Bar Graph , 3D and Pie Chart for the
following:
Day
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday

Cars

Buses

TwoWheelers

Other
Vehicles

1486
1210
1197
1234
1372
1637
1747

700
575
562
432
628
843
917

595
423
456
500
512
612
770

2100
1821
1731
1927
2021
2348
2538

b) Create a sheet in EXCEL as shown below

Roll
No

Name

M1

M2

M3

M4

Total

Percentage

Status

Maximum
Minimum
Validate the columns M1, M2, M3 and M4 so that the marks lie in
the range 0- 100 and enter the roll number of the students using
auto fill.
Calculate Total = sum of M1, M2, M3 and M4 and it should appear
at the center of the cell.
Percentage = Total / 3 and format these cell values so that all the
values got 2 digits after the decimal point.
Status = pass, if M1, M2, M3 and M4 >=50
= fail, otherwise
12. Create a power point presentation about your school using
animation, design template and effective presentation
13HS201: TECHNICAL ENGLISH II
(Common to all UG Programmes)

99

LTPC
3003

Course Objectives:
To make the students of engineering and technology enhance
communicative skills
To strengthen LSRW skills
To boost up creative and critical thinking
To master the skills of writing
To face the challenges of the competitive world.
Course Outcomes:
The students of Engineering and Technology will be able to
enhance LSRW skills
Their creative and critical thinking will be enriched
The students will be able to face the challenges of the competitive
world
UNIT I

LANGUAGE FOCUS

15

Vocabulary for engineers, word formation, synonym match the

following, article, preposition, phrasal verbs, reported speech, extended
definitions, numerical adjectival expressions, concord, cause and
purpose expressions, same word in different parts of speech, editing
UNIT II

LISTENING

Comprehensive listening, listening to native accent, listening to

telephonic conversations, listening to short and long conversations from
different domain activities, listening to various recorded conversations,
speeches of great leaders, cricket commentaries, TV and radio news
etc., phonetic sounds
UNIT III

SPEAKING

Reviews of books & media, sharing of own thoughts, discussing various

current issues-group discussions, task based speeches, giving
instructions, role play on various themes individual & groups, narrating
stories, formal and informal speeches, reporting various incidents,
aprising strength and weakness of a friend, suggestions & solutions for
various problematic situations, pronunciation skills stress and
100

intonation
UNIT IV

READING

Skimming and scanning, understanding logic and sequencing in

reading, inferring the exact meaning of text, making out meaning of
pictorial representations, concentrated reading, reading science fictions
and other literary pieces, on the spot reading
UNIT V

WRITING

10

Checklist, itinerary, paragraph writing, process description, Letter

writing job application with CV, business correspondence-calling for
quotations, placing order, complaint letters, preparing a memo, notice
and e-mail, e-mail etiquette, report writing-characteristics, structure,
types, format and application, essay writing
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Dept of English, Anna University, Chennai. Mindscapes: English
for Technologists and Engineers. Orient Black Swan, Chennai.
2012.
REFERENCE BOOKS:
1. Raman,
Meenakshi
&
Sangeetha
Sharma.
Technical
Communication: English Skills for Engineers. Oxford University
Press, New Delhi. 2009.
2. Dhanavel, S.P. English and communication skills for students of
science and Engineering. Orient Black Swan publications,
Chennai, 2011.
3. Rizvi M, Ashraf. Effective Technical Communication.
McGraw-Hill publishing company limited, New Delhi, 2007.

Tata

4. Rutherford, Andrea J. Basic Communication Skills for Technology.

Pearson Edition (II Edition), 2001.
Extensive reading:
1. The Time machine H.G. Wells

101

13BS201: MATHEMATICS II
(Common to all UG Programmes)

LTPC
3104

Course Objectives:
To make the student acquire sound knowledge of techniques in
solving ordinary differential equations obtained from engineering
problems
To acquaint the student with the concepts of vector calculus that
is needed for problems in engineering disciplines
To know the standard techniques of complex variable theory so as
to enable the student to apply them with confidence, in application
areas such as heat conduction, elasticity, fluid dynamics and flow
the of electric current
To make the student for appreciating the purpose of using
transforms to create a new domain in which it is easier to handle
the problem that is being investigated
Course Outcomes:
At the end of this course, the students are able to
Apply different techniques to solve ordinary differential equations
Reduce order of differential equations
Solve engineering problems using vector calculus
Use complex variable theory for applications like heat conduction,
fluid dynamics etc.
Transform given problem to a new domain for solving it efficiently
UNIT 0

(Not for Examination)

5+0

Reviews of integration concepts

UNIT I

DIFFERENTIAL EQUATIONS

9+3

Method of variation of parameters Method of undetermined coefficients

Homogenous equation of Eulers and Legendres type System of
Simultaneous linear differential equations with constant coefficientsReduction of order.

102

UNIT II

VECTOR CALCULUS

9+3

Gradient and directional derivative Divergence and Curl Irrotational

and Solenoidal vector fields Line integral over a plane curve Surface
Integral and Volume Integral -Greens, Gauss divergence and Stokes
theorems Verification and Application in evaluating line, surface and
volume integrals
UNIT III

ANALYTIC FUNCTION

9+3

Analytic functions Necessary and sufficient conditions for analyticity Properties Harmonic conjugates Construction of analytic function Conformal Mapping Mapping by functions w= z + c, az, 1/z, z2, ez Bilinear transformation
UNIT IV

COMPLEX INTEGRATION

9+3

Line Integral - Cauchys theorem and integral formula Taylors and

Laurents Series Singularities Residues Residue theorem
Application of Residue theorem for evaluation of real integrals Use of
circular contour and semicircular contour with no pole on real axis
UNIT V

LAPLACE TRANSFORMS

9+3

Existence conditions Transforms of elementary functions Basic

properties Transforms of derivatives and integrals Initial and Final
value theorems Inverse transforms Convolution theorem
Transform of periodic functions Application to solution of linear
ordinary differential equations with constant coefficients
TOTAL: 65 PERIODS
TEXT BOOKS:
1. Grewal, B.S. Higher Engineering Mathematics,
Publications, New Delhi, 40th Edition, 2007

Khanna

2. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley

& Sons (ASIA) Pvt Ltd, Singapore, 8th Edition, 2002
REFERENCE BOOKS:
1. Ramana, B.V. Higher Engineering Mathematics Tata McGraw Hill
Co. Ltd., New Delhi, 11th Reprint, 2010.

103

2. Jain R.K. and Iyengar S.R.K., Advanced Engineering

Mathematics (3rd Edition) Narosa Publications, Delhi, 2007.
3. Allen Jeffrey, Advanced Engineering Mathematics, Academic
press publications, Elseiver India, First edition, 2003.
4. Peter V.ONeil, Advanced Engineering Mathematics, Cengage
Learning India Pvt., Ltd, New Delhi, 2007.
5. Greenberg M.D., Advanced Engineering Mathematics, Pearson
Education, New Delhi, 2nd Edition, 5th Reprint, 2009.

13BS202: ENVIRONMENTAL SCIENCE

(Common to all UG Programmes)

LTPC
3003

Course Objectives:
At the end of this course the student is expected to understand
what constitutes the environment, what are precious resources in
the environment, how to conserve these resources, what is the
role of a human being in maintaining a clean environment and
useful environment for the future generations and how to maintain
ecological balance and preserve bio-diversity.
The role of government and non-government organizations in
environment management.
Course Outcomes:
At the end of the course the student will be able to
Understand the basic concepts of environment studies and natural
resources.
Get the thorough knowledge about ecosystem and biodiversity.
Have an elaborate knowledge about causes, effects and control
measures of various types of pollution.
Understand the social issues and various environmental acts.
Know the relationship between the human population and
environment.

104

UNIT I

INTRODUCTION TO ENVIRONMENTAL STUDIES

AND NATURAL RESOURCES

10

Definition, scope and importance Need for public awareness 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
UNIT II

ECOSYSTEMS AND BIODIVERSITY

14

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 Exsitu conservation of
biodiversity.

105

UNIT III

ENVIRONMENTAL POLLUTION

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 Solid waste Management:
Causes, effects and control measures of urban and industrial wastes
Role of an individual in prevention of pollution Pollution case studies
Disaster management: floods, earthquake, cyclone and landslides.
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT

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 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
Protection Act Air (Prevention and Control of Pollution) Act Water
(Prevention and control of Pollution) Act Wildlife Protection Act
Forest Conservation Act Issues involved in enforcement of
environmental legislation Public awareness
UNIT V

HUMAN POPULATION AND THE ENVIRONMENT

Population growth, variation among nations Population explosion

Family Welfare Programme Environment and human health Human
Rights Value Education HIV / AIDS Women and Child Welfare
Role of Information Technology in Environment and human health.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Gilbert M.Masters, Introduction to Environmental Engineering and
Science, Pearson Education Pvt., Ltd., Second Edition, ISBN 81297-0277-0, 2004.
2. Miller T.G. Jr., Environmental Science, Wadsworth Publishing Co.,
1993
3. Townsend C., Harper J and Michael Begon, Essentials of Ecology,

106

Blackwell Science., 2000

4. Trivedi R.K. and P.K. Goel, Introduction to Air Pollution, TechnoScience Publications, 2009
5. Anubha Kaushik and Kaushik.C.P, Environmental Science and
Engineering, New Age International (P)Ltd, Second Edition,
ISBN:81-224-1756-6,2006
REFERENCE BOOKS:
1. Bharucha Erach, The Biodiversity of India, Mapin Publishing Pvt.
Ltd., Ahmedabad India, 2002, Email: [email protected]
2. Trivedi R.K., Handbook of Environmental Laws, Rules, Guidelines,
Compliances and Standards, Vol. I and II, Enviro Media.
3. Cunningham,
W.P.Cooper,
T.H.Gorhani,
Encyclopedia, Jaico Publ., House, Mumbai, 2001.

Environmental

4. Wager K.D., Environmental Management, W.B. Saunders Co.,

Philadelphia, USA, 1998.
5. Benny Joseph, Environmental Studies,
Publishing Company Ltd, New Delhi, 2009

Tata

13BS204: MATERIAL SCIENCE

(Common to CSE/ IT/ ECE / EEE)

McGraw-Hill

LTPC
3003

Course Objectives:
To introduce the essential principles of physics for information
science and related Engineering applications.
To transform the basic principles and concepts to understand the
utility of Engineering Materials operating electrical core devices in
terms of their structure and properties.
To identify the fleet of scientific channels exploring the generation
of high-tech electrical engineering materials.
Course Outcomes:
The students are able to understand the electrical properties of
the materials.
107

 The students will acquire knowledge about semiconducting

materials.
The students will acquire knowledge about the magnetic
properties and optical properties of materials.
The students will acquire knowledge about the applications of the
magnetic materials, optical devices and nano devices.
UNIT I

ELECTRICAL PROPERTIES OF MATERIALS

Classical free electron theory for electrical and thermal conductivity

Wiedemann - Franz lawDraw backs of classical free electron theory
Quantum free electron theory (qualitative)Schrodinger wave equation
time independent and time dependent wave equationsParticle in a one
dimensional BoxFermi functionDensity of energy statesCarrier
concentration in metalsExpression for Fermi energy.
UNIT II

SEMICONDUCTORS AND TRANSPORT PHYSICS

Direct and indirect bandgap semiconductorsIntrinsic Semiconductors

Carrier concentrationDetermination of bandgap energyExtrinsic
semiconductor Carrier concentration in n type and p type
semiconductorsEnergy band diagram of an intrinsic and extrinsic
semiconductor-Variation of Fermi energy level with temperature and
impurity concentrationHall effectDetermination of Hall coefficient
carrier transport in semiconductors: Drift, Mobility and diffusion.
UNIT III

MAGNETIC PROPERTIES OF MATERIALS

Classification of magnetic materialsQuantum numbersOrigin of

magnetic momentsClassical theory of diamagnetism (Langevin theory)
Quantum theory of paramagnetismFerromagnetism (Weiss theory)
Energy associated with domain theory Hysteresis antiferromagnetic
materialsFerritesapplications Soft and hard magnetic materials.
Magnetic recording and readout in tapes, floppy and hard disk drives.

UNIT IV OPTICAL PROPERTIES OF MATERIALS AND

OPTICAL DEVICES

Classification of optical materials Absorption in metals, insulators &

108

semiconductorsLEDsOrganic LEDsPolymer light emitting materials

Plasma light emitting devicesLCDsLaser diodesOptical data storage
techniques(including DVD, Blue ray disc, holographic data storage)
UNIT V

NANO DEVICES

Quantum confinement quantum structures metal to - insulator

transition Confining excitonsBandgap of nanomaterialsTunneling
Resonant tunneling diode (RTD)Single electron phenomenonSingle
electron transistorQuantum cellular automata(QCA). Carbon nano
tubesMolecular electronics structuresSpintronics
TOTAL: 45 PERIODS
TEXT BOOKS:
1. William D. Callister, Jr. Material Science and Engineering, Seventh
Edition, John Wiley & Sons Inc. New Delhi, 2010
2. Kasap, S.O., Principle of Electronic Materials and devices, Tata
Mc-Graw Hill, 2007
REFERENCE BOOKS:
1. Pierret, R.F. Semiconductor device fundamentals, Pearsons 1996
2. Garcia N and Damask A, Physicss for Computer science students,
SpringerVerlag, 1991
3. Todd D. Steiner, Semiconductor Nanostructure for Optoelectronic
Applications, ArTech House Publishers, Boston, London, 2004

13EC201: ELECTRIC CIRCUITS AND ELECTRON

LTPC
DEVICES
3104
(Common to CSE /IT)
Course Objectives:
To understand basic current and voltage laws
To discuss transient resonance in RLC circuits
To know in detail about semiconductor diodes
To familiarize about transistors

109

 To introduce special semiconductor devices

Course Outcomes:
Analyze DC and AC circuits using basic laws.
Solve and verify network theorems
Analyze the effect of temperature in semiconductor diodes
Compare BJT with MOSFET
Understand the working of special semiconductor devices like
Diac, Triac etc.
UNIT I

CIRCUIT ANALYSIS TECHNIQUES

12

Kirchoffs current and voltage laws

series and parallel connection
of independent sources R, L and C Network Theorems
Thevenin,
Superposition,
Norton, Maximum power transfer and
Reciprocity Star-delta conversion.
UNIT II

TRANSIENT RESONANCE IN RLC CIRCUITS

12

Basic RL, RC and RLC circuits and their responses to pulse and
sinusoidal inputs frequency response Parallel and series resonances
Q factor.
UNIT III

SEMICONDUCTOR DIODES

12

Review of intrinsic & extrinsic semiconductors Theory of PN junction

diode Energy band structure current equation space charge and
diffusion capacitances effect of temperature and breakdown
mechanism Zener diode and its characteristics.
UNIT IV

TRANSISTORS

12

Principle of operation of PNP and NPN transistors study of CE,

CB and CC configurations and comparison of their characteristics
Breakdown in transistors operation and comparison of N-Channel and
P-Channel JFET drain current equation MOSFET Enhancement
and depletion types structure and operation comparison of BJT with
MOSFET thermal effect on MOSFET.
UNIT V

SPECIAL SEMICONDUCTOR DEVICES

(Qualitative Treatment only)
110

12

Tunnel diodes PIN diode, varactor diode SCR characteristics and

two transistor equivalent model UJT Diac and Triac Laser, CCD,
Photodiode, Phototransistor, Photoconductive and Photovoltaic cells
LED, LCD.
TOTAL: 60 PERIODS
TEXT BOOKS:
1. Joseph A. Edminister, Mahmood, Nahri, Electric Circuits Shaum
series,Tata McGraw Hill, (2001)
2. S. Salivahanan, N. Suresh kumar and A. Vallavanraj,
Electronic Devices and Circuits,Tata McGraw Hill, 2nd edition,
(2008)
3. David A. Bell, Electronic Devices and Circuits, Oxford University
Press, 5 th edition, (2008)
REFERENCE BOOKS:
1. Robert T. Paynter, Introducing Electronics
Circuits, Pearson Education, 7th edition, (2006).

Devices

and

2. William H. Hayt, J.V. Jack, E. Kemmebly and steven M. Durbin,

Engineering Circuit Analysis,Tata McGraw Hill,6th edition, (2002)
3. J. Millman & Halkins, Satyebranta Jit, Electronic Devices &
Circuits, Tata McGraw Hill, 2nd edition, (2008)

13IT201: DIGITAL PRINCIPLES AND SYSTEM

DESIGN

LTPC
3003

(Common to CSE / IT)

Course Objectives:
To understand different methods used for the simplification of
Boolean functions
To design and implement combinational circuits
To design and implement synchronous sequential circuits
To design and implement asynchronous sequential circuits

111

 To simulate combinational and sequential circuits using of VHDL /

Verilog HDL
Course Outcomes:
Apply different methods to simplify Boolean function
Design the combinational circuit.
Design and use decoder, encoder, multiplexer and demultiplexer.
Design synchronous sequential circuit such as shift registers and
counters.
Design asynchronous sequential circuit.
UNIT I

BOOLEAN ALGEBRA AND LOGIC GATES

Review of binary number systems - Binary arithmetic Binary codes

Boolean algebra and theorems - Boolean functions Simplifications of
Boolean functions using Karnaugh map and tabulation methods
Implementation of Boolean functions using logic gates.
UNIT II

COMBINATIONAL LOGIC

Combinational circuits Analysis and design procedures - Circuits for

arithmetic operations - Code conversion Introduction to Hardware
Description Language (HDL)
UNIT III

DESIGN WITH MSI DEVICES

Decoders and encoders - Multiplexers and demultiplexers - Memory and

programmable logic - HDL for combinational circuits
UNIT IV

SYNCHRONOUS SEQUENTIAL LOGIC

10

Sequential circuits Flip flops Analysis and design procedures - State

reduction and state assignment - Shift registers Counters HDL for
Sequential Circuits.
UNIT V

ASYNCHRONOUS SEQUENTIAL LOGIC

10

Analysis and design of asynchronous sequential circuits - Reduction of

state and flow tables Race-free state assignment Hazards. ASM
Chart.
TOTAL: 45 PERIODS

112

TEXT BOOKS:
1. M.Morris Mano, Digital Design, 3rd edition, Pearson Education,
2007.
REFERENCE BOOKS:
1. Charles H.Roth, Jr. Fundamentals of Logic Design, 4th Edition, Jaico
Publishing House, Cengage Earning, 5th ed, 2005.
2. Donald D.Givone, Digital Principles and Design, Tata McGraw-Hill,
2007.
WEB REFERENCES:
1. http://www.doe.carleton.ca/~shams/ELEC3500/hazards.pdf
2. ww.ee.surrey.ac.uk/Projects/Labview/Sequential/Course/02Hazards/
3. http://sifaka.uwaterloo.ca/~akenning/courses/ece124/notes/19_asyn
c_analysis_and_design_v1.pdf
4. http://www.uotechnology.edu.iq/sweit/Lectures/Dr-Ikbal-Electronics2nd/ASM2.pdf

13BS251: APPLIED PHYSICS AND ENVIRONMENTAL

CHEMISTRY LABORATORY

LTPC
0032

(Common to EEE/ ECE/CSE/MECH/IT / Bio-Tech)

(Laboratory classes on alternate weeks for Physics and
Environmental Lab)
Course Objectives:
To determine particle size and wavelength
To determine thermal conductivity of a wire
To find properties of a prism
To determine DO and Chloride in water
To determine chromium, sodium etc using various methods
Course Outcomes:
Use Post Office Box to determine band gap of a semiconductor
113

 Use Carey Foster Bridge to determine thermal conductivity of a

wire
Use spectrometer to find dispersive power of a prism
Use Winklers method to determine DO in water
Use Argentometric method to estimate chloride in water
Use flame photometry to estimate presence of sodium
PHYSICS LABORATORY
List of Experiments (Any FIVE Experiments)
1. Laser-Particle size and wavelength determination
2. Post Office Box-Determination of band gap of a semiconductor
3. Indexing of Powder Diffraction Pattern
4. Characteristics of a photodiode
5. Carey Foster Bridge- Determination of unknown resistance of a coil
of wire and hence to find the thermal conductivity of the wire using
Wiedemann-Franz law
6. Uniform pending- Youngs modulus determination
7. Spectrometer-Dispersive power of the prism
REFERENCE
1.

Physics Laboratory Manual, Department of Physics, Mepco Schlenk

Engineering College, Sivakasi
ENVIRONMENTAL CHEMISTRY LABORATORY

List of Experiments (Any FIVE Experiments)

1.

Determination of DO in water by Winklers method

2.

Estimation of Chloride in water sample by Argentometric method

3.

Determination of COD value of industrial effluents

4.

Estimation of chromium in tannery wastes

5.

Estimation of available chlorine in bleaching powder

6.

Estimation of iron by spectrophotometry.

7.

Estimation of sodium by flame photometry

114

8.

Determination of suspended solids and dissolved solids in water

REFERENCE
1.

A Text book of quantitative inorganic analysis, A.L.Vogel, ELBS

London,1995

2.

Experiments in physical chemistry,

C.W.Gardad, McGraw Hill, London, 2001

3.

N. Manivasakam, Industrial Effluents Origin, Characteristics,

Effects Analysis & Treatment, Sakthi Publications, Coimbatore,
1987.

D.P.Shoemarker

13IT251: DIGITAL CIRCUITS LABORATORY

(Common to CSE/ IT)

and

LTPC
0032

Course Objectives:
To implement adders, subtractors, code convertors, multiplexers,
de-multiplexers
To construct counters and shift registers
To be familiar with any one digital circuits simulation software
Course Outcomes:
Design adders, subtractors, code convertors, multiplexers, demultiplexers
Construct counters, shift registers using flip flops
Construct and simulate digital circuit using VHDL software
List of Experiments
1. Verification of Boolean theorems using digital logic gates
2. Design and implementation of combinational circuits using basic
gates for arbitrary functions, code converters, etc.
3. Design and implementation of 4-bit binary adder / subtractor using
basic gates and MSI devices
4. Design and implementation of parity generator / checker using
basic gates and MSI devices

115

5. Design and implementation of magnitude comparator

6. Design and implementation of application using multiplexers/
Demultiplexers
7. Design and implementation of Shift registers
8. Design and implementation of Synchronous and Asynchronous
counters
9. Simulation of combinational circuits using Hardware Description
Language (VHDL/ Verilog HDL software required)
10. Simulation of sequential circuits using HDL (VHDL/ Verilog HDL
software required)

13CS251: LINUX COMMANDS AND SHELL PROGRAMMING L T P C

LABORATORY
0122
(Common to EEE/ ECE/ CSE/ IT / Bio-Tech)
Course Objectives:
To motivate the students to develop programs with dynamic
memory allocation in C
To motivate the students to explore the various techniques to
handle files using C programs
To provide a formal foundation to the Linux commands
To realize some basic Linux commands using C
To learn to use the primitive administrative commands (Eg. add,
delete user)
To train the students to write Linux shell programs with shell
programming constructs
To enable the students to work on power commands in Linux
Course Outcomes:
Write programs with dynamic memory allocation using pointers in C
Handle files and manipulate them using C
Work in the Linux environment by appropriately using the

116

commands
Implement some of Linux Commands using C
Use the Linux administrative commands
Write shell programs in Linux using the shell programming
constructs
Use the power commands for a given applications
SYLLABUS FOR THE LAB (For embedded Theory)
1. C PROGRAMMING ON LINUX
Command Line Arguments - Pointer Programming - Dynamic Memory
Allocation -Generic Programming using Pointers - File Handling
2. LINUX COMMANDS
Basic Shell Commands Pipes & Filters User Administration
Commands File System Commands Regular Expressions System
Performance Commands
3. SHELL PROGRAMMING
Simple Shell program - Conditional Statements - Looping Statements
Command Line Arguments Shell programs with C Executable
TEXT BOOKS:
1. Pradip Dey, Manas Ghosh, Fundamentals of Computing and
Programming in C, First Edition, Oxford University Press, 2009
2. A Practical Guide to Linux Commands, Editors, and Shell
Programming, 2nd Edition, Mark G. Sobell, Pearson Education
REFERENCE BOOKS:
1. The C Programming Language, 2nd Edition, B.W.Kernighan,
D.M.Ritchie, Eastern Economy Edition.
2. Understanding Pointers in C, 4th Edition, Yashavant P. Kanetkar,
BPB Publication
WEB REFERENCES:
1. www.w3schools.in/c-programming-language
2. http://www.tutorialspoint.com/unix/index.htm

117

3. http://www.cprogramming.com/tutorial/c-tutorial.html
List of Sample Exercises
1. Consider a department consists of two sections of students. It is
required to generate a common rank list of all the students based on
their CGPA. Develop a C Program for the above scenario.
2. Generate mark report for n students who passed all subjects with
name, rollno, mark1, mark2, mark3, total, average. The mark details
of m students who passed after revaluation can be added later.
3. A Clerk wants to generate reports of mails received based on
following criteria.
1. Sender
2. Category (O Official, P - Personal, C - Confidential)
3. Size
You are required to write a program with generic function to sort the
mails based on the above said criteria.
4. Write a C program to create a file named Data.txt, which contains
two numbers followed by an operator in each and every line. Read
each line of the file, while reading it; with respect to the operator
perform the operation against the numbers and store the results in
another file named Result.txt
5. a. Create a directory CSE, change your working directory to CSE
and display where you are working now? Create files named
date, user. Store the calendar and current date information in
the file named date and store the login details of all users in the
file user. Also, store the details of all active users in the same
file (user). Finally merge the two files into a single file called
merge and delete both the files
b. Create a file consisting of countries and corresponding continents.
Display the countries which are in the continent Africa. Sort the
generated list and convert them into lowercase
6. Create a directory Marks, change your working directory to
Marks.
118

a. Create 3 empty files MarkList, NameList and StudRep. Add

necessary information (MarkList Mark only, NameList Name
only, StudRep representative Name only) to the corresponding
file (minimum 15 details)
b. Merge the contents of files NameList & MarkList and store it in a
file MarkDetail1 & MarkDetail2 in the following format.
MarkDetail1

Mark Detail2

Arun

100

Arun

Bala ..

Bala

98

100

98

..

c. Copy the first 8 lines from MarkDetail1 to the new file Mark1.
Copy the last 4 lines from the file Mark1 to new file Mark2.
And finally store the contents of MarkDetail1 from the line 4 to the
file Mark3.Display the contents of Mark3 along with line
number.
d. Display which file system is mounted on your system
7. a. Create a user group called csestudent and rename it as
engineers. Add 10 users to the group and rename the
usernames for atleast 5 students. Delete an user from the group
and finally delete the group
b. Perform the following system administration tasks

Print network connections, routing tables, interface statistics,

masquerade connections, and multicast memberships

System Load statistics

Report a snapshot of the current processes.

Report virtual memory statistics

Display call graph profile data

Display system tasks

8. Create a file which consists of menu of cuisines for a restaurant.

Perform the following operations in the file.

119

 Change the price of the items which are 4$ to 6$

Delete the list of items whose prices are less than 3$
Replace the whitespaces between the items into -
Print the list of items from 4th to 10th position
List out all the cuisines of type Italian
9. Write a shell script which will accepts login name from the user as
command line argument and display the message whether the user
having that login name is currently logged in or not. Also enable the
user to view the long list of files that end with ca along with the
count.
10. Write a shell script to store the city names of different states in
different files. The file names must be in the short form of the
corresponding state names (Eg: TamilNadu-TN). Accept the state
name and city name from command line. Store the city name in
corresponding file. If the file doesnt exist, create the file. If the city
name already exists, display the message City already added.
11. Generate payroll for the company with the specifications as follows.
If the employees basic salary is less than Rs.15000, then
HRA=10% of basic salary and DA=90% of basic. If the employees
salary is either equal to or above Rs.15000, then HRA=Rs.500 and
DA=98% of basic salary. Automatically generate gross salary and
net salary. Store the details in a file. The total number of employees
should be obtained from command line
12. Implement the operations of cat, cp and wc commands in Linux
using C programs

13HS301: PROFESSIONAL ETHICS AND MORAL VALUES

LTPC
2002

Course Objectives:
To discuss about various human values and explain their

120

importance
To illustrate the importance of ethics in engineering
To highlight the importance of conducting the engineering
experiments in ethical manner
To discuss on safety standard for engineering products and
services
To explain the rights and responsibilities of professionals
To explain the global ethical issues in business, environment,
media and warfare
Course Outcomes:
Live ethical and peaceful professional life by following human
values
Handle the ethical issues in engineering field
Conduct the engineering experiments without affecting the society
in any of the form
Become a responsible engineer for maintaining safety in all
aspects
Become responsible in work place and ensure the rights are
properly used
Handle the global ethical issues in any form
UNIT I

HUMAN VALUES

Morals, values and Ethics Integrity Work ethic Service learning

Civic virtue Respect for others Living peacefully Caring Sharing
Honesty Courage Valuing time Cooperation Commitment
Empathy Self confidence Character Spirituality.

UNIT II

ENGINEERING ETHICS

Senses of Engineering Ethics Variety of moral issues Types of

inquiry Moral dilemmas Moral autonomy Kohlbergs theory
Gilligans theory Consensus and controversy Models of professional

121

roles - Theories about right action Self interest Customs and

Religion Uses of ethical theories
UNIT III

ENGINEERING AS SOCIAL EXPERIMENTATION

Engineering as experimentation Engineers as responsible

experimenters Codes of ethics A Balanced outlook on law The
challenger case study
UNIT IV

SAFETY, RESPONSIBILITIES AND RIGHTS

Safety and risk Assessment of safety and risk Risk benefit analysis
and reducing risk The Three Mile Island and Chernobyl case studies
Collegiality and loyalty Respect for authority Collective
bargaining Confidentiality Conflicts of Interest Occupational
crime Professional rights Employee rights Intellectual Property
Rights (IPR) Discrimination
UNIT V

GLOBAL ISSUES

Multinational corporations Environmental ethics Computer ethics

Weapons development Engineers as managers Consulting
engineers Engineers as Expert Witnesses and Advisors Moral
leadership Sample Code of Conduct
TOTAL: 30 Periods
TEXTBOOKS:
1. Mike W. Martin and Roland Schinzinger , Ethics in Engineering,
Tata McGraw Hill, New Delhi, 2nd Edition, 2009
2. Subramanian R , Professional Ethics, Oxford University Press,
2013
3. Govindarajan M, Natarajan S, Senthil Kumar V. S, Engineering
Ethics, Prentice Hall of India, New Delhi, 2004

REFERENCE BOOKS:
1. Charles B. Fleddermann, Engineering Ethics, Pearson Prentice
Hall, New Jersey, 2004
2. Charles E. Harris, Michael S. Pritchard and Michael J. Rabins,

122

Engineering Ethics Concepts and Cases, Thompson

Wadsworth, A Division of Thomson Learning Inc., United States,
2000
3. John R Boatright, Ethics and the Conduct of Business, Pearson
Education, New Delhi, 2003
4. Edmund G Seebauer and Robert L Barry, Fundamentals of Ethics
for Scientists and Engineers, Oxford University Press, Oxford,
2001
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ethics.iit.edu/teaching/professional-ethics
3. http://www.engc.org.uk/professional-ethics.aspx
4. http://www.youtube.com/playlist?list=PL746AE3CCB29B64B8
13MA301 : MATHEMATICS III

L T P C

(Common to all UG Programmes)

3 1 0 4

Course Objectives:
To know a sound knowledge on Partial Differential Equations.
To acquaint the student with the concepts of Fourier series that is
needed for problems in engineering disciplines.
To know the standard techniques for solving boundary value
problem.
To familiarize the student with Fourier transform which is used to
solve problems in engineering and technology.
To make the student knowledgeable in the area of probabilistic
models
Course Outcomes:
Solve various Partial Differential Equations.
Know to express any periodic functions as a series of well known
periodic functions sine and cosine.

123

 Obtain the solution of

boundary value problem such as
displacement of string and heat conduction.
Use Fourier transform in engineering applications.
Familiar with the concepts of probability and distributions.
UNIT I

PARTIAL DIFFERENTIAL EQUATIONS

9+3

Formation of PDE Solutions of first order PDE Lagranges linear PDE

-Standard types and equations reducible to standard types Singular
solution Classification of second order PDE Solution of second and
higher order linear homogeneous PDE with constant coefficients
Linear non-homogeneous partial differential equations with constant
coefficients.
UNIT II

FOURIER SERIES

9+3

Dirichlets conditions General Fourier series Odd and even functions

Half-range Sine and Cosine series Parsevals identity Harmonic
Analysis Complex form of Fourier series.
UNIT III

BOUNDARY VALUE PROBLEMS IN PDE

9+3

Method of separation of variables Solutions of one dimensional wave

equation and one dimensional heat equation Steady state solution of
two-dimensional heat equation Fourier series solutions in Cartesian
coordinates.
UNIT IV

FOURIER TRANSFORM

9+3

Fourier integral theorem Fourier transform pair Sine and Cosine

transforms Properties Transform of elementary functions
Convolution theorem Parsevals identity.
UNIT V

PROBABILITY RANDOM VARIABLES AND

DISTRIBUTIONS

9+3

Axiomatic definition of probability Conditional probability Bayes

theorem Discrete and Continuous random variables Moments
Moment generating functions Binomial, Poisson, Uniform, Exponential
and Normal distributions
TOTAL: 60 PERIODS

124

TEXTBOOKS:
1. Grewal B.S., Higher Engineering Mathematics,
Publishers, New Delhi, 42nd Edition, 2012.

Khanna

2. Gupta, S.C., and Kapoor, V.K., Fundamentals of Mathematical

Statistics, Sultan Chand and Sons. New Delhi, Reprint 2011.
REFERENCE BOOKS:
1. Bali N., Goyal M. and Watkins C., Advanced Engineering
Mathematics, Firewall Media (An imprint of Lakshmi Publications
Pvt., Ltd.,), New Delhi, 7th Edition, 2009.
2. Peter V.ONeil, Advanced Engineering Mathematics, Cengage
Learning India Pvt., Ltd, New Delhi, 7th edition, 2012.
3. Glyn James, Advanced Modern Engineering Mathematics,
Pearson Education, New Delhi, 2010.
4. Hwei Hsu, Schaums Outline of Theory and Problems of
Probability, Random Variables and Random Processes, Tata
McGraw Hill, New Delhi, 9th Reprint, 2010.
5. Ibe, O.C. Fundamentals of Applied Probability and Random
Processes, Elsevier, U.P., 1st Indian Reprint, 2010.

13CS301: DATA STRUCTURES

LTPC
3003

Course Objectives:
To study the design and applications of linear ADTs such as List,
Stack and Queue.
To understand the various non-linear data structures like binary
tree, binary search tree, AVL, red black trees, splay and B-tree for
set.
To study the design and applications of various Heap Structures.
To understand the graph ADT and its applications.
To learn the various indexing techniques to avoid collision.

125

 To introduce concurrent List

Course Outcomes:
Implement the linear data structures such as lists, stacks, and
queues using arrays and pointers.
Formulate the different non-linear data structures like binary trees.
Implement the
performance.

various

balanced

trees

and

compare

the

Develop the various heap structures such as Binary heaps, Min

heap and Leftist heap.
Apply the BFS and DFS traversal.
Work with searching and Hashing Techniques.
Achieve concurrency on List
UNIT I

LINEAR DATA STRUCTURES

10

List: Operations - Storage Representation - Array and linked List

Implementation Applications: Polynomial Operations Stack:
Operations - Storage Representation Array and linked List
Implementation Applications: Post fix expression evaluation Queue:
Operations - Storage representation Array and linked List
Implementation Applications.
UNIT II

NON-LINEAR DATA STRUCTURES I: FOR

SET

Trees Binary trees Binary tree representation and traversals

Threaded binary trees Expression Trees Binary Search Tree
Applications of trees Set operations - Representation Implementation
of union - Find operations Smart union algorithms Path compression
Applications of set.

UNIT III

NON-LINEAR DATA STRUCTURES II : FOR

SET

10

Balanced trees AVL trees Red-Black trees Splay trees B-tree

Priority queue Binary heap Min heap Leftist heap Applications of
126

heap.
UNIT IV

GRAPHS

Graph Definitions Topological sort Breadth first traversal

Shortest path algorithms Minimum spanning tree Prims and
Kruskals algorithms Depth first traversal Connected components.
UNIT V

HASHING AND CONCURRENT LIST

Linear search Binary search Hash tables Separate chaining

Open addressing Overflow handling Cylinder surface indexing
Hash index ISAM.
Concurrent linked lists Coarse-grained synchronization and finegrained synchronization.
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Ellis Horowitz and Sartaj Sahni, Dinesh Mehta Fundamentals of
Data Structures using C++, Second Edition, Universities Press,
2008.
2. M. Herlihy and N. Shavit, The Art
Programming, Morgan Kaufmann, 2012.

of

Multiprocessor

REFERENCE BOOKS:
1. Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to
Data Structures with Applications, Second Edition, Tata McGrawHill, New Delhi, 1991.
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C,
3rd edition, Pearson Education Asia, 2007.
3. Gregory L. Heilman, Data Structures, Algorithms and Object
Oriented Programming, Tata McGraw-Hill, New Delhi, 2002.
4. Alfred V. Aho, John E. Hopcroft and Jeffry D. Ullman, Data
Structures and Algorithms, Pearson Education, New Delhi, 2006.
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computer-

127

science/6-851-advanced-data-structures-spring-2012/
3. http://courses.cs.vt.edu/~csonline/DataStructures
4. http://cslibrary.stanford.edu/103/LinkedListBasics.pdf
5. www.cs.cornell.edu/courses/cs312/2005sp/lectures/rec19.html

13CS302: OBJECT ORIENTED PROGRAMMING

LTPC
3003

Course Objectives:
To learn the basic concepts of object-oriented programming
To familiarize the concepts of constructor, destructor, operator
overloading, Inheritances and virtual functions and templates.
To know about Java class design, arrays strings and packages.
To study about dynamic binding, interfaces and reflection concepts
using Java
To learn concurrent programming and event driven programming
in Java.
Course Outcomes:
Describe OOPS concepts
Design the class with constructor,
overloading and function overloading.

destructors,

operator

Implement run-time polymorphism.

Work with function and class templates.
Create user-defined Java packages.
Analyze the Java classes at run-time using reflection.
Create multi-threaded programs using Java
Handle the event driven programming.
UNIT I

INTRODUCTION
PROGRAMMING

TO

OBJECT-ORIENTED

Introduction to OOP concepts Procedure versus Object Oriented

128

Programming Data types Control structures Arrays and Strings

User defined types Functions and Pointers. Classes and Objects:
Defining C++ classes Methods Access specifiers Static members
Constructors Destructors.
UNIT II

OBJECT
CONCEPTS

ORIENTED

PROGRAMMING

Operator Overloading Inheritance Polymorphism and Virtual

Functions Function templates and Class templates Name spaces
UNIT III

JAVA FUNDAMENTALS

C++ versus Java Defining Java classes Methods Access

specifiers Static members Constructors Finalize method Input /
Output streaming Arrays Strings Packages JavaDoc comments.
UNIT IV

INHERITANCE AND POLYMORPHISM

Inheritance Polymorphism Dynamic binding Abstract classes Interfaces Object class Reflection Inner classes.
UNIT V

CONCURRENT AND EVENT-DRIVEN

PROGRAMMING
Multithreaded programming Interrupting threads Thread states
Thread properties Thread synchronization - Introduction to Swing
components Basics of event handling Event handlers AWT event
hierarchy Adapter classes.
TOTAL: 45 Periods
TEXTBOOKS:
1. Paul Deitel and Harvey Deitel, C++ How to Program, 8th Edition,
Prentice Hall, 2013.
2. Cay S. Horstmann and Gary Cornell, Core Java: Volume I
Fundamentals, 8th Edition, Sun Microsystems Press, 2008.
REFERENCE BOOKS:
1. Ira Pohl, Object-Oriented Programming Using C++, Second
Edition, 1997.
2. Timothy Budd, An Introduction to Object-Oriented Programming,

129

Third Edition, Addison-Wesley, 2002.

3. Bjarne Stroustrup, The C++ Programming Language, Third edition,
Pearson Education, 2012.
4. Horstmann Computing Concepts with C++ Essentials, Third
Edition, John Wiley, 2003.
5. Herbert Schildt, Java: The Complete Reference, Eighth Edition,
Tata McGraw Hill, 2012.
WEB REFERENCES:
1. http://www.cplusplus.com/doc/tutorial/
2. http://www.tutorialspoint.com/cplusplus/
3. http://www.cprogramming.com/tutorial/c++-tutorial.html
4. http://docs.oracle.com/javase/tutorial/java/TOC.html
5. http://www.java2s.com/Tutorial/Java/CatalogJava.htm

13CS303: COMPUTER ORGANIZATION AND

ARCHITECTURE

LTPC
3104

(Common to CSE / IT)

Course Objectives:
To have a thorough understanding of the basic structure and
operation of a digital computer.
To discuss in detail the operation of the arithmetic unit including
the algorithms & implementation of fixed-point and floating-point
addition, multiplication & division.
To study about the pipelining architecture
To study the hierarchical memory system including cache
memories and virtual memory.
To study the different ways of communicating with I/O devices and
standard I/O interfaces.
Course Outcomes:
Work with the instruction set of given architecture
130

 Design and analyze the main functional units of a computer.

Design a pipeline for consistent execution of instructions with
minimum hazards
Analyze memory
cost/performance.

hierarchy

and

its

impact

on

computer

Write assembly programs that accomplish basic computational

and I/O operations
UNIT I

BASIC STRUCTURE OF COMPUTERS

Functional units Basic operational concepts Performance

Instructions and instruction sequencing Addressing modes RISC
and CISC Styles Arithmetic: Design of fast adders Multiplication of
unsigned and signed numbers Fast Multiplication Integer division Floating point numbers and operations.
UNIT II

BASIC PROCESSING UNIT

Fundamental concepts Instruction Execution Hardware Components

- Instruction Fetch and Execution Steps - Control Signals Hardwired
control CISC-Style Processors.
UNIT III

PIPELINING

Basic concepts Pipeline Organization and issues Data

dependencies Memory and branch delays Performance evaluation
Pipelining in CISC processors.
UNIT IV

MEMORY SYSTEM

Basic concepts Memory hierarchy - Semiconductor RAM Readonly Memories Direct Memory Access Cache memories
Performance considerations Virtual memory Secondary storage.
UNIT V

I/O ORGANIZATION

Bus structure Bus operation Arbitration Interface circuits

Interconnection standards: PCI, SCSI, SATA, USB, SAS, and HDMI
Accessing I/O Devices: I/O Device Interface - Program-Controlled I/O Interrupts.
L : 45; T:15; TOTAL: 60 Periods

131

TEXTBOOK:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, and Naraig
Manjikian, Computer Organization and Embedded Systems,
Sixth Edition, McGraw Hill Higher Education, 2011.
REFERENCE BOOKS:
1. David A. Patterson and John L. Hennessy, Computer
Organization and Design: The Hardware/Software interface, Third
Edition, Elsevier, 2005.
2. Computer Organization, ISRD Group, Tata McGraw Hill, 2006.
3. William Stallings, Computer Organization and Architecture
Designing for Performance, Sixth Edition, Pearson Education,
2003.
WEB REFERENCES:
1. http://www.ics.p.lodz.pl/~dpuchala/CompArch/Lecture_6.pdf
2. http://www.dauniv.ac.in/downloads/CArch_PPTs/
3. www.nptel.ac.in
4. http://cse.iitk.ac.in/users/karkare/courses/2011/cs220/html/notes.h
tml

13IT304: PRINCIPLES OF COMMUNICATION

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To understand the basic analog transmission and communication
techniques
To learn digital modulation techniques
To study about the digital communication methods
To learn the concept of spread spectrum and Multiple access
techniques.
To understand the basic concepts of satellite and optical
communication.

132

Course Outcomes:
Characterize and determine the behavior of analog modulation
schemes in time and frequency domains
Select the appropriate digital modulation techniques
Determine the performance of different digital communication
systems
Characterize the operation of spread spectrum and multiple
access schemes
Get exposed to the
Communication Systems
UNIT I

working

of

Satellite

and

ANALOG COMMUNICATION

Optical
9

Need of modulation - Principles of amplitude modulation - AM envelope Frequency spectrum and bandwidth - Modulation index - AM power
distribution - AM Transmitter Angle modulation - FM and PM waveforms
- Phase deviation and modulation index - Frequency deviation - FM
Transmitter - Frequency analysis of angle modulated waves - Bandwidth
requirements for angle modulated waves - Super heterodyne receiver.
UNIT II

PULSE MODULATION

Sampling theorem - Pulse amplitude modulation - Pulse width

modulation - Pulse position modulation and pulse code modulation Uniform quantization - Delta modulation - Intersymbol interference - Eye
patterns.
UNIT III

DIGITAL COMMUNICATION

Signal representation - Signal constellation diagram - Coherent detection

- Transmitter and receiver of phase shift keying - Frequency shift keying
- Quadrature phase shift keying and quadrature amplitude modulation

UNIT IV

SPREAD SPECTRUM AND MULTIPLE ACCESS

TECHNIQUES

Introduction - Pseudo-noise sequence - DS spread spectrum with

coherent binary PSK - Processing gain - FH spread spectrum - Multiple

133

access techniques FDMA - TDMA and CDMA.

UNIT V

SATELLITE AND OPTICAL COMMUNICATION

Satellite communication systems - Keplers law - LEO and GEO orbits Footprint - Link model-Optical communication systems-Elements of
optical fiber transmission link - Types - Losses - Sources and detectors.
TOTAL: 45 Periods
TEXTBOOKS:
1. Wayne Tomasi, Advanced Electronic Communication Systems,
6/e, Pearson Education, 2007.
2. Simon Haykin, Communication Systems, 4th Edition, John Wiley
& Sons., 2001
REFERENCE BOOKS:
1. H.Taub, D L Schilling, G Saha,Principles of Communication, 3/e,
2007.
2. B.P.Lathi,Modern Analog and Digital Communication
3/e, Oxford University Press, 2007.

systems,

3. Dennis Roddy and John Coolen, Electronic Communications, 4/e,

Pearson Education India, 2008.
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-450-principles-of-digital-communications-i-fall-2006/

13HS351 : PRESENTATION SKILLS

LABORATORY
Course Objectives:
To hone the students proficiency in speaking skills

134

LTPC
0 021

 To enhance their pronouncing skills

To help the students acquire presentation skills
To enable the students communicate effectively
Course Outcomes:
The students of Engineering and Technology will be able to
recognize phonemes
The students pronunciation will be improved
All strategies of presentation skills will be acquired
Interpersonal skills will be developed
Phonetic Practice

English phonemes: Vowels, Diphthongs, Consonants - Word Stress,

phoneme recognizing practice
Listening Comprehension

Documentaries, Educational video clips, Oration of Great leaders, Radio

& TV news, Listening to conversations, Telephone etiquette
Language Functions

Giving reasons, talking about future plans, Reporting, Comparing &

Contrasting, persuasion and
dissuasion, Negotiation, Making
suggestions
Presentation Skills
Kinesics, slides preparation,
Etiquette and Power dressing.

15
Presentation

Sample topics for Presentation:

1.

Space travel

2.

Cloud computing

3.

Biometric system

4.

Touch screen technology

5.

Green computing

6.

Global positioning system

135

techniques,

Language

7.

Wi-fi technology

8.

Android

9.

Cloning

10. Brake system

11. Bluetooth technology
12. Technology for security
13. Automated transport
14. Bio products
15. Natural calamities
16. Waste management
17. Applications of fibre optics
18. Nano mania
19. Technology in Education
20. Blogging
21. Technology in agriculture
TOTAL: 25 PERIODS
REFERENCE BOOKS:
1. Mandel, Steve. Effective Presentation Skills. New Delhi: Viva
Books Pvt. Ltd., 2004.
2. Gopalaswamy, Ramesh & Ramesh Mahadevan. ACE of Soft
Skills. New Delhi: Pearson, 2010.
3. Gimson, AC. An Introduction to the Pronunciation of English.
London: ELBS, 1989.
4. Oconnor, JD. Better English Pronunciation.
Cambridge :
Cambridge University Press, 1967.

13CS351: DATA STRUCTURES LABORATORY

LTPC

(Common to CSE / IT)

0032

Course Objectives:

136

 To develop programming skills in design and implementation of

linear data structures
To build non linear data structures such as set using arrays,
various tree structures
To work with different hash searching
techniques

and binary search

To build and work with different types of heaps

To work with graph and solve some of the applications using graph
Course Outcomes:
Develop the various linear data structures as such as List, Stack
and Queue ADTs
Enlarge programming skills in design and implementation of non
linear data structures
Solve the collision problem using hashing technique
Build the various heaps structures
Solve graph based applications
SYLLABUS FOR THE LAB :
1. Lists and applications of List
2. Stacks and its applications
3. Queues
4. Binary Search tree
5. Set
6. AVL tree
7. Binary Heap
8. Graph traversal and spanning tree
9. Hashing
10. Concurrent List
TOTAL: 45 PERIODS
REFERENCE BOOKS :

137

1. Ellis Horowitz and Sartaj Sahni, Dinesh Mehta Fundamentals of

Data Structures using C++, Second Edition, Universities Press,
2008.
2. M. Herlihy and N. Shavit, The Art of Multiprocessor Programming,
Morgan Kaufmann, 2012.
WEB REFERENCES :
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-851-advanced-data-structures-spring-2012/
3. http://courses.cs.vt.edu/~csonline/DataStructures
4. http://cslibrary.stanford.edu/103/LinkedListBasics.pdf
5. www.cs.cornell.edu/courses/cs312/2005sp/lectures/rec19.html
List of Sample Exercises
1. Implement the following List operations using Linked List storage
structure :
Insert at front
Insert at middle
Insert end
Delete first
Delete last
Delete an element
Traversal
Find by position
Find by an element
Make empty.
2. Implementation of stacks using array and linked list and Evaluation
of expressions.
3. Construct Bi-stack in a single array and perform the following
operations for string manipulation such as:

138

 Search for a character and replace it by a new one if

available
Reverse a String
Test for palindrome
Count the occurrences of the given character
4. Implement queues using array and linked list and perform CPU
scheduling
5. Perform polynomial operations by representing the polynomials
using linked list
6. Using search tree construct a Telephone directory with the
information such as Phone Number, Name and address and
perform the following :
Search for a phone number and print the customer name
and address
Remove a phone number from the directory
Change the address of the customer whose phone number is
given.
Print the content of the directory
7. Implement AVL tree with insert, search, delete and traversal
operations.
8. Construct binary min / max heap and perform the following :
Find 3rd minimum / maximum
Delete an item(with random priority)
Delete minimum / maximum element
Sort Heap
Modify the priority of an item
9. Graph Traversals Depth First and Breadth First search
Given an X Y board containing obstacles and a knight that
can only move like the chess piece, Find the minimum
number of moves necessary to reach a certain destination on
139

that board

Bessie is caught at the lower left corner of an X Y grid forest

with various obstacles in her way. Given that she wants to
reach the upper right corner, and that she never
go back to a point she has already visited, how many paths
can she take?

10. For the given route map with cost of transportation between
different cities, find the shortest route from a source to all the
other cities.
11. Find the minimum spanning tree of the given graph using Prims
Algorithm
12. Locate a particular word in a dictionary.
13. Implement a dictionary which contains the meaning of different
words. Both the word and the meaning can be in the same
language. Your program should read a word and should give the
meaning. If the word is a new one (not available in the dictionary)
then include the word into its correct position with its meaning.
Use Hashing techniques.
14. Maintain a list of CD titles with information such as category and
title. Duplicates entries are allowed. Example Categories are:
Education, Entertainment, Examinations, Soft skill, Games etc.
Design a concurrent system using to get new entries to add,
search for an entry, delete the existing entries and view the titles.
The system does not know the number of titles in advance. The
system may keep the information in order of the title.

13CS352: OBJECT ORIENTED PROGRAMMING

LABORATORY
Course Objectives:
To practice with coding standards
140

LTPC
0032

 To apply the basic concepts of object-oriented programming

To experiment with constructor, destructor, operator and function
overloading
To work with inheritances and virtual functions
To expertise in different methods of event handling and template
concepts in Java
To implement concurrent programming using Java
Course Outcomes:
Master OOP concepts in C++
Design and implement C++ class with constructors and destructor.
Design and implement C++ class with operator overloading and
function overloading.
Work with function and class template in C++.
Implement run-time polymorphism using Java.
Handle Java swing components events
Use Java concurrent programming techniques.

SYLLABUS FOR THE LAB:

C++
1. Practicing with coding standards (use DOXYGEN), Version control
tools (GIT)
2. Functions with default arguments
3. Classes, objects, member functions, Constructors , destructor,
static data members and static member function
4. Function overloading and Operator Overloading including unary
and binary operators.
5. Inheritance, virtual function and virtual base classes.
6. Function templates and class templates.
JAVA

141

1. Simple java programs for understanding reference to an instance

of a class (object), methods, Handling Strings and Arrays in Java
2. User defined package creation and Java Documentation
3. Inheritance, polymorphism and interface
4. Multithreading
5. Event driven programming
6. Mini Project
TOTAL: 45 PERIODS
REFERENCE BOOKS:
1. Paul Deitel and Harvey Deitel, C++ How to Program, 8th Edition,
Prentice Hall, 2013.
2. Cay S. Horstmann and Gary Cornell, Core Java: Volume I
Fundamentals, 8th Edition, Sun Microsystems Press, 2008.
3. Herbert Schildt, "The C++: Complete Reference", Fourth edition,
TMH, 2002.
4. Bjarne Stroustrup, The C++ Programming Language, Third
edition, Pearson Education, 2012.
WEB REFERENCES:
1. http://www.cplusplus.com/doc/tutorial/
2. http://www.cprogramming.com/tutorial/c++-tutorial.html
3. http://docs.oracle.com/javase/tutorial/java/TOC.html
4. http://www.java2s.com/Tutorial/Java/CatalogJava.htm
List of Sample Exercises
1. Practicing with coding standards (use DOXYGEN), Version control
tools (GIT)
2. Write a C++ program to find the area of the rectangle.
[Hint: Function prototype with default arguments - int area(int
l=10,int b=20)]
3. Implement Vector class in C++ with necessary data member and
necessary methods. Give proper constructors, destructor, copy

142

constructor.
4. Write a C++ program to define a class Date that holds day, month
and year as data members. Also write necessary member
methods to
a) Read a date
b) Print a date in different formats
c) Find the date exactly one week after the given date.
e.g. If the given date is 30-10-2013, then the resultant date is
6-11-2013
5. Design Complex Number class and implement its operations with
operator overloading
6. Write a C++ program to define Matrix class. Using this class
overload operators >> (to read a matrix), operator << (to print a
matrix), operator + (to add 2 matrices).
7. Design a C++ class Numbers and implement the sorting
algorithms such as bubble sort and insertion sort.
8. Write a C++ Program to define a List template class with member
methods to insert, delete and display list. Test this List by creating
a list of integers, characters and floating point numbers.
9. Develop Rational number class in Java with numerator and
denominator as private data members. Write necessary
constructors and methods. Use JavaDoc comments for
documentation. Your implementation should use efficient
representation for a rational number, i.e. (500 / 1000) should be
represented as (). Also, write method that adds and subtract two
rational numbers.
Eg.: 160 / 290 , 230 / 290
O/p for add: 390/290 (39/29)

Sub: -70/290 (-7/29)

10. Write a Java program to demonstrate the user defined package

creation. Create a package vehicle and store the classes
TwoWheeler and FourWheeler. Develop an application to access
these two classes.

143

11. Design a Vehicle class hierarchy in Java. Write a test program to

demonstrate polymorphism. You should call the super class
constructor from your derived class.
Eg:
Derived
class
{TwoWheeler,
{GearedVehicle, NonGearedVehicle}

FourWheeler}

or

12. Design a Java interface for Stack ADT. Develop two different
classes that implement this interface, one using array and the
other using linked-list. Provide necessary user defined exception
handling in both the implementations.
13. Design a Java interface for Queue ADT. Develop two different
classes that implement this interface, one using array and the
other using linked-list. Provide necessary user defined exception
handling in both the implementations.
14. Write a Java applet program to create a simple scientific
calculator.
15. Write a Java swing program to draw pictures with mouse by
dragging the mouse on the background.
16. Write a Java swing program to design the GUI for Registration
Page with all needy components.

13MA403: DISCRETE MATHEMATICS

(Common to CSE / IT)

L T P C
3 1 0 4

Course Objectives:
To introduce students to ideas and techniques from discrete
mathematics that are widely used in science and engineering
To make the students to think logically and mathematically and
apply these techniques in solving problems
To provide the foundation for imbedding logical reasoning in
computer science.
Develop recursive algorithms based on mathematical induction
Know basic properties of relations

144

Course Outcomes:
Upon completion of this course the students should be able to do the
following:
Construct mathematical arguments using logical connectives and
quantifiers.
Verify the correctness of an argument using propositional and
predicate logic and truth tables
Demonstrate the ability to solve problems using counting
techniques and combinatorics
Construct proofs using direct proof, proof by contraposition, proof
by contradiction, proof by cases
Perform operations on discrete structures such as sets, functions,
relations, and sequences
UNIT I

SET THEORY

9+3

Set operations Properties - Power set - Methods of proofs Relations

- Graph and matrix of a relation - Partial order - Well ordering Equivalence relation - Classes and properties Functions -One to one
Onto Bijective - Composition of relation and functions - Inverse
functions
UNIT II

LOGIC AND PROOFS

9+3

Basic connective and truth tables - Logical equivalences and

implications - Positional logic - First order logic - Laws of logic - Rules
of inference Quantifiers - Universe of discourse - Statement. Calculus
- Predicate calculus - Inference theory - Introduction to proofs Proof
methods and strategy.
UNIT III

INDUCTION AND COMBINATORICS

9+3

Mathematical inductions Strong induction and well ordering principle

The basics of counting The pigeonhole principle Permutations and
combinations Recurrence relations Solving linear recurrence
relations Generating functions Inclusion and exclusion and
applications.

145

UNIT IV

ALGEBRAIC STRUCTURE

9+3

Algebraic systems Semi groups and monoids Groups Subgroups

and homomorphisms Cosets and Lagranges theorem Rings &
fields (Definitions and examples).
UNIT V

LATTICES AND BOOLEAN ALGEBRA

9+3

Partial ordering Posets Lattices as posets Properties of lattices Lattices as algebraic systems Sublattices Direct product and
homomorphism Some special lattices Boolean algebra.
TOTAL: 60 Periods
TEXTBOOKS:
1. Kenneth H. Rosen, Discrete Mathematics and Its Applications,
6/e, McGraw-Hill, 7th edition, 2011.
2. Jean Paul Trembley, R Manohar, Discrete Mathematical
Structures with Application to Computer Science, McGraw-Hill,
Inc. New York, 5th edition, 2010.
REFERENCE BOOKS:
1. Koshy, Discrete Mathematics with Applications, Elsevier Publica
tions, 2010.
2. T.Veerarajan, Discrete Mathematics with Graph Theory , Tata
McGraw-Hill Education 5th reprint, 2008.
WEB REFERENCES:
1. http://www.cims.nyu.edu/~regev/teaching/discrete_math_fall_200
5/dmbook.pdf
2. http://maths.mq.edu.au/~chris/notes/first_discrete.html
3. http://www1.cs.columbia.edu/~zeph/3203s04/lectures.html

13CS401: MICROPROCESSORS AND

MICROCONTROLLERS
(Common to CSE / 3rd semester IT)
146

LTPC
3003

Course Objectives:
To understand the architecture of Intel 8086
programming with different addressing modes

and learn

To learn the incorporation of coprocessor with 8086

To understand the functionalities and working of supporting
devices like parallel and serial communication interface, timer,
interrupt controller, DMA controller etc.
To know the architecture and programming of 8 bit microcontroller
8051
To learn the evolution of processors and its features
Course Outcomes:
Differentiate Central Processing Unit as microprocessors and
microcontrollers
Use 16 bit processer Intel 8086 and apply it for solving problems
with enhanced features
Interface the microprocessors with various input output devices
Work with Intel 8051 microcontroller and use it for peripheral
interfacing.
Get Exposed to the features of recent processors
UNIT I

8086 ARCHITECTURE AND PROGRAMMING

Intel 8086 Processor signals - Architecture Addressing modes Instruction set and assembler directives Assembly language
programming Procedures Macros Interrupts and interrupt service
routines.
UNIT II

8086 AND SUPPORTING PROCESSORS

Minimum and Maximum mode configurations Clock Generator Bus

controller - System bus timing Coprocessor: Data types Instruction
set.
UNIT III

INTERFACING

10

Memory interfacing and I/O interfacing - Parallel communication

147

interface Serial communication interface Timer Interrupt

controller DMA controller - Keyboard /display interfacing - ADC and
DAC Interfacing- Stepper motor interfacing.
UNIT IV

THE 8051 MICROCONTROLLER

Architecture of 8051 Signals Operational features Instruction set Memory and I/O addressing Timer Interrupts Serial Port
Introduction to 16 bit microcontroller
UNIT V

EVOLUTION OF PROCESSORS

Introduction to 80286 80386 80486 Pentium Multi Core

Processors
TOTAL: 45 Periods
TEXTBOOKS:
1. Barry B. Brey, The Intel Microprocessors - Architecture,
Programming & Interfacing, 8086/8088, 80186/80188, 80286,
80386, 80486, Pentium, Pentium Pro Processor, Pentium II,
Pentium III, Pentium 4 and Core2 with 64-bit Extensions,, Eighth
Edition, Pearson Prentice Hall, 2009.
2. Kenneth J.Ayala, The 8051
microcontroller
Architecture,
Programming
and applications, Second edition, Penram
international
REFERENCE BOOKS:
1. N.Senthilkumar,
M.Saravanan,
S.Jeevananthan,
Microprocessors & Microcontrollers, Oxford University Press,
2010.
2. A. K. Ray & K. M. Bhurchandi, Advanced Microprocessors and
Peripherals- Architectures, Programming and Interfacing, Tata
McGraw Hill, Second Edition, 2006.Peter Abel, IBM PC
Assembly language and programming, Fifth Edition, Prentice
Hall of India Pvt. Ltd., 2007.
3. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, The
8051 Microcontroller and Embedded Systems: Using Assembly
148

and C, Second Edition, Pearson education, 2011.

WEB REFERENCES:
1. www.intel.com
2. www.nptel.ac.in
3. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-823-computer-system-architecture-fall-2005/lecturenotes/l15_micro_evlutn.pdf
4. http://faculty.kfupm.edu.sa/COE/aimane/Short_Courses/assembly
.pdf
5. http://engineering.unt.edu/technology/public/eliask/RESOURCES/
8051.pdf

13CS402: DESIGN AND ANALYSIS OF ALGORITHMS

(Common to CSE / IT)

LTPC
3003

Course Objectives:
To introduce the mathematical aspects of analysing an algorithm
To learn and analyze the problem solving techniques such as
Divide and conquer, Greedy method, Backtracking, Dynamic
programming, Branch and Bound.
To study various data sorting and searching methods.
To study and solve the NP problems like Knapsack and Traveling
salesman
To introduce advanced algorithms such as Approximation
Algorithms, Randomization Algorithms and Parallel Algorithms
Course Outcomes:
Analyze the implications of iterative and recursive algorithms.
Design and implement problem solving techniques such as Divide
and conquer, greedy method, dynamic programming, Backtracking,
Branch and Bound.
Perform sorting and searching on the given collection of records

149

using key field

Analyze the efficiency of NP-complete problems
Work with advanced algorithms such as Approximation Algorithms,
Randomization Algorithms and Parallel Algorithms
UNIT I

ANALYSIS & DIVIDE AND CONQUER

Introduction to algorithms: Growth of functions - Asymptotic notations

Best, worst and average case analysis. Solving recurrence equations:
substitution method, iteration method and master method. Divide and
conquer: Finding maximum and minimum Selection Strassens matrix
multiplication.
UNIT II

GREEDY & DYNAMIC PROGRAMMING

Greedy approach: General method Knapsack problem Tree Vertex

splitting Job sequencing with deadlines Dynamic programming:
Principle of optimality All pairs shortest path problem Knapsack
problem Travelling salesperson problem.
UNIT III

BACKTRACKING & BRANCH-AND-BOUND

Backtracking: General method 8 Queens problem Graph coloring

Sum of subset problem Hamiltonian cycle. Branch and bound
Knapsack problem Traveling salesman problem.
UNIT IV

SORTING & STRING MATCHING

Insertion sort Merge sort Quick sort Heap sort k-way merging
Polyphase merge. Simple string matching: KMP string matching
algorithm Boyer Moore string matching algorithm.

UNIT V

NP
PROBLEMS
ALGORITHMS

&

ADVANCED

NP-completeness Polynomial time verification Theory of reducibility

Circuit satisfiability - NP-completeness proofs NP-complete
problems: Vertex cover - Hamiltonian cycle and traveling salesman
problems Introduction to approximation algorithms - Randomization

150

algorithms and parallel algorithms - Parallel sorting.

TOTAL: 45 PERIODS
TEXTBOOKS:
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran,
Fundamentals of Computer Algorithms, Second Edition,
Universities Press, Hyderabad, 2008.
2. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and
Clifford Stein, Introduction to Algorithms, Second Edition, Prentice
Hall of India, New Delhi, 2007
REFERENCE BOOKS:
1. Kenneth A. Berman and Jerome L. Paul, Algorithms: Sequential,
Parallel and Distributed, Cengage learning India Edition, New
Delhi, 2002.
2. Sara Baase and Allen Van Gelder, Computer Algorithms
Introduction to Design & Analysis, Third Edition, Pearson
Education, New Delhi, 2000.
3. Rajeev Motwani and Prabhakar Raghavan,
Algorithms, Cambridge University Press, 1995.

Randomized

WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-046j-design-and-analysis-of-algorithms-spring-2012/
3. http://www.personal.kent.edu/~rmuhamma/Algorihms/algorithm.html
4. http://www2.toki.or.id/book/algdesignmanual/lec/lectures/all.htm

13CS403 : SYSTEM SOFTWARE

LTPC

(Common to CSE / 5th semester IT)

3003

Course Objectives:
To understand the relationship between system software and
machine architecture

151

 To learn to design and implement assemblers

To study loaders and virtual machines
To learn to design and implement macroprocessors
To have an understanding of system software tools like debugger
and text editor
Course Outcomes:
Formulate the relationship between system software and machine
architecture
Design a simple assembler and loader

Work with CLR environment

Design and implement macro processors

Work with system software tools like editor and debugger
UNIT I

INTRODUCTION

Introduction System software and machine architecture Simplified

Instruction Computer SIC machine architecture, SIC/ XE machine
architecture Programming examples SIC and SIC / XE
UNIT II ASSEMBLERS

11

Basic assembler functions Algorithm and data structures Machine

dependent assembler features Machine independent assembler
features Assembler design options One Pass assembler - Multi pass
assembler MASM assembler
UNIT III LOADERS AND VIRTUAL MACHINE

Basic loader functions Machine dependent loader features Machine

independent loader features Introduction to Virtual Machines Java
VM Common Language Infrastructure - Common Language Runtime
UNIT IV MACRO PROCESSORS

Basic macro processor functions Algorithms and data structures

Machine independent macro processor features Design options
MASM macro processor
UNIT V

TEXT EDITORS AND DEBUGGERS

152

Text editor - Editing process User interface Editor structure

Interactive debugging system vim editor Latex editor
TOTAL: 45 Periods
TEXTBOOKS:
1. Leland L. Beck and D.Manjula, System Software An Introduction
to Systems Programming, 3rd Edition, Pearson Education Asia,
2009.
2. James E.Smith, Ravi Nair, Virtual Machines, Elsevier 2005
REFERENCE BOOKS:
1. Barry B Brey, The Intel Microprocessors Architecture,
Programming and Interfacing, 8th edition, Pearson Education
2. Arnold Robbins, Elbert Hannab and Linda Lamb, Learning vi and
vim editors , 7th edition, OReilly
WEB REFERENCES:
1. http://www.csie.ntnu.edu.tw/~ghhwang/course_slices/system_softw
are/Chapter2.pdf
2. http://searchwindevelopment.techtarget.com/tip/Introduction-to-theCLR

13CS404: PRINCIPLES OF PROGRAMMING LANGUAGES

LTPC
3003

Course Objectives:
To understand and describe syntax and semantics of programming
languages
To understand data, data types, and basic statements
To describe call-return architecture and ways of implementing
them
To understand object-orientation, concurrency, and event handling
in programming Languages
To know about the logic and scripting languages

153

Course Outcomes:
Able to describe syntax and semantics of programming languages
Work with data, data types, and basic statements of programming
languages
Design and implement subprogram constructs
Apply object-oriented,
programming constructs

concurrency,

and

event

handling

Develop programs in functional languages like Scheme, ML, and

Prolog
UNIT I

INTRODUCTION

The art of Language design Programming language spectrum Compilation and interpretation Evaluation of programming languages
Syntax and semantics of language C lite Names Types Type
systems - Binding Scope Static Dynamic Abstract data types
UNIT II

SEMANTICS

Expression Assignment - Control flow Input/output Exception

handling State transformations and partial functions Semantics with
dynamic typing Formal treatment of semantics
UNIT III

FUNCTIONS AND IMPLEMENTATIONS

Call and return Parameters and parameter passing mechanisms

Function implementation: function declaration semantics of call and
return formal treatment of types and semantics Memory
management: dynamic arrays garbage collection
UNIT IV

PROGRAMMING TECHNIQUES I

Imperative programming:
C ADA PERL Object Oriented
Programming: Small Talk Java Python Functional programming:
Scheme Haskell
UNIT V

PROGRAMMING TECHNIQUES II

Logic programming: Prolog Event driven programming: Event driven

control Event handling- Concurrent programming:
Concepts
Synchronization strategies Language level mechanism Inter process

154

communication Scripting languages.

TOTAL: 45 Periods
TEXTBOOKS:
1. Allen B. Tucker and Robert E. Noonan, Programming Languages
- Principles and Paradigms, Second Edition, Tata McGraw Hill,
2009
2. Robert W. Sebesta, Concepts of Programming Languages, Sixth
Edition, Addison Wesley, 2003.
REFERENCE BOOK:
1. Michael L Scott, Programming Language Pragmatics , Third
Edition, Morgan Kauffman, 2009
WEB REFERENCES:
1. http://home.deib.polimi.it/pradella/PL.html
2. http://www.cs.cmu.edu/~rwh/courses/ppl/
3. http://freevideolectures.com/Course/2249/Principles-ofProgramming-Languages#
4. http://forum.jntuworld.com/showthread.php?19715-Principles-OfProgramming-Language-%28PPL%29-Study-Materials-Notes
13IT401: DATABASE MANAGEMENT SYSTEMS

L T P C

(Common to CSE / IT)

3 00 3

Course Objectives:
To correlate the role of database management systems in
information technology applications within organization.
To sketch basic database concepts, including the structure and
operation of the relational data model.
To articulate the use of contemporary logical design methods and
study various normalization methods.
To understand the relationship between Transaction Processing
and Databases

155

 To study query processing and optimization

Course Outcomes:
Explore the basic concepts of Database system and design
database for enterprise applications using Entity Relationship
Diagrams
Analyze the consequence of calculus in designing relational model
and create database using query languages with constraints and
security
Normalize databases to reduce cost due to redundancy constraints
Assess different types of scheduling and recovery techniques for
concurrent transactions
Validate the query evaluation plan and optimize to reduce
computational complexity
UNIT I

DATABASE FUNDAMENTALS

Purpose of Database Systems View of Data - Database System

Architecture Database Users and Administrators Data Models
Structure of Network Model Structure of Hierarchical Model - Entity
Relationship Model Constraints - Entity Sets Attributes Keys - E-R
Diagrams - Design Issues - Extended E-R Features - Introduction of
Relational Model E-R Reduction to Relational Schemas.
UNIT II

RELATIONAL DATABASE MODEL

Structure of Relational Databases Schema Diagrams Relational

Query Languages - Relational Algebra Tuple Relational Calculus Domain Relational Calculus Queries in SQL Set Operations
Aggregate Operations Joins Views Integrity Constraints
Authorization Advanced SQL Functions and Procedures Triggers
Assertion Embedded SQL Dynamic SQL.
UNIT III LOGICAL DATABASE DESIGN

Need for good database design Functional Dependencies and Keys

Closure of Functional Dependencies Set Closure of attributes Dependency
Preservation
Decomposition
using
functional

156

dependencies Atomic domains and First Normal Form Second

Normal Form Third Normal Form Boyce Codd Normal Form
Multivalued Dependencies Decomposition using Multivalued
dependencies Fourth Normal Form Join Dependencies Fifth Normal
Form Introduction to Domain Key Normal Form Case Studies
UNIT IV DATABASE TRANSACTIONS AND

CONCURRENCY CONTROL
Transaction Model ACID properties Transaction States
Serializability - Conflict serializability View Serializability Testing
Serializability - Concurrency Control Lock Based Protocols
Deadlocks Multiple Granularity Time Stamp Based Protocols
Validation Based Protocols Multi Version Schemes Recovery System
Failure Classification Storage Recovery and Atomicity Recovery
Algorithm.
UNIT V

QUERY PROCESSING AND OPTIMIZATION

Query Processing - Measures of Query Cost - Selection Sorting - Join

Operation Other Operations - Evaluation of Expressions Query
Tuning - Query Optimization - Transformation of Relational Expressions Estimating Statistics of Expression Results - Choice of Evaluation Plans
Materialized Views.
TOTAL: 45 PERIODS
TEXTBOOK:
1. Henry F Korth, Abraham Silberschatz, S. Sudharshan, Database
System Concepts, Sixth Edition, McGraw Hill, 2011.
REFERENCE BOOKS:
1. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems,
Sixth Edition, Pearson Education/Addison Wesley, 2010.
2. Thomas Cannolly and Carolyn Begg, Database Systems, A
Practical Approach to Design, Implementation and Management,
Fifth Edition, Pearson Education, 2009.
3. C.J.Date, A.Kannan and S.Swamynathan,An Introduction to
Database Systems, Eighth Edition, Pearson Education, 2006.
157

4. Raghu Ramakrishnan, Johannes Gehrke, Database Management

Systems, McGraw Hill, Third Edition 2004.
WEB REFERENCES:
1. http://www.1keydata.com/datawarehousing/data-modelinglevels.html
2. http://www.cs.uwaterloo.ca/~gweddell/cs448/Arch.pdf
3. http://www.sql-tutorial.net/SQL-tutorial.asp
4. http://sqlzoo.net/
5. http://www.service-architecture.com/database/articles/
acid_properties.html
6. http://www.orafaq.com/wiki/Oracle_database_Performance_Tuning
_FAQ

13CS451: MICROPROCESSORS AND MICRO

CONTROLLERS LABORATORY

LTPC
0032

rd

(Common to CSE / 3 semester IT)

Course Objectives:
To acquire expertise in assembly language programming using
8086 programs
To develop programming skills on microcontroller programming
using 8051
To apply the assembly language programming for various
peripheral interfacing with the help of supporting chips.
Course Outcomes:
To write assembly language programs using 8086
To design effective applications using MASM assembler and cross
assemblers
To write programs to perform I/O using handshaking and interrupts
To develop different interfacing applications using the supporting
chips

158

 To design simple applications

SYLLABUS FOR THE LAB :
1. Simple programming exercises on 8086.
2. Code conversion, decimal arithmetic and Matrix operations.
3. Simple programming with BIOS Interrupts
4. Simple programming with DOS Interrupts
5. String manipulation - search, find and replace, copy operations,
sorting and searching.
6. Interfacing with 8086 8255 and 8253.
7. Interfacing with 8086 8279 and 8251.
8. Interfacing stepper motor with 8086/8051.
9. Interfacing ADC and DAC with 8086/8051.
10. Interfacing traffic light controller with 8086/8051.
TOTAL: 45 PERIODS

13CS452: SYSTEM SOFTWARE

LABORATORY

LTPC
0032

Course Objectives:
To learn to design and implement symbol table
To learn to design and implement one pass and two pass
assembler
To learn to design and implement absolute and relocatable loader
To experiment with CLR
To learn to design and implement macro processor and text editor
Course Outcomes:
Implement symbol table with appropriate data structure
Implement simple Assembler
Implement simple Loader

159

 Work with CLR environment

Implement simple macro processor and text editor
Syllabus for the lab:
1. Study of vim and Latex editors
2. Implement symbol table for a 8086 assembler
3. Implementation of assembler Two pass assembler for 8086
processor, one pass assembler for 8086 architecture
4. Implementation of Loader for 8086 architecture
5. Working with Common Language Runtime environment
6. Implementation of One pass Macro processor for 8086
architecture
7. Implementation of simple text editor
TOTAL: 45 PERIODS
WEB REFERENCES:
1. http://searchwindevelopment.techtarget.com/tip/Introduction-tothe-CLR
2. http://www.gabrielececchetti.it/Teaching/CalcolatoriElettronici/Doc
s/i8086_instruction_set.pdf
List of Sample Exercises (Using C language)
1. Develop documents using Latex.
2. Implementation of symbol table using hash table
3. Design and implement Pass I of a two pass assembler for 8086
processor assuming the input is error free.
4. Design and implement Pass II of a two pass assembler for 8086
processor assuming the input is error free.
5. Design and implement one pass assembler for 8086 architecture
6. Design and implement Absolute loader for 8086 architecture
7. Design and implement a pre-processor for processing macros in
C language using CLR environment
8. Design and implement Rolling display system for advertisement in
160

CLR environment
9. Design and implement One pass Macro processor for 8086
architecture
10. Design the editor structure for a text editor and implement it

13IT451: DATABASE MANAGEMENT SYSTEMS

LABORATORY

L T P C

(Common to CSE / IT)

0 0 3 2

Course Objectives:
To persuade different issues involved in the design and
implementation of a database system for real time applications.
To speculate sophisticated queries to extract information from the
large datasets available.
To schematize several database projects related to an information
technology problem based on given requirements.
Course Outcomes:
Populate and query a database using SQL DML/DDL commands.
Declare and enforce integrity constraints on a database using a
state-of-the-art RDBMS
Program in PL/SQL including stored procedures, stored functions,
cursors, packages.
Design and build a GUI application using any programming
language as front end
LIST OF EXPERIMENTS
Database Design using ER Diagram and Apply Normalization
1. Data Definition Language Commands
2. Data Manipulation Language Commands
3. Data Control Language, Nested Queries
4. Set operators and Join Queries

161

5. Views and Indexes

6. PL/SQL Triggers
7. PL/SQL Functions
8. PL/SQL Procedures
9. OORDBMS
10. Integrity and Authorization
11. Front end Tools
12. Form / Menu Design / Report
13. OLTP concepts

13MA501: PROBABILITY AND QUEUEING THEORY

LTPC
3 10 4

Course Objectives:
To know the association between the variables using correlation
and regression.
Understand the basic theory of discrete-time Markov chains.
To introduce the basic concept of queueing theory.
To formulate concrete problems using queueing theoretical
approaches and to apply queueing theory results to queueing
Networks.
To familiarize the student with the knowledge of reliability of
systems and statistical quality control of the products.
Course Outcomes:
Acquire skills in handling situations involving more than one
random variable and functions of random variables.
Have a well-founded knowledge of Markov processes which can
describe real life phenomena.
Be exposed to basic characteristic features of a queueing system
and acquire skills in analyzing models.

162

 Gain some insights on reliability and quality control

UNIT I

TWO DIMENSIONAL RANDOM VARIABLES

9+3

Joint distributions - Marginal and conditional distributions Correlation

and regression - Transformation of random variables Central limit
theorem.
UNIT II

MARKOV PROCESSES AND MARKOV CHAINS

9+3

Classification - Stationary process - Markov process - Markov chains

Transition probabilities - Limiting distributions-Poisson process.
UNIT III

QUEUEING THEORY

9 +3

Markovian models Birth and death queuing models- Steady state

results: Single and multiple server queuing models- queues with finite
waiting rooms- Littles Formula.
UNIT IV

NON-MARKOVIAN QUEUES AND QUEUEING

NETWORKS

9+3

M/G/1 queue- Pollaczek- Khinchine formula- series queues- open and

closed networks.
UNIT V

RELIABILITY AND QUALITY CONTROL

9+3

Concepts of reliability - Hazard functions - Reliability of series and

parallel systems - Control charts for measurements (Mean and Range
charts) Control charts for attributes (p, c and np charts).
TOTAL: 60 Periods
Note: Approved statistical table is permitted to use in the examinations.

TEXTBOOKS:
1. O.C. Ibe, Fundamentals of Applied Probability and Random
Processes,Elsevier, 1st Indian Reprint, 2010.
2. D. Gross and C.M. Harris, Fundamentals of Queueing Theory,
WileyStudent edition, 2011.
REFERENCE BOOKS:
1. H.A. Taha, Operations Research, Pearson Education, Asia, 8th

163

edition, 2009.
2. A.O. Allen, Probability, Statistics and Queueing Theory with
Computer Applications, Elsevier, 2nd edition, 2010.
3. K.S. Trivedi, Probability and Statistics with Reliability, Queueing
and Computer Science Applications, John Wiley and Sons, 2nd
edition, 2008.
4. E. Balagurusamy, Reliability Engineering, Tata McGraw-Hill
Publishing Company Ltd, New Delhi, Tenth reprint 2013.
WEB REFERENCES:
1. http://stattrek.com/probability-distributions/discretecontinuous.aspx
2. http://people.brunel.ac.uk/~mastjjb/jeb/or/queue.html
3. http://www.win.tue.nl/~iadan/queueing.pdf
13CS501: THEORY OF COMPUTATION

LTPC
3104

Course Objectives:
To know the different types of finite automata and regular
languages
To familiarize context free grammars and push down automata
To learn about Turing machines
To study about undecidable problems
To expose current trends and applications
Course Outcomes:
Design finite state automata for a language specification and
convert one form of automaton to another form
Construct regular expression for a particular language
Prove non regular languages using pumping lemma for regular
languages
Design push down automata(PDA) for languages and convert CFG
164

to PDA and vice versa

Design Turing machine and find undecidability in languages
Work with various grammars like matrix grammars, random context
grammar etc and their applications
UNIT I

REGULAR LANGUAGES

Finite Automata (FA) Deterministic Finite Automata (DFA) Nondeterministic Finite Automata (NFA) Finite automata with epsilon
transitions - Regular expression FA and regular expressions.
UNIT II

CONTEXT FREE LANGUAGES

Context Free Grammar (CFG) Parse trees Ambiguity in grammars

and languages Equivalence of Parse trees and derivation - Normal
forms for CFG Introduction to pushdown automata Languages of a
Pushdown Automata Equivalence of pushdown automata and CFG.
UNIT III

CLOSURE PROPERTIES

Pumping lemma for regular languages, Closure properties of regular

sets: complement and intersection - Equivalence and minimization of
finite automata Pumping lemma for CFL- Closure properties of CFL:
union, concatenation, Kleene closure, intersection and complement
Introduction to advanced grammars, DNA computing and membrane
computing.
UNIT IV TURING MACHINES

Turing machines: language of a Turing machine Turing machine as a

computing device - Techniques for construction of TMs Equivalence of
one tape and multi tape TMs.
UNIT V

UNDECIDABILITY

Undecidability: A language that is not Recursively Enumerable (RE) An

undecidable problem that is RE Undecidable problems about Turing
machine Rice theorem for recursive and recursively enumerable
languages Posts correspondence problem Classes P and NP
Polynomial reductions and NP complete problems
L : 45 ; T : 15 ; TOTAL: 60 Periods

165

TEXTBOOKS:
1. J.E.Hopcroft, R.Motwani and J.D Ullman, Introduction to
Automata Theory, Languages and Computations, Second Edition,
Pearson Education, 2003.
REFERENCE BOOKS:
1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the
theory of Computation, second Edition, Prentice-Hall of India Pvt.
Ltd, 2003.
2. Kamala Krithivasan and R. Rama, Introduction to Formal
Languages, Automata Theory and Computation, Pearson
Education, Delhi, 2009.
3. J. Martin, Introduction to Languages and the Theory of
Computation, Third Edition, Tata Mc Graw Hill, New Delhi, 2003.
4. Micheal Sipser, Introduction of the Theory and Computation,
Thomson Learning, 1997.
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/mathematics/18-404j-theory-ofcomputation-fall-2006/
3. http://infolab.stanford.edu/~ullman/ialc.html
4. http://www.cs.duke.edu/csed/jflap/tutorial/
5. http://www.turing.org.uk/turing/scrapbook/machine.html
13CS502: OPERATING SYSTEMS

LTPC

(Common to CSE / 4th semester IT)

3003

Course Objectives:
To provide basic knowledge of computer operating system
structures and functioning
To study about process management
To learn the basics of memory management

166

 To understand the structure of file and I/O systems

To be familiar with some operating systems
Course Outcomes:
Identify the components and their functionalities in the operating
system
Analyze the various process management algorithms
Evaluate the performance of various memory management
techniques
Design a simple file system
Analyze the performance of I/O operations
Get exposed to some popular operating systems - Linux, Windows
UNIT I

OPERATING SYSTEMS OVERVIEW

Introduction to operating systems Computer system organization architecture Operating system structure - operations Process,
memory, storage management Protection and security Distributed
systems Computing environments Open source operating systems
OS services User interface System calls System programs
Process concept - scheduling Operations on processes
Cooperating processes Inter-process communication Threads
UNIT II

PROCESS MANAGEMENT

10

Basic concepts Scheduling criteria Scheduling algorithms

Multiple processor scheduling Algorithm evaluation The critical
section problem Synchronization hardware Semaphores Classic
problems of synchronization Critical regions Monitors Deadlocks
Deadlock characterization Methods for handling deadlocks
Deadlock prevention Deadlock avoidance Deadlock detection
Recovery from deadlock.
UNIT III

MEMORY MANAGEMENT

Memory management Swapping Contiguous memory allocation

Paging Segmentation-Segmentation with paging Virtual memory:
Background Demand paging Copy on write Page replacement

167

Allocation of frames Thrashing

UNIT IV

FILE AND I/O SYSTEMS

File concept Access methods Directory structure File-system

mounting Protection Directory implementation Allocation methods
Free space management Disk scheduling Disk management
Swap space management Protection.
I/O Systems I/O Hardware Application I/O Interface Kernel I/O
subsystem
UNIT V

CASE STUDY

The Linux system History Design principles Kernel modules

Process management Scheduling Memory management File
systems Input and output Inter Process Communication Network
structure Security.
Windows 8 History Design principles. Android OS - History Design
principles
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, Operating
System Concepts Essentials, 8th Edition, John Wiley & Sons Inc.,
2011
2. Reto Meier, John Wiley and sons, Professional Android 4 Application
Development, 2012.
REFERENCE BOOKS:
1. Andrew S. Tanenbaum, Modern Operating Systems, Second
Edition, Addison Wesley, 2001.
2. Charles Crowley, Operating Systems: A
Approach, Tata McGraw Hill Education, 1996.

Design-Oriented

3. D M Dhamdhere, Operating Systems: A Concept-based

Approach, Second Edition, Tata McGraw-Hill Education, 2007.
4. William Stallings, Operating Systems: Internals and Design
Principles, Seventh Edition, Prentice Hall, 2011.

168

WEB REFERENCES:
1. www.nptel.ac.in
2. http://cseweb.ucsd.edu/classes/fa06/cse120/lectures/120-fa06l13.pdf
3. http://www.cs.kent.edu/~farrell/osf03/oldnotes/
4. http://www.microsoft.com/about/mspreview/windows8/Windows8_
RP_Product_guide.pdf
13CS503: CLIENT-SIDE TECHNOLOGIES

LTPC
3003

Course Objectives:
To identify the various tags used in HTML document.
To create user interactive web pages using JavaScript and DOM
To control the presentation of documents using Cascading Style
Sheets (CSS).
To work with different technologies related to XML
To update contents of a document without reloading using AJAX
with JSON.
To create animation over web using SVG
Course Outcomes:
Identify the key components of HTML document
Design a website using CSS and HTML
Create interactive web pages using JavaScript
Access and process various elements of web page using DOM
Represent web data using XML and perform translation using
XSLT
Design Web Pages using AJAX
Create animated web pages using SVG
UNIT I

BASIC INTERNET PROTOCOLS, HTML5

169

Basic Internet Protocols - The World Wide Web - HTTP messages

Web servers and clients - Introduction to HTML5 - Editing HTML5 - W3C
HTML validation service - Headings Linking - Images - Special
characters and horizontal rules Lists Tables Forms - Internal linking
- Meta elements - New HTML5 Form input types - Input and datalist
elements and auto complete attribute - Page structure elements
Canvas
UNIT II

JAVASCRIPT, JQUERY

Introduction to JavaScript JavaScript in perspective - Syntax Variables and data types -JavaScript control statements Operators
Literals Functions Objects Arrays Built in objects Event
handling - Fundamentals of JQuery - JQuery selectors - JQuery methods
to access HTML attributes Traversing - Manipulators Events - Effects
UNIT III

CSS, DOM

Types of CSS- Conflicting style sheets - Element positioning and

dimension - Box model and text flow - Media types - Queries - Drop
down menus - Text shadows - Rounded corners - Color box Shadows Gradients - Animation - Flexible box layout module - Multicolumn layout
introduction to DOM: Modeling a document - Traversing and modifying a
DOM tree - DOM collections - Dynamic styles - Using timer and dynamic
styles to create animated effects
UNIT IV

XML

XML documents and vocabularies - XML versions and declarations XML namespace - Representing data types : DTD, XML schema - DOM
based XML processing - Event oriented parsing: SAX - Transforming
the XML documents: XSLT- XPath- XPointer - XLink - XQuery Displaying XML documents in browsers

UNIT V

AJAX, JSON, SVG

170

Ajax - Enabled rich internet applications with XML and JSON - SVG
and bitmaps - SVG graphics model -SVG and CSS - SVG tools - SVG
basic built in shapes SVG transforms and groups - SVG definitions
and metadata - Viewports and coordinates - SVG colors and gradients Including bitmap images in SVG - SVG text and fonts - SVG animation
four ways - SVG and HTML5 - SVG and web apps - Making SVG with
XQuery or XSLT
TOTAL: 45 Periods
TEXTBOOKS:
1. P.J.Deitel, H.M.Deitel, Internet and World Wide Web How to
program, Pearson Education Publishers, Fifth Edition, 2009.
2. Jeffrey C. Jackson, "Web Technologies - A Computer Science
Perspective", Pearson Education, 2006
REFERENCE BOOK:
1. Robert. W. Sebesta, "Programming the World Wide Web", Fourth
Edition, Pearson Education, 2007.
2. Kogent Learning Solutions Inc., Html5 Black Book: Covers CSS3,
JavaScript, XKL, XHTML, AJAX, PHP and jQuery, Dreamtech
Press, 2011
3. Joe Fawcett, Danny Ayers, Liam R. E. Quin, Beginning XML,
Fifth Edition, John Wiley & Sons Publisher, 2012.
WEB REFERENCES:
1. www.nptel.ac.in
2. http://www.echoecho.com/javascript.htm
3. http://www.w3schools.com/jquery/default.asp
4. http://www.quackit.com/ajax/tutorial/
5. http://www.svgbasics.com/

171

13IT503: COMPUTER NETWORKS

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To understand the basic fundamental concepts of computer
networking
To enumerate the layered architecture of OSI and TCP/IP model
with its functions
To study, analyze and implement the design of a network using
TCP and UDP
To be familiar with the protocols of various layers and how they
can assist in network design and implementation
Course Outcomes:
Develop an understanding of basic computer network technology
with various topologies, transmission media along with error and
flow control techniques in physical & data link layer.
Expertise knowledge in routing and switching using basic
protocols for various issues in a given networking area.
Explore the features of TCP and UDP and analyze the networking
functionality for the development of an application using socket
functions.
Bring out the issues and protocols involved in application layer of
OSI architecture.
Analyze the various issues of IPv6.
UNIT I

INTRODUCTION

DATALINK LAYER

PHYSICAL

&

10

Introduction to Data Communication Network models OSI model

TCP/IP model Layers Physical layer - Topology Transmission
media. Datalink layer Error Detection and correction Parity LRC
CRC Hamming code Flow Control Sliding window - HDLC
Ethernet IEEE 802.11 FDDI Bridges.

172

UNIT II

NETWORK LAYER

Network layer - Circuit switching vs. packet switching IP addressing Internet Protocol - ARP IGMP ICMP Routing algorithms Link
State Routing OSPF Distance Vector Routing - RIP
UNIT III

TRANSPORT LAYER & ELEMENTARY

SOCKETS

Transport Layer Process to process delivery TCP and UDP segment format services and features - Congestion control and
avoidance QoS - Introduction to Sockets Socket address
Structures Elementary TCP UDP Sockets & functions - Iterative
Server - Concurrent Server - I/O multiplexing
UNIT IV

APPLICATION LAYER

Domain Name System (DNS) gethostbyname function gethostbyaddr function - E-mail (SMTP, IMAP, POP3) - FTP - SNMP
RMON
UNIT V

ISSUES IN IPv6

IPv6 Introduction IPv4 addressing & routing crisis Patching IPv4

IPv6 Transition Issues IPv6 Security protocols Security issues in
Ipv6 IPv6 Protocol Basics IPv6 Addressing Multicast Routing
Ipv6 QoS Current Issues to Deploy IPv6
TOTAL: 45 Periods
TEXTBOOKS:
1. Behrouz A. Foruzan, Data communication and Networking, Tata
McGraw-Hill, Fifth Edition, 2013
2. Larry L. Peterson, Bruce S. Davie, Computer Networks: A
Systems Approach, Morgan Kauffmann Publishers Inc., Third
Edition, 2003.
3. Pete Loshin, IPv6 : Theory, Protocol and Practice, ELSEVIER,
Morgan Kauffmann Publishers Inc., Second edition, 2004
REFERENCE BOOKS:
1. James F. Kuross, Keith W. Ross, Computer Networking, A

173

Top-Down Approach Featuring the Internet, Addison Wesley,

Third Edition, 2004.
2. William Stallings, Data and Computer Communication,
Pearson Education, Sixth Edition, 2000.
3. Andrew S. Tannenbaum, Computer
Education, Fourth Edition, 2003

Networks,

Pearson

4. D.E. Comer, Internetworking with TCP/IP Vol- III, (BSD Sockets

Version), Pearson Education, Second Edition, 2003.
5. W. Richard Stevens, UNIX Network Programming Vol-I,
Pearson Education, Second Edition, 1998.
WEB REFERENCES:
1. www.nptel.ac.in
2. http://compnetworking.about.com/od/basicnetworkingconcepts/a/
network_types.htm
3. http://www.protocols.com/pbook/tcpip1.htm
4. http://docs.oracle.com/cd/E23824_01/html/821-1453/ipv6troubleshoot-2.html
5. http://searchsecurity.techtarget.com/tip/Get-ready-for-IPv6-Fivesecurity-issues-to-consider

13IT504: SOFTWARE ENGINEERING

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To explore the fundamental concepts of software engineering
To develop skills that will enable them to construct software of high
quality.
To realize the process of developing new technology and the role
of experimentation
To introduce ethical and professional issues in developing project.
To know the concepts of different testing techniques.

174

Course Outcomes:
Apply software engineering principles and techniques
Develop, maintain and evaluate large-scale software systems
Perform independent research and analysis
Work as an effective member or leader of software engineering
teams
Ability to apply the principles, tools and practices of IT project
management
UNIT I

SOFTWARE PROCESS AND DEVELOPMENT

METHODOLOGY

Introduction to Software Engineering Life Cycle Models-Water fall

model- Spiral model- Win Win Spiral model- Prototyping model
Increment model RAD model -Software Processes - Software
Process Models The Rational Unified Process
UNIT II

SOFTWARE REQUIREMENTS

Functional and non functional Software document Requirement

engineering process Feasibility studies Software prototyping
Prototyping in the software process Data Functional and behavioral
models Structured analysis and data dictionary
UNIT III

ANALYSIS,
PRINCIPLES

DESIGN

CONCEPTS

AND

Systems engineering - Analysis concepts - Design process and concepts

Modular design Design heuristic Architectural design Data design
User interface design Real time software design System design
Real time executives Data acquisition system Monitoring and control
system
UNIT IV

TESTING

Taxonomy of software testing Types of S/W test Black box testing

Testing boundary conditions Structural testing Test coverage criteria
based on data flow mechanisms Regression testing Unit testing
Integration testing Validation testing System testing and Debugging

175

Software implementation techniques

UNIT V

SOFTWARE PROJECT MANAGEMENT

Measures and Measurement ZIPFs Law Software Cost estimation

Function Point models COCOMO Model Delphi Method Scheduling
Earned value Analysis Error Tracking Software Configuration
Management Program Evaluation Dynamics Software Maintenance
Project Planning Project Scheduling Risk Management Agile
Software Development Agile Methods Plan Driven and Agile
Development -Scaling Agile Methods Agile Project Management Case
Tools.
TOTAL: 45 Periods
TEXTBOOKS:
1. Ian Sommerville, Software engineering, Ninth Edition, Pearson
Education Asia, 2010.
2. Roger S. Pressman, Software Engineering: A practitioners
Approach, Seventh Edition, McGraw-Hill International Edition,
2010.
REFERENCE BOOKS:
1. Watts S.Humphrey, A Discipline for Software Engineering,
Pearson Education, 2007.
2. James F.Peters and Witold Pedrycz, Software Engineering,
Engineering Approach, Wiley-India, 2007.
3. Stephen R.Schach, Software Engineering, Tata McGraw-Hill,
2007.
4. S.A.Kelkar, Software Engineering, Prentice Hall of India Pvt,
2007.
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-005-elements-of-software-construction-fall-2008/

176

13CS551: OPERATING SYSTEMS LABORATORY

LTPC

(Common to CSE / 4th semester IT)

0032

Course Objectives:
To experiment file related system calls.
To practice on the process related system calls
To synchronize processes using semaphores.
To experiment with IPC system calls
Course Outcomes:
Work with file related System calls.
Manage processes using fork, exec, etc.
Establish communication between processes.
Apply Synchronization techniques.
Syllabus for the lab:
1. Working with file system commands
2. Process creation and management
3. Development of routines for inter process communication
4. Simulation of CPU scheduling algorithms and performance analysis
5. Simulation of Producer-Consumer problem using semaphores.
6. Implementation of deadlock avoidance and prevention algorithms
7. Implementation of contiguous and non contiguous memory
allocation algorithms
8. Implementation of Page replacement algorithms
9. Analysis of file allocation algorithms
10. Simulation of disk scheduling algorithms
11. Mini Project
TOTAL: 45 PERIODS
REFERENCE BOOKS:
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, Operating

177

System Concepts Essentials, John Wiley & Sons Inc., 2010.

2. Andrew S. Tanenbaum, Modern Operating Systems, Second
Edition, Addison Wesley, 2001.
3. D M Dhamdhere, Operating Systems: A Concept-based
Approach, Second Edition, Tata McGraw-Hill Education, 2007.
4. William Stallings, Operating Systems: Internals and Design
Principles, Seventh Edition, Prentice Hall, 2011.
WEB REFERENCES:
1. http://www.cs.fsu.edu/~cop4610t/#
2. http://ercim-news.ercim.eu/en71/special/oslab-an-interactiveoperating-system-laboratory
3. http://www.cl.cam.ac.uk/projects/raspberrypi/tutorials/os/
4. http://www.engcomputacaopucgo.com/arquivos/Materiais/Sistema
s%20Operacionais/OSEssentials.pdf
5. http://codex.cs.yale.edu/avi/os-book/OS8/os8e/slide-dir/PDFdir/ch16.pdf
List of Sample Exercises
1. Write a program to simulate the file system commands such as cat,
mv, rm, cp, ls and grep.
2. Write a program to implement Inter Process Communication (IPC)
using pipes.
3. Write a program to implement Inter Process Communication (IPC)
using shared memory and message queue.
4. Write a program to simulate and analyze the following scheduling
algorithms.
i. FCFS
ii. SJF (preemptive and non-preemptive)
iii. Priority Scheduling (preemptive and non-preemptive)
iv. Round Robin Scheduling
5. Write a program to solve the Producer-Consumer problem using

178

semaphores.
6. Write a program to implement deadlock avoidance algorithms.
7. Write a program to implement contiguous and non contiguous
memory allocation algorithms.
8. Write a program to implement page replacement algorithms (FIFO,
LRU, and Optimal).
9. Write a program to implement file allocation techniques
(Contiguous, Linked, Indexed, and Shared).
10. Write a program to implement the various disk scheduling
algorithms (FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK).
11. Mini project
13IT552: NETWORK LABORATORY

LTPC

(Common to CSE / IT)

0032

Course Objectives:
To implement the working of networking concepts.
To design and develop robust networking applications using TCP
and UDP
To design the working of various protocols
To demonstrate the usage of various networking tools.
Course Outcomes:
Develop or implement simple tasks like framing, flow control, error
correction and detection.
Analyze, develop and implement the client and server of a simple
program over a transport layer.
Implement the client and server of concurrent programs using
Pthreads, Fork, Select and Poll over transport layer
Study of simulation and analysis tools
List Of Exercises:
1. Write a program to implement framing.
2. Write a program to implement error correction & detection
179

techniques.
3. Implementation of routing protocols
4. Implementation of ARP
5. Write a socket program using TCP/UDP (IPv4 and IPv6)
implement the related applications as shown below:

to

i. File Transfer
ii. Domain Name System etc...
6. Simulation of sliding window protocols (Go back n, selective repeat
etc.)
7. Program to implement connection / connectionless oriented
concurrent server
8. Program to implement multicasting protocols
9. Study of simulation tools (NS2 and Qualnet)
10. Study of tools for analysing protocols (Wireshark)
11. Mini project on socket programming

13CS601: MULTIMEDIA SYSTEMS

LTPC
3003

Course Objectives:
To understand the characteristics and architecture of multimedia
systems
To study the functions of various elements in multimedia
To learn the working of multimedia components
To be familiar with different multimedia tools
To learn the
development

methodologies

for

multimedia

application

Course Outcomes:
Design an architecture for handling the multimedia stream
Work with the various elements of multimedia system

180

 Encode multimedia data with various standards

Develop animation, images, sound using Multimedia tools.
Develop software for multimedia application
UNIT I

INTRODUCTION

Introduction to multimedia Characteristics Utilities Creation -Uses

Promotion Digital representation Media and data streams
Multimedia architecture Multimedia documents. Visual display systems
Video adapter card Video adapter cable LCD LED - PDP - Optical
storage media - CD technology - DVD technology Bluray technology.
UNIT II

ELEMENTS OF MULTIMEDIA

10

Multimedia building blocks: Text - Graphics - Video Capturing - Sound

Capturing and Editing - Introduction to 2D & 3D graphics - Surface
characteristics and texture - Lights Animation: key frames & tweening Techniques - Principles of animation - 3D animation - File formats.
UNIT III

MULTIMEDIA CODING AND PACKAGING

Compression types and techniques CODEC - GIF coding standards

Lossy and lossless JPEG - MPEG-1,2,3,4 - MP3 Authoring tools Card and page based tools - Icon and object based tools Time based
tools - Cross platform authoring tools Editing tools - Text editing and
word processing tools - Painting and drawing tools - 3D modeling and
animation tools - Image editing tools Sound editing tools - Digital movie
tools
UNIT IV

MULTIMEDIA APPLICATION DEVELOPMENT

Software life cycle ADDIE model Conceptualization Content

collection and processing Story Flowline Script - Storyboard Implementation - Multiplatform issues Authoring Metaphors Testing
Report writing - Documentation - Case study: Web application
Console application Distributed application Mobile application Games consoles iTV Kiosks Education
UNIT V

INTRODUCTION TO MULTIMEDIA STREAMING

Streaming Media: Basics-Components-Process-Tools-Recording and

reproduction-Broadcast standards-Recording formats and Environment181

Streaming media Codecs. Live Broadcast: Content creation for live

broad cast and delivery. Case Study: Radio / TV station.
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Parekh R Principles of Multimedia Tata McGraw-Hill, 2006.
2. Steve Mack, Streaming Multimedia Bible (Broadcasting with Real
Media & Windows Media Technologies), Wiley Dreamtech India
Pvt Ltd,2002
REFERENCE BOOKS:
1. Villamil and Louis Molina, Multimedia :An Introduction, Prentice
Hall, New Delhi 1998
2. Tay Vaughan, Multimedia:
Professional, 2006

Making

It

Work

McGraw-Hill

3. Deitel & Deitel, Internet & World Wide Web How to Program,
Fifth Edition Prentice Hall, 2011
4. Banerji Ashok & Ghosh Ananda
Technologies, TMH, New Delhi 2010

Mohan,

Multimedia

5. Li, Ze-Nian & Drew-Mark S, Fundamentals of Multimedia, PHI

Learning Private Limited New Delhi 2012
6. Ralf Steinmetz, Klara Nahrstedt, Multimedia: Computing,
Communications and Applications Prentice Hall, 1995.
WEB REFERENCES:
1. http://www.cs.cf.ac.uk/Dave/Multimedia/node200.html
2. http://www.prepressure.com/techno/compression1.htm
3. http://www.softpanorama.org/Algorithms/compression.shtml
4. http://www.nextwavemultimedia.com/
5. http://www.scala.com/multimedia/

182

13CS602: SECURITY IN COMPUTING

LTPC
3003

Course Objectives:
To understand the basics of cryptography
To learn to identify the vulnerabilities in programs and to overcome
them
To create awareness of the different kinds of security threats in
networks
To study the security threats in databases and the solutions
available
To learn about the models and standards for security
Course Outcomes:
Demonstrate knowledge of symmetric and asymmetric Encryption
Algorithms like DES, AES and RSA
Use hash functions and digital signatures for protecting messages
and data.
Secure programs and protect systems from malicious code
Work with Firewalls, VPNs and IDSs to secure networks
Identify the issues and solutions for implementing Security in
Databases.
Demonstrate knowledge of Secure SDLC, Bell Lapadula and Biba
models and ISO 27000 family of standards
UNIT I

ELEMENTARY CRYPTOGRAPHY

Terminology
and
background

Substitution
ciphers

Transpositions

Making
good encryption algorithms - Data
Encryption Standard - AES encryption algorithm Public key
encryption Cryptographic hash functions Key exchange Digital
signatures Certificates
UNIT II

PROGRAM SECURITY

Secure programs Non-malicious program errors Viruses Targeted

183

malicious code Controls against program threat Control of access to

general objects User authentication Secure coding practices
Vulnerabilities in web applications
UNIT III

SECURITY IN NETWORKS

Threats in networks Threat analysis Encryption Virtual Private

Networks PKI SSH SSL IPSec content integrity Access
controls Wireless security Honey pots Traffic flow security
Firewalls Intrusion detection systems Secure e-mail Mobile
Security
UNIT IV

SECURITY IN DATABASES

Security requirements of database systems Reliability and integrity in

databases Two phase update Redundancy / internal consistency
Recovery Concurrency / consistency Monitors Sensitive data
Types of disclosures Inference
UNIT V

SECURITY MODELS AND STANDARDS

Secure SDLC Secure application testing Security architecture models

Trusted computing base Bell LaPadula confidentiality model Biba
integrity model Graham Denning access control model Harrison
Ruzzo Ulman model Secure frameworks COSO CobiT
Compliances PCI DSS Security standards - ISO 27000 family of
standards
TOTAL: 45 Periods
TEXTBOOKS:
1. Charles P. Pfleeger, Shari Lawrence Pfleeger, Security in
Computing, Fourth Edition, Pearson Education, 2007.
2. Matt Bishop, Introduction to Computer Security, Addison-Wesley,
2004.
3. Michael Whitman, Herbert J. Mattord, Management of Information
Security, Third Edition, Course Technology, 2010.
REFERENCE BOOKS:
1. William Stallings, Cryptography and Network Security: Principles

184

and Practices, Fifth Edition, Prentice Hall, 2010.

2. Michael Howard, David LeBlanc, John Viega, 24 Deadly Sins of
Software Security: Programming Flaws and How to Fix Them,
First Edition, McGraw Hill Osborne Media, 2009.
3. Matt Bishop, Computer Security: Art and Science, First Edition,
Addison-Wesley, 2002.
WEB REFERENCES:
1. https://www.owasp.org/index.php/Top_10_2010
2. https://www.pcisecuritystandards.org/security_standards/pci_dss
.shtml
3. http://cwe.mitre.org/top25/index.html
4. http://www.insecure.org
5. http://www.27000.org

13CS603: SERVER-SIDE TECHNOLOGIES

LTPC
3003

Course Objectives:
To study the functionality of World Wide Web Server using
Servlet.
To learn to develop web applications by separating presentation
and logic using JSP.
To design web applications using PHP
To design web applications and develop websites using
ASP.NET
To develop and deploy web services.
To build web applications using Ruby on Rails
Course Outcomes:
Build applications using Servlet
Ability to embed program code related to presentation within web
document using JSP
185

 Generate dynamic response to client request using PHP

Acquainted with ASP.NET a development framework for building
web pages and web sites
Capable of creating, describing, publishing and consuming the
Web Service
Rapidly develop database driven web application using Ruby on
Rails
UNIT I

SERVLET AND JSP

Introduction to J2EE - Servlet - Life cycle - Parameter data - Sessions

Cookies URL rewriting - Other servlet capabilities - Servlets and
concurrency - Database connectivity.
MVC pattern: Separating programming and presentation - JSP
technology - JSP expression language - JSP markup - JSTL core
actions - JavaBeans classes and JSP - Tag libraries and files
UNIT II

PHP

Introduction - Form processing and business logic - Reading from a

database - Using cookies Session handling - Dynamic content
generation
UNIT III

ASP.NET

.NET framework - Architecture of CLR - .NET building blocks Introduction to ASP.Net Web basics-Multitier application architecture
- Creating and running a simple web form example - Web controls
Validation controls Session tracking ADO.NET connected model ADO.NET disconnected model - ASP.NET Ajax - Case study
UNIT IV WEB SERVICES

Introduction SOA - WCF service basics SOAP REST JSON Publishing and consuming: SOAP based WCF web services - REST
based XML web services - REST based JSON - Session tracking in a
SOAP based WCF Web Service - Database access and invoking a
service from ASP.NET web services - Returning user defined types

186

UNIT V

RUBY ON RAILS, PYTHON

Introduction to Ruby : Data types - Simple input and output - Control

statements - Fundamentals of arrays Hashes Methods Classes Code blocks and Iterators - Pattern Matching -Introduction to Ruby on
Rails - Introduction to Python: Structure of python program
Statements Simple programs using python
TOTAL: 45 Periods
TEXTBOOKS:
1. P.J.Deitel, H.M.Deitel, Internet and World Wide Web How to
program, Fifth Edition, Pearson Education Publishers, 2009.
2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth
Edition, Pearson Education, 2007
REFERENCE BOOKS:
1. Stephen C. Perry Core C# and .NET, Pearson Education, 2006
2. Sam Ruby, Dave Thomas, David Heinemeier Hansson, Agile
Web Development with Rails, Fourth Edition, The Pragmatic
Programmers, 2011
3. Jeffrey C. Jackson, "Web Technologies--A Computer Science
Perspective", Pearson Education, 2006
4. James O. Knowlton,
Publishing Inc., 2008

Python: Create-Modify-Reuse, Wiley

WEB REFERENCES:
1. http://courses.coreservlets.com/Course-Materials/csajsp2.html
2. http://www.tutorialspoint.com/php/php_pdf_version.htm
3. http://asp.net-tutorials.com
4. http://progtutorials.tripod.com/WebServices.htm
5. http://guides.rubyonrails.org/getting_started.html

187

13CS604: COMPILER DESIGN

LTPC
3014

Course Objectives:
To show the specifications of tokens of a language and design a
scanner
To study the different types of parser and design and implement a
parser for a given grammar
To represent the source code in a suitable intermediate code for
the various programming language constructs
To optimize the code at different levels for the reductions of size
and/or execution of the compiled program
To generate the machine code from the Intermediate code by
considering the target machine architecture
To understand the working of parallelizing compilers
Course Outcomes:
Design a front end for a compiler
Choose the right storage structure for the language constructs
Select the appropriate intermediate code for the parsed source
language
Design and implement a simple code generator
Apply the optimization techniques on the intermediate code and
machine code
Realize the internals of parallelizing compiler
UNIT I

FRONT END OF COMPILERS

9+3

The structure of compiler Lexical analysis: Role of Lexical analyzer Specification and recognition of tokens - Syntax Analysis: Top down
parsing - Bottom up parsing - LR Parsers: SLR CLR - LALR.
Lab Component: Lexical analyzer generators - Parser generators
UNIT II

INTERMEDIATE CODE GENERATION

9+3

Syntax Directed Definitions - Evaluation orders for syntax directed

188

definitions - Syntax Directed Translation schemes - Intermediate

languages: Three address code - Syntax tree - Postfix code
Declarations Type checking Expression translation Back patching.
Lab Component: Intermediate code generation of Expressions Assignment statements with arrays - Control flow statements - Switch
statements.
UNIT III

OBJECT CODE GENERATION

9+3

Storage organization - Stack allocation space - Access to non-local

data on the stack - Heap management - Issues in code generation Design of code generator - Register allocation and assignment
Instruction selection by tree rewriting Optimal code generation for
expressions Dynamic programming code generation.
Lab Component: Code generation for any specific architecture
supported by open source compilers
UNIT IV

CODE OPTIMIZATION

9+3

Basic blocks and Flow graphs Optimization of basic blocks Principal

sources of optimizations Data flow analysis Constant propagation
Partial redundancy elimination Peephole optimizations.
Lab Component: Exploring and customizing different types of
optimizations supported by any open source compiler
UNIT V

PARALLELIZING COMPILER

9+3

Basic concepts and examples Iteration spaces Affine array indexes

Data reuse Array data dependence - Finding synchronization free
parallelism Synchronization between parallel loops Locality
optimizations.
Case study : Open source parallelizing compilers
L : 45 ; P : 15 ; TOTAL: 60 Periods
TEXTBOOKS:
1. Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman,
Compilers: Principles, Techniques and Tools, Second Edition,
Pearson Education, 2008.

189

2. K.Muneeswaran,Compiler Design, Oxford University Press, 2013

REFERENCE BOOKS:
1. Randy Allen, Ken Kennedy, Optimizing Compilers for Modern
Architectures: A Dependence-based Approach, Morgan Kaufmann
Publishers, 2002.
2. Steven S.
Muchnick, Advanced Compiler Design and
Implementation, Morgan Kaufmann Publishers - Elsevier Science,
India, Indian Reprint 2003.
3. Keith D Cooper and Linda Torczon, Engineering a Compiler,
Morgan Kaufmann Publishers Elsevier Science, 2004.
4. V. Raghavan, Principles of Compiler Design, Tata McGraw Hill
Education Publishers, 2010.
5. Allen I. Holub, Compiler Design in C, Prentice-Hall software series,
1993
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-035-computer-language-engineering-spring-2010/
3. http://infolab.stanford.edu/~ullman/dragon.html
4. http://dinosaur.compilertools.net/
5. http://www.onesmartclick.com/engineering/compiler-design.html
13IT602: OBJECT ORIENTED ANALYSIS AND DESIGN

LTPC

(Common to CSE / IT)

3 0 0 3

Course Objectives:
To develop background knowledge as well as core expertise in
object oriented system.
To provide the importance of the software design process.
To assess Unified Modeling Language and use the UML design
diagrams.

190

 To learn basic OO analysis and design skills through an elaborate

case study
To learn the appropriate usage of design patterns
Course Outcomes:
Create use case documents that capture requirements for a
software system.
Create class diagrams that model both the domain model and
design model of a software system.
Create interaction diagrams that model the dynamic aspects of a
software system.
Address the real world problems by modeling software solutions
using UML tools.
Apply design patterns that facilitate development and evolution of
new models
UNIT I

OOAD BASICS

Introduction - Overview of Object Oriented system development - Object

Basics OO Themes Evidence for usefulness of OO Development
OO Modeling OO History -Inception The NextGen POS system The
Monopoly Game system
UNIT II

STATIC MODELING

Use case Modeling - Relating Use cases include, extend and

generalization - Elaboration - Domain models - Finding conceptual
classes and description classes Associations Attributes Domain
model refinement Finding conceptual class hierarchies- Aggregation
and composition- UML activity diagrams and modeling
UNIT III

DYNAMIC MODELING

System sequence diagrams Communication diagrams - Relationship

between sequence diagrams and use cases - Logical architecture and
UML package diagram Logical architecture refinement - UML class
diagrams Relationship Inheritance Abstract classes
Polymorphism - Operation contracts

191

UNIT IV

DESIGN PATTERNS

12

Object oriented design methodology Common base class - GRASP:

Designing objects with responsibilities Patterns Creator Information
expert Low coupling Controller High cohesion Designing for
visibility - Applying GoF design patterns Adapter Singleton Factory
Strategy Composite - Facade and observer patterns
UNIT V

IMPLEMENTATION AND APPLICATION

Mapping design to code Forward Engineering Reverse Engineering Test driven development Refactoring UML tools and UML as
blueprint - UML state machine diagrams and modeling - UML deployment
and component diagrams
TOTAL: 45 Periods
TEXTBOOKS:
1. Craig Larman, "Applying UML and Patterns: An Introduction to
object- oriented Analysis and Design and iterative development,
Third Edition, Pearson Education, 2005
2. Micheal Blaha, James Rambaugh, Object-Oriented Modeling and
Design with UML, Second Edition, Prentice Hall of India Private
Limited, 2007
REFERENCE BOOKS:
1. Mike
ODocherty,
Object-Oriented
Analysis
&
Design:
Understanding System Development with UML 2.0, John Wiley &
Sons, 2005.
2. James W- Cooper, Addison-Wesley, Java Design Patterns A
Tutorial, 2000.
3. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides,
Design patterns: Elements of Reusable object-oriented software,
Addison-Wesley, 1995
WEB REFERENCES:
1. http://www.eclipse.org/
2. http://argouml.tigris.org/

192

3. http://faculty.inverhills.edu
4. http://www.cragsystems.co.uk/
5. http://www.uml-diagrams.org
13HS651 : PROFESSIONAL
COMMUNICATION SKILLS LAB

LTPC
0 032

Course Objectives:
To enable the students of engineering and technology attain
effective professional communication skills
To train the aspirants to get through interviews successfully
To make them successful corporates
To upgrade the language proficiency level of engineering students
Course Outcomes:
The students of Engineering and technology will be able to attain
effective communication skills
The students business communication will be enhanced
The students will be enabled to acquire language proficiency
The students will be able to face interviews
Vocabulary Building

Synonyms & antonyms, grammar: error spotting exercise, listening

exercise, reading comprehension exercises, sequencing the jumbled
sentences, cloze test
Speech Practice

Introducing all phonemes, consonants, vowels, diphthongs, stress

pattern, sound recognition exercises
Business Correspondence

10

Nuances of effective presentation, corporate etiquette, body language,

team skills, power dressing, writing memos, notice, agenda, circular,
itinerary, ESP (speeches on special occasions: master of ceremony,
welcome address etc. )

193

Interview Skills

10

Group Discussion, persuasive skills, negotiating skills, successful

interview skills, resume designing, mock interviews, E-mail etiquette,
drafting E-mail
TOTAL: 30 PERIODS
REFERENCE BOOKS:
1. Berry, Thomas Elliott. Most Common Mistakes in English Usage.
New Delhi: TMH Publication Company Limited, 2012.
2. Thorpe E and Heaton S.

Objective English.

Ed: Pearson

Education, II Edition, New Delhi: 2007.

3. Bhatnagar, R.P. English for Competitive Examination. 3Ed.
Macmillan, New Delhi: 2012.
4. Bhatnagar, R.P., NITIN Bhatnagar and Mamta. Communicative
English for Engineers & Professionals. Noida: Pearson Education,
2010.
5. Rizvi, Asharaf M. Effective Technical Communication. New Delhi:
Tata McGraw-Hill Publishing Company Limited, 2007.
13CS651: CLIENT SERVER TECHNOLOGIES
LABORATORY

LTPC
0032

Course Objectives:
To create simple web pages using HTML5 and solve the appearance
based problem using Cascading Style Sheets (CSS).
To learn to create user interactive web pages using JavaScript.
To work with different technologies related to XML
To update contents of a document without reloading using AJAX with
JSON.
To learn to develop website using server side programming and
scripting languages
To learn to design web pages and develop websites using ASP.NET

194

 To develop and deploy web services.

To experiment with Ruby and Python
Course Outcomes:
Create increasingly appealing and powerful web pages using CSS
and HTML elements
Create interactive web pages using JavaScript and DOM.
Represent web data using XML and perform translation using XSLT
Generate dynamic response to client request using Servlet, JSP and
PHP
Design web pages using AJAX
Develop a framework for building web pages and web sites
Create and deploy web services
Develop database driven web application using Ruby on Rails and
Python
Syllabus for the lab :
1. Web page creation using HTML5 and CSS3
2. Validating web form controls using JavaScript and DOM
3. Programs using XML XSLT
4. Invoking java servlet programs from HTML forms
5. Create three-tier applications using JSP
6. Generate dynamic response to client request using PHP
7. Programs using AJAX with JSON
8. Develop website using ASP.NET
9. Implementing web services
10. Working with Ruby on Rails framework
11. Working with Python
12. Mini project
TOTAL: 45 PERIODS

195

REFERENCE BOOKS :
1. Deitel & Deitel, Internet & World Wide Web How to Program, Fifth
Edition Prentice Hall, 2011
2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth
Edition, Pearson Education, 2007
3. Sam Ruby, Dave Thomas, David Heinemeier Hansson,Agile Web
Development with Rails, Fourth Edition, the Pragmatic
Programmers, 2011.
WEB REFERENCES :
1. http://www.tutorialspoint.com/ python/index.htm
2. http://www.w3schools.com/ xsl/default.asp
3. http://www.webdeveloper.com/javascript/javascript_js_tutorial.html
4. http://guides.rubyonrails.org/getting_started.html
LIST OF SAMPLE EXERCISES
1. Create an html page named as SimpleTags.html. Add the following
tags detail. Set the title of the page as Simple HTML Tags within
the body perform the following

Moving text = Simple HTML Tags

Different heading tags ( h1 to h6)

Paragraph

Horizontal line

Line Break

Block Quote

Pre tag

Different Logical Style (<b>, <c>, <sub>, <sup>....)

Different Physical style (<code>, <del>, <kbd>...)

Listing tags

a) Create a file external.html to include the external style sheet with

necessary tag.

196

b) Create a file internal.html and include the internal style sheet for
body tags & also use class name, so that the style can be applied
for all tags.
c) Create StyleSheetLinks.html
external.html and internal.html.

to

include

hyperlinks

for

d) Create an html page named as mixedframe.html. Divide the

page into two columns of 25% & 75% size. In 25% display the
html file named SimpleTags.html and divides the 75% into two
rows. (50% & 50%). In the first 50% display the file
StyleSheetLinks.html other 50% to display the files
external.html
and
internal.html
on
clicking
links
in
StyleSheetLinks.html
2. Display the calendar using JavaScript code by getting the year from
the user. Create an html page named as ValidateRegistration.html
a) Define a method name as reset() to be called when reset
button is clicked and manually set all values of fields to default.
b) Define a method name as validate() to be called when a
button is clicked.
1. Check for blank entry in name, age, email, phone no,
radio button, checkbox and multiple selection listbox
2. maximum
number
of
characters
in
name>15,phoneno<10 digits, age>0 and age<50, check
for valid format of email
3. check whether at least one option is selected in list box
4. Once all the values are properly filled make the submit
button to be visible. On clicking the submit button display
the values of all controls
c) Define the various fields in form using table and make use of
DOM for accessing the controls.
3. Create the xml document with XML DTD and XML schema for the
tutorials which consists of a collection of tutorial. Each tutorial
contains information such as name, URL. Display the name and url

197

from the XML document in a tabular format italicized and add a

green background color to the "name" column and blue
background color to the URL column.
4. Create a website for displaying the cricket score and update the
score using Ajax and JSON
5. Write a Servlet program to display the amount to be paid by the user
based on the make (eg. Nokia, Samsung etc.,), model (eg. C3, A110
etc.,) and quantity selected by the user. Use database to store
details about mobile such as mobile make, mobile model, and price.
6. Design a Web page to display a set of questions and answer
options. Use JSP to evaluate the answers selected by the user and
calculates the marks. Insert the mark and name of the user into
database and display marks to the user.
7. Design a HTML form page containing e-banking details with the card
number (16 digits), account number, pin number and card validity
periods (i.e., from & to). Write a PHP program that reads the data
from the client, checks for all the validity and displays the account
holder details. If any one of the data is invalid, then respective
message has to be sent to the client.
8. Create a website for Library details Management using ASP.NET.
Add textboxes for book name, author name, access no., publication
year, edition, publisher, price and Button controls for Insert, Update
and Delete from the database. Use the validation controls for
validation and perform the needed operation
9. Create a web service for online shopping
10. Develop an application to upload a file and delete an existing file
using Ruby on Rails

198

13IT652: OBJECT ORIENTED ANALYSIS AND DESIGN

LAB

LTPC
0 0 3 2

(Common to CSE / IT)

Course Objectives:
To highlight the importance of object-oriented analysis and design
and its limitations.
To show how we apply the process of object-oriented analysis and
design to software development.
To point out the importance and function of each UML model
throughout the process of object-oriented analysis and design and
explaining the notation of various elements in these models.
To provide the necessary knowledge and skills in using objectoriented CASE tools.
Course Outcomes:
Construct various UML models (including use case diagrams,
class diagrams, interaction diagrams, state chart diagrams, activity
diagrams, and implementation diagrams) using the appropriate
notation using the Rational Software Suite.
Recognize the role and function of each UML model in developing
object-oriented software.
Work with object oriented CASE tools
List of Exercises
Practice the following for a given project
1. To develop a problem statement and Statement of Work.
2. Develop an IEEE standard SRS document. Also develop risk
management and project plan (Gantt chart).
3. Identify Use Cases and develop the Use Case model.
4. Identify the business activities and develop an UML Activity
diagram.
5. Identity the conceptual classes and develop a domain model with

199

UML Class diagram.

6. Using the identified scenarios find the interaction between objects
and represent them using UML Interaction diagrams.
7. Draw the State Chart diagram.
8. Identify the User Interface, Domain objects, and Technical
services. Draw the partial layered, logical architecture diagram
with UML package diagram notation and patterns
9. Draw Component and Deployment diagrams.
10. Practice forward engineering and reverse engineering
TOTAL: 45 Periods

13CS701: PATTERN RECOGNITION

LTPC
301 4

Course Objectives:
To learn the theory and function models required for pattern
recognition
To understand linear models for classification
To study graphical and distance based models
To exemplify the construction of tree and rule based models
To learn to design model ensembles
Course Outcomes:
Explain the theory and function models behind pattern recognition
Use linear models for classification
Build and infer from graphical and distance based models
Apply tree and rule based model for decision making
Design and implement model ensembles
UNIT I

INTRODUCTION

9+3

Probability theory model selection The curse of dimensionality

Decision theory Information theory Linear basis function models

200

Bias Variance Decomposition Bayesian linear regression

Bayesian model comparisons Evidence approximation Limitations of
fixed basis function
UNIT II

LINEAR MODELS FOR CLASSIFICATION

9+3

Discriminant functions Probabilistic generative models Probabilistic

discriminative models The Laplace approximation Bayesian logistic
regression The least square method The Perceptron Support
vector machines Obtaining probabilities from linear classifiers Going
beyond linearity with kernel methods
UNIT III

GRAPHICAL AND DISTANCE BASED MODELS

9+3

Bayesian Networks Conditional independence Markov random

Bayesian networks Inference in Graphical models Neighbours and
exemplars Nearest neighbor classification Distance based clustering
Hierarchical clustering From kernels to distances
UNIT IV TREE AND RULE BASED MODEL

9+3

Decision trees Ranking and probability estimation trees Tree learning

as variance reduction Learning ordered rule lists unordered rule lists
Descriptive rule learning First order rule learning
UNIT V

MODEL ENSEMBLES

9+3

Features transformation construction and selection Bagging and

Random forests Boosting Model ensembles: Bias - Variance
Margins Other ensemble models Meta learning
L : 45 ; P : 15 ; TOTAL: 60 Periods
TEXTBOOK:
1. Christopher M Bishop,
learning", Springer, 2006.

"Pattern Recognition and Machine

2. P.Flach, "Machine Learning: The art and science of algorithms that

make sense of data", Cambridge University Press, 2012
REFERENCE BOOKS:
1. Richard O.Duda, Peter E Hart, David
Classification", second edition, Wiley, 2001

201

G.Stork,

"Pattern

2. Robert Schalkoff, "Pattern Recognition : Statistical, Structural and

Neural Approaches", Wiley, 2007
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/media-arts-and-sciences/mas-622jpattern-recognition-and-analysis-fall-2006/
3. http://jeff.cs.mcgill.ca/~godfried/teaching/pr-web.html

13CS702: ADVANCED COMPUTER ARCHITECTURE

LTPC
3003

Course Objectives:
To expose the basic concepts of different types of parallelism.
To study vector architecture and GPU architecture.
To understand the different multiprocessor architectures and
memory consistency models.
To understand the architecture, issues and working of warehouse
scale computers.
To study the multicore architectures and their design issues.
Course Outcomes:
Analyse the
computers.

architecture

of

GPUs

and

warehouse

scale

Develop parallel programs using CUDA programming language for

GPUs.
Analyse the performance of dynamic code scheduling and
speculation.
Explore the cache coherence protocols for symmetric and
distributed shared memory system.
Compare the performance of various synchronization mechanisms
in a multiprocessor system.

202

 Analyse SMT and CMP architecture.

Compare the features of multicore processor architectures.
UNIT I

INSTRUCTION LEVEL PARALLELISM

Classes of computers Trends in technology, power, energy and cost

Dependability Measuring, Reporting and summarizing performance
Quantitative principles of computer design Classes of parallelism.
ILP: Concepts and challenges - Basic compiler techniques for exposing
ILP Branch prediction- Dynamic scheduling Hardware based
Speculation- Multiple issue and static and dynamic scheduling Limitations of ILP
UNIT II

VECTOR ,SIMD AND GPU ARCHITECTURES

Vector architecture - SIMD instruction set extensions for multimedia

Graphics processing units - Detecting and enhancing loop level
parallelism - Case studies.
UNIT III

MULTIPROCESSOR ARCHITECTURE

Multiprocessor architecture: Issues and approach - Centralized shared

memory architecture Multiprocessor cache coherence - Snooping
cache coherence protocols Limitations - Distributed shared memory Directory based cache coherence protocols - Performance issues
Synchronization - Models of memory consistency.
UNIT IV

WAREHOUSE-SCALE ARCHITECTURES

Programming models and workloads for Warehouse-Scale computers

Architectures for Warehouse-Scale computing Physical infrastructure
and costs Cloud computing Case studies.
UNIT V

MULTICORE ARCHITECTURES

Software and hardware multithreading SMT and CMP architectures

Design issues - Case studies: Intel multicore architecture SUN CMP
architecture - Heterogeneous multicore processors - Case study: IBM
cell processor.
TOTAL: 45 Periods

203

TEXTBOOK:
1. John L. Hennessey and David A. Patterson, Computer
architecture A quantitative approach, Morgan Kaufmann /
Elsevier Publishers, 5th edition, 2012.
REFERENCE BOOKS:
1. David E. Culler, Jaswinder Pal Singh, Parallel computing
architecture: A hardware/software approach, Morgan Kaufmann
/Elsevier Publishers, 1999.
2. Kai Hwang and Zhi.Wei Xu, Scalable Parallel Computing, Tata
McGraw Hill, New Delhi, 2003.
3. Kai Hwang, Advanced Computer Architecture, Tata McGraw-Hill
Education, 2003
4. Richard Y. Kain, Advanced Computer Architecture a Systems
Design Approach, Prentice Hall, 2011.
5. David E. Culler, Jaswinder Pal Singh, Parallel Computing
Architecture: A Hardware/ Software Approach, Morgan Kaufmann
/ Elsevier, 1997.
WEB REFERENCES:
1. http://docs.nvidia.com/cuda/cuda-c-programming-guide/
2. http://www.cs.cmu.edu/~fp/courses/15213-s07/lectures/27multicore.pdf
3. http://rolfed.com/nehalem/nehalemPaper.pdf
4. www.nptel.ac.in

13CS703: COMPUTER GRAPHICS

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To learn the output primitives like line, circle and ellipse using
algorithms.
To study the 2-D and 3-D viewing and transformations.

204

 To understand various visible surface detection techniques, color

models and animation techniques.
To motivate the students to create the 3-D scenes by adding
textures, shadows and shades to the objects in the scene.
To enable the students to create the fractal images and compound
objects through Boolean operations on basic objects.
Course Outcomes:
Develop the line, circle and ellipse drawing algorithms
Apply the two dimensional and three dimensional geometric
transformations
Perform the line, polygon, curve and text clipping
Represent 2-D and 3-D objects
Work with color models such as RGB, YIQ, CMY, HSV
Apply different methods for image rendering
Create the fractal images
UNIT I

2-D PRIMITIVES

11

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

3-D CONCEPTS

Parallel and perspective projections - Three dimensional object

representation Polygons, Curved lines Splines - Quadric surfaces Visualization of data sets - 3D transformations Viewing -Visible surface
identification
UNIT III

GRAPHICS PROGRAMMING

Color Models RGB, YIQ, CMY, HSV Animations General computer

animation Raster - Keyframe - Graphics programming using OPENGL
Basic graphics primitives Drawing three dimensional objects Drawing three dimensional scenes

205

UNIT IV

RENDERING

Introduction to shading models Flat and smooth shading Adding

texture to faces Adding shadows of objects Building a camera in a
program Creating shaded objects Rendering texture Drawing
shadows
UNIT V

FRACTALS

Fractals and self similarity Peano curves Creating image by iterated

functions Mandelbrot sets Julia sets Random fractals Overview of
ray tracing Intersecting rays with other primitives Adding surface
texture Reflections and transparency Boolean operations on objects
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Donald D. Hearn, M. Pauline Baker and Warren Carithers,
Computer Graphics with OpenGL, Fourth Edition, Pearson
Education, 2010.
REFERENCE BOOKS:
1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F.
Hughes, Computer Graphics Principles and Practice , Second
Edition in C, Pearson Education 2007
2. F .S. Hill, Computer Graphics using OPENGL, Second edition,
Pearson Education 2003
WEB REFERENCES:
1. www.nptel.ac.in
2. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-837-computer-graphics-fall-2003/
3. http://www.moshplant.com/direct-or/bezier/
4. http://www.cs.mtu.edu/~shene/COURSES/cs3621/NOTES/spline/B
-spline/bspline-curve-prop.html

206

13CS704: MOBILE AND PERVASIVE COMPUTING

LTPC
3003

Course Objectives:
To study the details of lower layers of mobile architectures in the
context of pervasive computing and mobile applications
To introduce the characteristics, basic concepts and systems
issues in mobile and pervasive computing
Course Outcomes:
Discover the characteristics of pervasive computing applications
including the major system components and architectures of the
systems
Analyze the strengths and limitations of the tools and devices for
development of pervasive computing systems
Exploit the characteristics of different types of mobile networks
UNIT I

PERVASIVE COMPUTING

Basics and vision Architecture and applications requirements Smart

devices and operating systems - Secure services Smart mobiles, cards
and device networks
UNIT II

MOBILE APPLICATIONS

History Mobile ecosystem Designing for context Mobile strategy

Mobile applications Information architecture Design Mobile web
apps Vs native apps Adapting to devices Supporting devices
Application development on Android and iPhone.
UNIT III

MEDIUM ACCESS AND TELECOMMUNICATIONS

Frequencies Signals Antennas Signal propagation Media access

control: Motivation - SDMA, FDMA, TDMA, CDMA GSM - Mobile
services - System architecture Protocols - Localization and calling Handover GPRS
UNIT IV

WIRELESS NETWORKS

Infrared vs radio transmission Infrastructure and adhoc networks

WLAN, IEEE 802.11 standards protocols. Piconet Bluetooth 207

Architecture and services - Wireless Broadband networks and satellites

networks Wifi WiMAX
UNIT V

MOBILE NETWORK AND TRANSPORT LAYERS

Mobile IP DHCP Routing in Mobile adhoc networks - Proactive and

reactive routing protocols TCP improvements TCP over 2.5/3G.
TOTAL: 45 Periods
TEXTBOOKS:
1. Stefan Poslad, Ubiquitous Computing:
Environments and Interactions, Wiley, 2009.

Smart

Devices,

2. Brian Fling, Mobile Design and Development, OReily, 2009.

3. Jochen Schiller, Mobile Communications, 2nd ed., Pearson
Education, 2003
REFERENCE BOOKS:
1. Zigurd Mednieks, Laird Dornin, G, Blake Meike and Masumi
Nakamura Programming Android, OReilly, 2011.
2. Wei-Meng Lee, Beginning iPhone SDK Progrmming with
Objective-C, Wrox Wiley, 2010.
3. Asoke K Talukder, Hasan Ahmed, Roop R Yavagal, Mobile
Computing, second edition, Tata McGraw Hill, 2010.
4. Pei Zheng, Lionel M. Ni, Smart Phone & Next Generation Mobile
Computing, Morgan Kaufmann, 2006.
5. Jochen Burkhardt et al, Pervasive Computing: Technology and
Architecture of Mobile Internet Applications, Pearson Education,
2002.
WEB REFERENCES:
1. http://www.wiley.com/college/sc/trp/ch06.pdf
2. www.cse.iitk.ac.in/users/rkg/Talks/mobile_main.pdf
3. www.vicomsoft.com/learning-center/wireless-networking/
4. www.astm.org/Standards/E2213.htm
5. www.explainingcomputers.com/mobile.html

208

13IT703: CLOUD COMPUTING AND SERVICES

LTPC

(Common to CSE / IT)

3 0 03

Course Objectives:
To understand the concept of cloud and utility computing.
To understand the various issues in cloud computing.
To familiarize themselves with the types of virtualization.
To familiarize themselves with the lead players in cloud.
To appreciate the emergence of cloud as the next generation
computing paradigm.
Course Outcomes:
Recognize the architecture, challenges and reference models of
cloud computing.
Discuss on various virtual machine models and techniques.
Explore the various cloud programming and software environment.
Identify the use of high throughput and data intensive computing.
Explore the different Cloud Platforms and Application.
UNIT I

INTRODUCTION, PRINCIPLES AND

ARCHITECTURE

Cloud Computing : Vision, reference model, characteristics and

challenges historical development building cloud computing
environment computing platforms and Technologies Parallel Vs
distributed computing Elements of parallel and distributed computing
Technologies for distributed computing. Cloud Computing Architecture:
Cloud reference model - NIST Cloud Computing Reference Architecture
types of Clouds - economics open challenges.
UNIT II

VIRTUALIZATION

Characteristics of virtualized environments - Taxonomy of virtualization

techniques - Execution virtualization - Machine reference model Hardware-level virtualization Hypervisors - Hardware virtualization
techniques - Operating system-level virtualization - Programming

209

language-level virtualization - Application-level virtualization - Other

types - Virtualization and cloud computing - Pros and cons of
virtualization - Technology examples - Xen: Paravirtualization - VMware:
full virtualization - Full virtualization and binary translation - Microsoft
Hyper-V.
UNIT III

CLOUD INFRASTRUCTURE

Cloud Computing and Services Model Public, Private and Hybrid

Clouds Cloud Eco System - IaaS - PaaS SaaS. Architectural Design
of Compute and Storage Clouds Layered Cloud Architecture
Development Design Challenges - Inter Cloud Resource Management
Resource Provisioning and Platform Deployment Global Exchange
of Cloud Resources.
Case Study: Amazon Web Service reference, GoGrid, Rackspace.
UNIT IV

CLOUD PROGRAMMING
ENVIRONMENT

AND

SOFTWARE

11

Cloud capabilities and platform features data features and databases Parallel and Distributed Programming Paradigms MapReduce ,
Twister and Iterative MapReduce Hadoop Library from Apache
Dryad and DryadLINQ sawzall and Pig Latin - Mapping Applications Programming Support of Google App Engine - Amazon AWS
Microsoft Azure - Cloud Software Environments -Eucalyptus, Open
Nebula, OpenStack.
Case Study: Amazon Web Service reference, GoGrid, Rackspace.
UNIT V

CLOUD PLATFORMS AND APPLICATION

Amazon web services - Compute services - Storage services Communication services - Google AppEngine - Architecture and core
concepts Cloud Security and Trust management.
Application life cycle - Cost model Observations - Microsoft Azure SQL Azure Scientific Applications Business and Consumer
Application - Energy efficiency in clouds - Market-based management of
clouds - Federated clouds/InterCloud - Third-party cloud services.
TOTAL: 45 Periods

210

TEXTBOOKS:
1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, Distributed and
Cloud Computing, From Parallel Processing to the Internet of
Things, Morgan Kaufmann Publishers, 2012.
2. Rajkumar Buyya, Christian Vecchiola. S.Thamarai Selvi,
Mastering Cloud Computing, McGraw Hill Education, 2013.
REFERENCE BOOKS:
1. James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms
for Systems and Processes, Elsevier/Morgan Kaufmann, 2005.
2. George Reese, Cloud Application Architectures:
Applications and Infrastructure in the Cloud O'Reilly

Building

3. Ronald L. Krutz, Russell Dean Vines, Cloud Security A

comprehensive Guide to Secure Cloud Computing, Wiley India,
2010.
4. John W.Rittinghouse and James F.Ransome, Cloud Computing:
Implementation, Management, and Security, CRC Press, 2010.
WEB REFERENCES:
1. http://aws.amazon.com/
2. http://www.cloudbus.org/
3. http://www.ibm.com/cloud-computing/in/en/

13CS751: COMPUTER GRAPHICS AND MULTIMEDIA

LABORATORY

LTPC
0 03 2

Course Objectives:
To learn to experiment with the drawing and clipping algorithms
To learn to experiment the 2-D and 3-D transformations
To learn to implement the data compression algorithms
To learn to develop creativity using Animation Software
Course Outcomes:
Implement various graphics algorithms

211

 Implement colour conversion algorithms

Implement data and image compression algorithms
Design and develop basic animations using any animation software
SYLLABUS FOR THE LAB:
1. Implementation of Bresenhams Algorithm with attributes Line,
Circle, Ellipse.
2. Composite 2-D Transformations using Translation, Rotation,
Scaling, Shearing and Reflection
3. Cohen Sutherland 2-D line Clipping and Windowing
4. Sutherland Hodgeman Polygon Clipping Algorithm
5. Composite 3-D Transformations using translation, rotation and
scaling.
6. Generation of fractal images
7. Conversion between Colour models.
8. Implementation of text compression algorithms
9. Implementation of image compression algorithms
10. Animation using any animation software
TOTAL: 45 PERIODS
REFERENCE BOOKS:
1. Donald D. Hearn, M. Pauline Baker and Warren Carithers,
Computer Graphics with OpenGL, Fourth Edition, Pearson
Education, 2010.
2. F .S. Hill, Computer Graphics using OPENGL, Second edition,
Pearson Education 2003
WEB REFERENCES:
1. http://www.cs.cf.ac.uk/Dave/Multimedia/node200.html
2. http://www.prepressure.com/techno/compression1.htm
3. http://www.softpanorama.org/Algorithms/compression.shtml
4. http://www.nextwavemultimedia.com/

212

5. http://graphics.ethz.ch/teaching/viscomp11/downloads/part2_11_cl
ipping.pdf
List of Sample Exercises
1. Write a program to draw the following shape using line, circle and
ellipse drawing algorithm with different attributes.
2. Write a program to draw a pentagon and then do all the 2D
composite transformation on the pentagon.
3. Write a program to draw a star and clip that star using CohenSutherland line clipping algorithm
4. Write a program to draw any convex polygon and clip that convex
polygon using Sutherland Hodgeman Polygon clipping algorithm
5. Write an OpenGL program to draw a tea pot and apply composite
3D transformation on it.
6. Write an OpenGL program to draw Koch curve and dragon curve.
7. Write a program to implement color conversion models by
converting from (a) HSV to RGB
(b) RGB to CMY
8. Write a program to implement the Run length encoding
compression scheme.
9. Write a program to implement the JPEG compression scheme
10. Using Flash, create an animation to illustrate the action event.

13CS752: MOBILE APPLICATION DEVELOPMENT

LABORATORY

LTPC
0032

Course Objectives:
To apply the fundamentals of programming for mobile devices.
To model graphical user interfaces and apply event-driven
programming for mobile devices
To demonstrate mobile application development tools and APIs
Course Outcomes:
Evaluate the problem statement and select appropriate models for

213

development.
Select and evaluate suitable software tools and APIs for the
development of a particular mobile application and understand
their strengths, scope and limitations.
Use an appropriate application development tool to design,
develop and test small interactive programs for mobile devices.
LIST OF EXPERIMENTS
1. General form design
2. Mobile browser based interactive applications
3. Applications using controls
4. Mobile networking applications (SMS/Email)
5. Applications involving data retrieval
6. Launching services in a mobile phone
7. Web portal development
8. Applications using Android SDK framework (like interactive
applications, applications that make use of accelerometer sensor,
video applications)
9. Applications that use the iPhone SDK framework
10. Application using Windows Mobile OS
11. Testing the applications using emulators
12. Mini Project
TOTAL: 45 PERIODS
LABORATORY REQUIREMENTS
1. JDK environment
2. J2ME
3. Sun Java Wireless Toolkit
4. Android SDK
5. iPhone SDK

214

List of Sample Exercises

1. Course Registration Form development(Signup form)
2. Develop a MIDlet application for following kind of menu
cut
copy
paste
delete
selectall
3. a) Develop an application which will take the text as input from a
text field and display it in another text field or label (Use Swing).
b) Create a slideshow which has three slides which includes only
text. Program should change to the new slide after 5 seconds.
After the third slide program returns to the First Slide
4. Develop your own address book application which can take input
as name, phone number, email id and store in a file. This data
should be persistent, so that next time user can view this data
through same application
5. Creating a simple UDP based client-server application
6. Login to HTTP server from a J2ME program. This J2ME sample
program shows how to display a simple Login screen on the J2ME
phone and how to authenticate to a HTTP server.
Note: Use Apache Tomcat Server as web server and fetch the
required data value/information(J2ME application do authentication
to the backend server)
7. The following should be carried out with respect to the given set of
application domains:
a. Student Marks Enquiry
b. Students Admission system
c. Railway(PNR) Enquiry/Status
d. Public Exam Result Enquiry

215

8. Write an Android application program that accepts a name from

the user and displays the hello name to the user in response as
output using Eclipse
Change the text color for RGB (or) applications that make
use of accelerometer sensor(accelerometer API)
9. Iphone application
A. Write a program to display
threads(Simple Program)

digital

clock

using

B. Graphics apps in Android

a. Create an application where different shapes of
different colors are displayed.
b. Create an application to show a cyclist moving from
one direction to another
C. Animation apps like
a. Bouncing ball
b. Moving arrow, etc
10. Develop and test Game creation in android using iphone SDK
emulator like
a. Shooting bubbles
b. Shooting arrows
c. Simple snake game, etc.
11. Develop windows mobile OS application for Student course
registration details.

13CS753: INNOVATIVE APPLICATION PROJECT

(Internal Assessment Only)

LTPC
0021

Objective of the Innovative Application Project:

Select a domain of social interest and provide a solution in a
completed form
Inculcate the software engineering practices for effective learning

216

of industrial approaches
Guidelines:
Choosing a Project Topic
Enough amount of time should be dedicated for deciding the
topic. Current technical issues can be taken and addressed
using latest technologies or students can approach any faculty
member to guide them in choosing the topic (Refer to Sample
Projects given below)
Project Planning
The entire roadmap of the project (Chart like Gantt chart) is to
be prepared and submitted to the respective guide for
approval. The project plan should explain 4Ws+H, which
means What is going to be done, When it is going to be done,
Who is going to do it, Where this is going to be done, and How
it is going to be done.
Requirement Elicitation and Analysis
The requirement needs to be collected from the users of
domain. Careful gathering of requirements needs to
performed and they need to be prioritized and listed. Also,
use case diagram needs to be drawn to model
requirement scenarios.

the
be
the
the

Design
The project modules need to be identified and architecture
diagram should be drawn to show the dependency between
the modules. The detailed function specification has to be
written for each function inside the modules.
Implementation
The implementation has to be done using the preferred
language and tools. It has to be in par with the design and
should never get deviated from the design.

217

 Testing
Test cases need to be listed out for all functionalities of the
project and the procedure for carrying out the test needs to be
documented. The testing has to be conducted as per the test
procedures and the results should be recorded.
Project Review and Final Presentation
At least three intermediate project reviews will be conducted
from the department and the project proceedings will be
assessed. The comments given in the review should be
incorporated into the project within time as per the project
plan.
The Final presentation / demonstration will be conducted from
the department to assess the overall performance of the
project team / individual and the completion of the project.
Report Preparation
The template for the project report will be provided by the cocoordinator and it needs to be completed as per the
guidelines. The report need to get assessed from both the
project guide and the Head of the Department
Any assumptions made should be clearly indicated
Sample Projects:
1. Barcode Scanner Mobile Application
This mobile/ tablet application needs to scan barcodes on
products then look up prices and reviews. The application may
also need to scan Data Matrix and QR Codes containing
URLs, contact info, etc.
2. Sudoku game Mobile Application
This mobile/ tablet application needs to implement the Sudoku
game which needs to be better than all other available Sudoku
app. The game algorithms need to be implemented in an
effective way to minimize the RAM usage.

218

3. File Splitter and Merger Desktop Application

This desktop application is used to split any type of large file
into smaller size which is easy for mailing them over Internet.
Also the application should merge all the small files into one
which can be used in future.
4. ATM Simulator Desktop Application
This desktop application should simulate the complete ATM
machine. This simulator can be used in the banks for testing
the ATM transactions. Actions like card entry and cash
dispensing are to be animated to provide a realistic user
interface.
5. Pharmacy Management System Web Application
This web application should automate all the manual data entry
work in pharmacy. The stock inventory maintenance,
purchase, sales modules needs to be incorporated in this
project. The report generation module can query, consolidate
and present the user required information from the data stored.

13HS801: PRINCIPLES OF MANAGEMENT AND

ENGINEERING ECONOMICS

LTPC
3003

Course Objectives:
To outline the historical evolution of management theories.
To describe the relationship between management and society
To highlight the four management functions of planning,
organizing, leading, and controlling.
To provide students with fundamental concepts of engineering
economics.
To expose students to costs involved in production, demand and
supply in business

219

Course Outcomes:
Enumerate the historical evolution of management thought.
Identify the internal and external factors and forces of the
organisation that managers must confront in their daily work.
Bring out the functions of management: such as planning,
organising, leading, controlling, and decision making.
Use the basic concepts and terminology in economics.
Comprehend the factors of production, different costs in business
and pricing methods.
UNIT I

MANAGEMENT AND SOCIETY

Management: Nature and purpose Managing as arts and science

Evolution of management thought Functions of manager
Organisational hierarchy and skills of managers External environment
Social responsibility and ethics.
UNIT II PLANNING, ORGANISING AND STAFFING

Planning: Steps in planning - Management By objectives - Decision

making. Organising: Process, Types of departmentation - Line authority Staff authority - Functional authority - Centralisation and
decentralisation. Staffing: Process - Factors affecting staffing.
UNIT III

LEADING AND CONTROLLING

Leading: McGregors theory X and theory Y model and Maslows

hierarchy theory of Motivation - Styles of leadership - Communication
flow in organisation - Controlling: Steps in control process, Controlling
techniques (Basics) Budgeting - Gantt charts PERT - Balanced
Score card.
UNIT IV INTRODUCTION TO ECONOMICS I

Definition - Scope and nature of economics - Micro economics: Demand

- Types of demand - Determinants of demand - Law of demand Demand function - Elasticity of demand - Market equilibrium - Production
function - Types of costs - Economic costs: Fixed cost and variable costs
- Direct and indirect costs - Average and marginal costs - Implicit cost -

220

Opportunity cost - Pricing Methods - Break even analysis.

UNIT V INTRODUCTION TO ECONOMICS II

Capital budgeting: Meaning - Techniques Payback period method Accounting rate of return - Net present value - Internal rate of return Profitability index - Macroeconomics : Meaning and scope - National
income Definition and components - Methods of measuring national
income - Inflation - Meaning and types - Deflation - Business cycle Unemployment.
TOTAL: 45 Periods
TEXTBOOKS:
1. Mithal GK & Mittal R, Engineering Economics and Management,
GK Publishers, Jabalpur
2. Dr. Rajan Mishra, Industrial Economics and Management
Principles, Laxmi Publications Pvt Ltd
REFERENCE BOOKS:
1. Harold Koontz, Heinz Weihrich, Essentials of Management: An
International and Leadership Perspective, ninth edition, Tata
McGraw Hill.
2. O.P Khanna, Industrial Engineering and Management, Dhanpat
Rai Publications.
3. Chan S. Park , Fundamentals of Engineering Economics,
Prentice Hall
WEB REFERENCES:
1. http://www.finmin.nic.in
2. planningcommission.nic.in
3. www.rbi.org.in
4. http://ocw.mit.edu/courses/economics

221

13CS801: PARALLEL PROGRAMMING

LTPC
3003

Course Objectives:
To explain models of and issues in concurrency in computing
To introduce message-passing parallel programs using MPI
To elaborate shared-memory parallel programs using Pthreads
To explain shared-memory parallel programs using OpenMP
To familiarize with parallel programming using MPI, Pthreads and
OpenMp.
Course Outcomes:
Realize hardware level support for concurrency
Identify issues in parallel programming
Develop message-passing parallel programs using MPI framework
Develop shared-memory parallel programs using Pthreads
Develop shared-memory parallel programs using OpenMP
UNIT I

PARALLEL HARDWARE
SOFTWARE

AND

PARALLEL

Need for parallel systems and parallel programs - The von Neumann
architecture - Modifications to the von Neumann Model - Parallel
Hardware - Parallel Software - Input and Output - Performance - Parallel
Program Design - Writing and Running Parallel Programs
UNIT II

DISTRIBUTED MEMORY PROGRAMMING WITH

MPI

Basic MPI programming MPI_Init and MPI_Finalize MPI

communicators SPMD programs message passing MPI_Send and
MPI_Recv message matching MPI I/O parallel I/O collective
communication MPI_Reduce MPI_Allreduce broadcast scatter
gather allgather derived types Performance Evaluation of MPI
programs.

222

UNIT III

SHARED
Pthreads

MEMORY

PROGRAMMING

WITH

Basics of threads thread synchronization critical sections busywaiting mutexes semaphores barriers and condition variables
read-write locks Caches, cache coherence and false sharing thread
safety Pthreads case study
UNIT IV

SHARED
OpenMP

MEMORY

PROGRAMMING

WITH

Basic OpenMP constructs scope of variables reduction clause

parallel for directive loops in OpenMP scheduling loops Producers
and Consumers- atomic and critical directives- cache issues thread
safety in OpenMP.
UNIT V

PARALLEL PROGRAM DEVELOPMENT

Parallel odd-even transposition sort-Two n-Body Solvers- Parallelizing

the n-body solvers- Parallelizing the basic and reduced solver using
OpenMP- Parallelizing the solvers using pthreads- Parallelizing the basic
and reduced solver using MPI. Recursive and no recursive depth first
search - Parallelizing tree search-static and dynamic parallelization of
tree search using Pthreads-Parallelizing the tree-search programs using
OpenMP-Implementation of tree search using MPI.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Peter S. Pacheco, An introduction to parallel programming,
Morgan Kaufmann, 2011.
REFERENCE BOOKS:
1. M. J. Quinn, Parallel programming in C with MPI and OpenMP,
Tata McGraw Hill, 2003.
2. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar,
Introduction to Parallel Computing, Pearson, 2003
3. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable parallel
programming with the message passing interface, Second
Edition, MIT Press, 1999.
223

4. B. Chapman, G. Jost, and Ruud van der Pas, Using OpenMP,

MIT Press, 2008.
5. D. R. Butenhof, Programming with POSIX Threads, Addison
Wesley, 1997.
WEB REFERENCES:
1. https://computing.llnl.gov/tutorials/parallel_comp/
2. http://www-users.cs.umn.edu/~karypis/parbook/
3. http://www.cs.nmsu.edu/~jcook/Tools/pthreads/pthreads.html
4. http://openmp.org/wp/
5. www.nptel.ac.in

ELECTIVE I (Electives for VI Semester)

13MA902: COMBINATORICS AND GRAPH
THEORY

L T P C
3 0 0 3

Course Objectives:
To introduce topics and techniques of combinatorics methods.
To learn the basics of combinatorics: enumeration, recurrence,
generating Functions
Understanding the elements of Graph Theory.
To introduce the students about graphs, their properties and their
applications as models of networks.
To solve theoretical problems and apply them in algorithms based
on graph structures.
Course Outcomes:
Able to know the permutations and combinations for all possible
results in an experiment.
Able to use generating functions to solve a variety of combinatorial
problems.
Able to formulate problems in terms of graphs.

224

 Have knowledge of the graph theoretic concepts needed for some

algorithms.
Solve graph theoretic problems and apply algorithms taught in the
course.
UNIT I

COMBINATORICS

The pigeon-hole principle - Basic counting problems- The binomial

coefficients (the binomial theorem, algebraic vs. combinatorial proof,
Pascals identity, Pascals triangle, Catalan numbers) - the principle of
inclusion and exclusion.
UNIT II

RECURRENCES

Fibonacci numbers - The substitution method- Linear recurrences

(mostly
homogenous
recurrences,
the
characteristic
polynomial/equation)- Generating functions-(Catalan numbers revisited,
divisions of a number
UNIT III

INTRODUCTION TO GRAPH THEORY

Definition - examples subgraphs complements and graph

isomorphism Euler trail and circuits planar graphs Hamilton paths
and cycles.
UNIT IV

TREES

Definition rooted trees trees and sorting weighted trees and prefix
codes bi connected components and Articulation points.
UNIT V

OPTIMIZATION AND MATCHING

Dijkstras shortest path algorithm Kruskal and Prim algorithms MaxFlow Min-cut theorem Matching theory.
TOTAL: 45 PERIODS
TEXTBOOK:
1. Ralph P. Grimaldi, Discrete and combinatorial mathematics: An
applied introduction, Pearson, 4thEdition, 2005.
REFERENCE BOOKS:
1. Douglas B. West, Introduction to Graph Theory, Prentice-Hall of

225

India, 2nd Edition, 2012.

2. Narsingh Deo, Graph Theory with applications to Engineering and
Computer Science, Prentice-Hall of India, New Delhi, Reprint,
2011.
3. John Clark, Derek Allan Holton, A first look at Graph Theory,
world Scientific publishing company incorporated, Reprint, 1991.
4. Alan Tucker, Applied Combinatorics, John wiley and sons, 6th
edition, 2012.

13CS902: COMPUTATIONAL INTELLIGENCE

LTPC
3003

Course Objectives:
To learn the concepts of artificial intelligence
To study problem solving techniques
To understand the representation of knowledge and reasoning
mechanism
To learn to construct plans of actions
To study network models used for reasoning in uncertainty
To know how to learn from samples of data
Course Outcomes:
Formulate a problem and find the solution using searching
techniques
Use the knowledge and the process of inference to derive new
representations
Represent planning problems and find the sequence actions to
achieve goals
Build network models to reason under uncertainty
Design and apply learning models

226

UNIT I

INTRODUCTION

Introduction - Intelligent agents - Problem Solving : Solving problems by

searching - problem solving agents - searching for solutions - Uninformed
search strategies - Informed search strategies - Heuristic functions
UNIT II

KNOWLEDGE AND REASONING

Logic Agent : Knowledge based agent - Wumpus world - Logic Propositional logic - Syntax and Semantic of FOL - Using FOL Knowledge engineering in FOL - Propositional vs First order inference Unification and Lifting - Forward chaining - Backward chaining - Resolution
UNIT III

PLANNING

Classical Planning : Definitions - Examples - Algorithms for Planning as

state space search - Planning graphs - Planning and acting in the real
world : Time, Schedule and Resources - Hierarchical planning - Planning
and acting in Non deterministic domain
UNIT IV

UNCERTAIN KNOWLEDGE AND REASONING

Quantifying uncertainty - Acting under uncertainty - Basic probability

notation - Inference using full joint distribution - Probabilistic Reasoning Semantics of Bayesian networks - Bayesian nets with continuous variable
- Exact inference in Bayesian networks
UNIT V

LEARNING

Forms of learning - Supervised learning - Learning decision trees Artificial neural networks - Support vector machine
TOTAL: 45 Periods

TEXTBOOKS:
1. Stuart Russell, Peter Norvig, " Artificial Intelligence: A Modern
Approach", Third edition, Pearson education, 2013
REFERENCE BOOKS:
1. John Fulcher, L C Jain, Computational Intelligence : A
Compendium, Studies in
Computational Intelligence, Vol.115,
Springer,2008

227

2. Russell C Eberhart and Yuhui Shi, Computational Intelligence:

Concepts to Implementations, Morgan Kauffman,2007
WEB REFERENCES:
1. http://www.formal.stanford.edu/jmc/whatisai/
2. http://www.sciencedaily.com/news/computers_math/artificial_intellig
ence/

13CS903: SYSTEM MODELING AND SIMULATION

LTPC
3003

Course Objectives:
To study the need for simulation
To learn to model a real world system
To understand the structure of data at different stages of a system
To study how to verify and validate the components of the system
To learn to deploy the simulation tools
Course Outcomes:
Select a simulation model
Analyze the behavior of the system using various models
Characterize and formulate the data applicable for the system
simulation
Verify and Validate the behavior of the system
Deploy the simulation tools in real world problems
UNIT I

INTRODUCTION TO SIMULATION

Introduction Simulation terminologies - Application areas Model

classification - Types of Simulation - Steps in a simulation study Concepts in discrete event simulation example.
UNIT II

MATHEMATICAL AND STATISTICAL MODELS

Statistical models - Concepts Discrete distributions - Continuous

distributions Poisson process - Empirical distributions - Queueing

228

models Characteristics - Notation Queueing Systems Markovian

Models - Properties of random numbers - Generation of pseudo random
numbers - Techniques for generating random numbers - Testing random
number generators - Generating random variates - Inverse transform
technique acceptance - Rejection technique Composition and
convolution method.
UNIT III

ANALYSIS OF SIMULATION DATA

Input modeling - Data collection - Assessing sample independence

Hypothesizing distribution family with data - Parameter estimation
Goodness of fit tests Selecting input models in absence of data
Output analysis for a Single system Terminating simulations
Steady state simulation.

UNIT IV

VERIFICATION AND VALIDATION

Model Building Verification of simulation models Calibration and

validation of models Validation of model assumptions Validating input Output transformations.
UNIT V

SIMULATION OF COMPUTER SYSTEMS AND

CASE STUDIES

Simulation tools Model input High level computer system simulation

CPU Memory simulation Comparison of systems via simulation
Simulation programming techniques - Development of simulation models.
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Jerry Banks, John S. Carson, Barry L. Nelson and David M. Nicol,
Discrete Event System Simulation, Fourth Edition, Pearson
Education, 2005.
2. Geoffrey Gordon, System Simulation, Second Edition, PHI, 2006.
REFERENCE BOOKS:
1. Frank L. Severance, System Modeling and Simulation, Wiley,
2001.
2. Averill M. Law and W.David Kelton, Simulation Modeling and

229

Analysis, Third Edition, McGraw Hill, 2006.

3. Jerry Banks, Handbook of Simulation: Principles, Methodology,
Advances, Applications and Practice, Wiley - Interscience, 1st
edition, 1998.
WEB REFERENCES:
1. https://cs.wmich.edu/~alfuqaha/Spring10/cs6910/lectures/Chapter1.
pdf
2. http://water.epa.gov/scitech/datait/tools/warsss/validate.cfm
3. http://www.cs.bilkent.edu.tr/~cagatay/cs503/_M&S_06_Comparing_
Systems_via_Sim.pdf
4. http://www.stanford.edu/class/msande223/handouts/lecturenotes10.
pdf

13CS904: PRINCIPLES OF DISTRIBUTED SYSTEMS

LTPC
3003

Course Objectives:
To study various models of distributed systems and understand
how communication among distributed systems is made.
To learn about the architecture and issues of distributed file
systems
To understand about logical clocks and recording global state.
To study how mutual exclusion is achieved in a distributed system
To study about distributed
concurrency control

transaction

management

and

To understand how security and fault tolerance are enforced in a

distributed system
Course Outcomes:
Analyse the various architecture and fundamental models of
distributed systems
Order events in a distributed system using logical clocks.

230

 Compare the various distributed mutual exclusion algorithms

Find out the issues in distributed transaction management
Compare the working of various concurrency control algorithms.
Analyse the various security mechanisms used in a distributed
system
Explore the need for fault tolerance.
UNIT I

INTRODUCTION

Introduction to distributed systems - Challenges - Architectural models Fundamental models - P2P systems - Introduction to inter process
communications - External data representation and marshalling - Client
server communication - Group communication Multicast - Energy
Efficient Computing - Cloud computing

UNIT II

DISTRIBUTED OBJECTS AND FILE SYSTEM

Introduction - Communication between distributed objects - Remote

procedure call - Events and notifications - Java RMI case study Introduction to DFS - File service architecture Google file system Introduction to name services - Name services and DNS - Directory and
directory services - Cluster computing - Map reduce/big table.
UNIT III

DISTRIBUTED OPERATING SYSTEM

The operating system layer Protection - Process and threads Communication and invocation - Operating system architecture Introduction to time and global states - Clocks, Events and Process
states - Synchronizing physical clocks - Logical time and logical clocks Global states - Distributed mutual exclusion - Overlay Networks
Distributed Hash Table.
UNIT IV

DISTRIBUTED TRANSACTIONS

MANAGEMENT
Transactions Nested transaction Locks - Optimistic concurrency control
- Timestamp ordering - Comparison of methods for concurrency control
- Introduction to distributed transactions - Flat and nested distributed

231

transactions - Atomic commit protocols - Concurrency control in

distributed transactions - Distributed deadlocks - Transaction recovery
Data Intensive Computing and Map Reduce
UNIT V

SECURITY AND FAULT TOLERANCE

Overview of security techniques - Cryptographic algorithms Digital

signatures - Cryptography pragmatics Distributed Replication Content Delivery Networks and replication.
TOTAL: 45 Periods
TEXTBOOKS:
1. Coulouris, G, Dollimore, J., and Kindberg, Distributed Systems:
Concepts and Design, 5th edition, Addison-Wesley, 2011.
REFERENCE BOOKS:
1. Tanenbaum, A. and van Steen, M., Distributed Systems:
Principles and Paradigms, second edition, Prentice Hall, 2007.
2. Mukesh Singhal, Ohio State University, Columbus, Advanced
Concepts in Operating Systems, McGraw-Hill Series in Computer
Science, 1994.
3. Kenneth P. Birman, Reliable Distributed Systems: Technologies,
Web Services, and Applications, Springer, 2005
4. Haggit
Attiya,
Distributed
Computing:
Fundamentals,
Simulations, 2nd Edition John Wiley and sons, New York 2005.
WEB REFERENCES:
1. http://lass.cs.umass.edu/~shenoy/courses/spring05/lectures/Lec10.
pdf
2. http://docs.oracle.com/cd/E11882_01/server.112/e25494/ds_txnma
n.htm
3. http://www.cs.rutgers.edu/~pxk/rutgers/notes/content/05-dfs.pdf
4. http://www.csee.umbc.edu/~kalpakis/courses/621fa03/Lectures/FaultTolerance.pdf
5. www.nptel.ac.in

232

13CS905: DATABASE TUNING

LTPC
3003

Course Objectives:
To learn the fundamentals of database tuning
To study the indexing mechanisms for organizing data
To understand the significance of Query Optimization
To learn to troubleshoot database issues
To understand the need for time series and distributed databases
Course Outcomes:
Analyze different execution plans for queries
Design an indexing mechanism to make effective retrieval from
database
Create an execution plan for a query to reduce the execution time
Optimize the retrieval in query processing
Analyze the query response using data dictionaries
Work with time series and distributed databases
UNIT I

FUNDAMENTALS OF TUNING

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
UNIT II

INDEX TUNING

Types of queries Data structures B tree B+ Tree - Hash structures

Bit map indexes Clustering indexes Non clustering indexes
Composite indexes Hot tables Comparison of indexing and hashing
techniques
UNIT III

QUERY OPTIMIZATION

10

Techniques - Tuning relational systems Normalization Tuning

denormalization Clustering two tables Aggregate maintenance
233

Record layout Query tuning Triggers Client server mechanisms

Objects, application tools and performance Tuning the application
interface Bulk loading data Accessing multiple databases
UNIT IV TROUBLESHOOTING

10

Query plan explainers Performance monitors Event monitors

Finding Suspicious queries Analyzing a querys access plan
Profiling a query execution DBMS subsystems
UNIT V

CASE STUDIES

Transaction chopping Time series databases Understanding access

plans Configuration parameters: Oracle; SQL Server; DB2 UDB
Distributed database - Implementation
TOTAL: 45 Periods
TEXTBOOKS:
1. Dennis Shasha and Philippe Bonnet Database Tuning,
Principles, Experiments, and Troubleshooting Techniques,
Elsevier Reprint 2005.
REFERENCE BOOKS:
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.
3. Ramez Elmasri and Navathe, Fundamentals of Database
Systems, Sixth Edition, Addison Wesley
WEB REFERENCES:
1. http://www.youtube.com/watch?v=dH_bPLtdbc4.
2. www.cs.nyu.edu/courses/fall08/G22.2434-001/dbtune.ppt
3. moosehead.cis.umassd.edu/cis552/slides/Tuning.ppt
4. www.itu.dk/people/phbo/Tuning/Slides/IndexTuning.pptx
5. codex.cs.yale.edu/avi/db-book/db4/slide-dir/ch14.ppt

234

13CS906: E-LEARNING TECHNIQUES

LTPC
3003

Course Objectives:
To explore the basics and goals of E-Learning
To understand E-Learning strategies
To understand the principles of E-Learning and its applications
To introduce various design techniques of E-Learning
To discuss the methods of implementing E-Learning contents
Course Outcomes:
Bring out the features of E-Learning
Establish the E-Learning
appropriate strategies

in

various

domains

by following

Apply the principles of E-Learning

Design E-Learning solutions using various techniques
Implement the E-Learning solutions according to the needs.
UNIT I

INTRODUCTION

E-Learning cycle - E-Learning types - Challenges and opportunities

Cognitive presence Approaches to design E-Learning - E-Learning
framework - 6C framework - E-Learning Tools
UNIT II

E-LEARNING STRATEGY

Role of tutor - E-Learning strategy - Blended E-Learning M-Learning Problem based learning Enterprise learning - Corporate Learning - Web
based Learning - Pod casting - Learning Management systems
Content development process E-Learning standards - SCORM
standard - Managing E-learning quality - Case studies
UNIT III

PRINCIPLES OF E-LEARNING

Philosophy of E-Learning Theory of learning Applying principles of

multimedia - Applying principles of contiguity - Applying principles of
modality - Applying principles of redundancy - Applying principles of
coherency - Applying principles of personalization - Web based learning

235

communities - Knowledge sharing and knowledge management in Elearning - Social networks and social media in E-learning
UNIT IV

DESIGN

Online E-Learning technologies Visual communication techniques Computer based technologies - Computer Mediated Communication
(CMC) - Assessment and evaluation - Organizing and designing
learning sequences - Characteristics of Interactive online learning
media
UNIT V

IMPLEMENTATION

Leverages example in E-Learning Collaborative E-Learning Learner control in E-Learning guidelines to solve issues in E-Learning
Implementation of an E-Learning Course Content for a complete online
course - Research in content retrieval and generation for E-Learning Role of cloud and semantic Grid in E-Learning
TOTAL: 45 Periods
TEXTBOOKS:
1. D.Randy Garrison, E-Learning in the 21st century a framework for
research and practice, 2nd edition, Taylor and Francis, 2011.
2. Robin Mason, E-Learning: the key concepts, Routledge, 2007.
3. William Horton, E-Learning by Design, Pfeiffer Wiley, 2006.
REFERENCE BOOKS:
1. John Gardner, Bryn Holems, E-Learning : Concepts and practice,
SAGE Publications, 2006
2. R. C. Clark, R. E. Mayer, E-Learning and the science of
instruction, Pfeiffer Wiley, 2011
3. Mark J Rosenberg, E-Learning: strategies for delivering knowledge
in the Digital Age, McGraw- Hill, 2001
4. Kjell E. (Erik) Rudestam, Judith Schoenholtz-Read, Handbook of
Online Learning, Sage Publications Inc., Second Edition, 2009
WEB REFERENCES:
1. http://www.talentlms.com/elearning/technologies_used_in_elearning

236

2. http://www.talentlms.com/elearning/
3. http://hippocampus.org
4. http://www.youtube.com/user/eLearnerEngaged
5. http://www.articulate.com/rapid-elearning/instructional-design/

13CS907: NETWORK ANALYSIS AND

MANAGEMENT

LTPC
3003

Course Objectives:
To learn network analysis and flow analysis with a network tool.
To understand the design issues and architecture to meet the
network communication requirements.
To understand how network management technology works to
manage todays systems.
To study about the network management organization
To understand the effectiveness of management assessment
Course Outcomes:
Do requirement analysis for network design
Address the routing and security issues in networks.
Work with management lifecycle and management reference
models.
Design common management protocols
Assess the impact of management and its effectiveness
UNIT I

INTRODUCTION

Introduction Requirement analysis concepts Requirement

analysis process Flow analysis
UNIT II

ARCHITECTURE

Network architecture Addressing and routing architecture

Performance architecture Security and privacy architecture
Network analysis tool

237

UNIT III

NETWORK MANAGEMENT

Network management overview - Management perspective:

Dimensions of the management: Management interoperability Management life cycle - Management layers Management functions
and reference models
UNIT IV NETWORK MANAGEMENT ORGANIZATION

Management information Management communication patterns:

Rules of conversation - Common management protocols
Management organization
UNIT V

MANAGEMENT INTEGRATION

Applied network management: Management integration Service

level management Management metrics: Assessing management
impact and effectiveness Case Study: NMS, Organization Network
TOTAL: 45 Periods
TEXTBOOKS:
1. James D.McCabe, Network Analysis,
Design, 3rd Edition, Elsevier, 2007.

Architecture

and

2. Alexander Clemm, Network Management Fundamentals,

first Edition, Cisco Press, 2006
REFERENCE BOOKS:
1. Larry Walsh, SNMP MIB Handbook, 2008.
2. Laura Chappell and Gerals combs, Wireshark Network
Analysis, 1st Edition, 2010.
3. William Stallings, SNMP, SNMPV2, SNMPV3, AND RMON
1&2, 3rd Edition, 1999
WEB REFERENCES:
1. http://www.slac.stanford.edu/xorg/nmtf/nmtf-tools.html
2. http://www.ils.indiana.edu/faculty/hekbia/web/other/Ekbia_Manag
ingNetworkOrgs.pdf
3. http://www.change-management.com/tutorial-integrating-cmpm.html
238

ELECTIVE II (Electives for VII Semester)

13CS908: HUMAN COMPUTER INTERACTION
(Common to CSE / IT)

LTPC
3003

Course Objectives:
To understand the design principles of Human Computer
Interaction.
To study the effectiveness of interacting with computers.
To learn the various models that can be used for designing
systems.
To understand the importance of design techniques.
To learn to design dialog for representation.
Course Outcomes:
Design the Human Computer Interaction(HCI) process
Evaluate the performance of interactive systems
Identify the appropriate design model for HCI
Analyze and test the HCI models
Postulate appropriate HCI dialog techniques
UNIT I

DESIGN PROCESS

Humans Information process Computer Information process

Differences and similarities between them Need for interaction
Models Ergonomics Style Context Paradigms Designing of
interactive systems Usability Paradigm shift Interaction design
basics Design process Scenarios Users need Complexity of
design
UNIT II

DESIGN
AND
EVALUATION
INTERACTIVE SYSTEMS

OF

Software process Software lifecycle - Usability engineering Issue

based information systems Iterative design and prototyping practices
Design rules Maximum usability Principles Standards and
239

guidelines - Design patterns Programming tools Windowing systems

Interaction tool kit User interface management system Evaluation
techniques Evaluation design Evaluating implementations
Observational methods
UNIT III

MODELS

Universal design principles Multimodal systems User support

Presentation and implementation issues Types Requirements
Approaches Cognitive model Hierarchical model Linguistic model
Physical and device models Socio technical models Communication
and collaboration models Task models Task analysis and design Z
model
UNIT IV

EXPERIMENTAL
DESIGN
STATISTICAL ANALYSIS OF HCI

AND

Basic Design structure Single independent variable Multiple

independent variable Factorial design Split plot design Random
errors Experimental procedure Statistical analysis Preparing data
for statistical analysis Descriptive statistics - T tests Analysis of
variance test Regression Chi Square test Survey Probabilistic
sampling Non probabilistic sampling Developing survey questions
UNIT V

THEORIES

Dialogue notations and design Dialogue need dialogue design

notations Graphical, Textual
representing dialogue Formal
descriptions Dialogue analysis System models - Interaction models Relationship with dialogue Formalisms Formal notations Interstitial
behaviour Virtual reality Modeling rich interaction Status event
analysis Properties Rich contexts Sensor based systems
Groupware Applications Ubiquitous computing -Virtual reality
Information and data visualization
TOTAL: 45 PERIODS
TEXTBOOKS:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, Human
Computer Interaction, 3rd Edition Prentice Hall, 2004.

240

2. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, Research

Methods in Human- Computer Interaction, Wiley, 2010(Unit-IV).
REFERENCE BOOKS:
1. Ben Shneiderman and Catherine Plaisant Designing the User
Interface: Strategies for Effective
Human-Computer
Interaction (5th Edition, pp. 672, ISBN 0-321-53735-1, March
2009), Reading, MA: Addison-Wesley Publishing Co.
2. Julie A. Jacko (Ed), The Human-Computer
Handbook, third edition, CRC Press, 2012

Interaction

WEB REFERENCES:
1. http://www.cs.man.ac.uk/~seanb/teaching/COMP10092/COMP100
92-HCI.pdf
2. http://www.cse.chalmers.se/edu/year/2009/course/TDA143/Lecture
s/HCI_artikel.pdf
3. http://www.alandix.com/academic
4. http://www.cas.kth.se/ras-ifrr-ss04/material/rogers-hci-intro.pdf
5. www.hcibib.org

13CS909: GREEN COMPUTING

LTPC
3003

Course Objectives:
To study about green IT fundamentals and strategies
To understand green business process management and green
enterprise architecture
To study the structure of green grid framework
To understand socio-cultural aspects of green IT
To recognize environmentally responsible business strategies
Course Outcomes:
Realize the impact of green computing in IT

241

 Identify green assets and model them

Analyze the green grid framework.
Work with green compliance and standards
Work with green business management tools
UNIT I

FUNDAMENTALS

Green IT fundamentals: Business, IT, and the environment Green

computing: Carbon foot print - scoop on power Green IT strategies:
Drivers, Dimensions, and Goals Environmentally responsible
business: Policies, Practices and Metrics.
UNIT II

GREEN ASSETS AND MODELING

Green Assets: Buildings, data centers, networks and devices Green

business process management: Modeling, optimization and
collaboration Green enterprise architecture Environmental
intelligence Green supply chains Green information systems:
Design and development models.
UNIT III

GRID FRAMEWORK

Virtualizing of IT systems Role of electric utilities, telecommuting,

teleconferencing and teleporting Materials recycling Best ways for
green PC Green data center Green grid framework
UNIT IV

GREEN COMPLIANCE

Socio-cultural aspects of green IT Green enterprise transformation

roadmap Green Compliance: protocols, standards and audits
Emergent carbon issues: technologies and future.
UNIT V

CASE STUDIES

The Environmentally Responsible Business Strategies (ERBS) Case

study scenarios for trial runs Case studies Applying green IT
strategies and applications to a home, hospital, packaging industry and
telecom sector.
TOTAL: 45 PERIODS

242

TEXTBOOKS:
1. Bhuvan Unhelkar, Green IT Strategies and ApplicationsUsing Environmental Intelligence, CRC Press, June 2011
2. Woody Leonhard, Katherrine Murray, Green Home computing
for dummies, August 2009.
REFERENCE BOOKS:
1. Alin Gales, Michael Schaefer, Mike Ebbers, Green Data Center:
steps for the Journey, Shoff/IBM rebook, 2011.
2. John Lamb, The Greening of IT, Pearson Education, 2009.
3. Jason Harris, Green Computing and Green IT- Best Practices on
regulations & industry, Lulu.com, 2008.
4. Carl speshocky, Empowering Green Initiatives with IT, John
Wiley & Sons, 2010.
5. Wu Chun Feng (editor), Green computing: Large Scale energy
efficiency, CRC Press, 2012.
WEB REFERENCES:
1. http://www.studyhelpline.net/hot_it_topics/green_computing/
2. http://shodhganga.inflibnet.ac.in/bitstream
3. www.citi.umass.edu/ghpc/GHPCC-green-computing-v3.pdf
4. www.green-compute.com

13CS910: BIO INFORMATICS TECHNOLOGIES

LTPC
3003

Course Objectives:
To understand basic concepts of molecular biology and genetics
To study about different biological databases
To understand the different techniques for sequence data analysis
To study about the evolutionary relationships using phylogenetic
trees

243

 To understand computer as a tool for biomedical research and

important functional relationships from gene data.
Course Outcomes:
Apply machine learning techniques in molecular biology
Work with different types of biological databases
Analyze various techniques for sequence data processing
Use phylogenetic trees for evolutionary relationships
Apply computational techniques for molecular structure analysis
UNIT I

INTRODUCTION TO BASICS OF BIOLOGY

Introduction to molecular biology The genetic material Central

dogma of life Nucleic acids-Gene structure Genomic information
RNA and its structure - Protein structure basics Amino acids
Polypeptide composition Protein primary, secondary and tertiary
structure Machine learning introduction.
UNIT II

DATABASES

Molecular databases introduction - Protein and Nucleotide databases Different kinds of databases Extracting sequences from databases
Searching for sequences using BLAST family of algorithms and FASTA
algorithm Applications.
UNIT III

SEQUENCE DATA ANALYSIS

Simple alignments Gaps Scoring matrices Dynamic programming

Global and local alignments algorithms Multiple sequence
alignments - Motif representation Motif finding algorithms Tools used
for alignments and motif detection - Genomics Prokaryotic and
eukaryotic genomes: Gene structure prediction Gene expression
analysis Microarrays.
UNIT IV

PHYLOGENETICS

Phylogenetics History and advantages Phylogenetic trees

Evolutionary rates Molecular clocks Evolution in organelles
Distance matrix methods UPGMA and neighbor joining methods
Maximum likelihood approaches ParsimonyTree validation

244

Constructing consensus trees using Bootstrapping techniques

Comparison of phylogenetic methodsPhylogenetic tree construction
tools.
UNIT V

COMPUTATIONAL PREDICTIONS OF

MOLECULAR STRUCTURES
Protein secondary structure, tertiary and quaternary structure prediction
Algorithms for modeling protein folding Predicting RNA secondary
structures - Inhibitors and drug design system biology introduction and
its applications in whole cell modeling - Protein visualization tools.
TOTAL: 45 Periods
TEXTBOOKS:
1. David W Mount, Bioinformatics: Sequence and Genome Analysis,
Second Edition, Cold Spring Harbor Laboratory Press, 2004.
REFERENCE BOOKS:
1. P.C Turner, A.G. McLennan, A.D Bates and M.R.H White Instant
notes in Molecular Biology , Second Edition, Springer-Verlag,
2000
2. Yi-Ping Phoebe Chen (Ed), Bioinformatics Technologies, First
Indian Reprint, Springer Verlag, 2007.
3. Arthur M. Lesk, Introduction to Bioinformatics, Second Edition,
Oxford University Press, 2010.
4. Vittal R. Srinivas, Bioinformatics A Modern Approach, PrenticeHall of India Pvt. Ltd., 2005.
5. Baldi P., Brunak S., Bioinformatics: The machine Learning
Approach, second edition, East West Press, 2003
6. T. K. Attwood, D. J. Parry-Smith, and S. Phukan, Introduction to
Bioinformatics, Pearson Education, 1999.
WEB REFERENCES:
1. http://freevideolectures.com/University/IIT-Bombay/BioTechnology/Subject/Page1
2. www.nptel.ac.in

245

3. http://www.youtube.com/playlist?list=PL09283E557CC23579

13CS911: MACHINE TO MACHINE COMMUNICATION

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To study the details of main components that comprises a M2M
solution.
To understand M2M requiremental uses cases.
To outline the ETSI M2M resource-based architecture
To emphasize the role of Internet protocol (IP) in M2M
To provide guidelines for designing security strategies and
solutions for M2M
Course Outcomes:
Formulate the three different business models that are seen in
wide-area wireless M2M deployments.
Analyze the M2M requirements relating to services and network
evolution
Provide the foundation standards for a horizontal M2M service
platform
Realize the significance of Internet protocol (IP) in M2M systems
Exploit various security policies needed in M2M systems to guard
against potential threats
UNIT I

INTRODUCTION TO M2M

M2M definition The business of M2M Accelerating M2M maturity

M2M standards The M2M market M2M market adoption - Business
models - Early M2M operational deployments Vehicle tracking - Health
care monitoring.
UNIT II

M2M REQUIREMENTS AND USE-CASE

APPROACHES
M2M requirements and high level architectural principles: Introduction
246

ETSI M2M work on use cases - Smart metering, eHealth approaches in

ETSI M2M Description of M2M market segments/applications High
level architecture principles for M2M communications
UNIT III

ETSI M2M SERVICES ARCHITECTURE

Introduction High level system architecture ETSI TC M2M service

capabilities framework ETSI M2M service capabilities Introducing
REST architectural style for M2M M2M over telecommunications
network network optimizations for M2M: Introduction - M2M value
added services - Numbering, identifiers, and addressing.
UNIT IV

ROLE OF IP IN M2M

Introduction: IPv6, Neighbor discovery protocol IPv6 for M2M

6LoWPAN: Framework Header compression Neighbor discovery
Routing protocol for low power and Lossy Networks (RPL) CoRE:
Message formats Transport protocol REST architecture.
UNIT V

SECURITY

M2M security characteristics of cellular M2M security requirements

Types of solutions M2M module categorization Hardware interfaces
Services Software interface Case study: M2M communication
technologies and challenges - Smart cards in M2M Communication
TOTAL: 45 Periods
TEXTBOOKS:
1. David Boswarthick, Omar Elloumi, M2M Communications: A
Systems Approach, Olivier Hersent, Wiley Publishing Inc., 2012
2. Kwang-Cheng Chen, Shao-Yu Lien, Machine-to-machine
communications: Technologies and challenges, Elsevier
Publications, Adhoc Networks, 2013.
REFERENCE BOOKS:
1. Vojislav
B.
Misic,
Jelena
Misic,
Machine-to-Machine
Communications: Architectures, Technology, Standards, and
Applications, CRC Press, 2014.
2. Rodger

Nkumbwa,

MacHine-to-MacHine

247

Communication

Revolution, Lambert Academic Publishing, 2011.

WEB REFERENCES:
1. http://test.m2mcomm.com/about/what-is-m2m/index.html
2. http://www.globem2m.com/tutorial/communications-options-inm2m.html
3. http://www.comsoc.org/webcasts/view/m2m-smart-grid-smartcities-technologies-standards-and-applications

13IT910: CYBER FORENSICS

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To familiarize the fundamentals of Cyber forensics systems and
Technologies
To illustrate the importance of Data recovery and Evidence
To understand the procedure for evidence analysis
To plan and prepare for an incident requiring computer forensic
skills
To Seize a computer from a crime scene
Course Outcomes:
Determine what
investigation

data

to

analyze

in

Computer

forensics

Recover data and capture evidence

Analyze the evidences collected from various sources
Select suitable Computer forensics tool to analyze forensic data
Acquire data from Cell phones and mobile devices and investigate
mails
UNIT I

COMPUTER FORENSICS

10

(FUNDAMENTALS, TECHNOLOGY, SYSTEMS)

Computer Forensics - Law Enforcement - Assistance to Human

248

Resources / Employment Proceedings Services - Benefits of

Professional Forensics Methodology - Steps taken by Computer
Forensics Specialists.
Military Computer Forensic Technology, Law Enforcement, Business
Computer Forensic Technology types - Specialized Forensic Techniques
- Finding Hidden data - Encryption methods and vulnerabilities - Internet
tracing method - Security and wireless technologies - Storage area
network security systems - Satellite encryption security systems
UNIT II

COMPUTER
CAPTURE

FORENSICS

EVIDENCE

AND

Data recovery - Data Back-up and Recovery- Role - The Data Recovery
Solution. Evidence- Collection Options Obstacles Types Rules
Volatile Evidence General Procedure Collection and Archiving
Methods of Collection Artifacts Collection Steps Controlling.
The Chain of Custody - Computer Evidence processing steps - Special
needs of evidential authentication
UNIT III

COMPUTER FORENSICS ANALYSIS

10

Determining what data to collect and analyze - Validating forensic data Addressing data hiding techniques - Performing remote acquisitions
Network forensics overview - Live acquisitions - Standard procedures Network tools - Honeynet project. Digital evidence - Identification Collection in private-sector incident scenes- Processing law enforcement
crime scenes - Preparing for a search - Securing a computer incident Seizing digital evidence - Storing digital evidence - Obtaining a digital
hash - Reviewing a case.
UNIT IV

COMPUTER FORENSIC TOOLS

Evaluating computer forensic tool needs - Types - Tasks - Comparison computer forensic software tools - Command line - Unix - GUI Forensics
tools - computer forensic hardware tools - Forensic workstation - Write Blocker - validating and testing forensics software - NIST Tools Validation protocols

249

UNIT V

EMAIL INVESTIGATIONS

Role of E-mail in investigation - Roles of the client and server in E-mail Investigating E-mail crimes - E-mail servers - Specialized E-mail forensic
tools. Cell phone and mobile device forensics: Understanding mobile
device forensics - Understanding acquisition procedures for cell phones
and mobile devices.
TOTAL: 45 Periods
TEXTBOOKS:
1. John R. Vacca, Computer Forensics, Firewall Media, New Delhi,
2009.
2. Nelson, Phillips, Steuart, Computer Forensics and Investigations,
Cengage Learning, Fourth Edition, 2009.
REFERENCE BOOKS:
1. Keith J. Jones, Richard Bejtlich, Curtis W. Rose, Real Digital
Forensics, Addison Wesley Pearson Education, 2005.
2. Christopher L.T.Brown, Computer Evidence - Collection &
Preservation, Firewall Media, Second Edition,2009
3. Jesus Mena, Homeland Security - Techniques & Technologies,
Firewall Media, 2007.
4. Robert M.Slade, Software Forensics Collecting Evidence from the
scene of a Digital Crime, Tata McGraw Hill, 2005.
5. Chad Steel, Windows Forensics, Wiley India Edition, 2006.
WEB REFERENCES:
1. http://www.sans.org/course/computer-forensic-investigationswindows-in-depth
2. http://www.porcupine.org/forensics/forensic-discovery/
3. http://www.securestate.com/Services/Incident%20Response/Pages
/Forensic-Analysis.aspx
4. http://www.cftt.nist.gov/
5. http://www.brandeisdl.discom.com/Forensics/02Modules/07/01Ove
rview/
6. http://www.mobilephoneinvestigations.net/
250

13IT911: NATURAL LANGUAGE PROCESSING

LTPC

(Common to CSE / IT)

3003

Course Objectives:
To explore the fundamental concepts of Natural Language
Processing.
To study the mathematical model for NLP.
To develop skills that will enable them to understand word
processing.
To understand the process of developing different parsing
methods.
To understand the concepts of different semantics and apply.
Course Outcomes:
Familiarize with concept of Natural Language Processing.
Form a mathematical model for NLP.
Work with word processing techniques.
Perform different parsing techniques.
Apply NLP in text processing.
UNIT I

INTRODUCTION TO NLP

Natural language processing History of NLP Early NLP systems

Phases of natural language processing Evaluation of NLP systems Basic english concepts Phases of syntactic analysis - Parsing
techniques Transition networks.
UNIT II

MATHEMATICAL FOUNDATION

Elementary probability theory Probability spaces Conditional

probability and spaces Bayes theorem Random variable
Expectation and variance Notation Joint and conditional distribution
Determining p Standard distributions Bayesian statistics - Essential
information theory Entropy Joint entropy and conditional entropy
Mutual information Noisy channel model Relative entropy Relation
to language The entropy of english

251

UNIT III

WORD PROCESSING

Collections Frequency Mean and variance Hypothesis testing

Mutual information Notation of collections Statistical inference Bins
- Statistical estimators Combining estimators Word sense
disambiguation Methodological preliminaries Supervised
disambiguation Dictionary based disambiguation - Unsupervised
disambiguation - Lexical acquisition.
UNIT IV

GRAMMAR

Markov models - Hidden Markov model Information source in tagging

Markov Model taggers Hidden Markov model taggers Transformation
based learning of tags Other methods - Other language Tagging
accuracy and uses of taggers - Probabilistic CFG - Probabilistic parsing.
UNIT V

APPLICATION AND TECHNIQUES

Statistical alignment and machine translation Text alignment Word

alignment Statistical machine translation Clustering Hierarchical
clustering Non hierarchical clustering Background on information
retrieval Vector space model Term distribution model Latent
semantic indexing Discourse segmentation - Text categorization.
TOTAL: 45 Periods
TEXTBOOKS:
1. Christopher D.Manning and Hinrich Schutze, Foundations of
Statistical Natural Language Processing, MIT Press, 2003.
2. Ela Kumar, Natural Language Processing, I.K International, New
Delhi 2011.
REFERENCE BOOKS
1. Daniel Jurafsky and James H. martin, Speech and Language
Processing, 2008.
2. Ron Cole, J.Mariani, et.al, Survey of the State of the Art in Human
Language Technology, Cambridge University Press, 1997.
3. Michael W. Berry, Survey of Text Mining:
Classification and Retrieval, Springer Verlag, 2003.

252

Culstering,

WEB REFERENCES:
1. https://www.coursera.org/course/nlp
2. http://research.microsoft.com/en-us/groups/nlp/
3. http://www-nlp.stanford.edu/
4. http://www.nltk.org/
5. http://www.inf.ed.ac.uk/teaching/courses/anlp/
6. http://www.cs.utexas.edu/~mooney/cs388/

ELECTIVE III (Electives for VIII Semester)

13CS912: DATA WAREHOUSING AND DATA MINING

LTPC

(Common to CSE / IT)

3014

Course Objectives:
To study the concepts of data warehousing architecture and tools
To understand data mining principles and techniques
To learn to use association rule mining for handling large data
To study classification and clustering for better organization and
retrieval of data
To understand business applications and recent trends of Data
mining
Course Outcomes:
Identify the components of data warehousing architecture
Implement data preprocessing for mining applications
Apply the association rules for mining the data
Design and deploy appropriate classification and clustering
techniques
Use recent trends of Data mining in business applications
UNIT I

INTRODUCTION TO DATA WAREHOUSING

9+3

Data warehousing - Operational database systems vs. Data warehouses

- Multidimensional data model - Schemas for multidimensional

253

databases - OLAP operations - Data warehouse architecture - Indexing OLAP queries and tools.
UNIT II

DATA MINING & DATA PREPROCESSING

8+3

Introduction to KDD process - Knowledge discovery from databases Need for data pre processing - Data cleaning - Data integration and
transformation - Data reduction - Data discretization and concept
hierarchy generation.
UNIT III

ASSOCIATION RULE MINING

9+3

Introduction - Data mining functionalities - Association rule mining Mining frequent itemsets with and without candidate generation - Mining
various kinds of association rules Constraint based association mining.
UNIT IV

CLASSIFICATION AND CLUSTERING

10+3

Decision tree induction - Bayesian classification Rule based

classification classification by back propagation Support vector
machines Associative classification Lazy learners Other
classification methods - Clustering techniques Partitioning methods k
means - Hierarchical methods Distance based agglomerative and
divisive clustering - Density based methods Expectation maximization
Grid based methods Model based clustering methods Constraint
based cluster analysis - Outlier analysis
UNIT V

APPLICATIONS AND RECENT TRENDS OF DATA

MINING

9+3

Graph mining - Social network analysis - Multi relational data mining Mining complex data objects -Spatial databases - Multimedia databases
- Text mining - Mining the World Wide Web Working with WEKA Tool
L : 45 ; P : 15 ; TOTAL: 60 Periods
TEXTBOOKS:
1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and
Techniques, Morgan Kaufmann Publishers, Third edition, 2011.
2. Alex Berson and Stephen J. Smith, Data Warehousing, Data
Mining & OLAP, Tata McGraw Hill Edition, Tenth Reprint, 2007.

254

REFERENCE BOOKS:
1. G. K. Gupta, Introduction to Data Mining with Case Studies,
Easter Economy Edition, Prentice Hall of India, 2006
2. Mehmed Kantardzic, Data mining concepts, models, methods and
algorithms, Wiley Interscience, 2003
3. Ian Witten, Eibe Frank, Data Mining: Practical Machine Learning
Tools and Techniques, Third edition, Morgan Kaufmann, 2011
4. George M Marakas, Modern Data Warehousing, Mining and
Visualization, Prentice Hall, 2003
WEB REFERENCES:
1. www.nptel.ac.in
2. http://www.abbottanalytics.com/data-mining-resourceswebsites.php
3. http://ocw.mit.edu/courses/sloan-school-of-management/15-062data-mining-spring-2003/

13CS913: SOFTWARE QUALITY AND TESTING

LTPC
3014

Course Objectives:
To learn the basics and goals of software testing
To discuss various types of software testing techniques
To list out the tools which can be used for automating the testing
process
To introduce the software quality standards for establishing quality
environment
To understand the methods and evaluation procedures for improving
the quality models
Course Outcomes:
Choose the right type of software testing process for any given real
world problem
255

 Carry out the software testing process in efficient way

Automate the testing process by using several testing tools
Use software quality standards for developing quality software
Analyze and improve the quality procedures based on the past
experience
UNIT I

INTRODUCTION

9+3

Basics of software testing Testing principles Goals Testing life

cycle Phases of testing Test plan (IEEE format) Importance of testing
in software production cycle Testing techniques: Black box White box
Gray box testing Manual vs Automated testing Static vs Dynamic testing
Taxonomy of software testing techniques
UNIT II

SOFTWARE TESTING METHODOLOGY

9+3

Software test plan Components of plan - Types of technical

reviews - Static and dynamic testing- Software testing in spiral
manner - Information gathering - Test planning - Test case design Test development - Test coverage - Test evaluation prepare for next
spiral - Conduct system test - Acceptance test - Summarize testing
results
UNIT III EMERGING SPECIALIZED AREAS IN TESTING

9+3

Test process assessment Test automation assessment - Test

automation framework Nonfunctional testing SOA testing Agile
testing Testing center of excellence Onsite/Offshore model Taxonomy of testing tools - Methodology to evaluate automated testing
tools - Rational testing tools - Java testing tools Jmetra - JUNIT and
Cactus
UNIT IV

SOFTWARE QUALITY MODELS

9+3

Software quality Verification versus Validation Components of quality

assurance SQA plan Quality standards Capability maturity model
People capability maturity model CMM -Integration - Test process
improvement - Testing maturity model - ISO 9000:2000 Software Quality
Standard Malcolm Baldrige national quality award

256

UNIT V

QUALITY
THROUGH
IMPROVEMENT PROCESS

CONTINUOUS

9+3

Role of statistical methods in software quality Transforming

requirements into test cases - Requirement quality factors Numerical
method for evaluating requirement quality Process of creating test cases
Transforming use cases to test cases Demings quality principles
Continuous improvement through Plan Do Check Act (PDCA) - Testing
tools Selenium Apache JMeter - Quick Test Professional (QTP) HP
LoadRunner Watir Lean principles
L : 45 ; P : 15 ; TOTAL: 60 Periods
TEXTBOOKS:
1. William E.Lewis, Software Testing and Continuous
Improvement, Third edition, Auerbach Publications, 2011.

Quality

REFERENCE BOOKS:
1. Kshirasagar Naik, Priyadarshi Tripathy, Software Testing and
Quality Assurance -Theory and Practice, John Wiley & Sons
publication, 2011
2. Ron Patton, Software testing, Second edition, Pearson Education,
2007
3. Elfriede Dustin, Jeff Rashka, John Paul, Automated Software
Testing:
Introduction, Management and Performance, AddisonWesley, 1999
4. William E. Perry Effective Methods for Software Testing, 2nd Edition,
Second Edition, Wiley India, 2006.
5. K.V.K.K. Prasad , Software Testing Tools, Dream tech press, 2008
WEB REFERENCES:
1. http://www.etestinghub.com
2. http://www.onestoptesting.com/introduction/
3. http://www.lean.org/whatslean/principles.cfm
4. http://www.sqa.net/sqa-practice.html
5. http://www.umsl.edu/~sauterv/analysis/488_f01_papers/albright.htm

257

13CS914: DIGITAL IMAGE PROCESSING

(Common to CSE / IT)

LTPC
3014

Course Objectives:
To understand the basics of digital images
To learn the spatial domain filters and frequency domain filters
To study basic image analysis such as edge detection
segmentation

and

To learn to use wavelets transforms

To understand image compression techniques
To learn to apply image processing and analysis techniques to solve
real world problems
Course Outcomes:
Work with Images on simple operations
Implement spatial filter operations and frequency domain filters
Apply edge detection techniques and segmentation algorithms for
the images
Apply wavelet transformation on the given image
Implement image compression algorithms
Apply image processing and analysis to solve real world problems
UNIT I

FUNDAMENTALS OF IMAGE PROCESSING

9+3

Introduction - Steps in image processing - Image acquisition Sampling and quantization - Pixel relationships - Color fundamentals and
models - File formats - Image operations: Arithmetic, geometric and
morphological.
Lab Component: Working with Image operations
UNIT II

IMAGE ENHANCEMENT

9+3

Spatial Domain: Gray level transformations - Histogram processing Noise models Spatial filtering - Smoothing and sharpening - Spatial

258

filters for noise removal. Frequency domain: Filtering in frequency domain

- DFT, FFT, DCT - Smoothing and sharpening filters - Homomorphic
filtering
Lab Component: Working with filters
UNIT III

IMAGE SEGMENTATION AND FEATURE

9+3

EXTRACTION
Detection of discontinuities - Edge operators - Edge linking and
boundary detection - Thresholding - Region based segmentation Morphological watersheds - Motion segmentation - Feature extraction and
analysis
Lab Component: Experiment Image Segmentation Algorithms
UNIT IV

MULTI RESOLUTION ANALYSIS AND

9+3

COMPRESSION
Multi Resolution analysis : Image pyramids - Multi resolution expansion Wavelet transforms - Image compression : Fundamentals - Models Elements of information theory - Error free compression - Lossy
compression - Compression standards
Lab Component: Image Compression using wavelets
UNIT V

APPLICATIONS OF IMAGE PROCESSING

9+3

Image classification - Image recognition - Image understanding - Video

motion analysis - Image fusion - Steganography - Digital compositing Mosaics - Color image processing - Image retrieval - Content based and
semantic based retrieval
Lab Component: Experiment with applications
L : 45 ; P : 15 ; TOTAL: 60 Periods
TEXTBOOKS:
1. Rafael C.Gonzalez and Richard E.Woods, Digital
Processing, Third Edition, Pearson Education, 2009.

Image

2. S.Sridhar, Digital Image Processing, Oxford University Press,

2011.

259

REFERENCE BOOKS:
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, Image Processing,
Analysis and Machine Vision, Second Edition, Thompson Learning,
2007.
2. Anil K.Jain, Fundamentals of Digital Image Processing, PHI, 2011.
3. Sanjit K. Mitra and Giovanni L. Sicuranza, Non Linear Image
Processing, Elsevier, 2007.
WEB REFERENCES:
1. http://ocw.mit.edu/courses/health-sciences-and-technology/hst-582jbiomedical-signal-and-image-processing-spring-2007/syllabus/
2. http://inst.eecs.berkeley.edu/~ee225b/fa12/lectures/
3. http://www.debugmode.com/imagecmp/
4. www.nptel.ac.in

13CS915: SEMANTIC WEB

LTPC
3014

Course Objectives:
To learn the architecture of semantic web
To understand the implementation of ontology
To learn the semantic relationships among XML data elements using
Resource Description Framework (RDF)
To study the OWL Web Ontology Language
To learn semantic web tools and different applications
Course Outcomes:
Identify the features of syntactic and semantic web
Implement a small ontology for specific problem domain
Represent data in XML with appropriate semantic tags
Build expressive ontologies using OWL
Work with semantic web tools

260

UNIT I

INTRODUCTION

9+3

Introduction to the syntactic web and semantic web Evolution of the web
The visual and syntactic web Levels of semantics Taxonomies Ontologies The semantic web
architecture and technologies

Applications of semantic web - Contrasting semantic with conventional

technologies Introduction to Protg tool
UNIT II

ONTOLOGICAL ENGINEERING

9+3

Ontologies Taxonomies Topic maps Classifying ontologies Terminological aspects: concepts, terms, relations between them Complex
objects - Subclasses and sub properties definitions Upper ontologies
Quality Uses - Methods and methodologies for building ontologies
Ontology development process and life cycle Methods for ontology
learning Ontology evolution and versioning - Simple web ontology
language (OWL) creation
UNIT III

STRUCTURING AND DESCRIBING WEB

9+3

RESOURCES
Structured web documents: XML Structuring Namespaces Addressing
Querying Processing RDF: Introduction Basic ideas XML based
syntax RDF Schema: Basic ideas - The language RDFS Modeling for
combinations and patterns Transitivity Creating and handling RDF files
UNIT IV

WEB ONTOLOGY LANGUAGE

9+3

Basics of ontology languages Elements of an ontology: Ontology header

Annotations - Basic classification - Defining and using properties Domain
and Range Describing properties - Data types Negative property
assertions Property restrictions
- Advanced class description
Equivalence in OWL Design issues for ontology languages
UNIT V

SEMANTIC WEB TOOLS AND APPLICATIONS

9+3

Development tools for semantic web SPARQL: Querying the semantic

web Semantic Wiki Jena framework Applications: Software agents Semantic desktop Jena programs
L : 45 ; P : 15 ; TOTAL: 60 Periods

261

TEXTBOOKS:
1. Jorge Cardoso, Semantic Web Services - Theory, Tools and
Applications, Information Science Reference, 2007.
2. Michael C. Daconta, Leo J. Obrst and Kevin T. Smith, The Semantic
Web: A Guide to the Future of XML, Web Services, and Knowledge
Management, Wiley Publishing Inc., 2003.
3. Grigoris Antoniou, Frank van Harmelen, A Semantic Web Primer,
Second Edition (Cooperative Information Systems), MIT Press, 2008.
REFERENCE BOOKS:
1. Liyang Yu, A Developers Guide to the Semantic Web, Springer,
2011.
2. John Hebeler, Matthew Fisher, Ryan Blace, Andrew Perez-Lopez and
Mike Dean, Semantic Web Programming, Wiley Publishing Inc., 2009.
3. Dean Allemang and James Hendler, Semantic Web for the Working
Ontologist: Effective Modeling in RDFS and OWL, Second Edition,
Morgan Kaufmann Publishers, 2011.
4. Robert M. Colomb, Ontology and the Semantic Web: Volume 156
Frontiers in Artificial Intelligence and Applications (Frontier in Artificial
Intelligence and Applications), IOS Press, 2007.
5. Karin Breitman, Marco Antonio Casanova and Walt Truszkowski,
Semantic Web: Concepts, Technologies and Applications, Springer,
2007.
WEB REFERENCES:
1. http://obitko.com/tutorials/ontologies-semantic-web/
2. http://www.linkeddatatools.com/semantic-web-basics
3. http://www.w3.org/People/Ivan/CorePresentations/SWTutorial/Slides.p
df
4. http://www.cambridgesemantics.com/semantic-university/introductionto-the-semantic-web
5. http://jena.sourceforge.net/tutorial/RDF_API/

262

13CS916: DIGITAL SIGNAL PROCESSING ALGORITHMS

AND APPLICATIONS

LTPC
3014

Course Objectives:
To study the basic concepts of signals and systems.
To understand discrete time system using frequency transformation.
To learn to design IIR filter using several mapping techniques.
To learn to design FIR filter using windowing and frequency sampling
techniques.
To learn to apply DSP techniques in real world problem
Course Outcomes:
Work with the basic concepts of Signals and Systems
Apply frequency transformation techniques in DT System
Design IIR filter using several mapping techniques
Design FIR filter using window and frequency sampling techniques
Apply DSP techniques
UNIT I

SIGNALS AND SYSTEMS

10+3

Basic elements of DSP Concepts of frequency in analog and digital

signals Sampling theorem Discrete time signals and systems
Analysis of discrete time LTI systems Z transform Convolution(Linear
and Circular) Correlation.
UNIT II

FREQUENCY TRANSFORMATIONS

9+3

Introduction to DFT Properties of DFT Circular convolution Filtering

methods based on DFT FFT Algorithms Decimation in time algorithms Decimation in frequency algorithms Use of FFT in linear filtering DCT
Use and application of DCT.
UNIT III

IIR FILTER DESIGN

9+3

Structures of IIR Analog filter design Discrete time IIR filter from analog
filter IIR filter design by impulse invariance - Bilinear transformation Approximation of derivatives - Filter design (LPF, HPF, BPF, BRF) using
frequency translation

263

UNIT IV

FIR FILTER DESIGN

9+3

Structures of FIR Linear phase FIR filter Filter design using windowing
techniques (Rectangular Window, Hamming Window, and Hanning
Window) - Frequency sampling techniques Finite word length effects in
digital Filters: Errors - Limit Cycle.
UNIT V

APPLICATIONS

8+3

Multirate signal processing: Decimation Interpolation - Sampling rate

conversion by a rational factor Adaptive Filters: Introduction Applications of adaptive filtering to equalization - Echo cancellation Interference cancellation Speech recognition systems - Speech synthesis
systems Scilab Tool.
L : 45 ; P : 15 ; TOTAL: 60 Periods
TEXTBOOKS:
1. John G. Proakis & Dimitris G.Manolakis, Digital Signal Processing
Principles, Algorithms and Applications, Pearson education /
Prentice Hall, Fourth edition, 2007.
2. Emmanuel C.Ifeachor, & Barrie.W.Jervis, Digital Signal Processing,
Pearson Education Prentice Hall, Second edition, 2002.
REFERENCE BOOKS:
1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, Discrete
Time Signal Processing, Pearson Education, 2nd edition, 2005.
2. Andreas Antoniou, Digital Signal Processing, Tata McGraw Hill,
2001.
3. Nagoor Kani A, Digital Signal Processing , Tata McGraw Hill,
Second Edition, 2012
4. Sanjit K Mitra, Digital Signal Processing, Tata McGraw Hill, Third
Edition,2006
5. Rafeal C. Gonzalez, Richard E. Woods, Digital Image Processing,
Pearson Education, First Edition

264

WEB REFERENCES:
1. http://ocw.mit.edu/resources/res-6-008-digital-signal-processingspring-2011/
2. www.nptel.ac.in
3. http://www.alwayslearn.com/dft%20and%20fft%20tutorial/DFTandFF
T_FFT_Overvi ew.html

13IT905: AD HOC AND SENSOR NETWORKS

LTPC

(Common to CSE / IT)

3014

Course Objectives:
To study about the fundamentals
Adhoc routing protocols

and

different types of

To learn about the QoS aware Adhoc routing protocols

To study about power and energy management in adhoc network
To understand the basics of Sensor Networks, its architecture and
Protocols
To understand the nature, applications and security issues of
sensor networks
Course Outcomes:
Describe the concept of adhoc and sensor networks, their
applications and network architectures
Analyze various protocol design and issues for adhoc and sensor
networks
Analyze the efficiency of power and energy required for adhoc and
sensor network
Evaluate measurements of protocol performance
Create an adhoc and sensor network environment for different type
of applications

265

UNIT I

ADHOC NETWORK FUNDAMENTALS AND ROUTING

10

Introduction Issues in Ad hoc wireless networks - Issues of MAC layer

protocols, Routing protocols and Multicast routing protocols
Classification of routing protocols: Table driven, On-Demand and Hybrid
Classification of Multicast Routing Protocols: Tree based and Mesh based
protocols.
UNIT II

QUALITY OF SERVICE IN AD HOC NETWORKS

9+6

Introduction Issues and challenges in providing QoS Classification of

QoS Solutions MAC layer solutions Network layer solutions: QoS,
Ticket based, Predictive location and Trigger based routing Protocols.
Lab Component: Performance of Routing Protocols in NS2
UNIT III ENERGY MANAGEMENT IN AD HOC NETWORKS

10

Introduction Need for Energy Management in Ad Hoc Wireless

Networks Classification of Energy Management Schemes Battery
Management Schemes Transmission Power Management Schemes
System Power Management Schemes.
UNIT IV WIRELESS SENSOR NETWORKS

9+6

Introduction Motivation Challenges and Constraints Difference

between ad-hoc and sensor networks Sensor Network architecture
Applications of sensor networks Enabling Technologies for Wireless
Sensor Networks 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
Lab Component: Performance of Routing Protocols for WSN in NS2
UNIT V

ADHOC AND SENSOR NETWORK SECURITY

10

Security in Ad-Hoc and Sensor Networks Security Attacks Security

Goals Key Distribution and Management Software based Anti-tamper
Techniques Defense against Security attacks in Adhoc Routing- Secure
Adhoc Routing Protocols Sensor Network Security Protocols
TOTAL: 60 Periods

266

TEXT BOOKS:
1. C. Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks
Architectures and Protocols, Pearson Education, 2004
2. Erdal Cayirci15 , Chunming Rong, Security in Wireless Ad Hoc and
Sensor Networks, John Wiley and Sons, 2009
REFERENCE BOOKS:
1. Waltenegus Dargie, Christian Poellabauer, Fundamentals of
Wireless Sensor Networks Theory and Practice, John Wiley and
Sons, 2010.
2. Carlos De Morais Cordeiro, Dharma Prakash Agrawal, Ad Hoc and
Sensor Networks: Theory and Applications, World Scientific
Publishing, Second Edition, 2011.
3. Holger Karl & Andreas Willig, Protocols and Architectures for
Wireless Sensor Networks, John Wiley, 2005.
4. C.K.Toh, Adhoc Mobile Wireless Networks, Pearson Education,
2002.
5. Feng Zhao and Leonidas Guibas, Wireless Sensor Networks,
Morgan Kaufman Publishers, 2004.
6. Adrian Perrig, J. D. Tygar, "Secure Broadcast Communication: In
Wired and Wireless Networks", Springer, 2006
7. Fraser Cadger et al., A Survey of Geographical Routing in Wireless
Ad-Hoc Networks, IEEE Communications Surveys & Tutorials, Vol.
15, No. 2, Second Quarter 2013
8. Bo Sun et al., Intrusion Detection Techniques in Mobile Ad Hoc
and Wireless Sensor Networks, IEEE Wireless Communications,
October 2007
9. Carlos de Morais Cordeiro et al., Multicast over Wireless Mobile Ad
Hoc Networks :Present and Future Directions, IEEE Network ,
January/February 2003
WEB REFERENCES:
1. http://www.cs.jhu.edu/~cs647/intro_adhoc.pdf

267

2. http://www.ece.ncsu.edu/wireless/Resources/Papers/adhocSurvey.
pdf
3. http://dsn.tm.kit.edu/medien/publications-tutorials/AdHocRoutingMac-Tutorial-MoMuC-Muenchen.pdf
4. http://people.cs.vt.edu/~hamid/Mobile_Computing/papers/frodigh_er
icsson00.pdf
5. http://www.olsr.org/docs/wos3-olsr.pdf
6. http://cwi.unik.no/images/Manet_Overview.pdf
7. http://people.ece.cornell.edu/~haas/Publications/NM-zhou-haas1999-11+12.pdf
8. http://www.netlab.tkk.fi/opetus/s38030/k02/Papers/12-Petteri.pdf
9. http://ceng.usc.edu/~bkrishna/research/talks/WSN_Tutorial_Krishna
machari_ICISIP05.pdf
10. http://www.isi.edu/~johnh/PAPERS/Estrin99e.pdf
11. http://courses.cs.tamu.edu/rabi/cpsc617/resources/sensor%20nwsurvey.pdf
12. http://nesl.ee.ucla.edu/tutorials/mobicom02/slides/MobicomTutorial-4-DE.pdf

13IT906: FUNDAMENTALS OF BIG DATA

LTPC

(Common to CSE / IT)

3014

Course Objectives:
To explore the fundamental concepts of big data analytics
To analyze the big data using intelligent techniques
To understand the various search methods and visualization
techniques
To use various techniques for mining data stream
To understand the applications using Map Reduce Concepts

268

Course Outcomes:
Work with big data platform
Analyze the big data analytic techniques for useful business
applications
Design efficient algorithms for mining the data from large volumes
Analyze the HADOOP and Map Reduce technologies associated
with big data analytics
Explore on Big Data applications Using Pig and Hive
UNIT I

INTRODUCTION TO BIG DATA

Introduction to big data platform Drivers for big data Big data
analytics application-Architecture components- MPP platforms
Unstructured data analytics and reporting Big data and single view of
customer/product Data privacy protection Real time adaptive
analytics and decision engine Advanced analytics platform.
UNIT II

WORKING WITH HADOOP

9+6

History of Hadoop - HDFS Components of Hadoop Developing map

reduce application - Setting up a Hadoop cluster - Cluster specification Cluster setup and installation Hadoop configuration - Security in
Hadoop - Administering Hadoop Hadoop in the cloud
Lab Component: Working with Hadoop
UNIT III

DATA ANALYSIS TECHNIQUES

Supervised learning - Linear classification Univariate linear regression

Multivariate linear regression Regularized regression Logistic
regression Perceptrons Unsupervised learning K means clustering
Clustering around medoids - Hierarchical clustering
UNIT IV MINING DATA STREAMS

Introduction to streams concepts Stream data model and architecture

- Stream computing -Sampling data in a stream Filtering streams
Counting distinct elements in a stream Estimating. Moments
Counting oneness in a window Decaying window

269

UNIT V

FRAMEWORKS

9+9

Applications on big data using Pig and Hive Data processing

operators in Pig Hive services HiveQL Querying data in Hive Fundamentals of HBase and ZooKeeper - BigInsights and streams
NOSQL
Lab Component: Working with Pig, HIVE, NOSQL
L: 30; P: 15, TOTAL: 60 Periods
TEXTBOOKS:
1. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive
Datasets, Cambridge University Press, 2012.
2. Glenn J. Myatt, Making Sense of Data, John Wiley & Sons, 2007
3. Y. S. Abu-Mostafa, M. Magdon-Ismail, and H.-T. Lin, Learning
from Data, AMLBook Publishers, 2012.
REFERENCE BOOKS:
1. PeteWarden, Big Data Glossary, OReilly, 2011.
2. Dr.Aravind Sathi, Big Data Analytics: Disruptive Technologies for
Changing the Game, 2013.
3. Paul Zikopoulos, Dirk deRoos, Krishnan Parasuraman, Thomas
Deutsch, James Giles, and David Corrigan, Harness the Power of
Big Data The IBM Big Data Platform, Tata McGraw Hill
Publications, 2012
4. Michael Minelli, Michele Chambers, Ambiga Dhiraj, Big Data, Big
Analytics: Emerging Business Intelligence and Analytic Trends for
Today's Businesses, Wiley Publications, 2013
5. Michael Berthold, David J. Hand, Intelligent Data Analysis,
Springer, 2007.
6. Tom White Hadoop: The Definitive Guide, Oreilly Media, Third
Edition, 2012.
7. Bill Franks, Taming the Big Data Tidal Wave: Finding
Opportunities in Huge Data Streams with Advanced Analytics,
John Wiley & sons, 2012

270

WEB REFERENCES:
1. http://hadoop.apache.org/
2. http://cecs.wright.edu/~tkprasad/courses/cs707/ProgrammingHad
oop.pdf
3. http://nosql-database.org/
4. http://hive.apache.org/
5. http://www.coreservlets.com/hadoop-tutorial/
6. http://www.w3resource.com/mongodb/nosql.php
7. http://pig.apache.org/docs/r0.7.0/tutorial.html
8. http://www.rohitmenon.com/index.php/apache-pig-tutorial-part-1/

271