MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO PSO1 PSO2
10 11 12
CO1 1 1 - - - - - 1 1 1 - 1 - -
CO2 1 1 - - - - - 1 1 - - - - -
CO3 - 1 - - - - - 2 - 1 - 1 - -
CO4 - - - - - - - - - - - - - -
CO5 1 - - - - - - 2 1 1 - 1 - -
Average 0.6 0.6 - - - - - 1.2 0.6 0.6 - 0.6 - -

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔
 CSE GENDER INSTITUTION AND SOCIETY 2 0 0 0

Course Objective:
The course helps the student to understand concepts of social justice and gender justice. It provides the
student with the knowledge of various institutions functioning worldwide which aim to eradicate
discrimination against women. The course further aids students in understanding feminism and gender
in relation to the society and to study the basic constitutional remedies available to women.

UNIT – I
Social Justice and Gender Justice – Theories relating to Social Justice – Theories relating to Gender Justice
– Interrelationship between Gender justice and Social Justice

UNIT – II
International Conventions for protection of Women – Convention on the Elimination of All Forms of
Discrimination Against Women (CEDAW) – National Commission for women – Constitutional remedies
available for women under Indian Constitution.

UNIT – III
United Nations Entity for Gender Equality and the Empowerment of Women (UN Women) - Association
for Women’s Rights in Development (AWID) –Women kind worldwide – Centre for reproductive rights -
Women’s Environment and Development Organization (WEDO) - Global Fund for Women

UNIT – IV
International Center for Research on Women (ICRW) - European Institute for Gender Equality (EIGE) –
Promundo - International Alliance of Women (IAW) - International Women’s Development Agency
(IWDA).

UNIT – V
World Health organisation – Sex and Gender – Feminism – Theories relating to Feminism – Gender and
society

TEXT BOOKS
1. Law relating to Women and children, Mamta Rao
2. Gender, Politics and Institutions: Towards a Feminist Institutionalism, by Mona Lena krook and Fiano
Mackay,2010
3. Gender Justice and Feminist Jurisprudence, Dr.Sheetal Kanwal,2015
4. Narain’s Gender and society, P.Jain

REFERENCE BOOKS
1. Gender Justice and feminist Jurisprudence by Dr.Ishitha Chatterjee
2. Gender and Institutions, Moira Gatens and Alison Mackkinon
SUGGESTED READINGS:
1. Women and Gender : Society and Community , Siddhartha Sarkar

COURSE OUTCOMES:
After the completion of this Course, the student would be able to:
CO 1: Understand the Concept of Social Justice and Gender Justice.
CO 2: Learning the International Conventions and constitutional remedies available for women.
CO 3: Identify the various gender Institutions and its functions for the development of women.
CO 4: Assessing the International agencies.
CO 5: Summarising the study on feminism and relation of gender and society.
 CSE Java and Web Programming 3 0 0 3

Course Objectives

Will gain knowledge in the basic concepts of Data Analysis

⮚ To acquire skills in data preparatory and preprocessing steps
⮚ To understand the mathematical skills in statistics
⮚ To learn the tools and packages in Python for data science
⮚ To gain understanding in classification and Regression Model
⮚ To acquire knowledge in data interpretation and visualization techniques
⮚

UNIT I JAVA INTRODUCTION 9 Hours

Review of object oriented programming - Objects and classes in Java – Defining classes – Methods -
Access specifiers – static members – static fields - static methods - static variables – constructors - Default
constructor - parameterized constructor – finalize method – Arrays – Strings – Packages – user defined
packages – Java Doc comments

UNIT II OBJECT-ORIENTED PROGRAMMING IN JAVA 9 Hours

Inheritance – class hierarchy – polymorphism - Runtime polymorphism - compile time polymorphisms–

Encapsulation - static and dynamic binding – final keyword – abstract classes – the Object class: Method
of object class – java Reflection – interfaces – Properties of interfaces – object cloning – inner classes –
use of inner classes – proxies-Design Patterns in Java

UNIT III HTML,CSS CLIENT SIDE SCRIPTING 9 Hours

Understanding Internet - Understanding websites and web servers - HTML - – forms – frames – tables –
web page design – CSS - Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and
Objects,-Regular Expressions- JavaScript Events - Event Handling and Validation -Exception Handling-

UNIT IV SERVER SIDE PROGRAMMING 9 Hours

Understanding Java Server Pages-JSP Standard Tag Library(JSTL)-Creating HTML forms by embedding JSP
code- Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session
Handling- Understanding Cookies- Installing and Configuring Apache Tomcat Web Server;- DATABASE
CONNECTIVITY: JDBC perspectives, JDBC program example – JSP:.

UNIT V Web Applications development with Rest APIs 9 Hours

Rest API development with spring boot, Spring boot project with STS/MAVEN, Controller and Rest
Controller annotations, RequestBody, ResponseBody annotations, Error handling with spring boot

TOTAL : 45 Hours
Text Books:

T3: Herbert Schildt, “Java The complete reference”, 8th Edition, McGraw Hill Education, 2011.
T4: Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective", Pearson
Education, 2006.
Reference Books:

R3: Paul Deitel, Harvey Deitel, “Java SE 8 for programmers”, 3rd Edition, Pearson, 2015.
R4: Cay S. Horstmann, Gary cornell, “Core Java Volume –I Fundamentals”, 9th Edition,

Web Links:

1. https://onlinecourses.nptel.ac.in/noc22_cs47/preview

COURSE OUTCOMES

CO1: K2
Develop Java programs using OOP principles
CO2: K4
Develop Java programs with the concepts inheritance and interfaces
CO3: K3
Design simple web pages using markup languages like HTML and XHTML.
CO4: Program server side web pages that have to process request from client side web K4
pages.
CO5: K1
Understand various web services and how these web services interact..

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 3 2 - - - - - - - - 3
CO2 3 2 2 2 2 - - - - - - - - 3
CO3 3 2 3 2 2 - - - - - - - - 3
CO4 3 2 2 2 3 - - - - - - - - 3
CO5 2 2 3 2 3 - - - - - - - - 3
2.8 2 2.6 2.2 2.4 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams
√ √ √ √ √
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test
√ √ √ √ √

CSE COMPUTER GRAPHICS AND MULTIMEDIA 3 1 0 4

Course Objectives:
To comprehend the fundamental concepts of graphics and multimedia.
● To gain and apply the acquired knowledge pertaining to 2D and 3D concepts in graphics
● programming.
● To understand the basic 3D modeling and rendering techniques.
● To realize the importance of multimedia towards building the virtual environment and
●
communication.

UNIT I ILLUMINATION AND COLOR MODELS 12

Light sources - basic illumination models – halftone patterns and dithering techniques; Properties of light
- Standard primaries and chromaticity diagram; Intuitive colour concepts - RGB colour model - YIQ colour
model - CMY colour model - HSV colour model - HLS colour model; Colour selection. Output primitives –
points and lines, line drawing algorithms, loading the frame buffer, line function; circle and ellipse
generating algorithms; Pixel addressing and object geometry, filled area primitives.

UNIT II TWO-DIMENSIONAL GRAPHICS 12

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

UNIT III THREE-DIMENSIONAL GRAPHICS 12

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

UNIT IVMULTIMEDIA SYSTEM DESIGN & MULTIMEDIA FILE HANDLING 12

Multimedia basics − Multimedia applications − Multimedia system architecture − Evolving technologies
for multimedia − Defining objects for multimedia systems − Multimedia data interface standards −
Multimedia databases. Compression and decompression − Data and file format standards − Multimedia
I/O technologies − Digital voice and audio − Video image and animation − Full motion video − Storage and
retrieval technologies.

UNIT V HYPERMEDIA- CASE STUDIES 12

Multimedia authoring and user interface - Hypermedia messaging -Mobile messaging − Hypermedia
message component − Creating hypermedia message − Integrated multimedia message standards −
Integrated document management − Distributed multimedia systems.CASE STUDY: BLENDER GRAPHICS
Blender Fundamentals – Drawing Basic Shapes – Modelling – Shading & Textures
TEXT BOOKS:
T1. Donald Hearn and Pauline Baker M, ―Computer Graphics", Prentice Hall, New Delhi, 2007 [ UNIT I – III]
T2. Andleigh, P. K and Kiran Thakrar, ―Multimedia Systems and Design‖, PHI, 2003. [ UNIT IV,V ]

REFERENCES:
R1: Judith Jeffcoate, ―Multimedia in practice: Technology and Applications‖, PHI, 1998.
R2: Foley, Vandam, Feiner and Hughes, ―Computer Graphics: Principles and Practice, 2nd Edition, Pearson
Education, 2003.
R3: Jeffrey McConnell, ―Computer Graphics: Theory into Practice, Jones and Bartlett Publishers,2006.
R4: Hill F S Jr., "Computer Graphics", Maxwell Macmillan , 1990.
R5: Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, KelvinSung, and
AK Peters, ―Fundamentals of Computer Graphics, CRC Press, 2010.
R6: William M. Newman and Robert F.Sproull, ―Principles of Interactive Computer Graphics, Mc Graw Hill
1978. https://www.blender.org/support/tutorials/

Course Outcomes
CO 1: Design two-dimensional graphics.
CO 2: Apply two dimensional transformations.
CO 3: Apply three dimensional transformations and clipping techniques to graphics
CO 4: Understood Different types of Multimedia File Format
CO 5: Design Basic 3d Scenes using Blender

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO PO PO PO PO PO1 PO1 PO12 PSO PSO

5 6 7 8 9 0 1 1 2
CO1 3 2 2 2 3 2 3 3 2 2 2 1 2 1
CO2 3 2 3 2 2 3 3 1 3 2 3 2 3 3
CO3 2 3 2 2 2 2 2 3 2 3 2 3 2 3
CO4 2 3 2 2 3 2 3 3 2 2 3 3 3 3
CO5 2 3 3 3 3 3 3 3 3 3 3 3 3 3
Average 2.4 2.6 2.4 2.2 2.6 2.4 2.8 2.6 2.4 2.4 2.6 2.4 2.6 2.6

ASSESSMENT METHODS:
End Semester
CAT 1 CAT 2 Model Exam Assignments
Exams

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 CSE FUNDAMENTALS OF BLOCKCHAIN & USE CASES 3 0 0 3

Course Objectives

⮚ To understand a broad overview of the essential concepts of blockchain technology

⮚ To familiarize students with Bitcoin protocol followed by the Ethereum protocol – to lay the
foundation necessary for developing applications and programming
To learn about different types of blockchain and consensus algorithms
⮚

UNIT I Basics of Blockchain 9

The Double-Spend Problem, Byzantine Generals’ Computing Problems, Public-Key Cryptography, Hashing,
Distributed Systems, Distributed Consensus. Technology Stack: Blockchain, Protocol, Currency

UNIT II Bitcoin Blockchain and Ethereum Blockchain 9

Bitcoin Blockchain: Structure, Operations, Features, Consensus Model, Incentive Model.

Ethereum Blockchain: Smart Contracts, Ethereum Structure, Operations, Consensus Model, Incentive
Model.

UNIT III Tiers of Blockchain Technology 9

Blockchain 1.0, Blockchain 2.0, Blockchain 3.0, Types of Blockchain: Public Blockchain, Private Blockchain,
Semi-Private Blockchain, Sidechains.

UNIT IV Types of Consensus Algorithms 9

Proof of Stake, Proof of Work, Delegated Proof of Stake, Proof Elapsed Time, Deposite-Based Consensus,
Proof of Importance, Federated Consensus or Federated Byzantine Consensus, Practical Byzantine Fault
Tolerance. Blockchain Use Case: Supply Chain Management.

UNIT V Blockchain Use Cases 9

Industry applications of Blockchain-Blockchain in Government-Government use cases-Preventing

Cybercrime through block chain-Block Chain in defense, Financial Services Related Use Cases,
Revolutionization of Global Trade, Healthcare Related Services, Blockchain and IOT, Blockchain and AI.

TOTAL : -- 45 hours

Text Books:

T1: Mastering Blockchain: Deeper insights into decentralization, cryptography, Bitcoin, and popular
Blockchain frameworks by Imran Bashir, Packt Publishing (2017).
T2: Mastering Bitcoin: Unlocking Digital Cryptocurrencies, by Andreas Antonopoulos O’Reilly, First
Edition, 2014
Reference Books:

R1: Kirankalyan Kulkarni, Essentials of Bitcoin and Blockchain, Packt Publishing.

R2: Tiana Laurence, Blockchain for Dummies, 2nd Edition 2019, John Wiley & Sons.
R3: Blockchain: Blueprint for a New Economy by Melanie Swan, Shroff Publisher O’Reilly Publisher
Media; 1st edition (2015).

Web Links:

1. https://www.coursera.org/specializations/blockchain.
2. https://nptel.ac.in/courses/106105184/
3. https://swayam.gov.in/nd1_noc20_cs01/preview

COURSE OUTCOMES

CO1: Explain the basic notion of distributed systems & block chain technology stack K2

CO2: Analyze bitcoin and ethereum blockchain K4

CO3: Illustrate the essential tiers of a blockchain technology K2

CO4: Estimate the types of consensus algorithms K5

CO5: K3
Apply Blockchain in future use cases for security

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 2 - - - - - - - - 3
CO2 2 2 1 2 2 - - - - - - - - 3
CO3 3 3 3 2 2 - - - - - - - - 3
CO4 3 3 1 2 3 - - - - - - - - 3
CO5 3 2 3 2 3 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Assignments Case

Semester Studies
Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test
✔ ✔ ✔ ✔
 CSE JAVA AND WEB PROGRAMMING LAB 0 0 2 1

Course Objectives

⮚ To be familiar with Web page design using HTML/XML and style sheets
⮚ To learn to create dynamic web pages using server side scripting.
⮚ To be exposed to creating applications with AJAX
⮚ To be familiar in API development with Spring boot

Experiments:

1. Create a web page with HTML elements

2. Create a web page validating with Form Controls using DHTML
3. Create a web page with all types of Cascading style sheets.
4. Programs in Java using Servlets
5. Invoke servlets from HTML forms.
6. Three-tier applications using servlets, JSP and Databases.
7. Webservices -Consider a case where we have two web Services- an airline service and a travel
agent and the travel agent is searching for an airline. Implement this scenario using Web Services and
Data base.
8. Get API development with Spring boot
9. Post API development -saving the data in database
10. Updating data in database with Put API
11. Response code 200, 400, 500 with spring boot

TOTAL : 30 hours

COURSE OUTCOMES

CO1: K4
Design simple web pages using markup languages like HTML and XHTML.
Create dynamic web pages using DHTML and java script that is easy to navigate
CO2: K6
and use.

Program server side web pages that have to process request from client side web
CO3: K6
pages.

CO4: Represent web data using XML and develop web pages using JSP. K4

CO5: Create Webservices for client server applications K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO
5 2

CO1 3 2 2 2 2 3 2
- - - - - - -
CO2 2 2 2 2 2 3 3
- - - - - - -
CO3 2 2 2 2 2 2 2
- - - - - - -
CO4 2 2 3 3 2 3 2
- - - - - - -
CO5 2 3 2 3 3 1 3
- - - - - - -
AVG 2.2 2.2 2.2 2.4 2.2 2.4 2.4
- - - - - - -

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Observation

✔ ✔ ✔
Demonstration /
Record MCQ Projects Viva
Presentation

✔ ✔ ✔
 CSE Computer Graphics and Multimedia Lab 0 0 2 1

Course Objectives

To make the students understand graphics concepts and develop, design and implement two-
⮚
and three-dimensional graphical structures using OpenGL.
⮚ To understand multimedia compression techniques and applications of multimedia.

Experiments:

1. Study of Fundamental Graphics Functions.

2. Implementation of Line drawing algorithms: DDA Algorithm, Bresenham's Algorithm
3. Implementation of Circle drawing algorithms: Bresenham's Algorithm, Mid-Point Algorithm.
4. Programs on 2D and 3D transformations
5. Write a program to implement Cohen Sutherland line clipping algorithm
6. Write a program to draw Bezier curve.
7. Using Flash/Maya perform different operations (rotation, scaling move etc..) on objects
8. To perform animation using any Animation software (Create Frame by Frame
Animations using multimedia authoring tools)
9. To perform basic operations on image using any image editing software

TOTAL : --30 hours

COURSE OUTCOMES

CO1 Explain line drawing using programming language. K1

CO2 Explain 2D and 3D transformations K3

CO3 Demonstrate simple 2D animations using animation software. K4

CO4 Prepare simple scenes using image editing software. K1

CO5 Explain the linking between web and multimedia. K5

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 3 2 3 3 2 3 2 1 2 1

CO2 3 2 3 3 2 3 2 1 3 2 3 2 3 3

CO3 2 3 2 2 2 2 1 3 2 3 3 3 2 3

CO4 2 3 2 2 3 2 3 3 2 2 3 3 3 3

CO5 2 3 3 3 3 3 3 3 3 3 3 3 3 3

AVG 2.4 2.6 2.4 2.4 2.6 2.4 2.4 2.6 2.4 2.6 2.8 2.4 2.6 2.6

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Observation

✔ ✔ ✔
Demonstration /
Record MCQ Projects Viva
Presentation

✔ ✔ ✔
 CSE PERSONALITY DEVELOPMENT III 2 0 0 2

COURSE OBJECTIVE:
⮚ To enhance the communication, interpersonal, group skills.

UNIT I VERBAL APPTITUDE I 6

Phonetics / Neutral Accent / Pronunciation – Speech Mechanism / Mouth & Face Exercise – Vowels &
Consonants – Sounds – Syllable and Syllable Stress/ Word Stress – Sentence Stress & Intonation
Articulation Exercise – Rate of Speech / Flow of Speech / Idiomatic Phrases.

UNIT II VERBAL APTITUDE II 6

Singular/plural – present tense / past tense – genders Prepositions – conjunctions – Choice of words –
simple sentences – compound sentences – summarizing phrases Synonyms – Antonyms – Analogies –
Similar Words.

UNIT III SOFT SKILLS 6

Attitude – Meaning–Features of attitude – Formation – Personality Factors –Types of attitude – change

in attitude – developing Positive attitude.

UNIT IV TIME MANAGEMENT 6

Definition – Meaning–Importance, Value of time as an important resource – comparison of Time and

Money – Circle of influence and circle of control – Definition of URGENT and IMPORTANT – Time Wasters
and how to reduce – Procrastination – meaning and impact – 4 Quadrants.

UNIT V TEAM BUILDING 6

Meaning – Aspects of team building – Process of team building – Types of Teams – Team Ethics and
Understanding – Team trust and commitment.

TOTAL: 30 h

TEXT/REFERENCE BOOKS:

T1. B N Ghosh, Managing Soft Skills and Personality, Mc graw Hill Publications
T2. Shejwalkar and Ghanekar,Principles and Practices of Management,Mc Graw Hill Latest.
T3. Roberta Roesch ,Time management for Busy people, Tata McGraw–Hill Edition

REFERENCE BOOKS:
R1. D. P. Sabharwal, Personality Development Handbook, Fingerprint publishing, 2021
R2. Dr V M Selvaraj, Personality Development, Bhavani Publications
COURSE OUTCOMES

CO1: Articulate by understanding the rate and flow of speech. K3

CO2: Choose words and phrases appropriately for any verbal communication. K3

CO3: Develop a positive attitude in handling diverse situations. K4

CO4: Prioritize important and urgent tasks using the four quadrants method. K4

CO5: Practice team ethics and understanding when working with teams. K3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔ ✔

CSE .NET ENVIRONMENT 3 0 0 3

Course Objectives

To assist the learner to understand the .NET Architecture, Object oriented concepts, to use ADO.NET for
database connectivity and developing the ability to solve any type of problems by mapping with real world
environment using ASP.NET and C#.

⮚ Construct various applications using C# in .Net framework

⮚ Familiar about Object Oriented concepts in C# language
⮚ Demonstrate how to retrieve data from database using ADO.NET programming
⮚ Create web based and windows based applications using ASP.NET
⮚ Make the developer experience consistent across widely varying types of apps, such as Windows
based apps and Web-based apps.

UNIT I INTRODUCTION TO C# 9
Introducing C# - Introduction to .Net framework and Architecture - Understanding .NET-Overview of C#-
Literals Variables-Constant Variables – Scope of Variables – Boxing and Unboxing - Data Types- Operators-
Expressions Branching- Looping- Methods- Arrays- Strings- Structures- Enumerations.

UNIT II OBJECT ORIENTED ASPECTS OF C# 9

Classes-Adding Variables – Adding Methods - Objects – Accessing class Members – Constructors –
Abstract classes and Methods - Inheritance - Polymorphism – Interfaces - Operator Overloading -
Delegates and Events - Errors and Exceptions.

UNIT III ADO.NET 9

ADO.NET Introduction - ADO.NET Architecture : Connected and Disconnected Architecture – Data

Provider Connection Object, Command Object, Data Reader - Datasets : Data Table , Data Column , Data
Row , Data Constraints , Data Relation , Data Adapters

UNIT IV WEB BASED APPLICATION DEVELOPMENT ON .NET 9

Building Windows Forms Applications -Programming Web Applications with Web Forms using ASP.NET -
ASP.NET controls - Understand Data Binding and various Data Sources in ASP.NET - Understand the
creation of Master Pages and themes - Configuration of web applications using IIS configurations - State
management in ASP.NET Programming Web Services.

UNIT V MVC FRAMEWORK 9

MVC basics , MVC Architecture, Web forms vs MVC, Create a controller , Create models ,Create a view
,Add a service class ,Use dependency injection ,Finish the controller ,Update the layout

TOTAL:45 h

TEXT BOOKS:
T1: Balagurusamy. E, “Programming in C#”, Tata McGraw-Hill, 2004. (Unit I, II)
T2: Liberty.J, “Programming C#”, 2nd Edition., O’Reilly, 2002. (Unit III, IV, V)
T3: Bill Hamilton, Matthew MacDonald , “ ADO.NET in a Nutshell “ ,O'Reilly Media (Unit III)
T4: Jesse Liberty, Dan Maharry, Dan Hurwitz . “Programming ASP.NET 3.5” 4th Edition , O'Reilly Media
(Unit IV)
REFERENCES:
R1: Herbert Schildt, “The Complete Reference: C#”, Tata McGraw-Hill, 2004.
R2: Robinson et al, “Professional C#”, 2nd ed., Wrox Press, 2002.
R3: Andrew Troelsen, “C# and the .NET Platform”, A! Press, 2003.
R4: ThamaraiSelvi, R. Murugesan, “A Textbook on C#”, Pearson Education
R5: ADO.NET in a Nutshell By Bill Hamilton, Matthew MacDonald Publisher: O'Reilly Media.
R6: Programming ASP.NET 3.5, 4th Edition By Jesse Liberty, Dan Maharry, Dan HurwitzPublisher: O'Reilly
Media
Web Links:
W1: https://ict.iitk.ac.in/courses/introduction-to-c-sharp/
W2: https://www.btechguru.com/training--dot-net--c-sharp-dot-net--framework--c-sharp-
programming-tutorial-part-1-video-lecture--11285--27--139.html
COURSE OUTCOMES
At the end of this course the students will be able to,
CO1: Construct various applications using C# in .Net framework 1

