Curriculum For B.Tech. 2020: Computer Science and Engineering

Curriculum for B.Tech.
2020
Computer Science and Engineering
Indian Institute of Information Technology,

Design and Manufacturing, Kancheepuram
Chennai-600 127
Salient Features of the 2020 Curriculum
SIX Design Courses as approved by the Senate and the BoG.
THREE IT courses
9 ELECTIVES
To earn the Degree from a Dept, the student has to complete all CORE courses and 3 ELECTIVES offered by
the parent Dept.
The remaining 6 electives can be chosen from any category by the student as per his/her interest.
Students can earn a MINOR if All THREE ELECTIVES are credited from a single vertical offered by another
Dept.
Students can earn a SPECIALIZATION if All FOUR ELECTIVES are credited from a single vertical offered
by the parent Dept.
Minor/Specialization Verticals available for the students should be released by each Dept. before the beginning
of their 4th Semester.
Each department will have its Minor/Specialization verticals approved by BoS & Senate by Dec 2021 for 2020
batch.
A complete plan with a list of Minor/Specialization Electives and Faculty offering the courses must be presented
in the Senate for approval.
Students must be informed about the Minor/Specialization in the beginning of their fourth semester (by Jan
2022 for 2020 batch).
Students can opt-outt of a Minor/Specialization, the electives already credited under that Minor/Specialization
will be treated as Professional/Free Electives.
Students changing Minor/Specialization after crediting a few courses in one, are to complete all 3/4 courses in
the new minor/specialization, courses are done in the previous minor will remain in the grade sheet.
Students have the option to continue 3 months internship to project from May-Dec.
Summer Internship is PASS/FAIL.
Students can opt for an Industry/Academia/Research Lab Internship (in Minor area) supervised by Institute
faculty in collaboration with the lab which earn them 8 credits that replace two electives. Department should
scrutinize such applications on merit and quality and scope of proposed work.
Students can upgrade to Dual Degree Programme in the specializations offered by the Departments and
approved by the Senate during the 5th semester.
Students opting for Design++ Minor from a Dept. will require 171 credits to earn the B Tech Degree.
Professional/free electives will be of type 3-1-0-4.
Electives with practice to be 3-0-2-4 or 2-0-4-4; crediting only the theory part is not permitted.
All existing 3-0-3 electives should be reapproved in the Senate with 3-1-0-4 with appropriate changes made in
the content / addition of tutorial hour distribution along with lecture hours.
Students who choose design electives 2-1-0-3, have to compensate for the deficit credits by taking up extra
courses.
The final year project may be made optional and the student may be allowed to credit electives from the core
branch instead subject to approval from the Senate
As 7th Semester has only Electives, Depts. can offer those online or choose from NPTEL OR shift to 8th
Semester.
Maximum credits permissible to be earned from NPTEL courses as Free Electives will be 8.
The Dept. Electives and Minor Electives are to be In-House courses.
Additional credits to be earned for Honors will be 12 credits in the new curriculum, equivalent to 3 courses.
Syllabus of 30% of core engineering courses to have 25% weightage for Problem Based Learning with exposure
to hands-on detailed design & manufacturing skills.
Every Programme should have Programme Objective, Programme Educational Objective and every course
should have Learning Objectives and Learning Outcomes.
Curriculum for B.Tech. Computer Science and Engineering 2020 Batch
Semester 1
Category Course Name L T P C
BSC Calculus 3 1 0 4
BSC Engineering Electromagnetics 3 0 0 3
BEC Electrical Circuits for Engineers 3 1 0 4
BEC Problem Solving and Programming 3 0 0 3
BEC Materials for Engineers 3 0 0 3
DSC Foundation for Engineering and Product Design 1 2 0 3
BSC Engineering Electromagnetics Practice 0 0 3 1.5
BEC Problem Solving and Programming Practice 0 0 3 1.5
HSC Effective Language and Communication Skills 1 0 2 2
HSC NSO/NCC/SSG/NSS 0 0 2 P/F
25.0
Semester 2
BSC Differential Equations 3 1 0 4
SEC Science Elective 1 3 1 0 4
BEC Engineering Graphics 2 0 4 4
ITC Data Structures and Algorithms 3 0 0 3
DSC Sociology of Design 1 2 0 3
ITC Design and Manufacturing Lab 0 0 2 1
PCC Discrete Structures for Computer Science 3 1 0 4
ITC Data Structures and Algorithms Practice 0 0 4 2
HSC NSO/NCC/SSG/NSS 0 0 2 P/F
HSC Earth, Environment and Design 1 0 0 P/F
25.0
Semester 3
DSC Systems Thinking for Design 1 2 0 3
PCC Object Oriented Programming 2 0 4 4
PCC Digital System Design 3 1 0 4
PCC Design and Analysis of Algorithms 3 1 0 4
PCC Digital System Design practice 0 0 4 2
PCC Design and Analysis of Algorithms practice 0 0 4 2
Indian Constitution, Essence of Indian Traditional
HSC 1 0 0 P/F
Knowledge
23.0
Semester 4
DSC Smart Product Design 1 2 0 3
PCC Computer Organization and Architecture 3 1 0 4
PCC Database Systems 3 1 0 4
PCC Theory of Computation 3 1 0 4
PCC Computer Organization and Architecture practice 0 0 4 2
PCC Database Systems practice 0 0 4 2
HSC Human Values and Stress Management 1 0 0 P/F
23.0
Semester 5
ITC Introduction to Data Science for Engineers 3 0 2 4
DSC Entrepreneurship and Management Functions 1 2 0 3
PCC Operating Systems 3 1 0 4
PCC Computer Networks 3 1 0 4
PCC Compiler Design 3 1 0 4
PCC Operating Systems practice 0 0 4 2
PCC Computers Networks practice 0 0 4 2
PCC Compiler Design Practice 0 0 4 2
HSC Professional Ethics and Organizational Behaviour 1 0 0 P/F
25.0
Semester 6
DSC Prototyping and Testing 1 2 0 3
PEC Professional Elective 1 3 1 0 4
ELC Elective 1 3 1 0 4
HSC Professional Communication 1 0 2 2
HSC Intellectual Property Rights 1 0 0 P/F
25.0
Summer
PCD Internship P/F
Semester 7
12.0
Semester 8
PCD Project/Course work 0 0 16 8
12.0
Semester wise Credit

