SEMESTER II- BTech Cyber Security

Credit Structure & Evaluation

COURSE
Total Hours Scheme
Hr
SNo
s. / Tot
Course Code Course Title L T P C IA ET
We .
ek
1 71102002001 Python Programming 3 0 1 4 5 50 50 100
2 Psychology 2 0 0 2 2 50 50 100
3 71100002002 Data Structures 2 0 1 3 4 50 50 100
Engineering Mathematics
4 71102002002 3 1 0 4 4 50 50 100
-II
Indian Knowledge System
5 71102002003 2 0 0 2 2 50 50 100
(SWAYAM -MOOC)*
Engineering Design and
6 71100002001 Workshop Practice
2 0 1 3 4 50 50 100
Simulation
7 UC011020001 Applied AI 1 0 1 2 3 50 50 100
Cyber Law and Ethics
8 71102005001 1 0 1 2 3 50 50 100
(Industry)
Total 17 1 6 22 28
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
71102002001 Python Programming 100
3 0 1 4
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
1. Mid Semester Examination (Theory)/Continuous Assessment
Evaluation 1.5 30
(Practical)
Scheme
2. Attendance - 10
3. Assignment/Seminar/Activity/ School Approved Certificate
Course/Events/Professional Societies Membership and - 10
Participants
UNIT-I INTRODUCTION 9
Introduction to Python programming - History of Python - Features of Python - Simple Program in Python -
Quotations in Python - Lines and Indentation - Multi-Line Statements - Input Operations - Output Operations.
UNIT-II DATA, EXPRESSIONS, STATEMENTS 9
Python interpreter and interactive mode; values and types: int, float, Boolean, string, and list; variables,
expressions, statements, tuple assignment, precedence of operators, comments; Illustrative programs: exchange
the values of two variables, circulate the values of n variables, distance between two points.
UNIT-III CONTROL FLOW STATEMENTS AND STRINGS 9
Control statements- if statement - if-else statement - if-elif-else statement - Nested if - While loop - for loop -
else statement used with loops - break statement - continue - pass statement - Strings: string slices - functions and
methods - In-built string methods - string formatting operations.
UNIT-IV FUNCTIONS AND FILES 9
Functions: return values - parameters - local and global scope - function composition - recursion; Files: Reading
and Writing-Format Operators-Filenames and paths.
UNIT-V LIST, SET, TUPLES, DICTIONARIES 9
Lists as arrays - Lists: list operations - list slices -list methods - list loop - mutability - aliasing cloning lists - list
parameters; Set; Tuples: tuple assignment, tuple as return value; Dictionaries: operations and methods.
Application based programming Modules & packages. Introduction to NumPy, pandas, SciPy and Matplotlib
Real time Applications.
Total hours 45 Periods
Course Outcomes: At the end of the course, students will be able to:
Bloom’s Level
COs
Statements
CO1 Understand simple python programs using input output operations. L2
CO2 Implement python programs using expressions and statements. L3
CO3 Implement python programs using control flow statements and strings. L3
CO4 Apply the concepts of functions and files in python programming. L3
Analyse and implement various tools, modules and packages for
CO5 python and develop applications using list, sets, tuples and dictionaries L4
in python.
TEXT BOOK:
1. Martin C. Brown, “The Complete Reference Python” McGraw Hill.,2018.
Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python” Revised and updated for Python
2.
3.2, Network Theory Ltd., 2014.
REFERENCES:
Charles Dierbach, “Introduction to Computer Science using Python: A Computational Problem-solving
3.
Focus”, Wiley India Edition, 2015.
John V Guttag, “Introduction to Computation and Programming Using Python”, Revised and expanded
4.
Edition, MIT Press, 2017.
 Course Outcomes with Program Outcomes

PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12

CO 1 3 3 3 3 2 1 - - 2 - - -

CO 2 2 1 2 3 2 2 - - - - - -

CO 3 2 3 2 2 2 2 - - - - - -

CO 4 3 3 3 3 2 2 - - - - - -

CO 5 2 3 2 2 2 2 1 - - - - -

S.NO LIST OF EXPERIMENTS

Write a program to compute distance between two points taking input from the user
Write a program
(a) For checking whether the given number is even or not
(b) To check whether given number is Armstrong or not.
CO1 Write a program using a while loop that asks the user for a number and prints a countdown from
that number to zero.
Find the sum of all the primes below two million. By considering the terms in the Fibonacci sequence
whose values do not exceed four million, write a program to find the sum of even valued terms.

Write a program to count the number of characters in the string and store them in a dictionary data
structure.
Write a program to demonstrate list and tuple in python. Write a program using a for loop that loops
over a sequence.
With a given tuple (1,2,3,4,5,6,7,8,9,10), write a program to print the first half values in one line
CO2 and the last half values in one line.
Write a function dups to find all duplicates in the list and a function –unique to find all unique
elements of the list.
Write a function reverse to reverse a list without using reverse function. Also write program to
perform addition and multiplication of two square matrices.
Write a program to implement merge sort, selection sort and insertion sort.
Using Regular Expressions, develop a Python program to
CO3 Identify a word with a sequence of one upper case letter followed by lower case letters.
b) Find all the patterns of “1(0+)1” in a given string.
CO4 Write a simple script that serves a simple HTTP Response and a simple HTML Page.
Create a menu drive Python program with a dictionary for words and their meanings. Write
functions to add a new entry (word: meaning), search for a particular word and retrieve meaning,
given meaning find words with the same meaning, remove an entry, display all words sorted
CO5 alphabetically.
The celebrity problem is the problem of finding the celebrity among n people. A celebrity is someone
who does not know anyone (including themselves) but is known by everyone. Write a Python
program to solve the celebrity problem.
Total Hours : 30 periods
 Implement Greedy and Dynamic Programming methods for problem L3