CO2: Familiar about Object Oriented concepts in C# language 5

CO3: Demonstrate how to retrieve data from database using ADO.NET programming 3
CO4: Develop ASP.NET based web application using C# 2
CO5: Develop desktop based, modern web based applications using Model View Controller. 2

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 P PO5 PO6 PO7 PO PO9 PO PO PO PSO1 PSO2

O4 8 10 11 12
2 3 2 2 2 2 2 - - - - 2 1 2
CO1
3 2 2 2 2 3 2 - - - - 2 1 2
CO2
2 2 3 3 2 2 2 - - - - 2 3 2
CO3
2 3 2 2 2 3 2 - - - - 2 3 3
CO4
3 2 3 2 2 2 3 - -- - - 2 3 3
CO5
Average 2.4 2.4 2.4 2.2 2 2.4 2.2 - - - - 2 2.2 2.4

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 CSE THEORY OF COMPUTATION AND COMPILER DESIGN 3 0 0 3

Course Objectives

⮚ Provides the required theoretical foundation for a computational model and compiler design
Discuss Turing machines as an abstract computational model
⮚
⮚ Compiler algorithms focus more on low-level system aspects..

UNIT I INTRODUCTION TO LANGUAGES AND GRAMMAR 12hours

Overview of a computational model - Languages and grammars – alphabets – Strings – Operationson

languages, Introduction to Compilers - Analysis of the Source Program - Phases of a Compiler –Finite
automata– DFA – NFA – Equivalence of NFA and DFA (With Proof) – Regular expressions – Conversion
between RE and FA (With Proof) Lexical Analysis - Recognition of Tokens - Designing a Lexical
Analyzer using finite automata.

UNIT II CFG, PDAS AND TURING MACHINES 12hours

CFG – Chomsky Normal Forms - NPDA – DPDA - Membership algorithm for CFG. SyntaxAnalysis - Top-
Down Parsing - Bottom-Up Parsing - Operator-Precedence Parsing - LR Parsers -Turing Machines –
Recursive and recursively enumerable languages – Linear bounded automata -Chomsky's hierarchy –
Halting problem.

UNIT III INTERMEDIATE CODE GENERATION 12hours

Intermediate Code Generation - Intermediate Languages – Declarations - Assignment Statements -

Boolean Expressions - Case Statements – Backpatching - Procedure Calls.

UNIT IV CODE OPTIMIZATION 12 hours

Code Optimization - Basic Blocks and Flow Graphs – The DAG Representation of Basic Blocks -The
Principal Sources of Optimization - Optimization of Basic Blocks - Loops in Flow Graphs -Peephole
Optimization - Introduction to Global Data-Flow Analysis

UNIT V CODE GENERATION AND RUN TIME ENVIRONMENTS 12 hours

Code Generation – Issues in the Design of a Code Generator - The Target Machine - Run-Time Storage
Management - Next-Use Information - Register Allocation and Assignment - A Simple Code Generator -
Generating Code from DAG - Runtime Environments – Source Language issues – Storage Organization
– Activation Records- Storage Allocation strategies – Static Allocation – Stack Allocation – Heap
Allocation - Access to non-local names – Parameter Passing.
 TOTAL : -- 60 hours

Text Books:

1. Introduction to Automata Theory, Languages, and Computation (3rd Edition), John E Hopcroft, Rajeev
Motwani, Jeffery D. Ullman, Pearson education, 2013.

2. Principles of Compiler Design, Alferd V. Aho and Jeffery D. Ullman, Addison Wesley,2006

Reference Books:

1. Introduction to Languages and the Theory of Computation, John Martin, McGraw-Hill Higher
Education,2010

2. Modern Compiler Implementation in Java, 2nd ed., Andrew W. AppelCambrdige University Press,
2012

Web Links:

1. https://archive.nptel.ac.in/courses/106/105/106105183

2. https://nptel.ac.in/courses/106104148

COURSE OUTCOMES

Course Knowledge
Description
Outcome Level

Analysis to visualize languages and finite state machines and their

CO1 K4
equivalence.

Illustrate the translation of regular expression into parse tree using syntax
CO2 K2
analyzer

Construct the intermediate representation considering with the type

CO3 K6
systems

CO4 Learn to implement code optimization techniques K4

CO5 Design a sample code generator. K5

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 3 2 3 3 2 2 2 1 2 1

CO2 3 2 3 3 2 3 3 1 3 2 3 2 3 2
CO3 2 3 2 2 2 2 2 3 2 3 2 3 2 3

CO4 2 3 2 2 3 2 3 3 2 2 3 3 3 3

CO5 2 3 3 3 3 3 3 3 3 3 3 3 3 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
Course
Compiler Design lab 0 0 2 1
Code

Course Objectives

● To be familiar with Lexical Analyzer using Lex tool & parser using YACC Tool.
To learn to create front end of the compiler by means of generating Intermediate codes.
●
● To be familiar in code optimization techniques.
List of Experiments:

1. Implementation of Symbol Table.

2. Implementation of Lexical Analyzer using Lex Tool

3. Develop a Lexical Analyzer to Recognize a few patterns In C

4. Generate Yacc Specification for a few syntactic categories.

a) Program to recognize a valid variable which starts with a letter followed by any number of
letters or digits.

b) Program to recognize a valid variable which starts with a letter followed by any number of letter
or digits.

5. Implementation of calculator using Lex And Yacc

6. Implementation of Type Checking

7. Convert the BNF rules Into YACC Form and Write code to Generate Abstract Syntax Tree Using
and YACC.

8. Implement Control Flow Analysis and Data Flow Analysis

9. Implement any one Storage Allocation Strategies (Heap,Stack,Static)

10. Construction of DAG

11. Implementation of Simple Code Optimization Techniques

TOTAL : --30 hours

COURSE OUTCOMES

CO1: Design a compiler for a simple programming language K4

 CO2: Apply the knowledge of Lex tool & Yacc tool to develop a scanner & parser. K6

CO3: Implement Optimization techniques and generate machine level code K6

CO4: Understand the importance of code optimization K4

CO5: Develop program for implementing symbol table. K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 - - - - - - - 2 3 2

CO2 2 2 2 2 - - - - - - - 2 3 3

CO3 2 2 2 2 - - - - - - - 2 2 2

CO4 2 2 3 3 - - - - - - - 2 3 2

CO5 2 3 2 3 - - - - - - - 3 1 3

CAT 1 CAT 2 Model Exam End Semester Exams Observation

✔ ✔ ✔
Demonstration /
Record MCQ Projects Viva
Presentation

✔ ✔ ✔
 L T P Credits
CSE .NET ENVIRONMENT LABORATORY
0 0 2 1

LIST OF EXPERIMENTS

1. Implement C# program

a) Write a program in C# to count a total number of alphabets, digits and special characters in a
string.

b) Write a program in C# to count a total number of duplicate elements in an array.

c) Design program to implement Stack in c#.

2.Basic C# program

(a) Calculate Hypotenuse of triangle using dynamic initialization of variables

(b) To get input from the user and perform calculations

(c) Calculate the quadrant for the coordinates using if..else…ladder

(d) Check whether the alphabet is a vowel or not using switch..case…

(e) To understand about for..each loop and strings

3.Create a login page using controls.

4.Create a registration page with all controls.

5.Establish database connection using ado.net

6.Create a page with control values fetching from database

7.Create a master page for college application.

8.Apply themes and different CSS in a form.

9.Create a crud application

10. Create a web application with MVC framework

Text Books:

T5: Balagurusamy. E, “Programming in C#”, Tata McGraw-Hill, 2004.

T6: Liberty.J, “Programming C#”, 2nd Edition., O’Reilly, 2002.

Reference Books:
 R5: Herbert Schildt, “The Complete Reference: C#”, Tata McGraw-Hill, 2004.
R6: Robinson et al, “Professional C#”, 2nd ed., Wrox Press, 2002.
Web Links:

7. https://www.tutorialspoint.com/dot net/index.html
8. https://ict.iitk.ac.in/courses/introduction-to-c-sharp

Course Description Knowledge

Outcome Level
CO1 Understanding the basic concepts, and programs in C# K5

CO2 Establish database connection using ADO.Net K1

CO3 Create user interactive web pages using ASP.net K1

CO4 Applying themes and different CSS in a form K4

CO5 Performing database operations for windows and web applications using K3
MVC

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO 8 PO9 PO 10 PO 11 PO PSO1 PSO
12 2
2 3 2 2 - - - - - - - 2 2 2
CO1
2 2 2 2 - - - - - - - 2 3 2
CO2
3 3 2 3 - - - - - - - 2 1 2
CO3
2 2 2 2 - - - - - - - 2 2 2
CO4
2 2 2 3 - - - - - - - 3 2 3
CO5
Avera 2.2 2.4 2 2.4 - - - - - - - 2.2 2 2.2
ge

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Observation

✔ ✔ ✔
Demonstration /
Record MCQ Projects Viva
Presentation

✔ ✔ ✔
Course Objectives
⮚ Will gain knowledge in the basic concepts of Javascript
⮚ To acquire skills in frontend using Angular
⮚ To understand the concepts in NodeJS
⮚ To implement using ExpressJS
⮚ Create a web application with database

UNIT I Javascript - Introduction 9

H
o
ur
s
Purpose, architecture & debugging basics - Primitives & Non Primitives -Equality, Operators-
Logic and Control Structures - Objects and Functions -Call, Apply and Bind - Callbacks & Promises
- DOM handling - Error Handling - Array, String, Math, Date functions – Ajax -Browser storage
techniques, webworkers

UNIT II Angular Concepts 9

H
o
ur
s
Angular App-component, Custom components, ngFor, ngIf, ngClass, ngStyle, ngSwitch, Pipes,
HTTP client, Get Requests, Post requests

UNIT III Node 9

JS H
o
ur
s
Process Model - Callbacks & Events – Modules -Rest APIs-CLI application-Web sockets -File &
Stream operations-Promises-Important Node libraries-NPM framework

UNIT IV Ex 9
pr H
es o
 s ur
JS s
Rest APIs & Routing - Wriitng middlewares - Cookies & Session -Authentication and authorization
- Error routing-JWT-Mongoose - MongoDB ORM-Sequelize - SQL ORM

UNIT V MongoDB 9
H
o
ur
s
Installation & setup - Mongo queries and CRUD - Aggregation framework - Replication &
Sharding concepts

TOTAL : 45 Hours

CSE Full Stack Web Development 3 0 0 3

Text Books:

T1: Amos Q. Haviv, MEAN Web Development,2nd Revised edition,Packt Publishing

T2: Ethan Brown,Web Development with Node and Express,Oreilly

Reference Books:
R1: Colin J Ihrig , Adam Bretz Full Stack JavaScript Development With MEAN,FirstEdition

Web Links:

1. https://angular.io/
2. https://nodejs.org/en/
3. https://expressjs.com/
4. https://www.mongodb.com/
COURSE OUTCOMES

CO1: Understand Javascript principles K1

CO2: Develop Front end web page using Angular K5

CO3: Implement the web page using ExpressJS K4

CO4: Create backend application using NodeJS K6

CO5: Build a web application with MEAN K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 2 - - - - - - - 3 3
CO2 3 2 2 3 2 - - - - - - - 3 3
CO3 3 3 3 3 1 - - - - - - - 3 3
CO4 3 3 2 3 2 - - - - - - - 3 3
CO5 2 2 3 3 2 - - - - - - - 2 3
2.8 2.6 2.6 3 1.8 - - - - - - - 2.8 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams
√ √ √ √ √
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test
√ √ √ √ √ √
 Course
Full Stack Web Development Lab 0 0 3 1
Code

Course Objectives
To implement Forms, inputs and Services using Angular JS
● To develop a simple web application using Nodejs; Angular JS and Express
● To implement data models using Mongo DB
●
List of Experiments:

1. Develop a Form and validate using Angular JS

2. Create and implement modules and controllers in Angular JS
3. Implement Error Handling in Angular JS
4. Create and implement Custom directives
5.web socket implemetation
6. rest api with node
7. implementing call back and events and promises in nodejs
8. Create a simple web application using Express, Node JS and Angular JS
9. Implement CRUD operations using MVC architecture
10. Implement MongoDB data models
11.Create a Web application of your own

TOTAL : --30 hours

COURSE OUTCOMES

CO1: Design and Implement Forms, inputs and Services using Angular JS K3

CO2: Develop a simple web application using Nodejs; Angular JS and Express K4

CO3: Implementing call back and events and promises in nodejs K6

CO4: Implement CRUD operations using MVC architecture K4

CO5: Implement data models using Mongo DB K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO PO PO PO PO PO6 PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 4 5 7 8 9 0 1 2 1 2

CO1 2 1 3 1 3 - - - - - - 3 2 2

CO2 1 1 1 1 3 - - - - - - 1 1 1
CO3 3 3 3 3 3 - - - - - - 2 2 2

CO4 2 3 3 2 3 - - - - - - 2 3 2

CO5 3 2 2 1 1 - - - - - - 2 1 3

CAT 1 CAT 2 Model Exam End Semester Exams Observation

✔ ✔ ✔
Demonstration /
Record MCQ Projects Viva
Presentation

✔ ✔ ✔
 LIST OF ALL PROFESSIONAL ELECTIVE COURSES

CSE APPLIED CRYPTOGRAPHY 3 0 0 3

Course Objective:
 To understand the mathematical background for cryptography .
●
To understand the taxonomy of cryptography primitives
●
To understand the Symmetric key encryption system, public key encryption system
●
To implement cryptographic algorithms
●

UNIT I - INTRODUCTION 9
Cryptography goals – Taxonomy of cryptography primitives – Background on functions – Basic terminology – Definition
and examples – Block ciphers, stream cipher, substitution ciphers, transposition ciphers – Composition of ciphers –
Digital signature – Construction of digital signature – Public key cryptography – Hash functions – Protocol and
mechanism – Key establishment and management – Pseudo random numbers – Classes of attack.

UNIT II - NUMBER THEORY 9

Probability theory – Information theory – Complexity theory – Number theory – Abstract algebra – Finite fields –
Primality test – Prime number generation – Irreducible polynomial.

UNIT III - RANDOM GENERATORS 9

Pseudo random bits and sequences – Random bit generation – Pseudorandom bit generation – statistical tests –
Stream Cipher.

UNIT IV - ENCRYPTION ALGORITHMS 9

Block cipher – DES – FEAL – IDEA – SAFAR – Public key encryption – RSA – Rabin – Elgamal –Mc Eliece – Knapsack.

UNIT V - HASH ALGORITHMS 9

Hash function and data integrity – Classification and framework – Basic constructions and general results – Unkeyed
hash functions – Keyed hash functions – data integrity and message authentication – Advanced attacks and hash
function.

TOTAL: 45 h

TEXT BOOK :
1. A.Menezes, P.Van Oorschot and S. Vanstone, “Hand book of Applied Cryptography” CRC Press, Fifth
Printing, 2001.

REFERENCEBOOKS :
1. Charlie Kaufman, Radia Perlman, Mike Speciner, “ Network Security, Private communication in public world” PHI
2nd edition 2002.
2. Bruce Schneier, Neils Ferguson, “Practical Cryptography”, Wiley Dreamtech India Pvt Ltd, 2003
3. Douglas R Simson “Cryptography – Theory and practice”, CRC Press 1995. 3. Stallings, “Cry ptography& Network
Security”, Pearson Education, 4th Edition 2006.

Course Knowledge
Description
Outcome Level
 CO1 Understand the basics of cryptographic algorithms and protocols K3
Analyze the concept of Public key cryptography, Hash functions, Key establishment and
CO2 management K4

Acquire knowledge on encryption algorithms such as Block cipher, DES, FEAL, IDEA and
CO3 SAFAR K3

Evaluate the performance of Hash function, data integrity and message authentication
CO4 K5

Assess existing applications of cryptography and develop new protocols and applications that
CO5 K6
employ cryptography.

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 3 1 1 2 3 1 1 2 - 1 2 -

CO2 2 3 2 2 2 3 1 2 3 2 2 2 2 2

CO3 2 3 2 2 1 3 1 2 3 2 2 2 2 2

CO4 2 3 2 3 3 3 2 3 2 2 3 2 3 3

CO5 2 3 3 2 3 3 3 2 2 3 3 3 3 3

Average 2.2 2.8 2.4 2 2 2.8 2 2 2.2 2.2 2 2 2.4 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔

CSE Big Data Programming 3 0 0 3

Course Objectives

⮚ To explore the fundamental concepts of big data analytics, Hadoop, R programming and HiveQL
To learn big data analytics using R Programming
⮚

UNIT I Introduction to Big Data 9

Introduction to Big Data Platform – Challenges of Conventional Systems - Nature of Data- Evolution Of
Analytic Scalability - Intelligent data analysis- Analytic Processes and Tools - Analysis vs. Reporting -
Modern Data Analytic Tools - Statistical Concepts: Sampling Distributions - Re-Sampling - Statistical
Inference - Prediction Error

UNIT II Hadoop 9

History of Hadoop- The Hadoop Distributed File System – Components of Hadoop-Analyzing the Data with
Hadoop Scaling Out- Hadoop Streaming- Design of HDFS-Java interfaces to HDFS Basics- Developing a Map
Reduce Application-How Map Reduce Works-Anatomy of a Map Reduce Job run-Failures-Job Scheduling-
Shuffle and Sort – Task execution - Map Reduce Types and Formats- Map Reduce Features

UNIT III HiveQL 9

Introduction to HiveQL- Databases in Hive-HiveQL: Queries- SELECT … FROM Clauses , Specify Columns
with Regular Expressions , Computing with Column Values , Arithmetic Operators, Using Functions-
Mathematical functions, Aggregate functions, Table generating functions, Other built-in functions ,LIMIT
Clause ,Nested SELECT Statements, CASE … WHEN … THEN Statements, WHERE Clauses, Predicate
Operators, LIKE and RLIKE, GROUP BY Clauses , HAVING Clauses ,JOIN Statements -Inner JOIN ,LEFT OUTER
JOIN,RIGHT OUTER JOIN, FULL OUTER JOIN, Cartesian Product JOINs , Map-side Joins, ORDER BY and SORT
BY, DISTRIBUTE BY with SORT BY , CLUSTER BY

UNIT IV Big Data Analytics Using R Programming 9

Analyzing, Visualization and Exploring the Data, Statistics for Model Building and Evaluation, Introduction
to R and RStudio, Basic analysis in R, Intermediate R, Intermediate analysis in R, Advanced Analytics - K-
means clustering, Association rules-Speedup, Linear Regression, Logistic Regression, Naïve Bayes,
Decision Trees, Time Series Analysis, Text Analysis

UNIT V Frameworks 9

Applications on Big Data Using Pig and Hive – Data processing operators in Pig – Hive services –-
fundamentals of HBase and ZooKeeper - IBM InfoSphere BigInsights and Streams. Visualizations - Visual
data analysis techniques, interaction techniques; Systems and applications

TOTAL : -- 45 hours

Text Books:
T7: Prajapati, Big Data Analytics with R and Hadoop, 2014
T8: Stephan Kudyba, Big Data, Mining, and Analytics: Components of Strategic Decision Making, Auerbach
Publications, March 12, 2014 .
T9: Michael Minelli (Author), Michele Chambers (Author), Ambiga Dhiraj (Author) , Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses, Wiley Publications,2013
T10: Jason Rutherglen, Dean Wampler and Edward Capriolo, Programming Hive, O’REILLY, 2012
Reference Books:

R7: Michael Berthold, David J. Hand, ―Intelligent Data Analysis‖, Springer, 2007.
R8: Tom White ― Hadoop: The Definitive Guide‖ Third Edition, O‘reilly Media, 2012.
R9: Chris Eaton, Dirk De Roos, Tom Deutsch, George Lapis, Paul Zikopoulos, ―Understanding Big Data:
Analytics for Enterprise Class Hadoop and Streaming Data‖, McGraw Hill Publishing, 2012
R10: Anand Rajaraman and Jeffrey David Ullman, ―Mining of Massive Datasets, Cambridge University Press,
2012.
R11: Bill Franks, ―Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced
Analytics, JohnWiley& sons, 2012.
R12: Glenn J. Myatt, ―Making Sense of Data, John Wiley & Sons, 2007
R13: Dr. Mark Gardener, Beginning R: The Statistical Programming Language (Wrox), 2013
R14: PeteWarden, ―Big Data Glossary, O‘Reilly, 2011.
R15: Jiawei Han, MichelineKamber ―Data Mining Concepts and Techniques, Second Edition, Elsevier,
Reprinted 2008.
R16: Da Ruan,Guoquing Chen, Etienne E.Kerre, GeertWets, Intelligent Data Mining, Springer,2007
R17: Paul Zikopoulos ,Dirk deRoos , Krishnan Parasuraman , Thomas Deutsch , James Giles , David Corrigan ,
Harness the Power of Big Data The IBM Big Data Platform, Tata McGraw Hill Publications, 2012.
R18: Michael Minelli (Author), Michele Chambers (Author), AmbigaDhiraj (Author) , Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses,Wiley Publications,2013
R19: Zikopoulos, Paul, Chris Eaton, Understanding Big Data: Analytics for Enterprise Class Hadoop and
Streaming Data, Tata McGraw Hill Publications, 2011

COURSE OUTCOMES

CO1: Identify the purpose and need of big data programming and compare it with
K3
conventional systems.
CO2: Examine and compare various Components of Hadoop and develop a Map Reduce
K4
application.
CO3:
Develop Hive queries using HiveQL interface. K3
CO4: Discuss various statistics modeling techniques and its evaluation using R and other
K6
clustering methods.
Discuss various big data frameworks, Applications on Big Data Using Pig,
CO5:
fundamentals HBASE, Zookeeper, IBM Info Sphere Big Insights and also test Visual K6
data analysis techniques

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 3 2 - - - - - - - - 3

