CSE 2017 2021 - Syllabus - Book Corrected 17 06 2021

Curriculum and Syllabus
(Applicable to students admitted during AY 2017-18)

B. Tech Computer Science and Engineering
School of Engineering and Applied Sciences
Department of Computer Science Engineering

SRM University, AP-Andhra Pradesh.
Curriculum
B. Tech Computer Science Engineering Curriculum
Semester 1
No. Course Code Course Title L T P C
1 COM 101 Introduction to Communication 3 0 0 3
2 ECO 122 Principles of Economics 3 0 0 3
3 BIO 101 Introduction to Biology 3 0 2 4
4 CHE 101 Principles of Chemistry 3 0 2 4
5 MAT 141 Discrete Mathematics 3 0 0 3
Introduction to Computer Science and
6 CSE 101 3 0 4 5
Programming
22
Semester 2
Introduction to Electrical Engineering and 4 0 0 4
1 CSE 103
Computer Science
2 EGL 101 English 3 0 0 3
3 ECO 221 Economics and E-Commerce 3 0 0 3
4 MAT 111 Single-variable calculus 4 0 0 4
5 PHY 111 Introduction to Classical Mechanics 3 0 2 4
6 ENG 111 Basic Electronics 3 0 2 4
7 CDC 1002 Soft Skills 1 0 0 1
23
Semester 3
1 MAT 211 Linear Algebra and Differential Equations 3 0 0 3
2 ENV 111 Environmental Science 2 0 2 3
3 ENG 101 Engineering Fundamentals 3 0 0 3
4 PHY 211 Introduction to Electricity and Magnetism 2 0 2 3
5 CSE 223 Data Structures and Algorithms using C 3 0 2 4
6 CSE 221 Digital Systems Design 3 0 2 4
7 CDC 211 Soft Skills-III 1 0 0 1
21
Semester 4
1 MAT 121 Multivariable Calculus 3 0 0 3
2 ENG 211 Signals and Systems 3 0 0 3
4 CSE 234 Algorithm Analysis and Design 3 0 2 4
5 CSE 235 Computer Organization and Architecture 3 0 2 4
6 CSE 236 Object Oriented Programming 3 0 2 4
7 CDC 212 Soft Skills – IV 1 0 0 1
19
Semester 5
1 MAT 221 Probability and Statistics for Engineers 3 0 0 3
2 CSE 301 Operating Systems 3 0 2 4
3 CSE 302 Formal Languages and Automata Theory 3 0 0 3
4 CSE 303 Computer Networks 3 0 2 4
5 CSE SE Stream Elective- I 3 0 2 4
6 CDC 301 Soft Skills – V 1 0 0 0
7 PRJ 100 Project Internship (Optional Course) 0 0 4 2
18
Semester 6
1 CSE 304 Database Management System 3 0 2 4
2 MAT 131 Differential Equations 3 0 0 3
3 CSE 305 Software Engineering 3 0 2 4
4 CSE 306 Compiler Design 3 0 2 4
5 CSE SE Stream Elective- II 3 0 2 4
6 CSE 340 UROP 0 0 6 3
7 CSE 350 Cloud Foundation (Optional course) 1 0 2 2
8 CDC 302 Soft Skills -VI 1 0 0 0
22
Semester 7
1 CSE SE Stream Elective- III 3 0 2 4
2 CSE TE CSE Technical Elective 1 3 0 0 3
3 OE Open Elective 1 3 0 0 3/4
5 CSE 460 Capstone Project Phase I 0 0 12 6
19/21
Semester 8
1 CSE SE Stream Elective- IV 3 0 2 4
2 CSE TE CSE Technical Elective 2 3 0 0 3
4 CSE 461 Capstone Project Phase – II 0 0 12 6
16/17
Category wise Credit Distribution
Category No of Credits in
Course Category
Code Courses curriculum
Humanities and Social Sciences HS 9 15
Basic Sciences BS 11 37
Engineering Sciences ES 5 19
Professional Core C 11 43
SE 4 16
Professional Elective
TE 2 6
Open Elective OE 3 9/12
Project PR 3 15
Total 48 160/163
List of Stream Electives (Specializations)
S.No. Course Code Course Title L T P C
Artificial Intelligence and Machine Learning
1 CSE 311 Introduction to Machine Learning 3 0 2 4
2 CSE 314 Digital Image Processing 3 0 2 4
3 CSE 412 Principles of Soft Computing 3 0 2 4
4 CSE 413 Artificial Intelligence 3 0 2 4
Cyber Security
1 CSE 312 Introduction to Cryptography 3 0 2 4
2 CSE 315 Network Security 3 0 2 4
3 CSE 410 Mobile and Wireless Security 3 0 2 4
4 CSE 414 Internet Protocols and Networking 3 0 2 4
Data Science
1 CSE 311 Introduction to Machine Learning 3 0 2 4
2 CSE 313 Introduction to Data Science 3 0 2 4
3 CSE 411 Big Data Analytics 3 0 2 4
4 CSE 415 Inference and Representation 3 0 2 4
List of Technical Electives

Course Code Course Name L T P C
CSE 321 Human Computer Interaction 3 0 0 3
CSE 322 Advanced Computer Architecture 3 0 0 3
CSE 323 Natural Language Processing 3 0 0 3
CSE 324 Computer Graphics 3 0 0 3
CSE 325 Advanced Data Structures and Algorithms 3 0 0 3
CSE 326 Distributed Operating Systems 3 0 0 3
CSE 420 Data and Web Mining 3 0 0 3
CSE 421 Complexity Theory 3 0 0 3
CSE 422 Software Project Management 3 0 0 3
CSE 423 Multimedia 3 0 0 3
CSE 424 Deep learning 3 0 0 3
CSE 425 Advanced Database Management Systems 3 0 0 3
CSE 426 Fog Computing 3 0 0 3
CSE 427 Parallel Algorithms 3 0 0 3
CSE 428 Web Services 3 0 0 3
CSE 429 Advances in Data Mining 3 0 0 3
List of Open Electives VII Semester
ECE 417 Hardware Security 3 0 2 4
ECE 418 Machine Learning 3 0 2 4
ECE 419 Fundamentals of Wireless Communications 3 0 2 4
CHE 201 Fundamentals of Nanoscience 3 0 0 3
CHE 202 Renewable Energy 3 0 0 3
PSY 111 Psychology for Everyday Living 4 0 0 4
HIS 100 Idea of India 4 0 0 4
HIS 102A Human Civilizations 4 0 0 4
CSE 311 Introduction to Machine Learning 3 0 2 4
CSE 205 Object Oriented programming with Java 3 0 0 3
CSE 205 L Object Oriented Programming with Java Lab 0 0 2 1
ECE 313 Microprocessors and Interfacing 3 0 2 4
EEE 101 Fundamentals of Electrical Engineering 3 0 0 3
JOU 406 Basics of Media and Nationalism 3 0 0 3
IDEA 101 Entrepreneurship Lecture Series 3 0 0 3
IDEA 102 Design Thinking 3 0 0 3
HIS 005 An Introduction to Gender 3 0 0 3
CHE 123 Polymer Materials 4 0 0 4
PHY 302 Electrodynamics 3 0 2 4
BIO 110 Microbiology 3 0 0 3
BIO 310 Biochemistry 3 0 0 3
BIO 111 Evolution and Organismal Biology 3 0 0 3
MAT 304 Partial Differential Equations 4 0 0 4
MAT 305 Introduction to Science and Technology studies 4 0 0 4
PHY 303 Solid-state Physics 3 0 2 4
EGL 102 Technical Writing 4 0 0 4
ME 407 Thermal Power Engineering 3 0 0 3
List of Open Electives VIII Semester
CSE 411 Big Data Analytics 3 0 2 4
CSE 202 Web Technology 3 0 0 3
CSE 202 L Web Technology Lab 0 0 2 1
ECE 324 Computer Organization and Architecture 3 0 0 3
EEE 314 Nuclear Power Generation 3 0 0 3
ECE 325 Digital Image Processing 3 0 0 3
ECE 410 Adaptive Signal Processing 3 0 0 3
ME 228 Manufacturing Science 3 0 0 3
ME 562 Mechanical Behavior of Materials 3 0 0 3
PSY 111 Psychology for Everyday Living 4 0 0 4
MAT 355 Calculus of Variation 4 0 0 4
ME 223 Alternative Energy Sources 3 0 0 3
EEE 315 Artificial Neural Networks 3 0 0 3
IDEA 103 User Experienced Design 3 0 0 3
IDEA 104 Dream-Discover-Disrupt 3 0 0 3
HIS 200 India and Its People 4 0 0 4
ME 416 Surface Engineering 3 0 0 3
PHY 307M Special Theory of Relativity 3 0 2 4
HIS 005 Introduction to Gender 4 0 0 4
MOOC 100 Introduction to Robotics 3 0 0 3
MOOC 101 Psychology of Stress Health and Well-being 3 0 0 3
MOOC 102 Introduction to Film Studies 3 0 0 3
MOOC 103 German – I 3 0 0 3
SEMESTER – I
SEMESTER-I
COURSE COURSE NAME COURSE CREDITS

CODE CATEGORY L T P C
COM 101 Introduction to Communication HS 3 0 0 3
UNIT I: RHETORIC AND PUBLIC SPEAKING

Rhetoric, Critical Thinking and Public Speaking; Thinking Outside the Box; How to Deliver a
Speech; Fundamentals of Persuasion.
UNIT II: NONVERBAL COMMUNICATION

Nonverbal Communication; Spatial distance, eye contact and appearances; How nonverbal
communication is more important.
UNIT III: COMMUNICATION AND THE MEDIA

Persuasion and the media; Radio, television, film, social media and the internet; How the media
sells ideas, images, products and lifestyles; Fundamentals of Informative/Scientific Speeches
and Research; The Heart of the Speech – Powerful Narratives; The Power of Narrative.
UNIT IV: SMALL GROUP COMMUNICATION

Small group communication; Leadership, conflict and persuasion in groups; The importance
of small groups in business; Dr. A. Fisher’s Fundamentals of Small Groups; Group Problem
Solving; Learning to say no – don’t say you will when you won’t, don’t say yes and then don’t
do it, be true to your word.
UNIT V: PERSUASION, IDEOLOGY AND MEDIA BIAS

Advanced Rhetoric; Ideology; Persuasive Fallacies; How to Construct a Persuasive Speech;
How to Present Scientific Data in a Speech; Unmasking Media Bias and Ideology; Full circle
– the dangers of rhetoric and ideology.
TEXTBOOKS:
1. Communication: Principles for a Lifetime. Beebe, Beebe and Ivy, 6th Edition,
Pearson Publishing.
REFERENCES:
1. Qualitative Communication Research Methods (2011) Bryan C. Taylor and Thomas
R. Lindlof. Sage Publications, New Delhi, India, 3rd Edition.
2. The Fundamentals of Small Group Communication (2008) Scott A. Myers and
Carolyn M. Anderson. Sage Publications, New Delhi, India.
SEMESTER-I

ECO 122 Principles of Economics HS 3 0 0 3
UNIT I: INTRODUCTION TO ECONOMICS

Why study economics? Scope and method of economics; the economic problem: scarcity and
choice; the question of what to produce, how to produce and how to distribute output. Science
of economics; the basic competitive model; prices. Science of economics; the basic competitive
model; prices, Property rights and profits; incentives and information; rationing; Opportunity
sets; economic systems; reading and working with graphs.
UNIT II: DEMAND AND SUPPLY

Determinants of individual demand/supply; demand/supply schedule and demand/supply
curve; market versus individual demand/supply; Shifts in the demand/supply curve, demand
and supply together; How prices allocate resources; elasticity and its application; How prices
allocate resources; elasticity and its application; Controls on prices; taxes and the costs of
taxation; Controls on prices; taxes and the costs of taxation; Consumer surplus; producer
surplus and the efficiency of the markets Consumer surplus; producer surplus and the efficiency
of the markets.
UNIT III: CONSUMER THEORY

The consumption decision - budget constraint, The consumption decision - budget constraint,
consumption and income/price changes. Demand for all other goods and price changes; Utility
and preferences (indifference curves); properties of indifference curves; Utility and preferences
(indifference curves); properties of indifference curves; Consumer ‘s optimum choice Income
and substitution effects; Applying consumer theory: Labour Applying consumer theory:
Labour.
UNIT IV: PRODUCER THEORY

Production, short- run production function and returns to factor; Average-marginal relationship
Long– run production function and laws of return to scale- role of technology. Cost function
and cost structure of a firm in the short- run, Long run cost function and cost structure.
UNIT V: TYPES OF MARKET

Perfect competition –features Perfect competition- profit maximization Shut-down and break-
even points. Monopoly: marginal revenue; marginal cost; profit maximization; Shutdown
rule; market power; price discrimination. Monopolistic competition and product
differentiation.
TEXBOOKS:
1. Principles of microeconomics, N. Gregory Mankiw, Publisher: Cengage Learning
5th edition.
2. Macroeconomics, Oliver Blanchard and David R Johnson, Publisher: Pearson;
6thedition.
REFERENCES:
1. Intermediate Microeconomics: A Modern Approach, Hal R. Varian, Affiliated East-
West Press Pvt. Ltd., 8thedition.
2. Principles of Macroeconomics with Course Mate, N. Gregory Mankiw, Cengage India,
6thedition.
SEMESTER-I

BIO 101 Introduction to Biology BS 3 0 2 4
UNIT I: BASIS OF LIFE AND DIVERSITY

Molecular evolution. Elements to molecules: water, carbohydrates, lipids. Proteins, nucleic
acids. Vitamins and minerals. Diversity of life: virus, bacteria, archaea and eukarya. Concept
of terrestrial. Aquatic and amphibians. Mode of energy & carbon utilization-auto. Hetero and
lithotrophs.
UNIT II: CELL BIOLOGY

Cell: morphology. Cell organelles and functions. Concept of unicellular and multicellular
organisms. Cell cycle and cell division: mitosis and meiosis. Basis of cell-cell communication
and signaling.
UNIT III: BASIC MOLECULAR BIOLOGY

DNA and Chromosomes: structure and organization. DNA replication. Transcription.
Translation. Introduction to genetic engineering.
UNIT IV: ENZYMES AND APPLICATIONS

Introduction to enzymes; classification. Parameters influencing the enzyme activity.
Mechanism of enzyme action and enzyme inhibition. Commercial applications of
microorganisms and enzymes.
UNIT V: BIOLOGICAL SEQUENCES AND DATABASES

DNA and Protein sequences. Concept of genomics, transcriptomics. Proteomics and
metabolomics. File formats of sequence storage: FASTA file, GenBank. Biological databases
– NCBI and EMBL browsers. KEGG and UniProt databases. Usefulness of biological
Metadata-Array expression and 1000 genomes. Application of BLAST and Protein/Gene ID
conversion.
TEXTBOOKS
1. Thrives in Biochemistry and Molecular Biology, Edition 1, 2014, Cox, Harris, Pears,
Oxford University Press.
2. Exploring Proteins, Ed. 1, 2014, Price and Nairn, Oxford University Press.
3. Thrives in Cell Biology, Ed. 1, 2013, Qiuyu Wang, Cris Smith and Davis, Oxford
University Press.
4. Metallic Nano crystallites and their Interaction with Microbial Systems, Ed. 1, 2012,
Anil K. Suresh, Springer Netherlands.
REFERENCES
1. The cell: a molecular approach. Cooper, G. M., Hausman, R. E. (2009). ASM Press,
Washington D. C.
2. Lehninger principles of biochemistry. Lehninger, A. L., Nelson, D. L., &Cox, M. M.
(2000), Worth Publishers, New York.
3. Principle and techniques of biochemistry and molecular biology, Wilson, K., Walker,
J. (2005). 6th edn. Cambridge University Press, Cambridge.
4. Kuby Immunology, Ed. 5, 2006, Kindt, Goldsby and Osborn, W. H Freeman & Co (Sd).
5. Molecular Cell Biology, Ed. 8, 2016, Harvey Lodish, Arnold Berk and Chris A. Kaiser,
W. H Freeman & Co (Sd).
6. Microbial Biotechnology: Principles and Applications, Ed. 1, 2006, Yuan Kun Lee,
World Scientific Publishing Co Pt. Ltd.
LIST OF PRACTICAL EXPERIMENTS

1. Isolation of starch from potato.
2. Estimation of carbohydrates.
3. Determination of enzyme activity (amylase assay).
4. Observation of various stages of mitosis in onion root tips.
5. Isolation, purification and observation of microbes from different sources.
6. Microbial gram staining.
7. Purification of DNA, restriction digestion, agarose gel electrophoresis and
visualization.
8. Isolation of proteins and determination of protein concentration using Bradford’s
method.
9. Separation of proteins using SDS-PAGE and Coomassie staining.
SEMESTER-I

CHE 101 Principles of Chemistry BS 3 0 2 4
UNIT I: CHEMICAL BONDING

Ionic, covalent, metallic bonds and hydrogen bonding Theories of bonding: Hybridization:
Types of hybridization, sp, sp2, sp3, sp3d, d2sp3. Shapes of molecules (VSEPR Theory):
BeCl2, CO2, BF3, H2O, NH3, CH4, PCl5, XeF2, SF6, XeF4. Molecular orbital theory: Linear
combination of atomic orbitals (LCAO Method), bond order, homo-nuclear diatomic
molecules such as H2, O2.
UNIT II: PHASE RULE, THERMOCHEMISTRY, AND KINETICS

Definition of the terms used in phase rule with examples Application of phase rule to one
component system (eg Water) Application of phase rule to two component system (eg Pb-Sn)
Standard terms in thermochemistry and their significance Heat of combustion, formation and
sublimation (with examples in fuels and propellants) Order and molecularity of reactions, zero
order, first order rate equations, Problems associated with Zero & First order reactions.
UNIT III: CRYSTALLINE MATERIALS

Introduction to solid state materials, difference between crystalline and amorphous systems,
Properties of crystalline materials Crystal lattice, unit cells, types of crystal systems, types of
unit cells (Bravais lattices) Miller indices, Bragg’s law Problems associated theoretical density
of crystals and Bragg’s equation Introduction to Band theory, metals, insulators, and
semiconductors with examples. Classification of semiconductors, imperfections in crystals
Frenkel and Schottky defects, doping and devices.
UNIT IV: MATERIALS CHEMISTRY

Introduction to Polymers Classification of polymers, Thermoplastic and Thermosetting
polymers with examples, Tacticity of polymers Properties of polymers: Glass transition
temperature (Tg) Properties of polymers: Molecular weight, weight average, Problems
associated with Molecular weight, weight average Degradation of polymers and biodegradable
polymers, Common Polymers: Elastomer, Conducting polymer Hardness in water,
demineralization of water; Water treatment: Zeolite process.
UNIT V: ELECTROCHEMISTRY
Introduction to Electrochemical cells and classification of Electrochemical cells Primary and
secondary cells with examples Lead-acid battery and Li+ batteries Li+ batteries and Fuel cells.
TEXTBOOKS
1. Bahl and B. S. Bahl, G. D. Tuli, Essentials of physical chemistry, S Chand Publication,
2014, ISBN: 8121929784.
2. P.W. Atkins, T.L. Overton, J.P. Rourke, M.T. Weller and F.A. Armstrong Shriver and
Atkins' Inorganic Chemistry, 5thEd., Oxford University Press, London, 2010, ISBN
978-1-42-921820-7.
3. Atkins, P.W.; de Paula, J. Physical chemistry, 8th ed., 2006 Oxford University Press.
ISBN 0-19-870072-5.
4. B. R. Puri, L. R. Sharma & M. S. Pathania, Principles of Physical Chemistry, 46th
Ed.,2013, Vishal Publication Company.
5. F.W. Billmeyer, Books of Study of Polymer Science, 3rd Ed., John Wiley & Sons, New
York, 2003.
REFERENCES
1. J. Bard and L.R. Faulkner, Electrochemical methods –Fundamentals and Applications,
2ndEd., John Wiley and Sons,2001.
2. Jain P.C. & Monika Jain, Engineering Chemistry, Dhanpat Roy & Sons, 2015, ISBN
10: 8187433175 / ISBN 13: 9788187433170.

1. Volumetric titration of HCl vs NaOH.
2. Conductometric titration of HCl vs NaOH.
3. Standardization of potassium permanganate by Oxalic acid.
4. Iodometric Determination of Ascorbic Acid (Vitamin C)
5. Determination of hardness of water by EDTA method.
6. Determination of strength of given hydrochloric acid using pH meter.
7. Estimation of iron content of the given solution using potentiometer.
8. Determination of sodium and potassium by flame photometry.
SEMESTER-I

MAT 141 Discrete Mathematics BS 3 0 0 3
UNIT I: THE FOUNDATIONS: LOGIC AND PROOFS

Propositional Logic, Applications of Propositional Logic, Propositional Equivalences,
Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs,
Proof Methods and Strategy.
UNIT II: SET THEORY

Laws of set theory, Set Operations, Functions, Sequences and Summations, Matrices.
UNIT III: ELEMENTARY NUMBER THEORY, INDUCTION AND RECURSION

Divisibility and Modular Arithmetic, Integer Representations and Algorithms, Primes and
Greatest Common Divisors, Solving Congruences; Mathematical Induction, Strong Induction
and Well-Ordering, Recursive Definitions and Structural Induction.
UNIT IV: COUNTING PRINCIPLES

The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Binomial
Coefficients and Identities, Applications of Recurrence Relations, Solving Linear Recurrence
Relations, Divide-and-Conquer Algorithms and Recurrence Relations.
UNIT V: INTRODUCTION TO GRAPH THEORY

Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing
Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path
Problems.
TEXTBOOKS
1. Kenneth H. Rosen, Discrete Mathematics and Applications, Seventh edition, Tata
McGraw-Hill, 2012.
2. J. P. Tremblay and R. P. Manohar, Discrete Mathematics with Applications to
Computer Science, Tata McGraw-Hill, 1997.
REFERENCES
1. S. Lipschutz and M. L. Lipson, Schaum's Outline of Theory and Problems of Discrete
Mathematics, 3rd Ed., Tata McGraw-Hill, 1999.
2. M. K. Venkataraman, N. Sridharan, and N. Chandrasekaran, Discrete Mathematics,
National Publishing Company, 2003.
SEMESTER-I

CSE 101 Introduction to Computer Science ES 3 0 4 5
and Programming
UNIT I: INTRODUCTION TO PYTHON

Knowledge, Machines, Languages. Types, Variables Operators and Branching. Core elements
of programs: Bindings, Strings, Input/Output, IDEs. Input/Output, IDEs. Control Flow,
Iteration, Guess and Check. Simple Programs: Approximate Solutions. Bisection Search.
Floats and Fractions. Newton-Raphson.
UNIT II: FUNCTIONS

Decomposition and Abstraction. Functions and Scope. Keyword Arguments, Specification.
Iteration vs Recursion. Inductive Reasoning. Towers of Hanoi. Fibonacci. Recursion on non –
Numerics. Files.
UNIT III: TUPLES AND LISTS

Tuples and Lists: Tuples, Lists, List Operations. Mutation, Aliasing, Cloning. Dictionaries:
Functions as Objects, Dictionaries. Example with a Dictionary, Fibonacci and Dictionaries.
Global Variables. Debugging: Programming Challenges. Classes of Tests, Bugs, Debugging,
Debugging Examples. Assertions and Exceptions, Assertions, Exceptions. Exception
Examples.
UNIT IV: CLASSES AND INHERITANCE

Object Oriented Programming, Class Instances, Methods Classes Examples, Why OOP,
Hierarchies, Your Own Types – An Extended Example: Building a Class, Visualizing the
Hierarchy, adding another Class, Using Inherited Methods, Gradebook Example, Generators.
UNIT V: COMPUTATIONAL COMPLEXITY

Program Efficiency, Big Oh Notation, Complexity Classes Analyzing Complexity – Searching
and Sorting Algorithms: Indirection, Linear Search, Bisection Search, Bogo and Bubble Sort,
Selection Sort, Merge Sort.
TEXTBOOKS
1. Introduction to Computation and Programming using Python, by John Guttag, PHI
Publisher, Revised and Expanded version (Referred by MIT).
REFERENCES
1. Python Programming using problem solving Approach by Reema Thareja, Oxford
University, Higher Education Oxford University Press; First edition (10 June 2017),
ISBN-10: 0199480173.
2. Data Structures and Algorithms in Python by Michael T Goodrich and Robertto
Thamassia, Micheal S Goldwasser, Wiley Publisher (2016).
3. Fundamentals of Python first Programmes by Kenneth a Lambert, Copyrighted material
Course Technology Inc. 1stedition (6th February 2009).
1. A company decided to give bonus of 5% to employee if his/her year of service is more
than 5 years. Ask user for their salary and year of service and print the net bonus
amount.
2. Write a program that computes the real roots of a quadratic function. Your program
should begin by prompting the user for the values of a, b and c. Then it should display
a message indicating the nature of real roots, along with the values of the real roots (if
any).
3. Write a Python program to find the factorial of the given number (Example: 5!=
5*4*3*2*1 =120).
4. Write a Python program to read the numbers from the keyboard using a loop, perform
the sum and average of all the input numbers until “-10” is encountered.
5. Write a Python program to count the number of strings where the string length is 2 or
more and the first and last character are same from a given list of strings.
6. Write a python program for bubble sort algorithm. What is the best case and worst-case
time complexity of Bubble sort algorithm? Explain with an example, where the list of
elements is not sorted then what would be the output after each iteration/pass.
7. Write a python program for Selection sort algorithm. What is the worst case or average
case time complexity of selection sort algorithm?
8. Write a Program in python using object-oriented concept to make calculator which has
the following operations: Addition, Subtraction, Multiplications, Divisions,
Exponentials, Modulus.
9. Define is inheritance? Explain with suitable example: Single level inheritance,
Multiple Inheritance, Multi-level Inheritance.
10. Write a Program in python using object-oriented concept to create a base class called
Polygon and there are three derived classes named as triangle, rectangle and square.
The base class consists of the input function for accepting sides length and the derived
classes must have output function for displaying area of triangle, rectangle and square.
SEMESTER - II
SEMESTER-II

CSE 103 Introduction to Electrical ES 4 0 0 4
Engineering and Computer Science
UNIT I: OBJECT ORIENTED PROGRAMMING CONCEPTS USING PYTHON

Objects, Class. Method, Encapsulation. Data abstraction. Polymorphism. Inheritance. Object
Oriented Design Principles and Patterns: Iterator Pattern. Decorator Pattern. Strategy Pattern.
UNIT II: STATE MACHINES BASICS AND DESIGN USING PYTHON

Introduction to regular expressions. Finite state machines. Design state machine using python.
Basic combination and abstraction of state machines. Terminating state machines and
sequential compositions. Use case of state machine design using python.
UNIT III: CIRCUIT ANALYSIS

Review of KCL and KVL, Basic Circuit Terminology-Node. Loop, mesh, circuit. branch and
Path Ideal sources, Source transformation. Star-Delta transformation. AC analysis - Phasor,
Complex impedance. Complex power, power factor. Power triangle, impedance triangle. Series
and parallel circuits.
UNIT IV: NETWORK THEOREMS

Network Theorems (A.C. and D.C Circuits) - Mesh and Nodal analysis. Superposition theorem.
The venin’s theorem. Norton theorem. Maximum Power transfer. Reciprocity theorem.
UNIT V: RESONANCE AND TRANSIENT ANALYSIS

Introduction to Resonance-series and parallel. Half power frequency. Resonant frequency.
Bandwidth, Q factor. Transient Analysis-Step response. Forced Response of RL. RC & RLC
Series circuits. Time Constant & Natural frequency of Oscillation.
TEXTBOOKS/REFERENCES
1. Object-Oriented Programming in Python, by Michael H Gold wasser, David Letscher,
Pearson publication 1st edition (29 October 2007).
2. Theory of Computer Science: Automata, Languages and Computation, by Mishra
K.L.P Publisher: Prentice Hall India Learning Private Limited; 3rd edition (2006).
3. Fundamentals of Electrical Engineering, Second Edition, by Leonard Bobrow Oxford
University press,1996.
4. Network Analysis, by G K Mithal, Khanna Publisher, Delhi (2003).
5. Fundamentals of Electric Circuits, by Charles K. Alexander and Matthew N.O. Sadiku,
Publisher: McGraw Hill Education, 5th edition (1 July 2013).
6. Programming Python: Powerful Object-Oriented Programming 4th, Kindle Edition by
Mark Lutz (Author) Publisher: O'Reilly Media; 4 editions -14 December 2010).
7. Automata Theory, Languages and Computation (Bundle - Set of 2 Books of Study)
Paperback Apr 2016 by John E. Hop croft (Author), Jeffrey D Ullman (Author), Rajeev
Motwani (Author) Publisher: Pearson Education; Third edition (10 April 2016).
8. Electrical Engineering Fundamentals, Vincent Del Toro, Second edition, Prentice Hall
India Learning Private Limited, 2014.
9. Fundamentals of Electric Circuits, Charles K. Alexander and Matthew N.O. Sadiku,
Mc Graw Hill Higher Education, Fifth Edition, 2013.
10. Principles of Electric Circuits Conventional Current Version, Thomas L. Floyd,
Education Limited, Ninth Edition, 2009.
11. Engineering Circuit Analysis, by William H. Hayt (Author), Jack Kemmerly (Author),
Steven M.Durbin (Author), Publisher: McGraw Hill Education, Eighth edition (August
2013).
SEMESTER-II

EGL 101 English
HS 3 0 0 3
UNIT I: HORIZONTAL AND VERTICAL WRITING

Students learn the differences between Vertical and Horizontal Writing. Readings from the best
writers illustrate the best English writing.
UNIT II: BASIC ENGLISH CONCEPTS AND INTRODUCTION TO LINGUISTICS

Students learn by the practice of working on basic English concepts of writing and speaking.
UNIT III: CREATIVE WRITING

Learning to express ideas in ways that persuasively and clearly help the readers/listeners
understand the student’s experiences.
UNIT IV: RESEARCH WRITING

The basics of how to write a research paper. Most students were (shockingly) never required
to do a bibliography. They learn about thesis paragraphs, research, outlines, rewriting, editing
and creating a bibliography.
UNIT V: ENGLISH PRESENTATIONS

In this UNIT, students learn to combine and synthesize their writing with presentation skills.
Research papers and ideas are shared and presented to small and large groups.
TEXTBOOKS
1. Communicative English – (A workbook) Cambridge University Press.
2. Streets of Laredo by Larry Mc Murty (A novel), Simon and Schuster, 2010.
REFERENCES
1.Oxford English Language Dictionary.
SEMESTER-II

ECO 221 Economics and E-Commerce HS 3 0 0 3
UNIT I: INTRODUCTION
Relevance and potential of E-Commerce in India (Lecture notes) E-commerce and its relevance
to labour, credit and health care markets (Lecture notes) Credit and health care markets
(Lecture notes).
UNIT II: BACKGROUND CONCEPTS

Perfect competition- Meaning, revenue of a competitive firm, Profit maximization and firms
supply curve Monopolistic competition and product differentiation Competition with
differentiated products. (Mankiw, chapters 14, 15 and 16). Monopoly pricing and price
discrimination, Meaning, monopolies production and pricing decisions, price discrimination,
advertisement. (PRN Sections 3.1, 3.2, 4.1) (SV Chapters 2, 3) Competition and oligopoly
pricing, cost of producing information. Cost and competition, market structure for information
goods, pricing your product. (Shapiro and Varian, Chapter 2) Market leadership- Network and
positive feedback, demand side economies of scale, network externalities, collective switching
costs, Generic strategies in network markets (Shapiro and Varian, Chapters 5, 7), PRN Section
12.4, Time Paths in the Diffusion of Product Innovations.
UNIT III: SELECT E-INDUSTRIES

Auctions: Why are some goods auctioned and others sold at fixed prices?
Different auction platforms and what explains success of some platforms and failures of
other platforms. Changes in business of auctions over the past two decades. Required web
surfing: eBay, Yahoo!, Auctions on the Internet: What's Being Auctioned and How, Vickrey
auctions in practice: From Nineteenth Century Philately to Twenty-First Century, E-commerce,
Trust Among Strangers in Internet Transactions: Empirical Analysis of eBay’s
Retail stores How does the internet affect retail markets? Comparison of these markets with
the traditional markets in terms of search costs and patterns of competition, Required web
surfing: Amazon, Dell, Pcboost, Z-shops, Yahoo! Shopping, Autobytel, & Wal-Mart,
Emerging Landscape for Retail E-Commerce.
UNIT IV: INTRODUCTION TO STATISTICS AND ECONOMETRICS

Definition of basic statistical concepts: mean, median, probability, conditional expectation,
conditional probability (Lecture notes), Introduction to regression analysis (Lecture notes),
Statistical Models and Shoe Leather.
UNIT V: SALES TAXES AND E-COMMERCE

The effect of sales taxes on the development e-commerce, Demand and supply effects of
sales taxes, Sales taxes and internet commerce, ìTax Sensitivity and Home State Preferences
in Internet Purchasing, In a World without Borders: the Impact of Taxes on
Internet Commerce, Playing with Fire: Cigarettes, Taxes and Competition from the Internet,
ìTaxation of Electronic Commerce.
TEXTBOOKS
1. Industrial Organization: Contemporary Theory and Practice by Pepall, Richards and
Norman [PRN].
2. Information Rules by Shapiro and Varian [SV].
3. Principles of microeconomics, N. Gregory Mankiw, Publisher: Cengage Learning fifth
edition.
REFERENCES
1. Intermediate Microeconomics: A Modern Approach, Hal R. Varian, Affiliated East-
West Press Pvt. Ltd., eighth edition.
2. Electronic Commerce (Fourth Edition), Adesh k. Pandey: Pete Loshin.
3. E-Business and E-Commerce Management, Dave Chaffey, 3rd Edition, 2009, Pearson
Education Inc., New Delhi.
4. E-Commerce fundamentals and Applications, Chan, Wiley India, New Delhi.
SEMESTER-II
MAT 111 Single Variable Calculus BS 4 0 0 4
UNIT I: LIMIT AND CONTINUITY

Limit of a function at a point One-sided limits Continuity Limits involving infinity.
UNIT II: DIFFERENTIATION

Derivative at a point Derivative as a function Product rule, Quotient rule and chain rule Implicit
differentiation Rolle’s Theorem Mean Value Theorem.
UNIT III: INTEGRATION

Area as a limit of finite sums Definite and indefinite integral Fundamental Theorem of Calculus
Integration by substitution Integration by parts Integration by partial fractions.
UNIT IV: APPLICATION OF CALCULUS

Maxima and minima Concavity and curve sketching Optimization problems in Physics
Economics & Mathematics Area between curves Volumes, Arc length, Moments and Centres
of mass Newton’s method to find roots.
UNIT V: SEQUENCE AND SERIES

Sequences, Sum of a series Comparison test, Root test, Ratio test Leibniz theorem on
alternating series Power series, Taylor’s and Maclaurin series Absolute and conditional
convergence.
TEXBOOKS/REFERENCES
1. Thomas' Calculus, 14th Edition, Joel R. Hass, Christopher E. Heil, Maurice D. Weir,
2018.
2. Introduction to Real Analysis 4th Edition, Robert G. Bartle, Donald R. Sherbert, 2014.
3. Calculus and Analytic Geometry, 9th Edition, George B. Thomas, Jr. Ross L. Finney.
2017.
SEMESTER-II

PHY 111 Introduction to Classical Mechanics BS 3 0 2 4
UNIT I: REVIEW OF NEWTONIAN MECHANICS

Review of Scalars, Vectors. Kinematics: Equations of motion for constant acceleration and
non-constant acceleration. Dynamics: Contact forces, Static friction, kinetic friction and
worked examples. Free body force diagram; Applications of Newton’s law. Worked examples.
Tension, Pulley systems, worked examples. Solving various pulley systems using free body
force diagram and Newton’s law.
UNIT II: CIRCULAR MOTION

Polar Coordinates; conversion between Cartesian and polar coordinates. Angular position,
velocity and acceleration. Angular motion for a constant angular acceleration. Radial and
tangential acceleration, uniform Circular Motion, Period and Frequency. Free body force
diagrams; Application of Newton’s law in circular motion with worked examples. Worked
examples, conversion from revolution per minute to angular velocity. Worked examples, Flat
curved roads and Banking, Conical pendulum, circular motion in vertical plane.
UNIT III: MOMENTUM AND IMPULSE

