PG Cse PDF

CURRICULUM
for the Academic year 2018 – 2019

Batch (2018-2020)
DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
I - IV Semester M. Tech (CSE)

COMPUTER SCIENCE AND ENGINEERING
RAMAIAH INSTITUTE OF TECHNOLOGY

(Autonomous Institute, Affiliated to VTU)
BANGALORE – 54
About the Institute
Ramaiah Institute of Technology (RIT) (formerly known as M. S. Ramaiah
Institute of Technology) is a self-financing institution established in
Bangalore in the year 1962 by the industrialist and philanthropist, Late Dr. M
S Ramaiah. The institute is accredited with A grade by NAAC in 2016 and
all engineering departments offering bachelor degree programs have been
accredited by NBA. RIT is one of the few institutes with faculty student ratio
of 1:15 and achieves excellent academic results. The institute is a participant
of the Technical Education Quality Improvement Program (TEQIP), an
initiative of the Government of India. All the departments are full with
competent faculty, with 100% of them being postgraduates or doctorates.
Some of the distinguished features of RIT are: State of the art laboratories,
individual computing facility to all faculty members. All research
departments are active with sponsored projects and more than 130 scholars
are pursuing PhD. The Centre for Advanced Training and Continuing
Education (CATCE), and Entrepreneurship Development Cell (EDC) have
been set up on campus. RIT has a strong Placement and Training department
with a committed team, a fully equipped Sports department, large air-
conditioned library with over 80,000 books with subscription to more than
300 International and National Journals. The Digital Library subscribes to
several online e-journals like IEEE, JET etc. RIT is a member of DELNET,
and AICTE INDEST Consortium. RIT has a modern auditorium, several hi-
tech conference halls, all air-conditioned with video conferencing facilities. It
has excellent hostel facilities for boys and girls. RIT Alumni have
distinguished themselves by occupying high positions in India and abroad
and are in touch with the institute through an active Alumni Association. RIT
obtained Academic Autonomy for all its UG and PG programs in the year
2007.As per the National Institutional Ranking Framework, MHRD,
Government of India, Ramaiah Institute of Technology has achieved 45th
rank in 2017 among the top 100 engineering colleges across India and
occupied No. 1 position in Karnataka, among the colleges affiliated to VTU,
Belagavi.
2
About the Department
Year of 1984
Establishment
Names of the 1. UG: B.E. in Computer Science and Engineering
Programmes 2. PG: M.Tech. in Computer Science and
offered Engineering
3. PG: M.Tech. in Computer Networks and
Engineering
4. Ph.D
5. M.Sc(Engg.) by Research
The Department of Computer Science and Engineering (CSE) has eminent

emeritus professors, 10 faculty with the doctorate degree and 15pursuing the
doctoral studies. The faculty has been publishing research papers in refereed
journals and in conference proceedings. The department also conducts
vocational courses and proficiency courses on fundamental and new
programming languages and computer science concepts. These courses are
conducted beyond college hours/summer semester by the faculty of the
department. Some of the faculty are involved in institutional level activities
and actively involved in interdisciplinary research activities. The department
has state of the art laboratories like SAP, IBM Centre of Excellence and
CUDA learning center. Technical seminars, workshops and hackathons are
conducted regularly for UG & PG students. The department encourages the
students to conduct and participate in extra-curricular/sports activities. The
alumni network is very active and regular meeting are conducted by the
department. The department is accredited by Nation Board of Accreditation
(NBA). The department has MoUs with leading IT Industries like NVIDIA,
SAP, IBM and HP. The department conducts subjects with more of hands-on
sessions and encourages students to take up MOOC based online courses in
NPTEL, IITBombayX, Coursera, Udacity and edX.
3
VISION OF THE INSTITUTE
To be an Institution of International Eminence, renowned for imparting
quality technical education, cutting edge research and innovation to meet
global socio economic needs
MISSION OF THE INSTITUTE

MSRIT shall meet the global socio-economic needs through
 Imparting quality technical education by nurturing a conducive
learning environment through continuous improvement and
customization
 Establishing research clusters in emerging areas in collaboration
with globally reputed organizations
 Establishing innovative skills development, techno-entrepreneurial
activities and consultancy for socio-economic needs
QUALITY POLICY
We at M. S. Ramaiah Institute of Technologystrive to deliver comprehensive,
continually enhanced, global quality technical and management education
through an established Quality Management System complemented by the
synergistic interaction of the stake holders concerned
VISION OF THE DEPARTMENT

To build a strong learning and research environment in the field of Computer
Science and Engineering that responds to the challenges of 21st century.
MISSION OF THE DEPARTMENT

 To produce computer science graduates who, trained in design and
implementation of computational systems through competitive curriculum
and research in collaboration with industry and other organizations
 To educate students in technology competencies by providing
professionally committed faculty and staff
 To inculcate strong ethical values, leadership abilities and research
capabilities in the minds of students so as to work towards the progress of
the society
4
PROGRAM EDUCATIONAL OBJECTIVES (PEOs):
An M.Tech (Computer Science & Engineering) graduate of M S Ramaiah

Institute of Technology should, within three to five years of graduation
PEO1 Pursue a successful career in the field of Computer Science &

Engineering or a related field utilizing his/her education and
contribute to the profession as an excellent employee, or as an
entrepreneur
PEO2 Be aware of the developments in the field of Computer Science &
Engineering, continuously enhance their knowledge informally or
by pursuing doctoral studies and engage in research and inquiry
leading to new innovations and products
PEO3 Be able to work effectively in multidisciplinary and multicultural
environments and Be responsible members and leaders of their
communities
PEO4 Understand the human, social and environmental context of their
profession and contribute positively to the needs of individuals and
society at large
PROGRAM OUTCOMES (POs):
PO1: An ability to independently carry out research/investigation and

development work to solve practical problems
PO2: An ability to write and present a substantial technical
report/document
PO3: Students should be able to demonstrate a degree of mastery over the
area as per the specialization of the program. The mastery should be
at a level higher than the requirements in the appropriate bachelor
program.
PO4: Acquire professional and intellectual integrity to stress upon the
impact of computer engineering applications with respect to
economic and environmental aspects
PO5: Acquire methods of engaging in life-long learning not only to
predict and plan the projects of the future but also to groom others in
the group.
5
Curriculum Course Credits Distribution
Semester Humanit Basic Engin Profession Professiona Other Project Extra & Total
ies Science eering al Courses l Courses- Electi Work/ Co- credits
& Social s/ Lab Scienc - Core Electives ves Internship curricular in a
Sciences (BS) es/ (Hard (PC-E) (OE) (PW /IN) activities semester
(HSS) Lab core, soft (EAC)
(ES) core, Lab)
(PC-C)
First 0 0 0 12 12 0 0 0 24
Second 0 0 0 12 12 0 0 0 24
Third 0 0 0 4 4 0 10 0 18
Fourth 0 0 0 0 0 0 22 0 22
Total 88
6
SCHEME OF TEACHING
I SEMESTER
Credits Contact
Sl. Course
Course Name Category Hours
No. Code
L T P Total
1. MCS11 Advanced Engineering PC-C 4 0 0 4 56
Mathematics
2. MCS12 Advances in Database PC-C 3 1 0 4 42
Management Systems
3. MCSExx Elective-I PC-E * * * 4 *
4. MCSExx Elective-II PC-E * * * 4 *
5. MCSExx Elective-III PC-E * * * 4 *
6. MCSL13 Software Development PC-C 0 0 1 1 28
for Portable Devices
Laboratory
7. MCSL14 Python Programming PC-C 0 0 1 1 28
Laboratory
8. MCS15 Technical Seminar-I PC-C 0 0 2 2 --
Total 24
7
II SEMESTER
Credits Contact
Sl. Course
No. Code
L T P Total
1. MCS21 Data Analytics Using R PC-C 4 0 0 4 56
2. MCS22 Advanced Algorithms PC-C 3 0 1 4 42+28
3. MCSExx Elective-IV PC-E * * * 4 *
4. MCSExx Elective-V PC-E * * * 4 *
5. MCSExx Elective-VI PC-E * * * 4 *
6. MCSL23 IoT and Cloud PC-C 0 0 1 1 28
Computing Laboratory
7. MCSL24 Data Analytics Lab PC-C 0 0 1 1 28
8. MCS25 Technical Seminar-II PC-C 0 0 2 2 --
Total 24
8
III SEMESTER
Credits Contact
Sl. Course
No. Code
L T P Total
1 MCS31 Engineering PC-C 4 0 0 4 56
Economics, Project
Management and
Professional Ethics
2 MCSExx Elective -VII PC-E * * * 4 56
3 MCSE32 Internship/Industrial IN 0 0 4 4 *
Training
4 MCSE33 Project Work-I PC-C 0 0 6 6 *
Total 18
Internship: The department should prepare Gantt chart with milestones, deliverables, evaluation and maintain
weekly dairy signed by both Internal and External Guide.
Project Work-I: Seminar on: problem definition, literature survey and methodology to be used.
IV SEMESTER
Credits Contact
Sl. Course
No. Code
L T P Total
1 MCS41 Project Work-II PC-C 0 0 22 22 *
Total 22
9
Electives
Subject Code Subject Name
Stream 1
MCSE01 Advances in Computer Networks
MCSE02 Wireless Ad hoc Networks
MCSE03 Distributed Systems
MCSE04 Cloud Computing
MCSE05 Software Defined Networks
MCSE06 Advances in Storage Area Networks
MCSE07 Protocol Engineering
MCSE08 Network Management
Stream 2
Multi core Architecture and
MCSE09 Programming
MCSE10 Embedded Systems
MCSE11 Compiler Optimization Techniques
MCSE12 Advanced Software Engineering
MCSE13 Software Oriented Architecture
MCSE14 Information Retrieval
MCSE15 Web Technologies
MCSE16 Advances in Digital Image Processing
MCSE17 Advances in Operating Systems
Stream 3
MCSE18 Cryptography and Security
MCSE19 Information and network security
MCSE20 Digital Forensics and cyber crime
MCSE21 Applied Cryptography
MCSE22 Internet of Things
MCSE23 Software Testing
Privacy and security in Online Social
MCSE24 Media
MCSE25 Start-up Engineering
Stream 4
MCSE26 Artificial Intelligence
MCSE27 Machine Learning
MCSE28 Deep Learning
MCSE29 Social Network Analysis
10
MCSE30 Natural Language Processing
MCSE31 Soft Computing
MCSE32 Computer System Performance Analysis
MCSE33 Future Skills 2020
MCSE34 Cyber Physical Systems
MCSE35 High Performance Computing
Note:
The total number of credits for all the elective courses is 4. The Faculty
coordinator can choose to conduct a 1 credit integrated lab or 1 credit
Tutorial for the course offered. The lab exercises and tutorial exercises
will be formulated during teaching.
11
Advanced Engineering Mathematics
Course Code: MCS11 Credits: 4:0:0
Prerequisites:Engineering Mathematics I- IV Contact Hours: 56
Course Coordinator/s: Dr. Govindaraju M V
Unit I
Numerical Methods: Numerical Solution of Algebraic and Transcendental
equations:Horner‟s method and Graffe root method.Numerical Solution of
system of non-linear equations:Newton-Raphson method.Solution of Higher
Order ODE with initial conditions: Runge – Kutta Method and Milne‟s
Predictor and Corrector method.
Unit II
Linear Transformations: Introduction to Linear transformations,
Composition of matrix transformations, Rotation about the origin, Dilation,
Contraction and Reflection, Kernel and Range, Change of basis.
Unit III
Random Variables: Random Variables (Discrete and Continuous),
Probability density function, Cumulative distribution function, Mean,
Variance, Moment generating function.Probability Distributions: Binomial
distribution, Poisson distribution, Normal distribution, Exponential
distribution and Uniform distribution.Joint probability distribution:Joint
probability distribution (both discrete and continuous), Conditional
expectation.
UnitIV
Markov Process: Introduction, Markov chain and Transition probabilities,
Continuous Parameter Markov Chain, Pure Birth and Pure Death Process,
Birth and Death Process, Renewal Process.
UnitV
Introduction to Queuing and Applications: Single server with infinite
system capacity queuing models.M/M/1: ∞/FIFO, K/FIFO, M/M/s:∞/FIFO,
K/FIFO, M/G/1 Queuing system characteristics, Case studies.
Text Books:
1. Erwin Kreyszig - Advanced Engineering Mathematics-Wiley-India
publishers- 10th edition-2015.
2. B.S.Grewal - Higher Engineering Mathematics - Khanna Publishers
- 40th edition-2007.
12
3. R.E. Walpole, R. H. Myers, R. S. L. Myers and K. Ye – Probability
and Statistics for Engineers and Scientists – Pearson Education –
Delhi – 8th edition – 2007.
4. Garreth Williams – Linear Algebra with Applications – Jones and
Bartlett Press – 4th edition – 2001.
Reference Books:
1. Sheldon M. Ross – Probability models for Computer Science –
Academic Press – 2009.
2. Murray R Spiegel, John Schiller & R. Alu Srinivasan – Probability
and Statistics – Schaum‟s outlines -2nd edition.
3. Kishor S. Trivedi – Probability & Statistics with reliability, Queuing
and Computer Science Applications – PHI – 2nd edition – 2002.
Course Outcomes (COs):

At the end of the course, students should be able to:
1. Solve the problems of algebraic, transcendental and ordinary differential
equations using numerical methods. (PO1,3,4)
2. Find the Kernel and Range of Linear transformations. (PO1,3)
3. Express the probability distribution arising in the study of engineering
problems and their applications. (PO1,3,4)
4. Apply the Markov Chain in prediction of future events. (PO1,3)
5. Apply and calculate the various parameters of the queuing models. (PO1,3)
13
Advances in Database Management Systems
Prerequisites :DBMS Contact Hours:42
Course Coordinator/s: Dr. Seema S
Unit I
Database models and overview of Relational data model: Database models:
Flat data model, Entity relationship model, Relation model, Record base
model, Network model, Hierarchical model, Object oriented data model,
Object relation model, Semi structured model, Associative model, Context
data model, graph data model, Overview of relational data model, querying
relational model with relational algebra, transaction processing and
concurrency control.
Unit II
Indexing and Hashing: Basic Concepts, Ordered Indices, B+-Tree Index
Files, B+-Tree Extensions, Multiple-Key access, Static Hashing, Dynamic
Hashing, Comparison of Ordered Indexing and Hashing, Bitmap Indices,
Index Definition in SQL.
Unit III
Query Processing and Optimization: Overview, Measures of Query Cost,
Selection Operation, Sorting, Join Operation, Other Operations, Evaluation
of Expressions Query Optimization: Transformation of Relational
Expressions, Estimating Statistics of Expression Results, Choice of
Evaluation Plans.
Unit IV
Parallel Databases: Introduction, I/O Parallelism, Inter-query Parallelism,
Intra-query Parallelism, Intra-operation Parallelism, Interoperation
Parallelism, Query Optimization, Design of Parallel Systems, Parallelism on
Multi-core Processors
Unit V
Distributed Databases: Homogeneous and Heterogeneous Databases,
Distributed Data Storage, Distributed Transactions, Commit Protocols,
Concurrency Control in Distributed Databases, Availability, Distributed
Query Processing, Heterogeneous Distributed Databases, Cloud-Based
Databases, Directory Systems
Text Books:
1. Database System Concepts, Abraham Silberschatz, Henry F. Korth, Sixth
Edition, McGraw Hill Education.
14
2. Fundamentals of Database Systems, Ramez Elmasri, Shamkant B.
Navathe, Fifth Edition, Pearson Publications.
Reference book:
1. Database Management Systems, Raghu Ramakrishnan, Johanners Gehrke,
Second Edition. McGraw-Hill Education.

1. Understand different database model and the overview of relation database
model. (PO1,3,4)
2. Understand the methods of storing, managing and interrogating complex
data and the background processes involved in query processing.
(PO1,3,4)
3. Analyze background methods to optimizing the query. (PO1,3,4)
4. Understand the concept of distributed databases and parallel databases.
(PO1,3,4)
5. Analyze the processing the queries in distributed and parallel databases.
(PO1,3,4)
15
Software Development for Portable Devices Laboratory
CourseCode:MCSL13 Credits: 0:0:1
Prerequisites:Nil Contact Hours: 28
Course Coordinator/s: Mr. Pramod Sunagar
Experiments that are to be conducted as a part of the course:

1. Introducing different Android development tools and developing
Hello World application.
2. Develop an android application to investigate the activity life cycle.
3. Develop an android application to investigate the fragments.
4. Develop an android application to create user interfaces with
different layouts and views.
5. Develop an android application to create a Registration form using
appropriate widgets.
6. Develop an android application to embed PickerViews in an
activity.
7. Develop an android application on using implicit & explicit Intents.
8. Develop an android application to utilize Action bar.
9. Develop an android application to utilize Toasts and Notifications.
10. Develop an android application to work SQLite data storage and
create a table.
11. Develop an android application to work SQLite data storage and
perform various operations on the table.
12. Develop an android application to introduce content providers.
13. Developing applications to work with messaging and telephony
services.
14. Develop an android application for creating location based service.
Reference Books:
1. Professional Android 4 Application Development, by Reto Meier,
WROX Press, Wiley Publishing.
2. Android Application Development, Programming with the Google
SDK, by, Rick Rogers, John Lombardo, Zigurd Mednieks, Blake
Meike, SPD, Oreilly, ISBN10: 81-8404-733-9, ISBN13:978-81-
8404-733-2
3. Hello Android, Introducing Google‟s Mobile Development Platform,
3rd Edition, by Ed Burnette, Pragmatic Programmers, LLC.ISBN-10:
1-934356-56-5, ISBN-13: 978-1-934356-56-2
4. https://developer.android.com/training/index.html
16
5. http://www.codelearn.org/android-tutorial
6. http://www.tutorialspoint.com/android/