CO4
solving.
Differentiate between different techniques of sorting and searching for L3
CO5
solving problems.
TEXT BOOK:

Mark Allen Weiss- Data Structures and Algorithm Analysis in C- 2nd Edition- Pearson
1.
Education-2016.

2. Reema Thareja- Data Structures Using C- Second Edition- Oxford University Press- 2011

3. Data Structures by Forouzan

4. Data Structures using C and C++ by Langsam, Augestern, Tanenbaum.

REFERENCES:

Richard F. Gilberg- and Behrouz A. Forouzan- Data Structures - A Pseudocode Approach with C-Thomson
1.
2011.
Aho- J.E.Hopcroft and J.D.Ullman- Data Structures and Algorithms- Pearson education- Asia-
2.
2010.
 Course code Course Name Hours/week Credit Max. Marks
L T P C
71100002002 Data Structures 100
2 0 1 3
Pre-Requisite Basic programming and logic-building skills
Theory Hours Marks
External (End Semester Exam) 2 50
Internal Assesment - 50
1. Mid Semester Examination (Theory)/Continuous
Evaluation 1.5 30
Assesment (Practical)
Scheme 2. Attendance - 05
3. Assignment/Seminar/In class competition/
School Approved Certificate Course / Blended - 15
Learning
UNIT-I INTRODUCTION TO DATA STRUCTURES 06
Introduction to Data Structures and Their Types: Linear and Non-Linear Data Structures; Data Types:
Primitive and Non-Primitive; Efficient Use of Memory.
Introduction to Algorithms and Procedures: Performance Analysis and Measurement (Time and Space
Complexity of Algorithms: Average, Best, and Worst Case Analysis) Big O, Omega, and Theta notations.
UNIT-II LINEAR DATA STRUCTURES – ARRAY and STACKS 06
Array: Representation of arrays, Applications of arrays, Recursion.
Stack: Operations on Stacks, Applications of Stacks, Polish Expression, Reverse Polish Expression—Infix,
Postfix, and Prefix Conversions.
UNIT-III LINEAR DATA STRUCTURES – QUEUES and LINKED LIST 06

Queue: Representation of Queue, Applications of Queue.

Linked List: Singly Linked List, Doubly Linked List, Applications of Linked List.
UNIT-IV NON-LINEAR DATA STRUCTURES – TREES 06
Trees: Basic terminology, Binary Trees, Binary Tree Traversal (Inorder, Postorder, Preorder),
Representations of Binary Trees, Application of Trees, Decision Tree, Binary Search Tree
UNIT-V NON-LINEAR DATA STRUCTURES – GRAPHS 06
Graphs: Basic terminology and representations; Graph Traversals: Breadth First Search and Depth First
Search; Minimal Spanning Tree.
Total hours 30 periods

: At the end of the course, the students will be able to:

Bloom’s
CO’s Statements Level
Understand the classification and efficient memory use of linear and non-linear data
CO1 L2
structures.
Analyze algorithm performance using time and space complexity with Big O,
CO2 Omega, and Theta notations.
L4
 Implement and apply linear data structures like arrays and stacks, including
CO3 expression conversions.
L3
Develop proficiency in implementing and using queues and linked lists for dynamic
CO4 L6
data management.

Apply non-linear data structures such as trees and graphs, including traversal
CO5 L5
techniques and problem-solving with binary trees and minimal spanning trees.

An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul G.

1.
Sorenson Publisher: Tata McGraw Hill.
2. Data Structures using C & C++ -By Ten Baum Publisher - Prenctice-Hall International.

1. Fundamentals of Data Structures in C++, by Sartaj Sahani.

Data Structures: A Pseudo-Code Approach with C-By Gilberg & Forouzan Publisher
2.
Thomson Learning.

Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO 12

CO 1 3 1 2 3 2 1 3
CO 2 3 3 2 3 2 1 3
CO 3 3 3 2 3 2 1 3
CO 4 3 1 2 3 2 1 3
CO 5 3 3 2 3 2 1 3

List of Practicals: 30 Hours

1. To implement basic operations on arrays and understand their memory representation.
2. To implement basic operations on arrays two sum in array.
3. To implement basic operations on arrays using recursion.
4. To understand and implement recursive functions for problem-solving.
5. To implement stack data structures and apply them in expression conversion and evaluation.
6. To implement queue data structures and explore their applications.
7. To implement singly linked lists and perform basic operations on them.
8. To implement binary trees and perform different tree traversal techniques.
9. To implement binary search trees and perform insertion, deletion, and search operations.
10. To represent graphs using adjacency matrices and lists, and implement BFS and DFS traversal
algorithms.
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
71102002002 Engineering Mathematics -II 100
3 1 0 4
Pre-requisite NA
Theory Hours Marks
End Semester Examination 2-2.5 50
Internal Assessment - 50
1. Mid Semester Examination (Theory)/Continuous
Evaluation Assessment 1.5 30
Scheme (Practical)
2. Attendance - 10
3. Assignment/Seminar/Activity/ School Approved
Certificate Course/Events/Professional Societies - 10
Membership and
Participants

