School of Computer & Information

Sciences

Integrated M.Tech (Computer Science

Engineering)

0
 SCHOOL OF COMPUTER & INFORMATION SCIENCES

Vision Statement:

● To invent, create and bring computing technology solutions to the common man, to the privileged
and underprivileged sections of India, to bridge the digital divide and eradication of computer
ignorance and digital illiteracy and to build a prosperous and technologically advanced nation.

Mission Statements:

MS-1: To pursue academic and research excellence, nationally and internationally

MS-2: To provide training, advisory, and consultancy to all the stakeholders.

MS-3: To lead the efforts in creative and newer modes of instruction delivery & supervision

School of Computer and Information Sciences

Name of the Academic Program: Integrated M.Tech (Computer Science)

Program Educational Objectives (PEOs)

PEO-1: To produce graduates with strong foundational concepts, techniques and tools to enable them to
be pursue higher studies.

PEO-2: To prepare students to apply engineering knowledge to solve problems in computer science and
other fields.

PEO-3: To produce graduates with strong human values and professional ethics
PEO-4: Produce Post graduates who can contribute to the Research & Development effectively
PEO-5: To provide students a deep insight into cutting edge technologies and tools.
PEO-6: To create globally competent technocrat’s with exposure to Scientific & Engineering aspects of
development
PEO-7: To work collaboratively on multi-disciplinary projects and exhibit high levels of professional &
ethical values
PEO-8: Create awareness of societal problems and its impact

Note: PEO-1 to PEO-3 applies to I.MTech I-VI and PEO-4 to PEO-8 applies to I.MTech VII-X

1
 Mapping Program Educational Objectives (PEOs)
with Mission Statements (MS)

MS-1 MS-2 MS-3

PEO-1 3 2
PEO-2 3 2
PEO-3 2 3
PEO-4 3 2 1
PEO-5 2 3 1
PEO-6 3 2 1
PEO-7 2 1 3
PEO-8 1 2 3

Write ‘3’ in the box for ‘high-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’ mapping.

Name of the Academic Program: Integrated M.Tech (Computer Science) I-VI

Program Outcomes (POs)

PO-1: Engineering Knowledge: Apply the knowledge of mathematics, science, engineering fundamental’s
and engineering specialization to the solution of the complex engineering problems.
PO-2: Problem Analysis: Identify, formulate, review research literature and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences and
engineering sciences.
PO-3: Design/Development of Solutions: Design solutions for complex engineering problems and design
system component or processes that meets the specified needs with appropriate consideration for the
public health and safety, and the cultural societal and environmental considerations.
PO-4: Conduct Investigation of Complex Problems: Use research based knowledge and research methods
including designs of experiments, analysis, and interpretation of data and synthesis of the information to
provide valid conclusions
PO-5: Model tool Usage: Create, select, and apply appropriate techniques, resources and modern
engineering and IT tools including prediction and modeling to complex engineering activities with an
understanding of limitations.
PO-6: The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to professional
engineering practice

2
PO-7: Environmental and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental context, and demonstrate the knowledge of, and need for sustainable
development.
PO-8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
the engineering practice
PO-9: Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
PO-10: Communication: Communicate effectively on complex engineering activities with the engineering
community and with the society at large, such as, being able to comprehend ad write the effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
PO-11: Project Management and Finance: Demonstrate knowledge and understanding of the engineering
and management principles and apply these to one’s own work, as a member and a leader in a team, to
manage projects and in multidisciplinary environments
PO-12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and lifelong learning in the broadest context of technological change.

3
 Mapping of Program Outcomes (POs) and Program Specific Outcomes (PSOs) with Program
Educational Objectives (PEOs)

PEO-1 PEO-2 PEO-3

PO-1 2 3 1

PO-2 3 2 1

PO-3 1 3 2

PO-4 1 3 2

PO-5 2 3 1

PO-6 3 2 1

PO-7 1 2 3

PO-8 2 1 3

PO-9 1 2 3

PO-10 3 1 2

PO-11 1 2 3

PO-12 3 1 2

Mapping of Program Specific Outcomes (PSOs) where applicable.

Write ‘3’ in the box for ‘high-level’ mapping, 2 for ‘Medium-level’ mapping, 1 for ‘Low-level’ mapping.

4
 School of Computer & Information Sciences
Integrated M.Tech (CSE)
Year I
Student Induction Program: Starts with three weeks SIP that includes Universal Human Values – 1 (0 credits)
before regular Classes.

Semester-I

Course Title Credi Type of Type of Offering Academic Unit

ts Subject Subject
(AICTE) (UoH
NEP)

English 3 HSC HSC CELS

Engineering Mathematics-I 3 BSC SSC School of Mathematics &

Statistics

Engineering Physics-I 3 BSC SSC SEST

Problem Solving and Programming 3 ESC DSC SCIS

Problem Solving and Programming 2 ESC DSC SCIS

Lab

Principles of Engineering and 4 PCC SSC SEST

Sustainability

Basic Engineering Laboratory -1 2 ESC SSC SEST & SCIS

GEC-1 2 GEC

Total Credits, Sem-1 = 22

Semester-II

Course Title Credit Type of Type of Offering

s Subject Subject Academic Unit
(AICTE) (UoH
NEP)

Discrete Mathematics 3 BSC SSC SEST

Engineering Physics-II 3 BSC SSC SEST

5
Engineering Mathematics-II 3 BSC SSC School of
Mathematics &
Statistics

Creativity and Innovation 3 ESC OE SEST

Data and File Structures 3 PCC DSC SCIS

Data and File Structures Lab 2 PCC DSC SCIS

Engineering Drawing 2 ESC SSC SEST

GEC-2 2 GEC

Total Credits, Sem-2 = 21 Cumulative Credits at the end of Sem-2 = 40

6
 First Year First Semester
Course title: English
Code: XX 1XX
Type: HSC/GEC
Credits: 3
Semester:1

Course English (HS101) Credits 3

Course Type HSC/GEC

Course Description

This course is designed to equip engineering students with the essential English language skills
needed for success in their academic and professional careers. It goes beyond technical writing
and communication, focusing on developing well-rounded individuals who can effectively
communicate, critically analyse information and navigate the complexities of the modern world.

Course Objectives

CO-1: To Equip students with advanced communication skills for academic and professional
success.

CO-2: To Foster critical thinking to analyze various communication forms.

CO-3: To Build cultural and emotional intelligence for diverse environments.

CO-4: To Encourage creative and ethical perspectives through art and literature.

CO-5: To Enhance research skills with a focus on digital source evaluation.

CO-6: To Integrate emotional well-being and mindfulness into personal and professional growth.

Course Learning Outcomes (in bullet points)

CLO-1: Communicate effectively in both technical and non-technical contexts.

CLO-2: Critically evaluate digital and technical information.

CLO-3: Demonstrate sensitivity to cultural and gender issues in communication.

CLO-4: Apply creative and ethical perspectives in engineering practices.

CLO-5: Conduct research using credible sources and structured arguments.

7
CLO-6: Develop emotional intelligence and handle ethical dilemmas thoughtfully.

Mapped to Programme Level Outcomes

PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12

CLO1 2 2 3 3 3 3 2 2 2 2 2 1

CLO2 2 2 3 3 2 2 2 2 2 2 2 1

CLO3 2 2 3 3 2 2 2 2 2 2 2 1

CLO4 2 2 3 1 1 2 2 2 2 2 2 1

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

Course Description:

This course is designed to equip engineering students with the essential English language skills needed for
success in their academic and professional careers. It goes beyond technical writing and
communication, focusing on developing well-rounded individuals who can effectively
communicate, critically analyse information and navigate the complexities of the modern world.

Syllabus

Unit I: Humour in Communication: Understand the power of humour in building rapport and creating a
positive work environment. Analyse the use of humour in daily communication, readings, technical writing
and presentations. Explore cultural nuances and sensitivities around humour.

Unit 2: Gender Sensitization and Inclusive Communication: Develop awareness of gender equality and
inclusivity in the engineering field. Identify and challenge gender stereotypes in engineering workplaces.
Practice using inclusive language and communication strategies.

Unit 3: Digital Readership and Critical Thinking: Develop critical thinking skills to evaluate online
information effectively. Identify credible sources for technical research. Practice effective research
techniques for engineering topics. Observe the post-pandemic digital readership and its challenges

Unit 4: Art, Literature and the Engineer’s Perspective: Broaden perspectives and foster creativity
through the lens of art and literature. Analyse the portrayal of engineers in various literary works. Explore

8
the intersection of technology and art in modern society. Discuss the ethical implications of technological
advancements.

Unit 5: Life and its Teachings: Emotional Intelligence and Well-being: Develop emotional intelligence
skills for personal and professional well-being. Discuss ethical dilemmas faced by engineers in real-world
scenarios. Explore the impact of technology on society and individual well-being. Practice mindfulness and
stress management techniques.

First Year First Semester

Course title: Engineering mathematics - 1

Code: XX 1XX
Type: BSC/SSC
Credits: 3
Semester: 1

Course Engineering mathematics – 1 (BS 101) Credits 3

Course Type BSC/SSC

Course Description

9
Engineering Mathematics - 1 is a foundational course that aims to impart essential mathematical
skills and techniques relevant to various engineering disciplines to solve engineering problems.
The topics covered include calculus, ordinary differential equations and linear algebra.

Course Objectives

CO-1: To Develop foundational mathematical skills for solving engineering problems.

CO-2: To Equip students with advanced techniques in calculus and partial derivatives.

CO-3: To Foster understanding of ordinary differential equations and their applications.

CO-4: To Enhance knowledge of linear algebra, including matrices and vector spaces.

CO-5: To Introduce vector calculus concepts for analyzing vector fields and integrals.

CO-6: To Apply mathematical methods to model and solve real-world engineering scenarios.

Course Learning Outcomes (in bullet points)

CLO-1: Apply partial derivatives and optimization techniques to engineering problems.

CLO-2: Solve ordinary differential equations using various analytical methods.

CLO-3: Analyze and solve linear systems using matrix algebra and determinants.

CLO-4: Determine eigenvalues, eigenvectors, and perform matrix diagonalization.

CLO-5: Utilize vector calculus to compute gradients, divergences, and curls.

CLO-6: Apply integral theorems in vector calculus to evaluate line, surface, and volume integrals

Mapped to Programme Level Outcomes

PL PL PL PL PL PL PL PL PL PLO PLO PLO

O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12

CL 3 3 3 3 3 3 2 2 2 2 1 1
O1

CL 2 2 3 3 3 2 2 3 2 2 1 1
O2

CL 2 3 3 3 2 2 2 2 2 2 1 1
O3

CL 2 2 3 1 1 2 2 2 2 2 2 1
O4

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

10
Course Description:
Engineering Mathematics - 1 is a foundational course that aims to impart essential mathematical skills and
techniques relevant to various engineering disciplines to solve engineering problems. The topics covered
include calculus, ordinary differential equations and linear algebra.
Syllabus
Unit 1: Partial derivatives: Partial derivatives, Chain rule, Differentiation of Implicit functions, Exact
differentials. Maxima, Minima and saddle points, Method of Lagrange multipliers. Differentiation under
Integral sign, Jacobians and transformations of coordinates
Unit 2: Ordinary Differential equations (ODEs): Basic Concepts. Geometric Meaning of y’= ƒ(x, y).
Direction Fields, Euler’s Method, Separable ODEs. Exact ODEs. Integrating Factors, Linear ODEs.
Bernoulli Equation. Population Dynamics, Orthogonal Trajectories. Homogeneous Linear ODEs with
Constant Coefficients. Differential Operators. Modelling of Free Oscillations of a Mass–Spring System,
Euler–Cauchy Equations. Wronskian, Nonhomogeneous ODEs, Solution by Variation of Parameters. Power
Series Method for solution of ODEs: Legendre’s Equation. Legendre Polynomials, Bessel’s Equation,
Bessels’s functions Jn(x) and Yn(x). Gamma Function
Unit 3: Linear algebra: Matrices and Determinants, Gauss Elimination, Linear Independence. Rank of a
Matrix. Vector Space. Solutions of Linear Systems and concept of Existence, Uniqueness, Determinants.
Cramer’s Rule, Gauss–Jordan Elimination. The Matrix Eigenvalue Problem. Determining Eigenvalues and
Eigenvectors, Symmetric, Skew-Symmetric, and Orthogonal Matrices. Eigenbases. Diagonalization.
Quadratic Forms. Cayley – Hamilton Theorem (without proof)
Unit 4: Vector calculus: Vector and Scalar Functions and Their Fields. Derivatives, Curves. Arc Length.
Curvature. Torsion, Gradient of a Scalar Field. Directional Derivative, Divergence of a Vector Field, Curl of
a Vector Field, Line Integrals, Path Independence of Line Integrals, Double Integrals, Green’s Theorem in
the Plane, Surfaces for Surface Integrals, Surface Integrals, Triple Integrals, Stokes Theorem. Divergence
Theorem of Gauss.

First Year First Semester

Course title: Engineering physics -1
Code: XX 1XX
Type: BSC/SSC

11
 Credits: 3
Semester: 1

Course Engineering physics -1 (BS 103) Credits 3

Course Type BSC/SSC

Course Description

This course is designed to provide a fundamental understanding of the physical principles that
underpin various engineering disciplines. The course covers the engineering applications built on
fundamental physical principles of mechanics, and heat transfer.

Course Objectives

CO-1: To Provide a fundamental understanding of classical mechanics and its engineering applications.

CO-2: To Introduce the concepts of stress, strain, and material deformation in engineering contexts.

CO-3: To Explain the principles of thermodynamics and their applications in energy systems.

CO-4: To Develop a foundational understanding of quantum mechanics and its engineering applications.

CO-5: To Enhance problem-solving skills using physical principles across various engineering
disciplines.

CO-6: To Apply theoretical concepts to analyze and design engineering systems.

Course Learning Outcomes (in bullet points)

CLO-1: Analyze kinematic and dynamic systems using classical mechanics principles.

CLO-2: Apply stress-strain concepts to material selection and structural analysis.