1. Identify the various aspects of android platform and different android
developer tools. (PO1,3,4)
2. Recognize the activity life cycle and fragment life cycle. (PO1,3,4)
3. Demonstrate the usage of different Views and ViewGroups. (PO1,3,4)
4. Demonstrate the knowledge of location-based services and notifications in
applications. (PO1,3,4)
5. Develop the Android‟s communication abilities using SMS and Telephony
services. (PO1,3,4)
17
Python Programming Laboratory
CourseCode:MCSL14 Credits: 0:0:1
Prerequisites:Nil Contact Hours: 28
Course Coordinator/s: Dr. Rajarajeswari S
Course Contents:
1. Python Basics
2. Control Structures
3. Functions
4. Strings, lists, list comprehensions
5. Tuples and dictionaries
6. Modules and packages
7. Object Oriented Concepts
8. Regular Expression
9. Programs on File I/O
10. Exceptions
11. Network Programming
12. GUI Programming
13. Design a simple game application using pygame
14. Game application Demo.
Text Books:
1. Python Programming: Using Problem Solving Approach, Reema
Thareja.
2. Problem Solving and Python Programming, E Balagurusamy
Reference Books:
1. Introduction to computer science using Python : A computational
Problem solving focus, Charles dierbagh.
2. Practical programming: An Introduction To Computer science using
Python,Campbell, J., Gries, P., Montojo, J., & Wilson, G. (2013),
Pragmatic Bookshelf,2ndEdition.
3. Learn Python the Hard Way: A Very Simple Introduction to the
Terrifyingly Beautiful World of Computers and Code, Shaw, Z. A.
(2013), Addison-Wesley.
18
Course Outcomes (COs)
After the course, students should be able to:
1. Adapt and combine standard algorithms to solve a given problem
(includes numericalas well as non-numerical algorithms)(PO1,3,4)
2. Adequately use standard programming constructs: repetition,
selection, functions,Composition, modules, aggregated data (arrays,
lists, etc.)(PO1,3,4)
3. Understand and use object based software concepts (constructing
OO software will bedealt with in the course Software
Engineering).(PO1,3,4)
4. Create, debug and test a software application using the Python
programming language.(PO1,3,4)
5. Use library software for (e.g.) building a graphical user interface,
web application, orMathematical software.(PO1,3,4)
19
Technical Seminar-I/II
Course Code: MCS15/MCS25 Credits: 0:0:2
Prerequisites: Nil
Rubrics for assessment of Seminar
Criteria Distinguished (5) Good (4) Basic (3) Unacceptable (1) Score
Organization - Extremely well - Generally well - Somewhat - Poorly organized
organized. organized. organized. -Does not clearly
-Introduces the -Introduces the -Introduces the introduce the
purpose of the purpose of the purpose of the purpose of the
presentation clearly presentation clearly. presentation presentation
and creatively. -Includes transitions -Includes some -Uses ineffective
-Effectively includes to connect transitions to transitions that
smooth, clever key points and connect key points rarely connect
transitions which are better transitions but there is difficulty points; cannot
succinct but not from idea to idea in following understand
broken up in order to are noted. presentation. presentation because
connect key points - Most information - Student jumps there is no sequence
-Student presents presented is in around topics. of information.
information in logical, logical sequence; Several points are - Presentation is
interesting sequence A few minor points confusing. broken and
which audience can may be confusing -Ends with a disjointed; no
follow. -Ends with a summary or apparent logical
-Ends with an accurate summary of main conclusion; little order of
conclusion showing points showing evidence of presentation-Ends
thoughtful, strong some evaluation of evaluating content without a summary
20
evaluation of the the evidence based on Evidence. or conclusion.
evidence presented. presented.
Content: -Speaker provides an -For the most part, -Explanations of -No reference is
Depth and accurate and complete explanations of concepts and/or made to literature or
Accuracy explanation of key concepts and theories are theory. Presentation
concepts and theories, theories are accurate inaccurate or is not clear;
drawing upon relevant and complete. Some incomplete. Little information that
literature. helpful applications attempt is made to does not support
Applications of theory of theory are tie in theory. There presentation in any
are included to included. is a great deal of way is unnecessarily
illuminate issues. -Presents evidence information that is included.
-Provides evidence of of valid research on not connected to the -Presents little or no
extensive and valid the selected topic, current presentation. evidence of valid
research on the with multiple -Presents evidence of research on the
selected topic, with sources. research on the selected topic.
multiple and varied -Combines existing selected topic, with -Shows little
sources. ideas to form new sources. evidence of the
-Combines and insights. -Combines existing combination of
evaluates existing -No significant ideas. ideas.
ideas to form new errors are made; a -Few errors are made -Information
insights. few inconsistencies to distract a included is
-Information or errors in knowledgeable sufficiently
completely accurate; information. listener, but some inaccurate that
all names and facts -Level of information is indicates absence of
were precise and presentation is accurate. accurate
21
explicit generally -Portions of information.
-Level of presentation appropriate. presentation are too -Presentation
is appropriate for the elementary or too consistently is too
audience. sophisticated for elementary or too
audience. sophisticated for the
audience.
Creativity -Uses the unexpected -Some originality -Little or no - Bland and
to full advantage; very apparent; clever at variation; a few predictable.
original, clever, and times; good variety original touches but Repetitive with little
creative approach that and blending of for the most part or no variety; little
captures audience's materials/media. material presented creative energy
attention. with little originality used.
or interpretation.
Use of -Graphics designed -While graphics - occasional use of -Student uses
Communicat reinforce presentation relate and aid graphics that rarely superfluous
ion Aids and maximize presentation, media support presentation graphics, no
audience are not as varied ; visual aids were not graphics, or graphics
understanding; use of and not as well useful or clear, time that are so poorly
media is varied and connected to the wasting use of prepared that they
appropriate with presentation. multimedia detract from the
media not being added presentation.
simply for the sake of
use.
22
Use of -Poised, clear -Clear articulation -Audience -Student is anxious
Language articulation; proper but not as polished; occasionally has and cannot be heard
volume; steady rate; slightly trouble hearing the or monotone with
enthusiasm; uncomfortable at presentation; seems little or no
confidence; speaker is times Most can uncomfortable.- expression.-
clearly comfortable in hear presentation.- Presentation has Presentation has
front of the group. - Presentation has no three misspellings four or more
Presentation has no more than two and/or grammatical spelling errors
misspellings or misspellings and/or errors. and/or grammatical
grammatical errors. grammatical errors errors.
Eye Contact -Maintains eye - Student maintains -Some eye contact, -Student reads all or
contact; seldom eye contact most of but not most of slides with
returning to notes; the time but Maintained and at no eye contact.
presentation is like a frequently returns to least half the time
planned conversation. slides. reads most of slides.
Viva Voce -Demonstrates -Demonstrates -Demonstrates some -Demonstrates
extensive knowledge knowledge of the knowledge of incomplete
of the topic by topic by responding rudimentary knowledge of the
responding accurately and questions by topic by
confidently, precisely Appropriately responding responding
and addressing accurately to inaccurately and
appropriately to all questions . At ease questions. Inappropriately to
23
audience with answers to all questions.
questions. questions but fails
to elaborate.
Report Document is fully Document Document has low Document has
compliant with has high degree of degree of minimal degree of
required compliance compliance with compliance with
rules and with required required required rules
structure. rules rules and
Document uses and and structure
highly appropriate structure. structure Document contains
language Document uses Document uses inappropriate
and style. appropriate mostly appropriate language or many
language language and spelling /
specific to the contains occasional grammatical errors
discipline spelling /
grammatical errors
Regularity Reports to guide Reports to guide Does not report to Has not met the
regularly for seminar often for seminar guide for seminar guide at all.
discussion discussion discussion
Overall Excellent Good Average Poor
Presentation
24
Data Analytics Using R
Prerequisites: Nil Contact Hours: 56
Course Coordinator:Dr. S Rajarajeswari
Unit I
Introduction to big Data: Big Data Overview with typical examples, What
is Data Science, Introduction to Big Data Analytics, Data Analytics Life
cycle, Domain-specific Life cycle.
Unit II
Data, Data Range, Data Management, Data Mining, Data Munging,
Wrangling and Cleaning, Databases and Relational Algebra, Parallel Data
Bases, Parallel Query Processing, Mean and Standard Deviation, Estimation-
Only Analyses, Use Case: Watching Data Trends with Google Ngrams, Use
Case: Estimating Move Preferences.
Unit III
Introduction to Analytics - introduction to machine learning, Supervised
learning overview, simple nearest neighbor, decision trees/forests, regression,
Unsupervised learning: k-means, multi-dimensional scaling Graph
Analytics: PageRank, community detection, recursive queries, iterative
processing, Text Analytics: latent semantic analysis, Visualization & visual
data analytics.
Unit IV
Tools and Methods deployed in Data Science, Introduction to R language, R
functions and programming, R Grphics, R and commonly used statistics, R
Commander, analyzing and exploring data with R, R studio, Advantages and
disadvantages of R, R vs SAS Map Reduce/Hadoop, MapR Technologies and
The Most Powerful, Elegant FREE Version of Hadoop Window and MADlib
functions.
Unit V
Case Studies and Illustrations:IBM BigInsights, BigSheets, and Netezza
Customer Intelligence, RainStor Big Data Analytics on Hadoop - The
Industry's First Enterprise-Class Database Running Natively on Hadoop,
DataStax (Including Coverage of the Free "Community Edition" of
DataStax's Cassandra Implementation, with OpsCenter), Microsoft's Big
Data Solution,Jigsaw: Visualization for Investigative Analysis and latest state
of the art examples.
25
Text Books:
1. Chen, M., Mao, S., Zhang, Y., & Leung, V. C.“Big Data-Related
Technologies, Challenges and Future Prospect”s , 2014, Springer
(Chapters: 1-6)
2. Lin, J., & Dyer, C. “Data-intensive text processing with
MapReduce”,2010, (Chapters: 2and 5)
3. Robert I. Kabacoff, “R in Action”, 2011,(Chapter 2 Pages:21-32)
4. Zumel, N., & Mount, J. “Practical data science with R”, 2014,
(Chapters: 5, Pages 81-91 )
Reference Books:
1. O. R. Team. Big Data Now: Current Perspectives from O‟Reilly
Radar. O‟Reilly Media, 2011.
2. Adler, Joseph. R in a Nutshell, Second Edition. O‟Reilly Media,
2012.

1. To take typical Big Data, filter and wrangle the data. (PO1,3,4)
2. To recognize the domain for analysis.(PO1,3,4)
3. To identify the type of domain-specific analytics to be deployed. (PO1,3,4)
4. To carry out mathematical approach in analytics. (PO1,3,4)
5. To be ready as a Data Scientist leading towards suitable job in analytics in
industry or to pursue research towards higher degree. (PO1,3,4)
26
Advanced Algorithms
Prerequisites: Knowledge of Analysis and Design of Algorithm
Contact Hours: 42+28
Course Coordinator: Dr. Jagadish S Kallimani
Unit I
Analysis Techniques: Growth of Functions, Asymptotic notations, Standard
notations and common functions, Recurrences and Solution of Recurrence
equations – The Substitution method, The recurrence – tree method, The
master method, Amortized Analysis: Aggregate, Accounting and Potential
Methods.
Unit II
Graph Algorithms: Bellman-Ford Algorithm, Single source shortest paths
in a DAG, Johnson‟s Algorithm for sparse graphs, Maximum bipartite
matching. Trees: B-trees, Red-Black trees Hashing: General Idea, Hash
Function, Separate Chaining, Open addressing, Rehashing, Extendible
hashing.
Unit III
Number – Theoretic Algorithms: Elementary notations, GCD, Modular
Arithmetic, Solving modular linear equations, The Chinese remainder
theorem, Powers of an element, RSA cryptosystem. Heaps: Heaps, Priority
Queues, Binomial Heaps, Fibonacci Heaps.
Unit IV
String Matching Algorithms: Naïve string matching, Rabin – Karp
algorithm, String matching with finite automata, Knuth-Morris-Pratt
algorithm, Boyer-Moore Algorithms.
Unit V
Algorithmic Puzzles: Magic Square, n-queens problem, Glove Selection,
Ferrying Soldiers, Jigsaw Puzzle Assembly, A Stack of Fake Coins,
Maximum Sum Descent, Hats of Two Colors, Pluses and Minuses, Searching
for a Pattern, Locker Doors, Palindrome Counting, Inverting a Coin Triangle,
Sorting 5 in 7.
Text Books:
1. T H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to
Algorithms, 3/e, PHI, 2011.
2. Mark Allen Weiss: Data Structures and Algorithm Analysis in C++,
3rdEdition, Pearson Education, 2011.
27
3. Anany Levitin and Maria Levitin: Algorithmic Puzzle, Oxford University
Press, 2011
Reference Books:
1. Ellis Horowitz, Sartaj Sahni, S Rajasekharan: Fundamentals of Computer
Algorithms, University Press, 2007.
2. Alfred V Aho, John E Hopcroft, J D Ullman: The Design and Analysis of
Computer Algorithms, Pearson Education, 2011.

1. Devise recurrence relations and amortized cost of various operations.
(PO1,3,4)
2. Illustrate graph algorithms such as Bellman-Ford, Shortest path, bipartite
matching, B-trees, Red-Black trees and hashing techniques. (PO1,3,4)
3. Identify the methods for solving modular linear equations, Chinese
remainder theorem and RSA cryptosystem, types of heaps such as
Binomial and Fibonacci heaps. (PO1,3,4)
4. Assess the string matching algorithms such as Boyer-Moore and Knuth-
Morris-Pratt algorithm. (PO1,3,4)
5. Compose mathematical models, objective functions and constraints to
solve algorithmic puzzles. (PO1,3,4,5)
28
IoT and Cloud Computing Laboratory
Course Code:MCSL23 Credits: 0:0:1
Course Coordinator/s: Mrs. Aparna R
Internet of Things Laboratory:

Internet of Things Laboratory provides one of the simplest ways to design
and implement various IoT applications. IoT is a flexible platform for
experimental research that uses connected devices in homes and beyond.
 Interconnection of devices and implementation of application scenarios.
 Deployment and monitoring of field studies and analysis of data from
experiments.
 Sharing of data, code to evaluate ideas in a diverse set.
Projects can be designed in various IoTs domain like
1. Home Automation- Smart Lighting, Smart Appliances, Intrusion
Detection, Smoke/Gas Detectors.
2. Cities - Smart Parking, Smart Lighting, Smart Roads, Structural
Health Monitoring, Surveillance Emergency Response.
3. Environment -Weather Monitoring, Air Pollution Monitoring, Noise
Pollution Monitoring, Forest Fire Detection, River Floods Detection.
4. Energy -Smart Grids, Renewable Energy Systems.
5. Retail -Inventory Management, Smart Payments, Smart Vending
Machines.
6. Logistics-Route Generation and scheduling, Fleet Tracking
Shipment, Monitoring, Remote Vehicle Diagnostics.
7. Agriculture-Smart Irrigation, Green House Control.
8. Industry - Machine Diagnosis & Prognosis - Indoor Air Quality
Monitoring.
9. Health & Lifestyle - Health & Fitness Monitoring, Wearable
Electronics.
The above mentioned projects can be developed using microcontrollers like
Arduino Boards and Raspberry Pi.
Course Delivery: This course is delivered through presentations and
miniproject.
Cloud Computing Laboratory

List of Experiments:
Use Eucalyptus or Open Nebula or equivalent to set up the cloud and
demonstrate:
29
1. Find procedure to run the virtual machine of different configuration. Check
how many virtual machines can be utilized at particular time.
2. 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.
3. Install a C compiler in the virtual machine and execute a sample program.
4. Show the virtual machine migration based on the certain condition from
one node to the other.
5. Find procedure to install storage controller and interact with it.
6. Find procedure to set up the one node Hadoop cluster.
7. Mount the one node Hadoop cluster using FUSE.
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.
List of Experiments:
1. SaaS: Google Drive
 With your Gmail account, create a spreadsheet to share with the people at
the same table, invite them.
 See how you can simultaneously edit the document you just created
PaaS: google Maps
http://maps.google.com/maps/api/staticmap?center=Eiffel+Tower&zoom=12
&size=512x512&sensor=false
2. Design Virtual Machine using VM player and test Client server
application using Virtual Machine
3. Design Virtual Machine using VM player and test Client server
application using Virtual Box
4. Compare the pros and cons of VM player and Virtual Box
5. Paas – Deploy Applications to google App Engine - simple web
applications
6. Paas – Deploy Applications to google App Engine - web applications with
database
7. Deploy Applications to cloud foundry using VMC
8. Deploy Applications to cloud foundry using Micro cloud foundry
9. Deploy Applications to cloud foundry using Eclipse
10. To Set up a Hadoop Cluster – Single Node
11. To Set up a Hadoop Cluster – Multi Node
12. Execute Map Reduce Programs in Hadoop Cluster
13. Study of Future Grid
30
Reference Books:
1. Cloud Computing: Theory and Practice, Dan Marinescu, 1st edition, MK
Publishers, 2013.
2. Distributed and Cloud Computing, From Parallel Processing to the
Internet of Things, Kai Hwang, Jack Dongarra, Geoffrey Fox. MK
Publishers.
3. Cloud Computing: A Practical Approach, Anthony T. Velte, Toby J.
Velte, Robert Elsenpeter, McGraw Fill, 2010
4. Cloud computing A Hands on Approach Arshdeep Bahga,Vijay
Madisetti Universities Publications
5. Online Readings : http://www.pds.ewi.tudelft.nl/ ,
http://csrc.nist.gov/publications/nistpubs

1. Design applications that will communicate with IoT hardware and
software.(PO1,3,4)
2. Explore specific IoT domain like Network, communications, Management
infrastructure, Services applications development and Human
interaction.(PO1,3,4)
3. Examine an IoT offering of the project in terms of IoT levels and
Protocols.(PO1,3,4)
4. Describe different kinds of Internet-connected product concepts.(PO1,3,4)
31
Data Analytics Lab
Course Code:MCSL24 Credits: 0:0:1
Course Coordinator/s:Mr. Srinidhi H
1. HDFS
Start by reviewing HDFS. You will find that its composition is similar
to your local Linux file system. You will use the Hadoop fs command
when interacting with HDFS.
 Review the commands available for the Hadoop Distributed File
System
 Copy file foo.txt from local disk to the user‟s directory in HDFS
 Get a directory listing of the user‟s home directory in HDFS
 Get a directory listing of the HDFS root directory
 Display the contents of the HDFS file user/fred/bar.txt
 Move that file to the local disk, named as baz.txt
 Create a directory called input under the user‟s home directory
 Delete the directory input old and all its contents
 Verify the copy by listing the directory contents in HDFS
2. MapReduce
 Create a JOB and submit to cluster
 Track the job information
 Terminate the job
 Counters in MR Jobs with example
 Map only Jobs and generic map examples
 Distributed cache example
 Combiners, Secondary sorting and Job chain examples
3. MapReduce (Programs) Using movie lens data
 List all the movies and the number of ratings
 List all the users and the number of ratings they have done for a movie
 List all the Movie IDs which have been rated (Movie Id with at least
one user rating it)
 List all the Users who have rated the movies (Users who have rated at
least one movie)
 List of all the User with the max, min, average ratings they have given
against any movie
32
 List all the Movies with the max, min, average ratings given by any
user
4. Extract facts using Hive Hive allows for the manipulation of data in HDFS
using a variant of SQL. This makes it excellent for transforming and
consolidating data for load into a relational database. In this exercise you will
use HiveQL to filter and aggregate click data to build facts about user‟s
movie preferences. The query results will be saved in a staging table used to
populate the Oracle Database. The moveapp_log_json table contains an
activity column. Activity states are as follows:
 RATE_MOVIE
 COMPLETED_MOVIE
 PAUSE_MOVIE
 START_MOVIE
 BROWSE_MOVIE
 LIST_MOVIE
 SEARCH_MOVIE
 LOGIN
 LOGOUT
 INCOMPLETE_MOVIE
hive> SELECT * FROM movieapp_log_json LIMIT 5; hive> drop table
movieapp_log_json; hive> CREATE EXTERNAL TABLE
movieapp_log_json ( custId INT, movieId INT, genreId INT, time STRING,
recommended STRING, activity INT, rating INT, price FLOAT ) ROW
FORMAT SERDE 'org.apache.hadoop.hive.contrib.serde2.JsonSerde'
LOCATION '/user/oracle/moviework/applog/'; hive> SELECT * FROM
movieapp_log_json LIMIT 20; hive> SELECT MIN(time), MAX(time)
FROM movieapp_log_json
1. PURCHASE_MOVIE Hive maps queries into Map Reduce jobs,
simplifying the process of querying large datasets in HDFS. HiveQL
statements can be mapped to phases of the Map Reduce framework. As
illustrated in the following figure, selection and transformation operations
occur in map tasks, while aggregation is handled by reducers. Join operations
are flexible: they can be performed in the reducer or mappers depending on
the size of the leftmost table. 1. Write a query to select only those clicks
which correspond to starting, browsing, completing, or purchasing movies.
Use a CASE statement to transform the RECOMMENDED column into
integers where „Y‟ is 1 and „N‟ is 0. Also, ensure GENREID is not null. Only
include the first 25 rows.
33
2. Write a query to select the customer ID, movie ID, recommended state and
most recent rating for each movie.
3. Load the results of the previous two queries into a staging table. First,
create the staging table:
4. Next, load the results of the queries into the staging table.
5. Extract sessions using Pig While the SQL semantics of HiveQL are useful
for aggregation and projection, some analysis is better described as the flow
of data through a series of sequential operations. For these situations, Pig
Latin provides a convenient way of implementing data flows over data stored
in HDFS. Pig Latin statements are translated into a sequence of Map Reduce
jobs on the execution of any STORE or DUMP command. Job construction is
optimized to exploit as much parallelism as possible, and much like Hive,
temporary storage is used to hold intermediate results. As with Hive,
aggregation occurs largely in the reduce tasks. Map tasks handle Pig‟s
FOREACH and LOAD, and GENERATE statements. The EXPLAIN
command will show the execution plan for any Pig Latin script. As of Pig
0.10, the ILLUSTRATE command will provide sample results for each stage
of the execution plan. In this exercise you will learn basic Pig Latin
semantics and about the fundamental types in Pig Latin, Data Bags and
Tuples.
1. Start the Grunt shell and execute the following statements to set up a
dataflow with the click stream data. Note: Pig Latin statements are
assembled into Map Reduce jobs which are launched at execution of a
DUMP or STORE statement.
2. Group the log sample by movie and dump the resulting bag.
1. Add a GROUP BY statement to the sessionize.pig script to process the
click stream data into user sessions.
Reference Books:
1. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley,
2012.
2. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
3. Vignesh Prajapati, Big data analytics with R and Hadoop, SPD 2013.
4. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive",
O'Reilley, 2012.
5. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011.
6. Alan Gates, "Programming Pig", O'Reilley, 2011
34
1. Describe big data and use cases from selected business domains.
(PO1,3,4)
2. Explain NoSQL big data management. (PO1,3,4)
3. Install, configure, and run Hadoop and HDFS. (PO1,3,4)
4. Perform map-reduce analytics using Hadoop. (PO1,3,4)
5. Use Hadoop related tools such as HBase, Cassandra, Pig, and Hive for
big data Analytics. (PO1,3,4)
35
Engineering Economics, Project Management and Professional Ethics
Course Coordinator/s: Prof. Nagabhushana A M
Unit I
Introduction: Understanding Project Management, Defining the Project
Manager‟s Role, The Project Manager as the Planning Agent, The Downside
of Project Management, Classification of Projects, Differing Views of Project
Management, Concurrent Engineering: A Project Management Approach,
Project Management Growth Concepts and definitions: Systems, Programs,
and Projects: A Definition, Product versus Project Management: A
Definition, The Many Faces of Success, The Many Faces of Failure, The
Stage-Gate Process, Project Management Methodologies, Organizational
Structures: Traditional (Classical) Organization, Matrix Organizational Form
Modification of Matrix Structures, The Strong, Weak, Balanced Matrix.
Unit II
Organizing and staffing the project office and the team: The Staffing
Environment, Selecting the Project Manager: An Executive Decision, Skill
Requirements for Project and Program Managers, Next Generation Project
Managers, Duties and Job Descriptions, Selecting the Project Management
Implementation Team, Management Functions: Project Authority, Team
Building as an Ongoing Process, Dysfunctions of a Team , Employee–
Manager Problems, Management Pitfalls , Conflicts: The Conflict
Environment, Conflict Resolution, The Management of Conflicts, Conflict
Resolution Modes, the variables for success: Predicting Project Success,
Project Management Effectiveness.
Unit III
Planning: General Planning, Life-Cycle Phases, Proposal Preparation,
Kickoff Meetings, Understanding Participants‟ Roles, Project Planning, The
Statement of Work, Project Specifications, Milestone Schedules, Work
Breakdown Structure, Detailed Schedules and Charts, Project Plan, Total
Project Planning, Management Control, Configuration Management,
Enterprise Project Management Methodologies, Project Audits, Network
Scheduling Techniques: Network Fundamentals, Graphical Evaluation and
Review Technique, Network Replanning, Estimating Activity Time,
Estimating Total Project Time, Total PERT/CPM Planning, Project Graphics:
Bar (Gantt) Chart, Other Conventional Presentation Techniques.
Unit IV
36
Pricing and Estimating: Types of Estimates, Pricing Process, Organizational
Input Requirements, Labor Distributions, Overhead Rates, Materials/Support
Costs, Pricing Out the Work, Smoothing Out Department Man-Hours, The
Pricing Review Procedure, Project Risks, Life-Cycle Costing (LCC), Cost
Control: Understanding Control, The Operating Cycle, Cost Account Codes,
Budgets,The Earned Value Measurement System (EVMS), Variance and
Earned Value, Trade off analysis in project environment: Methodology for
Trade-off Analysis
Unit V
Risk Management: Definition of Risk, Tolerance for Risk, Definition of Risk
Management, Certainty, Risk, and Uncertainty, Risk Identification, Risk
Analysis, Qualitative Risk Analysis, Quantitative Risk Analysis, Probability
Distributions and the Monte Carlo Process, Contract Management: Plan
Procurement, Types of Contracts, Incentive Contracts, Contract Type versus
Risk, Contract Administration Cycle, Quality Management: Definition of
Quality, The Quality Movement, Quality Management Concepts, The Cost of
Quality, The Seven Quality Control Tools, Implementing Six Sigma, Lean
Six Sigma and DMAIC 914, Just-in-Time Manufacturing (JIT), Total Quality
Management (TQM).
Reference Book:
1. Project Management: A Systems Approach to Planning, Scheduling, and
Controlling, 10thed. Author: Harold Kerzner.

At the end of the course, the students will be able to:
1. Recognize issues in a realistic project scenario.(PO 1,3,4)
2. Employ work breakdown structures (WBS) in a project application.(PO
1,3,4)
3. Demonstrate the use of appropriate network scheduling techniques.(PO
1,3,4)
4. Produce a project proposal.(PO 1,3,4)
5. Discuss the implementation of a proposed plan.(PO 1,3,4)
37
ELECTIVES
Advances in Computer Networks
Course Code:MCSE01 Credits: 4:0:0
Prerequisites: Computer Networks Contact Hours: 56
Course Coordinator/s: Dr. Monica R Mundada
Unit I
Foundation: Building a Network, Requirements, Perspectives, Scalable
Connectivity, Cost-Effective Resource sharing, Support for Common
Services, Manageability, Protocol layering, Performance, Bandwidth and
Latency, Delay X Bandwidth Product, Perspectives on Connecting, Classes
of Links, Reliable Transmission, Stop-and-Wait, Sliding Window,
Concurrent Logical Channels.
Unit II
Internetworking I: Switching and Bridging, Datagram‟s, Virtual Circuit
Switching, Source Routing, Bridges and LAN Switches, Basic
Internetworking (IP), What is an Internetwork?, Service Model, Global
Addresses, Datagram Forwarding in IP, sub netting and classless addressing,
Address Translation (ARP), Host Configuration (DHCP), Error Reporting
(ICMP), Virtual Networks and Tunnels.
Unit III
Internetworking- II: Network as a Graph, Distance Vector (RIP), Link State
(OSPF), Metrics, The Global Internet, Routing Areas, Routing among
Autonomous systems (BGP), IP Version 6 (IPv6), Mobility and Mobile IP
Unit IV
End-to-End Protocols: Simple Demultiplexer (UDP), Reliable Byte
Stream(TCP), Endto-End Issues, Segment Format, Connecting Establishment
and Termination, Sliding Window Revisited, Triggering Transmission,
Adaptive Retransmission, Record Boundaries, TCP Extensions, Queuing
Disciplines, FIFO, Fair Queuing, TCP Congestion Control, Additive
Increase/ Multiplicative Decrease, Slow Start, Fast Retransmit and Fast
Recovery.
Unit V
Congestion Control and Resource Allocation Congestion-Avoidance
Mechanisms, DEC bit, Random Early Detection (RED), Source-Based
Congestion Avoidance. The Domain Name System (DNS), Electronic Mail
(SMTP,POP,IMAP,MIME), World Wide Web (HTTP), Network
Management (SNMP)
38
Reference Books:
1. Larry Peterson and Bruce S Davis “Computer Networks :A System
Approach” 5th Edition , Elsevier -2014.
2. Douglas E Comer, “Internetworking with TCP/IP, Principles, Protocols
and Architecture” 6th Edition, PHI – 2014.
3. Uyless Black, “Computer Networks, Protocols , Standards and Inte
rfaces” 2 nd Edition - PHI.
4. Behrouz A Forouzan, “TCP /IP Protocol Suite” 4 th Edition – Tata
McGraw-Hill.

1. Explain basic computer network technology. (PO1,3,4)
2. Explain Data Communications System and its components. (PO1,3,4)
3. Identify the different types of network topologies and protocols.
(PO1,3,4)
4. Identify the different types of network devices and their functions within a
network. (PO1,3,4)
5. Illustrate the skills of subnet and routing mechanisms. (PO1,3,4)
39
Wireless Ad-Hoc Networks
Course Code: MCSE02 Credits: 4:0:0
Course Coordinator/s: Dr. Annapurna P Patil
UnitI
Ad-hoc Wireless Networks Introduction, Issues in Ad-hoc Wireless
Networks, Ad-hoc Wireless Internet; MAC Protocols for Ad-hoc Wireless
Networks: Introduction, Issues in Designing a MAC Protocol, Design Goals
of MAC Protocols, Classification of MAC protocols, Contention-Based
Protocols, Contention-Based Protocols with Reservation Mechanisms,
Contention-Based Protocols with Scheduling Mechanisms, MAC Protocols
that Use Directional Antennas.
UnitII
Routing Protocols for Ad-hoc Wireless Networks Introduction, Issues in
Designing a Routing Protocol for Ad-hoc Wireless Networks; Classification
of Routing Protocols; Table Driven Routing Protocols; On-Demand Routing
Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols and
Power-Aware Routing Protocols.
UnitIII
Multicast Routing in Ad-hoc Wireless Networks Introduction, Issues in
Designing a Multicast Routing Protocol, Operation of Multicast Routing
Protocols, An Architecture Reference Model for Multicast Routing Protocols,
Classifications of Multicast Routing Protocols, Tree-Based Multicast Routing
Protocols and Mesh-Based Multicast Routing Protocols.
UnitIV
Transport Layer and Security Protocols for Ad-hoc Networks: Introduction,
Issues in Designing a Transport Layer Protocol; Design Goals of a Transport
Layer Protocol; Classification of Transport Layer Solutions; TCP over
Transport Layer Solutions; Other Transport Layer Protocols for Ad-hoc
Networks; Security in Ad-hoc Wireless Networks, Issues and Challenges in
Security Provisioning, Network Security Attacks, Key Management and
Secure Touting Ad-hoc Wireless Networks.
UnitV
Quality of Service and Energy Management in Ad-hoc Wireless Networks:
Introduction, Issues and Challenges in Providing QoS in Ad-hoc Wireless
Networks, Classification of QoS Solutions, MAC Layer Solutions, Network
Layer Solutions; Energy Management in Ad-hoc Wireless Networks:
Introduction, Need for Energy Management in Ad-hoc Wireless Networks,
Classification of Energy Management Schemes, Battery Management
40
Schemes, Transmission Management Schemes, System Power Management
Schemes.
Text Book:
1. C. Siva Ram Murthy & B. S. Manoj: Ad-hoc Wireless Networks, 2nd
Edition, Pearson Education, 2011
Reference Books:
1. Ozan K. Tonguz and Gianguigi Ferrari: Ad-hoc Wireless Networks, John
Wiley, 2007.
2. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad-hoc Wireless Networking,
Kluwer Academic Publishers, 2004.
3. C.K. Toh: Ad-hoc Mobile Wireless Networks- Protocols and Systems,
Pearson Education, 2002.

1. Understand of basic WSN technology and supporting protocols and
technology. (PO1,3,4)
2. Identify medium access control protocols and address physical layer
issues.(PO1,3,4)
3. Describe the knowledge routing protocols for sensor networks and main
design issues.(PO1,3,4)
4. Describe knowledge of transport layer protocols for sensor networks, and
design requirements. (PO1,3,4)
5. Describe Sensor management, sensor network middleware, operating
systems. (PO1,3,4)
41
Distributed Systems

Prerequisites: OS Contact Hours: 56
Course Coordinator/s: Sini Anna Alex
Course Contents:
Unit I
Introduction : Definition, Relation to computer system components,
Motivation, Relation to parallel multiprocessor/multicomputer systems,
Message-passing systems versus shared memory systems, Primitives for
distributed communication, Synchronous versus asynchronous executions,
Design issues and challenges.
A model of distributed computations: A distributed program, A model of
distributed executions, Models of communication networks, Global state of a
distributed system, Cuts of a distributed computation, Past and future cones
of an event, Models of process communications
Logical time: Introduction, A framework for a system of logical clocks,
Scalar time, Vector time, Efficient implementations of vector clocks, Jard–
Jourdan‟s adaptive technique, Matrix time, Virtual time, Physical clock
synchronization: NTP.
Unit II
Global state and snapshot recording algorithms: Introduction, System
model and definitions, Snapshot algorithms for FIFO channels, Variations of
the Chandy–Lamport algorithm, Snapshot algorithms for non-FIFO channels,
Snapshots in a causal delivery system, Monitoring global state, Necessary
and sufficient conditions for consistent global snapshots, Finding consistent
global snapshots in a distributed computation.
Terminology and basic algorithms: Topology abstraction and overlays,
Classifications and basic concepts, Complexity measures and metrics,
Program structure, Elementary graph algorithms, Synchronizers, Maximal
independent set (MIS), Connected dominating set, Compact routing tables,
Leader election, Challenges in designing distributed graph algorithms, Object
replication problems.
Unit III
Message ordering and group communication: Message ordering
paradigms, Asynchronous execution with synchronous communication,
Synchronous program order on an asynchronous system, Group
communication, Causal order (CO), Total order, A nomenclature for
42
multicast, Propagation trees for multicast, Classification of application-level
multicast algorithms, Semantics of fault-tolerant group communication,
Distributed multicast algorithms at the network layer, .
Termination detection: Introduction, System model of a distributed
computation, Termination detection using distributed snapshots, Termination
detection by weight throwing, A spanning-tree-based termination detection
algorithm, Message-optimal termination detection, Termination detection in a
very general distributed computing model, Termination detection in the
atomic computation model, Termination detection in a faulty distributed
system.
Unit IV
Distributed mutual exclusion algorithms: Introduction, Preliminaries,
Lamport‟s algorithm, Ricart–Agrawala algorithm, Singhal‟s dynamic
information-structure algorithm, Lodha and Kshemkalyani‟s fair mutual
exclusion algorithm, Quorum-based mutual exclusion algorithms,
Maekawa‟s algorithm, Agarwal–El Abbadi quorum-based algorithm, Token-
based algorithms, Suzuki–Kasami‟s broadcast algorithm, Raymond‟s tree-
based algorithm,
Deadlock detection in distributed systems: Introduction, System model,
Preliminaries, Models of deadlocks, Knapp‟s classification of distributed
deadlock detection algorithms, Mitchell and Merritt‟s algorithm for the single
resource model, Chandy–Misra–Haas algorithm for the AND model,
Chandy–Misra–Haas algorithm for the OR model, Kshemkalyani–Singhal
algorithm for the P-out-of-Q model.
Unit V
Global predicate detection: Stable and unstable predicates, Modalities on
predicates, Centralized algorithm for relational predicates, Conjunctive
predicates, Distributed algorithms for conjunctive predicates, Further
classification of predicates.
Consensus and agreement algorithms: Problem definition, Overview of
results, Agreement in a failure-free system (synchronous or asynchronous),
Agreement in (message-passing) synchronous systems with failures,
Agreement in asynchronous message-passing systems with failures, Wait-
free shared memory consensus in asynchronous systems.
Peer-to-peer computing and overlay graphs: Introduction, Data indexing
and overlays, Unstructured overlays, Chord distributed hash table, Content
addressable networks (CAN), Tapestry, Some other challenges in P2P
system design, Tradeoffs between table storage and route lengths, Graph
43
structures of complex networks, Internet graphs, Generalized random graph
networks, Small-world networks, Scale-free networks, Evolving networks.
Text Book:
1. Ajay D. Kshemkalyani, and Mukesh Singhal “Distributed
Computing: Principles, Algorithms, and Systems”, Cambridge
University Press, 2008 (Reprint 2013).
Reference Books:
1. John F. Buford, Heather Yu, and Eng K. Lua, “P2P Networking and
Applications”, Morgan Kaufmann, 2009 Elsevier Inc.
2. Kai Hwang, Geoffrey C. Fox, and Jack J. Dongarra, “Distributed
and Cloud Computing: From Parallel processing to the Internet of
Things”, Morgan Kaufmann, 2012 Elsevier Inc.

1. Identify the design issues and Challenges in building distributed
systems. (PO1,3,4)
2. Explore different ways of managing time (clock) and recording
global state of distributed computation. (PO1,3,4)
3. Analyze basic distributed graph algorithms, synchronizers, and
practical graph problems, P2P overlay problems(PO1,3,4)
4. Discuss ways to achieve various message ordering schemes and
approaches for detecting termination of a distributed computation.
(PO1,3,4)
5. Identify different assertion based, and tree based distributed
algorithms to implement Distributed Mutual Exclusion. (PO1,3,4)
44
Cloud Computing
Course Coordinator: Mrs. Rajarajeswari S
Unit I
Introduction: Network centric computing and network centric content, Peer-
to-peer systems, Cloud Computing: an old idea whose time has come, Cloud
Computing delivery models & Services, Ethical issues, Cloud vulnerabilities,
Challenges, Cloud Infrastructure: Amazon, Google, Azure & online
services, open source private clouds. Storage diversity and vendor lock-in,
intercloud, Energy use & ecological impact of data centers, service level and
compliance level agreement, Responsibility sharing, user experience,
Software licensing.
Unit II
Cloud Computing: Applications & Paradigms, Challenges, existing and
new application opportunities, Architectural styles of cloud applications:
single , multi ,hybrid cloud site, redundant, non redundant , 3 tier, multi tier
architectures, Workflows coordination of multiple activities, Coordination
based on a state machine model -the Zoo Keeper, The Map Reduce
programming model, Apache Hadoop, A case study: the GrepTheWeb
application, Applications: Healthcare, Energy systems, transportation,
manufacturing, Education, Government, mobile communication, application
development.
Unit III
Cloud Resource Virtualization: Definition, merits and demerits, types &
Techniques, Layering, Virtual machine monitors, Hardware support for
virtualization Case study: Xen -a VMM based on paravirtualization,
Optimization of network virtualization in Xen 2.0, vBlades -paravirtualization
targeting a x86-64 Itanium processor, A performance comparison of virtual
machines, The darker side of virtualization, Software fault isolation.
Unit IV
Cloud Resource Management and Scheduling: Policies and mechanisms
for resource management, Applications of control theory to task scheduling
on a cloud, Stability of a two-level resource allocation architecture, Feedback
control based on dynamic thresholds, Coordination of specialized autonomic
performance managers, A utility-based model for cloud-based web services,
Resource bundling, combinatorial auctions, fair queuing, Start time fair
queuing, borrowed virtual time, Cloud scheduling subject to deadlines,
45
Scheduling mapreduce applications subject to deadlines, Resource
management and application scaling.
Unit V
Storage systems: Evolution, Storage models, file systems, databases, DFS,
General parallel File system, GFS, Hadoop, Locks & Chubby, TPS, NOSQL,
BigTable, Mega store.
Cloud security: Risks, Security, privacy, Trust. Security of OS,VM, VMM,
shared image, management OS, Xoar.
Text Books:
1. Cloud Computing Theory and Practice – DAN C. Marinescu – Elsevier.
2. Cloud Computing: A hands on Approach, by Bagha Madisetti.
Reference Books:
2. Distributed and Cloud Computing, From Parallel Processing to the
Internet of Things, Kai Hwang, Jack Dongarra, Geoffrey Fox. MK
Publishers.
3. Cloud Computing: A Practical Approach, Anthony T. Velte, Toby J.
Velte, Robert Elsenpeter, McGraw Fill, 2010.

1. To analyze the transformation that led to the evolution of Cloud
computing, it's vulnerabilities and its impact.(PO1,3,4)
2. Design different workflows according to requirements and apply map
reduce programming model and real time applications.(PO1,3,4)
3. Make performance comparison of virtual machines and optimization of
virtualization.(PO1,3,4)
4. Develop policies and mechanisms for cloud resources and design
algorithms for scheduling. (PO1,3,4)
5. Assess cloud Storage systems and identify cloud security, privacy issues,
threats, the risks involved, its impact and provide solution. (PO1,3,4)
46
Software Defined Networks
Prerequisites: Data communications and Computer networks
Contact Hours: 56
Course Coordinator: Sanjeetha R
Prerequisites: Data communications and Computer networks
Course Contents:
Unit I
Introduction - Traditional Switch Architecture.
Why SDN-Evolution of Switches and Control Planes, Cost, SDN
Implications for Research and Innovation, Data Center Innovation, Data
Center Needs.
The Genesis of SDN: Forerunners of SDN: Early efforts, Network Access
Control, Orchestration, Virtualization manager network plugins, FORCES,
4D Centralized Network Control, Ethane, Software Defined Networking is
Born, Network Virtualization.
How SDN Works - Fundamental Characteristics of SDN, SDN Operation,
SDN Devices, SDN Controller, SDN Applications, Alternate SDN Methods.
Data Center Needs, Network Virtualization.
Unit II
How SDN Works Contd. -SDN Controller- SDN controller core modules,
SDN controller interfaces, Existing controller implementations, potential
issues with the SDN Controller, SDN Applications, Alternate SDN Methods
– SDN via APIs, Benefits and Limitations of SDN via APIs, SDN via
hypervisor based overlay networks.
The OpenFlow Specification– OpenFlow Overview – The OpenFlow
switch, The OpenFlow Controller, The OpenFlow protocol, The Controller-
switch secure channel, OpenFlow 1.0 and OpenFlow Basics, OpenFlow 1.1
Additions, OpenFlow 1.2 Additions, OpenFlow 1.3 Additions, OpenFlow
Limitations.
Benefits and Limitations of SDN via APIs, OpenFlow Limitations.
Unit III
The OpenFlow SpecificationContd. Openflow 1.4 additions – Bundles,
Eviction and vacancy events, enhanced support for multiple controller,
optical port support, and flow table synchronization.
47
Alternative Definitions of SDN - Potential Drawbacks of Open SDN, SDN
via APIs – Legacy APIs in Network Devices, NETCONF/YANG, BGP-
LS/PCE-P, REST, Examples of SDN via APIs, Ranking SDN via APIs, SDN
via Hypervisor-Based Overlays – Overlay Controller, Overlay Operation,
Examples of SDN via Hypervisor-Based Overlays, Ranking SDN via
Hypervisor-Based Overlays, SDN via Opening Up the Device, Network
Functions Virtualization, Alternatives Overlap and Ranking.
flow table synchronization, Alternatives Overlap and Ranking.
Unit IV
Emerging Protocol, Controller - Additional SDN Protocol Models, Using
Existing Protocols to Create SDN Solutions, Using the Netconf Protocol,
BGP Protocol, BGP-LS Protocol, PCE-P Protocol MPLS Protocol For SDN.
Additional SDN Controller Models - Controllers with Multiple Southbound
Plugins, Controllers Targeting Service Provider Solutions, Controllers Built
For Scalability, Intents-Based Applications.
SDN in the Data Center-Data Center Demands – Overcoming Current
Network Limitations, MAC address explosion, Number of VLANs, Spanning
tree, adding, moving and deleting resources, Failure recovery, multitenancy,
Tunneling Technologies for the Data Center.
Intents-Based Applications, Tunneling Technologies for the Data Center.
Unit V
SDN in the Data Center- Path Technologies in the Data Center, Ethernet
Fabrics in the Data Center, SDN Use Cases in the Data Center, Comparison
Of Open SDN, Overlays, and APIs.
SDN in Other Environments - Wide Area Networks, Service Provider and
Carrier Networks, Campus Networks, Mobile Networks, Optical Networks.
Network Functions Virtualization - Definition Of NFV, What Can We
Virtualize? SDN Vs NFV, When Should NFV Be Used With SDN?, In-Line
Network Functions, SDN Applied To Server Load-Balancing, Firewalls and
Intrusion Detection.
SDN Applications- Application Types, a Simple Reactive Java Application -
Blacklisting Hostnames and IP Addresses, Offloading Flows in the Data
Center.
Optical Networks, Firewalls and Intrusion Detection, Offloading Flows in the
Data Center.
48
Text Book:
1. Paul Goransson, Chuck Black, and Timothy Culver:

Software Defined Networks A Comprehensive Approach, Second
Edition, Elsevier, 2014.
Reference Book:
1. Thomas D.Nadeau & Ken Gray: SDN Software Defined Networks

O'Reilly publishers, Second edition, 2017.
Course Outcomes(COs):

1. Describe the fundamental characteristics of SDN. (PO1,3,4)
2. Differentiate between various OpenFlow specifications.
(PO1,3,4)Identify different ways of implementing SDN. (PO1,3,4)
3. Compare and contrast different types of controller models in SDN.
(PO1,3,4
4. )Illustrate use of SDN in Data Centers and other
environments(PO1,3,4)
49
Advances in Storage Area Networks
Prerequisites: Computer Networks, Computer Organization, Operating
Systems Contact Hours: 56
Course Coordinator/s: Dr. Divakar Harekal
Course Contents:
Unit I
Introduction: Information Storage, Evolution of Storage Architecture, Data
Centre Infrastructure, Virtualization and Cloud Computing. Data Centre
Environment: Application, DBMS, Host, Connectivity, Storage, Disk Drive
Components, Disk Drive Performance, Host Access to Data, Direct-Attached
Storage, Storage Design Based on Application, Disk Native Command
Queuing, Introduction to Flash Drives.
Unit II
Data Protection: RAID Implementation Methods, Array Components,
Techniques, Levels, Impact on Disk Performance, Comparison, Hot Spares.
Intelligent Storage System: Components, Storage Provisioning, Types.
Unit III
Fiber Channel Storage Area Networks: FC Overview, Evolution,
Components, FC Connectivity, Ports, FC Architecture, Fabric Services,
Login Types, Zoning, FC Topologies, Virtualization in SAN.IP SAN and
FCoE: iSCSI, FCIP, FCoE.
Unit IV
Network-Attached Storage: Benefits, Components, NAS I/O Operation,
Implementations, File Sharing Protocols, I/O Operations, Factors Affecting
NAS Performance, File-Level VirtualizationObject Based and Unified
Storage: Object Based Storage Devices, Content Addressed Storage, CAS
Use Cases, Unified Storage. Backup Archive and Replication.
Unit V
Business Continuity: Information Availability, Terminology, Planning
Lifecycle, Failure Analysis, Impact Analysis, Challenges, Adoption
Considerations.Securing the Storage Infrastructure: Framework, Risk Triad,
Domains Managing the Storage Infrastructure: Monitoring, Management
50
Activities, Management Challenges, Information Lifecycle Management,
Storage Tiering.
Text Book:
1. EMC Education Services, edited by Somasundaram G., Alok

Shrivastava “Information Storage and Management”; 2nd edition ,
Wiley India, 2012, ISBN 9788126537501.
Reference Books:
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage

Networks Explained, 1st Edition, Wiley India, 2012.
2. Robert Spalding: Storage Networks, The Complete Reference, 1 st
Edition, Tata McGraw Hill, 2011.
At the end of the course, student should be able to:
1. Identify the need for storage centric network and its benefits of its
adoption (PO1,3,4)
2. Design a storage solution for an application depending on the IOPS
and RAID requirements (PO1,3,4)
3. Have an understanding of the Fiber channel stack and working of
the different layers (PO1,3,4)
4. Have an understanding of NAS, object oriented storage and backup
and recovery (PO1,3,4)
5. Have a business continuity plan and ILM of an enterprise (PO1,3,4)
51
Protocol Engineering
Unit I
Network Reference Model: Layered Architecture, Network Services and
Interfaces, Protocol Functions: Encapsulation, Segmentation and Reassembly
of messages, Error Control, Flow control and Multiplexing, Addressing, OSI
Model, Functions of layers in OSI model, TCP/IP Protocol Suite, MAC
protocols, LLC protocols, Network protocols, Routing, RIP, OSPF, BGP,
Multicast protocols, BOOTP, DHCP, Mobile IP, ICMP, CIDR, ARP, RARP,
transport protocols, UDP, RTP, Wireless protocol challenges, Application
Protocols: FTP, TFTP, Telnet, E-mail, POP, IMAP, SNMP, DNS, HTTP,
RTSP.
Unit II
Introduction: Communication model, Communication Software,
Communication Subsystems, Communication Protocol
Definition/Representation, Formal and Informal Protocol Development
Methods, Protocol Engineering Phases. Protocol Specification:
Components of specification, Service specification, Communication Service
Specification Protocol entity specification: Sender, Receiver and Channel
specification, Interface specifications, Interactions, Multimedia
specifications, Alternating Bit Protocol Specification, RSVP specification.
Unit III
Protocol Specification Language (SDL): Salient Features. Communication
System Description using SDL, Structure of SDL. Data types and
communication paths, Examples of SDL based Protocol Specifications:
Question and answer protocol, X-on-X-off protocol, Alternating bit protocol,
Sliding window protocol specification, TCP protocol specification, SDL
based platform for network, OSPF, BGP Multi Protocol Label Switching
SDL components. Protocol Verification / Validation: Protocol Verification
using FSM, ABP Verification, Protocol Design Errors, Deadlocks,
Unspecified Reception, Non-executable Interactions, State Ambiguities,
Protocol Validation Approaches: Perturbation Technique, Reachability
Analysis, Fair Reachability Graphs, Process Algebra based Validation, SDL
Based Protocol Verification: ABP Verification, Liveness Properties, SDL
Based Protocol Validation: ABP Validation.
Unit IV
52
Protocol Conformance and Performance Testing: Conformance Testing
Methodology and Framework, Local and Distributed Conformance Test
Architectures, Test Sequence Generation Methods: T, U, D and W methods,
Distributed Architecture by Local Methods, Synchronizable Test Sequence,
Conformance testing with Tree and Tabular Combined Notation (TTCN),
Conformance Testing of RIP, Testing Multimedia Systems, quality of service
test architecture(QOS), Performance Test methods, SDL Based Performance
Testing of TCP, OSPF, Interoperability testing, Scalability testing protocol
synthesis problem.
Unit V
Protocol Synthesis and Implementation: Synthesis methods, Interactive
Synthesis Algorithm, Automatic Synthesis Algorithm, Automatic Synthesis
of SDL from MSC, Protocol Re-synthesis, Requirements of Protocol
Implementation, Objects Based Approach to Protocol Implementation,
Protocol Compilers, Code generation from Estelle, LOTOS, SDL and
CVOPS.
Text Book:
1. PallapaVenkataram and Sunilkumar S. Manvi: Communication Protocol
Engineering, PHI, 2004.
Reference Book:
1. Mohammed G. Gouda: Elements of Protocol Design, Wiley Student
Edition, 2004.

1. Recall the structure of TCP/IP protocol suite. (PO1,3,4)
2. Identify different phases of protocol engineering. (PO1,3,4)
3. Design SDL based protocol specifications for various protocols.
(PO1,3,4)
4. Design and generate test sequences using different methods.
(PO1,3,4)
5. Demonstrate different ways of protocol synthesis. (PO1,3,4)
53
Network Management
Course Coordinator/s: Dr. Monica R Mundada
Course Contents:
Unit I
Data communications and Network Management Overview: Analogy of
Telephone Network Management, Communications protocols and Standards,
Case Histories of Networking and Management, Challenges of
Information Technology Managers, Network Management: Goals,
Organization, and Functions, Network and System Management, Network
Management System Platform, Current Status and future of Network
Management.
Unit II
SNMPV1 Network Management: Organization and Information Models,
Managed network: Case Histories and Examples, The History of SNMP
Management, The SNMP Model, The Organization Model, System
Overview, The Information Model. SNMPv1 Network
Management: Communication and Functional Models. The SNMP
Communication Model, Functional Model.
Unit III
SNMP Management: SNMPv2: Major Changes in SNMPv2, SNMPv2
System Architecture, SNMPv2 Structure of Management Information,
SNMPv2 Management Information Base, SNMPv2 Protocol, Compatibility
With SNMPv1. SNMP Management: SNMPv3,Introduction,SNMPv3 Key
Features,SNMPv3 Documentation Architecture, SNMPv3 Applications,
SNMPv3 Management Information Base, Security, SNMPv3 User-based
Security Model, Authentication Protocols, Encryption Protocol.
Unit IV
SNMP Management: RMON: What is Remote Monitoring? , RMON SMI
and MIB, RMON1, RMON2, ATM Remote Monitoring, a Case Study of
Internet Traffic Using RMON, ATM Networks.
Unit V
Network Management Tools and Systems: Network Management Tools,
Network Statistics Measurement Systems, History
of Enterprise Management, Network Management systems, Commercial
Network management Systems, System Management, Enterprise
Management Solutions.
54
Text Book:
1. Network Management: Principles and Practice, Mai Subramanian,

George institute of Technology, 2000, Pearson.
1. Identify five major functional areas of network management. (PO-

1,3,4)
2. Explore SNMP Management Information, Standard MIBs and
SNMP protocol. (PO- 1,3,4)
3. Defend the need for security in networking monitoring and control.
(PO-1,3,4
4. Devise Remote network monitoring System for statistics collection,
alarms and filters. (PO-1,3,4)
5. Summarize complete network management plan for a moderate to
large network enterprise through case studies. (PO-1,3,4)
55
Multi-core Architecture and Programming
Course Coordinator/s: Mr. Mallegowda M
Unit I
Introduction To Multi-Core Architecture: Motivation For Concurrency In
Software, Parallel Computing Platforms,Parallel Computing In
Microprocessors, Differentiating Multi-Core Architectures From Hyper-
Threading Technology, Multi-Threading On Single-Core Versus Multi-Core
Platforms Understanding Performance, Amdahl‟s Law, Growing Returns:
Gustafson‟s Law. System Overview Of Threading: Defining Threads,
System View Of Threads, Threading Above The Operating System, Threads
Inside The OS, Threads Inside The Hardware, What Happens When A
Thread Is Created, Application Programming Models andThreading, Virtual
Environment: Vms And Platforms, Runtime Virtualization, System
Virtualization.
Unit II
Fundamental Concepts Of Parallel Programming: Designing For
Threads, Task Decomposition, Data Decomposition,Data Flow
Decomposition, Implications Of Different Decompositions, Challenges
You‟ll Face, Parallel Programming Patterns, A Motivating Problem: Error
Diffusion, Analysis Of The Error Diffusion Algorithm, An Alternate
Approach: Parallel Error Diffusion, Other Alternatives.
Unit III
Threading And Parallel Programming Constructs: Synchronization,
Critical Sections, Deadlock, SynchronizationPrimitives, Semaphores, Locks,
Condition Variables, Messages, Flow Control- Based Concepts, Fence,
Barrier, Implementation-Dependent Threading Features. Threading Apis :
Threading Apls For Microsoft Windows, Win32/MFC Thread Apls,
Threading Apls For Microsoft. NET Framework, Creating Threads,
Managing Threads, Thread Pools, Thread Synchronization, POSIX Threads,
Creating Threads, Managing Threads, Thread Synchronization, Signaling,
Compilation And Linking.
Unit IV
Openmp: A Portable Solution For Threading: Challenges In Threading A
Loop, Loop-Carried Dependence, Data-RaceConditions, Managing Shared
And Private Data, Loop Scheduling And Portioning, Effective Use Of
Reductions, Minimizing Threading Overhead, Work-Sharing Sections,
Performance-Oriented Programming, Using Barrier And No Wait,
56
Interleaving Single-Thread And Multi-Thread Execution, Data Copy-In And
Copy-Out, Protecting Updates Of Shared Variables, Intel Task Queuing
Extension To Openmp, Openmp Library Functions, Openmp Environment
Variables, Compilation, Debugging, Performance.
Unit V
Solutions To Common Parallel Programming Problems: Too Many
Threads, Data Races, Deadlocks, And Live Locks,Deadlock, Heavily
Contended Locks, Priority Inversion, Solutions For Heavily Contended
Locks, Non-Blocking Algorithms, ABA Problem, Cache Line Ping-Ponging,
Memory Reclamation Problem, Recommendations, Thread-Safe Functions
And Libraries, Memory Issues, Bandwidth, Working In The Cache, Memory
Contention, Cache-Related Issues, False Sharing, Memory Consistency,
Current IA-32 Architecture, Itanium Architecture, High-Level Languages,
Avoiding Pipeline Stalls On IA-32,Data Organization For High Performance.
Text Books:
1. Multicore Programming , Increased Performance through Software Multi-
threading by Shameem Akhter and Jason Roberts , Intel Press , 2006
2. Hennessey and Patterson: “Computer Architecture A Quantitative
Approach”, 4thEdition, Elsevier, 2012.
Reference Book:
1. Kai Hwang, Naresh Jotwani: Advanced Computer Architecture -
Parallelism, Scalability, Programmability, 2nd Edition, Tata McGraw Hill,
2011.

At the end of the course, the students should be able to:
1. Identify performance related parameters in the field of Computer
Architecture. (PO1,3,4)
2. Identify the limitations of ILP and the need for multi-core architectures.
(PO1,3,4)
3. Solve the issues related to multiprocessing and suggest solutions.
(PO1,3,4)
4. Point out the salient features of different multi-core architectures and
how they exploit parallelism. (PO1,3,4)
5. Understand the concept of multi threading and OPENMP. (PO1,3,4)
57
Embedded Systems
Course Coordinator/s: Dr. Divakar Harekal V
Unit I
Embedded Computing: Introduction, Complex Systems And Microprocessors
Embedded Systems, Design Process, Design Metrics, Flow And
Optimization, Specifications And Modeling,Cortex-M0 Technical Overview,
Implementation Features, System Features, Debug Features, Advantages.
Unit II
Programming Model, Operation Modes And States, Architecture, Registers
And Special Registers Behaviors Of The Application Program Status
Register (APSR), Memory System Overview, Stack Memory, Operations
Introduction To Cortex-M0 Programming, Instruction Set.
Unit III
Instruction Usage Examples, Implementation Of Various Structures Like
Loop, Switch, Function, Subroutine, Memory System, Exceptions And
Interrupts, Interrupt Control And System Control.
Unit IV
Simple Application Programming, Simple Input /Output, Simple Interrupt
Programming, Sensors, Thermistors, Ldrs, Leds 7 Segment, LCD, Stepper
Motor, Relays, Actuator, and Adcs.
Unit V
Embedded/ Real Time Tasks, Real Time Systems, Types Of Real Time
Systems Quality Of Good Real Time Systems. Real Time Operating System
Concepts: Architecture Of The Kernel, Task And Task Scheduler,ISR,
Sémaphores, Mutex, Mailboxes, Message Queues, Message Queues Pipes,
Signal, Memory Management,PriorityInversion problems.
Text Books:
1. Wayne Wolf “Computers as Components Principles of Embedded
Computer System Design”, Second Edition, Elsevier, 2008.
2. Joseph Yiu, “ The Definitive Guide to the ARM Cortex-M0 “, 1st
edition, Newnes - an imprint of Elsevier, 2011
3. Lyla B. Das, “Embedded Systems an integrated approach “ , 1st edition,
Pearson, 2013.
4. KVVK Prasad, “Embedded/Real Time Systems: Concepts, Design and
Programming “ , 1st edition, Dreamtech, 2011 .
58
Reference Books:
1. Frank Wahid/Tony Givargis “Embedded System Design A Unified
Hardware/Software Introduction “ 1st Edition, John Wiley & Sons, 2002.
2. Raj Kamal , “Embedded Systems: Architecture ,Programming and
Design”, Tata McGrawhill, New Delhi,2003.
3. Tammy Noergaard, “Embedded Systems Architecture- Comprehensive
Guide for Engineer and Programmers – Elsevier Publication, 2005
4. Barnett, Cox &O‟cull,”Embedded C programming”,Thomson ,2005.

1. Identify embedded system requirements and goals.(PO1,3,4)
2. Describe Cortex M0 advantages for designing embedded systems.
(PO1,3,4)
3. Evaluate Cortex M0 in assembly instructions and write embedded C
programs using CMSIS features. (PO1,3,4)
4. Understand the memory mapping of Cortex M0 architecture. (PO1,3,4)
5. Compare the working of various sensors and actuators and their interface
with microcontrollers. (PO1,3,4)
59
Compiler Optimization Techniques
Course Coordinator/s: Dr. Jagadish S Kallimani
UnitI
Introduction, Lexical analysis, Compilers; Analysis of Source Program; The
Phases of a Compiler; Cousins of the Compiler; The grouping of phases;
Compiler- Construction tools. Lexical analysis: The Role of Lexical
Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens.
UnitII
Syntax Analysis, The Role of the Parser; Context-free Grammars; Writing a
Grammar; Top-down Parsing; Bottom-up Parsing. Syntax Analysis,
Operator-Precedence Parsing; LR Parsers; Using ambiguous grammars;
Parser Generators.
UnitIII
Syntax-Directed Translation, Syntax-Directed definitions; Constructions of
Syntax Trees; Bottom-up evaluation of S-attributed definitions; L-attributed
definitions; Top-down translation, Run-Time Environments, Source
Language Issues; Storage Organization; Storage-allocation strategies,
Storage-allocation in C; Parameter passing.
UnitIV
Intermediate Code Generation, Intermediate Languages; Declarations;
Assignment statements; Boolean Expressions; Case statements; Back
patching; Procedure calls, Code Generation, Issues in the design of Code
Generator; The Target Machine; Run-time Storage Management; Basic
blocks and Flow graphs; Next-use information; A Simple Code Generator;
Register allocation and assignment; The dag representation of basic blocks;
Generating code from dags.
UnitV
Code Optimization, Compiler Development, Code Optimization:
Introduction; The principal sources of optimization; Peephole optimization;
Optimization of basic blocks; Loops in flow graphs, Compiler Development:
Planning a compiler; Approaches to compiler development; The compiler
development environment; Testing and maintenance.
Reference Books:
1. Alfred V Aho, Ravi Sethi, Jeffrey D Ullman: Compilers- Principles,
Techniques and Tools, Addison-Wesley, 2007.
(Chapters 1, 3.1 to 3.4, 4, 5.1 to 5.5, 7, 8, 9.1 to 9.9, 10.1 to 10.5, 11)
60
2. Charles N. Fischer, Richard J. leBlanc, Jr.: Crafting a Compiler with C,
Pearson Education, 1991.
3. Andrew W Apple: Modern Compiler Implementation in C, Cambridge
University Press, 1997.
4. Kenneth C Louden: Compiler Construction Principles & Practice,
Thomson Education, 1997.

1. Construct lexical analyzer to recognize inputs using patterns. (PO1,3, 4)
2. Devise different types of syntax analyzers using grammars. (PO1,3, 4)
3. Illustrate syntax-directed translation schemes for grammars. (PO 1, 3, 4)
4. Formulate intermediate code generators for programming statements.
(PO1, 3, 4)
5. Develop assembly language code for the given optimized intermediate
codes. (PO1, 3, 4)
61
Advanced Software Engineering
Prerequisites: Basic Concepts of Software Engineering
Contact Hours: 56
Unit I
Agile development: What is agile? Agility and cost of change; What is an
agile process? Extreme programming; Other agile process models. Design
Concepts: Design process, Design Concepts, Design Models. Web
Application Design: Web application design quality; Design quality and
design pyramid; Interface design; Aesthetic design; Content design;
Architecture design; Navigation design; Component-level design; Object-
oriented hypermedia design method.
Unit II
Formal Modeling and verification: The cleanroom strategy; Functional
specification; Cleanroom design; Cleanroom testing; Formal methods:
Concepts; Applying mathematical notation for formal specification; Formal
specification languages. Software Project Management: The management
spectrum; The management of people, product, process and project; The
W5HH Principle; Critical practices. Estimation for Software Projects:
Software project estimation; Decomposition techniques, Examples; Empirical
estimation models; Estimation for Object-Oriented projects; specialized
estimation techniques; the make / buy decision.
Unit III
Software Project Scheduling: Basic concepts and principles of project
scheduling; Defining task set and task network; Scheduling; Earned value
analysis. Risk Management: Reactive versus proactive strategies; Software
risks; risk identification; Risk projection; Risk refinement; Risk mitigation,
monitoring and management; The RMMM plan.
Unit IV
Maintenance and Reengineering: Software maintenance; Software
supportability; Reengineering; Business process reengineering; Software
reengineering; Reverse engineering; Restructuring; Forward engineering;
The economics of reengineering. Software Process Improvement (SPI):
Approaches to SPI; Maturity models; The SPI process; The CMMI; The
People CMM; Other SPI frameworks: SPICE, Bootstrap, PSP and TSP, ISO;
SPI return on investment.
Unit V
62
Software Configuration Management (SCM): Basic concepts; SCM
repository; The SCM process; Configuration management for web
applications; SCM standards. Product Metrics: A framework for product
metrics; Metrics for requirements model, design model, source code, testing
and maintenance; Design metrics for web applications. Process and Project
Metrics: Basic concepts; Software measurement; Metrics for software
quality; Integrating metrics within the software process; Metrics for small
organizations; Establishing a software metrics program.
Laboratory:
The Software Engineering Lab has been designed for students to be exposed
to the following:
 To Understand and realize the concept of Software Engineering and
UML using any case studies.
 The students would be exposed to experiment with the following
concepts using any of the tools available:
 Identifying the Requirements from Problem
Statements
 Modeling UML Use Case Diagrams
 Identifying Domain Classes from the Problem
Statements
 State chart and Activity Modeling
 Modeling UML Class Diagrams and Sequence
diagrams
 Estimation of Test Coverage Metrics and Structural
Complexity
 Designing Test Suites for the case study
 The Students would also be required to Prepare a Work Breakdown
Structure (WBS) and a mini project plan with PERT and Gantt
charts
Text Book:
1. Roger S. Pressman: Software Engineering: A Practitioner‟s Approach,
Alternate edition, 7th Edition, McGraw Hill, 2010.
Reference Books:
1. Ian Sommerville: Software Engineering, 8th Edition, Pearson, 2012.
63
2. Bernd Bruegge & Allen H. Dutoit : Object-Oriented Software
Engineering Using UML, Patterns, and Java™ Third Edition, Prentice
Hall ,2012

1. Apply the concept of agile development and design any web application
using the principles learnt. (PO 1,3,4)
2. Identify the concepts of Formal Modeling and verification methods and
also the process of Project management and estimation. (PO 1,3,4)
3. Demonstrate the activities involved in Software Scheduling, Risk
management and reverse engineering and Maintenance task. (PO 1,3,4)
4. Identify the approaches to Software Process Improvement. (PO 1,3,4)
5. Understand the concepts of Software Configuration Management,
Product and Process metrics. (PO 1,3,4)
64
Software Oriented Architecture
Course Coordinator/s: Dr. Divakar Harekal V
UnitI
SOA Basics :Software Architecture – Types of IT Architecture – SOA –
Evolution – Key components – perspective of SOA – Enterprise-wide SOA –
Architecture – Enterprise Applications – Solution Architecture for enterprise
application – Software platforms for enterprise Applications – Patterns for
SOA – SOA programming models.
UnitII
SOA Analysis and Design: Service-oriented Analysis and Design – Design of
Activity, Data, Client and business process services – Technologies of SOA –
SOAP – WSDL – JAX – WS – XML WS for .NET – Service integration
with ESB – Scenario – Business case for SOA – stakeholder OBJECTIVES –
benefits of SPA – Cost Savings.
UnitIII
SOA Governance:SOA implementation and Governance – strategy – SOA
development – SOA governance – trends in SOA – event-driven architecture
– software s a service – SOA technologies – proof-ofconcept – process
orchestration – SOA best practices.
UnitIV
SOA Implementation:SOA based integration – integrating existing
application – development of web services – Integration - SOA using REST
– RESTful services – RESTful services with and without JWS – Role of
WSDL,SOAP and Java/XML mapping in SOA – JAXB Data binding.
UnitV
Application Integration:JAX –WS 2.0 client side/server side development –
Packaging and Deployment of SOA component – SOA shopper case study –
WSDL centric java WS with SOA-J – related software – integration through
service composition (BPEL) – case study - current trends.
Reference Books:
1. Shankar Kambhampaly, “Service–Oriented Architecture for Enterprise
Applications”,Wiley 2008.
2. Mark D. Hansen, “SOA using Java Web Services”, Practice Hall, 2007.
3. Waseem Roshen, “SOA-Based Enterprise Integration”, Tata McGraw-
HILL, 2009.
65
1. Design, develop and test Web services.(PO 1,3,4)
2. Learn standards related to Web services: Web Services Description
Language (WSDL), Simple Object Access Protocol (SOAP), and
Universal Description, Discovery and Integration (UDDI).(PO 1,3,4)
3. Learn basic principles of Service-Oriented Architecture and apply these
concepts to develop a sample application. (PO 1,3,4)
4. Conceptually model Web services and formulate specifications of them in
the Resource Description Framework (RDF) and the Web Ontology
Language (OWL).(PO 1,3,4)
5. Evaluate emerging and proposed standards for the main components of
Web services architectures.(PO 1,3,4)
66
Information Retrieval
Course Coordinator/s: Ms. Vandana Sardar Sudhakar
Unit I
Introduction: Motivation, Basic concepts, Past, present, and future, the
retrieval process. Modeling: Introduction, A taxonomy of information
retrieval models, Retrieval: Adhoc and filtering, A formal characterization of
IR models, Classic information retrieval, Alternative set theoretic models,
Alternative algebraic models, Alternative probabilistic models, Structured
text retrieval models, Models for browsing.
Unit II
Retrieval Evaluation: Introduction, Retrieval performance evaluation,
Reference collections. Query Languages: Introduction, keyword-based
querying, Pattern matching, Structural queries, Query protocols.
Unit III
Query Operations: Introduction, User relevance feedback, Automatic local
analysis, Automatic global analysis. Text and Multimedia Languages and
Properties: Introduction, Metadata, Text, Markup languages, Multimedia.
Unit IV
Text Operations: Introduction, Document preprocessing, Document
clustering, Text compression, comparing text compression techniques.
Indexing and Searching: Introduction; Inverted Files; Other indices for text;
Boolean queries; Sequential searching; Pattern matching; Structural queries;
Compression. Parallel and Distributed IR: Introduction, Parallel IR,
Distributed IR.
Unit V
User Interfaces and Visualization: Introduction, Human-Computer
interaction, the information access process, Starting pints, Query
specification, Context, Using relevance judgments, Interface support for the
search process. Searching the Web: Introduction, Challenges,
Characterizing the web, Search engines, Browsing, Meta searchers, finding
the needle in the haystack, searching using hyperlinks.
Text Book:
1. Ricardo Baeza-Yates, Berthier Ribeiro-Neto: Modern Information
Retrieval, 1st edition, Pearson, 2011.
Reference Books:
67
1. David A. Grossman, Ophir Frieder: Information Retrieval Algorithms and
Heuristics, 2nd Edition, Springer, 2009.
2. William B. Frakes, Ricardo Baeza-Yates (Editors): Information Retrieval
Data Structures and Algorithms, 1st edition, Prentice Hall PTR, 2009.

1. Distinguish between data and information retrieval systems and explain
different classical IR models. (PO 1,3,4)
2. Assess the performance of information retrieval systems and use different
querying languages and protocols.(PO 1,3,4)
3. Perform query operations and recognize the use of metadata and markup
languages.(PO 1,3,4)
4. Explain various text operations, indexing and search techniques, and the
basics of parallel and distributed IR. (PO 1,3,4)
5. Discuss the concepts of user interfaces for IR applications and web search
techniques.(PO 1,3,4)
68
Web Technologies
Course Coordinator/s: Mrs. J Geetha
Unit I
Introduction: From Browsers to Rich Clients – browser drawbacks, A
solution – rich clients, Rich clients today. Web 1.0: HTML, URLs and
HTTP, The WEB Model and REST – resources, representations, state,
transfer – using HTTP methods. XML, XPATH and XSLT – XML Support
in browsers, XPath support in browsers, XSLT support in Browsers.
Unit II
HTML 5: Detecting HTML 5 features – Canvas, video, local storage, web
workers, offline applications, geo-location, placeholders, and input types.
What does it all mean – doc type, root, headers, articles, dates and times,
navigation and footers. Let‟s call it a drawing surface – Simple shapes,
canvas, Paths, texts, gradients and images. The past, present and future of
local storage for web applications, A Form of madness – place holders,
autofocus fields, email, web addresses, numbers as spin boxes and sliders,
date and color pickers, search boxes.
Unit III
AJAX-I: Basic communication techniques – XHR, AJAX with images,
Dynamic script loading, Cache control. AJAX patterns: Communication
control patterns – predictive fetch, page preloading, submission throttling,
periodic refresh, multi-stage download. Fallback patterns. AJAX libraries –
JQuery.
Unit IV
AJAX-II: Syndication with RSS and Atom – RSS, Atom, XParser, Creating a
news ticker, Web search with RSS. JSON – Array, object, mixing literals,
syntax, encoding/decoding, JSON versus XML, server-side JSON tools.
COMET: HTTP streaming – request delays, file modification example, using
Iframes, browserspecific approaches, server-sent DOM events, connection
management and server-side support.
Unit V
Mashups and Web services: The rise of mashups, geocoding, Google maps
API. Introduction to Service Oriented Architecture, Combining protocols to
build Web services – clarifying web services, REST Services, WS-* Web
services using SOAP and WSDL, REST vs WS-* services.
69
Reference Books:
1. Professional AJAX, Nicholas C Zakas et al, 2nd Edition, Wrox
publications,2007.
2. Professional Web 2.0 Programming, Eric Van Der VList et al, Wrox
Publications, 2007
3. HTML 5 Up and Running, Mark Pilgrim, O‟REILLY| GOOGLE Press,
2010.
4. SOA: Concepts, Technology and Design, Thomas Erl, Pearson, 2005

1. Develop a dynamic webpage by the use of java script and DHTML. (PO
1,3,4)
2. Write a well formed / valid XML document.(PO 1,3,4)
3. Connect a java program to a DBMS and perform insert, update and delete
operations on DBMS table.(PO 1,3,4)
4. Write a server side java application called Servlet to catch form data sent
from client, process it and store it on database.(PO 1,3,4)
5. Write a server side java application called JSP to catch form data sent
from client and store it on database.(PO 1,3,4)
70
Advances in Digital Image Processing
Course Code:MCSE16 Credits: 4:0:0
Course Coordinator/s:Mrs. Veena G S
Unit I
Digital Image Fundamentals: What is Digital Image Processing? fundamental
Steps in Digital Image Processing, Components of an Image processing
system, elements of Visual Perception, Image Sensing and Acquisition,
Image Sampling and Quantization, Some Basic Relationships between
Pixels, Linear and Nonlinear Operations.
Unit II
Image Transforms: Two-dimensional orthogonal & unitary transforms,
properties of unitary transforms, two dimensional discrete Fourier transform.
Discrete cosine transform, sine transform, Hadamard transform, Haar
transform, Slant transform, KL transform.
Unit III
Image Enhancement: Image Enhancement in Spatial domain, Some Basic
Gray Level Trans -formations, Histogram Processing, Enhancement Using
Arithmetic/Logic Operations.
Unit IV
Basics of Spatial Filtering Image enhancement in the Frequency Domain
filters, Smoothing Frequency Domain filters, Sharpening Frequency Domain
filters, homomorphic filtering.
Unit V
Model of image degradation/restoration process, noise models, Restoration in
the Presence of Noise, Only-Spatial Filtering Periodic Noise Reduction by
Frequency Domain Filtering, Linear Position-Invariant Degradations, inverse
filtering, minimum mean square error (Weiner) Filtering, Color
Fundamentals. Color Models, Pseudo color Image Processing., processing
basics of full color image processing.
Reference Books:
1. “Digital Image Processing”, Rafael CGonzalez, Richard E. Woods,
etl , TMH , 2nd Edition 2010.
2. “Fundamentals of Digital Image Processing”, Anil K. Jain, Pearson
Education, 2001.
3. “Digital Image Processing and Analysis”, B. Chanda and D. Dutta
Majumdar, PHI, 2003.
71
1. Examine various types of images, intensity transformations and applying
various filtering techniques. (PO1,3,4)
2. Show how higher-level image concepts such as edge detection,
segmentation representation can be implemented and used. (PO1,3,4)
3. To manipulate both binary and grayscale digital images using
morphological filters and operators to achieve a desired result. (PO1,3,4)
4. Apply image processing algorithms in practical applications. (PO1,3,4)
72
Advances in Operating Systems
Prerequisites: Operating Systems Contact Hours: 56
Course Coordinator/s: Dr. T N R Kumar
Unit I
Process Synchronization: Synchronizations Mechanisms – Concurrent
Processes, Critical Section Problem, Synchronization Problems. Distributed
Operating Systems: Architectures of Distributed Systems, Theoretical
Foundations
Unit II
Distributed Mutual Exclusion - Classification of Mutual Exclusion and
Associated Algorithms - A Comparative Performance Analysis, Distributed
Deadlock Detection - Deadlock Handling Strategies, Issues - Control
Organizations – Centralized, Distributed and Hierarchical Deadlock
Detection Algorithms
Unit III
Agreement Protocols - System Model, Classification of Agreement
Problems, Applications Of Agreement Algorithms. Distributed Resource
Management: Distributed File Systems- Architecture - Mechanisms for
Building Distributed File Systems - Design Issues - Log Structured File
Systems, Distributed Shared Memory-Architecture- Algorithms For
Implementing DSM - Memory Coherence And Protocols - Design Issues.
Unit IV
Distributed Scheduling - Issues In Load Distributing, Components Of Load
Distributing Algorithm - Stability , Algorithms - Performance Comparison,
Selecting A Suitable Load Sharing Algorithm, Requirements For Load
Distributing -Task Migration and Issues. Failure Recovery: Classification ,
Backward And Forward Error Recovery, Recovery In Concurrent Systems -
Consistent Set Of Check Points - Synchronous And Asynchronous Check
Pointing And Recovery , Check Pointing For Distributed Database Systems-
Recovery In Replicated Distributed Databases.
Unit V
Protection And Security- Resource Security And Protection- The Access
Matrix Model And Its Implementations, Safety In Matrix Model- Advanced
Models Of Protection, Multiprocessor Operating Systems: System
Architectures, Inter Connection Networks, Caching , Hypercube
Architecture. Multiprocessor Operating System - Structures , Design Issues,
Threads , Process Synchronization and Issues, Processor Scheduling: Issues,
Co-Scheduling, Smart Scheduling.
73
Laboratory Work:
(The following programs can be executed on any available and suitable
platform)
1. Design, develop and execute a program using any thread library to
create the number of threads specified by the user; each thread
independently generates a random integer as an upper limit, and
then computes and prints the number of primes less than or equal to
that upper limit along with that upper limit.
2. Rewrite above program such that the processes instead of threads
are created and the number of child processes created is fixed as
two. The program should make use of kernel timer to measure and
print the real time, processor time, user space time and kernel space
time for each process.
3. Design, develop and implement a process with a producer thread
and a consumer thread which make use of a bounded buffer (size
can be prefixed at a suitable value) for communication. Use any
suitable synchronization construct.
4. Design, develop, and execute a program to solve a system of n linear
equations using Successive Over-relaxation method and n processes
which use Shared Memory API.
5. Design, develop, and execute a program to demonstrate the use of
RPC.
Reference Books:
1. Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in
operating systems: Distributed, Database and multiprocessor operating
systems", TMH, 2009.
2. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003
3. Pradeep K.Sinha, "Distributed operating system-Concepts and design",
PHI, 2003.
4. Andrew S.Tanenbaum, "Distributed operating system", Pearson
education, 2003.

1. Implement a concurrent programming application using semaphores &
monitors for process control. (PO 1,3,4)
2. Explain the basic concepts of Distributed Operating Systems and its
architecture. (PO 1,3,4)
74
3. Implement deadlock avoidance, prevention & recovery. (PO 1,3,4)
4. Identify the Distributed resource management and design issues. (PO
1,3,4)
5. Implement various CPU scheduling, IPC memory management, recovery
and concurrent algorithms. (PO 1,3,4)
75
Cryptography and Security
Prerequisites: Contact Hours: 56
Course Coordinator/s: Sowmya B J
Unit I
Introduction to security attacks - services and mechanism - introduction to
cryptography - Conventional Encryption: Conventional encryption model
classical encryption techniques - substitution ciphers and transposition
ciphers – cryptanalysis – steganography - stream and block ciphers - Modern
Block Ciphers: Block ciphers principals - Shannon‟s theory of confusion and
diffusion - fiestal structure - data encryption standard(DES) - strength of DES
differential and linearcrypt analysis of DES - block cipher modes of
operations - triple DES – AES.
Unit II
Confidentiality using conventional encryption - traffic confidentiality - key
distribution - random number generation - Introduction to graph - ring and
field - prime and relative prime numbers - modular arithmetic - Fermat‟s and
Euler‟s theorem - primality testing - Euclid‟s Algorithm - Chinese Remainder
theorem - discrete algorithms.
Unit III
Principles of public key crypto systems - RSA algorithm - security of RSA
key management – Diffle-Hellman key exchange algorithm - introductory
idea of Elliptic curve cryptography – Elgamel encryption - Message
Authentication and Hash Function: Authentication requirements
authentication functions - message authentication code - hash functions
birthday attacks – security of hash functions and MACS.
Unit IV
MD5 message digest algorithm - Secure hash algorithm (SHA) Digital
Signatures: Digital Signatures - authentication protocols - digital signature
standards (DSS) - proof of digital signature algorithm - Authentication
Applications: Kerberos and X.509 - directory authentication service
electronic mail security-pretty good privacy (PGP) - S/MIME.
76
Unit V
IP Security: Architecture - Authentication header - Encapsulating security
payloads - combining security associations - key management.
Text Books:
1. William Stallings, “Cryptography and Network security Principles

and Practices”, Pearson/PHI.
2. Wade Trappe, Lawrence C Washington, “ Introduction to
Cryptography with coding theory”, Pearson.
Reference Books:
1. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson

Education.
2. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in
computing – Prentice Hall of India.

1. Provide security of the data over the network. (PO 1,3,4)
2. Do research in the emerging areas of cryptography and network
security. (PO 1,3,4)
3. Implement various networking protocols. (PO 1,3,4)
4. Protect any network from the threats in the world. (PO 1,3,4)
5. Understand the IP security issues (PO 1,3,4)
77
Information and Network Security
Course Coordinator/s: Mrs. Meeradevi A Kawalgi
UnitI
Classical Encryption Techniques: Symmetric Cipher Model, Cryptography,
Cryptanalysis and Brute-Force Attack, Substitution Techniques, Caesar
Cipher, Mono alphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic
Cipher, One Time Pad. Block Ciphers and the data encryption standard:
Traditional block Cipher structure, stream Ciphers and block Ciphers,
Motivation for the feistel Cipher structure, the feistel Cipher, The data
encryption standard, DES encryption , DES decryption , A DES example,
results, the avalanche effect, the strength of DES, the use of 56-Bit Keys, the
nature of the DES algorithm, timing attacks, Block cipher design principles,
number of rounds, design of function F, key schedule algorithm.
UnitII
Public-Key Cryptography and RSA: Principles of public-key cryptosystems.
Public-key cryptosystems. Applications for public-key cryptosystems,
requirements for public-key cryptosystems. public-key cryptanalysis. The
RSA algorithm, description of the algorithm, computational aspects, the
security of RSA: Other Public-Key Cryptosystems: Diffiehellman key
exchange, The algorithm, key exchange protocols, man in the middle attack,
Elgamal Cryptographic systems, Elliptic curve arithmetic, abelian groups,
elliptic curves over real numbers, elliptic curves over Zp, elliptic curves over
GF(2m), Elliptic curve cryptography, Analog of Diffie-hellman key
exchange, Elliptic curve encryption/ decryption, security of Elliptic curve
cryptography, Pseudorandom number generation based on an asymmetric
cipher, PRNG based on RSA.
UnitIII
Key Management and Distribution: Symmetric key distribution using
Symmetric encryption, A key distribution scenario, Hierarchical key control,
session key lifetime, a transparent key control scheme, Decentralized key
control, controlling key usage, Symmetric key distribution using asymmetric
encryption, simple secret key distribution, secret key distribution with
confidentiality and authentication, A hybrid scheme, distribution of public
keys, public announcement of public keys, publicly available directory,
public key authority, public keys certificates, X-509 certificates. Certificates,
X- 509 version 3, public key infrastructure .User Authentication: Remote
user Authentication principles, Mutual Authentication, one way
78
Authentication, remote user Authentication using Symmetric encryption,
Mutual Authentication, one way Authentication, Kerberos, Motivation ,
Kerberos version 4, Kerberos version 5, Remote user Authentication using
Asymmetric encryption, Mutual Authentication, one way Authentication,
federated identity management, identity management, identity federation,
personal identity verification.
UnitIV
Wireless network security: Wireless security, Wireless network threats,
Wireless network measures, mobile device security, security threats, mobile
device security strategy, IEEE 802.11 Wireless LAN overview, the Wi-Fi
alliance, IEEE 802 protocol architecture. Security, IEEE 802.11i services,
IEEE 802.11i phases of operation, discovery phase, Authentication phase,
key management phase, protected data transfer phase, the IEEE 802.11i
pseudorandom function, Web Security Considerations: Web Security
Threats, Web Traffic Security Approaches. Secure Sockets Layer: SSL
Architecture, SSL Record Protocol, Change Cipher Spec Protocol, Alert
Protocol, handshake Protocol, Cryptographic Computations. Transport Layer
Security: Version Number, Message Authentication Code, Pseudorandom
Functions, Alert Codes, Cipher Suites, Client Certificate Types, Certificate
Verify And Finished Messages, Cryptographic Computations, Padding.
HTTPS Connection Initiation, Connection Closure. Secure Shell (SSH):
Transport Layer Protocol, User Authentication Protocol, and Connection
Protocol.
UnitV
Electronic Mail Security: Pretty good privacy, notation, operational;
description, S/MIME, RFC5322, Multipurpose internet mail extensions,
S/MIME functionality, S/MIME messages, S/MIME certificate processing,
enhanced security services, Domain keys identified mail, internet mail
architecture, E-Mail threats, DKIM strategy, DKIM functional flow, .IP
Security: IP Security overview, applications of IPsec, benefits of IPsec,
Routing applications, IPsec documents, IPsec services, transport and tunnel
modes, IP Security policy, Security associations, Security associations
database, Security policy database, IP traffic processing, Encapsulating
Security payload, ESP format, encryption and authentication algorithms,
Padding, Anti replay service, transport and tunnel modes, combining security
associations, authentication plus confidentiality, basic combinations of
security associations, internet key exchange, key determinations protocol,
header and payload formats, cryptographic suits.
79
Reference books:
1. William Stallings: Cryptography and Network Security, Pearson 6th
edition, 2013.
2. V K Pachghare: Cryptography and Information Security, 2013.

1. Master information security governance, and related legal and regulatory
issues and also master understanding external and internal threats to an
organization. (PO 1,3,4)
2. Get familiarity with information security awareness and a clear
understanding of its importance and how threats to an organization are
discovered, analyzed, and dealt with. (PO 1,3,4)
3. Master fundamentals of secret and public cryptography and master
protocols for security services. (PO 1,3,4)
4. Get familiar with network security threats and countermeasures and
familiar with network security designs using available secure solutions
(such as PGP, SSL, IPSec, etc). (PO 1,3,4)
5. Get familiar with advanced security issues and technologies (such as
DDoS attack detection and containment, and anonymous
communications,) and exposed to original research in network security
and also exposed to the importance of integrating people, processes and
technology. (PO 1,3,4)
80
Digital Forensic and Cyber Crime
Course Coordinator/s: Dr Ramani S
Unit 1
Understanding Cyber Crime: Indian IT Act 2008 and amendments,
Computer Forensic and Investigations as a Profession, Understanding
Computer Forensics.Understanding Computer Investigations: Preparing a
Computer Investigation, Taking a Systematic Approach, Procedures for
Corporate High-Tech Investigations, Understanding Data Recovery
Workstations and Software.
Unit II
Working with Windows and DOS Systems: Understanding File Systems,
Exploring Microsoft File Structures, Examining NTFS Disks, Understanding
Whole Disk Encryption, Understanding the Windows Registry,
Understanding Microsoft Startup Tasks, Understanding MS-DOS Startup
Tasks, and Understanding Virtual Machines.
Unit III
Data Acquisition: Understanding Storage Formats for Digital Evidence,
Determining the best Acquisition Method, Contingency Planning for Image
Acquisitions, Using Acquisition Tools, Validating Data Acquisitions, Using
Remote Network Acquisition Tools.Computer Forensics Analysis and
Validation: Determining What Data to Collect and Analyze, Validating
Forensic Data, Addressing Data-Hiding Techniques, Performing Remote
Acquisitions.
Unit IV
Current Computer Forensics Tools: Evaluating Computer Forensic Tool
Needs, Computer Forensics Software Tools, Computer Forensics Hardware
Tools, Validating and Testing Forensics Software. Recovering Graphics
Files: Recognizing a Graphics File, Understanding Data Compression,
Locating and Recovering Graphics Files, Identifying Unknown File Formats,
Understanding Copyright Issues with Graphics.
Unit V
Network Forensics: Network Forensic Overview, Performing Live
Acquisitions, Developing Standard Procedures for Network Forensics, Using
Network Tools. E-mail Investigations: Exploring the Role of E-mail in
Investigations, Exploring the Roles of the Client and Server in E-mail,
Investigating E-mail Crimes and Violations, Understanding E-mail Servers,
81
Using Specialized E-mail Forensics Tools. Laboratory Lab exercises using
forensic software and Case study data.
Text Book:
1. Nelson, Phillips, Frank, Enfinger and Steuart: Computer Forensics and
Investigations, Cengage Learning, 2008. Chapters: 1, 2, 4, 6, 7, 8, 9, 10,
11, 12
Reference Books:
1. Marjie T. Britz: Computer Forensics and Cyber Crime - An Introduction,
2nd Edition, Pearson Education, 2012.
2. Harish Chander: Cyber Laws and IT Protection, PHI, 2012.
3. http://www.cyberforensics.in/default.aspx
Lab Exercises
The following exercises have to be performed using various open source
software tools/utilities mentioned.
Software Tools:
 CyberCheck 4.0 - Academic Version
 CyberCheckSuite
 MobileCheck
 Network Session Analyser
 Win-LiFT
 TrueImager
 TrueTraveller
 PhotoExaminer Ver 1.1
 CDRAnalyzer
Forensics Exercises:
I) Disk Forensics:
1. Identify digital evidences
2. Acquire the evidence
3. Authenticate the evidence
4. Preserve the evidence
5. Analyze the evidence
6. Report the findings
II) Network Forensics:
1. Intrusion detection
82
2. Logging (the best way to track down a hacker is to keep vast records
of activity on a network with the help of an intrusion detection
system)
3. Correlating intrusion detection and logging

