IISc BS Program: Engineering Curriculum

06-01-2014
Preamble
Why an Engineering Curriculum in a Science Degree? Engineering is concerned
with the application of the basic sciences and mathematics to solving real-world
problems. On the one hand a scientist is a consumer of engineering solutions, e.g.
scientific instrumentation, or computational algorithms. On the other hand the quest for
engineering solutions to human problems invariably leads to questions that would
interest a basic scientist: e.g., fundamentally new phenomena that could lead to compact,
sensitive and energy efficient sensors.
Outline of the Engineering Curriculum: The 18 credit engineering curriculum in this
four year BS program has been designed with the above two objectives in mind.
1. Hard Core: Engineering essentials for the scientist: Computing and electronic
instrumentation are essential tools of the modern scientist. Hence, a 6 credit hard
core curriculum comprising the following two engineering courses will be
required to be taken in the first three semeters.
Semester 1 - ESc 101 (2:1) : Algorithms and Programming
Semester 2 - ESc 102 (2:1) : Introduction to Electrical and Electronics
Engineering
In addition, given the increasing importance of materials to many areas of science
and engineering (such as in electronics, energy generation, biology, and
medicine), and the essentiality of the environment to our very existence, two new
hard core courses have been introduced.
Materials (2:0)
Environmental Science (2:0)
2. Electives: Broad exposure to other engineering fields: The remaining 8 credits
are viewed as elective courses, and have to be selected from a pool of existing
engineering courses, or courses specially designed for undergraduates, offered by
the faculty of the two engineering divisions in IISc. Some of these courses will
serve to expose the student to various engineering disciplines, while others are
more focused analysis and design courses which require the student to apply
scientific and mathematical knowledge to provide engineering solutions to
problems.

1
 ESc 101 (Aug-Nov) 2:1 Semester I
Algorithms and Programming
28 contact hours plus weekly labs

1 Course Content
Notions of algorithm, data abstraction, data structures; Importance of data structures and
algorithms in programming; Notion of complexity of algorithms and the big Oh notation. (3
Hours)

Iteration and Recursion; Algorithm analysis techniques (3 Hours)

Arrays and linked lists; Stacks and queues (3 Hours)

Searching Algorithms: Hash tables, skip list, binary search trees, balanced search trees, pattern
search (6 Hours)

Sorting algorithms including quick-sort, heap-sort, and merge-sort (4 Hours)

Graphs: Shortest path algorithms, minimal spanning tree algorithms, depth first and breadth first
search (6 Hours).

Algorithm design techniques including greedy, divide and conquer, dynamic programming, and
local search (3 Hours).

1.1 Books
Brian W. Kerninghan and Dennis M. Ritchie. C Programming Language. Prentice Hall of India,
New Delhi, 2009.

Robert L. Kruse. Data Structures and Program Design in C. Prentice Hall of India, New Delhi,
2006.

2 Laboratory Component
Sessions/Experiments to be designed for appreciating the following aspects.
1. Comprehend the following terms in the context of problem solving by a computer: Problem
specification, input-output analysis, algorithm, flowchart, pseudo-program, programming
language, assembly language, machine language, compiler, assembler, program correctness

2. Appreciate how computers can be used to solve "common" but subtle problems such as binary
search and Hanoi towers using iteration or recursion and the ability to write elegant, correct, and
efficient programs for solving such problems.

3. Comprehend the nature of problems that a computer can solve extremely well- be able to list 5
non-trivial, interesting problems (unique in their own way) which are difficult to solve for a human
being but can be solved easily by a computer.

4. Understand the difference between arrays and linked lists and create 2 examples where arrays are
better than linked lists and 2 examples where linked lists are better than arrays.

5. Understand the difference between iteration and recursion and create 2 examples where iteration is
better than recursion and 2 examples where recursion is better than iteration.

