Dept.

of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

MADANAPALLE INSTITUTE OF TECHNOLOGY & SCIENCE

MADANAPALLE
(UGC-AUTONOMOUS)
www.mits.ac.in

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

(ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)
Course Structure
&
Detailed Syllabi
For the students admitted to

B. Tech. Regular Four Year Degree Programme during the Academic Year 2023-24
and

B. Tech. Lateral Entry Scheme during the Academic Year 2024-25

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

(ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)
1|Page
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

MADANAPALLE INSTITUTE OF TECHNOLOGY & SCIENCE,

MADANAPALLE

B. Tech Four Year Curriculum Structure

Branch: COMPUTER SCIENCE & ENGINEERING
(ARTIFICIAL INTELLIGENCE & MACHINE LEARNING)

Total
160 Credits for 2023(Regular) & 120 Credits 2024(Lateral Entry) Admitted Batch onwards
Credits

I. Induction Program and Holistic Development Activities

Title Duration
Sl.No

Induction Program Three weeks’ duration at the

1
(Mandatory) start of First Year

2|Page
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

R23 - Curriculum Structure

I Year I Semester
S. Course Hours Per Week
Category Course Title Credits
No. Code L T P Total
1 HSC 23ENG101 Communicative English 2 0 0 2 2
2 BS&H 23MAT101 Linear Algebra and Calculus 3 0 0 3 3
3 BS&H 23CHE102 Chemistry 3 0 0 3 3
Basic Civil and Mechanical
4 ESC 23CME101 3 0 0 3 3
Engineering
5 ESC 23CSE101 Introduction to Programming 3 0 0 3 3
Communicative English
6 HSC 23ENG201 0 0 2 2 1
Laboratory
7 BSC 23CHE202 Chemistry Laboratory 0 0 2 2 1
Computer Programming
8 ESC 23CSE201 0 0 3 3 1.5
Laboratory
9 ESC 23ME201 Engineering Workshop 0 0 3 3 1.5
Health and Wellness, Yoga
10 HSMC 23HUM201 - - 1 1 0.5
and Sports
Total 14 0 11 25 19.5

I Year II Semester
S. Course Hours Per Week
Category Course Title Credits
No. Code L T P Total
Differential Equations and
1 BS&H 23MAT102 3 0 0 3 3
Vector Calculus
2 BS&H 23PHY101 Engineering Physics 3 0 0 3 3
Basic Electrical and Electronics
3 ESC 23EEE101 3 0 0 3 3
Engineering
4 ESC 23ME101 Engineering Graphics 1 0 4 5 3
5 PCC 23CSE102 Data Structures 3 0 0 3 3
Engineering Physics
6 BS&H 23PHY201 0 0 2 2 1
Laboratory
Electrical and Electronics
7 ESC 23EEE201 0 0 3 3 1.5
Engineering Workshop
8 ESC 23CSE202 IT Workshop 0 0 2 2 1

9 PCC 23CSE203 Data Structures Laboratory 0 0 3 3 1.5

NSS / NCC / Scouts and

10 HSMC 23HUM202 - - 1 1 0.5
Guides / Community Service
Total 13 0 15 28 20.5
(L = Lecture, T = Tutorial, P = Practical, C = Credit
3|Page
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

R23 - Curriculum Structure

II Year I Semester
S. Course Hours Per Week
Category Course Title Credits
No. Code L T P Total
1 HSMC 23HUM101 Universal Human Values 2 1 0 3 3
Economics and Financial
2 HSMC 23HUM102 2 0 0 2 2
Accounting For Engineers
Probability and Statistics for
3 BSC 23MAT107 3 0 0 3 3
Computer Science
Digital Logic and Computer
4 ESC 23CSM103 3 0 0 3 3
Organization
5 PCC 23CSM101 Python Programming 3 0 0 3 3
6 PCC 23CSM102 Database Management Systems 3 0 0 3 3
Python Programming
7 PCC 23CSM201 0 0 3 3 1.5
Laboratory
Database Management Systems
8 PCC 23CSM202 0 0 3 3 1.5
Laboratory
9 SEC 23CSM601 JAVA Programming 1 0 2 3 2
Total 17 1 8 26 22

II Year II Semester
S. Hours Per Week
Category Course Code Course Title Credits
No. L T P Total
1 BSC 23MAT108 Discrete Mathematical Structures r 0 0 3 3
Design Thinking and Innovation
2 ESC Related Courses 1 0 2 3 2
(Refer ANNEXURE - II)
3 PCC 23CSM104 Machine Learning 2 1 0 3 3
Principles of Artificial
4 PCC 23CSM105 2 1 0 3 3
Intelligence
Advanced Data Structures and
5 PCC 23CSM106 2 1 0 3 3
Algorithms Analysis
Artificial Intelligence and
6 PCC 23CSM203 0 0 3 3 1.5
Machine Learning Laboratory
Advanced Data Structures and
7 PCC 23CSM204 0 0 3 3 1.5
Algorithms Analysis Laboratory
8 SEC 23CSM602 Full Stack Development - I 1 0 2 3 2

9 AUC 23CHE901 Environmental Science 2 0 0 2 -

Total 13 3 10 26 19
(L = Lecture, T = Tutorial, P = Practical, C = Credit

4|Page
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

ANNEXURE - I

THREE WEEK MANDATORY INDUCTION PROGRAMME

 Yoga and Meditation

 Sports and Games
 NSS
 NCC
 MITS Social Responsibility Club
 Management module
 Design Thinking
 Spoken and Written Communication

 Proficiency modules

 Basic Computer Proficiency

 Interpersonal skills
 Computer Graphics
 Web programming
 Mobile Apps
 Vocabulary enhancement

HOLISTIC DEVELOPMENT ACTIVITIES

Description of Activities
1. Physical and Health
2. Culture
3. Literature and Media
4. Social Service
5. Self-Development
6. Nature and Environment
7. Innovation

5|Page
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

ANNEXURE - II

DESIGN THINKING AND INNOVATION RELATED COURSES

(To be offered under MOOC’s Category from SWAYAM – NPTEL)

Sl. No. Course Code Course Title

1 23IIC5M01 Design, Technology and Innovation

2 23IIC5M02 Introduction on Intellectual Properties to Engineers and

Technologists
3 23IIC5M03 Product Engineering and Design Thinking

4 23IIC5M04 Intellectual Property Rights and Competition Law

5 23IIC5M05 Innovation, Business Model and Entrepreneurship

6 23IIC5M06 Understanding Incubation and Entrepreneurship

Any new Innovation and Incubation Course offered by SWAYAM NPTEL can be appended in
future.

6|Page
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

I Year I Semester

7|Page
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23ENG101 COMMUNICATIVE ENGLISH
L T P C
2 0 0 2
Pre-requisite: None

Course Objectives:
The main objective of introducing this course, Communicative English, is to facilitate effective
listening, Reading, Speaking and Writing skills among the students. It enhances the same in their
comprehending abilities, oral presentations, reporting useful information and providing knowledge of
grammatical structures and vocabulary. This course helps the students to make them effective in
speaking and writing skills and to make them industry ready.
UNIT I Lesson: HUMAN VALUES: Gift of Magi (Short Story) 9 hours

Listening: Identifying the topic, the context and specific pieces of information by
listeningto short audio texts and answering a series of questions.
Speaking: Asking and answering general questions on familiar topics such as
home,family, work, studies and interests; introducing oneself and others.
Reading: Skimming to get the main idea of a text; scanning to look for specific pieces
ofinformation.
Writing: Mechanics of Writing-Capitalization, Spellings, Punctuation-Parts of Sentences.
Grammar: Parts of Speech, Basic Sentence Structures-forming questions
Vocabulary: Synonyms, Antonyms, Affixes (Prefixes/Suffixes), Root words.

UNIT II Lesson: NATURE: The Brook by Alfred Tennyson (Poem) 9 hours

Listening: Answering a series of questions about main ideas and supporting ideas
afterlistening to audio texts.
Speaking: Discussion in pairs/small groups on specific topics followed by short
structuretalks.
Reading: Identifying sequence of ideas; recognizing verbal techniques that help to
linkthe ideas in a paragraph together.
Writing: Structure of a paragraph - Paragraph writing (specific topics)
Grammar: Cohesive devices - linkers, use of articles and zero article; prepositions.
Vocabulary: Homonyms, Homophones, Homographs.

UNIT III Lesson: BIOGRAPHY: Elon Musk 9 hours

Listening: Listening for global comprehension and summarizing what is listened to.
Speaking: Discussing specific topics in pairs or small groups and reporting
what

isdiscussed
Reading: Readinga text in detail by making basic inferences -recognizing and
interpretingspecific context clues; strategies to use text clues for
comprehension.
Writing: Summarizing, Note-making, paraphrasing
Grammar: Verbs - tenses; subject-verb agreement; Compound words, Collocations
Vocabulary: Compound words, Collocations
8|Page
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

UNIT IV Lesson: INSPIRATION: The Toys of Peace by Saki 9 hours

Listening: Making predictions while listening to conversations/ transactional dialogues
without video; listening with video.
Speaking: Role plays for practice of conversational English in academic contexts (formal
and informal) - asking for and giving information/directions.
Reading: Studying the use of graphic elements in texts to convey information, reveal
trends/patterns/relationships, communicate processes or display complicated
data.
Writing: Letter Writing: Official Letters, Resumes
Grammar: Reporting verbs, Direct & Indirect speech, Active & Passive Voice
Vocabulary: Words often confused, Jargons

UNIT V Lesson: MOTIVATION: The Power of Intrapersonal 9 hours

Communication (An Essay)
Listening: Identifying key terms, understanding concepts and answering a series of
relevant questions that test comprehension.
Speaking: Formal oral presentations on topics from academic contexts
Reading: Reading comprehension.
Writing: Writing structured essays on specific topics.
Grammar: Editing short texts –identifying and correcting common errors in grammar
andusage (articles, prepositions, tenses, subject verb agreement)
Vocabulary: Technical Jargons

Course Outcomes:
CO1: Understand the topic, context, and pieces of specific information from personal , professional
and social situations
CO2: Apply discourse markers to speak clearly in formal discussions
CO3: Analyze and apply grammatical structures to formulate contextualized phrases and sentences
CO4: Analyze texts and images to write summaries based on global comprehension
CO5: Draft coherent paragraphs and structured essays

Text Books:
1. Pathfinder: Communicative English for Undergraduate Students, 1st Edition, Orient Black Swan,
2023 (Units 1,2 & 3)
2. Empowering with Language by Cengage Publications, 2023 (Units 4 & 5)

Reference Books:
1. Dubey, Sham Ji & Co. English for Engineers, Vikas Publishers, 2020
2. Bailey, Stephen. Academic writing: A Handbook for International Students. Routledge, 2014.
3. Murphy, Raymond. English Grammar in Use, Fourth Edition, Cambridge University Press, 2019.
4. Lewis, Norman. Word Power Made Easy- The Complete Handbook for Building a Superior
Vocabulary. Anchor, 2014.

9|Page
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Web Resources

Grammer
1 www.bbc.co.uk/learningenglish
2 https://dictionary.cambridge.org/grammar/british-grammar/
3 www.eslpod.com/index.html
4 https://www.learngrammar.net/
5 https://english4today.com/english-grammar-online-with-quizzes/

VOCABULARY
1 https://www.youtube.com/c/DailyVideoVocabulary/videos
2 https://www.youtube.com/channel/UC4cmBAit8i_NJZE8qK8sfpA

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

10 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23MAT101 LINEAR ALGEBRA AND CALCULUS
L T P C
3 0 0 3

Course Objectives:
To equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various real-world
problems and their applications.
UNIT I MATRICES 9 hours
Rank of a matrix by echelon form, normal form. Cauchy–Binet formulae (without proof). Inverse of
non-singular matrices by Gauss-Jordan method, System of linear equations: Solving system of
Homogeneous and Non-Homogeneous equations by Gauss elimination method, Jacobi and Gauss
Seidel Iteration Methods.

UNIT II EIGENVALUES, EIGENVECTORS AND ORTHOGONAL 9 hours

TRANSFORMATION
Eigenvalues, Eigenvectors and their properties, Diagonalization of a matrix, Cayley-Hamilton Theorem (without
proof), finding inverse and power of a matrix by Cayley-Hamilton Theorem,Quadratic forms and Nature of the
Quadratic Forms, Reduction of Quadratic form to canonicalforms by Orthogonal Transformation.
UNIT III CALCULUS 9 hours
Mean Value Theorems: Rolle’s Theorem, Lagrange’s mean value theorem with their geometrical
interpretation, Cauchy’s mean value theorem, Taylor’s and Maclaurin theorems with remainders
(without proof), Problems and applications on the above theorems.

UNIT IV PARTIAL DIFFERENTIATION AND APPLICATIONS 9 hours

(MULTI VARIABLE CALCULUS)
Functions of several variables: Continuity and Differentiability, Partial derivatives, total derivatives, chain rule,
Taylor’s and Maclaurin’s series expansion of functions of two variables. Jacobians, Functional dependence,
maxima and minima of functionsof two variables, method of Lagrange multipliers.

UNIT V MULTIPLE INTEGRALS (MULTI VARIABLE CALCULUS) 9 hours

Double integrals, triple integrals, change of order of integration, change of variables to polar,
cylindrical and spherical coordinates. Finding areas (by double integrals) and volumes (by double
integrals and triple integrals).
Course Outcomes:
At the end of the course, the student will be able to
CO1: Solve the system of linear equations and apply the matrix algebra techniques in practical
applications.
CO2: Utilize the Eigenvalues, Eigenvectors and applications of diagonalization in the field of Science
and Technology.
CO3: Relate the results of mean value theorems in real life problems.
CO4: Apply the functions of several variables to evaluate the rates of change with respect to time and
space variables in engineering.
CO5: Compute the area and volume by interlinking them to appropriate double and triple integrals.

11 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Higher Engineering Mathematics, B. S. Grewal, Khanna Publishers, 2017, 44th Edition

2. Advanced Engineering Mathematics, Erwin Kreyszig, John Wiley & Sons, 2018, 10th Edition.

Reference Books:

1. Thomas Calculus, George B. Thomas, Maurice D. Weir and Joel Hass, Pearson Publishers, 2018,
14th Edition.
2. Advanced Engineering Mathematics, R. K. Jain and S. R. K. Iyengar, AlphaScience International
Ltd., 2021 5th Edition(9th reprint).
3. Advanced Modern Engineering Mathematics, Glyn James, Pearson publishers, 2018, 5thEdition.
4. Advanced Engineering Mathematics, Micheael Greenberg, Pearson publishers, 9thedition
5. Higher Engineering Mathematics, H. K Das, Er. Rajnish Verma, S. Chand Publications, 2014,
Third Edition (Reprint 2021)

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

12 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23CHE102 CHEMISTRY
L T P C
3 0 0 3
Course Objectives:
 To familiarize engineering chemistry and its applications
 To train the students on the principles and applications of electrochemistry and
polymers
 To introduce instrumental methods, molecular machines and switches.
UNIT I STRUCTURE AND BONDING MODELS 9 hours
Fundamentals of Quantum mechanics, Schrodinger Wave equation, significance of Ψ and Ψ2, particle
in one dimensional box, molecular orbital theory – bonding in homo- and heteronuclear diatomic
molecules – energy level diagrams of N2, O2 and NO, CO π-molecular orbitals of butadiene and
benzene, calculation of bond order.

UNIT II MODERN ENGINEERING MATERIALS 9 hours

Semiconductors – Introduction, basic concept, role of doping agents, applications
Super conductors -Introduction, basic concept, applications.
Supercapacitors: Introduction, Basic Concept-Classification – Applications.
Nano materials: Introduction, classification, properties and applications of Fullerenes,
carbon nano tubes and Graphene nanoparticles.

UNIT III ELECTROCHEMISTRY AND APPLICATIONS 9 hours

Electrochemical cell, Nernst equation, cell potential calculations and numerical problems,
potentiometry- potentiometric titrations (redox titrations), concept of conductivity, conductivity cell,
conductometric titrations (acid-base titrations).
Electrochemical sensors – potentiometric sensors with examples, amperometric sensors with examples.
Primary cells – Zinc-air battery, Sodium-air battery, Secondary cells –lithium-ion batteries- working
of the batteries including cell reactions; Fuel cells, hydrogen-oxygen fuel cell– working of the cells.
Polymer Electrolyte Membrane Fuel cells (PEMFC).

UNIT IV POLYMER CHEMISTRY 9 hours

Introduction to polymers, functionality of monomers, chain growth and step growth polymerization,
coordination polymerization, with specific examples and mechanisms of polymer formation, Poly
Dispersity Index (PDI) & it’s significance
Plastics –Thermo and Thermosetting plastics, Preparation, properties and applications of – PVC,
Teflon, Bakelite, Nylon-6,6, carbon fibres.
Elastomers–Buna-S, Buna-N–preparation, properties and applications.
Conducting polymers – polyacetylene, polyaniline, – mechanism of conduction and applications.
Bio-Degradable polymers - Poly Glycolic Acid (PGA), Poly Lactic Acid (PLA).

UNIT V INSTRUMENTAL METHODS AND APPLICATIONS 9 hours

Electromagnetic spectrum. Absorption of radiation: Beer-Lambert’s law. UV-Visible Spectroscopy,
electronic transition, Instrumentation, IR spectroscopy, fundamental modes and selection rules,
Instrumentation. Chromatography-Basic Principle, Classification-HPLC: Principle, Instrumentation
and Applications.

13 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
At the end of the course, the students will be able to:
CO1: Explain the foundations of Quantum mechanics and concept of bonding in homo and hetero
diatomic molecules like O2, CO etc.
CO2: Apply the principle of Band diagrams in the application of conductors and semiconductors.
Properties and applications of nanomaterials.
CO3: Compare the materials of construction for battery, its working principles, fuel cells &
electrochemical sensors.
CO4: Explain the preparation, properties, and applications of thermoplastics & thermosetting &
elastomers conducting polymers.
CO5: Explain the principles of spectrometry, technique of HPLC in separation of solid and liquid
mixtures. Summarize the concepts of Instrumental methods.

Text Books:
1. Jain and Jain, Engineering Chemistry, 16/e, DhanpatRai, 2013.

2. Peter Atkins, Julio de Paula and James Keeler, Atkins’ Physical Chemistry, 10/e,Oxford
University Press, 2010.
3. G V Subba Reddy, K N Jayaveera, C Ramachandraiah, Engineering Chemistry, McGraw-Hill;
First Edition, 2019.
Reference Books:
1. Skoog and West, Principles of Instrumental Analysis, 6/e, Thomson, 2007.
2. J.D. Lee, Concise Inorganic Chemistry, 5th Edition, Wiley Publications, Feb.2008
3. Textbook of Polymer Science, Fred W. Billmayer Jr, 3rd Edition

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

14 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23CME101 BASIC CIVIL AND MECHANICAL ENGINEERING
L T P C
3 0 0 3

Course Objectives:
 Get familiarized with the scope and importance of Civil Engineering sub-divisions.
 Introduce the preliminary concepts of surveying.
 Acquire preliminary knowledge on Transportation and its importance in nation’s
economy.
 Get familiarized with the importance of quality, conveyance and storage of water.
 Introduction to basic civil engineering materials and construction techniques.
PART A: BASIC CIVIL ENGINEERING
UNIT I BASICS OF CIVIL ENGINEERING 8 hours

Role of Civil Engineers in Society- Various Disciplines of Civil Engineering- Structural Engineering-
Geo-technical Engineering- Transportation Engineering - Hydraulics and Water Resources
Engineering - Environmental Engineering-Scope of each discipline - Building Construction and
Planning- Construction Materials-Cement - Aggregate - Bricks- Cement concrete- Steel. Introduction
to Prefabricated construction Techniques.

UNIT II SURVEYING 8 hours

Objectives of Surveying- Horizontal Measurements- Angular Measurements- Introduction to Bearings Levelling
instruments used for levelling -Simple problems on levelling and bearings-Contour mapping.

UNIT III TRANSPORTATION ENGINEERING 8 hours

Importance of Transportation in Nation's economic development- Types of Highway Pavements-
Flexible Pavements and Rigid Pavements - Simple Differences. Basics of Harbour, Tunnel, Airport,
and Railway Engineering.
Water Resources and Environmental Engineering: Introduction, Sources of water- Quality of water-
Specifications- Introduction to Hydrology–Rainwater Harvesting-Water Storage and Conveyance
Structures (Simple introduction to Dams and Reservoirs).

Course Outcomes:

CO1: Identify various sub-divisions of Civil Engineering and to appreciate their role in ensuring better
society.
CO2: Measure of distances, angles and levels through surveying.
CO3: Identify various transportation infrastructures, sources of water and various water conveyance,
storage structures like dams and reservoirs.

15 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Basic Civil Engineering, M.S.Palanisamy, , Tata Mcgraw Hill publications (India) Pvt. Ltd. Fourth
Edition.
2. Introduction to Civil Engineering, S.S. Bhavikatti, New Age International Publishers.2022. First
Edition.
3. Basic Civil Engineering, Satheesh Gopi, Pearson Publications, 2009, First Edition.

Reference Books:
1. Surveying, Vol- I and Vol-II, S.K. Duggal, Tata McGraw Hill Publishers 2019. FifthEdition.
2. Hydrology and Water Resources Engineering, Santosh Kumar Garg, Khanna Publishers, Delhi.
2016
3. Irrigation Engineering and Hydraulic Structures - Santosh Kumar Garg, KhannaPublishers, Delhi
2023. 38th Edition.
4. Highway Engineering, S.K.Khanna, C.E.G. Justo and Veeraraghavan, Nemchand and Brothers
Publications 2019. 10th Edition.
5. Indian Standard DRINKING WATER — SPECIFICATION IS 10500-2012.

PART B: BASIC MECHANICAL ENGINEERING

Course Objectives:
The students after completing the course are expected to
 Get familiarized with the scope and importance of Mechanical Engineering in different
sectors and industries.
 Explain different engineering materials and different manufacturing processes.
 Provide an overview of different thermal and mechanical transmission systems and
introduce basics of robotics and its applications.

UNIT I 8 hours
Introduction to Mechanical Engineering: Role of Mechanical Engineering in Industries and Society-
Technologies in different sectors such as Energy, Manufacturing, Automotive, Aerospace, and Marine
sectors.
Engineering Materials - Metals-Ferrous and Non-ferrous, Ceramics, Composites, Smart
materials.

UNIT II 8 hours
Manufacturing Processes: Principles of Casting, Forming, joining processes, Machining,
Introduction to CNC machines, 3D printing, and Smart manufacturing.
Thermal Engineering – working principle of Boilers, Otto cycle, Diesel cycle, Refrigeration and air-
conditioning cycles, IC engines, 2-Stroke and 4-Stroke engines, SI/CI Engines, Components of Electric
and Hybrid Vehicles.

UNIT III 8 hours

Power plants – working principle of Steam, Diesel, Hydro, Nuclear power plants. Mechanical Power
Transmission - Belt Drives, Chain, Rope drives, Gear Drives and their applications.
Introduction to Robotics - Joints & links, configurations, and applications of robotics.

16 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

(Note: The subject covers only the basic principles of Civil and Mechanical Engineering systems. The
evaluation shall be intended to test only the fundamentals of the subject)

Course Outcomes:
On completion of the course, the student should be able to
CO1: Understand the role and importance of mechanical engineering and engineering materials
CO2: Identify the different manufacturing processes for engineering applications and explain the basics
of thermal engineering and its applications.
CO3: Explain the working of different mechanical power transmission systems, power plants and
robotics.

Text Books:
1. Internal Combustion Engines by V.Ganesan, By Tata McGraw Hill publications (India)Pvt. Ltd.

2. A Tear book of Theory of Machines by S.S. Rattan, Tata McGraw Hill Publications,(India) Pvt.
Ltd.
3. An introduction to Mechanical Engg by Jonathan Wicker and Kemper Lewis, Cengage learning
India Pvt. Ltd.
Reference Books:
1. Appuu Kuttan KK, Robotics, I.K. International Publishing House Pvt. Ltd. Volume-I
2. 3D printing & Additive Manufacturing Technology- L. Jyothish Kumar, Pulak MPandey,
Springer publications
3. Thermal Engineering by Mahesh M Rathore Tata McGraw Hill publications (India) Pvt.Ltd.
4. G. Shanmugam and M.S.Palanisamy, Basic Civil and the Mechanical Engineering, TataMcGraw
Hill publications (India) Pvt. Ltd.

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

17 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23CSE101 INTRODUCTION TO PROGRAMMING
L T P C
3 0 0 3

Course Objectives:
 Comprehensive knowledge to computer systems, programming languages, and problem-solving
techniques.
 Know the concept of control structures and their usage in programming.
 Introduce to the arrays, memory models, and basic string concepts
 Gain a knowledge from the concept of functions, including declaration, definition, and various
aspects of function usage.
 Acquire the advanced programming concepts, including user-defined data types, pointers, and
file handling.

UNIT I INTRODUCTION TO PROGRAMMING AND PROBLEM 9 hours

SOLVING
History of Computers, Basic organization of a computer: ALU, input-output units, memory, program
counter, Introduction to Programming Languages, Basics of a Computer Program- Algorithms,
flowcharts (Using Dia Tool), pseudo code. Introduction to Compilation and Execution, Primitive Data
Types, Variables, and Constants, Basic Input and Output, Operations, Type Conversion, and Casting.
Problem solving techniques: Algorithmic approach, characteristics of algorithm, Problem solving
strategies: Top-down approach, Bottom-up approach, Time and space complexities of algorithms.

UNIT II CONTROL STRUCTURES 9 hours

Simple sequential programs Conditional Statements (if, if-else, switch), Loops (for, while, do- while) Break and
Continue.

UNIT III ARRAYS AND STRINGS 9 hours

Arrays indexing, memory model, programs with array of integers, two dimensional arrays,
Introduction to Strings, String Operations and String functions.

UNIT IV POINTERS & USER DEFINED DATA TYPES 9 hours

Pointers, dereferencing and address operators, pointer and address arithmetic, array manipulation using
pointers, User-defined data types-Structures and Unions, Dynamic memory allocation.

UNIT V FUNCTIONS & FILE HANDLING 9 hours

Introduction to Functions, Function Declaration and Definition, Function call Return Types and
Arguments, modifying parameters inside functions using pointers, arrays as parameters. Scope and
Lifetime of Variables, Basics of File Handling

18 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Note: The syllabus is designed with C Language as the fundamental language of

implementation.

Course Outcomes:
A student after completion of the course will be able to
CO1: Illustrate the basic computer concepts and programming principles of C language.
CO2: Develop programs using various control structures in ‘C’.
CO3: Design applications using arrays and basic string manipulation.
CO4: Demonstrate the applications of pointers, user-defined types and dynamic memory allocation.
CO5: Design various applications using functions and file concepts.

Text Books:
1. C Programming, A Problem Solving Approach, Forouzan, Gilberg,Prasad, CENGAGE,
3rd edition.
Reference Books:
1. Computing fundamentals and C Programming, Balagurusamy, E., McGraw-HillEducation, 2008.
2. Programming in C, Rema Theraja, Oxford, 2016, 2nd edition
3. "The C Programming Language", Brian W. Kernighan and Dennis M. Ritchie, Prentice-Hall, 1988
4. Schaum’s Outline of Programming with C, Byron S Gottfried, McGraw-Hill Education,1996

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

19 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23ENG201 COMMUNICATIVE ENGLISH LABORATORY
L T P C
0 0 2 1

Course Objectives:
The main objective of introducing this course, Communicative English Laboratory, is to expose the
students to a variety of self-instructional, learner friendly modes of language learning. The students
will get trained in basic communication skills and also make them ready to face job interviews.

List of Topics:
1. Vowels & Consonants
2. Neutralization/Accent Rules
3. Communication Skills & JAM
4. Role Play or Conversational Practice
5. E-mail Writing
6. Resume Writing, Cover letter, SOP
7. Group Discussions-methods & practice
8. Debates - Methods & Practice
9. PPT Presentations/ Poster Presentation
10. Interviews Skills

Course Outcomes:
CO1: Understand the English speech sounds, stress, rhythm, intonation and syllabic division for better
listening and speaking
CO2: Apply communication strategies and implement them in language learning activities.
CO3: Analyze and enhance job-relevant writing skills
CO4: Evaluate and exhibit professionalism in debates and group discussions.
CO5: Make effective presentations by developing public speaking abilities

Suggested Software:
1. Walden Infotech
2. Young India Films

Reference Books:
1. Raman Meenakshi, Sangeeta-Sharma. Technical Communication. Oxford Press.2018.
2. Taylor Grant: English Conversation Practice, Tata McGraw-Hill Education India,2016
3. Hewing’s, Martin. Cambridge Academic English (B2). CUP, 2012.
4. J. Sethi & P.V. Dhamija. A Course in Phonetics and Spoken English, (2nd Ed),Kindle, 2013

20 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Web Resources:
Spoken English:
1. www.esl-lab.com
2. www.englishmedialab.com
3. www.englishinteractive.net
4. https://www.britishcouncil.in/english/online
5. http://www.letstalkpodcast.com/
6. https://www.youtube.com/c/mmmEnglish_Emma/featured
7. https://www.youtube.com/c/ArnelsEverydayEnglish/featured
8. https://www.youtube.com/c/engvidAdam/featured
9. https://www.youtube.com/c/EnglishClass101/featured
10.https://www.youtube.com/c/SpeakEnglishWithTiffani/playlists
11.https://www.youtube.com/channel/UCV1h_cBE0Drdx19qkTM0WNw

Voice & Accent:

1. https://www.youtube.com/user/letstalkaccent/videos
2. https://www.youtube.com/c/EngLanguageClub/featured
3. https://www.youtube.com/channel/UC_OskgZBoS4dAnVUgJVexc
4. https://www.youtube.com/channel/UCNfm92h83W2i2ijc5Xwp_IA

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

21 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23CHE202 CHEMISTRY LABORATORY
L T P C
0 0 2 1
Course Objectives:
 Verify the fundamental concepts with experiments.

List of Experiments:

1. Measurement of 10Dq by spectrophotometric method

2. Conductometric titration of strong acid vs. strong base
3. Conductometric titration of weak acid vs. strong base
4. Determination of cell constant and conductance of solutions
5. Potentiometry - determination of redox potentials and emfs
6. Determination of Strength of an acid in Pb-Acid battery
7. Preparation of a Bakelite
8. Verify Lambert-Beer’s law
9. Wavelength measurement of sample through UV-Visible Spectroscopy
10. Identification of functional groups in simple organic compounds by IR
11. Preparation of nanomaterials by precipitation method
12. Estimation of Ferrous Iron by Dichrometry
Course Outcomes:
At the end of the course, the students will be able to
CO1: Determine the cell constant and conductance of solutions.
CO2: Prepare advanced polymer Bakelite materials.
CO3: Measure the strength of an acid present in secondary batteries.
CO4: Measure the wavelength of absorption of some organic compounds using UV-Vis spectroscopy.
CO5: Determine the EMF & redox potentials using potentiometric titrations.

Reference Books:
1. Vogel's Quantitative Chemical Analysis 6th Edition 6th Edition" Pearson Publications by J.
Mendham, R.C.Denney, J.D.Barnes and B. Sivasankar

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

22 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23CSE201 COMPUTER PROGRAMMING LABORATORY
L T P C
0 0 3 1.5

Course Objectives:
 Provide hands-on experience in programming fundamentals, algorithm design, and basic problem-
solving techniques.
 Enable students to implement control structures for program flow control in practical scenarios.
 Reinforce understanding of arrays, memory models, and string manipulation through practical
exercises
 Provide hands-on practice with functions, function calls, and parameter manipulation using
pointers.
 Offer practical exposure to advanced programming concepts, including user-defined data types,
file handling, and pointer operations.

UNIT I

WEEK 1
Objective: Getting familiar with the programming environment on the computer and
writingthe first program.

Suggested Experiments/Activities:
Tutorial 1: Problem-solving using Computers.
Lab1: Familiarization with programming environment
i) Basic Linux environment and its editors like Vi, Vim & Emacs etc.
ii) Exposure to Turbo C, gcc
iii) Writing simple programs using printf(), scanf()

