Curriculum for

Second Year, B.Tech. Programme

w.e.f.
Academic Year 2024-2025
(NEP -2020 Compliant)

Department of Computer Science and

Engineering

Shri Guru Gobind Singhji Institute of

Engineering and Technology
Vishnupuri, Nanded-431 606, Maharashtra State, India.
Government Aided Autonomous Institute

Page 1 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Table of Contents
Sr.No. Particulars Page No.

1 Abbreviations. 3
2 Department Vision, Mission, PEOs, POs and PSOs. 4-6

3 Curriculum Structure for Second Year, B. Tech (Computer Science & Engineering). 7-8

Multi-Disciplinary Minor (MDM) Courses to be offered by Department of Computer

4 9
Science and Engineering.
5 Honors offered by Department of Computer Science and Engineering. 10
Double Minor Courses to be offered by Department of Computer Science and
7 11
Engineering.
Open Elective (OE) Courses to be offered by Department of Computer Science and
8 12
Engineering.

9 Exit Options after Second Year, B. Tech to Qualify for Diploma. 13

10 Syllabus of Third Semester Courses. 14-28

11 Syllabus of Fourth Semester Courses. 29-45
Syllabus of Multi-Disciplinary Minor (MDM) Courses to be offered by
12 46-51
Department of Computer Science and Engineering at Second Year B. Tech Level
Syllabus of Double Minor (DM) Courses to be offered by
13 52-57
Department of Computer Science and Engineering at Second Year B. Tech Level
Syllabus of Honour Courses (HON) to be offered by Department of Computer Science
14 58-62
and Engineering at Second Year B. Tech Level
Syllabus of Open Elective (OE) offered by [Computer Science and Engineering] at
15 63-68
Second Year B. Tech Level

16 Exit Options after Second Year, B. Tech (CSE) 69

Page 2 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Abbreviations

A. Course code and definition

Abbreviation Definition

L Lecture

P Practical

T Tutorial

BSC Basic Science Course

PCC Programme Core Course

PEC Programme Elective Course

MDM Multidisciplinary Minor

HON Honor Course

OE Open Electives

HSSM Humanities, Social Science, and Management Course

VEC Value Education Courses

VSEC Vocational Skill and Skill Enhancement Courses

FP Field Project

DM Double Minor

EX Exit Course

B. Definition of Credit

1 Hour Lecture (L) per week 1 Credit

1 Hour Tutorial (T) per week 1 Credit
1 Hour Practical (P) per week 0.5 Credit

Page 3 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Department of Computer Science and Engineering
Bachelor of Technology (B. Tech.) in Computer Science and Engineering

Vision
Provide an environment for quality education, pro-industry research and innovation with industry partnership
to meet world class educational standards.

Mission

M1 To offer state-of-the-art undergraduate programme in the domain of Computer Science and

Engineering.

M2 Continual up-gradation of curriculum and research facilities in the context of world class educational
standards, as per the need of stakeholders.

M3 To offer an education programme to develop skilled and employable human power to accept
societal and global challenges.

M4 To develop linkages with Industries, research organisations, institutions and professional

associations.

M5 To encourage faculty, staff and students for research and development activities, innovation,
consultation and entrepreneurship.

Programme Educational Objectives (PEOs)

The Computer Science and Engineering graduates will be able to:
PEO 1 To create engineering graduates with advanced knowledge of Computer Science and Engineering who
can contribute to propagating Computer Science and Technology.

PEO 2 To yield engineering graduates with adequate abilities in Computer Science and Technology who can
become successful developers, designers and researchers to fulfil the necessities of Computer Industries.

PEO 3 To produce graduates who can figure out, formulate, analyse and solve real life problems confronted in
Software Enterprises.

PEO 4 To produce graduates who can exhibit skills, professionalism, and ethical attitude required for
collaboration in their profession and adapt to current trends through lifelong learning.

Page 4 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Programme Outcomes (POs)
On successful completion of B. Tech. Program, Computer Science and Engineering graduates will be able to:

PO 1 Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering

specialization to the solution of complex engineering problems.

PO 2 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 solutions for complex engineering problems and design system components or processes
that meet the specified needs with appropriate consideration for the public health and safety,
and the cultural, societal, and environmental considerations.

PO 4 Use research-based knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid conclusions.

PO 5 Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools
including prediction and modelling to complex engineering activities with an understanding of
the limitations.

PO 6 Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal
and cultural issues and the consequent responsibilities relevant to the professional engineering
practice.

PO 7 Understand the impact of the professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge of, and need for sustainable development.

PO 8 Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.

PO 9 Function effectively as an individual, and as a member or leader in diverse teams, and in

multidisciplinary settings.

PO 10 Communicate effectively on complex engineering activities with the engineering community and
with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions.

PO 11 Demonstrate knowledge and understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.

Page 5 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 PO 12 Recognize the need for and have the preparation and ability to engage in independent and life-
long learning in the broadest context of technological change.

Programme Specific Outcomes (PSOs)

PSO 1 Foundation of mathematical concepts: To apply mathematical methodologies to crack problem using
appropriate mathematical analysis, data structure and efficient computer algorithms.

PSO 2 Knowledge of recent trends: To provide effective and efficient knowledge of recent technologies such
as Artificial Intelligence, Cyber Security, Internet of Things etc.

PSO 3 Project based learning: To provide platform to the students to develop a new and innovative
multidisciplinary project to cater local industry needs.

Correlation Matrix (Correlation between the PEOs and the POs)

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

PE01 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓

PE02 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓

PE03 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓

PE04 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓

PE05 ✓ ✓ ✓ ✓ ✓ ✓

The cells filled in with the ✓ indicate the fulfilment/correlation of the concerned PEO with the PO.

Page 6 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Curriculum Structure for
Second Year, B.Tech. (Computer Science and Engineering)
Semester - III

Sr. Hours Credits

Course code Course Name
No. L T P Total Theory Practical Total
Mathematics - III: Applied Linear
1 BSC-201 3 0 0 3 3 0 3
Algebra, Probability and Statistics
2 PCC-CS201 Discrete Mathematics 3 0 0 3 3 0 3

3 PCC-CS203 Digital Electronics 3 0 2 5 3 1 4

4 MDM-CS201 Multidisciplinary Minor - I 3 0 2 5 3 1 4

5 OE-CS201 Open Elective-I 2 0 2 4 2 1 3

6 HSSM-201 Project Management 2 0 0 2 2 0 2

Human Values and Professional
7 VEC-201 2 0 0 2 2 0 2
Ethics
8 FP-CS201 Field Project - I 0 0 4 4 0 2 2

Total 18 0 10 28 18 05 23

Page 7 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
Semester - IV

Hours Credits
Sr. No. Course code Course Name
L T P Total Theory Practical Total
1 PCC-CS202 Microprocessor and Interfacing 3 0 2 5 3 1 4

2 Computer Organization & Architecture

PCC-CS204 3 0 0 3 3 0 3
3 Data Structures
PCC-CS206 3 0 2 5 3 1 4
4 MDM-ME202 Multidisciplinary Minor - II 2 0 0 2 2 0 2
5 OE-CS202 Open Elective - II 2 0 2 4 2 1 3
VSEC-CS202 Object Oriented Programming with
6 0 0 4 4 0 2 2
Java
7 HSSM-202 Indian Economy 2 0 0 2 2 0 2

8 VEC-202 Environmental studies 2 0 0 2 2 0 2

Total 17 0 10 27 17 5 22

EXIT OPTION AFTER SECOND YEAR:

1. EXIT OPTION (Total Credits: 08) for Completion of Skill Based Course/s [ listed in Structure of Exit Option on
acquiring “Diploma in Engineering Page No.13]
[CSE]” certificate.
Stipulated duration: Summer Vacation

The opted Option must be registered to the Parent Dept. & Exam Section
with all relevant details by the student.
NOTE:
● Prerequisite Condition for opting EXIT: Clearing of all course work till the End of Second Year as a Regular Student.
● Student evaluation will be conducted by the department for the award of the said certification.
● Student must produce original documents/proofs such as Course/Internship completion certificates at the time of
Evaluation.

Page 8 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Multi-Disciplinary Minor (MDM) Courses to be offered by Department
of Computer Science and Engineering

Sr. Credits
Course Code Semester Name of the Course
No. Theory Practical Total

1 MDM-CS201 Sem-III Data Structures and Algorithms 3 1 4

2 MDM-CS202 Sem-IV Operating Systems 2 0 2

3 MDM-CS301 Sem-V Database Management Systems 3 1 4

4 MDM-CS302 Sem-VI Software Engineering 2 0 2

5 MDM-CS401 Sem-VII Introduction to Data Science 3 0 3

Total 13 02 15

Note: Computer Science and Engineering department Students will choose a Multidisciplinary Minor (MDM)
Bucket (a Set of Courses to be learnt from 2nd Year to Third/Final Year) offered by the other departments.

Page 9 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Honors Courses to be offered by
Department of Computer Science and Engineering

Credits
Sr.
Course Code Semester Name of the course
No. Theory Practical Total

1 HON-CS201 Sem-III Combinatorics and Probability 3 0 3

2 HON-CS202 Sem-IV Data Science 3 1 4

3 HON-CS301 Sem-V Artificial Neural Network 2 1 3

4 HON-CS302 Sem-VI Machine learning 2 1 3

5 HON-CS401 Sem-VII Deep Learning 2 1 3

6 HON-CS402 Sem-VIII Project 0 2 2

Total 12 06 18

Page 10 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Double Minor Courses to be offered by
Department of Computer Science and Engineering

Sr. Credits
Course Code Semester Name of the Course
No. Theory Practical Total

1 DM-CS201 Sem-III Data Structures and Algorithms 3 1 4

2 DM-CS202 Sem-IV Operating Systems 3 0 3

3 DM-CS301 Sem-V Database Management Systems 3 1 4

4 DM-CS302 Sem-VI Software Engineering 3 0 3

Introduction
5 DM-CS401 Sem-VII 3 1 4
to Data Science
Total 15 03 18

List of Multi-Disciplinary Minor (MDM) in Cyber Security

to be offered at Institute Level by CSE department
Sr. Course Semester Name of the course Credits
No. Code
Theory Practical Total

1 MDM-IS- Sem-III Number Theory 3 0 3

CS201
2 MDM-IS- Sem-IV Introduction to Computer 2 1 3
CS202 Security
3 MDM-IS- Sem-V Introduction to Cryptography 2 1 3
CS301
4 MDM-IS- Sem-VI Digital Forensic 2 1 3
CS302
5 MDM-IS- Sem-VII Cyber Security for Profesionals 2 1 3
CS401
Total 11 4 15

Note: Computer Science and Engineering department Students will choose a Multidisciplinary Minor (MDM)
Bucket (a Set of Courses to be learnt from 2nd Year to Third/Final Year) offered by the other departments OR
from Institute Level.

Page 11 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Open Elective (OE) Courses to be offered by
Department of Computer Science and Engineering

Sr. Course Credits

Semester Name of the course
No. Code Theory Practical Total
OE-CS201 Object Oriented Programming with 2 1 3
1 Sem-III
Java
2 OE-CS202 Sem-IV Cyber security Principles 2 1 3

3 OE-CS301 Sem-V Machine Learning

4 OE-CS303 Sem-V Ethical Hacking 2 0 2

5 OE-CS305 Sem-V Soft Computing

Total 6 2 8

Note: Computer Science and Engineering department Students will choose Open Elective (OE) Bucket (a Set of
Courses to be learnt from 2nd Year to Third/Final Year) offered by the other departments.

Page 12 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Exit Options after Second Year, B. Tech (CSE)

Exit Option - To qualify for Diploma:

Sr. Hours Credits

Cours
No Course Name
e code L T P Total Theory Practical Total
.
EX-
1 Project-1 0 0 8 8 0 4 4
CS202
Any one course from MKCL:

1. IT Hardware and Networking *

https://klic.mkcl.org/hardware-and-networking

2. Programming*

EX- https://klic.mkcl.org/programming
CS204
2 4
or

Any one course from MSBSVET:

1. Certificate Course in C and C++ Programming

https://msbsvet.edu.in/Public/CourseDtails.asp
x?P1=112
2. Certification Course in Web Page Designing
https://msbsvet.edu.in/Public/CourseDtails.aspx?P1=1
05
Total 8
Note: Project-1 can be completed in-house or online mode.

Page 13 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Syllabus of SEMESTER-III Courses
Mathematics III
Course Code BSC-201
Category Basic Sciences
Course Title Mathematics III: Applied Linear Algebra, Probability and Statistics
Scheme and Credits L T P No. of credits Semester
3 0 0 3 III

Course Objectives
1. To understand fields and vector spaces, subspaces, linear independence and dependence,
linear transformations, kernel and range, and inverse linear transformations, and find
matrices of general linear transformations.
2. To understand eigenvalues and eigenvectors and diagonalization process and to learn inner
products on a real vector space and orthogonality in inner product spaces and obtain
orthonormal bases using Gram-Schmidt process.
3. To provide students with the foundations of probabilistic and statistical analysis mostly used
in varied applications in engineering and science.
4. To understand probability distributions (univariate and bivariate) and their properties.

Course Outcomes

At the end of Course Students will be able.

1. CO1: Determine whether a given structure is vector space, subspace structure

2. CO2: Student will be able to determine basis and dimension of vector spaces
3. CO3: Find the matrix representation of a linear transformation given bases of the relevant vector
spaces.
4. CO4: Find the orthogonalization in inner product spaces and find eigenvalues, eigenvectors and
diagonalization and apply diagonalization to find powers of matrices, etc.
5. CO5: Develop problem solving techniques needed to accurately calculate probabilities and
describe the properties of discrete and continuous distribution functions.