6. Design the flowchart and write efficient code for the following problems: (a) Recursive and
iterative programs for binary search (b) Recursive and iterative programs for Fibonacci numbers
(c) Recursive and iterative programs for finding the GCD of two numbers (d) Reverse a linked list
while traversing it only once

2
 7. Understand the role of pointers in implementing singly linked lists, doubly linked lists, binary
trees, and general trees.
8. Comprehend the notion of time complexity and understand the asymptotic notions of "Big Oh"
with non-trivial examples; Understand the difference between worst case complexity and average
case complexity. The student should be able to give an example of one algorithm with each of the
complexities: O(n), O(n*2), O(n*3), O(2**n), O(n log n), O(n*2 log n), O(log n), O(log log n),
O(sqrt(n)).

9. Write down the recurrence relations for worst case complexity of (a) binary search (b) Hanoi
towers (c) bubble-sort (d) merge sort and (e) traveling salesman problem; analyze the complexities
and appreciate why some of these are more difficult than the others.

10. Assimilate all the trade-offs involved in choosing arrays versus linked lists with apt examples such
as: binary search, stack, queue, binary trees.

11. Understand why Dijkstras algorithm is a greedy algorithm and how greediness guarantees
optimality. Also, understand the trade-off between adjacency matrix and adjacency list
representations vis-a-vis this algorithm. How does the heap data structure reduce the
computational complexity of this algorithm?
12. Understand why Kruskals algorithm is a greedy algorithm and how greediness guarantees
optimality. Also, understand the trade-offs involved in using different data structures for this
problem.

13. In the context of binary trees, clearly understand the following concepts: (a) recursive definition of
a binary tree (b) preorder (c) post-order (d) in-order (e) level-by-level traversal (f) number of
binary trees of a particular size

14. In the context of graphs, clearly understand (a) breadth-first search (b) depth first search (c)
shortest path problem (d) minimal spanning trees problem
15. In the context of searching, understand the trade-offs involved in selecting any of the following
methods: hashing, binary search trees, AVL trees.

16. In the context of sorting, understand the trade-offs involved in selecting: (a) bubble-sort (b)
insertion sort (c) selection sort (d) quick-sort (e) merge-sort (f) heap-sort.

17. Understand the implication of the following statement: The lower bound on the worst case
complexity of any comparison based sorting method is O(n log n).

2.1 Some Problems to Test the Understanding and

Implementation Abilities
1. In the context of binary search, do the following: (a) Understand the difficulty involved in coming
up with a linked list implementation (b) Design a smart linked list based solution assuming that
you can use multiple links (for example, you can link an element to not only the next element but
also to the second next element, fourth next element, eighth next element, etc.). Write a flowchart
for your new algorithm. (c) Write a C program that efficiently implements your algorithm (d)
Generate interesting test-cases to test the correctness and efficiency of your program (e) Compare
this implementation with the usual array-based binary search.

2. Implement a stack of integer valued numbers using a linked list so that the worst case complexity
is worst-case O(1) for both push and pop. Design an additional data structure so as to implement
not only "push" and "pop" but also "findmin" in worst-case O(1) time and implement the same.
Now enhance the data structure further to implement "findmin" also in worst-case O(1) time.

3. Write a naive program to solve the TSP problem with naive data structures. Understand why the
problem is hard; in particular, why it is NP-hard. Now use a heuristic based on Kruskals
algorithm to implement a solution to the TSP. Use an efficient data structure for implementing the
Kruskals algorithm. Now implement a branch and bound based algorithm to obtain an optimal
solution to the problem.

3
4. Write a program for generating a random graph model of a social network. The generated model is
to be used for computing simple metrics such as the most connected nodes, the most central nodes,
the most influential nodes, etc.

4
 ESc 102 (Jan-Apr) 2:1 Semester II
Introduction to Electrical and Electronics Engineering
28 contact hours plus weekly labs
Text
Art of Electronics, Second Edition, by Horowitz and Hill.
Synopsis
The course will have four modules with 24 hours of instruction along with 12 lab sessions.
1. Basic Electrical Circuit Concepts (8 hours : 4 lab sessions).
2. Active devices and Operational Amplifier (6 hours : 3 Lab sessions).