WEEK 2
Objective: Getting familiar with how to formally describe a solution to a problem in a
seriesof finite steps both using textual notation and graphic notation.

Suggested Experiments /Activities:

Tutorial 2: Problem-solving using Algorithms and Flow charts.
Lab 1: Converting algorithms/flow charts into C Source code.
Developing the algorithms/flowcharts for the following sample programs
i) Sum and average of 3 numbers
ii) Conversion of Fahrenheit to Celsius and vice versa
iii) Simple interest calculation

WEEK 3
Objective: Learn how to define variables with the desired data-type, initialize them with
appropriate values and how arithmetic operators can be used with variables and constants.

23 | P a g e
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Suggested Experiments/Activities:
Tutorial 3: Variable types and type conversions:

Lab 3: Simple computational problems using arithmetic expressions.

Problems to Practice:
i) Finding the square root of a given number
ii) Finding compound interest
iii) Area of a triangle using heron’s formulae
iv) Distance travelled by an object

UNIT II

WEEK 4
Objective: Explore the full scope of expressions, type-compatibility of variables &
constantsand operators used in the expression and how operator precedence works.

Suggested Experiments/Activities:

Tutorial4: Operators and the precedence and as associativity:

Lab4: Write C program to solve Simple computational problems using the operator’ precedence
and associativity
Problems to Practice:
i) Evaluate the following expressions.
a. A+B*C+(D*E) + F*G
b. A/B*C-B+A*D/3
c. A+++B---A
d. J= (i++) + (++i)
ii) Find the maximum of three numbers using conditional operator
iii) Take marks of 5 subjects in integers, and find the total, average in float

WEEK 5
Objective: Explore the full scope of different variants of “if construct” namely if-else, null-
else, if-else if*-else, switch and nested-if including in what scenario each one of them can
be used and how to use them. Explore all relational and logical operators while writing
conditionals for “if construct”.

Suggested Experiments/Activities:
Tutorial 5: Branching and logical expressions:
Lab 5: Write C program for Problems involving if-then-else structures.
Problems to Practice:
i) Write a C program to find the max and min of four numbers using if-else.
ii) Write a C program to generate electricity bill.
iii) Find the roots of the quadratic equation.
iv) Write a C program to simulate a calculator using switch case.
v) Write a C program to find the given year is a leap year or not.

24 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

WEEK 6
Objective: Explore the full scope of iterative constructs namely while loop, do-while loop and
for loop in addition to structured jump constructs like break and continue including when
eachof these statements is more appropriate to use.

Suggested Experiments/Activities:
Tutorial 6: Loops, while and for loops
Lab 6: Write a C program for Iterative problems e.g., the sum of series
Problems to Practice:
i) Find the factorial of given number using any loop.
ii) Find the given number is a prime or not.
iii) Compute sine and cos series
iv) Checking a number palindrome
v) Construct a pyramid of numbers.

UNIT III

WEEK 7:
Objective: Explore the full scope of Arrays construct namely defining and initializing 1-D
and 2-D and more generically n-D arrays and referencing individual array elements from
the defined array. Using integer 1-D arrays, explore search solution linear search.

Suggested Experiments/Activities:
Tutorial 7: 1 D Arrays: searching.
Lab 7:Write a C program to solve 1D Array manipulation, linear search
Problems to Practice:
i) Find the min and max of a 1-D integer array.
ii) Perform linear search on1D array.
iii) The reverse of a 1D integer array
iv) Find 2’s complement of the given binary number.
v) Eliminate duplicate elements in an array.

WEEK 8:
Objective: Explore the difference between other arrays and character arrays that can be
usedas Strings by using null character and get comfortable with string by doing experiments
that will reverse a string and concatenate two strings. Explore sorting solution bubble sort
using integer arrays.

Suggested Experiments/Activities:
Tutorial 8: 2 D arrays, sorting and Strings.
Lab 8: Write a C program to solve Matrix problems, String operations, Bubble sort
Problems to Practice:
i) Addition of two matrices
ii) Multiplication two matrices
iii) Sort array elements using bubble sort
iv) Concatenate two strings without built-in functions
v) Reverse a string using built-in and without built-in string functions

25 | P a g e
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

UNIT IV

WEEK 9:
Objective: Explore pointers to manage a dynamic array of integers, including memory
allocation & value initialization, resizing changing and reordering the contents of an
array and memory de-allocation using malloc (), calloc (), realloc () and free ()
functions. Gainexperience processing command-line arguments received by C

Suggested Experiments/Activities:
Tutorial 9: Pointers, structures and dynamic memory allocation
Lab 9: Write a C program for Pointers and structures, memory dereference.
Problems to Practice:
i) Write a C program to find the sum of a 1D array using malloc()
ii) Write a C program to find the total, average of n students using structures
iii) Enter n students data using calloc() and display failed students list
iv) Read student name and marks from the command line and display the student details
alongwith the total.
v) Write a C program to implement realloc()

WEEK 10:
Objective: Experiment with C Structures, Unions, bit fields and self-referential
structures(Singly linked lists) and nested structures