Momentum and Impulse, Impulse momentum theorem, Average force, worked examples
Conservation of Momentum, Momentum Diagrams, Worked examples. Center of Mass of
point objects and continuous systems worked examples. Center of Mass of a Uniform Rod,
rectangular sheet and different objects. Motion of the Center of Mass; Velocity and
Acceleration of the Center of Mass. Reduction of a System to a Point Particle, Center of Mass
Trajectory, projectile blast problem.
UNIT IV: WORK ENERGY AND COLLISION
Kinetic Energy and Work in 1D, 2D and 3D; Work by a Constant and a non- Constant Force.
Work-Kinetic Energy Theorem and worked examples. Conservative and Non-conservative
Forces with examples, Potential Energy due to gravity and Potential Energy of a spring.
Principle of energy conservation; worked examples. Collision and its type. Collision in 1D and
2D. Elastic and inelastic collision; worked examples.
UNIT V: ROTATIONAL MOTIONS, GRAVITATION
Rigid body, Rotational Motion, moment of inertia. Moment of inertia of various objects,
worked examples, Parallel and perpendicular axis theorem. Torque and Angular momentum,
conservation of angular momentum, worked examples. Rolling motion, worked examples,
Conservation of energy in rotational motion. Central forces, Newton's Law of Gravitation.
Acceleration due to gravity and its variation, Gravitational Potential Energy.
1. MIT-- 8.01X online course material.
2. Physics for Scientist and Engineers, Ninth edition (2017) - Raymond A. Serway, John
W. Jewett (Publisher - Cengage India Private Limited)).
3. University Physics with Modern Physics with Mastering Physics, (12th Edition) – Hugh
D. Young, Roger A. Freedman and Lewis Ford (Publisher – Pearson Education).
4. Laboratory manuals.
SEMESTER-II

ENG 111 Basic Electronics ES 3 0 2 4
UNIT I: BASIC ELECTRONIC CIRCUIT CONCEPTS

Introduction to Units, Scales, Charge, Current, Voltage, Power. Voltage and Current Sources,
Dependent and Independent Sources Ohm’s Law, Resistance, Conductance, Resistivity,
Conductivity Introduction to Nodes, paths, Branches, Loop and KCL, Numericals Single Loop
and node pair circuits analysis Series and Parallel connected sources, Resistors in series,
parallel Voltage and Current Division, Numericals. Thevenin Equivalent Circuits. Norton
Equivalent Circuits.
UNIT II: SEMICONDUCTOR BASICS AND DIODE MODELS

Introduction to Semiconductors- Si, Ge, GaAs, Covalent bonding and Intrinsic
Semiconductors, Difference in band Diagrams of Insulators, conductors, Semiconductors.
Doped Semiconductor, n-type and p-type. Current mechanisms in Semiconductor-Drift and
Diffusion with expressions, Resistivity of a semiconductor, Numericals. PN Junction Diode
Operation under No Bias, Forward bias, Reverse Bias conditions, I-V characteristics.
Reverse Breakdown, Effect of Temperature on Diode characteristics. I-V Characteristics of
Ideal vs Practical diodes, Diode Resistance levels. Diode Equivalent circuits- Piecewise,
Simplified and Ideal Diode models and I-V Characteristics. Diode Capacitances and Reverse
recovery time. Zener Diode operation.
UNIT III: DIODE APPLICATIONS

Load line Analysis, Series and Parallel Diode Configurations and analysis of circuits with
application of KCL, KVL, etc. Diode based AND/OR Logic gates design and analysis. Half
wave Rectifier Operation; Circuit, waveforms, DC output, Peak output, Ripple factor with a
filter circuit, PIV. Full wave Rectifier Operation; Circuit, waveforms, DC output, Peak output,
Ripple factor, PIV. CT Full wave Rectifier Operation; Circuit, waveforms, DC output, Peak
output, Ripple factor with a filter circuit, PIV. Analysis and Design with Series and Parallel
configuration of Clipper circuits. Clamper Circuits and analysis with DC sources. Zener Diode
as Voltage Regulator circuit.
UNIT IV: BJT and MOSFETs

BJT structure and Physical operation. Large signal models and Operation in Saturation. BJT
Current-Voltage characteristics and Graphical Representation. Early effect and model.
Analysis of BJT circuits at DC. Analysis of BJT circuits at DC MOSFET structure and
operation. P-MOSFET and CMOS introduction. MOSFET I-V Characteristics, Large signal
model. Channel Length modulation and Characteristics, Model. Analysis of MOSFET circuits
at DC.
UNIT V: SINGLE STAGE TRANSISTOR AMPLIFIERS

Basic Principles of Amplification: BJT vs MOSFET. BJT and MOSFET small signal operation
and models. Analysis of CS and CE Amplifiers. Analysis of CS (CE) Amplifiers with source
(Emitter) Resistance, Analysis of CG and CB Amplifiers. Analysis of Source and Emitter
followers. BJT and MOSFET biasing arrangements. Amplifier Frequency Response
Introduction.
TEXTBOOKS
1. Engineering Circuit Analysis, by William Hayt, J E Kemmerly and S.M. Durbin, 8th
Edition, Mc Graw Hill.
2. “Electronic Devices and Circuit Theory” by R L Boylestad, L Nashelsky, 11th edition.
3. “Microelectronic Circuits Theory and Applications”, by Sedra and Smith, 7th Edition,
Oxford.

1. Verification of KCL, KVL and Ohm’s Laws.
2. Analysis of a Given Circuit with Resistors and Sources and Verification.
3. Verification of PN Junction Diode I-V Characteristics in FB and RB Operation.
4. Diode based Rectifier Circuits.
5. Introduction to PCB design.
6. Diode based Clipper and Clamper Circuits.
7. Zener Diode As Voltage Regulator.
8. BJT CE Configuration Input and Output Characteristics.
9. MOSFET CS Configuration Input and Output Characteristics.
10. MOSFET Single stage CS Amplifier Frequency Response.
SEMESTER-II
COURSE COURSE NAME C/OE/TE/SE CREDITS
CODE L T P C
CDC 1002 Soft Skills HS 1 0 1 1
UNIT I: INTERPERSONAL SKILLS

Understanding the relationship between Leadership Networking and Teamwork, Realizing
Ones Skills in Leadership, Networking & Teamwork, and Assessing Interpersonal Skills
Situation description of Interpersonal Skill. Teamwork Necessity of Team Work Personally,
Socially and Educationally.
UNIT II: LEADERSHIP

Skills for a good Leader, Assessment of Leadership Skills, Change Management, Exploring
Challenges, Risking Comfort Zone, Managing Change.
UNIT III: STRESS MANAGEMENT

Causes of Stress and its impact, how to manage & distress, Understanding the circle of control,
Stress Busters. Emotional Intelligence What is Emotional Intelligence, emotional quotient why
Emotional Intelligence matters, Emotion Scales. Managing Emotions.
UNIT IV: CONFLICT RESOLUTION

Conflicts in Human Relations – Reasons Case Studies, Approaches to conflict resolution.
UNIT V: DECISION MAKING

Importance and necessity of Decision Making, process of Decision Making, Practical way of
Decision Making, Weighing Positives & Negatives.
TEXTBOOKS
1. Covey Sean, Seven Habit of Highly Effective Teens, New York, Fireside Publishers,
2. 1998.
3. Carnegie Dale, How to Win Friends and Influence People, New York: Simon&
Schuster, 1998.
4. Thomas A Harris, I am ok, you are ok, New York-Harper and Row, 1972
5. Daniel Coleman, Emotional Intelligence, Bantam Book, 2006.
SEMESTER – III
SEMESTER-III
MAT 211 Linear Algebra and Differential BS 3 0 0 3
Equations
UNIT I: MATRICES AND GAUSSIAN ELIMINATION

Introduction, Geometry of Linear Equations. Gaussian Elimination. Matrix Notation and
Matrix Multiplication. Triangular Factors and Row Exchanges. Inverses and Transposes.
UNIT II: VECTOR SPACES

Vector spaces and Subspaces. Solving Ax = 0 and Ax = b Linear Independence, Basis and
Dimension. The Four Fundamental Subspaces. Graphs and Networks, Linear Transformations.
UNIT III: ORTHOGONALITY

Orthogonal Vectors and Subspaces. Cosines and Projections onto Lines. Projections and Least
Squares. Orthogonal Bases and Gram-Schmidt.
UNIT IV: DETERMINANTS

Introduction. Properties of the Determinant. Formulas for the Determinant. Applications of
Determinants.
UNIT V: EIGENVALUES AND EIGENVECTORS

Introduction, Diagonalization of a Matrix. Difference Equations and Powers Ak Differential
Equations and e At Complex Matrices, Similarity Transformations.
1. Gilbert Strang, Linear Algebra and Its applications, Nelson Engineering, 4th Edn.,
2007.
2. S. Axler, Linear Algebra Done Right, 2nd Edn., UTM, Springer, Indian edition, 2010.
3. K. Hoffman and R. Kunze, Linear Algebra, Prentice Hall of India, 1996.
SEMESTER-III

ENV 111 Environmental Science BS 2 0 2 3
UNIT I: ENVIRONMENTAL CRISIS AND SUSTAINABLE DEVELOPMENT

Global environmental crisis and its causes, man-environment relationship. Ecological
footprint, what is sustainable development, why you should study environmental science?
UNIT II: ECOSYSTEMS

What is an ecosystem? Structure and functions of an ecosystem. Energy flow in an ecosystem,
biomass flow in an ecosystem, food chain and web. Ecological pyramid, water cycle, carbon
cycle, Sulphur cycle. Forest ecosystems: tropical rain forest, coniferous forests, tundra forests,
temperate forests. Grasslands and desert ecosystems. Aquatic ecosystems: zones in ocean,
ocean activities, coastal zones. Aquatic ecosystems: freshwater zones, wetlands, estuaries,
rivers, streams, mangroves, state of rivers in India.
UNIT III: RENEWABLE AND NON-RENEWABLE RESOURCES

What is a renewable resource? What is a non-renewable resource? Water usage, scarcity. Why
is water getting scarce? Water for irrigation, water situation in India. Energy resources: Global
energy crisis, energy sources, energy needs, global energy consumption. Energy resources:
fossil fuel vs renewable fuels, peak oil. conventional and unconventional oil, oil price
determination. Energy resources: Types of energy – Coal, natural gas. Energy resources:
hydrogen, hydropower, solar, wind energy.
UNIT IV: BIODIVERSITY

What is biodiversity? Species in the world, current state of biodiversity. Biological hotspot,
aquatic biodiversity, level of biodiversity in India. Endangered species causes of biodiversity
loss. Threats to biodiversity, biodiversity conservation. Role of zoo in biodiversity
conservation, seed banks, botanical gardens. Biodiversity conservation: marine biodiversity
protection, international efforts. Biodiversity conservation: conservation in India, protecting
wild flora and fauna.
UNIT V: POLLUTION AND POLICIES

Solid waste management in cities, hazardous waste, effluent treatment, liquid waste. Water
pollution, eutrophication of lakes, ground water pollution, water quality measurement, sewage
water treatment, water purification. Air and noise pollution, sources of air pollution, smog,
urban heat island, air pollution in India, effects of noise pollution Climate change, IPCC
assessment, carbon dioxide concentration, ozone layer depletion, international initiatives.
Environmental laws, environmental laws in India for water, air, wildlife protection, forests,
environment. Disaster management, global disasters, tsunami, landslides, floods, cyclones,
nuclear disasters, state of disaster management in India. Summary of environmental issues,
conflicts, problems, and solutions.
TEXTBOOKS
1. Environmental Studies (3rd edition) by R. Rajagopalan in Oxford University Press,
2016. ISBN: 9780199459759.
1. Water parameters- Test for alkalinity and turbidity of water.
2. Determination of dissolved oxygen in water.
3. Test for total suspended solids and total dissolved solids.
4. Determination of total hardness of water by EDTA titration
5. Determination of biological oxygen demand of wastewater.
6. Determination of chemical oxygen demand of wastewater.
7. Test for iron content in river water.
SEMESTER-III

ENG 101 Engineering Fundamentals ES 3 0 0 3
UNIT I: THERMODYNAMICS
Sources of Energy, Types of Prime Movers. Basic concepts, Microscopic and macroscopic
approach. Thermodynamic system and surrounding. Properties of a system, Intensive and
extensive, Specific and total quantities, Path and point functions. Thermodynamic process,
cycle and equilibrium, Quasi-static, Reversible and Irreversible processes. Heat and work
transfer, displacement work, flow work and other modes of work, p-V diagram Zeroth law of
thermodynamics, concept of temperature. First law of thermodynamics, energy, enthalpy,
specific heats, limitations of first law, cyclic heat engine, energy reservoirs. Applications of
first law Statements of second law and their equivalence. Reversibility, Irreversibility and
Causes of irreversibility. Carnot cycle, Carnot theorem, Clausius theorem, Concept of entropy.
UNIT II: HEAT ENGINES

Classification of energy sources, Introduction to fuels and combustion, Classification of fuels,
calorific value, Global warming Thermal prime movers, elementary heat engines, working
substances, classification of heat engines Heat engine cycles – Carnot cycle and its efficiency
Properties of water, ideal Rankine cycle (vapor power cycle), methods to improve Rankine
cycle efficiency Air standard cycles, Piston cylinder geometry and arrangement Ideal Otto cycle
Ideal Diesel cycle, differences between petrol and diesel engines, 2 stroke engines, differences
between 2 stroke and 4 stroke engines, IC Engine components.
UNIT III: FLUID MECHANICS

Introduction, Physical Properties of Fluids, Relationship Between Stress and Strain-Rate for
Newtonian and Non-Newtonian Fluids Description of Fluid Flow, Classification of Flows-
Laminar and Turbulent Flows, Measurement of viscosity.
UNIT IV: MECHANICAL ENGINEERING EQUIPMENT

Pump basics – Classification, Centrifugal, Positive displacement, Reciprocating; Compressor
basics - Air compressors, compressor cycle, centrifugal, axial compressor Refrigeration basics
– vapor compression refrigeration cycle, refrigerant properties, COP; Air conditioning (AC)
principle and AC ratings Basics of brakes, couplings and clutches: types of couplings, clutches
and brakes Basics of power transmission elements – types of belt, chain, rope and gear drive
systems.
UNIT V: MATERIALS AND PROPERTIES

Engineering materials and their classification – plastics, wood, composites, ceramics, metals,
fabrics, smart materials Stress-strain relationship, tensile test, compression test, tensile vs
compression test Mechanical properties of materials, material failure.
ENGINEERING ESSENTIALS
Business ethics and values (Guest lecture) Basics of Engineering graphics - Projections of
points, lines and planes, Orthographic Projections: front, top, side; sectional views (Guest
lecture).
DESIGN PROJECT
Selection of team project; guidance in project execution
TEXTBOOKS
1. Elements of Mechanical Engineering, Sadhu Singh, S. Chand and Company Ltd. 2013.
2. Elements of Mechanical Engineering, V. K. Manglik, PHI Publications, 2013.
3. An Introduction to Mechanical Engineering, Jonathan Wickert, Cengage Learning India
Private Limited, 3rd edition, 2015.
REFERENCES
1. Basic Mechanical Engineering, C.M. Agrawal, Basant Agrawal, Wiley, 2008.
2. Elementary Engineering Drawing (First Angle Projection), Bhatt, N.D., Charotar
Publishing Co., Anand, 1999.
3. Studying Engineering: A Road Map to a Rewarding Career, Landis, R.B., Discovery
Press, (1995).
4. A Foundation Course in Human Values and Professional Ethics, R.R. Gaur, R. Sangal
and G.P. Bagaria, Excel Books, 2010.
SEMESTER-III

PHY 211 Introduction to Electricity and BS 2 0 2 3
Magnetism
UNIT I: INTRODUCTION TO VECTOR ALGEBRA

Introduction to vectors, scalar, and vector product. Gradient of a scalar field. Divergence and
Curl of vector fields and their physical significance. Gauss and Stokes theorems. Coordinate
systems–introduction to Cartesian system. Spherical and Cylindrical coordinate systems.
UNIT II: ELECTROSTATICS

Coulomb’s law and electric field. Gauss Law. Electric Potential. Potential Energy. Conductors
under Electrostatic Equilibrium. Capacitors.
UNIT III: DIELECTRICS AND POLARIZATION

Introduction to Electric Dipole and dipole Moment. Potential and field due to electric dipole.
Polarization in dielectrics. Modification of Gauss’s Law in terms of electric displacement.
Electric Susceptibility and dielectric constant. Bound charges.
UNIT IV: MAGNETOSTATICS

Magnetic force and cyclotron. Biot-Savart Law for magnetic fields. Magnetic field due to
various current loops. Ampere’s circuital law. Equation of Continuity. Magnetization in
Materials.
UNIT V: INTRODUCTION TO ELECTRODYNAMICS

Introduction to time-varying fields. Faraday’s law of induction. Generalization of Ampere’s
law. Maxwell’s equations. Derivation of wave equation. Planar Waves in free space.
1. Introduction to Electrodynamics –David J. Griffiths; 4th Edition, 2012, PHI Eastern
Economy Editions.
2. Electricity and Magnetism- A. S. Mahajan and A. A. Rangwala, 1st Revised Edition,
2007, McGraw-Hill Education.

1. To find the dielectric constant of the medium using parallel plate capacitor.
2. To find the band gap energy of a semi-conductor using Four-probe method.
3. To find the band gap energy of a semi-conductor using Four-probe method.
4. Find the magnetic field due to Helmholtz coils and verify its relation by varying the
distance.
5. Use Faraday’s law for finding the total magnetic flux through the coil.
6. To find the type and concentration of charge carriers using hall probe.
7. Verify the Biot-Savart law for a given circular coil.
8. To find the fill factor of a given solar cell using I-V characteristics.
9. To find the type of material using the deflection in magnetic field.
10. To study the Hysteresis curve for a given magnetic material.
11. Practice session I and remedial session.
12. Practice session II and remedial session.
13. Model Exam.
SEMESTER-III

CSE 223 Data Structures and Algorithms Using C C 3 0 2 4
UNIT I: INTRODUCTION TO C PROGRAMMING

Basic elements of C: Identifiers, basic data types, constants, variables, keywords
Operators: arithmetic, relational and logical, Increment, decrement operators, conditional
operators, assignmentoperators.Instruction: type declaration, Input-output, conditional, loop
control.Derived types:Arrays.Functions.Pointers.Dynamic memorymanagement functions.Str
uctures:Declaration, definition and initialization of structures, accessing member ofstructure.
Arrays of structures, structures and functions,pointers to structures, self-referential structures.
UNIT II: INTRODUCTION TO DATA STRUCTURES

Stacks: representation and application, implementation of stack operations using C. Queues:
Representation and application, implementation of queue operations using C. Example
applications on Stacks and Queues. Linked lists: Single linked lists representation.
Implementation of linked list various operation using C. Double linked list representation.
Implementation of double linked list various operation using C. Circular list.
Implementation of Circular linked list various operation using C.
UNIT III: TREES

Tree terminology Binary tree. Binary search tree. Infix to Post fix conversion. Postfix
expression evaluation. General tree AVL Tree. Complete Binary Tree representation.
Complete Binary Tree implementation using C.
UNIT IV: GRAPHS

Graph terminology, Representation of graphs. Path matrix. BFS (breadth first search).
Implementation of BFS using C. DFS (depth first search). Implementation of DFS using C.
Topological sorting. Shortest path algorithms, Implementation of shortest path algorithm using
C.
UNIT V: SORTING AND SEARCHING TECHNIQUES

Bubble sort and its algorithm analysis. Selection sort and its algorithm analysis. Insertion sort
and its algorithm analysis Quick sort and its algorithm analysis. Merge sort and its algorithm
analysis. Heap sort and its algorithm analysis. Radix sort and its algorithm analysis.
Linear and binary search methods and its algorithm analysis. Hashing techniques and hash
functions.
TEXTBOOKS
1. “Data structure using C”, Aaron M. Tenenbaum, Y Langsam and Mosche J. Augenste
in, Pearson publication.
2. Data structures and Algorithm Analysis in C, Mark Allen Weiss, Pearson
publications, Second Edition Programming in C. P. Dey and M Ghosh,
Second Edition, Oxford University Press.
REFERENCES
1. Programming with C, Byron Gottfried, McGraw hill Education, Fourteenth
reprint,2016.
2. “Fundamentals of data structure in C” Horowitz, Sahani & Anderson Freed, Computer
Science Press.
3. “Fundamental of Data Structures”, (Schaums Series) Tata-McGraw-Hill.
4. G. A. V. Pai: “Data Structures & Algorithms; Concepts, Techniques &
Algorithms” Tata McGraw Hill.
5. Gilberg and Forouzan, “Data Structure- A Pseudo code approach with C” by Thomson
publication.

1. Write a C program to find the factorial of the given number (Example: 5!= 5*4*3*2*1
=120).
2. Write a C program to read the numbers from the keyboard using a loop, perform the
sum and average of all the input numbers until “-10” is encountered.
3. Write a C program for implementation of Stack operations using arrays.
4. Write a C program for implementation of Queue operations using arrays.
5. Write a C program for Linked list implementations and problems related to linked list
such as inverting list, concatenation, etc.
6. Write a C program for Linked list-based implementation of stack and queue operations.
7. Write a C program for Evaluation of expressions.
8. Write a C program for implementation of Binary tree traversals techniques.
9. Write a C program for implementation of Graph traversals techniques (BFS and DFS).
10. Write a C program for Linear search and Binary search algorithms. What is the best
case and worst-case time complexity of those searching algorithms?
11. Write a C program for bubble sort algorithm. What is the best case and worst-case time
complexity of Bubble sort algorithm?
12. Write a C program for Selection sort algorithm. What is the worst case or average case
time complexity of selection sort algorithm?
13. Write a C program for Insertion sort algorithm. What is the worst case or average case
time complexity of Insertion sort algorithm?
14. Write a C program for Quick sort algorithm. What is the worst case or average case
time complexity of Quick sort algorithm?
15. Write a C program for Merge sort algorithm. What is the worst case or average case
time complexity of Merge sort algorithm?
SEMESTER-III

CSE 221 Digital Systems Design C 3 0 2 4
UNIT I: DIGITAL SYSTEMS AND BINARY NUMBERS

Systems and Binary Numbers: Digital Systems. Number systems and base conversions.
Representation of signed Binary Numbers. Binary codes. Logic gates.
UNIT II: BOOLEAN ALGEBRA

Boolean Algebra: Introduction to Boolean Algebra. Axioms and Laws of Boolean Algebra.
Boolean functions. Canonical and Standard Forms. Gate. Level Minimization: Introduction
Two. Three, Four Variable K-map’s. Don’t Care Conditions. NAND and NOR Implementation.
UNIT III: COMBINATIONAL LOGIC

Combinational Logic: Introduction to combinational logic circuits. Binary adder and subtractor.
Look Ahead Carry Adder. Magnitude comparator. Decoders. Encoders. Multiplexers. DE
multiplexers.
UNIT IV: SYNCHRONOUS SEQUENTIAL LOGIC

Synchronous Sequential Logic: Introduction to sequential circuits. Latch. Flip Flop. SR, JK, T,
D Flip Flops. Flip Flop excitation tables. Analysis of clocked sequential circuit. Registers and
Counters: Registers. Shift registers. Ripple counters. Synchronous counters. Other counters.
UNIT V: MEMORY AND PROGRAMMABLE LOGIC

Memory and Programmable Logic: Introduction to Programmable Logic Devices (PLD’s).
Programmable ROM(PROM). Programmable Logic Array (PLA). Programmable Array Logic
(PAL).
1. Digital Design with an Introduction to the Verilog HDL by M. Moris Mano and
MichaelD. Ciletti, 5th Edition.
2. Digital Principles and Applications by Leach, Paul Malvino, 5th Edition.
3. Fundamentals of Digital Logic Design by Charles H.Roth, Jr. 5th Edition, Cengage
4. Digital Electronics by G.K. Kharate, Oxford University Press 3.
5. Switching Theory and Logic Design by A. Anand Kumar, PHI, 2nd Edition.
List of Lab experiments

1. Realization of Basic Logic Gates.
2. Design of Code Converters (Binary to Gray) & (Gray to Binary).
3. Design of
a. Half-Adder/Subtractor
b. Full-Adder/Subtractor
c. Multiplexers/De Multiplexers
d. ALU Design
4. Design of Decoder and Encoder/ BCD 7SSD.
5. Design of Magnitude Comparator (2-bit).
6. Design and Verification of Flip-Flops using IC.
7. Design of Asynchronous Counter (Any Mod, Up and Down, Jhonson and Ring).
8. Design of Synchronous Counter (Any Mod, Decade counter 74ls90).
9. Design of Universal Shift Register (Serial to Parallel, Parallel to Serial.
10. Serial to Serial and Parallel to Parallel Converters).
11. Design & Verification of Memory (SRAM).
12. FSM Based Design Project.
SEMESTER-III

CDC 211 Soft Skills-III C 1 0 0 1
UNIT I: MOTIVATION
Soldiers’ Walk and The Japanese Fan (Activities on factors of motivation) Steps to ward off
de-motivation.
UNIT II: CREATIVITY AND INNOVATION

Short Film: Students would be encouraged to make a ten-minute documentary on various topics
to enhance the power of aesthetics and precision. This activity is aimed at creating an interest
in research and think out of the box.
UNIT III: CRITICAL AND LATERAL THINKING

Fill Me Up, Stimulating Lateral Thinking, The Curious Case of Mary and Kevin (Activities
triggering the different types of thinking) The Creative Collage. Critical and lateral thinking
can be inculcated with a structured re programming of the neural pathways. These specially
designed activities will enhance critical and lateral thinking.
UNIT IV: TEAM DYNAMICS

Story boarding, Frenzy, come to my Island, Striking Cars, Defend the Egg Tallest Tower
(Activities on the different stages of team building, team communication, coordination and
collaboration).
UNIT V: MINI PROJECT

Individual projects on topics provided by faculties.
BOOKS OF STUDY/REFERENCES
1. Personality development and Soft Skills – Barun K. Mitra.

2. Soft Skills – Key to success in workplace and life – Meenakshi Raman, Shalini
Upadhyay.
3. Mastering Soft Skills – Julian Vyner
4. The Accidental Creative – How to be brilliant at a moment’s notice – Todd Henry.
SEMESTER – IV
SEMESTER-IV

MAT 121 Multivariable Calculus BS 3 0 0 3
UNIT I: VECTOR AND MATRICES

Three-dimensional coordinate system. Vectors. Dot products. Vector products. Lines and
planes.
UNIT II: PARTIAL DERIVATIVES

Level curves; partial derivatives; tangent plane approximation, Max-min problems; least
squares, Second derivative test; boundaries and infinity, Differentials; chain rule, Gradient;
directional derivative; tangent plane, Lagrange multipliers, Non-independent variables, Partial
differential equations.
UNIT III DOUBLE INTEGRAL AND LINE INTEGRALS IN THE PLANE

Double integrals, Double integrals in polar coordinates; applications, change of variables,
Vector fields and line integrals in the plane, Path independence and conservative fields,
Gradient fields and potential functions, Green's theorem, Flux; normal form of Green's
theorem, simply connected regions.
UNIT IV: TRIPLE INTEGRALS IN 3D

Triple integrals in rectangular and cylindrical coordinates, Spherical coordinates; surface area,
Vector fields in 3D; surface integrals and flux, Divergence theorem: applications and proof.
UNIT V: SURFACE INTEGRAL IN 3D

Line integrals in space, curl, exactness, and potentials, Stokes' theorem, Topological
considerations, Maxwell's equations.
TEXTBOOKS
1. Edwards, Henry C., and David E. Penney. Multivariable Calculus. 6th ed. Lebanon, IN:
Prentice Hall, 2002.
2. G. B. Thomas, Jr. and R. L. Finney, Calculus and Analytic Geometry, 9th Edn., Pearson
Education India, 1996.
SEMESTER-IV

ENG 211 Signals and Systems ES 3 0 0 3
UNIT I: BASIC INTRODUCTION

Introduction to continuous-time (CT) and discrete-time (DT) signals and systems. Definitions
and classification of signals. Definitions and classification of systems including linear-time-
invariant (LTI) systems.
UNIT II: REPRESENTATION OF PERIODIC SIGNALS

CT and DT Fourier series representation of periodic signals.
UNIT III: REPRESENTATION OF APERIODIC SIGNALS

CT and DT Fourier Transforms as an extension to Fourier series. Laplace Transforms.
UNIT IV: SAMPLING AND SIGNAL PROCESSING

NY Quist sampling theorem, Discrete Fourier Transforms, Fast Fourier Transforms, and
introduction to filters.
UNIT V: LINEAR FEEDBACK SYSTEMS

Introduction to concepts of linear systems including stability and control.
TEXTSBOOKS
1. V. Oppenheim, A. S. Willsky, and S. Hamid Nawab, Signals & Systems, 2nd Ed, Prentice
Hall, 1996.
REFERENCES
1. B. P. Lathi, Linear Systems and Signals, 2nd Ed, Oxford University Press, 2005
2. C. T. Chen, Signals and Systems, 3rd Ed, Oxford University Press, 2004.
SEMESTER-IV

CSE 234 Algorithms Analysis and Design C 3 0 2 4
Algorithmic thinking & motivation with examples, Reinforcing the concepts of Data
Structures with examples. Complexity analysis of algorithms: big O, omega, and theta
notation. Analysis of Sorting and Searching. Hash table. Recursive and non-recursive
algorithms.
UNIT II: GENERAL PROBLEM SOLVING (GPS) TECHNIQUES

Divide and conquer: Merge sort. Quicksort. BST. Master method for Complexity analysis.
Greedy method: Fractional Knapsack. Minimum spanning trees (Prim’s & Kruskal’s) Shortest
paths: Dijkstra’s algorithm. Huffman coding. Dynamic Programming: 0/1 Knapsack All-to-all
shortest paths.
UNIT III
BFS & DFS, Backtracking: 8-Queens problem, Knights tour, Travelling Salesman Problem
(TSP), Branch-and-bound: 16-puzzle problem, TSSP.
UNIT IV
Pattern matching algorithms: Brute-force. Boyer Moore. KMP algorithms. Algorithm
analysis: Probabilistic Analysis. Amortized analysis. Competitive analysis.
UNIT V
Non-polynomial complexity: examples and analysis. Vertex cover. Set cover. TSP. Set cover.
TEXTBOOKS
1. Cormen, Leiserson, Rivest, Stein, "Introduction to Algorithms", 3rd Edition, MIT press,
2009
2. Parag Dave & Himanshu Dave, "Design and Analysis of Algorithms", Pearson
Education, 2008
REFERENCES
1. A V Aho, J E Hopcroft, J D Ullman, "Design and Analysis of Algorithms", Addison-
Wesley Publishing.
2. Algorithm Design, by J. Kleinberg and E. Tardos, Addison-Wesley, 2005
3. Algorithms, by S. Dasgupta, C. Papadimitriou, and U. Vazirani, McGraw-Hill, 2006

1. Selection sort, Insertion sort, Heap sort.
2. Creating singly linked list + Hash table as a set of linked lists.
3. Towers of Hanoi (Recursive& Non-recursive).
4. Merge sort.
5. Quicksort.
6. Fractional Knapsack.
7. Minimum-spanning tree.
8. One-to all shortest paths.
9. All-to-all shortest paths.
10. 0/1 knapsack.
11. Transitive closure/ Reachability problem.
12. Eight queens’ problem.
13. 16-puzzle.
14. TSP approximation algorithm.
15. Vertex cover: Approximate algorithm.
SEMESTER-IV

CSE 235 Computer Organization and C 3 0 2 4
Architecture
UNIT I: BASIC STRUCTURE OF COMPUTERS

Functional UNITs – Bus structures – Instruction set architecture: Instruction formats -
addressing modes - Architecture and instruction set of 8086/8088 microprocessor- Assembly
language programming - Fixed point and floating-point operations – ALU design.
UNIT II: BASIC PROCESSING UNIT

Fundamental concepts – Execution of a complete instruction – Hardwired control Micro
programmed control design - Nano programming- CISC-RISC- principles.
UNIT III: PIPELINE PROCESSING

Basic concepts, instruction and arithmetic pipeline, data hazards, control hazards and structural
hazards, techniques for handling hazards. Pipeline optimization techniques: Compiler
techniques for improving performance.
UNIT IV: MEMORY SYSTEM

Basic concepts – Semiconductor RAM – ROM – Speed – Size and cost – Cache memories –
Improving cache performance – Virtual memory – Memory management requirements–
Associative Memories-Secondary-storage-devices.
UNIT V: I/O ORGANIZATION

Accessing I/O devices – Programmed Input/output - Interrupts – Direct Memory Access–
Interface circuits – Standard I/O Interfaces - I/ O devices and Processors.
TEXTBOOKS
1. Computer System Architecture, Morris Mano, Third edition, Pearson publications
2. Computer Organization, Carl Hamacher, Zvonko Vranesic and Safwat Zaky, V Edition,
McGraw-Hill publications
3. “Computer Organization and Architecture – Designing for Performance”, William
Stallings, Ninth edition, Pearson publications
REFERENCES
1. Structured Computer Organization, Andrew S. Tanenbaum
2. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The
Hardware/Software interface”
3. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata
McGraw Hill
4. V.P. Heuring, H.F. Jordan, “Computer Systems Design and Architecture”, Second
Edition, Pearson Education
1. Assembly language programming.
2. Development of simulator for a hypothetical CPU.
3. Development of Assembler for hypothetical CPU.
4. Design of Hardwired control unit for a hypothetical CPU.
5. Design of Microprogrammed control unit for a hypothetical CPU.
SEMESTER-IV

CSE 236 Object Oriented programming C 3 0 2 4
UNIT I: OBJECT-ORIENTED THINKING

A way of viewing world – Agents and Communities, messages and methods, Responsibilities,
Classes and Instances, Class Hierarchies- Inheritance, Method binding, Overriding and
Exceptions, Summary of Object-Oriented concepts. Java buzzwords, An Overview of Java,
Data types, Variables and Arrays, operators, expressions, control statements, Introducing
classes, Methods and Classes, String handling. Inheritance– Inheritance concept, Inheritance
basics, Member access, Constructors, Creating Multilevel hierarchy, super uses, using final
with inheritance, Polymorphism-ad hoc polymorphism, pure polymorphism, method
overriding, abstract classes, Object class, forms of inheritance- specialization, specification,
construction, extension, limitation, combination, benefits of inheritance, costs of inheritance.
UNIT II: STREAM BASED I/O

The Stream Classes-Byte streams and Character streams, reading console Input and Writing
Console Output, File class, Reading and writing Files, Random access file operations, The
Console class, Serialization, Enumerations, auto boxing, generics.
UNIT III: EXCEPTION HANDLING

Fundamentals of exception handling, Exception types, Termination or presumptive models,
Uncaught exceptions, using try and catch, multiple catch clauses, nested try statements, throw,
throws and finally, built- in exceptions, creating own exception sub classes.
Multithreading- Differences between thread-based multitasking and process-
based multitasking, Java thread model, creating threads, thread priorities, synchronizing
threads, inter thread communication.
UNIT IV: THE COLLECTIONS FRAMEWORK

Collection’s overview, Collection Interfaces, The Collection classes- Array List, Linked List,
Hash Set, Tree Set, Priority Queue, Array Deque. Accessing a Collection via an Iterator, using
an Iterator, The For-Each alternative, Map Interfaces and Classes, Comparators, Collection
algorithms, Arrays, The Legacy Classes, and Interfaces- Dictionary, Hashtable, Properties,
Stack, Vector More Utility classes, String Tokenizer, Bit Set, Date, Calendar, Random,
Formatter, Scanner.
UNIT V: GUI PROGRAMMING WITH SWING

Introduction, limitations of AWT, MVC architecture, components, containers. Understanding
Layout Managers, Flow Layout, Border Layout, Grid Layout, Card Layout, Grid Bag Layout.
Event Handling- The Delegation event model- Events, Event sources, Event Listeners, Event
classes, Handling mouse and keyboard events, Adapter classes, Inner classes, Anonymous
Inner classes. A Simple Swing Application, Applets – Applets and HTML, Security Issues,
Applets and Applications, passing parameters to applets. Creating a Swing Applet, painting in
Swing, A Paint example, Exploring Swing Controls- JLabel and Image Icon, JText Field, The
Swing Buttons- JButton, JToggle Button, JCheck Box, JRadio Button, JTabbed Pane, JScroll
Pane, JList, JCombo Box, Swing Menus, Dialogs.
TEXTBOOKS
1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill
Education (India) Pvt. Ltd.
2. Understanding Object-Oriented Programming with Java, updated edition, T.
Budd, Pearson Education.
REFERENCES
1. An Introduction to programming and OO design using Java, J. Nino and F.A.
Hosch, John Wiley & sons.
2. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
3. Object Oriented Programming through Java, P. Radha Krishna, Universities Press.
4. Programming in Java, S. Malhotra, S. Chaudhary, 2nd edition, Oxford Univ. Press.
5. Java Programming and Object-Oriented Application Development, R. A.
Johnson, Cengage Learning.

