BT Cse

Curriculum and Syllabus for B.
Tech
Computer Science and Engineering
From The Academic Year 2020

(Approved in Senate 43 & 44)
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram

Chennai-600 127
Semester 1
Course
S.No Course Name Category L T P C
Code
1 MA1000 Calculus BSC 3 1 0 4
2 PH1000 Engineering Electromagnetics BSC 3 0 0 3
3 EC1000 Electrical Circuits for Engineers BEC 3 1 0 4
4 CS1000 Problem Solving and Programming BEC 3 0 0 3
5 ME1000 Materials for Engineers BEC 3 0 0 3
6 DS1000 Foundation for Engineering and Product Design DSC 1 2 0 3
7 PH1001 Engineering Electromagnetics Practice BSC 0 0 3 1.5
8 CS1001 Problem Solving and Programming Practice BEC 0 0 3 1.5
9 HS1000 Effective Language and Communication Skills HSC 1 0 2 2
NC1000 NSO Semester 1
10 NC1002 NCC Semester 1 Any One NC 0 0 2 0
NC1004 SSG Semester 1
25.0
Semester 2
S.No Course Code Course Name Category L T P C
1 MA1001 Differential Equations BSC 3 1 0 4
2 Science Elective Course 1 SEC 3 1 0 4
3 ME1001 Engineering Graphics BEC 2 0 4 4
4 CS1004 Data Structures and Algorithms ITC 3 0 0 3
5 DS1001 Sociology of Design DSC 1 2 0 3
6 ID1000 Design and Manufacturing Lab ITC 0 0 2 1
7 CS1005 Discrete Structures for Computer Science PCC 3 1 0 4
8 CS1006 Data Structures and Algorithms Practice ITC 0 0 4 2
NC1001 NSO Semester 2
9 NC1003 NCC Semester 2 Any One NC 0 0 2 0
NC1005 SSG Semester 2
10 NC1008 Earth, Environment and Design NC 1 0 0 0
25.0
Semester 3
2 DS2000 Systems Thinking for Design DSC 1 2 0 3
3 CS2000 Object Oriented Programming PCC 2 0 4 4
4 CS2001 Digital System Design PCC 3 1 0 4
5 CS2002 Design and Analysis of Algorithms PCC 3 1 0 4
6 CS2003 Digital System Design practice PCC 0 0 4 2
7 CS2004 Design and Analysis of Algorithms practice PCC 0 0 4 2
NC2000 Indian Constitution, Essence of Indian Traditional
8 NC 1 0 0 0
Knowledge
23.0
Semester 4
2 DS2001 Smart Product Design DSC 1 2 0 3
3 CS2007 Computer Organization and Architecture PCC 3 1 0 4
4 CS2008 Database Systems PCC 3 1 0 4
5 CS2009 Theory of Computation PCC 3 1 0 4
6 CS2010 Computer Organization and Architecture practice PCC 0 0 4 2
7 CS2011 Database Systems practice PCC 0 0 4 2
8 NC2001 Human Values and Stress Management NC 1 0 0 0
23.0
Semester 5
1 CS3006 Introduction to Data Science for Engineers ITC 3 0 2 4
2 DS3000 Entrepreneurship and Management Functions DSC 1 2 0 3
3 CS3000 Operating Systems PCC 3 1 0 4
4 CS3001 Computer Networks PCC 3 1 0 4
5 CS3002 Compiler Design PCC 3 1 0 4
6 CS3003 Operating Systems practice PCC 0 0 4 2
7 CS3004 Computers Networks practice PCC 0 0 4 2
8 CS3005 Compiler Design Practice PCC 0 0 4 2
9 NC3000 Professional Ethics and Organizational Behaviour NC 1 0 0 0
25.0
* Change of course name from Data Science : An Applied Perspective to Introduction to Data Science for
Engineers (Approved in Senate 47)
Semester 6
1 DS3001 Prototyping and Testing DSC 1 2 0 3
2 Professional Elective Course 1 PEC 3 1 0 4
5 Free Elective Course 1 ELC 3 1 0 4
7 HS3000 Professional Communication HSC 1 0 2 2
8 NC3001 Intellectual Property Rights NC 1 0 0 0
25.0
Semester 7
4 CS4000 BT-CS-Summer Internship (May-Jul) PCD 0 0 16 0
12.0
Semester 8
2 CS4002 BT-CS-Project/Course work # PCD 0 0 16 8
12.0
$ All NC courses are Pass/Fail courses for which the letter grade H/L shall be awarded.
# Students opting for course work can register for elective courses equivalent to project credits (Example two
4 credit courses)
1. Professional Elective Course is an elective course offered or prescribed by the parent department. Free
Elective Course is an elective course offered by any department, including the parent department. For
example: - A ME student, based on his/her choice, can register the elective course offered by ME
department or CSE department as free elective course.
2. 3 Months internship is mandatory, however, the curriculum offers the flexibility to carry out 3-12 Months
internship with the approval of the parent department. To satisfy the minimum credit requirement,
students opting for long term internship (More than 3 months) are expected to advance a few elective
courses and credit a few courses from NPTEL. In line with the guidelines approved by the Senate (Senate
46-07), a B.Tech student can earn a maximum of 9 credits from NPTEL Courses. For all successfully
completed NPTEL Courses, the letter grade “H” (Pass) will be awarded and credits of such courses will not
be accounted for CGPA calculation.
Semester wise Credit Distribution
Semester
Category S1 S2 S3 S4 S5 S6 S7 S8 Total %
Basic Science Course (BSC) 8.5 4 0 0 0 0 0 0 12.5 7.4
Science Elective Course (SEC) 0 4 4 4 0 0 0 0 12 7.1
Basic Engineering Course (BEC) 11.5 4 0 0 0 0 0 0 15.5 9.1
Design Course (DSC) 3 3 3 3 3 3 0 0 18 10.6
IT Skill Course (ITC) 0 6 0 0 4 0 0 0 10 5.9
Professional Core Course (PCC) 0 4 16 16 18 0 0 0 54 31.8
Professional Elective Course (PEC) 0 0 0 0 0 12 0 0 12 7.1
Free Elective Course (ELC) 0 0 0 0 0 8 12 4 24 14.1
Humanities and Social Science
2 0 0 0 0 2 0 0 4 2.4
Course (HSC)
Professional Career Development
0 0 0 0 0 0 0 8 8 4.7
(PCD)
Total 25.0 25.0 23.0 23.0 25.0 25.0 12.0 12.0 170.0 100.0
25.0 50.0 73.0 96.0 121.0 146.0 158.0 170.0
Course Name Calculus Course Code MA1000
Offered by SH -Mathematics Structure (LTPC) 3 1 0 4

Department
To be offered for B.Tech Course type Core
Pre-requisite NIL Approved In Senate-43
Learning The course will introduce the student to basic concepts in Calculus such as convergence,
Objectives differentiation & integration and its applications.
Contents of the  Limit and Continuity of functions defined on intervals, Intermediate Value Theorem,
course
Differentiability, Rolle‘s Theorem, Mean Value Theorem, Taylor‘s Formula (5)
 Sequences and series (7)
 Definite integral as the limit of sum – Mean value theorem – Fundamental theorem of
integral calculus and its applications (9)
 Functions of several variables – Limit and Continuity, Geometric representation of
partial and total increments Partial derivatives – Derivatives of composite functions (8)
 Directional derivatives – Gradient, Lagrange multipliers – Optimization problems (7)

 Multiple integrals – Evaluation of line and surface integrals (6)
Essential 1. Thomas. G.B, and Finney R.L, Calculus, Pearson Education, 2007.
Reading
Supplementary 1. Piskunov. N, Differential and Integral Calculus, Vol. I & II, Mir. Publishers, 1981.
Reading 2. Kreyszig. E, Advanced Engineering Mathematics, Wiley Eastern 2007.
3. J Hass, M D Weir, F R Giordano, Thomas Calculus, 11th Edition, Pearson.
Course Name Engineering Electromagnetics Course Code PH1000
Offered by SH -Physics Structure(LTPC) 3 0 0 3

Department
To be offered for B. Tech Course Type Core
Learning Objectives The objective of this course is to give an idea how the electromagnetic wave behaves. This
also provides an understanding of theories of electrostatics, magnetism and
electrodynamics with their applications. It will enhance the problem solving capacity of the
student.
Contents of the  Vectors ‐ an introduction; Unit vectors in spherical and cylindrical

course polarco‐ordinates; Concept of vector fields; Gradient of a scalar field; flux,
divergence of a vector, Gauss‘s theorem, Continuity equation; Curl–rotational and
irrational vector fields, Stoke‘s theorem. (12)
 Electrostatics:
 Electrostatic potential and field due to discrete and continuous charge
distributions, boundary condition, Energy for a charge distribution, Conductors
and capacitors, Laplace‘s equation Image problem, Dielectric polarization, electric
displacement vector, dielectric susceptibility, energy in di-electric systems. (10)
 Magneto statics:
 Lorentz Force Law Bio‐Savart's law and Ampere's law in magneto statics,
Divergence and curl of B, Magnetic induction due to configurations of
current‐carrying conductors, Magnetization and bound currents, Energy density in
a magnetic field Magnetic permeability and susceptibility. (10)
 Electrodynamics:
 Electro motive force Time‐varying fields, Faraday‘s law of electro-magnetic
induction,
 Self and mutual inductance, displacement current, Maxwell's equations in free
space. Boundary condition, propagation in linear medium. Plane electro-magnetic
waves—reflection and refraction, electromagnetic energy density, Pointing
Vector.(10)
Essential Reading 1. W.H.Hayt, and J.A.Buck, Engineering Electromagnetics, Tata McGraw Hill
Education Pvt. Ltd, 2006.
Supplementary 1. W. H. Hayt, J. A.Buck and M.Jaleel Akhtar, Engineering Electromagnetics,

Reading McGraw Hill (India) Education Pvt. Ltd, Special Indian Edition 2020.
2. Purcell. E.M, Electricity and Magnetism Berkley Physics Course, V2, Tata McGraw
Hill, 2008.
3. Feynman.R.P, Leighton.R.B, Sands.M, The Feynman Lectureson Physics, Narosa
Publishing House, Vol. II, 2008. Hill, 2008.
4. G.B.Arfken, H.J.Weber and F.E.Harris, Mathematical Methods for Physicists,
Academic Press, 2013
Course Name Electrical Circuits for Engineers Course Code EC1000
Offered by Electronics and Communication Structure(LTPC) 3 1 0 4

Department Engineering
To be offered for
B.Tech B. Tech Core
Pre-requisite
NIL Approved In Senate-43
Learning This course aims to equip the students with a basic understanding of electrical circuits and machines
Objectives for specific types of applications.
This course also equips students with an ability to understand basics of analog and digital electronics.
The students shall develop an intuitive understanding of the circuit analysis, basic concepts of
Learning
electrical machines, and electronic devices and circuits and be able to apply them in product design
Outcomes and development
Elements in electrical circuits: R, L, C, voltage and current sources, Ohm‘s law, Kirchoff‘s Laws (4)
Contents of the
course (With Network analysis: Nodal and mesh analysis with only independent sources (4)
approximate Network theorems: Super position, The venin‘s & Norton‘s, Maximum power transfer theorems (4)
break-up of
hours) DC circuits: Response of RC, RL and RLC circuits (6)
AC circuits: AC signal measures, Phasor analysis of single-phase AC circuits, Three phase AC circuits
(6)
Machines: Transformers, DC generator, DC motor, AC induction machines (8)
Diodes: V-I characteristics, applications- rectifiers, clippers, clampers (2)
Op-amps: gain, feedback, applications-inverting/non-inverting amplifiers, sum and difference
amplifier, comparators (4)
Logic gates and combinational circuits– Basic gates, Karnaugh maps, Full adder, half adder
(4)
1. Edward Hughes, Ian Mc Kenzie Smith, John Hiley, Keith Brown, ‗Hughe‘s Electrical and
Essential Reading Electronic Technology‘, 10thedition, Pearson,2010
1. Charles Alexander and Matthew Sadiku ‗Fundamentals of Electric Circuits‘ 7thEdition,