Page 14 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
CO-PO Mapping
CO PO1 PO2 PO3 PO PO PO PO PO PO PO1 PO1 PO1 PSO1 PSO2 PSO
4 5 6 7 8 9 0 1 2 3
CO1
1 1

CO2
1 1

CO3
2 2

CO4
3 3 3 2 3

(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 Vector Spaces 10
Vector spaces, subspaces, linear dependence and independence, basis, and
dimensions; linear transformation (maps), range and kernel of a linear map, rank
and nullity, inverse of a linear transformation, rank-nullity theorem, composition
of linear map, matrix associated with linear map.
2 Diagonalization and Inner Product Spaces 12
Eigenvalues, eigenvectors, symmetric, skew-symmetric, and orthogonal
matrices, Eigen spaces, diagonalization; Inner product spaces, Gram-Schmidt
orthogonalization, QR Factorization, Cholesky Decomposition, Normed Linear
Spaces.
3 Random variables and Probability Distributions 15
Measure of central tendency and dispersion, Basic concepts of probability and
its properties; conditional probability and independent events; random
variables, discrete, continuous and independent random variables, the
multinomial distribution, discrete distributions: uniform, Bernoulli, Binomial,
Poisson, Poisson approximation to the binomial distribution, infinite sequence of
Bernoulli trials; sum of independent random variables; expectation of discrete
random variable, moments, variance of sum, correlation coefficient, Chebyshev’s
Inequality.
4 Continuous Probability Distributions 08
Continuous random variables and their properties, distribution functions and

Page 15 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 densities, normal, exponential and gamma densities.
Textbooks/References:
1. D. Poole, Linear Algebra: A Modern Introduction, 2nd edition, Brooks/Cole, 2005.
2. Gilbert Strang, Linear Algebra and Its Applications, 4th edition, Cengage Publications.
3. E. Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley and Sons, 2006.
4. P. S. Mann, Introductory Statistics, Wiley Publications, 7th edition (2013).
5. S. Kumaresan, Linear Algebra – A Geometric Approach, Prentice Hall India

Page 16 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Discrete Mathematics
Course Code PCC-CS201
Category Program Core Course
Course Title Discrete Mathematics

Scheme and Credits L T P No. of credits Semester

3 0 0 3 III

Course Objectives
1. Use mathematically correct terminology and notation.
2. To Construct correct direct and indirect proofs.
3. Use division into cases in a proof.
4. Use counter examples.
5. Apply logical reasoning to solve a variety of problems.

Course Outcomes
At the end of Course Students will be able.
1. CO1: For a given logic sentence express it in terms of predicates, quantifiers, and logical
Connectives.
2. CO2: For a given a problem, derive the solution using deductive logic and prove the
solution based on logical inference.
3. CO3: For a given mathematical problem, classify its algebraic structure.
4. CO4: Evaluate Boolean functions and simplify expressions using the properties of Boolean
algebra.
5. CO5: Develop the given problem as graph networks and solve with techniques of graph theory.
CO-PO Mapping
CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO3
1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 2 2 2 1 2 3 1

CO2 3 2 2 2 1 2 3 1
CO3 3 2 2 2 1 2 3 1
CO4 3 2 2 2 1 2 3 1
CO5 3 2 2 2 1 2 3 1
(3) High, (2) Medium, (1) Low
Course Content
Unit No. Unit Title and Contents Hours
1 Introduction
Sets, Relation, and Function
Operations and laws of sets, cartesian products, binary relation, partial ordering
relation, equivalence relation, image of a set, sum and product of functions,
bijective functions, inverse and composite function, size of a set, finite and 10
Page 17 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 infinite sets, countable and uncountable sets, cantor's diagonal argument and
the power set theorem, Schroeder-Bernstein theorem.
Principles of mathematical induction: The well-ordering principle, recursive
definition, the division algorithm: prime numbers, the greatest common divisor:
Euclidean algorithm, The fundamental theorem of arithmetic.
2 Basic counting techniques 06
Inclusion and exclusion, pigeon-hole principle, permutation, and combination.
3 Propositional Logic 08
Propositional Logic: syntax, semantics, validity and satisfiability, basic
connectives and truth tables, logical equivalence: the laws of logic, logical
implication, rules of inference, The use of quantifiers. proof techniques: some
terminology, proof methods and strategies, forward proof, proof by
contradiction, proof by contraposition, proof of necessity and sufficiency.
4 Algebraic Structures and Morphism 08
Algebraic Structures and Morphism: algebraic structures with one binary
operation, semi groups, monoids, groups, free and cyclic monoids and groups,
permutation groups, substructures, normal subgroups, algebraic structures
with two binary operation, rings, integral domain, and fields.
5 Graphs: 08
Graphs and their properties, degree, connectivity, path, cycle, sub graph,
isomorphism, Eulerian and Hamiltonian Walks, graph coloring, coloring maps
and planar graphs, coloring Vertices, coloring edges, list coloring, perfect graph,
definition properties and example.
6 Trees: 05
Introduction, applications of trees, tree traversal, trees, and sorting, spanning
trees, minimum spanning trees.
Textbooks/References
1. Hennessy and Patterson, Computer Architecture: A Quantitative Approach, Morgan and
Kaufman Publication, 6th Edition, 2013.
2. Morris Mano, Computer System Architecture, Pearson Education India, 3rd Edition, 2007.
3. Mostafa Abd-El-Barr, Hesham El-Rewini, Fundamentals of Computer Organization and
Architecture, Wiley Publication, 1st Edition, 2004.
4. Miles J. Murdocca, Vincent P. Heuring, Computer Architecture and Organization: An
Integrated Approach, Wiley Publication, 1st Edition, 2007.
5. Sajjan G. Shiva, Computer Organization, Design, and Architecture, CRC Press, 5th Edition,
2013.

Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute
1 Discrete Mathematics IIT Ropar, IIT Gandhinagar
By Prof. Sudarshan Iyengar, Prof. Neeldhara

Page 18 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Digital Electronics
Course Code PCC-CS203
Category Program Core Course
Course Title Digital Electronics
Scheme and Credits L T P No. of credits Semester
3 0 2 4 III

Course Objective
1. The overarching goal of this course is to instil a comprehensive understanding of digital logic and
circuit design, laying a robust foundation for future endeavours in the field.
2. Through systematic exploration, students will grasp the fundamental principles underpinning
Boolean algebra and logic families, gaining fluency in the CAD of logic circuits.
3. By delving into various number systems, logic gates, and the intricate workings of combinational
and sequential circuits, learners will cultivate a nuanced appreciation for the diverse landscapes
of digital circuitry.
4. Armed with this knowledge, students will emerge equipped to confidently navigate the design
and analysis of complex digital circuits and systems, poised to tackle the challenges of the ever-
evolving technological frontier.
5. Develop skills in troubleshooting and debugging digital circuits to identify and rectify common
issues that arise during circuit implementation.

Course Outcomes
At the end of Course Students will be able.
1. CO1: Explain the number systems, basic logic gates, Boolean algebra, and logic realizations using
switching functions using gates.
2. CO2: Understand the CAD of logic circuits through VHDL and FPGAs, CPLDs.
3. CO3: Understand the design and analyse combinational and sequential logic circuits.
4. CO4: Understand the basic software tools for the design and implementation of digital circuits
and systems.
5. CO5: Reinforce learned principles and techniques taught in the classroom through theory
assignments and build projects for the society.

Page 19 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
CO-PO Mapping
CO PO PO2 PO PO PO PO PO PO PO PO1 PO1 PO1 PSO1 PSO2 PSO3
1 3 4 5 6 7 8 9 0 1 2
CO1 3 - 1 - - - - - - - - - - - -
CO2 3 - 2 - 3 - - - 1 - - - - - -
CO3 3 - 3 - - - - - 1 - - - - - -
CO4 3 - 2 - - - - - 1 - - - - - -
CO5 1 1 2 1 - 2 2 1 2 - 1 1 - - 2

(3) High, (2) Medium, (1) Low

Course Content
Unit Unit Title and Contents Hours
No.
01 Introduction and Basics of Switching Functions 07
The nature of logic, Boolean Algebra and switching functions, Number Systems, binary,
hexadecimal and other systems, Representation, and properties of switching functions
and their logic realizations using GATES and Switches, simplification of switching
functions.
02 Introduction to VHDL 07
Introduction to CAD for logic design, concepts of behavioural and structural
description, Introduction to CAD tools, VHDL language concepts and statements, CAD
of logic circuits through VHDL and FPGAs, CPLDs.
03 Digital Systems Building Blocks 10
Combinational logic elements, Decoders/Encoder, Multiplexors, De-multiplexors,
Sequential logic elements, Flip-Flops, Registers, Shift Registers and Counters. Examples
of applications.
04 Optimal System Design 10
Min terms and maxterms, canonical forms, cubes, and sub cubes, implicants and prime
implicants, Minimization using K-map, Quine-McCluskey algorithm for finding prime
implicants, selection of Prime implicants for a minimal expression using PI charts.
Hazards in combinational circuits.
05 Finite State machines (FSMs) 06
Synchronous, asynchronous and pulse mode models, mealy and Moore machines,
State diagrams, state tables, state assignment and synthesis using D, JK and T flip flops.
State minimization for completely and incompletely specified machines. Primitive flow
table, state minimization and reduced flow table, state assignment and Races in
asynchronous circuits, Race free state assignments.
06 Error detection and correction 05
Errors in fixed length messages and their detection using parity checks, Correction
through hamming codes, Errors in variable length messages and polynomial codes
(cyclic codes) error detection properties of polynomials and burst error detection,
Implementation using linear machines.
List of Experiments

Page 20 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
Sr. Experiment Name
1. Realization of Gates using Discrete Components
2. Realization of Gates using Universal Building Block (NAND only)
3. Realization of Gates using Universal Building Block (NOR only)
4. Design of Combinational Logic Circuits like Half-Adder, Full-Adder, Half-
Subtractor and Full-Subtractor
5. Verification of 4-Bit Magnitude Comparator.
6. Construction of a NOR gate latch and verification of its operation
7. Applications of IC Parallel Adder (1’s and 2’s compliment addition)
8. Design of 7- segment Display
9. Design of Multiplexers/De Multiplexers
10. Design of Shift register (To verify Serial to Parallel, Parallel to Serial, Serial to Serial and Parallel
to Parallel Converters) using Flip-Flops
11. Design of Shift register (To verify Serial to Serial and Parallel to Parallel Converters) using Flip-
Flops
12. Design of Ring Counter using Flip-Flops
13. Conversion of Flip-Flops (JK-T, JK-D)
Note: The list provided above is merely illustrative. The course coordinator reserves the right to modify
the list as necessary.

Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute
01 Digital Circuits (Lecture 1 to 47) Prof. Santtanu Chattopadhya Indian Institute of
Technology, Khargpur

Experiments That May Be Performed Through Virtual Labs

Sr. Experiment Name Experiment Link (s)
1 Analysis of Functions of BCD-TO-7-segment Decoder https://dec-iitkgp.vlabs.ac.in/exp/7-
/ Driver and Operation of 7-segment LED Display. segment-led-display/
2 Characterization of Digital Logic Families. https://dec-
iitkgp.vlabs.ac.in/exp/digital-logic-
families/
3. Analysis and Synthesis of Boolean Expressions using https://dec-iitkgp.vlabs.ac.in/exp/basic-
Basic Logic Gates. logic-gates/
4 Analysis and Synthesis of Logic Functions using https://dec-
Multiplexers. iitkgp.vlabs.ac.in/exp/functions-using-
multiplexers/
5 Analysis and Synthesis of Logic Functions using https://dec-
Decoders iitkgp.vlabs.ac.in/exp/functions-using-
decoders/

Page 21 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Project Management
Course Code HSSM-201
Category Humanities, Social Science, and Management
Course Title Project Management
Scheme and Credits L T P No. of credits Semester
2 0 0 2 III

Course Objectives
1. To discuss the project life cycle and build a successful project from pre-implementation to
completion.
2. To introduce different project management tools and techniques.
3. To develop potential of learners to carry out project management successfully.

Course Outcomes
At the end of Course Students will be able to
1. CO1: Appraise the selection and initiation of individual projects and its portfolios in an
enterprise.
2. CO2: Analyse the project planning activities that will predict project costs, time schedule,
and quality.
3. CO3: Develop processes for successful resource allocation, communication, and risk
management.
4. CO4: Evaluate effective project execution and control techniques that results in successful
project completion.

CO-PO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 3 2 2 1 2 3 1 2 3 2
CO2 2 3 3 2 2 3 3 2 2 3 3
CO3 1 2 3 2 2 2 3 2 1 2 3
CO4 1 1 2 1 2 3 1 1 1 2
(3) High, (2) Medium, (1) Low

Course Contents
Unit No. Unit Title and Contents Hours
1 Overview of Project Management: 06
Types of projects, Project Features, Project Life Cycle – S-Curve, J-C
Project Selection: Project Identification and Screening – New ideas, Vision,
Long-term objectives, SWOT Analysis (Strength, Weakness, Opportunities,
Threats).
2 Project Appraisal – Market Appraisal, Technical Appraisal, Economic Appraisal, 09
Ecological Appraisal, and Financial Appraisal – Payback, Net Present Value

Page 22 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 (NPV), Internal Rate of Returns (IRR).
Project Selection – Decision Matrix, Technique for Order Preference using
Similarity to Ideal Solution (TOPSIS), Simple Additive Weighting (SAW).
3 Project Presentation and Scheduling 09
Project Presentation: WBS, Project Network – Activity on Arrow (A-O-A),
Activity on Node (A-O-N).
Project Scheduling: Gant Chart, Critical Path Method (CPM), Project Evaluation
& Review Technique (PERT).
Linear time cost trade-offs in project – Direct cost, indirect cost, Project
crashing Resource Consideration – Profiling, Allocation, Levelling.
Introduction to project management software: Primavera/ Microsoft project
4 Project Execution: Monitoring control cycle, Earned Value Analysis (EVA), 06
Project Control – Physical control, Human control, financial control.
Organizational and Behavioural Issues: Organizational Structure, Selection-
Project Manager, Leadership Motivation, Communication, Risk Management.
Project Termination: Extinction, Addition, Integration, Starvation.
Textbooks/References:
Textbook(s)
1. ‘Project Management- A Managerial Approach’ Eighth Edition – Jack R. Meredith and
Samuel J. Mantel, Jr. – John Wiley & Sons Inc – 2012.
2. ‘Projects’ Chandra, P-, Tata McGraw-Hill Education, 2009, ISBN: 0070077932 .
3. ‘A Management Guide to PERT/CPM’ Levy, F. K. and Wiest, J. D., -Prentice Hall, 1969.
4. ‘Project Management-A Life Cycle Approach’ Arun Kanda – PHI Learning Private Limited –
2011.
Reference(s)
1. ‘A Guide to Project Management Body of Knowledge’ PMBOK GUIDE, Sixth edition, Project
management Institute – 2017.
2. ‘Project Management, Tools, and Trade-Offs’ – Ted Klastrorin – John Wiley – 2011.

Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute

1 Project Management Prof. A. Ramesh Department of Management

Studies, Indian Institute of
Technology, Roorkee
2 Project Management Prof. Raghu Nandan Sengupta Department of Management
Studies, Indian Institute of
Technology, Kanpur
3 Project Management Prof. Mukesh Kumar Barua Department of Management
for Managers Studies, Indian Institute of
Technology, Roorkee

Page 23 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Human Values and Professional Ethics
Course Code VEC-201
Category Value Education Course
Course Title Human Values and Professional Ethics
Scheme and Credits L T P No. of credits Semester
2 0 0 2 III

Course Objectives
1. To understand the fundamental concepts of human values, including intrinsic and extrinsic
values, and their relevance to personal and professional development.
2. To explore and internalize the principles of the UHVE philosophy, promoting self-
awareness and self-exploration through tools like the JOHARI window and SWOT analysis.
3. To study the different levels of harmony—within oneself, in the family, society, and
nature—and apply these concepts to achieve a balanced and fulfilling life.
4. To comprehend the key aspects of professional and engineering ethics, including ethical
standards, work ethics, and moral issues in the engineering profession, and apply these
principles to solve ethical dilemmas in real-world scenarios.
5. To develop and uphold foundational values such as integrity, impartiality, non-
partisanship, and objectivity, and cultivate empathy, tolerance, and compassion in both
personal and professional contexts.
Course Outcomes
At the end of the Course, Students will be able.
CO1: Understand the basic concepts of human values and their significance in personal and
professional contexts.
CO2: Explore and internalize human values to guide personal behaviour and professional
conduct.
CO3: Demonstrate an understanding of harmony at various levels of existence and its
application in achieving a balanced life.
CO4: Identify and address ethical issues in the engineering profession using appropriate ethical
theories and standards.
CO5: Uphold integrity and ethical principles in professional and public service contexts,
fostering empathy and compassion.
CO-PO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 1 1 1 3 2 3 2 2 1 2
CO2 1 1 1 1 1 3 3 3 2 2 2 3
CO3 1 1 1 1 1 2 3 2 2 2 1 2
CO4 1 2 2 1 1 2 2 3 2 2 2 2
CO5 1 1 1 1 1 3 3 3 3 3 2 2
(3) High, (2) Medium, (1) Low

Page 24 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
Course Content
Unit No. Unit Title and Contents Hours
1 Introduction to Human Values – 7
Definition, Intrinsic & Extrinsic values, Shalom Schwartz’s Theory of Basic
Human Values, Value education: Need, Basic Guidelines and Scope, Self-
exploration, Happiness and Prosperity, Harmony, Self-awareness: JOHARI
window and SWOT analysis.
2 Understanding human beings and Harmony at Various levels of 8
existence –
Human beings as a combination of the conscious ‘I’ and material body,
Abraham Maslow’s Hierarchy of Needs, Classification between I & Body,
Co-existence, Harmony in Self: Swasthya and Sanyama, Harmony in the
Family – Understanding Values in Human Relationships, Differentiation in
relationships, Values in relationships, Harmony in the Society – From
Family order to World Family Order, Comprehensive Human Goal,
Harmony in Nature – Understanding the Interconnectedness and Mutual
Fulfilment, Understanding the Four Orders of Nature.
3 Professional ethics – 7
Definition, Characteristics, Profession, Professionalism, Morality, Moral
issues in the profession, Understanding Ethics, Ethical Standards, Work
Ethics, Engineering Ethics, Types of Inquiries, Kohlberg’s Theory, Heinz
Dilemma, Gilligan’s Theory, and Ethical Theories. Emphasizing the
practical implications of ethical theories and standards in engineering
practice.
4 Ethics, Integrity and Aptitude – 8
Essence, determinants, and consequences of ethics in human actions,
Dimensions of ethics, Ethics in private and public relationships, Key
contributions from Indian and global moral thinkers and philosophers,
emphasizing integrity, impartiality, and non-partisanship in professional
settings, Upholding objectivity and dedication to public service,
Cultivating empathy, tolerance, and compassion, with a focus on their
application in engineering and public welfare.
Textbooks/References
1. Naagarazan, R. S. A Textbook on Professional Ethics and Human Values. 4th Edition.
New Age International Publishers, 2021.
2. Gaur, R.R., Sangal, R., & Bagaria, G.P. A Foundation Course in Human Values and
Professional Ethics. 3rd Edition. Excel Books, 2019.
3. Khosla, Vaishali R., & Bhagat, Kavita. Human Values and Professional Ethics. 2nd
Edition. Macmillan Education, 2020.
4. Harris, C.E., Pritchard, M.S., & Rabins, M.J. Engineering Ethics: Concepts and Cases. 6th
Edition. CENGAGE Learning, 2019.
5. Murthy, PSR. Indian Culture, Values and Professional Ethics. 4th Edition. BS
Publications, 2022.
Page 25 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 6. Bhatia, R., & Bhatia, A. "Role of Ethical Values in Indian Higher Education." Journal of
Values Based Leadership, Vol. 14, No. 2, 2021.
7. Subba Rao, G., & Roy Chowdhury, P. N. Ethics, Integrity & Aptitude. 3rd Edition.
McGraw Hill Education, 2020.
8. Kumar, Niraj. Lexicon for Ethics, Integrity & Aptitude for IAS General Studies Paper IV.
2nd Edition. McGraw Hill Education, 2023.

Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute
1 Exploring Human Values: Prof. A.K. Sharma IIT Kanpur
Visions of Happiness and
Perfect Society
2 Moral Thinking: An Prof. Vineet Sahu IIT Kanpur
Introduction to Values
and Ethics

Page 26 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Field Project
Course Code FP-CS201
Category Field Project
Course Title Field Project
Scheme and Credits L T P No. of credits Semester
0 0 4 2 III

Course Objectives
1. Understanding the interconnectedness of diverse sectors such as education, agriculture,
environment, health, nutrition, energy, infrastructure, water, gender, and community
development. Applying interdisciplinary approaches to address these cross-cutting issues.
2. Integrating knowledge on cross-sectorial issues, local insights and community participation into
field training projects and activities.
3. Participation in a particular activity in the project cycle: from program conceptualization, design,
implementation to monitoring and evaluation.
4. Collaborating and building relationships with practitioners including government officials, NGOs,
communities, donors and project personnel. Working in teams, oftentimes cross-cultural and
interdisciplinary in composition.
5. Communicating effectively and facilitating meetings with stakeholders utilizing methods such as
Action Research, Participatory Rural Appraisal, collaborative planning meetings, visualization and
feedback workshops. Students will come to understand the importance and means of cultivating
respectful communication with communities and support agencies.
Course Outcomes
At the end of the Course, Students will be able.
1. CO1: Develop practice competence as an entry level professional in generalist social work practice
within the organization, the community, social work skills of assessment, planning and evaluation,
and the profession.
2. CO2: Analyse the structure and function of resource and delivery systems within the agency and
community.
3. CO3: Develop the ability to utilize professional social work supervision as a mechanism to improve
one’s own practice
4. CO4: Apply knowledge, values, and skills with diverse populations including people of colour,
women, children, aged, physically and mentally challenged, socially and culturally diverse groups,
the oppressed and populations at risk
5. CO5: Cultivate critical thinking skills by identifying, analysing, and solving complex engineering
problems encountered during the project lifecycle, employing innovative approaches and
integrating feedback for continuous improvement.

Course Content
The field practicum gives students the opportunity to take on professional roles to learn skills, render
services and participate in the provision and development of social work services. The hands-on experience
reinforces the student’s identification with the purposes, values and ethics of the profession; fosters the

Page 27 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
integration of empirical and practice-based knowledge; and promotes the development of professional
competence. Field Practicum is a field education program designed to integrate classroom study with
practice in a social work setting. Students spend time in an agency while being supervised by a field
instructor. Through practicum, students translate knowledge from all areas of the curriculum into practical
skills and competencies.
Unit No. Unit Title and Contents Hours
1 Identifying the field problem and planning 8
Introduction to field projects and their significance in engineering education,
Identification of project objectives, scope, and constraints, Stakeholder analysis and
requirement elicitation techniques, Project planning methodologies (e.g., Agile,
Waterfall), Work breakdown structure (WBS) development and task scheduling, Risk
identification, assessment, and mitigation strategies.
2 Research and Analysis based on Identified problem 8
Literature review techniques for identifying relevant research in the project domain,
Data collection methods (e.g., surveys, interviews, experiments), Data analysis
techniques (e.g., statistical analysis, qualitative analysis), Comparative analysis of
existing solutions and technologies, Feasibility studies for proposed project solutions
3 Design and Implementation of the proposed solution 8
System architecture design principles, Selection and justification of appropriate
technologies, tools, and frameworks, Prototyping techniques (e.g., wire framing, rapid
prototyping), Software engineering principles and best practices (e.g., design patterns,
code refactoring), Version control and collaborative development using tools like Git,
User interface (UI) and user experience (UX) design considerations
4 Project Management and Professionalism 6
Effective communication strategies for project stakeholders, Project monitoring and
control techniques, Conflict resolution and team dynamics management, Ethical
considerations in project development (e.g., data privacy, intellectual property rights),
Professionalism and adherence to industry standards and practices, Career
development and preparation for future engineering projects or employment
opportunities

Page 28 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Syllabus of SEMESTER-IV Courses
Microprocessors and Interfacing
Course Code PCC-CS202
Category Program Core Course
Course Title Microprocessors and Interfacing
Scheme and Credits L T P No. of credits Semester
3 0 2 4 IV

Course Objective
This course will enable students to:
1. Familiarize basic architecture of 8086-microprocessor.
2. Program 8086 Microprocessor using Assembly Level Language.
3. Use Macros and Procedures in 8086 Programs.
4. Understand interfacing of 16-bit microprocessor with memory and peripheral chips involving
system design.
5. Understand the architecture of 8088, 8087 Coprocessor.
Course Outcomes
At the end of Course Students will be able.
1. CO1: Explain the History of evolution of Microprocessors, Architecture of 8086, 8088, 8087.
2. CO2: Write 8086 Assembly level programs using the 8086-instruction set.
3. CO3: Write modular programs using procedures and macros and Write 8086 Stack and
Interrupts programming.
4. CO4: Interface 8086 to Static memory chips and 8255, 8254, 0808 ADC, 0800 DAC, Keyboard,
Display and Stepper motors.
5. CO5: Use INT 21 DOS interrupt function calls to handle Keyboard and Display.

CO-PO Mapping
CO PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 2 1 2 3
CO1 3 - 1 - - - - - - - - - - - -
CO2 3 - 2 - 3 - - - 1 - - - - - -
CO3 3 - 3 - - - - - 1 - - - - - -
CO4 3 - 2 - - - - - 1 - - - - - -
CO5 1 1 2 1 - 2 2 1 2 - 1 1 - - 2
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 8086 Processor 10
Historical background, 8086 CPU Architecture, Pin configuration. Addressing

Page 29 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 modes, Machine language instruction formats, Machine coding the program.
INSTRUCTION SET 8086.
Data transfer and arithmetic instructions. Control/Branch Instructions,
Illustration of these instructions with programs.
2 Logical Instructions, String manipulation instructions, Flag manipulation and 06
Processor control instructions, Illustration of these instructions with example
programs. Assembler Directives and Operators, Assembly Language
Programming examples.
3 Stack and Interrupts 07
Introduction to stack, Stack structure of 8086, Programming for Stack.
Interrupts and Interrupt Service routines, Interrupt cycle of 8086, NMI, INTR,
Interrupt programming, Passing parameters to procedures, Macros, Timing and
Delays.
4 8086 Bus Configuration and Timings 06
Physical memory Organization, General Bus operation cycle, I/O addressing
capability, Special processor activities, Minimum mode 8086 system and Timing
diagrams, Maximum Mode 8086 system and Timing diagrams.
5 Interfacing with 8086 (Part 1) 06
Static RAM Interfacing with 8086, Interfacing I/O ports, PIO 8255, Modes of
operation – Mode-0 and BSR Mode, Interfacing Keyboard and 7-Segment digits
using 8255.
6 Interfacing with 8086 (Part 2) 10
Interfacing ADC-0808/0809, DAC-0800, Stepper Motor using 8255, Timer 8254
– Mode 0, 1, 2 & 3 and Interfacing programs for these modes,
INT 21H DOS Function calls
for handling Keyboard and Display, Architecture of 8088 and Architecture of
NDP 8087.
List of Experiments
Sr No. Experiment Name
1 To study the 8086 microprocessor and installation of anaconda.
2 Addition of two 8 bit numbers with and without carry.
3 Addition of two 16 bit numbers with and without carry.
4 Subtraction of two 8 bit numbers with and without borrow.
5 Subtraction of two 16 bit numbers with and without borrow.
6 Multiplication of two 8 bit numbers.
7 Multiplication of two 16 bit numbers.
8 Division of two 8 bit numbers.
9 Division of two 16 bit numbers.
10 To perform a program for the smallest number.
11 To perform a program for the largest number.
Page 30 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
12 To perform addition of two 8 bit arrays.
13 To perform subtraction of two 8 bit arrays.
14 To sort the array in ascending order.
15 To sort the array in descending order.
16 To search an element from an array.
Textbooks/References
1. Advanced Microprocessors and Peripherals - A.K. Ray and K.M. Bhurchandi, TMH, 3rd Edition,
2012, ISBN 978-1-25-900613-5.
2. Microcomputer systems-The 8086 / 8088 Family – Y.C. Liu and A. Gibson, 2nd edition, PHI -
2003.
3. The Intel Microprocessor, Architecture, Programming, and Interfacing - Barry B. Brey, 8e,
Pearson Education / PHI, 2009.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Microprocessors and Prof. Shaik Rafi Ahamed IIT Guwahati
Interfacing

Page 31 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Computer Organization and Architecture
Course Code PCC-CS204
Category Program Core Course
Course Title Computer Organization and Architecture
Scheme and Credits L T P No. of credits Semester
3 0 0 3 IV

Course Objectives
1. To impart basic concepts of computer architecture and organization,
2. To explain key skills of constructing cost-effective computer systems.
3. To familiarize the basic CPU organization and to help students in understanding various
memory devices.
4. To facilitate students in learning IO communication
5. To introduce the field of modern computer architecture design stressing speedup and
parallel processing techniques.

Course Outcomes
1. CO1: Identify various components of a computer and their interconnection.
2. CO2: Compare and select various Memory devices as per requirement.
3. CO3: Identify basic components and design of the CPU, the ALU and control unit.
4. CO4: To be able to design and analyse pipelined control units.
5. CO5: To be able to understand and design parallel processing architectures.

CO-PO Mapping
CO PO PO2 PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO3
1 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 2 2 2 1 2 1 1 1 3 2
CO2 3 1 3 2 2 3 1 1 1 1 3 1
CO3 3 3 3 2 2 2 3 2 2 3 1
CO4 1 2 2 2 2 2 3 2 2 3 1
CO5 3 1 3 2 2 2 1 1 3
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
01 Introduction 03
Concept of computer organization and architecture,
Fundamental unit, Computer function and interconnection, CPU
architecture and functions.
02 8086 CPU Building Blocks and Programming 15
CPU Registers and BUS Characteristics, Registers and System Bus
Characteristics, Pin Configuration, Instruction Format; Addressing
Page 32 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Modes; Interrupts: Concepts and types; Instruction and Execution
Interrupt cycle; Hardwired and Micro Program control; Introduction to
RISC and CISC, Assembly Language Programming with 8086.
03 Memory Unit and Interfacing with 8086 05
Memory Hierarchy; Primary memory, Secondary Memory: Magnetic
Tape, Magnetic Disk, Optical disk, Magneto-Optical Disk; Concepts of
auxiliary, Associative, Cache and Virtual, Memory, DMA, DMA Transfer
modes, sequential access, direct access storage devices, memory
interfacing with 8086.
04 Control Unit 04
Control unit operation: Micro-operations, Control of the processor,
Hardwired implementation, Micro-programmed Control Unit, Basic
concepts, Micro-instruction sequencing, Microinstruction execution,
Applications of micro-programming.
Input/ Output Organization, External devices, I/O module, Programmed
I/O, Interrupt driven I/ O.
05 I/O interfacing with 8086 14
Interfacing chips - 8255A - Programmable Peripheral Interface, 8254 -
Programmable Interval Timer Counter, 8237 - Programmable DMA
Controller, 8259A - Programmable Interrupt Controller and interfacing
with 8086
06 Instruction pipelining 04
Multi-Processor Organization
Parallel Processing, Concept and Block Diagram, Types (SISD,
SIMD, Interconnect network, MIMD, MISD), Future Directions for
Parallel Processors, Performance of Processors
Textbooks/References
1. Hennessy and Patterson, Computer Architecture: A Quantitative Approach, Morgan
and Kaufman Publication, 5th Edition, 2014.
2. William Stalling, Computer Organization and Architecture: Designing for Performance,
Prentice Hall Publication, 8th Edition, 2009.
3. Hayes, Computer Architecture and Organization, McGraw-Hill Publication, 3rd Edition,
2012.
4. Zaky, Computer Organization, McGraw-Hill Publication, 6th Edition, 2012.
5. Sajjan G. Shiva, Computer Organization, Design, and Architecture, CRC Press, 5th
Edition, 2013.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Computer Architecture Prof. Smruti Ranjan Sarangi IIT, Delhi
2 Advanced Computer Prof. Smruti Ranjan Sarangi IIT, Delhi
Architecture

Page 33 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Data Structures
Course Code PCC-CS206
Category Program Core Course
Course Title Data Structures
Scheme and Credits L T P No. of credits Semester
3 0 2 4 IV

Course Objectives
1. Understand and remember algorithms and their analysis procedures.
2. Introduce the concept of data structures through ADT including List, Stack, Queues.
3. To design and implement various data structure algorithms and study and analyse the
complexity of various algorithms.
4. To introduce various techniques for representation of the data in the real world.
5. To develop applications using data structure algorithms.

Course Outcomes
At the end of Course Students will be able.
1. CO1: Understand the concept of Dynamic memory management, data types, algorithms
and its analysis.
2. CO2: Understand basic data structures and system specific use.
3. CO3: Understand non-linear data structures and their design and use.
4. CO4: Apply Algorithm and data structures for solving problems.
5. CO5: Design and implementation of new data structures.

CO-PO Mapping
CO PO PO2 PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 2 2 2 1 2 3 1
CO2 3 2 2 2 1 2 3 1
CO3 3 2 2 2 1 2 3 1
CO4 3 2 2 2 1 2 3 1
CO5 3 2 2 2 1 2 3 1
(3) High, (2) Medium, (1) Low
Course Content
Unit No. Unit Title and Contents Hours
1 Introduction 7
Basic Terminologies: Elementary Data Organizations, Data Structure
Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm,
Asymptotic Notations, Time-Space trade off.
Searching: Linear Search and Binary Search Techniques and their
complexity analysis.
2 Stacks and Queues 8

Page 34 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 ADT Stack and its operations: Algorithms and their complexity analysis,
Applications of Stacks: Expression Conversion and evaluation –
corresponding algorithms and complexity analysis. ADT queue, Types of
Queues: Simple Queue, Circular Queue, Priority Queue; Operations on each
type of Queues: Algorithms and their analysis.
3 Singly linked lists 8
Representation in memory, Algorithms of several operations: Traversing,
Searching, Insertion into, Deletion from linked list; Linked representation
of Stack and 11 Queue, Header nodes, doubly linked list: operations on it
and algorithmic analysis; Circular Linked Lists: all operations their
algorithms and the complexity analysis.
4 Trees 6
Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded
Binary Tree, Binary Search Tree, Applications of Binary Trees. Tree variants:
AVL Tree, B Tree, B+ Tree
5 Graph 8
Basic Terminologies and Representations, Graph search and traversal
algorithms and complexity analysis.
6 Sorting and Hashing 8
Objective and properties of different sorting algorithms: Selection Sort,
Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance
and Comparison among all
the methods, Hashing.
Textbooks:
1. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni,
Computer Science Press, 29 Aug 2011.
Reference Books:
1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark Allen
Weiss, Addison-Wesley Publishing Company
2. “How to Solve it by Computer”, 2nd Impression by R. G. Dromey, Pearson Education.
List of Experiments
Sr. Experiment Name
1 Array, Pointers and Structures/Classes Implementation
2 Stack implementation
3 Queue implementation
4 Single linked list using array
5 Single linked list using dynamic memory allocation
6 Doubly linked list
7 Priority Queue
8 Tree implementation
9 Searching algorithms and comparison
10 Sorting algorithms and comparison (bubble, insertion, merge)
11 Sorting algorithms and comparison II (Selection, insertion, quick, etc)
Page 35 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
12 Graph algorithms
13 Design and implement your own data structure I
14 Design and implement your own data structure II
Note: The list provided above is merely illustrative. The course coordinator reserves the right to
modify the list as necessary.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Data Structures and Algorithms Prof. Naveen https://archive.nptel.ac.in/cour
Garg ses/106/102/106102064/#
Experiments That May Be Performed Through Virtual Labs
Sr. Experiment Name Experiment Link (s)
1. Bubble Sort https://ds1-iiith.vlabs.ac.in/exp/bubble-
sort/index.html
2. Merge Sort https://ds1-iiith.vlabs.ac.in/exp/merge-
sort/index.html
3. Heap Sort https://ds1-iiith.vlabs.ac.in/exp/heap-
sort/index.html
4. Quick Sort https://ds1-iiith.vlabs.ac.in/exp/quick-
sort/index.html
5. Depth First Search https://ds1-iiith.vlabs.ac.in/exp/depth-first-
search/index.html
6. Breadth First Search https://ds1-iiith.vlabs.ac.in/exp/breadth-first-
search/index.html
7. Tree Traversal https://ds1-iiith.vlabs.ac.in/exp/tree-
traversal/index.html
8. Binary Search Trees https://ds1-iiith.vlabs.ac.in/exp/binary-search-
trees/index.html
9. Stacks and Queues https://ds1-iiith.vlabs.ac.in/exp/stacks-
queues/index.html
10. Infix to Postfix https://ds1-iiith.vlabs.ac.in/exp/infix-
postfix/index.html
11. Unsorted Arrays https://ds1-iiith.vlabs.ac.in/exp/unsorted-
arrays/index.html
12. Hash tables https://ds1-iiith.vlabs.ac.in/exp/hash-
tables/index.html
13. Linked lists https://ds1-iiith.vlabs.ac.in/exp/linked-
list/index.html

Page 36 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Object Oriented Programming with Java
Course Code VSEC-CS202
Category Vocational Skill and Skill Enhancement Courses
Course Title Object Oriented Programming with Java
0 0 4 2 IV
Course Objectives
1. Master OOP concepts and Java programming proficiency.
2. Apply OOP principles for problem-solving and effective exception handling and I/O
operations in Java.
3. Master concurrency and multithreading concepts for efficient Java applications and
develop competent application development skills.
4. Enhance problem-solving abilities and foster collaborative skills through Java
programming challenges and group projects.
5. Acquire knowledge of the software development lifecycle and prepare for advanced
Java programming courses.
Course Outcomes
At the end of the Course, Students will be able.
1. CO1: Be able to understand the basics of OOP and Object-oriented approach to design
software to solve real world problems based on object-oriented principles.
2. CO2: Students can think in terms of classes, Objects, Interfaces when developing
software.
3. CO3: Apply object-oriented programming principles effectively in software
development, identifying and leveraging the benefits of object-oriented programming
over other programming approaches.
4. CO4: Acquire skills in testing, documenting, and preparing professional-quality software,
ensuring.
5. CO5: The delivery of robust and well-documented solutions.
CO-PO Mapping
CO P P P P P P P PO P PO P PO PS PS P
O O O O O O O 8 O 10 O 12 O O S
1 2 3 4 5 6 7 9 1 1 2 O
1 3
CO1 2 3 3 3 3 1 3 2 2 1 3 3
CO2 1 3 3 3 3 2 1 3 1 3 3
CO3 1 2 2 2 3 2 1 3 1 3 3
CO4 1 2 3 3 3 1 2 1 2 1 3 3

CO5 1 3 1 2 1

Page 37 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 This subject should cover following expected topics in java along with experiment list.

1 Fundamentals of Object-Oriented Programming.

2 Java Basics and Environment.
3 Java Classes, Objects, and Methods.
4 Exception Handling and Input/Output Operations.
5 Multithreading and Concurrency.
6 Java Application Development.
Textbooks/References
1. E. Balagurusamy, Programming with Java A Primer, TMH, 1998.
2. Herbert schildt, The Complete Reference JAVA2, 2nd ed., TMH, 2002.
3. Horstmann, Cornell, Core Java 2: Volume 1-Fundanmentals, Pearson Education, 2000.
4. Kathy Sierra & Bert Bates Head First Java, 2nd edition O’RELLY 2015.
List of Experiments
Sr. Experiment Name
1. Create a simple Java program to demonstrate the concept of objects and classes.
2. Implement a program illustrating the principles of data abstraction and
encapsulation using Java classes.
3. Write Java programs to demonstrate the use of constants, variables, and different
data types.
4. Implement Java programs showcasing various operators, expressions, and control
structures.
5. Design Java classes representing real-world entities and demonstrate their
instantiation and usage.
6. Implement abstract classes and interfaces in Java, showcasing their role in object-
oriented design.
7. Create programs illustrating the usage of static methods, inner classes, and
packages in Java.
8. Write Java programs to handle exceptions using try-catch-finally blocks.
9. Develop programs to perform input/output operations, including reading from and
writing to files.
10. Implement object serialization and deserialization in Java to store and retrieve
object data.
11. Design and implement a multithreaded Java application that performs parallel
processing tasks, such as image processing or data processing
12. Implement multithreading in Java to perform concurrent tasks, such as

Page 38 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Calculating Fibonacci series or sorting algorithms
13. Design programs to illustrate thread synchronization and coordination using
synchronization mechanisms.
14. Develop a Java application that utilizes object-oriented design principles, including
inheritance, polymorphism, and encapsulation.
15. Design and implement a multithreaded Java application that performs parallel
processing tasks, such as image processing or data processing.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1. Programming In Java By Prof. Debasis IIT Kharagpur
Samanta
Experiments That May Be Performed Through Virtual Labs

Sr. Experiment Name Experiment Link (s)

1. Introduction to Java programming https://java-
language iitd.vlabs.ac.in/exp/introduction-java/
2. Creating Classes and their Objects https://java- iitd.vlabs.ac.in/exp/classes-objects/
in Java
3. Using constructors to create objects https://java-
iitd.vlabs.ac.in/exp/constructors/
4. To understand the inheritance in https://java-
Java iitd.vlabs.ac.in/exp/inheritance/
5. Implementing Method Overloading https://java- iitd.vlabs.ac.in/exp/method-
overloading/
6. Implementing Method Overriding https://java-
iitd.vlabs.ac.in/exp/method-
overriding/
7. Learning of abstraction through https://java-
Interface iitd.vlabs.ac.in/exp/abstraction/
8. Learning of Encapsulation through https://java- iitd.vlabs.ac.in/exp/encapsulation/
Package
9. Handling Exceptions in Java https://java-
iitd.vlabs.ac.in/exp/exceptions/
10 Understanding Life cycle of a https://java-iitd.vlabs.ac.in/exp/life-
Thread cycle-thread/
Page 39 of 69
Copyright © 2024 CSE DEPT., SGGS IE & T, NANDED.
 Indian Economy
Course Code HSSM-202
Category Humanities, Social Science, and Management
Course Title Economics
Scheme and Credits L T P No. of credits Semester
2 0 0 2 IV

Course Objectives
1. To Understand the concept of Economic Growth and Development.
2. To discuss the causes and eradication of poverty in Indian Economy.
3. To develop insights into the understanding of financial inclusion and demographics in
India.
4. To describe the changes and progress of fiscal policy in India.

Course Outcomes
At the end of Course Students will be able to
1. CO1: Comprehend the various terms of economics and economic growth in India.
2. CO2: Understand the causes and eradication of poverty in Indian Economy.
3. CO3: Aware about financial inclusion and demographics in India.
4. CO4: Acquire the knowledge on changes and progress of fiscal policy in India.

CO-PO Mapping
CO PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO3
1 2 3 4 5 6 7 8 9 10 11 2 1 2
CO 3 1 2 2 1 2 3 1 2 3 2
1
CO 2 3 1 2 2 3 3 2 2 3 3
2
CO 1 2 1 2 2 2 3 2 1 2 3
3
CO 1 1 2 1 2 3 1 1 1 2
4

Course Content
Unit No. Unit Title and Contents Hours
1 Economic growth and development –concept and definition of Economy 9
and economics, uses and transfer of resources, distributive effects, macro
and microeconomic policy, micro-macro balance, distributive impact of
economic policies, development versus growth, determinant of growth
and development, concepts such as HPI/MPI, HDI, PQLI, GEM, GDI/GII,
TAI, Green index, sustainable development, India’s ranking in the various
indices.
2 Poverty – definitions, causes, distribution-deprivation, income versus 6
calories, measurement of poverty, the status of poverty, eradication
programmes, poverty and resource policy, tribal rights and issues,

Page 40 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

livelihood mission.
3 Inclusion And Demographics – Inclusion- definition, relevance, types, 9
financial inclusion, recent initiatives.
Demographics –census data, populations by gender, by state, by age
group, socio-economic status, caste, religion, literacy levels, etc. Trends
in human development – interstate comparison, etc.
4 Fiscal policy – definition, component, receipts, revenue and capital 6
account, tax revenue, expenditure, budget.
Textbooks/References:
1. Agrawal A.N. (2023), Indian Economy, 44 th Edition, New Age International Publishers, Delhi.
2. Dutt & Sundharam, (2021), Indian Economy- 73rd Edition, S Chand & cop. PVT. Ltd. New,
Delhi.
3. V.K.Puri&S.K.Mishra , (2019), Indian Economy -37nd Edition ,Himalaya Publishing House,
Mumbai.
4. C.S.Prasad ,VibhaMathur&AnupChatterjee- (2007 ),Sixty Years of the Indian Economy1947-
Part- I, 2007-New Century Publication ,New Delhi.
5. Uma Kapila, (2006-07), Indian Economy since Independence- Academic Foundation, New
Delhi.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Indian Economy: Some Prof. Wasim Ahmad IIT Kanpur
Contemporary Issues

Page 41 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Environmental studies
Course Code VEC-202
Category Value Educational Course
Course Title Environmental studies
Scheme and Credits L T P No. of credits Semester
2 0 0 2 IV

Course Objectives
1. Creating awareness about environmental problems among future citizens.
2. Imparting basic knowledge about the environment and its allied problems.
3. Developing an attitude of concern for the Environment.
4. Motivating public to participate in environment protection and environment
improvement.
5. Acquiring skills to help the concerned individual in identifying and solving environmental
problems.
Course Outcomes
At the end of the course students will be able.
1. CO1: Identify environmental problems arising due to engineering and technological
activities and the science behind those problems.
2. CO2: Estimate the population - economic growth, energy requirement and demand.
3. CO3: Analyse material balance for different environmental systems.
4. CO4: Realize the importance of ecosystem and biodiversity for maintaining ecological
balance.
5. CO5: Identify the major pollutants and abatement devices for environmental
management and sustainable development.

CO-PO Mapping
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 1 1 1 -- -- 3 3 2 2 -- 1 2 -- 1 1 --
CO2 -- 1 -- 1 -- 2 2 -- 1 1 1 1 -- -- 1 --
CO3 -- 1 1 -- -- 1 1 -- -- 1 1 -- -- 2 1 --
CO4 -- 2 1 -- -- 1 2 -- -- 1 1 -- -- 1 2 --
CO5 -- -- 1 1 -- 2 1 -- 2 1 1 -- -- 1 2 --
1: Slightly 2: Moderately 3: Substantially

Course Content
Unit No. Unit Title and Contents
1 Introduction to environmental studies 2
Multidisciplinary nature of environmental studies; Scope and importance;
the need for environmental education. Concept of sustainability and
sustainable development.
2 Ecosystems 2
What is an ecosystem? Structure: food chains, food webs and function of
ecosystem: Energy flow in an ecosystem, nutrient cycle and ecological
succession. Ecological Interactions.

Page 42 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Case studies of the following ecosystems:

a) Forest ecosystem b) Grassland ecosystem c) Desert ecosystem d) Aquatic
ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) Ecological
succession.
3 Biodiversity and Conservation 3
a. Levels of biological diversity: genetic, species and ecosystem diversity;
Biogeographic zones of India; Biodiversity patterns and global
biodiversity hot spots
b. India as a mega-biodiversity nation; Endangered and endemic species
of India
c. Threats to biodiversity: Habitat loss, poaching of wildlife, man-wildlife
conflicts, biological invasions; Conservation of biodiversity: In-situ and
Ex-situ conservation of biodiversity.
d. Nature reserves, tribal populations and rights (Niyamgiri-Vedanta,
POSCO), and human wildlife conflicts in Indian context (Sundarban-
Human-Tiger encounters).
Ecosystem and biodiversity services: Ecological, economic, social, ethical,
aesthetic and Informational value.
4 Environmental Pollution and Global Environmental Issues 2
a. Environmental pollution: types, causes, effects and controls; Air,
water, soil and noise pollution.
b. Climate change, global warming, ozone layer depletion, acid rain and
impacts on human communities and agriculture
c. Nuclear hazards and human health risks (Chernobyl, 3-mile Island,
Daiichi- Fukushima)
d. Solid waste management: Control measures of urban and industrial
waste, special reference to e-waste, Biomedical waste.
Pollution Tragedies: Love canal, Bhopal Gas, Endosulfan, Minamata and Flint
water
5 Natural Resources: Renewable and Non-renewable Resources 2
a. Land resources and land use change; Land degradation, soil erosion
and desertification.
b. Deforestation: Causes and impacts due to mining, dam building on
environment, forests, biodiversity and tribal populations.
c. Disaster management: floods, earthquake, cyclones and landslides.
Resettlement and rehabilitation of project affected persons, case
studies.
d. Water: Use and over-exploitation of surface and ground water, floods,
droughts, conflicts over water (international & inter-state).
Energy resources: Renewable and non-renewable energy sources, use of
alternate energy sources, growing energy needs, case studies.
6 Environmental Management: Laws, Policies & Practices 2
UN Initiatives and International agreements: Montreal and Kyoto protocols,
Paris Climate Summit (2015) and Convention on Biological Diversity (CBD).
Environmental ethics: Role of Indian and other religions and cultures in
environmental conservation. Green Politics, Earth Hour, Green Option
Technologies, ISO standards: ISO 9000 and 14000. Environmental