1. Recall the Indian IT Act 2008 and its amendments. (PO1,3,4)
2. Classify various types of computer crime. (PO1,3,4)
3. Apply computer forensic techniques to identify the digital fingerprints
associated with criminal activities. (PO1,3,4)
4. Analyze hidden information from pictures and other files. (PO1,3,4)
5. Apply network forensic tools for network forensic and live data forensic
analysis. (PO1,3,4)
83
Applied Cryptography
Course Coordinator/s: Dr. Mohana Kumar S
Unit I
OSI security architecture: Classical encryption techniques, Cipher principles,
Data encryption standard, Block cipher design principles and modes of
operation, Evaluation criteria for AES, AES cipher, Triple DES, Placement
of encryption function, Traffic confidentiality
Unit II
Key management: Diffie Hellman key exchange, Elliptic curve architecture
and cryptography, Introduction to number theory, Confidentiality using
symmetric encryption, Public key cryptography and RSA.
Unit III
Authentication requirements: Authentication functions, Message
authentication codes, Hash functions, Security of hash functions and MACS,
MD5 Message Digest algorithm, Secure hash algorithm, Ripened, HMAC
digital signatures, Authentication protocols
Unit IV
Quantum Cryptography and Quantum Teleportation: Heisenberg uncertainty
principle, polarization states of photons, quantum cryptography using
polarized photons, local vs. non local interactions, entanglements, EPR
paradox, Bell‟s theorem, Bell basis, teleportation of a single qu-bit theory
and experiments.
Unit V
Future trends: Review of recent experimental achievements, study on
technological feasibility of a quantum computer candidate physical systems
and limitations imposed by noise.
84
Text Books:
1. William Stallings, “Cryptography and Network Security -Principles
and Practices”, 3rd Edition, Prentice Hall of India, 2003.
2. Atul Kahate, “Cryptography and Network Security”, Tata McGraw -
Hill, 2003.
3. William Stallings, “Network Security Essentials: Applications and
Standards”, Pearson Education Asia, 2000.
Reference Books:
1. R. P. Feynman, “Feynman Contacts on computation”, Penguin
Books, 1996.
2. Gennady P. Berman, Gary D. Doolen, Ronnie Mainiri & Valdmis
Itri Frinovich, “Introduction to quantum computers”, World
Scientific, Singapore, 1998.
3. Jonathan Katz, Yehuda Lindell, “Introduction to Modern
Cryptography” Principles And Protocols”,CRC Press.