CLO-3: Utilize thermodynamic laws in designing and evaluating energy systems.

CLO-4: Understand and apply quantum mechanics principles to modern engineering challenges.

CLO-5: Solve engineering problems using conservation laws and mechanical principles.

CLO-6: Integrate physical principles into the design and optimization of engineering systems.

12
 Mapped to Programme Level Outcomes
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12

CLO1 3 3 1 1 1 1 1 1 1 1 1 1

CLO2 3 3 1 3 1 1 1 1 1 1 1 1

CLO3 3 3 1 3 1 1 1 1 1 1 1 1

CLO4 3 3 1 3 1 1 1 1 1 1 1 1

CLO5 3 3 1 3 1 1 1 1 1 1 1 1

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

Course Description:
This course is designed to provide a fundamental understanding of the physical principles that underpin
various engineering disciplines. The course covers the engineering applications built on fundamental
physical principles of mechanics, and heat transfer.
Syllabus
Unit 1: Classical mechanics: Kinematics and dynamics of particles and rigid bodies. Conservation laws.
Concept of work, energy, and power, linear momentum and impulse. Rotational motion and moment of
inertia. Select examples of application in engineering systems such as pendulum, lever, etc.,
Unit 2: Mechanics of deformable bodies: Concept of stress, strain, strain energy. Elasticity, Hooke’s law,
plasticity. Select examples of applications of these concepts in material selection for structural applications
such as bridges.
Unit 3: Thermodynamics: Laws of thermodynamics: energy conservation, entropy, and the Carnot cycle.
Heat engines, refrigerators, and the efficiency of energy conversion. Applications in engineering: heat
exchangers, thermodynamic cycles in power plants and aviation, HVAC systems.
Unit 4: Quantum mechanics: Wave-particle duality and de Broglie hypothesis. Heisenberg's uncertainty
principle. Schrodinger equation. Particle in a box model. Applications in quantum computing.

First Year First Semester

Course title: Problem Solving and Programming and Lab
13
 Code: XX 1XX
Type: XXX
Credits: 3+2
Semester: 1

Course Problem Solving and Programming in C and Lab Credits 3+2

Course Type XXX

Course Description

After completion of this course successfully, the students will be able to......

Course Objectives

Course Learning Outcomes (in bullet points)

After completion of this course successfully, the students will be able to......

CLO-1: Understand basic terminology of computers and programming languages and

their evolution (Understand)

CLO-2: Know basic building blocks of algorithms and their programming language
counterparts (Understand)

CLO-3: Design the solution from specification of a problem and write pseudo code of the
algorithm. (Create)

CLO-4: Translate an algorithm into a computer program (Create)

CLO-5: Analyze programs using debugging tools. (Analyze)

Mapped to Programme Level Outcomes

PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12

CLO1 3 3 3 3 2 2 3 3 2 2 3 2

CLO2 3 3 3 3 2 2 3 3 2 2 3 2

CLO3 2 2 2 3 1 1 1 2 2 2 2 2

14
 CLO4 2 2 3 3 1 2 3 2 2 2 2 2

CLO5 2 2 3 3 1 2 3 2 2 2 2 2

UNIT I: (CLO-1, CLO-2)

Problems And Problem Instances, Generalization and Special Cases, Types of Computational Problems,
Classification of Problems, Analysis of Problems, Solution Approaches, Algorithm Development, Analysis
of Algorithm, Efficiency, Correctness, Data Representation, Role of Data Structures in Problem Solving,
Problem-Solving Steps (Understand the Problem, Plan, Execute, and Review), Breaking the Problem into
Subproblems, Input/Output Specification, Input Validation, Pre and Post Conditions.

UNIT II: (CLO-2, CLO-3, CLO-4)

Structured Programming Concepts: Sequence (Input/Output/Assignment), Selection (If, If-Else) And

Repetition (For, While, Do-While) Statements, Control Structure Stacking and Nesting. Different Kinds of
Repetitions: Entry Controlled, Exit Controlled, Counter Controlled, Definite, Indefinite and
Sentinel-Controlled Repetitions. Pseudocode and Flowcharts. Definition And Characteristics of Algorithms,
Standard Algorithm Format.

C Language: Introduction To Programming Languages, Different Generations of Programming Languages.

Typed Vs Typeless Programming Languages, History of C Language, An Empty C Program. C Language
Counterparts For Input (scanf()), Output (printf()) Statements, Assignment, Arithmetic, Relational and
Logical Operators. C statements for If, If-Else, For, While, Do-While Statements. Data Types. Translating
Pseudocode/Algorithm to C Program. Incremental Compilation and Testing of The C Program. Simple
Problems Involving Input, Output, Assignment Statement, Selection and Repetition Statements. Good
Coding Practices.

UNIT III: (CLO-2, CLO-3, CLO-4)

Problems Involving Iteration and Nesting: Displaying Different Patterns and Shapes Using Symbols and
Numbers, Generating Arithmetic and Geometric Progression, Fibonacci and Other Sequences, Approximate
Values For π, Sin(x), Cos(x), Etc. Using Taylor Series.

UNIT IV: (CLO-2, CLO-3, CLO-4)

Problems on Numbers: Extracting Digits of a Number (Left to Right and Right to Left), Palindrome, Prime
Number, Prime Factors, Amicable Number, Perfect Number, Armstrong Number, Factorial, Converting

15
Number from One Base to Another. Statistics (Maximum, Minimum, Sum and Average) on a Sequence of
Numbers which are Read using Sentinel-Controlled Repetition using only a few Variables.

C Language: else-if Ladder, switch Case, Increment/Decrement Operators, break and continue Statements.

UNIT V: (CLO-2, CLO-3, CLO-4, CLO-5)

Modular Programming, Top-Down and Bottom-Up Approaches to Problem Solving. Recursion. Problems
on Arrays: Reading and Writing of Array Elements, Maximum, Minimum, Sum, Average, Median and
Mode. Sequential And Binary Search. Any one Sorting Algorithm, Merging, Matrix Operations, Character
Arrays (Strings): String Functions, User Defined Data Types and Their Use Cases.

C Language: Function Definition and Declaration (Prototype), Role of Return Statement, One Dimensional
and Two-Dimensional Arrays. String Functions. Other Operators, Operator Precedence and Associativity.
Debugging and Makefile.

Text Books

1. Harvey Deitel and Paul Deitel, C How to Program, 9th edition, Pearson India, 2015.
2. R G Dromey, How to Solve It by Computer, First Edition, Pearson India, 2007.

Reference Books

1. Brian W. Kernighan and Dennis Ritchie, The C Programming Language, 2nd edition, Pearson, 2015.
2. Jeri Hanly and Elliot Koffman, Problem Solving and Program Design in C, 8th edition, Pearson, 2015.
3. Stephen Kochan. “Programming in C”, Pearson Education India.

Suggested Lab Exercises for Problem Solving and Programming Lab

16
Note: While solving the lab problems, it is advised to design an algorithm using basic building blocks
of structured programming. And the algorithm can be translated to a programming language. This
will benefit the students to learn other programming languages easily.