CO2 3 2 2 2 2 - - - - - - - - 3

CO3 3 3 3 2 2 - - - - - - - - 3

CO4 2 3 2 2 3 - - - - - - - - 3

CO5 2 2 3 2 3 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 CSE Bioinformatics 3 0 0 3

Course Objectives

⮚ To study the scope of Bioinformatics, types of Databases and their uses, Tools and Algorithms
To learn the Pair wise Sequence Alignment methods
⮚
UNIT I Bioinformatics: An Introduction 9

Introduction-Historical Overview and Definition- Bioinformatics Applications - Major Databases in

Bioinformatics- Data Management and Analysis- Molecular Biology and Bioinformatics- Central Dogma of
Molecular Biology

UNIT II Databases 9

Introduction- Characteristics of Bioinformatics Databases- Categories of Bioinformatics Databases-

Navigating databases- Sequence Databases-Nucleotide sequence database- secondary Nucleotide
sequence database – protein sequence databases- structure databases- Structure file formats- Protein
Structure Database Collaboration- PDB- CATH –SCOP- Other databases- Enzyme Databases- MEROPS-
Pathway Databases:CAZy

UNIT III Tools 9

Introduction- Need for Tools- Knowledge Discovery- Data- Mining Tools- Data Submission tools-
Nucleotide Sequence Submission and Protein Submission tools- Data Analysis tools- Prediction Tools-
Phylogenetic trees and Phylogenetic Analysis- Modelling Tools

UNIT IV Algorithms 9

Introduction- Classification of Algorithms- Biological Algorithms- Implementing Algorithms- Biological

Algorithms- Bioinformatics Tasks and Corresponding Algorithms- Data Analysis Algorithms- Sequence
Comparison Algorithms – Substitution Matrices Algorithms –Sequence Alignment Optimal Algorithms-
Prediction Algorithms- Phylogenetic prediction Algorithm – Protein Structure Prediction

UNIT V Genome Analysis and Sequence Alignment 9

Introduction- Genome Analysis- Genome mapping- The Sequence Assembly Problem- Genome
Sequencing- Biological Motivation of Alignment Problems Methods of Sequence Alignments- Using
Scoring matrices- Measuring Sequence Detection Efficiency- Working with FASTA and BLAST

TOTAL : -- 45 hours

Text Books:

T11: OrpitaBosu, Simminder KaurThukral , “Bioinformatics: Database, Tools, Algorithms”, Oxford University
Press, Chennai, 2007. (Part B---Unit-II, Part C---Unit-III, Part D---Unit-IV)
T12: Rastogi S. C., Namita Mendiratta, Parag Rastogi, “Bioinformatics: Methods and Applications: Genomics,
Proteomics and Drug Discovery”, Third Edition, PHI Learning Pvt. Ltd., New Delhi, 2011. (Chapter-1---Unit-I,
Chapter 3,4 and 6--Unit-V)
Reference Books:

R20: Bryan Bergeron, “Bioinformatics computing”, PHI Learning Pvt. Ltd, New Delhi, 2010.
R21: Rastogi S.C., Namita Mendiratta, Parag Rastogi, “Bioinformatics: Concepts”, Skills & Applications, Second
Edition, CBS Publishers & Distributors Pvt. Ltd, 2009
R22: Arthur M. Lesk, “Introduction to Bioinformatics”, Third Edition, Oxford University Press, Chennai, 2010
R23: Gautham N., “Bioinformatics: Databases and Algorithms”, alpha Science 2006

Web Links:

1. http://staff.aub.edu.lb/~webbic/nemer/index.html
2. http://bip.weizmann.ac.il/education/course/introbioinfo/04/lect1/introbi oinfo04/index.html
3. http://engineeringppt.net/algorithms-in-bioinformatics-pdf-lecture- notes/

COURSE OUTCOMES

CO1:
Comprehend the data management and analysis of Bio Informatics K3
CO2:
Understand the Structure Database Collaboration like PDB, CATH, SCOP K3
CO3:
Analyze the various Tools for data mining, submission and prediction K4
CO4:
Implement the Classification of Algorithms and prediction of protein structure K6
CO5:
Measure sequence detection efficiency in bioinformatics K5

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 2 - - - - - - - - 3

CO2 3 2 2 2 2 - - - - - - - - 3

CO3 3 3 3 2 2 - - - - - - - - 3

CO4 2 3 2 2 3 - - - - - - - - 3

CO5 2 2 3 2 3 - - - - - - - - 3

ASSESSMENT METHODS:
CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies
Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE01 CLOUD COMPUTING 3 0 0 3

Course Objectives

⮚ To understand the concept of cloud and utility computing.

⮚ To understand the various issues in cloud computing.

To familiarize with the types of virtualization and the lead players in cloud.
⮚

UNIT I INTRODUCTION, PRINCIPLES AND ARCHITECTURE 9

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

UNIT II VIRTUALIZATION 9

Characteristics of virtualized environments - Taxonomy of virtualization techniques - Execution

virtualization -Machine reference model - Hardware-level virtualization – Hypervisors - Hardware
virtualization techniques -Operating system-level virtualization - Programming 210 language-level
virtualization - Application-level virtualization - Other types - Virtualization and cloud computing - Pros
and cons of virtualization - Technology examples - Xen: Paravirtualization - VMware: full virtualization -
Full virtualization and binary translation - Microsoft Hyper-V.

UNIT III CLOUD INFRASTRUCTURE 9

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

UNIT IV CLOUD PROGRAMMING AND SOFTWARE ENVIRONMENT 9

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

UNIT V CLOUD PLATFORMS AND APPLICATION 9

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

TOTAL : 45 hours

Text Books:

T1: Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud

Computing, From Parallel Processing to the Internet of Things”, Morgan Kaufmann Publishers, 2012.

T2: Rajkumar Buyya, Christian Vecchiola. S.Thamarai Selvi, “Mastering Cloud

Computing”, McGraw Hill Education, 2013.

Reference Books:

R24: James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for

Systems and Processes”, Elsevier/Morgan Kaufmann, 2005.

R25: George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in the
Cloud” O'Reilly.

R26: Ronald L. Krutz, Russell Dean Vines, “Cloud Security – A comprehensive Guide to Secure Cloud
Computing”, Wiley – India, 2010.

R27: John W.Rittinghouse and James F.Ransome, “Cloud Computing: Implementation,

Management, and Security”, CRC Press, 2010.

Web Links:

9. https://onlinecourses.nptel.ac.in/noc22_cs20/preview.

10. https://www.w3schools.in/cloud-computing.

COURSE OUTCOMES

Understand the broad perspective of cloud architecture, key technologies, principles,

CO1: strengths, limitations as well as the possible applications of the state-of-art of cloud K2, K3
computing.

Gain a basic knowledge of virtualization and its categorization and Design & develop
CO2: K3, K6
highly scalable cloud-based applications by creating and configuring virtual machines.

Compare, contrast, and evaluate the key trade-offs between multiple approaches to
CO3: cloud system design, and Identify appropriate design choices when solving real - world K4
cloud computing problems.
 Interpret some important cloud computing driven commercial systems such as: Google
CO4: Apps, Microsoft Azure and Amazon Web Services and other businesses cloud K5
applications.

CO5: Build and deploy cloud application using popular cloud platforms. K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 3 0 3 - - - - - - - - 3

CO2 3 2 2 3 2 - - - - - - - - 3

CO3 3 2 3 3 3 - - - - - - - - 3

CO4 2 2 2 3 0 - - - - - - - - 3

CO5 0 2 3 3 3 - - - - - - - - 3

2.2 2 2.6 2.4 2.2 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔
OCSE01 CRYTOGRAPHY AND NETWORK SECURITY 3 0 0 3

Course Objectives
To understand the fundamental principles, algorithms of cryptographic techniques and expose
⮚
them to various scenarios of cyber crime with an introduction to cyber law along with a thrust on
security on the internet
To develop an understanding of information assurance as practiced in computer operating
⮚
systems, distributed systems, networks and representative applications.

UNIT I INTRODUCTION 9 hours

OSI Security Architecture - Classical Encryption techniques – Cipher Principles – Data Encryption
Standard – The strength of DES - Block Cipher Design Principles and Modes of Operation - Evaluation
criteria for AES – AES Cipher – Multiple Encryption and Triple DES – Placement of Encryption Function –
Traffic Confidentiality – Key distribution – Random Number Generation

UNIT II PUBLIC KEY CRYPTOGRAPHY 9 hours

Key Management - Diffie- Hellman key Exchange – Elliptic Curve Arithmetic - Elliptic Curve Cryptography
- Introduction to Number Theory – Confidentiality using Symmetric Encryption – Public Key
Cryptography/RSA

UNIT III AUTHENTICATION AND HASH FUNCTION 9 hours

Authentication requirements – Authentication functions – Message Authentication Codes – Hash
Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash
Algorithm – RIPEMD – HMAC Digital Signatures – CMAC Digital Signatures - Digital Signatures -
Authentication Protocols – Digital Signature Standard.
UNIT IV NETWORK SECURITY 9 hours
Authentication Applications: Kerberos – X.509 Authentication Service – Electronic Mail Security: Pretty
good privacy, S/MIME – IP Security – Web Security: Web security considerations, Secure socket layer and
Transport layer Security – Authentication Header – Encapsulating Security Payload – Combining Security
Associations – Key Management.
UNIT V SYSTEM LEVEL SECURITY 9 hours
Intruders: Intrusion detection – password management – Malicious software: Viruses and related Threats,
Virus Counter measures, Distributed Denial of Service Attacks – Firewalls: Firewall Design Principles,
Trusted Systems, Common Criteria for Information Technology Security Evaluation – Internet standards
and internet security.
TOTAL : 45 hours

Text Books:
T1 William Stallings, “Cryptography and Network Security – Principles and Practices”, Prentice Hall of India,
Third Edition, 2003.

T2 Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2013

Reference Books:

R1 Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.

R2 Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third Edition, Pearson education

Web Links:
1. https://www.tutorialspoint.com/cryptography/index.html
2. https://onlinecourses.nptel.ac.in/noc21_cs16/preview

COURSE OUTCOMES

CO1: Understand OSI security architecture and the design principles of Block cipher K3

CO2: Acquire knowledge on block cipher modes of operation K3

CO3: Describe key management in public key cryptography K5

CO4: Implement the Hash Functions and Authentication Protocols K6

CO5: Analyze the Electronic Mail Security and IP Security K4

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 2 3 - 3 - - - - - - - 2 2

CO2 3 3 2 3 2 - - - - - - - 3 3

CO3 3 2 3 3 3 - - - - - - - 3 2

CO4 2 2 2 3 - - - - - - - - 2 1

CO5 - 2 3 3 3 - - - - - - - 2 3

Aver 2.2 2.2 2.6 2.4 2.2 - - - - - - - 2.4 2.2

age

ASSESSMENT METHODS:
 CAT 1 CAT 2 Model Exam End Assignments Case
Semester Studies
Exams

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test

CSE CYBER FORENSICS 3 0 0 3

Course Objective:

• To understand the fundamentals of Computer Forensics and computing Investigations.

• To recognize the legal underpinnings and critical laws affecting forensics
• To apply the tools and methods to uncover hidden information in digital systems.
• To learn about current licensing and certification requirements to build the career in digital forensic.
UNIT I INTRODUCTION 9
The Scope of Computer Forensics - Windows Operating and File Systems –Handling Computer Hardware
– Anatomy of Digital Investigation.

UNIT II INVESTIGATIVE SMART PRACTICES 9

Forensics Investigative Smart Practices – Time and Forensics – Incident closure

UNIT III LAWS AND PRIVACY CONCERNS 9

Laws Affecting Forensic Investigations – Search Warrants and Subpoenas – Legislated Privacy Concerns –
The admissibility of Evidence – First Response and Digital Investigator

UNIT IV DATA ACQUISITION AND REPORT WRITING 9

Data Acquisition – Finding Lost Files – Document Analysis – Case Management and Report Writing –
Building a Forensics Workstation

UNIT V TOOLS AND CASE STUDIES 9

Tools of the Digital Investigator - Licensing and Certification – Case Studies: E-mail Forensics – Web
Forensics – Searching the Network – Excavating a Cloud – Mobile device Forensics.

TOTAL: 45 h
TEXT BOOKS:

1. Michael Graves, ―Digital Archaeology: The Art and Science of Digital Forensics, Addison-Wesley
Professional, 2014.

2. Darren R. Hayes, ―Practical Guide to Computer Forensics Investigation, Pearson, 2015.

3. Albert J. Marcella and Frederic Guillossou, ―Cyber Forensics: From Data to Digital Evidence ―, Wiley,
2015.

REFERENCE BOOK:

1. Bill Nelson, Amelia Phillips and Christopher Steuart, ―Guide to Computer Forensics and Investigations‖,
Fourth Edition, Cengage, 2013.

Web Links:
https://nptel.ac.in/courses/106106129
https://www.techtarget.com/searchsecurity/definition/computer-forensics

COURSE OUTCOMES:
At the end of this course the students will be able to,
Course Knowledge
Description
Outcome Level
CO1 Acquire knowledge on Forensic Investigative smart practices. K3

Analyze the importance and need for smart practices in computer

CO2 K4
investigation.

Analyze the ethical standards of the profession and apply those

CO3 K4
standards to all aspects of the study and practice of digital forensics.

Evaluate the effectiveness of available digital forensics tools and use

CO4 them in a way that optimizes the efficiency and quality of digital K5
forensics investigations.

CO5 Describe web and mobile device forensics. K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 3 3 3 2 2 0 3 2 2 2 2 3 2
CO2 3 3 3 3 2 2 0 3 2 2 2 2 3 2
CO3 3 3 3 3 2 2 1 3 2 2 2 2 3 2
CO4 3 3 3 3 2 2 0 3 2 2 2 2 3 2
CO5 2 3 3 3 2 2 1 3 2 2 2 2 3 2
Averag 2.8 3 3 3 2 2 0.4 3 2 2 2 2 3 2
e

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔

CSE DATA WAREHOUSING AND DATA MINING 3 0 0 3

Course Objective:
To introduce the concept of data warehousing with special emphasis on architecture and design.
✔
To introduce the concept of data mining with a detail coverage of basic tasks, metrics, issues,
✔
andimplication.
To learn the core topics like classification, clustering and association rules.
✔
UNIT I DATA WAREHOUSING 9
Data warehousing Components:Data Warehouse Database, Sourcing, Acquisition, Cleanup and
TransformationTool,Data Warehouse Administration and Management, Information Delivery System –
Building a Data warehouse –- Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS
Schemas for Decision Support – Data Extraction, Cleanup, and Transformation Tools –Metadata.
UNIT II BUSINESS ANALYSIS 9
Reporting and Query tools and Applications – Tool Categories – The Need forApplications – Cognos
Impromptu Online Analytical Processing (OLAP) – Need –Multidimensional Data Model – OLAP Guidelines
–Multidimensional versusMultirelational OLAP – Categories of Tools – OLAP Tools and the Internet -Data
CubeTechnology, From Data warehousing to Data Mining.
UNIT III DATA MINING 9
Introduction – Data – Types of Data – Data Mining Functionalities – Interestingness ofPatterns –
Classification ofData Mining Systems- comparison of classification and prediction methods – Data Mining
Task Primitives –Integration of a Data Mining System with a Data Warehouse – Issues –
DataPreprocessing.-, Mining Descriptive
Statistical Measures in Large Databases.
UNIT IV ASSOCIATION RULE MINING AND CLASSIFICATION 9
Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining various Kinds of
Association Rules – Correlation Analysis – Constraint BasedAssociation Mining – Classification and
Prediction - BasicConcepts - Decision TreeInduction - Bayesian Classification – Rule Based Classification –
ClassificationByBackpropagation – Support Vector Machines – Associative Classification – LazyLearners –
Other Classification
Methods – Prediction
UNIT V CLUSTERING, APPLICATIONS AND TRENDS IN DATA MINING 9
Cluster Analysis - Types of Data – Categorization of Major Clustering Methods – K-means– Partitioning
Methods –Hierarchical Methods - Density-Based Methods –GridBased Methods – Model-Based Clustering
Methods –Clustering High Dimensional Data- Constraint – Based Cluster Analysis – Outlier Analysis – Data
Mining Applications.- Case Study.
TOTAL:45 h

TEXT BOOKS:
1. Alex Berson and Stephen J. Smith, “ Data Warehousing, Data Mining & OLAP”, TataMcGraw – Hill
Edition,Tenth Reprint 2007.(I & II)
2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, SecondEdition, Elsevier,
2007.(IIIto V)
REFERENCES:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction To Data Mining”,Person Education,
2007.
2. K.P. Soman, Shyam Diwakar and V. Ajay “, Insight into Data mining Theory andPractice”, Easter
EconomyEdition, Prentice Hall of India, 2006.
3. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Easter EconomyEdition, Prentice Hall of
India,2006.
4. Daniel T.Larose, “Data Mining Methods and Models”, Wile-Interscience, 2006.

Web Links:

W1:https://onlinecourses.nptel.ac.in/noc21_cs06/preview

Course Outcomes

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

Course Knowledge
Description
Outcome Level

CO1 Apply the basic concepts of DBMS with datawarehousing and datamining K3
CO2 Identify the datawarehouse components to build a data warehouse. K3

CO3 Explain the functionalities and classifications of data mining systems K5

CO5 Identify the issues and understand the integration of a data mining system K3
with a datawarehouse

CO5 Explain cluster analysis, outlier analysis and data mining applications K5

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 2 1 1 2 2 2 2 3 2
CO2 2 3 3 3 3 2 1 1 2 2 2 2 3 2
CO3 3 3 3 3 3 2 1 1 2 2 2 2 3 2
CO4 3 3 3 3 3 2 1 1 2 2 2 2 3 2
CO5 2 3 3 3 3 2 1 1 2 2 2 2 3 2
2.6 3 3 3 3 2 1 1 2 2 2 2 3 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 OCSE01 E COMMERCE 3 0 0 3

Course Objectives

To understand the nature of e-Commerce and recognize the business impact and potential of e-
⮚
Commerce
To learn the technologies required to make e-Commerce viable.
⮚ To know about the current drivers and inhibitors facing the business world in adopting and
⮚
using e-Commerce

UNIT I Introduction 9

Traditional commerce and Ecommerce - Categories of Electronic commerce – Business models – Revenue
models – Business processes. Internet and WWW–role of WWW–value chains–strategic business –
Revenue Strategy issues – Industry value chains - supply chain management–role of Ecommerce

UNIT II Infrastructure for E-Commerce 9

Packet switched networks–Routing packets. TCP/IP protocol script: IP Addressing – Domain names – E-
mail protocols. Internet utility programs–SGML,HTML and XML–web client and servers–Web client/server
architecture– intranet and extranets – Public and private networks – Virtual private network

UNIT III Web Based Tools for E-Commerce 9

Web server: Server computers –performance evaluation – Hardware architectures. Web server software
feature sets–web server software and tools– Internet Utility programs – Data analysis software – Link
checking utilities. web protocol–search engines–intelligent agents –EC software– webhosting–cost
analysis
UNIT IV Security 9

Computer security classification–copyright and Intellectual property–electronic commerce threats:

Secrecy threats – Integrity threats – Necessity threats Encryption solutions. Protecting client computers–
electronic payment systems– electronic cash–strategies for marketing–sales and promotion–
cryptography – authentication

UNIT V Intelligent Agents 9

Definition and capabilities–limitation of agents – History of software agents – Characteristics and

properties a of agents – Tele script Agent Language – safe-Tcl –security–web based marketing– search
engines and Directory registration–online advertisements– Portables and info mechanics–website design
issues.

TOTAL : -- 45 hours

Text Books:

T1 Ravi Kalakota, Andrew B. Whinston “ Frontiers of Electronic Commerce”,Pearson Education, 2008

T2 Gary PSchneider “Electronic commerce”, Thomson learning & James TPeny Cambridge USA, 2001
T3 Manlyn Greenstein and Miklos “Electronic commerce” McGraw-Hill, 2002.
Reference Books:

R1 Efraim TurvanJ.Lee, David Kug and Chung,“Electronic Commerce” Pearson EducationAsia2001.

R2 Brenda Kienew Ecommerce Business Prentice Hall,2001.
COURSE OUTCOMES

CO1: K3
Construct the implement various business models of E-Commerce
CO2: K4
Develop a policy and regulatory issues in E-commerce
CO3: K5
Evaluate the basic networking concepts
CO4: K3
Make use of the web client server architecture
CO5: Develop and acquire knowledge on web server concepts and its performance K6
evaluation
MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 2 - - - - - - - - 3

CO2 3 2 2 2 2 - - - - - - - - 3

CO3 3 3 3 2 2 - - - - - - - - 3
CO4 2 3 2 2 3 - - - - - - - - 3

CO5 3 2 3 2 3 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔

CSE ETHICAL HACKING 3 0 0 3

Course Objectives
To understand how intruders escalate privileges.
⮚ To understand Intrusion Detection, Policy Creation, Social Engineering, Buffer Overflows and
⮚
different types of Attacks and their protection mechanisms
⮚ To learn about ethical laws and tests

UNIT I Ethical Hacking 9 hours

Types of Data Stolen From the Organizations, Elements of Information Security, Authenticity and Non-
Repudiation, Security Challenges, Effects of Hacking, Hacker – Types of Hacker, Ethical Hacker, Hacktivism
- Role of Security and Penetration Tester, Penetration Testing Methodology, Networking & Computer
Attacks – Malicious Software (Malware), Protection Against Malware, Intruder Attacks on Networks and
Computers, Addressing Physical Security – Key Loggers and Back Doors

UNIT II Foot Printing and Social Engineering 9 hours

Web Tools for Foot Printing, Conducting Competitive Intelligence, Google Hacking, Scanning,
Enumeration, Trojans & Backdoors, Virus & Worms, Proxy & Packet Filtering, Denial of Service, Sniffer,
Social Engineering – shoulder surfing, Dumpster Diving, Piggybacking
UNIT III Data Security 9 hours
Physical Security – Attacks and Protection, Steganography – Methods, Attacks and Measures,
Cryptography – Methods and Types of Attacks, Wireless Hacking, Windows Hacking, Linux Hacking

UNIT IV Network Protection System & Hacking Web Servers 9 hours