McGrawHill,2021
2. C.H.Roth,Jr., Larry R Kinney, ‗Fundamentals of Logic Design‘, 7thEdition, Cengage
Supplementary Learning, 2013.
Reading 3. Jacob Millman, Christos C Halkais, Satyabrata Jit, ‗Millman‘s Electronic Devices and
Circuits‘, 4thEdition, McGrawHillIndia, 2015
4. Stephen D Umans, ‗Fitzgerald & Kingsley‘s Electric Machinery‘, McGraw-Hill, 7thed. 2020.
Course Name Problem Solving and Programming Course Code CS1000
Offered by Department Computer Science Structure 3 0 0 3

(LTPC)
To be offered for B.Tech Course type Core
Prerequisite NIL Approved In Senate -43
Focus is on problem solving using computers with C programming as the language.

Data representation, base conversions, arithmetic in fixed and floating point
Learning Objectives representations, and problems related to this shall be covered. The sequence, selection
and repetition statements in C programming language shall be discussed with case
studies. The practice component of this course shall supplement theory by providing
hands-on experience.
The teaching and assessment shall ensure that given a computational problem,
students can use computers as a tool to model and solve the problem. Writing pseudo
Learning Outcomes codes and C programming using basic programming constructs are expected out of the
students. Students are expected to be conversant in number conversions and
representations.
 Computing Machine - Need and Applications - Evolution of Computing Machines

(Calculators through Computers) Number Representation - Fixed and Floating
Point - Base Conversions: Binary, Decimal, Octal, Hexa decimal number systems
and conversions. (8 hours)
 Basic programming constructs in C – Data types in C – Input and output
statements – Formatted input/output - Control strings - return types - Case studies
involving sequence statements (4hours)
 Operators - Arithmetic, logical, relational, shift, unary operators - Precedence and
Course Contents (with Associativity (3 hours)
approximate breakup of  Selection Statements: IF-ELSE, SWITCH-CASE - Programs involving sequence
hours for and selection - GOTO statements - break statement - Nested IF - Switch inside if
lecture/tutorial/practice) and vice-versa (5 hours)
 Repetition Statements: FOR, WHILE - Programs involving sequence, selection and
repetition - continue statement - Nested loops (5 hours)
 Introduction to Arrays and Strings - Array manipulation - string manipulation -
string operations - multi-dimensional arrays (6 hours)
 Functions in C – Function declaration, definition – scope -storage Class-Built and
user defined functions –Recursive functions (7 hours)
 Introduction to Pointers, Dynamic Memory Allocation, Structures and File
processing (7 hours)
Essential Reading Deitel P J and Deitel H M, C : How To Program, Prentice Hall, 7th Edn, 2012.
Supplementary Reading Kernighan, Ritchie D, The C Programming Language, Prentice Hall, 2 nd Edn, 1988
Course Name Materials for Engineers Course Code ME1000
Offered by Mechanical Engineering Structure (LTPC) 3 0 0 3
Department
Pre-requisite NIL Approved In Senate- 43

 To provide overview of microstructure and properties of various engineering materials
Learning  To explore relations between performance of engineering products and microstructure, properties
Objectives of materials that are used to construct them.
After the completion of the course, students will be able:

 To explain the microstructure and properties of materials like steels, polymers, ceramics, and
Learning composites.
Outcomes  To understand the correlation of microstructure-properties-performance of materials so as to
select suitable materials for engineering products.
 Classification and evolution of engineering materials, crystal structure, defects, crystallographic

planes, directions, slip, deformation mechanical behavior, strengthening mechanisms,
microstructure and properties of metal alloys (12)
 Properties and processing of polymers, ceramics and composite materials, microstructure-
property relationships (9)
Contents of the
course  Electrical, electronic and magnetic properties of materials, microstructure-property relationships
(6)
 Introduction to Nano, Bio, Smart and Functional materials. (3)
 Introduction to selection of materials, Product based case studies on microstructure-property-
performance of materials in the design of automobile; aircraft structures; e-vehicles; energy
storage; electronic, optical and magnetic devices; and biomedical devices. (12)
1. William D. Callister Jr., David G. Rethwisch, ―Materials Science and Engineering: An

Introduction‖, 10th Edition, Wiley, 2018.
Essential Reading
2. Michael Ashby, Hugh Shercliff, David Cebon, ―Materials – Engineering, Science, Processing and
Design‖, 4th Edition, Butterworth-Heinemann, 2018.
1. V Raghavan, ―Materials Science and Engineering: A First Course, 5th Ed, 2007, PHI India.
2. Donald R. Askeland K Balani, ―The Science and Engineering of Materials,‖ 7th Edition, Cengage
Supplementary
Learning, 2016.
Reading
3. Michael Ashby, ―Materials Selection in Mechanical Design‖, 5th Edition, Butterwoth-
Heinemann, 2016.
Course Name Foundation for Engineering and Product Design Course Code DS1000
Offered by SIDI Structure (LTPC) 1 2 0 3

Department
To be offered for B.Tech Course Type Core
Prerequisite NIL Approved In Senate -43

The objective of this foundation program is to help students coming from +2 background to:
Learning
Objectives  Unlearn limiting assumptions, risk avoidance, fear of failure
 Awaken their senses & rediscover their creative selves
 Experience the impact of design and technology in everyday objects
At the end the course, the student should
Learning
Outcomes ● demonstrate qualities of immersion in a task;
● unlearn key limiting assumptions;
● become comfortable with sketch-thinking and develop skills in design sketching;
● be excited by the potential of technology and design in improving lives;
Module-1: Induction: (5 hrs.)
Contents of the
course(With  History of the place; the industrial ecosystem; institution
approximate  Exercises to improve interaction; local visits;
break up of Module-2: Learn to observe nature and self (12 hrs)
hours)
● Know your context - physical and social;
● Unlearning activities; Start journaling
● Observe wholes-parts (trees-leaves); variety of leaves; colors
● Document in a variety of ways - collage; sketch, paint, photograph, video
Module-3: Learn to observe everyday objects (15 hrs)
● Unbundle everyday objects, observe, reorganize

● Whole-part relations; System physics;
● Observe interplay of art, design, culture, technology in everyday objects
Module-4: Visualize and Realize 3D objects (15 hrs)
● Introduction to design sketching-1 (paper/pencil)

● Concepts of perspective drawing and product sketching.
● Introduction to color theory - mixing of colors to get different shades
● Explore variations on the form of chosen objects
● Realize designs with tools/materials (Origami; Clay; Foam cutting; Laser cutting; Glues)
● Introduction to digital sketching & 3D printing
Evaluation: Continuous assessment (80%); Final Form Designs Presentation (20%)
1. Kevin Henry, Drawing for Product Designers, Laurence King Publishing, 2012,
Essential
ISBN:9781856697439
&Supplementary
Reading 2. Koos Eissen and Roselien Steur, Sketching – The Basics, BIS Publishers, 2011,
ISBN:9789063695347
3. Thomas C Wang, Pencil Sketching, John Wiley, 2002, ISBN:9780471218050
4. Wucius Wong, Principles of Color Design: Designing with Electronic Color, John Wiley, 2nd
Edition, 1996, ISBN:9780471287087
Course Name Engineering Electromagnetics Course Code PH1001
Practice
Offered by SH-Physics Structure(LTPC) 0 0 3 1.5

Department
Learning The objective of this course is to give a hand on experience how the electromagnetic wave
Objectives behaves in different situations. The students will be able to relate the knowledge they have
got in the theory class with their experience. This course will enhance their skill of handling
instruments and the presentation of the results obtained from the experiments.
Contents of the Electrical and magnetic properties of materials based on the concept of electrical polarization,
course magnetization of materials will be studied in various experiments.
Experiments based on the concept of phenomena such as interference, diffraction etc. related
to electro-magnetic waves will be done here and these methods will be applied to measure
some unknown physical quantities such as wavelength of a light, diameter of a very thin wire,
very small aperture for light etc.
Essential Reading 1.IIITD&M Laboratory manual for Electromagnetic Wave Practice
Supplementary
Reading 1. W.H.Hayt and J. A.Buck, Engineering Electro magnetics, Tata McFraw Hill Education Pvt.
Ltd, 2006.
Problem Solving and Programming
Course Name Course Code CS1001
Practice
Offered by Structure
Computer Science 0 0 3 1.5
Department (LTPC)
Prerequisite NIL Approved In Senate-43
Focus is on problem solving using computers with C programming as the language. The
Learning Objectives sequence, selection and repetition statements in C programming language shall be
discussed with case studies.
The teaching and assessment shall ensure that given a computational problem, students
can use computers as a tool to model and solve the problem. Writing pseudo codes and C
Learning Outcomes
programming using basic programming constructs are expected out of the students.
Students are expected to be conversant in number conversions and representations.
 Introduction to text editors - basic text processing - case studies involving

office software - doc and ppt creation
 Introduction to Linux commands - file/directory creation - copy, move, pdf

Course Contents (with creation, zip commands
approximate breakup
of hours for
lecture/tutorial/  Case studies using sequence statements - input/output statements - arithmetic
practice) with precedence and associativity.
 Case studies involving selection and repetition statements - functions –

recursion
Essential Reading Deitel P J and Deitel H M, C : How To Program, Prentice Hall, 7th Edn, 2012.
Supplementary
Kernighan, Ritchie D, The C Programming Language, Prentice Hall, 2 nd Edn., 1988
Reading
Course Name Effective Language and Communication Skills Course Code HS1000
Structure 1 0 2 2
Offered by SH-English
(LTPC)
Department

 Hone LSRW and practice critical thinking
Learning Objectives
 Enable students to speak and write grammatically acceptable sentences
 Train students in technical communication
 Cultivate interest to learn language and to build the confidence to communicate in English
 Develop an interest in updating their language skills through continuous learning
 Connecting personal growth with improvement in their proficiency in English
Learning Outcomes
 Able to communicate effectively with grammatically acceptable constructions and appropriate
words in formal and informal situations
 Can extract information effectively and able to think critically
 Able to present technical content confidently
 Introduction: Language, effective communication, ethics and aesthetics of communication (L1)
Course Contents
(with approximate  Phonetics – sounds, pronunciation of words, stress, intonation, listening, Varieties of English (L3,
breakup of hours P4)
for lecture/  Sentence structure, concord, punctuation, stylistic errors, common errors (L3, P4)
tutorial/ be  Reading and comprehension (L2, P5)
done practice)
 Different types of reading, analyzing the organization of the text
 Critical thinking- thesis statement, argument, hypothesis, order, reason, evidence,
consistency, tautology, conclusion
 Exercises for vocabulary enrichment (for daily practice)
 Speaking (L2, P5)
 Barriers to effective communication, technical presentation and presentation skills, self-
introduction,
 Requests, enquiry, suggestion in formal and informal situations, reporting an event, group
presentation – debate
 Writing (L3, P8)
 Writing formal letters, email, résumé,
 Data interpretation, reports, product description/requirements/ technical instructions,
recording observations
 The language of content strategy - voice and tone strategy - the language of localization – text
analysis tools
 Plagiarism – the importance of documentation, different methods of note-taking
 Essays/story/ book & movie reviews/writing for social media/blogging/ journaling
 Life lessons through stories and activities (P2)