Suggested Experiments/Activities:
Tutorial 10: Bitfields, Self-Referential Structures, Linked lists
Lab10 : Bitfields, linked lists
Read and print a date using dd/mm/yyyy format using bit-fields and differentiate the
samewithout using bit- fields
i) Create and display a singly linked list using self-referential structure.
ii) Demonstrate the differences between structures and unions using a C program.
iii) Write a C program to shift/rotate using bitfields.
iv) Write a C program to copy one structure variable to another structure of the same type.

UNIT V

WEEK 11:
Objective: Explore the Functions, sub-routines, scope and extent of variables, doing some
experiments by parameter passing using call by value. Basic methods of numerical integration

Suggested Experiments/Activities:
Tutorial 11: Functions, call by value, scope and extent,
Lab 11: Write a C program to solve Simple functions using call by value, solving
differential equations using Eulers theorem.
Problems to Practice:
i) Write a C function to calculate NCR value.
ii) Write a C function to find the length of a string.
26 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

iii) Write a C function to transpose of a matrix.

iv) Write a C function to demonstrate numerical integration of differential equations using
Euler’smethod

WEEK 12:
Objective: Explore how recursive solutions can be programmed by writing recursive functionsthat can be
invoked from the main by programming at-least five distinct problems that have naturally recursive solutions.
Suggested Experiments/Activities:
Tutorial 12: Recursion, the structure of recursive calls
Lab 12: Write C program for Recursive functions.
Problems to Practice:
i) Write a recursive function to generate Fibonacci series.
ii) Write a recursive function to find the lcm of two numbers.
iii) Write a recursive function to find the factorial of a number.
iv) Write a C Program to implement Ackermann function using recursion.
v) Write a recursive function to find the sum of series.

WEEK 13:
Objective: Explore the basic difference between normal and pointer variables, Arithmetic
operations using pointers and passing variables to functions using pointers

Suggested Experiments/Activities:
Tutorial 13: Call by reference, dangling pointers
Lab 13: Write a C program to solve Simple functions using Call by reference, Dangling pointers.
Problems to Practice:
i) Write a C program to swap two numbers using call by reference.
ii) Demonstrate Dangling pointer problem using a C program.
iii) Write a C program to copy one string into another using pointer.
iv) Write a C program to find no of lowercase, uppercase, digits and
othercharacters using pointers.

WEEK14:
Objective: To understand data files and file handling with various file I/O functions. Explore
thedifferences between text and binary files.

Suggested Experiments/Activities:
Tutorial 14: File handling
Lab 14: Write a C program to handle File operations.
Problems to Practice:
i) Write a C program to write and read text into a file.
ii) Write a C program to write and read text into a binary file using fread()
and fwrite()
iii) Copy the contents of one file to another file.
iv) Write a C program to merge two files into the third file using command-
linearguments.
v) Find no. of lines, words and characters in a file.
Write a C program to print last n characters of a given file.

27 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
CO1: Implement coding and debugging the simple programs, create algorithms, and practice problem
solving strategies using programming languages.
CO2: Demonstrate programs that incorporate conditional statements, loops, and break/continue
statements to control program execution.
CO3: Apply coding for real time examples with arrays, array indexing, and manipulate strings in
programming tasks.
CO4: Create, call, and debug functions, modify function parameters using pointers, and gain practical
knowledge of variable scope within functions.
CO5: Apply user-defined data types, manipulate files, pointer operations to solve real-world
programming challenges.
Textbooks:
1. Ajay Mittal, Programming in C: A practical approach, Pearson.
2. C Programming, A Problem-Solving Approach, Forouzan, Gilberg, Prasad, CENGAGE

Reference Books:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice-Hall of India
2. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw Hill

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

28 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23ME201 ENGINEERING WORKSHOP
L T P C
0 0 3 1.5

Course Objectives:
To familiarize students with wood working, sheet metal operations, fitting and electrical house wiring
skills

1. Demonstration: Safety practices and precautions to be observed in workshop.

2. Wood Working: Familiarity with different types of woods and tools used in wood
working and make following joints.
a) Half – Lap joint b) Mortise and Tenon joint c) Corner Dovetail joint or
Bridlejoint
3. Sheet Metal Working: Familiarity with different types of tools used in sheet metal
working, Developments of following sheet metal job from GI sheets.
a) Tapered tray b) Conical funnel c) Elbow pipe d) Brazing
4. Fitting: Familiarity with different types of tools used in fitting and do the following
fitting exercises.
a) V-fit b) Dovetail fit c) Semi-circular fit d) Bicycle tire
punctureand change of two-wheeler tyre
5. Electrical Wiring: Familiarity with different types of basic electrical circuits and make
the following connections.
a) Parallel and series b) Two-way switch c) Godown lighting
d) Tube light e) Three phase motor f) Soldering of wires
6. Foundry Trade: Demonstration and practice on Moulding tools and processes,
Preparation of Green Sand Moulds for given Patterns.
7. Welding Shop: Demonstration and practice on Arc Welding and Gas welding.
Preparation of Lap joint and Butt joint.
8. Plumbing: Demonstration and practice of Plumbing tools, Preparation of Pipe joints
with coupling for same diameter and with reducer for different diameters.
Course Outcomes:
CO1: Identify workshop tools and their operational capabilities.
CO2: Practice on manufacturing of components using workshop trades including fitting,
carpentry, foundry and welding.
CO3: Apply fitting operations in various applications.
CO4: Apply basic electrical engineering knowledge for House Wiring Practice

Textbooks:
1. Basic Workshop Technology: Manufacturing Process, Felix W.; Independently Published,2019.
Workshop Processes, Practices and Materials; Bruce J. Black, Routledge publishers, 5th Edn.
2015.
2. A Course in Workshop Technology Vol I. & II, B.S. Raghuwanshi, Dhanpath Rai & Co., 2015 &
2017.

29 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Reference Books:
1. Elements of Workshop Technology, Vol. I by S. K. Hajra Choudhury & Others, MediaPromoters
and Publishers, Mumbai. 2007, 14th edition
2. Workshop Practice by H. S. Bawa, Tata-McGraw Hill, 2004.
3. Wiring Estimating, Costing and Contracting; Soni P.M. & Upadhyay P.A.; AtulPrakashan, 2021-
22.

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

30 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year I Semester

23HUM201 HEALTH AND WELLNESS, YOGA AND SPORTS
L T P C
0 0 1 0.5
Course Objectives:
The main objective of introducing this course is to make the students maintain their mental and physical
wellness by balancing emotions in their life. It mainly enhances the essential traits required for the
development of the personality.
UNIT I 5 hours

Concept of health and fitness, Nutrition and Balanced diet, basic concept of immunity Relationship
between diet and fitness, Globalization and its impact on health, Body Mass Index (BMI) of all age
groups.
Activities:
i) Organizing health awareness programmes in community
ii) Preparation of health profile
iii) Preparation of chart for balance diet for all age groups

UNIT II 5 hours
Concept of yoga, need for and importance of yoga, origin and history of yoga in Indian context,
classification of yoga, Physiological effects of Asanas- Pranayama and meditation, stress management
and yoga, Mental health and yoga practice.

Activities:
Yoga practices – Asana, Kriya, Mudra, Bandha, Dhyana, Surya Namaskar

UNIT III 5 hours

Concept of Sports and fitness, importance, fitness components, history of sports, Ancient and Modern
Olympics, Asian games and Commonwealth games.
Activities:
i) Participation in one major game and one individual sport viz., Athletics, Volleyball,
Basketball, Handball, Football, Badminton, Kabaddi, Kho-kho, Table tennis, Cricket
etc.
ii) Practicing general and specific warm up, aerobics
iii) Practicing cardiorespiratory fitness, treadmill, run test, 9 min walk, skipping and
running.

Course Outcomes:
After completion of the course the student will be able to
CO1: Understand the importance of yoga and sports for Physical fitness and sound health.
CO2: Demonstrate an understanding of health-related fitness components.
CO3: Compare and contrast various activities that help enhance their health.
CO4: Assess current personal fitness levels.
CO5: Develop Positive Personality

31 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Reference Books:
1. Gordon Edlin, Eric Golanty. Health and Wellness, 14th Edn. Jones & Bartlett Learning,2022
2. T.K.V.Desikachar. The Heart of Yoga: Developing a Personal Practice
3. Archie J.Bahm. Yoga Sutras of Patanjali, Jain Publishing Company, 1993
4. Wiseman, John Lofty,
5. The Sports Rules Book/ Human Kinetics with Thomas Hanlon. -- 3rd ed. HumanKinetics,
Inc.2014

General Guidelines:

1. Institutes must assign slots in the Timetable for the activities of Health/Sports/Yoga.
2. Institutes must provide field/facility and offer the minimum of five choices of as manyas
Games/Sports.
3. Institutes are required to provide sports instructor / yoga teacher to mentor the students.

Evaluation Guidelines:
 Evaluated for a total of 100 marks.
 A student can select 6 activities of his/her choice with a minimum of 01 activity per unit. Each
activity shall be evaluated by the concerned teacher for 15 marks, totalling to 90 marks.
 A student shall be evaluated by the concerned teacher for 10 marks by conducting viva voce on the
subject.

32 | P a g e
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

I Year II Semester

33 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23MAT102 DIFFERENTIAL EQUATIONS AND VECTOR CALCULUS
L T P C
3 0 0 3

Course Objectives:
 To enlighten the learners in the concept of differential equations and multivariable calculus.
 To furnish the learners with basic concepts and techniques at plus two level to lead them into
advanced level by handling various real-world applications.

UNIT I DIFFERENTIAL EQUATIONS OF FIRST ORDER AND 9 hours

FIRST DEGREE
Linear differential equations – Bernoulli’s equations- Exact equations and equations reducible to exact
form. Applications: Newton’s Law of cooling – Law of natural growth and decay- Electrical circuits.

UNIT II LINEAR DIFFERENTIAL EQUATIONS OF HIGHER ORDER 9 hours

(CONSTANT COEFFICIENTS)
Definitions, homogenous and non-homogenous, complimentary function, general solution, particular integral,
Wronskian, Method of variation of parameters. Simultaneous linear equations, Applications to L-C-R Circuit
problems and Simple Harmonic motion.

UNIT III PARTIAL DIFFERENTIAL EQUATIONS 9 hours

Introduction and formation of Partial Differential Equations by elimination of arbitrary constants and
arbitrary functions, solutions of first order linear equations using Lagrange’s method. Homogeneous
Linear Partial differential equations with constant coefficients.

UNIT IV VECTOR DIFFERENTIATION 9 hours

Scalar and vector point functions, vector operator Del, Del applies to scalar point functions- Gradient,
Directional derivative, del applied to vector point functions-Divergence and Curl, vector identities.

UNIT V VECTOR INTEGRATION 9 hours

Line Integral-circulation-work done, surface integral-flux, Green’s theorem in the plane (without
proof), Stoke’s theorem (without proof), volume integral, Divergence theorem (without proof) and
related problems.
Course Outcomes:
At the end of the course, the student will be able to
CO1: Find the solution of engineering problems formulated in the form of linear first order differential
equations.
CO2: Solve the linear higher order differential equations related to various engineering fields.
CO3: Determine the solutions for linear partial differential equations that model the physical processes.
CO4: Interpret the physical meaning of different operators such as gradient, curl and divergence.
CO5: Estimate the work done against field, circulation and flux using vector calculus.

34 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Higher Engineering Mathematics, B. S. Grewal, Khanna Publishers, 2017, 44th Edition
2. Advanced Engineering Mathematics, Erwin Kreyszig, John Wiley & Sons, 2018, 10thEdition.

Reference Books:

1. Thomas Calculus, George B. Thomas, Maurice D. Weir and Joel Hass, PearsonPublishers, 2018,
14th Edition.
2. Advanced Engineering Mathematics, Dennis G. Zill and Warren S. Wright, Jones andBartlett,
2018.
3. Advanced Modern Engineering Mathematics, Glyn James, Pearson publishers, 2018,5th Edition.
4. Advanced Engineering Mathematics, R. K. Jain and S. R. K. Iyengar, Alpha ScienceInternational
Ltd., 2021 5th Edition (9th reprint).
5. Higher Engineering Mathematics, B. V. Ramana, , McGraw Hill Education, 2017

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

35 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23PHY101 ENGINEERING PHYSICS
L T P C
3 0 0 3
Course Objectives:
To bridge the gap between the Physics in school at 10+2 level and UG level engineering courses by
identifying the importance of the optical phenomenon like interference, diffraction etc, enlightening
the periodic arrangement of atoms in crystalline solids and concepts of quantum mechanics, introduce
novel concepts of dielectric and magnetic materials, physics of semiconductors.

UNIT I WAVE OPTICS 9 hours

Interference: Introduction - Principle of superposition –Interference of light - Interference in thin films
(Reflection Geometry) & applications - Colours in thin films- Newton’s Rings, Determination of
wavelength and refractive index.
Diffraction: Introduction - Fresnel and Fraunhofer diffractions - Fraunhofer diffraction due to single
slit, double slit & N-slits (Qualitative) – Diffraction Grating - Dispersive power and resolving power of
Grating (Qualitative). Polarization: Introduction -Types of polarization - Polarization by reflection,
refraction and Double refraction - Nicol’s Prism -Half wave and Quarter wave plates.

UNIT II CRYSTALLOGRAPHY AND X-RAY DIFFRACTION 9 hours

Crystallography: Space lattice, Basis, Unit Cell and lattice parameters – Bravais Lattices – crystal systems (3D)
– coordination number - packing fraction of SC, BCC & FCC - Miller indices – separation between successive
(hkl) planes.
X-ray diffraction: Bragg’s law - X-ray Diffractometer – crystal structure determination by Laue’s and powder
methods

UNIT III QUANTUM MECHANICS AND FREE ELECTRON THEORY 9 hours

Quantum Mechanics: Dual nature of matter – Heisenberg’s Uncertainty Principle – Significance and
properties of wave function – Schrodinger’s time independent and dependent wave equations–
Particle in a one-dimensional infinite potential well.
Free Electron Theory: Classical free electron theory (Qualitative with discussion of merits and
demerits) – Quantum free electron theory – electrical conductivity based on quantum free electron
theory - Fermi-Dirac distribution - Density of states - Fermi energy

UNIT IV SEMICONDUCTORS 9 hours

Semiconductors: Formation of energy bands – classification of crystalline solids - Intrinsic
semiconductors: Density of charge carriers – Electrical conductivity – Fermi level – Extrinsic
semiconductors: density of charge carriers – dependence of Fermi energy on carrier concentration and
temperature - Drift and diffusion currents – Einstein’s equation – Hall effect and its applications.

UNIT V DIELECTRIC AND MAGNETIC MATERIALS 9 hours

Dielectric Materials: Introduction - Dielectric polarization - Dielectric polarizability, Susceptibility,
Dielectric constant and Displacement Vector – Relation between the electric vectors - Types of
polarizations- Electronic (Quantitative), Ionic (Quantitative) and Orientation polarizations
(Qualitative) - Lorentz internal field - Clausius- Mossotti equation - complex dielectric constant –
Frequency dependence of polarization – dielectric loss
Magnetic Materials: Introduction - Magnetic dipole moment - Magnetization-Magnetic susceptibility
36 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

and permeability – Atomic origin of magnetism - Classification of magnetic materials: Dia, para, Ferro,
anti-ferro & Ferri magnetic materials - Domain concept for Ferromagnetism & Domain walls
(Qualitative) - Hysteresis - soft and hard magnetic materials.
Course Outcomes:
CO1: Apply the knowledge of Interference, Diffraction and Polarization techniques for materials testing
and explore their applications in both science and technology.
CO2: Explain the crystal structure in terms of atomic positions, unit cells, and crystal symmetry and
also relate the crystal symmetry to the symmetry observed in a diffraction pattern.
CO3: Evaluate the Schrodinger wave equations for simple potentials and explain the concept of
conductivity of different types of materials.
CO4: Distinguish the semiconductors using Fermi level and identify the type of semiconductors using
Hall effect.
CO5: Explain the origin of fundamental magnetic phenomena and types of magnetic materials.
Understand the induced fields in dielectrics, and electrical behaviour of dielectrics.

Text Books:
1. A Text book of Engineering Physics, M. N. Avadhanulu, P.G.Kshirsagar & TVS ArunMurthy, S.
Chand Publications, 11th Edition 2019.
2. Engineering Physics - D.K.Bhattacharya and Poonam Tandon, Oxford press (2015)

Reference Books:
1. Engineering Physics - B.K. Pandey and S. Chaturvedi, Cengage Learning 2021.
2. Engineering Physics - Shatendra Sharma, Jyotsna Sharma, Pearson Education, 2018.
3. Engineering Physics” - Sanjay D. Jain, D. Sahasrabudhe and Girish, University Press.2010
4. Engineering Physics - M.R. Srinivasan, New Age international publishers (2009).
Web Resources: https://www.loc.gov/rr/scitech/selected-internet/physics.html

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

37 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23EEE101 BASIC ELECTRICAL AND ELECTRONICS ENGINEERING
L T P C
3 0 0 3
Course Objectives:
 To expose to the field of electrical & electronics engineering, laws and principles of electrical/
electronic engineering and to acquire fundamental knowledge in the relevant field.

PART A: BASIC ELECTRICAL ENGINEERING

UNIT I DC & AC CIRCUITS 8 hours

DC Circuits: Electrical circuit elements (R, L and C), Ohm’s Law and its limitations, KCL & KVL,
series, parallel, series-parallel circuits, Super Position theorem, Simple numerical problems.
AC Circuits: A.C. Fundamentals: Equation of AC Voltage and current, waveform, time period,
frequency, amplitude, phase, phase difference, average value, RMS value, form factor, peak factor,
Voltage and current relationship with phasor diagrams in R, L, and C circuits, Concept of Impedance,
Active power, reactive power and apparent power, Concept of power factor (Simple Numerical
problems).

UNIT II MACHINES AND MEASURING INSTRUMENTS 8 hours

Machines: Construction, principle and operation of (i) DC Motor, (ii) DC Generator, (iii) Single Phase
Transformer, (iv) Three Phase Induction Motor and (v) Alternator, Applications of electrical machines.
Measuring Instruments: Construction and working principle of Permanent Magnet Moving Coil
(PMMC), Moving Iron (MI) Instruments and Wheat Stone bridge.

UNIT III ENERGY RESOURCES, ELECTRICITY BILL & SAFETY 8 hours

MEASURES
Energy Resources: Conventional and non-conventional energy resources; Layout and operation of
various Power Generation systems: Hydel, Nuclear, Solar & Wind power generation.

