522CIT01 Artificial Intelligence and Machine Learning LTPC

3003

Objectives:
 Understand the Characteristics of Intelligent Agents
 Solve problems using various Search Strategies & Knowledge Representation Scheme
 TounderstandthebasicconceptsandtechniquesofMachineLearning.
 TohaveathoroughunderstandingofthewidelyusedMachinelearningalgorithms

UNIT– I INTRODUCTION TO AI 9

Introduction – Definition - Characteristics of Intelligent Agents – Typical Intelligent Agents – Problem solving Methods -
Search Strategies: Uninformed - Informed - Heuristics- Local Search Algorithms and Optimization Problems - Searching
with Partial Observations - Constraint Satisfaction Problems – Constraint Propagation -Backtracking Search.

UNIT– II KNOWLEDGE REPRESENTATION 9

Propositional Logic - First Order Logic: Syntax and Semantics – Extensions & Notational variations – Using First Order Logic
– Logical agents of Wumpus world - Knowledge Engineering – General ontology – Inference in First order Logic: Inference
Rules involving quantifiers – Forward and Backward Chaining – Resolution – Completeness of Resolution

UNITIII INTRODUCTION TO ML 9

Learning – Types of Machine Learning– SupervisedLearning – The Brain and the Neuron –Design a Learning System –
Issues in Machine Learning–ConceptLearningTask – Concept Learning as Search – Finding a Maximally Specific
Hypothesis – Version SpacesandtheCandidateEliminationAlgorithm–Perceptron–LinearSeparability - Linear Regression.

UNITIV LINEARMODELS 9

Multi-layer Perceptron – Going Forwards – Going Backwards: Back Propagation Error– Multi-layerPerceptroninPractice–
ExamplesofusingtheMLP–Overview–DerivingBack-Propagation–RadialBasisFunctionsandSplines–Concepts–RBFNetwork–
CurseofDimensionality–InterpolationsandBasisFunctions –SupportVectorMachines

UNITV TREEAND PROBABILISTICMODELS 9

LearningwithTrees–DecisionTrees–ConstructingDecisionTrees–ClassificationandRegressionTrees–EnsembleLearning–
Boosting–Bagging–DifferentwaystoCombineClassifiers– Nearest Neighbor Methods – Unsupervised Learning – K means
Algorithms –VectorQuantization–SelfOrganizingFeatureMap. Applications of AI and ML – Future of AI.

TOTAL: 45PERIODS
COURSEOUTCOMES

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

CO1: Understand various problem solving approaches for AI problems

CO2: Utilize various Knowledge Representation Techniques in solving complex real-life problems
CO3: Apply the learning concepts and derive hypothesis for a real world problem
CO4: Distinguish between, supervised, unsupervised and semi-supervised learning
CO5: Select the suitable machine learning strategy to real-world applications.

TEXTBOOK:

1. Stuart J Russell and Peter Norvig,” Artificial Intelligence - A Modern Approach”, Third Edition, Prentice Hall
of India/ Pearson Education, New Delhi, 2015.
2. Stephen Marsland, ―MachineLearning–AnAlgorithmicPerspective, SecondEdition,
ChapmanandHall/CRCMachine LearningandPatternRecognitionSeries, 2014.
3. Tom Mitchell, ―Machine Learning, First Edition, Mc GrawHillEducation,2013.

Reference Books:

1. M. Tim Jones, “Artificial Intelligence: A Systems Approach (Computer Science)”, Jones and Barlett Publishers, Inc., First
Edition 2008.
2. Stuart Russell (Author), Peter Norvig,Artificial Intelligence: A Modern Approach, Global Edition Paperback – 13 May
2021
3. Nils J. Nilsson, “The Quest for Artificial Intelligence”, Cambridge University Press, 2009.
4. William F. Clocksin and Christopher S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth edition,
Springer, 2003.
5. Eaine Rich, Kevin Knight, Shivashankar B. Nair, “Artificial Intelligence”, Third Edition, Tata McGraw-Hill Education, 2008.
6. SaikatDutt (Author), Subramanian Chandramouli (Author), Amit Kumar Das, Machine Learning, FirstEdition Paperback
Pearson – 1 October 2018
7. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that Make Sense ofData, FirstEdition,
CambridgeUniversityPress, 2012.
8. JasonBell,―Machinelearning–HandsonforDevelopersandTechnicalProfessionals,FirstEdition,Wiley,2014
CO’s-PO’s & PSO’s MAPPING

522CIT01 Artificial Intelligence and Machine Learning