1. Tebeaux, Elizabeth, and Sam Dragga. The Essentials of Technical Communication. OUP, 2018.
Essential &
2. Rizvi, M Ashraf. Effective Technical Communication. McGraw-Hill, 2017
Supplementary
3. Hancock, Mark. English Pronunciation in Use: Intermediate Self-study and Classroom
Reading
Use.CUP,2012.
4. Cottrell, Stella. Critical Thinking Skills: Developing Effective Argument and Analysis.
Palgrave,2005.
5. Gower, Roger. Grammar in Practice. CUP, 2005.
6. Paterson, Ken. Oxford Living Grammar. OUP, 2014.
7. Sabin, William A. The Gregg Reference Manual: A Manual of Style, Grammar, Usage, and
Formatting. McGraw-Hill, 2011.
8. Fitikides, T. J. Common Mistakes in English. London: Orient Longman, 1984.
Leech, Geoffrey and Jan Svartvik. A Communicative Grammar of English. Routledge, 2013.
9. Astley, Peter and Lewis Lansford. Oxford English for Careers: Engineering. OUP, 2013.
10. Savage, Alice and Patricia Mayer. Effective Academic Writing. OUP, 2013
11. Harari, Yuval Noah. Sapiens: A Brief History of Humankind. Vintage, 2014.
12. https://www.ted.com/
13. https://www.bbc.co.uk/learningenglish/features/pronunciation/tims-pronunciation-workshop-
ep-13
14. https://learnenglish.britishcouncil.org/skills/listening
15. https://www.nationalgeographic.com/podcasts/overheard
16. https://www.youtube.com/user/NatureVideoChannel
17. https://www.youtube.com/watch?v=Aj-
EnsvU5Q0&list=PLcetZ6gSk969oGvAI0e4_PgVnlGbm64bp
18. https://www.merriam-webster.com/word-of-the-day
19.https://www.newyorker.com/tag/book-reviews
Course Name Differential Equations Course Code MA1001
Offered by SH-Mathematics Structure (LTPC) 3 1 0 4

Department
Learning To provide an exposure to the theory of ODEs & PDEs and the solution techniques.
Objectives
Contents of the Linear ordinary differential equations with constant coefficients, method of variation of
course parameters – Linear systems of ordinary differential equations (10)
Power series solution of ordinary differential equations and Singular points Bessel and Legendre
differential equations; properties of Bessel functions and Legendre Polynomials (12)
Fourier series (6)
Laplace transforms elementary properties of Laplace transforms, inversion by partial
fractions, convolution theorem and its applications to ordinary differential equations (6)
Introduction to partial differential equations, wave equation, heat equation, diffusion
equation(8)
Essential 1. Simmons. G.F, Differential Equations, Tata McGraw Hill, 2003.

Readings
2. Kreyszig. E, Advanced Engineering Mathematics, Wiley, 2007.
Supplementary 1. William. E. Boyce and R. C. Diprima, Elementary Differential Equations and Boundary
Reading
Value Problems, John Wiley, 8th Edn, 2004.
2. Sneddon. I, Elements of Partial Differential Equations, Tata McGraw Hill, 1972.
3. Ross. L.S, Differential Equations, Wiley, 2007.
4. Trench, W, Elementary Differential Equations, http://digitalcommons.trinity.edu/mono

Course Name Engineering Graphics Course Code ME1001
Offered by Mechanical Engineering Structure(LTPC) 2 0 4 4

Department
Learning Objectives  To introduce the basic concepts and techniques of technical drawing.
 2D and 3D representation of various shapes/objects and its engineering
applications.
Students will acquire visualization skills and will be able to prepare technical drawings
Learning Outcomes
and 3D models using computer aided tools.
 Role of technical drawing in product development process, Basics of technical drawing,

Course
Standards, Dimensioning principles. (L2+P4hrs.)
Contents(with
approximate  Computer aided drafting. (L2+P8hrs.)
breakup of hours  Engineering curves and its applications. (L4+P8hrs.)
for  Principles of orthographic projection. Orthographic projection of points, lines, planes and
lecture/tutorial/ regular solids, Exercises related to engineering applications. (L7+P8hrs.)
practice)  Principles of iso metric projections. Orthographic to iso metric and iso metric to ortho
graphic transformation of objects. (L3+P8hrs.)
 Section and inter section of regular solids and their lateral developments.
 (L6+P12hrs.)
 Introduction to 3D modelling of shapes and objects; electrical CAD. (L2+P4hrs.)
1. K.Venugopal and V Prabhu Raja, Engineering Drawing + Auto CAD, New Age
Essential Reading
International (P) Limited. 5th Edition Reprint: July, 2016
2. Narayana.K.L, and Kannaiah.P, Engineering Drawing, Scitech Pub. Pvt. Ltd,
3. 3rdEdition.
1. PI Varghese, Engineering Graphics, McGraw Hill Education, 2013.

Supplementa
ry Reading 2. Bhatt.N.D, Engineering Drawing–Plane and Solid Geometry, Charotar Publishing
House Pvt. Ltd., 53rd Edition 2014.
Course Name Data Structures and Algorithms Course Code CS1004
Offered by Department Computer Science & Engineering Structure 3 0 0 3

(LTPC)
To be offered for B.Tech
Course Type Core
Learning Objectives
Given a computational problem, the focus is on design of algorithms, implementation of
algorithms using a suitable data structures. The notion time and space complexity and
design of efficient algorithms and data structures shall also be explored.
Learning Outcomes Students are expected to design efficient algorithms and data structures for computational
problems
Course Contents(with  Review of elementary data structures – time and space complexity – step count
approximate breakup method based computation – asymptotic analysis and bounds – big oh, little oh,
of hours for omega, theta notation(5L)
lecture/tutorial/  Analysis using recurrence relations – solving recurrence relations through guess
practice) method, recurrence tree method, master‘s theorem(5L)
 Analysis of sorting/searching algorithms - Incremental Design - insertion sort,
Decremental Design - Celebrity problem - Divide and Conquer- merge sort, quicksort
– comparison/ non-comparison based sorting algorithms on restricted inputs –
counting, radix sorting - discussion on inputs with best/worst case complexities(7L)
 Binary Trees - Tree representation, traversal, Introduction to expression trees:
traversal vs post/pre/infix notation. Recursive traversal and other tree parameters
(depth, height, number of nodes etc.) (6L)
 Dictionary: Binary search trees, balanced binary search trees - AVL Trees – search
tree variants such as B-trees. (7L)
 Hashing - collisions, open and closed hashing, properties of good hash functions. (4L)
 Priority queues: Binary heaps with application to in-place sorting(5L)
 Graphs: Representations (Matrix and Adjacency List), basic traversal such as BFS,
DFS with complexity(6L)
Essential Reading 1. 1.M.A. Weiss, Data Structures and Algorithm Analysis in C, Pearson, 2ndedition,
2002.
Supplementary 1. Cormen T.H, Leiserson C.E and Rivest R.L, Introduction to Algorithms, Prentice Hall
Reading India, 2nd Edition, 2001.
2. Aho, Hopcroft and Ul lmann, Data Structures and Algorithms, Addison Wesley, 1983.
3. Adam Drozdek, Data structures and Algorithms in C, 1994.
4. RG Dromey, How to solve it by Computer, Prentice Hall India, 1982.
5. Horowitz, Sahni and Anderson-Freed, Fundamentals of Data Structures in C, Silicon
Press, 2007.
Course Name Sociology of Design Course Code DS1001
Offered by Department SIDI Structure 1 2 0 3

(LTPC)
Prerequisite Foundation Program Approved In Senate 43
Learning objectives The objective of the course is to introduce engineering students to the
importance of understanding the social context of technology and
product design:
 Observing the problem context and surfacing unstated
user/ customer needs/ new product concepts,
 Understanding people, team dynamics and working in multicultural
/cross-functional/distributed teams.
Learning Outcome At the end of the course, the students should be in a position to:
● Understand the need and the process of doing an ethnographic study
● Surface unstated needs and articulate the high level product requirements
Connect with people, form teams and collaborate towards a
common goal
Contents of the Module1: Technology, Design and Society-[9hrs]

course(With approximate ● Observe the way people interact with objects
breakup of hours) ● Understanding the relationship between people and a variety of objects
● Actor Network Theory; History of Technology and Design; 2-3 Case studies
● Discovery our passion and domain of interest & network to identify
partners
Module2: Understanding user/ customer contexts [21hrs]
● Ethnography- immersion in a problem context
● Learning to observe- see and listen;
● Developing rich pictures; Giga mapping
● Introduction to signs and semiotic analysis
Module3: Understanding groups (multicultural / cross-functional teams) [12hrs]
● Learning team formation and dynamics through a movie;
● Introduction to sociological imagination - Functionalism, Conflict
Theory, Symbolic Interactionism; Interaction Ritual Chains
● Values, culture, methods of engineers and designers and how they shape
the quality of our lives;
● Groupdynamicswithinorganizationsandacrossorganizationsandim
plications for innovation and change Evaluation: Continuous
assessment(40%); Final ethnography report(20%); End
Semester(40%)
Essential & Supplementary 1. Trevor Pinch (Editors) (2012), The Social Construction of Technological
Reading Systems: New directions in the sociology and history of technology,
MIT Press, Anniversary Edition
2. Wendy Gunn, Ton Otto and Rachel Smith (2013), Design
Anthropology: Theory and practice, Bloomsbury
3. Adrian Forty (2014), Objects of desire: Design and society since1750s, Thames
& Hudson
4. Bernhard E Burdek (2015), History, theory and practice of product
design, second revised edition
5. Keri Smith(2008), How to be an Explorer of the World: Portable Life
Museum, Penguin Group
Course Name Design and Manufacturing Lab. Course Code ID1000
Offered by SIDI Structure(LTPC) 0 0 2 1

Department
Learning The objective of this course is to give an exposure on the basic practices followed in the
Objectives domain of mechanical, electrical, electronics and communication engineering. The exercises
will train the students to acquire skills which are very essential for the engineers through
hands-on sessions.
Contents of the Experiments will be framed to train the students in following common engineering
course practices:
Basic manufacturing processes: Fitting, Drilling & tapping, Material joining processes,
Carpentry, Sheet-metal work, Adhesive bonding and plastic welding, Arc Welding, 3D
Printing. (10 hours)
Familiarization of electronic components by Nomenclature, meters, power supplies,

function generators and Oscilloscope – Bread board assembling of simple circuits: IR
transmitter and receiver
–LED emergency lamp–Communication study: amplitude modulation and demodulation.
(6 hours)
Domestic wiring practice: Fluorescent lamp connection, Staircase wiring – Estimation
and costing of domestic and industrial wiring – power consumption by Incandescent,
CFL and LED lamps. (2 Hours)
Dismantle and assembly of PC. Installing OS and disk management.(4 hours)
Essential Reading 1. UppalS.L., ―Electrical Wiring & Estimating‖, 5th Edn, Khanna Publishers, 2003.
2. Chapman.W.A.J., Workshop Technology, Part1&2, Taylor & Francis.
Supplementary 1. ClydeF.Coombs, ―Printed circuits hand book‖,6th Edn, McGraw Hill,2007.

Reading 2. John H. Watt, Terrell Croft, ―American Electricians' Handbook: A Reference Book for
the Practical Electrical Man‖, Tata McGrawHill,2002.
Course Name Discrete Structures for Course Code CS1005
Computer Science
Offered by Computer Science & Engineering Structure(LTPC) 3 1 0 4

Department
Learning Objectives This course introduces logical reasoning, inferences, and proof techniques. Relations,
Functions, counting principles are also discussed. Graph theory and
Various properties of graphs are also taught as part of this course.
Learning Outcomes The learner would appreciate the importance of combinatory and the various proof
techniques, and in particular, in proving the correctness of algorithms. Counting
principles learnt as part of the course will help the learner in counting various
Combinatorial objects
Course  Mathematical Reasoning – Propositions – Predicates –First order logic – Nested

Contents(with quantifier –logical puzzles(9L+3T)
approximate
breakup of hours  Set theory – Relations between sets – Operation on sets –Inductive definition of sets-
for Proof techniques – Direct proof, proof by contradiction, mathematical
induction(8L+3T)
lecture/tutorial/
practice)  Binary relation and digraphs – Special properties of relations – Composition of
relations–Closure operations on relations–counting special relations(7L+3T)
 Basic properties of functions – Special classes of functions – counting
functions(5L+1T)
 Pigenhole principle –on to functions–derangements(5L+1T)

 Basic counting techniques–Finite and Infinite sets–Countable and uncountable sets–
Cardinal numbers(6L+1T)
 Graph Theory–Graphs–Subgraphs–Isomorphic and Homeomorphic graphs–
 Paths–Connectivity Bridges of Konigsberg–Labeled and Weighted Graphs–Complete,