UNIT-I LINEAR ALGEBRA-II 9

System of linear equations, Solution by Gaussian elimination method, Row Echelon Form and
Reduced-REF forms, Eigenvalues and eigenvectors, Cayley-Hamilton theorem, LU
decomposition, Single value decomposition.
UNIT-II SEQUENCES AND SERIES 9
Sequence, Limit of a sequence, monotone and Cauchy sequences and properties of convergent
sequences, examples, Infinite series, positive series, tests for convergence and divergence,
alternating series, Power series, Taylor's series.

UNIT-III PARTIAL DIFFERENTIAL EQUATIONS 9

Introduction, Order, and degree of PDE, Classification of PDE, Equations solvable by direct
integration, Lagrange’s linear equation, Partial differential equations of second, One-
dimensional wave equations, solution of the wave equation using the method of separation of
variables, D’Alembert’s solution of the wave equation, One-dimensional heat equation,
Solution of heat equation.
UNIT-IV LAPLACE TRANSFORMS 9
Definition and Laplace transform of elementary functions. Problems on Laplace's transform of
𝑓(𝑡)
𝑒 𝑎𝑡 𝑓(𝑡), 𝑡 𝑛 𝑓(𝑡), . Laplace transforms of Periodic functions and unit-step function –
𝑡
problems. Inverse Laplace transforms definition and problems, Laplace transforms of
derivatives, solution of differential equations.
UNIT-V PROBABILITY AND STATISTICS 9
Introduction of basics of Probability, conditional probability, Bayes’ theorem, Fundamentals of
Data: Collection, Summarization, and Measures of central tendency (mean, median, and
mode), Measures of dispersion (variance, standard deviation), Skewness, Kurtosis.
Total hours 45 periods
Course Outcomes: After completion of the course, students would be able to:

COs Statements Bloom’s Level

CO1 The concept of a Rank of the matrix and applying the concept L2
to know the consistency and solving the system of linear
equations. The concept of Eigen values, Eigen vectors.
 CO2 Understand the behaviour of series and their applications. L2
CO3 To develop proficiency in solving partial differential equations L3
arising in engineering applications.
CO4 To have an insight into solving ordinary differential equations L3
by using Laplace transform techniques
CO5 Understand and apply the concept of probability and statistics. L3
TEXT BOOK/ REFERENCES:
LINEAR ALGEBRA: A GEOMETRIC APPROACH, S. KUMARESAN, PHI Learning,
1.
2001.
2. Advanced Engineering Mathematics, Reena Garg, Khanna Book Publishing Co., Delhi
3. Advanced Engineering Mathematics, Wylie and Barrett, McGraw Hill, 1995
4. Higher Engineering Mathematics, B. S. Grewal, Khanna Publications New Delhi.
Probability and statistics for Engineers and Scientists, Walpole, Myers, Myers and Ye,
5. Pearson Education,
2012
Ordinary and Partial Differential Equations, M.D. Raisinghania, S. Chand publishers.
6

MOOC REFERENCES
1. https://www.udemy.com/course/mathematical-foundation-for-machine-learning-and-ai/
2. Engineering Mathematics – I, Prof. Jitendra Kumar, IIT Kharagpur – NPTEL/SWAYAM
3. Probability and Statistics, Prof. Somesh Kumar, IIT Kharagpur – NPTEL/SWAYAM

Course Outcomes with Program Outcomes

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

CO1 3 3 2 1 - - - - - - - -

CO2 3 - - - - - -
3 2 3 - -

CO3 3 - - - - - -
3 3 2 - -