CLO-1: Converting degrees Celsius to Fahrenheit and vice versa?

CLO-2: Display three input numbers in sorted (non-decreasing) order?
CLO-3: Given a positive integer value n (>= 0) display number, square and cube of numbers from 1 to n
in a tabular format?
CLO-4: Given an input positive integer number, display the odd numbers in the range [1, n]?
CLO-5: Display the first 10 mathematical tables, each table up to 10 rows? Generalise this to display first
n (> 0) mathematical tables up to m (m > 0) rows?

First Year First Semester

Course title: Principles of engineering and sustainability
Code: XX 1XX
Type: PCC/DSC
Credits: 4
Semester: 1

Course Principles of engineering and sustainability (MT 101) Credits 4

Course Type DSC / SSC / FSC / SSE / ScSE / FSE / OE / GEC/ Int./ RI/ CE

Course Description

This is an introductory course designed to provide an overview of the basic principles involved in
engineering across disciplines, with focus on the process employed in design and problem
solving. This course covers both the classical methods and modern practices along with an
emphasis on sustainability.

Course Objectives

CO-1: To Introduce the foundational principles of engineering across various disciplines.

CO-2: To Explain the engineering design process and problem-solving methodologies.

17
 CO-3: To Familiarize students with fundamental engineering concepts and practices.

CO-4: To Highlight the importance of sustainability in engineering design and practice.

CO-5: To Examine the historical evolution of engineering and its impact on society.

CO-6: To Explore modern engineering practices including data analytics and energy management.

Course Learning Outcomes (in bullet points)

CLO-1: Understand the basic principles and definitions related to science, engineering, and technology.

CLO-2: Apply the engineering design process to solve problems with consideration of constraints.

CLO-3: Utilize fundamental engineering concepts such as dimensional analysis in practical applications.

CLO-4: Evaluate sustainability using the sustainability index and life cycle analysis.

CLO-5: Analyze the impact of the industrial revolutions on the environment and engineering practices.

CLO-6: Implement modern engineering practices in automation, optimization, and sustainability efforts

Mapped to Programme Level Outcomes

PL PL PL PL PL PL PL PL PL PLO PLO PLO

O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12

CL
3 1 1 2 1 1 1 1 1 1 1 1
O1

CL
3 1 2 2 1 1 2 1 1 1 1 1
O2

CL
3 2 1 1 1 1 1 1 1 1 1 1
O3

CL
2 2 1 1 1 1 1 1 1 1 1 1
O4

CL
2 2 1 1 1 1 1 1 1 1 1 1
O5

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping

Course Description:
This is an introductory course designed to provide an overview of the basic principles involved in
engineering across disciplines, with focus on the process employed in design and problem solving. This
course covers both the classical methods and modern practices along with an emphasis on sustainability.
Syllabus
Unit 1: Introduction: Definitions of science, engineering and technology. Overview of scientific methods.
History of engineering and key inventions.
18
Unit 2: Engineering design process and problem solving: Basic steps in engineering design.
Considerations and constraints in design. Select case studies of the design process covering various
engineering disciplines. Basic steps in engineering problem solving.
Unit 3: Fundamental concepts in engineering practice: Dimensional analysis and units. Engineering
application of the basic parameters related to time, length, mass, force, temperature, energy, power and
current. Standards and codes.
Unit 4: Sustainability: Industrial revolution 1.0-4.0 and its impact on environment. Significance of
sustainable technology. Quantification of sustainability by sustainability index. Life cycle analysis.
Determining total energy consumption.
Unit 5: Modern engineering practices: Data analytics, automation, optimization, energy management and
sustainability.

First Year First Semester

Course title: Basic engineering laboratory - 1
Code: XX 1XX
Type: PCC/DSC
Credits: 2
Semester: 2

Course Basic engineering laboratory – 1 (ES 105) Credits 2

Course Type PCC/DSC

Course Description

This course provides hands on foundational training on basic aspects of computer, electrical and
electronics engineering.

Course Objectives

CO-1: To Provide foundational training in computer hardware and software

CO-2: To Introduce basic concepts and practices in electrical wiring.

CO-3: To Teach fundamental electronics skills, including circuit design and measurement.

CO-4: To Develop hands-on experience with electrical and electronics components.

CO-5: To Familiarize students with practical applications of series and parallel circuits.

CO-6: To Equip students with skills to build and test basic electronic circuits.

19
 Course Learning Outcomes (in bullet points)

CLO-1: Understand the components and functions of computer hardware and software

CLO-2: Perform basic electrical wiring tasks, including one-way and two-way switch setups.

CLO-3: Use a multimeter for accurate electrical measurements.

CLO-4: Design and assemble circuits on a breadboard using various components.

CLO-5: Analyze and implement series and parallel resistor configurations.

CLO-6: Build and test circuits incorporating LEDs, resistors, capacitors, transistors, and ICs.

Mapped to Programme Level Outcomes

PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12

CLO1 3 3 3 3 2 2 3 3 2 2 3 2

CLO2 3 3 3 3 2 2 3 3 2 2 3 2

CLO3 2 2 2 3 1 1 1 2 2 2 2 2

CLO4 2 2 3 3 1 2 3 2 2 2 2 2

CLO5 2 2 3 3 1 2 3 2 2 2 2 2

CLO6 2 2 2 2 1 2 3 3 3 2 2 2

CLO7 2 2 2 2 1 2 3 3 3 2 2 2

CLO8 3 3 3 3 2 2 3 3 2 2 3 2

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

Course Description:

This course provides hands on foundational training on basic aspects of computer, electrical and electronics
engineering.

Module 1 :

1) Opening up of a computer and identification of computer peripherals and components: Appreciating the
block diagram along with the configuration of each component and its functionality: Input/ Output devices,
I/O ports and interfaces, main memory, cache memory and secondary storage technologies, network,
graphics cards etc.

20
2) Understanding the directory structure of Linux and ideas of open source

3) Learning basic Linux commands

4) Installing the Linux operating system

5) Installing Application software (Eg. Jupyter notebook, Calibre etc.) and package management. Exploring
Libre Office packages.

Suggested Exercises:

1.

a) Identify the processor cooling fan and processor in the CPU. Unmount the processor from the
motherboard.

b) Identify the SMPS, unmount it from the motherboard, and install it back.

c) Identify the RAM slots and unmount the RAM cards from the motherboard.

d) Identify the PCI cards, and install them on the motherboard.

e) Identify the secondary memory(hard disk drive) and unmount them from the motherboard.

f) Unmount the DVD driver from the CPU and mount it back

2. Explore the linux directory structure with the commands ls, whoami, pwd, cd, mkdir, rmdir, rm, cat, mv,
cp, etc.

3. Piping of commands and head, tail, wc of a text file, file permissions, chmod etc.

4. Install the Linux operating system on a computer. Understand the BIOS setup of a computer. Understand
the disk partitioning mechanism.

5. Installation of application software in Linux, Package manager in Linux, Exploring the LibreOffice Writer
application

Module 2: Electrical engineering – Basic wiring, one-way, 2-way switch, series and parallel connections.