Routers, Firewall & Honeypots, IDS & IPS, Web Filtering, Vulnerability, Penetration Testing, Session
Hijacking, Web Server, SQL Injection, Cross Site Scripting, Exploit Writing, Buffer Overflow, Reverse
Engineering, Email Hacking, Incident Handling & Response, Bluetooth Hacking, Mobiles Phone Hacking

UNIT V Ethical Hacking Laws and Tests 9 hours

An introduction to the particular legal, professional and ethical issues likely to face the domain of ethical
hacking, ethical responsibilities, professional integrity and making appropriate use of the tools and
techniques associated with ethical hacking – Social Engineering, Host Reconnaissance, Session Hijacking,
Hacking - Web Server, Database, Password Cracking, Network and Wireless, Trojan, Backdoor, UNIX,
LINUX, Microsoft, NOVEL Server, Buffer Overflow, Denial of Service Attack, Methodical Penetration
Testing

TOTAL : 45 hours

TEXT BOOKS:

T1: Michael T. Simpson, Kent Backman, James E. “Corley, Hands‐On Ethical Hacking and Network Defense”,
Second Edition, CENGAGE Learning, 2010.
REFERENCE BOOKS:

R1: Steven DeFino, Barry Kaufman, Nick Valenteen, “Official Certified Ethical Hacker Review Guide”,
CENGAGE Learning, 2009-11-01.
R2: Patrick Engebretson, “The Basics of Hacking and Penetration Testing: Ethical Hacking and Penetration
Testing Made Easy”, Syngress Basics Series – Elsevier, August 4, 2011.
R3: Whitaker & Newman, “ Penetration Testing and Network Defense” , Cisco Press, Indianapolis, IN, 2006

COURSE OUTCOMES

CO1: Utilize the basics of ethical hacking, elements of Information Security, authenticity,
K3
non-repudiation and security challenges
CO2: Develop a acquire knowledge on Malicious Software (Malware), Protection Against
K4
Malware and Intruder Attacks on Computers
CO3: Evaluate the web tools for Foot Printing, Competitive Intelligence and Google
K5
Hacking.
CO4: Determine Proxy & Packet Filtering, Denial of Service, Sniffer, Social Engineering
K5
and shoulder surfing
CO5:
Develop Analyze Attacks and enhance Physical Security, and Protection K6
MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 4 5 6 7 8 9 0 1 2 1 2

CO 3 3 3 3 2 - - - - - - - - 3
1

CO 2 2 2 2 2 - - - - - - - - 3
2

CO 3 3 3 2 2 - - - - - - - - 3
3

CO 2 3 2 2 3 - - - - - - - - 3
4

CO 2 2 3 2 3 - - - - - - - - 3
5

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test
 CSE GAME PROGRAMMING 3 0 0 3

Course Objectives

To provide an in-depth introduction to technologies and techniques currently used in the game
⮚
industry
⮚ To understand game design and development
⮚ To understand the processes, mechanics, issues in game design, and game engine development
To understand modeling, techniques, handling situations, and logic
⮚ To build and then integrate technologies such as multimedia, artificial intelligence, and physics
⮚
modeling into a cohesive, interactive game application.

UNIT I Introduction to Game Programming & Game engine architecture 9

Overview of game programming -Structure of a typical game team - game industry - game engine history
-Real Time Game Architecture - Engine Support: Subsystem Start-Up and Shut-Down - Memory
Management - Containers and Strings - Resource Management: File System, Resource Manager.

UNIT II Basics of 2D & 3D Graphics and Mathematics in Gaming & Rendering engine 9
2D Graphics: Sprites, Tiled Images and Backgrounds - 3D Graphics: 3D Graphics Pipeline, 3D Math,
Coordinates and Coordinate Systems - Quaternion Mathematics - Transformations & Geometry - The
Rendering Engine: Triangle Rasterization, The Rendering Pipeline

UNIT III Lighting and Texturing Effects in game environment 9

Ray Tracing - Lighting in Computer Graphics - Types of Light Sources - Light Models - Materials: Lambert
Diffuse, Phong - Bump Mapping - Lighting Technique: Point Lights, Bloom - Shadows in Games: Real-Time
Versus Preprocessed Shadows, Types of Shadows, Texture mapping techniques - Special Effects: Blurring,
Particle Systems, Weapon Effects

UNIT IV Introduction to Artificial Intelligence in Game 9

Why Games for Artificial Intelligence - Why Artificial Intelligence for Games - Game AI Panorama:
Methods (Computer) Perspective, End User (Human) Perspective, Player-Game Interaction Perspective.

UNIT V Solving search problems for Game move prediction and optimization using AI 9

Tree Search: Uninformed Search, Best-First Search, Minimax, Monte Carlo Tree Search - Evolutionary
Algorithms - Supervised Learning: Artificial Neural Networks, Support Vector Machines.

TOTAL:45 h
TEXT BOOKS:

T1: Game Engine Architecture, 3rd Edition, Jason Gregory, A K Peters, 2019.
T2: Palmer G. Physics for game programmers. Berkeley: Apress; 2005
T3: Artificial Intelligence and Games, Georgios N. Yannakakis and Julian Togelius, January 26, 2018,
Springer

REFERENCES:

R1: Sherrod A. Game Graphic Programming. Cengage Learning; 2008.

R2: McShaffry M. Game coding complete. Nelson Education; 2014
R3: Akenine-Mo, T., Haines, E. and Hoffman, N., 2018. Real-time rendering

Web Links:

L1: https://onlinecourses.nptel.ac.in/noc19_ge32/preview

COURSE OUTCOMES
At the end of this course the students will be able to,

CO1: Understand the basics of Game Programming and Game Engine Architecture. 2
CO2: Develop 2D and 3D Images using Mathematical coordinates 4
CO3: Apply various Lighting and Texturing Effects in game environment. 3
CO4: Extend the Game Programming using Artificial Intelligence. 2
CO5: Solve search problems for Game move prediction and optimization using AI. 6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 P PO5 PO6 PO7 PO PO9 PO PO PO PSO1 PSO2

O4 8 10 11 12
2 2 2 2 3 2 3 - - - - 2 2 2
CO1
2 3 2 2 2 3 2 - - - - 2 2 2
CO2
2 2 3 2 2 2 3 - - - - 3 2 3
CO3
3 2 3 2 2 3 2 - - - - 2 3 2
CO4
2 3 2 2 3 2 1 - -- - - 3 2 3
CO5
Average 2.2 2.4 2.4 2 2.4 2.4 2.2 - - - - 2.4 2.2 2.4

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
CSE INFORMATION RETRIEVAL TECHNIQUES 3 0 0 3

COURSE OBJECTIVES

1. To understand the basics of information retrieval with pertinence to modeling

2. To understand various components of IR system

3. To understand machine learning techniques for text classification and clustering

4. To explore various IR applications.

UNIT I INTRODUCTION AND MODELING 9

Basic Concepts: Retrieval process – Architecture – Boolean retrieval; IR Models: Taxonomy and
characterization of IR models – Classical IR models – Alternative algebraic models – Models for Browsing
– Retrieval Evaluation: Performance evaluation.

UNIT II INDEXING AND QUERYING 9

Indexing: Inverted indices – Suffix trees – Suffix arrays – Compression; Querying: Query languages; Query
Operations: Relevance feedback and query expansion – Automatic local and global analysis.

UNIT III SEARCHING 9

Searching: Sequential searching – Pattern matching; Searching the Web: Characteristizing the Web –
Search engines – Browsing – Searching using hyperlinks.

UNIT IV CLASSIFICATION AND CLUSTERING 9

Text Classification: Naive Bayes; Vector Space Classification: Rocchio – k-Nearest Neighbour; Flat
Clustering: K-Means – Model-based clustering – Hierarchical clustering – Matrix decompositions and
latent semantic indexing.

UNIT V APPLICATIONS 9

XML Retrieval – Multimedia IR – Parallel and Distributed IR – Digital Libraries – Social Media Retrieval –
Content-based Image Retrieval – Online Public Access Catalogs (OPACs).

Total Periods: 45

TEXT BOOKS

1. Ricardo Baeza Yates, BerthierRibeiroNeto, “Modern Information Retrieval: The Concepts and
Technology behind Search”, ACM Press Books, 2nd Edition, 2011.

2. Christopher D Manning, PrabhakarRaghavan, HinrichSchutze, “Introduction to Information

Retrieval”, Cambridge University Press, 1st South Asian Edition, 2008.

REFERENCES

1. Stefan Buttcher, Charles L A Clarke, Gordon V Cormack,“Information Retrieval – Implementing

and Evaluating Search Engines”, The MIT Press, Cambridge, Massachusetts London, England, 2010.

2. Cheng Xiang Zhai, Sean Massung, “Text Data Management and Analysis: A Practical Introduction
to Information Retrieval and Text Mining”, ACM Books, 2016.

3. Reza Zafarani, Mohammad Ali Abbasi, Huan Liu, “Social Media Mining: An Introduction”, 1st
Edition, Cambridge University Press, 2014.

4. VipinTyagi, “Content-Based Image Retrieval: Ideas, Influences, and Current Trends”, 1st Edition,
Springer, 2017.

5. Marcia J Bates, “Understanding Information Retrieval Systems: Management, Types, and

Standards”, CRC Press, 2012.

COURSE OUTCOMES

After the completion of this course, students will be able to:

1. Describe various IR modeling techniques (K3)

2. Identify and design the various components of an Information Retrieval system (K3)

3. Apply machine learning techniques to text classification and clustering for efficient Information
Retrieval (K3)

4. Describe various IR applications (K2)

5. Apply IR evaluation metrics to measure the performance of IR systems (K3).

CO PO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

K3 K4 K5 K5 K6 - - - - - - - K5 K3

CO1 K3 3 2 2 - 1 - - 1 1 1 - 1 2 3

CO2 K3 3 2 2 - 1 - - 1 1 1 - 1 2 3

CO3 K3 3 2 2 - 1 - - 1 1 1 - 1 2 3

CO4 K2 2 1 1 - 1 - - 1 1 1 - 1 1 2

CO5 K3 3 2 2 - 1 - - 1 1 1 - 1 2 3

Score 15 11 10 - 6 - - 5 5 5 - 5 10 15

Course Mapping 3 3 2 - 2 - - 1 1 1 - 1 2 3

CSE Internet of Things 3 0 0 3

COURSE OBJECTIVES:
⮚ To understand the basics of IoT and its application sectors
⮚ To understand M2M and IoT
⮚ To understand and become proficient in IoT platforms
To understand and apply IoT protocols appropriately
⮚ To design and develop IoT based applications
⮚

UNIT I INTRODUCTION AND CONCEPTS OF IOT 9 hours

Introduction to IOT, definition and characteristics of IOT - Architecture of Internet of Things, Physical and
logical design of IOT, IOT enabling technologies, IOT levels and deployment templates-Domain specific
IOTs, home automation, cities, environment, Domain specific IOTs, Energy, retail, agriculture, industry,
health and lifestyle

UNIT II IOT AND M2M COMMUNICATION 9 hours

M2M, difference between IOT and M2M, ETSI M2M Architecture, system architecture -ETSI M2M SCL
resource structure, Security in ETSI M2M framework, SDN and NFV for IOT, IOT system management,
need for IOT system management -SNMP, Network operator requirements, NETCONF-YANG, IOT system
management with NETCONF-YANG, IoT Design methodology-case study on IOT system for Weather
Monitoring

UNIT III IOT PLATFORMS 9 hours

Introduction to Hardware used for IoT: Microcontrollers, Microprocessors, SoC, Sensors -Introduction to
Arduino, Pi, Spark, Intel Galileo

UNIT IV IOTTECHNICAL STANDARDS AND PROTOCOLS s 9 hours

RF Protocols: RFID, NFC;IEEE 802.15.4: ZigBee, Z-WAVE, THREAD; Bluetooth Low Energy (BLE), IPv6 for
Low Power and Lossy Networks (6LoWPAN) and Routing Protocol for Low power and lossy networks (RPL)
-CoAP,XMPP, Web Socket, AMQP, MQTT, WebRTC, PuSH -Architectural Considerations in Smart Object
Networking

UNIT V DEVELOPING INTERNET OF THINGS 9 hours

IoT platforms design methodology, IoT Physical devices and endpoints -IoT Systems: Logical design using
Python, IoT physical servers and cloud offerings (Cloud computing for IoT)

TOTAL: 45 hours

TEXT BOOKS:

T1: ArshdeepBahga, Vijay Madisetti, “Internet of Things, A Hands -on Approach”, 1st Edition 2015, University
Press, ISBN: 978-81-7371- 954-7
T2: Oliver Hersent, David Boswarthick, Omar Elloumy, “The Internet of Things”,1st Edition2015,ISBN: 978-81-
265-5686-1
T3: Michael Miller, “The Internet of Things, How Smart TVs, Smart Cars, Smart Homes, and Smart Cities are
changing the World”, First edition ,2015, Pearson, ISBN:978-93-325-5245-6

WEB LINKS:

1. https://archive.nptel.ac.in/courses/106/105/106105166/
2. https://nptel.ac.in/courses/108108098
3. https://thingsee.com/blog/quality-hardware-list-for-your-iot-projects
4. https://tools.ietf.org/html/rfc7452
5. http://dret.net/lectures/iot-spring15/protocols
6. http://iot.intersog.com/blog/overview-of-iot-development-standards-and-frameworks
COURSE OUTCOMES:

CO1: Apply IOT architecture at various application domains K3

CO2: Examine M2M Communication and architecture K4

 CO3: Experiment with various IoT platforms K3

CO4: Utilize different standards and protocols K3

CO5: Construct Cloud computing for IoT K3

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 3 3 3 2 - 3 2 2 2 2 3 2

CO2 1 3 3 3 3 2 - 3 2 2 2 2 3 2

CO3 1 3 3 3 3 2 1 3 2 2 2 2 3 2
CO4 1 3 3 3 3 2 - 3 2 2 2 2 3 2
CO5 2 3 3 3 3 2 1 3 2 2 2 2 3 2
1.2 2.8 3 3 3 2 0.4 3 2 2 2 2 3 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔
\

OCSE01 OBJECT ORIENTED ANALYSIS AND DESIGN 3 0 0 3

Course Objective:

• To understand the system modelling and design based on requirements, converting design to code.

• To use various UML design diagrams and to apply the appropriate design patterns.

• To learn the basic Object oriented analysis and design skills through an elaborate case study.

• To apply the process of OOAD in software development.

UNIT I INTRODUCTION 9
Introduction to OOAD – What is OOAD? – What is UML? An Overview of Object Oriented Systems
Development - Object Basics – Object Oriented Systems Development Life Cycle: The Software
Development Process – Building High-Quality Software – OOSD: A Use-Case Driven Approach - Use case
Modeling - Relating Use cases: include,extend and generalization.

UNIT II OBJECT ORIENTED METHODOLOGIES 9

Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks –

Unified Approach – Unified Modeling Language: Static and dynamic model – UML diagrams - UML class
diagram – Use case diagramUML dynamic modeling (Sequence diagram, Collaboration Diagram, State
Diagram) - Activity Diagram –Implementation diagrams (Component diagram, Deployment diagram).

UNIT III OBJECT ORIENTED ANALYSIS 9

Identifying use cases : Business object analysis –The unified approach- Business process modeling – Use
case model– Developing effective documentation - Object Analysis Classification : Classifications theory –
Approaches foridentifying classes – Noun phrase approach – Common class patterns approach – Use case
driven approach –Classes, responsibilities and collaborators – Naming classes - Identifying Object
relationships, Attributes and Methods:Associations – Super sub class relationship – A part of relationships
(aggregation) – Class responsibility – Objectresponsibility.

UNIT IV OBJECT ORIENTED DESIGN 9

Design Axioms: The object oriented design process – Design axioms – Corollaries – Design patterns –
Designing Classes: The process - Class visibility – Refining attributes – Designing methods and protocols.
Access Layer: Object Storage and Object Interoperability: DBMS – Distributed databases and client server
computing – Object relational systems – Multidatabase systems – Designing Access layer classes.

UNIT V SOFTWARE QUALITY AND USABILITY 9

View Layer : Designing Interface Objects : Designing view layer classes – Macro level , Micro level process
– Purpose of a view layer interface – Prototyping the user interface- Software Quality Assurance: Quality
Assurance Tests – Testing strategies – Impact of Object Orientation – Test Cases – Test Plan – Myer’s
Debugging Principles – System Usability and Measuring User Satisfaction : Usability Testing – User
Satisfaction Test ( Test Templates) – Mappingdesign to code.

TOTAL: 45 h

TEXT BOOKS:

1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 1999.

2. Craig Larman,"Applying UML and Patterns: An Introduction to object-oriented Analysis and Design
and iterativedevelopment”, Third Edition, Pearson Education,2005.

REFERENCE BOOKS:

1. Mike O’Docherty, “Object-Oriented Analysis & Design: Understanding System Development with UML
2.0”, JohnWiley& Sons, 2005.
 2. James W- Cooper, Addison-Wesley, “Java Design Patterns – A Tutorial”, 2000.

COURSE OUTCOMES
CO1 Construct the Software Development Process. K6

CO2 Analyzeobject oriented design methodologies. K5

CO3 Use Attributes and Methods in use case driven approach K3

CO4 Design Object relational and Multidatabase systems. K6

CO5 Be Familiar with thetest Cases, test Plan and Myer’s Debugging Principles K3

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 PO 5 6 7 8 9 0 1 2 1 2
4
3 2 2 2 3 2 3 3 2 2 2 1 2 1
CO1
3 2 3 3 2 3 3 1 3 2 3 2 3 2
CO2
2 3 2 2 2 2 2 3 2 3 2 3 2 3
CO3
2 3 2 2 3 2 3 3 2 2 3 3 3 3
CO4
2 3 3 3 3 3 3 3 3 3 3 3 3 3
CO5
Averag 2.4 2.6 2.4 2.4 2.6 2.4 2.8 2.6 2.4 2.4 2.6 2.4 2.6 2.4
e

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 SOFT COMPUTING 3 0 0 3

COURSE OBJECTIVES

1. To learn the basic concepts of Soft Computing

2. To study various Artificial Neural network architectures

3. To learn fuzzy sets, fuzzy logic and fuzzy inference system

4. To understand genetic algorithm for global optimization

5. To learn hybrids of neuro, fuzzy and genetic algorithm, and their applications.
UNIT I INTRODUCTION TO SOFT COMPUTING 9

Introduction: Neural networks – Fuzzy logic – Genetic algorithm – Hybrid systems; Artificial Neural
Network: Fundamental concepts – Evolution of neural networks – Basic modals of ANN – McCulloch and
Pitts neuron – Linear separability – Hebb network.

UNIT II SUPERVISED, UNSUPERVISED, AND ASSOCIATIVE LEARNING NETWORKS 9

Supervised Learning Network: Perceptron networks – Adaptive linear neuron – Multiple adaptive linear
neurons – Back propagation networks – Radial bias function network; Associative Memory Networks:
Autoassociative memory network – Bidirectional associative memory – Hopfield networks; Unspervised
Learning Networks: Hamming network – Kohonen neural network – Learning vector quantization –
Adaptive resonance theory networks.

UNIT III FUZZY SYSTEMS 9

Introduction to fuzzy logic – Classical sets – Fuzzy sets – Fuzzy relations – Membership functions –
Defuzzification methods – Fuzzy arithmetic – Fuzzy measures – Fuzzy rule base and approximate
reasoning – Fuzzy decision making.

UNIT IV GENETIC ALGORITHMS 9

Genetic Algorithm and search space – General genetic algorithm – Operators – Stopping condition –
Constraints – Classification – Genetic programming; Applications of genetic algorithm.

UNIT V HYBRID SOFT COMPUTING TECHNIQUES & APPLICATIONS 9

Neuro-Fuzzy hybrid systems – Genetic neuro hybrid systems – Genetic fuzzy hybrid and fuzzy genetic
hybrid systems; Applications of Soft Computing: A fusion approach of multispectral images with SAR –
Optimization of Traveling Salesman Problem using genetic algorithm – Soft computing based hybrid fuzzy
controllers.

Total Periods: 45

COURSE OUTCOMES

Upon completion of this course, the students should be able to:

1. Understand various soft computing techniques (K2)

2. Design and develop different neural network algorithms (K3)

3. Analyse and apply fuzzy logic and fuzzy inference system (K3)

4. Solve problems using Genetic Algorithms (K3)

5. Apply various soft computing techniques for complex problems (K3).

TEXT BOOKS

1. S N Sivanandam, S N Deepa, “Principles of Soft Computing”, Wiley India, 2nd Edition, 2011.

2. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft Computing”,
Prentice-Hall of India, 2002.

REFERENCES
1. Kwang H Lee, “First course on Fuzzy Theory and Applications”, Springer, 2005.

2. George J Klir, Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall,
1996.

3. James A Freeman, David M Skapura, “Neural Networks Algorithms, Applications, and

Programming Techniques”, Addison Wesley, 2003.

4. S Rajasekaran, G A VijayalakshmiPai, “Neural Networks, Fuzzy Logic and Genetic Algorithm,

Synthesis and Applications”, PHI Learning, 2017.

5. N P Padhy, S P Simon, “Soft Computing with MATLAB Programming”, Oxford University Press,
2015.

CO PO MAPPING

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 4 5 6 7 8 9 0 1 2 1 2

CO1 K
3 2 - - - - - - - - - - 3 -
2

CO2 K
3 2 - - - - - - - - - - 3 -
3

CO3 K
3 - - - - - - - - - - - 2 -
3

CO4 K
3 2 - - - - - - - - - - 3 -
3

CO5 K
3 3 3 - 2 - - - - - - - 3 -
3

Score 15 9 3 - 3 - - - - - - - 14 -

Course
Mappin 3 3 3 - 2 - - - - - - - 3 -
g

CSE SOFTWARE ENGINEERING 3 0 0 3

Course Objective:

• To understand the phases in a software project

• To understand the fundamental concepts of requirements engineering and Analysis Modeling.

• To understand the various software design methodologies

• To learn various testing and maintenance measures

UNIT I SOFTWARE PROCESS AND AGILE DEVELOPMENT 9

Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models –
Introduction to Agility-Agile process-Extreme programming-XP Process.

UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION 9

Software Requirements: Functional and Non-Functional, User requirements, System requirements,

Software Requirements Document – Requirement Engineering Process: Feasibility Studies, Requirements
elicitation and analysis, requirements validation, requirements management-Classical analysis:
Structured system Analysis, PetriNets- Data Dictionary.

