School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Title Database Management System Course Type Integrated
Course Code E2UC302B Class B.Tech (CSE) Sem 3
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction

Lecture 3 3 Weightage
delivery

Tutorial 0 0
Practical 1 2 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 4 5 45 00 30 00 50% 50%

THEORY:

Introduction to Data Base management system: An overview of the database management system,
database system Vs file system, Database system concept and architecture, data model schema and
instances, data independence and database language and interfaces, data definitions language, Data
modeling using Entity Relationship (ER) model, Enhanced ER model, Overall Database Structure.

Domains, Relations and Keys: domains, relations, kind of relations, relational database, various types of
keys, candidate, primary, alternate and foreign keys. Relational Data Model and Language: Relational data
model concepts, integrity constraints, entity integrity, referential integrity, Key constraints, Domain
constraints, relational algebra, relational calculus, tuple, and domain calculus.

Introduction to SQL, DDL, DML and DCL: Types of SQL commands. SQL operators and their
procedures. Tables, views, and indexes. Queries and subqueries. Aggregate functions. Insert, update, and
delete operations, Joins, Unions, Intersection, Minus, Cursors, and Triggers. Database Design &
Normalization: Functional dependencies, normal forms, first, second, and third normal forms,
Normalization-Decomposition into BCNF.

Transaction Processing Concept: Transaction system, testing of serializability, serializability of

schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log-
based recovery. Concurrency Control Techniques: Concurrency control, Locking Techniques for
concurrency control, Time stamping protocols for concurrency control, validation-based protocol.
Recovery with concurrent transactions.

● PRACTICAL: Case Studies and Practical problem, Real-world Examples of data base Implementations.
 School of Computer Science & Engineering