CO/P PSO PSO PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
O 1 2 3

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

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

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

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

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

AVG 3 3 3 3 3 - - - - - - 2 3 2 3

3-HIGH, 2 MODERATE, 1-LOW, ‘- ‘NO CORRELATION

 522CIP07 Artificial Intelligence and Machine Learning Laboratory

Course Objectives:

 Familiar with basic principles of AI toward problem solving, knowledge representation, and learning
 Understand and Practice ML algorithms

List of Experiments:

1. Implementation of Uninformed search algorithm (BFS,DFS)

2. Implementation of Informed Search Algorithm
3. Practice on Basics of Prolog programming
4. Write a program in prolog to solve Monkey banana problem
5. Write a program in prolog for Water jug problem
6. Implement linear regression
7. Build decision tree.
8. Implement Back-propagation algorithm
9. Implement k-nearest neighbours classification using python
10. Implement K- Means Clustering algorithm

Recommended Projects: Students shall select any one project from each category

AI Based Projects:

1. Predictive Text Generator - Students will develop a text generator using models that can predict the next word in
a sentence based on previous words.
2. AI Chatbot -This project focuses on creating a chatbot that can understand and respond to user queries using
natural language processing
3. Voice-Activated System - This project involves creating a system capable of recognizing spoken words and
converting them into actions or responses.
4. Recommendation System - Build a recommendation engine that suggests products or content to users based on
their past behaviour and preferences.
ML Based Projects:

5. Disease Prediction Using Machine Learning

6. Fake News Detection using Machine Learning
7. Sentiment analysis with Twitter /Facebook data
8. Handwritten Digit Recognition using Neural Network
Course Outcomes:

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

CO1: Apply different searching algorithms

CO2: Solve real world problem using Prolog Programming.

CO3: Apply classification techniques to solve real world problem.

CO4: Simplify the AI workflows, data handling, and model building.

CO5: Select Machine learning model for any problem.

 CO’s-PO’s & PSO’s MAPPING

522CIP07 Artificial Intelligence and Machine Learning Laboratory

CO/P PSO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
O 1 2 3

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

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

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

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

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

AVG 3 3 3 3 3 - - - - - - 2 3 2 3

3-HIGH, 2 MODERATE, 1-LOW, ‘- ‘NO CORRELATION

 522CSI02 CRYPTOGRAPHY AND BLOCKCHAIN LTPC
3024
OBJECTIVES:

 To learn the fundamentals of Cryptography.

 To comprehend the Mathematical Foundations of Security Principles.
 To describe the principles of Public Key Cryptosystem, Hash Function, Key Management and
Internet Security.
 To understand the basics of Block chain
 To learn the components of Ethereum and Smart Contracts.

UNITI SYMMETRIC KEY ENCRYPTION 10

Computer Security Concepts – The OSI Security Architecture – Security Attacks – Security Services
and Mechanisms – A Model for Network Security - Classical Encryption Techniques -Block Ciphers and
the Data Encryption Standard - Block Cipher Operation - Advanced Encryption Standard: AES Structure,
AES Transformation Function

UNIT II NUMBER THEORY AND PUBLIC KEY ENCRYPTION 10

Basic Concepts in Number Theory: Prime Numbers, Modular Arithmetic, The Euclidean Algorithm,
Fermat’s and Euler’s Theorem- Testing for Primality - The Chinese Remainder Theorem – Public Key
Cryptography - Diffie Hellman Key Exchange and RSA - Cryptographic Hash Functions: Applications,
Secure Hash Algorithm (SHA) -Digital Signature - DSS, RSA and Elgamal Digital Signature.

UNIT III KEY MANAGEMENT AND INTERNET SECURITY 9

Key Management and Distribution - Authentication Applications: Kerberos- Biometrics- Electronic Mail
Security: PGP, S/MIME - IP Security Overview.
UNIT IVINTRODUCTION OF BLOCKCHAIN 8
Introduction – Origin of Block chain - Block chain Solution-Components of Block chain – Block in a
Block chain-The Technology and the Future-Block chain Types and Consensus Mechanism-Types of
Block chain-Consensus Protocol
UNIT VETHEREUM AND SMART CONTRACTS 8
Introduction– Code Is Law and Ethereum Classic-Ethereum Components- Mining works in Ethereum-
Merkle Patricia Tree-Architecture of Ethereum –Workflow of Ethereum. Smart Contracts- Characteristics
of a Smart Contract—Types of Smart Contracts-Types of Oracles-Smart Contracts in Ethereum-Smart
Contracts in Industry
TOTAL: 45 PERIODS
 COURSE OUTCOMES:
On successful completion of the course the students will be able to
CO1: Understand the fundamentals of network security and apply the symmetric encryption techniques to
Convert plain text to cipher text.
CO2: Understand number theory concepts and use in public key encryption
CO3: Apply key management and authentication techniques to provide secure Communication.
CO4: Understand Block chain’s fundamental components.
CO5: Implement the Block chain Applications using Ethereum platform.

Text Books:
1. William Stallings, “Cryptography and Network Security, Seventh Edition, Prentice Hall, New Delhi,
2017.
2.Subramanian, Chandramouli & George A., Asha & K.A., Abhilash & Karthikeyan, Meena., 2020.
"BLOCKCHAIN TECHNOLOGY" Universities Press (India) Pvt. Ltd., First edition, ISBN-10:
9389211638, ISBN-13: 978-9389211634

References
1.Charles P. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Fifth Edition, Prentice Hall,
2018.
2. Arun, Jai Singh & Cuomo, Jerry & Gaur, Nitin., 2019." Block chain for Business" Pearson Education,
First edition, ISBN-10: 938958888X, ISBN-13: 978-9389588880
3. Tulajadas Choudhari, Ambadas & Sarfarz Ariff, Arshad & M.R. Sham., 2020. "Block chain for
Enterprise Application Developers" Wiley, First edition, ISBN-10: 8126599960, ISBN-13: 978-
8126599967

CO’s-POs&PSO’sMAPPING

CO’s/PO’s 522CST02 CRYPTOGRAPHY AND BLOCKCHAIN

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO8 PO9 PO10 PO11 PO12 PSO PSO PSO
1 2 3
CO1 3 3 3 1 1 3 - 3 1 - 2 3 3 3 3

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

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

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

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

AVG 3 3 3 1 1 3 - 3 3 - 2 3 3 3 3
3-High 2-Moderate 1-Low ‘-‘– No Correlation
Lab Experiments:

1. Write a code to implement AES Encryption And Decryption

2. Implement Diffie–Hellman Algorithm
3. Implement RSA Algorithm
4. Implement Digital Signature Using RSA and SHA Algorithm
5. Creating Merkle tree
6. Creation of Block
7. Block chain Implementation
8. Implement block chain in Merkle Trees

Total Hours: 30
Programming Languages to be used: Java
 522CST03 COMPILER DESIGN LTPC
3003

PREREQUISITES: Theory of Computation.

OBJECTIVES
• To understand the phases of compiler.
• To learn the various parsing techniques.
• To understand intermediate code generation and run-time environment
• To Perceive the various storage allocation techniques
• To Acquaint how to generate and optimize the code
UNIT I INTRODUCTION TO COMPILER & LEXICAL ANALYSIS 9

Introduction – The Phases of Compiler – Lexical Analysis: Role of lexical analyzer – Input Buffering –
Specification of Tokens – Recognition of Tokens – Finite Automata – Regular Expression to FA (Direct
Method) – Minimizing DFA – Lex Tool.

UNIT II SYNTAX ANALYSIS 11

Role of the parser – Grammars – Context-Free Grammar - Top Down Parsing: Recursive Descent Parser
- Predictive Parser - LL(1) Parser – Bottom Up Parsing: Shift Reduce Parser – Operator Precedence Parser - LR
Parser – LR (0) Item - Construction of SLR Parsing Table – CLR Parser- Introduction to LALR Parser - Error
Handling and Recovery in Syntax Analyzer - YACC tool.

UNIT III SYNTAX DIRECTED TRANSLATION & INTERMEDIATE CODE GENERATION 9

Syntax Directed Definitions: Construction of Syntax Trees – Bottom-Up Evaluation of S-AttributeDefinitions

– L-Attributed Definitions -Specification of a simple type Checker - Equivalence of Type Expressions - Type
Conversions. Intermediate Languages: Syntax Tree, Three Address Code, Types and Declarations,
Translation of Expressions, Type Checking, Assignment Statements, Arrays, Boolean Expressions and back
patching.

UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 8

Runtime Environments: Source language issues – Storage organization – Storage Allocation Strategies:
Static, Stack and Heap allocation - Parameter Passing-Symbol Tables - Dynamic Storage Allocation – Code
generation: Issues in the Design of a code generator – Instruction Costs - Basic Blocks and Flow graphs -
Design of a simple Code Generator.

UNIT V CODE OPTIMIZATION 8