1. Explain the concepts of principles and practice of cryptography and
network security. . (PO1,3,4)
2. Present an overview of the Feistel cipher, Distribution of Public
Keys, digital signatures and Authentication protocols. . (PO1,3,4)
3. Analyze the security of multiple encryption schemes and Triples
DES. . (PO1,3,4)
4. Build secure authentication systems by use of message
authentication techniques. . (PO1,3,4)
5. Explain the concepts of principles and practice of visual
cryptography. . (PO1,3,4)
85
Internet of Things (IoT)
Prerequisites: Nil Contact Hours:56
Course Coordinator/s: HanumanthaRaju R
Course Contents:
Unit I
Introduction to IoT:What is IoT? , IOT terms and Basic Definitions,
Disambiguation of IoT vs IoE vs M2M vs Others, Characteristics of IoT.
Wireless Sensor Networks: Potential Applications, WSN System
Architecture, WSN Network Topologies, Components of a WSN Node.
Architecture of IoT systems: Things in IoT, Applications of IoT and IoT
Reference model, IoT Ecosystem, Enabling Technologies in IoT,
Marketplace and Vision of IoT.
Unit II
Hardware aspects of IoT: Sensors and Actuators:
Introduction to Sensors:Workflow of a Sensor in a typical system,
Classification of Sensors,Sampling DAC and ADC conversion.
Introduction to Actuators: Workflow of an Actuator in a typical system,
Classification of Actuators,Types of Sensors, Interfacing concepts to
embedded systems.
Unit III
Communications and networking aspects of IoT:
High bandwidth networking: Ethernet, gigabit Ethernet, Ethernet
topologies like bridge and switches, Passive optical fiber network and
topologies, WiFi and WiMax. WiFi routers, radius servers, Wireless security
with WPA-2, LEAP, enterprise WPA networks
Low Bandwidth Wireless Networks: FSK, LoRa modulation basics,
LoRaWAN basics.
Peripherals networking: Basics of I2C, SPI, RS232, RS485 and CAN bus,
Comparisons and use cases of I2C, SPI, RS232, RS485and CAN bus.
Introduction to BLE 5 and industrial Wireless sensor networks, Security in
low bandwidth wireless networks, Security in peripheral networks.
Unit IV
Software and middleware aspects of IoT:-
86
Middleware: Components of Middleware, Types of Databases, Micro
services and API‟s.
IP Communication protocols: HTTP, AMQP, MQTT and STOMP.
Protocol definitions, use cases and differences.
Unit V
IoT Platform Design Methodology and Domain Specific IoT.
Futuristic view of IoT, problems pertaining to implementation like scaling,
feasibility and management.
Text Books:
1. Srinivasa K G, Siddesh G.M and HanumanthaRaju R “Internet of

