SRI VENKATESWARA COLLEGE OF

ENGINEERING
An Autonomous Institution,
Affiliated to Anna University, Chennai
SRIPERUMBUDUR TK - 602 117

REGULATIONS 2018

B.E COMPUTER SCIENCE AND ENGINEERING

Choice Based Credit System
Curriculum and Syllabus
 SEMESTER I

COURSE CONTACT Fixed/

S.NO. COURSE TITLE CATEGORY L T P C Prerequisites
CODE PERIODS Movable

THEORY
Communicative English
1. HS18151 HS 3 3 0 0 3 NIL F
(Common to all Branches)
Engineering Mathematics I
2. MA18151 (Common to all branches BS 4 3 1 0 4 NIL F
except MR)
Engineering Physics
3. PH18151 BS 3 3 0 0 3 NIL F
(Common to all branches)
Engineering Chemistry
4. CY18151 (Common to all branches BS 3 3 0 0 3 NIL F
except MR)
Basic Electrical and Electronics
Engineering
5. EE18151 ES 3 3 0 0 3 NIL F
(Common to AE, BT, CE, CS,
IT, MR & ME)
Programming for Problem
Solving
6. IT18101 ES 3 3 0 0 3 NIL F
(Common to all branches
except MR)
PRACTICAL
Physics and Chemistry
7. PC18161 Laboratory BS 2 0 0 2 1 NIL F
(Common to all branches)
Engineering Practices
8. GE18161 Laboratory ES 3 0 0 3 1.5 NIL F
(Common to all branches)
Programming for Problem
Solving Laboratory
9. IT18111 ES 3 0 0 3 1.5 NIL F
(Common to all branches
except MR)
TOTAL 27 18 1 8 23 - -

(Recommended by BoS - Meeting held on 28.07.2018)

II
 SEMESTER II

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
Technical English
1. HS18251 HS 3 3 0 0 3 NIL F
(Common to all branches)
Engineering Mathematics II
2. MA18251 (Common to all branches BS 4 3 1 0 4 NIL F
except MR)
Engineering Drawing
3. GE18151 BS 5 3 0 2 4 NIL F
(Common to all branches)
Environmental Science and
4. GE18251 Engineering BS 3 3 0 0 3 NIL F
(Common to all branches)
Digital Principles and System
5. CS18201 Design ES 3 3 0 0 3 NIL F
(Common to CS & IT)
6. CS18202 Object Oriented Programming PC 3 3 0 0 3 NIL F
PRACTICAL
Digital Principles and System
7. CS18211 Design Laboratory PC 3 0 0 3 1.5 NIL F
(Common to CS & IT)
Object Oriented Programming
8. CS18212 PC 3 0 0 3 1.5 NIL F
Laboratory
TOTAL 27 18 1 8 23 - -

(Recommended by BoS - Meeting held on 28.07.2018)

SEMESTER III

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
Discrete Mathematics
1. MA18352 BS 4 3 1 0 4 NIL F
(Common to CS & IT)
2. CS18301 Data Structures PC 3 3 0 0 3 NIL F
Database Management
3. CS18302 PC 3 3 0 0 3 NIL F
Systems
Microprocessor and its
4. CS18303 PC 3 3 0 0 3 NIL F
Applications
Advanced Object Oriented
5. CS18304 PC 3 3 0 0 3 NIL F
Programming
PRACTICAL
6, CS18311 Data Structures Laboratory PC 3 0 0 3 1.5 NIL F
Database Management 3
7. CS18312 PC 0 0 3 1.5 NIL F
Systems Laboratory
3
8. CS18313 Microprocessor Laboratory PC 0 0 3 1.5 NIL F

TOTAL 25 15 1 9 20.5 - -

(Recommended by BoS - Meeting held on 19.02.2019)

III
 SEMESTER IV

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
Probability and Queuing
1. MA18453 Theory BS 4 3 1 0 4
NIL
F
(Common to CS & IT)
Computer Architecture
2. CS18401 PC 3 3 0 0 3 NIL F
(Common to CS and EE)
3. CS18402 Operating Systems PC 3 3 0 0 3 NIL F
Computer Networks
4. CS18403 PC 3 3 0 0 3 NIL F
(Common to CS and EE)
5. CS18404 Software Engineering PC 3 3 0 0 3 NIL F
Design and Analysis of
6. CS18405 Algorithms
PC 3 3 0 0 3 NIL F

PRACTICAL
Operating Systems NIL
7. CS18411 Laboratory
PC 3 0 0 3 1.5 F

Computer Networks 1.5 NIL

8. CS18412 Laboratory
PC 3 0 0 3 F

Software Engineering 1.5 NIL

9. CS18413 Laboratory
PC 3 0 0 3 F

TOTAL 28 18 1 9 23.5 - -

SEMESTER V

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
User Interface Technologies
1. CS18501 PC 4 3 1 0 4 NIL F
(Common to CS and IT)
Mobile Computing
2. IT18502 PC 4 3 1 0 4 NIL F
(Common to IT and CS)
Datamining and Data
3. CS18502 warehousing
PC 4 3 1 0 4 CS18302 M

4. CS18503 Theory of Computation PC 4 3 1 0 4 NIL F

5. **** Professional Elective I PE 3 3 0 0 3 NIL M
PRACTICAL
User Interface Technologies
6. CS18511 Laboratory PC 4 0 0 4 2 NIL F
(Common to CS and IT)
Mobile Application
7. CS18512 Development Laboratory
PC 4 0 0 4 2 NIL F
Interview and Career Skills
Laboratory
8. HS18561 EEC 3 0 0 3 2 NIL F
(Common to all branches
except BT and EE)
TOTAL 30 15 4 11 25 - -

(Recommended by BoS - Meeting held on 19.02.2019)

IV
 SEMESTER VI

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
1. CS18601 Artificial Intelligence PC 4 3 1 0 4 NIL F
2. CS18602 Compiler Design PC 4 3 1 0 4 NIL F
Cryptography and Network
3. CS18603 Security
PC 4 3 1 0 4 CS18403 F
Professional Ethics
4. GE18054 (Common to CE, CS, EE, EC, PC 3 3 0 0 3 NIL M
IT and MR)
5. CS18604 Machine Learning Techniques PC 4 3 1 0 4 NIL F
6. **** Professional Elective II PE 3 3 0 0 3 NIL M
PRACTICAL

7. CS18611 Compiler Design Laboratory PC 4 0 0 4 2 NIL F

Artificial Intelligence and

8. CS18612 Machine Learning Laboratory
PC 4 0 0 4 2 NIL F

TOTAL 30 18 4 8 26 - -

SEMESTER VII

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
Cloud Computing and
1. CS18701 Virtualization Techniques
PC 3 3 0 0 3 NIL F
Cyber Security and Ethical
2. CS18702 Hacking
PC 4 3 1 0 4 NIL F

3. **** Professional Elective III PE 3 3 0 0 3 NIL M

4. **** Professional Elective IV PE 3 3 0 0 3 NIL M
5. **** Open Elective I OE 3 3 0 0 3 NIL M
PRACTICAL

6. CS18711 Mini Project EEC 6 0 0 6 3 NIL F

Cloud Computing and

7. CS18712 Virtualization Techniques PC 4 0 0 4 2 NIL F
Laboratory

Security Practices
8. CS18713 Laboratory
PC 4 0 0 4 2 NIL F

TOTAL 30 15 1 14 23 - -

(Recommended by BoS - Meeting held on 19.02.2019)

V
 SEMESTER VIII

COURSE CONTACT
S.NO. COURSE TITLE CATEGORY L T P C Prerequisites Fixed/Movable
CODE PERIODS

THEORY
1. **** Professional Elective V PE 3 3 0 0 3 NIL M
2. **** Professional Elective VI PE 3 3 0 0 3 NIL M
3. **** Open Elective II OE 3 3 0 0 3 NIL M
PRACTICAL

3. CS18811 Project Work EEC 24 0 0 24 12 NIL F

TOTAL 33 9 0 24 21 - -

(Recommended by BoS - Meeting held on 19.02.2019)

List of Electives

Professional Elective I, III & IV (Offered in ODD Semester)

COURSE
SL. No. COURSE TITLE
CODE
1. CS18001 Bioinformatics Techniques
2. CS18003 Data Analytics
3. CS18005 Graph Theory and Its Application
4. CS18007 Information Retrieval Techniques
5. CS18009 Internet of Things and Its Applications
6. GE18051 Intellectual Property Rights (Common to all branches)
7. CS18011 Mobile Application Development
8. CS18013 Multimedia Systems
9. CS18015 Natural Language Processing
10. IT18002 Principles of Digital Image Processing (Common to IT and CS)
11. CS18017 Resource Management Techniques
12. CS18019 Social Network Engineering
13. CS18021 Software Architecture
14. CS18023 Software Planning and Project Management
15. CS18025 Software Requirement Engineering
16. IT18004 Software Testing and Quality Assurance (Common to IT and CS)
17. GE18052 Total Quality Management (Common to ME, AE, CS, EC and MR)

18. CS18027 Web Programming

VI
 Professional Elective II, V & VI (Offered in Even Semester)

COURSE
SL. No. COURSE TITLE
CODE

Advanced User Interface Technologies

1. CS18002
(Common to CS and IT)
2. CS18004 Agile Methodologies (Common to CS and IT)
3. CS18006 Block Chain Technology
4. CS18008 Business Intelligence
5. CS18010 Computer Graphics
6. CS18012 Mobile Adhoc Networks
7. CS18014 Object Oriented Analysis and Design
8. CS18016 Parallel and Distributed Computing
9. CS18018 Real Time Operating Systems
10. CS18020 Service Oriented Architecture and Web Services
11. CS18022 Software Defined Networks
12. CS18024 Unix Internals

(Recommended by BoS - Meeting held on 19.02.2019)

Professional Electives (Can be Chosen whenever offered)

COURSE
SL. No.
CODE
COURSE TITLE

1. SE18001 Mathematics for AI & ML (Common to all branches except MR)

2. SE18002 Corporate Finance (Common to all branches except MR)

3. SE18003 Financial Statement Analysis (Common to all branches except MR)
4. SE18004 Managerial Economics (Common to all branches except MR)
5. SE18005 Market Research (Common to all branches except MR)
6. SE18006 Production Management (Common to all branches except MR)
7. SE18007 Project Management (Common to all branches except MR)
8. SE18008 Introduction to Securities Market (Common to all branches except MR)
9. SE18009 Supply Chain Management (Common to all branches except MR)

(Recommended by BoS - Meeting held on 19.02.2019)

VII
 OPEN ELECTIVES

OPEN ELECTIVES OFFERED IN ODD SEMESTER*

COURSE OFFERING
SL. No. COURSE TITLE
CODE DEPARTMENT
1 OE18101 Fundamentals of Automobile Engineering AUT
2 OE18103 Fundamentals of Automotive Air Conditioning AUT
3 OE18201 Introduction to Biofuels and Bioenergy BIO
4 OE18203 Basics of Environmental Biotechnology BIO
Introduction to Bioinformatics and
5 OE18205 BIO
Computational Biology
6 OE18207 Basics of Nanobiotechnology BIO
7 OE18209 Introduction to Biomaterials BIO
8 OE18301 Waste to Energy CHE
9 OE18303 Industrial Safety CHE
10 OE18305 Composite Materials CHE
11 OE18307 Industrial Waste Water Treatment CHE
12 OE18309 Fuel Cell Technology CHE
13 OE18401 Basic Civil Engineering CVE
14 OE18403 Fundamentals of Remote Sensing and GIS CVE
15 OE18405 Electronic Waste Management CVE
16 OE18407 Basics and Principles of Green Building Design CVE
17 OE18409 Principles of Vastu in Interior Design CVE
18 OE18501 Basic Operating Systems CSE
19 OE18503 Basics on Cyber Security and Ethical Hacking CSE
20 OE18505 Introduction to Internet of Things CSE
21 OE18507 Multimedia and Animation Techniques CSE
22 OE18509 Python Programming CSE
23 OE18601 Electrical Machines and Applications EEE
24 OE18603 Control System Engineering EEE
25 OE18605 Micro and Smart Grid EEE
26 OE18607 Electric Vehicle Technology EEE
27 OE18609 Nanotechnology EEE
28 OE18701 Autotronics ECE
29 OE18703 Sensing Techniques ECE
30 OE18705 System Design using Microcontrollers ECE

VIII
 31 OE18801 IT Essentials for Engineers INT
32 OE18803 Internet of Everything INT
33 OE18805 Foundation on Mobile App Development INT
34 OE18901 Elements of Marine Engineering MAR
35 OE18903 Marine Propulsion MAR
36 OE18001 Basics of Mechanical Engineering MEC
37 OE18003 Elements of Mechanical Components MEC
38 OE18005 Industrial Engineering and Management MEC
39 OE18007 Basics of Energy Resources MEC
40 OH18001 Content Writing HSS
41 OH18003 Critical Thinking HSS
Urban / Rural Development and Constitutional
42 OH18005 HSS
Provisions
43 OC18001 Nanochemistry ACH
44 OC18003 Polymer Chemistry ACH
45 OM18001 Statistical Methods for Engineers APM
46 OM18003 Linear Programming APM

OPEN ELECTIVES OFFERED IN EVEN SEMESTER*

COURSE OFFERING
SL. No. COURSE TITLE
CODE DEPARTMENT
1 OE18102 Automotive Fault Diagnostics AUT
Fundamentals of Automotive Pollution and
2 OE18104 AUT
Control Methods
Fundamentals of Automotive Safety and
3 OE18106 AUT
Maintenance
4 OE18202 Introduction to Food Manufacturing BIO
5 OE18204 Testing of Biological Materials BIO
6 OE18206 Introduction to Tissue Engineering BIO
7 OE18208 Introduction to Cancer Biology BIO
8 OE18210 Basic Bio-pharmaceutical Technology BIO
9 OE18302 Industrial Pollution Prevention CHE
10 OE18304 Solid Waste Management CHE
11 OE18306 Plant Utilities CHE
12 OE18308 Green Energy CHE
13 OE18310 Energy Management CHE
14 OE18402 Integrated Solid Waste Management CVE

IX
15 OE18404 Life Cycle Assessment CVE
16 OE18406 Air Pollution and Control Engineering CVE
17 OE18408 Water Pollution and its Management CVE
18 OE18502 Artificial Intelligence Basics CSE
19 OE18504 Database Systems and Applications CSE
20 OE18506 Internet Programming CSE
21 OE18508 Introduction to Cloud and Big Data Analytics CSE
22 OE18510 Introduction to Data Structures CSE
23 OE18602 Industrial Automation EEE
24 OE18604 MEMS and Nano Devices EEE
25 OE18606 Renewable Energy Systems EEE
26 OE18608 Indian Power Grid EEE
27 OE18610 Power Converters EEE
28 OE18702 Consumer Electronics ECE
29 OE18704 Introduction to Communication Systems ECE
30 OE18706 Robotics Systems ECE
31 OE18802 Embedded and Real Time Systems INT
32 OE18804 Ethical Hacking and IT Security INT
33 OE18806 User Interface Design INT
34 OE18808 AI for Android INT
Introduction to Marine Diesel Engines and
35 OE18902 MAR
Machineries
36 OE18904 Marine Vehicles MAR
37 OE18002 Elements of Automation MEC
38 OE18004 Quality concepts and tools MEC
39 OE18006 Refrigeration and Air conditioning Systems MEC
40 OE18008 Thermal Management of Electronics Devices MEC
41 OP18002 Sensors and Transducers APH
42 OP18004 Essential Properties for Selection of Materials APH
43 OP18006 Opto Electronics and Applications APH
44 OP18008 Basics of Environmental Safety APH
Environmental Law, Policy and International
45 OH18002 HSS
Conventions
46 OH18004 Climate Change and Vulnerability Assessment HSS
47 OH18006 Gender Sensitization and Social Impact HSS

X
 48 OC18002 Fuel Cell Chemistry ACH
49 OC18004 Industrial Catalysis ACH
50 OM18002 Linear Algebra for Engineers APM
Transform Techniques for Boundary Value
51 OM18004 APM
Problems

*Students can choose Open Electives offered only by other departments

Value Added Courses

COURSE CONTACT
S.NO. COURSE TITLE L T P C
CODE PERIODS

1. VD18501 Python Programming for Beginners 2 2 0 0 2

2. VD18502 Deep learning Techniques 2 2 0 0 2
3. VD18503 Digital Forensics 2 2 0 0 2
Communicative German
4. VC18001 2 2 0 0 2
(Common to All Branches, Except MR)
Communicative Japanese
5. VC18002 2 2 0 0 2
(Common to All Branches, Except MR)
Communicative Hindi
6. VC18003 2 2 0 0 2
(Common to All Branches, Except MR)
Design Thinking and Prototyping
Laboratory (Common to All Branches
7. VC18004 2 2 0 0 2
Except MR)
(Common to All branches, Except MR)
Basics of Entrepreneurship Development
8. VC18005 2 2 0 0 2
(Common to All Branches)
9. VC18006 Advance in Entrepreneurship Development 3 1 0 2 2

Mandatory Courses

COURSE
S.NO. COURSE TITLE CATEGORY
CODE
Indian Constitution and Society
1. MC18001 MC
(Common to All Branches except MR)

Internship Training

S.NO. COURSE TITLE CATEGORY

1. Internship* EEC

 This course must be done in an Industry approved by the Department during vacation from semester 3
to semester 6 for a period not less than 2 weeks.

(Recommended by BoS - Meeting held on 19.02.2019)

XI
Summary

Credits per Semester

Category
1 2 3 4 5 6 7 8 Total

Humanities and Social Sciences (HS),

3 3 6
including Management

Basic Sciences (BS) including

Mathematics, Physics, Chemistry, 11 11 4 4 30
Biology
Engineering Sciences (ES), including
Materials, Workshop, Drawing,
Basics of,
9 3 12
Electrical/Electronics/Mechanical/
Computer Engineering,
Instrumentation
Professional Subjects-Core (PC),
relevant to the chosen
specialization/branch; (May be split 6 16.5 19.5 20 23 11 96
into Hard (no choice) and Soft (with
choice), if required)

Professional Subjects – Electives (PE),

relevant to the chosen specialization/ 3 3 6 6 18
branch

Open subjects – Electives from other

technical and /or emerging subjects 3 3 6
(OE)

Project Work, Seminar and/or

Internship in Industry or Elsewhere 2 3 12 17
(EEC)

Total Credits 23 23 20.5 23.5 25 26 23 21 185

XII
HS18151 COMMUNICATIVE ENGLISH L T P C
(Common to all Branches except Marine Engineering ) 3 0 0 3
OBJECTIVES
 To enable learners to interact fluently on everyday social contexts.
 To enable learners engage in conversations in an academic/scholarly setting.
 To enable learners overcome public speaking barriers.
 To develop learners’ ability to take notes and in the process, improve their listening
skills
 To develop learners’ reading skill through reading text passages for comprehension
and contemplation.
 To enable learners write on topics of general interest and drafting correspondences for
general purposes.
UNIT I 9
Listening – short video clips – conversational scenes form movies, celebrities’
speeches/interviews. Speaking – several ways of introducing oneself at several situations,
introducing others at several situations, inviting people for several occasions, describing
people and their places. Reading – short comprehension passages – making inferences, critical
analysis. Writing – completing the incomplete sentences– developing hints from the given
information. Grammar – Wh- Questions and Yes or No questions –Parts of speech.
Vocabulary development– prefixes- suffixes- articles – countable / uncountable nouns.

UNIT II 9
Listening – customer care voice files, short narratives – identifying problems and developing
telephone etiquettes. Speaking – speaking over skype/whatsapp, making business calls,
making self-recorded informative videos, inquiring about a concept/activity, describing a
concept/activity. Reading – reading the headlines on news magazines – slogans and taglines
from advertisements. Writing - free writing – writing - headlines, slogans and taglines
individual inspirations. Grammar – conjunctions, idioms, phrases, quotes. Vocabulary
development – guessing the meanings of words in various different contexts.

UNIT III 9
Listening – courtroom scenes from movies, debates and talks from news channels, notes
taking. Speaking – language and tone for arguments, discussion, deliberation, contemplation,
expressing opinions, reacting to different situations in an alien country. Reading–language
used in instruction manuals of household appliances, cookery and other basic instructions.
Writing- understanding the structure of texts - use of reference words, discourse markers-
coherence, rearranging the jumbled sentences. Grammar – adjectives - degrees of comparison,
framing direct and indirect questions. Vocabulary development – concise approach, single
word substitution.

1
UNIT IV 9
Listening – Sports commentaries, advertisements with users’ criticisms; Speaking –for social
causes, for promoting a concept, negotiating and bargaining; Reading – review of a product,
movie, movement or a system; Writing – writing for advertisements, selling a product;
Grammar – Tenses – Simple Past, Present and Future, Continuous - Past, Present and Future;
Vocabulary Development – synonyms, antonyms and phrasal verbs.

UNIT V 9
Listening – video lectures, video demonstration of a concept; Speaking – presenting
papers/concepts, delivering short speeches, discourses on health, suggesting natural home
remedies, cleanliness, civic sense and responsibilities; Reading – columns and articles on
home science; Writing – correspondences of requests, basic enquiry/observation and basic
complaints; Grammar - modal verbs, perfect tenses – Vocabulary development – collocations.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, learners will be able to:
• Read articles and infer meanings from specific contexts from magazines and
newspapers.
• Participate effectively in informal/casual conversations; introduce themselves and their
friends and express opinions in English.
• Comprehend conversations and short talks delivered in English
• Write short write-ups and personal letters and emails in English.

REFERENCES:
1. Mindscapes : English for Technologists and Engineers. Orient Black swan, Chennai.
2017
2. Downes, Colm, Cambridge English for Job-hunting, Cambridge University Press, New
Delhi. 2008
3. Murphy, Raymond, Intermediate English Grammar with Answers, Cambridge
University Press 2000
4. Thomson, A.J. Practical English Grammar 1& 2 Oxford 1986.
WEBSITES
1. http://www.usingenglish.com
2. http://www.uefap.com3
3. https://owl.english.purdue.edu/owl/
4. www.learnenglishfeelgood.com/esl-printables-worksheets.html

2
SOFTWARE
1. Face 2 Face Advance – Cambridge University Press, 2014
2. English Advance Vocabulary- Cambridge University Press
3. IELTS test preparation – Cambridge University Press 2017
4. Official Guide to the TOEFL Test With CD-ROM, 4th Edition
5. CAMBRIDGE Preparation for the TOEFL TEST- Cambridge University Press, 2017

3
MA18151 MATHEMATICS – I L T P C
(Common to all except Marine Engineering) 3 1 0 4
OBJECTIVES
 To understand and apply matrix techniques for engineering applications.
 To make the student knowledgeable in statistical methods of analyzing and interpret
the data for engineering problems.
 To familiarize the student with basic calculus including functions of several variables
and how to apply the transformation of variables.
 To acquaint the student with Mathematical tools needed in evaluating multiple
integrals and their usage

UNIT I MATRICES 9+3

Eigen values and Eigen vectors of a real matrix – Characteristic equation – Properties of
Eigen values and Eigen vectors – Statement and Applications of Cayley-Hamilton Theorem –
Diagonalization of matrices– Reduction of a quadratic form into canonical form by orthogonal
transformation-Nature of quadratic forms

UNIT II STATISTICAL METHODS 9+3

Scatter diagram- Karl Pearson coefficient of correlation for raw data- Spermann rank
correlation coefficient- lines of regression – Regression equation X on Y and Y on X- Curve
fitting by Principle of least squares – Fitting a straight line and a parabola

UNIT III APPLICATION OF DIFFERENTIAL CALCULUS 9+3

Curvature in Cartesian co-ordinates – Centre and radius of curvature – Circle of curvature –
Evolutes – Envelopes

UNIT IV DIFFERENTIAL CALCULUS OF SEVERAL VARIABLES 9+3

Limits and Continuity - Partial derivatives – Total derivatives – Differentiation of implicit
functions – Jacobians and properties– Taylor’s series for functions of two variables – Maxima
and Minima of functions of two variables – Lagrange’s method of undetermined multipliers

UNIT V MULTIPLE INTEGRALS 9+3

Double integrals in Cartesian and polar coordinates – Change of order of integration – Area
enclosed by plane curves - Change of variables in double integrals – Triple integrals – Volume
of solids.

TOTAL (L:45+T:15):60 Periods

4
OUTCOMES:
At the end of the course, learners will be able to:
 Develop the use of matrix algebra techniques which is needed for practical
applications.
 Apply the skill to solve statistical problems under correlation and regression and
acquire the knowledge for fitting the straight line and parabola.
 Acquire the skills to evaluate the functions of several variables.
 Express proficiency in handling the concept of improper integrals of gamma, beta and
error functions.
 Acquaint the student with mathematical tools needed in evaluating multiple integrals
and their usage.

TEXT BOOKS:

1. Erwin Kreyszig, AdvancedEngineeringMathematics,8thEdition, John Wiley, (1999)

2. Bali N. P and Manish Goyal, “A Text book of Engineering Mathematics”, Eighth
Edition, Laxmi Publications Pvt Ltd., (2011).
3. Grewal. B.S, “Higher Engineering Mathematics”, 41stEdition, Khanna Publications,
Delhi, (2011).
REFERENCES:
1. S C Gupta and V K Kapoor, Fundamentals of Mathematical Statistics, S.Chand Private
Ltd.,11th Edition (2005).
2. Glyn James, “Advanced Modern Engineering Mathematics”, 3rdEdition, Pearson
Education, (2012).
3. Peter V.O’Neil, “Advanced Engineering Mathematics”, 7th Edition, Cengage learning,
(2012).
4. Ramana B.V, “Higher Engineering Mathematics”, Tata McGraw Hill Publishing
Company New Delhi, (2008).
5. Sivarama Krishna Das P. and Rukmangadachari E., “Engineering Mathematics”,
Volume I, Second Edition, Pearson Publishing (2011).

5
PH18151 ENGINEERING PHYSICS L T P C
(Common to all Branches except Marine Engineering)
3 0 0 3
OBJECTIVE:

 To enhance the fundamental knowledge in Physics and its applications relevant to various
streams of Engineering and Technology.

UNIT – I CRYSTAL PHYSICS 12

Unit cell – Bravais Lattices – Miller indices – Distance between Inter planar distance ‘d’
(derivation) – discussion of various crystal structures : calculation of Atomic radius,
Coordination number, effective number of lattice points and Atomic Packing Factor for the
SC, BCC, FCC, HCP, Diamond Cubic (derivation) – discussion about the NaCl, Graphite
structures. Crystal defects : Zero dimensional, one dimensional, Two dimensional and Three
dimensional defects.
Diffraction of X-rays by crystal planes - Bragg’s spectrometer – Powder Diffraction
method

UNIT – II THERMAL PHYSICS 6

Modes of heat transfer: Newton’s law of cooling – thermal conductivity- Lee’s disc method
(derivation and expt) – Radial heat flow – Rubber tube method – conduction through
compound media (series and parallel).

UNIT– III WAVE MECHANICS 9

Quantum principles: Black body radiation-Planck Hypothesis (qualitative),Compton’s
effect (derivation).
Wave-particle duality - de-Broglie matter waves – Heisenberg’s uncertainty principle -
Wave function and its significance - Schrödinger’s wave equation ( time dependent and Time
independent) (derivation) – Application of Schrodinger’s wave equation - Particle in one
dimensional box (derivation ) – Degenerate and non-degenerate energy states.

UNIT– IV ACOUSTICS AND ULTRASONICS 9

Acoustics: Classification of Sound – Characteristics of Musical Sound : Quality (Timbre),
Pitch, Intensity of Sound – Units of Sound – decibel - Reverberation of sound –
Reverberation time – absorption of sound energy by materials – Absorption coefficient –
Sabine’s Formula (derivation) – Factors affecting the acoustics of buildings – Remedies.
Ultrasonics: Introduction to ultrasonics – Properties of ultrasonic waves – Production of
Ultrasonics : Magnetostriction method, Piezo electric method – detection of ultrasonics –
Ultrasonic Acoustic grating - Applications of ultrasonic waves – SONAR, NDT, Sonogram.

6
UNIT – V OPTOELECTRONICS AND FIBER OPTICS 9
Lasers: Basic properties of Lasers - Einstein’s coefficients (Derivation) – Population
inversion – Types of Lasers – Molecular Gas Lasers (CO2 Laser) – Solid state Laser (Nd:
YAG Laser) – Applications of Lasers in Engineering and Medicine.
Fibreoptics: Introduction - Principle and structure of optical fibers-Acceptance angle-
Numerical aperture-Types of optical fibers-Optical fiber communication system (block
diagram) - Advantages and its applications.
TOTAL :45 Periods
OUTCOMES:
Students will be able to
 Interpret the thermal properties of the materials
 Exhibit the ability to solve the problems pertaining to the behavior of sub-atomic
particles using quantum mechanics.
 Learn to solve the issues related to defects in the buildings due to acoustic design
 Develop an understanding about photonics and Fiber Optic communication system
 Classify and demonstrate the fundamentals of crystals and their defects.

TEXT BOOKS
1. Engineering Physics – R.K. Gaur and S.L. Gupta, Dhanput Publications, 2015
2. A text book of Engineering Physics – M. N. Avadhnaulu, and P. G. Kshirsagar, S.
Chand & Co. 2006
3. Engineering Physics – V. Rajendran, Tata McGraw Hill, 2009
4. Materials Science – M. Arumugam, Anuradha Publications, 2015

REFERENCE BOOKS
1. Principles of Physics - Resnick, Halliday& Walker (Wiely )
2. Peter Atkins & Julio De Paula, Physical Chemistry 10thEdn., Oxford University
Press,2014
3. Concepts of Modern Physics – Aurthur Beiser (Mc-Graw Hill)
4. Materials Science and Engineering – V. Raghavan, PHI Learning Pvt. Ltd. 2010

7
CY18151 ENGINEERING CHEMISTRY L T P C
(Common to all branches except Marine Engineering) 3 0 0 3
OBJECTIVES:
 To make the students conversant with boiler feed water requirements, related problems and
the water treatment techniques.
 To develop an understanding the principle, types and mechanism of corrosion and
protective coatings.
 To acquaint the students with the basics of nanomaterials, their properties and applicants.
 To develop an understanding of the laws of photochemistry and basic spectral analysis.
 To enable the students to understand the types of fuels, its calorific values and significance
of flue gas analysis.
UNIT I WATER TECHNOLOGY 9
Sources, hard and soft water, estimation of hardness by EDTA method, boiler feed water, boiler
problems, cause and preventive measures, softening of water - zeolite process and
demineralization by ion exchangers, internal treatment methods, specifications for drinking water,
BIS and WHO standards, treatment of water for domestic use, desalination - reverse osmosis and
electrodialysis.

UNIT II CORROSION AND ITS CONTROL 9

Corrosion: Basic concepts - mechanism of chemical, electrochemical corrosion - Pilling Bedworth
rule – Types of Electrochemical corrosion - galvanic corrosion - differential aeration corrosion -
pitting corrosion – stress corrosion – factors influencing corrosion. Corrosion control: Cathodic
protection – sacrificial anodic method - corrosion inhibitors. Protective coatings: surface
preparation for metallic coatings - electro plating (copper plating) and electroless plating (Nickel
plating) - chemical conversion coatings - anodizing, phosphating and chromate coating.

UNIT III NANOCHEMISTRY 9

Basics - distinction between molecules, nanoparticles and bulk materials; size-dependent
properties. Nanoparticles, nanocluster, nanorod, - nanotube(CNT) and nanowire. Synthesis:
precipitation, thermolysis, hydrothermal, solvothermal, electrodeposition, chemical vapour
deposition, laser ablation; Properties and applications of nanomaterials.

UNIT IV PHOTOCHEMISTRY AND SPECTROSCOPY 9

Laws of photochemistry –Grotthuss-Draper law, Stark–Einstein law and Lambert Beer Law.
Quantum efficiency – Photo processes - Internal Conversion, Inter-system crossing, Fluorescence,
Phosphorescence and Photo-sensitization. Spectroscopy: Electromagnetic spectrum - Absorption
of radiation – Electronic, Vibrational and rotational transitions. UV-visible and IR spectroscopy –
principles, instrumentation (Block diagram only) and applications.

8
UNIT V FUELS AND COMBUSTION 9
Fuel: Introduction- classification of fuels - calorific value- higher and lower calorific values-
analysis of coal (proximate and ultimate)- carbonization- manufacture of metallurgical coke (Otto
Hoffmann method) - petroleum- refining- manufacture of synthetic petrol (Bergius process)-
knocking - octane number - diesel oil- cetane number - natural gas- compressed natural gas(CNG)-
liquefied petroleum gases(LPG)- producer gas- water gas. Combustion of fuels: introduction-
theoretical calculation of calorific value- calculation of stoichiometry of fuel and air ratio - flue gas
analysis by ORSAT Method.

TOTAL (L: 45): 45 PERIODS

OUTCOMES:
On the successful completion of the course, students will be able to
 Estimate the hardness of water, asses the boiler feed water requirement and related
problems also identification of suitable water treatment methods.
 Differentiate the mechanisms of different types of corrosion and suggest suitable corrosion
control techniques to mitigate the problem of corrosion including protective coatings.
 Compare the nano and bulk materials, their synthesis and its applications in various fields.
 Interpret the photochemical reactions and spectroscopic techniques.
 Asses the types and quality of fuels, its calorific values and significance of flue gas analysis
.

TEXT BOOKS:
1. Jain P.C. and Monica Jain, “Engineering Chemistry”, Dhanpat Rai Publishing Company
(P) Ltd., New Delhi, 2010.
2. Dara S.S, Umare S.S, “Engineering Chemistry”, S. Chand & Company Ltd., New Delhi
2010
3. Sivasankar B., “Engineering Chemistry”, Tata McGraw-Hill Publishing Company, Ltd.,
New Delhi, 2008.

REFERENCES:
1. Ozin G. A. and Arsenault A. C., “Nanochemistry: A Chemical Approach to Nanomaterials”,
RSC Publishing, 2005.

2. B.R. Puri, L.R. Sharma, M.S. Pathania., “Principles of Physical Chemistry” Vishal
Publishing Company, 2008.

9
EE18151 BASIC ELECTRICAL AND ELECTRONICS L T P C
ENGINEERING 3 0 0 3
(Common to all branches except ECE, EEE & CE)
OBJECTIVES
 To understand the basic theorems used in Electrical circuits and the principles of
measuring instruments.
 To educate the different concepts and function of electrical machines.
 To introduce the fundamentals of semiconductor and applications.
 To explain the principles of digital electronics.
 To impart knowledge of communication.

UNIT I ELECTRICAL CIRCUITS & MEASURMENTS 10

Ohm’s Law – Kirchhoff’s Laws – Steady State Solution of DC Circuits using Mesh Analysis
– Introduction to AC Circuits – Waveforms and RMS Value – Power and Power factor –
Single Phase and Three Phase AC Balanced Circuits. Construction and working Principle of
Moving Coil and Moving Iron Instruments (Ammeters and Voltmeters), Dynamometer type
Watt meters and Energy meters (Qualitative treatment only)

UNIT II ELECTRICAL MACHINES 10

Construction, Principle of Operation, Basic Equations and Applications of DC Generators,
DC Motors, Single phase induction Motor-,Single Phase Transformer

UNIT III SEMICONDUCTOR DEVICES AND APPLICATIONS 9

Characteristics of PN Junction Diode – Zener Effect – Zener Diode – LED, Photo diode and
its Characteristics – Half wave and Full wave Rectifiers – Voltage Regulation. Bipolar
Junction Transistor – CB, CE, CC Configurations and Characteristics – Photo transistors

UNIT IV DIGITAL ELECTRONICS 9

Binary Number System – Logic Gates – Boolean Algebra – Half and Full Adders – Flip-Flops
– Registers and Counters – A/D and D/A Conversion (single concepts)

UNIT V FUNDAMENTALS OF COMMUNICATION ENGINEERING 7

Types of Signals: Analog and Digital Signals – Modulation and Demodulation: Principles of
Amplitude and Frequency Modulations.
Communication Systems: Radio, TV, Fax, Microwave, Satellite and Optical Fiber (Block
Diagram Approach only).