Electricity bill: Power rating of household appliances including air conditioners, PCs, Laptops,Printers,
etc. Definition of “unit” used for consumption of electrical energy, two-part electricitytariff, calculation
of electricity bill for domestic consumers.
Equipment Safety Measures: Working principle of Fuse and Miniature circuit breaker(MCB), merits
and demerits. Personal safety measures: Electric Shock, Earthing and its types, Safety Precautions to
avoid shock

Course Outcomes:
After the completion of the course students will be able to
CO1: Infer the basic AC and DC electrical circuits.
CO2: Analyze construction and operation of AC and DC machines, different electrical measuring
instruments.
CO3: Illustrate operation of various power generating stations, energy consumption and electrical
safety.

38 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Basic Electrical Engineering, D. C. Kulshreshtha, Tata McGraw Hill, 2019, FirstEdition

2. Power System Engineering, P.V. Gupta, M.L. Soni, U.S. Bhatnagar and A. Chakrabarti,Dhanpat
Rai & Co, 2013
3. Fundamentals of Electrical Engineering, Rajendra Prasad, PHI publishers, 2014, ThirdEdition

Reference Books:
1. Basic Electrical Engineering, D. P. Kothari and I. J. Nagrath, Mc Graw Hill, 2019,Fourth
Edition
2. Principles of Power Systems, V.K. Mehtha, S.Chand Technical Publishers, 2020
3. Basic Electrical Engineering, T. K. Nagsarkar and M. S. Sukhija, Oxford UniversityPress, 2017
4. Basic Electrical and Electronics Engineering, S. K. Bhatacharya, Person Publications, 2018,
Second Edition.

Web Resources:
1. https://nptel.ac.in/courses/108105053
2. https://nptel.ac.in/courses/108108076

PART B: BASIC ELECTRONICS ENGINEERING

Course Objectives:
This course provides the student with the fundamental skills to understand the principles of
digital electronics, basics of semiconductor devices like diodes & transistors, characteristics
and its applications.

UNIT I SEMICONDUCTOR DEVICES 8 hours

Introduction - Evolution of electronics – Vacuum tubes to nano electronics - Characteristics of PN

Junction Diode — Zener Effect — Zener Diode and its Characteristics. Bipolar Junction Transistor -
CB, CE, CC Configurations and Characteristics — Elementary Treatment of Small Signal CE Amplifier.

UNIT II BASIC ELECTRONIC CIRCUITS AND 8 hours

INSTRUMENTTAION

Rectifiers and power supplies: Block diagram description of a dc power supply, working of a full wave
bridge rectifier, capacitor filter (no analysis), working of simple zener voltage regulator. Amplifiers:
Block diagram of Public Address system, Circuit diagram and working of common emitter (RC coupled)
amplifier with its frequency response. Electronic Instrumentation: Block diagram of an electronic
instrumentation system.
UNIT III DIGITAL ELECTRONICS 8 hours

Overview of Number Systems, Logic gates including Universal Gates, BCD codes, Excess-3 code, Gray
code, Hamming code. Boolean Algebra, Basic Theorems and properties of BooleanAlgebra, Truth Tables
and Functionality of Logic Gates – NOT, OR, AND, NOR, NAND, XOR and XNOR. Simple

39 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

combinational circuits–Half and Full Adder, Introduction to sequential circuits, Flip flops, Registers
and counters (Elementary Treatment only)

Course Outcomes:
After the completion of the course students will be able to
CO1: Explain the theory, construction, and operation of electronic devices.
CO2: Apply the concept of science and mathematics to explain the working of diodes, transistors, and
their applications.
CO3: Analyze logic gates and its applications in design of combinational circuits.

Text Books:
1. R. L. Boylestad & Louis Nashlesky, Electronic Devices & Circuit Theory, PearsonEducation,
2021.
2. R. P. Jain, Modern Digital Electronics, 4th Edition, Tata Mc Graw Hill, 2009

Reference Books:
1. R. S. Sedha, A Textbook of Electronic Devices and Circuits, S. Chand & Co, 2010.
2. Santiram Kal, Basic Electronics- Devices, Circuits and IT Fundamentals, Prentice Hall, India,
2002.
3. R. T. Paynter, Introductory Electronic Devices & Circuits – Conventional Flow Version,Pearson
Education,2009.

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

40 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23ME101 ENGINEERING GRAPHICS
L T P C
1 0 4 3

Course Objectives:
• To enable the students with various concepts like dimensioning, conventions and standards related
to Engineering Drawing.
• To impart knowledge on the projection of points, lines and plane surfaces
• To improve the visualization skills for better understanding of projection of solids
• To develop the imaginative skills of the students required to understand Section of solids and
Developments of surfaces.
• To make the students understand the viewing perception of a solid object in Isometric and
Perspective projections.
UNIT I 9 hours

Introduction: Lines, Lettering and Dimensioning, Geometrical Constructions and

Constructing regular polygons by general methods.
Curves: construction of ellipse, parabola and hyperbola by general, Cycloids, Involutes, Normal and
tangent to Curves.
Scales: Plain scales, diagonal scales and vernier scales.

UNIT II 9 hours
Orthographic Projections: Reference plane, importance of reference lines or Plane, Projections of a point situated
in any one of the four quadrants.
Projections of Straight Lines: Projections of straight lines parallel to both reference planes, perpendicular to one
reference plane and parallel to other reference plane, inclined to one reference plane and parallel to the other
reference plane. Projections of Straight Line Inclined to both the reference planes
Projections of Planes: regular planes Perpendicular to both reference planes, parallel to one reference
plane and inclined to the other reference plane; plane inclined to both the reference planes.

UNIT III 9 hours

Projections of Solids: Types of solids: Polyhedra and Solids of revolution. Projections of solids in
simple positions: Axis perpendicular to horizontal plane, Axis perpendicular to vertical plane and Axis
parallel to both the reference planes, Projection of Solids with axis inclined to one reference plane and
parallel to another plane.

UNIT IV 9 hours
Sections of Solids: Perpendicular and inclined section planes, Sectional views and True shape of section,
Sections of solids in simple position only.
Development of Surfaces: Methods of Development: Parallel line development and radial line
development. Development of a cube, prism, cylinder, pyramid and cone.

41 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

UNIT V 9 hours
Conversion of Views: Conversion of isometric views to orthographic views; Conversion of
orthographic views to isometric views.
Computer graphics: Creating 2D&3D drawings ofobjects including PCB and Transformations using
Auto CAD (Not for end examination).

Course Outcomes:
Students will use the Auto CAD software and will be able to
CO1: Construct the geometrical constructions, engineering curves and scales.
CO2: Draw the projections of points, straight lines and planes
CO3: Draw the projections of solids in various positions
CO4: Sketch the sections of solids and developments of surfaces
CO5: Draw the conversion of the isometric views to orthographic views and vice versa.

Text Books:
1. N. D. Bhatt, Engineering Drawing, Charotar Publishing House, 2016.

Reference Books:
1. Engineering Drawing, K.L. Narayana and P. Kannaiah, Tata McGraw Hill, 2013.
2. Engineering Drawing, M.B.Shah and B.C. Rana, Pearson Education Inc,2009.

3. Engineering Drawing with an Introduction to AutoCAD, Dhananjay Jolhe, TataMcGraw Hill,

2017.

Mode of Evaluation: Day-to-day Evaluation, Mid Term Tests and End Semester Examination.

42 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23CSE102 DATA STRUCTURES
L T P C
3 0 0 3
Course Objectives:
• To attain proficiency in essential knowledge and skills for effectively employing linear data
structures and making informed decisions when utilizing them to tackle real-world practical
challenges.
• To gain a comprehensive understanding of linked lists, including their different types, operations,
and practical applications.
• To explore stacks properties, operations and how stacks are utilized for the evaluation of
mathematical expressions, including infix, postfix, and prefix notations.
• To understand the concepts of queues, their operations, and their applications in areas like breadth-
first search and scheduling.
• To Provide an overview of Trees and Hashing as a technique for data organization.

UNIT I 9 hours

Introduction to Linear Data Structures: Definition and importance of linear data structures, Abstract
data types (ADTs) and their implementation, Overview of time and space complexity analysis for
linear data structures. Searching Techniques: Linear & Binary Search, Sorting Techniques: Bubble
sort, Selection sort, Insertion Sort.

UNIT II 9 hours
Linked Lists: Singly linked lists: representation and operations, doubly linked lists and circular linked lists,
Comparing arrays and linked lists, Applications of linked lists
Stacks: Introduction to stacks: properties and operations, implementing stacks using arrays and linked lists

UNIT III 9 hours

Applications of stacks in expression evaluation, backtracking, reversing list etc.
Queues: Introduction to queues: properties and operations, implementing queues using arrays and
linked lists, Applications of queues in breadth-first search, scheduling, etc.
Deques: Introduction to deques (double-ended queues), Operations on deques and their applications.

UNIT IV 9 hours
Trees: Introduction to Trees, Binary Tree, Tree Traversal, Binary Search Tree – Insertion, Deletion &
Traversal, Height Balanced Trees, Heap Tree, Heap Sort

UNIT V 9 hours
Graphs: Representations, Biconnected components, Topological sort.
Hashing: Brief introduction to hashing and hash functions, Collision resolution techniques: chaining
and open addressing, Hash tables: basic implementation and operations, Applications of hashing in
unique identifier generation, caching, etc.

43 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
At the end of the course, Student will be able to
CO1: Apply their knowledge and skills in the context of linear data structures, algorithmic analysis,
searching, and sorting, enabling them to solve practical problems.
CO2: Implement linked lists, stack and their applications.
CO3: Implement queues and its applications.
CO4: Implement tree operations for binary tree, binary search tree, height balanced trees and heap tree.
CO5: Design graph and analyse various collision resolution techniques for hashing.

Text Books:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.

2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed,

Silicon Press, 2008
Reference Books:
1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and PeterSanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E.Hopcroft

3. Problem Solving with Algorithms and Data Structures" by Brad Miller and DavidRanum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, and
Clifford Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching,and Graph
Algorithms" by Robert Sedgewick

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

44 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23PHY201 ENGINEERING PHYSICS LABORATORY
L T P C
0 0 2 1
Course Objectives:
To study the concepts of optical phenomenon like interference, diffraction etc., recognize the
importance of energy gap in the study of conductivity and Hall effect in semiconductors and study the
parameters and applications of dielectric and magnetic materials by conducting experiments.
List of Experiments:
1. Determination of radius of curvature of a given Plano-convex lens by Newton’s rings.
2. Determination of wavelengths of different spectral lines in mercury spectrum using diffraction
grating in normal incidence configuration.
3. Verification of Brewster’s law
4. Determination of dielectric constant using charging and discharging method.
5. Study the variation of B versus H by magnetizing the magnetic material (B-H curve).
6. Determination of wavelength of Laser light using diffraction grating.
7. Estimation of Planck’s constant using photoelectric effect.
8. Determination of the resistivity of semiconductors by four probe methods.
9. Determination of energy gap of a semiconductor using p-n junction diode.
10. Magnetic field along the axis of a current carrying circular coil by Stewart Gee’s
Method.
11. Determination of Hall voltage and Hall coefficient of a given semiconductor using Hall
effect.
12. Determination of temperature coefficients of a thermistor.
13. Determination of acceleration due to gravity and radius of Gyration by using a
Compound pendulum.
14. Determination of magnetic susceptibility by Kundt’s tube method.
15. Determination of rigidity modulus of the material of the given wire using Torsional
pendulum.
16. Sonometer: Verification of laws of stretched string.
17. Determination of young’s modulus for the given material of wooden scale by non-
uniform bending (or double cantilever) method.
18. Determination of Frequency of electrically maintained tuning fork by Melde’s
experiment.

Note: Any TEN of the listed experiments are to be conducted. Out of which any TWO
experiments may be conducted in virtual mode.

45 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
CO1: Know the various phenomena of light practically and gain knowledge about various optical
technique methods.
CO2: Verify the theoretical concepts of optics, magnetism and dielectrics by hands on experiment.
CO3: Apply the scientific process in the conduct of semiconductor experiments and report the
experimental findings.
CO4: Understand mechanical phenomena by instruments and apply them in real time applications.
CO5: Acquire and interpret experimental data to examine the physical laws.

Web Resources:
www.vlab.co.in
https://phet.colorado.edu/en/simulations/filter?subjects=physics&type=html,prototype

Reference Books:
1. A Textbook of Practical Physics - S. Balasubramanian, M.N. Srinivasan, S. Chand Publishers,
2017.
2. Workshop Practice by H. S. Bawa, Tata-McGraw Hill, 2004.
3. Wiring Estimating, Costing and Contracting; Soni P.M. & Upadhyay P.A.; AtulPrakashan, 2021-
22.

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

46 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23EEE201 ELECTRICAL AND ELECTRONICS ENGINEERING WORKSHOP
L T P C
0 0 3 1.5
Course Objectives:
To impart knowledge on the fundamental laws & theorems of electrical circuits, functions of electrical
machines and energy calculations.

Activities:

1. Familiarization of commonly used Electrical & Electronic Workshop Tools: Bread

board, Solder, cables, relays, switches, connectors, fuses, Cutter, plier, screwdriver
set,wire stripper, flux, knife/blade, soldering iron, de-soldering pump etc.
 Provide some exercises so that hardware tools and instruments are learned to be
usedby the students.
2. Familiarization of Measuring Instruments like Voltmeters, Ammeters, multimeter,
LCR-Q meter, Power Supplies, CRO, DSO, Function Generator, Frequency counter.
 Provide some exercises so that measuring instruments are learned to be used by
thestudents.
3. Components:
 Familiarization/Identification of components (Resistors, Capacitors, Inductors,
Diodes, transistors, IC’s etc.) – Functionality, type, size, colour coding package,
symbol, cost etc.
 Testing of components like Resistor, Capacitor, Diode, Transistor, ICs etc. - Compare
values of components like resistors, inductors, capacitors etc with the measured values by
using instruments
PART A: ELECTRICAL ENGINEERING LABORATORY
List of experiments:
1. Verification of KCL and KVL
2. Verification of Superposition theorem
3. Measurement of Resistance using Wheat stone bridge
4. Magnetization Characteristics of DC shunt Generator
5. Measurement of Power and Power factor using Single-phase wattmeter
6. Measurement of Earth Resistance using Megger
7. Calculation of Electrical Energy for Domestic Premises
Note: Minimum Six Experiments to be performed.

Course Outcomes:
At the end of the course, the student will be able to
CO1: Analyze basic DC circuits.
CO2: Understand the usage of common electrical & electronic measuring instruments.
CO3: Understand the basic characteristics of electrical machines and perform energy calculations.

47 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

PART B: ELECTRONICS ENGINEERING LABORATORY

Course Objectives:
 To impart knowledge on the principles of digital electronics and fundamentals of
electron devices & its applications.
List of Experiments:

1. Plot V-I characteristics of PN Junction diode A) Forward bias B) Reverse bias.

2. Plot V – I characteristics of Zener Diode and its application as voltage Regulator.
3. Implementation of half wave and full wave rectifier.
4. Plot Input & Output characteristics of BJT in CE and CB configurations
5. Frequency response of CE amplifier.
6. Simulation of RC coupled amplifier with the design supplied
7. Verification of Truth Table of AND, OR, NOT, NAND, NOR, Ex-OR, Ex-NOR gatesusing ICs.
8. Verification of Truth Tables of S-R, J-K& D flip flops using respective ICs.

Tools / Equipment Required: DC Power supplies, Multi meters, DC Ammeters, DC

Voltmeters,AC Voltmeters, CROs, all the required active devices.
Note: Minimum Six Experiments to be performed. All the experiments shall be implemented
using Hardware / Software.
Course Outcomes:
At the end of the course, the student will be able to
CO1: Plot and discuss the characteristics of various electron devices.
CO2: Explain the operation of a digital circuit.

Reference Books:
1. R. L. Boylestad & Louis Nashlesky, Electronic Devices & Circuit Theory, PearsonEducation,
2021.
2. R. P. Jain, Modern Digital Electronics, 4th Edition, Tata Mc Graw Hill, 2009
3. R. T. Paynter, Introductory Electronic Devices & Circuits – Conventional Flow Version, Pearson
Education,2009.

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

48 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23CSE202 IT WORKSHOP
L T P C
0 0 2 1

Course Objectives:
• To introduce the internal parts of a computer, peripherals, I/O ports, connecting cables
• To demonstrate configuring the system as Dual boot both Windows and other Operating Systems
Viz. Linux, BOSSTo teach basic command line interface commands on Linux.
• To teach the usage of Internet for productivity and self-paced life-long learning
• To introduce Compression, Multimedia and Antivirus tools and Office Tools such as Word
processors, Spread sheets and Presentation tools.
PC Hardware & Software Installation
Task 1: Identify the peripherals of a computer, components in a CPU and its functions. Draw
the block diagram of the CPU along with the configuration of each peripheral and submit to
your instructor.
Task 2: Every student should disassemble and assemble the PC back to working condition.
Labinstructors should verify the work and follow it up with a Viva. Also students need to go
throughthe video which shows the process of assembling a PC. A video would be given as
part of the course content.
Task 3: Every student should individually install MS windows on the personal computer.
Labinstructor should verify the installation and follow it up with a Viva.
Task 4: Every student should install Linux on the computer. This computer should have
windows installed. The system should be configured as dual boot (VMWare) with both
Windows and Linux. Lab instructors should verify the installation and follow it up with a
Viva
Task 5: Every student should install BOSS on the computer. The system should be
configuredas dual boot (VMWare) with both Windows and BOSS. Lab instructors should
verify the installation and follow it up with a Viva
Internet & World Wide Web
Task1: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area Network
and access the Internet. In the process they configure the TCP/IP setting. Finallystudents should demonstrate, to
the instructor, how to access the websites and email. If there isno internet connectivity preparations need to be
made by the instructors to simulate the WWW on the LAN.

Task 2: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy
settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for
applets should be configured.

Task 3: Search Engines & Netiquette: Students should know what search engines are and how to use the
search engines. A few topics would be given to the students for which they need to search on Google. This
should be demonstrated to the instructors by the student.

49 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Task 4: Cyber Hygiene: Students would be exposed to the various threats on the internet and would be asked to
configure their computer to be safe on the internet. They need to customize their browsers to block pop ups,
block active x downloads to avoid viruses and/or worms.

LaTeX and WORD

Task 1 – Word Orientation: The mentor needs to give an overview of La TeX and Microsoft (MS) office or
equivalent (FOSS) tool word: Importance of La TeX and MS office or equivalent (FOSS) tool Word as word
Processors, Details of the four tasks and features that would be covered in each, Using La TeXand word –
Accessing, overview of toolbars, saving files, Using help and resources, rulers, format painter in word.