21
Module 3: Electronics: - Measurements with mustimeter, wiring on bread board, resistors on series and
parallel, circuits with LED, resistors, capacitors, transistors and ICs.

First Year Second Semester

Course title: Discrete Mathematics
Code: IE203
Type: BSC/SSC
Credits: 3
Semester: 2

Course Discrete Mathematics Credits 3

Course Type BSC/SSC

Course Description

This course introduces fundamental concepts of Discrete Mathematics that is importsnt in

Coputer science and Engineering. It covers topics such as Sets, Relations, Logic, Boolean
Functions, Graphs and Trees etc which are relevant to various Computer Science Topics.

Course Objectives

CO-1: To Introduce fundamental concepts of Logic and its application.

CO-2: To Explain concepts og Graphs and Trees along with their role in CS.

CO-3: To Explore Sets and Relations and relevent concepts such as Lattices.

CO-4: To Teach about recursion and its usefulness in problem solving.

CO-5: To Explain concepts of Boolean Functions and their role in Circuits.

CO-6: To Introduce relevence above concepts in Computer Science applications.

Course Learning Outcomes (in bullet points)

CLO1: Apply predicate and propositional logic to represent and solve problems. (Apply)

CLO2: Discuss various ways of simplification and apply the same on minimizing logical circuits,

22
 (Understand)

CLO3: Using principle of recursion, be able to frame a real-world situation as a recurrence

relation and solve. (Apply).

CLO4: Describe counting principles (Understand)

CLO5: Apply counting principles in real world scenarios. (Apply)

CLO6: Describe graphs and trees techniques (Understand)

CLO7: Apply the graphs and trees techniques to solve the real time problems (Apply)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO 3 2 1
1
CO 1 3 2
2
CO 2 3 1
3
CO 3 2 1
4
CO 1 2 3
5
CO 3 1 2
6
CO 1 2 3
7
‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

Detailed Syllabus:

UNIT-I: Sets, Relations and Functions

Sets, relations and functions; Methods of proof; Equivalence relations; Cardinality; Countable and
uncountable sets

UNIT-II: Introductory Logic

Fundamentals of Logic; Logic operators such as AND, OR etc., Truth tables; Logical inferences; Methods of
proofs of an implication; First order logic; Predicate calculus Predicates and Quantifiers; Rules of inference
for quantified propositions

UNIT-III: Recurrence Relations:

23
Recursion, Forming and solving recurrence relations by substitution method and generating functions;
Method of characteristic roots; solving inhomogeneous recurrence relations

UNIT-IV: Boolean Algebra:

Partial order relations; Lattices; Boolean algebra; Combinatorial circuits; Minimization of Boolean functions
using Karnaugh maps

UNIT-V: Theory of Graphs

Graphs, subgraphs, isomorphism, proofs; Types of graphs; paths and cycles; Adjacency matrices; Transitive
closure; Connectivity; Directed acyclic graphs; Planar graphs and Euler's formula; Dual of a graph;
Hamiltonian and Eulerian graphs; Applications like matching and colouring graphs; Graph traversals (BFS
and DFS); Trees; Spanning trees.

Reference Books:

Kenneth H Rosen (2012), “Discrete Mathematics and Its Applications”,7th Edition, McGraw Hill, NY
Ralph P Girimaldi(2003), “Discrete and Combinatorial Mathematics –An Applied Introduction”, 5th Edition,
Pearson Addison Wesley, Indian Edition
J.R Mott, A Kandel, T.P Baker (2015), “Discrete Mathematics for Computer Scientists and Mathematicians”,
Pearson
Ronald L Graham, Donald E Knuth, Oren Patashnik(1994), “Concrete Mathematics- A Foundation of
Computer Science”, 2nd Edition, Addison Wesley .
Susanna S. Epp(2010), “Discrete Mathematics with Applications”, 4th Edition, Brooks/Cole Cengage
Learning.
●
First Year Second Semester
Course title: Engineering physics -II
Code: XX 1XX
Type: BSC/SSC
Credits: 3
Semester: 2

Course Engineering physics -II (BS 104) Credits 3

Course Type BSC/SSC

24
Course Description

This course is designed to provide a fundamental understanding of the physical principles that
underpin various engineering disciplines. The course covers the engineering applications built on
fundamental physical principles of optics, electromagnetism, semiconductors etc.

Course Objectives

CO-1: To Provide a foundational understanding of wave optics and its engineering applications.

CO-2: To Explain the principles of electricity and magnetism relevant to engineering.

CO-3: To Introduce the fundamentals of semiconductor physics and electronic devices.

CO-4: To Explore the basic concepts of nuclear physics and their applications.

CO-5: To Develop problem-solving skills using physical principles in engineering contexts.

CO-6: To Demonstrate the application of these physical principles in modern engineering technologies.

Course Learning Outcomes (in bullet points)

CLO-6: Understand wave motion, optics, and apply them in areas like fiber optics and lasers.

CLO-7: Analyze electric and magnetic fields, and apply them in circuits, motors, and generators.

CLO-8: Apply semiconductor principles to the design of rectifiers, amplifiers, and oscillators.

CLO-9: Comprehend atomic and nuclear physics concepts and their engineering applications.

CLO-10: Solve engineering problems using principles of electromagnetism and semiconductor

physics.

CLO-11: Design and analyze electronic circuits using transistors, FETs, and digital electronics.

Mapped to Programme Level Outcomes

PL PL PL PL PL PL PL PL PL PLO PLO PLO

O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12

CL 2 2 2 2 1 1 1 1 1 1 1 1
O1

CL 3 3 3 2 1 1 1 1 1 1 1 1
O2

CL 2 2 2 2 1 1 1 1 1 1 1 1
O3

CL 2 2 2 2 1 1 1 1 1 1 1 1
O4

25
 CL 3 3 3 3 1 1 1 1 1 1 1 1
O5

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

Course Description:
This course is designed to provide a fundamental understanding of the physical principles that underpin
various engineering disciplines. The course covers the engineering applications built on fundamental
physical principles of optics, electromagnetism, semiconductors etc.
Syllabus
Unit 1 Optics: Wave motion: types of waves and their properties. Wave equation. Concepts of reflection
and refraction and applications in lenses, and mirrors. Basics of interference and diffraction of light. Select
examples of application of these concepts in the area of acoustics, optics including fiber optics and lasers.
Unit 2: Electricity and magnetism: Review of basic concepts of electric charge, electric fields, and Gauss's
law. Electric potential, capacitance, and dielectrics. Electric current, resistance, and Ohm's law. Magnetic
fields, magnetic forces, and Ampere's law. Electromagnetic induction and Faraday's law. Select examples of
application of these concepts in design of circuits, motors, generators, etc.
Unit 3: Semiconductors : Introduction to semiconducting materials, p-n junction diode and its functionality,
Diode equation, half-wave, full wave and bridge rectifiers with voltage regulation circuits. Clipping,
clamping, voltage doubler and multipliers. Transistors npn, pnp, CE, CB and CC configurations, transistor
characteristics CE amplifier designing, RC Oscillator, FET amplifier design, MOSFET and Introduction to
Digital electronics.
Unit 4: Nuclear physics: Basic concepts in atomic and nuclear physics- atomic structure, radioactivity, and
nuclear reactions. Applications in nuclear engineering and medical field.