Page 43 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

communication and public awareness, Role of National Green Tribunal; EIA

Formulations, stages, Merits and demerits: case studies (e.g., CNG vehicles,
Bharat IV stage)
Environment Laws: Environment Protection Act (1986); Air (Prevention &
Control of Pollution) Act (1981); Forest Conservation Act (1980); Water
(Prevention and control of Pollution) Act (1974); Wildlife Protection Act
(1972).
7 Human Population and the Environment 2
Human population growth: Impacts on environment, human health and
welfare. Family Welfare Programs, Human Rights. Environmental
movements: Chipko, Silent valley, Bishnoi, Narmada Bachao Andolan, Nava
Danya.
Role of Information Technology (IT) in environment and Human Health
Textbooks:
1. Basu, M. and Xavier, S., Fundamentals of Environmental Studies, Cambridge University
Press, 2016.
2. Mitra, A. K and Chakraborty, R., Introduction to Environmental Studies, Book Syndicate,
2016.
3. Enger, E. and Smith, B., Environmental Science: A Study of Interrelationships, Publisher:
McGraw-Hill Higher Education; 12th edition, 2010.
4. Basu, R.N, Environment, University of Calcutta, 2000.
Reference Books:
1. Anindita Basak, Environmental Studies, Pearson Education (2009).
2. R. Rajagopalan, Environmental Studies from Crises to Cure, 3rd Edition, Oxford University
Press (2016).
3. Dr. R. J. Ranjit Daniels, Dr. Jagdish Krishnaswamy, Environmental Studies, Wiley India,
(2009).
4. John, Environmental Science, Tata McGraw Hill publications, New Delhi.
5. S. K. Dhameja, S.K. Kataria and sons, Environmental engineering and Management, 2nd
Edition, New Delhi (2004).
List of activities
Students must perform and complete 10-15 activities mentioned below.
Sr. Name of Activity
1 Each student should plant a tree as symbol for induction/ getting admitted into
institute and throughout the semester the student should water the plant and the
growth of the plant is monitored at the end of the semester. This activity is to
promote environmental attitude and develop bonding with nature with the help of
planted tree.
2 Any of the following activity can be chosen by a student.
a. To calculate individual (per capita) use of water for a day and find ways to
reduce that use
b. To check leakages of water taps in the institute campus, calculate the
water wastages and making efforts for repairs of leaked taps.
c. To visit at least 5 household for checking their water taps and pursue
them for repairs of leaked taps, making them aware of water scarcity and
conservation.
d. To make presentations for awareness regarding water resources among