Task 2: Using La TeX and Word to create a project certificate. Features to be covered:- Formatting Fonts in
word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and Colors, Inserting Header
and Footer, Using Date and Time option in both La TeX and Word.

Task 3: Creating project abstract Features to be covered:-Formatting Styles, Inserting table, Bullets and
Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check, Track
Changes.

Task 4: Creating a Newsletter: Features to be covered:- Table of Content, Newspaper columns, Images from
files and clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes, Paragraphs and Mail Merge in
word.

EXCEL
Excel Orientation: The mentor needs to tell the importance of MS office or equivalent (FOSS) tool Excel as a
Spreadsheet tool, give the details of the four tasks and features that would be covered in each. Using Excel –
Accessing, overview of toolbars, saving excel files, Using help and resources.
Task 1: Creating a Scheduler - Features to be covered: Gridlines, Format Cells, Summation, auto fill,
Formatting Text

Task 2: Calculating GPA -. Features to be covered:- Cell Referencing, Formulae in excel – average, std.
deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function,

LOOKUP/VLOOKUP
Task 3: Split cells, freeze panes, group and outline, Sorting, Boolean and logical operators, Conditional
formatting

POWER POINT
Task 1: Students will be working on basic power point utilities and tools which help them create basic power
point presentations. PPT Orientation, Slide Layouts, Inserting Text, Word Art, Formatting Text, Bullets and
Numbering, Auto Shapes, Lines and Arrows in PowerPoint.

Task 2: Interactive presentations - Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects, Tables and
Charts.

Task 3: Master Layouts (slide, template, and notes), Types of views (basic, presentation, slide slotter, notes etc),
and Inserting – Background, textures, Design Templates, Hidden slides.

AI TOOLS – ChatGPT
Task 1: Prompt Engineering: Experiment with different types of prompts to see how the model responds. Try
asking questions, starting conversations, or even providing incomplete sentences to see how the model
completes them.

50 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

• Ex: Prompt: "You are a knowledgeable AI. Please answer the following question: What is the capital of
France?"

Task 2: Creative Writing: Use the model as a writing assistant. Provide the beginning of a story or a description
of a scene, and let the model generate the rest of the content. This can be a fun way to brainstorm creative ideas
• Ex: Prompt: "In a world where gravity suddenly stopped working, people started floating upwards.
Write a story about how society adapted to this new reality."

Task 3: Language Translation: Experiment with translation tasks by providing a sentence in one language and
asking the model to translate it into another language. Compare the output to see how accurate and fluent the
translations are.
• Ex:Prompt: "Translate the following English sentence to French: 'Hello, how are you doing today?'"

Course Outcomes:
CO1: Gain expertise in computer hardware, assembly, and dual-boot OS configuration, enhancing their
ability to manage and troubleshoot computer systems effectively.
CO2: Learn to connect to the LAN, configure browsers, use search engines effectively, and practice
cyber hygiene for secure internet use.
CO3: Create well-formatted documents and presentations using Microsoft Office and Latex
CO4: Gain proficiency in using Excel or its FOSS equivalent for tasks like scheduling, GPA
calculation, data manipulation, and formatting.
CO5: Craft effective and tailored inputs to obtain desired responses from AI tools like ChatGPT.

Reference Books:
1. Comdex Information Technology course tool kit, Vikas Gupta, WILEY Dream tech, 2003
2. The Complete Computer upgrade and repair book, Cheryl A Schmidt, WILEY Dream tech,2013,
3rd edition
3. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education, 2012,
2nd edition
4. PC Hardware - A Handbook, Kate J. Chase, PHI (Microsoft)
5. LaTeX Companion, Leslie Lamport, PHI/Pearson.
6. IT Essentials PC Hardware and Software Companion Guide, David Anfins on and KenQuamme.
– CISCO Press, Pearson Education, 3rd edition
7. IT Essentials PC Hardware and Software Labs and Study Guide, Patrick Regan– CISCOPress,
Pearson Education, 3rd edition

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

51 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23CSE203 DATA STRUCTURES LABORATORY
L T P C
0 0 3 1.5

Course Objectives:
The course aims to strengthen the ability of the students to identify and apply the suitable data structure
for the given real-world problem. It enables them to gain knowledge in practical applications of data
structures.

List of Experiments:

Exercise 1: Array Manipulation

i) Write a program to reverse an array.
ii) C Programs to implement the Searching Techniques – Linear & Binary Search
iii) C Programs to implement Sorting Techniques – Bubble, Selection and Insertion Sort

Exercise 2: Linked List Implementation

i) Implement a singly linked list and perform insertion and deletion operations.
ii) Develop a program to reverse a linked list iteratively and recursively.
iii) Solve problems involving linked list traversal and manipulation.

Exercise 3: Linked List Applications

i) Create a program to detect and remove duplicates from a linked list.
ii) Implement a linked list to represent polynomials and perform addition.
iii) Implement a double-ended queue (deque) with essential operations.

Exercise 4: Double Linked List Implementation

i) Implement a doubly linked list and perform various operations to understand its
properties and applications.
ii) Implement a circular linked list and perform insertion, deletion, and traversal.
Exercise 5: Stack Operations
i) Implement a stack using arrays and linked lists.
ii) Write a program to evaluate a postfix expression using a stack.
iii) Implement a program to check for balanced parentheses using a stack.

Exercise 6: Queue Operations

i) Implement a queue using arrays and linked lists.
ii) Develop a program to simulate a simple printer queue system.
iii) Solve problems involving circular queues.

Exercise 7: Stack and Queue Applications

i) Use a stack to evaluate an infix expression and convert it to postfix.
ii) Create a program to determine whether a given string is a palindrome or not.
iii) Implement a stack or queue to perform comparison and check for symmetry.

52 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Exercise 8: Binary Tree & Binary Search Tree

i) Implement Binary tree using array and linked list.
ii) Implement BST using Linked List.
iii) Traversing of BST.

Exercise 9: Hashing
i) Implement a hash table with collision resolution techniques.
ii) Write a program to implement a simple cache using hashing.

Course Outcomes:
At the end of the course, Student will be able to
CO1: Implement different types of sorting and searching algorithms using array.
CO2: Demonstrating the different types of linked lists with its basic operations and applications.
CO3: Develop programs using stacks to handle evaluating expressions and solve related problems.
CO4: Apply queue-based algorithms for efficient task scheduling and other related real world
problems.
CO5: Implement trees, graph and recognize scenarios where hashing is advantageous and design hash-
based solutions for specific problems.

Text Books:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Silicon
Press, 2008

Reference Books:
1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and PeterSanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E.Hopcroft
3. Problem Solving with Algorithms and Data Structures" by Brad Miller and DavidRanum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, and
Clifford Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching,and Graph
Algorithms by Robert Sedgewick.

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

53 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech I Year II Semester

23HUM202 NSS/NCC/SCOUTS AND GUIDES/COMMUNITY SERVICE
L T P C
0 0 1 0.5

Course Objectives:
The objective of introducing this course is to impart discipline, character, fraternity, teamwork, social
consciousness among the students and engaging them in selfless service.

UNIT I ORIENTATION 5 hours

General Orientation on NSS/NCC/ Scouts & Guides/Community Service activities,

careerguidance.

Activities:
i) Conducting –ice breaking sessions-expectations from the course-knowing
personaltalents and skills
ii) Conducting orientations programs for the students –future plans-activities-
releasingroad map etc.
iii) Displaying success stories-motivational biopics- award winning movies on
societalissues etc.
iv) Conducting talent show in singing patriotic songs-paintings- any other contribution.

UNIT II NATURE & CARE 5 hours

Activities:
i) Best out of waste competition.
ii) Poster and signs making competition to spread environmental awareness.
iii) Recycling and environmental pollution article writing competition.
iv) Organising Zero-waste day.
v) Digital Environmental awareness activity via various social media platforms.
vi) Virtual demonstration of different eco-friendly approaches for sustainable living.
vii) Write a summary on any book related to environmental issues.

UNIT III COMMUNITY SERVICE 5 hours

Activities:

i) Conducting One Day Special Camp in a village contacting village-area leaders-

Surveyin the village, identification of problems- helping them to solve via media-
authorities-experts-etc.
ii) Conducting awareness programs on Health-related issues such as General Health,
Mental health, Spiritual Health, HIV/AIDS,
iii) Conducting consumer Awareness. Explaining various legal provisions etc.
iv) Women Empowerment Programmes- Sexual Abuse, Adolescent Health and
PopulationEducation.
v) Any other programmes in collaboration with local charities, NGOs etc.

54 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
After completion of the course the students will be able to
CO1: Understand the importance of discipline, character and service motto.
CO2: Solve some societal issues by applying acquired knowledge, facts, and techniques.
CO3: Explore human relationships by analyzing social problems.
CO4: Determine to extend their help for the fellow beings and downtrodden people.
CO5: Develop leadership skills and civic responsibilities.

Reference Books:
1. Nirmalya Kumar Sinha & Surajit Majumder, A Text Book of National Service Scheme
2. Vol;.I, Vidya Kutir Publication, 2021 ( ISBN 978-81-952368-8-6)
3. Red Book - National Cadet Corps – Standing Instructions Vol I & II, DirectorateGeneral of
NCC, Ministry of Defence, New Delhi
4. Davis M. L. and Cornwell D. A., “Introduction to Environmental Engineering”,McGraw Hill,
New York 4/e 2008
5. Masters G. M., Joseph K. and Nagendran R. “Introduction to Environmental Engineering and
Science”, Pearson Education, New Delhi. 2/e 2007

General Guidelines:

1. Institutes must assign slots in the Timetable for the activities.

2. Institutes are required to provide instructor to mentor the students.

Evaluation Guidelines:

 Evaluated for a total of 100 marks.

 A student can select 6 activities of his/her choice with a minimum of 01 activity per
unit. Each activity shall be evaluated by the concerned teacher for 15 marks, totalling
to 90 marks.
 A student shall be evaluated by the concerned teacher for 10 marks by conducting
vivavoce on the subject.

55 | P a g e
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

II Year I Semester

56 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23HUM101 UNIVERSAL HUMAN VALUES
L T P C
2 1 0 3
Course Prerequisite:
Course Description :
The course has 28 lectures and 14 tutorials in 5 Units. The lectures and tutorials are of 1-hour duration.
Tutorial sessions are to be used to explore and practice what has been proposed during the lecture
sessions. The Teacher’s Manual provides the outline for lectures as well as practice sessions. The teacher
is expected to present the issues to be discussed as propositions and encourage the students to have a
dialogue.

Course Objectives: None. Universal Human Values-I (desirable)

The main objectives of the course is to
1. help the students appreciate the essential complementary between 'VALUES' and 'SKILLS' to
ensure happiness and prosperity in continuity, which are the core aspirations of all human beings.
2. facilitate the development of a Holistic perspective among students towards life and profession
based on right understanding of the Human reality, family, society and the rest of nature. Such
holistic perspective forms the basis of Universal Human Values (UHV) and movement towards
value-based living in a natural way.
3. highlight plausible implications of such a Holistic understanding in terms of ethical human
conduct, trustful and mutually fulfilling human behaviour and mutually enriching interaction
with Nature.
4. aid the students to realize their full human potential and act accordingly.
5. assist the students to live with feeling of relationship, harmony and co-existence.

UNIT I INTRODUCTION TO VALUE EDUCATION 8 hours

Lecture 1: Understanding Value Education
Lecture 2: self-exploration as the Process for Value Education
Tutorial 1: Practice Session PS1 - Sharing about Oneself
Lecture 3: Right Understanding, Relationship and Physical Facility (Holistic Development and the Role
of Education)
Lecture 4: Continuous Happiness and Prosperity – the Basic Human Aspirations
Tutorial 2: Practice Session PS2 - Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture 6: Method to Fulfill the Basic Human Aspirations
Tutorial 3: Practice Session PS3 - Exploring Natural Acceptance
UNIT II HARMONY IN THE HUMAN BEING 8 hours
Lecture 7: Understanding Human being as the Co-existence of the self and the body.
Lecture 8: Distinguishing between the Needs of the self and the body
Tutorial 4: Practice Session PS4 - Exploring the difference of Needs of self and body.
Lecture 9: The body as an Instrument of the self
Lecture 10: Understanding Harmony in the self
Tutorial 5: Practice Session PS5 - Exploring Sources of Imagination in the self
Lecture 11: Harmony of the self with the body
Lecture 12: Programme to ensure self-regulation and Health
Tutorial 6: Practice Session PS6 - Exploring Harmony of self with the body
57 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

UNIT III HARMONY IN THE FAMILY AND SOCIETY 10 hours

Lecture 13: Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship
Tutorial 7: Practice Session PS7 - Exploring the Feeling of Trust
Lecture 15: 'Respect' – as the Right Evaluation
Tutorial 8: Practice Session PS8 - Exploring the Feeling of Respect
Lecture 16: Other Feelings, Justice in Human-to-Human Relationship
Lecture 17: Understanding Harmony in the Society
Lecture 18: Vision for the Universal Human Order
Tutorial 9: Practice Session PS9 - Exploring Systems to fulfil Human Goal
UNIT IV HARMONY IN THE NATURE/EXISTENCE 8 hours
Lecture 19: Understanding Harmony in the Nature
Lecture 20: Interconnectedness, self-regulation and Mutual Fulfilment among
the Four Orders of Nature
Tutorial 10: Practice Session PS10 - Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture 22: The Holistic Perception of Harmony in Existence
Tutorial 11: Practice Session PS11 - Exploring Co-existence in Existence.
UNIT V IMPLICATIONS OF THE HOLISTIC UNDERSTANDING – 8 hours
A LOOK AT PROFESSIONAL ETHICS
Lecture 23: Natural Acceptance of Human Values
Lecture 24: Definitiveness of (Ethical) Human Conduct
Tutorial 12: Practice Session PS12 - Exploring Ethical Human Conduct
Lecture 25: A Basis for Humanistic Education, Humanistic Constitution and Universal Human Order
Lecture 26: Competence in Professional Ethics
Tutorial 13: Practice Session PS13 - Exploring Humanistic Models in Education
Lecture 27: Holistic Technologies, Production Systems and Management Models-Typical Case Studies
Lecture 28: Strategies for Transition towards Value-based Life and Profession
Tutorial 14: Practice Session PS14 - Exploring Steps of Transition towards Universal Human Order
Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Understand the Natural Acceptance and basic human aspiration.
CO2: Aware of themselves and self-regulation.
CO3: Recognize human-human relationship (Justice) and identify human goals in the society.
CO4: Appreciate the harmony in the nature and existence.
CO5: Develop as socially and ecologically responsible engineers in handling problems with sustainable
solutions (user-friendly and eco-friendly).

Text Books:
1. R R Gaur, R Asthana, G P Bagaria, A Foundation Course in Human Values and Professional Ethics,
2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-47-1
2. R R Gaur, R Asthana, G P Bagaria,Teachers’ Manual for A Foundation Course in Human Values
and Professional Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-
87034-53-2

58 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Reference Books:
1. JeevanVidya: EkParichaya, A Nagaraj, JeevanVidyaPrakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – PanditSunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)
Online Learning Resources
1. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%201-
Introduction%20to%20Value%20Education.pdf
2. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%202-
Harmony%20in%20the%20Human%20Being.pdf
3. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%203-
Harmony%20in%20the%20Family.pdf

4. https://fdp-si.aicte-india.org/UHV%201%20Teaching%20Material/D3-
S2%20Respect%20July%2023.pdf

5. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%205-
Harmony%20in%20the%20Nature%20and%20Existence.pdf

6. https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3-days%20FDP-
SI%20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D3-
S2A%20Und%20Nature-Existence.pdf
7. https://fdp-si.aicte-
india.org/UHV%20II%20Teaching%20Material/UHV%20II%20Lecture%2023-
25%20Ethics%20v1.pdf
8. https://www.studocu.com/in/document/kiet-group-of-institutions/universal-human-
values/chapter-5-holistic-understanding-of-harmony-on-professional-ethics/62490385
9. https://onlinecourses.swayam2.ac.in/aic22_ge23/preview

59 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

10. https://uhv.org.in/
11. https://www.youtube.com/@UniversalHumanValues/playlists
12. https://fdp-si.aicte-india.org/index.php
Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

60 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23HUM102 ECONOMICS AND FINANCIAL ACCOUNTING FOR ENGINEERS
L T P C
2 0 0 2
Course Prerequisite: NIL
Course Description:
The Engineering Economics and Financial Accounting aims to provide an insight into production, cost
analysis, market structure, Accounting Basic concepts and financial Statement Analysis. The course is
designed to give emphasis on the application of real life examples on various fundamental issues of
economics and accounts. This course introduces the accounting system, principles, types of accounts,
and financial statements etc. The ratio analysis and financial analysis are useful to know the positions of
financial statements are explained to know the analysis of financial matters.

Course Objectives:
This course enables students to
1. Describe the nature of engineering economics in dealing with the issues of scarcity;
2. Know the supply, demand, production and cost analysis to analyze the impact of economic events on
markets;
3. Explain the different market structures and price determination in various market conditions.
4. Explain the accounting principles, types of accounting and preparation of final accounts; and
5. Describe the financial statement analysis and investment evaluation through ratios and capital budgeting
techniques.
UNIT I DEMAND ANALYSIS 7 hours
Scope and Significance of Economics- Elements of market Economy: Demand, Supply and Market
Equilibrium- Theory of Demand, Elasticity of Demand, Supply and Law of Supply.
UNIT II PRODUCTION AND COST ANALYSIS 7 hours
Production Function – Short-run and long-run production – Cost Analysis: Cost concepts - Cost
Structure of Firms and Output Decision- Break-Even Analysis (BEA) – significance and Limitations of
BEA - Determination of Break Even Point (Simple Problems).

UNIT III MARKET STRUCTURE AND PRICING 6 hours

Classification of Markets - General Equilibrium and efficiency of Perfect competition, Monopoly,
Monopolistic – Price determination under Perfect, Monopoly, and Monopolistic Competition, Pricing
objectives- Pricing Strategies.

UNIT IV BASICS OF ACCOUNTING 7 hours

Accounting - Double Entry System - Accounting Principles - Classification of Accounts - Rules of Debit
& Credit- Accounting Cycle: Journal, Ledger, Trial Balance. Final Accounts: Trading Account - Profit
& Loss Account - Balance Sheet with Adjustments, (Simple Problems).

UNIT V FINANCIAL RATIO ANALYSIS AND CAPITAL BUDGETING 7 hours

Ratio Analysis - Liquidity, Solvency, Activity and Profitability Ratios - Capital Budgeting. (Simple
Problems).