Things”, CENGAGE Leaning India, 2017. (ISBN:978-93-868-5895-
5).
References:
1. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-

on-Approach)”, 1stEdition, VPT, 2014. (ISBN: 978-8173719547).
2. Designing the Internet of Things by Adrian McEwenSmart Cities,
Software above the level of a single device,Ebooks on IoT by
O‟Reilly
3. Sentilo middleware
http://www.sentilo.io/xwiki/bin/view/Sentilo.About.Product/Whatis
4. Mosquitto broker https://mosquitto.org/
5. Getting started with raspberry pi
https://www.raspberrypi.org/resources/learn/
6. Arduino basics https://www.arduino.cc/en/Tutorial/HomePage
7. Wired peripheral protocols
http://www.comm.pub.ro/dicm/C7_Serial_Bus.pdf
8. OneM2m http://www.indiaeu-ictstandards.in/wp-
content/uploads/2017/04/oneM2M-for-smart-city-TSDSI-
presentation-April-21st-2017-Omar-Elloumi.pdf
9. LoRa Modulation
http://www.semtech.com/images/datasheet/an1200.22.pdf
87
1. Understand the basics of IoT.(PO1,3,4)

2. Demonstrate various components, layouts and views in creating IoT
applications.(PO1,3,4)
3. Design applications using sensors and actuators.(PO1,3,4)
4. Demonstrate the working of long running tasks in the background
using IoT.(PO1,3,4)
5. Demonstrates how to write applications for smart world.(PO1,3,4)
88
Software Testing