Regular and Bipartite Graphs –Planar Graphs –Coloring (5L+2T)
Essential Reading 1. 1.K.H.Rosen, Discrete Mathematics and its Applications, McGraw Hill, 6thEdition,
2007.
Supplementa 1. D.F.Stanat and D.F.McAllister, Discrete Mathematics in Computer Science, Prentice
ry Reading Hall, 1977.
2. R.L.Graham, D.E.Knuth, and O.Patashnik, Concrete Mathematics, Second Edition,
Addison Wesley, 1994.
3. Busby, Kolman, and Ross, Discrete Mathematical Structures, PHI, 6thEdition, 2008.
4. C.L.Liu, Elements of Discrete Mathematics, Second Edition, TataMcGrawHill,1995.
Course Name Data Structures and Algorithms Course Code CS1006
Practice
Offered by Department Computer Science & Engineering Structure(LTPC) 0 0 4 2
NIL
Prerequisite Approved In Senate-44
Learning Given a computational problem, the focus is on design of algorithms, implementation of

Objectives algorithms using a suitable data structures. The notion time and space complexity and
design of efficient algorithms and data structures shall also be
explored.
Learning Outcomes Students are expected to design efficient algorithms and data structures for
computational problems
Course  Implementation of case studies involving algorithms and data structures in C

Contents(with programming.
approximate breakup  Binary Trees–Traversal –Computation of Structural parameters
of hours for  Hashing–implementation of hash functions–computing collisions–Open vs closed
lecture/tutorial/ hashing
practice)
 Sorting and Searching Algorithms
 Priority Queues and Heaps and its applications
 Graph Traversals–BFS, DFS and its applications
Essential Reading 1.M.A. Weiss, Data Structures and Algorithm Analysis in C, Pearson, 2ndedition, 2002.
Supplementary 1. Cormen T.H, Leiserson C.Eand Rivest R.L, Introduction to Algorithms, Prentice
Reading Hall India, 2nd Edition, 2001.
2. Aho, Hopcroft and Ul lmann, Data Structures and Algorithms, Addison Wesley,
1983.
3. Adam Drozdek, Data structures and Algorithms in C, 1994.
4. RG Dromey, how to solve it by Computer, Prentice Hall India, 1982.
5. Horowitz, Sahni and Anderson-Freed, Fundamentals of Data Structures in C,
Silicon Press, 2007.
Course Name Earth, Environment and Design Course Code NC1008
Offered by Department SIDI Structure 1 0 0 0

(LTPC)
Learning Objectives The course aims to provide an understanding of systems and processes in aquatic and
terrestrial environments, and to explore changes in the atmosphere, lithosphere,
hydrosphere, biosphere, and the evolution of organisms, since the origin of life on earth.
Course Contents (with  Introduction to environment and ecology – Ecosystems Impacts of natural and
approximate breakup of human activities on ecosystems
hours for lecture/  Environmental policies, acts and standards, Environmental Impact Assessment
tutorial/practice) Prediction and assessment of the impacts on air, water, land, and biological
environments Assessment of impacts of the cultural, socioeconomic and eco sensitive
environments
Essential Reading 1. Rubin. E. S, Introduction to Engineering and the Environment, McGraw Hill, 2000.
2. Masters. G. M., Introduction to Environmental Engineering & Science, Prentice
Hall, 1997.
Supplementary 1. Henry. J. G, and Heike, G. W, Environmental Science & Engineering, Prentice Hall
Reading International, 1996.
2. Dhameja. S. K, Environmental Engineering and Management, S. K. Kataria and
Sons, 1999.
3. Shyam Divan and Armin Rosancranz, Environmental Law and Policy in India,
Cases, Materials and Statutes, Oxford University Press, 2001.
Course Name Systems Thinking for Course Code DS2000
Design
Offered by SIDI Structure(LTPC) 1 2 0 3

Department
Pre-requisite Sociology of Design Approved In Senate-43
Learning Design for effectiveness –Level 1

Objectives
Learning Outcomes This course will help students understand
• The importance of modeling systems to realize effective designs
• Abstraction of key elements from problem situations

Use of specific techniques to model problems in a holistic manner
Contents of the  Real-world problems & the need for inter-disciplinary approaches [2]
course
 Basic concepts of systems thinking (parts, relations, patterns) [6]
 Technique#1: Rich Pictures

 Technique#2: Mapping Stake holder, Needs, Alterables, Constraints [6]
 Technique#3: Structural Modeling (Hierarchical decomposition) [6]
 Technique#4: Influence Diagrams (Self-regulating systems) [6]
Essential Reading 1. Hitchins, DerekK. (2007) Systems Engineering: A 21st Century Systems
Methodology, John Wiley, ISBN: 978-0-470-05856-5.
2. Wilson, Brian (1991) Systems: Concepts, Methodologies and Applications. 2nd
Edition, Wiley. ISBN: 0471927163. Hutchinson, William; Systems Thinking
and Associated Methodologies, Praxis Education. ISBN: 0 646 34145 6.
Supplementary 1. Gerald Wienberg (2001), An introduction to general systems thinking, Dorset

Reading House Publishing.
2. Sage, A.P.(1977); Methodology for Large Scale Systems, McGraw Hill, New York.
Course Name Object Oriented Programming Course Code CS2000
Computer Science and Engineering 2 0 4 4
Department (LTPC)
The course introduces students to the object oriented programming paradigm and its
Learning Objectives benefits in application development. Both C++ and Java would be used as
implementation platforms for the various object oriented features.
● To understand Object Oriented Concepts for Software Design

● To analyse various aspects of Software Design in a reusable and secure fashion
Learning Outcomes
● To create applications supporting a command line & graphical user interface in
Object Oriented fashion.
 Object oriented programming - Encapsulation – Constructors – Destructors -

Composition – Friend functions/classes – this pointer – Dynamic memory
management (8L)
 Operator overloading Reusability – Inheritance – Base & derived classes –
Protected members – Constructors –Destructors in derived classes –
Course Contents public/private/protected inheritance – Polymorphism (9L)
(with approximate  Virtual functions - Templates – Function & Class templates – Streams – Stream
breakup of hours for input Output Stream format states – Manipulators – Exception handling – Re–
lecture/ throwing exceptions –specifications–and exception handling – Inheritance – STL
tutorial/practice) (9L)
 Event Handling, Applets, – Frames, Buttons, Menu – Visual design layout,
Multithreading, Networking, Database connectivity support (10L)
 Practice component will test drive the concepts covered in theory using C++/Java
approximately for 14 sessions in the semester [Overall 36 Hours Theory + 28
Hours for lab ]
1. Deitel P J and Deitel H M, C : How To Program, Prentice Hall, 10thEdn, 2016,

ISBN 9780131596825
Essential Reading 2. Deitel P J and Deitel H M, Java: How To Program, Prentice Hall, 9 thEdn, 2016,
ISBN 978-0132575669
1. David Flanagan, Java in a Nutshell, 5th Edition, O‘Rielly, 2005, ISBN

9780596007737
Supplementary 2. Herbert Schildt, Java: A Beginners Guide, 9th Edition, McGraw Hill, 2014, ISBN
Reading 9781260440218
3. HerbetSchildt, Teach Yourself C++, 4th Edition, Tata McGraw Hill, 2003, ISBN
978-0070532465
Course Name Digital System Design Course Code CS2001
Computer Science and Structure

Offered by Department 3 1 0 4
Engineering (LTPC)
Offered for B.Tech Course Type Core
To introduce the basic understanding of digital representation, Boolean algebra and the
Learning Objectives operation of the logic components, combinational and sequential circuits, and to
introduce the analogy device concepts like diode, FET and op-amp.
● To understand Digital Number systems, fixed and floating point representation

and arithmetic operations.
● To use Boolean Algebra and Switching theory for Logic minimization.
Learning Outcomes ● To implement Combinational Circuits using Primitive gates and logic functions.
● To implement sequential circuit elements and finite state machines.
● To design various circuits using Op-Amp 741 such as summing, difference,

average, logarithmic amplifiers etc.
 Digital Circuits: Number Representation: Fixed point and floating point, 1‘s and
2‘s complement. Switching Theory: Boolean algebra, switching functions, Truth
Tables and Algebraic forms, Simplification of Boolean expressions – Algebraic
methods, canonical forms and Minimization of functions using K-Maps. (5L,1T)
 Binary Codes: BCD, Gary, Excess 3, Alpha Numeric codes and conversion circuits.
(3L,1T)
 Arithmetic circuits: Binary adders and sub tractors, multipliers and division,
ALU. (5L,2T)
 Synthesis of combinational logic functions using MSIs: mux/de-mux,
Course Contents (with decoders/encoders, Priority encoders, Comparators. (2L,2T)
approximate breakup  Sequential Circuits: Latches and Flip-Flops: SR, JK, D, T; Excitation tables.
of hours for lecture/ (2L,1T)
 Shift Registers, Counters, Random Access Memory. (3L,1T)
tutorial/practice)  Synchronous sequential circuits: Finite State Machines- Mealy & Moore types-
Basic design steps- Design of counters, sequence generators, and sequence
detectors - Design of simple synchronous machines – state minimization. (8L,3T)
 Analog Circuits: Diodes – Basics and Circuits – Clippers, Clampers, rectifiers.
(3L,1T)
 Operational amplifiers (op-amp) – Basics and op-amp circuits – non inverting and
inverting amplifiers – Signal offset. (4L,1T)
 Analog to Digital and Digital to Analog Conversion and circuits, Applications of
Digital ICS: 555 Timer, V to F converters, Introduction to Logic Families, Noise in
Digital System. (7L,1T)
1. M. Mano and C. Kime, ―Logic and Computer Design Fundamentals,‖ Prentice

Hall, Upper Saddle River, NJ, 4 th Edition, ISBN-13: 978-9332518728, 2008.
Essential Reading
2. B. Razavi, ―Fundamentals of Microelectronics,‖ Wiley Student Edition, ISBN:
978-1-118-15632-2, 2010.
1. Sedra and Smith, Microelectronic Circuits, 7th Edition, ISBN-13: 978-

0198089131, Oxford University Press, 2013.
2. J. F. Wakerly, ―Digital Design - Principles and Practices,‖ 3 rd Edition,
Pearson, ISBN-13: 978-9332508125, 2008.
3. M. M. Mano, ―Digital Design,‖ PHI, ISBN-13: 978-0-13-277420-8, 1979.
Supplementary
4. S. Franco, ―Design with Operational Amplifiers and Analog Integrated
Reading
Circuits,‖ McGraw-Hill Series in Electrical and Computer Engineering, 4th
Edition, ISBN-13: 978-0072320848, 2015.
5. R. J. Tocci, N. S. Widmer, and G. L. Moss, ―Digital Systems Principles and
applications,‖ Pearson Prentice Hall,10th Edition, ISBN-13 : 978-0135103821,
2010.
Course Name Design and Analysis of
Course Code CS2002
Algorithms
Offered by Department Computer Science and Structure

3 1 0 4
Engineering (LTPC)

 To design time or space efficient algorithms using well known paradigms.
Learning Objectives  To understand the limitations of computing machines.
 To explore tractable vs intractable problems.
 To design efficient algorithms using paradigms such as divide and conquer,
dynamic programming, greedy method etc.
Learning Outcomes
 To differentiate easy vs hard problems.
 To design polynomial-time algorithms with proof of correctness.
 Review of time/space complexity – recurrence relations – recurrence tree

method – master‘s theorem (5L,2T)
 Incremental and decremental strategies – divide and conquer – case
studies – lower bounds for sorting (5L,3T)
 Greedy Method – Container loading – knapsack – scheduling – coin change
– proof of correctness (8L,2T)
 Dynamic programming – matrix chain, optimal binary search tree,
Course Contents (with travelling salesman, LCS, knapsack, greedy vs dynamic programming –
approximate breakup of Principle of optimality, overlapping sub problems – Dynamic programming
hours for vs Divide and Conquer (8L,2T)
lecture/tutorial/practice)  Graph algorithms – Topological sort – Shortest path algorithms –
Dijskstra‘s Algorithm, – Bellman-Ford‘s Algorithm – minimum spanning
tree – Principle of optimality (8L,2T)
 Tractability - Introduction to NP-completeness – NP, NP-hardness,