TOTAL (L:45): 45 PERIODS

10
OUTCOMES:
 Study the fundamental laws governing electrical circuits and to describe the working of
measuring instruments.
 Understand the construction and characteristics of different electrical machines.
 Describe the fundamental behavior of different semiconductor devices and circuits.
 Learn the fundamental concepts of digital electronics circuits.
 Recognize the type of signals, data transfer and able to apply in communication
systems

TEXT BOOKS:
1. Mittle V.N, Arvind Mittal “Basic Electrical Engineering”, Tata McGraw Hill(India),
Second Edition,2013.
2. Sedha R.S., “A Text Book of Applied Electronics”, S. Chand & Co., 2014.

REFERENCES:
1. Muthusubramanian R, Salivahanan S and Muraleedharan K A, “Basic Electrical,
Electronics Engineering”, Tata McGraw Hill, 2013.
2. I.J.Nagrath and D.P. Kothari, “Basic Electrical Engineering”, Tata McGraw Hill
((India), Third Edition, 2010.
3. Mehta V K, “Principles of Electronics”, S.Chand & Company Ltd, 2010.
4. M.Morris Mano, “Digital Logic & Computer Engineering”,Printice Hall of India,
2004.
5. Mahmood Nahvi and Joseph A. Edminister, “Electric Circuits”, Schaum’ Outline
Series, McGraw Hill, Fourth Edition,2007.

11
IT18101 PROGRAMMING FOR PROBLEM SOLVING L T P C
(Common to All Branches Except Marine) 3 0 0 3
OBJECTIVES
The students should be made to:
 Learn the organization of a digital computer.
 Learn to think logically and write algorithms or draw flow charts for problems.
 Be exposed to the syntax of C.
 Be familiar with programming in C.
 Learn to use arrays, strings, functions, pointers, structures and unions in C.

UNIT I INTRODUCTION TO PROBLEM SOLVING 9

Simple model of a Computer – Hardware – Software – Data Representation, Introduction to
Computer Networks and Internet, Problem Solving Techniques – Bottom up design and top
down design - applications, Introduction to Algorithms and Flow Chart.

UNIT II C PROGRAMMING BASICS 9

Introduction to ‘C’ programming – structure of a ‘C’ program – compilation and linking
processes. Conversion of simple algorithm to program. Constants, Variables – Data Types –
Expressions using operators in ‘C’ – Managing Input and Output operations – Decision
Making and Branching – Looping statements – solving simple scientific and statistical
problems.

UNIT III ARRAYS AND STRINGS 9

Arrays – Initialization – Declaration – One dimensional and Two dimensional arrays - String-
String operations –Arrays of strings.

UNIT IV FUNCTIONS AND USER DEFINED DATA TYPES 9

Function – definition of function – Declaration of function – Pass by value - Pass by
reference– Recursion - Enumerators - Structures - Unions.

UNIT V POINTERS AND FILES 9

Macros - storage classes - Pointers- Definition – Initialization – Pointers arithmetic – Double
Pointers, Basic file operations-Example problems.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
 Apply various problem solving techniques and represent solutions to problems in the
form of algorithms and flow charts.
 Examine given problems, design solutions and write C programs using the constructs
of C language.
12
  Apply the advanced constructs and string manipulation feature available in C
programming language to solve problems.
 Demonstrate the use functions, structures and unions to create modularized
applications in C language.
 Illustrate the dynamics of memory by the use of files and pointers.

TEXT BOOKS:
1. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming in C”,
First Edition, Oxford University Press, 2009.
2. Byron S Gottfried, “Programming with C”, Schaum’s Outlines, Third Edition, Tata
McGraw-Hill, 2010.

REFERENCES:
1. Kernighan, B.W and Ritchie, D.M, “The C Programming language”, Second Edition,
Pearson Education, 2015.
2. Yashavant P. Kanetkar. “Let Us C”, BPB Publications, 2011.
3. Paul J Deitel, Dr. Harvey M. Deitel,"C How to Program", Seventh Edition, Pearson
Education, 2016.

13
PC18161 PHYSICS AND CHEMISTRY LABORATORY LTPC
(Common to ALL branches) 0 0 2 1

PHYSICS LABORATORY

OBJECTIVES
To make the student to acquire practical skills in the determination of various physical
properties of materials.

List of Experiments (Any 5 experiments to be conducted)

1. Determination of compressibility of the liquid - Ultrasonic interferometer.
2. Determination of thickness of the given object by Air wedge method.
3. Determination of dispersive power of a prism by Spectrometer.
4. Determination of Young’s modulus of wooden scale by Non-Uniform bending.
5. Determination of wavelength, particle size and numerical aperture of fibre using
Lasers.
6. Lee’s Disc – Thermal conductivity of the poor conductor.
7. Torsional Pendulum – Determination of Rigidity modulus and moment of inertia.

OUTCOMES:
 The student will be able to analyze the physical principle using the various
instruments, also relate the principle to engineering applications.
 The various experiments in the areas of optics, mechanics and thermal physics will
nurture the students in all branches of Engineering.
 The students will be able to think innovatively and also improve the creative skills
that are essential for engineering.

LIST OF EQUIPMENTS FOR THE BATCH OF 30 STUDENTS :

Spectrometer, Mercury Vapour lamp, Lee’s disc exptl setup, Travelling microscope,
ultrasonic interferometer, Sodium vapour lamp, diode laser, optical fiber kit.

14
 CHEMISTRY LABORATORY
OBJECTIVES
 To make the student to acquire practical skills in the determination of water quality
parameters through volumetric and instrumental analysis.
 To acquaint the students with the determination of molecular weight of a polymer by
viscometery.

List of Experiments (Any 5 experiments to be conducted)

1. Determination of total, temporary & permanent hardness of water by EDTA method.
2. Estimation of copper by EDTA.
3. Conductometric titration of a strong acid with a strong base
4. Estimation of iron content of the given solution using potentiometer.
5. Estimation of iron content of the water sample using spectrophotometer.
6. Determination of molecular weight of polymer using viscometer.
7. Determination of Alkalinity in water.

OUTCOMES:
The students will be equipped with hands - on knowledge in the quantitative chemical
analysis of water quality related parameters.
TEXT BOOKS
1. Vogel‘s Textbook of Quantitative Chemical Analysis (8 TH edition, 2014)

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

1. Conductivity meter – 10 Nos
2. Spectrophotometer – 10 Nos
3. Ostwald Viscometer – 10 Nos
4. Potentiometer - 10 Nos
5. Electronic Balance - 2 Nos

Common Apparatus: Pipette, Burette, conical flask, iodine flask, porcelain tile, dropper
(each 30 Nos.)

TOTAL: 30 PERIODS

15
GE18161 ENGINEERING PRACTICES LABORATORY L T P C
0 0 3 1.5

OBJECTIVES :
 To provide exposure to the students with hands on experience on various basic
engineering practices in Civil, Mechanical, Electrical and Electronics Engineering.

LIST OF EXPERIMENTS

GROUP A (CIVIL & MECHANICAL)

I CIVIL ENGINEERING PRACTICE
Buildings:
(a) Study of plumbing and carpentry components of residential and industrial
buildings. Safety aspects.
Plumbing Works:
(a) Study of pipeline joints, its location and functions: valves, taps, couplings, unions,
reducers, elbows in household fittings.
(b) Study of pipe connections requirements for pumps and turbines.
(c) Preparation of plumbing line sketches for water supply and sewage works.
(d) Hands-on-exercise: Basic pipe connections – Mixed pipe material connection –
Pipe connections with different joining components.
(e) Demonstration of plumbing requirements of high-rise buildings.
Carpentry using Power Tools only:
a) Study of the joints in roofs, doors, windows and furniture.

b) Hands-on-exercise: Wood work, joints by sawing, planing and cutting.

II MECHANICAL ENGINEERING PRACTICE

Welding:
a) Preparation of arc welding of butt joints, lap joints and tee joints.

b) (b) Gas welding practice

Basic Machining:
a) Simple Turning and Taper turning

b) (b) Drilling Practice

Sheet Metal Work:

a) Forming & Bending:

16
 b) Model making – Trays, funnels, etc.

c) (c) Different type of joints.

Machine assembly practice:

a) Study of centrifugal pump

b) (b) Study of air conditioner

Demonstration on:
a) Smithy operations, upsetting, swaging, setting down and bending.

Example – Exercise – Production of hexagonal headed bolt.

b) Foundry operations like mould preparation for gear and step cone pulley.

c) Fitting – Exercises – Preparation of square fitting and vee – fitting models

GROUP B (ELECTRICAL & ELECTRONICS)

III ELECTRICAL ENGINEERING PRACTICE

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 and comparison of energy for resistive and LED load using single phase
energy meter.
6. Measurement of resistance to earth of an electrical equipment.

IV ELECTRONICS ENGINEERING PRACTICE

1. Identification of circuit components
a) Resistor, capacitor, diode (PN & Zener), transistors
b) Soldering practice – Circuits – Using general purpose PCB.
2. Evaluating the parameters for DC power supply and AC power supply (peak-peak,
rms, average, period, frequency) using function generator and CRO.
3. Study and implementation of logic functions using NAND, NOR, and NOT gates.
4. VI Characteristics of PN Junction diode.
5. VI Characteristics of Solar photovoltaic panel.
6. Design a 5V/12V Regulated Power Supply: using FWR rectifier and IC7805/IC7812.

TOTAL 45 Periods
17
COURSE OUTCOMES

 Fabricate carpentry components and to lay pipe connections including plumbing works.
 Use welding equipments to join the structures.
 Wiring of basic electrical system and measurement of electrical parameters.
 Study and implementation of basic electronic components, circuits and solar photovoltaic
panel.
 Design a basic regulated power supply.

REFERENCES

1. Jeyachandran K., Natarajan S. & Balasubramanian S., "A Primer on Engineering

Practices Laboratory", Anuradha Publications, 2007.
2. Jeyapoovan T., Saravanapandian M. & Pranitha S., "Engineering Practices Lab
Manual", Vikas Publishing House Pvt. Ltd, 2006.
3. Bawa H.S., "Workshop Practice", Tata McGraw Hill Publishing Company
Limited, 2007.
4. Rajendra Prasad A. and Sarma P.M.M.S., "Workshop Practice", Sree Sai
Publication, 2002.
5. Kannaiah P. & Narayana K.L., "Manual on Workshop Practice", Scitech
Publications, 1999.
6. Mittle V.N, Arvind Mittal, "Basic Electrical Engineering", Tata McGraw
Hill(India), Second Edition,2013.
7. Sedha R.S., "A Text Book of Applied Electronics", S. Chand & Co., 2014.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

CIVIL
1. Assorted components for plumbing consisting of metallic pipes, plastic pipes, flexible
pipes, couplings, unions, elbows, plugs and other fittings. 15 Sets.
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:
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

18
MECHANICAL
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 hammer, wire brush, etc. 5 Sets.
4. Oxygen and acetylene gas cylinders, blow pipe and other welding outfit. 2 Nos.
5. Centre lathe 2 Nos.
6. Hearth furnace, anvil and smithy tools 2 Sets.
7. Moulding table, foundry tools 2 Sets.
8. Power Tool: Angle Grinder 2 Nos
9. Study-purpose items: centrifugal pump, air-conditioner One each.

ELECTRICAL
1. Assorted electrical components for house wiring 15 Sets
2. Electrical measuring instruments 10 Sets
3. Study purpose items: Iron box, fan and regulator, emergency lamp 1 each
4. Megger (250V/500V) 1 No.
5. Power Tools: (a) Range Finder 2 Nos (b) Digital Live-wire detector 2 Nos
6. LED lamp 8W 2 Nos., 16W 2 Nos.

ELECTRONICS
1. Soldering guns 10 Nos.
2. Assorted electronic components for making circuits 50 Nos.
3. Small PCBs 10 Nos.
4. Multimeters 10 Nos.
5. Study purpose ICs: IC7805/IC7812
6. Photovoltaic panel 5W/10W: 2 Nos.
7. Light Source for PV panel 1 Nos.

19
IT18111 PROGRAMMING FOR PROBLEM SOLVING L T P C
LABORATORY 0 0 3 1.5
(Common to All Branches Except Marine)
OBJECTIVES
The students should be made to:
 Be exposed to the syntax of C.
 Be familiar with programming in C.
 Learn to use arrays, strings, functions, pointers, structures and unions in C.

List of Exercises
1. Usage of Basic Linux commands
2. C Programming using Simple statements and expressions
3. Scientific problem solving using decision making and looping.
4. Simple programming for one dimensional and two dimensional arrays.
5. Solving problems using Strings
6. C Programming using Pointers
7. C Programming using user defined functions (Pass by value and Pass by reference)
8. C Programming using Recursion
9. C Programming using structures and union
10. C Programming using enumerated data types
11. C Programming using macros and storage classes
12. C Programming using Files

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
 Apply various problem solving techniques and represent solutions to problems in the
form of algorithms and flow charts.
 Examine given problems, design solutions and write C programs using the constructs of
C language.
 Apply the advanced constructs and string manipulation feature available in C
programming language to solve problems.
 Demonstrate the use functions, structures and unions to create modularized applications
in C language.
 Illustrate the dynamics of memory by the use of files and pointers.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C compiler 30 Nos. or
Server with C compiler supporting 30 terminals or more

20
 HS18251 TECHNICAL ENGLISH L T P C
(Common to all Branches) 3 0 0 3
OBJECTIVES
 To enable learners define and understand technical communication and scientific
writing
 To expose learners to nuances of seminar presentation, group discussion, and public
speaking
 To expose learners to writing for scientific purposes
 To expose learners to drafting correspondences for business purposes
 To expose learners to writing for documenting purposes
 To enable students have a holistic understanding of job interviews and recruiting
process.

UNIT I 9
Listening – AV files pertaining to manufacturing processes of products, scientific
documentaries; Speaking- syllable division and word stress, intonation, sharing opinions;
Reading – news articles related to science and technology; Writing – definitions, instruction,
recommendation, data interpretation, resume; Grammar – tenses and their aspects, sentence
connectors - discourse markers, sequential words, active and passive voice, subject-verb
agreement

UNIT II 9
Listening – AV pertaining to marketing strategies, peer reading and pronunciation; Speaking
- turn taking, sharing opinions; conducting and attending a meeting, understanding the nuances
of spoken communication among internal audience and external audience,; Reading -
analytical documents, descriptive documents; Writing - fliers, brochures, resume- letter of
application, checklists; Grammar - modal verbs, clauses – types and uses, conditional clauses,
articles.

UNIT III 9
Listening – AV related to how to use components, scientific description, Speaking - speaking
for motivation and initiation, speaking at a seminar presentation; Reading – scientific
journals, papers; Writing – Technical descriptions – process description, purpose and
function, PowerPoint, Google forms, user manuals; Grammar - phrasal verbs, prepositions,
technical and scientific affixes.

UNIT IV 9
Listening - scientific debates, crisis management; Speaking - handling conflicts, speaking
about the loss of benefits, progress or decline of business, identifying the connotative
meanings, Reading- documented evidences of uses and functions of a product, review of a
21
product, Writing – memos, follow-up letters, reports - proposal, project, progress reports,
sales reports, reports on industrial visits, executive summary. Grammar - reported speech and
tag questions, sentence structure – comparative, imperative, cause and effect, infinitive of
result.

UNIT V 9
Listening – AV of Group discussions, panel discussions, face to face interviews for
recruitment purposes; Speaking- speaking at group discussions, interviewing a personality,
answering at the interviews; Reading – WebPages of topnotch engineering companies,
Writing - blogging, e-mails, letter of complaint, minutes of the meeting; Grammar - one
word substitution, collocations, better word/sentence substitution (rephrasing the
content/improvising ideas).

TOTAL (L:45): 45 PERIODS

Suggested Activities [task based] – case study, guest lectures as models, problem solving,
understanding team work.
Assessment:
3 Continuous assessments (reading, writing, grammar, and 3 assignments (1 assignment
focuses on listening 2 assignments focus on speaking, evaluation of students’ speeches and
recorded clippings)

OUTCOMES:
At the end of the course, learners will be able to:
 Understand the nuances of technical communication and scientific writing
 Present papers and give seminars
 Discuss in groups and brainstorm
 Draft business correspondences and write for documenting purposes
 Face job interviews with confidence

REFERENCES:

1. Department of English, Anna University. Mindscapes : English for Technologists and

Engineers. Orient Blackswan, Chennai. 2012
2. Downes, Colm, Cambridge English for Job-hunting, Cambridge University Press, New
Delhi. 2008
3. Murphy, Raymond, Intermediate English Grammar with Answers, Cambridge
University Press 2000
4. Thomson, A.J. Practical English Grammar 1& 2 Oxford 1986.
5. Herbert A J, The Structure of Technical English Longman, 1965

22
WEBSITES

1. http://www.usingenglish.com
2. http://www.uefap.com3
3. https://owl.english.purdue.edu/owl/
4. www.learnenglishfeelgood.com/esl-printables-worksheets.html

SOFTWARE

1. Face2Face Advance – Cambridge University Press, 2014

2. English Advance Vocabulary- Cambridge University Press
3. IELTS test preparation – Cambridge University Press 2017
4. Official Guide to the TOEFL Test With CD-ROM, 4th Edition
5. CAMBRIDGE Preparation for the TOEFL TEST- Cambridge University Press, 2017

23
MA18251 MATHEMATICS II L T P C
3 1 0 4
OBJECTIVES:
• To acquaint the student with the concepts of vector calculus needed for problems in all
engineering disciplines.
• To make the student acquire sound knowledge of techniques in solving ordinary
differential equations that model engineering problems.
• To develop an understanding of 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 of electric current.
• To make the student appreciate the purpose of using transforms to create a new domain in
which it is easier to handle the problem that is being investigated

UNIT I VECTORCALCULUS 9+3

Gradient, divergence and curl – Directional derivative – Irrotational and solenoidal vector fields
– Vector integration – Green’s theorem in a plane, Gauss divergence theorem and Stokes’
theorem (excluding proofs) – Simple applications involving cubes and rectangular
parallelopipeds.

UNIT II ORDINARYDIFFERENTIALEQUATIONS 9+3

Higher order linear differential equations with constant coefficients – Method of variation of
parameters – Cauchy’s and Legendre’s linear equations – Simultaneous first order linear
equations with constant coefficients.

UNIT III LAPLACE TRANSFORM 9+3

Laplace transform – Sufficient condition for existence – Transform of elementary functions –
Basic properties – Transforms of derivatives and integrals of functions - Derivatives and
integrals of transforms - Transforms of unit step function and impulse functions – Transform of
periodic functions. Inverse Laplace transforms -Statement of Convolution theorem – Initial and
final value theorems – Solution of linear ODE of second order with constant coefficients using
Laplace transformation techniques.

UNIT IV ANALYTIC FUNCTION 9+3

Functions of a complex variable – Analytic functions: Necessary conditions – Cauchy-Riemann
equations and sufficient conditions (excluding proofs) – Harmonic and orthogonal properties of
analytic function – Harmonic conjugate – Construction of analytic functions – Conformal
mapping-Translation, rotation and inversion (w = z+c, cz, 1/z, z2) - Bilinear transformation.

24
UNIT V COMPLEX INTEGRATION 9+3
Complex integration –Statement and applications of Cauchy’s integral theorem and Cauchy’s
integral formula –Taylor’s and Laurent’s series expansions – Singular points– Residues –
Cauchy’s residue theorem – Evaluation of real definite integrals as contour integrals around unit
circle and semi-circle (excluding poles on the real axis).

TOTAL(L:45+T:15):60 PERIODS
OUTCOMES:
At the end of the course, learners will be able to:
• Interpret the fundamentals of vector calculus and be fluent in the use of Stokes theorem
and Gauss divergence theorem.
• Express proficiency in handling higher order differential equations.
• Determine the methods to solve differential equations using Laplace transforms and
Inverse Laplace transforms.
• Explain Analytic functions and Categorize transformations.
• Solve complex integrals using Cauchy integral theorem and Cauchy's residue theorem.

TEXT BOOKS:
1. Erwin Kreyszig, Advanced engineering mathematics, 8th Edition, John Wiley, 1999.
2. Bali N. P and Manish Goyal, “A Text book of Engineering Mathematics”, Eighth
edition, Laxmi Publications Pvt Ltd., (2011).
3. Grewal. B.S, “Higher Engineering Mathematics”, 41stEdition, Khanna Publications,
Delhi, (2011).

REFERENCES:
1. Dass, H.K., and Er. Rajnish Verma, “Higher Engineering Mathematics”, S.Chand Private
Ltd.,(2011).
2. Glyn James, “Advanced Modern Engineering Mathematics”, 3rd Edition, Pearson
Education, (2012).
3. Peter V.O’Neil, “Advanced Engineering Mathematics”, 7th Edition, Cengage learning,
(2012).
4. Ramana B.V, “Higher Engineering Mathematics”, Tata McGraw Hill Publishing
Company New Delhi, (2008).
5. Sivarama Krishna Das P. and Rukmangadachari E., “Engineering Mathematics”, Volume
I, Second Edition, PEARSON Publishing, 2011.

25
GE18151 ENGINEERING DRAWING L T P C
(Common to ALL Branches of B.E. / B.Tech) 3 0 2 4

OBJECTIVES :
 This course will introduce students to Engineering Drawing and build their ability to read
drawings and interpret the position and form of simple geometry, culminating into
understanding of simple technical assemblies.
UNIT 0 ENGINEERING DRAWING FUNDAMENTALS (Not for Exams) 2
Drawing standard: BIS, Lettering, Dimensioning, Type of lines, Conventions, Geometrical
constructions: Dividing a straight line into equal parts, Bisecting a given angle, Construction of
polygon – Triangle, Square, Pentagon and Hexagon using drawing tools.

UNIT I CURVES AND PROJECTION OF POINTS AND LINES 18

Construction of Engineering Curves: Conic Sections – Ellipse, Parabola, Hyperbola using
Eccentricity method, Cycloid, Involute of Circle and Pentagon.
Projection: Orthographic Projection – Principal Planes, Projection of Points using Four Angles
of Projection, Projection of Straight Lines – Lines parallel or inclined to one or both planes using
Rotating Line Method in First Angle of Projection.

UNIT II PROJECTION OF PLANES AND SOLIDS 15

Projection of Plane Figures – Inclined to any one Principal Plane,
Projection of Solids – Simple Solids (Prisms, Pyramids, Cone and Cylinder) axis inclined to any
one Principal Plane.

UNIT III SECTION OF SOLIDS & DEVELOPMENT OF SURFACES 15

Section of Solids –Sectional views of simple vertical solids cut by section plane inclined to any
one Principal Plane. Development of Surfaces – Development of lateral surfaces of truncated and
frustum of simple solids.

UNIT IV PICTORIAL PROJECTION 15

Introduction to Pictorial Projection, Isometric Projection – Principle, Isometric Planes, Isometric
Scales, Isometric Projection of simple solids and their combination.
Free Hand Drawing - Orthographic views of simple blocks from their Isometric view, Isometric
view of simple blocks from their Orthographic views.

UNIT V PERSPECTIVE PROJECTION 10

Perspective Projection of full solids in simple positions with respect to projection planes by
visual ray and vanishing point method.
TOTAL : 75 PERIODS

26
OUTCOMES :
Upon successful completion of this course, the student shall be able to:
 Understand the importance of BIS Standards in Engineering Drafting
 Graphically construct and understand the importance of Conic sections and special curves
in Engineering applications
 Given a problem statement in geometric elements such as points, lines, planes, solids,
Orthographic projections will be drafted.
 Draw the orthographic projections of sectioned solids and also will Develop their
surfaces
 Interpret Orthographic, Isometric and Perspective views of objects

TEXT BOOKS:
1. N.D.Bhatt, V.M. Panchal Pramod, R. Ingle, “Engineering Drawing”, Charotar Publishing
House, 2014.

REFERENCES :
1. K. Venugopal& V. PrabhuRaja, “Engineering Graphics”, New Age International
(P) Limited, 2009.
2. M.B. Shah & B.C. Rana, “Engineering Drawing”, Pearson Education, 2009.
3. K. R. Gopalakrishna, “Engineering Drawing” (Vol..I&II), Subhas Publications, 2010.
4. K.V. Natrajan, “A text book of Engineering Graphics”, Dhanalakshmi Publishers,
Chennai, 2006.
5. S. Gowri and T. Jeyapoovan, “Engineering Graphics”, Vikas Publishing House Pvt Ltd.,
2011.

27
GE18251 ENVIRONMENTAL SCIENCE AND ENGINEERING L T P C
3 0 0 3
OBJECTIVES:
 To study the nature and facts about environment.
 To study the interrelationship between living organism and environment.
 To implement scientific, technological, economic and political solutions to environmental
problems.
 To study the integrated themes and biodiversity, natural resources, pollution control and
waste management.

UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 12

Definition, scope and importance of environment – need for public awareness - concept of an
ecosystem – structure and function of an ecosystem – energy flow in the ecosystem – ecological
succession – food chains, food webs and ecological pyramids – Introduction, types, characteristic
features, structure and function of the forest ecosystem, grassland ecosystem, desert ecosystem,
aquatic ecosystems, Introduction to biodiversity definition: genetic, species and ecosystem
diversity – biogeographical classification of India – value of biodiversity - Biodiversity at global,
national and local levels – India as a mega-diversity nation – hot-spots of biodiversity – threats to
biodiversity - man-wildlife conflicts – endangered and endemic species of India – conservation of
biodiversity: In-situ and ex-situ conservation of biodiversity.

UNIT II NATURAL RESOURCES AND DISASTER MANAGEMENT 10

Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction, mining,
dams and their effects on forests and tribal people – Water resources: Use and over- utilization of
surface and ground water, floods, drought, conflicts over water, dams-benefits and problems –
Mineral resources: Use and exploitation, environmental effects of extracting and using mineral
resources, case studies – Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity,
case studies – Energy resources: Growing energy needs, renewable and non renewable energy
sources, use of alternate energy sources. case studies – Land resources: Land as a resource – role
of an individual in conservation of natural resources – Equitable use of resources for sustainable
lifestyles.

UNIT III ENVIRONMENTAL POLLUTION 10

Definition – causes, effects and control measures Air pollution, Water pollution, Soil pollution,
Marine pollution, Noise pollution, Thermal pollution, Nuclear hazards – solid waste management:
causes, effects and control measures of municipal solid wastes, e-Waste, risk related to e-Waste –
role of an individual in prevention of pollution – pollution case studies – disaster management:
floods, earthquake, cyclone and landslides, land degradation, man induced landslides, soil erosion
and desertification.

28
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 7
From unsustainable to sustainable development – urban problems related to energy – water
conservation, rain water harvesting, watershed management – resettlement and rehabilitation of
people; its problems and concerns, case studies – role of non-governmental organization-
environmental ethics: Issues and possible solutions – Principles of green chemistry, 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 – central and state pollution control boards -
Public awareness.

UNIT V HUMAN POPULATION AND THE ENVIRONMENT 6

Population growth, variation among nations – population explosion – family welfare programme –
environment and human health – human rights – value education – HIV / AIDS, Swine flu,
Dengue fever – women and child welfare – role of information technology in environment and
human health management – case studies.
TOTAL (L: 45): 45 PERIODS
OUTCOMES:
On completion of the course, the student will be able to
 Describe the importance of ecosystems, biodiversity and its protection.
 Implement the knowledge which requires optimum use of various natural resources for the
conservation of natural resources.
 Classify the different types of pollution, their effects and control measures. Also apply the
knowledge gained for disaster management.
 Describe the sustainable development, social issues, role of NGO’s and various laws
available in the country for environmental protection.
 Recognize the importance of women and child welfare, prevention of HIV/AIDS and usage
of technology for environmental management.

TEXT BOOKS:
1. Benny Joseph, Environmental Science and Engineering, Tata McGraw-Hill, New Delhi,
2012.
2. Gilbert M.Masters, Introduction to Environmental Engineering and Science, 2nd edition,
Pearson Education, 2010.
REFERENCES:
1. Dharmendra S. Sengar, ̳Environmental law‘, Prentice hall of India PVT LTD, New Delhi,
2012.
2. Erach Bharucha, ―Textbook of Environmental Studies, Universities Press(I) PVT, LTD,
Hydrabad, 2015.
3. Rajagopalan, R, ̳Environmental Studies-From Crisis to Cure, Oxford University Press, 2011.
4. Tyler Miller. G and Scott E. Spoolman, ―Environmental Science, Cengage Learning India
PVT, LTD, Delhi, 2013.
29
CS18201 DIGITAL PRINCIPLES & SYSTEM DESIGN L T P C
3 0 0 3
OBJECTIVES
 To understand various number systems, different methods used for the simplification
of Boolean functions
 To design and implement a system that uses combinational logic for the given
specification; Simulate combinational logic systems using Verilog or VHDL
 To design and implement synchronous sequential system for the given specification;
Simulate sequential logic systems using Verilog or VHDL.
 To design and implement Asynchronous sequential system for the given specification.
 To design and implement memory accessing systems and systems using PLA, PAL.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9

Review of Number Systems – Arithmetic Operations – Binary Codes – Boolean algebra and
Theorems – Boolean Functions - Logic Gates – Simplification of Boolean Functions using
Karnaugh Map and Tabulation Methods-NAND & NOR Implementation

UNIT II COMBINATIONAL CIRCUITS 9

Combinational Circuits – Analysis and Design Procedures – Circuits for Arithmetic
Operations, Code Conversion – Decoders and Encoders – Multiplexers and De-multiplexers –
Tri-State Gates–Introduction to HDL programs

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9

Latches and Flip Flops – Analysis and Design Procedures –Shift Registers – Counters –State
Diagram, State Table, State Assignment & Minimization

UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9

Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow
Tables – Race-free State Assignment – Hazards

UNIT V MEMORY AND PROGRAMMABLE LOGIC 9

RAM - Memory Decoding – Error Detection and Correction- ROM–Programmable Logic
Array – Programmable Array Logic
TOTAL (L:45): 45 PERIODS
OUTCOMES:
 Students will be able to learn the different types of number systems and simplification
of Boolean functions
 Students will be able to understand various logic gates and their usage.
 Students will be able to study, analyse and design various combinational circuits and
its implementation using VHDL
30
 
Students will be able to study, analyse and design various synchronous and
asynchronous sequential circuits and its implementation using VHDL.
 Students will be able to understand the different type of memory and their structures.
TEXT BOOKS:

1. “Digital Design with An Introduction to Verilog HDL” by M. Morris Mano and Michael
D. Ciletti, 5th Edition.

REFERENCES:

1. John F. Wakerly, “Digital Design Principles and Practices”, Fourth Edition, Pearson
Education,2007.
2. Charles H. Roth Jr, “Fundamentals of Logic Design”, Fifth Edition – Jaico Publishing
House, Mumbai, 2003.
3. Donald D. Givone, “Digital Principles and Design”, Tata Mcgraw Hill, 2003.
4. Kharate G. K., “Digital Electronics”, Oxford University Press, 2010.
5. https://www.cs.tcd.ie/John.Waldron/CS1026/lec9adder.pdf
6. http://digitalbyte.weebly.com/code-converters.html
7. http://www.learnabout-electronics.org/Digital/dig44.php
8. http://ece.gmu.edu/~clorie/Spring11/ECE-301/Lectures/Lecture_16.pdf
9. Morris Mano, “Computer System Architecture”, Third Edition, Pearson Education
10. https://www.iitg.ernet.in/asahu/cs221/Lects/Lec11.pdf

31
CS18202 OBJECT ORIENTED PROGRAMMING L T P C
3 0 0 3
OBJECTIVES
 Be familiar with the basics of C++ programming language.
 Be familiar with the basic concepts of Object Oriented Programming Language.
 Be familiar with the advanced concepts of Object Oriented Programming Language.
 Be familiar with file handling in C++

UNIT I OBJECT ORIENTED FUNDAMENTALS 9

Object oriented programming concepts – objects – classes – data members and member
functions - abstraction and encapsulation – inheritance – polymorphism. Introduction to C++
– classes – access specifiers – function and data members – default arguments – function
overloading – friend functions – const and volatile functions - static members – Objects –
pointers and objects – constant objects – nested classes.

UNIT II COMPILE TIME POLYMORPHISM 9

Constructors – default constructor – Parameterized constructors – Constructor with dynamic
allocation – Copy constructor – destructors – operator overloading – overloading through friend
functions – overloading the assignment operator – type conversion.

UNIT III RUNTIME POLYMORPHISM 9

Inheritance – public, private, and protected derivations – multiple inheritance - virtual
base class – abstract class – Runtime polymorphism – virtual functions –
pure virtual functions – RTTI.

UNIT IV ADVANCED CONCEPTS 9

Function and class templates - Exception handling – try-catch-throw paradigm –
exception specification – terminate and Unexpected functions – Uncaught exception.

UNIT V FILE HANDLING 9

Streams and formatted I/O – I/O manipulators - file handling – random access – object
serialization – namespaces - std namespace – ANSI String Objects – Standard template
library.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Students will be able to interpret the concepts of data abstraction, encapsulation and
inheritance for problem solutions.

32
  Students will be able to examine the problem and infer Object Oriented Concepts for
practical problem solving.
 Students will be able to appraise generic data type for the data type independent
programming which relate it to Reusability.
 Students will be able to interpret and design the Exception Handling Techniques for
resolving run-time errors.
 Students will be able to practice file I/O for large data set
TEXT BOOKS:

1. B. Trivedi, “Programming with ANSI C++”, Second Edition, Oxford University

Press, 2012.
2. Herbert Schildt, “C++: The Complete Reference”, Fourth Edition, McGraw Hill,
2013.

REFERENCES :

1. Ira Pohl, “Object oriented programming using C++”, Second Edition, Pearson
Education Asia, 2012.
2. Bjarne Stroustrup, "The C++ programming language", Fourth Edition, Addison
Wesley, 2012.

33
CS18211 DIGITAL PRINCIPLES AND SYSTEM DESIGN L T P C
LABORATORY 0 0 3 1.5
OBJECTIVES
 To be an adjunct to the “Digital Principles and System design” Course through hands-
on experience with design, construction, and implementation of digital circuits like
combinational /sequential
 To provide the capability to understand and to simulate digital circuits through Xilinx
List of Experiments
1. Study of logic gates
2. Verification of Boolean theorems.
3. Combinational Circuits-Implementation of arbitrary functions and code converters.
4. Design and implementation of Binary adder/subtractor.
5. Design and implementation of Parity generator/checker.
6. Design and implementation of magnitude comparator.
7. Design and implementation of applications using multiplexers.
8. Study and Implementation of Flip-Flops.
9. Design and implementation of shift registers.
10. Design and implementation of synchronous and asynchronous counters
11. Coding combinational circuits using hardware description language. (HDL s/w
required)
12. Coding sequential circuits using HDL. (HDL s/w required)
13. Design and implementation of simple digital System(Mini Project)

TOTAL: 45 PERIODS
OUTCOMES:

 Students will be able to understand the working of various logic gates.

 Students will be able to understand the various combinational circuits and their
applications.
 Students will be able to study, analyse and design sequential circuits.
 Students will be mastering the HDL softwares.
 Students will be able to understand the design of various building blocks of digital
computers
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
1. Digital Trainer Kits
2. Bread board and components
3. PC s – with Xilinx for HDL
4. IC tester-1

34
CS18212 OBJECT ORIENTED PROGRAMMING L T P C
LABORATORY

0 0 3 1.5

Implement the following topics:

1. Programs Using Functions
- Functions with default arguments
- Implementation of Call by Value, Call by Address and Call by Reference

2. Classes with objects, member functions and Constructors

- Classes with primitive data members
- Classes with arrays as data members
- Classes with pointers as data members – String Class
- Classes with constant data members
- Classes with data members and member functions
3. Compile time Polymorphism
- Operator Overloading including Unary and Binary Operators
- Operator Overloading including friend functions
- Function Overloading
4. Runtime Polymorphism
- Inheritance
- Virtual functions
- Virtual Base Classes
5. Function Templates
6. Class Templates
7. Exception Handling
8. File Handling
- Sequential access
- Random access
9. RTTI
10. Standard Template Library

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

• Standalone desktops with C compiler 30 Nos. (or)
Server with C++ compiler supporting 30 terminals or more

OUTCOMES:
At the end of the course, students would:
 Students will be able to execute C++ programs for implementing constructors
 Students will be able to implement compile time and run time polymorphism.
 Students will be able to solve generic programming.
 Students will be able to execute exceptions and file handling
 Students will be able to examine STL and RTTI
35
MA18352 DISCRETE MATHEMATICS L T P C
(Common to CSE and IT ) 3 1 0 4
OBJECTIVES
 To extend student’s Logical and Mathematical maturity and ability to deal with
abstraction and to introduce most of the basic terminologies used in computer science
courses and application of ideas to solve practical problems.
 To understand the fundamental concepts of the Graph theory and Network connectivity

UNIT I PROPOSITIONAL LOGIC AND PROOFS 9+3

Propositional Logic – Propositional equivalences –Predicates and Quantifiers – Nested
Quantifiers – Rules of inference

UNIT II COMBINATORICS 9+3

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

UNIT III GRAPH THEORY 9+3

Graphs and Graph models- Graph terminology and special types of Graphs – Matrix
representation of Graphs and Graph isomorphism – connectivity – Eulerian and Hamiltonian
Graphs

UNIT IV ALGEBRAIC STRUCTURES 9+3

Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s –
Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and
Fields

UNIT V LATTICES AND BOOLEAN ALGEBRA 9+3

Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic
systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean
algebra.

TOTAL (L: 45+T:15): 60 PERIODS

36
OUTCOMES:
At the end of the course, students would:
 Acquire the concepts of logic to test the lucidity of a program.
 Describe and apply the counting principles in computer simulations.
 Develop graph theory tools for day-to-day applications.
 Expose the concepts and properties of algebraic structures such as groups, rings and
fields.
 Categorize Boolean algebraic structures on numerous levels. the concepts needed to
test the logic of a program.

TEXT BOOKS:

1. Bondy J A and Murthy U S R , Graph Theory with Applications, Elsevier Science

Publishing Co. Inc. New York, 1982
2. Kenneth H.Rosen, "Discrete Mathematics and its Applications", 7thEdition, Tata Mc
Graw
Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
3. Tremblay J.P. and Manohar R, "Discrete Mathematical Structures with Applications to
Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

REFERENCES:

1. Ralph P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied

Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007.
2. Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications,
2006.
3. Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines,
Tata McGraw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.

37
CS18301 DATA STRUCTURES L T P C
3 0 0 3
OBJECTIVES
This course will develop the student's ability to
 Become familiar with sorting and searching algorithms.
 Learn to use list ADT.
 Earn a thorough knowledge in Stack and Queue ADT.
 Learn to distinguish linear and non-linear data structures, and make use of Tree ADT.
 Use graph algorithms for various applications.

UNIT I ARRAYS 9
Array - Abstract Data Type (ADT); Sorting algorithms: Insertion sort - Shell sort - Selection
Sort - Bubble sort - Merge sort - Quick sort - Radix Sort ; Searching: Linear search – Binary
Search.

UNIT II LISTS 9
The List ADT - Array implementation - Linked lists - Application of Lists; Doubly Linked
Lists; Circular Lists

UNIT III STACK AND QUEUES 9

The Stack ADT - Conversion of infix to postfix expression, Evaluating a postfix expression;
Applications of Stacks; The Queue ADT – Circular Queue- Applications of Queues

UNIT IV TREES 9
Tree Preliminaries - Binary Trees - Binary Search Tree; AVL Trees; Splay Trees; B-Trees;
Priority Queues(Heaps) - Binary Heap

UNIT V GRAPHS 9
Graphs - Representation of Graphs; Depth First Search and Breadth First Search; Topological
Sort; Shortest Path Algorithms - Dijkstra's Algorithm - All Pairs Shortest Path; Minimum
Spanning Tree - Prim's Algorithm - Kruskal's Algorithm

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 The students will be familiar with sorting and searching algorithms and appraise its
applications.

38
  The students will be to use list ADT for a variety of applications and classify them
 The students earn a thorough knowledge in Stack and Queue ADT and will appraise
the applications in various real time scenarios.
 The students distinguish linear and non-linear data structures, and appraise the use of
Tree ADT.
 The students appraise the usage of graph algorithms for various applications

TEXT BOOKS:
1. Weiss, Mark A. Data structures & algorithm analysis in C++. Pearson Education, 2012.

REFERENCES:
1. Michael T Goodrich, Roberto Tamassia, David Mount, “Data Structures and
Algorithms in C++”, 7 th Edition, Wiley Publishers, 2004.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
"Introduction to Algorithms", Second Edition, McGraw Hill, 2002.

39
CS18302 DATABASE MANAGEMENT SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
 To learn the fundamentals of data models and to conceptualize and depict a database
system using ER diagram.
 To make a study of SQL and relational database design.
 To learn about the internal storage structures using different file and indexing techniques
which will help in physical DB design.
 To know the fundamental concepts of transaction processing- concurrency control
techniques and recovery procedure.
 To have an introductory knowledge about the Storage and Query processing Techniques
and NoSQL.

UNIT I RELATIONAL DATABASES 9

Purpose of Database System -– Views of data – Data Models – Database System Architecture –
Introduction to relational databases - Relational Model - Keys -- Relational Algebra – Relational
Calculus - SQL fundamentals - Advanced SQL features - Triggers- Embedded SQL– Dynamic SQL -
Database connectivity.

UNIT II DATABASE DESIGN 9

Entity-Relationship Model – E-R Diagrams - Functional Dependencies – Non-loss Decomposition
– Functional Dependencies – First, Second, Third Normal Forms, Dependency Preservation –
Boyce/Codd Normal Form - Multi-valued Dependencies and Fourth Normal Form – Join
Dependencies and Fifth Normal Form

UNIT III TRANSACTION MANAGEMENT 9

Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery – Media
Recovery – Two Phase Commit -- Save Points – Concurrency – Need for Concurrency – Locking
Protocols – Two Phase Locking – Deadlock – Recovery Isolation Levels

UNIT IV IMPLEMENTATION TECHNIQUES 9

Overview of Physical Storage Media – RAID – File Organization – Organization of Records in
Files – Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files – Static
Hashing – Dynamic Hashing – Query Processing Overview – Catalog Information for Cost
Estimation - Query Optimization

UNIT V ADVANCED TOPICS 9

Introduction to Distributed databases - Cloud Databases - Data warehouse and Mining - Mobile
Databases - XML Databases - Multimedia Databases-Big Data and NoSQL.
TOTAL: (L: 45 ): 45 PERIODS

40
OUTCOMES:
 Student can able to develop database schema models and database development process
with various constraints
 Student can design database using E-R modeling and apply normalization techniques over
the raw data.
 Student will be able to manage the transactions that happens in a database
 Student can able to analyze the storage mechanism and recovery techniques of database
system for suitable application.
 Student built the skill on various databases and able to design and implement the real world
applications

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ― Database System
Concepts, Sixth Edition, Tata McGraw Hill, 2010.

REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systems, Sixth
Edition, Pearson Education, 2010.
2. C.J. Date, A. Kannan, S. Swamynathan, ― An Introduction to Database Systems, Eighth
Edition, Pearson Education, 2006..
3. Leskovec, J., Rajaraman, A., & Ullman, J. D.- Mining of massive datasets. Cambridge
university press,2014..
4. Raghu Ramakrishnan, Johannes Gehrke ―Database Management Systems, Fourth Edition,
Tata Mc Graw Hill, 2010.
5. G.K.Gupta, ―Database Management Systems, Tata McGraw Hill, 2011..
6. Carlos Coronel, Steven Morris, Peter Rob, ―Database Systems: Design, Implementation
and Management, Ninth Edition, Cengage Learning, 2011
7. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge
Data Streams with Advanced Analytics”, Wiley and SAS Business Series, 2012.

41
CS18303 MICROPROCESSOR AND ITS APPLICATIONS L T P C
3 0 0 3
OBJECTIVES:

 Study the Architecture of 8086 microprocessor

 Learn the design aspects of I/O Interfacing circuits.
 Study about communication and bus interfacing
 Study the Architecture of 8051 microcontroller
 Learn Cross Compilation using microcontroller

UNIT I THE 8086 MICROPROCESSOR 9

Introduction to 8086 – Microprocessor architecture – Addressing modes - Instruction set and
assembler directives – Assembly language programming – Modular Programming - Linking and
Relocation - Stacks - Procedures – Macros – Interrupts and interrupt service routines – Byte and
String Manipulation

UNIT II SYSTEM BUS STRUCTURE 9

8086 signals – Basic configurations – System bus timing –System design using 8086 – IO
programming – Introduction to Multiprogramming – System Bus Structure - Multiprocessor
configurations – Features of Pentium Processor

UNIT III I/O INTERFACING 9

Memory Interfacing and I/O interfacing - Parallel communication interface – Serial
communication interface – D/A and A/D Interface - Timer – Keyboard /display controller –
Interrupt controller – DMA controller – Programming and applications Case studies: Traffic Light
control, LED display.

UNIT IV MICROCONTROLLER 9
Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins Ports and Circuits - Instruction
set – Addressing modes - Assembly language programming.

UNIT V INTERFACING 8051 and IOT 9

Programming 8051 Timers - Serial Port Programming – LCD & Keyboard Interfacing - ADC,
DAC & Interfacing -- Stepper Motor. Interfacing- Cross Compilation using 8051
History of IoT, Overview and Motivation, Examples of Applications, Internet of Things
Definitions and Frameworks, IoT Architecture.
TOTAL: (L: 45 ): 45 PERIODS

OUTCOMES:

42
  Students will be able to understand the architecture of 8086.
 Students will be able to perform designing of I/O interfacing.
 Students will be able to be familiar with various parallel and serial communication
techniques.
 Students will be able to understand the architecture of 8051 microcontroller.
 Students will be able to perform cross compilation using microcontroller.

TEXT BOOKS:

1. Yu-Cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family -
Architecture, Programming and Design”, Second Edition, Prentice Hall of India, 2007.
2. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051
Microcontroller and Embedded Systems: Using Assembly and C”, Second Edition, Pearson
Education, 2011

REFERENCES:

1. DoughlasV.Hall, “Microprocessors and Interfacing, Programming and Hardware:,TMH,

2012
2. Kenneth J.Ayala, Dhananjay .V.Gadre, “The 8051 Microcontroller and Embedded
Systems: Using Assembly and C”, India Edition, CENGAGE Learning , 2012
3. Daniel Minoli, “Building the Internet of Things with IPv6 and MIPv6: The Evolving
World of M2M Communications”, ISBN: 978-1-118-47347-4, Willy Publications

43
CS18304 ADVANCED OBJECT ORIENTED L T P C
PROGRAMMING 3 0 0 3
OBJECTIVES
 To understand Object Oriented Programming concepts and basic characteristics of Java
 To know the principles of classes and inheritance.
 To define interfaces, strings and exceptions.
 To develop a java application with threads and IO steams.
 To design and build simple applications with applet.

UNIT I INTRODUCTION TO OOP AND JAVA FUNDAMENTALS 9

Object Oriented Programming - Abstraction – objects and classes - Encapsulation- Inheritance
- Polymorphism- OOP in Java – Characteristics of Java – The Java Environment - Java
Source File -Structure – Compilation. Fundamental Programming Structures in Java –
Comments, Data Types, Variables, Operators, Control Flow, Arrays - JavaDoc comments.

UNIT II CLASSES AND INHERITANCE 9

Defining classes in Java – constructors, methods -access specifiers - static members -
Inheritance – Super classes- sub classes –Protected members – constructors in sub classes- the
Object class – abstract classes and methods- final methods and classes –- Object cloning -inner
classes.

UNIT III INTERFACES , STRINGS AND EXCEPTION HANDLING 9

Interfaces – defining an interface, implementing interface, differences between classes and
interfaces and extending interfaces -Exceptions - exception hierarchy - throwing and catching
exceptions – built-in exceptions, creating own exceptions- String Manipulations.

UNIT IV I/O STREAMS AND MULTITHREADING 9

Input / Output Basics – Streams – Byte streams and Character streams – Reading and Writing
Console – Reading and Writing Files. Differences between multi-threading and multitasking,
thread life cycle, creating threads, Inter-thread communication.

UNIT V PACKAGES AND APPLETS 9

Package Creation- Introduction and Advantage of Applet-How to create and run an Applet in
browser and Applet Viewer-Life cycle of Applet-Using Graphics,Color,Font and other classes
in Applet to draw various objects.

TOTAL (L:45): 45 PERIODS

44
OUTCOMES:

 Students will be able to establish Java programs using OOP principles

 Students will be able to discriminate Java programs with the concepts classes and
inheritance.
 Students will be able to manipulate Java applications using interfaces, strings and
exceptions.
 Students will be able to examine Java applications with IO streams and threads.
 Students will be able to demonstrate interactive Java programs using Applets.

TEXT BOOKS:
1. Herbert Schildt, ―Java The complete reference, 8th Edition, McGraw Hill Education,
2011.

REFERENCES:
1. Paul Deitel, Harvey Deitel, ―Java SE 8 for programmers, 3rd Edition, Pearson, 2015.
2. Steven Holzner, ―Java 2 Black book, Dreamtech press, 2011.
3. Timothy Budd, ―Understanding Object-oriented programming with Java, Updated
Edition, Pearson Education, 2000

45
CS18311 DATA STRUCTURES LABORATORY L T P C
0 0 3 1.5
OBJECTIVES
This course will develop the student's ability to
 Be familiarized with good programming design methods, particularly Top- Down
design.
 Getting exposure in implementing the different data structures
 Appreciate recursive algorithms.
LIST OF EXPERIMENTS
1. Sorting (Insertion Sort, Bubble Sort)
2. Quick Sort, Merge Sort
3. Implementation of Linear search and Binary Search.
4. Array Implementation of a list
5. Linked List Implementation
6. Stack - Array implementation, Stack as a List
7. Application of Stack
8. Queue - Array implementation, Queue as a List
9. Binary Search Tree with Tree traversal Techniques – Preorder, Post order and In order.
10. AVL trees
11. Binary Heaps
12. Breadth-first search
13. Depth-first search
14. Shortest Path Algorithms - Dijkstra’s algorithm, Floyd - Warshall algorithm.
15. Minimum Spanning Trees – Kruskal's and Prim's algorithm

TOTAL : 45 PERIODS

OUTCOMES:
 Students design and implement C++ programs for implementing sorting, searching
algorithms.
 Stacks, queues, linked lists.
 Students design and implement C++ programs for implementing stacks, queues, and
linked lists.
 Students apply good programming design methods for program development.
 Appraise the usage of different data structures for implementing solutions to practical
problems.
 Develop recursive programs to implement trees and graphs..

LABORATORY REQUIREMENT FOR BATCH OF 30 STUDENTS:

Standalone desktops with C++ compiler 30 Nos.
or
46
 Server with C++ compiler supporting 30 terminals or more.

CS18312 DATABASE MANAGEMENT SYSTEMS LABORATORY L T P C

0 0 3 1.5
OBJECTIVES:

 Learn to create and use a database.

 Be familiarized with a query language.
 Have hands on experience on DDL Commands.
 Have a good understanding of DML Commands and DCL Commands.
 Familiarize advanced SQL queries.
 Be exposed to different applications.

LIST OF EXPERIMENTS:

1. Creation of a database and writing SQL queries to retrieve information from the database.
2. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based
on conditions.
3. Creation of Views, Synonyms, Sequence, Indexes, Save point.
4. Creating an Employee database to set various constraints.
5. Creating relationship between the databases.
6. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
7. Write a PL/SQL block that handles all types of exceptions.
8. Creation of Procedures.
9. Creation of database triggers and functions
10. Database Connectivity with Front End Tools
11. Case study of Big Data and NoSQL.
12. Mini project
a. Inventory Control System.
b. Material Requirement Processing.
c. Hospital Management System.
d. Railway Reservation System.
e. Personal Information System.
f. Web Based User Identification System.
g. Timetable Management System.
h. h) Hotel Management System