Prerequisites: SE Contact Hours: 56
Course Coordinator/s: Pradeep Kumar D
Course Contents:
Unit I
A Perspective on Testing, Examples: Basic definitions, Test cases, Insights
from a Venn diagram, Identifying test cases, Error and fault taxonomies,
Levels of testing. Examples: Generalized pseudo code, the triangle problem,
The Next Date function, The commission problem, The SATM (Simple
Automatic Teller Machine) problem, The currency converter, Saturn
windshield wiper.
Unit II
Boundary Value Testing, Equivalence Class Testing, Decision Table-Based
Testing: Boundary value analysis, Robustness testing, Worst-case testing,
Special value testing, Examples, Random testing, Equivalence classes,
Equivalence test cases for the triangle problem, Next Date function, and the
commission problem, Guidelines and observations. Decision tables, Test
cases for the triangle problem, Next Date function, and the commission
problem, Guidelines and observations. Path Testing, Data Flow Testing:DD
paths, Test coverage metrics, Basis path testing, guidelines and observations,
Definition-Use testing, Slice-based testing, Guidelines and observations.
Unit III
Levels of Testing, Integration Testing: Traditional view of testing levels,
Alternative life-cycle models, The SATM system, separating integration and
system testing. A closer look at the SATM system, Decomposition-based,
call graph-based, Path-based integrations, System Testing, Interaction
Testing: Threads, Basic concepts for requirements specification, Finding
threads, Structural strategies and functional strategies for thread testing,
SATM test threads, System testing guidelines, ASF (Atomic System
Functions) testing example. Context of interaction, A taxonomy of
interactions, Interaction, composition, and determinism, Client/Server
Testing.
89
Unit IV
Process Framework: Validation and verification, Degrees of freedom,
Varieties of software. Basic principles: Sensitivity, redundancy, restriction,
partition, visibility, Feedback. The quality process, Planning and monitoring,
Quality goals, Dependability properties, Analysis, Testing, Improving the
process, Organizational factors, Fault-Based Testing, Test Execution:
Overview, Assumptions in fault-based testing, Mutation analysis, Fault-based
adequacy criteria, Variations on mutation analysis. Test Execution:
Overview, from test case specifications to test cases, Scaffolding, Generic
versus specific scaffolding, Test oracles, Self-checks as oracles, Capture and
replay.
Unit V
Planning and Monitoring the Process, Documenting Analysis and Test:
Quality and process, Test and analysis strategies and plans, Risk planning,
Monitoring the process, Improving the process, The quality team, Organizing
documents, Test strategy document, Analysis and test plan, Test design
specifications documents, Test and analysis reports.
Text Books:
1. Paul C. Jorgensen: Software Testing, A Craftsman‟s Approach,

3rdEdition, Auerbach Publications, 2012.
2. Mauro Pezze, Michal Young: Software Testing and Analysis –Process,
Principles and Techniques, 1stEdition, WileyIndia, 2011.
Reference Books:
1. Aditya P Mathur:Foundations of Software Testing, 1stEdition,Pearson

Education, 2008.
2. Srinivasan Desikan, Gopalaswamy Ramesh: Software testing
Principles and Practices, 2ndEdition, Pearson Education, 2007.

At the end of the course, a student should be able to:
1. Identify Test cases, Error and fault taxonomies, Levels of testing.

(PO1,3,4)
90
2. Classify different types of testing (Boundary Value Testing,
Equivalence Class Testing and Decision Table-Based Testing).
(PO1,3,4)
3. Recognize Alternative life - cycle models, recognize Basic concepts
for requirements specification, assess context of interaction. (PO1,3,4)
4. Recognize approaches for Test Execution: from test case
specifications to test cases, Scaffolding, Generic versus specific
scaffolding. (PO1,3,4)
5. Identify and plan strategies to test design specifications document.
(PO1,3,4)
91
Privacy and Security in Online Social Media
Course Coordinator/s: Mrs. Parkavi A
Unit I
What is Online Social Networks, data collection from social networks,
challenges, opportunities, and pitfalls in online social networks,APIs.
Unit II
Collecting data from Online Social Media, Trust, credibility, and reputations
in social systems.
Unit III
Trust, credibility, and reputations in social systems, Online social Media and
Policing.
Unit IV
Information privacy disclosure,revelation and its effects in OSM and online
social networks.
Unit V
Phishing in OSM & Identifying fraudulent entities in online social networks.
Reference Links:
1. http://www.amazon.com/Programming-Collective-Intelligence-
BuildingApplications/dp/0596529325
2. http://www.amazon.com/Practical-Web-Applications-Experts-
Voice/dp/1590599063
3. http://www.amazon.in/Building-Social-Applications-Gavin-
Bell/dp/8184048327? tag=googinhydr18418-21
4. http://www.amazon.in/The-Web-Application-Hackers-
Handbookebook/dp/B005LVQA9S?tag=googinhydr18418-21.
92
Start-up Engineering
Unit I
Introduction, Start up : past & present , NSF AUP Repeal: Internet for
Business, The Key Features of Internet Startups, Technological Trends
Toward Mobility and Decentralization, Start up engineering, Technologies,
Design, Marketing, and Sales, Mobile HTML5 for the Final Project,
Interactive Start, Webapp, Setup and Signup- AWS, Gravatar, Github, and
Heroku, Connect to a Cloud Computer,Launch EC2 Instance, Mac: Connect
to EC2 instance via Terminal.app, Windows: Connect to EC2 instance via
Cygwin, Security Groups, Standard Operating System: Ubuntu 12.04.2 LTS
on a t1.micro AWS instance, Deploy code to Test Heroku account.
Unit II
Linux and Server-Side Javascript (SSJS), Overview, Features of Linux,
Virtual Machines and the Cloud, Virtualization, Cloud and
IAAS/PAAS/SAAS, Linux , Filesystem-Usage of env, PATH, HOME,
which, issues, ssh, scp, bash, apt-get, Compiling from source: ./configure;
make; make install, Example of installation conflicts , Server-Side JS
(SSJS), Install node and npm, node.js REPL, Editing code with nano, node.js
programming, Using the libraries, Market Research, Wireframing, and
Design, Idea, Execution, and Market, Importance of product/idea-
execution/team and market, Idea Maze, Execution Mindset, Kind of
Business: Startups & Small Businesses, Startups: Exhibit Economies of
Scale, Pursue Large Markets, Market Sizing Calculations Early and Often,
Market Research: Tools , framework for determining product tiers,
Wireframing, Copywriting, and Design, Wireframing, Copywriting, Design.
Unit III
Introduction to HTML/CSS/JS, webpage program, HTTP Request to
Rendered Page, Anatomy of web page, HTML: Skeleton and Semantics,
CSS, JS, Separation of concerns, Tools , Deployment, DNS, and Custom
Domains, Deployment: Dev, Staging, Production, Sidebar: Comparing EC2
vs. local laptops for development, Preliminaries: SSH/HTTP/HTTPS-
accessible EC2 dev instance, Creating and managing git branches, Worked
Example: Dev, Staging, Production, DNS, Custom Domains, Finding a
domain: domize.com, Registering a domain: dnsimple.com, Configuring
DNS to work with Heroku, Setting up HTTPS and Google Apps,
93
Social/Local/Mobile, Virality, Growth, Virality Equation, Local, Local
Commerce, Graveyard of Startups.
Unit IV
Regulation, Disruption, Technologies of 2013, Gaining Context,
Transportation and Lodging, Payments and Finance, Biotech, Antitrust and
Acquisitions, Aspects of Regulation, Anticipate the Argument, A/B/C/D
Theory of Regulation, Technological Legalization, Amazon.com,
anesthetizing C, Square, Tesla, Facebook/Goldman, Uber, Angel List,
Disruption and the Technologies of 2013, Industrial Robotics, 3D Printing,
Telepresence, Quantified Self, Bitcoin, Autonomous Drones, Coda, Linux
Command Line, three streams, Navigation and Filesystem, Downloading and
Syncing, Basic Text Processing, Help, Superuser, Intermediate Text
Processing, Intermediate bash, Linux Development Environment:
Development Environment, Distributed Version Control Systems (DVCS).
Unit V
Linux Development Environment : Managing Setup and Configuration as
Code, Mobile: Age of Internetification, Mobile Simply a Fad, Mobile Present
& Future , Mobile technologies , Intermediate Javascript: rise of Javascript,
Basics and Built-ins, Array, Date, RegExp, Math, String, JSON, Error, Built-
in functions, Functional Programming (FP) and JS Functions, Object-
Oriented Programming (OOP), Prototypal Inheritance,and JS Objects,
Heuristics for OOP in JS, Node.js: Asynchrony, Flow Control, and
Debugging: Motivation: reduce the impact of I/O latency withasynchronous
calls, advantages and disadvantages of Node, Asynchronous Programming
and Flow Control, Basic debugging with the Node Debugger.
Reference Books:
1. Materials on Startup Engineering, Balaji S. Srinivasan, Stanford
University
2. http://www.wsj.com/articles/SB100014240531119034809045765122509
15629460#printMode
3. http://www.asymco.com/2012/01/17/the-rise-and-fall-of-personal-
computing/
4. http://www.kpcb.com/blog/2012-internet-trends-update
5. http://www.nytimes.com/2011/05/08/technology/08class.html?pagewante
d=all&_r=0
6. http://www.nytimes.com/2011/06/11/technology/11computing.html?page
wanted=all&_r=0
94
7. http://www.nytimes.com/projects/magazine/ideas/2009/#natural_science-
7
8. http://www.paulgraham.com/growth.html
9. http://blakemasters.com/peter-thiels-cs183-startup
10. http://web.stanford.edu/class/cs106b/textbook/CS106BX-Reader.pdf

1. Describing startups and technology trends towards businesses. (PO 1,3,4)
2. Identifying software usage for businesses and ethics. (PO 1,3,4)
3. Figuring out the web usage for business launch. (PO 1,3,4)
4. Assessing the latest technologies for startups. (PO 1,3,4)
5. Preparing software for startups. (PO 1,3,4)
95
Artificial Intelligence
Contact Hours: 56
Prerequisites: Knowledge of any advanced programming language,
Algorithms and Data structures, Elementary Discrete Mathematics or
similar.
Course Coordinator/s: Dr. S. Rajarajeswari and Dr. Annapurna P Patil
Course Contents:
Unit I
Introduction: What is AI? Intelligent Agents: Agents and environment,
Rationality, the natureof environment, the structure of agents. Problem-
solving by search: Problem-solving agents, Example problems, searching
for solution, uniformed search strategies informed search strategies, Heuristic
functions, On-linesearch agents and unknown environments.On-line search
agents and unknown environments.
Unit II
Logical Agents: Knowledge-based agents, the wumpus world, Logic,
propositional logic, Reasoning patterns in propositional logic, Effective
propositional model checking, Agents based on propositional logic First-
Order Logic: Representation revisited, Syntax and semantics of first-order
logic, usingfirst-order logic, Knowledge engineering in first-order logic.
Interference in First-order Logic: Propositional vs first-order inference,
Unification and lifting, Forward chaining, Backward chaining, Resolution.
Forward chaining, Backward chaining.
Unit III
Planning: Definition, planning with state-space search, Planning graphs,
other planning approaches analysis. Uncertainty: Acting under uncertainty,
Basic probability Notations, Inference using full joint distributions,
Independence, Bayes‟ rule and its use. Learning fromExamples: Forms of
Learning, Supervised Learning, Learning Decision Trees Best Hypothesis
Theory Regression and Classification with Linear Models ANN, Non
Parametric Models SVM, Ensemble Learning, Practical Machine Learning.
SVM, Ensemble Learning, Practical Machine Learning.
96
Unit IV
Learning Probabilistic Models: Statistical Learning, Learning with
complete data Hidden Variables. Natural Language Processing &
communication: Language Models Text Classification Information
retrieval, Extraction, Phrase, structure grammars, Syntactic Analysis,
Augmented Grammars & Semantic Interpretation, Machine translation,
Speech recognition.Machine translation, Speech recognition.
Unit V
Genetic Algorithms: GA, Significance of genetic operators, Termination
parameters, Niching and Speciation, Evolving Neural Networks, Theoretical
grounding, Ant Algorithms.
Perception: Image Formation Earthly Image Processing operations,Object
recognition by appearance, from structural Information 3D world,using
world. Robotics: Introduction, Hardware Perception planning to Move,
planning uncertain movement, moving robotic software architecture,
application domains.Evolving Neural Networks, Theoretical grounding, Ant
Algorithms. Robotic software architecture, application domains.
Text Books:
1. Stuart Russel, Peter Norvig: Artificial Intelligence - A Modern

Approach, 3rd Edition, Pearson Education, 2012. (Unit-1,2,3,4,5).
2. Elaine Rich, Kevin Knight, Shivashankar B Nair: Artificial
Intelligence, 3rd Edition, Tata McGraw Hill, 2011. (Unit-5).
Reference Books:
1. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition,

Pearson Education, 2007.(Unit 5).
2. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill
Education 2013.(unit 3).
3. http://nptel.ac.in
97
At the end of the course, the student should be able to:

1. Identify problems that are amenable to specific solution by appropriate
AI methods.(PO1,3,4)
2. Utilize various symbolic knowledge representation to specify domains
and reasoning tasks of a situated software agent. Use different logical
systems for inference over formal domain representations, and trace how
a particular inference algorithm works on a given problem
specification.(PO1,3,4)
3. Formalize a given problem in the language/framework of different AI
methods and solve using basic AI algorithms. (PO1,3,4)
4. Design and carry out an empirical evaluation of different algorithms on a
problem formalization, and state the conclusions that the evaluation
supports.(PO1,3,4)
5. Communicate scientific knowledge at different levels of abstraction in a
variety of research settings(PO1,3,4)
98
Machine Learning