Credits
Distribution
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
11.5 4 0 0 0 0 0 0 15.5 9.1
(BEC)
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
0 4 16 16 18 0 0 0 54 31.8
(PCC)
Professional Elective Course
0 0 0 0 0 12 0 0 12 7.1
(PEC)
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
0 0 0 0 0 0 0 8 8 4.7
Development (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 170.0
IIITDM Kancheepuram
2nd Semester Curriculum effective from 2020
B Tech Computer Science and Engineering
Course Title Differential Equations Course No MA1001

L T P C
Specialization Mathematics Structure (LTPC)
3 1 0 4
Offered for UG & DD Status Core ■ Elective □
Faculty, Department of Sciences Type Revision □ Modification ■
Faculty and Humanities
Pre-requisite
COT Approved by 44th Senate
Effective July 2020
From
Objectives To provide an exposure to the theory of ODEs & PDEs and the solution techniques.
Linear ordinary differential equations with constant coefficients, Method of variation

of parameters – Linear systems of ordinary differential equations (10L, 3T)
Power series solution of ordinary differential equations and Singular points
Contents of the Bessel and Legendre differential equations; properties of Bessel functions and
course Legendre Polynomials (12L,3T)
Fourier series (6L,2T)
Laplace transforms elementary properties of Laplace transforms, inversion by partial
fractions, convolution theorem and its applications to ordinary differential equations
(6L,2T)
Introduction to partial differential equations, wave equation, heat equation, diffusion

equation (8L,2T)
1. Simmons. G.F, Differential Equations, Tata McGraw Hill, 2003.
Textbooks
2. Kreyszig. E, Advanced Engineering Mathematics, Wiley, 2007.
1. William. E. Boyce and R. C. Diprima, Elementary Differential Equations
and Boundary Value Problems, John Wiley, 8 Edn, 2004.
2. Sneddon. I, Elements of Partial Differential Equations, Tata McGraw Hill,
1972.
References
3. Ross. L.S, Differential Equations, Wiley, 2007.
4. Trench, W, Elementary Differential Equations,
http://digitalcommons.trinity.edu/mono
IIITDM Kancheepuram
Course Name : Science Elective – 1 – I
Course Title Engineering Optics Course No PH2000
Department/ L T P C
Physics Credits
Specialization 3 1 0 4
Faculty proposing
Dr. Vivek Kumar and Status Core □ Elective ■
the course
Dr. Debolina Mishra
Offered for UG Type New ■ Revision □
Effective From March 2021 Approved by
44th Senate
Prerequisite Nil
 To introduce the principles of physical optics and application of the physical
concepts to topical engineering domains.
Learning Objectives
 Understand basic lasing action, study various types of lasers and to have basic
idea of fiber optics.
 Interpret the intensity variation of light due to Polarization, interference and
diffraction.
Learning Outcomes
 Learn the concept and operating principles of optical instruments.
 State the working principle of lasers and describe its applications.
Module 1: Wave Optics (L17+T8)
 Interference- Introduction to waves, Coherence (Spatial and Temporal), Principle
of Superposition, Young's double slit experiment, Interference by wave front
division and by amplitude division and examples.
 Diffraction- Fresnel and Fraunhofer diffraction, Fraunhofer diffraction due to
double slit. Diffraction grating and its applications.
 Polarization- Introduction, Malus’ law, Polarization by reflection and Brewster’s
Course Contents law and applications.
(with approximate Module 2: Laser Basics (L8+T3)
breakup of hours for
lecture/  Laser operation, Absorption, Spontaneous Emission and Stimulated Emission,
tutorial/practice) Population & Inversion, Three- and FourLevel Laser Systems, Laser
Characteristics- Types of Lasers: Solid-State Lasers, Gas Lasers, Semiconductor
Lasers.
Module 3: Applications (L16+T3)
 Interferometers: Michelson interferometer, Fabry-Perot interferometer, Mach-
Zehnder interferometer, Sagnac interferometer.
 Fiber optics: Fermat’s principle and Snell’s law, optical fiber: principle and
construction, acceptance cone, numerical aperture, types of fibers, Applications.
1. Eugene Hecht, Optics (5th edition), Pearson (2019).
Essential Reading
2. A. Ghatak, Optics (4th edition), Tata Mcgraw Hill (2009).
Supplementary 1. William T. Silfvast, Laser Fundamentals, Cambridge University Press (2004).
2. John Crisp and Barry Elliott, Introduction to Fiber Optics, Elsevier (2005).
Reading
3. Warren J. Smith, Modern Optical Engineering, McGraw-Hill (2007).
IIITDM Kancheepuram
Course Name : Science Elective – 1 – II
Course Title Waves and Vibrations Course No PH2001
Department/ L T P C
Physics Credits
Faculty proposing
Dr. Naveen Kumar and Dr.Tapas Sil Status Core □ Elective ■
the course

44th Senate
Prerequisite Nil
 To improve the conceptual, physical and mathematical comprehension of the

Learning phenomenon of waves and vibrations
Objectives  To Implement the understanding of waves and vibrations in real-time
applications/devices design
Students would be able to conceptualize the physical phenomenon of waves/and vibrations
Learning Outcomes for varieties of interdisciplinary product design applications
 Module 1: Sources (electrical/mechanical/oceanic/optical) of waves and vibrations;

Importance and applications of vibrations and waves in life; Free, damped, forced
oscillations (Mathematical models) (L8+T3)
 Module 2: Wave equations, Classifications of Waves: transverse, longitudinal, plane,
cylindrical, spherical, periodic, aperiodic, sinusoidal, square, triangular, saw tooth
waves, polarization, circularly, plane, elliptically polarized waves with mathematical
Course Contents representation and examples/case studies from nature and real-time applications
(with approximate (L10 + T4)
breakup of hours
 Module 3: Superposition of waves, beats, wave packet, phase velocity, group velocity,
for lecture/
dispersion, modulation, wave plates, stationary and traveling waves, energy density
tutorial/practice) (L8+T2)
 Module 4: Energy harvesting techniques along with basic electronic circuitry for
product design applications (L8+ T3)
 Module 5: Wave guiding and fiber Interferometers for smart sensing and
measurement applications (L8 +T2)
Essential Reading 1. Frank S Crawford Jr., Waves: Berkeley Physics Course Volume 3, McGraw Hill, 2008
1. E. Hecht, Optics, Pearson, 5th edition, 2016
2. Shashank Priya and Daniel J Inman, Energy Harvesting Technologies, Springer,
Supplementary
2009
Reading
3. Daniele Tosi and Guido Perrone, Fiber-Optic Sensors for Biomedical Applications,
Artech House, 2018
IIITDM Kancheepuram
Course Name : Science Elective – 1 – III

Course Title Physics of Materials Course No PH2002
Department/ L T P C
Physics Credits
Faculty proposing the
Dr. Y Ashok Kumar Reddy and Status Core □ Elective ■
course
Dr. Anushree Khandale
44th Senate
Prerequisite Nil
 The objective of the course is to provide the insights of various states of material
Learning Objectives and their properties, nanotechnology, existing energy resources and their
applications for next generation Engineers.
Upon successful completion, students can gain the knowledge to:
Learning Outcomes  Applied Physics concepts towards materials and their applications;
 Evaluation and selection of suitable materials for different energy, medical and
industrial applications.
 Physics of Matter: Atoms in crystals, Atomic bonding, Free electron theory, Band
theory, Fermi Level, Energy bands, Conductors, Insulators, Semiconductors,
Superconductors, Dielectrics, Magnetic and Plasmonic materials (L12+T3)
 Physics of Nano: Introduction to nanomaterials, Properties of nanomaterials, Types
Course Contents (with of nanomaterials, Synthesis of Nanomaterials-Top-down and Bottom-up
approximate breakup approaches, Quantum confinement, Quantum well, Wire and Dot, Carbon Nano-
of hours for lecture/ tubes (CNTs), Nanotechnology for medical and industrial applications (L14+T4)
tutorial/practice)  Physics of Energy: Introduction to energy sources, Solar energy- Solar production
and Radiation, Photovoltaic solar cells; Nuclear energy- Nuclear energy processes,
Fission and Fusion; Electrochemical energy- Storage and Conversion; Thermal
Energy- Conduction, Convection and Radiation; Wind Energy- Turbines and Utility
scale wind; Bio energy- Sources and Biomass (L16+T5)
1. Arthur Beiser, Shobhit Mahajan, S. Rai Choudhury, Concepts of Modern Physics, 7th
Edition, 2017.
Essential Reading 2. Charles P. Poole, Jr. Frank J. Owens, Introduction to Nanotechnology, A John Wiley-
Interscience publication, 2003.
3. M.N. Avadhanulu, P.G. Kshirsagar, T.V.S. Arun Murthy, A Textbook of Engineering
Physics, S. Chand Publishing, 11th Edition, 2018.
1. Charles Kittel, Introduction to Solid State Physics, 8th Edition, 2004.
2. A.P. Zambare, R.B. Bhise, A.B. Bhise, V.D. Kulkarni, H.R. Kulkarni, Physics of
Supplementary
Nanomaterials, Nirali Prakashan, 2019.
Reading
3. Robert L. Jaffe, Washington Taylor, The Physics of Energy, Cambridge University
Press, 2018.
IIITDM Kancheepuram
Course Name : Science Elective – 1 – IV – BIOLOGY
Course Title Biology for Engineers Course No BT1001

Department/ L T P C
Science and Humanities Credits
Faculty proposing the Dr. Monisha Mohan
Status Core □ Elective ■
course
44th Senate
Prerequisite Nil
The objective of the course is to provide students with a comprehensive and concise overview of
Learning Objectives biological science with emphases on its relationship with bio-engineering. This course will help
engineering students to understand the inter-connection between biology and future technologies.
On successful completion of the course, the student will be able to:
 Recognize the importance of cell structure and constituents for the development of
Learning Outcomes
biosensors.
 Demonstrate the concept of biology and its uses in combination with technologies for the
development of biomaterials, antibodies, DNA as astorage device and Organ-on-a-chip.
Molecular modelling of 3D structures of proteins and nucleic acids.
 Introduction to basic Biology: Cell theory, cell shapes, prokaryotic and
eukaryotic cell, membrane structure and function, cell communication, cell cycle,
cardiovascular system, respiratory, renal, nervous system and immunesystem (7L+2T).
Contents of the course  Structure and properties of biomolecules: Carbohydrates, proteins, lipids, nucleic acid (DNA
(With approximate break- and RNA) and their types, DNA as storage device, applicationof enzymes in industry, large
up of hoursfor L/T/P) scale production of enzymes by fermentation. (8L+2T).
 Genes, replication of DNA, and introduction to recombinant DNA Technology: Prokaryotic
gene and eukaryotic gene structure, gene replication, transcriptionand translation in
prokaryote and eukaryote and synthesis of protein in eukaryotes, recombinant DNA
technology and cloning introduction. (10L+4T).
 Applications of Biotechnology: Brief introduction to production of vaccines, antibodies,
basics of biosensors, biochips and biofuels, Tissue engineering and its application, transgenic
plants and animals, Bioengineering (production of artificial limbs, joints and other parts of
body). (10L+4T).
 Fundamental concepts of bioinformatics: DNA and Protein sequence, sequence assembly,
sequence comparison, biological databases, similarity searches, multiple sequence alignment,
Visualizing and modelling 3D protein and DNA structures. (7L+2T).
1. N. A. Campbell, J. B. Reece, L. Urry, M. L. Cain and S. A. Wasserman,

“Biology: A global approach”, Pearson Education Ltd, 2018.
Text Book 2. Jeremy M. Berg, John L. Tymoczko and Lubert Stryer, “Biochemistry”,
W.H. Freeman and Co. Ltd., 6th Ed., 2006.
3. Bioinformatics An Introduction by Ramsden Jeremy, Springer 2021.
1. Molecular Biology and Biotechnology by Meyers, RA, A comprehensive
Reference Books Desk reference (VCH publishers).
2. Lehninger Principles of Biochemistry (WH Freeman, 7th Edition, 2017) by David L.
Nelson and Michael M. Cox
Bioinformatics: A practical guide to the analysis of genes and proteins by Baxevanis A.D. and
Ouellette B.F. John Wiley & Sons, New York, ISBN:978-0-471-47878-2
IIITDM Kancheepuram
Course Title Engineering Graphics Course No ME1001

Department/ L T P C
Mechanical Engineering Credits
Faculty proposing Faculty , Department of
Status Core ■ Elective □
the course Mechanical Engineering.
Offered for B.Tech EC/CS/ME/MSM Type New □ Revision ■

44th Senate
Prerequisite Nil
 To introduce the basic concepts and techniques of technical drawing.

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

drawing, Standards, Dimensioning principles. (L2+P4 hrs)
 Computer aided drafting. (L2+P8 hrs)
 Engineering curves and its applications. (L4+P8 hrs)
Course Contents  Principles of orthographic projection. Orthographic projection of points, lines,
(with approximate
planes and regular solids, Exercises related to engineering applications. (L7+P8
hrs)
lecture/
 Principles of isometric projections. Orthographic to isometric and isometric to
tutorial/practice) orthographic transformation of objects. (L3+P8 hrs)
 Section and intersection of regular solids and their lateral developments.
(L6+P12 hrs)
 Introduction to 3D modelling of shapes and objects; electrical CAD. (L2+P4
hrs)
2. K. Venugopal and V Prabhu Raja, Engineering Drawing + AutoCAD, New Age
Essential Reading International (P) Limited. 5th Edition Reprint: July, 2016
3. Narayana. K.L, and Kannaiah. P, Engineering Drawing, Scitech Pub. Pvt. Ltd,
3rd Edition.
Supplementary 4. PI Varghese, Engineering Graphics, McGraw Hill Education, 2013.
Reading 5. Bhatt. N.D, Engineering Drawing – Plane and Solid Geometry, Charotar
Publishing House Pvt. Ltd., 53 Edition 2014.
IIITDM Kancheepuram
Course Title Data Structures and Algorithms Course No CS1004

Department/ L T P C
Computer Science & Engineering Credits
Faculty proposing Faculty, Department of Computer
the course Science & Engineering
Offered for B.Tech CSE Type New □ Revision ■

44th Senate
Prerequisite Nil
Given a computational problem, the focus is on design of algorithms,
implementation of algorithms using a suitable data structures. The notion time and
Learning Objectives
space complexity and design of efficient algorithms and data structures shall also be
explored.
Students are expected to design efficient algorithms and data structures for
Learning Outcomes
computational problems
 Review of elementary data structures – time and space complexity – step count
method based computation – asymptotic analysis and bounds – big oh, little oh,
omega, theta notation (5L)
 Analysis using recurrence relations – solving recurrence relations through guess
method, recurrence tree method, masters theorem (5L)
 Analysis of sorting/searching algorithms - Incremental Design - insertion sort,
Decremental Design - Celebrity problem - Divide and Conquer- merge sort, quick
sort – comparison/ non-comparison based sorting algorithms on restricted inputs –
Course Contents
counting, radix sorting - discussion on inputs with best/worst case complexities
(with approximate
(7L)
 Binary Trees - Tree representation, traversal, Introduction to expression trees:
lecture/
traversal vs post/pre/infix notation. Recursive traversal and other tree parameters
tutorial/practice)
(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)
1. M. A. Weiss, Data Structures and Algorithm Analysis in C, Pearson, 2nd edition,
Essential Reading
2002.
1. Cormen T.H, Leiserson C.E and Rivest R.L, Introduction to Algorithms,
Prentice Hall India, 2nd Edition, 2001.
2. Aho, Hopcroft and Ullmann, Data Structures and Algorithms, Addison Wesley,
Supplementary 1983.
Reading 3. Adam Drozdek, Data structures and Algorithms in C, 1994.
4. R G 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.
IIITDM Kancheepuram
Course Title Sociology of Design Course No DS1001

L T P C
Department/
Design Spine
Specialization Structure (LTPC)
1 2 0 3
Offered for B.Tech & DD All streams
Prepared by (Faculty Faculty, Department of SIDI
Name)
Prerequisite Foundation Program Effective From July 2021
Course Objectives The objective of the course is to introduce engineering students to

the importance of understanding the social context of technology
and product design:
1. Observing the problem context and surfacing unstated
user/customer needs / new product concepts,
2. Understanding people, team dynamics and working in multicultural /
cross-functional / distributed teams.
Contents of the course Module 1: Technology, Design and Society - [9 hrs]
(With approxi mate break ● Observe the way people interact with objects
up of hours) ● Understanding the relationship between people and a variety of objects
● Actor Network Theory; History of Technology and Design; 2-3 Case studies
● Discover your passion and domain of interest & network to identify partners
Module 2: Understanding user/customer contexts [21 hrs]
● Ethnography - immersion in a problem context
● Learning to observe - see and listen;
● Developing rich pictures; Gigamapping
● Introduction to signs and semiotic analysis
Module 3: Understanding groups (multicultural/cross-functional teams) [12 hrs]
● 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;
● Group dynamics within organizations and across organizations and
implications for innovation and change
Evaluation: Continuous assessment (40%); Final ethnography report (20%);
End Semester (40%)
Text and References 1. Trevor Pinch (Editors) (2012), The Social Construction of Technological
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 since 1750s, 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 Outcomes 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
IIITDM Kancheepuram
Course Title Design and Manufacturing Lab. Course No ID1000
Department/ Interdisciplinary Structure (LTPC) L T P C

Specialization
0 0 2 1
Offered for UG & DD Status Core ■ Elective □
Faculty Faculty, Department of Type New ■ Modification □
Mechanical Engineering.
Pre-requisite COT Approved by 44th Senate
Effective From March 2021
Objectives The objective of this course is to give an exposure on the basic practices followed in the
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 practices:
course
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)
Textbook 1. Uppal S. L., “Electrical Wiring & Estimating”, 5Edn, Khanna Publishers, 2003.
2. Chapman. W. A. J., Workshop Technology, Part 1 & 2, Taylor & Francis.
References 1. Clyde F. Coombs, “Printed circuits hand book”, 6Edn, McGraw Hill, 2007.
2. John H. Watt, Terrell Croft, “American Electricians' Handbook: A Reference
Book for the Practical Electrical Man”, Tata McGraw Hill, 2002.
IIITDM Kancheepuram
Discrete Structures for