UNIT III SOFTWARE DESIGN 9

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

UNIT IV TESTING AND MAINTENANCE 9

Software testing fundamentals-Internal and external views of Testing-white box testing – basis path
testing-control structure testing-black box testing- Regression Testing – Unit Testing – Integration Testing
– Validation Testing – System Testing And Debugging –Software Implementation Techniques: Coding
practices-Refactoring-Maintenance and Reengineering-BPR model-Reengineering process model-Reverse
and Forward Engineering.

UNIT V PROJECT MANAGEMENT 9

Software Project Management: Estimation – LOC, FP Based Estimation, Make/Buy Decision COCOMO I &
II Model – Project Scheduling – Scheduling, Earned Value Analysis Planning – Project Plan, Planning
Process, RFP Risk Management – Identification, Projection – Risk Management-Risk Identification-RMMM
Plan-CASE TOOLS

Total: 45h

TEXT BOOKS:

1. Roger S. Pressman, ―Software Engineering – A Practitioner‟s Approach, Seventh Edition, Mc Graw-Hill

International Edition, 2010.

2. Ian Sommerville, ―Software Engineering, 9th Edition, Pearson Education Asia, 2011.

REFERENCE BOOKS:

1. Rajib Mall, ―Fundamentals of Software Engineering‖, Third Edition, PHI Learning PrivateLimited, 2009.

2. Pankaj Jalote, ―Software Engineering, A Precise Approach‖, Wiley India, 2010.

 3. Kelkar S.A., ―Software Engineering, Prentice Hall of India Pvt Ltd, 2007.

4. Stephen R.Schach, ―Software Engineering, Tata McGraw-Hill Publishing Company Limited,2007.

Course Outcome Description Knowledge Level

CO1 Identify the key activities in managing a software project. K2

CO2 Compare different process models. K4

CO3 Apply systematic procedure for software design and deployment. K3

CO4 Compare and contrast the various testing and maintenance. K4

CO5 Manage project schedule, estimate project cost and effort required. K3

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 PO 5 6 7 8 9 0 1 2 1 2
4
3 3 2 2 2 2 3 3 2 2 2 1 2 1
CO1
2 2 3 2 3 3 3 1 3 2 3 2 3 3
CO2
3 2 2 2 2 2 1 3 3 3 2 3 2 3
CO3
2 3 3 2 3 2 3 3 2 2 3 3 3 3
CO4
2 3 3 2 3 3 3 3 3 3 3 3 3 3
CO5
Averag 2.4 2.6 2.6 2 2.6 2.4 2.6 2.6 2.6 2.4 2.6 2.4 2.6 2.6
e

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
 Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔

CSE SOFTWARE PROJECT MANAGEMENT 3 0 0 3

Course Objective:

• To understand the basic knowledge of software management principles.

 • To familiarize in choosing an appropriate project development methodology and identifying project
risks, monitoring and tracking project deadlines.

• To develop the capability to work in a team environment and be aware of different modes of
communications.

UNIT I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 9

Project Definition – Contract Management – Activities Covered by Software Project Management – Plans,
Methods and Methodologies – Management – Objectives – Stakeholders – Requirement Specification –
Management control – Activities Covered By Software Project Management – Overview Of Project
Planning – Stepwise Project Planning.

UNIT II PROJECT EVALUATION 9

Strategic Assessment – Technical Assessment – Cost Benefit Analysis –Cash Flow Forecasting – Cost
Benefit Evaluation Techniques : Net Profit – Payback Period – Return on Investment – Net Present Value
– Internal Rate of Return – Risk Evaluation : Identification and Ranking – Cost-benefit Analysis – Risk Profile
Analysis – Using Decision Trees.

UNIT III ACTIVITY PLANNING 9

Objectives – Project Schedule – Sequencing and Scheduling Activities –Network Planning Models –
Forward Pass – Backward Pass – Activity Float – Shortening Project Duration – Activity on Arrow Networks
– Risk Management – Nature Of Risk – Types Of Risk – Managing Risk – Hazard Identification – Hazard
Analysis – Risk Planning and Control.

UNIT IV MONITORING AND CONTROL 9

Creating Framework – Collecting The Data – Visualizing Progress – Cost Monitoring – Earned Value
Analysis – Prioritizing Monitoring – Getting Project Back to Target – Change Control – Managing Contracts
– Introduction – Types Of Contract – Stages In Contract Placement – Typical Terms Of A Contract –
Contract Management – Acceptance.

UNIT V MANAGING PEOPLE AND ORGANIZING TEAMS 9

Introduction – Understanding Behavior – Organizational Behaviour : a Background – Selecting The Right

Person For The Job – Instruction In The Best Methods – Motivation– The Oldman – Hackman Job
Characteristics Model – Working In Groups – Becoming A Team –Decision Making – Leadership –
Organizational Structures – Stress –Health and Safety – Case Studies.

TOTAL : 45 h

TEXT BOOK:

1. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition, Tata McGraw Hill, 2004.

REFERENCE BOOKS:
1. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001.
2. Royce, “Software Project Management”, Pearson Education, 1999.
3. Jalote, “Software Project Manangement in Practive”, Pearson Education, 2002.
COURSE OUTCOMES
Determine the Plans, Methods and Methodologies of Software project
CO1: K5
Management

CO2: Assess the project evaluation techniques based on cost and risk K5

CO3: Elaborate the Sequencing and Scheduling Activities & Hazards K6

CO4: Examine the Stages In Contract Placement K4

CO5: Organize people in team and develop decision making skills K3

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 - - - 1 - - - 2 3

CO2 3 2 2 3 3 - - - 1 - - - 2 3

CO3 3 3 3 3 3 - - - 1 - - - 2 3

CO4 3 3 2 3 3 - - - 1 - - - 2 3

CO5 2 2 3 3 3 - - - 1 - - - 2 3

2.8 2.6 2.6 3 3 - - - 1 - - - 2 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test

✔ ✔ ✔ ✔ ✔

CSE SOFTWARE QUALITY ASSURANCE 3 0 0 3

Course Objective:

● To understand the quality management processes and to distinguish between various activities
of quality assurance, quality planning and quality control.

● To know the importance of standards in the quality management process and their impact on the
final product.

● To understand the SQA processes from planning till execution.

UNIT I FUNDAMENTALS OF SOFTWARE QUALITY ASSURANCE 9

The Role of SQA: Objectives – Benefits – Goals – Role – Process - SQA Plan : Need and Content of SQA Plan
– SQA considerations – SQA people : Roles and Responsibilities of SQA People – Characteristics of Good
SQA Engineer – Quality Management – Software Configuration Management : SCM Plan – Roles –
Activities – Baselines – Requirement Phase – Implementation Phase.

UNIT II MANAGING SOFTWARE QUALITY 9

Managing Software Organizations: Commitment – Management System – Managing Software Quality:
Measurement Criteria – Establishing a Software Quality Program – Estimating Software Quality – Removal
Efficiency – Quality Goals and Plans – Tracking and Controlling Software Quality – Defect Prevention -
Software Quality Assurance Management.

UNIT III SOFTWARE QUALITY ASSURANCE METRICS 9

Software Quality : Views – Measuring Quality – Criteria - Total Quality Management (TQM) : Principles –
Cost – TQM Implementation Approaches – Ways of Improving Quality – Methods for Generating Ideas –
Advantages – Barriers – Software Quality Metrics: Product Quality – In-Process – Maintenance quality –
Software Quality Metrics Analysis.

UNIT IV SOFTWARE QUALITY PROGRAM 9

Software Quality Program Concepts – Establishment of a Software Quality Program: Tasks – Scope –
Minimal Quality Assurance Effort – Quality Plan – Software Quality Assurance Planning: An Overview –
Purpose & Scope: Management – Documentation – SPCM – Reviews and Audits – Validation, Verification
and Testing – Problem Reporting.

UNIT V SOFTWARE QUALITY ASSURANCE STANDARDIZATION 9

Software Standards–ISO 9000 Quality System Standards : Process Model - Capability Maturity Model and
the Role of SQA in Software Development Maturity – SEI CMM Level 5 –Comparison of ISO 9000 Model
with SEI’s CMM : Model Orientation – ISO 9000 Weaknesses – CMM Weaknesses - SPICE ( Software
Process Improvement and Capability Determination).

TOTAL : 45 h

TEXT BOOKS:
1. Mordechai Ben-Menachem / Garry S Marliss, “Software Quality”, Vikas Publishing House, Pvt, Ltd.,
New Delhi.(UNIT III to V), 2007.
2. Watts S Humphrey, “ Managing the Software Process”, Pearson Education Inc. (UNIT I and II)

REFERENCE BOOKS:
1. Gordon G Schulmeyer, “Handbook of Software Quality Assurance”, Third Edition, Artech House
Publishers 2007.
2. Nina S Godbole, “Software Quality Assurance: Principles and Practice”, Alpha Science
International, Ltd, 2004.

Course Outcomes

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

Course Knowledge
Description
Outcome Level
Identify the roles and responsibilities of SQA(software quality
CO1 K3
assurance)people
Create and apply a software quality assurance plan for all software
CO2 projects. K5

CO3 Maintain appropriate metrics to measure and maintain quality K6

CO4 Facilitate inspections, product reviews, walk-throughs, and audits. K5

CO5 Discuss the roles of SQA in software development maturity models K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 3 3 1 2 2 2 2 3 2
CO2 2 3 3 3 3 3 3 1 2 2 2 2 3 2
CO3 3 3 3 3 3 3 3 1 2 2 2 2 3 2
CO4 3 3 3 3 3 3 3 1 2 2 2 2 3 2
CO5 2 3 3 3 2 3 3 1 2 2 2 2 3 2
Avg 2.6 3 3 3 2.8 3 3 1 2 2 2 2 3 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test

✔ ✔ ✔ ✔ ✔
 CSE SOFTWARE TESTING 3 0 0 3

Course Objectives
● To learn the principles of validation testing, defect testing, system and component testing

● To understand the strategies for generating system test cases

● To understand the essential characteristics of tool used for test automation

UNIT I Introduction 9
Testing as an Engineering Activity – Role of Process in Software Quality – Testing as a Process – Basic
Definitions – Software Testing Principles – The Tester’s Role in a Software Development Organization –
Origins of Defects – Defect Classes – The Defect Repository and Test Design – Defect Examples –
Developer/Tester Support for Developing a Defect Repository.
UNIT II TEST CASE DESIGN 9
Introduction to Testing Design Strategies – The Smarter Tester – Test Case Design Strategies – Using Black
Box Approach to Test Case Design Random Testing – Requirements based testing – positive and negative
testing -–– Boundary Value Analysis – decision tables - Equivalence Class Partitioning state-based testing–
cause effect graphing – error guessing - compatibility testing – user documentation testing – domain
testing Using White–Box Approach to Test design – Test Adequacy Criteria –static testing vs. structural
testing – code functional testing - Coverage and Control Flow Graphs – Covering Code Logic – Paths –
Their Role in White–box Based Test Design – code complexity testing – Evaluating Test Adequacy Criteria.
UNIT III LEVELS OF TESTING 9
The Need for Levels of Testing – Unit Test – Unit Test Planning –Designing the Unit Tests. The Test Harness
– Running the Unit tests and Recording results – Integration tests – Designing Integration Tests –
Integration Test Planning – scenario testing – defect bash elimination -System Testing – types of system
testing - Acceptance testing –performance testing - Regression Testing – internationalization testing – ad-
hoc testing -Alpha – Beta Tests – testing OO systems – usability and accessibility testing
UNIT IV TEST MANAGEMENT 9
People and organizational issues in testing – organization structures for testing teams –testing services -
Test Planning – Test Plan Components – Test Plan Attachments –Locating Test Items – test management
– test process - Reporting Test Results – The role of three groups in Test Planning and Policy Development
– Introducing the testspecialist – Skills needed by a test specialist – Building a Testing Group.
UNIT V CONTROLLING AND MONITORING 9
Software test automation – skills needed for automation – scope of automation – design and architecture
for automation – requirements for a test tool – challenges in automation- Test metrics and measurements
–project, progress and productivity metrics – Status Meetings – Reports and Control Issues – Criteria for
Test Completion – SCM – Types of reviews – Developing a review program – Components of Review Plans–
Reporting Review Results. – evaluating software quality – defect prevention – testing maturity Model.
TOTAL : -- 45 hours
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “ Software Testing – Principles and Practices”, Pearson
education, 2006.
2. Aditya P.Mathur, “Foundations of Software Testing”, Pearson Education,2008.
REFERENCE BOOKS:
1. Boris Beizer, “Software Testing Techniques”, Second Edition, Dreamtech, 2003
2. Elfriede Dustin, “Effective Software Testing”, First Edition, Pearson Education, 2003.
3. Renu Rajani, Pradeep Oak, “Software Testing – Effective Methods, Tools and Techniques”, Tata
McGraw Hill,
COURSE OUTCOMES
CO1: Identify the defects by applying the testing principles K3

CO2: Develop test strategies and test cases to prioritize and execute them K6

CO3: Apply the testing techniques in an effective manner K3

CO4: Design and implement comprehensive test plans K6

CO5: Assess the various test metrics and measurements. K5

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 3 3 1 2 2 2 2 3 2

CO2 2 3 3 3 3 3 3 1 2 2 2 2 3 2

CO3 3 3 3 3 3 3 3 1 2 2 2 2 3 2

CO4 3 3 3 3 3 3 3 1 2 2 2 2 3 2

CO5 2 3 3 3 2 3 3 1 2 2 2 2 3 2

2.6 3 3 3 2.8 3 3 1 2 2 2 2 3 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test
✔ ✔ ✔ ✔ ✔

CSE SYSTEM SOFTWARE 3 0 0 3

Course Objectives

⮚ To understand the relationship between system software and machine architecture.

⮚ To know the design and implementation of assemblers, linkers and loaders.
⮚ To understand the macroprocessors, system software tools and internal working of hardware
and software interface of a typical system.

UNIT I INTRODUCTION 9
System software and machine architecture – The Simplified Instructional Computer (SIC) Machine
architecture: Memory- Registers-Data and instruction formats - addressing modes -instruction sets –
Input / Output – SIC/XE Machine Architecture: Memory-Registers- Data and instruction formats -
addressing modes -instruction sets – Input / Output – Programming examples.

UNIT II ASSEMBLERS 8
Basic assembler functions : A simple SIC assembler – Assembler algorithm and data structures - Machine
dependent assembler features : Instruction formats and addressing modes – Program relocation -
Machine independent assembler features : Literals –Symbol-defining statements – Expressions –
Assembler Design Options : One pass assemblers and Multi pass assemblers - Implementation example :
MASM assembler.

UNIT III LOADERS AND LINKERS 8

Basic loader functions: Design of an Absolute Loader – A Simple Bootstrap Loader -Machine dependent
loader features: Relocation – Program Linking – Algorithm and Data Structures for a Linking Loader -
Machineindependent loader features: Automatic Library Search – Loader Options - Loader design options:
Linkage Editors - Dynamic Linking – Bootstrap Loaders.

UNIT IV MACRO PROCESSORS & VIRTUAL MACHINES 10

Basic macro processor functions : Macro Definition and Expansion – Macro Processor Algorithm and data
structures - Machine-Independent Macro Processor Features : Concatenation of Macro Parameters –
Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters - Macro within
Macro - Implementation example : MASM Macro Processor - Introduction to Virtual Machines (VM) –
Computer Architecture- Virtual machine basics – Process virtual machines – System virtual machines

UNIT V SYSTEM SOFTWARE TOOLS 10

Database Management Systems : Basic concept of a DBMS – Levels of Data Description – Use of a DBMS
- Text editors : Overview of the Editing Process - User Interface – Editor Structure - Interactive debugging
systems: Debugging functions and capabilities – Relationship with other parts of the system – User
Interface Criteria- Instruction Set Issues – Profiling – Code optimization.

TOTAL: 45 hours
 Text Books:
T1: Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd Edition, Pearson
education Asia, 2006.
T2: John R. Levine, “Linkers & Loaders”, Morgan Kauffman, 2003.

Reference Books:
R1: John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
R2: D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw
Hill, 2000.
R3: John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers, 2000.
R4: Srimanta Pal, “ Systems Programming “ , Oxford University Press, 2011.

COURSE OUTCOMES
After completion of course, students would be able to:
CO1: Demonstrate the machine architecture of SIC and SIC/XE.
CO2: Identify the different assembler modes and features.
CO3: Analyse different loaders with various linkage methods.
CO4: Identify the functionalities of macro processing and analyse the virtual machine
imeplementation.
CO5: Apply the basic concepts of data base management systems with programming coding
standards.

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO P PO PO PO PO1 PO1 PO1 PSO PSO

5 O7 8 9 0 1 2 1 2
6
CO1 2 1 2 2 1 - - - - - - 2 2 1
CO2 2 1 3 3 3 - - - - - - 3 2 2
CO3 2 2 2 2 3 - - - - - - 2 3 3
CO4 3 3 3 3 3 - - - - - 1 3 3 3
CO5 3 2 3 3 2 - - - - - 3 3 3 3
Average 2.4
2.40 1.80 2.60 2.60 - - - - - 0.80 2.60 2.60 2.40
0

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 CSE INTRODUCTION TO DATA ANALYTICS 3 0 0 3

Course Objectives
⮚ To provide the knowledge and expertise to become a proficient data scientist
⮚ To explore the fundamental concepts of big data & data analytics.
⮚ To gain knowledge on Hadoop related tools such as MongoDB, Cassandra, Pig, and Hive for big
data analytics

UNIT I Introduction to Big Data 9 hours

Types of Digital Data-Characteristics of Data – Evolution of Big Data – Definition of Big Data – Challenges
with Big Data – 3Vs of Big Data – Non Definitional traits of Big Data – Business Intelligence vs. Big Data –
Data warehouse and Hadoop environment – Coexistence.

UNIT II Big Data Analytics 9 hours

Classification of analytics – Data Science – Terminologies in Big Data – CAP Theorem – BASE Concept.
NoSQL: Types of Databases – Advantages – NewSQL – SQL vs. NOSQL vs NewSQL

UNIT III Introduction to Hadoop 9 hours

Features – Advantages – Versions – Overview of Hadoop Eco systems – Hadoop distributions – Hadoop
vs. SQL – RDBMS vs. Hadoop – Hadoop Components – Architecture – HDFS – Map Reduce: Mapper –
Reducer – Combiner – Partitioner – Searching – Sorting – Compression. Hadoop 2 (YARN): Architecture –
Interacting with Hadoop Eco systems

UNIT IV No SQL databases 9 hours

Mongo DB: Introduction – Features – Data types – Mongo DB Query language – CRUD operations – Arrays
– Functions: Count – Sort – Limit – Skip – Aggregate – Map Reduce. Cursors – Indexes – Mongo Import –
Mongo Export. Cassandra: Introduction – Features – Data types – CQLSH – Key spaces – CRUD operations
– Collections – Counter – TTL – Alter commands – Import and Export – Querying System tables.

UNIT V Hadoop Eco systems 9 hours

Hive – Architecture – data type – File format – HQL – SerDe – User defined functions – Pig: Features –
Anatomy – Pig on Hadoop – Pig Philosophy – Pig Latin overview – Data types – Running pig – Execution
modes of Pig – HDFS commands – Relational operators – Eval Functions – Complex data type – Piggy Bank
– User defined Functions – Parameter substitution – Diagnostic operator

TOTAL : -- 45 hours

TEXT BOOKS:
T1: Seema Acharya, Subhashini Chellappan, “Big Data and Analytics”, Wiley Publication, 2015
REFERENCE BOOKS:

R1: Judith Hurwitz, Alan Nugent, Dr. Fern Halper, Marcia Kaufman, “Big Data for Dummies”, John Wiley & Sons,
Inc., 2013.
R2: Tom White, “Hadoop: The Definitive Guide”, O’Reilly Publications, 2011.
R3: Kyle Banker, “Mongo DB in Action”, Manning Publications Company, 2012.
R4: Russell Bradberry, Eric Blow, “Practical Cassandra A developers Approach“, Pearson Education, 2014
COURSE OUTCOMES

CO1: Identify the need of big data K3

CO2: K5
Interpret basic concepts of data analytics
CO3: K4
Analyze the framework for storing the data
CO4: K4
Examine about NoSQL databases
CO5: K3
Choose an appropriate framework to solve real world problems

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO

1 2 3 4 5 6 7 8 9 0 1 2 1 2

CO 3 3 3 3 2 - - - - - - - - 3
1

CO 2 2 2 2 2 - - - - - - - - 3
2

CO 3 3 3 2 2 - - - - - - - - 3
3

CO 2 3 2 2 3 - - - - - - - - 3
4

CO 3 2 3 2 3 - - - - - - - - 3
5

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE01 USER INTERFACE DESIGN 3 0 0 3

Course Objectives
⮚ To gain knowledge about how to create a User Interface, how to use different type of controls,
Menu usage.
To learn different types and components, different methodologies used to implement User
⮚
Interface and how to use multimedia, prototypes and analyzing different types of testing

UNIT I INTRODUCTION 9
Human Computer Interface – A brief History of Screen Design - Characteristics Of Graphics Interface –
Direct Manipulation Graphical System – Web User Interface –Popularity –Characteristic of Web Interface
Principles of User Interface Design

UNIT II HUMAN COMPUTER INTERACTION 9

User Interface Design Process – Obstacles –Usability –Human Characteristics In Design – Human
Interaction Speed–Business Functions and Requirement Analysis : Direct Methods and Indirect Methods
– Basic Business Functions -Design Standards – System Training – Structures Of Menus – Functions Of
Menus–Contents Of Menu– Formatting-Phrasing The Menu – Selecting Menu Choice–navigating Menus–
Kinds of Graphical Menus.

UNIT III WINDOWS 9

Window Characteristics– Components– Presentation Styles– Types– Managements– Organizations–
Operations– Web Systems– Device Based Controls Characteristics–Screen Based Controls Characteristics
– Operate Control – Text Entry Controls – Selection Control–Combination Control– Custom Control–
Presentation Control.

UNIT IVMULTIMEDIA 9
Text For Web Pages – Providing the Proper Feedback– Guidance & Assistance–International
Consideration – Accessibility– Icons– Image– Multimedia – Coloring.

UNIT V WINDOWS LAYOUT– TEST 9