Page 44 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

students, Villagers and local people (at least 10 households).

3 Any of the following activity can be performed.
a. Promotion of recycle-reuse-reduce through various activities (large scale).
b. Visiting dumping ground or waste disposal site.
c. Preparing compost site in the institute campus, the plant waste material and
other biodegradable material from campus can be used for making of
compost which can be used for plants within the institute.
4 Case study on E-waste and space pollution (Assignment). Enlisting Various E-waste
generated by individual.
5 Estimate the consumption of power unit for the campus.
6 Estimate the generation of greenhouse gases because combustion of one Liter of
petrol.
7 Avoiding use of plastics.
a. Finding out individual activities which causes various types of pollution.
b. Avoiding use of bikes for a day.
c. Using public vehicles by all local students for a day.
d. 4. Any other activity.
8 Any of the following activity can be performed.
a. Registering varieties of plants in the institute campus (Biodiversity register of
institute).
b. Studying any threatened animal (Assignment).
9 Any of the following activity can be performed.
a. To visit solar appliances lab in our institute.
b. To understand the detailed working of any of solar energy/ wind energy
applications.
c. Avoiding electricity waste.
10 Case study of any nuclear power plant, nuclear hazard recently in news through
newspaper articles (Assignment).
11. Any of the following activity can be performed.
1. Case study of any natural disaster happened recently (Assignment).
2. Visit to Fire brigade station for flood situation monitoring.
3. Visit to district disaster response cell.
12. Any of the following activity can be performed.
a. Living any of the environmentalists for a day, reading their thoughts,
literature, trying to incorporate in daily lives.
b. Organizing essay competition, poster competition, slogan making
competition.
13. Essay on showing how Indian culture is environment friendly and also finding its odds
or inconsistencies.
14. Forming changes in daily life according to environment friendly sustainable lifestyles.
15. Try to identify environmental problem in local area and prepare detailed report on it
giving solution (Assignment/ report).