First Year Second Semester

Course title: Engineering mathematics - II
Code: XX 1XX
Type: BSC/SSC

26
 Credits: 3
Semester: 2

Course Engineering mathematics – II (BS 102) Credits 3

Course Type BSC/SSC

Course Description

Engineering Mathematics - 2 is a foundational course that aims to impart essential mathematical

skills and techniques relevant to various engineering disciplines to solve engineering problems.
The topics covered include probability statistics and partial differential equations.

Course Objectives

CO-1: To Develop a strong foundation in complex analysis and its engineering applications.

CO-2: To Introduce fundamental concepts in probability and statistics for engineering problems.

CO-3: To Equip students with skills in integral transformations, including Laplace and Fourier
transforms.

CO-4: To Teach the application of partial differential equations (PDEs) to model and solve physical
problems.

CO-5: To Enhance problem-solving abilities using advanced mathematical techniques.

CO-6: To Apply mathematical methods to analyze and solve real-world engineering challenges.

Course Learning Outcomes (in bullet points)

CLO-1: Understand and apply complex analysis, including Cauchy’s theorems and series expansions.

CLO-2: Use probability and statistical methods in engineering applications like quality control.

CLO-3: Apply Laplace and Fourier transforms to solve ordinary differential equations (ODEs).

CLO-4: Model and solve physical problems using partial differential equations (PDEs).

CLO-5: Analyze and interpret statistical data in the context of engineering reliability and risk analysis.

CLO-6: Utilize integral transformations in solving complex engineering problems.

27
 Mapped to Programme Level Outcomes

PL PL PL PL PL PL PL PL PL PLO PLO PLO

O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12

CL 3 1 1 2 1 1 1 1 1 1 1 1
O1

CL 3 1 2 2 1 1 2 1 1 1 1 1
O2

CL 3 2 1 1 1 1 1 1 1 1 1 1
O3

CL 2 2 1 1 1 1 1 1 1 1 1 1
O4

CL 3 2 1 2 1 2 1 1 1 1 1 1
O5

‘3’–‘high-level’ mapping; ‘2’–‘Medium-level’ mapping; ‘1’–‘Low-level’ mapping;

Course Description:
Engineering Mathematics - 2 is a foundational course that aims to impart essential mathematical skills and
techniques relevant to various engineering disciplines to solve engineering problems. The topics covered
include probability statistics and partial differential equations.
Unit I: Complex Analysis: Complex Numbers and Their Geometric Representation, Polar Form of Complex
Numbers. Powers and Roots, Derivative. Analytic Function, Cauchy–Riemann Equations. Laplace’s
Equation, Exponential Function, Trigonometric and Hyperbolic Functions. Euler’s Formula, de’Moivre’s
theorem, Logarithm. General Power. Principal Value. Singularities and Zeros. Infinity, Line Integral in the
Complex Plane, Cauchy’s Integral Theorem, Cauchy’s Integral Formula, Derivatives of Analytic Functions,
Taylor and Maclaurin Series.
Unit 2: Probability and Statistics: Probability concepts - sample space, events, probability rules. Discrete
and continuous probability distributions - binomial, normal etc. Statistical measures - mean, variance,
standard deviation. Statistical inference and hypothesis testing. Applications of probability and statistics in
engineering - reliability, quality control and risk analysis.
Unit 3: Integral Transformations: Laplace Transforms: Definitions and existence (without proof),
properties, First Shifting Theorem (s-Shifting), Transforms of Derivatives and Integrals and ODEs,
Convolution. Integral Equations, Differentiation and Integration of Transforms. Solution of ODEs with
Variable Coefficients, Solution of Systems of ODEs. Inverse Laplace transform and its properties. Fourier
Analysis: Fourier Series, Arbitrary Period. Even and Odd Functions. Half-Range Expansions, Fourier
Integral, Fourier Cosine and Sine Transforms, Fourier Transform. Usage of F ODEs. Inverse Fourier
transform and its properties.
Unit 4: PDEs and Applications: : Basic Concepts of PDEs. Modeling: Vibrating String, Wave Equation.
Solution by Separating Variables. Use of Fourier Series. D’Alembert’s Solution of the Wave Equation.
Characteristics. Modeling: Heat Flow from a Body in Space. Heat Equation: Solution by Fourier Series.
Steady Two-Dimensional Heat Problems.

28
 First Year Second Semester
Course title: Creativity and innovation
Code: XX 1XX
Type: OS/OE
Credits: 3
Semester: 2

Course Creativity and innovation (ES 102) Credits 3

Course Type DSC / SSC / FSC / SSE / ScSE / FSE / OE / GEC/ Int./ RI/ CE

Course Description

This course is aimed to expose the students to the importance of creativity and innovation in
science, engineering, and technology. To achieve high sustainability scores in technology it is
important to be creative and innovate. This course shall motivate the students to understand and
practice creativity and innovation.

Course Objectives

CO-1: To Highlight the importance of creativity and innovation in science, engineering, and technology.

CO-2: To Explain the different types of innovation, including process, product, and business model
innovations.

CO-3: To Teach methods for thoroughly understanding and defining engineering problems.

CO-4: To Introduce techniques for generating new ideas and overcoming barriers to innovation.

CO-5: To Explore stages and examples of innovation in science, engineering, and technology.

CO-6: To Emphasize the importance of mind management and mental attitudes in fostering creativity.

Course Learning Outcomes (in bullet points)

CLO-1: Understand and define creativity and innovation, and recognize their importance in technology.

CLO-2: Identify and categorize different types of innovation with relevant examples.

CLO-3: Apply methods to systematically understand and define problems.

CLO-4: Utilize various techniques for generating new ideas and overcoming innovation barriers.

29
CLO-5: Analyze and apply the stages of innovation in scientific and engineering contexts.

CLO-6: Develop strategies for mind management to enhance creativity and innovation skills.

Mapped to Programme Level Outcomes

PL PL PL PL PL PL PL PL PL PLO PLO PLO

O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12

CL 1 1 1 1 3 2 1 1 1 1 1 1
O1

CL 1 1 1 1 3 1 1 1 1 1 1 1
O2

CL 1 1 1 1 2 1 1 1 1 1 1 1
O3

CL 1 1 1 1 3 1 1 1 1 1 1 1
O4

CL 2 1 1 1 2 1 1 1 1 1 1 1
O5