Principal Sources of Optimization – Peep-hole optimization – DAG - Optimization of Basic Blocks - Global
Data Flow Analysis - Constant Propagation-Partial Redundancy Elimination-loops in Flow Graphs.

TOTAL HOURS: 45

Sensitivity: Internal
 COURSE OUTCOMES
At the end of the course, the student should be able to:
CO 1: Design a lexical analyzer for a sample language and learn to use the LEX tool.
CO2: Apply different parsing algorithms to develop a parser and learn to use YACC tool.
CO3: Construct the intermediate code representation and generation.
CO4: Apply knowledge of run-time environments to debug and optimize programs during execution.
CO5: Apply the optimization technique to generate optimized code.

TEXT BOOK

1. Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, ―Compilers: Principles,Techniques
and Tools, Second Edition, Pearson Education, 2014(reprint).

REFERENCES

1. Randy Allen, Ken Kennedy, and Optimizing Compilers for Modern Architectures: A Dependence based
Approach, Morgan Kaufmann Publishers, 2002.
2. Steven S. Muchnick, “Advanced Compiler Design Implementation”, First Edition Elsevier Science
India, Morgan Kaufmann Publishers, 2008
3. Jean Paul Tremblay, Paul G Serenson, "The Theory and Practice of Compiler Writing",McGraw Hill, New
Delhi, 2007.
4. Dick Grone, Henri E Bal, Ceriel J H Jacobs and Keen Gang endoen, Modern Compiler Design”, John
Wiley, New Delhi, 2009.
5. V. Raghavan, Principles of Compiler Design, Tata McGraw Hill Education Publishers, 2010.
CO’s-PO’s & PSO’s MAPPING

CO’s/ 522CST03 COMPILER DESIGN

PO’s PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 3 1 - - - 3 3 1 3 2 3 2
CO2 3 3 3 3 3 - - - 3 2 3 2 2 1 2
CO3 3 3 2 2 3 - - - 3 1 1 1 2 2 3
CO4 3 2 2 1 1 - - - 2 3 2 3 1 2 1
CO5 3 3 3 2 1 - - - 2 1 1 3 2 1 2
AVG 3 2.8 2.6 2.2 1.8 - - - 2.6 2 1.6 2.4 1.8 1.8 2

1 – Low 2 - Medium, 3 - High, “-“- No Correlation

Sensitivity: Internal
 522CIT04 WEB ESSENTIALS L T P C

30 0 3
COURSE OBJECTIVES:
• To understand different Internet Technologies
• To learn java-specific web services architecture
• To Develop web applications using frameworks

UNIT I WEBSITE BASICS 9

Internet Overview - Fundamental computer network concepts - Web Protocols - URL – Domain
Name- Web Browsers and Web Servers- Working principle of a Website –Creating a Website -
Client-side and server-side scripting

UNIT II WEB DESIGNING 9

HTML – Form Elements - Input types and Media elements - CSS3 - Selectors, Box Model,
Backgrounds and Borders, Text Effects, Animations, Multiple Column Layout, User Interface.

UNIT III CLIENT SIDE PROGRAMMING 9

Java Script: An introduction to JavaScript–JavaScript DOM Model-Exception Handling-Validation-
Built-in objects-Event Handling- DHTML with JavaScript- JSON introduction – Syntax – Function
Files.

UNIT IV SERVER SIDE PROGRAMMING 9

Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session
Handling- Understanding Cookies- DATABASE CONNECTIVITY: JDBC.

UNIT V PHP and XML 9

An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions- Form
Validation. XML: Basic XML- Document Type Definition- XML Schema, XML Parsers and Validation,
XSL.

Total Hours: 45 Periods

Sensitivity: Internal
 COURSE OUTCOMES:

CO1: Acquire knowledge about fundamentals of web programming

CO2: Explore markup languages features and create interactive web page

CO3: Apply JavaScript in web development by implementing various event handling mechanisms
CO4: Develop server-side programs using Servlets and JSP
CO5: Construct simple web pages in PHP and represent data in XML format.

TEXT BOOKS

1. Robin Nixon, "Learning PHP, MySQL, JavaScript, CSS & HTML5" Third Edition, O'Reilly
publishers, 2014.
2. Paul Deitel, Harvey Deitel, Abbey Deitel, “Internet & World Wide Web - How to
Program”,5th edition, Pearson Education, 2012.