TOTAL: 45 PERIODS

OUTCOMES:
 Student can able to design and implement a database schema for a given problem statement.
 Student can able to create,manipulate and to set various constraints on the tables using SQL
47
 commands.
 Students can populate nested queries using SQL commands and PL/SQL blocks.
 Student will be able to handle various exceptions and specific actions using PL/SQL blocks.
 Student can make the database connectivity using front-end tools for various real time
applications.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

HARDWARE:

Standalone desktops 30 Nos. (or) Server supporting 30 terminals or more.

SOFTWARE:

OS: Fedora / Linux, Hadoop package.

Front end: VB/VC ++/JAVA or Equivalent,
Back end: Oracle / SQL / MySQL/ PostGress / DB2 or Equivalent.

48
CS18313 MICROPROCESSOR LABORATORY L T P C
0 0 3 1.5
OBJECTIVES
The student should be made to:
 Introduce ALP concepts and features
 Write ALP for arithmetic and logical operations in 8086 and 8051
 Differentiate Serial and Parallel Interface
 Interface different I/Os with Microprocessors
 Be familiar with MASM and IoT
LIST OF EXPERIMENTS
8086 Programs using kits and MASM
1. Basic arithmetic and Logical operations
2. Move a data block without overlap
3. Code conversion, decimal arithmetic and Matrix operations.
4. Floating point operations, string manipulations, sorting and searching
5. Password checking, Print RAM size and system date
6. Counters and Time Delay

Peripherals and Interfacing Experiments

7. Traffic light control
8. Stepper motor control
9. Digital clock
10. Key board and Display
11. Serial interface and Parallel interface
12. A/D and D/A interface and Waveform Generation
8051 Experiments
13. Basic arithmetic and Logical operations
14. Square and Cube program, Find 2’s complement of a number
15. Unpacked BCD to ASCI
16. Interfacing Switches and LED’s with 8051 Using “C” language

Raspberry Pi Experiments ( IOT )

17. Peripheral interfacing with IoT kit

TOTAL: 45 PERIODS
OUTCOMES:

 Students will be able to practice 8086 assembly language programming.

49
  Students will be able to perform various arithmetic operations using 8051.
 Students will be able to be perform the different types of data communication.
 Students will be able to perform interfacing of various I/O devices.
 Students will be able to understand basic concepts of IOT devices.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

HARDWARE:
 8086 development kits - 30 nos
 Interfacing Units - Each 10 nos
 Microcontroller - 30 nos

SOFTWARE:
 Intel Desktop Systems with MASM - 30 nos
 8086 Assembler
 8051 Cross Assembler

50
MA18453 PROBABILITY AND QUEUEING THEORY L T P C
(Common to CSE and IT ) 3 1 0 4
OBJECTIVES
 To provide the required mathematical support in real life problems and develop
probabilistic models which can be used in several areas of science and engineering.

UNIT I RANDOM VARIABLES 12+3

Discrete and continuous random variables – Moments – Moment generating functions –
Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions.

UNIT II TWO - DIMENSIONAL RANDOM VARIABLES 8+3

Joint distributions – Marginal and conditional distributions – Covariance – Correlation and
Linear regression for two variables– Transformation of random variables.

UNIT III RANDOM PROCESSES 9+3

Classification – Stationary process – Markov process - Poisson process – Discrete parameter
Markov chain – Chapman Kolmogorov equations – Limiting distributions.

UNIT IV QUEUEING MODELS 8+3

Markovian queues – Birth and Death processes – Single and multiple server queueing models
–Little’s formula - Queues with finite waiting rooms - Finite source models

UNIT V ADVANCED QUEUEING MODELS 8+3

M/G/1 queue – PollaczekKhinchin formula - M/D/1 and M/EK/1 as special cases – Series
queues – Open Jackson networks.
TOTAL (L:45 T:15): 60 PERIODS

OUTCOMES:
At the end of the course, students would be able to:
 "Describe commonly used univariate discrete and continuous probability distributions
by formulating fundamental probability distribution and density functions, as well as
functions of random variables."
 Develop skills in dealing with scenarios involving multiple random variables.
 Express and characterize phenomenon which evolve with respect to time in a
probabilistic manner
 Acquire skills in analyzing queueing models
 Develop skills in identifying best techniques to solve a specific problem.
51
TEXT BOOKS:

1. Ibe. O.C., "Fundamentals of Applied Probability and Random Processes", Elsevier, 1st
IndianReprint, 2007.
2. Gross. D. and Harris. C.M., "Fundamentals of Queueing Theory", Wiley Student edition,
2004.

REFERENCES:
1. Robertazzi, "Computer Networks and Systems: Queueing Theory and performance
evaluation",Springer, 3rd Edition, 2006.
2. Taha H.A., "Operations Research", Pearson Education, Asia, 8th Edition, 2007.
3. Veerarajan. T, “Probability, statistics and random processes”, McGraw Hill Publishers, 3 rd
edition, 2011.
4. Hwei Hsu, "Schaum’s Outline of Theory and Problems of Probability, Random Variables
and Random Processes", Tata McGraw Hill Edition, New Delhi, 2004.
5. Yates R.D. and Goodman. D. J., "Probability and Stochastic Processes", Wiley India
Pvt. Ltd., Bangalore, 2nd Edition, 2012.

52
CS18401 COMPUTER ARCHITECTURE L T P C
3 0 0 3
OBJECTIVES:

 To make students understand the basic structural operation of digital computer and the
hardware-software interface.
 To familiarize the students with arithmetic and logic unit and implementation of fixed point
and floating-point arithmetic operations.
 To expose the students to the concept of pipelining.
 To familiarize the students with hierarchical memory system including cache memories and
virtual memory.
 To expose the students with different ways of communicating with I/O devices and standard
I/O interfaces.

UNIT I OVERVIEW AND INSTRUCTIONS 9

Functional units – Basic operational concepts – Bus structures – Performance and metrics – Eight
ideas -Technology – Performance – Power wall – Uniprocessors to multiprocessors; Instructions –
operations and operands – representing instructions – Logical operations – control operations –
Addressing and addressing modes

UNIT II ARITHMETIC OPERATION 9

ALU - Addition and subtraction – Multiplication – Division – Floating Point operations –Subword
parallelism

UNIT III CONTROL UNIT 9

Basic MIPS implementation – Building datapath – Control Implementation scheme – Pipelining –
Pipelined data path and control – Handling Data hazards & Control hazards – Exceptions

UNIT IV PARALLELISM 9
Instruction-level-parallelism – Parallel processing challenges – Flynn's classification – Hardware
multithreading – Multi core processors

UNIT V MEMORY AND I/O SYSTEMS 9

Memory hierarchy - Memory technologies – Cache basics – Measuring and improving cache
performance - Virtual memory, TLBs - Input/output system, programmed I/O, DMA and
interrupts, I/O processors.

TOTAL: (L: 45 ): 45 PERIODS

53
OUTCOMES:
At the end of the course, learners will be able to
 Understand Bus structure and Instruction set
 Design Arithmetic and Logic unit.
 Design of Control units
 Understand Parallel processing
 Evaluate performance of Memory

TEXT BOOKS:
1. David A. Patterson and John L. Hennessey, “Computer organization and design, The
Hardware/Software Interface‟, Morgan kauffman /Elsevier, Fifth edition, 2014
REFERENCES:
1. V. Carl Hamacher, Zvonko G. Varanesic and Safat G. Zaky, “Computer Organisation“, VI
edition, McGraw-Hill Inc, 2012
2. William Stallings “Computer Organization and Architecture”, Seventh Edition, Pearson
Education, 2006.
3. Vincent P. Heuring, Harry F. Jordan, “Computer System Architecture”, Second Edition,
Pearson Education, 2005.
4. Govindarajalu, “Computer Architecture and Organization, Design Principles and
Applications", first edition, Tata McGraw Hill, New Delhi, 2005.
5. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata McGraw
Hill, 1998
6. http://nptel.ac.in/.

54
CS18402 OPERATING SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
 Understand the basic concepts and functions of operating systems.
 Understand Processes and Threads
 Analyze Scheduling algorithms.
 Understand the concept of Deadlocks.
 Analyze various memory management schemes.
 Understand I/O management and File systems

UNIT I OPERATING SYSTEMS OVERVIEW 9

Computer System Organization - Computer System Architecture – Evolution of Operating System
- Operating System Structures - Services and Operations - System Calls - System Programs -
Operating System Generation and System Boot – Computing Environments.

UNIT II PROCESS MANAGEMENT AND SCHEDULING 9

Process Concept - Process Scheduling - Operations on Processes - Interprocess Communication –
Shared Memory - Message Passing - PIPES. Threads - Overview - Multicore Programming -
Multithreading Models - Thread Libraries - Threading Issues - Windows 7 - Thread and SMP
Management. CPU Scheduling - Scheduling criteria – Scheduling algorithms – Multiple-processor
scheduling – Real time scheduling – Algorithm Evaluation. Case study : Process scheduling in
Linux.

UNIT III PROCESS SYNCHRONIZATION AND DEADLOCK 9

Process Synchronization - The critical-section problem – Synchronization hardware – Semaphores
– Classic problems of synchronization – critical regions – Monitors. Deadlock - System model –
Deadlock characterization – Methods for handling deadlocks – Deadlock prevention – Deadlock
avoidance – Deadlock detection – Recovery from deadlock.

UNIT IV MEMORY MANAGEMENT 9

Main Memory- Memory Partitioning - Memory Allocation Algorithms – Segmentation – Paging -
32 and 64 bit architecture - Virtual Memory – Data structures – Management Policies – Demand
Paging - Replacement Algorithms – Allocation – Thrashing - Allocating Kernel Memory - Case
Study : Windows, Solaris OS.

UNIT V FILE SYSTEM AND SECONDARY STORAGE STRUCTURE 9

File System Storage-File Concepts - Access Methods – File Sharing and Protection - File System
Structure - File System Implementation - Directory Structure - Allocation Methods - Free Space
Management - Mass Storage Structure – Overview - Disk Scheduling and Management - Swap
Space Management – RAID Structure - Kernel I/O Systems.Case Study : Mobile OS – iOS and
Android
TOTAL: (L: 45 ): 45 PERIODS

55
OUTCOMES:
 Students will be able to infer the OS features and operations while working in opearting
system.
 Students will obtain the skill to Excel expertly in the process scheduling algorithms and
interprocess communication procedures.
 Students will be able to demonstarte the process synchronization and deadlock methods.
 Students will identify various memory management techniques and analyze the working
methodology of each technique.
 Students will gain the deep knowledge on file system, Disk Management and able to
discover the features of different operating systems.

TEXT BOOKS:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”,
9th Edition, John Wiley and Sons Inc., 2012.

REFERENCES:
1. William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition,
Prentice Hall, 2011.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley,
2001.
3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill
Education”, 1996.
4. Neil Smyth, ―iPhone iOS 4 Development Essentials – Xcode, Fourth Edition, Payload
media, 2011.

56
CS18403 COMPUTER NETWORKS L T P C
3 0 0 3
OBJECTIVES:
The learner should be made to:
 Understand the concepts of computer network and Internet.
 Be familiar with real time applications of networks.
 Learn the Transport Layer, flow control and congestion control algorithms.
 Be exposed to various addressing schemes and routing protocols.
 Understand the link, physical layers and error detection-correction of data.

UNIT I INDRODUCITON TO COMPUTER NETWORK & 9

INTERNET
What is Internet-The Network Edge-The Network Core- Delay, Loss, and Throughput in Packet-
Switched Networks- Protocol Layers and Their Service Models- Networks Under Attack- History
of Computer Networking and the Internet.

UNIT II APPLICATION LAYER 9

Principles of Network Applications- The Web and HTTP- File Transfer: FTP- Electronic Mail in
the Internet- DNS—The Internet’s Directory Service- Peer-to-Peer Applications- Socket
Programming: Creating Network Applications.

UNIT III TRANSPORT LAYER 9

Introduction and Transport-Layer Services- Multiplexing and De-multiplexing- Connectionless
Transport: UDP- Principles of Reliable Data Transfer- Connection-Oriented Transport: TCP-
Principles of Congestion Control- TCP Congestion Control.

UNIT IV NETWORK LAYER 9

Introduction- Virtual Circuit and Datagram Networks- What’s Inside a Router- The Internet
Protocol (IP): Forwarding and Addressing in the Internet- Routing Algorithms- Routing in the
Internet- Broadcast and Multicast Routing

UNIT V DATALINK & PHYSICAL LAYERS 9

Introduction to the Link Layer- Error-Detection and -Correction Techniques- Multiple Access
Links and Protocols- Switched Local Area Networks- Link Virtualization: A Network as a Link
Layer- Wireless Links and Network Characteristics- Wireless LANs- Physical Layer: Digital
Transmission – Multiplexing and Spread Spectrum - Transmission Media.

TOTAL: (L: 45 ): 45 PERIODS

57
OUTCOMES:
 Students will be able to understand the concepts of computer networks and Internet.
 Students will be able to categorize different application layer level protocols based on
user’s request.
 Students will be able to apply the knowledge of addressing scheme and various routing
protocols in data.
 Students will be able to examine the flow of information from one node to another node in
the network.
 Students will be able to distinguish the link, physical layers and error detection-correction
of data.
TEXT BOOKS:
1. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach
Featuring the Internet”, Seventh Edition, Pearson Education, 2017.

REFERENCES:
1. Behrouz A. Forouzan, “Data Communications and Networking”, Fourth Edition,
McGrawHill, 2011.
2. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth
Edition, Morgan Kaufmann Publishers, 2011.
3. Andrew S. Tanenbaum; David J. Wetherall, “Computer Networks”, 5th Edition, Prentice
Hall publisher, 2010.
4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
Approach”, McGraw Hill Publisher, 2011.

58
CS18404 SOFTWARE ENGINEERING L T P C
3 0 0 3
OBJECTIVES

The student should be made to:

 Understand generic models to structure the software development process.
 Understand fundamental concepts of requirements engineering and Analysis modeling.
 Understand the major considerations for enterprise integration and deployment.
 Learn various testing and maintenance measures
 Learn the concepts of Software Quality Assurance

UNIT I SOFTWARE PROCESS AND PROJECT MANAGEMENT 9

Software Engineering Process Paradigms- Project management Process and Project Metrics -
Software estimation Empirical estimation models- planning Risk analysis -Software project
scheduling and Tracking.

UNIT II REQUIREMENTS ANALYSIS AND MODELING 9

Software Requirements: Functional and Non-Functional, User requirements, System
requirements, Software Requirements Document – Requirement Engineering Process:
Feasibility Studies, Requirements elicitation and analysis, requirements validation,
requirements management. Classical analysis: Structured system Analysis, Petri Nets- Data
Dictionary.

UNIT III SOFTWARE DESIGN 9

Design process – Design Concepts-Design Model– Design Heuristic – Architectural Design –
Architectural styles, Architectural Design, Architectural Mapping using Data Flow- User
Interface Design: Interface analysis, Interface Design –Component level Design: Designing
Class based components, traditional Components

UNIT IV TESTING AND IMPLEMENTATION 9

Software testing fundamentals-Internal and external views of Testing-white box testing- basis
path testing-control structure testing-black box testing- Regression Testing – Unit Testing –
Integration Testing – Validation Testing – System Testing and Debugging – Software
Implementation Techniques: Coding practices-Refactoring

59
UNIT V SOFTWARE QUALITY ASSURANCE 9
Software Quality Assurance -Quality Metrics and Models, Software Reliability Theory -
Software Maintenance -Software Configuration Management - Reverse Engineering and Re-
engineering, Introduction to CASE Tools and Case Studies.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Student will be to identify the key activities in managing a software project
 Student will be able to compare different process models. Concepts of
requirements engineering and Analysis Modelling.
 Student will be able to apply systematic procedure for software design and
deployment.
 Student will be able to compare and contrast the various testing and quality
assurance techniques
 Student will be able to recognize the concepts of Software Quality Assurance
and Reverse Engineering

TEXT BOOKS:
1. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Seventh
Edition, Mc Graw-Hill International Edition, 2010

REFERENCES:
1. Ian Sommerville, “Software Engineering”, 9th Edition, Pearson Education Asia, 2011.
2. David J. Anderson and Eli Schragenheim, ―Agile Management for Software
Engineering: Applying the Theory of Constraints for Business Results‖, Prentice Hall,
2003.
3. Kelkar S.A., “Software Engineering”, Prentice Hall of India Pvt Ltd, 2007.
4. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI Learning
Private Limited ,2009.
5. Stephen R. Schach, “Software Engineering”, Tata McGraw-Hill Publishing Company
Limited, 2007.

60
CS18405 DESIGN AND ANALYSIS OF ALGORITHMS L T P C
3 0 0 3

OBJECTIVES:
Upon completion of this course, students will be able to do the following:
 Analyze the asymptotic performance of algorithms.
 Demonstrate a familiarity with major algorithms and data structures.
 Apply important algorithmic design techniques and analysis methods.

UNIT I INTRODUCTION 9
The Role of Algorithms in Computing: Algorithms – Algorithms as a technology. Getting Started:
Insertion Sort – Analyzing algorithms – Designing algorithms. Growth of Functions: Asymptotic
notation – Standard notations and common functions.

UNIT II DIVIDE-AND-CONQUER 9
Recurrences – The maximum-sub array problem – The Substitution Method for Solving
Recurrences – The Recursion-Tree method for Solving Recurrences- The Master Method for
Solving Recurrences – Finding Closest Pair of Points.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9

Dynamic Programming: Longest common subsequence – Optimal Binary Search Tree – The
Floyd-Warshall Algorithm – Transitive closure of a directed graph.
Greedy Technique: Minimum Spanning Trees – Growing a minimum spanning tree – The
algorithms of Kruskal and Prim. Single source Shortest Paths: Dijkstra's Algorithm - Huffman
Trees.

UNIT IV LINEAR PROGRAMMING AND COMPUTATIONAL 9

GEOMETRY
Linear Programming - Standard and Slack Forms - The Simplex Algorithm – Geometric
Interpretation of Linear Programming. Computational Geometry – Line Segment Properties –
Graham Scan – Jarvis’s March.

UNIT V NP- COMPLETENESS 9

Decision Problem Vs Optimization Problem – Polynomial Time – Abstract Problems- Encoding.
Polynomial Time Verification - NP-Completeness and Reducibility - Circuit Satisfiability -
Satisfiability of Boolean Formulas – 3-Conjunctive Normal Form (3-CNF) – Satisfiability – The
Clique Problem – Vertex Cover.

TOTAL: (L 45): 45 PERIODS

61
OUTCOMES:
 The students will be able to analyze the running time of algorithms using asymptotic
analysis.
 The students will be able to describe the divide-and-conquer techniques and analyze the
running time of the algorithms synthesizing those paradigms.
 The students will be able to describe the dynamic programming and greedy paradigms and
analyze the running time of the algorithms using those techniques.
 The students will be able to employ linear programming and computational geometry
methods to solve engineering problems.
 The students will be able to describe the non-deterministic polynomial algorithms.

TEXT BOOKS:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.

REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition,
Pearson Education, 2012..
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”,
3. Pearson Education, Reprint 2006.
4. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education,
2009.
5. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
6. http://nptel.ac.in/

62
CS18411 OPERATING SYSTEMS LABORATORY L T P C

0 0 3 1.5
OBJECTIVES:
 Learn unix commands and shell programming.
 Be exposed to programming in C using system calls.
 Learn to implement process creation and inter process communication.
 Be familiar with implementation of CPU Scheduling Algorithms
 Be familiar with implementation of page replacement algorithms
 Be familiar with implementation of Deadlock avoidance and detection algorithms.
 Be familiar with implementation of File Organization and File Allocation Strategies.

LIST OF EXPERIMENTS:

1. Study of UNIX Commands