1. Declare a class named Teacher. The class will have all the data members as per your
convenient. The class will have constructors. Write a function to read the values of the
class variables. The values of the variable will be stored in a FILE (text file). The values
will be stored in a structured format of your own choice.
Further, read the content of the FILE and display the content in an ordered form (First
Name, Last Name).
Concept Learning:
1. FILE manipulation
2. Use try catch blocks
3. Use multiple try catch block
4. Finally statement
2. Create a three-classes named Student, Teacher, Parents. Student and Teacher class
inherits Thread class and Parent class implements Runnable interface. These three
classes have run methods with statements. The task of the teacher class of the
first assignment has to be synchronized.
3. Similarly, the other two classes should have run methods with few valid statements
under synchronized.
4. Create two classes named Student and Teacher with required data members. Assume
that the information about the Student and Teacher is stored in a text file. Read n and m
number of Student and Teacher information from the File. Store the information in
Arraylist of type Student and Teacher ArrayList<Student> and ArrayList<Teacher>.
Print the information of Teacher who taught OOPS and Maths. Use Iterator and other
functions of util in your program.
5. Watch any of the favorite movie of your choice (any language is fine, preferably
English). Create a Text file to store at least 10 meaningful dialogs from the movie and
store it in a text file. Process the file to remove the stop words (eg. the, is, was, …….)
and 1create another file to have clean text (word).
6. Write a java program to create HashTable to act as a dictionary for the word collection.
The dictionary meaning of the words, including synonyms, etc has to be displayed.
7. Create GUI for the above program to upload the dialog FILE, clean the FILE. The GUI
should take input from the user for invoking the dictionary for displaying dictionary
meaning.
convenient. The class will have constructors. Develop a GUI to read the values of the
class variables from the keyboard. Use text field to read the values. Use button to store
it in a file one by one. The values will be stored in a structured format of your own
choice.
9. Have an option in the GUI to search the name of the students by roll number and display
the content in the test field.
10. Create two classes named Student and Teacher with required data members. Read the
information about the student and teacher using text fields. Use checkbox to choose the
option to feed either teacher information or student information. Store the information
about the Student and Teacher in a text file. Read n and m number of Student and
Teacher information from the File. Show in the GUI about a Teacher who taught two
subjects to a section. Develop at least one of the application (AWT problem) using
swing package
11. Create a Window based applications using various controls to handle subject
registration for exams. Have a List Box to display the subject of semesters. Have one
more List box having subject codes. Have a combo box to select the Semester, which
will change the list of course and code in the list boxes. Display the subject registered
for the examination on the right side of the window.
choice.
the content in the test field. Develop at least one of the application (AWT problem)
using swing package.
14. Create a Window based application for displaying your photo album. Create a Frame
and Canvas. Change the border, foreground, and background colors of canvas and other
controls. Have buttons to start the image show, pause the image show and end the image
show. Explore the options to play background music.
15. Create a Window application with menu bar and menu. The frame will also have a text
area with scroll bar. In the menu, have File related options. Open a file and its content
has to be displayed in the text area.
<
SEMESTER-IV

CDC 212 Soft Skills -IV HS 1 0 0 1
UNIT I: QUANTITATIVE REASONING
Time and work. Powers and roots. Pipes and cisterns. Problems on Clock. Calendar and Cubes.
Height and Distance. Logarithms.
UNIT II: LOGICAL REASONING

Alpha-numerical sequence puzzle, Symbols and their relationships, Blood Relations, Seating
Arrangement, Coding-Decoding, Input- Output, test Direction Sense Test
UNIT III: DATA ANALYSIS AND INTERPRETATION

Graphical and Numerical Methods for Describing Data. Interpretation of data in tables and
graphs. Permutations and Venn diagrams. Counting Methods. Probability.
UNIT IV: EMOTIONAL INTELLIGENCE II

Self-Awareness, Self-Regulation, Social Skills, Empathy and Motivation.
UNIT V: VERBAL ABILITY

Conditionals. Tense Forms. Verb Forms; Phrasal Verbs. Cohesion and Coherence.
BOOKS OF STUDY/REFERENCES
1. R.S. Agarwal, A Modern Approach to Verbal & Non-Verbal Reasoning, S. Chand
Publication
2. How to prepare for Quantitative Aptitude for CAT – Arun Sharma
3. Meenakshi Upadhyay, Arun Sharma -Verbal Ability and Reading Comprehension
4. How to prepare for Logical reasoning and data interpretation for CAT – Arun Sharma.
SEMESTER - V
SEMESTER- V

CODE CATEGORY
L T P C
Probability and Statistics for BS 3 0 0 3
MAT 221
Engineers
UNIT I: DATA AND DESCRIPTIVE STATISTICS

Types of data, visualization of data, basic concepts of sample space, sample mean, and other
statistics, introduction to regression.
UNIT II: PROBABILITY AND RANDOM VARIABLES

Probability space, random variables, cumulative distribution function, probability density
function, expectation, variance.
UNIT III: RANDOM VECTORS & RANDOM PROCESSES

Random vectors, joint PDF, covariance, correlation, independence, random processes, Markov
chains.
UNIT IV: COMPUTER SIMULATIONS & MONTE CARLO METHODS

Simulation of random variables, vectors, and processes; Monte Carlo method.
UNIT V: STATISTICS
First and higher order linear and nonlinear differential equations, existence, and solution
methods.
1. M. Baron, Probability & Statistics for Computer Scientists, Chapman & Hall/ CRC,
2018.
2. J. Johnson, Probability & Statistics for Computer Science, Wiley, 2004.
3. S. Ross, Introduction to Probability & Statistics, Academic Press, 2004.
SEMESTER-V
CSE 301 Operating Systems C 3 0 2 4
UNIT I: OPERATING SYSTEMS OVERVIEW

Operating system overview-objectives and functions, Evolution of Operating System.-
Computer System Organization- Operating System Structure and Operations- System Calls,
System Programs, OS Generation and System Boot.
UNIT II: PROCESS SCHEDULING

Processes-Process Concept, Process Scheduling, Operations on Processes, Inter process
Communication; CPU Scheduling algorithms; OS – examples.
UNIT III: PROCESS SYNCHRONIZATION AND DEADLOCKS

Threads- Overview, Multithreading Models; Process Synchronization – Critical Section
Problem, Mutex Locks, Semaphores, Monitors; Deadlocks- OS examples.
UNIT IV: STORAGE MANAGEMENT

Main Memory-Contiguous Memory Allocation, Segmentation, Paging, Virtual Memory-
Demand Paging, Page Replacement, Allocation, Thrashing; OS examples.
UNIT V: I/O SYSTEMS

Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-
File Concepts, Directory and Disk Structure, Sharing and Protection; File System
Implementation- File System Structure, Directory Structure, Allocation Methods, Free Space
Management- OS examples.
TEXBOOKS/REFERENCES
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 9th Edition, John Wiley and Sons Inc.
2. William Stallings, “Operating Systems – Internals and Design Principles”, 9th Edition,
Pearson publications. Andrew S. Tanenbaum, “Modern Operating Systems”, Fourth
Edition, Pearson.

1. Shell Programming exercises.
2. Implementing Linux system commands using system calls.
3. CPU Scheduling Algorithms.
4. Computing page faults for various page replacement algorithms.
5. Simulation of Demand Paging System.
6. Implement producer, consumer problem using semaphores.
7. Implement deadlock avoidance and detections algorithms.
8. Project Development.
SEMESTER-V

CSE 302 Formal Languages and Automata C 3 0 0 3
Theory
UNIT I: FUNDAMENTALS
Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton
model, acceptance of strings, and languages, deterministic finite automaton and non-
deterministic finite automaton, transition diagrams and Language recognizers. Finite Automata
with output- Moore and Melay machines.
UNIT II: REGULAR LANGUAGES

Regular sets, regular expressions. Identity rules, constructing finite Automata for a given
regular expressions. Conversion of Finite Automata to Regular expressions. Closure properties
of regular sets (proofs not required). Grammar Formalism: Regular grammars-right linear and
left linear grammars. Equivalence between regular linear grammar and FA. Inter conversion,
Context free grammar. Derivation trees, sentential forms. Right most and leftmost derivation
of strings.
UNIT III: CONTEXT FREE GRAMMARS

Ambiguity in context free grammars. Minimization of Context Free Grammars. Chomsky
normal form, Greiback normal form. Pumping Lemma for Context Free Languages.
Enumeration of properties of CFL (proofs omitted). Push Down Automata: Push down
automata. Definition, model. Acceptance of CFL. Acceptance by final state and acceptance by
empty state and its equivalence. Equivalence of CFL and PDA. Interconversion. (Proofs not
required) Introduction to DCFL and DPDA.
UNIT IV: TURING MACHINE

Machine, definition. Model, design of TM, Computable functions. Recursively enumerable
languages. Church’s hypothesis, counter machine. Types of Turing machines (proofs
not required). Linear bounded automata and context sensitive language.
UNIT V: COMPUTABILITY THEORY

Chomsky hierarchy of languages. Linear bounded automata and context sensitive language. LR
(0) grammar, decidability of problems. Universal Turing Machine, undecidability of posts.
Correspondence problem. Turing reducibility. Definition of P and NP problems. NP
complete and NP hard problems.
TEXTBOOKS
1. “Introduction to Automata Theory Languages and Computation”. Hopcroft H.E. and
Ullman J. D. Pearson Education.
2. Introduction to Theory of Computation – Sipser 2nd edition Thomson.
3. Introduction to Formal languages Automata Theory and Computation Kamala
Krithivasan Rama R.
4. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
5. Theory of Computation: A Problem - Solving Approach, Kavi Mahesh, Wiley India.
SEMESTER-V
CSE 303 Computer Networks C 3 0 2 4
UNIT I: OVERVIEW OF THE INTERNET (PHYSICAL LAYER AND DATA LINK

LAYER)
Basic Computer Network concepts, Protocol, Layering Scenario. Layer Architecture: OSI
Model, TCP/IP model. Internet history standards and administration; Comparison of the OSI
and TCP/IP reference model. Guided transmission media, wireless transmission media.
Different LAN topologies: BUS, RING and STAR topology. Data Link layer design issues:
Error detection techniques. Error Correction Techniques, Flow control. Sliding Window
protocols. Go back N and selective Repeat protocols. Difference between single bit sliding
window and n-bit sliding window protocols.
UNIT II: MEDIUM ACCESS CONTROL

Static and Dynamic channel Allocations. Shared channel Access: Pure ALOHA and slotted
ALOHA. Persistent CSMA protocols: 1, P and Non-persistent CSMA protocols. CSMA with
collision detection. Comparison of different CSMA protocols. Collision free protocols: Bit-
map protocol, Token Ring and Binary Count down protocols. Limited Contention protocols:
Adaptive tree walk protocol. Shared medium for wireless networks: CSMA/CA or MACA.
Interconnecting LANs: HUBS, Repeaters and Switches and bridges. Spanning tree algorithm
for bridges.
UNIT III: NETWORK LAYER

Overview: Connection oriented and connection less services. Comparison of packet switched,
and circuit switched networks. Routing: proactive routing and reactive routing protocols, static
and dynamic routing protocols. Dijkstra Algorithm, Distance vector routing and Link state
routing protocols. Routing in wireless networks: AODV and DSR routing protocols. Overview
of IP header and IP addressing. Classful IP addressing: Class A, B, C, D and E. Limitations of
classful Addressing, Introduction to Subnet. Overview of Congestion: Warning Bit, Choke
packets, Load Shedding, RED (Random Early Detection)
UNIT IV: INTERNETWORKING AND TRANSPORT LAYER

IP Encapsulation and Tunneling. IP packet fragmentation, ICMP, ARP. ICMP, DHCP,
Introduction to Transport layer. Different end-to-end transport layer protocols: TCP and UDP.
Brief explanation of TCP protocol. Packet formats for TCP and UDP protocol.
UNIT V: TRANSPORT AND APPLICATION PROTOCOLS

TCP Connection Management Modeling. TCP Sliding Window. TCP congestion control.
Introduction to application layer paradigms. Client Server model. Introduction and overview of
HTTP protocol. Overview of FTP protocol. Operation of Electronic Mail. Introduction to peer-
to-peer communication models. Introduction and overview of TELNET. Importance of
Security in computer Networks.
TEXBOOKS/REFERENCES
1. Computer Networks - Andrew S Tanenbaum, 4th Edition, Pearson Education.
2. Data Communications and Networking - Behrouz A. Forouzan, Fifth Edition TMH,
2013.
3. Computer Networking: A Top-Down Approach Featuring the Internet, James F.
Kurose, K. W. Ross, 3rd Edition, Pearson Education
4. Understanding communications and Networks, 3rd Edition, W. A. Shay, Cengage
Learning.

1. Explain about wires hark and display how to send packets or packets from one layer to
another.
2. Write a Java program to implement Error Detection Technique using CRC Algorithm.
3. Write a Java program to implement Error Correction Technique using Hamming code.
4. Write a Java program to implement TCP Client Server programming.
5. Write a Java program to implement UDP Client Server Programming.
6. Write a Java program to implement 1-bit Stop and Wait Protocol at data link layer.
7. Write a Java program to implement N-bit Sliding Window Protocol at data link layer.
8. Write a Java program to implement Dijkstra Shortest path routing protocol.
9. Write a Java program to implement Distance Vector Routing.
10. Write a Java program to implement echo command in client server socket
programming.
11. Write a Java program to implement Trace-route command.
12. Write a Java program to implement Ping command.
13. Write a Java program to display the class of IP address, network mask and generate
the subnet IP address based on the subnet bits entered from the keyboard.
14. Write a Java program to implement sliding window protocol at the transport layer.
15. Write a Java program to transfer file using TCP?
SEMESTER-V
SUBJECT SUBJECT TITLE C/OE/TE/SE CREDITS

CODE L T P C
CDC 301 SOFT SKILLS-V COURSE
1 0 0 0
CATEGORY
UNIT I: QUANTITATIVE REASONING

Time Speed and distance, Average, Alligation and mixture and number system.
UNIT II: LOGICAL REASONING

Puzzles, Problems based on Cubes and Dice, Logical Ven Diagram and Syllogism.
UNIT III: QUANTITATIVE REASONING

Ratios and proportions, Percentage, Profit and Loss, and Simple interest and Compound
interest.
UNIT IV: VERBAL ABILITY

Sentence structure and sentence formation, Paragraph formation, Parts of speech,
Prepositions, Articles.
UNIT V: VERBAL ABILITY

Sentence correction subject verb agreement, Reading comprehension, Synonyms and
Antonyms.
BOOKS OF STUDY/REFERENCE
1. R.S. Agarwal, A Modern Approach to Verbal &Non-Verbal Reasoning, S. Chand
Publication.
2. Meenakshi Upadhyay, Arun Sharma -Verbal Ability and Reading Comprehension
3. How to prepare for Quantitative Aptitude for CAT – Arun Sharma

4. How to prepare for Logical reasoning and data interpretation for CAT – Arun Sharma.
SEMESTER – VI
SEMESTER-VI

CSE 304 Database Management C 3 0 2 4
Systems
UNIT I: INTRODUCTION TO DBMS AND RELATIONAL MODEL

File Processing System, Advantages of DBMS over File Processing System, Database System
Applications. DBMS Architecture: The three-schema architecture Data Independence: Logical
and Physical. Data Models: Hierarchical, network and relation models. Introduction to
relational model, concepts of domain, attribute, tuple, relation, importance of null values.
Database constraints (Domain, Key constraints, integrity constraints) and their importance.
UNIT II: QUERY PROCESSING

Relational Algebra. Relational Calculus. Introduction to SQL: Database Objects- DDL Schema
definitions. DML- Insert, select, update, delete. Views, exercise on SQL queries. Transaction
support in SQL. Aggregate Functions, Null Values, Views. Complex Integrity Constraints in
SQL. Assertions, Triggers
UNIT III: CONCEPTUAL MODEL AND DATABASE DESIGN

Entity Relationship model Entity types, Entity Sets, Attributes, and Keys Relationships,
Relationship types and constraints, Weak Entity types. Enhanced ER (EER) Modeling:
Super/Sub Classes Specialization and Generalization. Constraints and characteristics of
Specialization and Generalization. Example EER Schema. Basics of Normalization, Normal
Forms: First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF)
BCNF, 4NF
UNIT IV: TRANSACTION PROCESSING, CONCURRENCY CONTROL AND

RECOVERY
Introduction of transaction processing, advantages, and disadvantages of transaction processing
system. Serializability and Recoverability of transaction. Concurrency Control Lock based
Protocols. Timestamp Based Protocols – Validation based Protocols - Multiple Granularity
Locking. Recovery techniques.
UNIT V: OVERVIEW OF STORAGE AND INDEXING

Data on External Storage, File Organization, and Indexing - Clustered Indexes, Primary and
Secondary Indexes. Indexed Sequential Access Methods (ISAM) B+ Trees: Tree Structure,
Search, Insert, Delete. Hash Based Indexing: Static Hashing, Extendable hashing, Linear
Hashing, Extendible vs. Linear Hashing.
1. Ramez Elmasri and Shamkant Navathe. 2010. Fundamentals of Database Systems (6th
ed.). Addison-Wesley Publishing Company, USA.
2. R. Ramakrishnan, J. Gehrke, Database Management Systems, McGraw Hill,
2004 Silberschatz, H. Korth, S. Sudarshan, Database system concepts, 5/e, McGraw
Hill, 2008.
3. Database system Implementation: Hector Garcia-Molina Jeffrey D. Ullman Jennifer
Widom, Prentice Hall, 2000
4. C.J. Date. 2003. An Introduction to Database Systems (8 ed.). Addison-Wesley
Longman Publishing Co., Inc., Boston, MA, USA.
LIST OF PRACTICAL EXPERIMENTS:

1. Implementation of data storage and indexing methods using files.
2. DML queries on single table.
3. Queries on Joining tables and Aggregate Functions.
4. Nested queries, Queries on creation of views, indexes, sequences, and access privileges.
5. Triggers, Assertions.
6. SQL Transactions.
7. PL/SQL, Stored Procedures.
8. Design and Develop Applications.
SEMESTER-VI

MAT 131 Differential Equations BS 3 0 0 3
UNIT I: FIRST ORDER DIFFERENTIAL EQUATION

Geometric meaning of y ′ = f(x, y), Direction Fields, Euler’s Method, Classification of ODEs
(Linear, Non-linear, Exact, Separable), Integrating Factor, Bernoulli Equations, Initial Value
Problem, Modelling (Free falling object, Radioactivity, RL-circuit).
UNIT II: SECOND AND HIGHER ORDER LINEAR ODES

Homogeneous Linear ODEs, Modelling of Free Oscillations of a Mass-Spring System, Euler-
Cauchy Equations, Non-homogeneous ODEs, Variation of Parameters, Modelling (Forced
Oscillations, Electric Circuits),
UNIT III: SYSTEM OF ODES

Modelling Engineering problems (Electric Network, Mixing problem in two tanks etc.) as
systems of ODEs, Wronskian, Phase-Plane Method, Critical Points & Stability, Qualitative
Methods for Nonlinear Systems, Nonhomogeneous Linear Systems of ODEs.
UNIT IV: SERIES SOLUTIONS OF ODES

Introduction to power series method, Legendre’s equation & polynomials, Frobenius Method,
Bessel’s Equations & Functions.
UNIT V: LAPLACE TRANSFORMS

Laplace transforms of standard functions, Shifting Theorems, Transforms of derivatives and
integrals, UNIT step function, Dirac’s delta function, Inverse Laplace transforms, Convolution
theorem (without proof). Application: Solutions of ordinary differential equations using
Laplace transforms.
TEXTBOOKS
1. Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India.
REFERENCES
1. Mary L. Boas, Mathematical Methods in Physical Sciences, 3rd Edition, Wiley-India.
2. G. F. Simmons, Differential Equation with Applications and Historical Notes, TATA
McGraw Hill.
3. S. Vaidyanathan, Advanced Applicable Engineering Mathematics, CBS Publishers.
SEMESTER-VI

CSE 305 Software Engineering C 3 0 2 4
UNIT I: SOFTWARE PROCESS AND AGILE DEVELOPMENT

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

Software Requirements: Functional and Non-Functional, User requirements, System
requirements, Software Requirements Document – Requirement Engineering Process:
Feasibility Studies, Requirement’s elicitation and analysis, requirements validation,
requirements Management-Classical analysis: Structured system Analysis, Petri Nets- Data
Dictionary.
UNIT III: SOFTWARE DESIGN

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

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

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
TEXTBOOKS
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.
REFERENCES
1. Rajib Mall, Fundamentals of Software Engineering, Third Edition, PHI Learning
Private Limited, 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.
1. Develop requirements specification for a given problem.
2. Develop DFD Model (Level 0, Level 1 DFD and data dictionary) of the sample
problem.
3. To perform the function-oriented diagram: DFD and Structured chart.
4. To perform the user’s view analysis: Use case diagram.
5. To draw the structural view diagram: Class diagram, object diagram.
6. To draw the behavioral view diagram: Sequence diagram, Collaboration diagram.
7. To draw the behavioral view diagram: State-chart diagram, Activity diagram.
8. To draw the environmental view diagram: Deployment diagram.
9. To draw the implementation view diagram: Component diagram.
10. To perform various testing using the testing tool unit testing, integration testing.
SEMESTER-VI

CSE 350 Cloud Foundation Optional 1 0 2 2
(Optional Course)
Cloud computing, Cloud versus traditional architecture. IaaS, PaaS, and SaaS, Google Cloud
architecture. The GCP Console, understanding projects, Billing in GCP, Install and configure
Cloud SDK, Use Cloud Shell, GCP APIs, Cloud Console Mobile App.
UNIT II: COMPUTING & STORAGE

Compute options in the cloud, Exploring IaaS with Compute Engine, configuring elastic apps
with autoscaling, Exploring PaaS with App Engine, Event driven programs with Cloud
Functions, Containerizing and orchestrating apps with Google Kubernetes Engine. Storage
options in the cloud, Structured and unstructured storage in the cloud, Unstructured storage
using Cloud Storage, SQL managed services, Exploring Cloud SQL, Cloud Spanner as a
managed service, NoSQL managed service options, Cloud Datastore, a NoSQL document
store, Cloud Bigtable as a NoSQL option.
UNIT III: ENDPOINTS & SECURITY

The purpose of APIs, Cloud Endpoints, Using Apigee Edge, Managed message services,
Exploring Cloud SQL, Cloud Pub/Sub, Introduction to security in the cloud, the shared security
model, Encryption options, Authentication, and authorization with Cloud IAM, Identify Best
Practices for Authorization using Cloud IAM.
UNIT IV: NETWORKING IN THE CLOUD

Introduction to networking in the cloud, defining a Virtual Private Cloud, Public and private
IP address basics, Google’s network architecture, Routes, and firewall rules in the cloud,
Multiple VPC networks, building hybrid clouds using VPNs, interconnecting, and direct
peering, Different options for load balancing.
UNIT V: CLOUD AUTOMATION AND TOOLS

Introduction to big data managed services in the cloud, Leverage big data operations with
Cloud Data proc, Build Extract, Transform, and Load pipelines using Cloud Dataflow, Big
Query, Google’s Enterprise Data Warehouse, Introduction to big data managed services in the
cloud, Leverage big data operations with Cloud Data proc, Build Extract, Transform, and Load
pipelines using Cloud Dataflow, Big Query, Google’s Enterprise Data Warehouse. Introduction
to machine learning in the cloud, Building bespoke machine learning models with AI Platform,
Cloud Auto ML, Google’s pre-trained machine learning APIs.

1. A Tour of Qwik labs and the Google Cloud Platform
2. Creating a Virtual Machine
3. App Engine: Qwik Start – Python
4. Cloud Functions: Qwik Start - Command Line
5. Cloud Storage: Qwik Start - CLI/SDK
6. Loading Data into Cloud SQL
7. App Dev: Storing Application Data in Cloud Datastore – Python
8. Cloud Endpoints: Qwik Start
9. Cloud Pub/Sub: Qwik Start – Python
10. User Authentication: Cloud Identity-Aware Proxy
11. VPC Networking Fundamentals
12. Multiple VPC Networks
13. VPC Networks - Controlling Access
14. HTTP Load Balancer with Cloud Armor
15. Create an Internal Load Balancer
16. Monitoring Multiple Cloud Projects with Stack driver
17. Data proc: Qwik Start: Console
18. Data proc: Qwik Start: Command Line
19. Dataflow: Qwik Start – Templates
20. Dataflow: Qwik Start – Python
21. AI Platform Qwik Start
22. Classify Images of Clouds in the Cloud with Auto ML Vision
23. Cloud Natural Language API: Qwik Start
24. Google Cloud Speech API: Qwik Start
25. Video Intelligence: Qwik Start
SEMESTER-VI

CSE 306 Compiler Design C 3 0 2 4
UNIT I: INTRODUCTION TO COMPILERS

Translators-Compilation and Interpretation-Language processors-The Phases of Compiler-
Errors Encountered in Different Phases-The Grouping of Phases-Compiler Construction Tools
- Programming Language basics.
UNIT II: LEXICAL ANALYSIS

Need and Role of Lexical Analyzer-Lexical Errors-Expressing Tokens by Regular Expressions-
Converting Regular Expression to DFA- Minimization of DFA-Language for Specifying
Lexical Analyzers-LEX-Design of Lexical Analyzer for a sample Language.
UNIT III: SYNTAX ANALYSIS

Need and Role of the Parser-Context Free Grammars -Top-Down Parsing -General Strategies-
Recursive Descent Parser Predictive Parser-LL (1) Parser-Shift Reduce Parser-LR (0) Item-
Construction of SLR Parsing Table -Introduction to LALR Parser - Error Handling and
Recovery in Syntax Analyzer-YACC-Design of a syntax Analyzer for a Sample Language.
UNIT IV: SYNTAX DIRECTED TRANSLATION AND RUN TIME ENVIRONMENT

Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-Attribute
Definitions- Design of predictive translator - Type Systems-Specification of a simple type
checker- Equivalence of Type Expressions-Type Conversions. RUN-TIME ENVIRONMENT:
Source Language Issues-Storage Organization-Storage Allocation- Parameter Passing-Symbol
Tables-Dynamic Storage Allocation-Storage Allocation in FORTAN.
UNIT V: CODE OPTIMIZATION AND CODE GENERATION

Principal Sources of Optimization-DAG- Optimization of Basic Blocks-Global Data Flow
Analysis- Efficient Data Flow Algorithms-Issues in Design of a Code Generator - A Simple
Code Generator Algorithm.
TEXTBOOKS
1. Compilers – Principles, Techniques and Tools, Alfred V Aho, Monica S. Lam, Ravi Sethi
and Jeffrey D Ullman, 2nd Edition, Pearson Education, 2007.
REFERENCES
1. Optimizing Compilers for Modern Architectures: A Dependence-based Approach,
Randy Allen, Ken Kennedy, Morgan Kaufmann Publishers, 2002.
2. Advanced Compiler Design and Implementation, Steven S. Muchnick, Morgan
Kaufmann Publishers - Elsevier Science, India, Indian Reprint 200
3. Engineering a Compiler, Keith D Cooper and Linda Torczon, Morgan Kaufmann
Publishers Elsevier Science, 2004.
4. Crafting a Compiler with C Charles N. Fischer, Richard. J. LeBlanc, Pearson Education,
2008.
1. Language recognizer.
2. Conversion of NFA to DFA.
3. Minimization of DFA.
4. Design of lexical analyzer using C.
5. Design of lexical analyzer using LEX.
6. Implementation of Recursive Descent Parser using C.
7. Computation of FIRST and FOLLOW for a given CFG using C.
8. Implementation of Predictive Parser using C.
9. Implementation of Shift Reduce Parser using C.
10. Implementation of SLR Parser using C.
11. Implementation of LALR Parser using YACC.
12. Intermediate code generation.
13. Implementation of code generation.
SEMESTER VI
COURSE COURSE NAME C/OE/TE/SE CREDITS

CODE L T P C
CDC 302 Soft Skills -VI HS 1 0 0 0
UNIT I: RESUME WRITING

The difference between resume and CV, Types of resumes, Inclusions in a resume,
Technicalities of a resume.
UNIT II: COVER LETTER

Resume Vs Cover Letter, Types of cover letter, Structure of cover letter, Content of cover letter
UNIT III: BUSINESS WRITING

Four types of Business Writing: Instructional, Informational, Persuasive and Transactional
UNIT IV: CREATING A PERSONAL BRAND

Creating a communication strategy based on:
Who are you?
What do you offer?
What makes you unique?
UNIT V: PRACTICE SESSIONS AND ASSESSMENTS

BOOKS AND REFERENCES
1. How to write better resumes and cover letters – Pat Crisco.
2. R.S. Agarwal, A Modern Approach to Verbal &Non-Verbal Reasoning, S. Chand
Publication.
3. Meenakshi Upadhyay, Arun Sharma -Verbal Ability and Reading Comprehension.
4. Art of writing Business letters – N. Sundararajan.
SPECIALIZATION
STREAMS
SPECIALIZATION STREAMS
[Artificial Intelligence and Machine Learning]
SUBJECT SUBJECT TITLE Course CREDITS

CODE Category L T P C
CSE 311 Introduction to Machine Learning SE 3 0 2 4
Introduction to Machine Learning: Introduction. Different types of learning, Hypothesis space
and inductive bias, Evaluation. Training and test sets, cross validation Linear Regression:
Introduction, Linear regression, Python exercise on linear regression.
UNIT II: DECISION TREE LEARNING

Introduction, Decision tree representation, appropriate problems for decision tree learning, the
basic decision tree algorithm, hypothesis space search in decision tree learning, inductive bias
in decision tree learning, issues in decision tree learning, Python exercise on Decision Tree.
Instance based Learning: K nearest neighbor, the Curse of Dimensionality, Feature Selection:
forward search, backward search, univariate, multivariate feature selection approach, Feature
reduction (Principal Component Analysis), Python exercise on kNN and PCA Recommender
System: Content based system; Collaborative filtering based.
UNIT III: PROBABILITY AND BAYES LEARNING

Bayesian Learning, Naïve Bayes, Python exercise on Naïve Bayes Support Vector Machine:
Introduction, the Dual formulation, Maximum margin with noise, nonlinear SVM and Kernel
function, solution to dual problem, python exercise on SVM.
UNIT IV: ARTIFICIAL NEURAL NETWORKS

Introduction, Biological motivation, ANN representation, appropriate problem for ANN
learning, Perceptron, multilayer networks and the back propagation algorithm, python exercise
on neural network. Introduction to Computational Learning Theory: Introduction, sample
complexity, finite hypothesis space, VC dimension.
UNIT V: ENSEMBLES & CLUSTERING

Ensembles: Introduction, Bagging and boosting Clustering: Introduction, K-mean clustering,
agglomerative hierarchical clustering, Python exercise on k-mean clustering.
TEXTBOOKS
1. Machine Learning. Tom Mitchell. First Edition, McGraw- Hill, 1997.
REFERENCES
1. Introduction to Machine Learning Edition 2, by Ethem Alpaydin.
2. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.
3. Christopher Bishop, “Pattern Recognition and Machine Learning” Springer, 2007.

1. Basic exercises on Python Machine Learning Packages such as Numpy, Pandas and
matplotlib.
2. Given a dataset. Write a program to compute the Covariance, Correlation between a
pair of attributes. Extend the program to compute the Covariance Matrix and
Correlation Matrix.
3. Given a set of sample points in N dimensional feature space. Write a program to fit the
points with a hyper plane using Linear Regression. Calculate sum of residual error.
4. Write a program that provides option to compute different distance measures between
two points in the N dimensional feature space. Consider some sample datasets for
computing distances among sample points.
5. Write a program to demonstrate the working of the decision tree based ID3 algorithm.
Use an appropriate data set for building the decision tree and apply this knowledge to
classify a new sample.
6. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data
set. Print both correct and wrong predictions. Python ML library classes can be used
for this problem.
7. Write a program to implement feature reduction using Principle Component Analysis
8. Write a program to implement the naïve Bayesian classifier for a sample training data
set stored as a .CSV file. Compute the accuracy of the classifier, considering few test
data sets.
9. Given a dataset for classification task. Write a program to implement Support Vector
Machine and estimate it test performance.
10. Write a program to implement perceptron for different learning task.
11. Write programs to implement ADALINE and MADALINE for given learning task.
12. Build an Artificial Neural Network by implementing the Back propagation algorithm
and test the same using appropriate data sets.
13. Write a program to implement K means clustering algorithm. Select your own dataset
to test the program. Demonstrate the nature of output with varying value of K.
CSE 314 Digital Image Processing SE 3 0 2 4
UNIT I
Digital Image fundamentals: Image sampling and quantization. Relationship between pixels.
Image acquisition and Pre-processing: Intensity transformations and spatial filtering. Some
basic intensity transformation functions. Histogram processing. Spatial filters for smoothing
and sharpening.
UNIT II
Filtering in the Frequency Domain: basic filtering in the frequency domain. Image smoothing
and sharpening. Image Restoration: Image restoration/degradation model. Noise models.
Restoration in the presence of noise only. Estimating the degradation function.
UNIT III
Image segmentation: Fundamentals, point. Line detection, basic edge detection techniques.
Hough transform, Thresholding. Basic global thresholding Optimal thresholding using Otsu’s
method. Multi-spectral thresholding. Region based segmentation. growing, region splitting and
merging.
UNIT IV
Color Image Processing: color models. Color transformation. Image
Compression: Fundamentals. Some basic compression methods.
UNIT V
Representation: Shape features (Region-based representation and descriptors) Area, Euler’s
number, eccentricity. Elongatedness, rectangularity. Direction, compactness. Moments, covex
hull. Texture features. Color features. Object and Pattern Recognition: Pattern and pattern
classes. Matching, minimum distance or nearest neighbor classifier. Matching by correlation.
Optimum statistical classifier. Neural network classifier.
1. R.C. Gonzalez, R.E. Woods, Digital Image Processing, 3rd Edition, Pearson Education.
2. S. Sridhar, Digital Image Processing, Oxford University Press, 2011.
3. Milan Sonka, Vaclav Hlavac and Roger Boyele, Image processing, analysis, and
machine vision. 3e, Cengage Learning, 2014.
4. Computer Vision A modern approach, David A. Forsyth and Jeam Ponce, Pearson
Education.

1. Perform the following operations using library functions
a) Read, Display and write any color image in other formats.
b) Find RED, GREEN and BLUE plane of the color image.
c) Convert color image into gray scale image and binary image.
d) Resize the image by one half and one quarter.
e) Image rotates by 45, 90 and 180 degrees.
2. Create black and white images (A) of size 1024x1024. Which consists of alternative
horizontal lines of black and white? Each line is of size 128. Create black and white
images (B) of size 1024x1024.Perform the following operations on Image A and
Image B.
a) Image addition of A and B
b) Subtraction of A and B
c) Multiplying Images of A and B
d) Create a grayscale image of size 256x1024. Intensity of image should vary
sinusoidal.
e) Create a white image of size 256x256, with black box of size 58x58 at centre.
3. Develop programs for following intensity transformation operation on a gray scale
image. Collect any gray scale image from any source. Process that image using these
operations.
a) Image negative
b) Log transformation and inverse log transform: s = c log (1+r), c is a const, r ≥
0. s is pixel intensity of output image, r is the pixel intensity of input image.
Study the effect of constant c on the quality of output image.
c) Power law transformation: Study the effect of different values of Gamma used
in this transformation.
d) Contrast stretching
e) Gray level slicing
4. Develop programs for following spatial filtering operations on a gray scale image.
a) Averaging: Implement averaging filtering operations for different window sizes
and study their effect on the quality of output image. Write your observations
on output image quality.
b) Weighted averaging: Implement weighted averaging filtering operations for
different window sizes and study their effect on the quality of output image.
Write your observations on output image quality.
c) Median filtering: Implement weighted averaging filtering operations for
different window sizes and study their effect on the quality of output image.
Write your observations on output image quality.
d) Max filtering
e) Min filtering
5. Take a gray scale image and add salt and pepper noise. Write programs for following
operations and observe their outputs
a) Linear smoothing or Image averaging
b) Weighted averaging
c) Median filtering. Compare the output quality among Image averaging and
median filtering.
d) Max filtering
e) Min filtering
6. Write programs to perform following sharpening operations on a gray scale image
a) Laplacian filter
b) Filtering using composite mask
c) Unsharp masking
d) High boost filtering
e) Filtering using first order derivative operators such as sobel and prewitt mask
7. Write a program to improve contrast of an image using histogram equalization. The
prototype of the function is as below: histogram equalisation (input Image, no of
bins); The function should return the enhanced image. Consider two low contrast
input images. Study the nature of the output image quality in each case by varying the
number of bins.
8. Take a low contrast gray scale image (A) and a high contrast gray scale image (B).
Write a program to improve the contrast of A with the help of image B using
histogram specification or matching. The prototype of the function is as below:
Histogram sp (input Image, specified Iage, no of bins); The function should return the
enhanced image.
9. Develop programs to implement frequency domain smoothing filters (Ideal,
Butterworth and Gaussian) and apply these filters on a gray scale image.
a) Compare/comment on the output of Ideal, Butterworth and Gaussian Low pass
Filters having the same radii (cutoff frequency) value.
b) Consider a suitable gray scale image and demonstrate the ringing effect on the
output of Ideal low pass frequency domain filter.
c) Compare the output of Butterworth low pass filters (order n=2) for different
cut-off frequencies (5, 15, 30, 90, 120).
d) Compare the output of Gaussian low pass filters for different cut-off
frequencies (5, 15, 30, 90, and 120)
10. Develop programs to implement frequency domain sharpening/High pass filters (Ideal,
Butterworth and Gaussian) and apply these filters on a gray scale image.
a) Compare/comment on the output of Ideal, Butterworth and Gaussian High pass
Filters having the same radii (cutoff frequency) value.
b) Consider a suitable gray scale image and demonstrate the ringing effect on the
output of Ideal high pass frequency domain filter.
c) Compare the output of Butterworth high pass filters (order n=2) for different
cut-off frequencies (5, 15, 30, 90, 120).
d) Compare the output of Gaussian high pass filters for different cut-off
frequencies (5, 15, 30, 90, and 120).
11. Develop program to add different types of noise in a gray scale image and write
functions to implement following filters for image restoration in presence of these
noises.
a) Remove Salt and Pepper Noise
b) Minimize Gaussian noise
c) Median filter and Weiner filter
12. Write and execute program for image morphological operations erosion and dilation.
13. Implement Morphological smoothing using opening and closing
14. Develop program to implement point and line detection masks. Detect points and lines
using these masks for a given gray scale image.
15. Develop programs for edge detection using different edge detection mask.
16. Develop programs to achieve image segmentation using
a) Basic Global thresholding
b) Optimal global thresholding or Otsu’s thresholding
17. Given a set of coordinates as boundary pixels in an image. Write a program to
implement Hough Transform for joining the points using different lines.
18. Given a MXN image. Write a program to find the Co-occurrence matrix for a given
angle and distance. Compute the Co-occurrence matrix features.
19. Given a MXN image. Write a program to find the Local Binary Pattern profile of the
given image.
CSE 412 Principles of Soft Computing SE 3 0 2 4
UNIT I: INTRODUCTION TO SOFT COMPUTING, ARTIFICIAL NEURAL