Prerequisites: AI Contact Hours:56
Course Coordinator/s: Dr. S Rajarajeswari
Course Contents:
Unit I
Introduction
Learning – Types of Machine Learning – Supervised Learning – The Brain
and the Neuron –
Design a Learning System – Perspectives and Issues in Machine Learning –
Concept LearningTask – Concept Learning as Search – Finding a Maximally
Specific Hypothesis – Version Spaces – Find S, Candidate Elimination
Algorithm – Linear Discriminants – Perceptron – LinearSeparability – Linear
Regression.
Unit II
Linear Models
Multi-layer Perceptron – Going Forwards – Going Backwards: Back
Propagation Error – MultilayerPerceptron in Practice – Examples of using
the MLP – Overview – Deriving BackPropagation– Radial Basis Functions
and Splines – Concepts – RBF Network – Curse ofDimensionality –
Interpolations and Basis Functions – Support Vector Machines.
Unit III
Tree and Probabilistic Models
Learning with Trees – Decision Trees – Constructing Decision Trees –
Classification and
Regression Trees – Ensemble Learning – Boosting – Bagging – Different
ways to Combine
Classifiers – Probability and Learning – Data into Probabilities – Basic
Statistics – Gaussian
Mixture Models – Nearest Neighbor Methods – Unsupervised Learning – K
means Algorithms –Vector Quantization – Self Organizing Feature Map.
Unit IV
Dimensionality Reduction and Evolutionary Models
Dimensionality Reduction – Linear Discriminant Analysis – Principal
Component Analysis – FactorAnalysis – Independent Component Analysis –
Locally Linear Embedding – Isomap – LeastSquares Optimization –
Evolutionary Learning – Genetic algorithms – Genetic Offspring: -
99
GeneticOperators – Using Genetic Algorithms – Reinforcement Learning –
Overview – Getting LostExample – Markov Decision Process.
Unit V
Graphical Models
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution –
Markov Chain Monte
Carlo – Graphical Models – Bayesian Networks – Markov Random Fields –
Hidden Markov
Models – Tracking Methods.
Text Books:
1. Ethem Alpaydin "Introduction To Machine Learning" 2nd Edition

PHI Learning Pvt. Ltd-New Delhi.
2. Tom M Mitchell, ―Machine Learning‖, First Edition, McGraw Hill
Education, 2013.
Reference Books:
1. Peter Flach, ―Machine Learning: The Art and Science of Algorithms

that Make Sense of
Data‖, First Edition, Cambridge University Press, 2012.
2. Stephen Marsland, ―Machine Learning – An Algorithmic Perspective‖,
Second Edition,
3. Chapman and Hall/CRC Machine Learning and Pattern Recognition
Series, 2014.
4. Trevor Hastie, Robert Tibshirani, Jerome Friedman, h The Elements of
Statistical
Learning, 2nd edition, springer series in statistics.
5. Jason Bell, ―Machine learning – Hands on for Developers and
Technical Professionals‖,
FirstEdition, Wiley, 2014
At the end of the course, the student will be able to:

1. Distinguish between, supervised, unsupervised and semi-supervised
learning.(PO1,3,4)
100
2. Apply the appropriate machine learning strategy for any given
problem.(PO1,3,4)
3. Suggest tree and probabilistic learning algorithms for any given.
Problem. (PO1,3,4)
Modify existing machine learning algorithms to improve
classification efficiency.(PO1,3,4)
4. Design systems that uses the appropriate graph models of machine
learning(PO1,3,4)
101
Deep Learning

Course Coordinator/s: Srinidhi H
Course Contents:
Unit I
Introduction: Human brain, neuron models, neural nets as directed graphs,
feedback, neural architectures, knowledge representation, connection to
artificial intelligence,Pytorch and Tensorflow.
Unit II
Learning Process: Error-correction learning, memory based learning,
Hebbian learning, competitive learning, Boltzmann learning, credit
assignment, learning with and without a teacher, learning tasks, memory,
statistical learning theory,Backpropagation using MNSIT.
Unit III
Modern practical deep neural networks: Deep feedforward networks,
regularization for deep learning, optimization for training deep models,
convolutional Networks,Classification using Tensorflow and Pytorch.
Unit IV
Sequence Modelling: Recurrent and recursive nets, practical Methodology,
applications.Reinforcement learning.
Unit V
Deep Learning Research: Linear factor models, auto encoders, variational
auto encoders, restricted Boltzmann machine, generative adversarial
networks,Transfer learning.
TextBooks:
102
1. Simon Haykin, Neural networks: A comprehensive foundation,
Second Edition, Prentice Hall, New Delhi, 1999, ISBN-81-203-
2373-4.
2. Ian Goodfellow, Yoshua Bengio and Aaron Courville, Deep
Learning, MIT Press, 2016.
1. Explain the concepts and applications of neural networks and deep

learning. (PO1,3,4)
2. Explain how various types of learning work and how they can be
used. (PO1,3,4)
3. Apply deep feedforward networks and convolutional to solve
practical problems. (PO1,3,4)
4. Demonstrate how recurrent and recursive nets function and how
practical problems can be mapped to them. (PO1,3,4)
5. Design end-to-end deep learning architectures involving various
types of feedforward networks, auto encoders, RBM, and generative
adversarial networks for practical applications. (PO1,3,4)
103
Social Network Analysis
Course Coordinator/s: Parkavi A
Unit I
Introduction to social network analysis Introduction to new science of

networks. Networks examples. Graph theory basics Descriptive network
analysis Statistical network properties. Degree distribution, clustering
coefficient. Frequent patterns. Network motifs. Cliques and k-cores
Unit II
Network structure. Nodes and edges, network diameter and average path
length. Node centralities and ranking on network Node centrality metrics:
degree, closeness and betweenness centrality. Eigenvector centrality and
PageRank. Algorithm HITS
Unit III
Network communities Networks communities. Graph partitioning and cut
metrics. Edge betweenness. Modularity clustering. Affiliation networks
Affiliation network and bipartite graphs. 1-mode projections.
Recommendation systems
Unit IV
Information and influence propagation on networks Social Diffusion. Basic
cascade model. Influence maximization. Most influential nodes in network.
Network visualization Network visualization and graph layouts. Graph
sampling. Low-dimensional projections
Unit V
Social media mining Natural language processing and sentiment mining.
SNA in real world: FB/VK and Twitter analysis Properties of large social
networks: friends, connections, likes, re-tweets
104
Text Books:
1. David Easley and John Kleinberg. "Networks, Crowds, and

Markets: Reasoning About a Highly Connected World." Cambridge
University Press 2010.
2. Eric Kolaczyk, Gabor Csardi. “Statistical Analysis of Network Data
with R (Use R!)”. Springer, 2014.
Reference Books:
1. Maarten van Steen. “Graph Theory and Complex Networks. An

Introduction”, 2010.
2. Reza Zafarani, Mohammed Ali Abbasi, Huan Liu. “Social Media
Mining: An Introduction”. Cambridge University Press 2014.
3. Maksim Tsvetovat and Alexander Kouznetsov. “Social Network
Analysis for Startups”. O‟Reilly Media, 2011

1. Know basic notation and terminology used in network science
(PO1,3,4)
2. Be able to visualize, summarize and compare networks (PO1,3,4)
3. Understand basic principles behind network analysis algorithms
(PO1,3,4)
4. Develop practical skills of network analysis in R programming
language (PO1,3,4)
5. Be capable of analyzing real work networks (PO1,3,4)
105
Natural Language Processing
Prerequisites: Artificial Intelligence Contact Hours: 56
UnitI
Introduction: Knowledge in Speech and Language Processing, Ambiguity,
Models and Algorithms; Language, Thought, and Understanding; The State
of the Art and The Near-Term Future; Regular Expressions and Automata;
Morphology and Finite-State Transducers: Lexicon-free FSTs: The Porter
Stemmer, Human Morphological Processing.
UnitII
N-grams: Counting Words in Corpora, Smoothing, N-grams for Spelling and
Pronunciation, Entropy; Word Classes and Part-of-Speech Tagging: Part-
of-Speech Tagging , Rule-based Part-of-speech Tagging, Stochastic Part-of-
speech Tagging, Transformation-Based Tagging; Context-Free Grammars
for English: Constituency, Context-Free Rules and Trees, Sentence-Level
Constructions, The Noun Phrase.
UnitIII
Parsing with Context-Free Grammars: The Earley Algorithm; Features
and Unification: Feature Structures, Unification of Feature Structures,
Features Structures in the Grammar, Implementing Unification, Parsing with
Unification Constraints; Lexicalized and Probabilistic Parsing:
Probabilistic Context-Free Grammars, Problems with PCFGs.
UnitIV
Representing Meaning: First Order Predicate Calculus, Some Linguistically
Relevant Concepts, Related Representational Approaches, Alternative
Approaches to Meaning; Semantic Analysis : Syntax-Driven Semantic
Analysis, Attachments for a Fragment of English; Lexical Semantics :
Relations Among Lexemes and Their Senses, WordNet: A Database of
Lexical Relations, The Internal Structure of Words.
UnitV
Discourse: Reference Resolution, Text Coherence, Discourse Structure;
Generation: Introduction to Language Generation, An Architecture for
Generation; Machine Translation: Language Similarities and Differences,
The Transfer Metaphor.
Text Book:
1. Daniel Jurafsky and James H Martin, “Speech and Language
Processing: An introduction to Natural Language Processing,
106
Computational Linguistics and Speech Recognition”, Prentice Hall,
2nd Edition, 2008.
Rerefence Book:
1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and
Information Retrieval”, Oxford University Press, 2008.