Course Title Course No CS1005
Computer Science
Department/ L T P C
Faculty proposing Faculty, Department of Computer
the course Science & Engineering.

44th Senate
Prerequisite Nil
This course introduces logical reasoning, inferences, and proof techniques.
Learning Objectives Relations, Functions, Counting principles are also discussed. Graph theory and
various properties of graphs are also taught as part of this course.
The learner would appreciate the importance of combinatorics and the various proof
techniques, and in particular, in proving the correctness of algorithms. Counting
Learning Outcomes
principles learnt as part of the course will help the learner in counting various
combinatorial objects
 Mathematical Reasoning – Propositions – Predicates –First order logic – Nested
quantifier – logical puzzles (9L+3T)
 Set theory – Relations between sets – Operation on sets –Inductive definition of
sets - Proof techniques – Direct proof , proof by contradiction, mathematical
induction (8L+3T)
Course Contents  Binary relation and digraphs – Special properties of relations – Composition of
(with approximate relations – Closure operations on relations – counting special relations (7L+3T)
breakup of hours for  Basic properties of functions – Special classes of functions – counting functions
lecture/ (5L+1T)
tutorial/practice)  Pigenhole principle – onto functions – derangements (5L+1T)
 Basic counting techniques – Finite and Infinite sets –Countable and uncountable