NETWORK (ANN)
Fundamentals of ANN, Basic Models of an artificial Neuron, Neural Network Architecture,
learning methods, Terminologies of ANN, Hebb network, Supervised Learning Networks:
Perceptron, Adaline, Madeline, Multi-Layer Perceptron, Feed forward Back Propagation
Network: back propagation learning, Learning Effect of Tuning parameters of the Back
propagation.
UNIT II: RBF NETWORK, ASSOCIATIVE MEMORY

Auto, hetero and linear associative memory, network, Adaptive Resonance Theory: ART1,
ART2, Introduction to Computer vision, Introduction to Convolutional neural network, Popular
architectures: AlexNet, GoogleNet, VGG Net.
UNIT III: FUZZY LOGIC

Fuzzy set theory: crisp sets, fuzzy sets, crisp relations, fuzzy relations, Fuzzy Systems: Crisp
logic predicate logic, fuzzy logic, fuzzy Rule based system, Defuzzification Methods, Fuzzy
rule-based reasoning.
UNIT IV: GENETIC ALGORITHMS

Fundamentals of genetic algorithms: Encoding, Fitness functions, Reproduction. Genetic
Modeling: Cross cover, Inversion and deletion, Mutation operator, Bit-wise operators, Bitwise
operators used in GA. Convergence of Genetic algorithm. Applications, Real life Problems.
Particle Swarm Optimization and its variants.
UNIT V
Hybrid Soft Computing Techniques Hybrid system, neural Networks, fuzzy logic and Genetic
algorithms hybrids. Genetic Algorithm based Back Propagation Networks: GA based weight
determination applications: Fuzzy logic controlled genetic Algorithms soft computing tools,
Applications.
TEXTBOOKS
1. Principles of Soft Computing- S. N. Sivanandan and S.N. Deepa, Wiley India, 2nd
Edition,2011
REFERENCES
1. Fuzzy and Soft Computing, J. S. R. JANG, C.T. Sun, E. Mitzutani, PHI.
2. Neural Networks, Fuzzy Logic, and Genetic Algorithm (synthesis and Application)
S. Rajasekaran, G.A. Vijayalakshmi Pai, PHI.
1. Write a Python Program to implement a perceptron. The input is your semester marks.
2. Write a python program to extend the exercise given above to implement Feed
Forward Network. The inbuilt function should not be used.
3. Write a python program to implement Hebb Network. The inbuilt function should not
be used.
4. Write a python program to implement Multilayer Perceptron. The inbuilt function
should not be used.
5. Write a python program to implement any ANN with back propagation learning
Algorithm.
6. Write a Python Program to implement ART1 and ART 2.
7. Write a python program to implement CNN.
8. Write a python Programming to realize the working principles of popular
architectures such as AlexNet, GoogleNet and VGG Net.
9. Write python Program to realize Fuzzy Sets arithmetic.
10. Write a python Program to realize fuzzy relations.
11. Write a python program to realize a fuzzy rule of any popular problem (s).
12. Write a python program to realize a defuzzification scheme for the above exercise.
13. Write a python Program to reason the fuzzy rules in exercises 12 and 13.
14. Write a python program to realize various steps of Genetic Algorithms.
15. Write a Python Program to realize GA based back propagation Networks.
16. Write a Python Program to realize Fuzzy Controlled Genetic Algorithms.
SUBJEC SUBJECT TITLE Course CREDITS
T CODE Category L T P C
CSE 413 Artificial Intelligence SE 3 0 2 4
UNIT I
Introduction: What is Intelligence. Foundations and History of Artificial Intelligence.
Applications of Artificial Intelligence. Intelligent Agents. Structure of Intelligent Agents.
UNIT II
Search: Introduction to Search. Searching for solutions. Uniformed search strategies. Informed
search strategies. Local search algorithms and optimistic problems Adversarial Search. Current-
best-hypothesis search. Least commitment search.
UNIT III
Knowledge Representation and Reasoning: Inference. Propositional Logic, Predicate Logic
(first order logic). Logical Reasoning. Forward &Backward Chaining. Resolution; AI languages
and tools – Lisp. Prolog, CLIPS.
UNIT IV
Problem Solving: Formulating problems. Problem types, Solving Problems by Searching.
Heuristic search techniques. Constraint satisfaction problems. Stochastic search methods.
UNIT V
Learning: Overview of different forms of learning. Decision trees, rule- Game playing: Perfect
decision game-based learning. Neural networks, reinforcement learning. Game playing: Perfect
decision game. Imperfect decision game. Evaluation function. Minimax, alpha-beta pruning.
1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson
Education
2. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson
Education
3. E Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson
Education
4. Nils J. Nilsson, Artificial Intelligence: A New Synthesis, Morgan Kauffman, 2002.

1. Week 1: Artificial Intelligence Problem identification and PEAS description.
2. Week 2: Introduction to AI programming Language PROLOG
3. Week 3: Study of facts, objects, predicates, and variables in PROLOG.
4. Week 4: Study of arithmetic operators, simple input/output, and compound goals in
PROLOG.
5. Week 5: Study of string operations in PROLOG. Implement string operations like
substring, string position, palindrome etc.
6. Week 6: Write a prolog program to implement all set operations (Union, intersection,
complement etc.
7. Week 7: Write a program for Usage of rules in Prolog. Create a family tree program to
include following rules 1. M is the mother of P if she is a parent of P and is female 2. F
is the father of P if he is a parent of P and is male 3. X is a sibling of Y if they both have
the same parent. 4. Then add rules for grand-parents, uncle-aunt, sister and brother.
Based on the facts, define goals to answer questions related to
8. Week 8: Write programs for studying Usage of arithmetic operators in Prolog.
a) Accept name of the student, roll no, his/her subject name, maximum marks and
obtained marks in the subject. (Take marks of atleast 6 subjects). Compute the
percentage of a student. Display his result with other information.
b) Accept department, designation, name, age, basic salary, house rent allowance
(HRA) of an employee. Compute dearness allowance (DA) which is 15% of
basic salary. Determine the gross salary (basic salary + HRA + DA) of the
employee. Display all information of the employee (Generate Payslip).
9. Week 9: Implement a program for recursion and list in PROLOG.

10. Week 10: WAP for studying usage of compound object and list in Prolog.
a) Write a program to maintain inventory items using a compound object:
i. Accept from user the details of at least 10 objects.
ii. Display from user the details of objects entered by user
b) Find and display odd and even numbers from a given input list.
11. Week 11: Write a prolog program to solve “Water Jug Problem”.
12. Week 12: Write a program to implement a monkey banana problem.
13. Week 13: Write a program to implement 8 Queens Problem.
14. Week 14: Write a program to solve traveling salesman problem.
15. Week 15: Write a program to solve water jug problem using LISP.
[Cyber Security]

CSE 312 Introduction to Cryptography SE 3 0 2 4
UNIT I: INTRODUCTION OF CRYPTOGRAPHY

Basic introduction Cryptography, Classical Encryption Techniques: Symmetric Cipher Model .
Cryptography, Cryptanalysis and Brute-Force Attack Substitution Techniques: Caesar Cipher,
Monoalphabetic Cipher, Playfair Cipher, Hill Cipher Polyalphabetic Cipher, One Time
Pad. Transposition Cipher: Rail Fence Cipher, Simple Columnar or Row Transposition
Data. Double Columnar or Row Transposition, Rotor Machines.
UNIT II: BLOCK CIPHERS AND THE DATA ENCRYPTION STANDARD

Introduction Traditional block Cipher structure Motiva Motivation for the feistel Cipher
structure stream Ciphers and block Ciphers The data encryption Techniques Finite Fields and
Advanced Encryption Standard AES encryption, AES decryption AES example, results. the
avalanche effect, the strength of AES. Stream Ciphers, RC1, RC4.
UNIT III: PUBLIC-KEY CRYPTOSYSTEMS

Fermat’s and Euler’s Theorems, Public-Key Cryptography and RSA: Principles of public-key
cryptosystems. Applications for public-key cryptosystems, requirements for public-key
cryptosystems. public-key cryptanalysis. The RSA algorithm, description of the algorithm,
computational aspects, the security of RSA. Diffie-hellman key exchange, The algorithm,
Elliptic Curve Cryptography systems key exchange protocols man in the middle attack Elgamal
Cryptographic systems.
UNIT IV: CRYPTOGRAPHIC HASH FUNCTIONS

Cryptographic Hash Functions, Hash Functions Based on Cipher Block Chaining, Secure Hash
Algorithm (SHA), SHA-3. Hash Functions Based on Cipher Block Chaining, Secure Hash
Algorithm (SHA), SHA-3, Application of Cryptographic Hash Functions.
UNIT V: BLOCKCHAIN
Block Chaining, Bitcoin Smart Contracts Ethereum, Hyper ledger Fabrics.
1. Stallings, William. Cryptography and network security, 4/E. Pearson Education India,
2006.
2. D. Stinson Cryptography, Theory and Practice (Third Edition).
3. Handbook of Applied Cryptography by A. Menezes, P. Van Oorschot, S. Vanstone.
4. Blockchain blueprint for new economy, Melanie Swan.
5. Mastering Blockchain, Imran Bashir.
1. Write a program take text file as an input and print word, character count and ascii
value of each characters as output. (Hint: Use open(), read() and split()).
2. Write a encryption program: Input: computerscienceengineeringsrmuniversity Output:
gsqtyxivwgmirgiirkmriivmrkwvqyrmzivwmxc Hint: key =4 (play with ascii value).
3. Raju send an encrypted message (cipher text) “PHHW PH DIWHU WKH WRJD
SDUWB” to Rani. Can you build decryption process and find out what is the message
(plain text) send to Rani? Hint: try all keys.
4. Raju send encrypted message “ZICVTWQNGKZEIIGASXSTSLVVWLA” to Rani.
Can you build decryption process and find out what is the message send to Rani. Hint:
try all keys for each character.
5. Kohli have plain text “wewishtoreplaceplayer”. Can you build encryption process and
find out what is the cipher text he needs send to BCCI. Help him out by using
monoalphabatic cipher. Hint: use any one-to-one mapping between alphabets.
One to one
mapping
Kohli sent encrypted message (Cipher text) “SEEMSEAOMEDSAMHL” to Anushka.

Can you build decryption process and find out what is the message (plain text) send to
Anushka. Hint: use above one to one mapping between alphabets.
6. Raju want to build encrypted and decryption algorithms of Playfair Cipher. Help him
to build a key matrix using the key “srmapuniversity”
7. By using key matrix Raju want to send message “we are discovered save yourself” to
Rani. Can you build encryption process and find out what is the cipher text message
send to Rani by using palyfair cipher.
8. By using key “CBDE” Raju would like send message (plain text)“HELLO WORLD”
to Rani. Can you build encryption process and find out what is the encrypted message
(cipher text) to Raju by using Hill Cipher. Also Can you build decryption process and find
out what is the decrypted message (plain text) of cipher text "SLHZYATGZT" by using Hill
Cipher.
9. Implementation of Encryption and Decryption of Vigenère Cipher
keyword deceptive
key: deceptivedeceptivedeceptive
plaintext: wearediscoveredsaveyourself
ciphertext: ZICVTWQNGRZGVTWAVZHCQYGLMGJ
10. Implement the Encryption and Decryption of Row Transposition.
Key: 4312567
Plaintext: a t t a c k p
ostpone
duntilt
woamxyz
Ciphertext: TTNAAPTMTSUOAODWCOIXKNLYPETZ
11. Implement the Euclidean Algorithm for integers and polynomials.
12. Implement AES Key Expansion.
13. Implementation of AES encryption and decryption
14. Implementation of Simplified DES Encryption and decryption
15. Implementation of RC4
16. Implementation of RSA algorithm
17. Implementation of Diffie-Helman key exchanges
18. Implementation of elliptic-curve cryptography
19. Implementation of Hash functions
20. Implementation of SHA1, SHA2, SHA3
CREDITS
Course Code Course Name Course Category
L T P C
CSE 315 Network Security SE 3 0 2 4
Unit-1: Need for Security

Need for Security: Security Attack, Security Services, Information Security, Methods of
Protection.
Network Concepts: Basic Concepts of Computer Networks
Threats in Networks: Threat Precursors, Threats in Transit, Protocol Flaws, Message
Confidentiality Threats, Nonexistent and Well-Known Authentication, Spoofing, DoS, DDoS
Network Security Controls: Segmentation, Redundancy, Single Points of Failure, Encryption,
Link and End-to-End Encryption, Virtual Private Networks, VPN & Firewall, PKI and
Certificates, SSL and SSH Encryption, Kerberos, Onion Routing
Unit-2: Authentication
Message Authentication Codes (MAC): Message Authentication Requirements, Message
Authentication Functions, Security of MACs, MACs Based on Hash Functions: HMAC.
Digital Signature: Digital Signatures, Elgamal Digital Signature Scheme, Schnorr Digital
Signature Scheme, NIST Digital Signature Algorithm, Elliptic Curve Digital Signature
Algorithm, RSA-PSS Digital Signature Algorithm.
Overview of Authentication Systems: Password-Based Authentication, Address-Based
Authentication, Cryptographic Authentication Protocols, Trusted Intermediaries, KDCs,
Certification Authorities (CAs), Session Key Establishment.
Security Handshake Pitfalls: Login, Mutual Authentication, Integrity/Encryption for Data,
Two-Way Public Key Based Authentication, One-Way Public Key Based Authentication,
Mediated Authentication (with KDC), Needham-Schroeder, Expanded Needham-Schroeder,
Otway-Rees, Nonce Types.
Strong Password Protocols: Lamport’s Hash, Strong Password Protocols, Strong Password
Credentials Download Protocols.
Unit-3: IPSec
IPSec: Overview of IP Security (IPSec), IP Security Architecture, Modes of Operation,
Security Associations (SA), Authentication Header (AH), Encapsulating Security Payload
(ESP), Comparison of Encodings.
Internet Key Exchange (IKE): Photuris, SKIP, History of IKE, IKE Phases, Phase 1 IKE -
Aggressive Mode and Main Mode, Phase 2/Quick Mode, Traffic Selectors, The IKE Phase 1
Protocols, Phase-2 IKE: Setting up IPsec SAs, ISAKMP/IKE Encoding - Fixed Header,
Payload Portion of ISAKMP Messages, SA Payload, SA Payload Fields.
Unit-4: Web Security
Web Security Requirements: Web Security threats, Web traffic Security Approaches.
SSL/TLS: Secure Socket Layer (SSL), Transport Layer Security (TLS), TLS Architecture,
TLS record protocol, change cipher spec protocol, Alert Protocol, Handshake Protocol, Https,
SSH.
Secure Electronic Transaction (SET): SET functionalities, Dual Signature, Roles &
Operations, Purchase Request Generation, Purchase Request Validation, Payment
Authorization and Payment Capture.
SNMP: Basic concepts of SNMP, SNMP basic components and their functionalities, Basic
commands of SNMP, SNMPv1 Community facility and SNMPv3. Intruders, Viruses and
related threats.
Unit-5: Firewall & Email Security

Firewalls: Need for Firewalls, Firewall Characteristics, Types of Firewalls, Firewall Basing,
Firewall Location and Configurations.
Electronic Mail Security: Pretty Good Privacy, S/MIME, DNSSEC, Domain Keys Identified
Mail.
Textbooks:
1. Perlman, Radia, Charlie Kaufman, and Mike Speciner. Network security: private
communication in a public world. Pearson Education India, 2016.
2. Cryptography and Network Security – Principles and Practice: William Stallings,
Pearson Education, 6th Edition.
Reference Books:
1. Network Security and Cryptography, Bernard Menezes, CENGAGE Learning.
2. Introduction to Network Security: Neal Krawetz, CENGAGE Learning.
3. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3rd Edition.

1. packet assembler/analyzer: Wireshark.
2. packet assembler/analyzer: hPing3.
3. Encrypted communication over socket using AES.
4. Message Authentication Code: MAC.
5. MAC Based on Hash Function: HMAC.
6. Session Key establishment using RSA.
7. Handcraft a TCP handshake.
8. Diffie-Hellman Algorithm.
9. DH Key exchange.
10. Network Mapper: Nmap Basics.
11. Penetration Testing: Metasploit Basics.
12. Keytool& OpenSSL.
13. One Way SSL to a Web App.
14. SNMP: net SNMP – MIB.
15. Firewall with UFW.
CREDITS
L T P C
CSE 410 Mobile and Wireless Security SE 3 0 2 4
UNIT I – Introduction to Mobile and Wireless Networks:

IEEE wireless networks, WLAN: IEEE 802.11 (a:n), WPAN: IEEE 802.15 (Bluetooth &
Zigbee), WMAN: IEEE 802.16 (WiMAX), WMAN mobile: IEEE 802.20 (MBWA), IEEE
802.21 framework (MIH), Cellular Networks, Cellular networks: VoIP, IMS, 4G Security
Unit II – How existing Wireless networks are secured:

Attacks on wireless networks, WEP, WEP Shortcomings, IEEE 802.11i, Bluetooth,
Authentication in wireless networks, GSM Authentication, UTMS Authentication, SS7
Protocol Stack
UNIT III – Next Generation Wireless Networks:

Mobility & Internet, Mobility with MIPv6, Mobility with Mobile IPv4, IP mobility with HIP
and NetLMM, Ad Hoc Networks: Protocols, Security in Ad Hoc Networks, Key Management
in Ad Hoc Networks, Wireless Sensor Network Security, Key Management in WSN
UNIT IV – Preventing Malicious Behavior:

Naming and Addressing, Establishing Security Association: Key Establishment in Sensor
Network,
Establishing Security Association: Utilizing Mobility, Wormhole Attack, Privacy in RFID
System, Location Privacy in Vehicular Network, Privacy Preserving Routing in Ad-hoc
Networks
UNIT V – Mobile Application Security:

Brief Introduction to Android – I, Brief Introduction to Android – II, Android Security Model
Permission, Package Management, User Management, Cryptographic Providers, Network
Security and PKI, Credential Storage, Discovering Vulnerabilities using Static Analysis, Tools
Fuzzing on Android.
Textbooks:
1. Noureddine Boudriga, Security of Mobile Communications, 2010.
2. Levente Buttyán and Jean-Pierre Hubaux, Security and Cooperation in Wireless
Networks, 2008. [Available Online]
Reference Books:
1. James Kempf, Wireless Internet Security: Architectures and Protocols, 2008.
2. Android Security Internals: An In-Depth Guide to Android's Security Architecture,
Author: Nikolay Elenkov, No Starch Press, First Edition, Nov. 2014

1. Understanding IEEE 802.11with Wireshark.
2. Medium Access Control for Wirelessly Connected Stations.
3. Wireless Security – I (Wireless Security Basics).
4. Wireless Security – II (Wireless Threats).
5. Bluetooth Security.
6. Wireless Security Pen Testing (WEP, WPA/WPA2).
7. Mobility & Load and Congestion Window Size.
8. server mobility on the network performance: Load (bits/sec) , Congestion Window
Size. (bytes) , and Traffic Received (bytes).
9. Queuing Disciplines and VoIP.
10. Network Security and Virtual Private Networks.
11. Network Application Performance Analysis.
12. Connection-Oriented, Cell-Switching Technology.
13. Developing Android App.
14. Reverse Engineering using Apktool and dex2jar.
15. Analyzing Vulnerabilities using Static Analyzer and Fuzzer.
CREDITS
L T P C
CSE 414 Internet Protocols and Networking SE 3 0 2 4
UNIT I
Network Models: Layered Tasks, The OSI Model, Layers in OSI Model, TCP/IP Protocol suite,
Addressing. Connecting devices: Passive Hubs, Repeaters, Active Hubs, Bridges, Two Layer
Switches, Routers, Three Layer Switches, Gateway, Backbone Networks.
UNIT II
Principles of Internetworking, Connectionless Interconnection, Application-Level
Interconnection, Network Level Interconnection, Properties of the Internet, Internet
Architecture, Interconnection through IP Routers TCP, UDP & IP: TCP Services, TCP
Features, Segment, A TCP Connection, Flow Control, Error Control, Congestion Control,
Process to Process Communication, User Datagram, Checksum, UDP Operation, IP Datagram,
Fragmentation, Options, IP Addressing: Classful Addressing, IPV6.
UNIT III
Transport layer Protocols: Transport Layer Services, UDP and TCP protocols, Flow control
and Error control in Transport layer, Flow control mechanisms in Transport layer.
UNIT IV
Data Traffic, Congestion, Congestion Control, Congestion Control in TCP, Congestion Control
in Frame Relay, Source Based Congestion Avoidance, DEC Bit Scheme, Quality of Service,
Techniques to Improve QOS: Scheduling, Traffic Shaping, Admission Control, Resource
Reservation, Integrated Services and Differentiated Services.
UNIT V
Concepts of Buffer Management, Drop Tail, Drop Front, Random Drop, Passive Buffer
Management Schemes, Drawbacks of PQM, Active Queue Management: Early Random Drop,
RED Algorithm.
1. Douglas. E.Comer, “Internetworking with TCP/IP “, Volume I PHI.
2. Behrouz A Forouzan, “TCP/IP Protocol Suite”, TMH, 3rd Edition.
3. B.A. Forouzan, “Data communication & Networking”, TMH, 4th Edition.

1. Install and Configure Wired and Wireless NIC and transfer files between systems in
LAN and Wireless LAN.
2. Study basic network command and network configuration commands.
3. Configure Host IP, Subnet Mask and Default Gateway in a System in LAN (TCP/IP
Configuration).
4. Establish Peer to Peer network connection using two systems using Switch and Router
in a LAN.
5. Configure a Network topology using Packet Trace.
6. Configure Internet connection and use IPCONFIG, PING / Tracer and Net stat utilities
to debug the network issues.
7. Transfer files between systems in LAN using FTP Configuration, install Print server in
a LAN and share the printer in a network.
8. Set up a network that utilizes TCP as its end-to-end transmission protocol and analyse
the size of the congestion window with different mechanisms.
9. Implement flow control so that a fast sender will not overrun a slow receivers' buffer.
10. Implement RED algorithm DEC Bit scheme in TCP.
11. Implement the Drop Tail Buffer Management Policies.
12. Implement the Drop Front Buffer Management Policies.
13. Implement the Random Drop Buffer Management Policies.
14. Implement the Early Random Drop Buffer Management Policies.
15. Implement RED algorithm.
[Data Science]
Course Course Name Course CREDITS

Code Category L T P C
CSE 311 Introduction to Machine Learning SE 3 0 2 4
UNIT I: INTRODUCTION TO MACHINE LEARNING: INTRODUCTION

Introduction to Machine Learning: Introduction. Different types of learning, Hypothesis space
and inductive bias, Evaluation. Training and test sets, cross validation Linear Regression:
Introduction, Linear regression, Python exercise on linear regression.
UNIT II: DECISION TREE LEARNING

Introduction, Decision tree representation, appropriate problems for decision tree learning, the
basic decision tree algorithm, hypothesis space search in decision tree learning, inductive bias
in decision tree learning, issues in decision tree learning, Python exercise on Decision Tree.
Instance based Learning: K nearest neighbor, the Curse of Dimensionality, Feature Selection:
System: Content based system; Collaborative filtering based.
UNIT III: PROBABILITY AND BAYES LEARNING

Bayesian Learning, Naïve Bayes, Python exercise on Naïve Bayes
Support Vector Machine: Introduction, the Dual formulation, Maximum margin with noise,
nonlinear SVM and Kernel function, solution to dual problem, python exercise on SVM.

learning, Perceptron, multilayer networks and the back propagation algorithm, python exercise
on neural network. Introduction to Computational Learning Theory: Introduction, sample
complexity, finite hypothesis space, VC dimension.

Ensembles: Introduction, Bagging and boosting Clustering: Introduction, K-mean clustering,
agglomerative hierarchical clustering, Python exercise on k-mean clustering.
TEXTBOOKS
REFERENCES
1. Basic exercises on Python Machine Learning Packages such as Numpy, Pandas and
matplotlib.
2. Given a dataset. Write a program to compute the Covariance, Correlation between a
pair of attributes. Extend the program to compute the Covariance Matrix and
Correlation Matrix.
3. Given a set of sample points in N dimensional feature space. Write a program to fit the
points with a hyper plane using Linear Regression. Calculate sum of residual error.
set. Print both correct and wrong predictions. Python ML library classes can be used
for this problem.
7. Write a program to implement feature reduction using Principle Component Analysis.
data sets.
10. Write a program to implement perceptron for different learning task.
11. Write programs to implement ADALINE and MADALINE for given learning task.
CSE 313 Introduction to Data Science SE 3 0 2 4
UNIT I
Introduction: What is Data Science? - Big Data and Data Science hype – and getting past the
hype - Why now? – Datafication - Current landscape of perspectives - Skill sets needed -
Statistical Inference - Populations and samples - Statistical modeling, probability distributions,
fitting a model - Intro to R.
UNIT II
Exploratory Data Analysis and the Data Science Process - Basic tools (plots, graphs and
summary statistics) of EDA - Philosophy of EDA - The Data Science Process - Case Study:
Real Direct (online real estate firm) - Three Basic Machine Learning Algorithms - Linear
Regression - k-Nearest Neighbors (k-NN) - k-means.
UNIT III
One More Machine Learning Algorithm and Usage in Applications - Motivating application:
Filtering Spam - Why Linear Regression and k-NN are poor choices for Filtering Spam - Naive
Bayes and why it works for Filtering Spam - Data Wrangling: APIs and other tools for
scrapping the Web - Feature Generation and Feature Selection (Extracting Meaning From Data)
- Motivating application: user (customer) retention - Feature Generation (brainstorming, role
of domain expertise, and place for imagination) - Feature Selection algorithms – Filters;
Wrappers; Decision Trees; Random Forests.
UNIT IV
Recommendation Systems: Building a User-Facing Data Product - Algorithmic ingredients of
a Recommendation Engine - Dimensionality Reduction - Singular Value Decomposition -
Principal Component Analysis - Exercise: build your own recommendation system - Mining
Social-Network Graphs - Social networks as graphs - Clustering of graphs - Direct discovery
of communities in graphs - Partitioning of graphs - Neighborhood properties in graphs.
UNIT V
Data Visualization - Basic principles, ideas and tools for data visualization 3 - Examples of
inspiring (industry) projects - Exercise: create your own visualization of a complex dataset -
Data Science and Ethical Issues - Discussions on privacy, security, ethics - A look back at Data
Science - Next-generation data scientists.
1. Cathy O’Neil and Rachel Schutt. Doing Data Science, Straight Talk From The
Frontline. O’Reilly. 2014.
2. Jure Leskovek, Anand Rajaraman and Jeffrey Ullman. Mining of Massive Datasets.
v2.1, Cambridge University Press. 2014. (free online).
3. Kevin P. Murphy. Machine Learning: A Probabilistic Perspective. ISBN 0262018020.
2013.
4. Foster Provost and Tom Fawcett. Data Science for Business: What You Need to Know
about Data Mining and Data-analytic Thinking. ISBN 1449361323. 2013.
5. Trevor Hastie, Robert Tibshirani and Jerome Friedman. Elements of Statistical
Learning, Second Edition. ISBN 0387952845. 2009. (free online).
6. Avrim Blum, John Hopcroft and Ravindran Kannan. Foundations of Data Science.
(Note: this is a book currently being written by the three authors. The authors have
made the first draft of their notes for the book available online. The material is intended
for a modern theoretical course in computer science).
7. Mohammed J. Zaki and Wagner Miera Jr. Data Mining and Analysis: Fundamental
Concepts and Algorithms. Cambridge University Press. 2014.
8. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and Techniques,
Third Edition. ISBN 0123814790. 2011.

1. Write a python program to apply datafication concepts of friendship network of your
facebook account.
2. Write python program to calculate the central tendency of any popular data set. The
inbuilt functions in the python should not be used.
3. Write R – Programming to plot various charts and graphs. You have to consider
minimum two popular data sets and draw all the statistical observations.
4. Write a python Program to apply EDA on any two popular data sets and provided your
analysis and interpretations. Use matplotlib library of python along with other libraries
for the analysis and interpretation.
5. Write Python program to implement Linear Regression using inbuilt python Library.
Also, write your own program to implement Linear Regression without using the
inbuilt function. Compare and contrast the results.
6. Write Python program to implement K-Nearest Neighbors using inbuilt python Library.
Also, write your own program to implement K-Nearest Neighbors without using the
inbuilt function. Compare and contrast the results.
7. Write Python program to implement K-Means using inbuilt python Library. Also, write
your own program to implement K-Means without using the inbuilt function. Compare
and contrast the results.
8. Write a python program to implement a Spam Filter using Linear Regression and K-
NN. Use a popular dataset.
9. Write a Python Program to Scrapping the Web using suitable API. Create a usable
dataset for classification and clustering purpose.
10. Write a python program to generate the features from the data set created by you for
exercise 9.
11. Write a Python Program to implement Filter and Wrappers.
12. Write a Python Program to implement Decision Trees, Random Forests – The inbuilt
functions should not be used for the implementation.
13. Write a python Program to implement Singular Value Decomposition and Principle
Component Analysis. Use any popular data set.
14. Write a python Program to extract the friendship details of your facebook account as
Social network Graph and represent in various visual forms.
15. Write a python program to extend the above exercise to discover the communities in
the graph, partition the graph and extracting the neighbourhood properties of the graphs.
16. Write Python Program using Bokeh 2.1.1 realize the all the basic principles of data
visualization.
17. Consider any popular dataset and present complex visualization principle using Bokeh
2.1.1
CSE 411 Big Data Analytics SE 3 0 2 4
UNIT I
Big Data introduction - definition and taxonomy - Big data value for the enterprise - The
Hadoop ecosystem - Introduction to Distributed computing- Hadoop ecosystem – Hadoop
Distributed File System (HDFS) Architecture - HDFS commands for loading/getting data
- Accessing HDFS through Java program.
UNIT II
Introduction to Map Reduce framework - Basic Map Reduce Programming: - Advanced Map
Reduce programming: Basic template of the Map Reduce program, Word count problem-
Streaming in Hadoop- Improving the performance using combiners- Chaining Map Reduce
jobs- Joining data from different sources.
UNIT III
Querying big data with Hive - Introduction to Hive QL- Hive QL: data definition- data
manipulation
UNIT IV
Querying big data with Hive – Hive QL queries- Hive QL Views – Hive QL indexes
UNIT V
Data Analytics using R: Introduction to R, Creating a dataset, Getting started with graphs,
Basic data management, Advanced data management.
1. Big Data Fundamentals: concepts, Drivers and Techniques: Person Education, 2016
2. Hadoop The Definitive Guide, IV edition, O’Reilly publications
3. Hadoop in Action, Chuck lam, Manning publications
4. Programming, Hive, O’Reily publications
5. Apache Hive Cookbook, PACKT publications
6. R in Action, Robert I. Kabacoff, Manning publications
7. Practical Data Science with R, Nina Zumel John Mount, Manning publications

1. a. Hadoop Installation
b. Hadoop Shell Commands
2. a. Writing a file from local file system to Hadoop Distributed file system (HDFS)
b. Reading a file from HDFS to local file system.
3. a. Implementation of Word Count program using Map Reduce without combiner logic
b. Implementation of Word Count program using Map Reduce with combiner logic
4. Implementation of Map-Reduce program using partitioner
5. a. Implementation of Maximum temperature program using Map Reduce without
combiner logic
b. Implementation of Maximum temperature program using Map Reduce with
combiner logic
6. a. Create a managed table and load the data from LFS
b. Create a managed table and load the data from HDFS
c. Create an external table and load the data from LFS
d. Create an external table and load the data from HDFS
e.Drop a managed table and check the result in HDFS
f. Drop an external table and check the data from HDFS
7. Use HiveQL to analyse the stock exchange dataset and calculate the covariance
between the stocks for each month. This will help a stock-broker in recommending
the stocks to his customers.
8. a.create Hive table
b. Load data into Hive table
c. Calculate the covariance
9. Implement JOINS using HIVE
a. Inner Join
b. Left outer join
c. Right outer Join
d) Full outer join
10. Write a R program to create student record using Vector concept.
11. Write a R program to create medical patients status using data frame
i) Patient age ii) Gender iii) Symptoms iv) Patient Status
12. Write R program to visualize student marks of various subjects using Bar-chart and
Scatter plot.
CSE 415 Inference and Representation SE 3 0 2 4
UNIT I: INTRODUCTION - BAYESIAN NETWORKS

Probability review - Bayesian network basics- Probabilistic Programming and Bayesian
Methods - Algorithm for d-separation-PyMC3 tutorial – Introduction to Probabilistic Topic
Models - Probabilistic modelling in neuroscience - political science - Review of case studies
and BN structure learning - Undirected graphical models - Conditional random fields, Gaussian
MRFs Case study: Astronomy (Dan Foreman-Mackey)- Some subtleties on BNs, MRF review,
CRF introduction.
UNIT II: EXACT INFERENCE

Variable elimination, tree width, belief propagation Graph separation in MRFs, revisiting
CRFs, BP, pruning barren nodes - Unsupervised learning Expectation Maximization Case
study - Monte-Carlo methods - Gibbs sampling - Causal inference & Bayesian additive
regression trees.
UNIT III: TOPIC MODELLING INTRODUCTION TO PROBABILISTIC TOPIC

MODELS - CASE STUDY
Musical influence via dynamic topic models - Modelling musical influence with topic models -
Gaussian processes - Application to predicting wind flow - Learning Markov random fields -
Moment matching, Chow-Liu algorithm, pseudo-likelihood - Case study: Cognitive science
Idea - Exponential families, learning MRFs, and GPs - An Introduction to Conditional Random
Fields - Approximate maximum entropy learning in MRFs.
UNIT IV
Variational inference - Mean-field approximation - Graphical models, exponential families,
and variational inference - Learning deep generative models - Stochastic variational inference,
Variational auto-encoder - Structured prediction - Overview of structured prediction,
parameterizing CRFs - Integer linear programming - MAP inference, linear programming
relaxations, dual decomposition - Derivation relating dual decomposition & LP relaxations -
Integer Programming for Bayesian Network Structure Learning.
1. Kevin Murphy, Machine Learning: a Probabilistic Perspective, MIT Press, 2012. You
can read this online for free from NYU Libraries. We recommend the latest (4th)
printing, as earlier editions had many typos. You can tell which printing you have as
follows: check the inside cover, below the “Library of Congress” information. If it
says “10 9 8 … 4” you’ve got the (correct) fourth print.
2. Daphne Koller and Nir Friedman, Probabilistic Graphical Models: Principles and
Techniques, MIT Press, 2009
3. Mike Jordan’s notes on Probabilistic Graphical Models
4. MIT lecture notes on algorithms for inference.
5. Probabilistic Programming and Bayesian Methods for Hackers by Cam Davidson
Pilon
LIST OF PRACTICAL EXPERIMENTS:

1. Write C Program to implement Bayesian Methods with different combination of inputs
from a file
2. Write a C Program to implement Algorithm for d-separation-PyMC3
3. Write a C program to Modell a problem in neuroscience and political science
4. Write a C Program to simulate BN structure learning
5. Write a C Program to simulate Undirected Graph models
6. Write a C Program to simulate Conditional Random Fields and Gaussian MRF
7. Write a C program to demonstrate belief propagation
Graph separation in MRFs
8. Write a C Program to implement Monte-Carlo methods
9. Write a C Program to implement Gibbs sampling
10. Write a C Program to implement Causal inference & Bayesian additive regression trees
11. Write a C program to simulate Musical influence via dynamic topic models
12. Write a C Program to simulate Cognitive science Idea
13. Write a C Program to simulate Approximate maximum entropy learning in MRFs
14. Write a C Program to simulate Graphical models, exponential families, and vibrational
inference
15. Write a C Program to simulate to Stochastic vibrational inference and Variation auto-
encoder
16. Write a C Program to simulate MAP inference, linear programming relaxations, dual
decomposition
17. Write a C Programming to simulate Integer Programming for Bayesian Network
Structure Learning
TECHNICAL ELECTIVES
Course CREDITS
Course Code Course Name
Category L T P C
CSE 321 Human Computer Interaction TE 3 0 0 3
UNIT I: FOUNDATIONS OF HCI