Prototypes – Kinds Of Tests – Analyze ,Modify and Retest – Evaluating the Working System - Information
Search – Visualization –Hypermedia – Software Tools : Interface Design Tools,Software Testing Tools

TOTAL:45 h

TEXT BOOKS:
T1: Wilbent. O. Galitz ,“The Essential Guide To User Interface Design”, John Wiley& Sons, 2007.
T2: Ben Sheiderman, “Design The User Interface”, Pearson Education, 2008.

REFERENCES:
R1: Alan Cooper, “The Essential Of User Interface Design”, Wiley – Dream Tech Ltd.,2002
Web Links:

L1: https://onlinecourses.nptel.ac.in/noc21_ar05/preview
L2: https://www.coursera.org/specializations/user-interface-design

COURSE OUTCOMES

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

CO1: Identify the concept of Human Computer Interface and Direct Manipulation Graphical System.
CO2: Discuss User Interface Design Process, Obstacles andUsability
CO3: Compare Window Characteristics, Presentation Styles, Organizations andOperations.
CO4: Discuss International Consideration and Accessibility ofmultimedia
CO5: Analyze the concept of Visualization and Hypermedia

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 P PO5 PO6 PO7 PO PO9 PO PO PO PSO1 PSO2

O4 8 10 11 12
2 2 3 - 2 - - - - - - 3 2 3
CO1
1 3 2 - 3 - - - - - - 2 3 2
CO2
3 2 3 - 2 - - - - - - 1 2 2
CO3
2 2 2 - 2 - - - - - - 2 2 2
CO4
3 3 1 - 1 - - - - - - 3 3 3
CO5
Average 2.2 2.4 2.2 - 2 - - - - - - 2.2 2.4 2.4

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 CSE VIRTUAL REALITY 3 0 0 3

Course Objectives
To understand geometric modeling and Virtual environment.
⮚
To study about Virtual Hardwares and Softwares
⮚
⮚
To develop Virtual Reality applications

UNIT I INTRODUCTION TO VIRTUAL REALITY 9

Virtual Reality & Virtual Environment : Introduction – Computer graphics – Real time computer graphics
–Flight Simulation – Virtual environments –requirement – benefits of virtual reality- Historical
development of VR : Introduction-Scientific Landmark -3D Computer Graphics :Introduction – The Virtual
world space – positioning the virtual observer – the perspective projection – human vision – stereo
perspective projection – 3D clipping – Colour theory – Simple 3D modeling – Illumination models –
Reflection models – Shading algorithms- Radiosity – Hidden Surface Removal – Realism-Stereographic
image.

UNIT II GEOMETRIC MODELLING 9

Geometric Modeling: Introduction – From 2D to 3D – 3D space curves – 3D boundary representation -
Geometrical Transformations: Introduction – Frames of reference – Modeling transformations – Instances
–Picking – Flying – Scaling the VE – Collision detection - A Generic VR system: Introduction – The virtual
environment – the Computer environment – VR Technology – Model of interaction – VR Systems.

UNIT III VIRTUAL ENVIRONMENT 9

Animating the Virtual Environment: Introduction – The dynamics of numbers – Linear and Non-linear
interpolation - The animation of objects – linear and nonlinear translation - shape & object inbetweening
– free from deformation – particle system- Physical Simulation : Introduction – Objects falling in a
gravitational field – Rotating wheels – Elastic collisions – projectiles – simple pendulum – springs – Flight
dynamics of an aircraft.

UNIT IVVR HARDWARES & SOFTWARES 9

Human factors : Introduction – the eye - the ear- the somatic senses - VR Hardware : Introduction – sensor
hardware - Head-coupled displays –Acoustic hardware – Integrated VR systems-VR Software: Introduction
–Modeling virtual world –Physical simulation- VR toolkits – Introduction to VRML.

UNIT V VR APPLICATION 9
Virtual Reality Applications: Introduction – Engineering – Entertainment – Science – Training – The Future:
Introduction – Virtual environments – modes of interaction.

TOTAL: 45 h
TEXT BOOK :
T1: John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2007.
REFERENCE BOOKS:
R1: Adams, “Visualizations of Virtual Reality”, Tata McGraw Hill, 2000.
R2: Grigore C. Burdea, Philippe Coiffet , “Virtual Reality Technology”, Wiley Interscience, 2nd Edition,
2006.
R3: William R. Sherman, Alan B. Craig, “Understanding Virtual Reality: Interface, Application, and Design”,
Morgan Kaufmann, 2008.
Web Links:
L1: https://nptel.ac.in/courses/106106138
L2: www.vresources.org
L3: www.vrac.iastate.edu
L4: www.w3.org/MarkUp/VRML
COURSE OUTCOMES
At the end of this course the students will be able to,
CO1:Assess the concept of Virtual Reality, Virtual Environment and 3D Computer Graphics Shading
algorithms
CO2:Explain Geometric Modelling Know ,Geometric Transformations and Generic VR system
CO3:Appraise the details of Physical Simulation in Virtual Environment
CO4:Explain Integrated VR systems, VR Software and VRML
CO5:Develop a Virtual Reality Applications with different modes of interaction
MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES
PO1 PO2 PO3 P PO5 PO6 PO7 PO PO9 PO PO PO PSO1 PSO2
O4 8 10 11 12
3 2 2 2 2 3 2 - - 2 - 2 3 2
CO1
2 2 2 2 2 2 2 - - 2 - 2 3 3
CO2
3 2 2 2 2 2 2 - - 2 - 2 2 2
CO3
2 2 3 3 2 3 2 - - 3 - 2 3 2
CO4
2 3 2 3 2 2 3 - - 3 - 3 1 3
CO5
Average 2.4 2.2 2.2 2.4 2 2.4 2.2 - - 2.4 - 2.2 2.4 2.4

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation
 ✔ ✔

CSE AGILE METHODOLOGIES 3 0 0 3

Course Objectives

● To provide students with a theoretical as well as practical understanding of agile software

development practices and how small teams can apply them to create high-quality software.
● To provide a good understanding of software design and a set of software technologies and
APIs.
● To do a detailed examination and demonstration of Agile development and testing techniques.
To understand the benefits and pitfalls of working in an Agile team.
● To understand Agile development and testing.
●

UNIT I AGILE METHODOLOGY 9 Hours

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

UNIT II AGILE PROCESSES 9 Hours

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

UNIT III AGILITY AND KNOWLEDGE MANAGEMENT 9 Hours

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

UNIT IV AGILITY AND REQUIREMENTS ENGINEERING 9 Hours

Impact of Agile Processes in RE–Current Agile Practices – Variance – Overview of RE Using Agile –
Managing Unstable Requirements – Requirements Elicitation – Agile Requirements Abstraction Model –
Requirements Management in Agile Environment, Agile Requirements Prioritization – Agile Requirements
Modeling and Generation – Concurrency in Agile Requirements Generation.

UNIT V AGILITY AND QUALITY ASSURANCE 9 Hours

Agile Product Development – Agile Metrics – Feature Driven Development (FDD) – Financial and
Production Metrics in FDD – Agile Approach to Quality Assurance - Test Driven Development – Agile
Approach in Global Software Development.

TOTAL : -- 45 Hours

Text Books:

T2: David J. Anderson and Eli Schragenheim, “Agile Management for Software Engineering: Applying the
Theory of Constraints for Business Results”, Prentice Hall, 2003.
T3: Hazza and Dubinsky, “Agile Software Engineering, Series: Undergraduate Topics in Computer Science”,
Springer, 2009.

Reference Books:

R4: Craig Larman, “Agile and Iterative Development: A Manager‘s Guide”, Addison-Wesley, 2004.
R5: Kevin C. Desouza, “Agile Information Systems: Conceptualization, Construction, and Management”,
Butterworth-Heinemann, 2007.

Web Links:

11. https://www.guru99.com/scrum-testing-beginner-guide.html
12. https://www.inflectra.com/Ideas/Whitepaper/Introduction%20to%20Agile%20Development%20Method
s.aspx

COURSE OUTCOMES

Realize the importance of interacting with business stakeholders in determining the

CO1: requirements for a software system K4

Perform iterative software development processes: how to plan them, how to

CO2: execute them. K3

CO3: Point out the impact of social aspects on software development success K1

Develop techniques and tools for improving team collaboration and software
CO4: quality. K6
 Perform Software process improvement as an ongoing task for development teams.
CO5: K3

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 - - - - - - - - 3

CO2 3 2 2 3 3 - - - - - - - - 3

CO3 3 3 3 3 3 - - - - - - - - 3

CO4 2 3 2 3 3 - - - - - - - - 3

CO5 1 2 3 3 3 - - - - - - - - 3

2.4 2.6 2.6 3 3 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

√ √ √ √ √ √

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test

√ √ √ √ √
 CSE INFORMATION SECURITY 3 0 0 3

Course Objective:

• To understand the basics of Information Security and to know the legal, ethical and professional issues in
Information Security.
• To know the aspects of risk management and to become aware of various standards and the technological
aspects of Information Security.

UNIT I INTRODUCTION 9

Information security: Definition, History, Critical Characteristics of Information-NSTISSC Security Model-

Components of an Information System- Securing the Components-Balancing Security and Access-The
System Development Life Cycle- The Security System Development Life Cycle

UNIT II SECURITY INVESTIGATION 9

Need for Security- Business Needs: protecting the functionality of an organization, enabling the safe
operation of an application, protecting the data that organization collects and use, safeguarding
technology assets in organization- Threats-Attacks- Legal, Ethical and Professional Issues: Law and ethics
in Information security, relevant U.S Laws, International laws and legal bodies, ethics and information
security, codes of ethics and professional organization.

UNIT III SECURITY ANALYSIS 9

Risk Management: Introduction- Risk Identification: plan and organize the process, asset identification
and inventory, classifying and prioritizing information assets, information assets valuation, identifying and
prioritizing threats, vulnerability identification and Assessing Risk, Assessing and Controlling Risk

UNIT IV LOGICAL DESIGN 9

Blueprint for Security- Information Security Policy, Standards and Practices- ISO17799/BS 7799-NIST
Models-VISA International Security Model- Design of Security Architecture- Planning for Continuity:
Business impact analysis, incident response planning, disaster recovery planning, business continuity
planning, crisis management, model for a consolidated contingency plan, law enforcement involvement.

UNIT V PHYSICAL DESIGN 9

Security Technology- IDS- Scanning and Analysis Tools-Cryptography: Foundation of cryptology, cipher
methods, cryptographic algorithms, cryptographic tools, protocols for secure communications, attacks on
cryptosystems- Access Control Devices- Physical Security-Security and Personnel

TOTAL: 45h

TEXT BOOK:

1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Vikas Publishing
House, New Delhi, 2003

REFERENCE BOOKS:

1. Micki Krause, Harold F. Tipton, “ Handbook of Information Security Management”, Vol 1-3 CRC Press
LLC, 2004.

2. Stuart Mc Clure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw- Hill, 2003

3. Matt Bishop, “Computer Security Art and Science”, Pearson/PHI, 2002

Web Links:
http://web.cse.ohio-state.edu/~champion.17/4471/
https://slideplayer.com/slide/4409575/

COURSE OUTCOMES:

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

Course Knowledge
Description
Outcome Level
Discuss the development Life Cycle and components of the
CO1 K6
information security system

Assess the protection of functionalities in an organization with

CO2 K5
Ethical and Professional Issues

Examine the information assets Risk Assessment and Controlling of

CO3 K4
Risk

Evaluate the Standards and Practices of various security models

CO4 K5
with Planning for Continuity

Elaborate Scanning and Analysis Tools and cryptographic

CO5 K6
algorithms

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

 PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 3 3 3 3 2 - 3 2 2 2 2 3 2

CO2 3 3 3 3 3 2 - 3 2 2 2 2 3 2

CO3 3 3 3 3 3 2 1 3 2 2 2 2 3 2
CO4 3 3 3 3 3 2 - 3 2 2 2 2 3 2
CO5 2 3 3 3 3 2 1 3 2 2 2 2 3 2
Averag 2.8 3 3 3 3 2 0.4 3 2 2 2 2 3 2
e

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 OCSE01 SOFTWARE DEFINED NETWORKS 3 0 0 3

Course Objectives
To learn about the use and application of SDN in Data centers
●
To understand the separation of the data plane and the control plane
●

UNIT I INTRODUCTION 9 hours

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

UNIT II OPEN FLOW & SDN CONTROLLERS 9 hours

Open Flow Specification – Drawbacks of Open SDN, SDN via APIs, SDN via Hypervisor-Based Overlays –
SDN via Opening up the Device – SDN Controllers – General Concepts

UNIT III DATA CENTERS 9 hours

Multitenant and Virtualized Multitenant Data Center – SDN Solutions for the Data Center Network –
VLANs – EVPN – VxLAN – NVGRE
UNIT IV SDN PROGRAMMING 9 hours

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

Juniper SDN Framework – IETF SDN Framework – Open Daylight Controller – Floodlight Controller –
Bandwidth Calendaring – Data Center Orchestration

TOTAL : -- 45 hours

Text Books:

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

1. Siamak Azodolmolky, ―Software Defined Networking with Open Flow, Packet Publishing, 2013.
2. Vivek Tiwari, ―SDN and Open Flow for Beginners, Amazon Digital Services, Inc., 2013.
Web Links:

13. https://opennetworking.org/wp-N_ARCH_1.0_06062014.pdfOnline
14. https://www.ciena.com/insights/what-is/What-Is-SDN.html

COURSE OUTCOMES

CO1: Integrating the conventional networking approaches with SDN K3

CO2: Articulate the design of open flow specification of SDN via Hypervisor K3

CO3: Hypothesizing the Virtualized Multitenant Data Center SDN and VxLAN K5

CO4: Implementing the Composition of SDNs in python programming K3

CO5: Mind mapping the view of IETF SDN Framework and Data Center Orchestration K4

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 3 - - - 1 1 2 1 2 2

CO2 3 2 2 2 2 - - - 1 1 2 1 2 2

CO3 2 2 2 2 3 - - - 1 1 2 1 2 2

CO4 2 2 2 2 2 - - - 1 1 2 1 2 2
 CO5 2 2 3 2 3 - - - 1 1 2 1 2 2

2.4 2 2.4 2 2.6 - - - 1 1 2 1 2 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams
✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test
✔ ✔

OCSE01 APPLICATIONS OF AI 3 0 0 3

Course Objectives

⮚ To give deep knowledge of AI and how AI can be applied in various fields to make the life easy

UNIT I 9hours

Linguistic aspects of natural language processing, A.I. And Quantum Computing, Applications of
Artificial Intelligence (AI) in business.

UNIT II 9hours

Emotion Recognition using human face and body language, AI based system to predict the diseases
early, Smart Investment analysis, AI in Sales and Customer Support

UNIT III 9hours

Robotic Processes Automation for supply chain management.

UNIT IV 9 hours
AI-Optimized Hardware, Digital Twin i.e. AI Modelling, Information Technology & Security using AI.

UNIT V 9hours

Recent Topics in AI/ML: AI/ML in Smart solutions, AI/ML in Social Problems handling, Block chain and
AI.

TOTAL :45 hours

Text Books:

T1: Sameer Dhanrajani, AI and Analytics, Accelerating Business Decisions, John Wiley & Sons.
T2: Life 3.0: Being Human in the Age of Artificial Intelligence by Max Tegmark, published July 2018.
T3: Homo Deus: A Brief History of Tomorrow by Yuval Noah Harari, published March 2017.
T4: Artificial Intelligence in Practice: How 50 Successful Companies Used AI and Machine Learning to Solve
Problems, Bernard Marr, Matt Ward, Wiley.

Reference Books:

R6: Somogyi, Zoltán. The Application of Artificial Intelligence: Step-by-Step Guide from Beginner to
Expert. Switzerland, Springer International Publishing, 2022.
R7: Artificial Intelligence Applications in Information and CommunicationTechnologies. Germany, Springer
International Publishing, 2015.

COURSE OUTCOMES

Demonstrate fundamental understanding of the history of artificial intelligence (AI)

CO1: K3
and its foundations.

CO2: To apply the Basic Concepts of Machine Learning K4

CO3: To build various machine learning algorithms using Linear models K5

CO4: To apply ML techniques to application and evaluate the models K4

Apply basic principles of AI and ML in solutions that require problem solving,

CO5: K4
inference, perception, knowledge representation, and learning.

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 2 - - - - - - - 2 3

CO2 3 2 2 2 2 - - - - - - - 2 3
CO3 3 3 3 2 2 - - - - - - - 2 3

CO4 3 3 2 2 3 - - - - - - - 2 3

CO5 2 2 3 2 3 - - - - - - - 2 3

2.8 2.6 2.6 2.2 2.4 - - - - - - - 2 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 PROFESSIONAL ELECTIVE COURSE (BLENDED)

CSE DATA EXPLORATION AND VISUALIZATION 3 0 0 3

Course Objectives
To understand the basics of Data Explorations and the concepts of Data visualization
⮚ To explore and apply various data visualization techniques for a variety of tasks using R
⮚
language

UNIT I INTRODUCTION TO DATA EXPLORATION 9 hours

Introduction to Single variable: Distribution Variables - Numerical Summaries of Level and Spread -
Scaling and Standardizing – Inequality - Smoothing Time Series.

UNIT II INTRODUCING TWO VARIABLE AND THIRD VARIABLE 9 hours

Relationships between Two Variables - Percentage Tables - Analyzing Contingency Tables -
Handling Several Batches - Scatter plots and Resistant Lines – Transformations - Introducing a
Third Variable - Causal Explanations - Three-Variable Contingency Tables and Beyond -
Longitudinal Data.
UNIT III BASICS OF DATA VISUALIZATION 9 hours
The Seven Stages of Visualizing Data - Getting Started with Processing - Mapping - Time Series -
Connections and Correlations - Scatter plot Maps - Trees, Hierarchies, and Recursion - Networks
and Graphs – Acquiring Data – Parsing Data
UNIT IV DATA EXPLORATION AND DATA VISUALIZATION IN R 9 hours
Introduction to R and Studio - The Basics of Data Exploration - Loading Data into R -
Transforming Data - Creating Tidy Data

UNIT V TECHNIQUES AND APPLICATIONS OF DATA EXPLORATION AND 9 hours

VISUALIZATION IN R
Basic Data Exploration Techniques – Basic Data Visualization Techniques - Visualizing Geographic
Data with ggmap - R Markdown - Case Study – Wildfire Activity in the Western United States -
Case Study – Single Family Residential Home and Rental Values

TOTAL : 45 hours
Text Books:

T4: Catherine Marsh, Jane Elliott, Exploring Data: An Introduction to Data Analysis for Social Scientists, Wiley
Publications, 2nd Edition, 2008.
T5: Visualizing Data: Exploring and Explaining Data with the processing Environment, O Reily
Publications, 2007
T6: Claus.O.Wlike, Fundamentals of Data Visualization, A primer on making informative and
compelling Figures, O’Reily Publications, 2019

Reference Books:

R8: Xiang Zhou, Sean, Yong Rui, Huang, Thomas S., Exploration of Visual Data, Springer Publications, 2003
R9: Eric Pimple, Data Visualization and Exploration with R, Geo Spatial Training service, 2017

Web Links:

15. https://onlinecourses.nptel.ac.in/noc22_mg09/preview
16. www.geeksforgeeks.org/data-visualization-in-r/

COURSE OUTCOMES

CO1: Demonstrate the basic of Data Exploration K3

CO2: Analyze the use of univariate and Multivariate Analysis for Data Exploration K4

CO3: Identify the various Data Visualization methods K2

CO4: Apply the concept of Data Visualization on various datasets K3

CO5: Apply the data visualization techniques using R language K3

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 3 - - - - - - - - 1 3
CO2 3 2 3 - 3 - - - - - - - 3 3

CO3 3 3 3 3 3 - - - - - - - 3 1

CO4 2 3 3 3 3 - - - - - - - 3 1

CO5 3 3 2 3 3 - - - - - - - 3 3

AVG 2.6 2.6 2.6 2.4 2.4 - - - - - - - 2.6 2.2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔

CSE BIG DATA ANALYTICS 3 0 0 3

Course Objectives:

1. To understand the need of Hadoop framework to process the Big Data

2. Introduction to theoretical techniques and practical tools used in data analytics

3. Applications in various engineering and scientific domains.

UNIT I Introduction Big Data and Hadoop Framework 12 hours

Data Storage and Analysis - Characteristics of Big Data – Big Data Analytics - Typical Analytical Architecture
– Requirement for new analytical architecture – Challenges in Big Data Analytics –
Need of big data frameworks, Introduction to Hadoop ecosystems. Hadoop Framework: Hadoop –
Requirement of Hadoop Framework - Design principle of Hadoop –Comparison with other system -
Hadoop Components –Hadoop Daemon’s – Working with HDFS Commands

UNIT II Mapreduce Programming 6 hours

Map Reduce working principle, Map Reduce types and formats, MapReduce features, Combiner
optimization,Map side join, Reduce SideJoin, Secondary sorting, Pipelining MapReduce jobs.

UNIT III R Programming 9 hours

History and overview of R , Install and configuration of R programming environment , Basic language
elements and data structures, Data input/output, Data storage formats , Subsettingobjects.

UNIT IVVisualization Using R 6 hours

Vectorization, Control structures, Functions, Scoping Rules, Loop functions, R Graphs and visualization
using lattice, ggplot2

UNIT VSpark Framework and Data Analysis Models 12 hours

Overview of Spark – Hadoop vs Spark – Cluster Design – ClusterManagement – performance,Application

Programming interface(API): Spark Context, Resilient Distributed Datasets, Creating RDD,RDD Operations,
Saving RDD - Lazy Operation – Spark Jobs-spark ML library.
Association and correlation analysis- regression models- Predictive analytics -Exploratory analysis.
Prescriptive analysis.

Lab session: Recent Trends 2 hours

Projects may be given as group projects.

The project component should be taken as real time applications like e-commerce, social medial,
streaming data and so on . The students should use the technologies learnt in theory to develop and
implement the project.

Total Lecture Hours: 45 hours

Text Book(s)

1. Garrett Grolemund, “Hands-On Programming with R” , O'Reilly Media, Inc, 2014.

2. Seema Acharya, SubhashiniChellapan, “Big Data and Analytics”, Wiley, 2015.

3. Mike Frampton, “Mastering Apache Spark”, Packt Publishing, 2015.

Reference Books

1. Nick Pentreath, Machine Learning with Spark, Packt Publishing, 2015.