3. Design of Simple Systems using Operational Amplifiers (8 hours : 4 Lab sessions).

4. Introduction to digital design and embedded systems (6 hours : 2 Lab sessions).

Syllabus
1. Basic Electrical Circuit Concepts.

Ohms law, KVL, KCL, Resistors and their characteristics, Categories of resistors, series
parallel resistor networks.
LAB: Solder simple resistor networks and measure resistance.
Capacitors and their characteristics, Simple capacitor networks, Simple RC Circuit and
differential equation analysis, Frequency domain analysis and concepts of transfer
function, magnitude and phase response, poles.
LAB: RC network frequency response.
Inductors and their characteristics, a simple LR circuit and differential equation analysis,
frequency domain transfer function and time constant, LRC circuit and second order
differential equation, frequency domain analysis, resonance and Quality factor.
Introduction to Faradays and Lenzs laws, magnetic coupling and transformer action for
step up and step down.
LAB: Winding an inductor and make a transformer.
Steady State AC analysis and introduction to phasor concept, lead and lag of phases in
inductors and capacitors, Concept of single phase and three phase circuits.

2. Active devices and Operational Amplifer.

Semiconductor concept, electrons & holes, PN junction concept, built-in potential, forward
and reverse current equations, diode operation and rectification, Zener diodes, Simple
Diode circuits like half wave rectifier and full-wave rectifier.
LAB: Simple rectifier and zener voltage regulator.
NPN and PNP bipolar transistor action, current equations, common emitter amplifier
design, biasing and theory of operation.
LAB: design of a single stage and dual stage transistor amplifier.
MOSFET as a switch, introduction to PMOS and NMOS.
LAB: MOSFET as switch to control relays for voltage stabilizer.
Introduction to Opamp concept, Characterisitics of an ideal opamp a simple realisation of
opamp using transistors, Various OPAMP based circuits for basic operations like
summing, a mplification, integration and differentiation, Introduction to feedback concept
LAB: Design of 3 transistor opamp and its characterisation. Simple OPAMP applications
using 741.

3. Design of simple systems using OPAMPs.

Design of a linear regulated supply.
LAB: same.

5
 Design of a temperature indicator and controller, design of ON/OFF, proportional and PID
controllers.
LAB: same.
Design of a constant current source. Design of a 4-probe resistance measurement system.
LAB: same.
Design and use of lock-in amplifier. Techniques for noise shielding.
LAB: same.
Signal conditioning for capacitive and inductive transducers.
LAB: same.
4. Introduction to digital design and embedded systems.

MOSFET circuits for some simple gates, simple combinational functions.

LAB: Design and test simple combinational functions using discrete gates.
Basic flip-flop operation and clocks in digital design, Introduction to A/D conversion,
Introduction to 8051 microcontroller and assembly language programming.
LAB: 8051 assembly language program to convert analog voltage to digital form, compare
against a threshold and set an LED.
LAB: 8051 programming to digitize analog voltage and display on a seven segment
display.

6
 UMT 200 (Jan-Apr) 2:0 Semester III
Introduction to Materials
28 contact hours

Bonding, types of materials, basics of crystal structures and crystallography.

Thermodynamics, thermochemistry, unary systems, methods of structural
characterization. Thermodynamics of solid solutions, phase diagrams,
defects, diffusion. Solidification. Solid-solid phase transformations.
Mechanical behaviour: elasticity, plasticity, fracture. Electrochemistry and
corrosion. Band structure, electrical, magnetic and optical materials. Classes
of practical materials systems: metallic alloys, ceramics, semiconductors,
composites.

UES 200 (Jan-Apr) 2:0 Semester III