The Human: I/O channels – Memory – Reasoning and problem solving - The computer:
Devices – Memory – Processing and networks - Interaction: Models – frameworks –
Ergonomics – styles – elements – Interactivity- Paradigms.
UNIT II: DESIGN AND SOFTWARE PROCESS

Interactive design basics – Process – Scenarios – Navigation – Screen design – Iteration and
prototyping - HCI in software process – Software life cycle – Usability engineering –
Prototyping in practice – design rationale. Design rules – principles, standards, guidelines,
rules. Evaluation Techniques – Universal Design.
UNIT III: MODELS AND THEORIES

Cognitive models –Socio-Organizational issues and stake holder requirements –
Communication and collaboration Models-Hypertext, Multimedia and WWW.
UNIT IV: MOBILE HCI

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 V: WEB INTERFACE DESIGN

Designing Web Interfaces – Drag and Drop, Direct Selection, Contextual Tools, Overlays,
Inlays and Virtual Pages, Process Flow. Case Studies.
TEXTBOOKS
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer
Interaction”, Pearson Education.
2. Brian Fling, “Mobile Design and Development”, O’Reilly Media Inc. Bill Scott and
Theresa Neil, “Designing Web Interfaces”, O’Reilly.
Course CREDITS
Category
CSE 322 Advanced Computer Architecture TE 3 0 0 3
UNIT I: INSTRUCTION LEVEL PARALLELISM

ILP – Concepts and challenges – Hardware and software approaches – Dynamic
scheduling – Speculation - Compiler techniques for exposing ILP – Branch prediction.
UNIT II: MULTIPLE ISSUE PROCESSORS

VLIW & EPIC – Advanced compiler support – Hardware support for exposing parallelism–
Hardware versus software speculation mechanisms – IA 64 and Itanium processors–Limits on
ILP.
UNIT III: MULTIPROCESSORS AND THREAD LEVEL PARALLELISM

Symmetric and distributed shared memory architectures – Performance issues –
Synchronization – Models of memory consistency – Introduction to Multithreading.
UNIT IV: MEMORY AND I/O

Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time –
Main memory and performance – Memory technology. Types of storage devices –
Buses – RAID – Reliability, availability and dependability – I/O performance measures –
Designing an I/O system.
UNIT V: MULTI-CORE ARCHITECTURES

Software and hardware multithreading – SMT and CMP architectures – Design issues –
Case studies – Intel Multi-core architecture – SUN CMP architecture - heterogeneous
multi-core processors – case study: IBM Cell Processor.
TEXTBOOKS
1. John L. Hennessey and David A. Patterson, “Computer architecture – A
quantitative approach”, Morgan Kaufmann / Elsevier Publishers, 4th. edition, 2007.
REFERENCES
1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture: A
hardware/software approach”, Morgan Kaufmann /Elsevier Publishers, 1999.
2. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill,
New Delhi, 200
Course CREDITS
Category L T P C
CSE 323 Natural Language Processing TE 3 0 0 3
Natural Language Processing tasks in syntax, semantics, and pragmatics – Issues –
Applications – The role of machine learning – Probability Basics –Information theory –
Collocations -N-gram Language Models – Estimating parameters and smoothing – Evaluating
language models.
UNIT II: WORD LEVEL AND SYNTACTIC ANALYSIS

Word Level Analysis: Regular Expressions-Finite-State Automata-Morphological Parsing-
Spelling Error Detection and Correction-Words and Word Classes-Part-of Speech
Tagging. Syntactic Analysis: Context-free Grammar-Constituency- Parsing-Probabilistic
Parsing.
UNIT III: SEMANTIC ANALYSIS AND DISCOURSE PROCESSING

Semantic Analysis: Meaning Representation-Lexical Semantics- Ambiguity-Word Sense
Disambiguation. Discourse Processing: Cohesion-Reference Resolution- Discourse Coherence
and Structure.
UNIT IV: NATURAL LANGUAGE GENERATION AND MACHINE

TRANSLATION
Natural Language Generation: Architecture of NLG Systems- Generation Tasks and
Representations- Application of NLG. Machine Translation: Problems in Machine Translation-
Characteristics of Indian Languages- Machine Translation Approaches-Translation involving
Indian Languages.
UNIT V: INFORMATION RETRIEVAL AND LEXICAL RESOURCES

Information Retrieval: Design features of Information Retrieval Systems-Classical, Non-
classical, Alternative Models of Information Retrieval – valuation Lexical Resources:
WorldNet-Frame Net-Stemmers-POS Tagger- Research Corpora.
TEXTBOOKS
1. Daniel Jurafsky, James H. Martin, “Speech & language processing”, Pearson
publications.
2. James Allen, Natural Language Understanding. The Benajmins/Cummings Publishing
Company Inc. 1994. ISBN 0-8053-0334-0
3. Bird, Steven, Ewan Klein, and Edward Loper, Natural language processing with
Python: Analyzing text with the natural language toolkit, O'Reilly Media, Inc, 2009.
4. Manning, Christopher, and Hinrich Schutze. Foundations of statistical natural language
processing. MIT press, 1999.
REFERENCES
1. Pierre M. Nugues, “An Introduction to Language Processing with Perl and Prolog”,
Springer.
2. Cover, T. M. and J. A. Thomas, Elements of Information Theory, Wiley, 1991. ISBN
0-471-06259-6.
3. Charniak, E.: Statistical Language Learning. The MIT Press. 1996. ISBN 0-262-53141-
0.
4. Tom Mitchell, Machine Learning. McGraw Hill, 1997. ISBN 0070428077.
CREDITS
L T P C
CSE 324 Computer Graphics TE 3 0 0 3
Application areas of Computer Graphics, overview of graphics systems, video-display
devices,raster-scan systems, random scan systems, graphics monitors, and workstations and
input devices
Output primitives: Points and lines, line drawing algorithms, mid-point circle andellipse
algorithms. Filled area primitives: Scan line polygon fill algorithm, boundary-fill, and flood-
fill algorithms.
UNIT II:2-D GEOMETRICAL TRANSFORMS

Translation, scaling, rotation, reflection and shear transformations,matrix representations and
homogeneous coordinates, composite transforms, transformations between coordinate systems.
2-D Viewing: The viewing pipeline, viewing coordinate reference frame, window to view-port
coordinate transformation, viewing functions, Cohen-Sutherland andCyrus-beck line clipping
algorithms, Sutherland –Hodgeman polygon clipping algorithm.
UNIT III: 3-D OBJECT REPRESENTATION

Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-
spline curves, Bezier and B-spline surfaces. Basic illumination models, polygon rendering
methods.
3-D Geometric transformations: Translation, rotation, scaling, reflection and shear
transformations, composite transformations, 3-D viewing: Viewing pipeline,viewing
coordinates, view volume andgeneral projection transforms and clipping.
UNIT IV:VISIBLE SURFACE DETECTION METHODS

Classification, back-face detection,depth-buffer, scan-line,depthsorting,BSP-tree methods,area
sub-divisionand octree methods.
UNIT V:COMPUTER ANIMATION

Design of animation sequence,general computer animation functions, raster
animation,computer animation languages, key frame systems, motion specifications
TEXTBOOKS:
1. Computer Graphics with Virtual Reality System, Rajesh K.Maurya, Wiley
Dreamtech.
2. Computer Graphics, D. Hearn and M.P. Baker (C Version), Pearson Education
REFERENCES:
1. Computer Graphics Principle and Practice, J.D. Foley, A.Dam, S.K. Feiner, Addison,
Wesley
2. “Procedural elements for Computer Graphics”, David F Rogers, Tata Mc Graw hill,
2nd edition.
3. “Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
4. Principles of Computer Graphics”, Shalini, Govil-Pai, Springer.
Course CREDITS
Category L T P C
CSE 325 Advanced Data Structures and Algorithms TE 3 0 0 3
UNIT I: ADVANCED DATA STRUCTURES

Strategies for choosing the appropriate data structures-Heaps, AVL Trees (Search, Insertion,
Deletion, Red-Black Trees (Search, Insertion and Deletion), Splay Trees (Search, Insertion and
Deletion), B-trees, B+ Trees (Search, Insertion and Deletion), Fibonacci heaps, Data Structures
for Disjoint Sets, Augmented Data Structures.
UNIT II: GRAPHS & ALGORITHMS

Cut-sets, Connectivity and Separability, Planar Graphs, Isomorphism, Graph Coloring,
Covering and Partitioning, Topological sort, Max flow: Ford Fulkerson algorithm, max flow –
min cut, Dynamic Graphs, Few Algorithms for Dynamic Graphs, Union-Find Algorithms.
UNIT III: GEOMETRIC ALGORITHMS

Point location, Convex hulls and Voronoi diagrams, Arrangements, graph
connectivity, Network Flow and Matching: Flow Algorithms - Maximum Flow – Cuts -
Maximum Bipartite Matching - Graph partitioning via multi-commodity flow, Karger'r Min
Cut Algorithm, String matching and document processing algorithms.
UNIT IV: APPROXIMATION ALGORITHMS

Approximation algorithms for known NP hard problems - Analysis of Approximation
Algorithms. Use of Linear programming and primal dual, Local search heuristics. Parallel
algorithms: Basic techniques for sorting, searching, merging, list ranking in PRAMs and
Interconnection.
UNIT V: RANDOMIZED ALGORITHMS

Introduction, Type of Randomized Algorithms, Min- Cut, 2-SAT, Game Theoretic Techniques,
Random Walks. Online Algorithms: Introduction, Online Paging Problem, Adversary Models,
k-server Problem
TEXTBOOKS
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, The MIT Press, 2009.
REFERENCES
1. Sahni, Sartaj, Data Structures, Algorithms and Applications in C++, MIT Press (2005)
2. Roger Sedgewick and Kevin Wayne, Algorithms, Addison-Wesley Professional 2011.
3. Allan Borodin and Ran El-Yaniv: Online Computation and Competitive Analysis,
Cambridge University Press, 2005.
4. Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, “Algorithms”, Tata
McGraw-Hill, 2009.
5. RK Ahuja, TL Magnanti and JB Orlin, “Network flows: Theory, Algorithms, and
Applications”, Prentice Hall Englewood Cliffs, NJ 1993.
6. Rajeev Motwani, Prabhakar Raghavan: Randomized Algorithms, Cambridge
University Press, 1995.
7. Jiri Matousek and Bernd Gärtner: Understanding and Using Linear Programming,
2006.
Course CREDITS
Category L T P C
CSE 326 Distributed Operating Systems TE 3 0 0 3
UNIT I: FUNDAMENTALS
What is distributed operating system, issues in designing distributed operating system,
Computer networks: Lan, WAN technologies, communication protocols, internetworking,
Message passing: Issues in IPC by message passing, synchronization, buffering group
communication, case study.
UNIT II: REMOTE PROCEDURE CALLS

The RPC model, Implementing RPC, RPCs in heterogeneous environment, lightweight RPC,
case study. Distributed shared memory: General architecture of DSM systems, Design and
implementation issues of DSM, Consistency models, Replacement strategies, Advantages of
DSM.
UNIT III: PROCESS MANAGEMENT

Introduction, Process migration, Threads. Synchronization: Clock synchronization, event
ordering, Mutual exclusion, deadlock, Election Algorithms. Resource management: Global
scheduling algorithm, Task assignment, Load sharing and balancing approaches.
UNIT IV: DISTRIBUTED FILE SYSTEM

Desirable features of a good DFS, file models, file accessing models, file sharing semantics,
file caching schemes, file replication, fault tolerance, atomic transactions, Design principles,
Case study: Google DFS and Hadoop DFS.
UNIT V: NAMING
Desirable features of a good naming system, system-oriented names, object locating
mechanisms, human oriented names, name caches, naming and security. Security: potential
attacks, cryptography, authentication, access control, digital signatures, design principles.
1. Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall
of India, 2007.
2. Advanced Concepts in Operating Systems, MukeshSinghal and NiranjanShivratri,
McGrawhill publications, 2017
3. Andrew S. Tanenbaul, Maarten Van Steen, Distributed Systems, Principles and
Paradigms, Pearson publications, 2nd edition.
Course CREDITS
Category L T P C
CSE 420 Data and Web Mining TE 3 0 0 3
UNIT I: INTRODUCTION TO DATA MINING

What is data mining? Related technologies - Machine Learning, DBMS, OLAP, Statistics. Data
Mining Goals. Stages of the Data Mining Process, Data Mining Techniques, Knowledge
Representation Methods. Data Warehouse and OLAP: Data Warehouse and DBMS,
Multidimensional data model, OLAP operations .
UNIT II: DATA PRE-PROCESSING

Data cleaning. Data transformation, Data reduction. Data mining knowledge representation,
Attribute-oriented analysis. Data mining algorithms: Association rules: Motivation and
terminology, Basic idea: item sets, generating item sets and rules efficiently, Correlation
analysis.
UNIT III: DATA MINING ALGORITHMS

Classification, Basic learning/mining tasks, inferring rudimentary rules: 1R
algorithm, Decision trees, Covering rules. Data mining algorithms: Prediction, The prediction
task, Statistical (Bayesian) classification, Bayesian networks, Instance-based methods (nearest
neighbour), Linear models.
UNIT IV: WEB CRAWLING

Basic crawler algorithm, Focused crawlers, Topical crawlers, Web search: Web page pre-
processing, Inverted index, HITS algorithm, Page ranking algorithm, Leadership algorithm.
UNIT V: SOCIAL NETWORK ANALYSIS
Co-citation and bibliographic coupling, Community discovery. Web usage mining:
Recommender systems. Mining Twitter, Mining Face book, Mining Instagram.
1. Han, J., Kamber, M., & Pei, J. (2011). Data mining: Concepts and techniques (3rd ed.).
Morgan Kaufmann publications.
2. Introduction to Data Mining, Vipin kumar, Michael Steinbach, Pang-Ning Tan, Person
publications,2016
3. Mining the Web, Soumen Chakrabarti, Elseier publications, 2002
4. Web Data Mining, Bing Liu, Second Edition, Springer publications, 2011.
5. Mining the Social Web, Mathew A. Russel, Mikhail Klassen, Third edition, Oreily
publications, 2018.
Course CREDITS
Category L T P C
CSE 421 Complexity Theory TE 3 0 0 3
UNIT I: COMPUTABILITY
A recap of automata theory and the Church-Turing Thesis Computational models: Lambda
calculus, Turing machine Decidability Reducibility. The PCP problem & Mapping reducibility
The Recursion Theorem Definition of Information.
UNIT II: TIME COMPLEXITY

Measuring Complexity, Big-O and small-o notation, Analyzing algorithms. Complexity
relationships among computational models The Class-P, Examples The Class-NP, Examples
The P versus NP question NP-completeness The Cook-Levin Theorem Additional NP-
completeness Problems.
UNIT III: SPACE COMPLEXITY

Space complexity. Savitch's Theorem and NL. NL-completeness and log-space reductions.
From P-completeness to PSPACE-completeness. The Classes L and NL NL completeness, NL
equals coNL.
UNIT IV: INTERACTABILITY

Hierarchy Theorems Relativization Circuit Complexity.
UNIT V: ADVANCED TOPICS IN COMPLEXITY THEORY

Approximation Algorithms Probabilistic Algorithms Alternation Interactive Proof Systems.
TEXTBOOKS
1. Introduction to the Theory of Computation - Michael Sipser (Primary Textbook)
2. Computational Complexity - Arora Barak (Reference)
Course CREDITS
Category L T P C
CSE 422 Software Project Management TE 3 0 0 3
UNIT I: SOFTWARE MANAGEMENT & ECONOMICS

SDLC -waterfall model Conventional Software Management Performance Evolution of
Software Economics – Software economics Pragmatic software cost estimation Reducing
software product size Improving software processes Improving team effectiveness Improving
automation through software environment.
UNIT II: THE OLD AND THE NEW WAY OF PROJECT MANAGEMENT
The principles of conventional software engineering Principles of modern software
management, Transitioning to an iterative process Basics of Software estimation – Effort and
Cost estimation techniques COSMIC Full function points COCOMO-I COCOMO II A
Parametric Productivity Model - Staffing Pattern.
UNIT III: SOFTWARE MANAGEMENT PROCESS FRAMEWORK

Life cycle phases: Engineering and production stages, inception, Elaboration, construction,
transition phases. Artifacts of the process: The artifact sets, Management artifacts, Engineering
artifacts, programmatic artifacts Model based software architectures: A Management
perspective. Model based software architectures: Technical perspective Work Flows of the
process: Software process workflows Iteration workflows Checkpoints of the process: Major
milestones, Minor Milestones, Periodic status assessment.
UNIT IV: PROJECT ORGANIZATION AND PLANNING

Work breakdown structures Planning guidelines. The cost and schedule estimating process The
iteration planning process Pragmatic planning Line-of-Business organizations
Project organizations, Evolution of organizations Process automation - Automation building
Blocks The project environment.
UNIT V: PROJECT CONTROL AND PROCESS INSTRUMENTATION

The Seven-Core metrics: Management indicators The Seven-Core metrics: Quality indicators
Life-Cycle expectations, Pragmatic software metrics, Metrics automation Modern project
profiles Next generation software economics Modern process transitions.
TEXBOOKS/REFERENCES
1. Walker Royce, “Software Project Management”, 1st Edition, Pearson Education,
2006.
2. Bob huges, Mike cotterell, Rajib Mall “Software Project Management”, 6th Edition,
Tata McGraw Hill, 2017.
3. SA Kelkar, Software Project Management: A Concise Study, 3rd Edition, PHI, 2013.
4. Joel Henry, Software Project Management: A Real-World Guide to Success, Pearson
Education, 2009.
5. Pankaj Jalote, Software Project Management in Practice, Pearson Education, 2015.
6. https://ocw.mit.edu/courses/engineering-systems-division/esd-36-system-project-
management-fall-2012/
7. https://uit.stanford.edu/pmo/pm-life-cycle
Course CREDITS
Category L T P C
CSE 423 Multimedia TE 3 0 0 3
UNITI: INTRODUCTION TO MULTIMEDIA

What is Multimedia, Multimedia and Hypermedia, Overview ofMu1timedia Software
Tools Graphics and Multimedia Data Representations: Graphics Image Data Types, File
Formats, and representation (image, video, and sound).
UNITII: COLOUR IN IMAGE AND VIDEO

Color Science, Color' Models in Images, Color Models in Video, Fundamental Concepts in
Video, Analog Video, Digital Video Basics of Digital Audio: Digitization of Sound, MIDI:
Musical Instrument Digital Interface Quantization and Transmission of Audi.
UNIT III: LOSSLESS COMPRESSION ALGORITHMS

Basics of Information Theory, Run-Length Coding, Variable-Length Coding, Dictionary-
Based Coding, Arithmetic Coding, Lossless Image Compression Lossy Compression
Algorithms: Distortion Measures, The Rate-Distortion Theory Quantization, Transform
Coding, Wavelet-Based Coding, Embedded Zerotree of Wavelet Coefficients.
UNITIV: IMAGE COMPL'ESSION STANDARDS

The JPEG Standard, The JPEG2000 Standard, The JPEG-LS Standard, Bilevel Image
Compression Standards.
Basic Video Compression Techniques: Introduction to Video Compression, Video
Compression Based on Motion Compensation, Search for Motion Vectors, H.261, H.263.
Basic Audio Compression Techniques: ADPCM in Speech Coding, G.726 ADPCM,
Vocoders.
UNIT V: MPEG Video Coding I - MPEG-1 and 2

MPEG-1, MPEG-2 MPEG Video Coding 11- MPEG-4, 7, and Beyond: Overview
ofMPEG-4, Object-Based Visual Coding in MPEG-4, Synthetic Object Coding in MPEG-4,
MPEG-4 Part10/H.264, MPEG-7, H.265 MPEG Audio Compression: MPEG Audio,
Commercial Audio codes.
TEXTBOOKS
1. Fundamentals of Multimedia (FM), Ze-Nian Li, Mark S. Drew, in Prentice Hall,
2004 (Springer 2nd Edition, 2014 with additional author of Dr. Jiangchuan Liu).
2. Digital Multimedia by Chapman (DM), Nigel P./ Chapman, Jenny, in John Wiley &
Sons Inc, 2000 (3rd Edition, 2009).
REFERENCES
1. Multimedia: Making It Work, 9 Edition by Vaughan, Tay in McGraw-Hill, 2014.
2. Multimedia: Computing, Communications and Applications by Ralf Steinmetz in
Pearson Education, 2012.
3. Recent articles about multimedia (recommended at classes).
Course CREDITS
Category L T P C
CSE 424 Deep Learning TE 3 0 0 3
Overview of machine learning, linear classifiers, loss functions.
Introduction to Tensor Flow: Computational Graph, Key highlights, creating a Graph,
Regression example, Gradient Descent, Tensor Board, Modularity, Sharing Variables, Keras.
UNIT II: Activation Functions

Sigmoid, ReLU, Hyperbolic Fns, Softmax Perceptrons: What is a Perceptron, XOR Gate.
Artificial Neural Networks: Introduction, Perceptron Training Rule, Gradient Descent Rule,
vanishing gradient problem and solution.
UNIT-III: Convolutional Neural Networks

Introduction to CNNs, Kernel filter, Principles behind CNNs, Multiple Filters, problem, and
solution of under fitting and over fitting.
UNIT IV: Recurrent Neural Networks

Introduction to RNNs, Unfolded RNNs, Seq2Seq RNNs, LSTM, GRU, Encoder Decoder
architectures.
UNITV: Deep Learning applications

Image segmentation, Self-Driving Cars, News Aggregation and Fraud News Detection Natural
Language Processing, Virtual Assistants, Entertainment, Visual Recognition Fraud Detection,
Healthcare.
TEXTBOOKS
1. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
2. Josh Patterson, Adam Gibson, Deep Learning: A Practitioner's Approach, OReilly,
2017.
3. Gulli, Antonio, and Sujit Pal. Deep learning with Keras. Packt Publishing Ltd, 2017.
4. Buduma, Nikhil, and Nicholas Locascio. Fundamentals of deep learning: Designing
next-generation machine intelligence algorithms. " O'Reilly Media, Inc.", 2017.
REFERENCES
1. Bishop, C., M., Pattern Recognition and Machine Learning, Springer, 2006.
2. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
3. Golub, G., H., and Van Loan, C. F., Matrix Computations, JHU Press,2013.
4. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill
Education, 2004.
Course CREDITS
Category
CSE 425 Advanced Database Management Systems TE 3 0 0 3
UNIT I
Overview of the DBMS Introduction to DBMS implementation using Megatron 2000 database
system Data storage using main memory and hard disks Disk failures Recovery from disk
crashes Representing data elements: Record, Representing block and record address Variable
length data and records Record modifications.
UNIT II
Index structures: Indexes on sequential files Secondary indexes B-Trees Hash tables
Multidimensional indexes: Hash and tree like structures for multidimensional data Bitmap
indexes.
UNIT III
Query execution: Algebra for queries Introduction to Physical-Query-Plan Operators One-Pass
Algorithms for Database Operations Nested-Loop Joins Two-Pass Algorithms Based on
Sorting Two-Pass Algorithms Based on Hashing Index-Based Algorithms Buffer Management
Algorithms Using More Than Two Passes Parallel Algorithms for Relational Operations.
UNIT IV
The query compiler: Parsing Algebraic Laws for Improving Query Plans from Parse Trees to
Logical Query Plans Estimating the Cost of Operations Introduction to Cost-Based Plan
Selection Choosing an Order for Joins Completing the Physical-Query-Plan Selection.
UNIT V
Concurrency control: Conflict-Serializability View serializability Enforcing Serializability by
Locks Locking Systems with Several Lock Modes. An Architecture for a Locking Scheduler
Concurrency control by timestamps and validation Transactions that Read Uncommitted Data
Coping with system failures: Undo/Redo logging Protecting media failures
TEXTBOOKS
1. R. Ramakrishnan, J. Gehrke, Database Management Systems, McGraw Hill, 2004.
2. A. Silberschatz, H. Korth, S. Sudarshan, Database system concepts, 5/e, McGraw Hill,
2008.
REFERENCES
1. K. V. Iyer, Lecture notes available as PDF file for classroom use.
CREDITS
L T P C
CSE 426 Fog Computing TE 3 0 0 3
UNIT I: FOG COMPUTING

Limitation of Cloud computing, Differences between Cloud and Fog computing, what is Fog?
Advantages of Fog computing, Business Models, Architecture of Fog computing,
Opportunities and Challenges.
UNIT II: ADDRESSING THE CHALLENGES IN FOG RESOURCES

Introduction, Taxonomy and Characteristics, Resource Management Challenge, Optimisation
challenges, Miscellaneous Challenges, IoT and Fog: Introduction. Programming paradigms for
IoT+ Fog, Research challenges and Future Research Directions.
UNIT III: MANAGEMENT AND ORCHESTRATION OF NETWORK

SLICES IN 5G, FOG, EDGE, AND CLOUDS
Introduction, Background, Network Slicing in 5G, Network Slicing in Software-Defined
Clouds, Network Slicing Management in Edge and Fog, Future Research Directions:
Middleware for Fog and Edge Computing: Design Issues, Introduction. Need for Fog and Edge
Computing Middleware: Design Goals, State-of-the-Art Middleware Infrastructures, System
Model, Clusters for Lightweight Edge Clouds, Architecture Management – Storage and
Orchestration, IoT Integration, Security Management for Edge Cloud Architectures, Future
Research Directions.
UNIT IV: DATA MANAGEMENT AND ANALYSIS IN FOG COMPUTING

Introduction, Background, Fog Data Management, Future Research and Direction Motivating
Example: Smart Building, Predictive Analysis with Fog Torch, Survey of ML Techniques for
Defending IoT Devices, Machine Learning in Fog Computing, Future Research Directions.
UNIT V: CASE STUDIES

Case Study 1: Introduction, Human Object Detection, Object Tracking, Lightweight Human
Detection.
Case Study 2: Introduction, Data-Driven Intelligent Transportation Systems, Mission-Critical
Computing Requirements of Smart Transportation Applications, Fog Computing for Smart
Transportation Applications, Case Study 3: Intelligent Traffic Lights Management (ITLM)
System, Testing Perspectives.
TEXTBOOKS
1. Fog and Edge Computing, Rajkumar Buyya, Satish Narayana Srirama, Wiley
Publications, 2019.
2. Fog computing in the Internet of Things: Springer publications, 2018
REFERENCES
1. Research papers from IEEE, ACM, Springer and Elsevier)
Course CREDITS
Category L T P C
CSE 427 Parallel Algorithms TE 3 0 0 3
UNIT I
Sequential model need of alternative model, parallel computational 8 models such as PRAM,
LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle Computers, Tree model,
Pyramid model, Fully Connected model, PRAM-CREW, EREW models, simulation of one
model from another one.
UNIT II
Performance Measures of Parallel Algorithms, speed-up and 8 efficiency of PA, Cost-
optimality, an example of illustrate Cost- optimal algorithms- such as summation, Min/Max on
various models.
UNIT III
Parallel Sorting Networks, Parallel Merging Algorithms on on 8 CREW/EREW/MCC, Parallel
Sorting Networks CREW/EREW/MCC/, linear array.
UNIT IV
Parallel Searching Algorithm, Kth element, Kth element in X+Y on 8 PRAM, Parallel Matrix
Transportation and Multiplication Algorithm on PRAM, MCC, Vector-Matrix Multiplication,
Solution of Linear Equation, Root finding.
UNIT V
Graph Algorithms - Connected Graphs, search and traversal, 8 Combinatorial Algorithms-
Permutation, Combinations, Derangements.
TEXTBOOKS
1. M.J. Quinn, “Designing Efficient Algorithms for Parallel Computer”, McGrawHill.
2. S.G. Akl, “Design and Analysis of Parallel Algorithms” 3. S.G. Akl,” Parallel Sorting
Algorithm” by Academic Press
Course CREDITS
Category L T P C
CSE 428 Web Services TE 3 0 0 3
UNIT-I
Introduction to Service Oriented Architecture-Goals of service oriented architecture-
Introduction to services-The SOA Architectural Stack-Service Composition and Data Flow-
Data-Flow Paradigms-Composition Techniques
UNIT-II
Introduction to web services- History of webservices-Web services: communication stack-
Simple Object Access Protocol (SOAP)-Web Services Description Language (WSDL)-WSDL
Main Elements-Message Communication Model in SOAP/WSDL
UNIT-III
Web Services: REST or Restful Services-REST Design Principles-Web API Design for
RESTful Services-Data Services-Implementation of Data Services-XML Transformation and
Query Techniques-Consuming data via direct data access to the sources
UNIT-IV
Web Service Composition: Overview-Service Orchestration vs. Service Choreography-
Benefits of Web Service Composition-Web Service Composition Environment-Web Service
Composition: Control Flows-BPEL (Business Process Execution Language)-BPMN (Business
Process Model and Notation)-Web Service Composition: Data Flows-Data-Flow Paradigms
UNIT-V
Introduction to Service Component Architecture (SCA)-The SOA Integration Problem-
Overview of SCA-High-level overview of the assembly model-Application of SCA to Use
Case-SCA Runtime-Benefits of SCA
TEXTBOOKS
1. Paik, Hye-young, et al. Web Service Implementation and Composition Techniques. Vol.
256. Springer International Publishing, 2017.
2. Martin Kalin, Java Web Services: Up and Running, O’Reilly publishers, Second
edition, 2013.
Course CREDITS
Category L T P C
CSE 429 Advances in Data Mining TE 3 0 0 3
UNIT I
What is Data Mining, Compiling need of Data Mining, Business Data Mining, Data Mining
Tools. Data Mining Process, CRISP-DM, Business Understanding, Data Understanding, Data
Preparation, Modelling, Evaluation, Deployment. SEMMA, Steps in SEMMA Process,
Comparison of CRISP & SEMMA, Handling Data.
UNIT II
Association Rules in Knowledge Discovery, Market-Basket Analysis, Mining Frequent
Patterns, Associations, and Correlations, Apriori Algorithm, Pattern-Growth Approach for
Mining Frequent Itemsets, Mining Frequent Itemsets using Vertical Data Format, Mining
Closed and Max Patterns. Pattern Mining in Multilevel, Multidimensional Space, Constraint-
Based Frequent Pattern Mining, Mining High-Dimensional Data and Colossal Patterns, Mining
Compressed or Approximate Patterns.
UNIT III
Classification: Basic Concepts, Decision Tree Induction, Bayes Classification Methods: Bayes’
Theorem, Na¨ıve Bayesian Classification, Rule-Based Classification. Model Evaluation and
Selection, Techniques to Improve Classification Accuracy: Bagging, Boosting and AdaBoost,
Random Forests, Improving Classification Accuracy of Class-Imbalanced Data. Other
Classification Methods: Genetic Algorithms, Rough Set Approach, Fuzzy Set Approaches.
UNIT IV
Cluster Analysis, Partitioning Methods: k-Means: A Centroid-Based Technique, k-Medoids: A
Representative Object-Based Technique. Hierarchical Methods: Agglomerative versus
Divisive Hierarchical Clustering, Distance Measures in Algorithmic Methods, BIRCH:
Multiphase Hierarchical Clustering Using Clustering, Feature Trees, Chameleon: Multiphase
Hierarchical Clustering Using Dynamic Modelling, Probabilistic Hierarchical Clustering.
Density-Based Methods, Grid-Based Methods.
UNIT V
Outliers and Outlier Analysis, Outlier Detection Methods: Supervised, Semi-Supervised, and
Unsupervised Methods, Statistical Methods, Proximity-Based Methods, and Clustering-Based
Methods, Mining Contextual and Collective Outliers, Outlier Detection in High-Dimensional
Data. Mining Complex Data Types, Data Mining Applications, Social Impacts of Data Mining.
TEXTBOOKS
1. Data Mining Concepts and Techniques, Third Edition, by Jiawei Han, Micheline
Kamber, and Jian Pei.
2. Olson DL, Delen D. Advanced data mining techniques. Springer Science & Business
Media.
REFERENCES
1. Aggarwal CC. Data mining: the textbook. Springer. William
2. Machine Learning, 2nd edition, by Ethem Alpaydin.
OPEN
ELECTIVE
SEMESTER VII
SUBJECT SUBJECT TITLE CORE/ CREDITS
CODE ELECTIVE L T P C
ECE 417 Hardware Security OE 3 0 2 4
UNIT I: INTRODUCTION TO HARDWARE SECURITY

Overview and layers of a Computing System, Hardware Security vs. Hardware Trust, Attacks,
Vulnerabilities, and Counter measures, Conflict Between Security and Test/Debug, Quick
Overview of Electronic Hardware, System on Chip (SoC) Design and Test, System on Chip
(SoC) Design and Test, Printed Circuit Board (PCB): Design and Test, Printed Circuit Board
(PCB): Design and Test, Hands-on Experiment: Reverse Engineering Attacks.
UNIT II: HARDWARE ATTACKS: ANALYSIS, EXAMPLES, AND THREAT-I

HARDWARE TROJANS-
Hardware Trojan Structure. Modelling and examples. Hardware Trojans in FPGA Designs,
Hardware Trojans Taxonomy. Countermeasures Against Hardware Trojans. Hands-on
Experiment: Hardware Trojan Attacks. ELECTRONICS SUPPLY CHAIN-Security
Concerns. Trust Issues, Potential Countermeasures.
UNIT III: HARDWARE ATTACKS: ANALYSIS, EXAMPLES, AND THREAT-II

Hardware IP Piracy and Reverse Engineering: Hardware Intellectual Property (IP), Security
Issues in IP-Based SoC Design, Security Issues in FPGA. Hands-on Experiment: Reverse
Engineering and Tampering. Hands-on Experiment: Reverse Engineering and Tampering.
Side-channel attacks: Background on Side-Channel Attacks, Power Analysis Attacks,
Electromagnetic (EM) Side-Channel Attacks, Fault Injection Attacks, Timing Attacks, Hands-
on Experiment: Side-Channel Attack.
UNIT IV: COUNTERMEASURES AGAINST HARDWARE ATTACKS-I

HARDWARE SECURITY PRIMITIVES
Preliminaries, Common Hardware Security Primitives, Physical Unclonable Function-PUF
Preliminaries, PUF Classifications, PUF Quality Properties, Common PUF Architectures, PUF
Applications. True Random Number Generator-TRNG Preliminaries. TRNG Quality
Properties, Common TRNG Architectures, TRNG Applications. Design for Anti-Counterfeit,
Primitive Designs with Emerging Nano devices. Hands-on Experiment: Hardware Security
Primitives (PUFs and TRNGs).
UNIT V: COUNTERMEASURES AGAINST HARDWARE ATTACKS-II

Security and Trust Assessment, Security and Trust Assessment, Security and Trust
Assessment, and Design for Security. Security and Trust Assessment, and Design for Security.
Hardware Obfuscation Methods. Hardware Obfuscation Methods, PCB Authentication, and
Integrity Validation. System Level Attacks & Countermeasures
1. Swarup Bhuniaand Mark Tehranipoor, “Hardware Security: A Hands-on Learning
Approach”, 2019 Elsevier.
2. Debdeep Mukhopadhyay and Rajat Subhra Chakraborty, “Hardware Security:
Design, Threats, and Safeguards", CRC Press.
3. Ahmad-Reza Sadeghi and David Naccache(eds.): Towards Hardware-intrinsic
Security: Theory and Practice, Springer.
4. Ted Huffmireetal: Hand book of FPGA Design Security, Springer.
LIST OF EXPERIMENTS
1. Review Of Combinational, Sequential Circuits, Fsm Design Examples In Verilog
Hdl And/Or Cadence.
2. Design Of Combinational Trojans.
3. Design Of Sequential Trojans.
4. Vending Machine Design Or The Combinational Lock Design Example, Mount
Any Of The Hardware Trojans.
5. Demonstration Of Logic Obfuscation Techniques.
6. Demonstration Of Dpa Attack And Counter Measures.
7. Puf Circuit Design And Demonstration.
8. Trng Circuit Design And Demonstration.
ECE 418 Machine Learning OE 3 0 2 4
UNIT I
Introduction to machine learning, Supervised and Unsupervised Learning, Linear Regression,
Logistic Regression, Generalized Linear Models.
UNIT II
Gaussian Discriminant Analysis (GDA), Naive Bayes, Support Vector Machines, K-Nearest
Neighbor, Decision Trees, Random forest.
UNIT III
Clustering in Machine Learning, Different Types of Clustering Algorithm, K-Means
Clustering, Gaussian Mixture Models, Bias-variance trade off.
UNIT IV
Introduction to Neural Networks, Feed-forward Network, Gradient descent optimization,
Error Backpropagation, Evaluation of error-function derivatives, Efficiency of
backpropagation, under and over fitting.
UNIT V
Introduction to Convolutional neural network (CNN), Backpropagation in CNN, Sparse
Kernel Machines, Markov Chain Monte Carlo, Introduction to Reinforment learning.
TEXTBOOKS/REFERENCE
1. Christopher M. Bishop, "Pattern Recognition and Machine Learning" by Springer,
2007.
2. Tom M. Mitchell, "Machine Learning", First Edition by Tata McGraw-Hill Education,
2013.
3. EthemAlpaydin, "Introduction to Machine Learning" 2nd Edition, The MIT Press,
2009.
Fundamentals of Wireless
ECE 419 OE 3 0 2 4
Communication
UNIT I: INTRODUCTION TO WIRELESS COMMUNICATIONS