polynomial-time reductions (6L,1T)
 Coping with intractable problems - Branch and bound – Back tracking –
case studies (5L,1T)
 Solvable vs Unsolvable problems – Halting problem, Reducibility to
Halting problem (3L)
1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, ―Introduction to Algorithms,‖

Prentice Hall India, 2nd Edition, 2001. ISBN 978-0-262-53305-8
Essential Reading
2. E. Horowitz, S. Sahni, and S. Rajasekaran, ―Computer Algorithms,‖ 2nd
Edition, Galgotia Publications, 2007. ISBN 0-7167-8316-9
1. Aho, Hopcroft, and Ullmann, ―Data Structures & Algorithms,‖ Addison
Wesley, 1983. ISBN13: 9780201000238
Supplementary Reading
2. Algorithm Design , Eva Tardos and Kleinberg, Pearson, 2006, ISBN-13 : 978-
0321295354
Course Name Digital System Design Practice Course Code CS2003
Offered by Department Computer Science and

Structure 0 0 4 2
Engineering
Learning Objectives To provide hands on design and implementation of analogy and digital circuits.
Students will build simple digital systems on general purpose PCBs.
 To implement and verify logic circuits

 To implement and verify arithmetic circuits using discrete components
Learning Outcomes  To implement and verify digital systems using Combinational/
Sequential elements
 To implement and verify analog circuits
 Design and implementation of logic functions, combinational circuits

(code converters, half & full adders, comparator, ripple carry adder,
Course Contents (with priority encoder, Decoders, Seven segment display, multiplexer)
approximate breakup of  Design of sequential Circuits.
hours for  Design of 4-bit ALU (Adder, subtract or, logic and shift operations).
lecture/tutorial/practice)  Design project
 Static characteristics of rectifiers and filters, clipping and clamping
circuits, Op-Amp based amplifier circuits.
 Design and implementation of a digital system.
1. S. Franco, ―Design with Operational Amplifiers and Analog Integrated

Circuits,‖ McGraw-Hill Series in Electrical and Computer Engineering, 4th
Essential Reading Edition, ISBN-13: 978-0072320848, 2015.
2. S. Brown and Z. Vranesic, ―Fundamentals of Digital Logic with VHDL Design,
‖TMH, 3rd Edition, ISBN-13 : 978-0077221430, 2008.
1. R.J. Tocci, N. S.Widmer, and G. L. Moss, ―Digital Systems Principles and

applications,‖ Pearson Prentice Hall, 10th Edition, ISBN-13 : 978-0135103821,
Supplementary Reading 2010.
2. D. A. Neaman, ―Electronic Circuits,‖ TMH, 4th Edition, ISBN-13: 978-
0070634336, 2006.
Design and Analysis of Algorithms
Practice
Department (LTPC)
 To design time or space efficient algorithms using well known paradigms.

Learning Objectives  To understand the limitations of computing machines.
 To explore tractable vs intractable problems.
 To design efficient algorithms using paradigms such as divide and conquer,

dynamic programming, greedy method etc.
Learning Outcomes
 To differentiate easy vs hard problems.
 To design polynomial-time algorithms with proof of correctness.
 The laboratory component will require the student to write computer programs
Course Contents (with
using a careful choice of data structures and algorithmic paradigms (in C++/Java
approximate breakup
language) from scratch, based on the concepts learnt in the theory course.
of hours for
 Case studies in respect of different paradigms discussed in theory shall be
lecture/tutorial/
implemented in C++/Java
practice)
 Paradigms – Divide and conquer, dynamic programming, greedy, backtracking.
1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, ―Introduction to Algorithms,‖

Prentice Hall India, 2nd Edition, 2001. ISBN 978-0-262-53305-8
Essential Reading
2. E. Horowitz, S. Sahni, and S. Rajasekaran, ―Computer Algorithms,‖ 2nd Edition,
Galgotia Publications, 2007. ISBN 0-7167-8316-9
1. Aho, Hopcroft, and Ullmann, ―Data Structures & Algorithms,‖ Addison Wesley,
Supplementary 1983. ISBN13: 9780201000238
Reading 2. Algorithm Design , Eva Tardos and Kleinberg, Pearson, 2006, ISBN-13: 978-
0321295354
Course Name Smart Product Design Course Code DS2001
SIDI 1 2 0 3
Department (LTPC)
Prerequisite Systems Thinking for Design Approved In Senate-43
The objective of this course to help the students understand and apply the concepts of
Learning Objectives
designing smart/intelligent products, i.e., information intensive and context sensitive
At the end of the course, the students will:

 Identify and define the right type of intelligent behaviour for a chosen product
concept
Learning Outcomes  Design high-level functional and component (structural) architecture for
intelligent behaviour using appropriate metaphor and analogy
 Evaluate and select the right AI technique for the proposed functional and
component architecture and vice versa
Module 1: Introduction to intelligence behaviour (9 hours)

 Definition of intelligence
 Dimensions of intelligence
 Levels of intelligence
Module 2: Architecture for intelligent behaviour (15 hours)

 Functional arch for Intelligent Behaviour (Intelligence and information
 intensity relation (equilibrium, amplification))
 Biological metaphors for cyber-physical systems (Bio-inspired adaptive
 systems (Positive and negative feedback)
 Theory of living systems (Self evolve, self-improve, self-aware (e.g., self-
approximate breakup
configuration, -organization, -optimization) properties)
of hours for lecture/
tutorial/practice)
Module 3: Selection of appropriate AI Techniques (18 hours)
Rule-based systems - Fuzzy inferencing - Artificial neural networks -
 Evolutionary computation -
 determine which type of intelligent system methodology would be suitable
 for a given type of application problem
 Demonstrate a working prototype, in the form of a major project work, the
 ability to design and develop an intelligent system for a selected application.
 Poster Session
 Evaluation: Continuous assessment (40%); Final concept presentation (20%);
End Sem (40%)
1. Donald A Norman (2007), The design of future things, Basic Books, New York
Essential & 2. Dario Floreano and Claudio Mattiussi (2008), Bio-Inspired Artificial
Supplementary Intelligence: Theories, Methods and Technologies, MIT Press
Reading 3. Michael Negnevitsky (2005), Artificial Intelligence: A Guide to Intelligent
Systems, Second Edition, Addison Wesley
Computer Organization and
Architecture
Department (LTPC)
The course aims to introduce various aspects of computer organization such as

Instruction format, Instruction codes, Addressing Modes, processor design and
Learning Objectives
hierarchical memory design, Input and Output Interface design using Programmed
Controlled and Interrupt Control way
 Understand the organization of a Computer system and ISAs

 Apply the knowledge of combinational and sequential logical circuits to design
computer architecture.
 Understand the input / output and Memory related concepts.
Learning Outcomes
 Analyse the performance of different scalar Computers
 Develop the Pipelining Concept for a given set of Instructions
 Distinguish the performance of pipelining and non-pipelining environment in a
processor
 Introduction: function and structure of a computer, functional components of a

computer, performance of a computer system. Instruction set architectures – CISC
and RISC architectures. (5L,1T)
 Instructions: Language of the Computer, Operations of the Computer Hardware,
Operands of the Computer Hardware, Representing Instructions in the Computer,
Logical Operations Instructions for Making Decisions, addressing Modes,
Parallelism & Instructions. (5L,1T)
 Arithmetic Design: – Carry look ahead adder, Wallace tree multiplier, Floating–
point adder/sub tractor, Division. (5L,2T)
 The Processor: Logic Design Conventions, Building a Data path, A Simple
Course Contents (with Implementation Scheme (3L,1T)
approximate breakup  An Overview of Pipelining, Pipelined Data path and Control, Data Hazards:
of hours for lecture/ Forwarding versus Stalling, Control Hazards, Exceptions and Parallelism via
Instructions. (7L,2T)
tutorial/practice)  Memory Hierarchy: Introduction, Memory Technologies (SRAM, DRAM), The
Basics of Caches, Measuring and Improving Cache Performance, Dependable
Memory, Virtual Machines, Virtual Memory, A Common Framework for Memory
Hierarchy, using a Finite State Machine to Control a Simple Cache, Parallelism
and Memory Hierarchies: Cache Coherence, Parallelism and Memory Hierarchy:
Redundant Arrays of Inexpensive Disks and
 Implementing Cache Controllers. (9L,2T)
 Input/output Unit: access of I/O devices, I/O ports, I/O control mechanisms –
Program Controlled I/O. Interrupt controlled I/O and DMA controlled I/O; I/O
interfaces – Serial port, parallel port, USB port, SCSI bus, PCI bus; I/O peripherals
– Keyboard, display, secondary storage devices. (8L,2T)
1. Patterson and Hennessy, ―Computer Organization and Design,‖ Morgan

Kaufmann, 5th Edition, ISBN-13: 978-8131222744, 2013.
Essential Reading
2. C. Hamacher, Z. Vranesic, and S. Zaky, ―Computer Organization,‖ Tata McGraw
Hill, 5th Edition, ISBN-9789339212131, 2002.
1. J. P. Hayes, ―Computer Architecture and Organization,‖ Tata McGraw Hill, ISBN-

13: 978-1259028564, 2017.
Supplementary 2. M. J. Murdocca, V. P. Heuring, ―Computer Architecture and Organization - An
Reading Integrated Approach,‖ John Wiley & Sons Inc., ISBN-13:978-0471733881, 2007.
3. A. S. Tanenbaum, ―Structured Computer Organization,‖ Prentice Hall, 5 th Edition,
ISBN-13 : 978-0132916523, 2006.
Course Name Database Systems Course Code CS2008
Offered by Structure(LTP
Department C)
Objective of the course is to equip students with skillsets required for database design
and implementation. Various concepts such as ER modelling, Schema Mapping,
Learning Objectives
Normalization, Lossless Join etc. would be explored to help in efficient an and effective
databases.
● To appreciate the systematic design and principals involved in any database

development.
Learning Outcomes ● To understand the Importance of canonical normal forms and its design in large
scale database systems
● To design and implement Database with formal analysis and design thinking
Introduction to Database Systems, Database System Architecture, Schema, Database

Models, Relational Model, ER Modelling and case studies. (7L,2T)
Expressive power of relational databases, Relational Algebra (5L,2T)
Database Languages, DDL, DML, Structured Query Language (SQL), SQL views, case
approximate breakup
studies (8L,3T)
of hours for
Database Design, Normal Forms (First to third normal form), Boyce codd Normal Form,
lecture/tutorial/
Database decomposition, Functional Dependencies, Loss-less Join decomposition (8L,2T)
practice)
Transaction Processing and Concurrency control (4L,1T)
Internal schema Design, Indexing, B-trees, B+ trees (5L,2T)
Introduction to advanced concepts like Data mining, Data warehousing, XML(5L)
1. R. Elmasri and S. B. Navathe, ―Fundamentals of Database Systems,‖ Pearson, 7th

Essential Reading
Edition, 2016, ISBN 9789332582705
1. A. Silberschatz, H. F. Korth, and S. Sudharsan, ―Database System Concepts,‖ Tata

McGraw Hill, 6th Edition, 2011, ISBN 9332901384.
Supplementary
2. C. J. Date, A. Kannan, and S. Swamynathan, ―An Introduction to Database
Reading
Systems,‖ Pearson, 8th Edition, 2006, ISBN 978-0321197849
Course Name Theory of Computation Course Code CS2009
Department (LTPC)
This course aims to provide fundamentals of computing models such as finite state
automata, push down automata, linear bounded automata and Turing machine. Powers
Learning Objectives
and limitations of the models will also be discussed. Solvability and Tractability will be
introduced through Turing machine
 To design various computational models useful for solving problems

 To understand the relationship among digital computer, algorithm and Turing
Learning Outcomes
machine.
 To verify whether a given problem is solvable or tractable.
 Finite Automata & Regular Languages - (10L,3T)

 Languages vs Problems. Finite State Automata, Regular Languages. Closure