2. Study of Shell Programming
3. Implement system calls of UNIX operating system fork, exec, getpid, exit, wait, close, stat,
opendir, readdir
4. Simulate Unix commands cp, mv, ls, grep
5. Implement the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
6. Implement all file allocation strategies
a) Sequential b) Indexed c) Linked
7. Implement Producer Consumer Problem using Semaphores
8. Implement all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
9. Implement Bankers Algorithm for Dead Lock Avoidance
10. Implement an algorithm for Dead Lock Detection
11. Implement the following page replacement algorithms
a) FIFO b) LRU c) LFU
12. Implement Shared memory, message passing and pipes.
13. Implement Paging and Segmentation Technique of memory management.
14. Implement Threading & Synchronization Applications for Reader Writer Problem.
15. Study of Mimix Operating System.

TOTAL: 45 PERIODS

OUTCOMES:

 Students will execute UNIX commands and perform shell programs masterfully .
 Students will demonstrate the CPU scheduling algorithms and file allocation strategies.
63
  Students will experiment performance of the various page replacement algorithms
 Students will implement semaphore to illustrae process synchronization concept and
examine the deadlock procedures.
 Students will be able to create process and implement inter process communication
techniques to achieve employability.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

 Standalone desktops with C / C++ / Java / Equivalent complier 30 Nos.

(or)
 Server with C / C++ / Java / Equivalent complier supporting 30 terminals

64
CS18412 COMPUTER NETWORKS LABORATORY L T P C
0 0 3 1.5
OBJECTIVES
 Learn socket programming.
 Be familiar with simulation tools.
 Have hands on experience on various networking protocols
LIST OF EXPERIMENTS
1. Write a program to implement A. bit stuffing B. CRC.
2. Study of Socket Programming and Client – Server model
3. Applications using TCP Sockets a. Date and Time server & client b. Echo server &
client, etc c. Chat
4. Applications using UDP Sockets a. DNS
5. Simulation of Stop and Wait Protocol and Sliding Window Protocol.
6. Simulation of ARP /RARP protocols.
7. Simulation of PING and TRACEROUTE commands
8. Write a program to implement RMI (Remote Method Invocation)
9. Write a program to implement subnetting and find the subnet for a given IP.
10. Using Cisco Packet Tracer, do the following a). Establish a Local Area Network (LAN)
with 4 hosts and a switch/Hub b). Connect two LANs using multi-router topology with
static routes
11. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms
using NS
12. Perform a case study about the following routing algorithms to select the network path
with its optimum and economical during data transfer.
i. Link State routing protocol
ii. Distance vector routing protocol
TOTAL: 45 PERIODS
OUTCOMES:
 Students will be able to demonstrate various simulation tools
 Students will be able to gain the knowledge to implement various protocols.
 Students will be able to analyze the performance of the protocols in different layers.
 Students will be able to apply the knowledge of various routing algorithms in data.
 Students will be able to understand the major software and hardware technologies used
on computer networks.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
 C / C++ / Java / Equivalent Compiler 30 Network simulator like
NS2/Glomosim/OPNET/ Equivalent

65
CS18413 SOFTWARE ENGINEERING LABORATORY L T P C
0 0 3 1.5
OBJECTIVES
 To understand the software engineering methodologies for project development.
 To gain knowledge about open source tools for Computer Aided Software Engineering.
 To develop an efficient software using case tools.
LIST OF EXPERIMENTS
Academic domain
1. Course Registration System
2. Student marks analyzing system
Railway domain
3. Online ticket reservation system
4. Platform assignment system for the trains in a railway station
Medicine domain
5. Expert system to prescribe the medicines for the given symptoms
6. Remote patient monitoring
Finance domain
7. ATM system
8. Inventory maintenance
Human Resource Management
9. Quiz System
10. E-mail Client system.
E-Commerce
11.Online shopping and order tracking (E-shopping)
12. Automated online assistant.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:

 Student will be able to recognize the software engineering methodologies for project
development
 Student will be able to gain knowledge about open source tools for Computer Aided
Software Engineering
 Student will be able to develop efficient software using case tools
 Student will be able to perform unit testing and integration testing.
 Student will be able to apply various white box and black box testing techniques

66
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

SOFTWARE : Argo UML / StarUML / UMLGraph / Topcased or Equivalent.

HARDWARE: Standalone desktops 30 Nos.

67
 USER INTERFACE TECHNOLOGIES L T P C
CS18501
(COMMON TO CS & IT) 3 1 0 4
OBJECTIVES
 To understand the concepts and architecture of the World Wide Web
 To understand and practice Markup Language
 To understand Embedded Dynamic Scripting on Client-side Internet Programming
 To understand and practice NoSQL MongoDB Database
 To understand and practice Server-side JS Framework
UNIT I INTRODUCTION TO WWW 9+3
Introduction to Computer networks - Internet Standards – Introduction to WWW – WWW Architecture
– SMTP – POP3 – File Transfer Protocol - Overview of HTTP, HTTP request – response – Generation
of dynamic web pages.

UNIT II UI DESIGN 9+3

HTML5: What is HTML5 - Features of HTML5 – Semantic Tags – New Input Elements and tags -
Media tags (audio and video tags) – Designing Graphics using Canvas API - Drag and Drop features –
Geolocation API - Web storage (Session and local storage).

CSS3: What is CSS3 –Features of CSS3 – Implementation of border radius, box shadow, image
border, custom web font, backgrounds - Advanced text effects(shadow) - 2D and 3D Transformations -
Transitions to elements - Animations to text and elements

UNIT III INTRODUCTION TO JAVASCRIPT 9+3

Introduction - Core features - Data types and Variables - Operators, Expressions and Statements -
Functions & Scope - Objects - Array, Date and Math related Objects - Document Object Model - Event
Handling –Browser Object Model - Windows and Documents - Form handling and validations.
Object-Oriented Techniques in JavaScript - Classes – Constructors and Prototyping (Sub classes and
Super classes) – JSON –Introduction to AJAX – Introduction to jQuery

UNIT IV INTRODUCTION TO NOSQL DATABASE - MONGODB 9+3

What is NoSQL Database - Why to Use MongoDB - Difference between MongoDB& RDBMS -
Download & Installation - Common Terms in MongoDB – Implementation of Basic CRUD Operations
using MongoDB

UNIT V INTRODUCTION TO SERVER-SIDE JS FRAMEWORK – NODE.JS 9+3

Introduction - What is Node JS – Architecture – Feature of Node JS - Installation and setup - Creating
web servers with HTTP (Request & Response) – Event Handling - GET & POST implementation -
Connect to NoSQL Database using Node JS – Implementation of CRUD operations.
TOTAL (L:45 T:15): 60 PERIODS

68
OUTCOMES:
 Students will develop the concepts of concepts and architecture of the World Wide Web.
 Students will need to analyse NoSQL Database CURD operations and to acquire knowledge
about Server-side.
 Students will be able to the interface Client-side validation using scripting languages and Open
source JavaScript libraries.
 Students will be to accomplish and explore markup languages features and create interactive
web pages using them.
 Students will be able to develop the knowledge about functionalities of Client-side and Server-
side JS frameworks.

TEXT BOOKS:

1. Web Technologies-A Computer Science Perspective-Jeffrey C. Jackson, 4th Edition, 2007

2. Amol Nayak, “MongoDB Cookbook ” , Second Edition, Packt Publishing, 2016
3. Krasimir Tsonev, “Node.js by Example”, Packt Publishing, 2015

REFERENCES:

1. An Introduction to web development and Programming- Michael Mendez Suny Fredonia, 2014
2. David Flanagan, “JavaScript: The Definitive Guide, Sixth Edition”, O'Reilly Media, 2011
3. Sandro Pasquali, “Mastering Node.js”, First Edition, Packt Publishing,2013.
4. Kristina Chodorow, “MongoDB : The Definitive Guide”, Second Edition, O' Reilly
Publications, 2013.
5. Matt Frisbie, “Angular 2 Cookbook”, First Edition, Packt Publishing, 2017.

69
 MOBILE COMPUTING L T P C
IT18502
(COMMON TO IT & CS) 3 1 0 4
OBJECTIVES
 To understand the fundamentals of mobile computing
 To infer knowledge about the various technologies used in mobile communication
 To learn about development environment used in Mobile devices

UNIT I INTRODUCTION 9+3

Mobility of bits and bytes, Beginning of wireless, Mobile computing, Dialogue control,
Networks, Middleware and gateway, Application and services, Developing mobile computing
application, Security in mobile computing, Standards, Mobile computing architecture, Mobile
computing through telephony.

UNIT II WIRELESS TECHNOLOGIES 9+3

Bluetooth, RFID, WIMAX, Mobile IP, GSM,GPRS,CDMA, 3G,4G and 5G networks.

UNIT III WIRELESS LAN AND INTELLIGENT NETWORKS 9+3

Introduction-Advantages, IEEE 802.11 standards, Architecture, Mobility, Deploying wireless
LAN, Mobile Ad hoc and Sensor network, Security, Wireless access in vehicular environment,
Wireless local loop, Hyper LAN, Wi-Fi versus 3G,Wireless Application Protocol,
Fundamentals of call Processing, Intelligence in networks,SS#7 signaling, IN conceptual
model, soft switch, programmable networks, Technologies and interfaces for IN,SS7 security,
MAPsec, Virtual Private Network.

UNIT IV COMPUTING IN MOBILE ENVIRONMENT 9+3

Client Programming, Programming for palm OS, Wireless device with Symbian OS, J2ME,
Wireless device with Windows CE, Wireless device with Android OS.

UNIT V APPLICATIONS 9+3

Voice over Internet and Convergence, SMS, CODEC, Networked Multimedia Applications,
Issues in Multimedia delivery over the internet, Multimedia Networking Protocols, Security
issues in mobile computing, Next generation networks,
APP DEVELOPMENT : Native, Hybrid, Android Application development - SDK, Features
of SDK, Android Application Components, software stack structure.

TOTAL (L:45 T:15): 60 PERIODS

70
OUTCOMES:
Upon completion of this course, the students will be able :
 Interpret the working characteristics and limitations of mobile hardware devices
including their user-interface modalities.
 Choose the suitable technologies for appropriate mobile communication.
 Summarize the various wireless LAN technologies.
 Assess the development environment used in mobile devices.
 Develop applications that are mobile-device specific.

TEXT BOOKS:
1. Asoke Talukder, Hasan Ahmed and Roopa R yavagal “Mobile computing Technology,
Application and service creation”, Second edition, McGraw Hill, 2010.
2. Jochen Schiller, “Mobile Communications”, Second Edition, Pearson, 2004.

REFERENCES:
1. “Beginning for Android 4 Application Development “, Wei Meng Lee, Wiley –India
Edition, 2012.
2. Zigurd Mednieks, Laird Dornin, G, Blake Meike and Masumi Nakamura,
“Programming Android”, O‟Reilly, 2011.

71
 L T P C
CS18502 DATA MINING AND DATA WAREHOUSING
3 1 0 4
OBJECTIVES
 To understand data warehouse concepts, architecture, business analysis and tools
 To understand data pre-processing and data visualization techniques
 To study algorithms for finding hidden and interesting patterns in data
 To understand and apply various classification and clustering techniques using tools.
 Master data mining techniques in various applications like social, scientific and environmental
context.
UNIT I DATA WAREHOUSING & MODELING 9+3
Basic Concepts: Data Warehousing: A multitier Architecture, Data warehouse models: Enterprise
warehouse, Data mart and virtual warehouse, Extraction, Transformation and loading, Data Cube: A
multidimensional data model, Stars, Snowflakes and Fact constellations: Schemas for
multidimensional Data models, Dimensions: The role of concept Hierarchies, Measures: Their
Categorization and computation, Typical OLAP Operations.

UNIT II DATA WAREHOUSE IMPLEMENTATION& DATA MINING 9+3

Efficient Data Cube computation: An overview, Indexing OLAP Data: Bitmap index and join index,
Efficient processing of OLAP Queries, OLAP server Architecture ROLAP versus MOLAP Versus
HOLAP. : Introduction: What is data mining, Challenges, Data Mining Tasks, Data: Types of Data,
Data Quality, Data Preprocessing, Measures of Similarity and Dissimilarity.

UNIT III ASSOCIATION ANALYSIS 9+3

Association Analysis: Problem Definition, Frequent Item set Generation, Rule generation. Alternative
Methods for Generating Frequent Item sets, FP-Growth Algorithm, Evaluation of Association
Patterns.

UNIT IV CLASSIFICATION 9+3

Decision Trees Induction, Method for Comparing Classifiers, Rule Based Classifiers, Nearest
Neighbor Classifiers, Bayesian Classifiers.

UNIT V CLUSTERING ANALYSIS 9+3

Overview, K-Means, Agglomerative Hierarchical Clustering, DBSCAN, Cluster Evaluation, Density-
Based Clustering, Graph- Based Clustering, Scalable Clustering Algorithms.

TOTAL (L:45 T:15): 60 PERIODS

72
OUTCOMES:
 Students will be able to understand data warehouse concepts, architecture, business analysis
and tools.
 Students will be able to understand data pre- processing and data visualization techniques
 Students will be able to study algorithms for finding hidden and interesting patterns in data
using association algorithms
 Students will be able to apply various classification and clustering techniques using tools
 Students will be mastering the data mining techniques in various applications like social,
scientific and environmental context

TEXT BOOKS:
1. Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques, Third Edition,
Elsevier, 2012.

REFERENCE BOOKS:
1. Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP‖, Tata
McGraw – Hill Edition, 35th Reprint 2016.
2. K.P. Soman, Shyam Diwakar and V. Ajay, ―Insight into Data Mining Theory and Practice,
Eastern Economy Edition, Prentice Hall of India, 2006.
3. Ian H.Witten and Eibe Frank, ―Data Mining: Practical Machine Learning Tools and
Techniques, Elsevier, Second Edition.

73
CS18503 THEORY OF COMPUTATION L T P C
3 1 0 4
OBJECTIVES
The student should be made to:
 Understand the various Computing models like Finite State Machine, Pushdown Automata,
and Turing Machine.
 Learn the various equivalences of Computing Models.
 Learn Formalism, regular expressions and types of grammars.
 Understand the Simplification methods and Normal Forms for grammars.
 Understand equivalence and various properties of the computing models Be aware of
Decidability and Un-decidability of various problems.

UNIT I FINITE AUTOMATA 9+3

Basic Mathematical Notation and Techniques - Introduction to Formal Proofs - If-then proofs-If and
only if proofs- Proving equivalences about sets- Proof by contradiction and contrapositive – Inductive
proofs - Central concepts of Automata – Finite Automata (FA) –Deterministic Finite Automata (DFA)
– Non-deterministic Finite Automata (NFA) – Equivalence of NFA and DFA – Applications of
Automata- Finite Automata with Epsilon transitions- Equivalence of NFA’s with and without Epsilon
transitions- Equivalence of Epsilon NFA and DFA.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9+3

Regular expressions – Algebraic laws for Regular Expressions - Equivalence of Finite Automaton
and Regular expressions – Converting DFA’s to Regular expression – Converting Regular expression
to Automata- Applications of Regular Expressions. Properties of Regular Languages -Pumping
Lemma for Regular languages – Closure properties of Regular languages – Equivalence and
Minimization of Automata.

UNIT III CONTEXT FREE GRAMMARS AND PUSHDOWN 9+3

AUTOMATA
Introduction to Grammar–– Types of Grammar- Context Free Grammars -Derivations and Languages
-Parse Trees– Relationship between derivations, recursive inference and parse trees- Applications of
CFG- Ambiguity in Grammars and Languages. Pushdown Automata- Definitions – Moves –
Instantaneous Descriptions – Languages of PDA -Equivalence of Pushdown automata and CFG-
Deterministic Pushdown Automata.

UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES AND 9+3

TURING MACHINES
Simplification of CFG – Elimination of Null productions - Unit productions - Useless symbols –
Chomsky Normal Form (CNF) – Greibach Normal Form (GNF)- Pumping lemma for CFL- Closure

74
properties of CFL. Definitions of Turing Machines –Programming Techniques for Turing machine –
Multi head, Multi tape and Non Deterministic Turing Machines - The Halting problem – Chomskian
hierarchy of languages.

UNIT V UNDECIDABILITY 9+3

Recursive and recursively enumerable languages - A language that is not Recursively Enumerable –
An undecidable problem that is RE- Undecidable problems about Turing Machine – Post’s
Correspondence Problem –The classes P and NP - NP completeness -Polynomial time reductions-
Tractable and Intractable problems - Case Studies - L-systems - Cellular Automata -DNA Computing
- Membrane Computing.
TOTAL (L:45 T:15): 60 PERIODS
OUTCOMES:
 The student will be able to design and build Finite Automata
 The student will be able to skillfully demonstrate and solve problems on regular expressions
and regular languages.
 The student can formulate and design Pushdown Automata for the given context free
languages and context free grammars
 The student can design and construct the Turing machine for pattern matching and
computation of basic integer functions
 The student will be able to infer the limitations of computers, interpret the answer to what kind
of problems can be computed and what cannot be computed by a computer

TEXT BOOKS:
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages
and Computations”, second Edition, Pearson Education, 2007.

REFERENCES:
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”, Second
Edition, Pearson Education, 2003.
2. Thomas A. Sudkamp,” An Introduction to the Theory of Computer Science, Languages and
Machines”, Third Edition, Pearson Education, 2007.
3. Raymond Greenlaw an H.James Hoover, “ Fundamentals of Theory of Computation,
Principles and Practice”, Morgan Kaufmann Publishers, 1998.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.
5. J. Martin, “Introduction to Languages and the Theory of computation” Third Edition, Tata Mc
Graw Hill, 2007
6. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition, Narosa
Publishers, New Delhi, 2002.
7. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory and
Computation”, Pearson Education 2009.
8. Hopcroft J.E., and Ullman J.D, “Introduction to Automata Theory, Languages and
75
Computations”, First Edition, Pearson Education, 2008.

76
 USER INTERFACE TECHNOLOGIES L T P C
CS18511 LABORATORY
0 0 4 2
(COMMON TO CS & IT)

OBJECTIVES
 Be familiar with Web page design using HTML 5 and style sheets CSS 3
 Be exposed to creation of user interfaces using Java frames and applets.
 Learn to create dynamic web pages using server side scripting.
 Be familiar with the frameworks JSP Strut, Hibernate, Spring
 Be familiar with the NOSQL database and its installation process
 Be exposed in Client Server applications along with NodeJS installation and Setup
List of Experiments
Implement The Following: Webpage Concepts
1. Create a web page with the following using HTML
a. To embed a map in a web page
b. To fix the hot spots in that map
c. Show all the related information when the hot spots are clicked.
2. Create a web page with the following.
a. Cascading style sheets.
b. Embedded style sheets.
c. Inline style sheets. Use our college information for the web pages.
3. Create and save an XML document at the server, which contains 10 users Information.
a. Write a Program, which takes user Id as an input and returns the User details by
taking the user information from the XML document.
SockeTypeScript & Servlets
4. Write programs in Java using sockets to implement the following:
a. HTTP request
b. FTP
c. SMTP
d. POP3
5. Write a program in Java for creating simple chat application with datagram sockets and
datagram packets.

77
 6. Write programs in Java using Servlets:
a. To invoke servlets from HTML forms
b. To invoke servlets from Applets
7. Write programs in Java to create three-tier applications using servlets for conducting on-line
examination for displaying student mark list. Assume that student information is available
in a database which has been stored in a database server.
8. NoSQL and MongoDB :
What is the corresponding relational concept for each of these terms (e.g., “schema” or
”table”). Not any important differences:
 Collection
 document
 field
 index
9. In MongoDB, how do you define a selection operation and projection
10. How does mongodb store data - that is, what is the name of the file format of documents?
Relational DBs define many-to-one relationships by defining distinct relationship tables
(e.g., an Enrollee table encodes the many-to-many relationship between Courses and
Students).
11. How does MongoDB use arrays/embedded docs to handle many-to-one relationships?

12. Set up a project using Node.js and NPM

13. Using the Data in HTML and Check your data types
14. Adding Handshaking (Call-and-Response)
15. Connecting from the Browser to the Node Program

Total Hours 60
OUTCOMES:
At the end of the course, the student should be able to:
 Students will develop the concepts of Web pages using HTML/XML and style sheets.
 Students will need to interfaces using Java frames and applets.
 Students will be able to the interface dynamic web pages using server side scripting.
 Students will be to accomplish the various functions frameworks JSP Strut, Hibernate, Spring.
 Students will be able to develop the applications with AJAX.

78
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
SOFTWARE:
 Java, Dream Weaver or Equivalent, MySQL or Equivalent, Apache Server, IDE: Eclipse Neon
 Editor: Notepad++, Browsers :IE, Chrome, Mozilla Firefox browsers (Latest Version),
NodeJS (Latest Version)
 MongoDB (Latest Version)
 jQuery and Twitter Bootstrap Library Files
 Windows 8 or 10 (or higher)

HARDWARE:
 Standalone desktops 30 Nos
 Pentium P5, 3 GHz or higher
 8 GB (or higher) RAM, 100 GB (or higher) HD

79
 MOBILE APPLICATION DEVELOPMENT L T P C
CS18512
LABORATORY 0 0 4 2
OBJECTIVES
 To learn the basics of mobile application development
 To get accustomed to Android platform
 To develop skills in developing basic Android applications

List of Experiments
1. Install the Android SDK and developer tools and build a test project to confirm that those
tools are properly installed and configured.
2. Develop an application that uses GUI components, Font and Colours
3. Develop an application that uses Layout Managers and event listeners.
4. Develop a native calculator application.
5. Write an application that draws basic graphical primitives on the screen.
6. Develop an application that makes use of database.
7. Implement an application that implements Multithreading.
8. Develop a native application that uses GPS location information.
9. Implement an application that writes data to the SDcard.
10. Implement an application that creates an alert upon receiving a message.
11. Mini Project.

Suggested list of Projects:

1. Secure Digi Locker Application
2. Android Campus Recruitment System
3. Automated Canteen Ordering System using Android
4. Android Customer Relationship Management System
5. Android Employee Tracker
6. Android Graphical Information System
7. Smart Health Consulting Android System
8. Android Based Universal Ticketing Project
9. Android Civil Administration Reporting Project
10. Student Faculty Document Sharing Android Project
11. Android Patient Tracker

TOTAL: 60 PERIODS

OUTCOMES:
 Students will be able to identify the requirements of mobile application development
 Students can be able to develop an application using GUI components.
 Students will be able to develop basic Android applications
80
  Students will be able to develop and implement various mobile applications using emulators
 Students acquires knowledge to deploy the applications to hand-held devices.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

SOFTWARE:
Android SDK

HARDWARE:
 Standalone desktops 30 Nos
 Pentium P5, 3 GHz or higher
 8 GB (or higher) RAM, 100 GB (or higher) HD
 Windows 8 or 10 (or higher)

81
 INTERVIEW AND CAREER SKILLS L T P C
HS18561 LABORATORY 0 0 3 2
(Common to all branches except BT and EE)
OBJECTIVES
 To enable learners to build confidence and enhance their language proficiency.
 To expose learners to the use of professional English.
 To equip them with employability skills.
 To expose learners to build entrepreneurship skills.

UNIT I LISTENING AND SPEAKING SKILLS 12

Conversation Skills – Types - Small Talk, Face-to-Face and Telephonic, Formal and Informal
Conversations – Skills in presenting ideas and collating information during Conference Calls
(one –to-one and technical group / team) – Academic and Workplace Situations – Conversing
with Faculty/Visiting Faculty/Guests/Officials/Employers and Employees – Group
Discussion – Etiquette and Dos and Don’ts, Turn-taking –Presentation Skills – Seminars and
Projects using Digital Tools; Mock Interview – Etiquette and Dos and Don’ts – Audio-Visual
interface for enhancement of Listening and Speaking Skills.

UNIT II READING / SPEED READING, CRITICAL THINKING AND 12

WRITING SKILLS
Reading Comprehension – General and Scientific Texts/Articles/Case Studies from different
or relevant fields of study for analysis and critical thinking; Employability Skills – Writing
Job Applications – Cover Letter accompanying Résumé – Types of Business Letters and
Email Writing and Etiquette; Writing Reports – Statement of Purpose – Writing Articles for
Publication Style and Format – Creating Blogs or Company Profiles – Speed Reading of
Voluminous Reports / Documents and Exacting Necessary Information and Abstract
Preparation including Dissemination.

UNIT III ENGLISH FOR PROFESSIONAL EXAMINATIONS 12

Sentences, Paragraphs and Reading Comprehension – Vocabulary Building – General and
Technical Terms – Contextual Meaning – Spelling – Subject-Specific Words – Usage and
User-Specific Terminology.

UNIT IV ENTREPRENEURSHIP SKILLS 9

Introduction to Entrepreneurship; Developing Leadership Qualities and Team Work; Goal

Setting and Real-Life Scenarios; Fundamentals of Entrepreneurial Skills – Marketing
Strategies - Microcosmic and Macrocosmic Levels of Product Sales and Survey – Sector /
Industry Appraisal and Appreciation (Review and Understanding State of the Nation /
82
Economy / Environment / Sector Reports Published) - Interaction & Understanding Role of
Multi-Lateral Financial / Institutional / Industrial Agencies such as World Bank, ADB,
UNDP, CII etc.

TOTAL (L:45): 45 PERIODS

TEACHING METHODS:
1. To be totally learner-centric with minimum teacher intervention as the course
revolves around practice.
2. Suitable audio/video samples from Podcast/YouTube to be used for illustrative
purposes.
3. Portfolio approach for writing to be followed. Learners are to be encouraged to
blog, tweet, text and email employing appropriate language.
4. GD/Interview/Role Play/Debate could be conducted off the laboratory (in a regular
classroom) but learners are to be exposed to telephonic interview and video
conferencing.
5. Learners are to be assigned to read/write/listen/view materials outside the
classroom as well for gaining proficiency and better participation in the class.
6. Learners to form team(s), select a module of external Industrial / Institutional
interaction and prepare a short thesis/project proposal.

OUTCOMES:

At the end of the course, learners should be able to

 Take international examination such as IELTS and TOEFL
 Make presentations and Participate in Group Discussions.
 Successfully answer questions in interviews

References:
1. Business English Certificate Materials, Cambridge University Press.
2. Graded Examinations in Spoken English and Spoken English for Work
downloadable materials from Trinity College, London.
3. International English Language Testing System Practice Tests, Cambridge
University Press.
4. Interactive Multimedia Programs on Managing Time and Stress.
5. Personality Development (CD-ROM), Times Multimedia, Mumbai.

83
WEB SOURCES:
http://www.slideshare.net/rohitjsh/presentation-on-group- discussion
http://www.washington.edu/doit/TeamN/present_tips.html
http://www.oxforddictionaries.com/words/writing-job- applications
http://www.kent.ac.uk/careers/cv/coveringletters.htm
http://www.mindtools.com/pages/article/newCDV_34.html

84
CS18601 ARTIFICIAL INTELLIGENCE L T P C
3 1 0 4
OBJECTIVES

The student should be made to:

 Study the basic concepts of Artificial Intelligence and Production Systems
 Learn about knowledge representation and inferencing for various logic
 Know about Game Playing concepts for toy problems
 Introduce the concepts of Learning.
 Learn about various Expert Systems

UNIT I INTRODUCTION TO Al AND PRODUCTION SYSTEMS 9+3

Introduction to AI, Problem formulation - Production systems, Problem Characteristics,
Production System Characteristics, Heuristic Search Techniques – Hill Climbing, Best-First
Search, Problem Reduction, Constraint satisfaction, Means-ends analysis

UNIT II KNOWLEDGE REPRESENTATION AND INFERENCING 9+3

Knowledge Representation Issues, Using Predicate logic, Weak Slot-and-Filler Structures –
Semantic Nets, Frames, Strong Slot-and Filler Structures – Scripts, Statistical Reasoning –
Bayes’ Theorem, Certainty Factors and Rule-based Systems, Bayesian Networks, Dempster-
Shafer theory, Fuzzy Logic

UNIT III GAME PLAYING AND PLANNING 9+3

Game Playing – Minimax Search Procedure, Adding Alpha-beta Cutoffs, Planning – The Blocks
World, Components of a Planning System, Goal Stack Planning, Hierarchical Planning

UNIT IV LEARNING 9+3

Learning – Introduction, Rote Learning, Learning by Taking Advice, Learning in Problem-
Solving, Induction, Explanation-based Learning, Discovery, Analogy, Formal Learning Theory,
Neural Net Learning and Genetic Learning, Genetic Algorithms

UNIT V EXPERT SYSTEMS 9+3

Expert systems - Architecture of Expert systems, Roles of expert systems - Knowledge
Acquisition – Meta knowledge, Heuristics. Typical expert systems - MYCIN, DART, XCON,
Expert systems shells

TOTAL (L:45 T:15): 60 PERIODS

85
OUTCOMES:
At the end of the course, the student should be able to:
 Students will be able to identify problems that are amenable to solution by AI methods.
 Students will be able to identify appropriate AI methods to solve a given problem.
 Students will be able to formalize a given problem in the language/framework of different AI
methods.
 Students will be able to implement basic AI algorithms
 Students will be able to design and carry out an empirical evaluation of different algorithms
on a problem formalization, and state the conclusions that the evaluation supports

TEXT BOOKS:
1. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, McGraw Hill- 2008

REFERENCES:
1. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007
2. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson Education, 2007.
3. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education
2007.
4. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013.
5. http://nptel.ac.in

86
 L T P C
CS18602 COMPILER DESIGN
3 1 0 4
OBJECTIVES:
 To learn the design principles of Compiler.
 To learn the various parsing techniques.
 To understand the different levels of translation.
 To learn how to effectively generate, machine codes.
 To apply the techniques to optimize the generated machine codes.

UNIT I INTRODUCTION TO COMPILERS 9+3

Translators-Compilation and Interpretation-Language processors -The Phases of Compiler-Errors
Encountered in Different Phases-The Grouping of Phases-, Interpretation, Bootstrapping, Data structures
in compilation-Compiler Construction Tools .

UNIT II LEXICAL ANALYSIS 9+3

Need and Role of Lexical Analyzer - Lexical Errors - Expressing Tokens by Regular Expressions -
Language for Specifying Lexical Analyzers – LEX - Structure of LEX Specification – LEX library -
Regular Expressions in LEX - Design of Lexical Analyzer for a sample Language.

UNIT III SYNTAX ANALYSIS 9+3

Need and Role of the Parser-Context Free Grammars -Top Down Parsing -General Strategies- Recursive
Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce Parser-LR Parser - LR (0)Item- Construction
of SLR Parsing Table -Introduction to LALR Parser – Error Handling and Recovery in Syntax Analyzer-
YACC-Structure of YACC Grammar- Actions – Ambiguity and Conflicts- YACC library – Tokens in
YACC-Design of a syntax Analyzer for a Sample Language.

UNIT IV SYNTAX DIRECTED TRANSLATION & RUN TIME ENVIRONMENT 9+3

Syntax directed Definitions - Construction of Syntax Tree - Bottom-up Evaluation of S-Attribute
Definitions- Design of predictive translator – Type Systems-Specification of a simple type checker.
RUN-TIME ENVIRONMENT: Source Language Issues - Storage Organization - Storage Allocation
Parameter Passing-Symbol Tables-Dynamic Storage Allocation.

UNIT V CODE OPTIMIZATION AND CODE GENERATION 9+3

Principal Sources of Optimization-DAG- Optimization of Basic Blocks-Global Data Flow Analysis-
Efficient Data Flow Algorithms-Issues in Design of a Code Generator – A Simple Code Generator
Algorithm.

TOTAL (L:45 T:15): 60 PERIODS

87
OUTCOMES:
At the end of the course ,
 Students can understand the major phases of compilation.
 Students will gain the skill to design and implement a prototype of compiler.
 Students can identify the parsers and practice the experiments.
 Students can apply the various optimization techniques.
 Students can acquire knowledge about different compiler construction tools.

TEXT BOOKS:

1. Alfred Aho, Ravi Sethi and Jeffrey D Ullman, “Compilers Principles, Techniques and Tools”,
Second Edition, Pearson Education, 2013.

REFERENCES:

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. Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, Pearson Education, 2008.

88
CS18603 CRYPTOGRAPHY AND NETWORK SECURITY L T P C
3 1 0 4
OBJECTIVES
 Understand OSI security architecture, Classical Encryption techniques and acquire
fundamental knowledge on the concepts of finite fields and number theory.
 Understand various Private and Public Key cryptographic algorithms.
 To learn about hash functions and digital signature algorithms.
 Understand about Authentication Applications and System Security
 Acquire knowledge in various network security models
UNIT I INTRODUCTION & NUMBER THEORY 9+3
Services, Mechanisms and attacks-the OSI security architecture- FINITE FIELDS AND
NUMBER THEORY: Groups, Rings, Fields-Modular arithmetic-Euclid‟s algorithm-Finite fields-
Polynomial Arithmetic–Prime numbers-Fermat‟s and Euler‟s theorem – Testing for primality -
The Chinese remainder theorem- Discrete logarithms. Network security model-Classical Encryption
techniques (Symmetric cipher model, substitution techniques, transposition techniques,
steganography).

UNIT II PRIVATE & PUBLICKEYCRYPTOGRAPHY 9+3

Simplified DES - Data Encryption Standard(DES)-Block cipher principles - Double DES- Triple
DES -Advanced Encryption Standard (AES)- Blowfish-RC5 algorithm- block cipher modes of
operation. Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-
Key management - Diffie Hellman Key exchange - Elliptic curve cryptography – Diffie and
Hellman key exchange using Elliptical Curve – Elgamal Cryptosystem using ECC.

UNIT III HASH FUNCTIONS ANDDIGITAL SIGNATURES 9+3

Authentication requirement – Authentication function – MAC – Hash function – Security of hash
function and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication
protocols: DSS – EI Gamal – Schnorr – RSA- Elliptical curves- NIST Digital Signature
Algorithms.

UNIT IV SECURITY PRACTICE &SYSTEMSECURITY 9+3

Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for
Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall
designs - SET for E-Commerce Transactions. Intruder – Intrusion detection system – Virus and
related threats – Countermeasures – Firewalls design principles – Trusted systems – Secured
Coding - OWASP/SANS Top Vulnerabilities.

89
UNIT V E-MAIL, IP &WEBSECURITY 9+3
E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys
privacy-authentication of the Source-Message Integrity-Non-Repudiation-Pretty Good Privacy-
S/MIME. IPSecurity: Overview of IPSec - IP and IPv6-Authentication Header-Encapsulation
Security Payload (ESP)-Internet Key Exchange (Phases of IKE, ISAKMP/IKE Encoding). Web
Security: Secure Socket layer & Transport Layer Security.
TOTAL (L:45 T:15): 60 PERIODS

OUTCOMES:
 Students will be able to compare various Encryption techniques
 Students will be able to solve problems in polynomial arithmetic and Algebraic
Structures
 Students will be able to compare various Digital Signature algorithms
 Students will able to explain the concepts of IP security
 Students will be able to design secure web applications

TEXT BOOKS:
1. William Stallings, Cryptography and Network Security, 6 th Edition, Pearson
Education, September 2016.
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall
of India, 2002.

REFERENCES:
1. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill, 2007.
2. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and
Protocols”, Wiley Publications, 2003.

3. Charles Pfleeger, “Security in Computing”, 4 th Edition, Prentice Hall of India, 2006.

4. Ulysess Black, “Internet Security Protocols”, Pearson Education Asia, 2000.

90
GE18054 PROFESSIONAL ETHICS L T P C
(Common to CE, CS, EE, EC, IT and MR) 3 0 0 3
OBJECTIVES:
 To enable the students to create an awareness on Engineering Ethics and Human Values,
to instill Moral and Social Values and Loyalty and to appreciate the rights of others.

UNIT I HUMAN VALUES 10

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 –
Introduction to Yoga and meditation for professional excellence and stress management

UNIT II ENGINEERING ETHICS 9

Senses of ‘Engineering Ethics’ – Variety of moral issues – Types of inquiry – Moral

dilemmas – Moral Autonomy – Kohlberg’s theory – Gilligan’s theory – Consensus and
Controversy – Models of professional roles - Theories about right action – Self-interest –
Customs and Religion – Uses of Ethical Theories.

UNIT III ENGINEERING AS SOCIAL EXPERIMENTATION 9

Engineering as Experimentation – Engineers as responsible Experimenters – Codes of Ethics