REFERENCES:
1. James F. Kurose, “Computer Networking: A Top-Down Approach”, Sixth Edition, PearsonEducation,
2012
2. WebRTC APIs: and RTCWEB Protocols of the HTML5 Real-Time Web, September 4, 2012
3. Steven Holzener , “PHP – The Complete Reference”, 1st Edition, Mc-Graw Hill, 2017
4. Fritz Schneider, Thomas Powell, “JavaScript – The Complete Reference”, 3rd Edition, Mc-Graw Hill
Publishers, 2017
5. Bates, “Developing Web Applications”, Wiley Publishers, 2006

CO’s-PO’s & PSO’s MAPPING

522CIT04 WEB ESSENTIALS
CO’s/PO’s
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 3 2 3 2 - - 2 - 2 3 3 2 1
CO2 3 3 3 3 3 2 - - 2 - 2 3 3 2 1
CO3 3 3 3 2 3 2 - - 2 - 2 3 3 2 1
CO4 3 3 3 3 3 1 - - 2 - 2 3 3 2 1
CO5 3 3 3 3 3 1 - - 2 - 2 3 3 2 1
AVG 3 3 3 3 3 2 - - 2 - 2 3 3 2 1

1 – Low 2 - Medium, 3 - High, “-“- No Correlation

Sensitivity: Internal
 522CIP08 WEB ESSENTIALS LABORATORY L T PC

0021

COURSE OBJECTIVES
● Be familiar with Web page design using HTML / DHTML and style sheets
● Use JavaScript to access and use web services for dynamic content
● Learn to create dynamic web pages using server side scripting.
LIST OF EXPERIMENTS
1. a) Design a web pages for your college containing a
description of the courses, departments, faculties, library,
etc. (use href, list, frame tags)
b) Create your class timetable using table tag.
2. Design a web page of your home town with an attractive background
color, text color, an image, and font. (use External, Internal, and Inline
CSS to format)
3. Create a Student registration form for job application and validate the
form fields using JavaScript.
4. Create a Quiz program with adaptive questions using JavaScript.
5. With the help of JDBC Connectivity to get details of bank customer’s transactions
(credits and debits). Write a JSP to calculate the current balance, cumulative
total of credits and debits of the individual customer.
6. Create an Extensible markup language to represent the students mark
information of a class. Create a webpage to display all the students consolidated
mark statement with pass (green color) or fail (red color) using XSLT.
7. Write a PHP program to display a digital clock which displays the current time of
the server.
8. Develop any one experimental projects to apply web technology concepts:
Recommended list of Projects:
1. Personal Portfolio Website
2. Weather Forecast App
3. E-commerce Product Page
4. Interactive Learning Management System

Sensitivity: Internal
 5. Expense Tracker
6. Online Job Portal
7. Online Feedback Form with Database Connectivity
8. Social Media Networking site

TOTAL HOURS: 30

COURSE OUTCOMES
At the end of the course, the student should be able to:
CO1: Design Web pages using HTML and style
sheets
CO2: Construct client-side validation using
scripting languages.
CO3: Implement basic validation techniques to improve forms using java script
CO4: Create a database connectivity solution using JSP
CO5: Develop and implement applications using web technology

SOFTWARE REQUIREMENTS

Operating System: Linux / Windows

Programming Language & IDE: HTML 5, JDK 1.7, Coffee Cup Editor, PHP, and
Notepad++. Server: Apache Tomcat Server / XAMP / LAMP
Backend: MYSQL / SQLite

522CIP08 - WEB ESSENTIALS LABORATORY

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PS01 PS02 PSO3
CO1 3 1 3 2 3 2 - 1 2 - 2 3 2 3 1
CO2 3 1 3 2 3 2 - 1 2 - 2 3 2 3 1
CO3 3 1 2 2 2 2 - 1 2 - 2 3 2 3 1
CO4 3 1 2 2 1 2 - 1 2 - 2 3 2 3 1
CO5 2 1 3 2 1 1 - 1 2 - 2 3 2 2 1
Average 2.8 1 2.6 2 2.25 1.8 - 1 2 - 2 3 2 2.8 1

3-High 2 -Moderate 1 -Low ‘ - ‘- No Correlation

Sensitivity: Internal
 UI AND UX DESIGN LTPC

2023
COURSE OBJECTIVES:
 To provide a sound knowledge in UI& UX
 To understand the importance of user interface design principles
 To Illustrate web interface design and Mobile interface design
 To explore the various Tools used in UI&UX
 To Create a wireframe and prototype

UNIT I FOUNDATIONS OF DESIGN 6