properties, Limitations, Pumping Lemma, Myhill-Nerode relations, Quotient
Construction. Minimization Algorithm.
 Non-determinism, Regular Grammar & Regular Expressions - (10L,3T)
 Notion of non-determinism. Acceptance condition. Equivalence of NFA and DFA.
Regular Grammar and NFA, Pattern matching and regular expressions. Regular
Expressions and Regular languages. More closure properties of regular languages.
 Push Down Automata & Context-free Languages (CFLs) - (12L,4T)
approximate breakup
 Grammars and Chomsky Hierarchy, CFLs, Chomsky Normal Form, Pumping
of hours for
Lemma for CFLs, Inherent Ambiguity of Context-Free Languages, Cock-Younger-
lecture/tutorial/
Kasami Algorithm, Applications to Parsing. Pushdown Automata (PDA), PDA vs
practice)
CFLs. Non-equivalence of Deterministic and non- deterministic versions of PDA.
Deterministic CFLs.
 Linear Bounded Automata, Turing Machines & Computability - (12L,4 T)
 Introduction to Linear Bounded Automata (LBA), Turing Machines. Context
Sensitive Language Vs LBA. Turing Machine vs Phrase Structure Language.
Multi-tape Turing machines. Recursive and Recursively enumerable languages.
Undecidability of Halting Problem. Reductions. Introduction to Theory of NP-
completeness.
1. Introduction to Automata Theory, Languages and Computation, Hopcroft, Motwani,

Essential Reading
and Ullman, Pearson Publishers, Third Edition, ISBN: 9780321455369, 2006.
1. Elements of the Theory of Computation, H. R. Lewis and C.H. Papadimitriou, Prentice

Hall Publishers, ISBN. 0-13-2624 78-8, 1981
Supplementary 2. Introduction to Languages and the Theory of Computation, John. C. Martin, Tata
Reading McGraw-Hill, ISBN 978-00731914612003.
Computer Organization and
Architecture Practice
Department (LTPC)
Exposure to assembly language programming, instruction set design, and processor

design for a given instruction set are given. Assembler macros, interrupt service
Learning Objectives
routines, and simple device driver programs would also be introduced. Computer system
design concepts are introduced.
● Assembly Language Instructions and programming

● Machine code based program execution
Learning Outcomes ● Input and output device interfacing and programming
● Programming Interrupt service routines
● Writing device driver program to control and monitor the peripheral device
Exercises will mainly involve writing the assembly language programs ‐ Execution of
assembly language programs: Single–step, break points, Accessing the contents of
registers, accessing the contents of memory locations ‐ Implementation of higher level
approximate breakup
language assignment statements with arithmetic expressions and logical expressions ‐
of hours for
Implementation of control transfer statements. Macros ‐ Software interrupts ‐ Operating
lecture/tutorial/
system function calls ‐ Interrupt service routines ‐ Simple device drivers ‐ Assembly
practice)
language programming in C language. I/O interfacing and programming. Computer
System Design.
1. Patterson and Hennessy, ―Computer Organization and Design,‖ Morgan Kaufmann,

Essential Reading
5th Edition, ISBN-13 : 978-8131222744, 2013.
Supplementary 1. C. Hamacher, Z. Vranesic, and S. Zaky, ―Computer Organization,‖ Tata McGraw

Reading Hill, ISBN-9789339212131, 2002.
Course Name Database Systems Practice Course Code CS2011
Department (LTPC)
The focus of this course is on database design, architecture, and relational models.
Normal forms, internal schema design would also be explored. This course introduces
Learning Objectives
SQL programming. Database design preserving functional dependencies and loss-less
decomposition properties would be addressed.
● Conceptual design using ER diagrams, programming using structured query
language, Ability to Design and Implement Database based on formal guidelines
Learning Outcomes
● Students would also be equipped with skills required for basic application
development involving database connectivity.
Introduction to SQL. Schema, table creation using SQL, Data definition and data
manipulation using SQL. Implementation of set theoretic operations on databases.
approximate breakup
Views using SQL. Implementation of algorithms related to functional dependencies and
of hours for
loss-less decomposition. Indexing using B-trees and B+ trees (creation, insertion,
lecture/tutorial/
deletion).
practice)
Assignment/Mini project-based application design and development involving database
1. R. Elmasri and S. B. Navathe, ―Fundamentals of Database Systems,‖ Pearson, 7th

Essential Reading
Edition, 2016, ISBN 9789332582705
1. A. Silberschatz, H. F. Korth, and S. Sudharsan, ―Database System Concepts,‖ Tata

Supplementary McGraw Hill, 6th Edition, 2011, 978-0321197849
Reading 2. C. J. Date, A. Kannan, and S. Swamynathan, ―An Introduction to Database
Systems,‖ Pearson, 8th Edition, 2006, ISBN 978-0321197849
Course Name Introduction to Data Science for
Course Code CS3006
Engineers
Structure
Offered by Department Computer Science and Engineering 3 0 2 4
(LTPC)
This course covers the basic concepts of Data Science to help the student to learn,
Learning Objectives understand and practice data analytics encompassing concepts from descriptive,
inferential statistics and predictive techniques and big data concepts.
● Ability to identify the characteristics of datasets; Ability to select and implement

machine learning techniques suitable for the respective application;
● Ability to solve problems associated with big data characteristics such as high
Learning Outcomes
dimensionality;
● Ability to integrate machine learning libraries and mathematical and statistical
tools
 Introduction to relevant industry applications and analytics – Descriptive Statistics

– Data Visualization & Interpretation -Measures of Central Tendency & Dispersion
- Basic and advanced plots such as Stem-Leaf Plots, Histograms, Pie charts, Box
Plots, Violin Plots etc. – Merits of Demerits & Interpretation (10)
 Inferential Statistics – Hypothesis Testing - Tests of Significance – Analysis of
Variance - Regression – Linear and Logistic (8)
 Predictive Analytics – Supervised and Unsupervised – Association Rules,
Course Contents (with Classification, Clustering, Outlier Analysis, Time Series Modelling (14)
approximate breakup of  Big Data Characteristics – Map Reduce – Deduplication, Distributed Storage,
hours for Implementation using Hadoop / Pyspark platforms (8)
lecture/tutorial/practice)  Practice Component: Concepts from Descriptive Statistics, Inferential and
Predictive Analytics would be test driven using platforms such as Python, R etc. ML
support in these platforms for rule mining and application, classification &
clustering algorithms etc. would also be test driven as part of the practice exercises.
Modern technologies for big data handling such as Pyspark – support for Map
reduce would also be test driven. Applications relevant to the student‘s stream of
Offered by Department would be explored for exercises / course project as case
studies. (14 sessions – weekly exercises)
1. J Han, M Kamber, Data Mining Concepts & Techniques, Elsevier, 3rd Edition, 2007,
Essential Reading
ISBN 9780123814791
1. Joel Grus, Data Science from Scratch, Orielly, 2nd Edn, 2019, ISBN 9781492041139
2. Leskovec, Anand Rajaraman,, Ullmann, Mining of Massive Data Sets, Cambridge
Supplementary Reading University Press, Open Source free version , ISBN 9781107015357
3. P Bruce, Practical Statistics for Data Scientists, O‘Reilly, 2017, ISBN
9789352135653
Course Name Entrepreneurship and Course Code DS3000
Management Functions
Offered by SIDI Structure (LTPC) 1 2 0 3

Department
To be offered for B.Tech Course Core
Type(Core/Elective)
Prerequisite Systems Thinking and Design Approved In Senate-43
Learning The objective of this course is to provide engineering students an exposure to the basic concepts
objectives of entrepreneurship and management, with a specific focus on the process of turning an idea
into a commercially viable venture.
Learning At the end of the course, the students will learn how to
Outcomes
 Understand the market
competition
 Prepare a business case for the product/Idea
Contents of the Module1: Introduction

Course  Division of labor and creation of value
 Evolution of organizations, industries and sectors, for profit and non-profit
 Role of Entrepreneurs and Managers in value creation
 Principles of Management- Planning, Organizing, Resourcing, Directing (4)
Module2: Strategy & Planning

 Understanding industry dynamics & competition (Porter's Framework)
 Understanding the industry value chain and firm positioning (6)
Module3: Organizing
 Typical organizational functions (R&D, Marketing & Sales, HR, Operations)
 Cybernetics of organizational functions (Stafford Beer's viable systems model)
 Types of organization structures (product, functional, matrix, global) (6)
Module4: Resource Management

 Financial management (Sources of funding, how to read a P&L, balance sheet)
 Human resource management (Interviewing, compensation, motivation)
 Global sourcing and supply chain management (8)
Module5: Management Information & Decision Making (4)
Module6: Legal and Regulatory environment (4)
Essential 1. Peter F Drucker, The Practice of Management, Harper Collins, 2006, ISBN:978-
Reading 0060878979
2. Hentry Mintzberg, Managing, Berret-Koehler Publishers, 2009, ISBN:978-1605098746
3. Michael Porter, On competition: Updated and Expanded Edition, HBS, 2008, ISBN:978-
1422126967
4. Vasanta Desai, Dynamics of Entrepreneurial Development and Management, Himalaya
Publishing House, ISBN: 9788183184113.
Supplementary 1. Walter Isaacson, Steve Jobs, 2011, ISBN:978-1451648539

Reading 2. Eric Ries, The Lean Startup, Portfolio Penguin, 2011, ISBN:978-0307887894
3. Vineet Bajpai, Build from scratch, Jaico books, 2013, ISBN:9788184952919.
Course Name Operating Systems Course Code CS3000
Department (LTPC)
This first level course focuses on exposing students to the purpose, structure and
functions of an operating system. Operating systems abstraction, mechanisms and
Learning Objectives
their implementation support for concurrency (threads) and synchronization, resource
management, scheduling strategies, etc. are explored.
● Sound understanding of basic concepts relating to the design and implementation

of an operating system.
● Specifics relating to scheduling, multithreading, synchronization, etc. to
Learning Outcomes understand the structure of the operating system (Linux), at the concept and the
source code level.
● Ability to use Kernel API support to implement various features to be supported by
an OS
Functionalities & Services of an Operating System – System Calls & Types - Process
Concept – Process Control Block – Linux System calls for Process creation, Inter
Process Communication using Shared memory / Message passing. (10L,2T)
Concurrency – Multithreaded programming – benefits, challenges, models, Pthreads
library in Linux – thread creation, cancellation, thread specific data, Thread pools,
Signal handling, Scheduling – Pre-emptive, Non pre-emptive algorithms FCFS, SJF,
SRT, RR – Thread scheduling – contention scope, pthread support for scheduling.
approximate breakup
(11L,3T) Synchronization – Race condition – Critical Section Problem, Solution, Mutex
of hours for
Locks and Semaphores – Priority Inversion, Pthreads synchronization - Producer
lecture/tutorial/
Consumer problem (multi-threaded) example Deadlock characterization – Resource
practice)
graph – Avoidance & Prevention – Safe state – Bankers algorithm – recovery schemes.
(10L,3T)
Memory management – logical v/s physical address space – Segmentation, Paging,
Page table structures, Virtual memory, Page replacement strategies, File Systems –
file operations, types, access methods, Directory structure, Mounting file systems.
(11L,3T) Introduction to operating systems for hand held devices - RTOS, Free RTOS
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System

Essential Reading
Concepts, John Wiley, 9th Edn, 2015, ISBN 978-0471694663
1. Andrew S Tanenbaum, Modern Operating Systems, Prentice Hall, 2009, ISBN

9788120339040
Supplementary 2. Stallings. W, Operating System: Internals and Design Principles, Prentice Hall,
Reading 2011, ISBN 9332518807
3. Gary Nut, Operating Systems: A Modern Perspective, Addison Wesley, 2003, ISBN
978-0201773446
Course Name Computer Networks Course Code CS3001
Department (LTPC)
To introduce the basics of computer networking, error detection and correction

techniques, and flow control techniques. Also an exposure to IP addressing and routing
Learning Objectives
and its associated protocols would be given. A highlight of various application layer
protocols and its relevance in modern networking world would be discussed.
 To design a local area network and analyse the network using performance
metrics.
Learning Outcomes
 To appreciate the importance of sub netting, masking, and nuances involved in
setting up a campus network.
 Evolution of computer networks, creating a small network, Data transfer

between nodes, encoding of bits in physical layer, NRZ, Manchester, Differential
Manchester, Performance evaluation of a network: propagation delay,
transmission delay, RTT, effective bandwidth. (10L,3T)
 Error detection techniques in Data link layer (LRC, CRC, two dimensional
parity check), Hamming Error correcting codes. Data transfer between nodes
using stop and wait protocol, sliding window protocol (Go-back-n and selective
reject), performance analysis of stop and wait and sliding window protocols.
Flow control at data link layer. Introduction to layer-2 devices (switches,
approximate breakup
bridges) and addressing scheme at Layer-2 (MAC addresses). (10L,3T)
of hours for
 Creating a small network using Ethernet (IEEE 802.3) Token Ring (IEEE
lecture/tutorial/
802.5), Performance evaluation of IEEE 802.3 and 802.5 networks. Introduction
practice)
to Layer-3 devices, IP addresses, IPv4, IPv6, Error detection at layer-3 using
Checksum. IP addressing schemes, sub netting, CIDR (10L,3T)
 Introduction to TCP/IP, IP routing, RIP, OSPF, Circuit and Packet switching,