sets–Cardinal numbers (6L+1T)
 Graph Theory –Graphs – Sub graphs – Isomorphic and Homeomorphic graphs –
Paths – Connectivity Bridges of Konigsberg – Labeled and Weighted Graphs–
Complete, Regular and Bipartite Graphs –Planar Graphs – Coloring (5L+2T)
1. K. H. Rosen, Discrete Mathematics and its Applications, McGraw Hill, 6th
Essential Reading
Edition, 2007.
1. D. F. Stanat and D. F. McAllister, Discrete Mathematics in Computer Science,
Prentice Hall, 1977.
2. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Second
Supplementary Edition, Addison Wesley, 1994.
Reading 3. Busby, Kolman, and Ross, Discrete Mathematical Structures, PHI, 6th Edition,
2008.
4. C. L. Liu, Elements of Discrete Mathematics, Second Edition, Tata McGraw
Hill, 1995.
IIITDM Kancheepuram
Course Title Data Structures and Algorithms

Course No CS1006
Practice
Department/ L T P C
Specialization
0 0 4 2
Faculty proposing Faculty, Department of
the course Computer Science & Engineering
44th Senate
Prerequisite Nil
Given a computational problem, the focus is on design of algorithms, implementation of

Learning 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 forcomputational
problems
 Implementation of case studies involving algorithms and data structures in C