Introduction: Introduction about UX - Five Main Ingredients of UX - Three “Whats” of User
Perspective - Pyramid of UX Impact - UI vs. UX Design - Core Stages ofDesign Thinking- Divergent
and Convergent Thinking -BrainstormingandGamestorming-Observational Empathy- Behavior
Basics: Psychology versus Culture - User Psychology - Experience - Conscious vs Subconscious
Experience - Emotions - Gain and Loss – Motivations.

UNIT II USER INTERFACE DESIGN 6

Designing Behavior: Designing with Intention - Rewards and Punishments - Conditioning and
Addiction - Timing Matters - Gamification - Social/Viral Structure–Trust - Hidden versus Visible.
Basic Visual Design Principles: Visual Weight - Contrast - Depth and Size - Color. Layout: Page
Framework - Footers - Navigation -Images, and Headlines - Forms - One Long Page or a Few Short
Pages - Input Types - Labels and Instructions - Buttons - Adaptive and Responsive Design - Touch
versus Mouse.

UNIT III WEB INTERFACE & MOBILE INTERFACE DESIGN 6

Designing Web Interfaces – Drag and Drop, Direct Selection, Contextual Tools, Overlays, Inlays and
Virtual Pages, Process Flow – Using Motion for UX - Design Patterns: Mobile Ecosystem:
Platforms, Application frameworks- Types of Mobile Applications: Widgets, Applications, Games-
Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of Mobile Design, Tools.

UNIT IV WIREFRAMING, PROTOTYPING AND TESTING 6

Sketching Principles - Sketching Red Routes - Responsive Design – Wire framing – Creating Wire
flows-Building a Prototype-Building High-Fidelity Mockups-Designing Efficiently with Tools
- Interaction Patterns - Conducting Usability Tests - Other Evaluative User Research Methods –
Synthesizing Test Findings -Prototype Iteration.

UNITV RESEARCH,DESIGNING,IDEATING,&INFORMATION ARCHITECTURE 6

Identifying and Writing Problem Statements - Identifying Appropriate Research Methods -
CreatingPersonas - Solution Ideation - Creating User Stories - Creating Scenarios - Flow Diagrams –
Flow Mapping-Information Architecture
TOTAL : 30 PERIODS
 LIST OF EXPERIMENTS 30 PERIODS

1. Developing an interface with proper UI Style Guides

2. Exploring various UI Interaction Patterns
3. Create a Sample Pattern Library for that product (Mood board, Fonts, Colors based onUI
principles)
4. Designing a Responsive layout for an societal application
5. Develop a Design Thinking process for a new product
6. Developing Wire flow diagram for application using open source software
7. Sketch, design with popular tool and build a prototype and perform usability testing and
identify improvements
8. Conduct end-to-end user research - User research, creating personas, Ideationprocess
(User stories, Scenarios), Flow diagrams, Flow Mapping

TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1: Build UI Interface for user Applications
CO2: Evaluate UX design of any product or application
CO3: Design web and mobile interface for product
development
CO4: Create Wireframe and Prototype
CO5: Implement Sketching principles

TEXT BOOKS
1. JoelMarsh,“UXforBeginners”,O’Reilly,2022
2. Xia Jiajia, “UI UX Design”, O‟Reilly, Artpower International, 2016.
3. Brian Fling, “Mobile Design and Development”, O‟Reilly Media Inc., 1st Edition, 2009.

REFERENCES

1. JeniferTidwell,CharlesBrewer,AynneValencia,“DesigningInterface”3rdEdition,O’Reilly202
0
2. SteveSchoger,AdamWathan“RefactoringUI”,2018
3. Steve Krug, “Don't Make Me Think, Revisited: A Commonsense Approach to Web
&Mobile”, Third Edition,2015
4. https://www.nngroup.com/articles/
5. https://www.interaction-design.org/literature.
PO’s & PSO’s MAPPING

CO’s/PO’s UI AND UX DESIGN

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO8 PO9 PO10 PO11 PO12 PSO PSO PSO
1 2 3
CO1 3 2 2 3 2 - - - 3 3 3 2 3 3 2
CO2 2 3 2 3 3 - - - 2 2 3 3 2 2 3
CO3 2 3 3 3 3 - - - 3 2 2 3 2 3 3
CO4 2 2 3 3 3 - - - 3 2 2 3 3 3 3
CO5 2 2 3 3 3 - - - 3 2 2 2 3 2 2
AVG 2 2 3 3 3 - - - 3 2 2 3 3 2 3

3-High 2-Moderate 1-Low ‘-‘– No Correlation