ICMP,
 Introduction to networking commands: Ping, Traceroute, Ipconfig, UDP,
congestion control and avoidance. (10L,3T)
 Introduction to DHCP, FTP, HTTP(s) and other application layer protocols,
Introduction to Network security. (5L)
1. Larry L.Peterson and Bruce S Davie, Computer Networks: A systems Approach,

Morgan, 5th Edn, 2011. ISBN: 9780123850591
Essential Reading
2. William Stallings, Data and Computer Communications, 10th Edn, Pearson, 2017.
ISBN: 9780133506488
1. Andrew S. Tanenbaum, Computer Networks, 5th Edn, 2014. ISBN: 9788131770221

Supplementary
2. Behrouz Forouzan, TCP/IP protocol suite, Tata McGraw Hill, 4th Edn, 2010. ISBN:
Reading
9780070706521
Course Name Compiler Design Course Code CS3002
Department (LTPC)
The objective of this course is to train students to design various phases of compiler such
as Lexical analyser, syntax analyser, semantic analyser, intermediate code generator,
code optimizer and code generator. Students are also exposed to design compiler
Learning Objectives
construction tools such as Lexical Analyser generator and parser generator. Applications
of finite state machine and pushdown automation in compiler design are also taught in
this course.
 At the end of the course, students will be able to design a programming language
Learning Outcomes and compiler for the same.
 Students will also be able to write large programs.
 Need of compiler-cross Compiler-Introduction to phases of compiler –Lexical

Analyser Design using DFAs —regular expression and its application to give
syntax of word –Automatic design of Lexical Analyser from regular expression,
Construction of NFA without epsilon moves from regular expression- Efficient
Lexical analyser using Minimization of automata- limitation of recognition
capability of Lexical analyser using Pumping lemma (12L,3T)
 Context free grammar & its application to give syntax of program statement –
Types of parsing – Top down & bottom up–Recursive descent– Predictive–Shift
approximate breakup
reduce–Operator precedence–SLR (10L,3T)
of hours for
 Semantic analysis - Intermediate code generation: Declaration – Assignment
lecture/tutorial/
statements – Boolean expressions– looping and branching statements (7L,2T)
practice)
 Back patching and procedure calls code generator design issues – Runtime
storage management – Code Optimization: Basic blocks – Flow graphs – Next
use information – Code generator case study – Directed acyclic graph
representation of basic blocks – Peephole optimization technique Introduction to
code optimization (10L,3T)
 Storage optimization & allocation strategies). Assembly Code Generation: from
syntax tree and Directed acyclic graph - from three address code. (5L,1T)
1. Alfred Aho, Ravi Sethi and Jeffrey D Ullman, Compilers Principles, Techniques and
Essential Reading
Tools, Pearson Education, 2003. ISBN: 9780321491695
1. Levine J.R, Mason T, Brown D, Lex &Yacc, OReilly Associates, 1992 ISBN:
Supplementary
9781565920002.
Reading
2. Allen I. Holub, Compiler Design in C, Prentice Hall, 2003. ISBN: 9780131550452
Course Name Operating System Practice Course Code CS3003
Department (LTPC)
To be Offered for B.Tech Course Type Core
The course aims to equip the student with implementation level constructs / support in
Learning Objectives Linux for various concepts such as process management, concurrency, scheduling,
deadlock avoidance, etc.
● To relate the operating system concepts listed above to the Linux operating system
and support for the same available through various system calls.
Learning Outcomes ● To use LINUX Kernel Support for various features such as multiprocessing
multithreading etc.
● To Test Drive various Features of an OS relating to application scenario
Linux System Calls for process creation, management – Applications such as command
prompt simulator using fork – Interposes Communication using Shared Memory and
Pipes – Producer Consumer – Applications using pipes / shm – Concurrency –
approximate breakup
Multithreading –Pthread support – Applications such as merge sort, min-max-average,
of hours for
etc. in a multi-threaded fashion – Scheduling –pthread interfaces set sched policy – get
lecture/tutorial/
sched policy based applications – Synchronization – threaded solution for classical
practice)
problems like dining philosophers, readers writers, etc. using mutex locks and
semaphores - Deadlock detection / avoidance algorithms.
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Concepts,
Essential Reading
John Wiley, 9th Edn, 2015, ISBN 9788120339040
1. Robert Love, Linux Systems Programming, O Reilly Media, 2nd Edition, 2013, ISBN
Supplementary 9781449339531
Reading 2. D Butlar, J Farrell, B Nichols, Pthreads Programming, O Reilly Media, 1996, ISBN
9781565921153
Course Name Computer Networks Practice Course Code CS3004
Department (LTPC)
To understand basic networking commands, MAC/IP addressing, file transfer between

Learning Objectives two systems, etc. Simulation of error control techniques and flow control techniques
using well known protocols would be addressed as part of this course.
● To design, test and troubleshoot aspects associated with local area networking.
Learning Outcomes
● To appreciate the importance of error detecting codes and flow control techniques.
Connecting two nodes using Ethernet cable and study the performance evaluation
parameters such as delay, effective bandwidth - Basic Networking commands – Ping,
Course Contents (with IP Config, Traceroute, NS lookup - Introduction to Socket Programming. File transfer
approximate breakup using TCP. Echo, Chat between two or more clients using socket programming -
of hours for Simulation of Stop and Wait Protocol -Simulation of Stop and Wait protocol with
lecture/tutorial/ NACK, Modelling of ACK, NACK drops, etc., -Modelling and simulation of Sliding
practice) window protocol - Sliding window protocol with ACK/NACK drops, frame drops etc., -
Performance evaluation through simulation of IEEE 802.3/802.5 networks -
Implementation of OSPF. Introduction to NS2/OPNET simulator, Case studies.
1. Larry L.Peterson and Bruce S Davie, Computer Networks: A systems

Approach,Morgan, 5th Edn, 2011.ISBN: 9780123850591
Essential Reading
2. William Stallings, Data and Computer Communications, 10th Edn, Pearson,
2017.ISBN: 9780133506488
1. Andrew S. Tanenbaum, Computer Networks, 5th Edn, 2014. ISBN: 9788131770221

Supplementary
2. Behrouz Forouzan, TCP/IP protocol suite, Tata McGraw Hill, 4th Edn, 2010. ISBN:
Reading
9780070706521
Course Name Compiler Design Practice Course Code CS3005
Department (LTPC)
The objective of this course is to train students to design various phases of compiler such
as Lexical analyser, syntax analyser, semantic analyser, intermediate code generator,
code optimizer and code generator. Students are also exposed to design compiler
Learning Objectives
construction tools such as Lexical Analyser generator and parser generator. Applications
of finite state machine and pushdown automation in compiler design are also taught in
this course.
● At the end of the course, students will be able to design a programming language
Learning Outcomes and compiler for the same.
● Students will also be able to write large programs.
Lexical analyser implementation in C ‐ Lexical analyser implementation using

LEX tool Recursive descent parser implementation in C for an expression
Course Contents (with grammar ‐ YACC and LEX based implementation for an expressions grammar
approximate breakup ‐ YACC implementation of a calculator that takes an expression with digits, +
of hours for and * and computes and prints its value ‐ Front end implementation of a compiler
lecture/tutorial/ that generates the three address code for a simple language‐ Back end
practice) implementation of a compiler which takes the three address code (output of
previous exercise) and results in assembly language instructions ‐
Implementation of peephole optimization in C.
1. Alfred Aho, Ravi Sethi and Jeffrey D Ullman, Compilers Principles, Techniques and
Essential Reading
Tools, Pearson Education, 2003. ISBN: 9780321491695
1. Levine J.R, Mason T, Brown D, Lex &Yacc, OReilly Associates, 1992 ISBN:
Supplementary
9781565920002.
Reading
2. Allen I. Holub, Compiler Design in C, Prentice Hall, 2003. ISBN: 9780131550452
Course Name Prototyping & Testing Course Code DS3001
SIDI 1 2 0 3
Department (LTPC)
To be offered for B.Tech Course Type Elective

The objective of the course is to help students develop rapid prototyping skills and
Learning Objectives realize a minimum viable product
● Students will develop skills in rapid prototyping; project management and focusing
Learning Outcomes
on delivering outcomes
1. Minimum viable product plan(3hours)

 Markets and Needs
 Business Goals
 Key features
2. Core Product Architecture(6hours)
 Story boarding of the product core.
 Frame work for mechanical, electronics and computing paradigm
Course Contents (with 3. Design for Manufacture & Assembly(3hours)
approximate breakup  Manufacturing Process: Form
of hours for  Assembly constraints: Fit
lecture/tutorial/
practice) 4. Developing the Proof of Concept(30hours)
 Build
 Assemble
 Iterate
 Validate
 Pitch
Evaluation: Continuous assessment (80%); Final PoC demo (20%)
2 one-day hackathons may be organized during this period (one weekends) to
accelerate PoC development
1. How to Solve Big Problems and Test New Ideas in Just Five Days by Jake
Knapp, John Zeratsky, Braden Kowitz
Essential & 2. The Total Inventors Manual: Transform Your Idea into a Top-Selling Product by
Supplementary Sean Michael Ragan
Readings 3. Prototyping and Model making for Product Design by Bjarki Hallgrimsson
Bringing a Hardware Product to Market: Navigating the Wild Ride from Concept to
Mass Production by Elaine Chen
Professional
Course Name Course Code HS3000
Communication
Offered by Department SH-English Structure (LTPC) 1 0 2 2
To be offered for B.Tech. Course Type Core
 Develop the capability to apply for a job and participate in selection process
 Acquire interview skills
Learning Objectives
 Gain proficiency in language skills indispensable for a successful professional
 Develop emotional intelligence
 Prepare résumé and cover letter

 Ready to perform at different levels of the interview process
Learning Outcomes
 Able to use interpersonal skills in challenging situations
 Competent to draft various documents for specific purposes
 Preparing cover letter, résumé, digital profile; video profile; Email etiquette (L2, P4)
 Interview skills, Group discussion and impromptu speech (L2, P6)
 Social communication skills (L4, P6)
 Conversational English appropriateness, context based speaking in general
situations, discussion and associated vocabulary in professional situations)
 Non-verbal communication – relevance and effective use of paralinguistic
features – body language, chronemics, haptics, proxemics
 Emotional intelligence (EI) and social intelligence at workplace –
Course Contents (with theoretical perspectives and their application in relevant workplace
approximate breakup situations – EI and leadership skills – assessments and best practices in
of hours for
organizations
lecture/tutorial/
practice)  Conflict management and communication at workplace (L4, P6)
 Cross-cultural communication, Argumentation, negotiation, persuasion,
decision making, case study of challenging situations
 Organizing a meeting, working as part of a team, briefing
 Business presentations – Preparing effective presentations, delivering
presentations and handling questions
 Writing proposals, statement of purpose, research article, agreements, summary