Physical Modelling for Wireless Channels, Input/output model of wireless channel, Time and
Frequency Coherence, Statistical Channel models. Time diversity, Antenna diversity.
Frequency diversity.
UNIT II: WIRELESS CHANNEL MODELING

Uplink/Downlink Fading channels, Doppler Fading, Jakes modelling, RMS delay spread,
Autocorrelation, SNR and BER Performance, Noise and Interference.
UNIT III: CDMA

Narrowband Cellular Systems, Wideband systems: CDMA, Wideband systems: OFDM,
AWGN channel capacity, Capacity of fading channels.
UNIT IV: MIMO, OFDM SYSTEMS

Introduction to MIMO, MIMO channel capacity, SVD and Eigen modes of MIMO Channel,
MIMO spatial multiplexing, MIMO diversity, Beamforming, OFDM, multicarrier modulation,
PAPR.
UNIT V: WIRELESS NETWORKS AND ADVANCED TOPICS

Spread spectrum, direct sequence spread spectrum, Wide Area Network, GSM, Long term
Evolution- Advanced, Wi-Fi, WiMAX.
LIST OF EXPERIMENTS
1. Rayleigh and Rician Channel Fading model.
2. Jakes Channel model.
3. Path loss model (Free space, Log distance and Log normal).
4. IEEE 802.11 wireless LAN
5. IEEE 802.16 Wi-Max
6. Filtered White Gaussian Noise.
7. MIMO Channel Capacity.
8. Tse, David, and Pramod Viswanath. Fundamentals of Wireless Communication.
Cambridge, UK: Cambridge University Press, 2005.
9. Rappaport Theodore S., Wireless Communications, Principles and Practice, 2/e,
Prentice Hall of India, 2003.
10. Goldsmith, Andrea. Wireless communications. Cambridge university press, 2005.
11. Haykin, S., Moher M., Modern Wireless Communications,1/e, Pearson Education,
2011.
CHE 201 Fundamentals of Nanoscience OE 3 0 0 3
UNIT-I: INTRODUCTION TO NANOSCIENCE AND NANOTECHNOLOGY

Definition of Nano. Types of nanostructure and properties of nanomaterials: One
dimensional, two-dimensional and three-dimensional nanostructured materials. Quantum
dots. Metal oxides, and composites materials. Mechanical, physical and chemical properties
of various nanoparticles.
UNIT - II: SYNTHESIS OF NANOMATERIALS

Synthesis of nanomaterial: top down and bottom up approaches. Chemical precipitation
method, Co-precipitation method, Chemical reduction method, Determination of molecular
mass- Osmometry (membrane and vapour phase). Sol-gel synthesis of nanoparticles. Using
reverse micelles process, Solvothermal synthesis, Thermolysis routes, Microwave heating
synthesis, Sonochemical synthesis, Electrochemical synthesis, Photochemical synthesis.
Chemical vapour deposition methods.
UNIT - III: CHARACTERIZATION TECHNIQUES – A

Absorption and Emission Spectroscopy: Nature of electromagnetic radiation and spectrum,
UV-Visible Spectroscopy, Atomic Absorption Spectroscopy (AAS), Fluorescence
spectroscopy. Surface Analysis: Introduction, instrumentation and sample preparation.
Introduction to Scanning Electron Microscopy (SEM), Transmission Electron Microscopy
(TEM), Atomic Force Microscopy (AFM), and Scanning Tunneling Microscopy (STM).
UNIT - IV: CHARACTERIZATION TECHNIQUES – B

Molecular Analysis: Raman spectroscopy, instrumentation and sample handling.
Comparison of Raman with IR spectroscopy.
Elemental Analysis: X-Ray Diffraction (XRD) analysis, Inductively Coupled Plasma Mass
Spectrometry (ICP-MS) analysis and X-ray photoelectron spectroscopy.
Thermal, Mechanical and Structural Analysis: Differential Scanning Calorimetry,
Thermogravimetric method,
Nano-indendation. Dynamic Light Scattering and Zeta potential analysis
UNIT - V: APPLICATIONS OF NANOMATERIALS

Nanophotonics: Optical luminescence and fluorescence from direct bandgap semiconductor
nanoparticles. Surface-trap passivation in core-shell nanoparticles. Carrier injection,
nanoparticle based electroluminescence; Application of nanoparticles in the display
industry.
Nanobiomaterials:
a) Diagnostic Nanobiomaterials: Intrinsic biocompatibility of nanoparticle in cellular
system - Nanobiomaterial as contrast agent, photosensitizer, degradable and non-degradable
polymers, and biocompatible polymer coated magnetic nanoparticles for MRI imaging, gold
and silver loaded bio-conjugated carbon nanotube and graphene for optical diagnostics and
imaging.
b) Therapeutic Nanobiomaterials: Nanobiomaterial as therapeutic agent - Targeted,
non-targeted delivery; controlled drug release; exploiting novel delivery routes using
nanoparticles, Cytotoxicity mechanisms and their potential use in therapy.
Nanomaterials for Energy Systems: Evolution of nanoparticles based solar cells. Thin films,
Cadmium telluridel, Copper indium gallium selenide solar cell, Gallium arsenide multi-
junction solar cell, Dye-sensitized solar cell, Quantum Dot Solar Cells (QDSCs), perovskite
solar cells.
TEXTBOOKS/REFERENCE BOOKS/OTHER READING MATERIAL

1. A.W. Adamson and A.P. Gast, Physical Chemistry of surfaces, Wiley Interscience,
NY 2004.
2. P.C Hiemen and R. Rajgopalam, Principle of colloid and surface Chemistry, NY
Marcel Dekker, 1997.
3. M. J. Rosen, Surfactant and Interfacial phenomena, Wiley Inter Science Publication,
NY 2004.
4. Processing & properties of structural nanomaterials ‐ Leon L. Shaw, Nano
chemistry: A Chemical Approach to Nanomaterials, Royal Society of Chemistry,
Cambridge UK 2005.
5. W. Gaddand, D. Brenner, S. Lysherski and G. J. Infrate (Eds), Handbook of
nanoscience, Engg. and Technology, CRC Press, 2002.
6. G. Cao, Naostructures and Nanomaterials: Synthesis, properties and applications,
Imperical College Press, 2004.
7. C. N. R. Rao, A. Muller, A. K. Cheetham (Eds), The chemistry of nanomaterials:
Synthesis, properties and applications, Wiley VCH Verlag Gmbh & Co, Weinheim,
2004.
8. Review and research articles, communications and notes published in international
journals (will be provided).
CHE 202 Renewable Energy OE 3 0 0 3
UNIT-I: INTRODUCTION TO ENERGY

Definition, units, and various forms of energy. First and Second laws of thermodynamics,
Conservation of energy. Flow diagrams of Energy, Conventional energy sources,
Sustainability, fossil fuels. Role of energy in economic development and social
transformation. Global energy production and utilization, impact on environment. Global
warming, Biological damage due to pollution. Importance of Renewable energy.
UNIT-II: SOLAR, WIND, AND TIDEL ENERGIES

Solar Energy: Introduction. Spectral distribution of radiation, Photons, Photovoltaic effect.
Solar Cells: Advantages and applications of Solar cells, Solar cooker, Solar water heating
systems. Introduction of wind energy, principle of wind energy conversion. Applications of
wind energy, advantage and disadvantages of wind energy. Blue economy: Principle of
ocean thermal energy conversion. Energy from tidel waves, advantages and disadvantages.
UNIT-III: HYDROGEN ENERGY

Hydrogen gas, different methods to generate hydrogen gas: electrolysis of water and
Methane reforming. Advantages hydrogen as fuel. Challenges of hydrogen storage and
transportation. Hydrogen storage methods. Hydrogen storage systems: metal hydrides and
Metal organic frameworks. Fuel Cells: Types of fuel cells
UNIT-IV: BIOMASS ENERGY

Difference between biomass and other fossil fuels. Conversion of biomass into methanol.
Conversion of biomass into ethanol: Fisher-Tropsch Reaction, disadvantages of biomass.
UNIT-V: ENERGY STORAGE DEVICES

Energy Density and Power Density. Classification of Energy Storage systems.
Electrochemical Cells, Primary and Secondary Batteries. Introduction to Super capacitors.
Dry Cells, Li-ion Batteries and Beyond.

1. Energy Sources: Fundamentals of Chemical Conversion processes and Applications
by B. Viswanathan, Elsevier, 2016.
2. Renewable Energy: Power for a Sustainable Future, Godfrey Boyle. Oxford
3. Renewable Energy Resources Third Edition by John Twidell and Tony Weir, 2015.
4. Ru-shiliu, Leizhang, Xueliang sun, “Electrochemical technologies for energy
storage and conversion”, Wiley Publications, 2012.
PSY 111 Psychology for Everyday Living OE 4 0 0 4
UNIT I: MYTHS AND MISCONCEPTIONS IN PSYCHOLOGY

Definition, nature and goals of psychology, Common myths and misconceptions about
psychology, Schools of psychology; Basic and applied areas of psychology
UNIT II: THE ROLE OF PERCEPTION AND ATTITUDE TOWARDS

UNDERSTANDING THE WORLD
Perception: Understanding perception, Gestalt laws of organization, common illusions,
Perceptual constancy - depth perception, size perception, perception of movement, Attitude
formation, Attitude change.
UNIT III: INTELLIGENCE AND LEARNING

Definitions and nature of intelligence, Emotional and social intelligence; Measuring IQ, EQ
and SQ, Fundamentals of learning and its applications, Memory techniques.
UNIT IV: UNDERSTANDING THE SELF

Definition; Approaches to personality – trait and type, Psychoanalytical and humanistic
theory, Tests of personality – MBTI and NEO-PI, Identity; Self-concept, self-esteem and
self-efficacy.
UNIT V: STRESS, COPING AND QUALITY OF LIFE

Nature, sources of stress and its reactions, Factors influencing stress, Coping with and
managing stress - cognitive and behavioral techniques, Improving quality of life.

1. Baron, R. A. (2001). Psychology. New Delhi: Pearson Education India.
2. Nolen-Hoeksema, S., Fredrickson, B.L. & Loftus, G.R. (2014).Atkinson &Hilgard's
Introduction to Psychology.16th Ed. United Kingdom: Cengage Learning.
3. Morgan, C. T., King, R. A., & Schopler, J. (2004). Introduction to Psychology. New
Delhi: Tata McGraw Hill.
HIS 100 Idea of India OE 4 0 0 4
UNIT I: THE NATION AND ITS MANY ROOTS

What is a Nation? –Theories of Nationalism, The many names of India: India, Hindia,
Aryavarta Or Bharat, Mother India: Iconising a Nation
UNIT II: UNEARTHING THE PAST

The Evolutionary Past: Interbreeding Vs Replacement Theory, Out of Africa Theory, What is
a civilization? Theories of Civilization, Indus Valley Civilization
UNIT III: STORIES OF GODS AND PEOPLE

The Emergence of Myths, Myth Vs Reality, Vedic Age in India, Tribes, Caste and Battles.
UNIT IV: POLITY AND GOVERNANCE

Religion, Economy and the State –Asoka, Chankya and the Buddha, Land the Economy:
Exploring the Arthasastra, Social Order and the State: Through the Epics, Two millennia of
pluralism: Jews, Christians and other religions in India.
UNIT V: TOWARDS UNDERSTANDING THE NATION

The Mughals in India, Multiple Identities – the same heritage, The Past as a Signifier
TEXTBOOKS
1. Y. N.Harari, A Brief History of Humankind, Harper, 2015.
2. Upinder Singh, A History of Ancient and Early Medieval India, Pearson, 2009.
3. Romila Thapar, Early India: From the Origins to AD 1300, University of California
Press, 2004.
HIS 102A Human Civilizations OE 4 0 0 4
UNIT I
What is Civilisation? Stages of Human evolution; African Origins of Humanity; overview of
Hominin evolution: Sexual dimorphism, Development of Language: Patterns of lithic
technological development, and stone tool technology, gathering and hunting in human
evolution- social and economic structure.
UNIT II
Climate change and end of Ice- Age, towards the Mesolithic period and extension of settlement
in new ecological zones, changes in subsistence strategies based on the case studies from West
Asia, Europe and Meso America; changes in tool manufacture and social organisation.
Neolithic Period: Origin of food production; Gender Division of Labour; early farming
settlements at Catal Hyuk, Abu Hureya, Jericho, Syria and Jordan; early farming societies in
Europe, Asia and the Nile Valley; Neolithic sites, art and architecture; Domestication of
animals; burial customs and belief.
UNIT III
Discovery of metals, science of forging metals, development of writing system; Tigris and
Euphrates river valley: Emergence of Cities. Urban Revolution: Ancient Egyptian Civilisation,
Private life in ancient Egypt; Minion Civilisation of Crete, Eastern Mediterranean World,
Gender in the Mediterranean, Harappan Civilisation, Origin of Chinese Civilisation.
UNIT IV
Nomadic Pastoralism; pastoral people of middle east; pastoralism in central Asia: Horse, wheel,
cart and chariot; impacts on the environment; socio- political interaction with the urban centres.
The advent of Iron- its origin and implications.
UNIT V
Ancient Greece; emergence of polis, Athens and Sparta, myth of arcadia. Slave Mode of
Production: Emergence of Slavery in ancient Greece, organization of production, nature of
classical urbanism, population and forms of slavery; Private life and ancient Greece. Hellenistic
Phase: Characteristic features of Hellenism, cities and rural world, art, and culture.
TEXTBOOKS
1. Amar Farooqui. Early Social Formations. Delhi: Manak Publications, 2001.
2. Bogucki, P. The Origins of Human Society. Massachusets and Oxford: Wiley Blackwell
Publishers,1999
3. Fernand Braudel, The Mediterranean in the Ancient World, Penguin, 2007
4. R.J Wenke Pattern in Prehistory: Humankind’s First Three Million Years, Oxford
5. Redman, C.L. The Rise of Civilisations. From Early Farmers to Urban Society in the
Ancient Near East. San Fransisco: W.H. Freeeman 1978
6. V. Gordon Childe, What Happened in History, 1942.
CSE 311 Introduction to Machine OE 3 0 2 4
Learning
UNIT I- INTRODUCTION TO MACHINE LEARNING

Introduction, Different types of learning, Hypothesis space and inductive bias, Evaluation,
Training and test sets, Cross validation Linear Regression: Introduction, Linear regression,
Python exercise on linear regression.
UNIT II– DECISION TREE LEARNING

Introduction, Decision tree representation, Appropriate problems for decision tree learning,
The basic decision tree algorithm, Hypothesis space search in decision tree learning, Inductive
bias in decision tree learning, Issues in decision tree learning, Python exercise on Decision Tree
Instance based Learning: K nearest neighbor, The Curse of Dimensionality, Feature Selection:
System: Content based system, Collaborative filtering based.
UNIT III - PROBABILITY AND BAYES LEARNING

Bayesian Learning, Naïve Bayes, Python exercise on Naïve Bayes Support Vector Machine:
Introduction, The Dual formulation, Maximum margin with noise, Nonlinear SVM and Kernel
function, Solution to dual problem, Python exercise on SVM.

learning, Perceptron, Multilayer networks and the back-propagation algorithm, Python exercise
on neural network, Introduction to Computational Learning Theory: Introduction, Sample
complexity, Finite hypothesis space, VC dimension.

Introduction, Bagging and boosting, Introduction, K-mean clustering, Agglomerative
hierarchical clustering, Python exercise on k-mean clustering.
LIST OF LABORATORY EXERCISES

Basic exercises on Python Machine Learning Packages such as Numpy, Pandas and matplotlib
Given a dataset. Write a program to compute the Covariance, Correlation between a pair of
attributes. Extend the program to compute the Covariance Matrix and Correlation Matrix.
Given a set of sample points in N dimensional feature space. Write a program to fit the points
with a hyper plane using Linear Regression. Calculate sum of residual error.
set. Print both correct and wrong predictions. Python ML library classes can be used for
this problem.
4. Write a program to implement feature reduction using Principle Component Analysis.
data sets.
7. Write a program to implement perceptron for different learning task
8. Write programs to implement ADALINE and MADALINE for given learning task

CSE 205 Object oriented programming OE
3 0 0 3
with Java
UNIT I: OBJECT-ORIENTED THINKING
A way of viewing world – Agents and Communities, Messages and methods, Responsibilities,
Classes and Instances, Class Hierarchies- Inheritance, Method binding, Overriding and
Exceptions, Summary of Object-Oriented concepts, Java buzzwords, An Overview of Java,
Data types, Variables and Arrays, Operators, expressions, control statements, Introducing
classes, Methods and Classes, String handling. Inheritance– Inheritance concept, Inheritance
basics, Member access, Constructors, Creating Multilevel hierarchy, super uses, using final
with inheritance, Polymorphism-ad hoc polymorphism, pure polymorphism, Method
overriding, abstract classes, Object class.
UNIT II– STREAM BASED I/O(JAVA.IO)

The Stream Classes-Byte streams and Character streams, Reading console Input and Writing
Console Output, File class. Reading and writing Files, Random access file operations. The
Console class, Serialization, Enumerations. Auto boxing, generics.
UNIT III - EXCEPTION HANDLING

Fundamentals of exception handling, Exception types, Termination or presumptive models,
Uncaught exceptions, using try and catch, Multiple catch clauses, nested try statements, Throw,
throws and finally, built- in exceptions. Creating own exception sub classes,
Multithreading- Differences between thread-based multitasking and process-
based multitasking, Java thread model. Creating threads. Thread priorities, Synchronizing
threads. Inter thread communication
UNIT IV: THE COLLECTIONS FRAMEWORK (JAVA.UTIL)

Collections overview, Collection Interfaces, The Collection classes- Array List. Linked List,
Hash Set, Tree Set, Priority Queue, Array Deque. Accessing a Collection via an Iterator, Using
an Iterator, The For-Each alternative, Map Interfaces and Classes, Comparators, Collection
algorithms, Arrays, The Legacy Classes and Interfaces- Dictionary, Hashtable, Properties,
Stack, Vector More Utility classes, String Tokenizer, Bit Set, Date. Calendar, Random,
Formatter, Scanner.
UNIT V: GUI PROGRAMMING WITH SWING

Introduction, limitations of AWT, MVC architecture, Components, containers. Understanding
Layout Managers, Flow Layout, Border Layout, Grid Layout, Card Layout, Grid Bag Layout,
Event Handling- The Delegation event model- Events, Event sources, Event Listeners, Event
classes, Handling mouse and keyboard events, Adapter classes, Inner classes, Anonymous
Inner classes, A Simple Swing Application, Applets – Applets and HTML, Security Issues,
Applets and Applications, passing parameters to applets, Creating a Swing Applet, painting in
Swing, A Paint example, Exploring Swing Controls- JLabel and Image Icon, jText Field, The
Swing Buttons- JButton.JToggle Button, JCheck Box, JRadio Button, JTabbed Pane, JScroll
Pane, JList.JCombo Box, Swing Menus, Dialogs.
1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill
Education (India) Pvt. Ltd.
2. Understanding Object-Oriented Programming with Java, updated edition, T.
Budd, Pearson Education.
3. An Introduction to programming and OO design using Java, J. Nino and F.A.
Hosch, John Wiley & sons.
4. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
5. Object Oriented Programming through Java, P. Radha Krishna, Universities Press.
6. Programming in Java, S. Malhotra, S. Chaudhary, 2nd edition, Oxford Univ. Press.
7. Java Programming and Object-Oriented Application Development, R. A.
Johnson, Cengage Learning.
CSE 205 L Object oriented programming OE
0 0 2 1
with Java Lab
DESCRIPTION OF EXPERIMENT
convenient. The class will have constructors. Write a function to read the values of the
class variables. The values of the variable will be stored in a FILE (text file). The values
will be stored in a structured format of your own choice.
2. Further, read the content of the FILE and display the content in an ordered form (First
Name, Last Name).
3. Concept Learning:
a. FILE manipulation
b. Use try catch blocks
c. Use multiple try catch block
d. Finally statement
4. Create a three classes named Student, Teacher, Parents. Student and Teacher class
inherits Thread class and Parent class implements Runnable interface. These three
classes have run methods with statements. The task of the teacher class of the
first assignment has to be synchronized.
5. Similarly, the other two classes should have run methods with few valid statements
under synchronized.
6. Create two classes named Student and Teacher with required data members. Assume
that the information about the Student and Teacher is stored in a text file. Read n and
m number of Student and Teacher information from the File. Store the information in
Arraylist of type Student and Teacher ArrayList<Student> and ArrayList<Teacher>.
Print the information of Teacher who taught OOPS and Maths. Use Iterator and other
functions of util in your program.
7. Watch any of the favorite movie of your choice (any language is fine, preferably
English). Create a Text file to store at least 10 meaningful dialogs from the movie and
store it in a text file. Process the file to remove the stop words (eg. the, is, was, …….)
and 1create another file to have clean text (word).
8. 51.Write a java program to create HashTable to act as a dictionary for the word
collection. The dictionary meaning of the words, including synonyms, etc has to be
displayed.
9. Create GUI for the above program to upload the dialog FILE, clean the FILE. The GUI
should take input from the user for invoking the dictionary for displaying dictionary
meaning.
choice.
the content in the test field.
12. Create two classes named Student and Teacher with required data members. Read the
information about the student and teacher using text fields. Use checkbox to choose the
option to feed either teacher information or student information. Store the information
about the Student and Teacher in a text file. Read n and m number of Student and
Teacher information from the File. Show in the GUI about a Teacher who taught two
subjects to a section. Develop at least one of the application (AWT problem) using
swing package.
13. Create a Window based applications using various controls to handle subject
registration for exams. Have a List Box to display the subject of semesters. Have one
more List box having subject codes. Have a combo box to select the Semester, which
will change the list of course and code in the list boxes. Display the subject registered
for the examination on the right side of the window.
choice.
the content in the test field. Develop at least one of the application (AWT problem)
using swing package.
16. Create a Window based application for displaying your photo album. Create a Frame
and Canvas. Change the border, foreground and background colors of canvas and other
controls. Have buttons to start the image show, pause the image show and end the image
show. Explore the options to play background music.
17. Create a Window application with menu bar and menu. The frame will also have a text
area with scroll bar. In the menu, have File related options. Open a file and its content
has to be displayed in the text area.
ECE 313 Microprocessors and OE
3 0 2 4
Interfacing
NIT I: 8086 MICROPROCESSOR

8086 architecture- Functional Diagram, Register Organization, Memory segmentation,
Memory addresses, physical memory organization, Signal descriptions of 8086-common
function signals, Minimum and Maximum mode signals, Read Write cycles, Timing diagrams,
Interrupt structure of 8086.
UNIT II: ASSEMBLY LANGUAGE PROGRAMMING OF 8086

Instruction formats, addressing modes, instruction set, assembler directives, Simple programs
involving logical, Branch and call instructions, Sorting, evaluating arithmetic expressions,
String manipulations.
UNIT III: PERIPHERAL INTERFACING WITH 8086 MICROPROCESSOR

8255 PPI, Keyboard, display controllers, Stepper motor, A/D & D/A Converter Interfacing with
8086 microprocessor, Static and Dynamic memories, Vector interrupt table, Interrupt service
routine, Introduction to DOS & BIOS interrupts, Programmable Interrupt Controller 8259,
DMA controller 8257 Interfacing with 8086 microprocessor.
UNIT IV: COMMUNICATION INTERFACE

Serial communication standards, serial data transfer schemes, 8251 USART architecture and
Interfacing, RS232, prototyping and trouble shooting.
UNIT V: INTRODUCTION TO MICROCONTROLLERS

Overview of 8051 microcontroller, Architecture, I/O ports and Memory organization,
addressing modes and instruction set of 8051, Simple programs.
TEXTBOOKS/REFERENCE
1. Ramesh S Gaonkar, “Microprocessor Architecture, Programming and Applications
with the 8085”, 6th edition, Penram.
2. D V Hall, “Microprocessors and Interfacing”, MGH, 2nd edition.
3. The 8051 Microcontroller, Kenneth. J. Ayala, Cengage Learning, 3rd Edition.
Fundamentals of Electrical OE
EEE 101 3 0 0 3
Engineering
UNIT I: BASIC CIRCUIT ANALYSIS

Ohm’s Law, Kirchhoff’s Laws, Concept of Node, Path, Loop, Branch, Mesh, Voltage and
Current Division, Ideal and Practical Voltage and Current Source, Dependent Voltage and
Current Sources, Source Transformations, Nodal Analysis - Presence of independent and
dependent voltage and current sources, The Super node - Presence of independent and
dependent voltage and current sources, Mesh Analysis and Super mesh - Presence of
independent and dependent voltage and current sources, Illustrative examples.
UNIT II: ELECTROMAGNETISM AND ELECTROSTATICS

Review of field around a conductor and coil, Magnetic flux and flux density, magneto motive
force and magnetic field intensity, reluctance, and permeability, Analysis of magnetic circuit
and basic analogy between electric and magnetic circuits, Faraday’s law of electromagnetic
induction, Fleming’s right hand and left-hand rule, Lenz’s Law, Statically and dynamically
induced EMF, Self-inductance, mutual inductance, and coefficient of coupling. Inductors in
series and parallel, Energy stored in magnetic field, Laws of Electrostatics, Electric field,
Composite dielectric capacitors, Capacitors in series and parallel, Energy stored in capacitors,
Illustrative examples.
UNIT-III: SINGLE-PHASE AC CIRCUITS

Basic Concepts Related to Generation of Sinusoidal AC Voltage, Definition and Numerical
values of Average Value, Root Mean Square Value, Form Factor and Peak Factor for sinusoidal
varying quantities, Steady State Analysis of Pure R, L, C Circuits, Steady State Analysis of RL
and RC Series Circuits with Phasor Diagrams, Steady State Analysis of RL and RC Parallel
circuits with Phasor Diagrams, Steady State Analysis of RLC Series and Parallel circuits with
Phasor Diagrams, Definitions of Real Power, Reactive Power, Apparent Power and Power
Factor, Concepts of Resonance, Illustrative examples.
UNIT IV: THREE PHASE CIRCUITS

Necessity and advantages of three phase systems, generation of three phase power, Definition
of Phase sequence, balanced supply, and balanced load. Relationship between line and phase
values of balanced star and delta connections, Power in balanced three phase circuits,
Measurement of power by two-wattmeter method, Determination of power factor using
wattmeter readings, Illustrative examples.
UNIT-V: DC MACHINES & SINGLE-PHASE TRANSFORMERS

DC machines: Operation of DC motor, Back EMF, Torque equation, Types of DC motors,
Series, Shunt, Separately Excited, Characteristics and Applications, Significance of back EMF,
Illustrative examples, Single Phase Transformers: Necessity of transformer, Principle of
operation and construction of single-phase transformers (core and shell types), EMF equation,
losses, various losses with respect to load.
TEXTBOOKSa/REFERENCE BOOKS
1. William H Hayt, J E Kemmerly and Steven M Durbin, “Engineering Circuit Analysis”,
McGraw Hill, 8th Edition, 2011.
2. Abhijit Chakrabarti, “Circuit Theory Analysis and Synthesis”, Dhanpat Rai & Co. 7th
Edition, 2017.
3. P S Bimbra, “Electrical Machinery”, 7th Edition, Khanna Publishers.
4. Charles K. Alexander and Matthew N.O. Sadiku, “Fundamentals of Electric Circuits”,
McGraw Hill Higher Education, Third Edition, 2005.
5. B.L. Theraja and A. K Theraja, “A Textbook of Electrical Technology”, S.Chand and
Co. Ltd., 2000.
JOU 406 Basics of Media and Nationalism OE 3 0 0 3
UNIT I – INTRODUCTION TO NATIONALISM

Primordial, Constructivist and Instrumentalist understandings, Imagined community, The
Invention of Tradition, Whose Imagined Community?
UNIT II – MEDIA AND THE PUBLIC SPHERE:

Habermasian Concept of Public Sphere, Agenda Setting, Print Capitalism,
UNIT III – MEDIA AND IDEOLOGY:

Introduction to Ideology, Ideological State Apparatus, Manufacturing Consent.
UNIT IV: REPORTING ON CASTE, GENDER

Caste and Media, Gender and Media.
UNIT V: EXPLORING MARGINALITIES: MEDIA AND THE NORTHEAST

Representation of NorthEast in national media, Ethnicity and diversity, NorthEast and the
Rhetoric of development.
TEXT BOOKS/REFERENCE BOOKS/OTHER READING MATERIAL

1. Dawisha, Adeed. (2002). Nation and Nationalism Antecedents to Contemporary
Debates. International Studies Review, 4 (1), 3-22.
2. Anderson, Benedict. (2006). Imagined Communities: Reflections on the Origin and
Spread of Nationalism. Verso.
3. Hobsbawm, Eric. (1983). Introduction: Invention Traditions. In Hobsbawm, Eric,
Ranger, Terence (Ed.) The Invention of Tradition. UK: Cambridge University Press
4. Chatterjee, Partha. (1993). The Nation and its Fragments-Colonial and Postcolonial
Histories (Princeton Studies in Culture/Power/History). Princeton: Princeton
University Press
5. McQuail, D. (2009) McQuail’s Mass Communication Theory, Vistar Publication: New
Delhi.
6. Prinsloo, Jeanne. (1999). Cheer the Beloved Country? Some Thoughts on Gendered
Representations, Nationalism and the Media. Agenda: Empowering Women for Gender
Equity. 40, 45-53.
7. Eccleshall, Robert. (1999). Political Ideologies: An Introduction. London: Routledge.
8. Jeffrey, R (2016). Media and Modernity, Communications, Women and the State in
India. Orient Blackswan.
9. Herman, E. S., & Chomsky, N. (1988). Manufacturing consent: The political economy
of the mass media. New York: Pantheon Books.
10. Kabi, K. H., Pattnaik, N. S. (2015). Media, Conflict and Peace in Northeast India.
Delhi: Vij Books
Entrepreneurship Lecture OE
IDEA 101 3 0 0 3
Series
COURSE SUMMARY:
The students will go through the fundamental learnings about entrepreneurship. What is
entrepreneurship, how to develop entrepreneurship mindset, how to identify the problems or
issues in the society and come up with ideas to solve those, how to convert a simple innovative
idea into a successful business proposal, what is the process of doing it and how to do it
effectively…Students will learn about the basic understanding … how to prepare financial
statements, how to design/evolve the marketing strategies, how to brand/advertise the product,
how to study competitors, study the market potential, explore the new market, go to market
strategies, long term vision, how to convince venture capitalist, how to develop and pitch your
idea in front of investors, how to file patents and protect intellectual property rights….all these
to be achieved through the constant interaction with budding entrepreneurs and faculty through
online interactions every week. Students will be required to come up with a business idea and
develop it through the week by week trainings by visiting entrepreneurs and faculty; and
present a complete business proposal at the end of the course. This can be done individually or
with a group of students (max 3)
GRADING POLICY:
Grades will be based on the weightage as shown below
Class participation/assignments every week (total 60%)- 5% every week- (12 weeks),
There will be review meeting of the progress on the proposal that you have come up with,
may be two times in the semester.
Final presentation – 40% (Individual students or groups (max 3 students per group)
should present their business proposal)
100% internal course (no exams)
IDEA 102 Design Thinking OE 3 0 0 3
DESCRIPTION
This course aims at introducing students to design thinking. Design thinking is a way of
working with user centered innovation methodologies to address problems where not all
knowledge is available at the outset, i.e. wicked or complex problems. Design thinking rests on
principles such as under empathy, framing the correct problem, divergent ideas to convergent
solution ideas, visualization and evaluation.
Design thinking has gained a lot of popularity in various industries and is an important contrast
to the more traditional linear ways of problem solving. It is arges to develop the creative
confidence of individuals and enable them to deal with wicked and complex problems through
innovative thinking.
The course is a blend of theory and practice to learn the basics of Design Thinking and does
not require any prerequisite. This course will be useful to understand a systematic approach to
solving complex problems and usage of tools that leads to innovation.
Outcomes & Goals
1. Understand the importance of Design Thinking
2. Empathise to understand deeper and define the problem statement
3. Identify skills and personality traits of successful problem solving.
4. Apply standard problem-solving heuristics to aid in problem solving.
5. Apply problem-solving techniques to programming activities.
6. Formulate and successfully communicate the solutions to problems
Prerequisites: Not required.

UNIT I INTRODUCTION TO DESIGN THINKING
What is Design Thinking and why is it popular? Innovative thinking, What is a wicked problem
and how can we solve it?, The design thinking stages overview.
UNIT II DESIGN THINKING - EMPATHISE

Power of Empathy, Probes for context mapping, Power of stories in building empathy for the
target group.
USER RESEARCH METHODS
Qualitative user research, Best practices of qualitative user research, Conducting ethical user
research, Basics of recruiting participants for user research.
UNIT III DESIGN THINKING – DEFINE/REDEFINE THE CHALLENGE

Define problem, Frame insights, Understand context.
UNIT IV DESIGN THINKING – IDEATE

Brainstorm and ideate, Divergence to Convergence, Creative confidence.
UNIT V DESIGN THINKING – PROTOTYPE & TEST

Prototype to product, Prototyping methods, Heuristic Evaluation.
PROJECT 1 (IN TEAMS)
Applying Design thinking, Empathy & Ideation principles & tools.
PROJECT 2 (IN TEAMS)
Applying Design thinking/Innovation principles and approach using specific tools.
STORYTELLING
Role of Storytelling in Design thinking o The course delivery method will be through online
platforms (Zoom is preferred due to the breakout rooms options) depend upon the requirement
of content and need of students. This will be an experiential learning throughout the course.
INSTRUCTIONAL METHOD
1. The course delivery method will be through online platforms (Zoom is preferred due to
the breakout rooms options) depend upon the requirement of content and need of
students. This will be an experiential learning throughout the course.
2. The internal evaluation will be done based on continuous evaluation of students in the
hands-on workshop assignments and classroom.
3. Practical examination will be conducted at the end of semester for evaluation of
performance of students in their given projects and also through questionnaire based
exam.
HIS 005 An Introduction to Gender OE 3 0 0 3
UNIT I – GENDER; THE BASICS

Biology and History, Introduction to Gender Theory, Gendered Practices.
UNIT II – GENDER AND PRE-HISTORY

From Apes to Women – Sexual Dimorphism, Were there no cavewomen?, From Hunter,
Gatherers to Cultivators
UNIT III – GENDER AND CIVILIZATION

Wives, Daughters and Daughters in laws, (Also, Husbands, Fathers, Sons and Warriors),
Women as the Other and Woman as Mother, Eunuchs, Effeminate men and Masculine Women,
The Politics of the Private, Women in Pre-modern India, Gender and Work in early societies.
UNIT IV: MYTHOLOGIES OF GENDER

Gendering religion, Devotion and dissent, The Burden of culture: Goddess, Queens and
Courtesans, Gender and Art.
UNIT V: – INTERSECTIONS, INTERVENTIONS AND INTERSTICES

The Power of Gender and the Gender of Power, Gendering Caste, Gender ,Class and Race
Sisterhoods ,Subversion and Rebellion.
1. V Geetha, Gender, Stree, 2002.

2. Uma Chakraborty, Gendering Caste Through a Feminist Lens, Sthree , 2003.
3. Scott, Joan Wallach, Gender and the Politics of History , Columbia University Press,
New York, 1999.
4. Betty Friedan, ‘The Problem that has No Name’, in Betty Friedan , The Feminine
Mystique, W.W.Norton &Company, 2013.
5. Joan M Gero and Margret W Conkey, eds., Engendering Archaeology; Women and
Prehistory, Blackwell, Oxford , 1991.
6. Yuval-Davis, Nira, Gender and Nation, Sage, London, 1997.
7. Roy, Kumkum, ed., Women in Early Indian Societies, Manohar, 1999.
8. Nanda, Serena, ‘Neither man nor women: the hijras of India.’ Gender in Cross-Cultural
Perspective, 3rd ed. by Caroline B Brettell (ed). Carolyn F Sargent (ed)., Prentice Hall.
New Jersey, 2001.
9. Fausto-Sterling, Anne, "The Five Sexes: Why Male and Female Are Not Enough", The
Sciences 33, no. 2 1993.
10. Fausto-Sterling, Anne, "The Bare Bones of Sex: Part I – Sex and Gender, Signs, 30(2),
2005.
11. Hiltebeitel, Alf and Erndl, Kathleen, eds., Is the goddess a feminist?: the politics of
South Asian goddesses, Sheffield Academic Press, 2000.
CHE 123 Polymer Materials OE 4 0 0 4
UNIT-I: INTRODUCTION TO POLYMERS

Nomenclature and classification of polymers. Types of polymers- linear, branched, crosslinked,
ladder, thermoplastic, thermosetting, fibres, elastomers, natural polymers, addition and
condensation polymers. Stereoregular polymers- atactic, syndiotactic and isotactic. Step-
polymerization, Addition Polymers, Radical, Cationic, Anionic Living polymerization, Block
copolymers
UNIT-II: MOLAR MASS AND ITS DETERMINATION