CO4 3 - - - - - -
3 3 3 - -
3 - - - - - -
3 3 2 1 -
CO5
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
71102002003 Indian Knowledge system (MOOC) 100
2 0 0 -
Pre-requisite NA
MOOC Hours Marks
Evaluation Pass/Fail Audit Course - Credit Transfer. - 100
Scheme No Internal assessment / No End Sem Exam. Certificate
of Completion and Final Quiz/Viva.
UNIT-I Introduction & The Vedic Corpus 6
Introduction to IKS, why do we need IKS, Organization of IKS, Historicity of IKS, salient aspects of IKS.
Introduction to Vedas, A synopsis of the four Vedas, Sub-classification of Vedas, Introduction to Vedāṅgas,
Prologue on Śikṣā and Vyākaraṇa, Basics of Nirukta and Chandas, Kalpa and Jyotiṣa. Distinctive Features of Vedic
Life. Introduction to Purāṇa, Purāṇic repository, Introduction to Itihāsas, Key messages in Itihāsas, Wisdom
through Nīti-śāstras, Wisdom through Subhāṣita .
UNIT-II Number Systems, Units of Measurement & Mathematics 6
Historical evidence of Number systems in India, Salient aspects of Indian Mathematics, Bhūta-Saṃkhyā system,
Kaṭapayādi system, Measurements for time, distance, and weight, Piṅgala and the binary system. Introduction to
Indian Mathematics, Unique aspects of Indian Mathematics, Indian Mathematicians and their Contributions,
Algebra, Geometry, Trigonometry, Binary mathematics and combinatorial problems in Chandaḥ Śāstra, Magic
squares.
UNIT-III Astronomy, Knowledge Framework and classifications 6
Astronomy - Introduction to Indian astronomy, Indian contributions in astronomy, The celestial coordinate system,
Elements of the Indian calendar, Notion of years and months, Pañcāṅga – The Indian calendar system, Astronomical
Instruments (Yantras), Jantar Mantar of Rājā Jai Singh Sawai.
Knowledge Framework and classifications: Indian scheme of knowledge, The knowledge triangle, Prameya – A
vaiśeṣikan approach to physical reality, Dravyas – the constituents of the physical reality, Attributes – the properties
of substances and Action – the driver of conjunction and disjunction, sāmānya, viśēṣa, samavāya, Pramāṇa – the
means of valid knowledge, Saṃśaya – ambiguities in existing knowledge, Framework for establishing valid
knowledge, Deductive or inductive logic framework, Potential fallacies in the reasoning process, Siddhānta:
established tenets in a field of study
UNIT-IV Linguistics, Health Wellness and Psychology 6

Introduction to Linguistics, Aṣṭādhyāyī, Phonetics, Word generation, Computational aspects, Mnemonics, Recursive
operations, Rule based operations, Sentence formation, Verbs and prefixes, Role of Sanskrit in natural language
processing.
Health Wellness and Psychology: Health and wellness in Indian system, Āyurveda: approach to health, Āyurveda:
definition of health, Tri-doṣas, Role of agni in health, Sapta-dhātavaḥ: seven-tissues, Psychological aspects of health,
Disease management elements, Dinacaryā: daily regimen for health & wellness, Importance of sleep, Food intake
methods and drugs, Approach to lead a healthy life, Indian approach to psychology, Basic tenets of Indian psychology,
The tri guṇa system & holistic picture of the individual, Prakrti and its evolution and nature of
individual, The Pañca-kōṣa framework, Four states of Consciousness, Consciousness studies
UNIT-V Town Planning and Architecture 6
Arthaśāstra, Vāstu-śāstra, Eight limbs of Vāstu, Town planning, Temples in India: Stone architecture, Temple
architecture in India, Iconography.

Total hours 30 Periods

Course At the end of the course, the students will be able to:
Outcome(s)
COs Statements Bloom’s Level

CO1 To understand Indian Knowledge system concepts & The Vedic Corpus. L1
To identify and apply the knowledge of Indian Number Systems, Units of L1
CO2
Measurement & Indian Mathematics
CO3 To understand Astronomy and the Knowledge Framework L2
classifications.
To adapt the learnings from Linguistics, Health Wellness and Psychology L3
CO4
for a better life.
To recognize and understand the science behind the Town Planning and L2
CO5
Architecture of Indian Temples and other monuments.
TEXT BOOK:
Mahadevan, B., Bhat Vinayak Rajat, Nagendra Pavana R.N. (2022), “Introduction to Indian Knowledge
1.
System: Concepts and Applications”, PHI Learning Private Ltd. Delhi.
REFERENCES:
2. Pride of India: A Glimpse into India’s Scientific Heritage, Samskrita Bharati, New Delhi.
3. Sampad and Vijay (2011). “The Wonder that is Sanskrit”, Sri Aurobindo Society, Puducherry.

4. Acarya, P.K. (1996). Indian Architecture, Munshiram Manoharlal Publishers, New Delhi.

5. Banerjea, P. (1916). Public Administration in Ancient India, Macmillan, London.

Kapoor Kapil, Singh Avadhesh (2021). “Indian Knowledge Systems Vol – I & II”, Indian Institute of
6.
Advanced Study, Shimla, H.P.
MOOC
Indian Knowledge System (IKS) : Concepts and Applications in Science
By Prof. B. Mahadevan, Dr. Vinayak Rajat Bhat, Dr. R Venkata Raghavan | Indian Institute of Management
1.
Bangalore (IIMB), Chanakya University, Bangalore
https://onlinecourses.swayam2.ac.in/imb24_mg21/preview
Indian Knowledge System(IKS): Concepts and Applications in Engineering
2. By Prof. B. Mahadevan, Dr. Vinayak Rajat Bhat, Dr. R Venkata Raghavan | Indian Institute of Management
Bangalore (IIMB), Chanakya University, Bangalore
https://onlinecourses.swayam2.ac.in/imb23_mg53/preview
Indian Knowledge System (IKS) : Humanities and Social Sciences
3. By Prof. B. Mahadevan, Dr. Vinayak Rajat Bhat, Dr. R Venkata Raghavan | Indian Institute of Management
Bangalore (IIMB), Chanakya University, Bangalore
https://onlinecourses.swayam2.ac.in/imb24_mg22/preview
Course Outcomes with Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO 12

CO 1 1 1 - - - 1 - - 1 2 1 1