Page 45 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Syllabus of Multi-Disciplinary Minor

Courses (MDM) offered by Computer Science
at Second Year B. Tech Level
Data Structure and Algorithms
Course Code MDM-CS201
*For Other Depts.
Category Multidisciplinary Minor
Course Title Data Structures and Algorithms
Scheme and Credits L T P No. of credits Semester
3 0 1 4 III

Course Objectives
1. Develop a comprehensive understanding of fundamental data structures such as arrays, linked
lists, stacks, queues, trees, and graphs, including their properties, operations, and
implementations.
2. Learn to analyse the time and space complexity of algorithms, enabling them to evaluate
the efficiency and scalability of different algorithmic approaches. They will also gain
proficiency in designing efficient algorithms to solve a variety of computational problems.
3. Enhance their ability to apply data structures and algorithms to solve real-world problems
efficiently. This includes understanding how to select the appropriate data structures and
algorithms for specific problem scenarios and optimizing their solutions.

4. Explore different algorithmic paradigms and problem-solving techniques, including divide

and conquer, dynamic programming, greedy algorithms, and backtracking.

5. Gain practical experience implementing data structures and algorithms in a programming

language such as Python, Java, or C++. This involves writing code to create, manipulate, and
traverse data structures, as well as implementing various algorithms for tasks such as
sorting, searching, and graph traversal.