– A Balanced Outlook on Law.

UNIT IV SAFETY, RESPONSIBILITIES AND RIGHTS 9

Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis and Reducing Risk
- Respect for Authority – Collective Bargaining – Confidentiality – Conflicts of Interest –
Occupational Crime – Professional Rights – Employee Rights – Intellectual Property Rights
(IPR) – Discrimination.

UNIT V GLOBAL ISSUES 8

Multinational Corporations – Environmental Ethics – Computer Ethics – Weapons

Development – Engineers as Managers – Consulting Engineers – Engineers as Expert
Witnesses and Advisors – Moral Leadership –Code of Conduct – Corporate Social
Responsibility.
TOTAL: 45 PERIODS

91
OUTCOMES:
On completing this course, the students will be able to

 Summarise the importance of core values that shape the ethical behaviour of a
professional
 Apply ethical theories in controversial issues while playing the role of engineering
Professionals
 Solve moral and ethical problems through exploration and assessment by established
experiments and relate the code of ethics to social experimentation.
 Enumerate the importance of safety, responsibilities and rights of an engineer at
work place
 Explain the ethical attributes of engineers in various roles and in different domains of
engineering in the global context
TEXT BOOKS:
1. Mike W. Martin and Roland Schinzinger, “Ethics in Engineering”, Tata McGraw
Hill, New Delhi, 2015.
2. Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice
Hall of India, New Delhi, 2004.

REFERENCES:
1. Charles B. Fleddermann, “Engineering Ethics”, Pearson Prentice Hall, New
Jersey, 2012.
2. Charles E. Harris, Michael S. Pritchard and Michael J. Rabins, “Engineering
Ethics – Concepts and Cases”, Cengage Learning, 2012
3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New
Delhi, 2017
4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists
and Engineers”, Oxford University Press, Oxford, 2008.
5. Laura P. Hartman and Joe Desjardins, “Business Ethics: Decision Making for
Personal Integrity and Social Responsibility” Mc Graw Hill education, India Pvt.
Ltd.,New Delhi, 2013.
6. World Community Service Centre, ‘ Value Education’, Vethathiri publications,
Erode, 2011.

Web sources:
1. www.onlineethics.org
2. www.nspe.org
3. www.globalethics.org
4. www.ethics.org

92
CS18604 MACHINE LEARNING TECHNIQUES L T P C
3 1 0 4
OBJECTIVES
 To understand the fundamental concepts of Machine learning techniques
 To enable the students to gain knowledge of parameter estimation methods
 To study the concepts of non-parameter estimation methods and dimensionality reduction
techniques.
 To understand various discriminative learning models
 To understand decision tree algorithm and schemes of combining models.

UNIT I INTRODUCTION 9+3

Overview of Machine Learning-Applications-Types of learning -Supervised learning-Classification,
Regression, Unsupervised learning, Reinforcement learning; Bayesian Decision Theory-Classification-
Losses and Risks- Discriminant Functions – Utility Theory, Learning Associations-Association Rules.

UNIT II PARAMETERIC METHODS 9+3

Maximum Likelihood Estimation-Bernoulli Density, Multinomial Density, Gaussian (Normal) Density;
Evaluating an Estimator-Bias and Variance, Bayes Estimator- Parametric Classification, Regression,
Tuning Model Complexity-Bias-Variance Dilemma- Model Selection Procedures.

UNIT III NON-PARAMETRIC METHODS AND DIMENSIONALITY 9+3

REDUCTION
Non parametric Density Estimation-Non parametric Classification - K-Nearest neighbor, Non
parametric Regression - Smoothing models ; Clustering - K-means –Hierarchical clustering –
Dimensionality reduction - Principal Component Analysis-Fisher Discriminant Analysis – Independent
Component Analysis.

UNIT IV DISCRIMINATIVE LEARNING MODELS 9+3

Logistic regression –Artificial neural networks- Perceptrons - Training a Perceptron-Learning Boolean
Functions - Multilayer Perceptrons - Back propagation Algorithm, Training Procedures and Tuning
Network Size; Kernel Machines - Optimal Separating Hyperplane - The Nonseparable Case: Soft
Margin Hyperplane - Kernel Trick .

UNIT V TREE MODELS AND COMBINING CLASSIFIERS 9+3

Decision trees – Classification trees - Regression trees –Pruning; Rule extraction from trees-Combining
Multiple Learners, Voting- Generating Diverse Learners-Model Combination Schemes-Voting-Error-
Correcting Output Codes-Random Forests-Bagging-Boosting-Mixture of Experts.

TOTAL (L:45 T:15): 60 PERIODS

93
OUTCOMES:
 Students will be able to understand the basic concepts of machine learning techniques
 Students will be able to apply the concepts of parameter estimation methods
 Students will be able to understand the design of various non parametric methods and
dimensionality reduction methods
 Students will be able to differentiate various discriminative learning methods and its
applications
 Students will be able to develop the tree models and mixture of experts.

TEXT BOOKS:
1. Ethem Alpaydin, Introduction to Machine Learning, Third Edition, MIT Press, 2014.

REFERENCES:
1. T. M. Mitchell, “Machine Learning”, McGraw Hill, 1997.
2. C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2007.

94
 L T P C
CS18611 COMPILER DESIGN LABORATORY
0 0 4 2
OBJECTIVES
 Be exposed to compiler writing tools.
 Learn to implement the different Phases of compiler
 Develop problem solving ability using programming.
 Be familiar with optimization techniques
 Designing a prototype of a compiler

LIST OF EXPERIMENTS

1. Implementation of Symbol Table.

2. Develop a lexical analyzer to recognize a few patterns in C.
(Ex. identifiers, constants, comments, operators etc.)
3. Implementation of Lexical Analyzer using Lex Tool.
4. Generate YACC specification for a few syntactic categories.
a) Program to recognize a valid arithmetic expression that uses operator +, - , * and /.
b) Program to recognize a valid variable which starts with a letter followed by any number
of letters or digits.
c) Implementation of Calculator using LEX and YACC .
5. Convert the BNF rules into YACC form and write code to generate Abstract Syntax Tree.
6. Implement Type Checking.
7. Implement control flow analysis and Data flow Analysis.
8. Implement any one storage allocation strategies. (Heap, Stack & Static)
9. Construction of DAG.
10. Implement the back end of the compiler which takes the three address code and produces the
8086 assembly language instructions that can be assembled and run using a 8086 assembler.
The target assembly instructions can be simple move, add, sub, jump. Also simple addressing
modes are used.
11. Implementation of Simple Code Optimization Techniques (Constant Folding, etc.)

TOTAL: 60 PERIODS

95
OUTCOMES:
At the end of the course,
 Students can implement the different phases of the compiler using tools.
 Students can understand the basic data structures used in compiler construction.
 Students can identify the control flow and data flow of a typical program.
 Students can develop an assembly language program equivalent to a source language
program.
 Students can utilize various compiler construction tools.
 Able to utilize various compiler construction tools.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
 Standalone desktops with C / C++ compiler and Compiler writing tools
(Or)
 Server with C / C++ compiler and Compiler writing tools (LEX and YACC) supporting
30 terminals or more.

96
CS18612 ARTIFICIAL INTELLIGENCE AND MACHINE L T P C
LEARNING LABORATORY 0 0 4 2
OBJECTIVES
The Student should be made to:
 Design and implement methods of solving problems using Artificial Intelligence.
 Implement various Expert Systems and machine learning strategies
 Understand the implementation of machine learning algorithms in python.
 Make use of appropriate data sets for implementing the machine learning algorithms.

LIST OF EXPERIMENTS
1. Implement any problem using uninformed search strategies given the initial state and Goal
state. Compare the performance of various uninformed search strategies in finding the
solution path to reach the goal state.
2. Implement any problem using Best first search strategies given the initial state, Goal state
and heuristic measure. Compare the performance of any one best first search using various
heuristic measures.
3. Implement any gaming problem using Mini-max and alpha beta pruning algorithms.
Compare the performance of Mini-max and Alpha Beta pruning in solving the considered
problem.
4. Implement using logic programming language and represent any given domain knowledge
in First Order Logic comprising of predicates, functions, relations and rules.
5. Implement using logic programming language and perform reasoning over the domain
knowledge to answer given query using either Forward chaining, Backward chaining or
resolution algorithm
6. Implement using logic programming language, i) represent the planning problem in STRIP
ii) perform Goal Stack planning to find the optimal solution.
7. Implement Naive Baye’s classification on real time dataset and evaluate its performance.
8. Implement Linear regression on real time dataset and evaluate its performance.
9. Implement K-Nearest Neighbor classification on real time dataset and evaluate its
performance.
10. Implement regularized logistic regression on real time dataset and evaluate its
performance.
11. Build model using Back Propagation Neural Network on real time dataset and evaluate its
performance.
12. Build a model using Decision trees on real time dataset and evaluate its performance.

TOTAL: 60 PERIODS

97
OUTCOMES:

At the end of the course, the student should be able to:

 Students will be able to implement basic AI algorithms to solve a given problem.
 Students will be able to solve the given AI problem using any language or framework
 Students will be able to implement various Machine Learning algorithms.
 Students will be able to apply the suitable Machine Learning algorithm for appropriate
datasets.
 Students will be able to evaluate the performance of Machine Learning algorithm for
any given dataset.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

SOFTWARE:
 Python / C++ / JAVA and Prolog

HARDWARE:
 Standalone desktops – 30 Nos. (or)
 Server supporting 30 terminals or more

98
CS18701 CLOUD COMPUTING AND VIRTUALIZATION L T P C
TECHNIQUES 3 0 0 3
OBJECTIVES
 To understand fundamentals of cloud computing
 To understand the cloud infrastructure
 Gain knowledge on the concept of virtualization that is fundamental to cloud computing
 To learn programming and software environments for cloud and big data
 To understand the security issues in cloud computing
UNIT I INTRODUCTION 9
Technologies for Network-Based System – System Models for Distributed and Cloud Computing – NIST
Cloud Computing Reference Architecture. Cloud Computing and Service Models:- Characteristics –
Cloud Services – Cloud models (IaaS, PaaS, SaaS) – Cloud ecosystem and enabling technologies.

UNIT II CLOUD INFRASTRUCTURE 9

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.

UNIT III VIRTUALIZATION 9

Introduction – Implementation Levels of Virtualization – Virtualization Structures/Tools and Mechanisms
– Virtualization of CPU, Memory, and I/O Devices – Virtual Cluster and Resource Management –
Virtualization for Data Center Automation

UNIT IV CLOUD PROGRAMMING AND SOFTWARE ENVIRONMENTS 9

Hadoop – Hadoop HDFS – Hadoop Map Reduce, Google - Google App Engine-GFS- BigTable -
Microsoft Azure - Open Source Eucalyptus and Nimbus - OpenNebula – OpenStack and Appliances.

UNIT V SECURITY 9
Security management in Peer-to-Peer networks – Peer trust and Reputation Systems – Trust overlay and
DHT implementation – Power Trust – Securing Overlays. Cloud Security and Trust Management –
Defense Strategies – Distributed Intrusion Detection – Data and Software Protection Techniques -
Reputation Guided Protection of Data Centers.

TOTAL (L:45): 45 PERIODS

99
OUTCOMES:
 The student will be able to describe the fundamentals of cloud computing
 The student will be able to explain the cloud infrastructure
 The student will be able to describe the concept of virtualization that is fundamental to cloud
computing
 The student will be able to identify the emerging cloud softwares
 The student will be able to identify the security issues in cloud computing

TEXT BOOKS:
1. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra, “Distributed and Cloud Computing: Clusters,
Grids, Clouds and the Future of Internet”, First Edition, Morgan Kaufman Publisher, an Imprint of
Elsevier, 2012.

REFERENCES:
1. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing Principles and
Paradigms, Wiley, 2010
2. Toby Velte, Anthony Velte, Robert Elsenpeter , Cloud Computing, A Practical Approach,
McGrawHill, 2010
3. Thomas Erl , Ricardo Puttini, Zaigham Mahmood,” Cloud Computing: Concepts, Technology &
Architecture”, First Edition, Prentice Hall,2013.

100
CS18702 CYBER SECURITY AND ETHICAL HACKING L T P C
3 1 0 4
OBJECTIVES
 To acquire fundamental knowledge on the concepts of cyber security and Ethical Hacking
 To understand cyber-attack, types of cybercrimes, cyber laws
 To learn the different types of Malicious code and the techniques used to defend them
 To demonstrate the techniques for system hacking
 To detect and prevent the security attacks in different environments

UNIT I CYBER SECURITY FUNDAMENTALS 9+3

Network and Security Concepts : Information Assurance Fundamentals -Basic Cryptography: Symmetric
Encryption- Public Key encryption – DNS -Firewalls – Virtualization -Radio Frequency Identification –
Microsoft Windows Security Principles – Windows programs Execution – Windows Firewall.

UNIT II TECHNIQUES AND ATTACKS MOTIVATIONS 9+3

Proxies and its use- Tunneling Techniques – Fraud Techniques – Threat Infrastructure- Exploitation :
Techniques to gain a Foothold -Shellcode – SQL Injection – Malicious PDF files- Race conditions – Web
based Exploits- DOS conditions - Brute force and Dictionary attacks.

UNIT III MALICIOUS CODE AND DEFENSE TECHNIQUES 9+3

Self-Replicating Malicious code – Evading detection and Elevating Privileges – Rootkits – Spyware -
Token Kidnapping – Virtual Machine detection – Defense techniques : Memory Forensics – Honey pots –
Malicious code Naming – Automated Malicious Code Analysis System- Intrusion Detection System

UNIT IV INTRODUCTION TO ETHICAL HACKING 9+3

Security Fundamental, Security testing, Hacker and Cracker, Descriptions, Test Plans-keeping It legal,
Ethical and Legality – Technical Foundations of Hacking: The attacker’s process – The Ethical Hacker’s
Process – Security and the Stack - OSI Model – Anatomy of TCP/IP protocols – Foot printing and
Scanning - Enumeration and System Hacking. - Sniffers, Session Hijacking, and Denial of Service.

UNIT V HACKING TECHNIQUES 9+3

Web Server Hacking, Web Application Hacking, Database Hacking- Wireless Technologies, Mobile
Security and Attacks- Cloud Computing and Botnets.

TOTAL (L:45, T:15): 60 PERIODS

101
OUTCOMES:
After learning the course, the students should be able to
 The students will be able to explain the basic concepts of cryptography and ethical hacking.
 The students will be to identify different attacks.
 The students will be able to determine tools for different attacks.
 The students will be able to describe the foundation of hacking.
 The students will be able to distinguish hacking techniques.

TEXT BOOKS:
1. Cyber Security Essentials by James Graham , Richard Howard, Ryan Olson, CRS Press , Taylor &
Francis Group, New York.
2. Certified Ethical Hacker, Version 9, Second Edition, Michael Gregg, Pearson IT Certification

REFERENCES:
1. Anti- Hacker Tool Kit (Indian edition) by Mike Sherma , Mc Graw Hill publication
2. Hacking the Hacker, Roger Grimes, Wiley
3. The Unofficial Guide to Ethical Hacking, Ankit Fadia, Premier Press

102
CS 18712 CLOUD COMPUTING AND VIRTUALIZATION L T P C
TECHNIQUES LABORATORY 0 0 4 2
OBJECTIVES
 To develop web applications in cloud computing
 To learn the design and development process involved in creating a cloud based application
 To learn to implement and use parallel programming using Hadoop

List of Experiments
1. Develop a new Web Service for Calculator.
2. Develop a Cloud environment using CloudSim simulator
3. Use Eucalyptus or Open Nebula or equivalent to set up the cloud
4. Find procedure to run the virtual machine of different configuration. Check how many virtual
machines can be utilized at particular time.
5. Find procedure to attach virtual block to the virtual machine and check whether it holds the data
even after the release of the virtual machine
6. Install a C compiler in the virtual machine and execute a sample program
7. Find procedure to set up the one node Hadoop cluster
8. Write a program to use the API’s of Hadoop to interact with it.
9. Write a wordcount program to demonstrate the use of Map and Reduce tasks
10. Write a grep program to demonstrate the use of Map and Reduce tasks
TOTAL: 60 PERIODS
OUTCOMES:
 The student will be able to implement the web application in cloud environment
 The student will be able to simulate a cloud environment to implement new schedulers
 The student will be able to implement the virtualization in cloud environment
 The student will be able to implement the various cloud softwares
 The student will be able to manipulate large data sets in a parallel environment.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

SOFTWARE:
CloudSim simulator, Eucalyptus or Open Nebula or equivalent

HARDWARE:
 Standalone desktops 30 Nos

103
CS18713 SECURITY PRACTICES LABORATORY L T P C
0 0 4 2
OBJECTIVES
The student should be made to:
 Learn to implement fundamental algorithms in Number Theory
 Be exposed to the different cipher techniques·
 Learn to implement the algorithms DES, RSA,MD5,SHA-1
 Learn to use network security tools like GnuPG, KF sensor, Net Strumbler·

LIST OF EXPERIMENTS

1. Number Theory
a) Implementation of Euclidean Algorithm to find GCD between two numbers.
b) Implementation of Extended Euclid Algorithm to find Inverse Modulo.
c) Implementation of Euler Totient function.
d) Implementation of Miller and Rabin’s algorithm for primality check

2. Substitution Ciphers
a) Implementation of Caesar Cipher using c/c++/Java
b) Implementation of Playfair Cipher using c/c++/Java
c) Implementation of Hill Cipher using c/c++/Java
d) Implementation of Vigenere Cipher using c/c++/Java
e) Implementation of one time pad algorithm using c/c++/Java

3. Transpositional Ciphers
a) Implementation of Rail fence using c/c++/Java
b) Implementation of row & Column Transformation cipher using c/c++/Java

4. Implementation of SDES Algorithm using c/c++/Java

5. Implementation of RSA Algorithm using c/c++/Java
6. Implementation of Diffiee-Hellman Exchange Algorithm using c/c++/Java.
7. Implementation of Digital signature algorithm (Elgamal Digital Signature
Algorithm).using c/ c++/Java
8. Setup a honey pot and monitor the honeypot on network (KF Sensor)
9. Verification of Integrity Check (MD5 Tool)
10. Demonstrate IDS using Snort.
TOTAL: 60 PERIODS

104
OUTCOMES:
At the end of the course,
 Students should able to implement fundamental algorithms in Number Theory.
 Students should be exposed to the different cipher techniques.
 Students should able to implement the algorithms DES, RSA,MD5,SHA-1.
 Students should able to use network security tools like GnuPG, KF sensor, Net
Strumbler.
 Students should able to recognize security problems, methods of implementation and
secure system.
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
SOFTWARE:
 C / C++ / Java or equivalent compiler GnuPG, KF Sensor or Equivalent, Snort, Net Stumbler
or Equivalent

HARDWARE:
 Standalone desktops 30 Nos

105
CS18001 BIOINFORMATICS TECHNIQUES L T P C
3 0 0 3
OBJECTIVES:
 To understand basic concepts of molecular biology and genetics, the concepts of computer
science that relate to problems in biological sciences, computer as a tool for biomedical
research, and important functional relationships from gene data

UNIT I BIOLOGICAL DATA ACQUISITION 9

The form of biological information. Retrieval methods for DNA sequence, protein sequence and
protein structure information

UNIT II DATABASES 9
Format and Annotation: Conventions for database indexing and specification of search terms,
Common sequence file formats. Annotated sequence databases - primary sequence databases,
protein sequence and structure databases, Organism specific databases

UNIT III DATA PROCESSING 9

Data – Access, Retrieval and Submission: Standard search engines; Data retrieval tools – Entrez,
DBGET and SRS; Submission of (new and revised) data; Sequence Similarity Searches: Local
versus global. Distance metrics. Similarity and homology. Scoring matrices.

UNIT IV METHODS OF ANALYSIS 9

Dynamic programming algorithms, Needleman-wunsch and Smith-waterman. Heuristic Methods
of sequence alignment, FASTA, and PSI BLAST. Multiple Sequence Alignment and software
tools for pairwise and multiple sequence alignment

UNIT V APPLICATIONS 9
Genome Annotation and Gene Prediction; ORF finding; Phylogenetic Analysis : Comparative
genomics, orthologs, paralogs. Genome analysis – Genome annotation
TOTAL: (L: 45 ):45 PERIODS

OUTCOMES:
At the end of the course, learners will be able to
 Choose a suitable method for acquisition of biological data
 Outline the various databases available to store bioinformatics data.
 Utilize the suitable search method/tool to access data
 Select a suitable sequence alignment, dynamic programming algorithm for the given
problem.
 Summarize the various bioinformatics techniques

TEXT BOOKS:
1. K. Lesk, Introduction to Bioinformatics, Oxford University Press.
2. Dan Gusfield , Algorithms on Strings, Trees and Sequences, Cambridge University Press.
106
REFERENCES:
1. Biological Sequence Analysis Probabilistic Models of proteins and nucleic acids by
Durbin, S. Eddy, A. Krogh, G. Mitchison.
2. Bioinformatics Sequence and Genome Analysis by David W. Mount, Cold Spring Harbor
Laboratory Press.
3. Beginning Perl for Bioinformatics: An introduction to Perl for Biologists by James Tindall,
O‟Reilley Media.

107
 CS18003 DATA ANALYTICS L T P C
3 0 0 3
OBJECTIVES
 Be exposed to big data
 Learn the different ways of Data Analysis
 Be familiar with data streams
 Learn the mining and clustering
 Be familiar with the visualization

UNIT I INTRODUCTION TO BIG DATA 9

Introduction to Big Data Platform – Challenges of conventional systems - Web data – Evolution of
Analytic scalability, analytic processes and tools, Analysis vs reporting - Modern data analytic
tools, Stastical concepts: Sampling distributions, resampling, statistical inference, prediction error.
UNIT II DATA ANALYSIS 9
Regression modeling, Multivariate analysis, Bayesian modeling, inference and Bayesian networks,
Support vector and kernel methods, Analysis of time series: linear systems analysis, nonlinear
dynamics - Rule induction - Neural networks: learning and generalization, competitive learning,
principal component analysis and neural networks; Fuzzy logic: extracting fuzzy models from data,
fuzzy decision trees, Stochastic search methods.
UNIT III MINING DATA STREAMS 9
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 - Realtime Analytics
Platform(RTAP) applications - case studies - real time sentiment analysis, stock market predictions.
UNIT IV FREQUENT ITEMSETS AND CLUSTERING 9
Mining Frequent itemsets - Market based model – Apriori Algorithm – Handling large data sets in
Main memory – Limited Pass algorithm – Counting frequent itemsets in a stream – Clustering
Techniques – Hierarchical – K- Means – Clustering high dimensional data – CLIQUE and
PROCLUS – Frequent pattern based clustering methods – Clustering in non-euclidean space –
Clustering for streams and Parallelism.
UNIT V FRAMEWORKS AND VISUALIZATION 9
MapReduce – Hadoop, Hive, MapR – Sharding – NoSQL Databases - S3 - Hadoop Distributed file
systems – Visualizations - Visual data analysis techniques, interaction techniques; Systems and
applications.
TOTAL (L:45): 45 PERIODS

108
OUTCOMES:
 Students will be able to illustrate the importance of data and data analysis.
 Students will be able to interpret the probabilistic models for data
 Students will be able to apply the knowledge of hypothesis, uncertainty principle in data
mining streams
 Students will be able to interpret the evaluation of regression analysis and various clustering
algorithms on item sets and frequency count datasets.
 Students will be able to investigate Hadoop framework and Hadoop Distributed File system
and to illustrate the concepts of NoSQL using MongoDB and Cassandra for Big Data.

TEXT BOOK:
1. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.
2. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge
University Press, 2012.

REFERENCES:
1. Bill Franks, Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams
with advanced analytics, John Wiley & sons, 2012.
2. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007 Pete Warden, Big Data
Glossary, O’Reilly, 2011.
3. Jiawei Han, Micheline Kamber, “Data Mining Concepts and Techniques”, Second Edition,
Elsevier, Reprinted 2008.

109
 L T P C
CS18005 GRAPH THEORY AND ITS APPLICATION
3 0 0 3
OBJECTIVES
The student should be made to:
 Be familiar with the most fundamental Graph Theory concepts.
 Be familiar with trees, fundamental circuits, cut-sets and cut-vertices.
 Be familiar with planarity and vector spaces of graphs.
 Be familiar with matrices, coloring, covering and partitioning of graphs.
 Be familiar with directed graphs and enumeration of graphs.
UNIT I INTRODUCTION, PATHS & CIRCUITS 9
Introduction: Graphs - Applications of Graphs - Finite and Infinite graphs - Incidence and Degree -
Isolated Vertex - Pendant Vertex and Null graph - History of Graph Theory. Paths and Circuits:
Isomorphism - Subgraphs - Walks, Paths and Circuits - Connectedness - Components - Euler graphs
- Hamiltonian Paths and Circuits - The Travelling Salesman Problem.

UNIT II TREES, FUNDAMENTAL CIRCUITS, CUT-SETS & CUT-VERTICES 9

Trees and Fundamental Circuits: Trees - Properties of Trees - Pendant Vertices in a Tree - Distance
and Centers in a Tree – Rooted and Binary Trees - On Counting Trees - Spanning trees -
Fundamental circuits - Finding All Spanning Trees of a Graph - Spanning trees in a weighted graph
- Cut sets - Properties of a Cut-set - All cut sets ina graph - Fundamental Circuits and Cut-Sets -
Connectivity and Separability - Network flows - 1-Isomorphism - 2-Isomorphism.

UNIT III PLANAR & DUAL GRAPHS, VECTOR SPACES OF A GRAPH 9

Combinational Vs. Geometric Graphs - Planar graphs - Kuratowski’s Two Graphs - Different
Representation of a Planar Graph - Detection of Planarity - Geometric Dual - Combinatorial dual -
Criteria of Planarity - Thickness and Crossings. Vector Spaces of a Graph: Sets with One Operation
- Sets with Two Operations - Modular Arithmetic and Galois Fields - Vectors and Vector Spaces -
Vector Space Associated with a Graph - Basics Vectors of a Graph - Circuit and Cut-Set Subspaces
- Orthogonal Vectors and Spaces - Intersection and Join of W and Ws.

UNIT IV MATRICES, COLORING , COVERING AND PARTITIONING 9

Incidence Matrix - Submatrices of A(G) - Circuit Matrix - Fundamental Circuit Matrix and Rank of
B - Application to a Switching Network - Cut-Set Matrix - Relationships among Af, Bf and Cf. Path
Matrix, Adjacency Matrix. Chromatic number - Chromatic partitioning - Chromatic polynomial -
Matchings - Coverings - The Four color problem.

110
 UNIT V DIRECTED GRAPHS & ENUMERATION OF GRAPHS 9
Directed graphs: Directed Graphs - Types of Digraphs - Digraphs and Binary Relations - Directed
paths and Connectedness - Euler graphs - Trees with Directed Edges - Fundamental Circuits in
Digraphs - Matrices A, B and C of digraphs, Adjacency Matrix of a Digraph, Paired Comparisons
and Tournaments - Acyclic Digraphs and Decyclization. Enumeration of Graphs: Types of
Enumeration - Counting Labelled and Unlabelled Trees - Polya’s Counting Theorem - Graph
Enumeration with Polya’s Theorem.
TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Students will be able to understand precise and accurate mathematical definitions of objects
in graph theory.
 Students will be able to use mathematical definitions to identify and construct examples and
to distinguish examples from non-examples.
 Students will gain the skill to validate and critically analyze a mathematical proof.
 Students will be able to use a combination of theoretical knowledge and independent
mathematical thinking in examination of questions in graph theory.
 Students will be able to infer from definitions and examples to construct mathematical
proofs.
TEXT BOOKS:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”,
Prentice Hall of India, 2003.

REFERENCES:
1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Gary Chartrand, Ortrud R. Oellermann, “Introduction to Graph Theory”, Tata McGraw-hill,
2005.
3. Douglas B West, “Introduction to Graph Theory”, Prentice-Hall of India, 2005.
4. Frank Harary, “Graph Theory”, Prentice-Hall of India, 1988.

111
CS18007 INFORMATION RETRIEVAL TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Learn the various information retrieval models.
 Be familiar with Web Search Engine.
 Be exposed to Link Analysis, Search in mobile web and social networks
 Understand Hadoop and Map Reduce.
 Learn document text mining techniques.

UNIT I INTRODUCTION TO INFORMATION RETRIEVAL 9

Introduction - History of IR- Components of IR - Issues – Open source Search engine Frameworks -
The impact of the web on IR - IR Versus Web Search - Components of a Search engine - Crawls and
Feeds – Crawling the Web - Crawling Documents and Email – Document Feeds.

UNIT II INFORMATION RETRIEVAL MODELS 9

Boolean and vector-space retrieval models- Term weighting - TF-IDF weighting- cosine similarity –
Preprocessing - Inverted indices - efficient processing with sparse vectors – Language Model based
IR - Probabilistic IR – Latent semantic indexing- Relevance feedback and query expansion.

UNIT III WEB SEARCH ENGINE – CRAWLING AND NAVIGATION 9

Web search overview, web structure, Information seeking on the web, Link Analysis, Content
Relevance – Link-based Metrics, Evaluating search engines – Different types of search engines –
Search Engine Advertising – Metasearch – Hadoop and Map Reduce- Personalization – Question
Answering on the Web, Image search - Special Purpose Search Engines - Web Browsing and
Navigation - Navigation Tools - Navigational Metrics - Web Data Mining and algorithms.

UNIT IV SEARCH IN MOBILE WEB AND SOCIAL NETWORKS 9

The Mobile Web - The Paradigm of Mobile Computing - Mobile Web Services - Mobile Device
Interfaces - The Navigation Problem in Mobile Portals - Mobile Search - Social Networks –
Introduction - Social Network Analysis - Collaborative Filtering – Weblogs - Searching in Social
Networks - Social Tagging and Bookmarking - Opinion Mining.

UNIT V DOCUMENT TEXT MINING 9

Text Mining -Text classification and clustering - Categorization algorithms: Naive Bayes; decision
trees; and nearest neighbour - Clustering algorithms: agglomerative clustering; k-means; expectation
maximization (EM) – SVM classifier.

TOTAL (L:45): 45 PERIODS

112
OUTCOMES:
 Students will be able to apply information retrieval models.
 Students will be able to understand the basic concepts and techniques in Information
Retrieval
 Students will be able to understand how statistical models of text can be used for other IR
applications, for example clustering and news aggregation
 Students will gain the skill to build a document retrieval system, through the practical
sessions, including the implementation of a relevance feedback mechanism
 Students will be able to apply document text mining techniques.

TEXT BOOKS:
1. Bruce Croft, Donald Metzler and Trevor Strohman, Search Engines: Information Retrieval in
Practice, 1st Edition Addison Wesley, 2009
2. C. Manning, P. Raghavan, and H. Schutze, Introduction to Information Retrieval, Cambridge
University Press, 2008.
3. Mark Levene, An Introduction to Search Engines and Web Navigation, 2nd Edition Wiley,
2010.

REFERENCES:
1. Stefan Buettcher, Charles L. A. Clarke, Gordon V. Cormack, Information Retrieval:
Implementing and Evaluating Search Engines, The MIT Press, 2010.
2. Ophir Frieder “Information Retrieval: Algorithms and Heuristics: The Information Retrieval
Series”, 2nd Edition, Springer, 2004.
3. Manu Konchady, “Building Search Applications: Lucene, Ling Pipe”, and First Edition,
Gate Mustru Publishing, 2008.

113
GE18051 INTELLECTUAL PROPERTY RIGHTS L T P C
(COMMON TO ALL BRANCHES) 3 0 0 3
OBJECTIVES:
To understand the process and need for protecting technology innovations through Intellectual
Property Rights.

UNIT I TECHNOLOGICAL INNOVATIONS 10

The process of technological innovation - factors contributing to successful technological
innovation - the need for creativity and innovation - problem solving and creativity through brain
storming - different techniques - Selection criteria - screening ideas for new products - evaluation
techniques. Protection of IP as a factor in R&D and few case studies.

UNIT II INTRODUCTION TO IPR & RELATED AGREEMENTS 8

AND TREATIES
Types of IP: Patents, Trademarks, Copyright & Related Rights, Industrial Design,
Traditional Knowledge, Geographical Indications. History of GATT & TRIPS Agreement;
Madrid Agreement; Hague Agreement; WIPO Treaties; Budapest Treaty; PCT; Indian Patent Act
1970 & recent amendments.

UNIT III BASICS OF PATENTS AND CONCEPT OF PRIOR ART 10

Introduction to Patents; Types of patent applications: Ordinary, PCT, Conventional,
Divisional and Patent of Addition; Specifications: Provisional and complete; Forms and fees
Invention in context of “prior art”; Patent databases; Searching International Databases;
Country-wise patent searches, USPTO, EPO, PATENTScope (WIPO), IPO, etc.)

UNIT IV PATENT FILING PROCEDURES 9

National & PCT filing procedure; Time frame and cost; Status of the patent applications filed;
Precautions while patenting – disclosure/non-disclosure; Financial assistance for patenting -
introduction to existing schemes Patent licensing and agreement Patent infringement- meaning,
scope, litigation, case studies

UNIT V PATENT RIGTS AND NEW DEVELOPMENTS IN IPR 8

Scope of Patent Rights. Licensing and transfer of technology. Patent information and databases.
Geographical Indications. New Developments in IPR: Administration of Patent System.

TOTAL: 45 PERIODS

114
OUTCOMES:
At the end of the course, learners will be able to
 Understand the process of problem solving through technological innovations.
 Selecting the appropriate IPR elements for protecting intellectual property.
 Understand the concept of prior art search and performing it.
 Understand the procedure for filing patent.
 Understand and apply the scope of patent rights for licensing and transfer of technology.

TEXT BOOKS:
Ramappa, T. “Intellectual Property Rights Under WTO”, S. Chand, 2008.
1.
2. BAREACT, Indian Patent Act 1970 Acts & Rules, Universal Law Publishing Co. Pvt. Ltd.,
2007.
3. Adair, J. “Effective Innovation”, 1st Ed., Macmillan Publishing, 2003.

REFERENCES:
1. Robert P. Merges, Peter S. Menell and Mark A. Lemley, “Intellectual Property in New Technological
Age”, Aspen Publishers, 2016.
2. Kankanala C., “Genetic Patent Law & Strategy”, 1st Edition, Manupatra Information Solution Pvt.
Ltd., 2007.
3. Nystrom, H., “Creativity and Innovation”, 2nd Ed., John Wiley & Sons, 1996.

115
CS18009 INTERNET OF THINGS AND ITS APPLICATIONS L T P C
3 0 0 3
OBJECTIVES
 To assess the vision of IoT.
 To classify Real World IoT applications in various Domains.
 To understand design methodology for IoT platforms.

UNIT I INTRODUCTION TO INTERNET OF THINGS 9

Definition and characteristics of IoT, Physical design of IoT, Things in IoT, IoT Protocols, Logical
Design of IoT, IoT functional blocks, IoT communication Models, IoT communication API’s, IoT
enabling Technologies Wireless sensor networks, Cloud Computing, Big Data Analytics,
Communication protocols, embedded systems. IoT Levels and Deployment templates

UNIT II DOMAIN SPECIFIC IOT 9

Home Automation – IoT in Cities, Environment – IoT in smart grids, retails, logistics – IoT in
agriculture, Industry, health & lifestyle

UNIT III IOT AND M2M 9

M2M, Difference between IoT and M2M, SDN and NFV for IoT- Software defined networking,
network function virtualization

UNIT IV IOT PLATFORMS DESIGN METHODOLOGY 9

IoT Design and Methodology- Purpose and requirements specification, Process specification,
Domain model specification, Information model specification, service specification, IoT level
specification, functional view specification, Operational view specification, Device and component
integration, application development

UNIT V IOT PHYSICAL DEVICES AND ENDPOINTS 9