Course Contents (with programming.
approximate breakup  Binary Trees – Traversal – Computation of Structural parameters
of hours forlecture/  Hashing – implementation of hash functions – computing collisions – Open vsclosed
tutorial/practice) hashing
 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, 2nd edition,2002.
Cormen T.H, Leiserson C.E and Rivest R.L, Introduction to Algorithms,Prentice

Hall India, 2nd Edition, 2001.
1. Aho, Hopcroft and Ullmann, Data Structures and Algorithms, Addison Wesley,1983.
Supplementary 2. Adam Drozdek, Data structures and Algorithms in C, 1994.
Reading 3. R G Dromey, How to solve it by Computer, Prentice Hall India, 1982.
4. Horowitz, Sahni and Anderson-Freed, Fundamentals of Data Structures in C,Silicon
Press, 2007.
IIITDM Kancheepuram
Course Title Earth, Environment and Design Course No HS1002

L T P C
Department / Interdisciplinary Credits
Specialization 1 0 0 P/F
Faculty Faculty, Department of SIDI Status Core ■ Elective □

proposing the
course
Offered for UG & DD New □ Modification ■
Type
Effective From March 2021
Approved by 44th Senate
Prerequisite Nil
Learning  The course aims to provide an understanding of systems and processes in aquatic and terrestrial
Objectives 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 approximate  Introduction to environment and ecology – Ecosystems Impacts of natural and human activities
breakup of hours on ecosystems.
for  Environmental policies, acts and standards, Environmental Impact Assessment Prediction and
lecture/ assessment of the impacts on air, water, land, and biological environments Assessment of
tutorial/practice) impacts of the cultural, socioeconomic and eco sensitive environments.
Textbook 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.
References  Henry. J. G, and Heike, G. W, Environmental Science & Engineering, Prentice Hall
International, 1996.
 Dhameja. S. K, Environmental Engineering and Management, S. K. Kataria and Sons, 1999.
 Shyam Divan and Armin Rosancranz, Environmental Law and Policy in India, Cases, Materials
and Statutes, Oxford University Press, 2001.
Course Title Object Oriented Programming Course No
Department/ Computer Science and L T P C

Credits
Specialization Engineering 2 0 4 4
Faculty proposing
Faculty, Department of CSE Status Core ■ Elective □
the course
Offered for B.Tech Type New ■ Revision □
To take effect from July 2021 Submitted for th
44 Senate
Prerequisite Nil approval
The course introduces students to the object oriented programming paradigm and
Learning Objectives its 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 analyze various aspects of Software Design in a reusable and secure
Learning Outcomes fashion
● 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 –
public/private/protected inheritance – Polymorphism (9L)
Course Contents
 Virtual functions - Templates – Function & Class templates – Streams –
(with approximate
Stream input Output Stream format states – Manipulators – Exception
handling – Re–throwing exceptions –specifications–and exception handling –
lecture/
Inheritance – STL (9L)
tutorial/practice)
 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, 10th Edn, 2016,
ISBN 9780131596825
Essential Reading
2. Deitel P J and Deitel H M, Java: How To Program, Prentice Hall, 9th Edn, 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. Herbet Schildt, Teach Yourself C++, 4th Edition, Tata McGraw Hill, 2003, ISBN
978-0070532465
Course Title Digital System Design Course No

Credits
Faculty proposing the Faculty, Department of
course CSE
To take effect from July 2021 Submitted th
44 Senate
Prerequisite Nil for approval
To introduce the basic understanding of digital representation, Boolean algebra
Learning Objectives and the operation of the logic components, combinational and sequential circuits,
and to introduce the analog 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.
● To implement Combinational Circuits using Primitive gates and logic
Learning Outcomes
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, Gray, Excess 3, Alpha Numeric codes and conversion
circuits. (3L,1T)
 Arithmetic circuits: Binary adders and subtractors, multipliers and division,
ALU. (5L,2T)
 Synthesis of combinational logic functions using MSIs: mux/demux,