LAB PLAN FOR THEORY COURSES
1 Draw an E-R diagram and convert entities and relationships to a relation table for a given scenario. (Two
assignments shall be carried out i.e., consider two different scenarios (e.g. bank, College)
2 Implementation of DDL commands of SQL with suitable examples. Create a table named Books with the
following columns: Book ID (Primary Key, Integer)
Title (Variable Character, 200 characters) Author (Variable Character, 100 characters)
Published Date (Date) ISBN (Variable Character, 13 characters)
Alter the Books table to add a column named Genre (Variable Character, 50
characters). Modify the ISBN column to increase its length to 20 characters.
Drop the Published Date column from the Books table. Drop the Books table from the database.
3 Implementation of DML commands of SQL with suitable examples.
You are managing a database for a bookstore. Implement the following tasks:
Insert the following data into a table named Books with columns BookID, Title, Author,
PublishedDate, ISBN, and Price. Data:
(1, 'The Great Gatsby', 'F. Scott Fitzgerald', '1925-04-10', '9780743273565',
10.99) (2, '1984', 'George Orwell', '1949-06-08', '9780451524935', 9.99)
Update the Books table to change the Price of the book with Book ID 1 to 12.99.
Delete the book with Book ID 2 from the Books table.
4 Implementation of different types of operators in SQL.You have two tables Products and Sales.
Implement the following tasks using various operators:
1. Find all products with a price greater than 100.
2. List all sales that happened in the year 2023.
3. Find all products whose name contains the word 'Pro'.
4. Combine the lists of products and sales to find all unique product names and sale items.
5. Find the total revenue generated from sales, assuming each sale has a quantity and price.
5 Implementation of different types of operators in SQL.
6 Perform the following:
a. Creating Tables (With and Without Constraints (Key/Domain)
b. Creating Tables (With Referential Integrity Constraints)
7 For a given set of relation schemes, create tables and perform the following Queries:
a. Simple Queries
b. Queries with Aggregate functions (Max/Min/Sum/Avg/Count)
c. Queries with Aggregate functions (group by and having clause)
d. Queries involving- Date Functions, String Functions, Math Functions
8 For a given set of relation schemes, create tables and perform the following Queries:
a. Inner Join
b. Outer Join
c. Natural Join
9 For a given set of related tables perform the following: - a. Creating Views
b. Dropping views
c. Selecting from a view

10 Implementation of Group by & Having Clause, Order by Clause, Indexing.

11 Given the table EMPLOYEE (EmpNo, Name, Salary, Designation, DeptID) write a cursor to select the
five highest-paid employees from the table.
12 For a given set of related tables perform the following:
a. Begin Transactions
b. End Transaction
13 For a given set of related tables perform the following:
a. Create roles
b. Assign Privileges c. Revoke Privileges
14 Perform the following: Inserting/Updating/Deleting Records in a Table, Saving (Commit) and Undoing
(rollback)
 School of Computer Science & Engineering

Text Book
1. Henry F Korth, Abraham Silberschatz, S. Sudarshan, “Database system concepts”, McGraw- Hill
2. Date C J, “An Introduction to Database Systems”, Addison Wesley
Reference Books
1. Elmasri, Navathe, “Fundamentals of Database Systems”, Addison Wesley
2. O’Neil, Databases, Elsevier Pub.
3. Leon & Leon,” Database Management Systems”, Vikas Publishing House
4. Bipin C. Desai, “An Introduction to Database Systems”, Gagotia Publications
5. Majumdar & Bhattacharya, “Database Management System”, TMH (14)
6. Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill
 School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Title Data Structures using JAVA Course Type Integrated
Course Code E2UC303B Class B.Tech (CSE) Sem 3
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction

Lecture 3 3 Weightage
delivery

Tutorial 0 0
Practical 1 2 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 4 5 45 00 30 0 50% 50%

Syllabus:

Introduction: Basic Terminology, Types and application of Data Structures, Algorithm, Efficiency of an
algorithm, Time-space trade-off and complexity, asymptotic notation.

Array: Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column
Major Order, Derivation of Index Formulae for 1-D,2- D, and multi-D Array, Application of arrays, Sparse
Matrices, and their representations, arithmetic operations on matrices.

Recursion: Tail recursion, Head Recursion, Nested recursion, Removal of recursion. Problem solving
using iteration and recursion with examples such as Fibonacci numbers, and Hanoi towers. Trade-offs
between iteration and recursion.

Searching & Sorting: Linear search, Binary Search, Indexed Sequential search, Hashing, Insertion Sort,
Bubble sort, Selection sort, Quick Sort, Merge Sort.

Linked lists: Introduction, Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations
on a Linked List. Insertion, Deletion, Traversal, Reversing, Application of Linked List: Polynomial
Representation, Addition and Multiplication, Generalized Linked List.

Stack: Introduction, Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked List
Implementation of Stack, Application of Stack: Prefix and Postfix Expressions, Evaluation of postfix
expression.
Queue: Introduction, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array
and linked implementation of queues, Double Ended queue, and Priority Queue.

Trees: Binary Tree and Its array and linked list representation, Strict Binary Tree, Complete Binary Tree,
Tree Traversal algorithms: In-order, Pre-order, and post-order, level order, Constructing Binary Tree from
given Tree Traversal, BST Operation: Searching, Insertion, Deletion, Threaded Binary Trees, Traversals
in Threaded Binary Trees, Heaps, Heap Sort.
Graph-Introduction to graph, Concepts, and representation.
 School of Computer Science & Engineering
LAB PLAN FOR THEORY COURSES
1 Write a program to find the number of elements in the largest increasing sequence in an array.
2 Write a program to remove duplicates from an array.
3 Write a Program to find the transpose of a matrix.
4 Write a program to find the second smallest element in a linked list.
5 Write a program to check whether doubly linked list elements make palindrome or not.
6 Given an array, arr[2………11][5………20] with base value 200, and the size of each element
is 2 Byte in memory. Find the address of arr[7][11] with the help of row- major order.
7 Given an array, arr[2:11, -3:4, 7:18] with a base value of 300 and the size of each element is 3
Bytes in memory find the address of element arr[4][-2][12] with the help of row-major order?
8 Write a program to calculate the average value of array elements.
9 Write a program to find the Middle Element of a Linked List in a single traversal.
10 A circular queue has a size of 5 and has 3 elements 10,20 and 40 where F=2 and R=4. After
inserting 50 and 60, what is the value of F and R. Trying to insert 30 at this stage what happens?
Delete 2 elements from the queue and insert 70, 80 & 90. Show the sequence of steps with
necessary diagrams with the value of F & R.
11 Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). Give the outputs when
you apply in-order, preorder, and post-order traversals.
12 Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) =x mod 10.
Prepare the results for the following: i) Open addressing hash table using linear probing. (ii)Open
addressing hah table using quadratic probing.
13 Write a program to reverse elements of the queue using stack.
14 Write a recursive program to find the greatest common divisor of two numbers.
15 Data are pushed to (PUSH operation) and popped from (POP operation) a stack in the following
order: PUSH 3; TOP; PUSH 7; TOP; PUSH 6; PUSH 9; TOP; POP; POP;TOP; where the
PUSH, POP, and TOP are the standard operations of the stack. Write the values returned by TOP
for the sequence of operations above.
16 Write a program to find all pairs of elements in an array whose sum is equal to a specified
number.
17 Write a program to reverse a stack using recursion, without using any loop.
18 Write a program to reverse a string using stack.
19 Convert the following Infix expression into a Postfix expression using the Tabular method. a – b
/c*d+e*f/g
20 Write a program to find the length of the longest consecutive elements sequence from an unsorted
array of integers.