IoT device - Basic Building blocks of an IoT Device, Exemplary Device: Raspberry Pi, About the
Board, Linux on Raspberry Pi, Raspberry Pi Interfaces, Other IoT devices.
TOTAL (L:45): 45 PERIODS
OUTCOMES:
 Students will be able to understand the vision of IoT
 Students will be exemplifying the application of IoT in various domains
 Students will be able to understand the differences and similarities between IoT and M2M
 Students will be able to interpret the different IoT platforms design methodology
 Students will be illustrating various IoT physical devices
116
TEXT BOOKS:
1. Internet of Things – A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547

REFERENCES:
1. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O’Reilly (SPD),
2014, ISBN: 9789350239759
2. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), ―Architecting the Internet
of Things‖, Springer, 2011
3. Honbo Zhou,―The Internet of Things in the Cloud: A Middleware Perspective‖, CRC Press,
2012.
4. Jan Ho ̈ ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan Avesand.
5. David Boyle, "From Machine-to-Machine to the Internet of Things -Introduction to a New
Age of Intelligence", Elsevier, 2014.

117
CS18011 MOBILE APPLICATION DEVELOPMENT L T P C
3 0 0 3
OBJECTIVES
 Understand the system requirements for mobile applications
 Generate suitable design using specific mobile development frameworks
 Generate mobile application design
 Understand the design using specific mobile development frameworks
 Deploy the mobile applications in marketplace for distribution

UNIT I INTRODUCTION 9

Introduction to mobile applications – Embedded systems - Market and business drivers for mobile
applications – Publishing and delivery of mobile applications – Requirements gathering and
validation for mobile applications

UNIT II BASIC DESIGN 9

Introduction – Basics of embedded systems design – Embedded OS - Design constraints for mobile
applications, both hardware and software related – Architecting mobile applications – user
interfaces for mobile applications – touch events and gestures – Achieving quality constraints –
performance, usability, security, availability and modifiability.

UNIT III ADVANCED DESIGN 9

Designing applications with multimedia and web access capabilities – Integration with GPS and
social media networking applications – Accessing applications hosted in a cloud computing
environment – Design patterns for mobile applications.

UNIT IV ANDROID 9
Introduction – Establishing the development environment – Android architecture – Activities and
views – Interacting with UI – Persisting data using SQLite – Packaging and deployment –
Interaction with server side applications – Using Google Maps, GPS and Wifi – Integration with
social media applications.

UNIT V IOS 9
Introduction to Objective C – iOS features – UI implementation – Touch frameworks – Data
persistence using Core Data and SQLite – Location aware applications using Core Location and
Map Kit – Integrating calendar and address book with social media application – Using Wifi -
iPhone marketplace.

TOTAL (L:45): 45 PERIODS

118
OUTCOMES:
 Students can be able to describe the requirements for mobile applications
 Students will be able to infer the Basic Screen layout
 Students can able to sketch the mobile applications for specific requirements
 Students can be able to acquire knowledge to Implement the devise using Android SDK
 Students will be able to develop the application using iOS

TEXT BOOKS:
1. Jeff McWherter and Scott Gowell, "Professional Mobile Application Development", Wrox,
2016
2. Charlie Collins, Michael Galpin and Matthias Kappler, “Android in Practice”, DreamTech,
2016

REFERENCES:
1. http://developer.android.com/develop/index.htm
2. Mobile Application Development, Usability, and Security, IGI Global,2017

119
CS18013 MULTIMEDIA SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
 To learn the basic components and tools in multimedia systems
 To learn the concepts of multimedia like text, speech, image and video processing
 Analyse data compression techniques like image compression, video compression and
audio compression
 To learn about the internal storage and retrieval systems.
 To deal with multimedia data over internet and web applications.

UNIT I INTRODUCTION TO MULTIMEDIA 9

Components of Multimedia - Software tools - Multimedia system Architecture - Objects in
multimedia systems - Multimedia Databases.

UNIT II MULTIMEDIA INPUT TECHNOLOGIES 9

Text - Digital video - Digitization of Sound - MIDI - Graphics and Image data representation -
Color in Image and video

UNIT III MULTIMEDIA DATA COMPRESSION 9

Lossless Compression and lossy compression algorithm - Image compression - Video compression
- Audio Compression.

UNIT IV STORAGE AND RETRIEVAL TECHNOLOGIES 9

Magnetic media technology - Optical media - Hierarchical Storage Management - Cache
Management for Storage Systems.

UNIT V MULTIMEDIA AND THE INTERNET 9

Internet working - Connections - Internet Services - The World Wide Web - Tools for the WWW –
Web Servers - Web Browsers - Web page makers and editors - Plug-Ins and Delivery Vehicles,
HTML, VRML - Designing for the WWW – Working on the Web.
Multimedia Applications – Media Communication, Media Consumption, Media Entertainment,
Media games.
TOTAL: (L: 45 ): 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to :
 Explore various multimedia tools in system design.
 Various technologies to handle multimedia input.
 Compare different data compression techniques.
 Analyse the data storage and retrieval in a database.
 Design and manage the various web browsers and servers to handle multimedia data.
120
TEXT BOOKS:
1. Ze -Nian Li, Mark S.Drew,― Fundamentals of Multimedia, PHI Learning Pvt. Limited
2010.
2. Prabhat K.Andleigh, Kiran Thakrar - Multimedia System Design, Pearson Education,
Inc.2015.

REFERENCES:
1. T. Vaughan, 1999, Multimedia: Making it work, 4th Edition, Tata McGraw Hill, New
Delhi.
2. Ralf Steinmet, Z,Klara Nahrstedt -Multimedia Systems, X.media publishing,
Springer International Edition 2007.
3. John F.Koegel Bufford - Multimedia systems - Pearson Education 1994.
4. S. Heath, 1999, Multimedia & Communication Systems, Focal Press, UK.

121
CS18015 NATURAL LANGUAGE PROCESSING L T P C
3 0 0 3
OBJECTIVES
The Student should be made to:
● To learn the fundamentals of natural language processing
● To understand the use of CFG and PCFG in NLP
● To understand the role of semantics of sentences and pragmatics
● To apply the NLP techniques to IR applications

UNIT I INTRODUCTION 9

Origins and challenges of NLP – Language Modeling: Grammar-based LM, Statistical LM –

Regular Expressions, Finite-State Automata – English Morphology, Transducers for lexicon and
rules, Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit Distance

UNIT II WORD LEVEL ANALYSIS 9

Word level analysis - Unsmoothed N-grams, Evaluating N-grams, Smoothing, Interpolation and
Backoff – Word Classes, Part-of-Speech Tagging, Rule-based, Stochastic and Transformation-
based tagging, Issues in PoS tagging – Hidden Markov and Maximum Entropy models.

UNIT III SYNTACTIC ANALYSIS 9

Syntactic analysis - Context-Free Grammars, Grammar rules for English, Treebanks, Normal
Forms for grammar – Dependency Grammar – Syntactic Parsing, Ambiguity, Dynamic
Programming parsing – Shallow parsing – Probabilistic CFG, Probabilistic CYK, Probabilistic
Lexicalized CFGs – Feature structures, Unification of feature structures.

UNIT IV SEMANTICS AND PRAGMATICS 9

Semantics and pragmatics - Requirements for representation, First-Order Logic, Description

Logics – Syntax-Driven Semantic analysis, Semantic attachments – Word Senses, Relations
between Senses, Thematic Roles, selectional restrictions – Word Sense Disambiguation, WSD
using Supervised, Dictionary & Thesaurus, Bootstrapping methods – Word Similarity using
Thesaurus and Distributional methods.

UNIT V DISCOURSE ANALYSIS AND LEXICAL RESOURCES 9

Discourse analysis and lexical resources - Discourse segmentation, Coherence – Reference

122
Phenomena, Anaphora Resolution using Hobbs and Centering Algorithm – Coreference
Resolution – Resources: Porter Stemmer, Lemmatizer, Penn Treebank, Brill’s Tagger, WordNet,
PropBank, FrameNet, Brown Corpus, British National Corpus (BNC).
TOTAL : 45 PERIODS

OUTCOMES:
Upon completion of the course, students will be able to
● To tag a given text with basic Language features
● To design an innovative application using NLP components
● To implement a rule based system to tackle morphology/syntax of a language
● To design a tag set to be used for statistical processing for real-time applications
● To compare and contrast the use of different statistical approaches for different types of
NLP applications.

TEXT BOOKS:
1. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to
Natural Language Processing, Computational Linguistics and Speech, Pearson Publication,
2014.
2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with Python,
First Edition, OReilly Media, 2009.

REFERENCES:
1. Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook, Atlantic
Publisher, 2015
2. Richard M Reese, ―Natural Language Processing with Java, OReilly Media, 2015.
3. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing,
Second Edition, Chapman and Hall/CRC Press, 2010.
4. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information Retrieval,
Oxford University Press, 2008.

123
 PRINCIPLES OF DIGITAL IMAGE PROCESSING L T P C
IT18002
(COMMON TO IT & CS) 3 0 0 3

OBJECTIVES
 To get exposed to different image enhancement techniques
 To learn about image transformation and color image analysis
 To learn about image classification
 To study various applications of image processing

UNIT I INTRODUCTION 9
Introduction-Origins, Examples of Fields, fundamental steps, Components, Fundamentals-
Elements of Visual Perception, Image Sensing & Acquisition, Sampling and Quantization,
Relationship between Pixels, Mathematical Tools – Spatial, Vector and Matrix operations.

UNIT II IMAGE ENHANCEMENT 9

Histogram Processing, Fundamentals of Spatial Filtering- Smoothing, Sharpening, Frequency
domain- Smoothing and Sharpening, Filters – Homo-morphic Filtering, Noise Models, Inverse
filtering, Wiener filtering, Geometric Mean Filter.

UNIT III IMAGE TRANSFORMATION 9

Transforms: Matrix-based - correlation, Fourier related, Walsh- Hadamard, Slant, Haar,
Wavelet, Color: Models, Transformations, Image smoothing and sharpening, Noise in color
images.

UNIT IV MIDDLE & HIGH LEVEL IMAGE PROCESSING 9

Basic Morphological algorithms: Hole filling, Convex hull, Pruning, Edge Detection-Basic,
Thresholding-Foundation and Segmentation - Region Growing and Region Splitting &
Merging, Active contours- image segmentation using Snakes, Feature Extraction-
Preprocessing, Feature descriptors - Boundary, Region and Principal components, Pattern
classification: Statistical classifiers –Bayes classifier, Neural Networks and Deep learning:
Multilayer Feedforward Neural Networks , Deep Convolutional Neural Networks.

UNIT V APPLICATIONS 9
Face Recognition, Finger print Recognition, Gait Recognition, Location of dark contaminants in
cereals, recent developments in In-Vehicle Vision systems.

TOTAL : 45 PERIODS
OUTCOMES:
At the end of this course, the student will be able to:
 Interpret missing data and infer knowledge on advanced graphics
 Implement the various image enhancement techniques
 Interpret image transformation and its algorithms

124
  Identify the image classification techniques
 Relate the various applications of image processing

TEXT BOOKS:
1. Rafael C. Gonzalez and Richard E. Woods, ―Digital Image Processing, Fourth Edition,
Pearson Education, 2017.
2. E. R. Davies, “Computer & Machine Vision”, Fourth Edition, Academic Press, 2012.

REFERENCES:
1. S. Sridhar, “Digital Image Processing”, Oxford University Press, 2011.
2. Anil K.Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India, 2011.

125
 CS18017 RESOURCE MANAGEMENT TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
 The student should be familiar with the basic resource management techniques
 The student should learn to solve problems in linear programming and Integer
programming and be exposed to CPM and PERT
 The student should be familiar to use the queuing model

UNIT I LINEAR PROGRAMMING MODELS 9

Mathematical Formulation - Graphical Solution of linear programming models – Simplex method
– Artificial variable Techniques- Variants of Simplex method.

UNIT II INTEGER PROGRAMMING MODELS 9

Formulation – Gomory’s IPP method – Gomory’s mixed integer method – Branch and bound
technique.

UNIT III TRANSPORTATION AND ASSIGNMENT MODELS 9

Mathematical formulation of transportation problem- Methods for finding initial basic feasible
solution – optimum solution - degeneracy – Mathematical formulation of assignment models –
Hungarian Algorithm – Variants of the Assignment problem

UNIT IV SCHEDULING BY PERT AND CPM 9

Network Construction – Critical Path Method – Project Evaluation and Review Technique –
Resource Analysis in Network Scheduling

UNIT V QUEUING MODELS 9

Characteristics of Queuing Models – Poisson Queues - (M / M / 1) : (FIFO / α /α), (M / M / 1) :
(FIFO / N / α), (M / M / C) : (FIFO / α / α), (M / M / C) : (FIFO / N / α) models.

TOTAL (L:45): 45 PERIODS

OUTCOMES:

On the completion of the course

 Students will be able to formulate linear programming (LP) models and solve the
problems using appropriate methods.
 Students will be able to construct a linear integer programming model and discuss the
methods to solve it.
 Students will be able to produce optimized solutions for transportation and assignment
models.
126
  Students will be able to apply CPM and PERT techniques constructively to make
effective business decisions and resource mapping.
 Students will be able to develop mathematical skills to solve queuing models arising from
a wide range of applications.

TEXT BOOKS:

1. Taha H.A., “Operations Research : An Introduction “ 7th Edition, Pearson Education, 2004.

REFERENCES:

1. A.M. Natarajan, P. Balasubramani, A. Tamilarasi, “Operations Research”, Pearson

Education, Asia, 2005.
2. Prem Kumar Gupta, D.S. Hira, “Operations Research”, S.Chand & Company Ltd, New
Delhi, 3rd Edition , 2003.

127
CS18019 SOCIAL NETWORK ENGINEERING L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the concept of semantic web and related applications
 Learn knowledge representation using ontology
 Understanding Social Communities
 Understand human behavior in social web and related communities
 Learn visualization of social networks
UNIT I INTRODUCTION 9
Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web -
Emergence of the Social Web - Social Network analysis: Development of Social Network
Analysis - Key concepts and measures in network analysis - Electronic sources for network
analysis: Electronic discussion networks, Blogs and online communities - Web-based
networks - Applications of Social Network Analysis.

UNIT II MODELLING, AGGREGATING AND KNOWLEDGE 9

REPRESENTATION
Ontology and their role in the Semantic Web: Ontology-based knowledge Representation -
Ontology languages for the Semantic Web: Resource Description Framework - Web Ontology
Language - Modelling and aggregating social network data: State-of-the-art in network data
representation - Ontological representation of social individuals - Ontological representation of
social relationships - Aggregating and reasoning with social network data - Advanced
representations.

UNIT III EXTRACTION AND MINING COMMUNITIES IN WEB 9

SOCIAL NETWORKS
Extracting evolution of Web Community from a Series of Web Archive - Detecting
communities in social networks - Definition of community - Evaluating communities -
Methods for community detection and mining - Applications of community mining algorithms
- Tools for detecting communities social network infrastructures and communities -
Decentralized online social networks - Multi-Relational characterization of dynamic social
network communities.

UNIT IV PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES 9

Understanding and predicting human behaviour for social communities - User data
management - Inference and Distribution - Enabling new human experiences - Reality mining
- Context - Awareness - Privacy in online social networks - Trust in online environment -

128
Trust models based on subjective logic - Trust network analysis - Trust transitivity analysis -
Combining trust and reputation - Trust derivation based on trust comparisons - Attack
spectrum and countermeasures.

UNIT V VISUALIZATION AND APPLICATIONS OF SOCIAL 9

NETWORKS
Graph theory - Centrality - Clustering - Node-Edge Diagrams - Matrix representation -
Visualizing online social networks, Visualizing social networks with matrix-based
representations - Matrix and Node-Link Diagrams - Hybrid representations - Applications -
Cover networks - Community welfare - Collaboration networks - Co-Citation networks.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Student will be able to define the semantic web and the related applications
 Student will be able to outline the knowledge using ontology
 Student will be able to interpret Social Community and its organization
 Student will be able to identify human behaviour in social web and related
communities
 Student will be able to analyse social networks

TEXT BOOKS:
1. Peter Mika, “Social Networks and the Semantic Web”, , First Edition, Springer 2007.
2. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st
Edition, Springer, 2010.

REFERENCES:
1. Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking –
Techniques and applications”, First Edition Springer, 2011.
2. Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging
Technologies and Applications for Searching the Web Effectively”, IGI Global
Snippet, 2008.
3. John G. Breslin, Alexandre Passant and Stefan Decker, “The Social Semantic Web”,
Springer, 2009.

129
 L T P C
CS18021 SOFTWARE ARCHITECTURE
3 0 0 3
OBJECTIVES: Students can able to,
 Understand Architectural styles and Quality Attributes.
 Understand common tools and terminology related to software architecture.
 Understand the role of the Software Architect with a development project.
 Use methods for constructing and evaluating architectures.
 Understand Advance Concepts in Architecture

UNIT I INTRODUCTION 9
Software Architecture –Architecture Structures and Views – Importance of Software
Architecture – Predicting System Quality – Influencing Organizational Structure – Improving
Cost and Schedule estimates – Context of Software architecture.

UNIT II QUALITY ATTRIBUTES 9

Understanding quality attributes – availability – interoperability – modifiability - performance
and security – testability - usability – quality attribute modeling and analysis.

UNIT III ARCHITECTURE IN THE LIFE CYCLE 9

Architecture in the agile projects – Architecture and requirements – Designing and
documentation – Implementation and testing – Architecture reconstruction and conformance.

UNIT IV ARCHITECTURE AND BUSINESS 9

Economic analysis of Architecture – Architecture competence – Architecture and Software
product lines – Case Studies

UNIT V ARCHITECTURE IN ADVANCE 9

Architecture in Cloud - Cloud Definition – Service Model – Economic Justification – Base
Mechanism – Architecture for the Edge – Edge Document system – SDLC – Metropolis
Model.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Students will be able to explain influence of Architectural styles and Quality
Attributes.
 Students will be able to demonstrate the detailed working of common tools and
terminology related to software architecture.
130
  Students will be able to define the role of the Software Architect with a development
project
 Students will able to Identify and use methods for constructing and evaluating
architectures.
 Students will be able to survey the advance Concepts in Architecture.

TEXT BOOKS:
1. Len Bass, Paul Clements, Rick Kazman, “Software Architecture in Practice”, 3rd
edition Pearson, 2013.
2. Mary Shaw, David Garlan, “Software Architecture: Perspectives on an Emerging
Discipline”, Prentice Hall, 1996.

REFERENCES:
1. Taylor R. N, Medvidovic N, Dashofy E. M, “Software Architecture: Foundations,
Theory, and Practice”, Wiley, 2009.
2. Booch G, Rumbaugh J, Jacobson I, “The Unified Modeling Language User Guide”,
Addison-Wesley, 1999.

131
 L T P C
SOFTWARE PLANNING AND PROJECT
CS18023
MANAGEMENT 3 0 0 3
OBJECTIVES: Students can able to,
 Understand how to Estimate project cost and perform cost-benefit evaluation among
projects
 Understand project scheduling activities network analysis and risk management
 Understand how to apply schedule and cost control techniques for project monitoring
including contract management
 Understand the different quality models in software projects for maintaining software
quality and reliability.
 Understand and use suitable project organization structure, leadership, decision and
motivation styles, proper safety and ethical practices and be responsible to the society

UNIT I PROJECT EVALUATION & EVALUATION TECHNIQUES 9

Software Project Definitions Software Project Categorization, Software VS other projects,
Stakeholders, Project Success and Failure, Software project Activities, Practices & Standards,
Selecting Process Models, software maintenance model - Estimation & Evaluation
Techniques: Business Case & Cost Benefit Analysis, Cash Flow Forecasting, Cost-Benefit
Evaluation Techniques-Risk Analysis for Project Evaluation, Program management, Project
effort and cost estimation; Basis of estimation, Estimation method categorization, SLOC,
Analogy, Delphi technique, FP Analysis, COCOMO II, Staffing pattern.

UNIT II PROJECT PLANNING AND RISK MANAGEMENT 9

Project Planning: Stepwise planning, Identification of Project product and activities (PBS &
PFD), Activity based approach (WBS), Sequencing and Scheduling of Activities, Precedence
Network Diagram: AON and AOA conventions, Network Planning, CPM technique- Risk
Management: Nature and Types of Risks, Risk Management framework, Hazard
Identification, Hazard Analysis, Risk Planning and Control, Schedule Risk, PERT Technique

UNIT III PROJECT MONITORING AND CONTROL 9

Schedule and Cost Monitoring Collecting Data & Reporting, Graphical Visualization
techniques, Cost Monitoring, Earned Value analysis, Requirements management, Change
Control - Contract Management: Types of Contracts, Stages in Contract Placement, Typical
Terms of a Contract, Contract Management and Acceptance.

UNIT IV SOFTWARE QUALITY MANAGEMENT 9

Software Quality: Testing and Software Reliability, Metrics, ISO and CMMI Quality
management models, Quality enhancement techniques (Review, Inspection, Formal methods,

132
Best practices and Lessons learnt report).

UNIT V PEOPLE MANAGEMENT 9

Organizational Behavior, Safety and Ethics: Selecting the right person for a job, Motivation
(Taylor’s model, expectancy theory), Job characteristic models, Leadership styles, Stress,
Health and Safety, Professional Ethics- Organization & Project team Structure: Working in
Groups, Decision Making, Organizational structure and Project team structures.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course,
 Student will be able to estimate project cost and perform cost-benefit evaluation among
projects
 Student will be able to perform project scheduling, activity network analysis and risk
management
 Student will be able to apply schedule and cost control techniques for project
monitoring including contract Management
 Student will be able to apply quality models in software projects for maintaining
software quality and Reliability
 Student will be able to use suitable project organization structure, leadership, decision
and motivation styles, proper safety and ethical practices and be responsible to the
society

TEXT BOOKS:
1. Bob Hughes, Mike Cotterell, Rajib Mall, “Software Project Management”, 6th Edition,
Tata McGraw Hill, 2017.

REFERENCES:
1. Royce, “Software Project Management”, Pearson Education, 1999.
2. Robert K. Wysocki, Effective Software Project Management, Wiley, 2009

133
CS18025 SOFTWARE REQUIREMENT ENGINEERING L T P C
3 0 0 3
OBJECTIVES
 Describes the Requirement Problems and Requirement management
 Explains steps involved in Requirement elicitation & analysis
 Defining, organizing and prioritizing the requirement for a system.
 Establishing the scope of a project.
 Refining use cases and technical methods for specifying requirements

UNIT I INTRODUCTION 9
Introduction - Requirements Problem – Requirements management – Requirements and
software life cycle-software team.

UNIT II ANALYSING THE PROLEM 9

The five steps in problem analysis– business modeling – Systems engineering of software
intensive systems – Understanding user and stakeholders needs – Features of a product or
system –Interviewing – Requirements workshops- Brain storming and Idea reduction-
storyboarding

UNIT III DEFINING THE SYSTEM 9

Use case primer-Organizing requirement Information-Vision Document-Product Management-
Managing scope-Establishing Project scope-Managing customer

UNIT IV REFINING THE SYSTEM DEFINITION 9

Software requirement-Refining the use cases-developing the supplementary specification-
Ambiguity and specificity -Technical methods for specifying requirements

UNIT V BUILDING THE RIGHT SYSTEM 9

From use cases to Implementation-From use Cases to Test cases-Tracing requirements-
Managing Change-Assessing Requirements Quality in Iterative Development-Agile
Requirement methods.
TOTAL (L:45): 45 PERIODS

OUTCOMES:

 Students will be able to Understand the requirements problem and software life cycle
methods .
 Students will be able to Analyze the business model and understand the user and
stake holder needs.
134
  Students will be able to Define the Functional and Non Functional requirements for a
system and establish the project scope.
 Students will be able to Design use cases for a system and technical methods for
specifying the requirements
 Students will be able to Transform use cases to test cases for assessing the
requirements quality in iterative development.

TEXT BOOKS:
1. Leffingwell, D., Widrig, D., “Managing Software Requirements A Use case approach”,
Second Edition, Pearson Education.

REFERENCES:
1. Swapna Kishore, Rajesh Naik, “Software Requirements and Estimation”, Tata
McGraw Hill, 2001
2. K.Weigers, “Software Requirements”, Microsoft Press, 1999.
3. Ian Sommerville and P Sawyer, “Requirements engineering: A Good Practice Guide”.

135
 SOFTWARE TESTING & QUALITY ASSURANCE L T P C
IT18004 3 0 0 3
(COMMON TO IT & CS)

OBJECTIVES
 To understand mathematical foundations of software testing.
 To comprehend the phases of software testing
 To know the managerial aspects of software testing
 To understand software quality management process and quality management models
 To learn software quality metrics, assurance and various software standards

UNIT I INTRODUCTION TO SOFTWARE TESTING 9

Software testing lifecycle, software specifications, program correctness and verification,
Failures, errors and faults, testing taxonomy.

UNIT II TEST DATA GENERATION 9

Test generation concepts, Functional and structural criteria, Test Oracle design, Test Driver
design, Test outcome analysis.

UNIT III MANAGEMENT OF SOFTWARE TESTING 9

Metrics for software testing, tools – Scripting tools, record-and-replay tools, performance
testing tools, oracle design tools, exception discovery, collaborative tools.

UNIT IV SOFTWARE QUALITY 9

Defining Software Quality, Software Quality factors, Components of software quality
assurance system, pre project software quality components- Contract Review - Development
and Quality Plans, integrating quality activities in project life cycle.

UNIT V STANDARDS, CERTIFICATION AND ASSESSMENT 9

Need for standards, SQA Standards – ISO9001 Certification, bootstrap methodology, SPICE
project and process assessment, Organizing for Quality Assurance -Management and its Role
in Quality Assurance - SQA Unit & other actors, introduction to Six Sigma.

TOTAL : 45 PERIODS

OUTCOMES:
Upon completion of this course, the students will be able :
 Apply the knowledge of mathematics in software testing and test data generation
techniques.
 Implement appropriate procedures, Tools and test data generation techniques
 Choose the suitable Software Testing Tools
 Examine the benefits of software quality management process
 Develop a software quality assurance plan for software projects

136
TEXT BOOKS:
1. Ali Mili, Fairouz Tchier , “Software Testing: Concepts and Operations”, John wiley &
sons, 2015.
2. Daniel Galin, “Software Quality Assurance: From Theory to Implementation”, Pearson
Addison-Wesley, Second Edition, 2012.

REFERENCES:
1. Jeff Tian, “Software Quality Engineering: Testing, Quality Assurance, and
Quantifiable”, Wiley, 2006.
2. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and
Practices”, Pearson Education, 2006.
3. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson Education,
2007.

137
GE 18052 TOTAL QUALITY MANAGEMENT L T P C
(COMMON TO ME, AE, CS, EC & MR) 3 0 0 3
OBJECTIVES :
 To facilitate the understanding of Quality Management principles and processes.
 To learn TQM & process monitoring techniques
 To know about various quality management system implemented in industries

UNIT I INTRODUCTION 8
Fundamentals of TQM – Historical developments – important philosophies- (Deming,
Juran, Crossby, Ishikawa) and their impact of quality – Quality planning, Quality statement
– Quality policy.

UNIT II TQM PRINCIPLES 9

Customer focus - Customer satisfaction – customer perception of quality, customer
complaints, Employee involvement – Empowerment and Team work- Recognition and
Reward – Performance appraisal - Supplier Quality Management – Supplier Rating –
Supplier rating by Analytical Hierarchical Process (AHP)

UNIT III PROCESS MONITORING 9

Seven tools of quality, New Seven management tools, Statistical fundamentals – Normal
curve charts for variables and attributes, TPM – Concepts, Process Capability analysis ,
PDSA cycle, 5S, Kaizen.

UNIT IV TQM TECHNIQUES 10

Quality Functions Deployment (QFD) – house of Quality, QFD process and benefits,
Benchmarking process, Taguchi Quality Loss function, FMEA – concept, Industrial case
studies on DFMEA and PFMEA – Six Sigma –concepts- Methodologies

UNIT V QUALITY MANAGEMENT SYSTEMS 9

Need for ISO – ISO 9001: 2015 – Elements, Implementation, Documentation and
Auditing, QS 9000 / TS 16949 - ISO14000 and OSHAS 18000 – Concept requirements and
benefits – Case studies.
TOTAL : 45 PERIODS
OUTCOMES :
 Students will be able to describe the evolution and concepts of quality and Quality
Management
 Students will be able to Practice the Principles of TQM in work environment
 With industrial examples, student will be able to illustrate the process monitoring
tools
 Students will apply the quality techniques of TQM in industries

138
  With appropriate case studies, students will deploy the need of Quality
Management systems in industries

TEXT BOOKS:
1. Dale H. Besterfiled, et at., "Total quality Management", Third Edition, Pearson
Education Asia, Indian Reprint, 2006.
2. Poornima M. Charantimath, Total Quality Management, Pearson education, 3rd
edition, 2017
REFERENCES :
1. James R. Evans and William M. Lindsay, "The Management and Control of
Quality", 8th Edition, First Indian Edition, Cengage Learning, 2012.
2. Janakiraman. B and Gopal .R.K., "Total Quality Management - Text and Cases",
Prentice Hall (India) Pvt. Ltd., 2006.
3. Shridhara Bhat, “TQM Text and Cases”, Himalaya Publishing House, 2002.
4. Suganthi.L and Anand Samuel, "Total Quality Management", Prentice Hall (India)
Pvt. Ltd., 2006.
WEB RESOURCES:
1. https://nptel.ac.in/courses/110/104/110104080/
2. https://nptel.ac.in/courses/110/104/110104085/

139
CS18027 WEB PROGRAMMING L T P C
3 0 0 3
OBJECTIVES
 To understand various protcols and client server architecture.
 To study about various tags in html and style sheets.
 To impart knowledge in designing form using scripting language.
 To study about how to design server-side validation and backend connectivity.
 To acquire knowledge about document objects and xml.

UNIT I WEB ESSENTIALS: CLIENTS, SERVERS AND 9

COMMUNICATION
The Internet-Basic Internet Protocols (TCP/IP, UDP, DNS and High Level Protocols), World
Wide Web, HTTP-Request and Response Message, Web Clients and Web Servers.

UNIT II MARKUP LANGUAGES AND STYLE SHEETS: 9

HTML Introduction-Syntax, Fundamental HTML elements, URLs, Lists, Tables, Frames and
Forms ,STYLE SHEETS -Introduction to CSS, Features,syntax and its types.

UNIT III CLIENT SIDE PROGRAMMING –JAVASCRIPT: 9

CLIENT SIDE PROGRAMMING- History and Versions of JavaScript-Basic syntax,
Variables, Data types, Operators, Functions, Regular Expressions and Built in objects, Form
designing with JavaScript.

UNIT IV SERVER SIDE PROGRAMMING-JAVA SERVLETS and 9

DATABASE CONNECTIVITY:
Introduction to servlet-Architecture overview, Servlet life cycle- Basic syntax, Generation
of dynamic content with servlet, Session tracking with servlet (cookies and sessions) and
Generating dynamic web site with Database.

UNIT V HOST OBJECTS (DOM) and XML: 9

DOM: Introduction to DOM, History and levels, Document Tree, Event handling.
Representing web data: XML versions, Declarations, Namepaces, Javascript and XML
(AJAX),Dom based XML Processing.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course,
 Students get familiar with the basics of the internet programming
 Students acquire knowledge and skills for creation of web page for client side with
140
 basic HTML elements and CSS
 Students develop responsive web applications using Javascript
 Students acquire knowledge and skills for creating interactive website for both client
and server side using Servlet and DB
 Students get familiar with Document Object Model and XML

TEXT BOOKS:
1. Web Technologies-A Computer Science Perspective-Jeffrey C. Jackson, 4th Edition.
2. An Introduction to web development and Programming- Michael Mendez Suny Fredonia.

REFERENCES:
1. Core Web Programming, Marty Hall, Larry Brown, Prentice Hall, Second Edition,2001.
2. Eloquent Javasr, Third Edition, A Modern Introduction to Programming, Marijn
Haverbake,2018.
3. Servlet and JSP, Kindle Editin, Budi Kurniawan, First Edition,2012.

141
 ADVANCED USER INTERFACE TECHNOLOGIES L T P C
CS18002
(COMMON TO CS & IT) 3 0 0 3
OBJECTIVES
 To understand the concepts and need of TypeScript
 To understand and practice Client-side JS Framework, Basics of ANGULAR 4.0
 To understand on Front-end application development and the React library
 To understand various React features including components and forms

UNIT I INTRODUCTION TO TYPESCRIPT 9

TypeScript : Introduction to TypeScript – Features of TypeScript – Installation setup – Variables –
Datatypes – Enum – Array – Tuples – Functions – OOP concepts – Interfaces – Generics – Modules
– Namespaces – Decorators – Compiler options – Project Configuration

INTRODUCTION TO CLIENT-SIDE JS FRAMEWORK – BASICS OF

UNIT II 9
ANGULAR 4.0
Introduction to Angular 4.0 - Needs & Evolution – Features – Setup and Configuration –
Components and Modules – Templates – Change Detection – Directives – Data Binding - Pipes –
Nested Components

UNIT III INTRODUCTION TO CLIENT-SIDE JS FRAMEWORK – FORMS 9

AND ROUTING IN ANGULAR 4.0
Template Driven Forms - Model Driven Forms or Reactive Forms - Custom Validators - Dependency
Injection - Services - RxJS Observables - HTTP - Routing

UNIT IV INTRODUCTION TO REACT AND ITS ROUTER 9

Introduction to React: Platforms and Frameworks tools – Hybrid frameworks versus Native – React
Environment Setup – React internals – React JSX – React Components and its styling– React
Router: Parameters – Designing single page applications using React Router

UNIT V INTRODUCTION TO REDUX AND CLIENT-SERVER 9

COMMUNICATION
Introduced to uncontrolled and controlled forms – Form validation in React applications – Overview
of the Flux architecture - Introduction to Redux – React Redux Forms and its validation – Redux
Actions and Combining Reducers – Client-Server Communication and Fetch , Building and
Deploying the React Application

TOTAL (L:45): 45 PERIODS

142
OUTCOMES:
 Students will be able to excel expertly about the various Client-side JS Framework, Basics of
ANGULAR 4.0.
 Students will be able to review the various concepts and need of TypeScript.
 Students will be able to know the Front-end application development and the React library.
 Students will be to develop the various React features including components and forms.
 Students will be able to accomplish the functional front-end web application using React.

TEXT BOOKS:

1. Nate Murray, Felipe Coury, Ari Lerner and Carlos Taborda, “ng-book, The Complete Book
on Angular 4”, First Edition, CREATESPACE Publishers, 2017.
2. Michele Bertoli, “React Design Patterns and Best Practices: Build easy to scale modular
applications using the most powerful components and design patterns” , First Edition, Packt
Publishing, 2017

REFERENCES:

1. Nathan Rozentals, “Mastering TypeScript”, Second Edition, Packt Publishing, 2017.

2. Matt Frisbie, “Angular 2 Cookbook”, First Edition, Packt Publishing, 2017.
3. Kirupa ChinnathambI, “Learning React: A Hands-On Guide to Building Web Applications
Using React and Redux”, Second Edition, Pearson Education, 2018.

143
 AGILE METHODOLOGIES L T P C
CS18004 (Common to CS and IT) 3 0 0 3
OBJECTIVES
 To provide knowledge and understanding of agile software development approaches.
 To provide a good knowledge on Agile based software design.
 To do thorough analysis on agile development knowledge.
 To understand the agility and requirement management.
 To understand agile quality. Metrics and testing.

UNIT I AGILE METHODOLOGY 9

Theories for Agile Management – Agile Software Development – Traditional Model vs. Agile
Model – Classification of Agile Methods – Agile Manifesto and Principles – Agile Project
Management – Agile Team Interactions – Ethics in Agile Teams – Agility in Design, Testing –
Agile Documentations – Agile Drivers, Capabilities and Values.

UNIT II AGILE PROCESSES 9

Lean Production – SCRUM, Crystal, Feature Driven Development- Adaptive Software
Development – Extreme Programming: Method Overview – Lifecycle – Work Products, Roles
and Practices.

UNIT III AGILITY AND KNOWLEDGE MANAGEMENT 9