61 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Understand Engineering economics basic concepts,
CO2: Analyze the concepts of demand, elasticity, supply, Production, Cost Analysis and its essence in floating
of an organization,
CO3: Compare various different market structures and identify suitable market,
CO4: Demonstrate an understanding and analyzing the accounting statements, and
CO5: Exhibit the ability to apply knowledge of ratio analysis and capital budgeting techniques in financial
statement analysis and investment evaluation respectively.

Text Books:
1. Case E. Karl & Ray C. Fair, “Principles of Economics”, Pearson Education, 8th Edition, 2007
2. Aryasri: Business Economics and Financial Analysis, 4/e. MGH.
3. Financial Accounting, S. N. Maheshwari, Sultan Chand, 2009
4. Varshney & Maheswari: Management Economics, Sultan Chand
5. Financial Statement Analysis, Khan and Jain, PHI, 2009
6. Financial Management, Prasanna Chandra, T.M.H, 2009

Reference Books:
1. Lipsey, R. G. & K. A. Chrystal , “Economics”, Oxford University Press, 11th Edition, 2007
2. Samuelson P. A. & Nordhaus W. D. “Economics”, Tata McGraw-Hill 18th Edition, 2007
3. Financial Management and Policy, Van Horne, James, C., Pearson, 2009.
4. Financial Management, I. M. Pandey, Vikas Publications

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

62 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23MAT107 PROBABILITY AND STATISTICS FOR COMPUTER SCIENCE
L T P C
3 0 0 3
Course Prerequisite: 23MAT101, 23MAT102
Course Description:
This course provides an introduction to probability, distributions and statistics with applications. Topics
include: Conditional probability, Random variables, Probability distributions, Joint densities, Bayesian
inference, descriptive statistics, Correlation and Regression, Estimation, Confidence intervals,
Hypothesis testing.
Course Objectives:
This course enables students to
1. To extend and formalize knowledge of the theory of probability and random variables.
2. To solve real time problems in engineering and science by using discrete and continuous
distributions
3. To analyze and interpret basic summary and modeling techniques for Multi-variate data
4. To analyze the data by using descriptive statistics for decision making
5. To apply the statistical inference involving confidence interval and hypothesis testing in data
analysis.
UNIT I PROBABILITY 9 hours
Introduction to Probability, Sample space and events, axioms of probability, theorems on probability,
conditional probability, multiplication theorem and independence of events, Baye’s theorem.
Random variables (discrete and continuous), probability density functions, distribution function,
mathematical expectation, properties. moment generating function.
UNIT II PROBABILITY DISTRIBUTIONS 9 hours
Discrete probability distributions - Binomial, Poisson, Geometric and their properties
Continuous probability distributions - Uniform, Exponential, Gamma, Normal distributions and their
properties, Chebychev’s inequality.

UNIT III JOINT DISTRIBUTIONS 9 hours

Joint densities and Independence - Marginal distributions (discrete & continuous)- Expectation and
Covariance, Correlation, Conditional densities and Regression, Curves of regression, Transformation
of random variables.
UNIT IV STATISTICS FOR DATA ANALYSIS 9 hours
Data Visualization, Moments, skewness, kurtosis, correlation, correlation coefficient, rank correlation,
principle of least squares, lines of regression, regression coefficients and their properties.

UNIT V STATISTICAL INFERENCE 9 hours

Population, sampling, Estimation, Point estimation, MLE, formulation of null hypothesis, alternative
hypothesis, level of significance, types of errors and power of the test. Large Sample Tests: Test for
single mean, single proportion, difference of means, difference of proportions, Confidence interval for
parameters in one sample and two sample problems, t test for single mean, difference of means, test for
ratio of variances.
63 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Understand the probability concepts and their importance in engineering.
CO2: Apply discrete and continuous probability distributions to solve various engineering problems.
CO3: Get an idea about joint density functions, distribution functions to the random variables and
analyse the multivariate problems in engineering
CO4: Apply the method of least squares to estimate the parameters of a regression model.
CO5: Perform Test of Hypothesis as well as calculate confidence interval for a population parameter for
single sample and two sample cases.

Text Books:
1. Milton. J. S. and Arnold. J.C., "Introduction to Probability and Statistics", Tata McGraw Hill, 4th
Edition, 2007.
2. Dr.B.S.Grewal, “ Higher Engineering Mathematics”, Khanna Publications, 42nd Edition.
Reference Books:
1. Spiegel. M.R., Schiller. J. and Srinivasan. R.A., "Schaum’s Outline of Theory and Problems of
Probability and Statistics", Tata McGraw Hill Edition, 2004.
2. Devore. J.L., "Probability and Statistics for Engineering and the Sciences”, Cengage Learning, New
Delhi, 8th Edition, 2012.
3. Dean G. Duffy, “Advanced Engineering Mathematics with MATLAB”, CRC Press, Third Edition
2013.
E Books:
1. http://nptel.ac.in/courses/IIT-MADRAS/Principles_of_Communication1/Pdfs/1_5.pdf
2. https://www.khanacademy.org

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

64 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23CSM103 DIGITAL LOGIC AND COMPUTER ORGANIZATION
L T P C
3 0 0 3
Course Objectives:
The main objectives of the course is to
1. Provide a comprehensive understanding of digital logic design principles and
computer organization fundamentals
2. Illustrate Computer Arithmetic Operations and Processor Organization
3. Explain the fundamentals of Memory and Input/output (I/O) systems

UNIT I 9 hours
Data Representation: Signed and Unsigned Binary Arithmetic – Fixed and Floating Point Binary
Number representations – Hamming Code - Error Detection and Correction
Digital Logic & Combinational Circuits: Boolean Algebra, Minimization of Logic expressions,
Quine–McCluskey Method - K-Map Simplification - Combinational Circuits: - Adders, Multiplexers,
De-Multiplexers, Encoders and Decoders – Code Converters
UNIT II 9 hours
Digital Logic & Sequential Circuits: Sequential Circuits, Flip-Flops, Binary counters, Registers,
Shift Registers
Introduction to Computer Architecture: Computer Types, Functional units, Bus structures, Software,
Technology, Computer Generations, Von- Neumann Architecture, Eight Great Ideas
UNIT III 9 hours
Computer Arithmetic: Fixed Point and Floating Point Arithmetic - Addition, Subtraction, Unsigned
and Signed Multiplication, Division Algorithms - Floating Point Arithmetic Operations
Processor Organization: Fundamental Concepts, Execution of a Complete Instruction Cycle – CISC
and RISC Processors – x86 and ARM Addressing Modes and Instruction set
UNIT IV 9 hours
Memory Organization: Basic Concepts, Semiconductor RAM Memories, Read-Only Memories,
Speed, Size and Cost, Cache Memory, Elements of Cache – Memory Mapping Techniques, Cache
Performance - Redundant Array of Independent Disks.
UNIT V 9 hours
Pipelining and Parallelism: Pipelining Strategy, Pipeline performance, Pipeline Hazards. Parallel
Architecture - Flynn's classification – Multicore Architecture – Clusters – GPU Architecture
Input/output Organization: Data Transfer Schemes: - Programmed I/O, Interrupt Driven I/O, Direct
Memory Access.
Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1:Demonstrate the fundamental principles of digital system design and design combinational logic
circuits.
CO2: Design sequential logic circuits and explain the functional units of computer
CO3: Apply algorithms for Arithmetic Operations and understand Instruction Set Architectures
CO4: Explain memory hierarchy and Concepts of Cache
CO5: Understand the concepts of Pipelining, Parallelism and I/O
65 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 6th edition, McGraw
Hill
2. William Stallings, “Computer Organization and Architecture Designing for Performance”,11th
Edition, Pearson Publications.
3. Digital Design, 6th Edition, M. Morris Mano, Pearson Education.

Reference Books:
1. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson
2. Computer Organization and Design, David A. Paterson, John L. Hennessy, Elsevier
3. Fundamentals of Logic Design, Roth, 5thEdition, Thomson
Online Learning Resources
1. https://nptel.ac.in/courses/106/103/106103068/
Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

66 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23CSM101 PYTHON PROGRAMMING
L T P C
3 0 0 3
Pre-requisite: Nil
Course Objectives:
1. Learn Python programming constructs.
2. Implement Python programs with conditional structures and loops.
3. Use functions for structuring Python programs.
4. Handle compound data using Python lists, tuples, and dictionaries.
5. Manipulate data using files handling in Python.

UNIT I INTRODUCTION 9 hours

What is a program, Algorithm, building blocks of algorithms (flow chart), History of Python, features of
Python Programming, Running Python Scripts, Variables, Assignment statements, Keywords, Input-Output,
Indentation. Data Types - Integers, float, Strings, Boolean.
UNIT II OPERATORS AND EXPRESSIONS 9 hours
Operators- Arithmetic Operators, Comparison (Relational) Operators, Assignment Operators, Logical
Operators, Bitwise Operators, Membership Operators, Identity Operators, Expressions and order of
evaluations. Control Flow - if, if-elif else, for, while, break, continue, pass.

UNIT III DATA STRUCTURES 9 hours

Lists - Operations, Slicing, Methods, Tuples, Sets, Dictionaries, Functions - Defining Functions, Calling
Functions, Passing Arguments, variable in python-Global and Local Variables.

UNIT IV STRINGS 9 hours

Strings: string slices, immutability, string functions and methods, Range function, String Operations, import
statement, from import statement, name spacing Files and Directories.

UNIT V FILES AND PACKAGES 9 hours

Files: Introduction – File Path – Opening and Closing Files – Reading and Writing Files –File Position –
Exception: Errors and Exceptions, Exception Handling, Multiple Exceptions.
Python packages: Predefined Packages and User-defined Packages, Package Creation.

Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Understand problem solving techniques and their applications
CO2: Understand the syntax and semantics of python.
CO3: Demonstrate the use of Python lists and dictionaries.
CO4: Demonstrate the use of Python Strings.
CO5: Read and write data from/to files in Python Programs.

67 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2nd edition,
Updated for Python 3, Shroff/O’Reilly Publishers, 2016 .
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and updated for Python
3.2, Network Theory Ltd., 2011.
Reference Books:
1. Charles Dierbach, “Introduction to Computer Science using Python: A Computational Problem-
Solving Focus, Wiley India Edition, 2013.
2. John V Guttag, “Introduction to Computation and Programming Using Python’’, Revised and expanded
Edition, MIT Press, 2013.
3. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning, 2012.
4. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An Introduction to
Computer Science using Python 3”, Second edition, Pragmatic Programmers, LLC, 2013.
5. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in Python: An Inter-
disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.

Mode of Evaluation: Assignments, Mid Term Tests, End Semester Examination.

68 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23CSM102 DATABASE MANAGEMENT SYSTEMS
L T P C
3 0 0 3
Pre-requisite: Nil
Course Objectives:
1. To understand the concept of DBMS and ER Modeling.
2. To explain the normalization, Query optimization and relational algebra.
3. To have an introductory knowledge about the storage and query processing techniques and the
basic concepts of Information retrieval techniques
4. To learn about the internal storage structures using different file and indexing techniques which
will help in physical DB design
5. To apply the concurrency control, recovery, security and indexing for the real time data.

UNIT I DATABASE SYSTEMS CONCEPTS AND DATA MODELING 9 hours

Introduction to Databases- File System Vs Database System - Data Models- Schemas and Instances - DBMS
Architecture- Centralized - Client Server - Database Applications, Types of Databases.
Entity Relationship Model: Types of Attributes, Entities and Entity set, Relationship, Structural Constraints -
Relational Model, Relational model Constraints - Mapping ER model to a relational schema - Integrity
Constraints, Specialization and generalization using ER Diagrams.

UNIT II SQL 9 hours

The Database Language SQL – Simple Queries in SQL – Queries Involving More than One Relation, SQL
functions(Data & Time, String conversion, Sub Queries, aggregate operators, null values, complex integrity
constraints, triggers, views and indexes, Dynamic SQL, Cursors, Introduction to JDBC, Stored Procedures.

UNIT III NORMALIZATION 9 hours

Translating SQL Queries into Relational Algebra and Relational Calculus, Guidelines for Relational Schema
– Functional dependency; Normalization, Boyce Codd Normal Form, Multi-valued dependency and Fourth
Normal form; Join dependency and Fifth Normal form.

UNIT IV DATA STORAGE AND TRANSACTION MANAGEMENT 9 hours

Storage strategies: Indices, B-trees, B+-trees, hashing. Two-Phase Locking Techniques for Concurrency
Control -ACID Property– Concurrency Control based on timestamp – Recovery Concepts – Recovery based
on deferred update – Recovery techniques – Buffer management.

UNIT V DATABASE SECURITY AND RECENT TRENDS 9 hours

Database Authentication, Authorization and access control, DAC, MAC and RBAC models, SQL injection.
Introduction, Need of NoSQL, CAP Theorem and Recent trends.
Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Construct an ER model and derive the relational schemas from the model.
CO2: Understand the conceptual and logical database design using SQL queries.
CO3: Apply Normalization to improve database design.
CO4: Interpret the basic issues of storage and transaction management.
CO5: Analyse the fundamental security concepts for database.
69 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. A. Silberschatz, H. F. Korth S. Sudershan, Database System Concepts, McGraw Hill, 7th Edition
2021.
2. R. Elmasri S. B. Navathe, Fundamentals of Database Systems, Addison Wesley, 2015.

Reference Books:
1. Raghu Ramakrishnan,Database Management Systems,Mcgraw-Hill,4th edition,2015.
2. Thomas Connolly, Carolyn Begg, Database Systems: A Practical Approach to Design, Implementation
and Management,6th Edition,2012.

Mode of Evaluation: Assignments, Mid Term Tests, End Semester Examination.

70 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23CSM201 PYTHON PROGRAMMING LABORATORY
L T P C
0 0 3 1.5

Pre-requisite: NIL
Course Objectives:
1. To understand the problem-solving approaches.
2. To learn the basic programming constructs in Python.
3. To practice various computing strategies for Python-based solutions to real world problems.
4. To use Python data structures - lists, tuples, dictionaries.
5. To do input/output with files in Python.
List of Experiments:

1. a) Install Python Interpreter and use it to perform different Mathematical Computations. Try to
do all the operations present in a Scientific Calculator.
b) Write a function that draws a grid like the following:

2. a) Implement Python program to find sum of natural numbers.

b) The marks obtained by a student in 5 different subjects are input through the keyboard.
Find the average and print the student grade.
c) Implement Python Script to generate prime numbers series up to N.

3. a) Given a number x, determine whether it is Armstrong number or not. Hint: For example, 371
is an Armstrong number since 3**3 + 7**3 + 1**3 = 371. Write a program to find all
Armstrong number in the range of 0 and 999.
b) Implement the python program to generate the multiplication table.
c) Swapping of two number with and without using temporary variable.

4. a) If the age of Ram, Sam, and Khan are input through the keyboard, write a python program to
determine the eldest and youngest of the three.
b) Given a text of characters, write a program which counts number of vowels, consonants and
special characters.
c) Write a program that reads a file, breaks each line into words, strips whitespace and
punctuation from the words, and converts them to lowercase.
5. a) Write a Python script to create a list, access elements from a list, slice lists, change or add
elements to a list, delete or remove elements from a list.
b) Write a Python script to read the values from a list and to display largest and smallest numbers
from list.

71 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

c) Write a Python script to compute the similarity between two lists.

6. a) Write a Python script to read set of values from a Tuple to perform various operations.
b) Write a Python script to perform basic dictionary operations like insert, delete and display.
c) Write a Python program to count the occurrence of each word in a given sentence.

7. a) Implement Python script to display power of given numbers using function.

b) Implement a Python program that takes a list of words and returns the length of the longest
one using function.

8. a) Implement Python program to perform various operations on string using string libraries.
b) Implement Python program to remove punctuations from a given string.
c) Write a Python program to change the case of the given string (convert the string from lower
case to upper case). If the entered string is “computer”, your program should output
“COMPUTER” without using library functions.

9. a) Write a Python script to copy file contents from one file to another.
b) Write a Python script to combine two text files contents and print the number of lines,
sentences, words, characters and file size.

10. a) Consider turtle object. Write functions to draw triangle, rectangle, polygon, circle and sphere.
b) Using turtles concept draw a wheel of your choice.
c) Write a program that draws Archimedean Spiral.

Course Outcomes:
CO1: Develop algorithmic solutions to simple computational problems.
CO2: Develop and execute simple Python programs.
CO3: Implement programs in Python using conditionals and loops for solving problems.
CO4: Deploy functions to decompose a Python program.
CO5: Process compound data using Python data structures.
Reference Books:
1. Allen B. Downey, “Think Python : How to Think like a Computer Scientist”, 2nd Edition, O’Reilly
Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginner's Guide to Problem Solving and
Programming”, 1st Edition, BCS Learning & Development Limited, 2017.
3. Paul Deitel and Harvey Deitel, “Python for Programmers”, Pearson Education, 1st Edition, 2021.
4. G Venkatesh and Madhavan Mukund, “Computational Thinking: A Primer for Programmers and
Data Scientists”, 1st Edition, Notion Press, 2021.
5. John V Guttag, "Introduction to Computation and Programming Using Python: With Applications
to Computational Modeling and Understanding Data‘‘, Third Edition, MIT Press, 2021.

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

72 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

23CSM202 DATABASE MANAGEMENT SYSTEMS LABORATORY
L T P C
0 0 3 1.5
Pre-requisite: NIL
Course Objectives:
1. To understand the components of DBMS and to study the database design.
2. To study the retrieval of data using relational algebra and calculus and the concept of normal
forms in the design of database.
3. To comprehend the structure of SQL Queries to query, update, and manage a database.
4. To understand all constraints to develop a business application using cursors, triggers and stored
procedures.
5. To provide sufficient skill to utilize the DBMS concept in real time applications.
List of Experiments:
1. Design Conceptual database schema using ER Modelling Software Tools.
2. Development of Relational Database Schemas using DDL Constructs of SQL.
3. To perform various data manipulation commands such as select, insert, update etc. of SQL
on Relational Database.
4. To perform various DCL and TCL construct of SQL on Relational Database.
5. Implement different types of referential and integrity constraints on Relation Database.
6. To apply the concept of Aggregating Data using Group functions.
7. To retrieve the queries using Group by, Having and Order by clauses of SQL.
8. Design and development of Banking database and perform various types of JOIN operations.
9. Insert the Data into table and use COMMIT, ROLLBACK and SAVEPOINT in PL/SQL
10. Write a trigger that automatically deletes students when they graduate.
11. Develop programs using features parameters in a CURSOR for UPDATE
12. a) Create a cursor to update the salary of employees in EMP table.
b) Write a PL/SQL program to raise an Exception when the bonus exceeds salary.
13. Design and implementation of real time project with database connection.
Course Outcomes:
CO1: Perform table creation, maintain, and manipulate a relational database using SQL.
CO2: Implement complex queries using SQL.
CO3: Apply Queries using Advanced Concepts of SQL.
CO4: Build PL/SQL programs including stored procedures, functions, cursors and triggers.
CO5: Develop a real-world application to access and render data.