Introduction to Environmental Science
28 contact hours
Basics of hydrology: Rainfall and runoff analysis, Reservoirs, Groundwater and wells,

water conservation.

Water treatment: coagulation, softening, reactors, mixing and flocculation,

sedimentation, filtration, disinfection, adsorption.

Wastewater treatment: wastewater microbiology, domestic wastewater, municipal

wastewater treatment systems, unit operations of pretreatment, primary and secondary

treatment, sludge treatment and disposal,

Water quality management in rivers and lakes, sources of pollution,

Air pollution: Standards, effect of air pollutants, origin and fate of air pollutants,

atmospheric dispersion, air pollution control at stationary and mobile sources, Noise

pollution: Effects of noise on people, rating systems, community noise, sources,

transmission of sound outdoors, traffic noise prediction, nose control,

Introduction to Hazardous waste management, Environmental impact statements and

global pollution issues.

Introduction to Environmental legislation, regulation, ethics and systems overview

7
 Elective courses

The remaining 8 credits are viewed as elective courses, and have to be selected from a
pool of existing engineering courses, or courses specially designed for undergraduates,
offered by the faculty of the two engineering divisions in IISc.

Scientific computing

Only one of CH 202/SE 288/ SE 289/UE 203 can be taken, as they are equivalent courses

Materials Science and Engineering

Only one of MT 250, PD 205, or ME 228 can be taken, as they are equivalent courses

8
 Pool of Elective Courses
MECHANICAL SCIENCES

Department of Materials Engineering

Course Course Credits Semester Prerequisites Comments

Number Title
MT 250 Introduction to Materials 3:0 Aug None
Science and Engineering
MT 271 Introduction to 3:0 Aug None
Biomaterials
Science and Engineering
MT 253 Mechanical Behaviour 3:0 Aug MT 250 or PD
205
of materials ME 228
MT 260/CH237 Polymer Science 3:0 Aug None
Engineering

Department of Mechanical Engineering

Course Course Credits Semester Prerequisites Comments

Number Title
ME 201 Fluid Mechanics 3:0 Aug(5th Sem) UP 101 20
UP 202
ME 228 Materials & Structure 3:0 Aug(5th Sem) None 15
Property Correlations
ME 240 Dynamics & Control 3:0 Aug None 10
of
Mechanical Systems
ME 271 Thermodyamics 3:0 Aug(7th Sem) UC 202
ME 256 Variational Methods 3:0 Jan(6th Sem) None Max 15 UG
& Students
Structural
Optimization
U? ? Elements of Solid 3:0 Jan No limit
Mechanics

9
Department of Aerospace Engineering

Course Course Credits Semester Prerequisites Comments

Number Title
AE 221 Flight vehicle structures 3:0 Aug None Max 10 UG
students
AE 224 Analysis & design of 3:0 Aug/Jan None Max 10 UG
students
Composite structures
AE 227 Multi-body dynamics 3:0 Aug None Max 10 UG
using students
Symbolic manipulators
AE 259 Navigation, Guidance & 3:0 Aug None Max 10 UG
students
Control
AE 224 Analysis & design of 3:0 Aug/Jan None Max 10 UG
students
Composite structures
AE 262 Guidance Theory & 3:0 Jan None Max 10 UG
Applications students
AE 281 Introduction to 3:0 Jan None Max 10 UG
Helicopters students

Centre for Atmospheric and Oceanic Sciences

Course Course Credits Semester Prerequisites Comments

Number Title
AS 230 Atmos Thermodynamics 3:0 Aug Physics No limit
AS 211 Observational 2:1 Aug None 2
Techniques
AS 209 Mathematical methods in 3:0 Aug None No limit
Cli Sci
UES Environmental Fluid 3:0 Aug None No limit
Mechanics
UES 204 Fundamentals of Climate 3:0 Jan No limit
Science
AS 202 GeoPhys Flu. Dyn. 3:0 Jan Diff. equations No limit

Department of Chemical Engineering