Agile Information Systems – Agile Decision Making – Earl S Schools of KM – Institutional
Knowledge Evolution Cycle – Development, Acquisition, Refinement, Distribution,
Deployment , Leveraging – KM in Software Engineering – Managing Software Knowledge –
Challenges of Migrating to Agile Methodologies – Agile Knowledge Sharing – Role of Story-
Cards – Story-Card Maturity Model (SMM).

UNIT IV AGILITY AND REQUIREMENTS ENGINEERING 9

Impact of Agile Processes in RE–Current Agile Practices – Variance – Overview of RE- Using
Agile – Managing Unstable Requirements – Requirements Elicitation – Agile Requirements
Abstraction Model – Requirements Management in Agile Environment, Agile Requirements
Prioritization – Agile Requirements Modeling and Generation – Concurrency in Agile
Requirements Generation.
UNIT V AGILITY AND QUALITY ASSURANCE 9
Agile Product Development – Agile Metrics – Feature Driven Development (FDD) – Financial
and Production Metrics in FDD – Agile Approach to Quality Assurance – Test Driven
Development – Agile Approach in Global Software
144 Development.
TOTAL (L:45): 45 PERIODS
OUTCOMES:
On the completion of the course,

 Students can understand the importance of interaction with stakeholders in gathering

the requirements for a software.
 Students can perform planning of agile iterative software development processes.
 Students can develop techniques and tools for improving agile process.
 Students can practice agile knowledge management processes.
 Students can understand about agile approaches, Metrics and quality

TEXT BOOKS:
1. David J. Anderson and Eli Schragenheim―Agile Management for Software
Engineering: Applying the Theory of Constraints for Business Results, Prentice Hall,
2003.

REFERENCES:
1. Hazza and Dubinsky, ―Agile Software Engineering, Series: Undergraduate Topics
in Computer Science, Springer, 2009.
2. Craig Larman, ―Agile and Iterative Development: A Managers Guide, Addison-
Wesley, 2004.
3. Kevin C. Desouza, ―Agile Information Systems: Conceptualization, Construction,
and Management, Butterworth-Heinemann, 2007.

145
CS18006 BLOCKCHAIN TECHNOLOGY L T P C
3 0 0 3
OBJECTIVES
 To understand blockchain technology
 To study the technologies behind crypto currencies
 To explore various blockchain plotforms
 To acquire the emerging impacts of the industry
 To aware the blockchain resources and projects

UNIT I INTRODUCTION TO BLOCKCHAIN 9

Introducing Blockchain – The Structure of Blockchain – Blockchain Applications- The

Driving Force of Blockchain – Picking a Blockchain – Where Blockchain Add Substance -
Choosing a Solution- Getting Your Hands on Blockchain

UNIT II BEHOLDING THE BLOCKCHAIN 9

History of the Bitcoin Blockchain - Encountering the Ethereum Blockchain – Ethereum -
Hacking a Blockchain – Getting Up and Running on Ethereum- Riding the Waves Blockchain.

UNIT III POWERFUL BLOCKCHAIN PLATFORMS. 9

Hyperledger - Smart Contracts on Hyperledger - Microsoft Azure - Modular Blockchain
Fabric - Azure Ecosystem - Blockchain Tools on Azure - Business Blockchain on Bluemix-
Watson’s Smart Blockchain

UNIT IV INDUSTRY IMPACTS 9

Financial Technology- Real Estate- Insurance- Government- Lean Governments- The Trust
Layer for the Internet

UNIT V THE PART OF TENS. 9

Ten (Or So) Free Blockchain Resources- The Ten Rules to Never Break on the Blockchain-
Ten Top Blockchain Projects

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Students will be able to recognize the importance of blockchain technology.

146
  Students will be able to explain the challenges and design issues in bitcoin technology.
 Students will be able to categorize the platforms developed for blockchain.
 Students will be able to use appropriate techniques to study impacts of industry.
 Students will be able to use the block chain resources and projects.

TEXT BOOKS:
1. Tiana Laurence, “Blockchain For Dummies”, John Wiley & Sons, Inc 2019

REFERENCES:
1. Imran Bashir,” Mastering Blockchain”,Packt Publishing 2017
2. Narayan Prusty,” Building Blockchain Projects, Packt Publishing 2017
3. Don and Alex Tapscott, “Blockchain Revolution”. Portfolio Penguin 2016.
4. William Mougayar, “Business Blockchain Promise, Practice and Application of the
Next Internet Technology, John Wiley & Sons 2016.

147
CS18008 BUSINESS INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES
 Be exposed with the basic rudiments of business intelligence system
 Understand the modeling aspects behind Business Intelligence
 Be exposed with different data analysis tools and techniques
 Apply business intelligence in different domain
UNIT I DECISION SUPPORT AND BUSINESS INTELLIGENCE 9
Definition, concept and need for Business Intelligence – Changing Business Environments and
Computerized Decision Support, Managerial Decision Making, Computerized Support for Decision
Making, An Early framework for Computerized decision support, Concept of Decision Support
Systems, A framework for Business Intelligence, Major Tools and Techniques, Decision Making –
Introduction and Definitions, Models, Phases of the decision-Making process, Decision Support
System – Concepts, Methodologies and Technologies, Classifications, Components of Decision
Support Systems

UNIT II KNOWLEDGE DELIVERY 9

The business intelligence user types, Standard reports, Interactive Analysis and Ad Hoc Querying,
Automated reports and Self-Service Reporting, dimensional analysis, Alerts/Notifications,
Visualization: Charts, Graphs, Widgets, Scorecards and Dashboards, Heatmap, Geographic
Visualization, Integrated Analytics, Considerations: Optimizing the Presentation for the Right
Message

UNIT III DATA STORAGE FOR BUSINESS INTELLIGENCE 9

Data Mining Concepts and Applications, Data Mining Applications, Data Mining Process, Data
Mining Methods, Artificial Neural Networks for Data Mining, Data Warehousing – Definitions and
Concepts, Process Overview, Architectures, ETL Process, Data warehouse development, Real-Time
Data Warehousing

UNIT IV BUSINESS INTELLIGENCE TOOLS FOR APPLICATIONS 9

Text and Web Mining – Text mining applications and tools, Web Mining – Overview, Web content
mining and web structure mining, Web usage Mining. Data Visualization – Using R, Case Studies –
Boston Housing Data, Iris Dataset

UNIT V FUTURE OF BUSINESS INTELLIGENCE 9

Future of business intelligence – Emerging Technologies, Machine Learning, Predicting the Future, BI
Search & Text Analytics – Advanced Visualization – Rich Report, Future beyond Technology

TOTAL (L:45): 45 PERIODS

148
OUTCOMES:
 Students will be able to apply the ETL concepts, tools and techniques to perform Extraction,
Transformation and Loading of data.
 Students will be able to summarize the usable data by using various reporting concepts,
techniques/tools, and use charts, tables for reporting in BI.
 Students will be able to use Analytics concepts like data mining, Exploratory and statistical
techniques for predictive analysis in Business Intelligence.
 Students will be able to demonstrate application of concepts in BI.
 Students will be able to analyze and carry out an empirical evaluation of different algorithms
on a problem formalization, and state the conclusions that the evaluation supports..

TEXT BOOKS:
1. Efraim Turban, Ramesh Sharda, DursunDelen, “Decision Support and Business
Intelligence Systems”, 9th Edition, Pearson 2013.
2. GalitShmueli, Nitin R. Patel and Peter C. Bruce, ―Data Mining for Business Intelligence:
Concepts, Techniques, and Applications in Microsoft Office Excel with XLMiner, Wiley,
2007

REFERENCES:
1. Larissa T. Moss, S. Atre, “Business Intelligence Roadmap: The Complete Project Lifecycle
of Decision Making”, Addison Wesley, 2003.
2. David Loshin Morgan, Kaufman, “Business Intelligence: The Savvy Manager’s Guide”,
Second Edition, 2012.
3. Cindi Howson, “Successful Business Intelligence: Secrets to Making BI a Killer App”,
McGraw-Hill, 2007.
4. . Ralph Kimball , Margy Ross , Warren Thornthwaite, Joy Mundy, Bob Becker, “The Data
Warehouse Lifecycle Toolkit”, Wiley Publication Inc.,2007.

149
CS18010 COMPUTER GRAPHICS L T P C
3 0 0 3
OBJECTIVES
 Gain knowledge about graphics hardware devices and software used.
 Understand the two dimensional graphics and their transformations.
 Understand the three dimensional graphics and their transformations.
 Appreciate illumination and color models.
 Be familiar with understand clipping techniques.

UNIT I INTRODUCTION 9
Survey of computer graphics, Overview of graphics systems – Video display devices, Raster
scan systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard
copy Devices, Graphics Software; Output primitives – points and lines, line drawing
algorithms, loading the frame buffer, line function; circle and ellipse generating algorithms

UNIT II TWO DIMENSIONAL GRAPHICS 9

Two dimensional geometric transformations – Matrix representations and homogeneous
coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing
coordinate reference frame; widow-to-viewport coordinate transformation, Two dimensional
viewing functions; clipping operations – point, line, and polygon clipping algorithms.

UNIT III THREE DIMENSIONAL GRAPHICS 9

Three dimensional concepts; Three dimensional object representations – Polygon surfaces-
Polygon tables-Plane equations - Polygon meshes; Curved Lines and surfaces, Quadratic
surfaces; Blobby objects; Spline representations – Bezier curves and surfaces -B-Spline curves
and surfaces. TRANSFORMATION AND VIEWING: Three dimensional geometric and
modeling transformations – Translation, Rotation, Scaling, composite transformations; Three
dimensional viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible
surface detection methods.

UNIT IV ILLUMINATION AND COLOUR MODELS 9

Light sources - basic illumination models – halftone patterns and dithering techniques;
Properties of light - Standard primaries and chromaticity diagram; Intuitive colour concepts -
RGB colour model - YIQ colour model - CMY colour model - HSV colour model - HLS
colour model; Colour selection.

150
UNIT V ANIMATIONS & REALISM 9
ANIMATION GRAPHICS: Design of Animation sequences – animation function – raster
animation – key frame systems – motion specification –morphing – tweening. COMPUTER
GRAPHICS REALISM: Koch curves – Dragons – space filling curves – fractals – Grammar
based models - turtle graphics – ray tracing.
TOTAL (L:45): 45 PERIODS
OUTCOMES:
 Students will be able to understand the graphics hardware devices and software used
and to apply line drawing algorithm and ellipse generating algorithms.
 Students will be able to make use of the techniques of transformation and to apply two
dimensional transformations
 Students will be able to make use of the techniques of transformation and to apply three
dimensional transformations
 Students will be able to apply illumination and color models
 Students will be able to construct animation sequences using multimedia tool, to use
grammar-based models and fractals

TEXT BOOKS:
1. Donald Hearn and Pauline Baker M, “Computer Graphics , Prentice Hall, New Delhi,
2007

REFERENCES:
1. Donald Hearn and M. Pauline Baker, Warren Carithers,“Computer Graphics With Open
GL”, 4th Edition, Pearson Education, 2010.
2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett
Publishers, 2006.
3. Hill F S Jr., Computer Graphics, Maxwell Macmillan” , 1990.
4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik
Reinhard, Kelvin Sung, and AK Peters, Fundamental of Computer Graphics, CRC Press,
2010.
5. William M. Newman and Robert F.Sproull, “Principles of Interactive Computer
Graphics”, Mc Graw Hill1978.

151
CS18012 MOBILE ADHOC NETWORKS L T P C
3 0 0 3
OBJECTIVES
 Explore types of wireless networks
 Learn the different mechanisms in MAC
 Be familiar with wireless routing
 Security aspects of wireless
 Be familiar with energy management
UNIT I WIRELESS NETWORKS 9

Cellular and ad hoc wireless networks, Applications of ad hoc wireless networks. Issues in ad
hoc wireless networks-medium access scheme, routing, transport layer protocols, security and
energy management. Ad hoc wireless internet.

UNIT II WIRELESS MEDIA ACCESS CONTROL 9

Design goals of a MAC protocol, Contention based protocols; Contention based protocols with
reservation mechanisms and scheduling mechanisms, MAC protocols using directional
antennas.

UNIT III ROUTING FOR WIRELESS 9

Table driven routing protocols, On demand routing protocols, hybrid routing protocols,
Hierarchical routing protocols, Power aware routing protocols, Tree based and mesh based
multicast routing protocols

UNIT IV WIRELESS SECURITY 9

Network security requirements-Issues and challenges, network security attacks, key
management, secure routing protocols

UNIT V ENERGY MANAGEMENT IN AD HOC NETWORKS 9

Energy management schemes-Battery management, transmission power management,
system power management schemes. Quality of service solutions in ad hoc wireless
networks.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
 Student will be to analyse the challenges and design issues in mobile adhoc networks.
 Student acquires knowledge on protocols used at the MAC layer and scheduling
mechanisms

152
  Student will be able to understand the types of routing protocols used for unicast and
multicast routing
 Student will examine the network security solution and routing mechanism
 Student will be able to understand the energy management schemes and Quality of
service solution in ad hoc networks

TEXT BOOKS:
1. C.Siva ram murthy,B.S. Manoj, “Ad hoc wireless networks-Architectures and
protocols” Pearson Education, 2005
2. Stefano Basagni, Marco Conti, “Mobile ad hoc networking”, Wielyinterscience 2004

REFERENCES:
1. Xiuzhen Cheng, Xiao Huang ,Ding Zhu DU ,”Ad hoc wireless networking”, Kluwer
Academic Publishers,2004
2. George Aggelou, Mobile ad hoc networks-From wireless LANs to 4G networks,
McGraw Hill publishers, 2005
3. Charles E. Perkins , “Ad hoc networking”, Addison Wesley,2001

153
CS18014 OBJECT ORIENTED ANALYSIS AND DESIGN L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
 Learn the basics of OO Analysis and Design skills.
 Learn the UML diagrams for Modeling.
 Learn Design Patterns.
 Learn Layered Architecture.
 Learn to map design to code.

UNIT I INTRODUCTION & INCEPTION 9

Object-Oriented Analysis and Design - Iterative, Evolutionary, and Agile : Unified Process,
Iterative and Evolutionary Development, Waterfall Lifecycle, How to do Iterative and
Evolutionary Analysis and Design, Agile Methods and Attitudes, Agile Modeling, Agile UP,
UP Phases, UP Disciplines - Case Studies : The NextGen POS System, The Monopoly Game
System - Inception is Not the Requirements Phase - Evolutionary Requirements, - Use Cases –
Relating Use Cases – Use Case Formats – Use Case Guidelines

UNIT II ELABORATION - BASICS 9

Domain Models - System Sequence Diagrams - Operation Contracts - Logical Architecture
and UML Package Diagrams - UML Interaction Diagrams - UML Class Diagrams - Designing
for Visibility - Refactoring

UNIT III ELABORATION - DESIGN PATTERNS 9

GRASP: Designing Objects with Responsibilities, Polymorphism, Pure Fabrication - Object
Design Examples with GRASP : What is a Use Case Realization, Use Case Realizations for
the NextGen Iteration - Applying GoF Design Patterns : Adapter, Factory, Singleton (GoF),
Strategy (GoF), Composite (GoF), Facade (GoF), Observer/Publish-Subscribe/Delegation
Event Model

UNIT IV ELABORATION – DYNAMIC MODELING 9

UML Activity Diagrams and Modeling - UML State Machine Diagrams and Modeling -
Domain Model Refinement - Logical Architecture Refinement - Designing a Persistence
Framework with Patterns - UML Deployment and Component Diagrams

UNIT V OBJECT ORIENTED TESTING 9

Mapping design to code – Testing: Issues in OO Testing – Class Testing – OO Integration
Testing – GUI Testing – OO System Testing 154
TOTAL (L:45): 45 PERIODS
OUTCOMES
 Students will be able to build projects using Object Oriented concepts
 Students will be able to examine UML diagrams
 Students will be able to interpret appropriate design patterns.
 Students will be able to extract code from design.
 Students will be able to classify various OO testing techniques..

TEXT BOOKS:
1. Craig Larman, "Applying UML and Patterns: An Introduction to Object-Oriented
Analysis and Design and Iterative Development”, Third Edition, Pearson Education,
2005.
2. Paul C. Jorgensen, “Software Testing:- A Craftsman’s Approach”, Third Edition,
Auerbach Publications, Taylor and Francis Group, 2008.

REFERENCES:
1. Simon Bennett, Steve Mc Robb and Ray Farmer, “Object Oriented Systems Analysis
and Design Using UML”, Fourth Edition, Mc-Graw Hill Education, 2010.
2. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, “Design patterns:
Elements of Reusable Object-Oriented Software”, Addison-Wesley, 1995.
3. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling
Language”, Third edition, Addison Wesley, 2003.

155
 CP18016 PARALLEL AND DISTRIBUTED COMPUTING L T P C
3 0 0 3
OBJECTIVES
 To understand the basic knowledge in parallel and distributed computing.
 To explore the models of distributed computing
 To understand parallel algorithm design
 To parallelize and implement the serial algorithms

UNIT I INTRODUCTION TO PARALLEL COMPUTING AND 9

PALTFORMS
Introduction-Motivation and scope of parallel computing-Parallel programming platforms-
implicit parallelism-Limitations of Memory system performance-dichotomy-Physical
Organization of parallel platforms-Communication costs in parallel machines-Routing
mechanisms for Interconnection Networks-Impact of Process-Processor mapping and Mapping
Techniques

UNIT II PRINCIPLES OF PARALLEL ALGORITHM DEISGN 9

Preliminaries-Decomposition Techniques-Characteristics of Tasks and interactions-Mapping
techniques for load balancing-Methods for Containing interaction Overheads-Parallel Algorithm
Models-Performance metrics for Parallel systems

UNIT III PROGRAMMING SHARED ADDRESS SPACE PLATFORMS 9

POSIX Thread-Basics-Synchronization-OpenMP Programming Model -Synchronization-Data
Handling-Library Functions-Environment variables

UNIT IV MESSAGE -PASSING PARADIGM 9

Principles-Building Blocks-MPI-Topologies and embedding-Overlapping communications with
computation-collective Communication and Computation Operations-Groups and
Communicators

UNIT V CASE STUDY 9

Sorting-Graph Algorithms-Fast Fourier Transform

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to:
 Students will be able to describe the requirements of parallel computing.
 Students can be able to discover and implement parallel algorithms.
156
  Students can be able to compute Programming Model
 Students can be able to discover Topologies and communication methods .
 Students will be able to apply the algorithms and Improving the performance .

TEXT BOOK:
1. Author Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar “Title
Introduction to Parallel Computing” Publisher pearson Education Second edition,
2003.

REFERENCES:
1. Peter S. Pacheco, “An Introduction to Parallel Programming”,
MorganKauffman/Elsevier, 2011.
2. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata
McGraw Hill, 2003.(Unit II) Ralf Steinmetz and Klara Nahrstedt, ―Multimedia
Computing, Communications and Applications‖, First Edition, Pearson, 2005.

157
CS18018 REAL TIME OPERATING SYSTEMS L T P C
3 0 0 3
OBJECTIVES
 Understand fundamental concepts of Real Time Systems
 Know the various Task scheduling algorithms for RTOS
 Understand RTOS Models, Language for RTOS
 Know the various real time applications.

UNIT I BASICS OF REAL TIME SYSTEMS 9

Overview of Embedded Systems, Realtime Systems, Characteristics of Realtime Systems,
Types of Realtime Systems, Difference between Traditional Operating System and Real-time
Operating System - Real Time Task – Modelling Timing Constraint.

UNIT II REAL TIME SCHEDULING 9

Task Scheduling in RTOS – Cyclic Scheduler- Event Driven Scheduler – Rate Monotonic
Algorithm- RMA Task Schedulability -Issues associated with RMA-Deadline Monotonic
Algorithm- Resource Sharing in Real-time tasks – Priority Inversion Protocol Event Control
Blocks.

UNIT III REAL TIME MODELS AND COMMUNICATIONS 9

Event Based – Process Based and Graph based Models – Real Time Languages – Interrupt
Handling - Synchronization-Message queues– Mail boxes –pipes –Memory Management.

UNIT IV REAL TIME KERNEL 9

Principles – Design Strategies – Polled Loop Systems – RTOS Porting to a Target –
Comparison and Basic study of various RTOS like – Free RTOS-Micro C/ OS-VX works –
Linux supportive RTOS – C Executive – Comparison of Uni-processor RTOS and
Multiprocessor RTOS.

UNIT V RTOS APPLICATIONS 9

Case studies - RTOS for Image Processing – Embedded RTOS for Network communication –
RTOS for fault-Tolerant Applications – RTOS for Control Systems.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Students will be able to
 Identify the basic concepts Real-time OS.
 Apply the concepts of Real-time Scheduling.

158
  Design Real-time Model.
 Recognize the principles of Real-time Kernel
 Recognize the applications of RTOS.

TEXT BOOKS:
1. Rajib Mall, “Real-Time Systems:Theory and Pratice”, First edition,Pearson,2007.
2. Wang, K.C.,”Embedded and Real-Time Operating Systems”, Springer, 2016.

REFERENCES:
1. Jean J. Labrosse, “MicroC/OS II The Real-Time Kernel”, Second Edition,
2. Filip Thoen, Francky Catthoor, “Modeling verification and exploration of task-level
concurrency in real-time embedded systems”, First Edition, Springer-Science +
Business Media ,B.V, 2000

159
CS18020 SERVICE ORIENTED ARCHITECTURE AND WEB L T P C
SERVICES 3 0 0 3
OBJECTIVES
The student should be made to:
 Understand the key principles behind SOA.
 Be familiar with the web services technology elements for realizing SOA.
 To know about layered architecture
 To learn planning and analysis and delivery strategies
 Build service based applications

UNIT I SERVICE ORIENTED ARCHITECTURE 9

Characteristics of SOA, Comparing SOA with Client-Server and Distributed architectures –
Benefits of SOA — Principles of Service orientation – Service layers.

UNIT II WEB SERVICES 9

Service descriptions – WSDL – Messaging with SOAP – Service discovery – UDDI –
Message Exchange Patterns – Orchestration – Choreography –WS Transactions.

UNIT III ACTIVITY MANAGEMENT 9

SOA and WS-* Extensions - Web Services and Contemporary SOA: Activity Management
and Composition - Advanced Messaging – Metadata - Security.

UNIT IV SERVICE ORIENTED ANALYSIS 9

SOA and service orientation - Principles of Service-Orientation - Service Layers - Building
SOA – Planning and analysis - SOA Delivery Strategies - Service-Oriented Analysis -
Introduction - Service Modeling

UNIT V BUILDING SOA-BASED APPLICATIONS 9

Building SOA – Technology and design - Service-Oriented Design: Introduction - SOA
Composition Guidelines - Service Design - Business Process Design

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course,
 Students can understand characteristics of SOA
 Students gain the skill to build the web services
 Students can identify activities in Web service development
 Students can acquire knowledge on service oriented analysis
 Students can develop / build SOA based applications

160
TEXT BOOKS:
1. Thomas Erl, “Service Oriented Architecture: Concepts, Technology, and Design”,
Pearson Education, 2005
2. Ben Margolis and Joseph Sharpe, “SOA for the Business Developer: Concepts,
BPEL, and SCA”, First Edition by MC Press 2007

REFERENCES:
1. Eric Newcomer, Greg Lomow, “Understanding SOA with Web Services”, Pearson
Education, 2005
2. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services: An
Architect’s Guide”, Prentice Hall, 2004
3. YuliVasiliev, “SOA and WS-BPEL”, Packt Publishing; 1st Ed. Edition, 2007

161
CS18022 SOFTWARE DEFINED NETWORKS L T P C
3 0 0 3
OBJECTIVES:
 To learn about what software defined networks are
 To understand the separation of the data plane and the control plane
 To learn the various SDN controllers
 To learn about the use of SDN in data centers
 To learn about different applications of SDN

UNIT I INTRODUCTION 9

History of Software Defined Networking (SDN) – Modern Data Center – Traditional Switch
Architecture – Active Networks – Network Virtualization – Why SDN – Evolution of SDN –
How SDN Works – Centralized and Distributed Control and Date Planes

UNIT II CONTROL PLANE AND DATA PLANE SEPERATION 9

Mininet Topologies and Mininet Python API- Virtualization - Applications of Virtual Networking
- Network Virtualization with mininet – Control and Data plane Separation – Routing Control
Platform

UNIT III OPEN FLOW & SDN CONTROLLERS 9

Open Flow Specification – Drawbacks of Open SDN, SDN via APIs, SDN via Hypervisor-Based
Overlays – SDN via Opening up the Device – SDN Controllers – Customizing SDN Controllers –
Commercial Controllers – ODL and RYU

UNIT IV DATA CENTERS AND NETWORK VIRTUALIZATION 9

Virtualization – Applications of Virtual Networking - Multitenant and Virtualized Multitenant

Data Center – SDN Solutions for the Data Center Network – VLANs – EVPN – VxLAN –
NVGRE

UNIT V SDN PROGRAMMING 9

Programming SDNs: Northbound Application Programming Interface, Current Languages
and Tools, Composition of SDNs – Network Functions Virtualization (NFV) and Software
Defined Networks: Concepts, Implementation and Applications.

TOTAL: (L:45 + T: ): 45 PERIODS

162
OUTCOMES:
 Students will develop the concepts of software defined networks.
 Students will need to analyse separation of the data plane and the control plane.
 Students will be able to the interface between networking devices and the software
controlling them.
 Students will be to accomplish the various functions of SDN controllers.
 Students will be able to develop the functions SDN in data centers and different
applications of SDN.

TEXT BOOKS:
1. Thomas D. Nadeau, Ken Gray, ―SDN: Software Defined Networks‖, O'Reilly
Media, August 2013.
2. Paul Goransson and Chuck Black, ―Software Defined Networks: A Comprehensive
Approach‖, First Edition, Morgan Kaufmann, June 2014.

REFERENCES:
1. SiamakAzodolmolky, ―Software Defined Networking with OpenFlow‖, Packet
Publishing , 2013.
2. Vivek Tiwari, ―SDN and OpenFlow for Beginners‖, Amazon Digital Services, Inc., 2013.
3. Fei Hu, Editor, ―Network Innovation through OpenFlow and SDN: Principles and
Design‖, CRC Press, 2014.

163
 L T P C
CS18024 UNIX INTERNALS
3 0 0 3
OBJECTIVES:
 To get thorough understanding of the kernel.
 To understand the file organization and management.
 To know the various system calls.
 To have a knowledge of process architecture, process control & scheduling and memory
management.
UNIT I GENERAL OVERVIEW OF THE SYSTEM AND THE KERNEL 9
History – System structure – User perspective – Operating system services –Assumptions about hardware.
Introduction to the Kernel: Architecture of the UNIX operating system – Introduction to system concepts
– Kernel data structures – System administration.

UNIT II BUFFER CACHE AND FILES 9

Buffer headers – Structure of the buffer pool – Advantages and disadvantages of the buffer cache. Internal
representation of files: Inodes – Structure of a regular file – Directories – Conversion of a path name to an
Inode – Super block – Other file types.

UNIT III SYSTEM CALLS FOR THE FILE SYSTEM 9

Open – Read – Write – File and record locking – Adjusting the position of file I/O –LSEEK – Close –
File creation – Creation of special files – Pipes – Dup – Mounting and unmounting file systems.

UNIT IV PROCESS – STRUCTURE, CONTROL AND SCHEDULING 9

Process states and transitions – Layout of system memory – The context of a process – Saving the context
of a process. Process Control: Process creation – Signals – Process termination – Awaiting process
termination – Invoking other programs – The shell – System boot and the INIT process. Process
Scheduling and Time.

UNIT V MEMORY MANAGEMENT POLICIES AND IPC 9

Memory Management Policies: Swapping – A hybrid system with swapping and demand paging. The I/O
Subsystem: Driver Interfaces– Disk Drivers-Terminal Drivers. Interprocess Communication: Process
Tracing– Network Communications – Sockets. Multiprocessor Systems. Distributed Systems: Satellite
Processors – The Newcastle Connection – Transparent Distributed File Systems.

TOTAL : 45 PERIODS
OUTCOMES:
 The student will be able to interpret the basics of Unix operting system and the kernel
 The student will be able to illustrate the operational concepts of buffer cache and files
 The student will be able to summarize the system calls to operate on the file system
 The student will be able to examine the various aspects of processes like process structure, process

164
 control and scheduling
 The student will be able to apply concepts of the memory management and inter process
communication to solve problems
TEXT BOOKS:
1. Maurice J. Bach, “The Design of the Unix Operating System”, Prentice Hall of India, 2004.

REFERENCES:
1. UreshVahalia, “UNIX Internals: The New Frontiers”, Prentice Hall, 2000.
2. John Lion, “Lion’s Commentary on UNIX”, 6 th edition, Peer-to-Peer Communications, 2004.
3. Daniel P. Bovet & Marco Cesati, “Understanding the Linux Kernel”, O’REILLY, Shroff
Publishers &Distributors Pvt. Ltd, 2000.

165
OE18501 BASIC OPERATING SYSTEMS L T P C
3 0 0 3
OBJECTIVES
To learn the various aspects of operating systems such as process management, memory
management, file systems, and I/O management

UNIT I INTRODUCTION TO OS 9
Introduction to operating systems – review of computer organization – operating system
structures – system calls – system programs – system structure – virtual machines.

UNIT II PROCESS SCHEDULING 9

Processes: Process concept – Process scheduling – Operations on processes – Cooperating
processes – Interprocess communication, CPU Scheduling: Scheduling criteria – Scheduling
algorithms

UNIT III PROCESS SYNCHRONIZATION 9

Process Synchronization: The critical-section problem – Synchronization hardware –
Semaphores – Classic problems of synchronization – Deadlock: System model – Deadlock
characterization – Methods for handling deadlocks – Deadlock prevention – Deadlock
avoidance – Deadlock detection – Recovery from deadlock

UNIT IV STORAGE MANAGEMENT 9

Memory Management: Background – Swapping – Contiguous memory allocation – Paging –
Segmentation – Segmentation with paging. Virtual Memory: Background – Demand paging,
Page replacement
UNIT V FILE & I/O SYSTEMS 9
File-System Interface: File concept – Access methods – Directory structure –Directory
implementation – Allocation methods, I/O Systems - Disk scheduling RAID structure
TOTAL (L:45): 45 PERIODS

OUTCOMES:
On the completion of the course ,
 Students will be able to apply the functionality of Operating Systems
 Students will be able to design various Scheduling algorithms.
 Students will be able to apply the principles of concurrency and to design deadlock,
prevention and avoidance algorithms.
 Students will be able to compare and contrast various memory management schemes.
 Students will be able to design and implement a prototype file systems.

TEXT BOOKS
1. Abhraham Silberschatz, Peter B Galvin, and Gerg Gagne, “Operating System
Concepts”, 10th Edition, Wiley India Pvt Ltd, 2018

REFERENCES
1. Andrew S. Tanenbaum, “Modern Operating Systems”, fourth Edition, Pearson
Education/PHI, 2015

166
OE18503 BASICS ON CYBER SECURITY AND ETHICAL L T P C
HACKING 3 0 0 3
OBJECTIVES
 Acquire fundamental knowledge on the concepts of cyber security and Ethical Hacking
 understand cyber-attack, types of cybercrimes, cyber laws
 Demonstrate the techniques for system hacking
 Detect and prevent the security attacks in different environments

UNIT I INTRODUCTION TO CYBER SECURITY 9

Network and Security concepts- Information Assurance Fundamentals, Basic Cryptography-
Symmetric Encryption, Public Key Encryption, Firewalls, Microsoft Windows Security
Principles.

UNIT II ATTACKERS TECHNIQUES AND MOTIVATION 9

Proxies- Types – Detecting the use of proxies , Tunneling Techniques- HTTP, DNS, ICMP,
Steganography- Detection and prevention, Fraud Techniques- Phishing-Malicious code, Rogue
Antivirus, Threat Infrastructure- Botnets, Fast-flux.

UNIT III MALICIOUS CODE 9

Self-Replicating Malicious Code- Virus, worms, Evading Detection and Elevating Privileges,
Rootkits, Spyware, Token Kidnapping, Man in the middle attack, Form Grabbing, DLL
injection- Windows Registry DLL Injection- Injecting Applications - Reflective DLL
Injections, Browser Helper Objects

UNIT IV INTRODUCTION TO ETHICAL HACKING 9

Foundation Topics, Security Fundamentals, Security Testing, Hacker and Cracker Description,
Ethical Hackers, Test Plans, Ethics and Legality, Attacker’s Process, The ethical hacker’s
process, Security and the Stack.
UNIT V TECHNICAL FOUNDATIONS OF HACKING 9
Footprinting & Scanning- Overview of the Seven-Step Information-Gathering Process,
Information Gathering, Documentation, Google Hacking, Usenet, Identifying Active machines,
Finding Open Ports and Access Points, OS Fingerprinting, System Hacking, Malware threats –
Trojans, Keystroke Logging and Spyware, Covert Communication, Malware Countermeasures,
Sniffers, Session Hijacking, and Denial of Service.
TOTAL (L:45): 45 PERIODS

OUTCOMES:
On the completion of the course,
 Students will be able to understand cyber-attack, types of cybercrimes, cyber laws.
 Students will be able to protect them self and ultimately society from such attacks
167
  Students will be able to describe and understand the basics of the ethical hacking
 Students will be able to demonstrate the techniques for system hacking
 Students will be able to detect and prevent the security attacks in different
environments

TEXT BOOKS:
1. Cyber Security Essentials by James Graham , Richard Howard, Ryan Olson, CRS Press,
Taylor & Francis Group, New York.
2. Certified Ethical Hacker, Version 9, Second Edition, Michael Gregg, Pearson IT
Certification

REFERENCES:
1. Anti- Hacker Tool Kit (Indian edition) by Mike Sherma , Mc Graw Hill publication
2. Hacking the Hacker, Roger Grimes, Wiley
3. The Unofficial Guide to Ethical Hacking, Ankit Fadia, Premier Press

168
OE18505 INTRODUCTION TO INTERNET OF THINGS L T P C
3 0 0 3
OBJECTIVES
● To introduce the terminology, technology and its applications
● To introduce the concept of M2M (machine to machine) with necessary protocols
● To introduce the Python Scripting Language which is used in many IoT devices
● To introduce the Raspberry PI platform, that is widely used in IoT applications
● To apply the concept of Internet of Things in the real world scenario

UNIT I INTRODUCTION TO INTERNET OF THINGS 9

Definition and Characteristics of IoT, Physical Design of IoT – IoT Protocols, IoT
communication models, Iot Communication APIs IoT enabaled Technologies – Wireless Sensor
Networks, Cloud Computing, Big data analytics, Communication protocols, Embedded
Systems, IoT Levels and Templates Domain Specific IoTs

UNIT II IOT AND M2M 9

Software defined networks, network function virtualization, difference between SDN and NFV
for IoT Basics of IoT System Management with NETCOZF, YANG- NETCONF, YANG,
SNMP NETOPEER

UNIT III INTRODUCTION TO PYTHON 9

Language features of Python, Data types, data structures, Control of flow, functions, modules,
packaging, file handling, data/time operations, classes, Exception handling Python packages –
JSON, XML, HTTPLib, URLLib, SMTPLib

UNIT IV IOT PHYSICAL DEVICES AND ENDPOINTS 9

Introduction to Raspberry PI-Interfaces (serial, SPI, I2C) Programming – Python program with
Raspberry PI with focus of interfacing external gadgets, controlling output, reading input from
pins.
UNIT V CASE STUDIES 9
Smart Lighting, Home Intrusion Detection, Smart Parking, Weather Monitoring, Reporting
System & Bot, Air Pollution Monitoring, Forest Fire Detection, Smart Irrigation, IoT Printer

TOTAL (L:45): 45 PERIODS

169
OUTCOMES:
On the completion of the course,
 Students will be able to analyze various protocols for IoT
 Students will be able to develop IoT application using scripting languages
 Students will be able to design a portable IoT using Rasperry Pi
 Students will be able to develop web services to access/control IoT devices.
 Students will be able to analyze applications of IoT in real time scenario