2. Donald Miner, Adam Shook, “MapReduce Design Pattern”, O’Reilly, 2012

 3. Raj Kamal, PreetiSaxena ,”Big Data Analytics:Introduction to Hadoop, Spark, and Machine-Learning”,
McGraw-Hill Education, 2019.

Web links:

W1:https://nptel.ac.in/courses/106104189

W2: https://nptel.ac.in/courses/106106142

Course Outcomes

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

Course Knowledge
Description
Outcome Level
Discuss the challenges and their solutions in Big Data and work on Hadoop k1
CO1
Framework
k2
CO2 Understand the concepts of R programming and its applications.

Implement different statistical methods on sample data using R k5

CO3
Programming library.
Analyse the Big Data using Map-reduce programming in Both Hadoop and k4
CO4
Spark framework.
Demonstrate spark programming with different programming languages k5
CO5

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 2 2 0 1 2 2 2 2 3 2
CO2 3 3 3 3 2 2 0 1 2 2 2 2 3 2
CO3 3 3 3 3 2 2 1 1 2 2 2 2 3 2
CO4 3 3 3 3 2 2 0 1 2 2 2 2 3 2
CO5 2 3 3 3 2 2 1 1 2 2 2 2 3 2
AVG 2.8 3 3 3 2 2 0.4 1 2 2 2 2 3 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
 CSE NOSQL DATABASE 3 0 0 3

Course Objectives

⮚ To explore the origins of NoSQL databases and the characteristics that distinguish them from
traditional relational database management systems
⮚ To understand the architectures and common features of the main types of NoSQL databases
(key-value stores, document databases, column-family stores, graph databases)
To discuss the criteria that decision makers should consider when choosing between relational
⮚
and non-relational databases and techniques for selecting the NoSQL database that best addresses
specific use cases
UNIT I NOSQL DATA ARCHITECTURE PATTERNS 12 hours

NoSQL Data model: Aggregate Models- Document Data Model- Key-Value Data Model- Columnar Data
Model, Graph Based Data Model Graph Data Model, NoSQL system ways to handle big data problems,
Moving Queries to data, not data to the query, hash rings to distribute the data on clusters, replication to
scale reads, Database distributed queries to Data nodes.
UNIT II KEY VALUE DATA STORES 12 hours

From array to key value databases, Essential features of key value Databases, Properties of keys,
Characteristics of Values, Key-Value Database Data Modeling Terms, Key-Value Architecture and
implementation Terms, Designing Structured Values, Limitations of Key- Value Databases, Design
Patterns for Key-Value Databases, Case Study: Key-Value Databases for Mobile Application
Configuration

UNIT III DOCUMENT ORIENTED DATABASE 12 hours

Document, Collection, Naming, CRUD operation, querying, indexing, Replication, Sharding, Consistency
Implementation: Distributed consistency, Eventual Consistency, Capped Collection, Case studies:
document oriented database: Mongo DB and/or Cassandra

UNIT IV COLUMNAR DATA MODEL 12 hours

Data warehousing schemas: Comparison of columnar and row-oriented storage, Column-store

Architectures: C-Store and Vector-Wise, Column-store internals and, Inserts/updates/deletes, Indexing,
Adaptive Indexing and Database Cracking. Advanced techniques: Vectorized Processing, Compression,
Write penalty, Operating Directly on Compressed Data Late Materialization Joins , Group-by,
Aggregation and Arithmetic Operations, Case Studies

UNIT V DATA MODELING WITH GRAPH 12 hours