CO 2 1 1 - - - 1 - - 1 2 1 1

CO 3 2 2 - - - 3 - - 1 2 1 1

CO 4 3 - - - - 3 - - 1 2 1 1

CO 5 1 - - - - 2 - - 1 2 1 1
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
71100002001 Engineering Design and Workshop Practice 100
2 0 1 3
Simulation
Pre-Requisite NA
Theory Hours Marks
End Semester Examination + Final Project 2-2.5 50
Internal Assessment - 50
Evaluation 1. Mid Semester Examination (Practical)/Continuous Assessment
1.5 30
Scheme (Practical)/ Project Presentation
2. Attendance - 10
3. Assignment/Seminar/Activity/ School Approved Certificate
- 10
Course/Events/Professional Societies Membership and Participants
UNIT-I PROJECTION OF POINTS, LINES, PROJECTION OF PLAIN SURFACES & 6
ORTHOGRAPHIC PROJECTION USING SOLIDWORKS SOFTWARE

Introduction to Solidworks Software, Principle Plane of Projection, Orthographic Projection-First angle and Third angle
projection, Basic Engineering Drawing Reading methodology, Draw orthographic projection of Simple & Complex
objects using Solidworks Software

UNIT-II 2D SKETCH DESIGN USING SOLIDWORKS SOFTWARE 6

Interfaces of Solidwroks Software, Creating Different type of 2D Drawing using Sketch Commands - Line, Circle, Arc,
Rectangle, Slot, Polygon, Fillet, Chamfer, Offset, Mirror, Trim, Extend, Linear pattern, Circular pattern, Move, Copy in
Solidworks Software.

6
UNIT-III 3D SOLID MODEL DESIGN USING SOLIDWORKS SOFTWARE

Creating Basic & Advanced 3D Models using Feature Commands Extrude feature, Contours, Revolve Features, Swept
Features, Reference geometry, Curves, Fillet, Inserting Hole, Chamfer, Rib, 3D Patterns, Draft, mirror.

3D ASSEMBLY AND DETAIL DIMENTIONING DRAWING SHEET USING 6

UNIT-IV
SOLIDWORKS SOFTWARE
Introduction to 3D Assembly Modeling & Approaches – Top down and Bottom-up Approach, Creating Assembly
Applying Standard Mates- Coincident, Parallel, Perpendicular, Tangent, Concentric, Lock, Distance, Angle. Applying
Advanced Mates.
Generating Drawing sheet Using Generating Model View, Projected Views, Inserting Standard 3 View. View creation
relative to model, Drawing properties, Creating Dimensions – Annotations, Inserting Annotations, Bill Of Materials,
Sheets And Templates, Sheet Formatting in Solidworks Software.

UNIT-V ADDITIVE MANUFACTURING -3D PRINTING AND SLICING SOFTWARE 6

Introduction To Additive Manufacturing - 3D Printing, Additive Process VS Conventional Process, Introduction Of 3D

Printing & Types Of 3D Printer, Introduction to Slicing & ‘CURA’ Slicing Software, Introduction of Various Printing
Methodology, Various Printing Settings, Introduction of Processor, Input filament, Bed Leveling, Adhesion, Basic Part
Printing – 1, Basic Part Printing – 2 on 3D Printing Machine.
 Total hours 30

Course Outcomes: At the end of the course, the students will be able to:
COs Statements Bloom’s
Level
Sketch Diagrams with proper Dimensions on Drawings. L4
CO1
Familiar with Office Practice and Engineering Graphic Standards. L2
CO2
Exposure to Solid Modelling & Assembly.
CO3 L4

CO4 Perform Complex Modeling & also Various Advanced Assemblies in Solidworks L3

CO5 Apply Additive Manufacturing Process & also able to Create & Print Parts with 3D Printing. L6

S.NO LIST OF PRACTICAL

EXPERIMENT
1. Learning Engineering Drawing Reading and Understanding
2. Different Types of 2D Sketch Making In Solidworks
3. 2D Sketch and 3D Model Design of Simple and Complex Parts
4. 2D Sketch and 3D Model Design of Card and Pen Holder
5. 2D Sketch and 3D Model Design of Different parts of Drone
6. 3D Model Designs of Machine Parts
7. 3D Assembly (Wheel Support Assembly, Fixture Assembly, Plummer Block Assembly)
8. 3D Assembly (Pneumatic Motor, Drone and Any vehicle like Tractor, Cycle, JCB)
9. In Detail Manufacturing Drawing sheets of Machine Parts
10. In Detail Manufacturing Drawing sheets of wheel Support Assembly

11. Design and Working Simulation of Different Linkage Mechanism

12. Design and Working Simulation of Robot And Gripper Assembly

13. Design and Working Simulation of Marble Game, Belt Conveyor

14. Solidworks Designing of any Live Working Part Modeling & 3D Printing

15. Wheel Support Assembly, Linkage Mechanism 3D Printing

Total hours: 30 periods
SOFTWARE SOLIDWORKS, CURA