TEXT BOOKS:
1. Internet of Things – A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547

REFERENCES:
1. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O’Reilly
(SPD), 2014, ISBN: 9789350239759
2. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), ―Architecting the
Internet of Things‖, Springer, 2011
3. Honbo Zhou,―The Internet of Things in the Cloud: A Middleware Perspective‖, CRC
Press, 2012.
4. Jan Ho ̈ ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan
Avesand.
5. David Boyle, "From Machine-to-Machine to the Internet of Things -Introduction to a
New Age of Intelligence", Elsevier, 2014.

170
OE18507 MULTIMEDIA AND ANIMATION TECHNIQUES L T P C
3 0 0 3
OBJECTIVES
 To comprehend the building blocks of multimedia,
 To learn multimedia authoring tools,
 To understand data compression and applications of multimedia
 To know about the various multimedia tools
 To learn basic animations

UNIT I MULTIMEDIA –AN OVERVIEW 9

Introduction- Components of Multimedia-Software Tools-Multimedia Presentation and
Production-Characteristics of a Multimedia Presentation-Hardware and Software
Requirements-Data Compression-Multimedia Sharing and Distribution-Uses of Multimedia-
Analog and Digital Representations–Digitization-Nyquist’s Sampling Theorem-Quantization
Error-Visual Display Systems.

UNIT II MULTIMEDIA BASICS 9

Text, Image, Audio, Video –types, representations, standards, file formats.

UNIT III MULTIMEDIA AUTHORING AND TOOLS 9

Multimedia Authoring-Requirements - Intramedia Processing-Intermedia processing -
Multimedia Authoring Paradigms and User Interfaces-Device-Independent Content
Authoring-Distributed Authoring and Versioning-Multimedia Services and Content
Management-Asset Management- Adobe DreamWeaver-Flash- Edge Animate CC, Camatasia
Studio 8, Claro, E-Learning Authoring Tools –Articulate, Elucidate, Hot Lava.

UNIT IV MULTIMEDIA APPLICATIONS 9

Multimedia Databases – Content Based Information Retrieval, Multimedia Communications -
Multimedia Information Sharing and Retrieval – Applications – Social Media Sharing, Online
Social Networking - Virtual Reality - Multimedia for Portable Devices, Collaborative
Multimedia Applications

UNIT V ANIMATION 9
Appeal - Solid Drawing-Squash and Stretch - Timing- Staging - Secondary Action-Follow
Through and Overlapping Action - Exaggeration-Arcs - Straight Ahead and Pose to Pose-
Anticipation - Slow In and Slow Out-Character Design- Methods of Creation-Wave Forms-
Character Speech -Character Movement-The Walk Cycle.
TOTAL (L:45): 45 PERIODS

171
OUTCOMES:
Upon completion of the course,
 Students will be able to understand on basic elements of multimedia
 Students will be able to use and apply authoring tools
 Students will be able to understand data compression and applications of multimedia
 Students will be able to use multimedia tools
 Students will be able to create animations

TEXT BOOK:
1. Ranjan Parekh, “Principles of Multimedia”, 2nd Edition, Mcgraw Hill, 2012.
2. Parag Havaldar and Gerard Medioni, ―Multimedia Systems - Algorithms,
Standards and Industry Practices‖, Course Technology, Cengage Learning, 2010.

REFERENCES:
1. Ralf Steinmetz and Klara Nahrstedt, ―Multimedia Computing, Communications
and Applications‖, First Edition, Pearson, 2005.
2. Ze - Nian Li, Mark S Drew and Jiangchuan Liu ―Fundamentals of Multimedia‖,
Second Edition, Springer, 2014.
3. Heather D.Freeman “The Moving Image Workshop: Introducing Animation,
Motion Graphics and Visual Effects in 45 Practical Projects” Published by
Fairchild Books,2015

172
OE18509 PYTHON PROGRAMMING L T P C
3 0 0 3
OBJECTIVES
 To know the basics of algorithmic problem solving
 To read and write simple Python programs with conditionals, loops and functions.
 To use Python data structures –- lists, tuples, sets and dictionaries.
 To do input/output with files in Python
 To know the basics of object oriented concepts, databases and python packages

UNIT I INTRODUCTION TO PROBLEM SOLVING AND PYTHON 9

Introduction to Problem solving: Computer algorithms – Hardware – Software –

Computational Problem solving – Python Programming Language – Introduction – Data and
Expressions – Literals – Variables and Identifiers – Operators – Expressions - Control
structures – Boolean expressions – Selection control - conditional (if), alternative (if-else),
chained conditional (if-elif-else); – Iterative control - state, while, for, break, continue, pass.

UNIT II STRINGS AND FUNCTIONS 9

String Processing – String manipulation methods - Functions – Calling value-Returning
functions – Calling Non – value – Returning functions, Parameter passing, Keyword arguments
– Default arguments – Variable scope – Recursive functions.
UNIT III DATA STRUCTURES IN PYTHON 9
List structures – Lists in Python - list operations, list slices, list methods, list loop, mutability,
aliasing, cloning lists- Iterating over lists – Assigning and copying lists, List comprehensions –
Search and Sort on lists - Linear search, Binary search, Bubble sort, Insertion sort- Tuples –
tuple assignment, tuple as return value; Dictionary- operations and methods - Set data type in
Python.
UNIT IV FILE AND DATABASE HANDLING 9
Files – Types of files, opening, reading, writing and closing files, format operator - command
line arguments. Database Programming: Connecting to a database, CRUD operations on
database, Transaction Control, Disconnecting from a database.

UNIT V OOP CONCEPTS AND PYTHON PACKAGES 9

Introduction to Object Oriented Programming -Classes and objects – Abstract Data types -
Encapsulation – Inheritance – Polymorphism. Python packages: Simple programs using the
built-in functions of packages matplotlib, seaborn, numpy, pandas etc. Python programming
with IDE.

173
OUTCOMES:
Upon completion of the course,
 Students will be able to develop algorithmic solutions to simple computational
problems
 Students will be able to structure simple Python programs for solving problems
 Students will be able to represent compound data using Python lists, tuples,
dictionaries
 Students will be able to read and write data from/to files in Python Programs
 Students will be able to develop projects using OOP concepts, Database and Python
Packages and IDE

TEXT BOOKS:
1. Charles Dierbach, “Introduction to Computer Science using Python”, Wiley, 2015
2. Python Programming using problem solving Approach by Reema Thareja, Oxford
University, Higher Education Oxford University Press; First edition (10 June 2017).

REFERENCES:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2nd
edition, Updated for Python 3, Shroff/O’Reilly Publishers, 2016.
2. Wesley J. Chun, “Core Python Applications Programming”, 3rd Edition , Pearson
Education, 2016.
3. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and
updated for Python 3.2, Network Theory Ltd., 2011.
4. John V Guttag, “Introduction to Computation and Programming Using Python’’,
Revised and expanded Edition, MIT Press , 2013
5. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning,
2012.

174
OE18502 ARTIFICIAL INTELLIGENCE BASICS L T P C
3 0 0 3
OBJECTIVES
 To understand the various characteristics of Intelligent agents
 To learn about the different search strategies in AI
 To learn to represent knowledge in solving AI problems
 To understand the different ways of designing software agents
 To know about the various applications of AI.
UNIT I INTRODUCTION 9
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent
Agents– Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.

UNIT II PROBLEM SOLVING METHODS 9

Problem solving Methods - Search Strategies- Uninformed - Informed - Heuristics - Local
Search Algorithms and Optimization Problems - Searching with Partial Observations –
Constraint Satisfaction Problems – Constraint Propagation - Backtracking Search - Game
Playing – Optimal Decisions in Games – Alpha - Beta Pruning - Stochastic Games

UNIT III KNOWLEDGE REPRESENTATION 9

First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-
Backward Chaining – Resolution – Knowledge Representation - Ontological Engineering-
Categories and Objects – Events - Mental Events and Mental Objects - Reasoning Systems for
Categories - Reasoning with Default Information

UNIT IV SOFTWARE AGENTS 9

Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining –
Argumentation among Agents – Trust and Reputation in Multi-agent systems.

UNIT V APPLICATIONS 9
AI applications – Language Models – Information Retrieval- Information Extraction – Natural
Language Processing - Machine Translation – Speech Recognition – Robot – Hardware –
Perception – Planning – Moving

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course,
 Students will be able to use appropriate search algorithms for any AI problem
 Students will be able to represent a problem using first order and predicate logic
 Students will be able to provide the apt agent strategy to solve a given problem
175
  Students will be able to design software agents to solve a problem
 Students will be able to design applications for NLP that uses Artificial Intelligence.

TEXT BOOKS:
1. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach‖, Prentice Hall,
Third Edition, 2009.
2. I. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-
Wesley Educational Publishers Inc., 2011.

REFERENCES:
1. M. Tim Jones, ―Artificial Intelligence: A Systems Approach (Computer Science),
Jones and Bartlett Publishers, Inc.; First Edition, 2008
2. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University
Press,2009.
3. William F. Clocksin and Christopher S. Mellish, Programming in Prolog: Using the
ISO Standard‖, Fifth Edition, Springer, 2003.
4. Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
5. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of
Computational Agents‖, Cambridge University Press, 2010.

176
OE18504 DATABASE SYSTEMS AND APPLICATIONS L T P C
3 0 0 3
OBJECTIVES
 Understand terms related to database design and management
 Understand the database development process
 Understand database performance issues
 Implement relational databases using a RDBMS
 Develop physical data models for relational database management systems

UNIT I INTRODUCTION TO DATABASE SYSTEM 9

Purpose of Database System - Views of data – Data Models – Database Languages –

Database System Architecture – Database users and Administrator - The relational Model –
The catalog- Types– Keys - Relational Algebra – Domain Relational Calculus – Tuple
Relational Calculus - Fundamental operations – Additional Operations- SQL fundamentals
- Integrity – Triggers - Security – Advanced SQL features –Embedded SQL– Dynamic
SQL- Missing Information– Views

UNIT II DATABASE DESIGN 9

Entity-Relationship Model – E-R Diagrams - Functional Dependencies – Non-loss
Decomposition – Functional Dependencies – First, Second, Third Normal Forms,
Dependency Preservation – Boyce/Codd Normal Form - Multi-valued Dependencies and
Fourth Normal Form – Join Dependencies and Fifth Normal Form

UNIT III TRANSACTION MANAGEMENT 9

Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery –
Media Recovery – Two Phase Commit - Save Points – SQL Facilities for recovery –
Concurrency – Need for Concurrency – Locking Protocols – Two Phase Locking – Intent
Locking – Deadlock- Serializability – Recovery Isolation Levels – SQL Facilities for
Concurrency.

UNIT IV IMPLEMENTATION TECHNIQUES 9

Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage – File
Organization – Organization of Records in Files – Indexing and Hashing –Ordered Indices
– B+ tree Index Files – B tree Index Files – Static Hashing – Dynamic Hashing – Query
Processing Overview – Catalog Information for Cost Estimation – Selection Operation –
Sorting – Join Operation – Database Tuning.

177
UNIT V APPLICATION OF DATABASE TECHNOLOGY 9
Introduction to Distributed databases - Cloud Databases - Data warehouse and Mining -
Mobile Databases - XML Databases - Multimedia Databases.
TOTAL (L:45): 45 PERIODS
OUTCOMES:
Upon completion of the course,
 Students will be able to analyze business problems and develop data
management requirements
 Students will be able to develop a conceptual model to meet the problem
requirements, using an Entity Relationship diagram or another conceptual
modeling tool
 Students will be able to apply normalization to reduce/eliminate redundancy
in database design
 Students will be able to implement the conceptual model in a commercial
relational database
 Students will be able to implement the conceptual model in a commercial
relational database

TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ―Database System
Concepts‖, Sixth Edition, Tata McGraw Hill, 2010.
2. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”,
Eighth Edition, Pearson Education, 2006
REFERENCES:
1. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systems, Sixth
Edition, Pearson Education, 2010.
2. Raghu Ramakrishnan, Johannes Gehrke ―Database Management Systems, Fourth
Edition, Tata Mc Graw Hill, 2010.
3. G.K.Gupta, ―Database Management Systems‖, Tata McGraw Hill, 2011.
4. Carlos Coronel, Steven Morris, Peter Rob, ―Database Systems: Design,
Implementation and Management‖, Ninth Edition, Cengage Learning, 2011
5. Bipin C. Desai, “An Introduction to Database Systems”, Galgotia Publications Pvt.
Limited, 2001

178
OE18506 INTERNET PROGRAMMING L T P C
3 0 0 3
OBJECTIVES
 To understand various protocols.
 To study about various tags in html.
 To impart knowledge in designing form with style sheets.
 To acquire knowledge about validation at client side.
 To acquire knowledge about validation at server side.

UNIT I WEB ESSENTIALS: CLIENTS, SERVERS AND 9

COMMUNICATION
The Internet-Basic Internet Protocols (TCP/IP, UDP, DNS and High Level Protocols), World
Wide Web, HTTP-Request and Response Message, Web Clients and Web Servers.

UNIT II MARKUP LANGUAGES 9

HTML Introduction-Syntax, Fundamental HTML elements, URLs, Lists, Tables, Frames.

UNIT III FORMS AND STYLE SHEETS 9

Form Creation with basic html elements, STYLE SHEETS -Introduction to CSS, Features,
syntax and its types.

UNIT IV CLIENT SIDE PROGRAMMING -JAVASCRIPT 9

CLIENT SIDE PROGRAMMING- History and Versions of Javascript-Basic syntax,
Variables, Datatypes, Operators, Functions and Regular Expressions.

UNIT V SERVER SIDE PROGRAMMING-JAVA SERVLETS: 9

Introduction to servlet-Architecture overview, Servlet life cycle- Basic syntax, Generation of
dynamic content with servlet, Session tracking with servlet(cookies and sessions).

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon completion of the course,
 Students will be able to be familiar with basics of the Internet Programming.
 Students will be able to acquire knowledge and skills for creation of web page for client
side with basic html elements.
 Students will be able to develop web applications with styling sheets.
 Students will be able to create interactive web site for client side with JavaScript
 Students will be able to build Dynamic web site with servlet.
179
TEXT BOOKS:
1. Web Technologies-A Computer Science Perspective-Jeffrey C. Jackson, 4th Edition.
2. An Introduction to web development and Programming- Michael Mendez Suny
Fredonia.

REFERENCES:
1. Core Web Programming, Marty Hall, Larry Brown, PrenticeHall, Second Edition,2001.
2. Eloquent Third Edition, A Modern Introduction to Programming, Marijn
Haverbake,2018.

180
 OE18508 INTRODUCTION TO CLOUD AND BIG DATA L T P C
ANALYTICS 3 0 0 3
OBJECTIVES
 To understand fundamentals of cloud computing
 To understand the cloud infrastructure
 Gain knowledge on the concept of virtualization that is fundamental to cloud
computing
 To learn the concept of big data
 To understand the security issues in cloud computing

UNIT I INTRODUCTION 9
Technologies for Network-Based System – System Models for Distributed and Cloud
Computing – NIST Cloud Computing Reference Architecture. Cloud Computing and Service
Models:- Characteristics – Cloud Services – Cloud models (IaaS, PaaS, SaaS) – Cloud
ecosystem and enabling technologies.

UNIT II CLOUD INFRASTRUCTURE 9

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.

UNIT III VIRTUALIZATION 9

Introduction – Implementation Levels of Virtualization – Virtualization Structures/Tools and
Mechanisms – Virtualization of CPU, Memory, and I/O Devices – Virtual Cluster and
Resource Management – Virtualization for Data Center Automation

UNIT IV CLOUD SECURITY 9

Security management in Peer-to-Peer networks – Peer trust and Reputation Systems – Trust
overlay and DHT implementation – Power Trust – Securing Overlays. Cloud Security and
Trust Management – Defense Strategies – Distributed Intrusion Detection – Data and Software
Protection Techniques - Reputation Guided Protection of Data Centers.

UNIT V BIGDATA 9
Hadoop – Hadoop HDFS – Hadoop Map Reduce, Google - Google App Engine-GFS-
BigTable

TOTAL (L:45): 45 PERIODS

181
OUTCOMES:
Upon completion of the course,
 Students will be able to be learn the fundamentals of cloud computing.
 Students will be able to understand the cloud infrastructure
 Students will be able to understand the concept of virtualization that is fundamental to
cloud computing
 Students will be able to analyze the security issues in cloud computing
 Students will be able to understand the concepts of big data

TEXT BOOKS:
1. 1. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra, “Distributed and Cloud
Computing: Clusters, Grids, Clouds and the Future of Internet”, First Edition, Morgan
Kaufman Publisher, an Imprint of Elsevier, 2012.

REFERENCES:
1. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing Principles
and Paradigms, Wiley, 2010
2. Toby Velte, Anthony Velte, Robert Elsenpeter , Cloud Computing, A Practical
Approach, McGrawHill, 2010
3. Thomas Erl , Ricardo Puttini, Zaigham Mahmood,” Cloud Computing: Concepts,
Technology & Architecture”, First Edition, Prentice Hall,2013.

182
OE18510 INTRODUCTION TO DATA STRUCTURES L T P C
3 0 0 3
OBJECTIVES
This course will develop the student's ability to
 Learn to use arrays and list ADT.
 Earn a thorough knowledge in Stack and Queue ADT.
 Learn to distinguish linear and non-linear data structures, and make use of Tree ADT.
 Use graph algorithms for various applications.
 Become familiar with sorting and searching algorithms

UNIT I ARRAYS AND LISTS 11

Array - Abstract Data Type (ADT); The List ADT - Array implementation - Linked lists -
Application of Lists; Doubly Linked Lists; Circular Lists

UNIT II STACK AND QUEUES 9

The Stack ADT - Applications of Stacks : Conversion of infix to postfix expression, Evaluating
a postfix expression, Balancing Paranthesis;The Queue ADT – Circular Queue- Applications of
Queues : Process Scheduling

UNIT III TREES 9

Tree Preliminaries - Binary Trees - Binary Search Tree; AVL Trees; Priority Queues(Heaps) -
Binary Heap

UNIT IV GRAPHS 9
Graphs - Representation of Graphs; Depth First Search and Breadth First Search; Topological
Sort; Shortest Path Algorithms - Dijkstra's Algorithm - All Pairs Shortest Path; Minimum
Spanning Tree - Prim's Algorithm - Kruskal's Algorithm

UNIT V SORTING AND SEARCHING 7

Sorting algorithms: Insertion sort - Shell sort – Heap sort - Merge sort - Quick sort ; Searching
Algorithms: Linear search – Binary Search.

TOTAL (L:45): 45 PERIODS

OUTCOMES:
Upon Completion of the course,
 Students will be able to be apply the key ideas of list data structures for a given problem
 Students will be able to demonstrate the stack and queue ADTs.
183
  Students will be able to use the tree ADT.
 Students will be able to demonstrate the various graph algorithms
 Students will be able to understand the main ideas of the sorting and searching
algorithms.
TEXT BOOKS:

1. Weiss, Mark A. Data structures & algorithm analysis in C++. Pearson Education, 2012.
REFERENCES:

1. Michael T Goodrich, Roberto Tamassia, David Mount, “Data Structures and Algorithms
in C++”, 7 th Edition, Wiley Publishers, 2004.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
"Introduction to Algorithms", Second Edition, Mc Graw Hill, 2002.

184
VD18501 PYTHON PROGRAMMING FOR BEGINNERS L T P C
2 0 0 2
OBJECTIVES
 To know the basics of algorithmic problem solving
 To read and write simple Python programs with conditionals, loops and functions.
 To use Python data structures –- lists, tuples, sets and dictionaries.
 To do input/output with files and learn to use regular expressions in Python
 To know the basics of object oriented concepts, databases and python packages

UNIT I INTRODUCTION TO PROBLEM SOLVING AND PYTHON 6

Introduction to Problem solving- Python Programming Language – Introduction – Data and

Expressions – Literals – Variables and Identifiers – Operators – Expressions - Control
structures – Boolean expressions – Selection control - conditional (if), alternative (if-else),
chainedconditional (if-elif-else); – Iterative control - state, while, for, break, continue, pass;
String Processing – String manipulation methods – inbuilt functions for strings

UNIT II DATA STRUCTURES IN PYTHON 6

List structures – Lists in Python - list operations, list slices, list methods, list loop, mutability,
aliasing, cloning lists, list parameters, Iterating over lists – Assigning and copying lists, List
comprehensions – Tuples –tuple assignment, tuple as return value; Dictionary- operations and
methods - Programming using list and dictionary in-built functions – Set data type in Python.
Python Regular Expression - pattern matching - searching and validation using regular
expression in real time applications
UNIT III FUNCTIONS AND FILE HANDLING 6
Functions – Calling value-Returning functions – Calling Non – value – Returning functions,
parameter passing, Keyword arguments – Default arguments – Variable scope – Recursive
functions – Recursive problem solving – Iteration vs Recursion - Files – Types of files,
opening, reading, writing and closing files, format operator - command line arguments.

UNIT IV OOP CONCEPTS 6

Introduction to Object Oriented Programming -Classes and objects – Defining classes, Creating
objects, Encapsulation – Data hiding and abstraction through classes - Public and private
members - Inheritance –Inheriting classes – types of inheritance- abstract classes and interface
- Polymorphism – Operator overloading - Exception handling in Python – Multithreading in
Python.

185
UNIT V DATABASE CONCEPTS AND PYTHON PACKAGES 6

Database Programming: Connecting to a database, CRUD operations on database, Transaction

Control, Disconnecting from a database. Python packages: Simple programs using the built-in
functions of packages matplotlib, numpy, pandas etc. Python programming with IDE.

TOTAL (L:30): 30 PERIODS

OUTCOMES:
 The students will be able to develop algorithmic solutions to simple computational
problems
 The students will be able to structure simple python programs for solving problems
 The students will be able to represent compound data using python lists, tuples,
dictionaries
 The students will be able to use data from files in python programs
 The students will be able to develop projects using OOP concepts, database and python
packages and IDE

TEXT BOOKS:
1. Charles Dierbach, “Introduction to Computer Science using Python”, Wiley, 2015 .
2. Python Programming using problem solving Approach by Reema Thareja, Oxford
University, Higher Education Oxford University Press; First edition (10 June 2017)
REFERENCES:
1. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and
updated for Python 3.2, Network Theory Ltd., 2011.
2. John V Guttag, “Introduction to Computation and Programming Using Python’’,
Revised and expanded Edition, MIT Press , 2013
3. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE
Learning, 2012.
4. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An
Introduction to Computer Science using Python 3”, Second edition, Pragmatic
Programmers,LLC,2013.
5. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python: An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd.,
2016.

186
VD18502 DEEP LEARNING TECHNIQUES L T P C
2 0 0 2
OBJECTIVES

Students are made to

● To provide the basis of Neural networks and Deep Learning
● To provide the basis of challenges of gradient descent and handling it.
● To design convolutional neural network
● To design recurrent neural network
● To build a deep neural networks

UNIT I FUNDAMENTALS OF NEURAL NETWORKS AND DEEP 6

LEARNING
Neural Networks – Training Neural Network, Activation Functions, Loss function, Hyper
parameters- Common architectural principles of Deep Networks, Building blocks of Deep
Networks

UNIT II BEYOND GRADIENT DESCENT 6

Challenges with Gradient Descent – Local Minima in the Error Surfaces in Deep Networks –
Model Identifiability - Flat regions in the Error surface – Momentum based optimization –
Second order methods – Learning rate adaptation

UNIT III CONVOLUTIONAL NEURAL NETWORKS 6

Convolutional Neural Networks (CNN)- Biological inspiration – Intuition – CNN overview-
Convolution Layers – Pooling Layers – Fully connected Layers – Other Applications of CNN

UNIT IV RECURRENT NEURAL NETWORKS 6

Modeling the Time Dimension – 3D volumetric Input - General Recurrent Neural Network
Architecture - LSTM networks – Domain Specific Applications and Blended Networks –
Recursive Neural Networks

UNIT V BUILDING DEEP NETWORKS 6

Matching DN to the right problem - Basic Concepts of DL API – Modeling CSV data with
Multilayer Perceptron Networks – Modeling Handwritten Images using CNN.

TOTAL (L:30): 30 PERIODS

187
OUTCOMES:
● The students will be able to recognise the fundamentals of deep learning.
● The students will be able to describe gradient descent problems in deep neural
networks.
● The students will be able to construct a Convolution Neural Network.
● The students will be able to interpret a Recurrent Neural Network.
● The students will be able to construct DNN models for real world problems.

TEXT BOOKS:
1. Bengio Y, Goodfellow I, Courville Deep Learning: A Practitioner's Approach
2. Nikhil Buduma, Nicholas Locascio : Fundamentals of Deep Learning: Designing Next-
Generation Machine

188
VD18503 DIGITAL FORENSICS L T P C
2 0 0 2
OBJECTIVES
 Describe digital forensics and relate it to an investigative process.
 Explain the legal issues of preparing for and performing digital forensic analysis.
 Demonstrate the process of Electronic Discovery
 Explains the Intrusion Investigation Process
 Explain how to recover hidden data for forensic analysis from Windows file system

UNIT I INTRODUCTION TO DIGITAL FORENSICS 6

Forensics Soundness, Forensic Analysis Fundamentals, Crime Reconstruction, Networks and
the Internet, Conclusion.

UNIT II FORENSIC ANALYSIS 6

Introduction, Applying the Scientific Method to Digital Forensics, Uses of Digital Forensic
Analysis, Data Gathering and Observation, Hypothesis Formation, Evaluating Hypotheses,
Conclusions and Reporting.

UNIT III ELECTRONIC DISCOVERY 6

Introduction to Electronic Discovery, Case Management, Identification of Electronic data,
Forensic Preservation of Data, Data Processing, Production of Electronic Data

UNIT IV INTRUSION INVESTIGATION 6

Introduction and Methodologies, Preparation, Case Management and Reporting, Common
Initial Observations, Scope Assessment, Collection, Analyzing Digital Evidence,
Combination/ Correlation, Feeding Analysis Back into the Detection Phase.

UNIT V WINDOWS FORENSIC ANALYSIS 6

Introduction - NTFS Overview, Forensic Analysis of the NTFS Master File Table (MFT) ,
Metadata , Artifacts of User Activities , Deletion and Destruction of Data, Windows Internet
and Communications Activities , Windows Process Memory, BitLocker and Encrypting File
System (EFS)

TOTAL (L:30): 30 PERIODS

OUTCOMES:
 Students will be able to demonstrate in-depth knowledge in the field of Digital
forensics.
 Students will be able to analyze the data to identify evidence.
 Students will be able to implement the Electronic Discovery of data.
189
  Students will be able to make use of mathematical techniques to detect fake data.
 Students will be able to apply forensic analysis on NTFS file system.

TEXT BOOKS:

1. Handbook of Digital Forensics and Investigation, Eoghan Casey , Elsevier Academic

Press, USA.

REFERENCES:
1. The Basics of Digital Forensics: The Primer for Getting Started in Digital Forensics
Book by John Sammons
2. Computer Forensics For Dummies 1st Edition by Carol Pollard

190
VC 18004 DESIGN THINKING AND PROTOTYPING L T P C
LABORATORY
(Common to All branches, Except MR)
0 0 3 2
OBJECTIVE:
To apply design thinking principles in arriving at innovative engineering solutions for problems
relevant to society.

SYLLABUS
The course will use a combination of lectures and hands-on project work. The project will give an
opportunity to come up with an innovative engineering solution to problems or challenges
particular to our society.

1. Concepts of design thinking and human centered design thinking.

2. Identifying societal problems using indirect and qualitative research.
3. Forming teams and assignments of major societal problems and arriving at sound concept
hypotheses, and solution using brainstorming sessions. Societal problems such as water
management, energy sources, basic amenities (health, education, food, clean water,
sanitation, connectivity etc), organic farming, livelihood etc. will be assigned as projects.
4. Developing a prototype that allows for meaningful feedback in a real-world environment.
5. Presenting the developed prototype in front of a technically qualified audience.

Evaluation will be done as per following details.

Internal (65 Marks) End Semester Examination (35 Marks)
Project Work Project Report (15) Viva - Voce (20)
Review I Review II Review III
External Internal External Supervisor
Phase 15 25 25 15 5 10 5

OUTCOMES:
 Students will be able to apply design thinking principles in arriving innovative design.
 Students will be able to solve unique societal problems.
 Students will be able to make prototypes.
 Students will be able to work as a team member or lead interdisciplinary engineering teams.
 Students will be able to demonstrate the product prototype to technically qualified audience.

191
VC18005 BASICS OF ENTREPRENEURSHIP DEVELOPMENT L T P C
(Common to All Branches) 1 0 2 2
OBJECTIVES:

 To provide Knowledge on Self-discovery and Problem identification.

 To provide Skill set on Identifying customer segment and Practice on Business Model.
 To understand the Market, Sales and support.

UNIT I SELF-DISCOVERY & PROBLEM IDENTIFICATION 6

Orientation of Entrepreneurship – Case Study – activity – Effectuation – Principles of
Effectuation – Identifying Entrepreneur skill.
Problem Identification – Design thinking – look for solution – activity – Brain storming.

UNIT II CUSTOMER & BUSINESS MODEL 6

Identifying customer segment, understanding the market – Product selection –activity – value
proposition canvas.
Identify the Problem, Solution and Risk identification – Activity – Business model.

UNIT III VALIDATION AND RESOURCES 6

Build a Minimum Viable Product (MVP) – validation and launching of MVP –activity – MVP
Interview.
Cost – Revenue – Pricing – Profitability – Sources of finance – activity – Bootstrap Finance –
Leadership – Identifying Co-founders and Hiring a Team – activity –Pitching about a venture

UNIT IV MARKET AND SALES 6

Positioning and branding – network and channels – sales planning – activity – selling skill.

UNIT V SUPPORT 6
Project Management – Project tracking – Basics of Business regulations – Activity – capstone
project.

TOTAL : 30 PERIODS

OUTCOMES
CO1: Acquire knowledge and Practice on Self Discovery and Problem identification.
CO2: Understand the concept of Identifying the Customer and Business model.
CO3: Acquire knowledge on various Resource and Practice on validation.
CO4: Acquire knowledge on marketing and sales.
CO5: Practice on Project management.

192
TEXT BOOKS:

1. S. S. Khanka, “Entrepreneurial Development” S. Chand & Co. Ltd., Ram Nagar, New
Delhi, 2013.
2. Donald F Kuratko, “Entrepreneurship – Theory, Process and Practice”, 9th edition,
Cengage Learning 2014

REFERENCES :

1. Hisrich R D, Peters M P, “Entrepreneurship” 8th Edition, Tata McGraw-Hill, 2013.

2. Mathew J Manimala, “Entrepreneurship Theory at Cross Roads: paradigms and Praxis”,
2nd Edition Dream Tech, 2005.

WEB RESOURCE:
https://learnwise.wfglobal.org/#/IN/en/courses

193
VC18006 ADVANCE IN ENTREPRENEURSHIP DEVELOPMENT L T P C
1 0 2 2

OBJECTIVES :
 To provide Knowledge on Business model, Business plan and new business
model/prototype.
 To provide Skill set on increasing revenue and funding.
 To understand the Team building, Measurement of progress and legal matters.

UNIT I BUSINESS MODEL & PRODUCT SERVICE 6

Introduction to the concept of pivoting –Business Model-Types of Business Model-Business
Model Evaluation-Refining Business Model-Analyzing Business Model-Adding New customer
to Business model.
Problem in new product development-New business model/Prototype

UNIT II BUSINESS PLANNING 6

Business Plan-Sales plan- People plan- Finance plan-understanding finance planning-Forecasting
template.
Creating procurement plan-Negotiation role play-Activity.

UNIT III INCREASING REVENUE AND FUNDING 6

Understanding of primary revenue source-Customer life cycle-Exploring secondary revenue
source-Funding option.
Exploring funding option-Pitch deck.

UNIT IV BUILDING A TEAM AND BRANDINGS 6

Introduction to building a team-pitching to attract team - Setting a team for success-standardize
key process-Branding-Definition of values-Positioning statement-Identification of right channel-
Digital marketing.
Brand name and logo activity.

UNIT V MEASUREMENT OF PROGRESS AND LEGAL MATTERS 6

Metrics for customer retention and satisfaction - Metrics dash board-legal and compliance
requirement - Identify mentor and advisors.
Project.

TOTAL : 30 PERIODS
OUTCOMES
CO1: Acquire knowledge and Practice on Business model and Business planning.
CO2: Understand the concept of increasing the revenue and funding.
CO3: Acquire knowledge on building a team and branding.
194
 CO4: Acquire knowledge on Measurement of progress and legal matters.
CO5: Practice on Project management.

TEXT BOOKS:

1. S.S.Khanka, “Entrepreneurial Development” S.Chand & Co. Ltd., Ram Nagar, New
Delhi, 2013.
2. Donald F Kuratko, “ Entreprenuership – Theory, Process and Practice”, 9th edition,
Cengage Learning 2014

REFERENCES :

1. Hisrich R D, Peters M P, “Entrepreneurship” 8th Edition, Tata McGraw-Hill, 2013.

2. Mathew J Manimala, “Entrepreneurship Theory at Cross Roads: paradigms and Praxis”,
2nd Edition Dream Tech, 2005.

Web Resource:
https://lms.learnwise.wfglobal.org/IN/en/home

195
 INDIAN CONSTITUTION AND SOCIETY L T P C
MC 18001
(Common to All Branches except MR) 3 0 0 0
OBJECTIVES
 To know about Indian constitution and fundamental rights.
 To know about central and state government functionalities in India.
 To know about Judicial system and Election commission of India.

UNIT I INTRODUCTION 11

Historical Background – Philosophical foundations of the Indian Constitution – Preamble – Schedules

– Amendments.

FUNDAMENTAL RIGHTS AND FUNDAMENTAL DUTIES OF THE

UNIT II 8
CITIZEN

Union and Territories – Citizenship - Fundamental Rights – Directive Principles of State Policy –
Fundamental Duties – Directive Principles of state policy.

UNIT III STRUCTURE AND FUNCTION OF CENTRAL GOVERNMENT 8

Union Government – Structures of the Union Government and Functions – Powers of President, Vice
President, Prime Minister – Cabinet ministers – Parliament.

UNIT IV STRUCTURE AND FUNCTION OF STATE GOVERNMENT 8

State Government – Structure and Functions – Powers of Governor, Chief Minister, Cabinet ministers
– State Legislature

UNIT V STRUCTURE OF JUDICIAL SYSTEM AND MAJOR 10

FUNCTIONARIES

Supreme Court of India - Judicial System in States – High Courts and other Subordinate Courts –
Judicial Review – Case studies. Election Commission of India and its functions.

TOTAL (L:45): 45 PERIODS

196
OUTCOMES:
Upon completion of the course, students will be able to:
CO CO statement weightage
CO – 1 Enhance human values, create awareness about law enactment and 10 %
importance of Constitution
CO – 2 To Understand the Fundamental Rights and Fundamental Duties of the 30%
Indian Citizen to instill morality, social values, honesty, dignity of life and
their social Responsibilities.
CO – 3 To Understand the powers and functions of Central Government. 20%
CO – 4 To Understand the powers and functions of State Government. 20%
CO – 5 To Understand the powers and functions of Judicial systems and Election 20%
commission of India.

TEXT BOOKS:

1. Durga Das Basu, “Introduction to the Constitution of India “, Prentice Hall of India, New Delhi.
2. R. C. Agarwal, (1997) “Indian Political System”, S. Chand and Company, New Delhi.
3. Maciver and Page, “Society: An Introduction Analysis “, Mac Milan India Ltd., New Delhi.
4. K. L. Sharma, (1997) “Social Stratification in India: Issues and Themes”, Jawaharlal Nehru
University, New Delhi.

REFERENCES:

1. Sharma, Brij Kishore, “Introduction to the Constitution of India”, Prentice Hall of India, New
Delhi.
2. U. R. Gahai, “Indian Political System”, New Academic Publishing House, Jalaendhar.
3. R. N. Sharma, “Indian Social Problems ”, Media Promoters and Publishers Pvt. Ltd.

197