1. Interpret how speech and language technology relies on formal models to
capture knowledge, and language processing deals with subparts of words
(morphology). (PO 1,3,4)
2. Illustrate the way N-gram tool is used for spelling and pronunciation
processing, and part-of-speech tagging mechanism using various
categories. (PO 1,3,4)
3. Describe feature structures and unification operation which is used to
combine them, and probabilistic parsing to capture more syntactic
information. (PO 1,3,4)
4. Outline representations used to bridge the gap from language to
commonsense Knowledge (semantic processing), and meanings
associated with lexical items. (PO 1,3,4)
5. Emphasize problems that NLP systems face, natural language outputs
construction from non-linguistic inputs and machine translation
framework approaches. (PO 1,3,4)
107
Soft Computing
Unit I
Introduction: Neural networks, Fuzzy logic, Genetic algorithms, Hybrid
systems,Artificial Neural Networks: Fundamental concept, Evolution, Basic
model of ANN, Important terminologies of ANN, MP neuron, Hebb Network.
Unit II
Supervised Learning Network: Perceptron Networks, Adaptive linear neuron,
multiple adaptive linear neurons, Back propagation Network.
Unit III
Introduction to Fuzzy logic, classical sets and fuzzy sets: Classical sets, Fuzzy
sets.Classical relations and fuzzy relations: Cartesian product of relation,
Classical relation, Fuzzy relations, Tolerance and equivalence
relations.Membership functions: Features, Fuzzification, methods of
membership value assignments.
Unit IV
Defuzzification: Lambda-cuts for fuzzy sets, Lambda-cuts for fuzzy relations,
Defuzzification methods. Fuzzy decision making: Individual, multiperson,
multiobjective, multiattibute, and fuzzy Bayesian decision making.
Unit V
Genetic algorithms: Introduction, Basic operations, Traditional algorithms,
Simple GA, General genetic algorithms, the schema theorem, Genetic
programming, applications.
Reference Books:
1. Principles of Soft computing, S N Sivanandam, Deepa S. N, Wiley, India,
(Chapters 1, 2, 3(Up to 3.5), 7, 8, 9, 10, 13, 15 ( up to 15.6 & 15.9,15,10).
2. Neuro-fuzzy and soft computing, J.S.R. Jang, C.T. Sun, E. Mizutani, PHI
(EEE edition) ISBN: 978-81-203-2243-1

1. Identify and describe soft computing techniques and their roles in building
intelligent machines (PO1,3,4)
2. Identify the components and building block hypothesis of Genetic
algorithm. (PO1,3,4)
3. Examine the features of neural network and its applications. (PO1,3,4)
108
4. Design Genetic algorithm to solve optimization problem. (PO1,3,4)
5. Describe Neuro Fuzzy system for clustering and classification. (PO1,3,4)
109
Computer System Performance Analysis
Prerequisites: Probability Theory, matrices, software engineering
aspects and queuing theory. Contact Hours: 56
Course Coordinator: Dr. T N R Kumar
Unit I
Introduction: The Art Of Performance Evaluation, Common Mistakes In
Performance Evaluation, A Systematic Approach To Performance
Evaluation, Selecting An Evaluation Technique, Selecting Performance
Metrics, Commonly Used Performance Metrics, Utility Classification Of
Performance Metrics, Setting Performance Requirements.
Unit II
Workloads, Workload Selection and Characterization: Types of Work
Loads, Addition Instructions, Instruction Mixes, Kernels; Synthetic
Programs, Application Benchmarks, Popular Benchmarks. Work Load
Selection: Services Exercised, Level Of Detail; Representativeness;
Timeliness, Other Considerations In Workload Selection. Work Load
Characterization Techniques: Terminology, Averaging, Specifying
Dispersion, Single Parameter Histograms, Multi Parameter Histograms,
Principle Component Analysis, Markov Models, Clustering.
Unit III
Monitors, Program Execution Monitors and Accounting Logs: Monitors:
Terminology and classification; Software and hardware monitors, Software
versus hardware monitors, Firmware and hybrid monitors, Distributed
System Monitors, Program Execution Monitors and Accounting Logs,
Program Execution Monitors, Techniques for Improving Program
Performance, Accounting Logs, Analysis and Interpretation of Accounting
log data, Using accounting logs to answer commonly asked questions.
Unit IV
Capacity Planning and Benchmarking: Steps in capacity planning and
management; Problems in Capacity Planning; Common Mistakes in
Benchmarking; Benchmarking Games; Load Drivers; Remote-Terminal
Emulation; Components of an RTE; Limitations of RTEs, Experimental
Design and Analysis: Introduction: Terminology, Common mistakes in
experiments, Types of experimental designs, 2 k Factorial Designs, Concepts,
Computation of effects, Sign table method for computing effects; Allocation
of variance; General 2k Factorial Designs, General full factorial designs with
k factors: Model, Analysis of a General Design, Informal Methods.
Unit V
110
Queuing Models: Introduction: Queuing Notation; Rules for all Queues;
Little‟s Law, Types of Stochastic Process. Analysis of Single Queue: Birth-
Death Processes; M/M/1 Queue; M/M/m Queue; M/M/m/B Queue with finite
buffers; Results for other M/M/1 Queuing Systems. Queuing Networks:
Open and Closed Queuing Networks; Product form networks, queuing
Network models of Computer Systems. Operational Laws: Utilization Law;
Forced Flow Law; Little‟s Law; General Response Time Law; Interactive
Response Time Law; Bottleneck Analysis; Mean Value Analysis and Related
Techniques; Analysis of Open Queuing Networks; Mean Value Analysis;
Text Book:
1. Raj Jain: The Art of Computer Systems Performance Analysis, 1 st edition,
John Wiley and Sons, 2012.
Reference Books:
1. Paul J Fortier, Howard E Michel: computer Systems Performance
Evaluation and prediction, 1st edition, Elsevier, 2009.
2. Trivedi K S: Probability and Statistics with Reliability, Queuing and
Computer Science Applications, 1st edition, PHI, 2011.

1. Understand the techniques to approach performance problem and Compare
two systems and determine the optimal value of a parameter.(PO1,3,4)
2. Identify performance bottlenecks and characterize the load on a system and
Select the number and size of system components and predict the
performance of future workloads.(PO1,3,4)
3. Understand the use of different analysis strategies like measurement,
simulation, analytical modeling and Implement different techniques in
experimental design like factorial design techniques.(PO1,3,4)
4. Understand how to use monitors and accounting logs of systems use to
improve the performance of the system and Apply mathematical
techniques with stress on learning the types of Queuing models.(PO1,3,4)
5. Apply queuing models to solve problems in computer Networks, Operating
system, etc.(PO1,3,4)
111
Future Skills 2020
Unit I
Introduction: Current industry overview, Future Skills 2020 research report
from IFTF. Sense making: Introduction, VUCA (Volatility, Uncertainty,
Complexity and Ambiguity).What is Sense Making? How Sense Making
Helps? Steps in sense making, How to do effective sense making? Hurdles in
effective sense making. Assignment: A short 1 hour assignment where
students will be posed with a situation to exercise their Sense Making ability.
It will be assessed at the end of the session.
Unit II
Virtual Collaboration(VC): Introduction, How VC helps? Characteristics of
Virtual Collaboration, Types of Virtual Collaboration. Advantages,
Disadvantages and Applications of VC. Assignment: The students will be
given an assignment applying both the sensemaking skills and Virtual
Collaboration skills using the cloud based tools to complete a specific task.
This assignment will also cover working in a team using virtual collaboration
tools. In order to focus on learning of the specified skills, the end task is kept
small and achievable in short time frame.
Unit III
Social Intelligence: Introduction, Hypothesis, Measuring Social Intelligence,
Difference between intelligence and Social Intelligence, Derive some of the
study done in Social networking theory. Assignment: The assignment will
focus on students using their social network to accomplish a specific task.
Unit IV
Crosscultural competency: Introduction, Importance of cross cultural
competence in workplace. Nuances of cross cultural differences, Examples to
demonstrate the differences. Assignment: Students will have to work with a
team member from another culture to complete a specific task.
Unit V
Cognitive Load management: Introduction, Current situation of information
overload, Tools and techniques tohandle the cognitive load. Importance of
these skills in work place. Assignment: Students will be given a specific
topic and time to quickly arrive at a good summary of the topic. They will be
given access to internet and books to refer. Importance is given to how
quickly they can gather, curate and present the summary of the topic.
112
Reference Books:
1. The detailed report can be found at
http://www.iftf.org/uploads/media/SR1382A_UPRI_future_work_skills_s
m.pdf
2. The reading material for individual lectures will be shared with the
students using Tutor Space.

1. Identify the Future Work skills needed for next 5 years.(PO 1,3,4)
2. Illustrate sense Making Skills through assignments.(PO 1,3,4)
3. Survey the different Virtual Collaboration skills to complete an
assignment.(PO 1,3,4)
4. Describe the social intelligence skill and application of the same.(PO
1,3,4)
5. Compose an assignment using Cross-cultural competence and load
management skills.(PO 1,3,4)
113
Cyber Physical Systems
Course Coordinator/s: Dr. Anita Kanavalli
Unit I
Modeling, design, analysis, and implementation of cyber-physical systems
Unit II
Dynamic behavior modeling, state machine composition, and concurrent
computation
Unit III
Sensors and actuators. Embedded systems and networks
Unit IV
Feedback control systems, Analysis and verification techniques, temporal
logic, and model checking
Unit V
Machine learning topics
Text Book:
1. Edward A. Lee and Sanjit A. Seshia, Introduction to Embedded

Systems, A Cyber-Physical Systems Approach, Second Edition,
http://LeeSeshia.org, ISBN 978-1-312-42740-2, 2015.

1. Apply the afore mentioned cyber-physical systems fundamentals to
application domains such as connected and autonomous vehicles,
industrial internet, and smart and connected health.
2. Implement cyber-physical systems solutions (e.g., embedded
networking protocols, real-time scheduling algorithms, and
networked control algorithms).
3. Explore (e.g., survey) cutting-edge research findings in cyber
physical systems.
114
High Performance Computing
Prerequisites: Computer Organization Contact Hours: 56
Course Coordinator/s: Mallegowda M
Unit I
Introduction to High–Performance Computers, Memory Hierarchy, CPU
Design: Reduced Instruction Set Computers, Multiple–Core Processors,
Vector Processors.Parallel Semantics, Distributed Memory Programming.
Unit II
Programming Shared Address Space Platforms: Thread Basics, Why
Threads? The POSIX Thread API, Thread Creation and Termination,
Synchronization Primitives in Pthreads, Controlling Thread and
Synchronization Attributes, Thread Cancellation, Composite Synchronization
Constructs.Tips for Designing Asynchronous Programs, OpenMP: a Standard
for Directive Based Parallel Programming.
Unit III
Programming using the Message-Passing Paradigm: Principles of Message-
Passing Programming, The Building Blocks: Send and Receive Operations,
MPI: the Message Passing Interface, Topologies and Embedding,
Overlapping Communication with Computation, Collective Communication
and Computation Operations.Groups and Communicators.
Unit IV
Introduction: GPUs as Parallel Computers, Architecture of a Model GPU,
Why More Speed or Parallelism? Parallel Programming Languages and
Models, Overarching Goals. History of GPU Computing: Evolution of
Graphics Pipelines, GPU Computing. Introduction to CUDA: Data
Parallelism, CUDA Program Structure, A Matrix-Matrix Multiplication
Example, Device Memories and Data Transfer.Kernel Functions and
Threading.
Unit V
CUDA Threads: CUDA Thread Organization, Using blockIdx and threadIdx,
Synchronization and Transparent Scalability, Thread Assignment, Thread
Scheduling and Latency Tolerance. CUDA Memories: Importance of
115
Memory Access Efficiency, CUDA Device Memory Types, A Strategy for
Reducing Global Memory Traffic.Memory as a limiting Factor to
Parallelism.
Text Books:
1. Rubin H Landau, Oregon State University,
http://science.oregonstate.edu/ rubin/.
2. Ananth Grama,Anshul Gupta,Vipin kumar, George Karypis,
Introduction to parallel computing, second edition, 2003, Pearson
education publishers.
3. David B Kirk, Wen-mei W. Hwu, “Programming Massively
Parallel Processors – A Hands-on Approach”, First Edition,
Elsevier and nvidia Publishers, 2010.
Reference Books:
1. Thomas Rauber and Gudula Runger Parallel Programming for

Multicore and cluster systems,Springer International Edition, 2009.
2. Hennessey and Patterson Computer Architecture: A quantitative
Approach, Morgan Kaufman Publishers, 2011.
3. Michael J.Quin “Parallel Programming in C with MPI and Open
MP”, McGraw Hill.

At the end of the course, the student must be able to:
1. Explain the technologies and architectures used for parallel
computing (PO-1,2,3)
2. Design and develop parallel programs using Open-MP
programming interface. (PO-1,2,3)
3. Elaborate the principles and architecture of message-passing
programming paradigm for solving real world problems(PO-1,2,3)
4. Provide an understanding of Graphical Processing Units and their
architecture(PO-1,2,3)
5. Analyze the features of GPUs, their functionalities and also Design
parallel applications using CUDA-C (PO-1,2,3)
116
Annexure
Table 1
Rubrics for Assessment of Student Performance in Laboratory
Trait Barely Basic Good Very Good

Acceptable
Specifications The program is The program The program works The program
producing produces correct and produces the works and
incorrect results. results but does correct results and meets all of
not display them displays them the
correctly. correctly. It also specifications.
meets most of the
other specifications.
Readability The code is The code is The code is fairly The code is
poorly organized readable only by easy to read. exceptionally
and very difficult someone who well organized
to read. knows what it is and very easy
supposed to be to follow.
doing.
Reusability The code is not Some parts of the Most of the code The code
organized for code could be could be reused in could be
reusability. reused in other other programs. reused as a
117
programs. whole or each
routine could
be reused.
Documentation The The The documentation The

documentation is documentation is consists of documentation
simply comments simply comments embedded comment is well written
embedded in the embedded in the and some simple and clearly
code and does code with some header explains what
not help the simple header documentation that the code is
reader understand comments is somewhat useful accomplishing
the code. separating in understanding the and how.
routines. code.
Delivery The code was The code was The program was The program
more than 2 within 2 weeks of delivered within a was delivered
weeks overdue. the due date. week of the due date. on time.
Efficiency The code is huge The code is brute The code is fairly The code is
and appears to be force and efficient without extremely
patched together. unnecessarily sacrificing efficient
long. readability and without
understanding. sacrificing
readability and
understanding.
118
Table 2
Rubrics for assessment of Seminar
Criteria Distinguished Good Basic Unacceptable Score
(5) (4) (3) (1)
Organization - Extremely well - Generally well - Somewhat - Poorly
organized. organized. organized. organized
-Introduces the -Introduces the -Introduces -Does not clearly
purpose of the purpose of the the purpose of introduce the
presentation presentation the purpose of the
clearly and clearly. presentation presentation
creatively. -Includes -Includes -Uses ineffective
-Effectively transitions to some transitions that
includes smooth, connect key transitions to rarely connect
clever transitions points and better connect key points; cannot
which are succinct transitions from points but understand
but not broken up idea to idea are there is presentation
in order to connect noted. difficulty in because there is
key points - Most following no sequence of
-Student presents information presentation. information.
information in presented is in - Student - Presentation is
logical, interesting logical sequence; jumps around broken and
sequence which A few minor topics. Several disjointed; no
audience can points may be points are apparent logical
follow. confusing confusing. order of
-Ends with an -Ends with a -Ends with a presentation-Ends
accurate summary of main summary or without a
119
conclusion points showing conclusion; summary or
showing some evaluation little evidence conclusion.
thoughtful, strong of the evidence of evaluating
evaluation of the presented. content based
evidence on
presented. Evidence.
Content: Depth -Speaker provides -For the most -Explanations -No reference is
and Accuracy an accurate and part, explanations of concepts made to literature
complete of concepts and and/or theories or theory.
explanation of key theories are are inaccurate Presentation is
concepts and accurate and or incomplete. not clear;
theories, drawing complete. Some Little attempt information that
upon relevant helpful is made to tie does not support
literature. applications of in theory. presentation in
Applications of theory are There is a any way is
theory are included included. great deal of unnecessarily
to illuminate -Presents information included.
issues. evidence of valid that is not -Presents little or
-Provides evidence research on the connected to no evidence of
of extensive selected topic, the current valid research on
and valid research with multiple presentation. the selected topic.
on the selected sources. -Presents -Shows little
topic, with -Combines evidence of evidence of the
multiple existing ideas to research on combination of
and varied form the selected ideas.
120
sources. new insights. topic, with -Information
-Combines and -No significant sources. included is
evaluates existing errors are made; a -Combines sufficiently
ideas to form new few existing ideas. inaccurate that
insights. inconsistencies or -Few errors indicates absence
-Information errors in are made to of accurate
completely information. distract a information.
accurate; all names -Level of knowledgeabl -Presentation
and facts were presentation is e listener, but consistently is too
precise and explicit generally some elementary or too
-Level of appropriate. information is sophisticated for
presentation is accurate. the audience.
appropriate for the -Portions of
audience. presentation
are too
elementary or
too
sophisticated
for audience.
Creativity -Uses the -Some originality -Little or no - Bland and
unexpected to full apparent; clever variation; a predictable.
advantage; very at times; good few original Repetitive with
original, clever, variety and touches but little or no
and creative blending of for the most variety; little
approach that materials/media. part material creative energy
captures audience's presented with used.
121
attention. little
originality or
interpretation.
Use of -Graphics -While graphics - occasional --Student uses
Communicatio designed reinforce relate and aid use of superfluous
n Aids presentation and presentation, graphics that graphics, no
maximize audience media are not as rarely support graphics, or
understanding; use varied and not as presentation ; graphics that are
of media is varied well connected to visual aids so poorly
and appropriate the presentation. were not prepared that they
with media not useful or clear, detract from the
being added time wasting presentation.
simply for the sake use of
of use. multimedia;
122
Use of -Poised, clear -Clear -Audience -Student is
Language articulation; proper articulation but occasionally anxious and
volume; steady not as polished; has trouble cannot be heard
rate; enthusiasm; slightly hearing the or monotone with
confidence; uncomfortable at presentation; little or no
speaker is clearly times Most can seems expression.-
comfortable in hear uncomfortable Presentation has
front of the group. presentation.- .-Presentation four or more
-Presentation has Presentation has has three spelling errors
no misspellings or no more than two misspellings and/or
grammatical misspellings and/or grammatical
errors. and/or grammatical errors.
grammatical errors.
errors
Eye Contact -Maintains eye - Student -Some eye -Student reads all
contact; seldom maintains eye contact, but or most of slides
returning to notes; contact most of not with no eye
presentation is like the time but Maintained contact.
a planned frequently returns and at least
conversation. to slides. half the time
123
reads most of
slides.
Viva Voce -Demonstrates -Demonstrates -Demonstrates -Demonstrates
extensive knowledge of the some incomplete
knowledge of the topic by knowledge of knowledge of the
topic by responding rudimentary topic by
responding accurately and questions by responding
confidently, Appropriately responding inaccurately and
precisely and addressing accurately Inappropriately to
appropriately to all questions . At to questions. questions.
audience ease with answers
questions. to all questions
but fails to
elaborate.
Report Document is fully Document has Document has Document has
compliant With high degree of low degree of minimal degree of
required rules and compliance with compliance compliance with
structure. required rules and with required required rules
Document uses structure. rules and and structure
highly appropriate Document uses structure Document
language and style. appropriate Document contains
language specific uses mostly inappropriate
to the discipline appropriate language or many
language and spelling
contains /grammatical
occasional errors
124
spelling /
grammatical
errors
Regularity Reports to guide Reports to guide Does not Has not met the
regularly for often for seminar report to guide guide at all.
seminar discussion discussion for seminar
discussion
Overall Excellent Good Average Poor
Presentation
125
Table 3
Rubrics for assessment of Internship
Deliverables for Student Performance in Internship:
Internship Title: __________________________________________
Company Name: _________________________________________________
Name of Student: _________________________________________________
Name of Supervisor at Company: _____________________________________
Name of Supervisor at College: _______________________________________
Each supervisor must fill a rubric for each student:
Basic Good Very Good Total
(0-4 Pts) (5-7 Pts) (10 Pts)

Possible Earned
Tools and new Few sources at Multiple sources Multiple sources 10

Technology the Industry, of high quality, of high quality,
Learnt aware of quality good judgment of well researched
126
of resources the information, and analyzed,
and relevance identification of continuous
to tools and gaps in efforts at
Techniques at knowledge at the acquiring
hand Industry and Information.
Academics. Identification of
the application of
the tools and
Technology
learnt to the
present market.
Relevance of the Fairly Relevant Moderately Highly Relevant 10

topic chosen to Relevant
the current
market
127
Report Writing Reasonably Sound Excellent 10
good organization and organization, no
organization structure, clear, technical or
and lacks clarity very few errors, grammar errors,
in few topics, complete, concise and
complete, few reasonably good precise,
omissions, style complete
grammatically documentation
correct, lacks
style
Demonstration Moderately be Efficiently be able Excellent 10

of the Tools able to to demonstrate demonstration of
Learnt demonstrate the skills learnt the tools and
the tools learnt and be able to techniques learnt
at the Industry propose an and be able to
application for the apply it to any
128
same. simple case
study.
Presentation Reasonably Good , Excellent 10

and viva voce good professional professional and
communication communication, technical
and good visual aids, communication,
presentation, able to give effective
able to give technical answers presentations,
technical able to analyze
answers to technically and
some extent clarify views in
viva-voce
129
Table 4
Rubrics for assessment of student performance in Project work I
Level of achievement
Sl Excellent Good (4) Average Acceptable Unacceptable Score
No (5) (3) (2) (1)
1
Identificatio Purpose Purpose Purpose Purpose and Purpose and
n of Problem and need of and need of and need of need of the need of the
1 Domain and the project the project the Project Project is Project is not at
Detailed is very well is is satisfactorily all explained
Analysis explained. explained moderately explained
well. explained
2 of the
Study Existing Existing Existing Existing Existing systems
Existing systems are systems are systems are systems are are not studied.
Systems / very well well moderately satisfactorily Documents of
Literature studied. studied. studied. studied. very poor
Survey Documents Documents Documents Documents standards, online
of high of good of average of resources and
standards standards standards, satisfactory books are
2 like IEEE like online standards, studied.
130
papers, internation resources online
reputed al and books resources and
online journal/con are studied. books are
resources ference studied
and books papers,
are studied. good online
resources
and books
are studied.
3
Objectives All All Most of the Only few Objectives of the
3 of the objectives objectives objectives objectives of proposed work
Proposed of the of the of the the proposed are
Work proposed proposedw proposedw work are well either not
work are ork are ork are defined defined properly.
very well well well
defined. defined. defined.
4
Design Steps to be Steps to be Steps are Steps to be Steps to be
4 Methodolo followed to Followed mentioned followed to followed to solve
gy solve the to solve the but are solve the the defined
defined defined unclear; defined problem are not
problem problem is without problem are at all specified.
are clearly specified justificatio not specified Design
specified.M but n to properly. Methodology
ost suitable detailing is objectives Design used is not
design not done. Appropriat Methodology correct and is
.Methodolo Suitable e design used is not justified
131
gy is used design Methodolo ambiguous
and is Methodolo gy is used and not
properly gy is used but not justified
justified and justified
properly properly
justified
5 used
Tools Clear Acceptable Good Average Not Acceptable
5 for Design Understand
ing
6
Planning of Time Time Time Time frame Time frame itself
6 Project frame frame frame is vaguely is not properly
Work properly properly properly specified, and specified
specified specified specified, is not
and being and being but not followed
followedac followed being
curately most of the followed
time
7
Understandi Clear Acceptable Good Average Not Acceptable
ng of the understandi
7 modules ng
8
Demonstarti Objectives Objectives Objectives Objectives No objectives
on achieved as achieved as achieved as not achieved achieved.
and per time per time per time as per time Contents of
Presentatio frame frame. frame. frame. Presentations are
n .Contents Contents of Contents of Contents of not appropriate
132
of Presentatio Presentatio presentation and not well
8 Presentatio n is n is is not delivered
n Is appropriate appropriate appropriate. Poor delivery of
Appropriat but not but not Eye contact presentation
e and well well well with few
arranged. arranged. arranged. people and
Proper eye Satisfactor Presentatio unclear voice
contact y n not
with demonstrati satisfactory
audience on, clear and
and clear voice with average
voice with good demonstrati
good spoken on
spoken language
language but eye
contact not
proper
9
Regularity Student Student Student Student does Student does not
9 reports to does not reports to not report to meet guide at all
the guide report to the guide guide and the work is
regularlyan guide very but lacks regularly and always
d is regularly consistency is not incomplete
consistent but is consistent in
in work consistent work
in the work
1
Report of Project Project Project Project report Project report
133
Project report report report is not prepared
10 Phase I is is is not fully according to the
according accordingto according according to specified format
to the the to the the specified References and
specified specified specified format citations are not
format format format with Insufficient appropriate
References References few references
and and mistakes and citations
citations citations In-
are are sufficientre
appropriate appropriate ferences
and well but not and
mentioned mentioned citations
well
134
Table 5
Rubrics for assessment of student performance in Project work II
Level of achievement
S Excellent Good (8) Average Acceptable Unacceptable Score
l (10) (6) (4) (2)
N
o
135
1
Incorporation Changes are Changes All major Few changes Suggestions
of Suggestions made as per are made as changesar are made as made during
modifications per e made as per Project Phase I
suggested modificatio per modifications evaluation are
during ns modificati suggested not
Project Phase suggested ons during incorporated
I during suggested Project Phase
evaluationan Project during I evaluation
d new Phase I Project
innovationns evaluation Phase I
are added and is evaluation
justified
correctly
2
Project All defined All defined Most of Some of the Defined
Demonstratio objectives objective the defined objectives are
n are achieved are defined objectives are not achieved
with some achievedEa objectives achieved. Modules are
more ch Module are Only few not in proper
additional is working achieved Modules are working form
136
features. satisfactoril Most of working and which further
Each Module y and is the is leads to failure
is working properly Modulesar demonstrated of integrated
well and is demonstrat e workin Modules of system
properly ed and is project
demonstrated All satisfactor are not
All modules modules of ily demon properly
of project are project are rated integrated
well well Integratio
integrated integrate n of all
and system and system modules
working is working is not done
accurate satisfactory and
system
working is
not very
satisfactor
y
3
Demonstar Contents of Contents of Contents Contents of Contents of
tion and Presentation Presentatio of presentation Presentations
Presentatio is nis Presentati is not are not
n Appropriate appropriate on is appropriate appropriate
and well but not appropriat Eye contact and not well
arranged well e but not with few delivered
Proper eye arranged well people and Poor delivery
contact with Satisfactor arranged unclear voice of presentation
137
audience and y Presentati
clear voice demonstrati on not
with good on, clear satisfactor
spoken voice with y and
language good average
spoken demonstra
language tion
but eye
contact not
proper
4
Project Project Project Project Project Project report
Report report is report report report is not prepared
according to is is not fully according to
the specified according according according the specified
format to the to the to the format
References specified specifiedf specified References
and citations format ormat format and citations
are References with few Insufficient are not
appropriate and mistakes references appropriate
and well citations In- and citations
mentioned are sufficient
appropriate references
but not and
mentioned citations
well
5
Conclusi Results are Results are Results Results Results are not
138
on presented in presented presented presented are presented
and very in good are not not clear properly
Discussi appropriatem manner. much Project work Project work
on anner. Project satisfactor summary and is not
Project work work y conclusion is summarized
is well summary Project vague and concluded
summarized and work Future properly
and conclusion summary extensions in
concluded. not very and the project Future
Future appropriate conclusio are not extensions in
extensions in . n not very clearly the project are
the project Future appropriat specified not at all
are very well extensions e. specified
specified in the Future
project are extensions
well in the
specified project are
specified
139
Table 6
Interim Progress Assessment Rubric for Project work-II Evaluation
Project: ________________________________________
Name of Student: _________________________________
Name of Supervisor: _______________________________
Each supervisor on the project must fill a rubric for each student
Barely acceptable Basic Good Very Good Total
(0 – 2 Pts) (3 Pts) (4 Pts) (5 Pts)
Possible Earned
Problem  Bare formulation  Basic  Clear  Clear 5
formulation  Bare formulation formulation formulation
understanding  Basic  Good with well
of the problem, understanding of understanding defined
with scarce the problem, but of scope
knowledge of lack appropriate the problem,  Very good
relevant material study of relevant with understanding
material study of of
relevant the problem
material and
 Good system relevant
analysis material
 Near
production
quality system
analysis
140
Self-  Slow progress,  Slow progress,  Good  Steady 5
motivation with barely with basic project progress progress
and project satisfactory result outcome  Need  Highly self-
management  Unresponsive to  Rely on reminder motivated
supervisor supervisor‟s push sometimes Good project
to work  Minor management
problems
in project
manageme
141
Table 7
Design Development and Solution Asset Rubric for Project work-II Evaluation
Project: ________________________________________
Name of Student: _________________________________
Each supervisor on the project must fill a rubric for each student
(0 – 2 Pts) (3 Pts) (4 Pts) (5 Pts)
Possible Earned
Analysis and  Obvious  Simple, yet  Comple  Provide 5
solving skills solution, mostly te solution
sketchy complete solution with to complex
functionalities solution that nontrivial problems;
solves the stated functionalities Solution
problem that meet the optimize
desired needs desired needs
Innovation in  Basic concepts   Self-  New concepts 5
the Design used correctly Superficial study of new used frequently
Solution and  Lack self-study, usage of new concepts /  Self-study of
self-study but apply concepts technique, with new
previously taught  Self-study of good technique and
technique on a new understanding solve technical
satisfactory level technique,  Minor difficulties;
with basic innovative  Innovati
142
understanding Work ve work
with research
value
Self-motivation  Slow progress,  Slow  Good  Good 5
and project with barely progress, progress progress
management satisfactory result with basic  Need  Need
 Unresponsive to project reminder reminder
Supervisor outcome sometimes sometimes
 Rely on  Minor  Minor
supervisor‟s problems problems
push to work in project in project
management management
143
Table 8
Written Report Rubric for Project work-II Evaluation:
Project: ________________________________________
Name of Student: _________________________________
(0 – 2 Pts) (3 Pts) (4 Pts) (5 Pts)
Possible Earned
Content -Important points -Covers -All major -Major points 5
covered only important points strongly
superficially points covered and supported with
-No major errors -A few explained suitable detail
and inaccurate clearly and
misconception or irrelevant correctly
points
Writing -Frequent errors Some errors in -A few errors -Well proofread 5
in spelling and spelling and inspelling and -Clear and easy
grammar grammar grammar tounderstand
-Mostly Readable -Readable and -Graphs and
readable, but a Follow easy to diagrams used
few points are basic understand appropriately
hard to written
understand report
structure
144
Table 9
Final Presentation Rubric for Project work-II Evaluation
Project: ________________________________________
Name of Student: _________________________________
(0 – 2 Pts) (3 Pts) (4 Pts) (5 Pts)
Possible Earned
Content -Important points -Covers -All major -Major points 5
covered only important points strongly
superficially points covered and supported with
-No major errors -A few explained suitable detail
Andmisconception inaccurate or clearly and
irrelevant correctly
points
Presentation -Bare organization -Basic -Good -Excellent 5
Skills and preparation organization organization organization
-Lack of confidence and and preparation and preparation
and familiarity in preparation -Confident in Confident and
some parts of the -Confident in most parts of relaxed in the
presentation only some the presentation whole
parts of the Attractive to -presentation
presentation audience Engaging to
audience
Communication -Answer at least -Answer -Answer most -Handle 5
145
(Q/A) one questions most questions difficult
correctly questions correctly and questions with
-Need clarification correctly concisely ease and
-Need confidence
clarification -Illustrative
sometimes explanation
146

PG Cse PDF

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

PG Cse PDF

Caricato da

Copyright:

Formati disponibili

CURRICULUM

for the Academic year 2018 – 2019

DEPARTMENT OF COMPUTER SCIENCE AND

I - IV Semester M. Tech (CSE)

RAMAIAH INSTITUTE OF TECHNOLOGY

The Department of Computer Science and Engineering (CSE) has eminent

MISSION OF THE INSTITUTE

VISION OF THE DEPARTMENT

MISSION OF THE DEPARTMENT

An M.Tech (Computer Science & Engineering) graduate of M S Ramaiah

PEO1 Pursue a successful career in the field of Computer Science &

PROGRAM OUTCOMES (POs):

PO1: An ability to independently carry out research/investigation and

Course Outcomes (COs):

Course Outcomes (COs):

Experiments that are to be conducted as a part of the course:

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Internet of Things Laboratory:

Cloud Computing Laboratory

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Code: MCSE03 Credits: 4:0:0

Course Outcomes (COs):

At the end of the course, the students will be able to:

Course Outcomes (COs):

1. Paul Goransson, Chuck Black, and Timothy Culver:

1. Thomas D.Nadeau & Ken Gray: SDN Software Defined Networks

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

1. EMC Education Services, edited by Somasundaram G., Alok

1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage

Course Outcomes (COs):

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

Course Outcomes (COs):

1. Network Management: Principles and Practice, Mai Subramanian,

Course Outcomes (COs):

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

1. Identify five major functional areas of network management. (PO-

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

1. William Stallings, “Cryptography and Network security Principles

1. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

Course Outcomes (COs):

1. Srinivasa K G, Siddesh G.M and HanumanthaRaju R “Internet of

1. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-

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

1. Understand the basics of IoT.(PO1,3,4)

Course Code: MCSE23 Credits: 4:0:0

1. Paul C. Jorgensen: Software Testing, A Craftsman‟s Approach,

1. Aditya P Mathur:Foundations of Software Testing, 1stEdition,Pearson

Course Outcomes (COs):

1. Identify Test cases, Error and fault taxonomies, Levels of testing.