Course Outcomes
At the end of Course Students will be able to
1. CO1: Be able to check the correctness of algorithms using inductive proofs and loop
invariants.
2. CO2: Become familiar with a variety of sorting algorithms and their performance
characteristics (e.g., running time, stability, space usage) and be able to choose the best
under a variety of requirements.
3. CO3: Be able to understand and identify the performance characteristics of fundamental
algorithms and data structures and be able to trace their operations for problems such as
sorting, searching, selection, operations on numbers, polynomials and matrices, and
graphs.
4. CO4: Able to understand the requirement, select and use best suitable Linear or Non-linear

Page 46 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

data structures.
5. CO5: Understand and use Graphs in different problems.
CO-PO Mapping

CO PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO3

1 2 3 4 5 6 7 8 9 10 11 2 1 2
CO1 3 2 2 1 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3 3 3 2
CO4 3 3 3 1 2 3 2
CO5 3 3 2 1 3 2 3
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 Basics
Algorithm Specifications: Performance Analysis and Measurement (Time and 10
space analysis of algorithms- Average, best- and worst-case analysis).
2 Introduction To Data Structure
Data Management concepts, Data types – primitive and non-primitive, Types of 10
Data Structures- Linear & Non-Linear Data Structures.
3 Linear Data Structure
Array: Representation of arrays, Applications of arrays, sparse matrix and its 10
Representation. Stack: Stack-Definitions & Concepts, Operations on Stacks,
Applications of Stacks, Queue: Representation of Queue, Operations on Queue.
Types of Queues, Applications of Queue, Linked List: Singly Linked List, Doubly
Linked list, Circular linked list Stack, Linked implementation of Stack and Queue,
Applications of linked list.
4 Nonlinear Data Structure
Tree-Definitions and Concepts, Representation of binary tree, Binary tree 10
traversal (In order, post order, preorder), Threaded binary tree, Binary search
trees, Applications of Trees, Graph-Matrix Representation of Graphs, Elementary
Graph Applications.
5 Sorting And Searching 05
Insertion Sort, Quick Sort, Merge Sort, Linear Search, Binary Search.
Textbooks/References
1. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul
G. Sorenson Publisher-Tata McGraw Hill.
2. Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall
International.
3. Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed.
4. Fundamentals of Data Structures in C++ -By Sartaj Sahani.
5. Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan
Publisher-Thomson Learning.

Page 47 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

List of Experiments
Sr. Experiment Name
1 Study of performance analysis of algorithms.
2 Program on structures & pointers in C.
3 Stack operations: PUSH, POP.
4 Queue Operations: Insertion and Deletion.
5 Implementation of Linked list: Single, Double and Circular.
6 Programs to implement Selection Sort.
7 To sort the given number using bubble sort.
8 Programs to implement Merge Sort.
9 Programs to implement Quick Sort.
10 Programs to implement Sequential Search.
11 Programs to implement Binary Search.
12 Implement tree traversal techniques: in order, preorder and post order.
13 Implement graph traversal techniques: BFS and DFS
14 Implement binary search tree and perform following operations:
a. Insert b. Delete c. Search d. Mirror image e. Display f. Display level wise

Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute
1 Data Structures and Algorithms - Video Prof. Naveen Garg IIT Delhi
course.

Experiments That May Be Performed Through Virtual Labs:

Sr. Experiment Name Experiment Link (s)
1. Bubble Sort https://www.vlab.co.in/broad-area-computer-science-and-
engineering
2. Merge Sort https://ds1-iiith.vlabs.ac.in/exp/merge-sort/index.html
3. Stacks & Queues https://ds1-iiith.vlabs.ac.in/exp/stacks-queues/index.html
4. Minimum Spanning Tree https://ds2-iiith.vlabs.ac.in/exp/min-spanning-
trees/index.html
5. Infix to Postfix https://ds1-iiith.vlabs.ac.in/exp/infix-postfix/index.html

Page 48 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Operating Systems
Course Code MDM-CS202
Category Multidisciplinary Minor
Course Title Operating Systems
Scheme and Credits L T P No. of credits Semester
2 0 0 2 IV

Course Objectives
1. To learn the fundamentals of Operating Systems.
2. To learn the mechanisms of OS to handle processes and threads and their communication.
3. To learn the mechanisms involved in memory management in contemporary OS.
4. To gain knowledge on operating system concepts related to concurrency control,
5. To gain knowledge on Mutual exclusion algorithms, deadlock detection and avoidance
algorithm and to know the disk, I/O and file management systems.
Course Outcomes
At the end of Course Students will be able to
1. CO1: Understand Operating System Structure, Operations and Services.
2. CO2: Learn the Process Concept, Multithreaded Programming, Process Scheduling and
Synchronization.
3. CO3: Apply the Concepts of Virtual Memory Management and File Systems.
4. CO4: Analyse the Secondary Storage and I/O Systems.
5. CO5: Design and implement CPU Scheduling algorithms, Page Replacement Algorithms,
Memory Allocation Algorithms, Disk Scheduling Algorithms.

CO-PO Mapping

C CO PO PO PO PO PO PO PO PO PO PO PO PO PSO1 PSO2 PSO3

1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 1 1 1 3 1 3
CO2 1 3 1 2 1 3 1
CO3 2 3 3 2 1 3 3 1 3 3
CO4 2 3 3 2 1 2 3 1 3 3
CO5 2 1 2 1 2 1 3
CO6 2 1 2 1 2 1 3
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 Introduction
Concept of operating systems, generations of operating systems, types of operating
systems, OS services, system Calls, structure of an OS - layered, monolithic,
microkernel operating systems, concept of virtual machine. case study on UNIX and 5
WINDOWS Operating System.
2 Processes

Page 49 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Definition, process relationship, different states of a process, process state

transitions, Process Control Block (PCB), context switching.
Thread: 5
Definition, various states, benefits of threads, types
of threads, concept of multi threads.
Process Scheduling
Foundation and scheduling objectives, types of schedulers.
Scheduling algorithms
Pre-emptive and non-pre-emptive, FCFS, SJF, RR.
Multiprocessor scheduling

3 Inter-process Communication
Critical section, race conditions, mutual exclusion, hardware
solution, strict alternation, Peterson’s solution, The Producer\Consumer problem,
semaphores, event counters, monitors, message passing. 5
Classical IPC problems
Reader’s & Writer problem, dinning philosopher problem etc.
4 Deadlocks
Definition, necessary and sufficient conditions for deadlock,
deadlock prevention, and deadlock avoidance, Banker’s.
algorithm, deadlock detection and recovery. 5
5 Memory Management
Basic concept, logical and physical address map.
Memory allocation 5
Contiguous Memory allocation fixed and variable partition, internal and external
fragmentation, and compaction.
Paging
Principle of operation, Page allocation, hardware support for paging, Protection and
sharing, disadvantages of paging.
Virtual Memory
Page Replacement Algorithms

6 I/O Hardware
I/O devices, device controllers, direct memory access. Principles of I/O Software 5
Goals of interrupt handlers, device drivers, device independent I/O software.
Secondary-Storage Structure
Disk structure, disk scheduling algorithms.
File Management
Concept of file, access methods, file types, file operation, directory structure, file
system structure, allocation methods (contiguous, linked, indexed),
Disk Management
Disk structure, disk scheduling - FCFS, SSTF, SCAN, C-SCAN.
Textbooks/References
1. Operating System Concepts Essentials, 9th Edition by Avi Silberschatz, Peter Galvin, Greg Gagne,
Wiley Asia Student Edition, 2012.

Page 50 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

2. Operating Systems: Internals and Design Principles, 5th Edition, William Stallings, Prentice Hall of
India.
3. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin Publishing.
4. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley.
5. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of India.
6. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and
Associates.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Introduction to Operating Systems Prof. Chester Rebeiro IIT Madras
2 Operating Systems Prof. Sorav Bansal IIT Delhi
3 Operating Systems Prof. P.C.P. Bhatt IISc Bangalore

Page 51 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Syllabus of Double Minor Courses (DM)

offered by Computer Science and Engineering
at Second Year B. Tech Level
Data Structure and Algorithms
Course Code DM-CS201
*For Other Depts.
Category Double Minor
Course Title Data Structures and Algorithms
Scheme and Credits L T P No. of credits Semester
3 0 1 4 III

Course Objectives
1. Develop a comprehensive understanding of fundamental data structures such as arrays,
linked lists, stacks, queues, trees, and graphs, including their properties, operations, and
implementations.
2. Learn to analyse the time and space complexity of algorithms, enabling them to evaluate
the efficiency and scalability of different algorithmic approaches. They will also gain
proficiency in designing efficient algorithms to solve a variety of computational problems.
3. Enhance their ability to apply data structures and algorithms to solve real-world problems
efficiently. This includes understanding how to select the appropriate data structures and
algorithms for specific problem scenarios and optimizing their solutions.
4. Explore different algorithmic paradigms and problem-solving techniques, including divide
and conquer, dynamic programming, greedy algorithms, and backtracking.
5. Gain practical experience implementing data structures and algorithms in a programming
language such as Python, Java, or C++. This involves writing code to create, manipulate, and
traverse data structures, as well as implementing various algorithms for tasks such as
sorting, searching, and graph traversal.

Course Outcomes
At the end of Course Students will be able to
1. CO1: Be able to check the correctness of algorithms using inductive proofs and loop
invariants.
2. CO2: Become familiar with a variety of sorting algorithms and their performance
characteristics (e.g., running time, stability, space usage) and be able to choose the best
under a variety of requirements.
3. CO3: Be able to understand and identify the performance characteristics of fundamental
algorithms and data structures and be able to trace their operations for problems such as
sorting, searching, selection, operations on numbers, polynomials and matrices, and
graphs.

Page 52 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

4. CO4: Able to understand the requirement, select and use best suitable Linear or Non-linear
data structures.
5. CO5: Understand and use Graphs in different problems.
CO-PO Mapping

CO PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO3

1 2 3 4 5 6 7 8 9 10 11 2 1 2
CO1 3 2 2 1 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3 3 3 2
CO4 3 3 3 1 2 3 2
CO5 3 3 2 1 3 2 3
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 Basics
Algorithm Specifications: Performance Analysis and Measurement (Time and 10
space analysis of algorithms- Average, best- and worst-case analysis).
2 Introduction To Data Structure
Data Management concepts, Data types – primitive and non-primitive, Types of 10
Data Structures- Linear & Non-Linear Data Structures.
3 Linear Data Structure
Array: Representation of arrays, Applications of arrays, sparse matrix and its 10
Representation. Stack: Stack-Definitions & Concepts, Operations on Stacks,
Applications of Stacks, Queue: Representation of Queue, Operations on Queue.
Types of Queues, Applications of Queue, Linked List: Singly Linked List, Doubly
Linked list, Circular linked list Stack, Linked implementation of Stack and Queue,
Applications of linked list.
4 Nonlinear Data Structure
Tree-Definitions and Concepts, Representation of binary tree, Binary tree 10
traversal (In order, post order, preorder), Threaded binary tree, Binary search
trees, Applications of Trees, Graph-Matrix Representation of Graphs, Elementary
Graph Applications.
5 Sorting And Searching 05
Insertion Sort, Quick Sort, Merge Sort, Linear Search, Binary Search.
Textbooks/References
6. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul
G. Sorenson Publisher-Tata McGraw Hill.
7. Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall
International.
8. Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed.
9. Fundamentals of Data Structures in C++ -By Sartaj Sahani.
10. Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan
Publisher-Thomson Learning.

Page 53 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