Proofreading (L1, P4)
 Training for proficiency assessment (L1,P2)
1. Tebeaux, Elizabeth, and Sam Dragga. The Essentials of Technical Communication.

OUP, 2018.
2. Sabin, William A. The Gregg Reference Manual: A Manual of Style, Grammar,
Usage, and Formatting. McGraw-Hill, 2011, pp 408-421.
3. Raman, Meenakshi and Sangeeta Sharma. Technical Communication: Principles
and Practice. OUP, 2015.
Essential & 4. Caruso, David R. and Peter Salovey. The Emotionally Intelligent Manager: How to
Supplementary Develop and Use the Four Key Emotional Skills of Leadership. John Wiley and Sons,
Reading 2004.
5. https://learnenglish.britishcouncil.org/business-english/youre-hired/episode-01
6. https://www.youtube.com/watch?v=HAnw168huqA
7. https://www.youtube.com/watch?v=azrqlQ_SLW8
8. https://owl.purdue.edu/owl/purdue_owl.html
9. Turabian, Kate L. Student’s Guide to Writing College Papers. University of Chicago
Press, 2010.
Mandatory Non-Credit Course: NCC / NSO / SSG
NCC / NSO / SSG Activities details:

The first-year students should choose any one of the above compulsory activities NSO – National
Sports Organization / NCC – National Cadet Corps / SSG – Social Service Group. These are
Pass/Fail Courses and receive no credits.
An option form (the google form) will be circulated to all the first-year students to choose any one
course (NSO / NCC / SSG) based on their interest.
NCC – National Cadet Corps: -

This is a unique scheme offered by the government to all institutions and our institute is allotted
with 52 seats across all programmes. As of now, a maximum 19 seats are reserved for the first-
year students and allotment will be allotted on an assessment and fitness test. The girls are also
encouraged to participate in NCC. The NCC Selection Trails with following physical fitness test
will be conducted.
Test 1: 1600 M Running for Boys / 1200 M Running for Girls
Test 2: 100 M Running for Boys & Girls
Test 3: 30 Push Ups for Boys / 90 Sec Plank for Girls
Test 4: 30 Sit-Ups for Boys / 20 Sit-Ups for Girls
Test 5: 30 Squad for Boys / 25 Squad for Girls
The selected students with waitlist will be included in the merit list and the same will be submitted
to NCC Office for further processing assessment.
In each Category 5 standby will be also allowed till the final NCC online enrollment is completed.
If any merit list students could not clear NCC parade, then the opportunity will be extended to
standby students. Those who opt for NCC and fail to clear the assessment shall be considered for
NSO/SSG.
Continuous Assessment: As per the NCC act there will be 30 parade per semester for 6
semesters. After 2 years of training, they will be eligible for B Certificate examination. And on
completion of 3rd year they can appear for C certificate examination. All the NCC Cadets should
attend 2 Mandatory camps (8-10 days) to become eligible for the certificate examination, one
each in B Certificate and the C Certificate. There are some national camps such as Trekking,
Leadership, EBSB and TSC, etc wherein some slots are reserved for IIITDM students and
selection will be done by the Commanding Officer of our NCC Battalion.
Certificate examination consist of Theory and practical exam. The maximum mark for the
examination will be 350 (225 marks for theory and 125 for practical). The exams will be
conducted in the month of February (mostly last week) every year.
NSO – National Sports Organization: -

The duration of NSO is 1 year, there will be 25 sessions per semester for 2 semesters. The
selection trails will be conducted, those who are not fit will be recommended to join SSG.
The Selection Trails:
Test 1: 1200 M Run for Boys / 800 M Run for Girls
Test 2: 20 Push Ups for Boys / 60 Sec Plank for Girls
Test 3: 25 Sit-Ups Ups for Boys / 20 Sit-Ups for Girls
Continuous Assessment: A student is expected to maintain 85 % attendance of weekly classes to

become eligible for final Evaluation Test.
Test 1: 1200 M Run for Boys below 7 Mins 30 Secs.

800 M Run for Girls below 6 Mins.
Test 2: 90 Sec. Push Ups for Boys – Min 25

Min 60 Secs Plank for Girls
Test 3: 90 Sec. Sit Ups for Boys – Min 30

60 Sec. Sit Ups for Girls – Min 20
Test 4: 100 M not more than 16 Sec. for Boys

100 M not more than 18 Sec. for Girls
Based on the attendance and performance in the evaluation test the result (Pass/Fail) will be
declared. The selection Trails and evaluation test will be conducted by Sr. PTI along with Sports
Secretaries. The NSO Fitness session will be conducted by Sr. PTI. The schedule for NSO Session
will be as follows
Slot 1: Monday & Wednesday

Time: 6.15 PM to 7.00 PM
Duration: 45 Minutes
Batch: A, B & C
Slot 2: Tuesday & Thursday

Time: 6.15 PM to 7.00 PM
Duration: 45 Minutes
Batch: D, E & F
After every session attendance will be taken and updated in the google sheets. The 85%
attendance is mandatory to appear in the final evaluation test.
Social Service Group (SSG)
IIITDM Kancheepuram social service group is dedicated to improving the well-being and quality of
life of people. This group works towards creating a sustainable, connected, compassionate, and
thriving society through its various initiatives and activities.
SSG Introduction Session:
Introduce the first-year volunteers of SSG with the workings/various activities of the club.
Introduction (9th January 2023)
List of Activities:
1. Plant Watering Session:

Engaging in plant watering encourages individuals to develop an awareness of the importance of
water conservation and responsible resource management. It highlights the need to use water
efficiently and avoid wastage, promoting a more environmentally conscious mindset. By
nurturing plants and green spaces, individuals contribute to a more sustainable, connected, and
thriving society.
Plant watering activity session (22nd January 2023). An activity where our social servants
watered trees and plants of our entire campus.
2. Cleanliness Drive
A cleanliness drive is a collective effort to promote cleanliness, hygiene, and the responsible
disposal of waste in a particular area or community. The impact of cleanliness drives extends
beyond the immediate physical environment. They foster a sense of pride, civic responsibility,
and community spirit, creating a cleaner and healthier society for everyone. By promoting
cleanliness and hygiene practices, these drives contribute to the overall well-being and quality of
life of individuals and communities.
Cleanliness Drive- I and II (5th February & 15th April 2023). Volunteers cleaned the entire
campus in the early morning. Total of 12 full size dustbins were filled with garbage
3. Blood Donation Camp

A blood donation camp is a specially organized event by IIITDM SSG Group where individuals
voluntarily donate their blood to help those in need. The objectives of a blood donation camp
include raising awareness, encouraging voluntary and safe donation, Engaging the community
and identifying potential donors. Participating in a blood donation camp provides individuals with
an opportunity to make a direct and tangible impact on the lives of others. It is a selfless act that
promotes community well-being, compassion, and solidarity.
Blood Donation Camp (with coordination of SAC 2022-23) - 22nd February 2023
Huge numbers of our students, faculty, and staff participated in the blood donation
4. Best Out of Waste
The "Best Out of Waste" activity is a creative and environmentally friendly initiative that
encourages individuals to repurpose and transform waste materials into useful or decorative
items. The objective of this activity is to promote recycling, waste reduction, and the utilization of
discarded materials in innovative and artistic ways. This activity not only reduces waste but also
fosters innovation and appreciation for sustainable practices.
Best out of Waste activity: (Offline + Online) - 8th April 2023. Volunteers used their creativity to
make useful items from waste matter.
5. Campus Observation activity
The campus observation activity involves exploring and observing various aspects of your campus
environment. It encourages you to pay attention to the details, understand the dynamics of our
campus, and gain insights into the community and facilities available. The campus observation
activity provides an opportunity to develop a deeper understanding of your campus environment
and engage with the community. Through this activity, you can contribute to making your campus
a better place for yourself and others.
IIITDM campus observation activity (22nd April 2023). Volunteers surveyed our entire campus
and gave reports on things that can be improved in our campus.
The SSG will also conduct various activities and initiatives apart from the above. The IIITDM
Kancheepuram Social Service Group can expand its scope of activities and effectively address the
specific needs of the community.
Assessment of the Activities:
The duration of SSG is 1 year, there will be 20 sessions (40 hours) per semester for 2 semesters.
The schedule for SSG Session is given below.
SSG Timings: Saturday: 6 am to 8 am (2 hours per session)
After every session attendance will be taken and updated in the google sheets. 85% attendance is
mandatory for getting a pass in SSG.

BT Cse

Uploaded by

Copyright:

Available Formats

BT Cse

Uploaded by

Document Information

Original Description:

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

BT Cse

Uploaded by

Copyright:

Available Formats

Curriculum and Syllabus for B.

Computer Science and Engineering

From The Academic Year 2020

Indian Institute of Information Technology Design and Manufacturing, Kancheepuram

Offered by SH -Mathematics Structure (LTPC) 3 1 0 4

Pre-requisite NIL Approved In Senate-43

 Directional derivatives – Gradient, Lagrange multipliers – Optimization problems (7)

Offered by SH -Physics Structure(LTPC) 3 0 0 3

To be offered for B. Tech Course Type Core

Pre-requisite NIL Approved In Senate-43

Contents of the  Vectors ‐ an introduction; Unit vectors in spherical and cylindrical

Supplementary 1. W. H. Hayt, J. A.Buck and M.Jaleel Akhtar, Engineering Electromagnetics,

Offered by Electronics and Communication Structure(LTPC) 3 1 0 4

1. Charles Alexander and Matthew Sadiku ‗Fundamentals of Electric Circuits‘ 7thEdition,

Offered by Department Computer Science Structure 3 0 0 3

To be offered for B.Tech Course type Core

Prerequisite NIL Approved In Senate -43

Focus is on problem solving using computers with C programming as the language.

 Computing Machine - Need and Applications - Evolution of Computing Machines

Pre-requisite NIL Approved In Senate- 43

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

 Classification and evolution of engineering materials, crystal structure, defects, crystallographic

1. William D. Callister Jr., David G. Rethwisch, ―Materials Science and Engineering: An

Offered by SIDI Structure (LTPC) 1 2 0 3

To be offered for B.Tech Course Type Core

Prerequisite NIL Approved In Senate -43

● Unbundle everyday objects, observe, reorganize

● Introduction to design sketching-1 (paper/pencil)

Offered by SH-Physics Structure(LTPC) 0 0 3 1.5

To be offered for B.Tech Course Type Core

Pre-requisite NIL Approved In Senate-43

Essential Reading 1.IIITD&M Laboratory manual for Electromagnetic Wave Practice

To be offered for B.Tech Course Type Core

Prerequisite NIL Approved In Senate-43

 Introduction to text editors - basic text processing - case studies involving

 Introduction to Linux commands - file/directory creation - copy, move, pdf

 Case studies involving selection and repetition statements - functions –

To be offered for B.Tech Course Type Core

Prerequisite NIL Approved In Senate-43

Offered by SH-Mathematics Structure (LTPC) 3 1 0 4

Essential 1. Simmons. G.F, Differential Equations, Tata McGraw Hill, 2003.

2. Sneddon. I, Elements of Partial Differential Equations, Tata McGraw Hill, 1972.

3. Ross. L.S, Differential Equations, Wiley, 2007.

4. Trench, W, Elementary Differential Equations, http://digitalcommons.trinity.edu/mono

Offered by Mechanical Engineering Structure(LTPC) 2 0 4 4

To be offered for B.Tech Course Type Core

Prerequisite NIL Approved In Senate-44

 Role of technical drawing in product development process, Basics of technical drawing,

1. PI Varghese, Engineering Graphics, McGraw Hill Education, 2013.

Offered by Department Computer Science & Engineering Structure 3 0 0 3

Offered by Department SIDI Structure 1 2 0 3

To be offered for B.Tech Course Type Core

Prerequisite Foundation Program Approved In Senate 43

Contents of the Module1: Technology, Design and Society-[9hrs]

Offered by SIDI Structure(LTPC) 0 0 2 1

To be offered for B.Tech Course Type Core

Pre-requisite NIL Approved In Senate-44

Familiarization of electronic components by Nomenclature, meters, power supplies,