Comparison of Relational and Graph Modeling, Property Graph Model Graph Analytics: Link analysis
algorithm- Web as a graph, Page Rank- Markov chain, page rank computation, Topic specific page rank
(Page Ranking Computation techniques: iterative processing, Random walk distribution Querying Graphs:
Introduction to Cypher, case study: Building a Graph Database Application- community detection

TOTAL : -- 60 hours

Text Books:

T1 Christopher D.manning, Prabhakar Raghavan, Hinrich Schutze, An introduction to

Information Retrieval, Cambridge University Press
T2 Daniel Abadi, Peter Boncz and Stavros Harizopoulas, The Design and Implementation of
Modern Column-Oriented Database Systems, Now Publishers.

Reference Books:

R1 Guy Harrison, Next Generation Database: NoSQL and big data, Apress

Web Links:
 L1 https://www.mongodb.com/
L2 https://university.mongodb.com/
L3 https://www.ibm.com/cloud/learn/nosql-databases
L4 https://www.coursera.org/lecture/nosql-databases/introduction-to-nosql-VdRNp

COURSE OUTCOMES

CO1: Differentiate and identify right database models for real time applications K4

CO2: Outline Key value architecture and characteristics K2

CO3: Design Schema and implement CRUD operations, distributed data operations K6

Compare data ware housing schemas and implement various column store
CO4: K4
internals

CO5: Develop Application with Graph Data model K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 3 3 3 - - - - - - - 3 3

CO2 2 2 2 3 3 - - - - - - - 3 3

CO3 2 3 3 3 3 - - - - - - - 3 3

CO4 2 3 2 3 3 - - - - - - - 3 3

CO5 1 2 3 3 3 - - - - - - - 3 3

1.8 2.6 2.6 3 3 - - - - - - - 3 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

√ √ √ √ √ √

Quiz MCQ Projects Seminars Demonstration/ Open book

Presentation test

√ √ √ √ √
 ROBOTICS AND ITS APPLICATION 3 0 0 3

COURSE OBJECTIVES

1. To understand the basic concepts associated with the design, functioning, applications
and social aspects of robots
2. To study about the electrical drive systems and sensors used in robotics for various
applications
3. To learn about analyzing robot kinematics, dynamics through different methodologies
and study various design aspects of robot arm manipulator and end-effector
4. To learn about various motion planning techniques and the associated control
architecture
5. To understand the implications of AI and other trending concepts of robotics.

UNIT I FOUNDATION 9

Introduction – Brief history – Definition – Anatomy – Types – Classification – Specification and

need based applications – Role and need of robots for the immediate problems of the society –
Future of mankind and automation-ethical issues – Industrial scenario local and global – Case
studies on mobile robot research platform and industrial serial arm manipulator.

UNIT II BUILDING BLOCKS OF A ROBOT 9

Types of electric motors : DC – Servo – Stepper; Specification – Drives for motors – Speed &
direction control and circuitry – Selection criterion for actuators – Direct drives – Non-traditional
actuators - Sensors for localization – Navigation – Obstacle avoidance and path planning in
known and unknown environments – Optical – Inertial – Thermal – Chemical – Biosensor – Other
common sensors – Case study on choice of sensors and actuators for maze solving robot and self
driving cars.

UNIT III KINEMATICS, DYNAMICS AND DESIGN OF ROBOTS & END-EFFECTORS 9

Robot kinematics – Geometric approach for 2R, 3R manipulators – homogenous transformation

using D-H representation – Kinematics of WMR – Lagrangian formulation for 2R robot dynamics
– Mechanical design aspects of a 2R manipulator, WMR – End-effector : Common types and
design case study.

UNIT IV NAVIGATION, PATH PLANNING AND CONTROL ARCHITECTURE 9

Mapping & Navigation – SLAM, Path planning for serial manipulators – Types of control
architectures – Cartesian control – Force control and hybrid position/force control – Behaviour
based control – Application of Neural network, fuzzy logic, optimization algorithms for navigation
problems – Programming methodologies of a robot.

UNIT V AI AND OTHER RESEARCH TRENDS IN ROBOTICS 9

Application of Machine learning – AI – Expert systems – Tele-robotics and Virtual reality – Micro
&Nanorobots – Unmanned vehicles – Cognitive robotics – Evolutionary robotics – Humanoids.

Total Periods: 45

COURSE OUTCOMES

After the completion of this course, students will be able to:

1. Understand the concepts of industrial robots(K2)
2. Examine different sensors and actuators for applications like maze solving and self
driving cars (K2)
3. Design a 2R robot & an end-effector and solve the kinematics and dynamics of motion
for robots (K3)
4. Understand the navigation and path planning techniques for robot motion planning (K2)
5. Undertstand the impact and progress of AI in the field of robotics (K2).

TEXT BOOKS

1. Saeed B Niku, “Introduction to Robotics, Analysis, System, Applications”, Pearson

educations, 2002.
2. Roland Siegwart, Illah Reza Nourbakhsh, “Introduction to Autonomous Mobile Robots”,
MIT Press, 2011.

REFERENCES

1. Richard David Klafter, Thomas A Chmielewski, Michael Negin, “Robotic engineering: An

Integrated Approach”, Prentice Hall, 1989.
2. Craig, J J, “Introduction to Robotics: Mechanics and Control”, 2nd Edition, Addison-
Wesley, 1989.
3. K S Fu, R C Gonzalez and C S G Lee, “Robotics: Control, Sensing, Vision and Intelligence”,
McGraw-Hill, 1987.
4. Wesley E Snyder R, “Industrial Robots, Computer Interfacing and Control”, Prentice Hall
International Edition, 1988.
5. Robin Murphy, “Introduction to AI Robotics”, MIT Press, 2000.

6. CO PO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 K2 3 - - - - - - - - - - - 2 -

CO2 K2 3 2 - - - - - - - - - - 2 -

CO3 K3 3 2 - - - - - - - - - 3 -

CO4 K2 3 2 - - - - - - - 3 - 3 3 -

CO5 K2 3 2 - - - - - - - - 3 3

Score 15 8 - - - - - - - 3 - 3 13 3

Course 3 2 - - - - - - - 3 - 3 3 3
Mapping
 CSE CONCEPTS OF VIRTUAL AND AUGMENTED REALITY 3 0 0 3

Course Objectives
To learn about the principles and multidisciplinary features of virtual reality.
⮚ To study the technology for multimodal user interaction and perception in VR,
⮚
in particular the visual, audial and haptic interface and behavior.
To teach students the technology for managing large scale VR environment
⮚
framework development tools in real time.

UNIT I Virtual reality and virtual environments: 9 hours

The historical development of VR, scientific landmarks computer graphics, real-time computer
graphics, virtual environments, requirements for VR, benefits of virtual reality. Hardware
technologies for 3D user interfaces: visual displays, auditory displays, hap tic displays, choosing
output devices for 3D user interfaces.

UNIT II 3D user interface input hardware and Software technologies: 9 hours

Input device characteristics, desktop input devices, tracking devices, 3d mice, special purpose input
devices, direct human input, home - brewed input devices, choosing input devices for 3D interfaces.
Software technologies: database - world space, world coordinate, world environment, objects -
geometry, position / orientation, hierarchy, bounding volume, scripts and other attributes, VR
environment - VR database, tessellated data, LODs, Cullers and Occluders, lights and cameras, scripts,
VR toolkits, available software in the market.

UNIT III 3D interaction techniques: 9 hours

3D manipulation tasks, interaction techniques for 3D manipulation, design guidelines – 3D travel tasks,
travel techniques, design guidelines - theoretical foundations of wayfinding, user centered wayfinding
support, environment centered wayfinding support, evaluating wayfinding aids, design guidelines -
system control, classification, graphical menus, voice commands, Gestrual commands, tools,
multimodal system control techniques, design guidelines.

UNIT IV Advances in 3D user interfaces: 9 hours

3D user interfaces for the real world, AR interfaces as 3D data browsers, 3D augmented reality
interfaces, augmented surfaces and tangible interfaces, agents in AR, transitional AR-VR interfaces -
3d interaction techniques, 3d UI design and development, 3D UI evaluation and other issues.

UNIT V Virtual reality applications: 9 hours

Engineering, architecture, education, medicine, entertainment, science, training.

TOTAL : -- 45 hours
Text Books:

1. Paul Mealy, Virtual & Augmented Reality for Dummies, John Wiley & Sons.
2. Alan B Craig, William R Sherman and Jeffrey D Will, “Developing Virtual Reality
Applications: Foundations of Effective Design”, Morgan Kaufmann.
Reference Books:
1. Gerard Jounghyun Kim, “Designing Virtual Systems: The Structured Approach”.
2. Doug A Bowman, Ernest Kuijff, Joseph J LaViola, Jr and Ivan Poupyrev, “3D User Interfaces,
Theory and Practice”, Addison Wesley, USA

Web Links:
17. https://edu.gcfglobal.org/en/thenow/understanding-virtual-reality-and-augmented-reality
18. https://www.intel.com/content/www/us/en/tech-tips-and-tricks/virtual-reality-vs-augmented-
reality.html

COURSE OUTCOMES

CO1: Articulate the historical development of VR and design of visual displays. K3

CO2: Integrating the 3D user interface input hardware and Software technologies K3

CO3: Hypothesizing the interaction techniques for 3D manipulation, design guidelines K5

CO4: Implement the AR-VR interfaces in 3d UI interaction techniques K3

Mind mapping the view of Virtual reality applications in Engineering,
CO5: K4
architecture, entertainment.

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 3 - -- - 1 1 2 1 2 2

CO2 3 2 2 2 2 - - - 1 1 2 1 2 2

CO3 2 2 2 2 3 - - - 1 1 2 1 2 2

CO4 2 2 2 2 2 - - - 1 1 2 1 2 2

CO5 2 2 3 2 3 - - - 1 1 2 1 2 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams
✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test
✔
 CSE DIGITAL IMAGE PROCESSING 3 0 0 3

Course Objective:

• Understand the digital image fundamentals.

• Improve their ability in image enhancement and restoration.
• Equip themselves with image segmentation and compression techniques
• Familiarize with the image representation and recognition
• Develop codes for various image processing techniques/applications using MATLAB Image Processing
Toolbox

UNIT I: DIGITAL IMAGE FUNDAMENTALS 9

Introduction -Origin – Fundamental Steps in Digital Image Processing – Components – Elements of Visual
Perception -Image Sensing and Acquisition – Image Sampling and Quantization -Relationships between
pixels -Introduction to Image processing toolbox in MATLAB

UNIT II: IMAGE ENHANCEMENT 9

Spatial Domain: Gray level transformations – Histogram processing -Basics of Spatial Filtering–Smoothing
and Sharpening Spatial Filtering -Frequency Domain: Basics of filtering – Smoothing and Sharpening
frequency domain filters. -MATLAB code for histogram equalization, spatial and frequency domain filter.

UNIT III: IMAGE RESTORATION AND SEGMENTATION 9

Noise models – Mean Filters – Order Statistics – Adaptive filters – Band reject Filters – Band pass Filters –
Inverse Filtering – Wiener -Segmentation: Point, Line, and Edge Detection- Marr-Hildreth & Canny edge
detector -–Edge Linking and Boundary detection Local & Regional processing – Region based
segmentation -Morphological processing – Watershed segmentation algorithm. -MATLAB code for
restoring an image after degradation using adaptive and wiener filter – Edge detection operators

UNIT IV: WAVELETS AND IMAGE COMPRESSION 9

Wavelets – Sub band coding – Multi resolution expansions -Compression: Fundamentals – Image
Compression methods – Huffman, Arithmetic coding -LZW coding, Run Length Encoding, Block Transform
coding, Wavelet coding, JPEG standard. -MATLAB code for image compression: Huffman coding ,
Arithmetic coding, wavelet coding

UNIT V: IMAGE REPRESENTATION AND RECOGNITION 9

Boundary representation – Chain Code – Polygonal approximation, signature, boundary segments -

Boundary description – Shape number – Fourier Descriptor -Patterns and Pattern classes – Recognition
based on matching -MATLAB code for image boundary segments, Fourier Descriptor, Recognition based
on matching

TOTAL : 45 h

TEXT BOOK:

1. Rafael C.Gonzalez and Richard E.Woods, “Digital Image Processing”, Third Edition, Pearson Education,
2010.

REFERENCE BOOKS:

1. Rafael C.Gonzalez, Richard E.Woods, Steven L. Eddins, “Digital Image Processing using Matlab”, Third
Edition, Tata McGraw Hill Pvt. Ltd, 2011.

2. William K Pratt, Digital Image Processing, John Willey (2001).

Web Links:
L1: https://nptel.ac.in/courses/117105135

COURSE OUTCOMES:
At the end of this course the students will be able to,
Course Knowledge
Description
Outcome Level
Develop various algorithms for restoring an image after
CO1 K6
degradation.

CO2 Apply image compression & segmentation K3

Apply various coding techniques to perform image

CO3 K3
compression

Design matlab code to perform histogram equalization in

CO4 k6
spatial and frequency domain

Elaborate boundary segments and recognize based on

CO5 K6
matching

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 2 - 1 2 3 2 3 3 2

CO2 3 3 3 3 3 2 - 1 2 3 2 3 3 2

CO3 3 3 3 3 3 2 1 1 2 3 2 3 3 2
CO4 3 3 3 3 3 2 - 1 2 3 2 3 3 2
CO5 2 3 3 3 3 2 1 1 2 3 2 3 3 2
Average 2.8 3 3 3 3 2 0.4 1 2 3 2 3 3 2

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Exams Assignments

✔ ✔ ✔ ✔ ✔
Demonstration /
Quiz MCQ Projects Seminars
Presentation

✔ ✔
OPEN ELLECTIVE COURSES
OCSE01 Data Structures and Algorithms 3 0 0 3

COURSE OBJECTIVES:
⮚ To understand the basic concepts of data structures and algorithms.
To differentiate linear and non-linear data structures and the operations upon them.
⮚ To perform sorting and searching in a given set of data items.
⮚ To comprehend the necessity of time complexity in algorithms.
⮚

UNIT I Introduction to Algorithms and Analysis 9 hours

Overview and importance of algorithms and data structures. Fundamentals of algorithm analysis, Space
and time complexity of an algorithm, Types of asymptotic notations and orders of growth, Algorithm
efficiency – best case, worst case, average case, Analysis of non-recursive and recursive algorithm

UNIT II Linear Data Structures 9 hours

Array- 1D and 2D array, Stack - Applications of stack: Expression Evaluation - Conversion of Infix to
postfix and prefix expression, Tower of Hanoi. Queue - Types of Queues: Circular Queue, Double Ended
Queue (deQueue), Applications – Priority Queue using Arrays - List - Singly linked lists – Doubly linked
lists - Circular linked lists

UNIT III Sorting and Search Techniques 9 hours

Searching - Linear Search and binary search, Applications - Finding square root of ‘n’-Longest Common
Prefix- Sorting – Insertion sort - Selection sort – Bubble sort – Quick sort- Merge sort, Analysis,
Applications

UNIT IV Non-linear Data Structures 9 hours

Tree, Binary Tree – Terminology and Properties, Tree Traversals, Binary Search Trees – operations in BST
– insertion, deletion, finding min and max, Applications - Graph – basic definition and Terminology –
Representation of Graph – Graph Traversal: Breadth First Search (BFS), Depth First Search (DFS) -
Minimum Spanning Tree: Prim's, Kruskal's Algorithm.

UNIT V Hashing and Balanced Binary Search Trees 9 hours

Hash functions, open hashing-separate chaining, closed hashing - linear probing, quadratic probing,
double hashing, random probing, rehashing, extendible hashing, Applications - AVL trees – Terminology
- basic operations (rotation, insertion and deletion) - Recent trends in algorithms and data structures

TOTAL: 60 hours
TEXT BOOKS:

T3: Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms, Third edition, MIT
Press, 2009.
T4: Mark A. Weiss,Data Structures & Algorithm Analysis in C++, 3rd edition, 2008, PEARSON.

REFERENCE BOOKS:

R2: Kurt Mehlhorn, and Peter Sanders – Algorithms and Data Sturctures, The Basic Toolbox, Springer-Verlag
Berlin Heidelberg, 2008.
R3: Horowitz, Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C UNIVERSITIES PRESS,Second
Edition,2008.

WEB LINKS:

2. https://nptel.ac.in/courses/106102064
3. https://archive.nptel.ac.in/courses/106/106/106106127/

COURSE OUTCOMES:

Understand the fundamental analysis and compute time complexity for a given
CO1: K3
problem

Articulate linear data structures and perform various operations permitted on

CO2: K2
them

CO3: Design and applya suitable algorithm for searching and sorting problems K6

CO4: Develop an algorithm using non-linear data structures K6

Understand and apply appropriate hashing techniques to find solutions for

CO5: K6
practical problems

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE02 INTERNET OF THINGS 3 0 0 3

COURSE OBJECTIVES:
To understand the basics of IoT and its application sectors
⮚ To understand M2M and IoT
⮚ To understand and become proficient in IoT platforms
⮚ To understand and apply IoT protocols appropriately
⮚ To design and develop IoT based applications
⮚

UNIT I INTRODUCTION AND CONCEPTS OF IOT 9 hours

Introduction to IOT, definition and characteristics of IOT - Architecture of Internet of Things, Physical and
logical design of IOT, IOT enabling technologies, IOT levels and deployment templates-Domain specific
IOTs, home automation, cities, environment, Domain specific IOTs, Energy, retail, agriculture, industry,
health and lifestyle

UNIT II IOT AND M2M COMMUNICATION 9 hours

M2M, difference between IOT and M2M, ETSI M2M Architecture, system architecture -ETSI M2M SCL
resource structure, Security in ETSI M2M framework, SDN and NFV for IOT, IOT system management,
need for IOT system management -SNMP, Network operator requirements, NETCONF-YANG, IOT system
management with NETCONF-YANG, IoT Design methodology-case study on IOT system for Weather
Monitoring

UNIT III IOT PLATFORMS 9 hours

Introduction to Hardware used for IoT: Microcontrollers, Microprocessors, SoC, Sensors -Introduction to
Arduino, Pi, Spark, Intel Galileo

UNIT IV IOTTECHNICAL STANDARDS AND PROTOCOLS s 9 hours

RF Protocols: RFID, NFC;IEEE 802.15.4: ZigBee, Z-WAVE, THREAD; Bluetooth Low Energy (BLE), IPv6 for
Low Power and Lossy Networks (6LoWPAN) and Routing Protocol for Low power and lossy networks (RPL)
-CoAP,XMPP, Web Socket, AMQP, MQTT, WebRTC, PuSH -Architectural Considerations in Smart Object
Networking

UNIT V DEVELOPING INTERNET OF THINGS 9 hours

IoT platforms design methodology, IoT Physical devices and endpoints -IoT Systems: Logical design using
Python, IoT physical servers and cloud offerings (Cloud computing for IoT)

TOTAL: 45 hours

TEXT BOOKS:

T4: ArshdeepBahga, Vijay Madisetti, “Internet of Things, A Hands -on Approach”, 1st Edition 2015, University
Press, ISBN: 978-81-7371- 954-7
T5: Oliver Hersent, David Boswarthick, Omar Elloumy, “The Internet of Things”,1st Edition2015,ISBN: 978-81-
265-5686-1
T6: Michael Miller, “The Internet of Things, How Smart TVs, Smart Cars, Smart Homes, and Smart Cities are
changing the World”, First edition ,2015, Pearson, ISBN:978-93-325-5245-6

WEB LINKS:

7. https://archive.nptel.ac.in/courses/106/105/106105166/
8. https://nptel.ac.in/courses/108108098
9. https://thingsee.com/blog/quality-hardware-list-for-your-iot-projects
10. https://tools.ietf.org/html/rfc7452
11. http://dret.net/lectures/iot-spring15/protocols
12. http://iot.intersog.com/blog/overview-of-iot-development-standards-and-frameworks
COURSE OUTCOMES:

CO1: Apply IOT architecture at various application domains K3

CO2: Examine M2M Communication and architecture K4

CO3: Experiment with various IoT platforms K3

CO4: Utilize different standards and protocols K3

CO5: Construct Cloud computing for IoT K3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔
 OCSE03 PYTHON PROGRAMMING 3 0 0 3

COURSE OBJECTIVES:
⮚ To understand the basic and advanced features of core language built in functions
⮚ To handle and control system/OS level features
⮚ To communicate using sockets, write client and server-side scripts
⮚ To design and implement basic applications with database connectivity

UNIT I PYTHON BASICS 9 hours

Introduction to Python, Python Interpreter and its working, Syntax and Semantics- Data Types: Booleans
- Numbers - Lists - Tuples – Set - Dictionaries - Comprehensions - Assignments and Expressions, Control
Flow Statements - Functions and lambda expressions

UNIT II PYTHON ADVANCED FEATURES 9 hours

Iterations and Comprehensions - Handling text files - Modules, Classes and OOP - Exception Handling -
Strings and Regular Expressions

UNIT III SYSTEM PROGRAMING 9 hours

System tools: OS and Sys modules - Directory Traversal tools - Parallel System tools: threading and queue,
Program Exits

UNIT IV NETWORK AND WEB PROGRAMMING 9 hours

Socket Programming: Handling Multiple Clients - Client side scripting, urlib - Server Side Scripting: CGI
Scripts with User Interaction, Passing Parameters

UNIT V GUI PROGRAMMING AND DATABASE CONNECTIVITY 9 hours

Introduction to tkinter, Top Level Windows, Dialogs, Message and Entry - Event Handling, Menus,
Listboxes and Scrollbars, Text - SQL Database interfaces with sqlite3: Basic operations and table load
scripts

TOTAL: 45 hours

TEXT BOOKS:

T1: Allen B. Downey, “Think Python: How to Think Like a Computer Scientist’’, 2nd edition, Shroff/O’Reilly
Publishers, 2016.
T2: Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python” –Network Theory Ltd., 2011.

REFERENCE BOOKS:

R1: Mark Lutz, “Learning Python”, O Reily, 4thEdition, 2009, ISBN: 978-0-596 15806-4,5th edition, 2013
R2: Mark Lutz, “Programming Python”, O Reily, 4thEdition, 2010
R3: Tim Hall and J-P Stacey, “Python 3 for Absolute Beginners” , 2013
R4: Magnus Lie Hetland , “Beginning Python: From Novice to Professional”, 3rd Edition, 2013

WEB LINKS:

1. http://greenteapress.com/wp/think-python/
2. https://archive.nptel.ac.in/courses/106/106/106106182/

COURSE OUTCOMES:

CO1: To build programs using List,Tuples,Set,Dictionary K3

CO2: To Utilize string functions and regular expression K3

CO3: To performdirectory traversalsand parallel processing K4

CO4: To develop server side and client side scripting K3

CO5: To create programs with database connectivity K6

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE04 ARTIFICIAL INTELLIGENCE 3 0 0 3

COURSE OBJECTIVES:
⮚ To know about the basic knowledge representation, problem solving and learning methods,
⮚ To design an intelligent agent that can solve ontological problems and to learn about the search
strategies,
⮚ To learn the applicability, strengths and weaknesses to solve particular engineering problems.

UNIT I INTRODUCTION 9 hours

Artificial Intelligence: Definition-Turing Test-Relation with other Disciplines-History of AI Applications-
Agent: Intelligent Agent-Rational Agent - Nature of Environments-Structure of Agent-Problem Solving
Agent - Problems: Toy Problems and Real-world Problems-Uninformed Search Strategies: BFS, DFS, DLS,
IDS, Bidirectional Search - comparison of uninformed search strategies

UNIT II PROBLEM SOLVING 9 hours

Informed Search Strategies-Greedy best-first search-A* search-Heuristic functions-Local search
Algorithms and Optimization problems - Online Search Agent-Constraint Satisfaction Problems-
Backtracking Search for CSP’s – Local Search for Constraint Satisfaction Problems-Structure of Problems -
Adversarial Search-Optimal Decision in Games-Alpha-Beta Pruning-Imperfect Real Time Decisions-Games
that Include an Element of Chance

UNIT III KNOWLEDGE REPRESENTATION 9 hours

First-Order Logic:Syntax and Semantics of First-Order Logic: Models for first-order logic, Symbols and
Interpretations, Terms, Atomic sentences, Complex sentences, Quantifiers, Equality - Using First-Order-
Logic-Knowledge Engineering in First-Order-Logic- Inference in First-Order Logic: Inference rules-
Unification and Lifting-Forward Chaining-Backward Chaining-Resolution

UNIT IV LEARNING 9 hours

Learning from Observations: Forms of Learning - Learning Decision Trees: Decision Trees as Performance
elements, Expressiveness of decision trees, Inducing decision trees from examples, Choosing Attribute
tests, Assessing the performance of the learning algorithm, Noise and Overlifting, Broadening the
applicability of decision trees – Ensemble Learning - A Logical Formulation of Learning - Knowledge in
Learning - Explanation-Based Learning - Learning using Relevance Information - Inductive Logic
Programming

UNIT V APPLICATIONS 9 hours

Communication –Communication as action -A formal grammar for a fragment of English – Syntactic
Analysis – Augmented Grammars – Semantic Interpretation – Ambiguity and Disambiguation – Discourse
Understanding – Grammar Induction. Perception –Image Formation –Early Image Processing Operations
– Extracting Three Dimensional Information – Object Recognition – Using Vision for Manipulation and
Navigation

TOTAL: 45 hours

TEXT BOOKS:

T1: Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, 3rd Edition, Pearson
Education/ Prentice Hall of India 2010
T2: Poole, D. and Mackworth, A. 2010. Artificial Intelligence: Foundations of Computational Agents,
Cambridge University Press
T3: Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd, 2003.

REFERENCE BOOKS:

R1: Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata McGraw-Hill, 2003.
R2: Luger, G.F. 2008. Artificial Intelligence -Structures and Strategies for Complex Problem Solving, 6th edition,
Pearson

WEB LINKS:

1. https://nptel.ac.in/courses/106105078
2. https://nptel.ac.in/courses/106105079

CO1: Evaluate Artificial Intelligence (AI) methods and describe their foundations. K5

Apply basic principles of AI in solutions that require problem solving, inference, K3

CO2:
perception, knowledge representation and learning.

Interpret the knowledge representation and reasoning for solving real world K2
CO3:
problems

CO4: Formulate a learning framework involving AI methods K5

CO5: K6
Determinean efficient strategy for various applications of AI
ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE05 CLOUD COMPUTING 3 0 0 3

Course Objectives

To understand the concept of cloud and utility computing.

⮚
To understand the various issues in cloud computing.
⮚
⮚ To familiarize with the types of virtualization and the lead players in cloud.

UNIT I INTRODUCTION, PRINCIPLES AND ARCHITECTURE 9

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

UNIT II VIRTUALIZATION 9

Characteristics of virtualized environments - Taxonomy of virtualization techniques - Execution

virtualization -Machine reference model - Hardware-level virtualization – Hypervisors - Hardware
virtualization techniques -Operating system-level virtualization - Programming 210 language-level
virtualization - Application-level virtualization - Other types - Virtualization and cloud computing - Pros
and cons of virtualization - Technology examples - Xen: Paravirtualization - VMware: full virtualization -
Full virtualization and binary translation - Microsoft Hyper-V.

UNIT III CLOUD INFRASTRUCTURE 9

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

UNIT IV CLOUD PROGRAMMING AND SOFTWARE ENVIRONMENT 9

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

UNIT V CLOUD PLATFORMS AND APPLICATION 9

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

TOTAL : 45 hours

Text Books:

T1: Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud

Computing, From Parallel Processing to the Internet of Things”, Morgan Kaufmann Publishers, 2012.

T2: Rajkumar Buyya, Christian Vecchiola. S.Thamarai Selvi, “Mastering Cloud

Computing”, McGraw Hill Education, 2013.

Reference Books:

R10: James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for

Systems and Processes”, Elsevier/Morgan Kaufmann, 2005.

R11: George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in the
Cloud” O'Reilly.

R12: Ronald L. Krutz, Russell Dean Vines, “Cloud Security – A comprehensive Guide to Secure Cloud
Computing”, Wiley – India, 2010.

R13: John W.Rittinghouse and James F.Ransome, “Cloud Computing: Implementation,

Management, and Security”, CRC Press, 2010.

Web Links:

19. https://onlinecourses.nptel.ac.in/noc22_cs20/preview.

20. https://www.w3schools.in/cloud-computing.

COURSE OUTCOMES

Understand the broad perspective of cloud architecture, key technologies, principles,

CO1: strengths, limitations as well as the possible applications of the state-of-art of cloud K2, K3
computing.

Gain a basic knowledge of virtualization and its categorization and Design & develop
CO2: K3, K6
highly scalable cloud-based applications by creating and configuring virtual machines.

Compare, contrast, and evaluate the key trade-offs between multiple approaches to
CO3: cloud system design, and Identify appropriate design choices when solving real - world K4
cloud computing problems.
 Interpret some important cloud computing driven commercial systems such as: Google
CO4: Apps, Microsoft Azure and Amazon Web Services and other businesses cloud K5
applications.

CO5: Build and deploy cloud application using popular cloud platforms. K6

MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 3 0 3 - - - - - - - - 3

CO2 3 2 2 3 2 - - - - - - - - 3

CO3 3 2 3 3 3 - - - - - - - - 3

CO4 2 2 2 3 0 - - - - - - - - 3

CO5 0 2 3 3 3 - - - - - - - - 3

2.2 2 2.6 2.4 2.2 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔
 OCSE01 E COMMERCE 3 0 0 3

Course Objectives

⮚ To understand the nature of e-Commerce and recognize the business impact and potential of e-
Commerce
To learn the technologies required to make e-Commerce viable.
⮚ To know about the current drivers and inhibitors facing the business world in adopting and
⮚
using e-Commerce

UNIT I Introduction 9

Traditional commerce and Ecommerce - Categories of Electronic commerce – Business models – Revenue
models – Business processes. Internet and WWW–role of WWW–value chains–strategic business –
Revenue Strategy issues – Industry value chains - supply chain management–role of Ecommerce

UNIT II Infrastructure for E-Commerce 9

Packet switched networks–Routing packets. TCP/IP protocol script: IP Addressing – Domain names – E-
mail protocols. Internet utility programs–SGML,HTML and XML–web client and servers–Web client/server
architecture– intranet and extranets – Public and private networks – Virtual private network

UNIT III Web Based Tools for E-Commerce 9

Web server: Server computers –performance evaluation – Hardware architectures. Web server software
feature sets–web server software and tools– Internet Utility programs – Data analysis software – Link
checking utilities. web protocol–search engines–intelligent agents –EC software– webhosting–cost
analysis

UNIT IV Security 9

Computer security classification–copyright and Intellectual property–electronic commerce threats:

Secrecy threats – Integrity threats – Necessity threats Encryption solutions. Protecting client computers–
electronic payment systems– electronic cash–strategies for marketing–sales and promotion–
cryptography – authentication

UNIT V Intelligent Agents 9

Definition and capabilities–limitation of agents – History of software agents – Characteristics and

properties a of agents – Tele script Agent Language – safe-Tcl –security–web based marketing– search
engines and Directory registration–online advertisements– Portables and info mechanics–website design
issues.

TOTAL : -- 45 hours

Text Books:
T1 Ravi Kalakota, Andrew B. Whinston “ Frontiers of Electronic Commerce”,Pearson Education, 2008
T2 Gary PSchneider “Electronic commerce”, Thomson learning & James TPeny Cambridge USA, 2001
T3 Manlyn Greenstein and Miklos “Electronic commerce” McGraw-Hill, 2002.
Reference Books:

R1 Efraim TurvanJ.Lee, David Kug and Chung,“Electronic Commerce” Pearson EducationAsia2001.

R2 Brenda Kienew Ecommerce Business Prentice Hall,2001.
COURSE OUTCOMES

CO1: K3
Construct the implement various business models of E-Commerce
CO2: K4
Develop a policy and regulatory issues in E-commerce
CO3: K5
Evaluate the basic networking concepts
CO4: K3
Make use of the web client server architecture
CO5: Develop and acquire knowledge on web server concepts and its performance K6
evaluation
MAPPING OF COURSE OUTCOMES TO PROGRAM OUTCOMES

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 2 - - - - - - - - 3

CO2 3 2 2 2 2 - - - - - - - - 3

CO3 3 3 3 2 2 - - - - - - - - 3

CO4 2 3 2 2 3 - - - - - - - - 3

CO5 3 2 3 2 3 - - - - - - - - 3

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE08 BLOCK CHAIN TECHNOLOGIES 3 0 0 3

Course Objectives
⮚ To introduce Bit coin and other crypto currencies
⮚ To study the algorithms and techniques in block chain
⮚ To understand the practical aspects in the design of crypto currency
⮚ To understand the function of Block chains as a method of securing distributed ledgers
⮚ To design, code, deploy and execute a smart contract

UNIT I Introduction to Blockchain 9 hours

Basics of blockchain-Public Ledgers-Block Chain as Public Ledgers-Types of Block chains- Pillars of Block
chain-Government Initiatives of BlockChain-Bitcoin-SmartContracts

UNIT II Architecture and Conceptualization of Block Chain, Crypto Currencies 9 hours

Block in a Block chain-find Transactions-Distributed Consensus-Proof of work, Stake, Space-Attacks on
POW-Ethereum-Pos/POW Hybrids-Crypto currency to block chain 2.0, Model of Blockchain-Algorand

UNIT III Crypto Primitives, Securing and Interconnecting Public and Private Block 9 hours
Chains
Hash Function and Merle Tree-Security Properties-Security Considerations for block chain-Digital
Signature-Public Key Cryptography-Bit coinblock chain incentive structures- Nash Equilibriums-
evolutionary stable strategies, and Pareto- efficiency (game theory) Weaknesses and news Points of
Failure- Mitigation Methods-Redundancies and fall-back methods

UNIT IV Mining and Crypto Currencies - How to use and Interact 9 hours
Mining-Pools-Impact of CPU and GPU-Transaction in Bit coin Network- Block Mining-Block propagation
and block relay

UNIT V Blockchain Use Cases-Applications in Different Areas 9 hours

Industry applications of Blockchain-Blockchain in Government-Government use cases-Preventing
Cybercrime through block chain-Block Chain in defense, tax payments

TOTAL :45 hours

TEXT BOOKS:

T1: Mastering Bitcoin: Unlocking Digital Cryptocurrencies, by Andreas Antonopoulos O’Reilly, First
Edition, 2014.
T2: Blockchain by Melanie Swa, O’Reilly Media 2015
T3: Zero to Block chain - An IBM Redbooks course, by Bob Dill, David Smits
REFERENCE BOOKS:

R1: The Basics of Bitcoins and Blockchains: An Introduction to Cryptocurrencies and the Technology that
Powers Them, 2018 by Antony Lewis
R2: The Truth Machine: The Blockchain and the Future of Everything Paperback – 5 March 2019

COURSE OUTCOMES

CO1: K5
Explain the structure of a block chain
CO2: K4
Analyze the incentive structure in a block chain based system
CO3: K5
Judge the scenario where “smart” contract is most appropriate
CO4: K3
Identify basic knowledge of Bitcoin, Ethereum
CO5: K3
Apply Blockchain in future use cases for security

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE09 INTRODUCTION TO DATA ANALYTICS 3 0 0 3

Course Objectives
To provide the knowledge and expertise to become a proficient data scientist
⮚ To explore the fundamental concepts of big data & data analytics.
⮚ To gain knowledge on Hadoop related tools such as MongoDB, Cassandra, Pig, and Hive for big
⮚
data analytics

UNIT I Introduction to Big Data 9 hours

Types of Digital Data-Characteristics of Data – Evolution of Big Data – Definition of Big Data – Challenges
with Big Data – 3Vs of Big Data – Non Definitional traits of Big Data – Business Intelligence vs. Big Data –
Data warehouse and Hadoop environment – Coexistence.

UNIT II Big Data Analytics 9 hours

Classification of analytics – Data Science – Terminologies in Big Data – CAP Theorem – BASE Concept.
NoSQL: Types of Databases – Advantages – NewSQL – SQL vs. NOSQL vs NewSQL

UNIT III Introduction to Hadoop 9 hours

Features – Advantages – Versions – Overview of Hadoop Eco systems – Hadoop distributions – Hadoop
vs. SQL – RDBMS vs. Hadoop – Hadoop Components – Architecture – HDFS – Map Reduce: Mapper –
Reducer – Combiner – Partitioner – Searching – Sorting – Compression. Hadoop 2 (YARN): Architecture –
Interacting with Hadoop Eco systems

UNIT IV No SQL databases 9 hours

Mongo DB: Introduction – Features – Data types – Mongo DB Query language – CRUD operations – Arrays
– Functions: Count – Sort – Limit – Skip – Aggregate – Map Reduce. Cursors – Indexes – Mongo Import –
Mongo Export. Cassandra: Introduction – Features – Data types – CQLSH – Key spaces – CRUD operations
– Collections – Counter – TTL – Alter commands – Import and Export – Querying System tables.

UNIT V Hadoop Eco systems 9 hours

Hive – Architecture – data type – File format – HQL – SerDe – User defined functions – Pig: Features –
Anatomy – Pig on Hadoop – Pig Philosophy – Pig Latin overview – Data types – Running pig – Execution
modes of Pig – HDFS commands – Relational operators – Eval Functions – Complex data type – Piggy Bank
– User defined Functions – Parameter substitution – Diagnostic operator

TOTAL : -- 45 hours

TEXT BOOKS:
T2: Seema Acharya, Subhashini Chellappan, “Big Data and Analytics”, Wiley Publication, 2015

REFERENCE BOOKS:
R5: Judith Hurwitz, Alan Nugent, Dr. Fern Halper, Marcia Kaufman, “Big Data for Dummies”, John Wiley & Sons,
Inc., 2013.
R6: Tom White, “Hadoop: The Definitive Guide”, O’Reilly Publications, 2011.
R7: Kyle Banker, “Mongo DB in Action”, Manning Publications Company, 2012.
R8: Russell Bradberry, Eric Blow, “Practical Cassandra A developers Approach“, Pearson Education, 2014

COURSE OUTCOMES

CO1: Identify the need of big data K3

CO2: K5
Interpret basic concepts of data analytics
CO3: K4
Analyze the framework for storing the data
CO4: K4
Examine about NoSQL databases
CO5: K3
Choose an appropriate framework to solve real world problems

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔
 OCSE10 Fundamentals of AI and ML 3 0 0 3

Course Objectives
To understand the basics of Machine Learning (ML)
⮚ To program in Python ML Packages
⮚ To understand the methods of Machine Learning
⮚ To visualize a dataset
⮚

UNIT I INTRODUCTION TO ARTIFICIAL INTELLIGENCE 9 hours

Introduction – Foundations of AI – History of AI – Intelligent agent – Types of agents- Structure of agents
– Problem solving agents –Uninformed search strategies – Breadth first search – Uniform cost search –
Depth first search – Depth limited search

UNIT II INTRODUCTION TO MACHINE LEARNING 9 hours

Machine learning: Types of Machine Learning - Understanding data – Continuous variable, categorical
variable, Independent variable, dependent variable -Regression and classification- linear regression -
Machine Learning Life cycle - Data Preprocessing techniques – Feature selection

UNIT III MACHINE LEARNING ALGORITHMS 9 hours

Classification and Regression- Naïve bayes- Decision trees- Support Vector Machine (SVM) – Random
forest- Linear Regression-Logistic Regression - Unsupervised learning - K-means clustering- Principal
component analysis

UNIT IV MODEL EVALUATION 9 hours

Model Evaluation and Selection methods, Precision-Recall and ROC Curves Confusion Matrices,
Regression Evaluation, Optimizing Classifiers for Different Evaluation Metrics

UNIT V MACHINE LEARNING APPLICATIONS 9 hours

Image Recognition – Speech Recognition – Email spam and Malware Filtering – Online fraud detection –
Medical Diagnosis

TOTAL: 45 hours

TEXT BOOKS:

T1: Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012
T2: SebastainRaschka, “Python Machine Learning”, Packt publishing (open source).
REFERENCE BOOKS:

R1: Stephen Marsland, “Machine Learning –An Algorithmic Perspective”, CRC Press, 2009
R2: Hastie, Tibshirani, Friedman, “The Elements of Statistical Learning” (2nd ed)., Springer, 2008

WEB LINKS:

1. https://machinelearningmastery.com/types-of-learning-in-machine-learning/Online
2. https://www.coursera.org/learn/machine-learning
3. https://nptel.ac.in/courses/106/106/106106139/
4. https://www.timberlake.co.uk/machinelearning

COURSE OUTCOMES:

CO1: Demonstrate fundamental understanding of the history of artificial intelligence (AI) K3

and its foundations.
CO2: K4
To apply the Basic Concepts of Machine Learning
CO3: K5
To build various machine learning algorithms using Linear models
CO4: To apply ML techniques to application and evaluate the models K4

CO5: Apply basic principles of AI and ML in solutions that require problem solving, K4
inference, perception, knowledge representation, and learning.

ASSESSMENT METHODS:

CAT 1 CAT 2 Model Exam End Semester Assignments Case Studies

Exams

✔ ✔ ✔ ✔ ✔ ✔
Quiz MCQ Projects Seminars Demonstration/ Open book
Presentation test

✔ ✔ ✔ ✔ ✔ ✔