Course Course Credits Semester Prerequisites Comments

Number Title
CH 201 Chemical Engg 3:0 Aug None
Mathematics
CH 202 Numerical Methods 3:0 Aug None
CH 203 Transport Processes 3:0 Aug None
CH 204 Thermodynamics 3:0 Aug None
CH 237/MT260 Polymer Science and 3:0 Aug None
Engineering
CH 205 Chemical Reaction 3:0 Jan None
Engineering

10
Centre for Product Design and Manufacturing

Course Course Credits Semester Prerequisites Comments

Number Title
PD 201 Elements of Aug 2:1
Design
PD 202 Elements of Aug 2:1
Solid and Fluid
Mechanics
PD 212 Computer Aided Jan 2:1 Max No. of
Design UGs 15
CAE in Product Aug 2:1 Strength of Max No. of
PD 217 UGs 15
Design Materials,
Numerical
Methods
PD 214 Advanced Jan 3:0 Materials Max No. of
Materials UGs 15
& Science
Manufacturing
PD 215 Mechatronics Jan 2:1 Control Max No. of
UGs 15
Systems

Centre for Sustainable Technologies

Course Course Credits Semester Prerequisites Comments

Number Title
ST 202 Energy Systems 3:0 Aug None Max 20 UG
students
and Sustainability
ST 201 Thermochemical & 3:0 Jan None Max 20 UG
biological students
energy recovery from
biomass

11
 DIVISION of ELECTRICAL SCIENCES
Department of Computer Science and Automation

Course Course Credits Semester Prerequisites Comments

Number Title
E0 251 Data Structures 3:1 Aug A or S in UG 101 Only fifth term
or
& Algorithms Algorithms & later; Max
Programming number:10
A or S in all
Mathematics
Course in the UG
Programme
Automata 3:1 Aug A or S in UG 101 Only fifth term
E0 222 Theory or
& Algorithms & later; Max
Computability Programming number:10
A or S in all
Mathematics
Courses in the UG
Programme
Graph Theory 3:1 Aug A or S in UG 101 Only fifth term
E0 220 or
& Algorithms & later; Max
Combinatorics Programming number:10
A or S in all
Mathematics
Courses in the UG
Programme
E0 231 Algorithmic 3:1 Jan A or S in UG 101 Only sixth term
Algebra or
Algorithms & later; Max
Programming number:10
A or S in all
Mathematics
Courses in the UG
Programme
Game Theory 3:1 Jan A or S in UG 101 Only sixth term
EI 254 or
Algorithms & later; Max
Programming number:10
A or S in all
Mathematics
Courses in the UG
Programme

12
Department of Electrical Engineering

Course Course Credits Semester Prerequisites Comments

Number Title
E1 251 Linear and 3:0 5th or 7th Sem Multivariate calculus, max 15 UGs
Nonlinear matrices & linear
Optimisation algebra
E9 201 Digital Signal 3:0 5th or 7th Sem A basic orientation in max 25 UGs
Processing Signals and Systems

Department of Electrical Communication Engineering

Course Course Credits Semester Prerequisites Comments

Number Title
E3 238 Analog VLSI 2:1 Aug UE 102 Max 10 UG
Circuits students
E7 213 Introduction to 3:0 Aug 3rd yr or 4th yr UG No cap
Photonics standing

BioEngineering

Course Course Credits Semester Prerequisites Comments

Number Title
BE 201 Fundamentals of 3:0 Aug
Biomaterials and
Living Matter
BE 202 Thermodynamics 3:0 Jan
and Transport in
Biological
Systems
BE 205 Introduction to 3:0 Jan
Biomechanics of
Solids

Center for Nanoscience

Course Course Credits Semester Prerequisites Comments

Number Title
NE 327 Nanoelectronics 3:1 Aug
Device
Technology
NE 231 Microfluidics 3:0 Aug
NE 201 Micro and Nano 2:1 Aug
Characterization
Methods

13