73 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Reference Books:
1. A. Silberschatz, H. F. Korth S. Sudershan, Database System Concepts, McGraw Hill, 7th
Edition 2021.
2. R. Elmasri S. B. Navathe, Fundamentals of Database Systems, Addison Wesley, 2015.
3. Raghu Ramakrishnan,Database Management Systems,Mcgraw-Hill,4th edition,2015.
4. Thomas Connolly, Carolyn Begg, Database Systems: A Practical Approach to Design,
Implementation and Management,6th Edition,2012

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

74 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year I Semester

Skill Enhancement Course - I
23CSM601 JAVA PROGRAMMING
L T P C
1 0 2 2
Pre-requisite: 23CSE101
Course Objectives:
1. The objective of this course is to provide object-oriented concepts through which robust, secured
and reusable software can be developed.
2. To understand object-oriented principles like abstraction, encapsulation, inheritance,
polymorphism and apply them in solving problems.
3. To understand the principles of inheritance and polymorphism.
4. To understand the implementation of packages and interfaces.
5. To understand how to connect to the database using JDBC.
UNIT I INTRODUCTION TO JAVA PROGRAMMING 6 hours
Object Oriented Programming Concepts, History of Java, Comments, Data types, Variables, Constants,
Scope and Lifetime of variables, Operators, Type conversion and casting, Enumerated types, Control
flow‐ block scope, Conditional statements, loops, break and continue statements, arrays, Simple Java
stand-alone programs, class, Object and its methods, Constructors, static fields and methods, String
class.
a. Write a Java program to check whether a given number is prime number or not?
b. Write a Java program to reverse a given string.
c. Write a Java program for Method overloading and Constructor overloading.

UNIT II INHERITANCE AND POLYMORPHISM 6 hours

Inheritance – Inheritance types, super keyword, Preventing inheritance: final classes and methods.
Polymorphism, Method overloading and method overriding, Abstract classes and methods.
a. Write a Java program to create a class called Shape with a method called getArea(). Create a
subclass called Rectangle that overrides the getArea() method to calculate the area of a rectangle.
b. Write a Java program to create a base class Sports with a method called play(). Create three
subclasses: Football, Basketball, and Rugby. Override the play() method in each subclass to play
a specific statement for each sport.

UNIT III INTERFACES AND PACKAGES 6 hours

Interfaces‐ Interfaces Vs Abstract classes, Defining an interface, Implement interfaces, Accessing
implementations through interface references, extending interface, Inner class. Packages‐ Defining,
Creating and accessing a package, Importing packages.
a. Write a program in java which implement interface Student which has two methods
Display_Grade and Atrendance for PG_Students and UG_Students (PG_Students and
UG_Students are two different classes for Post Graduate and Under Graduate students
respectively).
b. Write a java program to create user defined package.

75 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

UNIT IV COLLECTION FRAMEWORK AND JDBC 6 hours

Collection Framework in Java – Introduction to java collections, Overview of java collection framework,
Commonly used collection classes, File management using File class.
Connecting to Database – JDBC Type 1 to 4 drivers, Connecting to a database, Querying a database and
processing the results, Updating data with JDBC, Data Access Object (DAO).
a. Write a Java program to sort a given array list.
b. Write a Java program to insert the specified element at the front of a linked list.
c. Write a Java program to connect to a database created in MS–ACCESS/SQL–
SERVER/ORACLE using JDBC concept. Perform basic operations of Selection , Insertion and
Deletion on the database.

UNIT V GUI WITH SWING 6 hours

Overview of some Swing components – Jbutton, JLabel, JTextField, JTextArea, Simple Swing
applications, Layout management – Layout manager types – border, grid and flow, Event Handling‐
Event classes, Event Listeners, Delegation event model, Examples: Handling Mouse and Key events,
Adapter classes.
a. Design a Java Swing calculator that provides a simple and intuitive way to perform
mathematical calculations using the Swing library.
Hardware Requirements:
Intel based desktop PC with minimum of 2.6GHZ or faster processor with at least 256 MB RAM and
40GB free disk space.
Software requirements:
Operating system: Flavor of any WINDOWS,j2sdk1.7.,Linux and MvSQL,Eclipse or Net bean.

Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: An understanding of the principles and practice of object-oriented programming.
CO2: Be able to implement, compile, test and run Java programs comprising more than one class.
CO3: Demonstrate the ability to use simple data structures like arrays in a Java program.
CO4: Be able to make use of interfaces and packages.
CO5: Able to develop applications with JDBC and Swings.

Text Books:
1. Java Fundamentals – A Comprehensive Introduction, Herbert Schildt and Dale Skrien, TMH.
2. Core Java: An Integrated Approach – Dr R Nageswara Rao.
Reference Books:
1. Java for Programmers, P.J.Deitel and H.M.Deitel, PEA (or) Java: How to Program,
P.J.Deitel.and H.M.Deitel, PHI.
2. Object Oriented Programming through Java, P. Radha Krishna, Universities Press.
3. Thinking in Java, Bruce Eckel, PE.
4. Programming in Java, S. Malhotra and S. Choudhary, Oxford Universities Press.

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

76 | P a g e
Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

II Year II Semester

77 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23MAT108 DISCRETE MATHEMATICAL STRUCTURES
L T P C
3 0 0 3
Course Prerequisite: 23MAT101
Students should have a solid understanding of high school-level algebra, including Set notions,
Relations, Functions, Permutations-Combinations, equations, and inequalities.
Course Description:
Discrete Mathematical Structures is a foundational course designed to introduce students to the essential
concepts and structures of discrete mathematics. This course is crucial for students in computer science,
information technology, computing, and related fields, providing the mathematical framework necessary
for the analysis and design of algorithms, data structures, learning and intelligent systems.
Course Objectives:
This course enables students to
1. Develop a strong foundation in propositional and predicate logic, enabling the analysis and
construction of logical arguments and proofs.
2. Master various counting techniques and understand the properties of algebraic structures such as
groups and binary operations.
3. Gain a deep understanding of relations, equivalence classes, order relations, lattices, and Boolean
algebras.
4. Learn to model and solve problems using sequences and recurrence relations, both homogeneous
and nonhomogeneous.
5. Study the fundamental concepts of graph theory, including paths, cycles, trees, and the various
types of graphs and their properties.
UNIT I LOGICAL STRUCTURES 9 hours
Introduction- Propositions and Truth Values- Logical Connectives and Truth Tables-Tautologies and
Contradictions -Logical Equivalence and Logical Implication -The Algebra of Propositions -
Arguments - Formal Proof of the Validity of Arguments -Predicate Logic - Arguments in Predicate
Logic (Theory of Inference).
UNIT II COUNTING TECHNIQUES AND ALGEBRAIC STRUCTURES 9 hours
Counting Techniques- Pigeonhole principle- Inclusion-exclusion principle- Binary Operations and
Their Properties- Algebraic Structures- Groups in Modular Arithmetic - Cyclic Groups- Groups of
Permutations- Substructures-Morphisms.

UNIT III ORDERED STRUCTURES 9 hours

Relations and Their Representations- Equivalence Classes and Partitions- Order Relations- - Hasse
Diagrams-Lattices- Properties of Lattices- Boolean Algebras – Properties of Boolean Algebras-
Boolean Functions- Minimization of Boolean Expressions.
UNIT IV RECURRENCE RELATIONS 9 hours
Sequences - Recurrence Relations- Applications of Recurrence Relations- Modeling with Recurrence
Relations- Solving Linear Recurrence Relations- Solving Linear Homogeneous Recurrence Relations
with Constant Coefficients- Linear Nonhomogeneous Recurrence Relations with Constant Coefficients-
Generating Functions- Useful facts about Power Series- Using Generating Functions to Solve
Recurrence Relations
78 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

UNIT V GRAPH STRUCTURES 9 hours

Graphs-Graph Terminology and Special Types of Graphs-Representing Graphs and Graph
Isomorphism-Connectivity-Euler and Hamilton Paths-Shortest-Path Problems-Planar Graphs -Graph
Coloring-Introduction to Trees-Spanning Trees-Minimum Spanning Trees.
Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Evaluate the elementary logical arguments and identify the fallacious reasoning for the syntax
of programming languages.
CO2: Utilize counting principles in computing techniques and algorithm analysis, and learn the
properties of various algebraic structures.
CO3: Analyze various types of relations, equivalence classes, partitions using Hasse diagrams, and the
properties of lattices and Boolean algebra.
CO4: Apply recurrence relations to model and solve many computational problems by generating
functions.
CO5: Identify the special types of graphs for analyzing the connectivity models, and also study the
properties of trees.

Text Books:
1. Rowan Garnier and John Taylor, Discrete Mathematics (Proof, Structures and Applications), CRC
Press, an informa business, 3rd Edition, 2009.
2. Kenneth H. Rosen, Discrete Mathematics and its applications, 6th Edition, Tata McGraw Hill,
2011.
Reference Books:
1. J.P. Trembley and R.Manohar, “Discrete Mathematical Structures with Applications to Computer
Science”, Tata McGraw Hill – 13th reprint, 2012.
2. U.S. Gupta, ‘‘Discrete Mathematical Structures’’, 1st Edition, Pearson Education India, 2014.
3. Kevin Ferland, ‘‘Discrete Mathematical Structures’’, 1st Edition, Cengage Learning, 2009.

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

79 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23CSM104 MACHINE LEARNING
L T P C
2 1 0 3
Pre-requisite: NIL
Course Objectives:
The objectives of the course is to
1. Define machine learning and its different types (supervised and unsupervised)
and understand their applications.
2. Apply supervised learning algorithms including decision trees and k-nearest neighbors
(k-NN).
3. Implement unsupervised learning techniques, such as K-means clustering.

UNIT I INTRODUCTION TO MACHINE LEARNING 9 hours

Evolution of Machine Learning, Paradigms for ML, Learning by Rote, Learning by Induction,
Reinforcement Learning, Types of Data, Matching, Stages in Machine Learning, Data Acquisition,
Feature Engineering, Data Representation, Model Selection, Model Learning, Model Evaluation,
Model Prediction, Search and Learning, Data Sets.

UNIT II NEAREST NEIGHBOR-BASED MODELS 9 hours

Introduction to Proximity Measures, Distance Measures, Non-Metric Similarity Functions,
Proximity Between Binary Patterns, Different Classification Algorithms Based on the Distance
Measures ,K-Nearest Neighbor Classifier, Radius Distance Nearest Neighbor Algorithm, KNN
Regression, Performance of Classifiers, Performance of Regression Algorithms.

UNIT III MODELS BASED ON DECISION TREES 9 hours

Models Based on Decision Trees: Decision Trees for Classification, Impurity Measures, Properties,
Regression Based on Decision Trees, Bias–Variance Trade-off, Random Forests for Classification
and Regression.
The Bayes Classifier: Introduction to the Bayes Classifier, Bayes’ Rule and Inference, The Bayes
Classifier and its Optimality, Multi-Class Classification | Class Conditional Independence and Naive
Bayes Classifier (NBC)

UNIT IV LINEAR DISCRIMINANTS FOR MACHINE LEARNING 9 hours

Introduction to Linear Discriminants, Linear Discriminants for Classification, Perceptron Classifier,
Perceptron Learning Algorithm, Support Vector Machines, Linearly Non-Separable Case, Non-linear
SVM, Kernel Trick, Logistic Regression, Linear Regression, Multi-Layer Perceptrons (MLPs),
Backpropagation for Training an MLP.

UNIT V CLUSTERING 9 hours

Introduction to Clustering, Partitioning of Data, Matrix Factorization | Clustering of Patterns,
Divisive Clustering, Agglomerative Clustering, Partitional Clustering, K-Means Clustering, Soft
Partitioning, Soft Clustering, Fuzzy C-Means Clustering, Rough Clustering, Rough K-Means
Clustering Algorithm, Expectation Maximization-Based Clustering, Spectral Clustering.

80 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
CO1: To understand the principles and concepts of machine learning
CO2: To learn various evaluation and generalization strategies to measure the performance
of machine learning models
CO3: To analyze different supervised machine learning models and their limitations
CO4: To explore various clustering methods and association analysis in Unsupervised learning
CO5: To learn advanced machine learning topics like federated learning, transfer
learning, ensemble learning etc.
Text Books:
1. “Machine Learning Theory and Practice”, M N Murthy, V S Ananthanarayana, Universities
Press (India), 2024.

Reference Books:
1. “Machine Learning”, Tom M. Mitchell, McGraw-Hill Publication, 2017.
2. “Machine Learning in Action”,Peter Harrington, DreamTech.
3. “Introduction to Data Mining”, Pang-Ning Tan, Michel Stenbach, Vipin Kumar, 7th Edition,
2019.

Mode of Evaluation: Assignments, Internal Examination and External End Examination

81 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23CSM105 PRINCIPLES OF ARTIFICIAL INTELLIGENCE
L T P C
2 1 0 3
Pre-requisite: NIL
Course Objectives:
 The student should be made to study the concepts of Artificial Intelligence.
 The student should be made to learn the methods of solving problems using
Artificial Intelligence.
 The student should be made to introduce the concepts of Expert Systems.
 To understand the applications of AI, namely game playing, theorem proving, and
machine learning.
 To learn different knowledge representation techniques

UNIT I INTRODUCTION 9 hours

Introduction: AI problems, foundation of AI and history of AI intelligent agents: Agents and
Environments, the concept of rationality, the nature of environments, structure of agents, problem
solving agents, problem formulation.
UNIT II SEARCHING STRATEGIES 9 hours
Searching- Searching for solutions, uniformed search strategies – Breadth first search, depth first
Search. Search with partial information (Heuristic search) Hill climbing, A* ,AO* Algorithms,
Problem reduction, Game Playing-Adversial search, Games, mini-max algorithm, optimal decisions
in multiplayer games, Problem in Game playing, Alpha-Beta pruning, Evaluation functions.

UNIT III REPRESENTATION OF KNOWLEDGE 9 hours

Representation of Knowledge: Knowledge representation issues, predicate logic- logic
programming, semantic nets- frames and inheritance, constraint propagation, representing
knowledge using rules, rules based deduction systems. Reasoning under uncertainty, review of
probability, Bayes’ probabilistic interferences and dempstershafer theory.

UNIT IV LOGIC CONCEPTS 9 hours

Logic concepts: First order logic. Inference in first order logic, propositional vs. first order inference,
unification & lifts forward chaining, Backward chaining, Resolution, Learning from observation
Inductive learning, Decision trees, Explanation based learning, Statistical Learning methods,
Reinforcement Learning.

UNIT V EXPERT SYSTEMS 9 hours

Expert Systems: Architecture of expert systems, Roles of expert systems – Knowledge Acquisition
Meta knowledge Heuristics. Typical expert systems – MYCIN, DART, XCON: Expert systems
shells.

82 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
After completion of the course, students will be able to
CO1: Identify problems that are amenable to solution by AI methods.
CO2: Identify appropriate AI methods to solve a given problem.
CO3: Formalize a given problem in the language/framework of different AI methods.
CO4: Implement basic AI algorithms.
CO5: Design and carry out an empirical evaluation of different algorithms on a problem
formalization, and state the conclusions that the evaluation supports.

Text Books:
1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, SecondEdition,
Pearson Education.
2. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, Mc Graw Hill
Reference Books:
1. David Poole, Alan Mackworth, Randy Goebel,”Computational Intelligence: a logical approach”,
Oxford University Press.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problemsolving”,
Fourth Edition, Pearson Education.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers.
4. Artificial Intelligence, SarojKaushik, CENGAGE Learning.

Mode of Evaluation: Assignments, Internal Examination and External End Examination

83 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23CSM106 ADVANCED DATA STRUCTURES AND ALGORITHMS ANALYSIS
L T P C
2 1 0 3
Pre-requisite: 23CSE101, 23CSE102
Course Objectives:
The main objectives of the course are to
1. Introduce the concepts of algorithm analysis, Tree and Graph applications.
2. Discuss various algorithm design strategies with examples.
3. Introduce NP-Hard and NP-Complete problem concepts.
UNIT I INTRODUCTION 9 hours
Introduction to Algorithm Analysis, Space and Time Complexity Analysis, Asymptotic Notations.
AVL Trees – Creation, Insertion, Deletion Operations and Applications
B-Trees – Creation, Insertion, Deletion operations and Applications
Graphs – Basic search and Traversals

UNIT II DIVIDE AND CONQUER AND GREEDY METHOD 9 hours

Divide and Conquer: The General Method, Quick Sort, Merge Sort, Strassen’s matrix
multiplication.
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem, Minimum
cost spanning trees

UNIT III DYNAMIC PROGRAMMING 9 hours

Dynamic Programming: General Method, All pairs shortest paths, Single Source Shortest Paths–
General Weights (Bellman-Ford Algorithm), 0/1 Knapsack, Travelling Salesperson problem.

UNIT IV BACKTRACKING 9 hours

Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph Coloring.
Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling Salesperson problem

UNIT V NP-HARD AND NP-COMPLETE PROBLEMS 9 hours

NP-Hard and NP-Complete Problems: Basic Concepts, Cook’s theorem.
NP-Hard Graph Problems: Clique Decision Problem (CDP), Chromatic Number Decision Problem
(CNDP).
NP-Hard Scheduling Problems: Scheduling Identical Processors, Job Shop Scheduling.

Course Outcomes:
After completion of the course, students will be able to
CO1: Illustrate the working of the advanced tree and graph data structures and their applications.
CO2: Design Divide and Conquer strategy and Greedy method for different problems.
CO3: Demonstrate Dynamic programming method to solve problems.
CO4: Apply Backtracking and Branch & bound strategy to solve problems.
CO5: Understand NP-Hard and NP-Complete problems.

84 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Text Books:
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh,
2ndEdition Universities Press
2. Computer Algorithms in C++, Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, 2nd
Edition University Press

Reference Books:
1. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
2. An introduction to Data Structures with Applications, Trembley& Sorenson, McGraw Hill
3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth, Addison-
Wesley, 1997.
4. Data Structures using C & C++: Langsam, Augenstein&Tanenbaum, Pearson, 1995
5. Algorithms + Data Structures & Programs:, N.Wirth, PHI
6. Fundamentals of Data Structures in C++: Horowitz Sahni& Mehta, Galgotia Pub.
7. Data structures in Java:, Thomas Standish, Pearson Education Asia

Mode of Evaluation: Assignments, Internal Examination and External End Examination