Course Contents decoders/encoders, Priority encoders, Comparators. (2L,2T)
(with approximate  Sequential Circuits: Latches and Flip-Flops: SR, JK, D, T; Excitation tables.
breakup of hours for (2L,1T)
lecture/  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-
Essential Reading 9332518728, 2008.
2. B. Razavi, “Fundamentals of Microelectronics,” Wiley Student Edition,
ISBN: 978-1-118-15632-2, 2010.
1. Sedra and Smith, Microelectronic Circuits, 7 th 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,10 th Edition, ISBN-13 : 978-
0135103821, 2010.
Design and Analysis of

Course Title Course No
Algorithms
Credits
Faculty proposing
the course
44 Senate
 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 – masters 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, travelling

Course Contents salesman, LCS, knapsack , greedy vs dynamic programming – Principle of
(with approximate optimality, overlapping subproblems – Dynamic programming vs Divide and
breakup of hours for 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, 2 nd Edition, 2001. ISBN 978-0-262-53305-8
Essential Reading
2. E. Horowitz, S. Sahni, and S. Rajasekaran, “Computer Algorithms,” 2 nd
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 Title Digital System Design Practice Course No

Credits
Faculty proposing
the course
44 Senate
To provide hands on design and implementation of analog and digital circuits.
Learning Objectives
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, priority encoder,
Course Contents Decoders, Seven segment display, multiplexer)
(with approximate  Design of sequential Circuits.
breakup of hours for  Design of 4-bit ALU (Adder, subtractor, logic and shift operations).
lecture/  Design project
tutorial/practice)  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 Edition, ISBN-
Essential Reading 13 : 978-0072320848, 2015.
2. S. Brown and Z. Vranesic, “Fundamentals of Digital Logic with VHDL
Design,”TMH, 3 rd 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, 10 th Edition, ISBN-13 : 978-
Supplementary
0135103821, 2010.
Reading
2. D. A. Neaman, “Electronic Circuits,” TMH, 4 th Edition,ISBN-13 : 978-
0070634336, 2006.
Design and Analysis of

Algorithms Practice
Credits
Faculty proposing
the course
44 Senate
 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
using a careful choice of data structures and algorithmic paradigms (in
Course Contents C++/Java language) from scratch, based on the concepts learnt in the theory
(with approximate course.
lecture/  Case studies in respect of different paradigms discussed in theory shall be
tutorial/practice) implemented in C++/Java
 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, 2 nd Edition, 2001. ISBN 978-0-262-53305-8
Essential Reading
2. E. Horowitz, S. Sahni, and S. Rajasekaran, “Computer Algorithms,” 2 nd
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
Computer Organization and

Architecture
Credits
Faculty proposing
the course
44 Senate
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
● Analyze 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/subtractor, Division. (5L,2T)
 The Processor: Logic Design Conventions, Building a Datapath, A Simple
Course Contents Implementation Scheme (3L,1T)
(with approximate  An Overview of Pipelining, Pipelined Data path and Control, Data Hazards:
breakup of hours for Forwarding versus Stalling, Control Hazards, Exceptions and Parallelism via
lecture/ 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, 5 th Edition, ISBN-13 : 978-8131222744, 2013.
Essential Reading
2. C. Hamacher, Z. Vranesic, and S. Zaky, “Computer Organization,” Tata
McGraw Hill, 5 th Edition, ISBN-9789339212131, 2002.
1. J. P. Hayes, “Computer Architecture and Organization,” Tata McGraw Hill,
ISBN-13 : 978-1259028564, 2017.
2. M. J. Murdocca, V. P. Heuring, “Computer Architecture and Organization - An
Supplementary
Integrated Approach,” John Wiley & Sons Inc., ISBN-13:978-0471733881,
Reading
2007.
3. A. S. Tanenbaum, “Structured Computer Organization,” Prentice Hall, 5th
Edition, ISBN-13 : 978-0132916523, 2006.
Course Title Database Systems Course No

Credits
Faculty proposing
the course
44 Senate
Objective of the course is to equip students with skillsets required for database
design and implementation. Various concepts such as ER modeling, Schema
Learning Objectives
Mapping, Normalization, Lossless Join etc. would be explored to help in efficient an
and effective databases.
● To appreciate the systematic design and principles involved in any
database development.
● To understand the Importance of canonical normal forms and its design in
Learning Outcomes
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)
Course Contents Database Languages, DDL, DML, Structured Query Language (SQL), SQL views,
(with approximate case studies (8L,3T)
breakup of hours for Database Design, Normal Forms (First to third normal form), Boyce codd Normal
lecture/ Form, Database decomposition, Functional Dependencies, Loss-less Join
tutorial/practice) decomposition (8L,2T)
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,
Essential Reading
7th 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 Title Theory of Computation Course No

Credits
Faculty proposing
the course
44 Senate
This course aims to provide fundamentals of computing models such as finite state
automata, push down automata, linear bounded automata and Turing machine.
Learning Objectives
Powers 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.
Course Contents
Push Down Automata & Context-free Languages (CFLs) - (12L,4T)
(with approximate
Grammars and Chomsky Hierarchy, CFLs, Chomsky Normal Form, Pumping
Lemma for CFLs, Inherent Ambiguity of Context-Free Languages, Cock-Younger-
lecture/
Kasami Algorithm, Applications to Parsing. Pushdown Automata (PDA), PDA vs
tutorial/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,
Essential Reading Motwani, 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,
Reading
Tata McGraw-Hill, ISBN 978-00731914612003.
Computer Organization and

Architecture Practice
Credits
Faculty proposing
the course
44 Senate
Exposure to assembly language programming, instruction set design, and
processor design for a given instruction set are given. Assembler macros, interrupt
Learning Objectives
service 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
Course Contents
of registers, accessing the contents of memory locations ‐ Implementation of higher
(with approximate
level language assignment statements with arithmetic expressions and logical
expressions ‐ Implementation of control transfer statements. Macros ‐ Software
lecture/
interrupts ‐ Operating system function calls ‐ Interrupt service routines ‐ Simple
tutorial/practice)
device drivers ‐ Assembly language programming in C
language. I/O interfacing and programming. Computer System Design.
1. Patterson and Hennessy, “Computer Organization and Design,” Morgan
Essential Reading
Kaufmann, 5 th Edition, ISBN-13 : 978-8131222744, 2013.
Supplementary 1. C. Hamacher, Z. Vranesic, and S. Zaky, “Computer Organization,” Tata
Reading McGraw Hill, ISBN-9789339212131, 2002.
Course Title Database Systems Practice Course No

Credits
Faculty proposing
the course
44 Senate
The focus of this course is on database design, architecture, and relational models.
Normal forms, internal schema design would also be explored. This course
Learning Objectives
introduces 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
Learning Outcomes formal guidelines
● 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
Course Contents manipulation using SQL. Implementation of set theoretic operations on databases.
(with approximate Views using SQL. Implementation of algorithms related to functional dependencies
breakup of hours for and loss-less decomposition. Indexing using B-trees and B+ trees (creation,
lecture/ insertion, deletion).
tutorial/practice) Assignment/Mini project-based application design and development involving
database
1. R. Elmasri and S. B. Navathe, “Fundamentals of Database Systems,” Pearson,
Essential Reading
7th Edition, 2016, ISBN 9789332582705
1. A. Silberschatz, H. F. Korth, and S. Sudharsan, “Database System Concepts,”
Tata McGraw Hill, 6th Edition, 2011, 978-0321197849
Supplementary
2. C. J. Date, A. Kannan, and S. Swamynathan, “An Introduction to Database
Reading
Systems,” Pearson, 8th Edition, 2006, ISBN 978-0321197849
INDIAN INSTITUTE OF INFORMATION TECHNOLOGY
DESIGN AND MANUFACTURING (IIITDM) KANCHEEPURAM
INTRODUCTION OF NEW / MODIFICATION OF EXISTING COURSE
Introduction to Data Science for
Course Title Course No CS3XXX
Engineers
Department/ L T P C
Computer Science and Engineering Credits
Faculty proposing the
Dept of CSE Status Core ■ Elective □
course
Offered for UG/PG/PhD Type New ■ Revision □
To take effect from March 2021 Submitted for th
47 Senate
Prerequisite approval
This course aims to provide a formal exposure to data science, emphasizing breadth
rather than depth. This course exposes students to fundamentals of python programming
Learning Objectives
and real-world applications of data science. The data science process and the tools(in
python) used to perform data exploration, modeling and analysis will be discussed
 Problem solving using python scripts and in data science field
 Become familiar with Descriptive and Inferential Statistics and analysis
 Learn python tools for data science (Matplotlib, Pandas and Scikit-learn)
Learning Outcomes
 Learn how to perform exploratory data analysis and data cleaning
 Implementing basic Machine Learning algorithms using Python tools
 hands-on exercises with case studies of data science projects
Basic Python Programming –data types, control structures, functions, classes, modules
and packages, numpy, matplotlib, pandas and scikitlearn(13Hrs (9L, 4P))
Overview of Data Science –Data Science Process: Problem Definition, Data Collection,
Data Preparation (cleaning and transformation), Exploratory data Analysis, Model
Building, Model Evaluation and Model Deployment ( 8 Hrs (4L, 4P))
Descriptive Statistics –Central Tendency (Mean, Median and Mode) –Spread of the
Data (Sd, var and range), RelativeStanding (Percentile, Quartile and Inter-
Course Contents quartileRange) -Inferential Statistics –Data Distributions (Binomial, Poisson,
(with approximate Geometric, Exponential, Sampling and Normal) –Data Visualization(12 Hrs(8L, 4P)
breakup of hours for Data Cleaning -Dropping rows and imputing missing values; Data Transformation –
lecture/ Binary Encoding –One-Hot Encoding, Standardization and Normalization; Hypothesis
tutorial/practice) Testing(12 Hrs(6L, 6P))
Data Exploration –Describe, Merge, Group; Feature Engineering; Implementation of
basic machine learning algorithms using python tools –Linear Regression, Logistic
Regression, SVM, Random Forest, K-Means Clustering (14 Hrs(8L, 6P))
The hands-on and project will be given on topics such as
Problem solving using python, use Pandas to perform data analysis on a real-world
dataset, exploratory data analysis and feature engineering, end-to-end project of the data
science process, tatistical hypothesis testing
1. Guttag, John. Introduction to Computation and Programming Using Python: With
Essential Reading
Application to Understanding Data. 2nd ed. MIT Press, 2016. ISBN: 9780262529624
1. Joel Grus, Data Science from Scratch, Orielly, 2nd Edn, 2019, ISBN 9781492041139
2. Leskovec, Anand Rajaraman,, Ullmann, Mining of Massive Data Sets, Cambridge
University Press, Open Source free version , ISBN 9781107015357
Supplementary
3. P Norvig, Paradigms of AI Programming, Morgan Kauffmann,1991, ISBN
Reading
9781558601918
4. Dean, Allen & Aloimonos , AI Theory & Practice, Addison Wesley, 1995, ISBN 978-
0805325478
Course Title Operating Systems Course No

Credits
Faculty proposing
the course
44 Senate
This first level course focuses on exposing students to the purpose, structure and
functions of an operating system. Operating systems abstraction, mechanisms
Learning Objectives
and 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 – Preemptive, Non preemptive
Course Contents algorithms FCFS, SJF, SRT, RR – Thread scheduling – contention scope, pthread
(with approximate support for scheduling. (11L,3T) Synchronization – Race condition – Critical
breakup of hours for Section Problem, Solution, Mutex Locks and Semaphores – Priority Inversion,
lecture/ Pthreads synchronization - Producer Consumer problem (multi threaded) example
tutorial/practice) Deadlock characterization – Resource 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, 9 th 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
Reading Hall, 2011, ISBN 9332518807
3. Gary Nut, Operating Systems: A Modern Perspective, Addison Wesley,
2003, ISBN 978-0201773446
Course Title Computer Networking Course No

Credits
Faculty proposing
the course
44 Senate
To introduce the basics of computer networking, error detection and correction
techniques, and flow control techniques. Also an exposure to IP addressing and
Learning Objectives routing 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 analyze the network using performance
metrics.
Learning Outcomes
● To appreciate the importance of subnetting, 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),
Course Contents performance analysis of stop and wait and sliding window protocols. Flow control at
(with approximate data link layer. Introduction to layer-2 devices (switches, bridges) and addressing
breakup of hours for scheme at Layer-2 (MAC addresses). (10L,3T)
lecture/ Creating a small network using Ethernet (IEEE 802.3) Token Ring (IEEE 802.5),
tutorial/practice) Performance evaluation of IEEE 802.3 and 802.5 networks. Introduction to Layer-3
devices, IP addresses, IPv4,IPv6, Error detection at layer-3 using Checksum. IP
addressing schemes, subnetting, 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:
Supplementary 9788131770221
Reading 2. Behrouz Forouzan, TCP/IP protocol suite, Tata McGraw Hill, 4th Edn, 2010.
ISBN: 9780070706521
Course Title Compiler Design Course No

Credits
Faculty proposing
the course
44 Senate
The objective of this course is to train students to design various phases of compiler
such as Lexical analyzer, syntax analyzer, semantic analyzer, intermediate code
generator, code optimizer and code generator. Students are also exposed to design
Learning Objectives
compiler construction tools such as Lexical Analyzer 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
Learning Outcomes language 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
Analyzer Design using DFAs —regular expression and its application to give
syntax of word –Automatic design of Lexical Analyzer from regular expression,
Construction of NFA without epsilon moves from regular expression- Efficient
Lexical analyzer using Minimization of automata- limitation of recognition capability
of Lexical analyzer using Pumping lemma (12L,3T)
Context free grammar & its application to give syntax of program statement – Types
Course Contents
of parsing – Top down & bottom up–Recursive descent– Predictive–Shift reduce–
(with approximate
Operator precedence–SLR (10L,3T)
Semantic analysis - Intermediate code generation: Declaration – Assignment
lecture/
statements – Boolean expressions– looping and branching statements (7L,2T)
tutorial/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
Essential Reading
and Tools, Pearson Education, 2003. ISBN: 9780321491695
1. Levine J.R, Mason T, Brown D, Lex & Yacc, OReilly Associates, 1992 ISBN:
9781565920002.
Supplementary
2. Allen I. Holub, Compiler Design in C, Prentice Hall, 2003. ISBN:
Reading
9780131550452
Course Title Operating System Practice Course No

Credits
Faculty proposing
the course
44 Senate
The course aims to equip the student with implementation level constructs / support
Learning Objectives in 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 – Interprocess Communication using Shared
Course Contents
Memory and Pipes – Producer Consumer – Applications using pipes / shm –
(with approximate
Concurrency – Multithreading –Pthread support – Applications such as merge sort,
min-max-average, etc. in a multi threaded fashion – Scheduling –pthread interfaces
lecture/
setschedpolicy – getschedpolicy based applications – Synchronization – threaded
tutorial/practice)
solution for classical 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
Essential Reading
Concepts, John Wiley, 9 th Edn, 2015, ISBN 9788120339040
1. Robert Love, Linux Systems Programming, O Reilly Media, 2 nd Edition, 2013,
ISBN 9781449339531
Supplementary
2. D Butlar, J Farrell, B Nichols, Pthreads Programming, O Reilly Media, 1996,
Reading
ISBN 9781565921153
Course Title Computer Networking Practice Course No

Credits
Faculty proposing
the course
44 Senate
To understand basic networking commands, MAC/IP addressing, file transfer
Learning Objectives between 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, IPConfig, Traceroute, NSlookup - Introduction to Socket Programming. File
Course Contents
transfer using TCP. Echo, Chat between two or more clients using socket
(with approximate
programming - Simulation of Stop and Wait Protocol - Simulation of Stop and Wait
protocol with NACK, Modelling of ACK, NACK drops, etc., -Modelling and
lecture/
simulation of Sliding window protocol - Sliding window protocol with ACK/NACK
tutorial/practice)
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:
Supplementary 9788131770221
Reading 2. Behrouz Forouzan, TCP/IP protocol suite, Tata McGraw Hill, 4th Edn, 2010.
ISBN: 9780070706521
Course Title Compiler Design Practice Course No

Credits
Faculty proposing
the course
44 Senate
The objective of this course is to train students to design various phases of compiler
such as Lexical analyzer, syntax analyzer, semantic analyzer, intermediate code
generator, code optimizer and code generator. Students are also exposed to design
Learning Objectives
compiler construction tools such as Lexical Analyzer 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
Learning Outcomes language and compiler for the same.
● Students will also be able to write large programs.
Lexical analyzer implementation in C ‐ Lexical analyser implementation using
LEX tool Recursive descent parser implementation in C for an expression
Course Contents grammar ‐ YACC and LEX based implementation for an expressions grammar
(with approximate ‐ YACC implementation of a calculator that takes an expression with digits, +
breakup of hours for and * and computes and prints its value ‐ Front end implementation of a compiler
lecture/ that generates the three address code for a simple language‐ Back end
tutorial/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
Essential Reading
and Tools, Pearson Education, 2003. ISBN: 9780321491695
1. Levine J.R, Mason T, Brown D, Lex & Yacc, OReilly Associates, 1992 ISBN:
9781565920002.
Supplementary
2. Allen I. Holub, Compiler Design in C, Prentice Hall, 2003. ISBN:
Reading
9780131550452
Course Title Professional Communication Course No HS3001
Department/ L T P C
English Credits
Faculty proposing Dr. Parvathy Das
the course Faculty, Dept. of SH
Offered for B.Tech. Type New ■ Revision □
44 Senate
 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)
o Conversational English appropriateness, context based speaking in general
situations, discussion and associated vocabulary in professional situations)
o Non-verbal communication – relevance and effective use of paralinguistic
features – body language, chronemics, haptics, proxemics
Course Contents o Emotional intelligence (EI) and social intelligence at workplace – theoretical
(with approximate perspectives and their application in relevant workplace situations – EI and
leadership skills – assessments and best practices in organizations
lecture/
tutorial/practice)  Conflict management and communication at workplace (L4,P6)
o Cross-cultural communication, Argumentation, negotiation, persuasion,
decision making, case study of challenging situations
o Organizing a meeting, working as part of a team, briefing
o Business presentations – Preparing effective presentations, delivering
presentaions 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.
4. Caruso, David R. and Peter Salovey. The Emotionally Intelligent Manager: How
References to Develop and Use the Four Key Emotional Skills of Leadership. John Wiley
and Sons, 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.
Since students have been introduced to the basics of technical and professional
communication in the first semester, this course is designed with the purpose of
Methodology for
giving them intense training in professional and academic communication with
content delivery
global competence. Once the concept is introduced, adequate time should be
devoted to practice and review.

Curriculum For B.Tech. 2020: Computer Science and Engineering

Uploaded by

Copyright:

Available Formats

Curriculum For B.Tech. 2020: Computer Science and Engineering

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Curriculum For B.Tech. 2020: Computer Science and Engineering

Uploaded by

Copyright:

Available Formats

Curriculum for B.Tech.

Indian Institute of Information Technology,

Semester wise Credit

Course Title Differential Equations Course No MA1001

Linear ordinary differential equations with constant coefficients, Method of variation

Introduction to partial differential equations, wave equation, heat equation, diffusion

Course Name : Science Elective – 1 – I

Course Title Engineering Optics Course No PH2000

Course Name : Science Elective – 1 – II

Course Title Waves and Vibrations Course No PH2001

Offered for UG Type New ■ Revision □

 To improve the conceptual, physical and mathematical comprehension of the

 Module 1: Sources (electrical/mechanical/oceanic/optical) of waves and vibrations;

Course Name : Science Elective – 1 – III

Course Name : Science Elective – 1 – IV – BIOLOGY

Course Title Biology for Engineers Course No BT1001

1. N. A. Campbell, J. B. Reece, L. Urry, M. L. Cain and S. A. Wasserman,

Course Title Engineering Graphics Course No ME1001

Offered for B.Tech EC/CS/ME/MSM Type New □ Revision ■

Effective From March 2021 Approved by

 To introduce the basic concepts and techniques of technical drawing.

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

Course Title Data Structures and Algorithms Course No CS1004

Offered for B.Tech CSE Type New □ Revision ■

Course Title Sociology of Design Course No DS1001

Course Objectives The objective of the course is to introduce engineering students to

Course Title Design and Manufacturing Lab. Course No ID1000

Department/ Interdisciplinary Structure (LTPC) L T P C

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

Dismantle and assembly of PC. Installing OS and disk management. (4 hours)

Discrete Structures for

Offered for B.Tech CSE Type New □ Revision ■

Course Title Data Structures and Algorithms

Given a computational problem, the focus is on design of algorithms, implementation of

 Implementation of case studies involving algorithms and data structures in C

Cormen T.H, Leiserson C.E and Rivest R.L, Introduction to Algorithms,Prentice

Course Title Earth, Environment and Design Course No HS1002

Faculty Faculty, Department of SIDI Status Core ■ Elective □

Course Title Object Oriented Programming Course No

Department/ Computer Science and L T P C

Course Title Digital System Design Course No

Department/ Computer Science and L T P C

Design and Analysis of

 Incremental and decremental strategies – divide and conquer – case studies –

 Greedy Method – Container loading – knapsack – scheduling – coin change –

 Dynamic programming – matrix chain, optimal binary search tree, travelling

 Tractability - Introduction to NP-completeness – NP, NP-hardness , polynomial-

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “Introduction to Algorithms,”

Course Title Digital System Design Practice Course No

Department/ Computer Science and L T P C

Design and Analysis of

 Paradigms – Divide and conquer, dynamic programming, greedy, backtracking.

Computer Organization and

Course Title Database Systems Course No

Department/ Computer Science and L T P C

Course Title Theory of Computation Course No

Department/ Computer Science and L T P C

Computer Organization and

Course Title Database Systems Practice Course No