Molecular mass and molar distribution. Number average, mass average, viscosity, average
molecular mass and relation between them. Molecular mass distribution. Determination of
molecular mass- Osmometry (membrane and vapour phase). Light scattering, gel permeation
chromatography. Sedimentation and ultracentrifuge, viscosity method and end-group analysis.
UNIT-III: PHYSICAL CHARACTERISTICS OF POLYMERS

Morphology and order in crystalline polymers. Configuration of polymer chains, crystal
structure of polymers. Morphology of crystalline polymers, strain-induced morphology,
crystallization and melting. The glass transition temperature (Tg), relationship between Tg and
Tm, Effect of molecular weight, dilments, chemical structure, chain topology, branching and
cross linking. Methods of determination of glass transition and crystallinity of polymers.
Dendrimers, hyperbranched polymers, random branched polymers, branching density,
influence of branching on the melt, viscosity, rheological and thermal properties of polymers.
UNIT-IV: COMMERCIAL POLYMERS
Organic polymers: Commercial polymers, synthesis and application of polyethylene,
Cellulose Acetate, PMMA, polyamides, polyesters, Urea resins and epoxy resins. Functional
polymers: Fire retarding polymers Conducting polymers, biomedical polymers
UNIT-V: POLYMER APPLICATIONS

Polymer Rheology, Liquid crystalline polymers, Ring opening polymerization, Physical and
Reactive blends.
Nanocomposites and synthetic-natural fiber composites.
Concepts of conducting polymers and their applications in opto-electronics and sensors, one
and 3D dimensional polymeric materials.
1. Principles of Polymerization: G. Odian (2004) 4th edition, Wiley
2. Textbook of Polymer Science: F.W. Billmeyer Jr. (1984) 3th edition, John Wiley &
Sons.
3. Polymers: Chemistry and Physics of Modern Materials: J.M.G. Cowie rd (2007) 3th
edition, CRC Press
4. Review and research articles, communications and notes published in international
journals (will be provided)
5. Polymer Science-V. Govarikar
6. Principle of Polymer Chemistry-P. J. Flory
7. An Outline of Polymer Chemistry-James Q. Allen
8. Organic Polymer Chemistry-K. J. Saunders.
PHY 302 Electrodynamics OE 3 0 2 4
UNIT I – MAGNETOSTATICS
Concept of magnetic field intensity (B) and flux, Definition and properties of magnetic
field, Definition of B and H, Calculation of divergence and curl of B with boundary
conditions, Lorentz Force law, motion of charged particles in electric and magnetic field,
Cyclotron frequency, Biot – Savart‟s law, Illustration with long straight conductor, current
carrying circular loop on the axis, Calculation of field on the Axis and in plane of a circular
current-carrying Coil, Helmholtz Coils, Magnetic moment of a current carrying loop, The
Permeability of Free Space, Ampère's Law –
worked examples, Force Between Two Current-carrying Wires, Problems based on magnetic
field and
Magnetostatics.
UNIT II – MAGNETISM AND MAGNETIC PROPERTIES

Magnetic Materials - An Overview, Magnetic moment, Bohr magneton, Magnetisation (M),
Magnetic Intensity (H) and magnetic induction (B) – their mathematical relations,
Magnetisation and Susceptibility and magnetic permeability of magnetic materials, Magnetic
field of magnetized objects and bound currents, Magnetic field due to a uniformly magnetized
sphere, Diamagnetic, paramagnetic and ferromagnetic, Explanation of Diamagnetic,
paramagnetic and ferromagnetic with the help of susceptibility and permeability Hysteresis
and B-H Loops, Problems on magnetism and its properties.
UNIT III - ELECTROMAGNETIC INDUCTION

Time varying fields: Faradays law of induction, worked examples, Mutual inductance,
coupled circuits and coefficient of coupling, Leakage inductance, impedance matching,
Transformer circuit, Reflected impedance transformation, equivalent circuit of a transformer,
Lenz's Law, Worked examples, Ballistic Galvanometer and the Measurement of Magnetic
Field, AC Generator, AC Power, 0 Linear Motors Generators, Rotary Motors, Generators,
Rotary Motors.
UNIT IV: ELECTRODYNAMICS

Generalization of Amperes‟ law, Problems on Amperes‟ law – worked examples, Maxwell‟s
equation, Maxwell‟s equation - Differential form, Maxwell‟s equation -Integral form,
Problems on Maxwell‟s equation, Magnetic Vector potentials, Retarded potential, Problems
on Magnetic potentials,
UNIT V: ELECTROMAGNETIC WAVES

Wave equation and plane waves in free space, Poynting theorem, Polarizations of plane wave,
Plane monochromatic waves in conducting media, Reflection from a conducting plane, Skin
effect, Absorption and scattering, Absorption and scattering of electromagnetic waves,
Anomalous dispersion, Problems on electromagnetic waves – worked examples.
TEXTBOOKS
1. University Physics with Modern Physics, Hugh D. Young, Roger A. Freedman, A
Lewis Ford, 13 Edition, 2013, Pearson India.
2. Electricity and Magnetism (In Si Units): Berkeley Physics Course - Vol.2 Edward
Purcell 2017, McGraw Hill Education
3. Introduction to Electrodynamics, David J. Griffiths, 4/e Edition, 2015, Pearson
Publication
REFERENCE BOOKS/OTHER READING MATERIAL
1. Classical Electrodynamics, John David Jackson, 3 Edition 2007, Wiley
2. Physics, Volume 2 David Halliday, Robert Resnick, Kenneth S. Krane, 5 Edition, 2001,
John Wiley & Sons
DESCRIPTION OF EXPERIMENTS
1. To study the magnetic field along the axis of a current carrying circular loop and
study the dependency of magnetic field on the diameter of coil
2. To calculate the magnetic flux induced by the falling
a. magnet as a function of the velocity of the magnet and measure induced
voltage impulse as a function of the velocity of the magnet
3. To investigate the spatial distribution of magnetic field between coils and
determine the spacing for uniform magnetic field
4. To demonstrate Dia-Para-Ferro magnetism in each material using an inhomogeneous
magnetic field
5. To study permeability curve of a given material.
6. To determine susceptibility of paramagnetic sample by using Quinck's tube method.
Books of Study & References

1. 1, K.G. Mazumdar and B. Ghosh, “Advanced Practical Physics” Sreedhar
Publishers,
Revised edition Jan 2004
2. 2, R.K. Shukla and Anchal Srivastava, “Practical Physics” New Age international
(P)
limited Publishers, 2006 [ISBN(13) – 978-81-224-2482-9]
3. 3, Michael Coey, “Magnetism and Magnetic Materials” Cambridge University Press,
2010
[ISBN: 9780511845000].
BIO 110 Microbiology OE 3 0 0 3
UNIT I - INTRODUCTION TO MICROBIOLOGY
History of microbiology, germ theory of diseases, Microbial diversity, classification &
taxonomy-Phylogenetic tree, Measuring diversity by 16S/18S rRNA, Measuring diversity by
RAPD, T-RFLP, Microbial physiology of bacteria, Microbial physiology of archaea, Microbial
physiology of fungi, Microbial physiology of protozoa, Microbial physiology of algae.
UNIT II – MICROBIAL GROWTH AND IDENTIFICATION

Growth media types - selective and differential media; Influence of environmental factors for
microbial growth; Nutritional groups of bacteria, Estimation of Microbes- Direct methods:
Microscopic count/CFU, turbidometric assay, total viable count (TVC); Indirect Methods: CO2
liberation, protein estimation, Growth phases and kinetics; Maintenance and Preservation of
cultures, Sterilisation and disinfection: Methods of sterilization- Physical methods (heat,
filtration), radiation and chemical methods, Microbial staining - Simple, gram staining,
negative staining, capsule staining, spore staining, flagellar staining, nuclear staining and
acid-fast staining, Microscopy – Principles, light microscope, phase contrast, dark field, bright
field, Fluorescent, interference microscope (stereo microscope), confocal, inverted microscope,
Electron microscope (TEM and SEM), Cryo-EM and Scanning probe microscopy.
UNIT III – MEDICAL MICROBIOLOGY

Bacterial pathogenesis, Mycobacterium tuberculosis, Escherichia coli, Staphylococcus,
Streptococcus, Salmonella.
UNIT IV: VIROLOGY

Viral structure and classification, Bacteriophage, Replication mechanism in host cells, Viral
pathogenesis; Immune response to viral infections, Acute, chronic and latent viral infections,
Viral vaccines; Anti-viral drugs.
UNIT V: APPLIED MICROBIOLOGY

Industrial microbiology – Microorganism of Industrial use, Industrial microbiology –
Microorganism of Industrial use, Industrial production of antibiotics - penicillin,
streptomycin;organic compounds- citric acid, lactic acid, acetone-butanol, Industrial
production of enzymes - amylases & proteases; nucleosides & nucleotides; amino acids - L-
glutamic acid, vitamin B12, Industrial production of single cell proteins, yeast/ mushrooms,
Fermentation processes, Industrial fermenters, Scale up, Food microbiology – Micro-
organisms in food: meats and poultry, processed meat, seafood, fermented daily products, fruits
and vegetables, Food microbiology – Micro-organisms in food: meats and poultry, processed
meat, seafood, fermented daily products, fruits and vegetables, Determination of micro-
organisms in food, Food preservation techniques, Environmental microbiology –
Bioaugmentation, bioremediation.
1. Microbiology. 5th Edition. Prescott M. Lansing, Harley P. John, Klein A. Donald.
151
2. Biotechnology-A textbook of Industrial Microbiology. 2nd Edition. Wulf Crueger and
Anneliese Crueger.
3. Modern food microbiology. 6th Edition. James M. Jay.
4. Environmental microbiology. 3rd Edition. Ian L. Pepper, Charles P. Gerba, Terry J.
Gentry.
5. Principles of Virology: Molecular Biology, Pathogenesis, and Control of Animal
Viruses. 2nd Edition. Jane S. Flint, Lynn W. Enquist, Anna Marie Shalka.
6. Bacterial Pathogenesis: A molecular approach. 3rd Edition. Brenda A. Wilson.
7. Fundamentals of light microscopy and electronic imaging. Douglas B. Murphy.
8. Introduction to Electron Microscopy. 2ndEdition. Saul Wischnitzer.
9. Single-Particle Cryo-Electron Microscopy: The Path Toward Atomic Resolution.
Selected Papers of Joachim Frank with Commentaries.
152
BIO 310 Biochemistry OE 3 0 0 3
UNIT I - CHEMISTRY OF LIFE

Chemical elements and bonding in living organisms, Buffers, Concepts of pH/pKa, Water and
its properties.
UNIT II – BIOMOLECULES
Carbohydrates: Structure, Classification and Function, Lipids: Structure, Classification and
Function, Nucleic acids: Composition, Types and their role in living systems, Vitamins and
their biological significance.
UNIT III – PROTEINS AND ENZYMES

Amino acids: structure, classification and properties, Proteins: Primary, Secondary, Tertiary
and Quaternary structures; Ramachandran plot, Protein folding: Protein denaturation and
renaturation, Protein folding pathways, folding accessory proteins, misfolding and disease,
Introduction to biocatalysts. Enzyme chemistry, classification and nomenclature, Mechanism
of enzyme action and factors affecting enzyme activity, Enzyme kinetics, catalytic and
regulatory strategies of enzymes, Inhibition of enzyme action.
UNIT IV: INTRODUCTION TO CELL BIOLOGY

Cell theory, Prokaryotic and Eukaryotic cells, Cell membrane and cellular organelles,
Cytoskeleton, Cellular transport.
UNIT V: CELL DIVISION CYCLE

Cell division- simple fission, budding, Mitosis and Meiosis, Cell cycle and regulation, CDKs,
Cell differentiation, Types of cells: with emphasis on neuronal cells.

1. D. Voet, J. G. Voet. Biochemistry. Wiley, 4thedition, 2010.
2. J. M. Berg, J. L. Tymoczko, L. Styrer. Biochemistry. W. H. Freeman & Co., 6thedition,
2006.
3. Harvey Lodish, Arnold Berk, Chris A. Kaiser, Monty Krieger, Matthew P. Scott,
Anthony Bretscher, Hidde Ploegh, Paul Matsudaira. Molecular Cell Biology. W. H.
Freeman, 6thedition, 2007.
4. Bruce Alberts. Molecular Biology of the Cell. Garland Science, 5th edition, 2008.
5. D. L. Nelson, M. M. Cox. Lehninger Principles of Biochemistry, W.H.Freeman, 5th
edition, 2009.
153
Evolution and Organismal OE
BIO 111 3 0 0 3
Biology
UNIT I: BIOLOGICAL DIVERSITY AND ORIGIN OF LIFE

Origin of life; Tree of life, Prokaryotic and eukaryotic organisms, Archaea- a group distinct
from bacteria and eukarya, Endosymbiotic theory of organelle biogenesis, Protozoa- the
unicellular eukaryotes Slime molds; Cyanobacteria and algal life forms, Diversity of plant life-
bryophyta, pterediophyta, gymnosperms and angiosperms (dicots and monocots)- a perspective
from alternation of generation and anatomy, Animal life- porifera, ctenophora, chidaria,
rotifers, platyhelminths, annelida, mollusca, nematoda, arthropoda, echinodermata and
chordata -a perspective from body plan, embryology and anatomy, Fungi- a group distinct from
pants and animals.
UNIT II – HISTORY OF LIFE ON EARTH

History of life on a geological time scale, Great oxygenation event, Paleontology and
paleobotany, Evolutionary radiation-Cambrian explosion as an example, Mass extinction
events in history, Taxonomy and biological classification, Specimen preparation and
preservation, Brief introduction to biorepositories and their purpose.
UNIT III – EVOLUTION

Theory of evolution by natural selection; A short discussion on Darwin’s “Origin of Species”,
The genetic and developmental basis of evolutionary change, Brief introduction to molecular
evolution; Species, speciation, migration, adaptation and inbreeding, Life history evolution;
Macroevolutionary trends; Experimental evolution, Modes of selection; Evolutionary
developmental biology; Evolutionary psychology, Extinction and human evolution;
Evolutionary medicine.
UNIT IV: MOLECULAR SYSTEMATICS AND PHYLOGENY

Methods and practices of molecular phylogenetics, Multiple sequence alignment; Clustering
and construction of phylogenetic tree, Rooted and un-rooted trees, Bootsrapping method,
Cladistics, The concept of phyla-monphylatic, polyphyletic and paraphylatic groups,
UNIT V: BRIEF INTRODUCTION TO ECOLOGY

Ecology of individual organisms - physiological ecology, Population ecology - population
growth and regulation, Species interactions, trophic interactions, Community ecology -
community structure and properties, Succession and disturbance, Ecosystem ecology,
Symbiosis, mutualism, parasitism and predation.

1. Principles of Biology: Interactive textbook from Nature Education.
2. Biology: N. Campbell and J. Reece (2005) 7 edition, Pearson, Benjamin, Cummings.
3. Biology: P.H. Raven, G.B. Johnson, J.B. Losos and S.R. Singer (2005) 7 edition,
McGraw Hill.
4. Evolutionary Analysis: S. Freeman and J.C. Herron (2007) Prentice Hall.
5. Evolution: D.J. Futuyma (1997) Sinauer Associates.
154
6. Ecology: from individuals to ecosystems: M. Begon, C.R. Townsend, thand J.L. Harper
(2006) 4 edition, Blackwell Publishing.
7. Ecology: R.E. Ricklefs and G.L. Miller (2000) 4 edition, W.H. Freeman.
155
MAT 304 Partial Differential Equations OE 4 0 0 4
UNIT I: MATHEMATICAL PRELIMINARIES AND FIRST-ORDER PARTIAL

DIFFERENTIAL EQUATIONS(PDES)
A Review of Multivariable Calculus, Essential Ordinary Differential Equations, Integral
Curves and Surfaces of Vector Fields, Solving Equations of the form: dx/P=dy/Q=dz/R,
Formation and classification of first-order PDEs, Linear, Quasilinear, and Nonlinear first-order
PDEs, The method of characteristics for the Cauchy problem, Compatible systems, and
Charpit’s method, Jacobi’s method for nonlinear first-order PDEs.
UNIT II: SECOND-ORDER PDES - FOURIER SERIES (FS)

Classification of Second-order PDEs, Canonical forms, Well-posed problems, Superposition
principle, Introduction to FS, Pointwise Convergence of FS for piecewise continuous functions,
Differentiation and integration of FS, Fourier cosine and sine series.
UNIT III: THE HEAT EQUATION

Derivation of the heat equation, The maximum and minimum principles, Uniqueness,
Continuous dependence, Method of separation of variables, Time-independent boundary
conditions, Time-dependent boundary conditions, Duhamel’s principle.
UNIT IV: THE WAVE EQUATION

Derivation of the wave equation, The infinite string problem, The D'Alembert solution of the
wave equation, The semi-infinite string problem, The finite vibrating string problem, The
method of separation variables, The inhomogeneous wave equation.
UNIT V: LAPLACE'S EQUATION

Basic concepts, Types of boundary value problems, The maximum and minimum principle,
Green’s identity and fundamental solution, The Poisson integral formula, The method of
separation of variables, The Dirichlet problem for the rectangle, The Dirichlet problem for
Annuli and Disk, The exterior Dirichlet problem.
UNIT VI: THE FOURIER TRANSFORM METHODS FOR PDES AND THE METHOD
OF GREEN’S FUNCTIONS
Fourier transform, Fourier sine and cosine transform, Heat flow problem in an infinite and
semi-infinite rod, Infinite string problem, Laplace equation in a half-plane, Integral
formulation, The method of Green’s functions for the Laplace, Heat and Wave equations.

1. NPTEL: Mathematics : Partial Differential Equations.
https://nptel.ac.in/courses/111/103/111103021/
2. Phoolan Prasad, Renuka Ravindran, Partial Differential Equations.
3. L. C. Evans, Partial Differential Equations.
4. V. I. Arnold, Lectures on Partial Differential Equations.
5. E. Kreyszig, Advanced Engineering Mathematics, Wiley.
6. I.N. Sneddon, Elements of Partial Differential Equations, Dover Publications.
156
Introduction to Science and OE
MAT 305 4 0 0 4
Technology studies
UNIT I: PHILOSOPHY OF SCIENCE: ISSUES AND PERSPECTIVES

What is science? Some Historical Background, Scientific reasoning- Induction, deduction and
the problem of Hume, Scientific Explanation and Causality, Popper’s Philosophy of Science,
Scientific Revolutions.
UNIT II: PERSPECTIVES FROM SOCIOLOGY OF SCIENCE AND TECHNOLOGY

Questioning Functionalism in the Sociology of Science, The strong program, The social
construction of Scientific and technological realities, Studying laboratories.
UNIT III: SCIENCE, TECHNOLOGY AND DEVELOPMENT: A CRITICAL

ENQUIRY
Medicine, Agriculture, Environment, War.
UNIT IV: EXCLUSIONS IN SCIENCE AND TECHNOLOGY INSTITUTIONS

Under presentation of women in Science and Technology Institutions in India and abroad,
Autobiographical Accounts, The Caste of Merit- excerpts.
UNIT V: FEMINIST AND OTHER CRITIQUES OF SCIENCE

The Mis-measure of Man IQ tests, Craniometry, Examples of how gender figures in doing
science, The Medical Construction of gender: The case of Intersex babies, Feminist
epistemologies of Science, Hidden Figures Movie

1. Samir Okasha (2003). Philosophy of science: A very short introduction.
2. Sismondo, S. (2010). An introduction to science and technology studies.
3. S G Kulkarni. Philosophy of Science: issues and Perspectives.
4. Mary Wyer et al (2000) Women Science and Technology.
5. Ajantha Subramanian (2018) The Caste of Merit.
6. Stefan Jay Gould The Mismeasure of Man.
7. Ashish Nandy Science Hegemony and Violence.
8. Gita Chadha and Asha Achuthan (Eds) Review of Women Studies, Economic and
Political Weekly.
9. Jayasree Subramanian (2007) Perceiving and Producing Merit: Gender and Doing
Science in India.
10. Sumi Krishna & Gita Chadha (Eds) Feminists and Science.
157
PHY 303 Solid-state Physics OE 3 0 2 4
UNIT I – CRYSTALLOGRAPHY
Crystalline and amorphous solids, Lattice, Basis, Translational vectors, Primitive unit cell,
Miller indices, Inter-planer distances, SC, BCC and FCC structures, Packing fraction, Crystal
structures- NaCl, diamond, CsCl, ZnS, Concept of reciprocal lattice and its properties with
proof. Ionic, covalent, molecular and metallic binding in crystalline solids, Cohesive
energies of ionic and metallic crystals, Anisotropy of physical properties of a single crystal,
defects in crystal structures Crystal as a grating, Bragg‟s law and Bragg‟s Diffraction
condition in direct and reciprocal lattice Ewald‟s construction, Debye Schrrerer method.
UNIT II – LATTICE VIBRATIONS AND SPECIFIC HEAT OF SOLIDS

Specific heats of solids, Normal mode of frequencies coupled vibrations of atoms,
Breakdown of classical theory, Linear chain frequency distribution function, Quantization of
harmonic vibrations, Phonons, Debye theories of specific heat of solids, Einstein theories of
specific heats of solids, Phonon vibration of diatomic linear lattice.
UNIT III - FREE ELECTRON THEORY OF METALS

Free Electron model, Energy levels and Density of orbital in 1D and 3D, Bloch function, Nearly
free electron model (NFE model), Fermi energy, Application of the Fermi-Dirac distribution,
Specific heat due to conduction electron, Para-magnetism, thermionic emission, Photoelectric
effect of metals, Origin of contact potentials between metals.
UNIT IV: BAND THEORY OF SOLIDS, ELECTRICAL AND THERMAL

CONDUCTIVITY
Band theory of solids, Band formation, Fermi-sphere, example of simple cubic lattice, Idea of
Brillouin zone, Density of states, overlapping on energy bands, Effective mass of electron (with
derivation), Concept of hole, Distinction between metal, semiconductor and insulator.
UNIT V: ELECTRICAL AND THERMAL CONDUCTIVITY IN SOLIDS

Simple theories of electrical and thermal conductivity, The Wiedemann-Franz law, Boltzmann
transport equation, Sommerfeld theory of electrical conductivity, Mean free path of electrons,
Temperature dependent resistivity of metals, Temperature dependent resistivity of
semiconductors,and insulators, Hall Effect in metals, Hall Effect in semiconductors.
TEXTBOOKS
1. Elementary Solid-State Physics, M Ali Omar, Revised Edition, 2015, Pearson.
2. Introduction to Solid State Physics, Charles Kittel, 8th edition, 2004, John Wiley &
Sons.
3. Solid State Physics Puri R.K., Babbar V.K – 1 Edition, 2010 S Chand Publication.
4. Solid State Physics, S O Pillai, 18th edition 2018, New Age International.
158
REFERENCE BOOKS
5. Solid State Physics, Neil W. Ashcroft, N. Mermin Reprint Edition, Brooks/Cole 1976.
6. Solid State Physics, A. J. Dekker, 2008, Laxmi Publication/Prentice Hall.
PRACTICLES
1. Measurement of resistivity of a semiconductor by Four-probe method and
determination of Energy Band Gap.
2. To determine the type of charge carrier, carrier density and Hall coefficient of a given
semiconductor.
a) To measure the photo current as a function of the irradiance at constant
voltage.
b) Current-voltage and current-load characteristics of a solar cell as a function of
the irradiance.
3. Study optical absorption of liquid samples using UV- VIS spectrometer.
4. Determine lattice parameter of crystals using X-ray diffractometer.
5. To study optical absorption of different nanoparticles and obtain their plasmonic peaks.

1. C. Suryanarayana, M. Grant Norton, ” X-Ray Diffraction, A Practical Approach”
Springer US, 1998 [ISBN: 978-1-4899-0148-4].
2. Trügler, Andreas, “Optical Properties of Metallic Nanoparticles”, Springer Series
in Materials Science, 2016 [ISBN: 978-3-319-25074-8].
3. John Singleton, “Band Theory and Electronic Properties of Solids” Oxford
University Press UK, 2014 [ISBN: 978-0198506447].
159
EGL 102 Technical Writing OE 4 0 0 4
UNIT-I
Sentence Structure (English), Paragraph Writing, Coherence, Cohesion, and Unity,
Construction of an Argument and Counter-Argument, Deducing a Conclusion,
UNIT-II
The Concept of ‘BASIC’ (Brief, Appropriate, Simple, Intelligible, and Complete), Writing Vs
Drafting, The process of ‘Technical’ writing, Difference between ‘General’ and ‘Technical’
writing (the nuances of technical writing),
UNIT- III
What is a Definition?, The process / structure of a Definition, What is a Description?, The
process / structure of a Scientific Description, Describing an Object, Describing a Process,
What is an Explanation?, The mechanism of writing an ‘Explanation’,
UNIT-IV
Synopsis, Research Proposal, Abstract Vs Summary, Referencing and Citations, Bibliography.
UNIT – V
Planning a Research Write-up, Structure of a Paper, Designing an effective Abstract,
Introduction Section, Discussion, Conclusion.

1. Dudley Evans, T. (1998). Developments in English for Specific Purposes: A
multidisciplinary approach. U.K: Cambridge University Press.
2. Hutchinson, T., & Waters, A. (1987). English for Specific Purposes: A learner-centered
approach. U.K: Cambridge University Press.
3. Jain, A. K. (2001). Professional Communication Skills. New Delhi: S. Chand &
Company Limited.
4. Raman, Meenakshi, and Sangeetha Sharma. (2008). Technical Communication:
English Skills for Engineers. New Delhi: Oxford University Press.
5. Raman, Meenakshi, and Sangeetha Sharma. (2004) Technical Communication:
Principles and Practice. New Delhi: Oxford University Press.
6. Trimble, Louis. English for Science and Technology - A Discourse Approach. (1985).
Cambridge: Cambridge University Press.
7. Williams, Phil. Advanced Writing Skills for Students of English. (2018). Brighton:
Rumian Publishing.
8. Wilson, Paige and Teresa Ferster Glazier. (2013). The Least You Should Know About
English: Writing Skills, Form C (11th Edition). Boston: Cengage Learning.
160
ME 407 Thermal Power Engineering OE 3 0 0 3
UNIT I – AIR STANDARD CYCLES

Carnot, Otto, Diesel, Dual and Stirling cycles, p-v and T -s diagrams, description, efficiencies
and mean effective pressures. Comparison of Otto and Diesel cycles. IC engine components,
their functions, engine performance and efficiency.
UNIT II – GAS POWER CYCLES

Gas turbine (Brayton) cycle; description and analysis. Regenerative gas turbine cycle.
Intercooling and reheating in gas turbine cycles. Introduction to Jet Propulsion cycles –
Turbojet, Turbofan, Turboprop, Afterburner and Rockets.
UNIT III – VAPOR POWER CYCLES

Carnot vapour power cycle, drawbacks as a reference cycle. Simple Rankine cycle; description,
T-S diagram, analysis for performance. Comparison of Carnot and Rankine cycles. Effects of
pressure and temperature on Rankine cycle performance. Actual vapour power cycles. Ideal
and practical regenerative Rankine cycles, open and closed feed water heaters. Reheat Rankine
cycle, Cogeneration, Combined Gas-Vapor Cycles, Binary Vapor Cycles, Characteristics of an
Ideal working fluid in vapour power cycles.
UNIT IV – STEAM GENERATOR

Boiler types, applications, and comparison; Boiler system requirements, Water Tube Boiler,
Fire Tube Boiler, Mountings and Accessories. Performance calculations, Boiler trial.
UNIT V - CONDENSER
Condenser system elements; types and their advantages/disadvantages; Its effect on Rankine
efficiency.
UNIT VI – STEAM TURBINE

Impulse and reaction turbine, velocity triangle, degree of reaction, efficiencies, losses, Velocity
and Pressure compounding.
TEXTBOOK
1. Thermodynamics, Yunus A, Cengel & Michael A Boles, Tata McGraw Hill, 7th
Edition. Engineering Thermodynamics P.K. Nag Tata McGraw Hill 6th Edition 2018
2. P. K. Nag, Powerplant Engineering, 2nd Ed., Tata McGraw Hill, 2002.
REFERENCE BOOKS
1. M. J. Moran & H N Shapiro, Fundamentals of Engineering Thermodynamics, 3rd Ed.,
John Wiley, 1995.
2. M. M. ElWakil, Power Plant Technology, McGraw Hill International, 1992.
161
OPEN ELECTIVE
SEMESTER VIII
162
CSE 411 Big Data Analytics OE 3 0 2 4
UNIT I
Big Data introduction - definition and taxonomy - Big data value for the enterprise - The
Hadoop ecosystem - Introduction to Distributed computing- Hadoop ecosystem – Hadoop
Distributed File System (HDFS) Architecture - HDFS commands for loading/getting data
- Accessing HDFS through Java program.
UNIT II
Introduction to Map Reduce framework - Basic Map Reduce Programming: - Advanced Map
Reduce programming: Basic template of the Map Reduce program, Word count problem-
Streaming in Hadoop- Improving the performance using combiners- Chaining Map Reduce
jobs- Joining data from different sources.
UNIT III
Querying big data with Hive - Introduction to Hive QL- Hive QL: data definition- data
manipulation
UNIT IV
Querying big data with Hive – Hive QL queries- Hive QL Views – Hive QL indexes
UNIT V
Data Analytics using R: Introduction to R, Creating a dataset, Getting started with graphs,
Basic data management, Advanced data management.
1. Big Data Fundamentals: concepts, Drivers and Techniques: Person Education, 2016
2. Hadoop The Definitive Guide, IV edition, O’Reilly publications
3. Hadoop in Action, Chuck lam, Manning publications
4. Programming, Hive, O’Reily publications
5. Apache Hive Cookbook, PACKT publications
6. R in Action, Robert I. Kabacoff, Manning publications
7. Practical Data Science with R, Nina Zumel John Mount, Manning publications

1. a. Hadoop Installation
b. Hadoop Shell Commands
2. a. Writing a file from local file system to Hadoop Distributed file system (HDFS)
b. Reading a file from HDFS to local file system.
3. a. Implementation of Word Count program using Map Reduce without combiner logic
b. Implementation of Word Count program using Map Reduce with combiner logic
163
4. Implementation of Map-Reduce program using partitioner
5. a. Implementation of Maximum temperature program using Map Reduce without
combiner logic
b. Implementation of Maximum temperature program using Map Reduce with
combiner logic
6. a. Create a managed table and load the data from LFS
b. Create a managed table and load the data from HDFS
c. Create an external table and load the data from LFS
d. Create an external table and load the data from HDFS
e.Drop a managed table and check the result in HDFS
f. Drop an external table and check the data from HDFS
7. Use HiveQL to analyse the stock exchange dataset and calculate the covariance
between the stocks for each month. This will help a stock-broker in recommending
the stocks to his customers.
8. a.create Hive table
b. Load data into Hive table
c. Calculate the covariance
9. Implement JOINS using HIVE
a. Inner Join
b. Left outer join
c. Right outer Join
d) Full outer join
10. Write a R program to create student record using Vector concept.
11. Write a R program to create medical patients status using data frame
i) Patient age ii) Gender iii) Symptoms iv) Patient Status
12. Write R program to visualize student marks of various subjects using Bar-chart and
Scatter plot.
164
165
CSE 202 Web Technology OE 3 0 0 3
UNIT I: WEB ESSENTIALS

Introduction to World Wide Web (WWW), Introduction to Communication Models., Web site
design principles, planning the site and navigation, Introduction to Hypertext Markup
Language (HTML) , Form design using HTML, Basics of Extensible Hypertext Markup
Language (XHTML), Basics of W3C Markup Validation Service.
UNIT II: CLIENT SIDE SCRIPTING

Introduction to Cascading Style Sheets (CSS), Style sheets in HTML, Introduction to Java
scripts, Syntax variables and data types in Java scripts, Operators in Java scripts, Arrays and
user defined functions in Java script, Java script objects.
UNIT III: HOST OBJECTS: BROWSERS AND THE DOM

Introduction to Document Object Model (DOM), Event objects and Event listeners, Mouse
events and Window events, Event propagation and dropdown menus, Event cancelling and
Form validation, Accommodating Noncompliant Browsers, Introduction to Server-Side
Programming, Architecture of Java servlets, Introduction to servlets, Parameter Data, Sessions,
Cookies, Rewriting and Servlet concurrency.
UNIT IV: REPRESENTING WEB DATA

XML-Documents and Vocabularies, XML Namespaces, Ajax in web development, Event
based parsing in XML, XPath and XSLT, Introduction to JSP, JSP and Servlets, Standard Tag
Library in JSP,
UINT V: WEB SERVICES

Web Servers (IIS, PWS and Apache), HTTP Request Types, Accessing Web Servers, Database
connectivity, Applets and Servlets, JDBC connectivity, JSP and Web development
Frameworks, Web development Frameworks, Application programming interface (API) for
Remote Procedure Calls (RPC), Simple Object Access Protocol (SOAP) and Representational
State Transfer (REST) APIs,

1. Deitel, Deitel and Nieto, Internet and Worldwide Web - How to Program, 5th Edition,
PHI,2011.
2. Jeffrey C.Jackson, "Web Technologies--A Computer Science Perspective", Pearson
Education.
3. Marty Hall and Larry Brown,”Core Web Programming” Second Edition, Volume I and
II, Pearson Education, 2001.
4. Kalin, Martin. Java Web Services: Up and Running: A Quick, Practical, and Thorough
Introduction. " O'Reilly Media, Inc.", 2013.
166
CSE 202L Web Technology Lab OE 0 0 2 1
PRACTICLES
1. Familiarize all the basic HTML tags.

2. Implement a static HTML personal webpage by using all the possible basic tags. [Each
student can develop his own bio-data page]
3. To create an html file to link to different html page which contains images, tables, and
also link within a page use Frames, Forms, etc. also.
4. Create an HTML file by applying the different styles using inline, external and internal
style sheets.
5. Create an html page to change the background color for every click of a button using
Java script.
6. write a Java script program to define a user defined function for sorting the values in
an array. Create an html page with 2 combo box populated with month & year, to
display the calendar for the selected month & year from combo box using javascript.
7. Develop a webpage with HTML and Java Script to read name and marks of five subjects
obtained for that particular student using forms. Further, it should compute the Grade
and display it as a message box.
8. Create a form to collects the name, email, user id, password and confirms password
from the user. All the inputs are mandatory and email address should be entered in
standard format. Also, the values entered in the password and confirm password
textboxes should be the same. For the security reasons make sure that the password
entered by the contains both small letters and capital letters, digits, special symbols
also. If the given password does not contain all these give an error message to the user.
After validating all the details using JavaScript display a message like “You have
successfully entered all the details”.
9. Design an XML document to store information about the student of SRM University
AP. The information must include Roll No, Name, Branch, Year of Joining, and email
id. Make up sample data for 3 students. Create a CSS style sheet and use it to display
the document.
10. Develop a registration form with various graphical user component interfaces like Text
boxes (Roll No), Text boxes (Name) option buttons (gender), Qualification (Check
boxes), State (Combo), etc. and store the information given by the user into a MySql
database using JSP.
11. Develop a webpage to display the details of a student. For this the user will enter Roll
Number in the text box given and the details of that particular student should be
retrieved from the database and display it on the same webpage. Use JSP to solve this
problem.
167
Computer Architecture and
ECE 324 OE 3 0 0 3
Organization
UNIT I: OVERVIEW OF REGISTER TRANSFER AND ALU DESIGN
Register transfer language, register transfer, Bus and memory transfer, Arithmetic micro-
operations, Logic micro-operations, Shift micro operations, Arithmetic logic shift unit.
UNIT II: ARITHMETIC UNIT

Addition and subtraction of signed numbers, Design of fast adders, Multiplication of positive
numbers, Integer division, Floating point numbers and operations.
UNIT III: COMPUTER DESCRIPTION

Instruction codes, Computer registers, Computer instructions, Instruction cycle, Memory-
references instructions, Input-output and interrupt, Complete computer description.
UNIT IV: CHANNEL CODING

Fundamental concepts, Execution of a complete instruction, Hardwired control, Micro
programmed control, Pipelining operation, Superscalar operation.
UNIT V: MEMORY ORGANIZATION

Memory hierarchy, Main memory, Cache memory, Virtual memory, Modes of data transfer,
Direct memory access.
TEXTBOOKS/REFERENCE
1. Carl Hamacher, ZvonkoVranesic, SafwatZaky, Computer Organization, 5/e, McGraw-
Hill, 2002.
2. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2000.
3. William Stallings, Computer Organization and Architecture, 6/e, Pearson Education
Asia, 2000.
4. David A. Patterson, John L. Hennessy, Computer Organization and Design: The
hardware / software interface, 3/e, Morgan Kaufmann, 2002.
John P. Hayes, Computer Architecture and Organization, 3/e, McGraw-Hill, 1998.
168
EEE 314 Nuclear Power Generation OE 3 0 0 3
UNIT I: INTRODUCTION TO NUCLEAR ENGINEERING

Why Nuclear power, atomic nuclei, atomic mass, atomic number, isotopes, Radioactivity and
radioactive change, rate of radioactive decay, mass energy equivalence, Binding Energy,
Release of Energy by Nuclear Reaction. Types of Nuclear Reactions, Nuclear Cross – section,
Nuclear Fission, Fission Chain Reaction, Fertile Materials and Breeding.
UNIT II: NUCLEAR REACTOR POWER GENERATION