Course Description:
This course is aimed to expose the students to the importance of creativity and innovation in science,
engineering, and technology. To achieve high sustainability scores in technology it is important to be
creative and innovate. This course shall motivate the students to understand and practice creativity and
innovation.
Unit 1: Introduction: Definitions of Creativity and Innovation; Bringing new ideas related to practices,
procedures, products, etc. into existence; Types of innovation: process innovation, product innovation,
service innovation and business model innovation;
Unit 2: Systematic understanding of a problem: Importance of thoroughly understanding a problem; How
to understand a problem? Methods for defining a problem (Kipling, problem statement and challenge
methods) with examples;
Unit 3: Techniques for creating new ideas: When do we get new ideas? How do we get new ideas? Why is
it required to innovate? Important techniques: Attribute listening, Brainstorming, Brainwriting, Brainfaxing,
and Visioning with examples; Conceptual blocks and barriers for innovation.
Unit 4: Innovation in science, engineering, and technology: Stages in innovation (preparation,
verification/validation, incubation and realization) with examples; Innovation in science (question on nature,
inquiry and discovery methods, evidence, proposed explanation, solution, usefulness to the society);
Innovation in engineering and technology (questions on problems adapting to the environment, design and

30
invention strategies, evidence, proposed explanation, verification, validation, solution directly useful to the
society);
Unit 5: Mind management: Importance of mind management; Human mind; Left and right Brian; super
conscious mind; shaping rightful mental attitude; any memory game

School of Computer and Information Sciences

Name of the Academic Program: Integrated M.Tech (CSE) (IMTECH-II)

Course Code: IE252 Title of the Course: Data and File Structures

L-T-P: 3-0-0 Credits : 3

Prerequisite Course / Knowledge (If any): Programming Language course (PM)

Course Outcomes (COs)

After completion of this course successfully, the students will be able to……

​ CO-1: Discuss which data structures are used for static and dynamic allocations. (Understand)
​ CO-2: Solve the problem where in elements can be traversed in either direction and select the
suitable data structure for this idea using C/Java Programming Language (Apply)

​ CO-3: Analyze the time taken to solve the given problem by using C/Java programming language

(Analyze)

​ CO-4: Assess the solution in terms of efficiency, modularity and well-documented programs in

C/Java under Linux environment (Evaluate)

Mapping of Course Outcomes (COs) with Program Outcomes (POs)

and Program Specific Outcomes (PSOs)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 3 1

31
CO2 3 2 1

CO3 3 2 1

CO4 1 2 3

Detailed Syllabus:

UNIT-I

Introduction to data structures and data types: Primitive and Non-Primitive types, Arrays- Sparse matrix,
Stacks, Queues, Circular queues, Priority queues, Dequeues, Conversions and Evaluations of expressions,
Polynomial representation using arrays, Time complexity analysis of algorithms with respect to data
structure operations

Unit-II

Linked Lists: Linked stacks and queues, Circular and Doubly linked lists, Polynomial representation using
linked lists.

Unit-III

Trees and Graphs: Binary Trees, Tree Traversal, Binary Search trees and basic operations, Heaps, AVL Trees,
height balanced trees. , Graphs – Representation of the graphs, Graph Traversals.

Unit-IV

Sorting and Searching Mechanism: Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap
sort. Linear Search, Binary Search, Hash Tables.

UNIT – V

File structures: Concepts of Double Buffering and Block Buffering, Indexing, B-tree needs, properties,
creations and Uses, B+ trees

Suggested reading::

1. Horowitz, E., and Sahni.S: Fundamentals of Data structures. Computer Science Press, 1978.

2. Tanenbaum, A.M., and Augenstein, M.J.: Data Structures with Pascal, Prentice - Hall International, 1985.

3. Stubbas, D.: Data Structures with Abstract Data Types and Modula2, Brooks & Cole Pub. Co.

1987.

4. Trembley & Sorenson: An Introduction to Data Structures with Applications; Tata McGraw

Hill.

32
8. Kruse, R. L., Leung, B. P., and Tondo, C. L.: Data Structures and Program Design in C; Prentice

- Hall of India, 1999.

9. The C Programming Language by Brian W.Kernighan , Dennis M. Ritchie

10. Michael J. Folk and Bill Zoellick, “File Structures” (Second Edition).

11. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition Addison- Wesley,
1997.

12. Schaum‟s Outline Series, “Data Structure”, TMH, Special Indian Ed., Seventeenth Reprint, 2009.

13. Mary E. S. Loomes, “Data Management and File Structure”, PHI, 2nd Ed., 1989.

School of Computer and Information Sciences

Name of the Academic Program: Integrated M.Tech (CSE) (IMTECH-II)

Course Code: IE257 Title of the Course: Data and File Structures Lab

L-T-P: 0-1-2 Credits : 2

Prerequisite Course / Knowledge (If any): Programming Language course (PM)

Course Outcomes (COs)

After completion of this course successfully, the students will be able to……

​ CO-1: Solve a given problem by choosing appropriate data structures (Apply).

​ CO-2: Select suitable data structure for given idea and propose an appropriate solution
(Understand)

​ CO-3: Analyze the time taken to solve a given problem (Analyze)

​ CO-4: Assess the solution in terms of performance and standard programming principles under

Linux environment (Evaluate)

Mapping of Course Outcomes (COs) with Program Outcomes (POs)

and Program Specific Outcomes (PSOs)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 1

CO2 1 2 3

33
CO3 3 2 1

CO4 1 2 3

Detailed Syllabus:

UNIT-I: Implementation of Stacks and different types of Queues data structures using arrays, Conversions
and Evaluations of expressions.
Suggested Assignments:

Large integer arithmetic. Arithmetic operations are to be performed on very large integers of N digits
(where 0 < N < 20). Write a C program that performs the operations of multiplication and division on such
large integers.

Two stacks using a single array. Implement two stacks using a single array such that neither overflows
unless the total number of elements in both the stacks is equal to the size of the array.

Deque. Deque is a queue which allows insertions and deletions at both ends. Write a C program that
implements deque using both arrays and linked lists. Each implementation should provide support for
basic operations such as (i) Insertion of an element at both ends (ii) Deletion of an element from both ends
(iii) Displaying all elements of deque.

Evaluation of arithmetic expression. Write a C program that reads an input arithmetic expression in (INFIX,
PREFIX, POSTFIX) notations and outputs its result.

Arithmetic expression notation conversion. Write a C program that reads an input arithmetic expression in
infix notation (fully parenthesized) and converts it into an output arithmetic expression in postfix notation.

UNIT-II: Implementation of basic Linked List operations such as addition, updation, deletion, searching
and traversal of all elements of the list

Suggested Assignments:

Implement Stack data structure (using linked list) operations. Write a C program to perform the basic
operations on the stack.

Implement Queue data structure (using linked list) operations. Write a C program to perform the basic
operations on the queue.

Doubly Linked List operations. Linked list (doubly) is an important data structure for dynamic allocation
wherein elements can be traversed by either direction. Write a C program to perform the basic operations
on the linked list.

34
Union and Intersection. Given two linked lists of numbers, write a program that finds a resultant linked list
which is union of the two input linked lists and another resultant linked list which is intersection of the two
input linked lists.

Detecting cyclic linked lists. Write a C program that detects whether a given linked list is cyclic or not, if
yes, then return the node where the cycle begins.

UNIT-III: Implementation of Trees and Graphs of basic operations. Implementation of Adjacency Matrix
and List Representation. Breadth and Depth First Search

Suggested Assignments
Tree traversals. Write C program to display a tree using all the methods of traversals: (i) Inorder traversal,
(ii) Preorder traversal, (iii) Postorder traversal