Text Book
1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures”.
2. Sahni Sartaj, “Data structures, algorithms, and applications in Java”, McGraw-Hill

Reference Books
1. Michael T. Goodrich; Roberto Tamassia; Michael H. Goldwasser; Subhasish Banerjee “Data Structures and
Algorithms in Java”, Wiley.
2. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”, McGraw
Hill
3. James Cutajar “Beginning Java Data Structures and Algorithms”, O’Reilly.
4. John Hubbard "Data Structures with Java" Schaum's Outline Series.
5. Narasimha Karumanchi "Data Structures and Algorithms Made Easy in Java" Career Monk
 School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Title Java Programming Course Type Comprehensive
Course Code E1UA307C Class B.Tech (CSE) Sem 3
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction
delivery

Lecture 3 3 Weightage
Tutorial 0 0
Practical 2 4 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 5 7 45 00 30 00 50% 50%

BASICS OF JAVA
Introduction to object-oriented programming - Features of Java – JDK-JVM- Keywords- Variables -
Data types – Operators-Expression- Control structures - - Type Casting -Classes and Objects -Methods -
Access specifiers & modifiers- Constructors - Method Overloading- this Keyword - Static – Arrays String
- String Buffer-String handling mechanism-Command line arguments. Wrapper Classes.

PACKAGE, INHERITANCE, POLYMORPHISM AND EXCEPTION HANDLING

Java API Packages - Package Access - Basics of Inheritance - Forms of Inheritance - Super keyword –
Final - Method Overriding - Abstract Class – Interface- Inner Classes-Exception Handling- Exception
Hierarchy - Exception Types - Exception handling strategies -User defined Exception.

COLLECTION, I/O STREAMS AND Threads

Collection Class -Collections Framework- Interface & Classes Implementation: Set- List- Queue-Map-
File- I/O Stream- Character Streams – Byte Streams- Object Serialization –Threads - Thread states -Thread
priority - Thread operations -– Thread Synchronization – Multithreading-Generic Collections - Generic
Classes and Methods.

AWT, SWING AND NETWORKING

Applets: Basics of applets – Applet, Architecture - Life cycle of an Applet – AWT, Layout Manager:
Event Handling-Delegation event Model, - Swing overview- Swing Components -Basics of Java
Networking.

JDBC, SERVLET and JSP

Introduction to JDBC API-JDBC Architecture - JDBC Drivers- Database connectivity in Java - CRUD
Operations-java. sql methods and interfaces -Introduction to Servlet, Servlet Architecture, Lifecycle of a
SERVLET, Introduction to JSP, JSP Architecture, Introduction to JSTL and EL. Use JSTL to simplify
JSP code.