Nuclear Power Systems, Classification of Nuclear Reactors, General Components of nuclear
reactors, Power of a nuclear reactor, Comparison of nuclear plants and thermal plants, India’s
3 stage Nuclear Power programme.
UNIT III: TYPES OF NUCLEAR REACTORS

Different types of reactors, Pressurized Water Reactor (PWE), Boiling Water Reactor (BWR),
CANDU (Canadian Deuterium Uranium) Reactor, Gas cooled reactor.
UNIT IV: NUCLEAR MATERIALS

Introduction, Fuels, Cladding and Structural Materials Coolants, Moderating and reflecting
materials, Control Rod and Shielding Materials.
UNIT V: NUCLEAR WASTE, DISPOSAL, AND SAFETY

Nuclear Radiation-Unit, Types of Nuclear Waste, Effects of nuclear radiation, Radioactive
waste disposal system, Personal Monitoring, Radiation Protection, Radiation Dose.
TEXTBOOKS/REFERENCE
1. P.K. Nag “Power Plant Engineering “, Tata McGraw Hill
2. R.K. Rajput “Power Plant Engineering “, Khanna Publishers
3. John R. Lamarsh & Anthony J. Baratta “Introduction to Nuclear Engineering”,
Pearson.
169
ECE 325 Digital Image Processing OE 3 0 0 3
UNIT I: FUNDAMENTALS OF IMAGE PROCESSING

Image acquisition, image sampling and quantization, Relationships between pixels, image
geometry, Gray level transformations, Histogram processing: histogram equalization,
Histogram specification, Color image processing: Color fundamentals, color models, Color
transformations, applications of image processing.
UNIT II: IMAGE TRANSFORMS

2-D DFT, properties. Walsh transform, Hadamard transform, discrete cosine transforms, Haar
transform, Slant transform, KL transform, Comparison of different transforms.
UNIT III: IMAGE ENHANCEMENT

(by spatial domain methods) Arithmetic and logical operations, point processing, Image
smoothing and sharpening filters in spatial domain, Enhancement: (by frequency domain
methods) Image smoothing and image sharpening filters in frequency domain. Homomorphic
filter, Comparison of filters in frequency domain and spatial domain.
UNIT IV: IMAGE COMPRESSION FUNDAMENTALS

Types of redundancy, Lossless compression: Variable length coding, LZW coding, Bit plane
coding, predictive coding-DPCM, Lossy compression: Transform coding, Basics of image
compression standards: JPEG, JPEG 2000, Basics of vector quantization.
UNIT V: IMAGE SEGMENTATION

Region based segmentation, Detection of discontinuities, Edge linking and boundary detection,
thresholding, Image Restoration: Degradation model, Estimation of degradation function,
Restoration in the presence of noise only, Restoration filters: Inverse filter, wiener filter,
Constraint least square filtering.
TEXTBOOKS/REFERENCE
1. R.C. Gonzalez, R.E. Woods, Digital Image processing, 3/e, Pearson Education, 2009.
2. Anil K. Jain, Fundamentals of Digital Image processing, Prentice Hall of India, 1989.
3. Rafael C. Gonzalez, Richard E. Woods, Steven L., Digital Image Processing using
MATLAB, Pearson Education, 2004.
4. William K. Pratt, Digital Image Processing, 3/e, John Wiley and Sons, 2004.
S. Jayaraman, S. Esakkirajan, T.Veerakumar, Digital Image Processing, Tata McGraw
Hill, 2011.
170
ECE 410 Adaptive Signal Processing OE 3 0 0 3
UNITI: ADAPTIVE SYSTEMS

Definition and Characteristics; areas of application; general properties, open- and closed-loop
adaptation; applications of closed-loop adaptation. Adaptive Linear Combiner: General
description, Input signal and weight vectors; desired response and error, The performance
function; gradient and minimum mean-square error, Alternative expression of the gradient;
decorrelation of error and input components.
UNITII: PROPERTIES OF THE QUADRATIC PERFORMANCE SURFACE

Normal form of the input correlation matrix; eigenvalues and eigenvectors of the input
correlation matrix, geometrical significance of eigenvectors and eigenvalues; (i) Searching the
Performance Surface, Methods of searching the performance surface; basic ideas of gradient
search methods, A simple gradient search algorithm and its solution; stability and rate of
convergence the learning curve; gradient search by Newton’s Method; Newton’s Method in
multidimensional space. gradient search by the Method of Steepest Descent; comparison of
learning curves.
UNITIII: GRADIENT ESTIMATION AND ITS EFFECT ON ADAPTATION

Gradient component estimation by derivative measurement, the performance penalty;
derivative measurements and performance penalties with multiple weights, variance of the
gradient estimate; effects on the weight-vector solution, excess mean-square error and time
constants, Mis adjustment; comparative performance of Newton’s and Steepest-Descent
Methods, Total mis adjustment and other practical considerations.
UNITIV: OTHER ALGORITHMS

Derivation of the LMS algorithm; convergence of the weight vector, An example of
convergence; learning curve, noise in the weight-vector solution; mis adjustment; performance,
normalized and other LMS-based adaptive filters, Discrete Kalman filter; recursive least
squares algorithm.
UNITV: APPLICATIONS
Applications: Adaptive Modeling and System Identification: General description, adaptive
modeling of a multipath communication channel, adaptive modeling in FIR digital filter
synthesis, Adaptive Interference Cancellation: Concept of adaptive noise cancelling, stationary
noise-cancelling solutions; effects of signal components in the reference input,
TERM PROJECT
Matlab implementation of the various learning algorithms with applications.
TEXTBOOKS/REFERENCE:
1. B. Widrow and S. D. Stearns, Adaptive Signal Processing, Pearson Education Asia,
1985.
2. M. H. Hayes, Statistical Digital Signal Processing and Modeling, John Wiley, 2002.
3. S. Haykin, Adaptive Filter Theory, 4th edition, Pearson Education Asia, 2002.
4. T Adali, S Haykin, Adaptive Signal Processing, Wiley-India, 2010.
5. Selected papers on adaptive signal processing and applications.
171
ME 228 Manufacturing Science OE 3 0 0 3
UNIT I: METAL CASTING PROCESS

Introduction to metal casting, Solidification of Metals, Characteristics of sand casting, Patterns,
Pattern allowances Pattern materials, Types of patterns, Molding materials, Molding sand
properties, Types of sand molds, Cores, Gating system, Casting Defects, Special casting
processes, Cast structures, Melting furnaces, Methods of Sand testing.
UNIT II: METAL JOINING PROCESS

Classification of joining processes, Welding technique, Different welding processes: Gas
Welding, Electric Arc Welding, Tungsten Inert-gas Welding (TIG), Gas Metal-Arc Welding
(GMAW), Plasma Arc Welding (PAW), Submerged Arc Welding (SAW), Resistance
Welding, Friction Stir Welding (FSW), Thermite welding, Electron Beam Welding (EBW),
Laser Beam Welding (LBW), Weld Defects.
UNIT III: BULK DEFORMATION PROCESS

Introduction to bulk deformation processes, Hot and cold working, Forging, Types of forging,
Forging defects, Rolling, Defects in rolled products, Extrusion, Metal flow in extrusion, Rod
drawing, Wire and Tube drawing, Swaging, Severe plastic deformation processes: Friction stir
processing, Equal channel angular extrusion and high pressure torsion.
UNIT IV: METAL REMOVAL PROCESS

Mechanism of metal cutting, Types of tools, Tool Geometry, Tool Signature, Orthogonal and
Oblique cutting, Mechanics of chip formation, Chip morphology, Tool wear and failure,
Machinability, Cutting-tool materials, Cutting fluids, Brief description of metal removal
processes: Turning, drilling, boring and Milling, Material removal rate and machining time.
UNIT V: POWDER METALLURGY

Production of metal powders, Particle size and shape, blending of metal powders, Compaction
of metal powders, Shaping processes, Sintering, Finishing operations, Design considerations
for powder metallurgy.
TEXTBOOKS:
1. Manufacturing Science, 2nd Edition, A. Ghosh and A.K. Mallik.
2. P.N. Rao, Manufacturing Technology, 3rd Edition, Tata McGraw Hill Edu Pvt Ltd,
2012.
172
REFERENCE BOOKS:
1. S. Nagendra Parashar and R.K. Mittal, Elements of Manufacturing Processes, PHI
Learning Pvt Ltd, 2011.
2. R.L. Timings, Manufacturing Technology, 2nd Edition, Pearson Edu Ltd, 2010.
3. Hajra Choudhury, Elements of Workshop Technology, Vol. I and II, Media Promotors
Pvt Ltd, 2001.
4. S.Gowri, P.Hariharan, and A.Suresh Babu, Manufacturing Technology I, Pearson
Education,2008.
5. Rajput R.K, A Text book of Manufacturing Technology, Lakshmi Publications, 2007.
173
ME 562 Mechanical Behavior of OE
3 0 0 3
Materials
COURSE OBJECTIVES
The central theme of this course is the mechanical behavior of engineering materials, such as
metals, ceramics, polymers, and composites, subjected to different types of loading. The main
objectives are to provide students with basic understanding of phase transformation by heat
treating and stress-induced hardening, linear and nonlinear elastic behavior, deformation under
multiaxial loading, plastic deformation and yield criteria, dislocation plasticity and
strengthening mechanisms, creep, stress concentration effects, brittle versus ductile fracture,
fracture mechanisms at different scales, fatigue, contact deformation, and wear.
DESIRED COURSE OUTCOMES

Understand various types of deformation and failure of engineering materials subjected to
various static and dynamic loadings. Correlate microscopic and macroscopic material
behaviors. Learn how to engineer the material properties to meet certain specifications.
Determine the safety factor for various possible failure modes and loadings. Obtain hands-on-
experience with standardized mechanical testing techniques and learn how to present/interpret
the measurements in a formal report.
UNIT I
Introduction, Structure property relationship. Elasticity, Isotropic/Anisotropic.
UNIT II
Viscoelasticity. Elastic-Plastic Deformation. Mechanical testing.
UNIT III
Heat Treatment. Strain Hardening. Strain Rate and Temperature Effects on Deformation. Slip,
Dislocations, Twinning, and Hardening.
UNIT IV
Ductile and Brittle Fracture. Fracture Mechanics. Creep. Fatigue. Cumulative Fatigue Damage.
Wear processes.
UNIT V
Special topics: Residual Stresses, Ceramics, Glasses, Polymers, Composites, Mechanical
Working, and Micromechanics
TEXTBOOKS
1. Meyers and Chawla, Mechanical Behavior of materials, Cambridge publication.
REFERENCE
1. N. E. Dowling, Mechanical Behavior of Materials, Prentice-Hall.
2. R.W. Hertzberg, Deformation and Fracture Mechanics of Engineering Materials, 4th
Ed., John Wiley & Sons, 1995.
174
PSY 111 Psychology for Everyday Living OE 4 0 0 4
UNIT I: MYTHS AND MISCONCEPTIONS IN PSYCHOLOGY

Definition, nature and goals of psychology, Common myths and misconceptions about
psychology, Schools of psychology; Basic and applied areas of psychology
UNIT II: THE ROLE OF PERCEPTION AND ATTITUDE TOWARDS

UNDERSTANDING THE WORLD
Perception: Understanding perception, Gestalt laws of organization, common illusions,
Perceptual constancy - depth perception, size perception, perception of movement, Attitude
formation, Attitude change.
UNIT III: INTELLIGENCE AND LEARNING

Definitions and nature of intelligence, Emotional and social intelligence; Measuring IQ, EQ
and SQ, Fundamentals of learning and its applications, Memory techniques.
UNIT IV: UNDERSTANDING THE SELF

Definition; Approaches to personality – trait and type, Psychoanalytical and humanistic
theory, Tests of personality – MBTI and NEO-PI, Identity; Self-concept, self-esteem and
self-efficacy.
UNIT V: STRESS, COPING AND QUALITY OF LIFE

Nature, sources of stress and its reactions, Factors influencing stress, Coping with and
managing stress - cognitive and behavioral techniques, Improving quality of life.

1. Baron, R. A. (2001). Psychology. New Delhi: Pearson Education India.
2. Nolen-Hoeksema, S., Fredrickson, B.L. & Loftus, G.R. (2014).Atkinson
&Hilgard's Introduction to Psychology.16th Ed. United Kingdom: Cengage
Learning.
3. Morgan, C. T., King, R. A., & Schopler, J. (2004). Introduction to Psychology.
New Delhi: Tata McGraw Hill.
175
MAT 355 Calculus of Variation OE 4 0 0 4
UNIT-I
Method of Variations in Problems with Fixed Boundaries
Introduction – Functionals, Variation and Its Properties, Euler's Equation, Functionals Dependent
on Higher-Order Derivatives, Variational Problems in Parametric Form, Some Applications.
UNIT-II
Variational Problems with Moving Boundaries
Elementary Problem with Moving Boundaries, One-Sided Variations.
UNIT-III
Sufficient Conditions for an Extremum
Field of Extremals, The Function 𝐸(𝑥, 𝑦, 𝑝, 𝑦’), Transforming the Euler Equations to the
Canonical Form,
UNIT -IV
Variational Problems Involving a Conditional Extremum
Constraints of the Form 𝜑(𝑥, 𝑦1 , 𝑦2 , ⋯ 𝑦𝑛 ), Constraints of the Form
𝜑(𝑥, 𝑦1 , 𝑦2 , ⋯ 𝑦𝑛 , 𝑦1′ , 𝑦2′ , ⋯ 𝑦𝑛′ ), Isoperimetric Problems.
UNIT-V
Direct Methods In Variational Problems
Introduction to Direct Methods, Euler's Finite-Difference Method, Rayleigh-Ritz Method,
Kantorovich’s Method.

1. L. Elsgolts, Differential Equations and the Calculus of Variations, University
Press of the Pacific, 2003.
2. A S Gupta, Calculus of Variations, Prentice-Hall of India Pvt. Ltd., New Delhi,
2008.
3. I. M. Gelfand and S. V. Fomin, Calculus of Variations, Dover Publications. 1963.
176
SUBJECT SUBJECT TITLE C/OE/TE/SE CREDITS
CODE L T P C
ME 223 Alternative Energy Sources OE 3 0 0 3
UNIT I: SOLAR ENERGY

Solar radiation and its measurements, Types of solar thermal collectors, Solar thermal
applications for water heaters, solar stills and solar pond. Solar thermal applications for
refrigeration and air- conditioning system. Solar thermal applications for solar dryer, solar
cookers and solar furnaces. Sensible and latent heat thermal energy storage systems. Solar
thermal power generation systems, Solar photovoltaic systems: basic working principle and
components, Applications of solar photovoltaic systems.
UNIT II: WIND ENERGY

Basic principle of wind energy conversion system. Wind data, site selection and energy
estimation. Components of wind energy conversion systems. Types of Horizontal axis and
Vertical axis wind turbine. Design consideration of horizontal axis wind turbine. Aerofoil
theory Analysis of aerodynamic forces acting on the blade. Performance of wind turbines.
Introduction to solar and wind hybrid energy systems, environmental issues of wind energy.
UNIT III: OCEAN, HYDRO AND GEOTHERMAL ENERGY

Wave characteristics and wave energy, Tidal energy and its types, Estimation of energy and
power in single basin tidal system, Ocean thermal energy conversion for open system. Ocean
thermal energy conversion for closed system. Hydro power plants for small, mini and micro
system. Exploration of geothermal energy. Geothermal power plants. Challenges, availability,
geographical distribution, scope and economics for geothermal plant.
UNIT IV: BIOMASS

Sources of biomass, Pyrolysis, combustion and gasification process, Updraft and downdraft
gasifier. Fluidized bed gasifier. Fermentation and digestion process. Fixed and floating digester
biogas plants. Design considerations of digester. Operational parameter of biogas plants.
Economics of biomass power generation.
UNIT V: DIRECT ENERGY CONVERSION SYSTEMS

Basic principle of thermo electric and thermionic power generations, Fuel cell principles and
its classification, Phosphoric acid fuel cell, polymer electrolyte membrane fuel cell, molten
carbonate fuel cell and solid oxide fuel cell, Fuel cell conversion efficiency, applications of
fuel cell, Magneto hydrodynamic power generation for open cycle, Magneto hydrodynamic
power generation for closed cycle, Hydrogen energy: properties and its production methods,
Electrolysis, thermo-chemical methods, fossil fuel methods and solar energy methods,
Hydrogen storage, transportation and applications.
177
TEXTBOOKS/REFERENCE
1. Tiwari.G.N, Ghosal.M.K, “Fundamentals of renewable energy sources”,1st Edition,
UK, Alpha Science International Ltd, 2007.
2. Godfrey Boyle, “Renewable energy”, 2nd Edition, Oxford University Press, 2010.
3. Twidell.J.W and Weir.A.D, “Renewable Energy Resources”,1st Edition, UK,E.&F.N.
Spon Ltd, 2006.
4. Domkundwar.V.M, Domkundwar. A.V, “Solar energy and Non-conventional sources
of energy”, Dhanpat rai & Co. (P) Ltd, 1st Edition, New Delhi, 2010.
5. G.D Rai, “Non-Conventional Energy Sources”, Khanna Publishers, 5th Edition, New
Delhi, 2011.
6. B.H Khan, “Non-conventional Energy Resources”, 2nd Edition, New Delhi, Tata
McGraw Hill, 2009.
7. S.P. Sukatme, J.K. Mayak, “Solar Energy-Principles of thermal collection and
storage”, 3rd edition, New delhi, McGraw Hill,2008.
178
COURSE CREDITS
COURSE NAME C/OE/TE
CODE L T P C
EEE 315 Artificial Neural Networks OE 3 0 0 3
UNIT I: FUNDAMENTALS AND SINGLE-LAYER NETWORKS

Neuronal model; neural networks as directed graphs; feedback; network architectures:
feedfoward neural networks (FFNNs) and recurrent networks. Linear Neuron: Linear least-
squares filter; Wiener filter, Adaptive filters: Newton’s, steepest-descent, and least mean
squares algorithms. Nonlinear neuron: McMulloch-Pitts model; perceptron convergence
theorem; limitations.
UNIT II: MULTI-LAYER NETWORKS

Motivation; Back-propagation learning, Heuristics; generalization; cross-validation; network
pruning; limitations, Supervised learning as an optimization problem, Extreme learning
machines (sequential and batch processing). Online sequential learning algorithm, Applications
to function approximation and pattern classification; identification and control.
UNIT III: RADIAL BASIS FUNCTION NETWORKS

Cover’s theorem on the separability of patterns; interpolation problem; XOR problem
revisited., Learning strategies. Supervised learning as an ill-posed hypersurface reconstruction
problem, regularisation theory. Regularisation networks; generalized RBFN. Approximation
properties; comparison of RBF and multilayer perceptrons.
UNIT IV: UNSUPERVISED AND REINFORCEMENT LEARNING

Principal component analysis; the PCA problem, Hebbian learning; Hebbian-based maximum
eigenfilter; Hebbian-based PCA, Introduction to Reinforcement Learning; Markov processes;
Markov decision process. Bellman’s optimality criterion; dynamic programming for static and
dynamic scenario. Policy and value iterations; approximate dynamic programming (direct
methods).
UNIT V: RECURRENT NETWORKS

Dynamic systems; stability of equilibrium states; attractors; neuro-dynamic models, Hopfield
networks: continuous- and discrete-time, Recurrent network architectures; controllability and
observability. Back-propagation through time; implementation with dynamical systems and
static back-propagation algorithm.
TEXTBOOKS/REFERENCE
1. S. Haykin, “Neural Networks and Learning Machines,” 3rd edition, Prentice Hall of
India, 2009.
2. T. Hagan, H. B. Demuth and M. Beale, “Neural Network Design,”, Thomson Learning,
2002.
3. M. M. Gupta, L. Jin and N. Homma, “Static and Dynamic Neural Networks: From
Fundamentals to Advanced Theory,” John Wiley-IEEE Press, 2003.
4. R. S. Sutton and A. G. Barto, “Reinforcement Learning: An Introduction”, MIT Press,
2nd edition, 2018.
5. Selected papers on artificial neural networks and their applications.
179
COURSE CREDITS
COURSE NAME C/OE/TE
CODE L T P C
IDEA 103 User Experienced Design OE 3 0 0 3
DESCRIPTION
This course aims at introducing students to basics of User Experience and Interaction
Design. This course will give an understanding that both the human user and user experience
is the key to limiting, and potentially eradicating, frustrating, time-consuming and poorly
designed technology, which restricts our productivity and sometimes even tests the limits of
our sanity.
User Experience Design course will help keep the user at the forefront of students’ mind and
ensure one never feel such a disconnection. They will develop an understanding of the user and
their limitations, capabilities and quirks to aid you in their task of designing products free from
the mistakes committed by the competitors, so they can get one step ahead of the pack. The
overall aim is to support, encourage and aid students - to guarantee the development of user-
friendly technologies, as this will ultimately improve everyone's quality of life.
The course is a blend of theory and practice to learn the basics of UX and Design Thinking and
does not require any prerequisite. This course will be useful to understand a systematic
approach to solving problems, building meaningful products and usage of tools that leads to
innovation.
COURSE OUT COMES & GOALS

- Understand the importance of User Experience Design and Interaction Design
- Learn about Gestalt principles of perceptual organization
- Learn about Visual perception and color vision
- How to handle User Error: who is to blame?
- Apply Usability testing methods
- Formulate and successfully communicate the solutions to problems
WHAT IS UX DESIGN
MODULE 1: INTRODUCTION TO USABILITY, INTERACTION DESIGN, DESIGN
THINKING
- The principle of ‘Visibility’, ‘Findability’, ‘Learnability’
- Affordances
- Mapping
- Constraints
- Feedback
- Hick’s law
- Fitt’s law
- Interactive experience
- Design thinking overview
MODULE 2: DESIGN PRINCIPLES & DESIGN GUIDELINES
- Gestalt Principles
- 10 rules of thumb
- UI design failures
USER RESEARCH METHODS
180
- Qualitative user research
- Best practices of qualitative user research
- Conducting ethical user research
- Basics of recruiting participants for user research
MODULE 3: VISUAL PERCEPTION AND COLOR VISION

- Visual Perception
- Vision and Design using color
- Colour blindness
- Context and other influences
MODULE 4: USABILITY CONSIDERATIONS

- Task structure
- Simplicity in design
- Designing with experience in mind
- Chunking
- Banner blindness
- Preventing errors
- Context of use
- Focus on users
- The value of UX
UX DESIGN PROCESS
MODULE 5: PROJECT-I (in teams)
- Applying Design thinking
- Empathy & Ideation principles & tools
STORYTELLING
- Role of Storytelling in Design thinking
INSTRUCTIONAL METHOD
o The course delivery method will be through online platforms (Zoom is preferred due
to the breakout rooms options) depend upon the requirement of content and need of
students. This will be an experiential learning throughout the course.
o The internal evaluation will be done based on continuous evaluation of students in the
hands-on workshop assignments and classroom.
o Practical examination will be conducted at the end of semester for evaluation of
performance of students in their given projects and also through questionnaire-based
exam.
181
COURSE CREDITS
COURSE NAME C/OE/TE
CODE L T P C
IDEA 104 Dream-Discover-Disrupt OE 3 0 0 3
MODULE 1: VENTURE IDEATION.

MODULE 2: MARKETING.
MODULE 3: CUSTOMER SEGMENTATION.
MODULE 4: CUSTOMER DISCOVERY.
MODULE 5: SOLUTION DESIGN.
182
COURSE CREDITS
COURSE NAME C/OE/TE
CODE L T P C
HIS 200 India and Its People OE 4 0 0 4
UNIT I – THE MAKING OF MODERN INDIA; THROUGH THE EYES OF THE

CONSTITUTION
Why do we need a constitution? Beginning of constitutionalism in India: Colonial and Anti-
colonial legacies, Locating constituent Assembly debate: Consensus and Discontent. Reading
preamble of the Indian constitution.
UNIT II - FUNDAMENTAL RIGHTS AND DIRECTIVE PRINCIPLES OF STATE

POLICY
The crafting of Fundamental Rights and Directive Principles and their various interpretations
The centrality of Fundamental Rights in the Indian Constitution, Counter- hegemonic
imagination of justice: Defining liberty and non- discrimination, The peculiarity of the
Directive Principles of State Policies, The idea of constitutional insurgency, Cultural and
educational rights to minorities in the Constitution.
UNIT III – ASYMMETRICAL FEDERALISM: CENTER-STATE RELATIONS

What is federalism? Constitutional provisions related to federalism, Relationship between State
and Centre, Deliberative ambiguities of Indian Federalism, Special Provisions for Jammu and
Kashmir, Himachal Pradesh, Northeastern states and tribal areas.
UNIT IV: FOUNDATIONS OF GOVERNANCE

Division of Power: Legislative, Executive, and Judiciary, Parliamentary form of government
in India, Government of the Union and Government of the State, Role of Supreme Court and
Judicial Activism in India.
UNIT V: CONSTITUTION AS A LIVING DOCUMENT

Constitution as a dialogue, Constitutional Amendments and the basic structure of the Indian
constitution, Insertion of the 9th schedule in the constitution, The role of judiciary and citizen
in defending, negotiating and interpreting the constitution.

1. Arjun Thiruvengadam, Origin and Crafting of the Constitution, in The Constitution of
India, a Contextual Analysis, Hart Publishing.
2. Granville Austin, The Indian Constitution: Cornerstone of a Nation, Oxford University
Press, Oxford, 1966.
3. Kalpana Kannabiran, Tools of Justice: Non- discrimination and the Indian Constitution,
Routledge, 2012.
4. Rajeev Bhargava (ed), Ethics and Politics of the Indian Constitution, Oxford University
Press, New Delhi, 2008.
5. Subhash C. Kashyap, Our Constitution, National Book Trust, New Delhi, 2011.
6. Zoya Hassan, E. Sridharan, and R. Sudarshan (eds), India’s Living Constitution: Ideas
Practices, Controversies, Permanent Black, New Delhi, 2002.
183
COURSE CREDITS
COURSE NAME C/OE/TE
CODE L T P C
ME 416 Surface Engineering OE 3 0 0 3
UNIT I: INTRODUCTION TO SURFACE ENGINEERING

Differences between surface and bulk, Properties of surfaces, surface energy concepts,
degradation of surfaces, wear and its type, Adhesive, Abrasive, Fretting, Erosion wear, Surface
fatigue,
UNIT II: FRICTION AND LUBRICATION

Fundamentals, Types and measurement of solid, liquid and gaseous friction. Friction heat and
calculation. Lubricants and additives, mechanism of solid, liquid and gaseous lubricants.
UNIT III: CORROSION

Different types of Corrosion and its prevention, Galvanic corrosion, Passivation, Pitting,
Crevice, Mircobial, High-temperature corrosion, Corrosion in nonmetals, polymers and
glasses, Protection from corrosion through surface modifications.
UNIT IV: CHANGING THE SURFACE METALLURGY

Localized surface hardening (flame, induction, laser, electron-beam hardening, Laser melting,
shot peening), Changing the surface chemistry: Phosphating, Chromating, Anodizing
(electrochemical conversion coating), Carburizing, Nitriding, Ion implantation, Laser alloying,
boriding, Organic coatings (paints and polymeric or elastomeric coatings and linings), Hot-dip
galvanizing (zinc coatings), Ceramic coatings (glass linings, cement linings, and porcelain
enamels), Advanced surface coating methods: Gaseous State (CVD, PVD etc), Solution State
(Chemical solution deposition, Electrochemical deposition, Sol gel, electroplating), Molten or
semimolten State (Laser cladding and Thermal spraying)
UNIT V: CHARACTERIZATION OF SURFACE AND COATINGS

Surface Characterization (physical and chemical methods, XPS, AES, RAMAN, FTIR etc),
Structural Characterization, Mechanical Characterization (Adhesion, Hardness, Elastic
Properties, Toughness, Scratch and Indentation etc.), Tribological Characterization, Corrosion
tests.
TEXTBOOKS/REFERENCES:
1. Introduction to Surface Engineering and Functionally Engineered Materials, Peter
Martin; Wiley, 2011.
2. Materials and Surface Engineering: Research and Development, J. Paulo Davim;
Woodhead Publishing review, 2012.
3. Pradeep L. Menezes, “Tribology for Scientists and Engineers”, Springer, 2013
4. Hand book, Friction, Lubrication and Wear Technology, Vol. 18, ASM
5. Krishna, R., Anantraman, T.R., Pande, C.S., Arora, O.P., Advanced techniques for
microstructural characterization (ed), Trans Tech Publication
184
PHY 307 M Special Theory of Relativity OE 3 1 0 4
UNIT-I- INTRODUCTION TO RELATIVITY

Inertial Frames, Universality of Newton's second law in all inertial frames, Classical Relativity, Does
universal rest (ether) exists? Michelson Morley Experiment Principle, Michelson Morley Experiment,
Postulates of Special Theory of Relativity, Concept of transformation, Galilean Transformation,
Simultaneity of two events in different inertial frames of reference and its frame dependence, Tutorial
I, Tutorial II, Tutorial III.
UNIT II – LORENTZ TRANSFORMATION

Clock Synchronization in an Inertial Frame, Lorentz Transformation, Length Contraction, Time
dilation, Examples of Length Contraction and Time dilation, Simultaneity Part I, Simultaneity Part II,
Transformation of Velocities Part I, Transformation of Velocities Part II, Tutorial IV, Tutorial V,
Tutorial VI.
UNIT III – RELATIVISTIC VELOCITY AND MOMENTUM

Velocity Transformation, Relative velocity with examples, Time like and Space Like intervals,
Causality, Need to redefine Momentum, Vector and Four-Vectors. Proper time interval, Velocity and
Momentum-Energy Four Vector, Example on Relativistic velocity and momentum, Tutorial VII,
Tutorial VIII, Tutorial IX.
UNIT IV: MASS ENERGY RELATION

Mass-Energy Relationship, Relationship between new energy and momentum. Relativistic Dynamics
Part I, Relativistic Dynamics Part II, Zero mass particles. Relativistic Mass, Geometry of Space-time,
Spacelike and time-like interval, Light cone, Tutorial X, Tutorial XI, Tutorial XII
UNIT V: GEOMETRY OF SPACE-TIME

Four Dimensional form of Maxwell's equations, Four dimensional Vector Potential.Stress- Energy
Momentum Tensor, Conservation Laws, Lagrangian formulation of Electrodynamics Part I, Lagrangian
formulation of Electrodynamics Part II, Relativistic treatment of Radiation. Four Dimensional form of
Maxwell's equations, Four dimensional Vector Potential. Tutorial XIII, Tutorial XIV, Tutorial XV.
1. Resnick, Robert. Introduction to Special Relativity. New York, NY: Wiley, 1968. ISBN:
9780471717256.
2. French, Anthony Philip. Special Relativity. New York, NY: Norton, 1968. ISBN:
9780393097931.
3. Einstein, Albert A. Relativity: The Special and the General Theory. New York, NY: Three
Rivers Press/Random House, 1995. ISBN: 9780517884416. (recommended)
185
COURSE CREDITS
COURSE NAME C/OE/TE
CODE L T P C
HIS 005 An Introduction to Gender OE 3 0 0 3
UNIT I – Gender; the Basics

Biology and History, Introduction to Gender Theory, Gendered Practices.
UNIT II – Gender and Pre-History

From Apes to Women – Sexual Dimorphism, Were there no cavewomen? From Hunter,
Gatherers to Cultivators
UNIT III – Gender and Civilization

Wives, Daughters and Daughters in laws, (Also, Husbands, Fathers, Sons and Warriors),
Women as the Other and Woman as Mother, Eunuchs, Effeminate men and Masculine Women,
The Politics of the Private, Women in Pre-modern India, Gender and Work in early societies.
UNIT IV: Mythologies of Gender

Gendering religion, Devotion and dissent, The Burden of culture: Goddess, Queens and
Courtesans, Gender and Art.
UNIT V: – Intersections, Interventions and Interstices

The Power of Gender and the Gender of Power, Gendering Caste, Gender ,Class and Race
Sisterhoods ,Subversion and Rebellion.

1. V Geetha, Gender, Stree, 2002.
2. Uma Chakraborty, Gendering Caste Through a Feminist Lens, Sthree , 2003.
3. Scott, Joan Wallach, Gender and the Politics of History , Columbia University Press,
New York, 1999.
4. Betty Friedan, ‘The Problem that has No Name’, in Betty Friedan , The Feminine
Mystique, W.W.Norton &Company, 2013.
5. Joan M Gero and Margret W Conkey, eds., Engendering Archaeology; Women and
Prehistory, Blackwell, Oxford , 1991.
6. Yuval-Davis, Nira, Gender and Nation, Sage, London, 1997.
7. Roy, Kumkum, ed., Women in Early Indian Societies, Manohar, 1999.
8. Nanda, Serena, ‘Neither man nor women: the hijras of India.’ Gender in Cross-Cultural
Perspective, 3rd ed. by Caroline B Brettell (ed). Carolyn F Sargent (ed)., Prentice Hall.
New Jersey, 2001.
9. Fausto-Sterling, Anne, "The Five Sexes: Why Male and Female Are Not Enough", The
Sciences 33, no. 2 1993.
10. Fausto-Sterling, Anne, "The Bare Bones of Sex: Part I – Sex and Gender, Signs, 30(2),
2005.
11. Hiltebeitel, Alf and Erndl, Kathleen, eds., Is the goddess a feminist?: the politics of
South Asian goddesses, Sheffield Academic Press, 2000.
186

CSE 2017 2021 - Syllabus - Book Corrected 17 06 2021

Uploaded by

Copyright:

Available Formats

CSE 2017 2021 - Syllabus - Book Corrected 17 06 2021

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE 2017 2021 - Syllabus - Book Corrected 17 06 2021

Uploaded by

Copyright:

Available Formats

Curriculum and Syllabus

(Applicable to students admitted during AY 2017-18)

School of Engineering and Applied Sciences

Department of Computer Science Engineering

List of Technical Electives

COURSE COURSE NAME COURSE CREDITS

UNIT I: RHETORIC AND PUBLIC SPEAKING

UNIT II: NONVERBAL COMMUNICATION

UNIT III: COMMUNICATION AND THE MEDIA

UNIT IV: SMALL GROUP COMMUNICATION

UNIT V: PERSUASION, IDEOLOGY AND MEDIA BIAS

COURSE COURSE NAME COURSE CREDITS

UNIT I: INTRODUCTION TO ECONOMICS

UNIT II: DEMAND AND SUPPLY

UNIT III: CONSUMER THEORY

UNIT IV: PRODUCER THEORY

UNIT V: TYPES OF MARKET

COURSE COURSE NAME COURSE CREDITS

BIO 101 Introduction to Biology BS 3 0 2 4

UNIT I: BASIS OF LIFE AND DIVERSITY

UNIT II: CELL BIOLOGY

UNIT III: BASIC MOLECULAR BIOLOGY

UNIT IV: ENZYMES AND APPLICATIONS

UNIT V: BIOLOGICAL SEQUENCES AND DATABASES

LIST OF PRACTICAL EXPERIMENTS

COURSE COURSE NAME COURSE CREDITS

UNIT I: CHEMICAL BONDING

UNIT II: PHASE RULE, THERMOCHEMISTRY, AND KINETICS

UNIT III: CRYSTALLINE MATERIALS

UNIT IV: MATERIALS CHEMISTRY

LIST OF PRACTICAL EXPERIMENTS

COURSE COURSE NAME COURSE CREDITS

UNIT I: THE FOUNDATIONS: LOGIC AND PROOFS

UNIT II: SET THEORY

UNIT III: ELEMENTARY NUMBER THEORY, INDUCTION AND RECURSION

UNIT IV: COUNTING PRINCIPLES

UNIT V: INTRODUCTION TO GRAPH THEORY

COURSE COURSE NAME COURSE CREDITS

UNIT I: INTRODUCTION TO PYTHON

UNIT II: FUNCTIONS

UNIT III: TUPLES AND LISTS

UNIT IV: CLASSES AND INHERITANCE

UNIT V: COMPUTATIONAL COMPLEXITY

COURSE COURSE NAME COURSE CREDITS

UNIT I: OBJECT ORIENTED PROGRAMMING CONCEPTS USING PYTHON

UNIT II: STATE MACHINES BASICS AND DESIGN USING PYTHON

UNIT III: CIRCUIT ANALYSIS

UNIT IV: NETWORK THEOREMS

UNIT V: RESONANCE AND TRANSIENT ANALYSIS

COURSE COURSE NAME COURSE CREDITS

UNIT I: HORIZONTAL AND VERTICAL WRITING

UNIT II: BASIC ENGLISH CONCEPTS AND INTRODUCTION TO LINGUISTICS

UNIT III: CREATIVE WRITING

UNIT IV: RESEARCH WRITING

UNIT V: ENGLISH PRESENTATIONS

COURSE COURSE NAME COURSE CREDITS

UNIT II: BACKGROUND CONCEPTS

UNIT III: SELECT E-INDUSTRIES

UNIT IV: INTRODUCTION TO STATISTICS AND ECONOMETRICS