85 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23CSM203 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING LABORATORY
L T P C
0 0 3 1.5

Pre-requisite: NIL
Course Objectives:
1. The student should be made to study the concepts of Artificial Intelligence.
2. The student should be made to learn the methods of solving problems using Artificial
Intelligence.
3. The student should be made to introduce the concepts of Expert Systems and machine learning.
4. To learn about computing central tendency measures and Data preprocessing techniques
5. To learn about classification and regression algorithms
6. To apply different clustering algorithms for a problem.

List of Experiments:
1. Pandas Library
a) Write a python program to implement Pandas Series with labels.
b) Create a Pandas Series from a dictionary.
c) Creating a Pandas Data Frame.
d) Write a program which makes use of the following Pandas methods
i) describe () ii) head () iii) tail () iv) info ()
2. Pandas Library: Visualization
a) Write a program which use pandas inbuilt visualization to plot following graphs:
i. Bar plots ii. Histograms iii. Line plots iv. Scatter plots
3. Write a Program to Implement Breadth First Search using Python.
4. Write a program to implement Best First Searching Algorithm
5. Write a Program to Implement Depth First Search using Python.
6. Write a program to implement the Heuristic Search
7. Write a python program to implement A* and AO* algorithm. (Ex: find the shortest path)
8. Apply the following Pre-processing techniques for a given dataset.
a). Attribute selection
b). Handling Missing Values
c). Discretization
d). Elimination of Outliers
9. Apply KNN algorithm for classification and regression
10. Demonstrate decision tree algorithm for a classification problem and perform parameter
tuning for better results
11. Apply Random Forest algorithm for classification and regression
12. Demonstrate Naïve Bayes Classification algorithm.
13. Apply Support Vector algorithm for classification
Implement the K-means algorithm and apply it to the data you selected. Evaluate
Performance by measuring the sum of the Euclidean distance of each example from its
class center. Test the performance of the algorithm as a function of the parameters K.

86 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Course Outcomes:
CO1: Practice various mathematical relationships within and across machine learning algorithms
CO2: Design and implement various machine learning algorithms in a range of real-world applications
CO3: Apply suitable machine learning techniques for data handling
CO4: Analyze the paradigms of supervised and un-supervised learning
CO5: Evaluate the performance of algorithms
Reference Books:
1. Hands-On Machine Learning with Scikit-Learn and TensorFlow: Concepts, Tools, and
Techniques to Build Intelligent Systems, Geron Aurelien
2. Machine Learning: A multi strategy approach, Tom M. Mitchell
Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

87 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23CSM204 ADVANCED DATA STRUCTURES AND ALGORITHMS ANALYSIS
LABORATORY
L T P C
0 0 3 1.5
Pre-requisite: 23CSE203
Course Objectives:
The objectives of the course are to
1. Learn how to analyze a problem &design the solution for the problem.
2. Strengthen the ability to identify and apply the suitable algorithm strategy for the given real-
world problem.
3. Develop the optimal solution, i.e., time complexity & space complexity is low.

List of Experiments:
1. Construct an AVL tree for a given set of elements which are stored in a file. And implement
insert and delete operations on the constructed tree. Write the contents of the tree into a new file
using in-order.
2. Construct a B-Tree in an order of 5 with a set of 100 random elements stored
in an array. Implement searching, insertion, and deletion operations.
3. Implement Graph traversals.
(a) BFT (b) DFT
4. Implement Quick Sort and Merge Sort and observe the execution time for
various input sizes (Average, Worst, and Best cases).
5. Implement Job Sequencing with Deadlines using Greedy strategy
6. Implement the Knapsack Problem using the Greedy method.
7. Construct Minimum Spanning Tree using
(a) Prim’s Method (b) Kruskal’s Method
8. Implement All Pairs Shortest Paths using Dynamic Programming method
9. Implement Single Source Shortest Paths using Dynamic Programming method
10. Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
11. Implement the Travelling Sales Person problem using Dynamic Programming.
12. Implement N-Queens Problem Using Backtracking Strategy.
13. Implement the Backtracking method to solve the Graph Coloring problem.

Course Outcomes:
After completion of the course, Students will be able to
CO1: Implement the operations on AVL Trees, B- Trees, and Graphs.
CO2: Solve and analyze the problems using Divide & Conquer strategy.
CO3: Execute the problems using Greedy Method.
CO4: Apply Backtracking Methods to solve various problems.
CO5: Apply Dynamic Programming Methods to solve various problems.

88 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Reference Books:
1. Fundamentals of Data Structures in C++, Horowitz Ellis, Sahni Sartaj, Mehta, Dinesh,
2ndEdition, Universities Press
2. Computer Algorithms/C++ Ellis Horowitz,Sartaj Sahni,Sanguthevar Rajasekaran, 2ndEdition,
University Press
3. Data Structures and program design in C,Robert Kruse,Pearson Education Asia
4. An introduction to Data Structures with Applications,Trembley& Sorenson,
McGraw Hill

Mode of Evaluation: Continuous Internal Evaluation, Model Test and End Semester Examination

89 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

Skill Enhancement Course - II
23CSM602 FULL STACK DEVELOPMENT - I
L T P C
1 0 2 2
Pre-requisite: NIL
Course Objectives:
1. Make use of HTML elements and their attributes for designing static web pages
2. Build a web page by applying appropriate CSS styles to HTML elements
3. Experiment with JavaScript to develop dynamic web pages and validate forms
4. Build a web page using UI/UX design

UNIT I HTML BASICS - LISTS - LINKS – IMAGES - HTML TABLES 6 hours

- FORMS – FRAMES
a. Design a webpage for a restaurant. The webpage should include the following elements:
 An ordered list to describe the steps to make a reservation at the restaurant.
 An unordered list to display the main categories of the menu (e.g., Appetizers,
Main Courses, Desserts).
 Nested lists to show sub-categories within each main category (e.g., under
Main Courses, list "Vegetarian", "Non-Vegetarian", and "Vegan").
 An ordered list within an unordered list to detail a special meal plan (e.g., daily
special menu with steps for preparation).
 Include links to the restaurant's social media pages (e.g., Facebook, Instagram)
using the <a> tag with the href attribute.
 Use the target attribute to open these links in a new tab.
 Display an image of the restaurant’s special dish with specified dimensions
(height and width) and make the image a clickable link that navigates to a page
with more details about the dish.
b. Write a HTML program, to explain the working of tables. (use tags: <table>, <tr>, <th>, <td>
and attributes: border, rowspan, colspan)
c. Write a HTML program, to explain the working of tables by preparing a timetable. (Note:
Use <caption> tag to set the caption to the table & also use cell spacing, cell padding,
border, rowspan, colspan etc.).
d. Write a HTML program, to explain the working of forms by designing Registration form.
(Note: Include text field, password field, number field, date of birth field, checkboxes,
radio buttons, list boxes using <select>&<option> tags, <text area> and two buttons
ie: submit and reset. Use tables to provide a better view).
e. Write a HTML program, to explain the working of frames, such that page is to be divided into
3 parts on either direction. (Note: first frame image, second frame paragraph, third frame � hyperlink.
And also make sure of using “no frame” attribute such that frames to be fixed).

UNIT II HTML 5 - CASCADING STYLE SHEETS, TYPES OF CSS - 6 hours

SELECTOR FORMS -5. CSS WITH COLOR, BACKGROUND,
FONT, TEXT AND CSS BOX MODEL

90 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

a. Write a HTML program, that makes use of <article>, <aside>, <figure>, <figcaption>, <footer>,
<header>, <main>, <nav>, <section>, <div>, <span> tags.
b. Write a HTML program, to embed audio and video into HTML web page.
c. Write a program to apply different types (or levels of styles or style specification formats) - inline,
internal, external styles to HTML elements. (identify selector, property and value).
d. Write a program to apply different types of selector forms
● Simple selector (element, id, class, group, universal)
● Combinator selector (descendant, child, adjacent sibling, general sibling)
● Pseudo-class selector
● Pseudo-element selector
● Attribute selector
e. Write a program to demonstrate the various ways you can reference a color in CSS.
f. Write a CSS rule that places a background image halfway down the page, tilting it horizontally. The
image should remain in place when the user scrolls up or down.
g. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv. text-decoration v. text-transformation vi. text-alignment
h. Write a program, to explain the importance of CSS Box model using
Content ii. Border iii. Margin iv. padding

UNIT III INTRODUCTION TO JAVASCRIPT - APPLYING 6 hours

JAVASCRIPT - INTERNAL AND EXTERNAL, I/O, TYPE
CONVERSION - JAVASCRIPT PRE-DEFINED AND USER-
DEFINED OBJECTS
a. Write a program to embed internal and external JavaScript in a web page.
b. Write a program to explain the different ways for displaying output.
c. Write a program to explain the different ways for taking input.
d. Create a webpage which uses prompt dialogue box to ask a voter for his name and age. Display
the information in table format along with either the voter can vote or not
e. Write a program using the following object properties and methods.
i. Document object
ii. array object
iii. math object
iv. string object
v. regex object
vi. date object
Write a program to explain user-defined object by using properties, methods, accessors, constructors
and display.

UNIT IV JAVASCRIPT CONDITIONAL STATEMENTS AND LOOPS - 6 hours

JAVASCRIPT FUNCTIONS AND EVENTS
a. Write a program which asks the user to enter three integers, obtains the numbers from the user
and outputs HTML text that displays the larger number followed by the words “LARGER
NUMBER” in an information message dialog. If the numbers are equal, output HTML text as
“EQUAL NUMBERS”.
b. Write a program to display week days using switch case.
c. Write a program to print 1 to 10 numbers using for, while and do-while loops.

91 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

d. Write aprogram to print data in object using for-in, for-each and for-of loops
e. Develop a program to determine whether a given number is an ‘ARMSTRONG NUMBER’ or not.
[Eg: 153 is an Armstrong number, since sum of the cube of the digits is equal to the number i.e.,13 +
53+ 33 = 153]
f. Write a program to display the denomination of the amount deposited in the bank in terms of
100’s, 50’s, 20’s, 10’s, 5’s, 2’s & 1’s. (Eg: If deposited amount is Rs.163, the output should be
1-100’s, 1-50’s, 1- 10’s, 1-2’s & 1-1’s)
g. Design a HTML having a text box and four buttons named Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate function should be called to display
1. Factorial of that number
2. Fibonacci series up to that number
3. Prime numbers up to that number
4. Is it palindrome or not
h. Write a program to validate the following fields in a registration page
i. Name (start with alphabet and followed by alphanumeric and the length should not be less
than 6 characters)
ii. Mobile (only numbers and length 10 digits)
iii. E-mail (should contain format like xxxxxxx@xxxxxx.xxx)

UNIT V UI/UX DESIGN PRINCIPLES AND TECHNIQUES 6 hours

a. Explain the basic principles of UI/UX design including user research, wireframing, prototyping,
and usability testing.
b. Create a wireframe for a simple website layout using a tool like Balsamiq or Figma.
c. Develop a prototype of the website layout created in the wireframe using HTML and CSS.

Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Understand basics of HTML
CO2: Proficient in HTML5 and CSS for Static Web Pages
CO3: Build dynamic Web Page Development with JavaScript
CO4: To utilise conditional statements, functions and events in web page development
CO5: Implement effective UI/UX Design

Text Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
2. Web Programming with HTML5, CSS and JavaScript, John Dean, Jones & Bartlett Learning,
2019
Reference Books:
1. Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React, and Node,
Vasan Subramanian, 2nd edition, APress, O’Reilly.

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

92 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

B. Tech II Year II Semester

23CHE901 ENVIRONMENTAL SCIENCE
L T P C
2 0 0 0
Course Objectives:
This course enables students to
1. To make the students to get awareness of the environment.
2. To understand the importance of protecting natural resources, ecosystems for future generations
and pollution causes due to the day-to-day activities of human life
3. To save the earth from the inventions by the engineers.
UNIT I MULTIDISCIPLINARY NATURE OF ENVIRONMENTAL STUDIES 6 hours
Definition, Scope, and Importance – Need for Public Awareness.
Natural Resources: Energy resources- Renewable and non-renewable resources – Natural resources and
associated problems – Forest resources – Use and over – exploitation, deforestation, case studies – Timber
extraction – Mining, dams and other effects on forest and tribal people – Water resources – Use and over
utilization of surface and ground water – Floods, drought, conflicts over water, dams – benefits and
problems – Mineral resources: Use and exploitation, environmental effects of extracting and using mineral
resources, case studies – Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case
studies.

UNIT II ECOSYSTEMS 7 hours

Concept of an ecosystem. – Structure and function of an ecosystem – Producers, consumers and
decomposers – Energy flow in the ecosystem – Ecological succession – Food chains, food webs and
ecological pyramids – Introduction, types, characteristic features, structure and function of the following
ecosystem:
a) Forest ecosystem.
b) Grassland ecosystem
c) Desert ecosystem.
d) Aquatic ecosystems (freshwater - ponds, streams, lakes, rivers, marine ecosystem- oceans, estuaries)

Biodiversity and its Conservation : Introduction, Definition: genetic, species and ecosystem diversity
– Bio-geographical classification of India – Value of biodiversity: consumptive use, Productive use,
social, ethical, aesthetic and option values – Biodiversity at global, National and local levels – India as
a mega-diversity nation – Hot-spots of biodiversity – Threats to biodiversity: habitat loss, poaching of
wildlife, man-wildlife conflicts – Endangered and endemic species of India – Conservation of
biodiversity: In-situ and Ex-situ conservation of biodiversity. Specific case studies.

UNIT III ORDERED STRUCTURES 6 hours

Definition, Cause, effects, and control measures of:
Air Pollution, Water pollution, Soil pollution, Marine pollution, Noise pollution, Thermal pollution,
nuclear hazards
Pollution case studies - Role of an individual in the prevention of pollution
93 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Solid Waste Management: Causes, effects and control measures of urban and industrial wastes
Disaster management: floods, earthquakes, cyclones and landslides.

UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 5 hours

Sustainable Development Goals, From Unsustainable to Sustainable development – Urban problems
related to energy – Water conservation, rainwater harvesting, watershed management – Resettlement and
rehabilitation of people; its problems and concerns. Case studies – Environmental ethics: Issues and
possible solutions – Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents,
and holocaust. Case Studies – Wasteland reclamation. – Consumerism and waste products. Environment
Protection Act. – Air (Prevention and Control of Pollution) Act. – Water (Prevention and Control of
Pollution) Act – Wildlife Protection Act – Forest Conservation Act – Issues involved in enforcement of
environmental legislation – Public awareness.

UNIT V HUMAN POPULATION AND THE ENVIRONMENT 6 hours

Population growth, variation among nations. Population explosion – Family Welfare Programmes. –
Environment and human health – Human Rights – Value Education – HIV/AIDS – Women and Child
Welfare – Role of Information Technology in Environment and human health – Case studies.
Field Work: Visit a local area to document environmental assets River/forest grassland/hill/mountain –
Polluted site - Urban/Rural/Industrial/Agricultural Study of common plants, insects, and birds – river,
hill slopes.

Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Exploring different types of renewable and non-renewable energy sources.
CO2: Students will learn about the structure and function of different ecosystems.
CO3: Students will learn about different types of pollution (air, water, soil) and their sources, effects,
and control measures.
CO4: Exploring the science behind climate change, its evidence, and its impacts on ecosystems and
human societies.
CO5: Understanding demographic factors and their environmental implications.

Text Books:
1. Textbook of Environmental Studies for Undergraduate Courses Erach Bharucha for University
Grants Commission, Universities Press, Third Edition, 2021.
2. Palaniswamy, “Environmental Studies”, Pearson Education, Second Edition, 2014.
3. S. Azeem Unnisa, “Environmental Studies” Academic Publishing Company
4. K. Raghavan Nambiar, “Textbook of Environmental Studies for Undergraduate Courses as per
UGC model syllabus”, Scitech Publications (India), Pvt. Ltd. Second Edition, 2008.
5. A. Koushik & C. P. Koushik, Perspectives in Environmental Studies, New Age International,
Fourth Edition, 2006.

94 | P a g e
 Dept. of Computer Science & Engineering (Artificial Intelligence & Machine Learning)

Reference Books:
1. Deeksha Dave and E. Sai Baba Reddy, “Textbook of Environmental Science”, Cengage
Publications, Second Edition, 2012.
2. M. Anji Reddy, “Textbook of Environmental Sciences and Technology”, BS Publication, Second
Edition, 2023.
3. J.P. Sharma, Comprehensive Environmental studies, Laxmi publications, Third Edition, 2009.
4. J. Glynn Henry and Gary W. Heinke, “Environmental Sciences and Engineering”, Prentice Hall
of India Private Limited, Second Edition, 2004.
5. G.R. Chatwal, “A Text Book of Environmental Studies” Himalaya Publishing House, Fourth
Edition, 2014.
6. Gilbert M. Masters and Wendell P. Ela, “Introduction to Environmental Engineering and Science,
Prentice Hall of India Private Limited, Third Edition, 2007.
Online Resources:
1. Atika Qazi; Fayaz Hussain; Nasrudin ABD. Rahim; Glenn Hardaker; Daniyal Alghazzaw,
"Towards sustainable energy: a systematic review of renewable energy sources, technologies, and
public opinions," 10.1109/ACCESS.2019.2906402, IEEE Access, vol. 7, pp. 63837-63851, 2019.
2. Gina Garland, Samiran Banerjee, Anna Edlinger, Emily Miranda Oliveira, Chantal Herzog,
Raphaël Wittwer, Laurent Philippot, Fernando T. Maestre, Marcel G. A. van der Heijden, "A closer
look at the functions behind ecosystem multifunctionality: A review," https://doi.org/10.1111/1365-
2745.13511, Journal of Ecology, vol. 109, no. 2, pp. 600-613, 2021.
3. Siddiqua, A, Hahladakis, J.N. and Al-Attiya, “An overview of the environmental pollution and
health effects associated with waste landfilling and open dumping,” https://doi.org/10.1007/s11356-
022-21578-z, Environmental Science and Pollution Research, 29(39), pp.58514-58536, 2022.
4. Seddon N, Chausson A, Berry P, Girardin C.A, Smith A. and Turner B, “Understanding the value
and limits of nature-based solutions to climate change and other global challenges,”
https://doi.org/10.1098/rstb.2019.0120, Philosophical Transactions of the Royal Society B, 375(1794),
p.20190120, 2020.
5. Hannes Weber and Jennifer Dabbs Sciubba, "The effect of population growth on the environment:
evidence from European regions," https://doi.org/10.1007/s10680-018-9486-0, European Journal
of Population, vol. 35, pp. 379-402, 2019.

Mode of Evaluation: Assignments and Mid Term Tests

95 | P a g e