PRACTICAL
Java Data Type, Expression, and Operators; Conditional Statements; Control statements; Strings and StringBuffer
Class. Array, Implementation of OOPS properties, Constructor overloading, Abstract class and interface. Wrapper
class and Linked Structure of Java. Multithreading, Exception handling, Collection, CRUD operation and database
connectivity, Networking with java. Servlet and JSP.
Text Book
1. Herbert Schildt, “Java the Complete Reference”, Ninth edition, Tata Mc-Graw Hill ,2014.
2. Database Programming with JDBC & Java (Java (O'Reilly)).
3. Kathy Sierra, and Bates Bert. Head First Java: A Brainc-Friendly Guide. " O'Reilly Media, Inc.",
 School of Computer Science & Engineering
Second Edition, 2009

Reference Books
1. H.M. Deitel and P.J. Deitel,” Java How to Program”, Pearson Prentice Hall Seventh Edition.
2. Kathy Sierra, and Bates Bert. Sun Certified Programmer for Java. McGraw Hill Publications, 2008.
3. Keyur Shah, Gateway to Java Programmer Sun Certification, Tata McGraw Hill, 2002.
4. Joshua Bloch, ―Effective Java: A Programming Language Guide, Second Edition, Pearson, 2008.
5. Bruce Eckel – “Thinking in Java” Pearson Prentice Hall Third Edition-2006
6. Kogent Learning Solutions Inc,”JAVA 7 Programming Black Book”, DreamTech Press, 2010.
 School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Title Computer Organization and
Architecture
Course Type Theory
Course Code E2UC301T Class B.Tech (CSE) Sem 3
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction
delivery

Lecture 4 4 Weightage
Tutorial 0 0
Practical 0 0 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 4 4 45 00 00 00 50% 50%

THEORY:

Module-1 Register Transfer and Micro-operations

Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Micro-operations,
Logic Micro-operations, Shift Micro-operations, Arithmetic logic shift unit

Module -2 Basic Computer Organizations and Design and CPU Organizations

Instruction Cycle, Memory-Reference Instructions, Register reference instructions, and Input – Output
Instructions. Central Processing Unit: General Register Organization, Stack Organization, Instruction
Formats, and Addressing Modes

Module-3 Computer Arithmetic

Addition and Subtraction (Signed Magnitude and Signed 2’s Complement) , Multiplication Algorithms
(Binary Multiplication for Signed Magnitude and Booth’s Algorithm) , Division Algorithms (Restoring
and Non-Restoring).

Module-4 Memory Organization

Memory Hierarchy, Main Memory, Auxiliary Memory, Associative Memory, Cache Memory, Virtual
Memory, Memory Management Hardware

Module-5 Input-Output Organization

Peripheral Devices, Input-Output Interfaces, Asynchronous Data Transfer, Modes of Transfer, Priority,
Interrupt, and Direct Memory Access (DMA)
Text Book
1. Morris Mano, Computer System Architecture, 3rd Edition, Prentice-Hall of India Private Limited, 1999.
Reference Books
1. Hayes, John P. Computer architecture and organization. McGraw-Hill, Inc., 2002.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill, Fifth Edition, Reprint
2012
3. William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson Education,
Seventh edition, 2006
 School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Communication Competency
Course Type LAB
Title and Aptitude Building-I
Course
O1UA301L Class B.Tech (CSE) Sem 3
Code
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction

Lecture 0 0 Weightage
delivery

Tutorial 0 0
Practical 2 4 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 2 4 00 00 30 00 50% 50%

Module 1: Basic Mathematical Concepts and Introduction

● Introduction to Quant/DI/LR
● Vedic Maths
● Number System - 1 (Classification of numbers, Divisibility)
● Number System - 2 (HCF and LCM, Unit Digit)
● Number System - 3 (Factors, Trailing zeroes, Remainders)
Module 2: Number Series and Logical Reasoning
● Coding and Decoding
● Number and Alphabet Series
● Number System (High End)
Module 3: Applied Mathematics and Data Interpretation
● Percentage, Profit and Loss
● Simple Interest and Compound Interest
● Introduction to Data Interpretation - 1
● Introduction to Data Interpretation - 2

Module 1: Communication Skills Enhancement

● Active & Passive Voice
● Direct and Indirect Narration
● Common Errors in Grammar
● Tenses Using Train Station Activity
Module 2: Writing and Analytical Skills
● Essay and Summary Writing sushma maam
● SWOC Analysis and Features, Attributes and Benefits Analysis and Application (FAB)
● Design Thinking: Product Launch Event Briefing, Topic Distribution & Group Formation
● Product launch
Module 3: Personal Development and Presentation Skills
● Goal Setting and Art of Self-Introduction
● Glossophobia & Ways to Overcome It
Module 4: Leadership and Team Dynamics
● Conflict Resolution & Negotiation Skills
● Team Work &Leadership
● Time Management
 School of Computer Science & Engineering

Text Book:
1. Delivering Employability Skills in the Lifelong Learning Sector by Ann Gravells, ISBN10:
1844452956
2. What employers want: the work skills handbook - Karen Holmes, Publication Date: 2011
3. The 2020 Workplace by Jeanne C. Meister and Karie Willyerd
4. The whole new mind Drive by Daniel H Pink - 2011
5. Enhancing Employability @ Soft Skills by Shalini Verma, Pearson.
6. Productivity and Employability Skills by John Heap and Mike Dillon, ISBN-13: 978-
0957272620
 School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Title Probability and Statistics Course Type Theory
Course Code C1UC322T Class B.Tech (CSE) Sem 3
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction

Lecture 3 3 Weightage
delivery

Tutorial 0 0
Practical 0 0 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 3 3 45 00 00 00 50% 50%

THEORY:
Measures of Central Tendency, Measures of dispersion, Curve Fitting, Method of least squares, fitting of straight
lines, Fitting of second-degree parabola, Exponential curves, Correlation and Rank correlation, Regression Analysis:
Regression lines of y on x and x on y, regression coefficients, properties of regressions coefficients and non-linear
regression.

Probability and Distribution: Introduction, Addition and multiplication law of probability, Conditional probability,
Baye’s theorem, Random variables (Discrete and Continuous Random variable) Probability mass function and
Probability density function, Expectation and variance, Discrete and Continuous Probability distribution: Binomial,
Poisson and Normal distributions.

Sampling, Testing of Hypothesis and Statistical: Introduction, Sampling Theory (Small and Large) , Hypothesis,
Null hypothesis, Alternative hypothesis, Testing a Hypothesis, Level of significance, Confidence limits, Test of
significance of difference of means, T-test, F-test and Chi-square test, One way Analysis of Variance (ANOVA).
Quality Control.

Text Book
1. R. E. Walpole, R. H. Mayers, S. L. Mayers and K. Ye (2007), Probability and Statistics for Engineers and
Scientists, 9th Edition, Pearson Education, ISBN:978-0-321-62911-1.
2. Sheldon M. Ross (2011), Introduction to Probability and Statistics for Engineers and Scientists, 4th Edition,
Academic Foundation, ISBN:978-8-190-93568-5.

S.No Problem based Learning

1 Define discrete and continuous random variables and give one example of each
2 Find the expectation of the sum of points in tossing a pair of fair dice.
What is the probability that a number selected from the numbers 1,2,3……,20 is an even number,
3
when each of the given numbers is equally likely to be selected
If A,B,C are mutually exclusive events associated with a random experiment. P(B)=0.6P(A),
4
P(C)=0.6P(A), then find P(A).
 School of Computer Science & Engineering
A bag contains 4 red and 3 black balls. A second bag contains 2 red and 4 black balls. One bag is
5 selected at random. From the selected bag one ball is drawn. Find the probability that the bag
drawn is red.
A dice is tossed twice and sum of numbers appearing is noted to be 8. What is the conditional
6
probability that the number 5 has appeared at least once.
Find the linear least square polynomial based on the data
7 x 1 2 3 4
y 3 7 13 21
8 Define Binomial random variable.
9 Define Null and alternate hypothesis.
10 Define the critical value and critical regions.
11 Find the expectation of the sum of points in tossing a pair of fair dice.
12 Find(a) the variance,(b) the standard deviation of the sum obtained in to a pair of fair dice.
13 If three coins are tossed simultaneously, what is the probability that at least two tails occur.
What is the probability that a number selected from the numbers 1,2,3……,20 is an even number,
14
when each of the given numbers is equally likely to be selected.
Given a standard normal distribution, find the value of k such that
15
(a) P(z>k)=0.3015 (b)P(k< z< -0.18)=0.4197
Manufacturer of a certain brand of rice cereal claims that the average saturated fat content does not
16 exceed 1.5 grams per serving. State the null and alternative hypotheses to be used in testing this
claim and determine where the critical region is located
Find P(X≤4) If probability density function of a random variable X is given by
17 f(x)={0.25, 1≤x≤5
=0, otherwise
The probability that a certain kind of component will survive a shock test is 3/4. Find the
18
probability that (a) exactly 2 (b) exactly 4 , of the next 4 components tested survive
A continuous random variable X has the probability distribution
19 −2 x
df = ae dx, −   x   .Find the value of a and the variance of the distribution.
Given a random variable X having normal distribution with 𝜎 = 50, 𝜇 = 300 . Find the
20
probability that X assumes a value greater than 362.

Reference Books
1. Douglas C. Montgomery (2012), Applied Statistics and Probability for Engineers, 5th Edition, Wiley India,
ISBN: 978-8-126-53719-8.
2. M. R. Spiegel, J. Schiller and R. A. Srinivasan (2010), Probability & Statistics, 3rd Edition, Tata- McGraw Hill,
ISBN:978-0-070-15154-3.
3. https://nptel.ac.in/courses/111/105/111105041/
4. https://nptel.ac.in/courses/111/106/111106112/
 School of Computer Science & Engineering

Syllabus for B. Tech CSE II Year, III Semester

Course Title Design Thinking Course Type Theory
Course Code R1UC301L Class B.Tech (CSE) Sem 3
Activity Credits Weekly Assessment
Hours Total Number of Classes per Semester in
Instruction
delivery

Lecture 1 1 Weightage
Tutorial 0 0
Practical 0 0 Theory Tutorial Practical Self-Study CIE SEE
Self-study 0 0
Total 1 1 30 00 00 00 50% 50%

THEORY:

An Insight to Learning
Understanding the Learning Process, Kolb’s Learning Styles, Assessing and Interpreting Remembering
Memory Understanding the Memory process, Problems in retention, Memory enhancement techniques
Emotions: Experience & Expression Understanding Emotions: Experience & Expression, Assessing
Empathy, Application with Peers Basics of Design Thinking Definition of Design Thinking, Need for
Design Thinking, Objective of Design Thinking, Concepts & Brainstorming, Stages of Design Thinking
Process (explain with examples) – Empathize, Define, Ideate, Prototype, Test.
Being Ingenious & Fixing Problem
Understanding Creative thinking process, Understanding Problem Solving, Testing Creative
Problem Solving Process of Product Design Process of Engineering Product Design, Design Thinking
Approach, Stages of Product Design, Examples of best product designs and functions, Assignment –
Engineering Product Design Prototyping & Testing What is Prototype? Why Prototype? Rapid Prototype
Development process, Testing, Sample Example, Test Group Marketing
Celebrating the Difference
Understanding Individual differences & Uniqueness, Group Discussion and Activities to encourage the
understanding, acceptance and appreciation of Individual differences Design Thinking & Customer
Centricity Practical Examples of Customer Challenges, Use of Design Thinking to Enhance Customer
Experience, Parameters of Product experience, Alignment of Customer Expectations with Product Design
Feedback, Re-Design & Re-Create
Feedback loop, Focus on User Experience, Address “ergonomic challenges, User focused design, rapid
prototyping & testing, final product, Final Presentation – “Solving Practical Engineering Problem
through Innovative Product Design & Creative Solution”.
Text Book
1. Karmic Design Thinking by Prof. Bala Ramadurai, available at Amazon (paperback), Amazon (e-book),
Flipkart, Pothi, halfpricebooks.in
Reference Books
1. Design: Creation of Artifacts in Society by Prof. Karl Ulrich, U. Penn
2. Change by Design by Tim Brown.
Links:
1. https://youtu.be/4nTh3AP6knM?si=rNnDPaZ1B80oY9IY
2. https://youtube.com/playlist?list=PLsh2FvSr3n7ctIa1TY50t5jP7_gLmfgvE&si=uwuztLCwck_OfoIW
3. https://youtube.com/playlist?list=PLsh2FvSr3n7ctIa1TY50t5jP7_gLmfgvE&si=sR3rMo4QJbze_YB_

MOOCs Course: https://onlinecourses.nptel.ac.in/noc19_mg60/preview