Binary Search Tree. Binary Search Tree is an important data structure for dynamic allocation and optimized
searching. Write C program to perform the basic operations on binary search tree (BST): (i) Adding, (ii)
Updating (iii) Deleting (iv) Search for an element (v) Displaying all elements (in-order).

Building heap. Using a C program, build a max-heap, given N random integers. Display the heap thus
formed in its in-order form.

Heap sort. Using the heap data structure, sort the given N random integers.

AVL Trees. Using a C program, perform the following operations on the AVL tree data structure: (i)
Inserting, (ii) Deleting, (iii) Update, (iv) Searching, (v) Displaying an element

Topological Sorting. In a university curriculum, often each course has a set of pre- requisites. Given a set of
courses along with their respective set of pre-requisites, prepare a curriculum such that no course appears
before its prerequisite.

Using Linked List and BST: Construction of a city database using a linked list and binary search tree and
the appropriateness of these structures under various demands for the data.

UNIT-IV: Sorting and Searching Mechanism: Linear Search, Binary Search,

Implementation of Bubble, Insertion, Quick, Selection Sort.

Suggested Assignments

Write C programs to perform both linear and binary search on a given random set of integers.
The following points should perform by the program

​ Take as input an integer, N, which would decide number of integers to be processed and another
input an integer, X (0 < X < N+1), which is the key to be searched
​ Randomly generate N integers whose values are between 1 to N, multiple entries are allowed
​ Output all the indexes (positions) of key in given set of random integers

35
 ​ Count number of comparisons in the linear and binary searching process, please note comparisons
involved in sorting process (in case of binary search) are not to be included
​ Output the result in following table:-

Input size (N) Number of Comparisons

Linear Search Binary Search

10

30

50

70

100

Merge Sort. Logging activity files of two users are given as input, merge them into a single file. Assume
that the format of the logging activity file is two columns with the first column representing the date-time
record and second column the event description. Merging is to be done with respect to the date-time record
field.

UNIT-V: File Structures: Implementation of B Trees and B+ Trees

Suggested Assignments

Improved file copying. Modify the file copy program to avoid overwriting the existing target file, instead if
the target file has some contents, then target file is appended by contents of source file.

File handling API. Write a program to read and write a file using following combinations of functions:-

1. fgetc( ) and fputc( )

2. fprintf( ) and fscanf( )
3. fgets( ) and fputs( )
4. fread( ) and fwrite( )

Suggested readings::

1. Horowitz, E., and Sahni.S: Fundamentals of Data structures. Computer Science Press, 1978.

2. Tanenbaum, A.M., and Augenstein, M.J.: Data Structures with Pascal, Prentice - Hall International, 1985.

3. Stubbas, D.: Data Structures with Abstract Data Types and Modula2, Brooks & Cole Pub. Co. 1987.

36
4. Trembley & Sorenson: An Introduction to Data Structures with Applications; Tata McGraw Hill.

5. Kruse, R. L., Leung, B. P., and Tondo, C. L.: Data Structures and Program Design in C; Prentice - Hall of
India, 1999.

6. The C Programming Language by Brian W.Kernighan , Dennis M. Ritchie

7. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition Addison- Wesley, 1997.

8. Schaum‟s Outline Series, “Data Structure”, TMH, Special Indian Ed., Seventeenth Reprint, 2009.

9. Mary E. S. Loomes, “Data Management and File Structure”, PHI, 2nd Ed., 1989.

10. Michael J. Folk and Bill Zoellick, “File Structures” (Second Edition).

11. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition Addison- Wesley, 1997.

12. Schaum‟s Outline Series, “Data Structure”, TMH, Special Indian Ed., Seventeenth Reprint, 2009.

13. Mary E. S. Loomes, “Data Management and File Structure”, PHI, 2nd Ed., 1989.

First Year Second Semester

Course title: Engineering Drawing
Code: XX 1XX
Type: ESC/SSC
Credits: 3
Semester: 2

37
Course Engineering Drawing (ES 104) Credits 2

Course Type ESC/SSC

Course Description

This course designed to impart basic skills in visual communication and graphical representation
of engineering concepts using a CAD software. Through a combination of lectures,
demonstrations, and hands-on exercises, students will learn fundamental principles of engineering
drawing, computer-aided design (CAD), and technical sketching.

Course Objectives

CO-1: Develop basic skills in visual communication and graphical representation using CAD software.

CO-2: Introduce fundamental principles of engineering drawing and technical sketching.

CO-3: Teach geometric constructions and their applications in engineering graphics.

CO-4: Explain orthographic and isometric projections for representing engineering designs.

CO-5: Demonstrate methods for drawing sections of solids and visualizing internal features.

CO-6: Apply engineering drawings to practical applications including machine drawings and 3D printing.

Course Learning Outcomes (in bullet points)

CLO-1: Understand and apply engineering drawing principles and CAD software for graphical
representation.

CLO-2: Perform basic geometric constructions and implement them using CAD software.

CLO-3: Create and interpret orthographic projections and understand their relationships.

CLO-4: Draw and interpret isometric projections of simple solids using CAD software.

CLO-5: Represent sections of solids and visualize internal features in engineering drawings.

CLO-6: Apply drawing techniques to machine design, fabrication, and 3D printing applications.

Mapped to Programme Level Outcomes

PL PL PL PL PL PL PL PL PL PLO PLO PLO

O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12

38
 CL 2 2 2 2 1 1 1 1 1 1 1 1
O1

CL 2 2 2 2 1 1 1 1 1 1 1 1
O2

CL 2 2 2 2 1 1 1 1 1 1 1 1
O3

CL 2 2 2 2 1 1 1 1 1 1 1 1
O4

CL 2 2 2 2 1 1 1 1 1 1 1 1
O5

Course Description:
This course designed to impart basic skills in visual communication and graphical representation of
engineering concepts using a CAD software. Through a combination of lectures, demonstrations, and
hands-on exercises, students will learn fundamental principles of engineering drawing, computer-aided
design (CAD), and technical sketching.
Syllabus
Unit 1: Introduction to engineering drawing & basic Geometrical Constructions: Introduction to the
field of engineering graphics and its applications in various engineering disciplines. Importance of
engineering drawings in the design and manufacturing process. Introduction CAD software. Engineering
lettering and dimensioning practices according to standards. Lines, angles, and their classifications.
Construction of triangles, quadrilaterals, and other polygons. Methods for construction of circles and
tangents, ellipses and parabolas. Using CAD software to implement the same.
Unit 2: Orthographic Projection: Principles of orthographic projection (first-angle and third-angle
projections).Drawing projections of points, lines, and planes in various orientations. Relationship between
views and true lengths and angles. Projections of simple solids (prisms, pyramids, cylinders, cones).
Unit 3: Sections of Solids: Methods for representing sections of solids in orthographic drawings. True
shapes of sections obtained by cutting planes. Applications in visualizing internal features and designing
components.
Unit 4: Isometric Projection: Introduction to isometric projection as a pictorial representation. Isometric
axes and scaling principles. Drawing isometric views of simple solids from orthographic projections using
CAD software. Conversion between isometric and orthographic projections.
Unit 5: Application of drawings: Machine drawings, conventional fabrication and 3D printing

39