List of Experiments
Sr. Experiment Name
1 Study of performance analysis of algorithms.
2 Program on structures & pointers in C.
3 Stack operations: PUSH, POP.
4 Queue Operations: Insertion and Deletion.
5 Implementation of Linked list: Single, Double and Circular.
6 Programs to implement Selection Sort.
7 To sort the given number using bubble sort.
8 Programs to implement Merge Sort.
9 Programs to implement Quick Sort.
10 Programs to implement Sequential Search.
11 Programs to implement Binary Search.
12 Implement tree traversal techniques: in order, preorder and post order.
13 Implement graph traversal techniques: BFS and DFS
14 Implement binary search tree and perform following operations:
a. Insert b. Delete c. Search d. Mirror image e. Display f. Display level wise

Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute
1 Data Structures and Algorithms - Video Prof. Naveen Garg IIT Delhi
course.

Experiments That May Be Performed Through Virtual Labs:

Sr. Experiment Name Experiment Link (s)
1. Bubble Sort https://www.vlab.co.in/broad-area-computer-science-and-
engineering
2. Merge Sort https://ds1-iiith.vlabs.ac.in/exp/merge-sort/index.html
3. Stacks & Queues https://ds1-iiith.vlabs.ac.in/exp/stacks-queues/index.html
4. Minimum Spanning Tree https://ds2-iiith.vlabs.ac.in/exp/min-spanning-
trees/index.html
5. Infix to Postfix https://ds1-iiith.vlabs.ac.in/exp/infix-postfix/index.html

Page 54 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Operating Systems
Course Code DM-CS202
Category Double Minor
Course Title Operating Systems
Scheme and Credits L T P No. of credits Semester
3 0 0 3 IV

Course Objectives
1. To learn the fundamentals of Operating Systems.
2. To learn the mechanisms of OS to handle processes and threads and their communication.
3. To learn the mechanisms involved in memory management in contemporary OS.
4. To gain knowledge on operating system concepts related to concurrency control,
5. To gain knowledge on Mutual exclusion algorithms, deadlock detection and avoidance
algorithm and to know the disk, I/O and file management systems.
Course Outcomes
At the end of Course Students will be able to
1. CO1: Understand Operating System Structure, Operations and Services.
2. CO2: Learn the Process Concept, Multithreaded Programming, Process Scheduling and
Synchronization.
3. CO3: Apply the Concepts of Virtual Memory Management and File Systems.
4. CO4: Analyse the Secondary Storage and I/O Systems.
5. CO5: Design and implement CPU Scheduling algorithms, Page Replacement Algorithms,
Memory Allocation Algorithms, Disk Scheduling Algorithms.

CO-PO Mapping

C CO PO PO PO PO PO PO PO PO PO PO PO PO PSO1 PSO2 PSO3

1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 1 1 1 3 1 3
CO2 1 3 1 2 1 3 1
CO3 2 3 3 2 1 3 3 1 3 3
CO4 2 3 3 2 1 2 3 1 3 3
CO5 2 1 2 1 2 1 3
CO6 2 1 2 1 2 1 3
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 Introduction
Concept of operating systems, generations of operating systems, types of operating
systems, OS services, system Calls, structure of an OS - layered, monolithic,
microkernel operating systems, concept of virtual machine. case study on UNIX and 6
WINDOWS Operating System.
2 Processes
Definition, process relationship, different states of a process, process state
transitions, Process Control Block (PCB), context switching.

Page 55 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Thread: 9
Definition, various states, benefits of threads, types
of threads, concept of multi threads.
Process Scheduling
Foundation and scheduling objectives, types of schedulers.
Scheduling criteria
CPU utilization, throughput, turnaround time, waiting time,
response time.
Scheduling algorithms
Pre-emptive and non-pre-emptive, FCFS, SJF, RR.
Multiprocessor scheduling
Real Time scheduling
RM and EDF.
3 Inter-process Communication
Critical section, race conditions, mutual exclusion, hardware
solution, strict alternation, Peterson’s solution, The Producer\Consumer problem,
semaphores, event counters, monitors, message passing. 6
Classical IPC problems
Reader’s & Writer problem, dinning philosopher problem etc.
4 Deadlocks
Definition, necessary and sufficient conditions for deadlock,
deadlock prevention, and deadlock avoidance, Banker’s.
algorithm, deadlock detection and recovery. 6
5 Memory Management
Basic concept, logical and physical address map.
Memory allocation 8
Contiguous Memory allocation fixed and variable partition, internal and external
fragmentation, and compaction.
Paging
Principle of operation, Page allocation, hardware support for paging, Protection and
sharing, disadvantages of paging. Virtual Memory
Basics of virtual memory, hardware and control structures, locality of reference,
page fault, working set, dirty page/dirty bit, demand paging.
Page Replacement Algorithms
Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and
Least Recently used (LRU).
6 I/O Hardware
I/O devices, device controllers, direct memory access. Principles of I/O Software 10
Goals of interrupt handlers, device drivers, device independent I/O software.
Secondary-Storage Structure
Disk structure, disk scheduling algorithms.
File Management
Concept of file, access methods, file types, file operation, directory structure, file
system structure, allocation methods (contiguous, linked, indexed), free-space
management (bit vector, linked list, grouping), directory implementation (linear list,
hash table), efficiency and performance.
Disk Management

Page 56 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Disk structure, disk scheduling - FCFS, SSTF, SCAN, C-SCAN, disk reliability, disk
formatting, boot-block, bad blocks.
Textbooks/References
1. Operating System Concepts Essentials, 9th Edition by Avi Silberschatz, Peter Galvin, Greg Gagne,
Wiley Asia Student Edition, 2012.
2. Operating Systems: Internals and Design Principles, 5th Edition, William Stallings, Prentice Hall of
India.
3. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin Publishing.
4. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley.
5. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of India.
6. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and
Associates.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Introduction to Operating Systems Prof. Chester Rebeiro IIT Madras
2 Operating Systems Prof. Sorav Bansal IIT Delhi
3 Operating Systems Prof. P.C.P. Bhatt IISc Bangalore

Page 57 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Syllabus of Honour Courses (HON) offered

by Computer Science and Engineering at
Second Year B. Tech Level
Combinatorics, Probability and Statistics
Course Code HON-CS201
Category Honors
Course Title Combinatorics, Probability and Statistics
Scheme and Credits L T P No. of credits Semester
3 0 0 3 III

Course Objective
1. Understand concepts of discrete probability, conditional probability, independence, and be
able to apply these concepts to engineering applications (selected by instructor).
2. Understand mathematical descriptions of random variables including probability mass
functions (PMFs), cumulative distribution functions (CDFs), probability distribution functions
(PDFs), conditional mass, conditional distribution and conditional density functions.
3. Be familiar with some of the more commonly encountered random variables, in particular the
Gaussian random variable.
4. Be able to calculate various moments of common random variables including at least means,
variances and standard deviations, distribution of a function of a random variable.
5. Be able to use statistical concepts to analyse and interpret engineering data.
Course Outcomes
At the end of Course Students will be able.
1. CO1: Understand basic probability axioms and rules and the moments of discrete and
continuous random variables as well as be familiar with common named discrete and
continuous random variables.
2. CO2: Learn to derive the probability density function of transformations of random
variables and use these techniques to generate data from various distributions.
3. CO3: Analyse different combinatorics principals.
4. CO4: Apply probability techniques to translate real-world problems into probability
models.
5. CO5: Design system to calculate probabilities and derive the marginal and conditional
distributions of bivariate random variables.

Page 58 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

CO-PO Mapping
CO PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO3
1 2 3 4 5 6 7 8 9 10 11 2 1 2
CO 3 1 - - - - - - - - - 2 3 2 2
1
CO 3 3 - 3 - - - - - - - 2 3 2 2
2
CO 3 3 - 3 - - - - - - - 2 3 2 2
3
CO 3 1 - - - - - - - - - 2 3 3 3
4
CO 3 1 3 2 3 - - - 2 - - 2 3 3 3
5
(3) High, (2) Medium, (1) Low

Course Content
Unit Unit Title and Contents Hours
No.
01 Combinatorics
Basic combinatorial numbers, selection with repetition, pigeonhole principle,
Inclusion-Exclusion Principle, Double counting; Recurrence Relations,
Generating functions; Special combinatorial numbers: Sterling numbers of
the first and second kind, Catalan numbers, Partition numbers; Introduction 15
to Ramsey theory; combinatorial designs, Latin squares; Introduction to
Probabilistic methods, Introduction to Linear algebra methods.
02 Introduction to Ramsey theory; combinatorial designs, Latin squares; 07
03 Introduction to Probabilistic methods, Introduction to Linear algebra 08
methods.
04 Probability and Statistics
Probability Spaces and Continuity of Probability Measures, Random Variables
and Expectation, Moment Inequalities, Multivariate Random Variables,
Sequence of Random Variables and Different Modes of Convergence, Law of 15
Large Numbers, Markov Chains, Statistical Hypothesis Testing, Exponential
Models, Introduction to Large Deviations.
Textbook/References
1. R. P. Grimaldi, B. V. Ramana, "Discrete and Combinatorial Mathematics: An applied
introduction", Pearson Education (2007)
2. Richard A Brualdi, "Introductory Combinatorics", Pearson Education, Inc. (2004)
3. Miklos Bona, "Introduction to Enumerative Combinatorics", Mc Graw Hill (2007)
4. An Introduction to Probability and Statistics by Vijay K. Rohatgi, A. K. Md. Ehsanes Saleh, Wiley,
2nd edition 2000.
5. An Intermediate course in Probability, by Allen Gut, Springer, 2008.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Probability and Statistics Prof. Somesh Kumar Indian Institute of Technology,
Kharagpur

Page 59 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Data Science
Course Code HON-CS202
Category Honors
Course Title Data Science
Scheme and Credits L T P No. of credits Semester
3 0 2 4 IV

Course Objective
1. To understand the recommendation system and two basic architectures for a
recommendation system and develop the fundamental knowledge and understand
concepts to become a data science professional.
2. To learn statistical methods and machine learning algorithms required for Data
Science.
3. To visualize data and use for communicating stories from data.
4. To study different types of recommendation systems.
5. To learn algorithms for analysing and mining the structure of network graphs.
Course Outcomes
At the end of Course Students will be able.
1. CO1: Apply data science processes to an e-commerce data and demonstrate the use
of estimation methods for analysing this data.
2. CO2: Compare and apply appropriate machine learning algorithms for classification.
3. CO3: Compare and choose one data visualization method for effective visualization
of data.
4. CO4: Design a model of recommendation system based on the content of the data.
5. CO5: Apply standard clustering methods to analyse social network graph.