REFERENCES 1. N.D. Bhatt, Engineering Drawing, 53rd ed., Charotar Publishing House Pvt. Ltd., 2019.
2. R.K. Dhawan, A Textbook of Engineering Drawing, S. Chand Publishing, 2019.
3. James D. Bethune, Engineering Graphics with AutoCAD, 9th ed., Pearson Education, 2020.
4. Randy H. Shih, SolidWorks Basics: A Project-Based Approach, SDC Publications, 2022.
5. David Planchard, Engineering Design with SOLIDWORKS 2022, SDC Publications, 2022.
6. Matt Lombard, Mastering SolidWorks, 2nd ed., Wiley, 2018.
7. Ian Gibson, David W. Rosen, and Brent Stucker, Additive Manufacturing Technologies: 3D
Printing, Rapid Prototyping, and Direct Digital Manufacturing, 2nd ed., Springer, 2015.
8. T.S. Srivatsan and T.S. Sudarshan, Introduction to Additive Manufacturing, CRC Press, 2020.
Course Outcomes with Program Outcomes

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

CO 1 3 3 1 2 1 - - 1 - 1 - 1

CO 2 3 3 3 3 2 - 1 2 1 2 1 1

CO 3 3 3 3 2 3 1 2 2 2 2 - 2

CO 4 3 3 3 2 3 1 2 2 2 2 - 2

CO 5 3 3 3 3 3 2 2 1 2 1 2 2
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
71102005001 Cyber Law and Ethics 100
1 0 1 2
1. Ethics and Moral Philosophy
Pre-Requisite 2. Intellectual Property (IP) and Data Privacy
3. Legal Foundations
Theory Hours Marks
Evaluation External (End Semester Exam) 2.0-2.5 50
Scheme Internal (1) Assignment/Seminar/Project/Certification + Quiz-25
1.5 50
Marks / (2) Attendance -5 Marks)
1. Understanding Legal Frameworks to familiarize students with the legal principles,
regulations, and frameworks that govern cyberspace and digital technologies.
2. Exploring Ethical Issues to examine ethical dilemmas and considerations arising from
the use of technology, digital communications, and data handling practices.
3. Analyzing Cybersecurity Challenges to analyze cybersecurity threats, vulnerabilities, and
measures within the context of legal and ethical frameworks.
Objective(s)
4. Examining Digital Rights to explore issues related to digital rights, freedom of expression
online, censorship, surveillance, and the balance between security and privacy in
cyberspace.
5. Applying Legal and Ethical Principles to develop skills in applying legal and ethical
principles to real-world scenarios involving digital technologies, data breaches,
intellectual property disputes, and regulatory compliance.
UNIT-I Introduction to Cyber Law Evolution of Computer Technology 3
1.1. Emergence of cyberspace,
1.2. Cyber Jurisprudence, Jurisprudence and law,
1.3. Doctrinal approach, Consensual approach, Real Approach,
1.4. Cyber Ethics, Cyber Jurisdiction,
1.5. Hierarchy of courts, Civil and criminal jurisdictions,
1.6. Cyberspace-Web space, Web hosting, and web Development agreement,
1.7. Legal and Technological Significance of domain Names,
1.8. Internet as a tool for global access.
UNIT-II Information technology Act 3

2.1. Overview of IT Act, 2000,

2.2. Amendments and Limitations of IT Act,
2.3. Digital Signatures,
2.4. Cryptographic Algorithm, Public Cryptography, Private Cryptography,
2.5. Electronic Governance,
2.6. Legal Recognition of Electronic Records,
2.7. Legal Recognition of Digital Signature Certifying Authorities,
2.8. Cyber Crime and Offences,
2.9. Network Service Providers Liability,
2.10. Cyber Regulations Appellate Tribunal,
2.11. Penalties and Adjudication.
UNIT-III Cyber law and related Legislation 3
3.1. Patent Law, Trademark Law, Copyright,
3.2. Software – Copyright or Patented,
3.3. Domain Names and Copyright disputes,
3.4. Electronic Data Base and its Protection,
3.5. IT Act and Civil Procedure Code,
3.6. IT Act and Criminal Procedural Code.
UNIT-IV Relevant Sections Act and Procedures 3
4.1. Relevant Sections of Indian Evidence Act,
4.2. Relevant Sections of Bankers Book Evidence Act,
4.3. Relevant Sections of Indian Penal Code,
4.4. Relevant Sections of the Reserve Bank of India Act,
4.5. Law Relating To Employees And the Internet,
4.6. Alternative Dispute Resolution,
4.7. Online Dispute Resolution (ODR).
UNIT-V Case Study On Cyber Crimes 3
5.1. Harassment Via E-Mails,
5.2. Email Spoofing,
5.3. Cyber Pornography (Ex. MMS),
5.4. Cyber-Stalking,
5.5. Introduction: Digital Personal Data Protection Act.
Total hours 15 periods

At the end of the course, the students will be able to:

CO1: Knowledge of Legal Frameworks to understand and articulate the foundational legal
principles, regulations, and frameworks that govern cyberspace, including laws related to
data privacy, intellectual property, cybersecurity, e-commerce, and telecommunications.
CO2: Ethical Reasoning and Analysis to apply ethical theories and principles to analyze and
evaluate ethical dilemmas and considerations arising from technology use, digital
communications, data handling practices, and policy decisions in cyberspace.
CO3: Cybersecurity Awareness to identify cybersecurity threats, vulnerabilities, and best
Outcome(s)
practices for protecting digital assets and information in compliance with legal and ethical
standards.
CO4: Global Perspective to understand the international dimensions of cyberspace, including
the impact of international laws, treaties, and agreements on digital activities, data transfers,
jurisdictional issues, and cross-border legal implications
CO5: Lifelong Learning and Adaptability to demonstrate the ability to engage in lifelong
learning and adapt to evolving legal, ethical, and technological developments in
cyberspace.
TEXT BOOK:
1. "Cyber Law: Maximizing Safety and Minimizing Risk in Classrooms" by Stephen D. Hughes
2. "Ethical and Social Issues in the Information Age" by Joseph Migga Kizza
3. "Cyberlaw: The Law of the Internet and Information Technology" by Brian Craig
4. "Law, Ethics and Cybersecurity" by George Dimitriou
REFERENCES:
1. "Cyber Law in India" by Rohas Nagpal
 2. "Understanding Cyber Ethics in a Digital Age" edited by Terry Borchers

S.NO LIST OF EXPERIMENTS

Case Study: Yahoo Data Breaches (2013-2014): Millions of user accounts were compromised due to
11. security vulnerabilities. This case explores issues of data protection, user privacy, and corporate
accountability in cyberspace.
Case Study: The Social Network Dilemma (2020 Documentary): This documentary raises ethical
12. concerns surrounding user data collection, manipulation, and the impact of social media on privacy and
society.
Web Hosting Agreement Analysis: Review a real-world web hosting agreement and identify key clauses
13.
related to liability, content restrictions, and dispute resolution.
Digital Signature Demonstration: Demonstrate the process of creating and verifying digital signatures to
14.
illustrate their role in ensuring authenticity and integrity of electronic documents.
Case Study: Netflix vs. Plc. Red Chillies Entertainment (2019): This copyright infringement case explores
15. the application of copyright law in the digital space, particularly regarding online streaming platforms
and copyrighted content.
Case Study: Satyam Computer Services Accounting Scandal (2009): This case investigates the interplay
16. of IT Act with criminal law in cyber fraud and financial crimes involving electronic records and databases.

Case Study: The Colonial Pipeline Ransomware Attack (2021): This case highlights the growing threat
17. of ransomware attacks on critical infrastructure and the ethical considerations surrounding ransom
payments and data security.
Case Study: Cambridge Analytica Data Scandal (2018): This case showcases the misuse of personal data
18. on social media platforms for political campaigning, raising ethical concerns about user privacy and data
manipulation.
Case Study: The Rise of Deepfakes and Artificial Intelligence (AI): This ongoing case explores the legal
19. and ethical challenges posed by deepfakes, which can be used to create realistic but manipulated videos,
potentially impacting individual reputations and national security.
Case Study: The Regulation of Cryptocurrencies: Explore the ongoing debate surrounding cryptocurrency
20. regulation, focusing on issues like money laundering, consumer protection, and the need for a legal
framework for this Emerging technology.
Total hours: 30 Periods
 Course Syllabus

School Unitedworld Institute of Technology (UIT) Programme Code B. Tech

Programme B. Tech Branch B. Tech

Sem: I Year of Admission/Batch: 2024-25

Course code Course Name Hours/week Credit Max. Marks

Psychology L T P C 100

2 0 0 2

Objective(s) 1. Provide an overview of fundamental concepts in Psychology.

2. To describe the branches/Sub-fields of Psychology.
3. To describe various types of personality and Intelligence.
4. Serve as a foundation for the study of Psychology to understand human behaviour

Course This course introduces Psychology as a subject to students. Class lectures will cover the topics:
Description Areas/Sub-fields of Psychology, Personality, Intelligence Attention, Perception, Emotions,
Emotional Intelligence, Social Behaviour, Advertising & Consumer Behaviour and Application of
Psychology in various domain.

UNIT-I Introduction of Psychology 7

Meaning, Nature and Definitions of Psychology

Sub-fields of Psychology (Clinical, Counseling, Industrial, Educational, Experimental,
Neuropsychology, Developmental Psychology).
A Brief Introduction to Personality and Intelligence

UNIT-II Attention, Perception and Emotion 7

Attention: Definition, Types, Determinants - Division of Attention, Span of Attention.

Perception: Definition, Gestalt Principles and Perceptual constancies.
Illusion: Concept, Nature and Types
Emotion: Definition, Emotional Intelligence: Importance and Assessment.

UNIT-III Motivation, Memory and Forgetting 8

Motivation: Definition, Motivation Cycle, Types

Motivation and work: Maslow Need Hierarchy Theory, Herzberg Two-factor Theory, McClelland’s Theory)
Memory: Definitions and Types of Memory
Forgetting and Improving Memory
 UNIT-IV Social Behaviour, Application and Utility of Psychology 8

Social Behaviour; Stereotypes, Prejudice & Discrimination.

Advertising & Consumer Behaviour
Application and Utility of Psychology in Industry, Education, Medical, Law, Sports, Architecture and Design

Total hours 30

Outcome(s) At the end of the course, the students will be able to:
1. Learn the important concepts in Psychology.
2. Explain Psychology as Science and Arts.
3. Understand the various domains of Psychology.
4. Understand the social Behaviour in different settings.
5. Understand the application of Psychology into Social Science.