CO-PO Mapping
CO PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 2 1 2 3
CO 2 3 - - 1 - 1 - - - - 2 - -
1
CO 2 - - 3 - - - - - - 3 - -
2
CO - 3 - - - - - 2
3
CO 3 2 - - - - - 2
4
CO - 2 3 - - 1 1 2
5
(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
01 Introduction to Data Science: Introduction, Types of Data, Categorical 8
Data, Big Data vs. Little Data, Data science process, Role Data Scientist.

Page 60 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Case Studies (if any): Ecommerce Marketplace

02 Statistical Interference and Exploratory Data Analysis: Introduction-
Population and samples, Data Preparation, Exploratory Data Analysis-
Summarizing Data, Data Distribution, Outlier Treatment, Measuring 8
Symmetry, Continuous Distribution, Kernel Density, Estimation: Sample
and Estimated Mean, Variance and Standard Scores, Covariance, and
Pearson’s and Spearman’s Rank Correlation.
03 Machine Learning Algorithms: Machine Learning Algorithms: Linear
Regression, K-nearest Neighbours(k-NN), K-mean, Spam Filters, Naive
Bayes, and Wrangling: Naive Bayes, Comparing Naive Bayes to k-NN, 6
Scraping the Web: APIs and Other Tools
04 Data Visualization: Introduction, Types of data visualisation, Data for
visualisation: Data types, Data encodings, Retinal variables, Mapping 6
variables to encodings, Visual encodings
05 Recommendation Systems: A Model for Recommendation Systems: The
Utility Matrix, The Long Tail, Applications of Recommendation Systems,
Populating the Utility Matrix, Content-Based Recommendations: Item
Profiles, Discovering Features of Documents, Obtaining Item Features
From Tags, Representing Item Profiles, User Profiles, Recommending 9
Items to Users Based on Content, Collaborative Filtering: Measuring
Similarity, The Duality of Similarity, Clustering Users and Items, Evaluation
of Recommendation System
06 Social Network Analysis: Social Networks as Graphs, Varieties of Social
Networks, Graphs with Several Node Types, Clustering of Social-Network
Graphs: Distance Measures for Social-Network Graphs, Applying Standard 8
Clustering Methods, Betweenness, The Girvan-Newman Algorithm, Using
Betweenness to Find Communities
Textbook/References
1. Laura Igual and Santi Segui, Introduction to Data Science: A Python Approach to Concepts,
Techniques and Applications, Springer; 1st ed. 2017 edition
2. Tom Mitchell. Machine Learning. McGraw Hill, 1997.
3. Christopher M. Bishop. Pattern Recognition and Machine Learning. Springer 2006.
4. Richard O. Duda, Peter E. Hart, David G. Stork. Pattern Classification. John Wiley & Sons, 2006.
5. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012
6. Cathy O’Neil and Rachel Schutt. Doing Data Science, Straight Talk From The Frontline. O’Reilly.
7. Jure Leskovek, Anand Rajaraman and Jeffrey Ullman. Mining of Massive Datasets. v2.1,
Cambridge University Press.
List of Experiments
Sr No. Experiment Name
1. Study of Data Science concepts & Installation of Anaconda
2. To study and implement Python basics and libraries like NumPy, Pandas, and Matplotlib,
which are fundamental for data manipulation, analysis, and visualization.
3. To study and implement data pre-processing techniques such as handling missing data,
normalization, and encoding categorical variables to prepare data for modelling.
4. Implement simple linear regression to predict a continuous target variable based on one
or more predictor variables and evaluate the model using metrics like mean squared
error (MSE) or R-squared.

Page 61 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

5. To build a logistic regression model to perform binary classification tasks and evaluate
the model's performance using metrics like accuracy, precision, recall, and F1-score.
6. To apply K-means clustering algorithm to group data points into clusters based on
similarity, Visualize the clusters using scatter plots or other suitable visualization
techniques.
7. To build a decision tree classifier to predict categorical outcomes, Visualize the decision
tree structure and interpret feature importance.
8. Implement a random forest classifier for both classification and regression tasks and
compare the performance of random forest with decision trees.
9. Perform dimensionality reduction using PCA on a dataset with high-dimensional
features, Visualize the principal components and their explained variance ratio.
10. To build a text classifier using the Naive Bayes algorithm for sentiment analysis or spam
email detection. Preprocess text data by tokenizing, removing stop words, and using TF-
IDF vectorization.
11. To implement the Apriori algorithm to discover frequent item sets and association rules
from transactional data (e.g., market basket analysis) and evaluate the strength of
association rules using support, confidence, and lift metrics.
12. To analyse and visualize time series data using techniques like moving average, trend
analysis, and seasonal decomposition and build a forecasting model (e.g., ARIMA) to
predict future values based on historical trends.
13. Implement SVM for both linear and nonlinear classification tasks and tune
hyperparameters such as regularization parameter (C) and kernel type.
14. Perform model evaluation using techniques like cross-validation and train-test split and
compare the performance of different models (e.g., logistic regression vs. random
forest) using appropriate evaluation metrics.
Note: The list provided above is merely illustrative. The course coordinator reserves the right to
modify the list as necessary.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
01 Data Science for Engineers Prof. Shankar Narasimhan, Prof. IIT Madras
Ragunathan Rengasamy

Page 62 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Syllabus of Open Elective (OE) offered by

Computer Science and Engineering at Second
Year B. Tech Level
Object Oriented Programming with Java
Course Code OE-CS201
Category Open Elective
Course Title Object Oriented Programming with Java
Scheme and Credits L T P No. of credits Semester
2 0 2 3 III

Course Objectives
1. Master OOP concepts and Java programming proficiency.
2. Apply OOP principles for problem-solving and effective exception handling and I/O
operations
in Java.
3. Master concurrency and multithreading concepts for efficient Java applications and
develop competent application development skills.
4. Enhance problem-solving abilities and foster collaborative skills through Java
programming challenges and group projects.
5. Acquire knowledge of the software development lifecycle and prepare for advanced Java
programming courses.
Course Outcomes
At the end of the Course, Students will be able.
1. CO1: Be able to understand the basics of OOP and Object-oriented approach to design
software to solve real world problems based on object-oriented principles.
2. CO2: Students can think in terms of classes, Objects, Interfaces when developing
software.
3. CO3: Apply object-oriented programming principles effectively in software
development, identifying and leveraging the benefits of object-oriented programming
over other programming approaches.
4. CO4: Acquire skills in testing, documenting, and preparing professional-quality
software, ensuring.
5. CO5: The delivery of robust and well-documented solutions.
CO-PO Mapping
CO P P P P P P P P P P P P P P PS
O O O O O O O O O O O O S S O
1 2 3 4 5 6 7 8 9 1 1 1 O O 3
0 1 2 1 2
CO1 2 3 3 3 3 1 3 2 2 1 3 3
CO2 1 3 3 3 3 2 1 3 1 3 3
CO3 1 2 2 2 3 2 1 3 1 3 3

Page 63 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

CO4 1 2 3 3 3 1 2 1 2 1 3 3
CO5 1 3 1 2 1

Course Content
Unit No. Unit Title and Contents Hours
1 Fundamentals of Object-Oriented Programming 5
Introduction to Object-Oriented Programming, Differences between Object-
Oriented and Procedural Languages, Object-Oriented Paradigm: Objects and
Classes, Data Abstraction and Encapsulation, Inheritance and Polymorphism,
Function Overloading, Handling Exceptions.
2 Java Basics and Environment 5
Features and Evolution of Java, Java Development Environment Setup,
Constants, Variables, and Data Types, Arrays, Strings, and Vectors, Operators
and Expressions, Control Structures.
3 Java Classes, Objects, and Methods 5
Defining Classes and Objects, Abstract Classes and Interfaces, Static
Methods and Variables, Inner Classes and Nested Classes, Packages and
Access Modifiers, Wrapper Classes and Autoboxing, Advanced Class Design
Concepts.
4 Exception Handling and Input/Output Operations 5
Exception Handling: Exception as Objects, Hierarchy, Try- Catch-Finally,
Throw and Throws, Input/Output (I/O) Package: Input Streams, Output
Streams, Object Serialization and Deserialization, File Handling: Reading and
Writing to Files, File Streams, Filter, and Pipe Streams.
5 Multithreading and Concurrency 5
Introduction to Concurrency and Multithreading, Thread Lifecycle and
Creation, Thread Synchronization and Coordination, Multithreading
Advantages, Issues, and Best Practices, Concurrent Collections and Thread
Safety.
6 Java Application Development 5
Overview of Application Development in Java
Designing and Implementing Java Applications, Design Patterns and Best
Practices, Testing and Debugging Java Applications, Project Work:
Development of a Java Application using OOP’s Principles.

Textbooks/References
1. E. Balagurusamy, Programming with Java A Primer, TMH, 1998.
2. Herbert schildt, The Complete Reference JAVA2, 2nd ed., TMH, 2002.

Page 64 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

3. Horstmann, Cornell, Core Java 2: Volume 1-Fundanmentals, Pearson Education, 2000.

4. Kathy Sierra & Bert Bates Headfirst Java, 2nd edition O’RELLY 2015.

List of Experiments

Sr. Experiment Name

1. Create a simple Java program to demonstrate the concept of objects and classes.
2. Implement a program illustrating the principles of data abstraction and
encapsulation using Java classes.
3. Write Java programs to demonstrate the use of constants, variables, and different
data types.
4. Implement Java programs showcasing various operators, expressions, and control
structures.
5. Design Java classes representing real-world entities and demonstrate them
instantiation and usage.
6. Implement abstract classes and interfaces in Java, showcasing their role in object-
oriented design.
7. Create programs illustrating the usage of static methods, inner classes, and
packages in Java.
8. Write Java programs to handle exceptions using try-catch-finally blocks.
9. Develop programs to perform input/output operations, including reading from and
writing to files.
10. Implement object serialization and deserialization in Java to store and retrieve
object data.
11. Create Java programs to demonstrate the lifecycle of threads and their creation.
12. Implement multithreading in Java to perform concurrent tasks, such as calculating
Fibonacci series or sorting algorithms
13. Design programs to illustrate thread synchronization and coordination using
synchronization mechanisms.
14. Develop a Java application that utilizes object-oriented design principles, including
inheritance, polymorphism, and encapsulation.
15. Design and implement a multithreaded Java application that performs parallel
processing tasks, such as image processing or data processing.
Alternative NPTEL/SWAYAM Course

Sr. NPTEL Courses Name Instructor Host Institute

1. Programming In Java By Prof. Debasis IIT Kharagpur

Samanta

Page 65 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Experiments That May Be Performed Through Virtual Labs

Sr. Experiment Name Experiment Link (s)

1. Introduction to Java programming language https://java-

iitd.vlabs.ac.in/exp/introduction-
java/
2. Creating Classes and their Objects in Java https://java-
iitd.vlabs.ac.in/exp/classes-
objects/
3. Using constructors to create objects https://java-
iitd.vlabs.ac.in/exp/constructors/
4. To understand the inheritance in Java https://java-
iitd.vlabs.ac.in/exp/inheritance/
5. Implementing Method Overloading https://java-
iitd.vlabs.ac.in/exp/method-
overloading/
6. Implementing Method Overriding https://java-
iitd.vlabs.ac.in/exp/
method-
overriding/
7. Learning of abstraction through Interface https://java-
iitd.vlabs.ac.in/exp/abstraction/
8. Learning of Encapsulation through Package https://java-
iitd.vlabs.ac.in/exp/encapsulatio
n/
9. Handling Exceptions in Java https://java-
iitd.vlabs.ac.in/exp/exceptions/
10 Understanding Life cycle of a Thread https://java-
iitd.vlabs.ac.in/exp/life-
cycle-thread/

Page 66 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Cyber Security Principles

Course Code OE-CS202

Category Open Elective
Course Title Cyber Security Principals
Scheme and Credits L T P No. of credits Semester
2 0 2 3 IV

Course Objectives
1. Understand the cyber security threat landscape.
2. Develop a deeper understanding and familiarity with various types of cyberattacks,
3. Cyber-crimes, vulnerabilities, and remedies there to.
4. Analyze and evaluate existing legal framework and laws on cyber security.
5. Analyze and evaluate the digital payment system security

Course Outcomes
At the end of Course Students will be able.
1. CO1: Learn the foundations of Cyber security and threat landscape.
2. CO2: To equip students with the technical knowledge and skills needed to protect and
defend against cyber threats.
3. CO3: To develop skills in students that can help them plan, implement, and monitor cyber
security mechanisms to ensure the protection of information technology assets.
4. CO4: To expose students to governance, regulatory, legal, economic, environmental, social,
and ethical contexts of cyber security.
5. CO5: To expose students to responsible use of online social media networks.
CO-PO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 2 2 2 3 1 1 2 3 1

CO2 3 2 2 2 3 1 1 2 3 1

CO3 3 2 2 2 3 1 1 2 3 1

CO4 3 2 2 2 3 1 1 2 3 1

CO5 3 2 2 2 3 1 1 2 3 1

(3) High, (2) Medium, (1) Low

Course Content
Unit No. Unit Title and Contents Hours
1 Introduction to Cyber Space
History of Internet, Cyber Crime, Information Security, Computer Ethics and
Security Policies. 02

2 Browser and email security

Page 67 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Guidelines to choose web browsers, securing web browser, Antivirus, Email

security, Guidelines for setting up a Secure password, Two-steps 03
authentication, Password Manager, Wi-Fi Security.
3 Social media and Windows security
Guidelines for social media security, Tips and best practices for safer Social
Networking, Basic Security for Windows, User Account Password. 02
4 Smartphone security 02
Introduction to mobile phones, Smartphone Security, Android Security, IOS
Security.
5 Cyber Security Initiatives in India
Counter Cyber Security Initiatives in India, Cyber Security Exercise, Cyber
Security Incident Handling Cyber Security Assurance. 03
6 Online Banking, Credit Card and UPI Security
Online Banking Security, Mobile Banking Security, Security of Debit and
Credit Card, UPI Security, Security of Micro ATMs, e-wallet Security 04
Guidelines, Security Guidelines for Point of Sales(POS)
7 Social Engineering
Social Engineering, Types of Social Engineering, How Cyber Criminal Works,
How to prevent being a victim of Cyber Crime. 04
8 Cyber Security Threat Landscape and Techniques
Cyber Security Threat Landscape, Emerging Cyber Security Threats, Cyber 04
Security Techniques, Firewall.
9 IT Security Act and Misc. Topics
IT Act, Hackers-Attacker-Countermeasures, Web Application Security, 03
Digital Infrastructure Security, Defensive Programming.
10 Information Destroying and Recovery Tools
Recovering from Information Loss, Destroying Sensitive Information, 03
Cleaner for Windows.
Textbooks/References
1. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives by
Sumit Belapure and Nina Godbole, Wiley India PVT. Ltd.
2. Introduction to Cyber Security Author Dr. Jeetendra Pande, Uttarakhand Open University,
Haldwani, ISBN: 978-93-84813-96-3
3. Information Warfare and Security by Dorothy F. Denning, Addison Wesley.
4. Security in the Digital Age: Social Media Security Threats and Vulnerabilities by Henry A. Oliver,
Create Space Independent Publishing Platform.
Alternative NPTEL/SWAYAM Course
Sr. NPTEL Courses Name Instructor Host Institute
1 Cyber Security Dr.G.PADMAVATHI Avinashilingam Institute for Home
Science & Higher Education for
Women,Coimbatore

Page 68 of 69
 Curriculum for Second Year B. Tech. Programme from Academic Year 2024-25.

Exit Options after Second Year, B. Tech (CSE)

Exit Option - To qualify for Diploma:

Sr. Course Hours Credits

Course Name
No code L T P Total Theory Practical Total

EX-
1 Project-1 0 0 8 8 0 4 4
CS202
Any one course from MKCL:

1. IT Hardware and Networking *

https://klic.mkcl.org/hardware-and-
networking

2. Programming*

EX- https://klic.mkcl.org/programming
CS204
2 or 4

Any one course from MSBSVET:

1. Certificate Course in C and C++

Programming
https://msbsvet.edu.in/Public/Cours
eDtails.aspx?P1=112
2. Certification Course in Web Page
Designing
https://msbsvet.edu.in/Public/CourseDtails
.aspx?P1=105
Total 8
Note: Project-1 can be completed in-house or online mode.

Page 69 of 69