SCHEME OF EVALUATION

Pre-Requisite NA
Theory Marks
Evaluation External (End Semester Exam) 50
Scheme Internal (1) Midterm + Assignment/Presentation + Quiz – 45 Marks / (2)
50
Attendance -5 Marks)

TEXT BOOK

Baron, R. & Misra, G. (2013). Psychology. New Delhi: Pearson.

Ciccarelli, S. K., & Meyer, G. E. (2010). Psychology: South Asian Edition. New Delhi: Pearson
Education
Morgan, C. T. (2007). A Brief Introduction to Psychology. New Delhi. Tata McGraw- Hill
Morgan. C., King, R., Weiz J., Schopler, J. (2011). Introduction to Psychology. Tata McGraw hill.
Nelson, Quick. ORGB Student Version. Cenage Learning Solutions.
Sharma (2013). Organizational Behavior. New Delhi. Tata McGraw- Hill

REFERENCES:

Mitterer, J. & Coon, D. (2015). Introduction to Psychology: Gateways to Mind and Behavior. Belmont:
Wadsworth Publishing Co Inc.
Eysenck, M. W. (2004). Psychology: An International Perspective. New York:
Psychology Press.
 Max.
Course code Course Name Hours/week Credit
Marks
L T P C
UC011020001 Applied AI For UIT 100
1 - 1 2
Prerequisite Basics of python programming
Practical Hours Marks
Evaluation External (Jury) 2.5 50
Scheme Internal (1) Midterm + Assignment/Seminar /Activity/ Quiz-25 Marks
1.5 50
/ (2) Attendance -5 Marks)
UNIT-I ADVANCED MACHINE LEARNING AND DEEP LEARNING [CO1] 9

● Deep Learning Techniques:

Architectures like Convolutional Neural Networks (CNNs), Recurrent Neural Networks (RNNs), and Transformers.
Applications: Image recognition, time-series analysis, and language modelling.
● Optimization Strategies:
Advanced gradient descent techniques (Adam, RMSProp) and regularization methods (Dropout, L2 Regularization).
Hyperparameter tuning using Grid Search, Random Search, and AutoML.
UNIT-II GENERATIVE AI (GENAI)[CO2] 9

● Generative Models:
Introduction to Generative Adversarial Networks (GANs) and Variational Autoencoders (VAEs). Applications: Image
generation, data augmentation, and style transfer.

UNIT-III DOMAIN SPECIFIC APPLICATIONS OF AI [CO3] 9

● Natural Language Processing (NLP):

Key tasks like text classification, sentiment analysis, and machine translation. Tools: Hugging
Face Transformers, NLTK, spaCy.
● Computer Vision (CV):
Techniques for object detection (YOLO, SSD) and image segmentation (U-Net). Applications:
Medical imaging, autonomous driving, and surveillance.
● Industry Use Cases:
○ Healthcare: Disease diagnosis and drug discovery.
○ Finance: Risk modeling and algorithmic trading.
○ Retail: Customer segmentation and recommendation systems.

UNIT-IV AI DEPLOYMENT AND SCALABILITY[CO4] 9

● Model Deployment:
Building and deploying AI applications with Flask, FastAPI, or Streamlit. Basics of creating
REST APIs for AI services.
● Scalable AI in the Cloud:
Using cloud platforms like AWS, Google Cloud, and Azure for model hosting. Practical
exercises: Deploying models using AWS SageMaker or GCP Vertex AI.
 ● Edge AI:
Deploying lightweight models on edge devices using TensorFlow Lite or NVIDIA Jetson. Applications: Real-time
inference in IoT systems.

UNIT-V AI PROJECTS AND INTEGRATION[CO5] 9

● Project-Based Learning:
Students choose a real-world problem and develop an AI solution end-to-end.
○ Example projects: Chatbot development, fraud detection, or predictive maintenance.
● Integration and Optimization:
Combining multiple AI techniques for complex applications (e.g., Chatbot for recommendation, time series,
multimodal AI).
Optimizing models for latency and scalability.
● Final Deliverables:
○ A functioning AI application with a user interface.
○ Documentation covering problem definition, approach, results, and future scope.
○ Live demonstration and peer review.

Total hours 45 periods

Course Outcomes: At the end of the course, the students will be able to:

COs Statements Bloom’s Level

CO1 Understand the advanced deep learning architectures and optimisation strategies L2
CO2 Apply generative models for tasks like image generation and style transfer. L3
CO3 Implement domain-specific AI solutions using NLP and computer vision tools. L3
CO4 Deploy scalable AI models on cloud and edge platforms for real-world tasks. L4
CO5 Integrate and optimize multiple AI techniques for comprehensive applications. L5
TEXT BOOK:
1. Ian Goodfellow, Yoshua Bengio, and Aaron Courville, Deep Learning, MIT Press, 2016.
2. Francois Chollet, Deep Learning with Python, 2nd Edition, Manning Publications, 2021.
REFERENCES:
Aurélien Géron, Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow, 2nd Edition, O'Reilly
3.
Media, 2019.
Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The Elements of Statistical Learning, 2nd Edition,
4.
Springer, 2009.