GMRIT

Department of Computer Science and Engineering, GMRIT | Curriculum under Academic Regulation 2019

Academic Regulations, Curriculum and Syllabi

2023

B. Tech. CSE Specialization

Artificial Intelligence & Data Science
(Duration of Study: 4 years)

GMR Institute of Technology

Rajam 532 127, Andhra Pradesh
(An Autonomous Institute Affiliated to JNTU-GV Vizianagaram, AP)
Accredited by NAAC & NBA
 Academic Rules and Regulations

2023

Undergraduate Programs

GMR Institute of Technology

Rajam 532 127, Andhra Pradesh
(An Autonomous Institute, Affiliated to JNTU-GV, Vizianagaram, AP)
Accredited by NAAC & NBA
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Academic Regulation 2023

The Vision of GMRIT

 To be among the most preferred institutions for engineering and technological

education in thecountry
 An institution that will bring out the best from its students, faculty and staff – to learn,
to achieve, to compete and to grow – among the verybest
 An institution where ethics, excellence and excitement will be the work religion, while
research, innovation and impact, the workculture

The Mission of GMRIT

 To turnout disciplined and competent engineers with sound work and lifeethics
 To implement outcome based education in an IT-enabledenvironment
 To encourage all-round rigor and instill a spirit of enquiry and critical thinking among
students, faculty andstaff
 To develop teaching, research and consulting environment in collaboration with
industry and otherinstitutions

iii
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Academic Regulation 2023

Department Vision
To be a nationally preferred department of learning for students and teachers alike, with a
commitment to research in Artificial Intelligence & Data Science technologies and serving
the students in an atmosphere of innovation and critical thinking.

Department Mission
1. To prepare the graduates for a rewarding career in CSE- Artificial Intelligence & Data
Science and related industries, in tune with evolving needs of the industry in
diversified domains.
2. To prepare the students to become thinking professionals and good citizens who
would apply AI & DS technologies critically and innovatively to solve and automate the
professional and social problems.
Program Educational Objectives
PEO1: To produce the competent software engineers as team players in industry
and allied fields providing viable solutions.
PEO2: Adopt contemporary technologies for dynamic industry requirements with
self-paced learning providing scope for advanced research.
PEO3: Nurture professionalism with soft skills, managerial & leadership skills and
Ethical values

Program Outcomes

Engineering graduate will be able to

PO 1: Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems.
(Engineering knowledge)
PO 2: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences. (Problem analysis)
PO 3: Design solutions for complex engineering problems and design system components
or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental
considerations. (Design/development of solutions)
PO 4: Use research-based knowledge and research methods including design of
experiments, analysis and interpretation of data, and synthesis of the information
to provide valid conclusions. (Conduct investigations of complex problems)
PO 5: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations. (Modern tool
usage)
PO 6: Apply reasoning informed by the contextual knowledge to assess societal, health,
safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice. (The engineer and society)
PO 7: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for
sustainable development. (Environment and sustainability)
PO 8: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice. (Ethics)
PO 9: Function effectively as an individual, and as a member or leader in diverse teams,
and in multidisciplinary settings. (Individual and team work)
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Academic Regulation 2023

PO 10: Communicate effectively on complex engineering activities with the engineering

community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give
and receive clear instructions. (Communication)
PO 11: Demonstrate knowledge and understanding of the engineering and management
principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments. (Project management and
finance)
PO 12: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.
(Life-long learning)
PSO1: Ability to apply the artificial intelligence principles to meet automation of the
process and service industries apart from the community utilities.
(Program Specific)
PSO2: Ability to design, develop and implement management systems, E-Commerce tools
and WebApps for product development.(Program Specific)
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Curriculum | Academic Regulation 2023

Department of CSE-AI&DS
Minimum Credits to be earned: 160 (for Regular Students)
120 for Lateral Entry Students

Course
S.no. Course Name POs L T P C
Code
First Semester
23PYX01 Engineering Physics/Chemistry 3/3 3 0 0 3/3
1
23CYX01
23MAX01 Linear Algebra& Calculus/Differential 3/3 3 0 0 3/3
2
23MAX02 Equations and Vector calculus
23BEX01/ Basic Electrical and Electronics 3/3 3 0 0 3/3
3 23BEX02 Engineering/ Basic Civil & Mechanical
Engineering
4 23BEX03 Introduction to Programming 3 3 0 0 3
23BEX04/ Engineering Graphics/Communicative 2/2 2 0 2/0 3/2
5
23HSX01 English
23PYX02/ Engineering Physics Lab/Chemistry Lab 4 0 2/2 1/1
6
23CYX03/
23BEX05/ Electrical & Electronics Engineering 1,9,10/1,5,10 0 3/3 1.5/1.5
7
23BEX06 workshop/Engineering Workshop
8 23BEX07 Computer Programming Lab 4 - 0 3 1.5
9 23HSX11 -/ECA (Yoga / Sports) - - 0 -/1 -/0.5
10 23HSX12 -/CCA (NSS/NCC/Community Service) - - 0 -/1 -/0.5
11 23BEX08 IT Workshop/- 0 0 2/- 1/-
12 23HSX02 - /Communicative English Lab 0 0 -/2 -/1
Total 14/14 00 12/12 20/20
Second Semester
23HSX01/ Communicative English/ Engineering 2/2 0 0/2 2/3
1 10,12
23BEX04 Graphics
23MAX02/ Differential Equations and Vector 3/3 0 0 3/3
2 1
23MAX01 calculus/Linear Algebra& Calculus
23CYX01/ Chemistry /Engineering Physics 3/3 0 0 3/3
3 1/1
23PYX01
23BEX02/ Basic Civil & Mechanical Engineering/ 3/3 0 0 3/3
4 23BEX01 Basic Electrical and Electronics 1,12/1,12
Engineering
23CS201 Data Structures(CSE,CSE-AI&DS,CSE- 3/3 0 0 3/3
5 1,12
AI&ML, IT)
23CYX03/ Chemistry Lab / Engineering Physics 0 0 2/2 1/1
6 4
23PYX02 Lab
23BEX06/ Engineering Workshop/Electrical & 0 0 3/3 1.5/1.5
7 1,9,10/1,5,10
23BEX05 Electronics Engineering workshop
8 23BEX08 IT Workshop/- 4/4 0 0 2/- 1/-
9 23HSX02 Communicative English Lab/- -/10,12 0 0 2/- 1/-
23CS202 Data Structures Lab (CSE, CSE-AI&DS, 0 0 3/3 1.5/1.5
10 2,3,4,5
CSE-AI&ML, IT)
11 23HSX11 -/ECA (Yoga/ Sports) - - -/1 -/0.5
12 23HSX12 -/CCA (NSS/NCC/Community Service) - - -/1 -/0.5
Total 14/14 0 12/12 20/20
Third Semester
1 23CS301 Problem Solving using Python 2,3 3 - 2 4
2 23ML302 Artificial Intelligence 1,2,3 3 - - 3
3 23CS303 Design and Analysis of Algorithms 1,2,12 3 - - 3
4 23CS304 Digital Logic Design 1, 4 3 - 2 4
23DS305 Mathematical Foundation for Data 1,12,PSO1 3 - 3
5 -
Science
6 23CS306 Object Oriented Programming with JAVA 1,2,3 3 - - 3

i
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Curriculum | Academic Regulation 2023

7 23CS307 Design and Analysis of Algorithms Lab 2,3,4,5 - - 3 1.5

8 23CS308 JAVA Lab 2,3,4,5 - - 3 1.5
9 23BEA01 Environmental Studies 1,7 - - - -
10 23ESX01 Employability Skills I 1,2,5,8,10, 12 0 - 2 -
Total 18 - 12 23

Fourth Semester
1 23IT304 Database Management Systems 1,4,12 3 - - 3
2 23IT403 Operating Systems 1,12 3 - - 3
3 23CS403 Computer Organization and Architecture 1,12 3 - - 3
4 23MA404 Probability and Statistics using python 1,4, 12 3 - 2 4
5 23DS405 Foundations of Data Science 2, 3, PSO1, PSO2 3 - - 3
6 23IT308 Database Management Systems Lab 4 - - 3 1.5
7 23DS407 Foundations of Data Science Lab 4,5,8 - - 3 1.5
8 23ESX01 Employability Skills I 1,2,5,8,10, 12 0 - 2 2
Total 15 - 10 21
Fifth Semester
1 23IT405 Web Technologies 3,5,PSO1 3 - 2 3
2 23DS502 Deep Learning for Data Science 1,2,4,5,12 3 - - 3
3 23DS503 Data Analytics &Visualization Techniques 1,4,PSO1 3 - 2 3
4 23ML504 Computer Networks 1, 2,3 3 - - 3
5 Elective I (Professional Elective) 3 - - 3
6 Elective II (Open Elective I) 3 - - 3
7 23DS507 Deep Learning Lab 4,5,8 - - 3 1.5
8 23TPX01 Term Paper 1,4,10,12 - - 3 1.5
9 23ESX02 Employability Skills II 1,2,5,8,10,12 0 - 2 2
11 23SIX01 Summer Internship I 1,2,8,10,12 - - - 1
Total 18 - 12 24
Six Semester
1 23DS601 Optimization Techniques for ML 2,3,PSO1,PSO2 3 - - 3
2 23ML602 Automata Theory and Language 1,2,3 3 - - 3
Processors
3 23CS603 Software Engineering 4,5,8,11, PSO1 3 - - 3
4 Elective III (Professional Elective) 3 - 2 4
5 Elective IV (Open Elective II) 3 - - 3
6 23DS606 Optimization Techniques for ML Lab 4, 5 - - 3 1.5
7 23MPX01 Mini Project 4, 5,08 - - 3 1.5
8 23ESX02 Employability Skills II All POs & PSOs 0 - 2 2
9 23ATX01 Environmental Studies 6,7,9,10 - - - -
10 23ATX02 Professional Ethics and Human Values 1,7 - - - -
11 23ATX--- Audit Course ---- - - - -
12 15 - 10 21
Seventh Semester
1 Elective V (Professional Elective) 3 - - 3
2 Elective VI (Professional Elective) 3 - - 3
3 Elective VII (Open Elective III) 3 - - 3
4 23SIX02 Summer Internship II 1,2,5,6,10,12 - - - 1
5 23PWX01 Project Work All POs& PSOs - - 16 8
Total 9 - 16 18
Eighth Semester
1 Elective VIII (Professional Elective) - - - 3
2 Elective IX (Open Elective IV) - - - 2
1,2,5,8,9,10,
3 23FIX01 Full Semester Internship (FSI) - - - 8
PSO1,PSO2
Total 6 - - 13

ii
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Curriculum | Academic Regulation 2023

List of Electives
Language Electives
Contact Hours
No. Course Code Course POs
L T P C
1 23HSX03 Advanced Communicative English 2 - - 2
2 23HSX04 Communicative German 2 - - 2
3 23HSX05 Communicative French 2 - - 2
4 23HSX06 Communicative Japanese 10,12 2 - - 2
5 23HSX07 Communicative Spanish 2 - - 2
6 23HSX08 Communicative Korean 2 - - 2
7 23HSX09 Communicative Hindi 2 - - 2

Elective I
Career Path I
1 23MLC11 Computer Vision & Pattern Recognition 1,3,PSO1,PSO2 3 - - 3
2 23CSC21 Web Programming Languages 1,2,7,12 3 - - 3
3 23MLC31 Fundamentals of Cloud Computing 2,6,7,8 3 - - 3
4 23CS004 Principles of Programming Languages 1, 2, 3, 4 3 - - 3
5 23CS005 Mobile Computing 3, 8 3 - - 3
6 23CS006 Distributed Operating Systems 1,2 3 - - 3
Elective III
Career Path II
1 23MLC12 Machine Learning for Business Intelligence 2,3,PSO1,PSO2 3 - 2 4
2 23CSC22 Web Application Developments Framework (Full 1, 3,4 3 - 2 4
Stack Development)
3 23MLC32 Cloud Services using AWS 3 - 2 4
4 23CS007 Cloud Computing Essentials 2,5,6,7,8 3 - 2 4
5 23CS008 Cryptography and Network Security 3, 6,8 3 - 2 4
Elective V
Career Path III
1 23MLC13 Conversational AI 1,2,4,12,PSO1 3 - - 3
2 23CSC23 Web Application Databases (Full Stack 2,3 3 - - 3
Development)
3 23MLC33 Cloud Security Essentials 2,3 3 - - 3
4 23IT010 Social Network Analysis 2, 4, 5 3 - - 3
5 23ML001 Human Computer Interaction 2, 3 3 - - 3
6 23CS012 Wireless Adhoc Networks 2, 3 3 - - 3
Elective VI
1 23DS002 Data Visualization with Power BI 2,3,5,6 3 - - 3
2 23CS015 Software Project Management 3,6 3 - - 3
3 23ML003 Reinforcement Learning 6,7 3 - - 3

Elective VIII: Professional Elective

1 23CS018 Information Retrieval Systems 1,2,3,4 - - - 3
2 23CS019 Fundamentals of Devops 1,3, 5,8,10 - - - 3
3 23DS003 Cyber Security 1,3,4,5,PSO1 3

Audit Course
1 23AT001 Communication Etiquette in Workplaces - - - - -
2 23AT002 Contemporary India: Economy, Policy and Society - - - - -
3 23AT003 Design The Thinking - - - - -
4 23AT004 Ethics and Integrity - - - - -
5 23AT005 Indian Heritage and Culture - - - - -
6 23AT007 Intellectual Property Rights and Patents - - - - -
7 23AT008 Introduction to Journalism - - - - -
8 23AT009 Mass Media Communication - - - - -
9 23AT010 Science, Technology and Development - - - - -
10 23AT011 Social Responsibility - - - - -

iii
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Curriculum | Academic Regulation 2023

11 23AT012 The Art of Photography and Film Making - - - - -

12 23AT013 Gender Equality for Sustainability - - - - -
13 23AT014 Women in Leadership - - - - -
14 23AT015 Introduction to Research Methodology - - - - -
15 23AT016 Climate Change and Circular Economy - - - - -

B. Tech. (Honors)
Domain I (Data Engineering)
01 23CSH11 Advanced Data Structures 2,3,4 4 - - 4
02 23CSH12 Advanced Databases 2,3,4 4 - - 4
03 23CSH13 Programming, Data Structures and Algorithms Using 2,3,4,5 4 - - 4
Python
04 23CSH14 Bioinformatics 2,3 4 - - 4
Domain II (Modern Software Engineering)
01 23CSH21 DevOps 1,3,5,8,10 4 - - 4
02 23CSH22 Design Patterns 2,3 4 - - 4
03 23CSH23 Advanced Software Engineering 1,3,4, PSO1 4 - - 4
04 23CSH24 Robotic Process Automation 3,5, 8, PSO2 4 - - 4
Domain III (Security)
01 23CSH31 Computer Systems Security 1,2 4 - - 4
02 23CSH32 Python Programming for Security 2,3,4 4 - - 4
03 23CSH33 Management of Information Security 3,6,7 4 - - 4
04 23CSH34 Computer Forensics 2,3 4 - - 4
Domain IV (User Interface Design)
01 23CSH41 Computer Graphics 1,2,3,4 4 - - 4
02 23CSH42 Multimedia Systems 3,4 4 - - 4
03 23CSH43 Human Computer Interaction 2,3 4 - - 4
04 23CSH44 Mobile Programming 3,4 4 - - 4

B. Tech. (Minors)
CSE- Artificial Intelligence & Data Science
1 23DSM01 Fundamentals of Data Science -- 4 - - 4
2 23DSM02 Principles of Artificial Intelligence -- 4 - - 4
3 23DSM03 Statistics for Data Science using Python -- 4 - - 4
4 23DSM04 Deep Learning -- 4 - - 4
5 23DSM05 Natural Language Processing(MOOCs) -- 4 - - 4

iv
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23PYX01 - ENGINEERING PHYSICS

(Common to all branches of Engineering)
3003
Course Outcomes:
At the end of the Course, Student will be able to:
Course Outcomes:
1. Comprehend the basic principle of diffraction and observe the diffraction pattern in various cases
2. Illustrate the concepts of Interference and polarisation and their applications
3. Understand the space lattices and crystal symmetry
4. Summarize the fundamental concepts of quantum mechanics
5. Explore the properties and applications of dielectric and magnetic materials
6. Demonstrate the conduction process of charge carriers in semiconductors
Cos- POs Mapping
COs PO1 PO2 PO12
1 3 2 1
2 3 2 1
3 3 2 1
4 3 2 1
5 3 2 1
6 3 2 1
3 - Strongly Linked | 2 – Moderately Linked | 1 – Weakly Linked

Unit: I Wave Optics 13 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 10 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 Dielectric and Magnetic 12 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 dilectric constant – Frequency dependence of polarization – dielectric
loss
Magnetic Materials: Introduction - Magnetic dipole moment - Magnetization-Magnetic susceptibility 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

1
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Unit: IV Quantum Mechanics, Free electron theory and Semiconductors 13 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.
Semiconductors: 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
Total: 48 hours
Textbooks:
1. A Text book of Engineering Physics - M. N. Avadhanulu, P.G.Kshirsagar& TVS Arun Murthy, S. Chand
Publications, 11th Edition 2019.
2. Engineering Physics - M.R. Srinivasan, New Age international publishers (2009).
3. Engineering Physics - B.K. Pandey and S. Chaturvedi, Cengage Learning
Reference Books:
1. Engineering Physics - Shatendra Sharma, Jyotsna Sharma, Pearson Education, 2018.
2. Engineering Physics” - Sanjay D. Jain, D. Sahasrabudhe and Girish, University Press.
3. Engineering Physics - D.K.Bhattacharya and PoonamTandon, Oxford press (2015).

2
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CYX01 - CHEMISTRY – EEE, ECE, CSE, IT, AI&ML, AI&DS

3003
Course Outcomes
1. Illustrate the Molecular Orbital diagrams for simple diatomic and polyatomic molecules.
2. Identify the applications of super conductors, semi conductors and super capacitors & nano materials.
3. Explain the working of spectroscopy and Chromatography.
4. Explain the properties and applications of polymers & fibres.
5. Estimate the analytes using potentiometric & conductometric titrations and electrochemical sensors
6. Describe the construction and working of electrochemical cells.
COs – POs Mapping

Cos PO1 PO12

1 3 1
2 3 1
3 3 1
4 3 1
5 3 1
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Structure and Bonding Models:
Fundamentals of Quantum mechanics, Schrodinger Wave equation, significance of Ψ (psi) and Ψ 2 (psi square),
particle in one dimensional box, molecular orbital theory – bonding in homo- and heteronuclear diatomic
molecules – energy level diagrams of O2 and CO, etc. π-molecular orbitals of butadiene and benzene,
calculation of bond order. 10 Hours

Unit II
Modern Engineering materials & Instrumental methods & applications
Semiconductors – Introduction, basic concept, application-Super conductors-Introduction basic concept,
applications. Supercapacitors: Introduction, Basic Concept-Classification – Applications.
Nano materials: Introduction, classification, properties and applications of Fullerenes, carbonnano tubes and
Graphines nanoparticles.
Electromagnetic spectrum. Absorption of radiation: Beer-Lambert’s law. UV-VisibleSpectroscopy, electronic
transition, Instrumentation, IR spectroscopies, fundamental modesand selection rules, Instrumentation.
Chromatography-Basic Principle, Classification-HPLC:Principle, Instrumentation and Applications.
13 Hours
Unit III
Polymer Chemistry
Introduction to polymers, functionality of monomers, chain growth and step growth, polymerization,
coordination polymerization, with specific examples and mechanisms of polymer formation.
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),
Polyl Lactic Acid (PLA) 14 Hours

Unit IV
Electrochemistry & Applications
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.

3
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Primary cells – Zinc-air battery, Secondary cells –lithium-ion batteries- working of the batteries including cell
reactions; Fuel cells, hydrogen-oxygenfuel cell– working of the cells. Polymer Electrolyte Membrane Fuel cells
(PEMFC). 11 Hours
Total: 48 Hours

Textbooks:
1. A Text book of Engineering Physics - M. N. Avadhanulu, P.G.Kshirsagar& TVS Arun Murthy, S. Chand
Publications, 11th Edition 2019.
2. Engineering Physics - M.R. Srinivasan, New Age international publishers (2009).
3. Engineering Physics - B.K. Pandey and S. Chaturvedi, Cengage Learning
Reference Books:
1. Engineering Physics - Shatendra Sharma, Jyotsna Sharma, Pearson Education, 2018.
2. Engineering Physics” - Sanjay D. Jain, D. Sahasrabudhe and Girish, University Press.
3. Engineering Physics - D.K.Bhattacharya and PoonamTandon, Oxford press (2015).

4
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CYX02 - ENGINEERING CHEMISTRY – CIVIL, MECH

3003
Course Outcomes
CO1: Assess the quality of water and its treatment methods
CO2: Estimate the potentials for electrochemical cells
CO3: Describe corrosion factors and implement prevention methods.
CO4: Illustrate the types of polymers and Fuels with applications
CO5: Describe the concepts of colloids, micelle and nanomaterials
CO6: Explain the uses of refractory materials, lubricants and cements.
COs – POs Mapping
COs PO1
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT I: Water Technology

Soft and hardwater, Estimation of hardness of water by EDTA Method, Estimation of dissolved Oxygen -Boiler
troubles –Priming, foaming, scale and sludge, Caustic embrittlement, Industrial water treatment –
Specifications for drinking water, Bureau of Indian Standards(BIS) and World health
organization(WHO)standards, Ion-exchange processes - desalination of brackish water, reverse osmosis (RO)
and electrodialysis 10 Hours

UNIT II: Electrochemistry and Applications

Electrodes –electrochemical cell, Nernst equation, cell potential calculations. Primary cells – Zinc-air battery,
Secondary cells – Nickel-Cadmium (NiCad),and lithium ion batteries- working principle of the batteries
including cell reactions; Fuel cells-Basic Concepts, the principle and working of hydrogenoxygen Fuel cell.
Corrosion: Introduction to corrosion, electrochemical theory of corrosion, differential aeration cell corrosion,
galvanic corrosion, metal oxide formation by dry electrochemical corrosion, Pilling Bedworth ratios and uses,
Factors affecting the corrosion, cathodic and anodic protection, electroplating and electro less plating (Nickel
and Copper). 12 Hours

UNIT III: Polymers and Fuel Chemistry

Introduction to polymers, functionality of monomers, Mechanism of chain growth, step growthpolymerization.
Thermoplastics and Thermo-setting plastics-: Preparation, properties and applications ofpoly styrene. PVC
Nylon 6,6 and Bakelite. Elastomers – Preparation, properties and applications of BunaS, Buna N, Thiokol
rubbers.
Fuels – Types of fuels, calorific value of fuels, numerical problems based on calorific value; Analysis ofcoal
(Proximate and Ultimate analysis), Liquid Fuels, refining of petroleum, Octane and
Cetanenumberalternativefuels- propane, methanol, ethanol and bio fuel-bio diesel. 10 Hours

UNIT IV: Surface Chemistry and Modern Engineering Materials

Surface Chemistry- Introduction to surface chemistry, colloids, nanometals and nanometal oxides,
micelleformation, synthesis of colloids (Braggs Method), adsorption isotherm (Freundlich and Longmuir),
BETequation (no derivation).Nano Materials- Chemical and biological methods of preparation of nanometals
and metal oxides,stabilization of colloids and nanomaterials by stabilizing agents, applications of colloids and
nanomaterials– catalysis, medicine, sensors, etc.Composites- Definition, Constituents, Classification- Particle,
Fibre and Structural reinforced composites,
properties and Engineering applications

5
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Refractories and lubricants- Classification, Properties, Factors affecting the refractory materials
andApplications. Lubricants- Classification, Functions of lubricants, Mechanism, Properties of lubricating oils–
Viscosity, Viscosity Index, Flash point, Fire point, Cloud point, saponification and Applications.Building
materials- Portland cement, constituents, Setting and Hardening of cement.
16 Hours

Total: 48 Hours

Textbook (s)
1. P.C. Jain and Monica Jain, Engineering Chemistry,16thEd., DhanpatRai Publishing Company, New Delhi,
2015.
2. Peter Atkins, Julio de Paula and James Keeler, Atkins’ Physical Chemistry, 10/e, Oxford University Press,
2010.
3. C.N.R. Rao, A. Muller and A.K. Cheetham, Nanomaterials Chemistry: Recent Developments and New
Directions, 2010.
Reference (s)
1. H.F.W. Taylor, Cement Chemistry, 2/e, Thomas Telford Publications, 1997.
2. D.J. Shaw, Introduction to Colloids and Surface Chemistry, Butterworth-Heineman, 1992.
3. Textbookof Polymer Science, Fred W. BillmayerJr, 3rd Edition

6
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23MAX01 -LINEAR ALGEBRA & CALCULUS

3003
Course Outcomes: At the end of the course, the student will be able to
1. Solve the system of linear equations
2. Construct the eigenvectors of a matrix, use the applications of Cayley Hamilton theorem
3. Identify the nature of the quadratic form using matrix theory
4. Apply Mean value theorems to solve single variable problems.
5. Make use of partial derivatives to solve multivariable problems
6. Utilize multiple integrals to find the area and volume of solids
COs – POs Mapping

COs PO1
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT – I Matrices
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, Gauss Seidel Iteration Method.
12 Hours
UNIT – II Linear Transformation and Orthogonal 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 canonical forms by Orthogonal Transformation.
12 Hours
UNIT – III Single and Multi-Variable Calculus
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.
Partial differentiation: Partial derivatives, total derivatives, chain rule, change of variables, Taylor’s and
Maclaurin’s series expansion of functions of two variables. Jacobians, maxima and minima of functions of two
variables, method of Lagrange multipliers. 14 Hours

UNIT – IV Multiple Integrals

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). 10 Hours
Total: 48 Hours
Textbooks:
1. B. S. Grewal, Higher Engineering Mathematics, 44/e, Khanna Publishers,2017.
2. Erwin Kreyszig, Advanced Engineering Mathematics, 10/e, John Wiley & Sons, 2018.

Reference Books:
1. R. K. Jain and S. R. K. Iyengar, Advanced Engineering Mathematics, 5/e, Alpha Science International
Ltd., 2021 (9th reprint).
2. George B. Thomas, Maurice D. Weir and Joel Hass, Thomas Calculus, 14/e, Pearson Publishers, 2018.
3. Glyn James, Advanced Modern Engineering Mathematics, 5/e, Pearson publishers, 2018.
4. Michael Greenberg, Advanced Engineering Mathematics, 9 th edition, Pearson edn
5. H. K Das, Er. RajnishVerma, Higher Engineering Mathematics, S. Chand,2021.
7
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX01 BASIC ELECTRICAL & ELECTRONICS ENGINEERING

(Common to all branches of Engineering)
3003
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.
Course Outcomes: After the completion of the course students will be able to
1. Explain the basic concepts of DC and AC electrical circuits.
2. Illustrate the construction and working of electrical machines, measuring instruments and various
power plants.
3. Outline electrical safety measures and energy consumption calculations.
4. Explain the operation of semiconductor devices and their characteristics.
5. Illustrate the operation of rectifiers, amplifiers, and electronic instrumentation system.
6. Illustrate the number systems, binary codes, combinational and sequential circuits using logic gates.

COs – POs Mapping

COs PO1 PO2 PSO1
1 3 2 2
2 3 2 2
3 3 2 2
4 3 2 2
5 3 2 2
6 3 2 2

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

PART A: BASIC ELECTRICAL ENGINEERING

UNIT I: DC Circuits, AC Circuits & Electrical Machines
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: AC 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).
Electrical Machines 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.

UNIT II: Measuring Instruments, Energy Resources, Electricity Bill & Safety Measures
Measuring Instruments: Construction and working principle of Permanent Magnet Moving Coil (PMMC),
Moving Iron (MI) Instruments and Wheat Stone bridge.
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 electricity tariff, 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.

PART B: BASIC ELECTRONICS ENGINEERING

UNIT III: SEMICONDUCTOR DEVICES AND ELECTRONIC CIRCUITS
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.
8
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

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 IV: DIGITAL ELECTRONICS

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 Boolean Algebra, Truth Tables and
Functionality of Logic Gates – NOT, OR, AND, NOR, NAND, XOR and XNOR. Simple combinational circuits–Half
and Full Adders. Introduction to sequential circuits, Flip flops, Registers and counters (Elementary Treatment
only).

Textbooks:
1. R. L. Boylestad & Louis Nashlesky, Electronic Devices & Circuit Theory, Pearson Education, 2021.
2. Basic Electrical Engineering, D. C. Kulshreshtha, Tata McGraw Hill, 2019, First Edition
3. Power System Engineering, P.V. Gupta, M.L. Soni, U.S. Bhatnagar and A. Chakrabarti, Dhanpat Rai & Co,
2013
4. Fundamentals of Electrical Engineering, Rajendra Prasad, PHI publishers, 2014, Third Edition.
5. R. P. Jain, Modern Digital Electronics, 4th Edition, Tata Mc Graw Hill, 2009
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 University Press, 2017
4. R. S. Sedha, A Textbook of Electronic Devices and Circuits, S. Chand & Co, 2010.
5. Santiram Kal, Basic Electronics- Devices, Circuits and IT Fundamentals, Prentice Hall, India, 2002.
6. R. T. Paynter, IntroductoryElectronic Devices & Circuits – Conventional Flow Version, Pearson
Education,2009

9
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX02 - BASIC CIVIL & MECHANICAL ENGINEERING

(Common to All branches of Engineering)
3003
Course Objectives:
 Explain different engineering materials and manufacturing mechanical processes.
 Provide an overview of different thermal and mechanical systems, Introduce basic of robots and its
applications.
Course Outcomes: On completion of the course, the student will be able to:
CO1: Describe the basics of civil engineering streams, water resources and environmental engineering.
CO2: Outline the concepts of surveying.
CO3: Demonstrate the pavements and the concept of Airport, Harbour, Tunnel & Railway Engineering
CO4: Understand about the different Engineering Materials, Manufacturing process and the role of mechanical
Engineering in different sectors.
CO5: Understand the basic concepts of thermal engineering and working principles of different power plants.
CO6: Describe the working of different mechanical power transmission systems and basic configurations and
applications of robots.
COs – POs Mapping:

CO’s PO1 PO2 PO3 PO6 PO7 PO8 PO12

1 3 - - 2 2 2 1
2 3 3 3 1 2 - 1
3 3 - - 1 2 - 1
4 3 - - 2 2 - 1
5 3 - - 2 2 - 1
6 3 - - 2 2 - 1
3–Strongly linked | 2–Moderately linked| 1–Weakly linked

UNIT I Basics of Civil Engineering

Basics of Civil Engineering: 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.
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). 12 Hours

UNIT II Surveying and Transportation Engineering

Surveying: Objectives of Surveying - Horizontal Measurements- Angular Measurements- Introduction to
Bearings, Levelling instruments used for levelling -Simple problems on levelling and bearings-Contour
mapping.
Transportation Engineering: 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 12 Hours

UNIT III
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 Material: Metals-Ferrous and Non-ferrous, Ceramics, Composites, Smart materials.
Manufacturing Processes: Principles of Casting, Forming, joining processes, Introduction to CNC machines,
3D printing, and Smart manufacturing. 11 Hours

UNIT IV
Thermal Engineering: working principle of Boilers, Otto cycle, Diesel cycle, Refrigerator and air-conditioner,
IC engines, 2-Stroke and 4-Stroke engines, SI/CI Engines, Components of Electric and Hybrid Vehicles.
10
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

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: configurations and applications of robots. 13 Hours

Textbooks:
1. Basics of Civil and Mechanical Engineering, O. Srikanth and M. Sreenivasa Reddy, S. Chand and company
limited, first edition, 2024.
2. Basic Civil Engineering, M. S. Palanisamy, Tata Mcgraw Hill publications (India) Pvt. Ltd. Fourth Edition.
3. Introduction to Civil Engineering, S. S. Bhavikatti, New Age International Publishers. 2022. First Edition.
4. Basic Civil Engineering, SatheeshGopi, Pearson Publications, 2009, First Edition.
5. Internal Combustion Engines by V.Ganesan, By Tata McGraw Hill publications (India) Pvt. Ltd.
6. A Text book of Theory of Machines by S.S. Rattan, Tata McGraw Hill Publications, (India) Pvt. Ltd.
7. An introduction to Mechanical Engg by Jonathan Wicker and Kemper Lewis, cengage learning India pvt.
Ltd.

Reference Books:
1. Surveying, Vol- I and Vol-II, S.K. Duggal, Tata McGraw Hill Publishers 2019. Fifth Edition.
2. Hydrology and Water Resources Engineering, Santosh Kumar Garg, Khanna Publishers, Delhi. 2016.
3. Irrigation Engineering and Hydraulic Structures - Santosh Kumar Garg, Khanna Publishers, 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.
6. AppuuKuttan KK, Robotics, I.K. International Publishing House Pvt. Ltd. Volume-I
7. 3D printing & Additive Manufacturing Technology- L. Jyothish Kumar, Pulak M Pandey, Springer
publications
8. Thermal Engineering by Mahesh M Rathore Tata Mcgraw Hill publications (India) Pvt. Ltd.
9. G. Shanmugam and M.S.Palanisamy, Basic Civil and the Mechanical Engineering, Tata Mcgraw Hill
publications (India) Pvt. Ltd.

11
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX03 - INTRODUCTION TO PROGRAMMING

(Common to all branches of Engineering)
3003
Course Outcomes:
At the end of the Course, Student should be able to:
1. Illustrate the Algorithms for programming and problem solving.
2. Formulate sequential and iterative programming.
3. Implement Basic Dynamic Data structures
4. Develop Modular program aspects in solving complex problems.
5. Apply the concepts for optimal utilization of memory
6. Understand the techniques of storage and processing the data.
COs – POs Mapping:

COs PO1 PO2 PO12

1 3 3 2
2 3 2 2
3 3 3 2
4 3 3 2
5 3 2 2
6 3 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNITI
Introduction to Computer Problem Solving:
Programs and Algorithms, Computer Problem Solving Requirements, Phases of Problem Solving,
Problem Solving Strategies, Top-Down Approach, Algorithm Designing, Program Verification, Improving
Efficiency, Algorithm Analysis and Notations.
Introduction, Structure of a C Program, Comments, Keywords, Identifiers, Data Types, Variables, Constants,
Input/output Statements. Operators, Type Conversion Relational Expressions

UNITII
Introduction to C Programming:
Control Flow, Conditional Branching Statements: if, if-else, if-else—if, switch. Basic Loop Structures: while, do-
while loops, for loop, nested loops, The Break and Continue Statements, goto statement.
Arrays:
Introduction, Operations on Arrays, Arrays as Function Arguments, Two Dimensional Arrays, Multidimensional
Arrays.
Strings: String Fundamentals, String Processing with and without Library Functions, Pointers and Strings.

UNIT- III
Functions: Introduction Function: Declaration, Function Definition, Function Call, Categories of Functions,
Passing Parameters to Functions, Scope of Variables, Variable Storage Classes, Recursion.
Pointers: Concept of a Pointer, Declaring and Initializing Pointer Variables, Pointer Expressions and Address
Arithmetic, Null Pointers, Generic Pointers, Pointers as Function Arguments, Pointers and Arrays, Pointer to
Pointer, Dynamic Memory Allocation, Dangling Pointer, Command Line Arguments.

UNIT-IV
Structures, Unions, Bit Fields: Introduction, Nested Structures, Arrays of Structures, Structures and Functions,
Self-Referential Structures, Unions, Enumerated Data Type —Enum variables, Using Type def keyword, Bit
Fields. Data Files: Introduction to Files, Using Files in C, Reading from Text Files, Writing to Text Files, Random
File Access.

12
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook(s)
1. A Structured Programming Approach UsingC, Forouzan, Gilberg, 3rd Edition, Cengage.
2. How to solve it by Computer. G. Dromey, 12thEdition, Pearson Education.
3. Programming In CA-Practia1Approach.AjayMittal, 1st Edition Pearson

References:
1. Byron Gottfried, Schaum’s Outline of Programming with C, 4thEdition, 2020, McGraw-Hill.
2. ComputerProgramming.ReemaThareja, 3rd Edition, 2023, Oxford University Press
3. The C Programming Language, Dennis Richie And Brian Kernighan, 2nd Edition, Pearson Education.
4. Programming InC, Ashok Kamthane,2nd Edition,PearsonPublication.

13
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX04 - ENGINEERING GRAPHICS

(Common to All branches of Engineering)
2023
Course Objectives:

The students completing the course are expected to:

 Understand the basic principles and conventions of engineering drawing, use engineering instruments
and draw engineering curves.
 Use orthographic projections and make the students draw the projections of lines and planes inclined
to both the planes.
 Draw the projections of the solids in different positions with respect to the reference planes.
 Understand the importance of sectioning and concept of development of surfaces.
 Represent and convert isometric views to orthographic views and vice versa.

Course Outcomes: On completion of the course, the student should be able to:
 Understand the principles of engineering drawing, including engineering curves, scales, orthographic
and isometric projections.
 Draw and interpret orthographic projections of points, lines, planes and solids in front, top and side
views.
 Construct Ortho graphic projections of Solids in simple positions.
 Understand and apply concepts of sectional views to represent details of solids in inclined positions
using CAD software.
 Gain a clear understanding of the principles behind development of surfaces and to understand how to
unfold basic geometric shapes into flat patterns using CAD software.
 Develop the ability to draw isometric views and orthographic views and should be able to convert
isometric views to orthographic views and vice versa using CAD software.
COs – POs Mapping
COs PO1 PO5 PO10
l 3 - 2
2 3 - 2
3 3 - 2
4 3 3 2
5 3 3 2
6 3 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT I
Introduction: Lines, Lettering and Dimensioning, Geometrical Constructions and Constructing regular
polygons by general methods.
Curves: construction of ellipse, parabola and hyperbola by general and special methods – Arcs of circle
method, concentric circles method, Oblong method, Rectangle method, Normal and tangent to Curves.
Scales: Introduction to scales, Plain scales, Diagonal scales. 9 Hours

UNIT II
Projections of Points &Straight Lines:Projections of points, 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.
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. (Conventional drawing
up to this) 9 Hours
(Using CAD)

14
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

UNIT III
Projections of Solids
Introduction to AUTOCAD, Projection of Solids with axis inclined to one reference plane and parallel to other,
Projection of Solids with axis parallel to both the reference planes.
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. 10 Hours

UNIT IV
Conversion of Views: Conversion of isometric views to orthographic views; Conversion of orthographic views
to isometric views. 10 Hours

Total: 48 Hours
Textbook:
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, Tata McGraw Hill, 2017.

15
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23HSX01 COMMUNICATIVE ENGLISH

(Common to all branches of Engineering)
2002
Course Outcomes
At the end of the course the students will be able to
1. Understand the context, topic, and specific information from social or transactional dialogues.
2. Speak clearly using discourse markers in formal and informal discussions.
3. Comprehend and appreciate literary texts by reading.
4. Write summaries, coherent paragraphs, essays, letters/e-mails and resume.
5. Apply grammatical structures to formulate sentences appropriately.
6. Exhibit communicative competence in formal and informal contexts.
COs – POs Mapping
COs PO10 PO12
l 3 l
2 3 1
3 3 1
4 3 1
5 3 1
6 3 1
3-Strongly linked 12-Moderately linked I I-Weakly linked

Unit I
Lesson : The power of plate of Rice- Ifeoma Okoye
Listening: Identifying the topic, the context and specific pieces of information by listening to 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 of information.
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 2
Lesson: Night of the Scorpion by Nissim Ezekiel, Steve Jobs
Listening: Answering a series of questions about main ideas and supporting ideas after listening to audio texts.
Listening for global comprehension and summarizing what is listened
Speaking: Discussion in pairs/small groups on specific topics followed by short structure talks and reporting
what is discussed
Reading: Identifying sequence of ideas; verbal techniques that connect ideas in a paragraph, reading a text by
making inferences-using context clues for comprehension.
Writing: Structure of a paragraph - Paragraph writing (specific topics), summarizing
Grammar: Cohesive devices -linkers, use of articles and zero article, prepositions.
Vocabulary: Homonyms, Homophones, Homographs.

Unit 3
Lesson: The Toys of Peace by Saki
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: Note-making, paraphrasing Letter Writing: Official Letters, Resumes
Grammar: Verbs – tenses, subject-verb agreement Reporting verbs, Direct & Indirect speech, Active & Passive
Voice
16
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Vocabulary: Words often confused, Compound words, Collocations

Unit 4
Lesson: The Power of Interpersonal Communication
Listening: Identifying key terms, understanding concepts and answering a series of relevant questions that
test comprehension.
Speaking: Formal oral presentations on topics from academic on texts
Reading: Reading comprehension.
Writing: Writings structured essays on specific topics.
Grammar: Editing short texts –identifying and correcting common errors in grammar and usage (articles,
prepositions, tenses, subject-verb agreement)
Vocabulary: Jargons, Technical vocabulary

Textbook (s)
1. Pathfinder: Communicative English for Undergraduate Students, 1st Edition, Orient Black Swan, 2023.
2. Empowering English by Cengage Publications, 2023
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.

17
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23PYX02 - ENGINEERING PHYSICS LAB

(Common to all branches of Engineering)
0021
Course Outcomes: The students will be able to

Course Outcomes: The students will be able to

CO1: Infer the knowledge from the scientific methods and learn the process of measuring different
physical parameters
CO2: Develop the laboratory skills in handling of electrical and optical instruments
CO3: Demonstrate the spectral patterns produced by different light sources
CO4: Inspect and experience physical principles of magnetic fields and optical fiber communications
CO5: Apply the principles of physics and measure the solid state properties of materials
CO6: Design and analyse experiment based on physics concepts
COs – POs Mapping

COs PO4 PO9 PO11

1 3 2 2
2 3 2 2
3 3 2 2
4 3 2 2
5 3 2 2
6 3 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

List of Experiments:
1. Study of variation of magnetic field along the axis of current-carrying circular coil-Stewart and Gee’s
Method.
2. Determination of wavelengths of spectral line of mercury spectrum using diffraction grating.
3. Determination of radius of curvature of convex lens by forming Newton’s rings.
4. Study of series and parallel Resonance in LCR circuit.
5. Measurement of thickness of a thin paper using wedge method.
6. Calculation of Numerical Aperture (NA) and bending losses of a given fiber.
7. Determination of frequency of an electrically vibrating tuning fork in Transverse and longitudinal
modes - Melde’s Experiment.
8. Determination of wavelength of Laser by diffraction grating.
9. Determination of Hall Coefficient and charge carrier density of semi-conductor.
10. Determination of Band gap of a semiconductor.
11. Determination of Rigidity modulus of a given wire using torsional pendulum.
12. Determination of size of particle using diffraction pattern.
13. Verification of Malu’s law.
14. Determination of temperature coefficients of a thermistor.
15. Determination of dispersive power of the material of a prism.
16. Determination of Time constant of an R-C circuit.

List of Augmented Experiments1

1. To study the magnetization (M) of a ferromagnetic material in the presence of a magnetic field B and to
plot the hysteresis curve (M vs. B)
2. Study the Thermoemf of the thermo couple
3. LCR Series and Parallel–Design of circuit for various resonance frequencies
4. Determination of characteristics of Laser beam
5. Determination of Horizontal component of earth’s magnetic field
6. Study of double refraction in calcite crystals

1
Students shall opt any one of the Augmented Experiments in addition to the regular experiments
18
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

7. Dispersive power of various liquids using spectrometer

8. Photo cell–Characteristics and determination of Planks constant
9. Michelson’s interferometer.

References:

1. Physics Lab manual–Department of Physics, BS & H, GMRIT, Rajam, 2019

2. S. Balasubramanian, M.N. Srinivasan “A Text book of Practical Physics”- S Chand Publishers, 2017
3. Y. Aparna and K. Venkateswararao, Engineering Physics–I and II, VGS Techno series, 2010
4. S. Panigrahi and B. Mallick, Engineering Practical Physics, Cengage leaning, Delhi, 2015
5. http://www.amrita.vlab.co.in Virtual Labs, Amrita University.
6. http:/www./iitk.vlab.co.in

19
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CYX03 - CHEMISTRY LAB – EEE, ECE, CSE, IT, AI&ML, AI&DS

0021
Course outcomes:
At the end of course student will be able to
CO1: Determine the concentration of acids by Conductometry.
CO2: Prepare the Bakelite polymer and ZnO nanomaterial
CO3: Estimate the strength of an acid present in secondary battery by pH metry
CO4: Identify the organic compounds by IR Spectroscopy.
CO5: Verify the Beer- Lamberts law and measure the wavelength
CO6: Estimate concentration of ferrous iron by potentiometry and dichrometry
COs – POs Mapping

COs PO4 PO1

1 3 1
2 3 1
3 3 1
4 3 1
5 3 1
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
LIST OF EXERCISES:
1. Introduction to qualitative analysis- Demonstration
2. Measurement of 10Dq by spectrophotometric method
3. Conductometric titration of strong acid vs. strong base
4. Conductometric titration of weak acid vs. strong base
5. Determination of cell constant and conductance of solutions
6. Potentiometry - determination of redox potentials and emfs
7. Determination of Strength of an acid in Pb-Acid battery
8. Preparation of a Bakelite
9. Verify Lambert-Beer’s law
10. Wavelength measurement of sample through UV-Visible Spectroscopy
11. Identification of simple organic compounds by IR
12. Preparation of nanomaterials by precipitation method
13. Estimation of Ferrous Iron by Dichrometry
14. Determination of acid number of lubricating oil
15. Determination of Hardness of a groundwater sample.
16. Determination of Viscosity of lubricating oil by Redwood Viscometer 1
List of Augmented Experiments1
1. Assessment of synthesis of carbon fibers by polymerization
2. Synthesis of nanomaterials by other nanomethodlogy
3. Identification of simple organic compounds by IR
4. Making a battery of required potential
5. Calculation of Ferrous Iron by Dichrometry.
6. Find the acid number of various industrial oils or edible oils
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

20
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CYX04 - ENGINEERING CHEMISTRY LAB – CIVIL, MECH

0021
Course outcomes:
At the end of course student will be able to
CO1: Asses the percentage moisture of a solid fuel
CO2: Prepare the Bakelite polymer and ZnO nanomaterial
CO3: Determine acid number and viscosity of lubricating oil
CO4: Estimate the Iron and Calcium in cement.
CO5: Estimate the hardness and dissolved oxygen in water.
CO6: Determine the Strength of an acid in lead acid Battery
COs – POs Mapping

COs PO4 PO1

1 3 1
2 3 1
3 3 1
4 3 1
5 3 1
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
LIST OF EXERCISES:
1. Introduction to Quantitative Analysis - Demonstration
2. Determination of Hardness of a groundwater sample.
3. Estimation of Dissolved Oxygen by Winkler’s method
4. Determination of Fluoride in water sample
5. Determination of nitrite in water sample by spectrometric method
6. Determination of percentage of Iron in Cement sample by colorimetry
7. Estimation of Calcium in Portland cement
8. Determination of Strength of an acid in Pb-Acid battery
9. Preparation of a polymer (Bakelite)
10. Preparation of nanomaterials by precipitation method
11. Adsorption of acetic acid by charcoal
12. Determination of percentage Moisture content in a coal sample
13. Determination of acid number of lubricating oil
14. Determination of Viscosity of lubricating oil by Redwood Viscometer 1
15. Determination of Viscosity of lubricating oil by Redwood Viscometer 2
16. Determination of Calorific value of gases by Junker’s gas Calorimeter
List of Augmented Experiments1
1. Assessment of ground water quality of your village/Mandal (by taking min. 6 locations and determining min.
4 parameters – Fluoride, Chloride, Hardness, TDS etc.)
2. Preparation of a desired quality of Viscosity Index lubricating oil
3. Proximate analysis of coal – Ultimate analysis of coal
4. Making a battery of required potential
5. Energy scenario in India- Various sources, % consumption, solutions to meet future demand etc.
6. Find the viscosity of various edible and non-edible lubricating oils
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
2. Waste Water Engineering Treatment and Reuse, 4th Edition, Metcalf and Eddy, Inc
3. Engineering chemistry laboratory manual & record By Srinivasulu D. Parshva publications

21
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX05 - ELECTRICAL & ELECTRONICS ENGINEERING WORKSHOP

(Common to All branches of Engineering)
0 0 3 1.5
Course Outcomes
1. Apply fundamental electrical principles to resolve complex circuit problems.
2. Develop proficiency in conducting electrical measurements and studying machine
characteristics for practical applications.
3. Demonstrate skills in measuring power parameters and calculate energy
consumption for residential applications.
4. Analyze the characteristics of semiconductor devices
5. Find the frequency response of amplifiers using BJT
6 . Verify the truth tables of logic gates and basic flip flops

CO–PO Mapping
COs PO1 PO4 PO5

1 3 3 1

2 3 3 1

3 3 3 1

4 3 3 1

5 3 3 3

6 3 3 1

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

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 used by 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 LAB

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

22
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

6. Measurement of Earth Resistance using Megger

7. Calculation of Electrical Energy for Domestic Premises
Note: Minimum Six Experiments to be performed.

PART B: ELECTRONICS ENGINEERING LAB

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 rectifiers Plot Input & Output characteristics of BJT in CE and
CB configurations
4. Frequency response of CE amplifier.
5. Simulation of RC coupled amplifier with the design supplied
6. Verification of Truth Table of AND, OR, NOT, NAND, NOR, Ex-OR, Ex-NOR gatesusing ICs.
7. 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.

List of Augmented Experiments.

1. Connections of Tube Light wiring
2. Connections of Godown Wiring
3. Connections of stair case wiring
4. Generate fixed positive 5V using IC7405
5. Generate fixed Negative 5V using IC7905
6. Generate sinusoidal wave form using function generator

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.
4. Basic Electrical Engineering, D. C. Kulshreshtha, Tata McGraw Hill, 2019, FirstEdition
5. Power System Engineering, P.V. Gupta, M.L. Soni, U.S. Bhatnagar and A. Chakrabarti,Dhanpat Rai & Co, 2013
6. Fundamentals of Electrical Engineering, Rajendra Prasad, PHI publishers, 2014, Third Edition
Note: Minimum Six Experiments to be performed. All the experiments shall be implementedusing both
Hardware and Software.

23
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX06 - ENGINEERING WORKSHOP

(Common to all branches of Engineering)
0 0 3 1.5
Course Outcomes:
At the end of this course a student will be able to
1. Demonstrate the simple wooden components like Cross Lap joint, T-Lap joint, Dovetail Joint.
2. Develop the simple house hold items like Taper Tray, Square box, Open Scoop using sheet metal.
3. Build the V- Fit, Square fit, Dovetail fit using mild steel.
4. Understand simple house wiring circuits like Parallel/Series connection of three bulbs, Stair Case Wiring,
Godown Wiring.
5. Create the Green Sand Mould for given the patterns like rectangular shape, circular shape.
6. Construct the metal joint using Arc Welding like: Lap joint, Butt joint.
COs – POs Mapping:
COs PO1 PO9 PO12
1 3 3 2
2 3 3 2
3 3 3 2
4 3 3 2
5 3 3 2
6 3 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

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

Wood Working: Familiarity with different types of woods and tools used in wood working and make following
joints: a) Cross Lap joint, b) T-Lap joint, c) Dovetail Joint.
Sheet Metal Working: Familiarity with different types of tools used in sheet metal working, Developments of
following sheet metal job from GI sheets: a) Taper Tray, b) Square box, c) Open Scoop.
Fitting: Familiarity with different types of tools used in fitting and do the following fitting exercises: a) V- Fit,
b) Dovetail fit, c) Half Round Fit.
Electrical Wiring: Familiarity with different types of basic electrical circuits and make the following
connections: a) Parallel/Series connection of three bulbs, b) Stair Case Wiring, c) Godown Wiring
Foundry: Demonstration of Moulding tools and processes, Preparation of Green Sand Moulds for given
Patterns: a) rectangular shape mould, b) circular shape mould
Welding Shop: Demonstration and practice on Arc Welding. Preparation of a) Lap joint and b) Butt joint.

LIST OF EXPERIMENTS:
Wood Working:
1. Cross Lap joint,
2. T-Lap joint,
3. Dovetail Joint
Sheet Metal Working:
4. Taper Tray,
5. Square box,
6. Open Scoop
Fitting:
7. V- Fit,
8. Square fit,
9. Dovetail fit,
Electrical Wiring:
10. Parallel/Series connection of three bulbs,
11. Stair Case Wiring,
12. Godown Wiring
24
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Foundry Trade:
13. Mould cavity for rectangular shape
14. Mould cavity for a straight pipe
Welding Shop:
15. Lap joint
16. Butt joint.
# Any two jobs from each trade must be performed by the student.

AUGMENTED EXPERIMENT / MINI PROJECT: An innovative and creative useful house hold product/model
should be prepared by the group of 6-10 students using the knowledge gathered from the all shops in
workshop.

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.
REFERENCE BOOKS:
1. Elements of Workshop Technology, Vol. I by S. K. Hajra Choudhury & Others, Media Promoters 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.; Atul Prakashan, 2021-22.

25
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX07 - COMPUTER PROGRAMMING LAB

(Common to all branches of Engineering)
0 0 3 1.5
Course Outcomes:
At the end of the Course, Student will be able to:
CO1: Read, understand, and trace the execution of programs.
CO2: Select the proper control structure for solving the problem.
CO3: Construct programs using homogenous data types.
CO4: Develop modular programming using functions
CO5: Formulate programs for optimal utilization of memory.
CO6: Develop programs using files.
COs – POs Mapping:

CO PO4

1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

List of Experiments:
WEEK 1: Introduction to Programming Environment
Objective: Getting familiar with the programming environment on the computer and writing the first
program.
Suggested Experiments/Activities:
1. Familiarization with IDEs like Turbo C, Code blocks and Dev-C++.
2. Writing simple programs using printf(), scanf().
3. Creating and managing directories and files using terminal commands.
4. Compiling and running a basic C program using different compilers.
5. Introduction to Basic Debugging Techniques.

WEEK 2: Problem Solving with Algorithms and Flowcharts

Objective: Getting familiar with how to formally describe a solution to a problem in a series of finite
steps using textual and graphic notation.
Suggested Experiments/Activities:
1. Develop algorithms and flowcharts for the sum and average of three numbers.
2. Create algorithms and flowcharts for converting Fahrenheit to Celsius and vice versa.
3. Write algorithms and flowcharts for simple interest calculation.
4. Design a flowchart to find the largest of three numbers.
5. Develop a flowchart and algorithm for checking if a number is even or odd.

WEEK 3: Variables and Data Types

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.
Suggested Experiments/Activities:
1. Finding the square root of a given number.
2. Calculating compound interest.
3. Computing the area of a triangle using Heron's formula.
4. Finding the distance travelled by an object given speed and time.

26
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

5. Performing basic arithmetic operations (addition, subtraction, multiplication, division) on two

integers.

WEEK 4: Expressions and Operator Precedence

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

Suggested Experiments/Activities:

1. Evaluate expressions like A + B * C + (D * E) + F * G.

2. Evaluate expressions like A / B * C - B + A * D / 3.
3. Understand the behavior of expressions like A+++B---A.
4. Evaluate complex expressions like J = (i++) + (++i).
5. Find the maximum of three numbers using the conditional operator.
6. Calculate the total and average marks of five subjects.

WEEK 5: Conditional Statements and Branching

Objective: Explore the full scope of different variants of the if construct, including if-else, nested if-else,
switch, and their appropriate usage scenarios.

Suggested Experiments/Activities:

1. Write a C program to find the maximum and minimum of four numbers using if-else.
2. Create a program to generate an electricity bill.
3. Write a program to find the roots of a quadratic equation.
4. Simulate a calculator using a switch case.
5. Determine whether a given year is a leap year.

WEEK 6: Looping Constructs and Iteration

Objective: Explore the full scope of iterative constructs, including while, do-while, and for loops, and
their appropriate usage scenarios.

Suggested Experiments/Activities:

1. Find the factorial of a given number using any loop.

2. Check if a given number is prime.
3. Compute sine and cosine series.
4. Check whether a number is a palindrome.
5. Construct a pyramid of numbers.

WEEK 7: Pattern generation

Objective: Generating various patterns using loops and nested loops.

Suggested Experiments/Activities:

1. Print a right-angled triangle pattern using asterisks.

2. Create an inverted triangle pattern.
3. Generate a diamond pattern.
4. Print a Floyd's triangle.
5. Create a pattern of numbers in ascending and descending order.

27
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

WEEK 8: 1D Arrays

Objective: Explore the full scope of the Arrays construct, defining and initializing 1-D arrays, and
performing linear search.

Suggested Experiments/Activities:

1. Find the minimum and maximum of a 1D integer array.

2. Perform a linear search on a 1D array.
3. Reverse a 1D integer array.
4. Find the 2’s complement of a given binary number.
5. Eliminate duplicate elements in an array.

WEEK 9: 2D Arrays - Matrix Operations

Objective: Understand and manipulate 2D arrays to perform various matrix operations.

Suggested Experiments/Activities:

1. Addition of two matrices.

2. Multiplication of two matrices.
3. Transpose of a matrix.
4. Finding the determinant of a matrix.
5. Inverse of a matrix (if it exists).

WEEK 10: String Operations and Sorting

Objective: Explore string manipulation techniques.

Suggested Experiments/Activities:

1. Concatenate two strings without using built-in functions.

2. Reverse a string using built-in and custom-defined functions.
3. Compare two strings using a custom implementation of strcmp without using the built-in
function.
4. Implement string search operations (substring finding) without using built-in functions.
5. Convert a string to uppercase and lowercase without using built-in functions

WEEK 11: Dynamic Memory Allocation and Pointers

Objective: Explore dynamic memory management and pointers, including memory allocation,
deallocation, and pointer manipulation.

Suggested Experiments/Activities:

1. Write a C program to find the sum of a 1D array using malloc().

2. Write a C program to find the total average of n students using structures.
3. Enter n students' data using calloc() and display the list of failed students.
4. Read student name and marks from the command line and display details along with the total.
5. Implement realloc() to resize an array.

WEEK 12: Structures, Unions, and Bitfields

Objective: Experiment with C Structures, Unions, bit fields, self-referential structures, and nested
structures.

28
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Suggested Experiments/Activities:

1. Create and display a singly linked list using a self-referential structure.

2. Demonstrate the differences between structures and unions using a C program.
3. Write a C program to shift/rotate using bitfields.
4. Copy one structure variable to another structure of the same type.
5. Read and print a date using dd/mm/yyyy format using bit-fields.

WEEK 13: Functions

Objective: Explore the concepts of functions, sub-routines, and parameter passing using call by value.

Suggested Experiments/Activities:

1. Write a C function to calculate NCR value.

2. Write a C function to find the length of a string.
3. Write a C function to transpose a matrix.
4. Demonstrate numerical integration of differential equations using Euler's method.
5. Implement a function to compute the power of a number.

WEEK 14: Recursive Functions

Objective: Explore recursive solutions by writing recursive functions for various problems.

Suggested Experiments/Activities:

1. Write a recursive function to generate the Fibonacci series.

2. Write a recursive function to find the LCM of two numbers.
3. Write a recursive function to find the factorial of a number.
4. Implement Ackermann's function using recursion.
5. Write a recursive function to find the sum of a series.

WEEK 15: Working with Pointers

Objective: Understand the differences between normal and pointer variables, and explore pointer
arithmetic and function pointers.

Suggested Experiments/Activities:

1. Write a C program to swap two numbers using call by reference.

2. Demonstrate the dangling pointer problem using a C program.
3. Write a C program to copy one string into another using a pointer.
4. Write a C program to find the number of lowercase, uppercase, digits, and other characters in a
string using pointers.
5. Implement a function pointer to perform arithmetic operations.

WEEK 16: File Handling and Data Files

Objective: Understand data files and file handling, exploring the differences between text and binary
files.

Suggested Experiments/Activities:

1. Write a C program to write and read text into a file.

2. Write a C program to write and read text into a binary file using fread() and fwrite().
3. Copy the contents of one file to another file.
29
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

4. Write a C program to merge two files into a third file using command-line arguments.
5. Find the number of lines, words, and characters in a file.

Note: The suggested experiments are given for reference; faculty can identify suitable problem statements
for each week as per the objective and get approval from the HoD.

List of Augmented Experiments:

1. Employee'sManagement System
2. Librarymanagement system
3. Automationofdepartment store
4. PersonalDairy Management
5. TelecomBilling Management
6. BankManagement System
7. Contacts Management

Text books:

1. Ajay Mittal, Programming in C: A practical approach, 1 st Edition, Pearson.

2. Byron Gottfried, Schaum’ s Outline of Programming with C, 4th Edition, 2020, McGraw Hill.

Reference Books:

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice- Hall of India.
C Programming,
2. A Problem-Solving Approach, Forouzan, Gilberg, Prasad,3rdEdn, CENGAGE.

30
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23BEX08 - IT WORKSHOP
(Common to all branches of Engineering)

Course Outcomes:
At the end of the Course, Student will be able to:
1. Demonstrate the process of Assembling and disassembling the PC.
2. Illustrate the steps involved in installations of various operating systems.
3. Understand the process of Configuring IP address and perform virus free downloads.
4. Create projects using Latex/ Word and organize data and spreadsheets.
5. Design basic and interactive Power Point Presentations.
6. Improve Conversational abilities using AI-Tools.
COs – POs Mapping
COs PO1 PO2 PO3 PO4 PO9 PO12
1 3 2 3 2 3 3
2 2 3 2 3 3 2
3 3 2 2 2 3 2
4 2 3 2 2 3 2
5 3 3 3 2 3 2
6 2 2 2 2 3 2
3 - Strongly Linked | 2 – Moderately Linked | 1 – Weakly Linked
PC Hardware
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. Lab instructors
should verify the work and follow it up with a Viva. Also, students need to go through the 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. Lab instructor 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 with both Windows and Linux. 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. Finally, students should demonstrate, to
the instructor, how to access the websites and email. If there are no 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.
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 LaTeX and Microsoft (MS) office or
equivalent (FOSS) tool word: Importance of LaTeX 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 LaTeXand word –
Accessing, overview of toolbars, saving files, Using help and resources, rulers, format painter in word.
Task 2: Using LaTeX 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 Colours, Inserting Header
and Footer, Using Date and Time option in both LaTeX 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.

31
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

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
POWERPOINT
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.
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?'"

Reference Books:
1. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dream tech
2. The Complete Computer upgrade and repair book, 3rd edition Cheryl A Schmidt, WILEY Dream tech
3. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education.
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 Third Edition by David Anfins on and Ken
Quamme. – CISCO Press, Pearson Education.
7. IT Essentials PC Hardware and Software Labs and Study Guide Third Edition by PatrickRegan– CISCO
Press, Pearson Education.

32
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23HSX02 - COMMUNICATIVE ENGLISH LAB

(Common to all branches of Engineering)
0021
Course outcomes:

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

1. Spell the words with accurate pronunciation
2. Apply the patterns of accent and intonation for listening and speaking comprehension
3. Write emails, resume and statement for professional communication
4. Exhibit professionalism in debates and group discussions
5. Demonstrate verbal and non-verbal communication in technical presentations
6. Exhibit interpersonal communication in formal situations

List of Experiments

1. Letters and Sounds of English

2. Role play/ Conversation Practice-1
3. Jam
4. E-Mail Writing
5. Prounciation Rules
6. Role play/ Conversation Practice-II
7. Accent rules and Intonation
8. Presentation Skills
9. Resume Writing
10. Debating
11. Group Discussion
12. Interviews
13. Poster Presentation
14. Statement of Purpose
15. Role play/ Conversation Practice-3
16. Role play/ Conversation Practice-4

Augmented Experiment

List of Augmented Experiments2

1. Common Errors in English
2. Listening Skills
3. Writing Skills
4. Reading Skills
5. Public Speaking
6. Interview Skills

33
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

7. Business Communication
8. Functional English
9. Preparation for GRE/TOEFL
10. Preparation for IELTS/CAT/GMAT

1Students shall opt any one of the Augmented Experiments in addition to the regular experiments

Reading Material (s)

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
5. K. Nirupa Rani, Jayashree Mohan Raj, B. Indira, (Ed) Speak Well (C.D) Orient Black Swan Pvt Ltd,
Hyderabad, 2012

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

34
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23HSX11 - HEALTH AND WELLNESS, YOGA AND SPORTS

(Common to All branches of Engineering)
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.

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
UNIT I
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
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
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.
Practicing general and specific warm up, aerobics
ii) Practicing cardiorespiratory fitness, treadmill, run test, 9 min walk, skipping andrunning.
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, SAS Survival Handbook: The Ultimate Guide to Surviving
Anywhere Third Edition, William Morrow Paperbacks, 2014
5. The Sports Rules Book/ Human Kinetics with Thomas Hanlon. -- 3rd ed. Human
Kinetics, 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 many as
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.

35
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23HSX12 -NSS/NCC/SCOUTS & GUIDES/COMMUNITY SERVICE

(Common to All branches of Engineering)
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.

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.

UNIT I Orientation
General Orientation on NSS/NCC/ Scouts & Guides/Community Service activities, careerguidance.
Activities:
i) Conducting –ice breaking sessions-expectations from the course-knowing personal
talents and skills
ii) Conducting orientations programs for the students –future plans-activities-releasing
road map etc.
iii) Displaying success stories-motivational biopics- award winning movies on societal
issues etc.
iv) Conducting talent show in singing patriotic songs-paintings- any other contribution.
UNIT II Nature CareActivities:
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
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 Population
Education.
v) Any other programmes in collaboration with local charities, NGOs etc.
Reference Books:

1. Nirmalya Kumar Sinha & Surajit Majumder, A Text Book of National Service Scheme
Vol;.I, Vidya Kutir Publication, 2021 ( ISBN 978-81-952368-8-6)
2. Red Book - National Cadet Corps – Standing Instructions Vol I & II, Directorate
General of NCC, Ministry of Defence, New Delhi
3. Davis M. L. and Cornwell D. A., ―Introduction to Environmental Engineering‖,
McGraw Hill, New York 4/e 2008

36
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

4. Masters G. M., Joseph K. and Nagendran R. ―Introduction to Environmental

Engineering and Science‖, Pearson Education, New Delhi. 2/e 2007
5. Ram Ahuja. Social Problems in India, Rawat Publications, New Delhi.
General Guidelines:
 Institutes must assign slots in the Timetable for the activities.
 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 viva
voce on the subject.

37
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

I Year-II Semester
DIFFERENTIAL EQUATIONS AND VECTOR CALCULUS-23MAX02
(Common to All Branches of Engineering)
3003
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.

Course Outcomes:
At the end of the course, the student will be able to:
 Model and solve the first order differential equations
 Experiment with the practical importance of solving first and higher order differential equations in
engineering.
 Solve higher order differential equations and understand about initial value problems
 Identify methods for solving linear partial differential equations.
 Make use of central concepts in partial differential equations and vector differentiation
 Apply vector calculus in the context of estimating the work done, circulation, flux and vector integral
theorems
COs – POs Mapping

COs PO1
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT- I :
Differential equations of first order and 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 (Constant Coefficients)
Definitions, homogenous and non-homogenous, complimentary function, general particular integral,
Wronskean, method of variation of parameters. Simultaneous linear equations, Applications to L-C-R Circuit
problems and Simple Harmonic motion.

UNIT – III : Partial Differential Equations

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 Calculus

Vector differentiation:
Scalar and vector point functions, vector operator del, del applies to scalar point functions-Gradient, del
applied to vector point functions - Divergence and Curl, vector identities
Vector integration:
Line integral- circulation- work done, surface integral-flux, Green’s theorem in the plane (without proof),

38
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Stoke’s theorem (without proof), volume integral, Divergence theorem (without proof) and applications of
these theorems.

Textbooks:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 10/e,John Wiley & Sons, 2018.
2. B.S.Grewal,HigherEngineeringMathematics,44/e,Khanna publishers,2017.
Reference Books:
1. Dennis G.Zill and Warren S.Wright, Advanced Engineering Mathematics, Jones andBartlett, 2018.
2. Micheael Greenberg, Advanced Engineering Mathematics, 9th edition, Pearson edn
3. George B. Thomas, Maurice D. Weir and Joel Hass, Thomas Calculus, 14/e, PearsonPublishers,
2018.
4. R. K. Jain and S. R. K. Iyengar, Advanced Engineering Mathematics, 5/e, Alpha ScienceInternational
Ltd., 2021 (9th reprint).
5. B.V. Ramana, Higher Engineering Mathematics, McGraw Hill Education, 2017

39
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

(Common for CSE, CSE-AI&DS, CSE-AI&ML, IT)

23CS201 Data Structures

3003
Course Outcomes
At the end of the course, Student will be able to
1. Explain the role of linear data structures in organizing and accessing data efficiently in algorithms.
2. Design, implement, and apply linked lists for dynamic data storage, demonstrating understanding of
memory allocation.
3. Develop programs using stacks to handle recursive algorithms, manage program states, and solve related
problems.
4. Apply queue-based algorithms for efficient task scheduling and breadth-first traversal in graphs and
distinguish between deques and priority queues, and apply them appropriately to solve data management
challenges.
5. Devise novel solutions to small scale programming challenges involving data structures such as stacks,
queues, Trees
6. Recognize scenarios where hashing is advantageous, and design hash-based solutions for specific
problems.
CO-PO Mapping
CO PO1 PO2 PO12
1 3 2 1
2 3 3 1
3 3 3 1
4 3 3 1
5 3 3 1
6 2 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Unit I
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 11Hours
Unit II
Linked Lists and Stacks: 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,
13 Hours
Unit III
Queues: Introduction to queues: properties and operations, implementing queues using arrays and linked lists.
Deques: Introduction to deques (double-ended queues), Operations on deques and their applications.
Applications of Stack and Queue: Applications of stacks in expression evaluation, backtracking, reversing list
etc., Applications of queues in breadth-first search, scheduling, etc.
12 Hours
Unit IV
Trees: Introduction to Trees, Binary Search Tree – Insertion, Deletion & Traversals 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.
12 Hours
Total: 48 Hours
Textbooks:
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 Peter Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft
40
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

3. Problem Solving with Algorithms and Data Structures" by Brad Miller and David Ranum
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

41
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23EE201 Electrical Circuit Analysis-1 (EEE Branch)

3003
Course Outcomes
1. Summarize the behaviour of electrical circuits and elements.
2. Apply network reduction techniques to AC and DC circuits
3. Outline the concept of electromagnetic induction and magnetic circuits
4. Summarize the behaviour of AC circuits
5. Outline resonance characteristics of series/parallel circuits
6. Apply network theorems to AC and DC circuits
COs – POs Mapping
COs PO1 PO2 PSO1
1 3 3 3
2 2 2 2
3 3 3 3
4 2 2 2
5 2 2 2
6 3 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT-I: Introduction to Electrical Circuits

Basic Concepts of passive elements of R, L, C and their V-I relations, Sources (dependent and independent),
Kirchoff’s laws, Network reduction techniques (series, parallel, series - parallel, star-to-delta and delta-to-star
transformation), source transformation technique, nodal analysis and mesh analysis to DC networks with
dependent and independent voltage and current sources, supernode and supermesh analysis.
11 Hours
UNIT-II: Magnetic Circuits
Basic definition of MMF, flux and reluctance, analogy between electrical and magnetic circuits, Faraday’s laws
of electromagnetic induction – concept of self and mutual inductance, Dot convention – coefficient of coupling
and composite magnetic circuit, analysis of series and parallel magnetic circuits.
11 Hours
UNIT-III: Single Phase Circuits
Characteristics of periodic functions, Average value, R.M.S. value, form factor, representation of a sine function,
concept of phasor, phasor diagrams, node and mesh analysis.
Steady state analysis of R, L and C circuits to sinusoidal excitations-response of pure resistance, inductance,
capacitance, series RL circuit, series RC circuit, series RLC circuit, parallel RL circuit, parallel RC circuit.
Series Resonance: Characteristics of a series resonant circuit, Q-factor, selectivity and bandwidth, expression
for half power frequencies.
Parallel resonance: Q-factor, selectivity and bandwidth.
Locus diagram: RL, RC, RLC with R, L and C variables. 12 Hours

UNIT-IV: Network theorems (DC & AC Excitations)

Superposition theorem, Thevenin’s theorem, Norton’s theorem, Maximum Power Transfer theorem,
Reciprocity theorem, Millman’s theorem and compensation theorem. 11 Hours
Total: 45 Hours
Textbook (s)
1. W.H.Hayt, J.E.Kimmerly, and S.M.Durbin, “Engineering Circuit Analysis”, Tata McGraw Hill, 8 th Edition,
2015.
2. Charles K Alexander and Mathew N.O Sadiku, “Fundamentals of Electric Circuits”, Tata McGraw Hill, 5th
Edition, 2013.
3. M.E Van Valkenburg, “Network Analysis”, Prentice Hall of India, 4th Edition, 2018.
4. P. Ramana, G.T.Chnadra Sekhar, G.Suresh, “Network Theory”, SChand and Company Ltd., 1st Edition,
2024.
Reference (s)
1. Abhijit Chakrabarti, “Circuit Theory Analysis and Synthesis”, Dhanpat Rai & Co., 6th Edition, 2014.

42
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

2. A Sudhakar, and Shyammohan S. Palli, “Circuits and Networks: Analysis and Synthesis”, McGraw Hill
Higher Education, 5th Edition, 2015.
3. M Nahvi, Joseph Edminister, K Uma Rao, “Electric Circuits, (Schaum's Outline Series)”, McGraw Hill
Higher Education, 7th Edition, 2017.

43
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23EC201 Network Analysis (ECE Branch)

3003
Course Outcomes
1. Apply network reduction techniques to DC circuits.
2. Apply network theorems to simplify complex networks.
3. Summarize the behaviour of AC circuits.
4. Explain series and parallel connected coupled circuits.
5. Interpret various parameters for a given two-port network.
6. Illustrate the transient response of R, L, C circuits for DC and AC excitations.

COs – POs Mapping

COs PO1 PO2 PSO1
1 3 3 2
2 3 3 2
3 2 2 1
4 2 2 1
5 2 2 1
6 2 2 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT-I: Introduction to Electrical Circuits and Network theorems

Introduction to Electrical Circuits: Types of circuit elements, types of sources, ohm’s law, Kirchoff’s laws,
source transformation, star-delta conversion, mesh and nodal analysis, problem solving with resistances,
principal of duality with examples.
Network Theorems: Superposition, Thev eni n’s, N orton’s, Mil l ma n’s, Reciprocity, Compensation,
Substitution, Max Power Transfer, Tellegen’s theorems.
13 Hours
UNIT-II: Steady state AC analysis and Resonance
Steady State AC Analysis: Impedance concept, j-operator, phasor notation, RL, RC, RLC circuits problem
solving, calculation of different powers and power factor.
Resonance: Definition of resonance, series resonance, parallel resonance, bandwidth, quality factor of
series and parallel resonance.
11 Hours
UNIT-III: Coupled Circuits and Two Port Networks
Coupled Circuits: Faraday’s laws of electromagnetic induction, self-inductance, mutual inductance, coefficient
of coupling, dot rule of coupled circuits, conductively coupled equivalent circuits- problem solving.
Two-port Networks: Z-parameters, Y-parameters, Transmission line parameters, h- parameters,
Interrelationship between parameters, Interconnection of two port networks.
12 Hours
UNIT-IV: Transient Analysis
Transients: First order differential equations, Definition of time constants, RL circuit, RC circuit with DC
excitation, evaluating initial conditions procedure, second order differential equations, problem-solving using
RLC elements with DC excitation and AC excitation, Response of second order circuit as related to location of
poles in s-plane.
Laplace transforms: introduction to Laplace transformation, problem solving using Laplace transform,
12 Hours
Total: 48 Hours

Textbook (s)
1. W.H.Hayt, J.E.Kimmerly, and S.M.Durbin, “Engineering Circuit Analysis”, Tata McGraw Hill, 8 th Edition,
2015.
2. Charles K Alexander and Mathew N.O Sadiku, “Fundamentals of Electric Circuits”, Tata McGraw Hill, 5th
Edition, 2013.
3. M.E Van Valkenburg, “Network Analysis”, Prentice Hall of India, 4th Edition, 2018.
44
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

4. P. Ramana, G.T.Chnadra Sekhar, G.Suresh, “Network Theory”, SChand and Company Ltd., 1st Edition,
2024.
Reference (s)
1. Abhijit Chakrabarti, “Circuit Theory Analysis and Synthesis”, Dhanpat Rai & Co., 6th Edition, 2014.
2. A Sudhakar, and Shyammohan S. Palli, “Circuits and Networks: Analysis and Synthesis”, McGraw Hill
Higher Education, 5th Edition, 2015.
3. M Nahvi, Joseph Edminister, K Uma Rao, “Electric Circuits, (Schaum's Outline Series)”, McGraw Hill
Higher Education, 7th Edition, 2017.

45
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ME201-Engineering Mechanics
(COMMON for CIVIL,MECH)
3003

Course Outcomes: At the end of the course, the student will be able to
1. Compute the resultant force in concurrent, coplanar and spatial systems.
2. Implement the concept of friction to real time applications.
3. Analyse the equilibrium condition for different force systems and trusses.
4. Assess the centroids, centre of gravity of different geometrical shapes.
5. Find the moment of inertia of different objects.
6. Apply the motion of a rigid body and a particle
COs – POs Mapping
COs PO1 PO2 PO3
1 3 2 2
2 3 2 2
3 3 2 2
4 3 2 2
5 3 3 2
6 3 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
UNIT I: Introduction to Engineering Mechanics – Basic Concepts, Scope and Applications, Systems of
Forces: Coplanar Concurrent Forces– Components in Space–Resultant– Moment of Force and its Application –
Couples and Resultant of Force Systems.
Friction: Introduction, limiting friction and impending motion, Coulomb’s laws of dry friction, coefficient of
friction, Cone of Static friction. 12 hours
UNIT II: Equilibrium of Systems of Forces: Free Body Diagrams, Lami’s Theorem, Equations of
Equilibrium of Coplanar Systems, Graphical method for the equilibrium, Triangle law of forces, converse of the
law of polygon of forces condition of equilibrium, Analysis of plane trusses by method of joints and sections.
12 hours
UNIT III: Centroid and Centre of Gravity: Centroids of simple figures (from basic principles)–
Centroids of Composite Figures. Centre of gravity of composite bodies,
Area Moments of Inertia: Definition– Polar Moment of Inertia, Parallel and perpendicular axis
theorems, Moments of Inertia of Composite Figures. 12 hours
UNIT IV: Rectilinear and Curvilinear motion of a particle: Kinematics and Kinetics –D’Alembert’s
Principle - Work Energy method and applications to particle motion-Impulse Momentum method.
Rigid body Motion: Kinematics and Kinetics of translation, Rotation about fixed axis and plane motion,
Work Energy method and Impulse Momentum method. 12 hours
Total: 48 hours
Textbooks:
1. S. Timoshenko, D. H. Young, J.V. Rao, S. Pati., Engineering Mechanics, 5th Edition,
McGraw Hill Education.
2. Hibbeler R.C., Engineering Mechanics: Statics and Dynamics, 14th Edition, Pearson
Education, Inc., New Delhi, 2022
Reference Books:
1. Engineering Mechanics, Statics and Dynamics, Rogers and M A. Nelson., McGraw
Hill Education.
2. Engineering Mechanics, S.S Bhavikatti, 8th Edition, New Age International, 2022.
3. Engineering Mechanics, A.K Tayal, Statics and Dynamics, 14th Edition, Umesh
Publishers, 2021
4. Engineering Mechanics: Principles of Statics and Dynamics, R.C. Hibbler., Pearson
Press, 2006.
5. Introduction to Statics and Dynamics, Andy Ruina and Rudra Pratap., Oxford
University Press, 2011.
46
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

(Common for CSE, CSE-AI&DS, CSE-AI&ML, IT)

23CS202 Data Structures Lab
0 0 3 1.5
Course Outcomes
At the end of the course, Student will be able to
 Explain the role of linear data structures in organizing and accessing data efficiently in algorithms.
 Design, implement, and apply linked lists for dynamic data storage, demonstrating understanding of
memory allocation.
 Develop programs using stacks to handle recursive algorithms, manage program states, and solve
related problems.
 Apply queue-based algorithms for efficient task scheduling and breadth-first traversal in graphs and
distinguish between deques and priority queues, and apply them appropriately to solve data
management challenges.
 Devise novel solutions to small scale programming challenges involving data structures such as stacks,
queues, Trees
 Recognize scenarios where hashing is advantageous, and design hash-based solutions for specific
problems.
CO-PO Mapping
COs PO2 PO3 PO4 PO5
1 3 3 2 1
2 3 3 2 2
3 3 3 2 2
4 3 3 2 2
5 3 3 2 2
6 3 3 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
List of Experiments:
1. Array Manipulation
a. Write a program to reverse an array.
b. Basic Array Programs
2. Searching Techniques
a. C Programs to implement the Searching Techniques – Linear
b. C Programs to implement the Searching Techniques - Binary Search
3. Sorting Techniques
a. C Programs to implement Sorting Techniques – Bubble Sort
b. C Programs to implement Sorting Techniques - Insertion Sort
4. Linked List Implementation
a. Implement a singly linked list and perform insertion and deletion operations.
b. Develop a program to reverse a linked list iteratively and recursively.
5. Linked List Applications
a. Create a program to detect and remove duplicates from a linked list.
b. Implement a linked list to represent polynomials and perform addition.
6. Double and Circular Linked List Implementation
a. Implement a doubly linked list and perform various operations to understand its properties
and applications.
b. Implement a circular linked list and perform insertion, deletion, and traversal.
7. Stack Operations
a. Implement a stack using arrays
b. Implement a stack using linked lists
8. Queue Operations
a. Implement a queue using arrays
b. Implement a queue using linked lists
9. Queue Types
a. Implement a circular queue
b. Implement a double-ended queue (deque) with essential operations.

47
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

10. Stack Applications -I

a. Use a stack to convert an infix expression to postfix
b. Write a program to evaluate a postfix expression using a stack.
11. Stack Applications -II
a. Implement a program to check for balanced parentheses using a stack.
b. Create a program to determine whether a given string is a palindrome or not.
12. Queue Applications
a. Develop a program to simulate a simple printer queue system.
b. Implement a stack or queue to perform comparison and check for symmetry
13. Binary Search Tree
a. Implementing a BST using Linked List.
b. Traversing of BST.
14. Closed Hashing: Implement a hash table with open Addressing techniques.
15. Open Hashing: Implement a hash table with Separate chaining techniques.
16. Hashing- Application: Write a program to implement a simple cache using hashing.
Indicative list of applications-based experiments
1. Integer to Roman
Problem Description: Given an integer, convert it to a Roman numeral. Input is guaranteed to be within
the range from 1 to 3999.
Implementation: You can create a function that iteratively subtracts the largest possible Roman
numeral values from the given integer and appends the corresponding symbols until the integer
becomes zero.
2. Merge Two Sorted Linked Lists
Problem Description: Merge two sorted linked lists and return it as a new sorted list.
Implementation: Create a function that takes two sorted linked lists as input and iteratively compares
the nodes, merging them into a new sorted linked list.
3. Task Scheduler
Problem Description: Given a character array representing tasks, each task is represented by a
character. Tasks could be done without the original order. Each task is done in one unit of time. For
each unit of time, any CPU can execute at most one task. Given the character array, find the minimum
time required to finish all the tasks.
Implementation: Implement a function that schedules the tasks efficiently based on their frequencies
and calculates the minimum time required.
4. Find the kth Smallest or Largest Element in a BST
Problem Description: Given a binary search tree, find the kth smallest or largest element in it.
Implementation: Write a function that performs an in-order traversal of the BST while keeping track of
the count of visited nodes. Return the kth element when the count matches k.
5. Construct BST from Preorder or Postorder Traversal
Problem Description: Given an array representing either the preorder or postorder traversal of a
binary search tree, construct the tree.
Implementation: Create a function that recursively builds the binary search tree using the given
traversal order.
6. Binary Tree Level Order Traversal
Problem Description: Given a binary tree, return the level order traversal of its nodes' values. (i.e.,
from left to right, level by level).
Implementation: Implement a function that performs a level order traversal using a queue to keep
track of each level.
7. Checking for Anagram Pairs using Hash Table
Problem Description: Given an array of strings, group anagrams together.
Implementation: Create a function that uses a hash table to group anagrams. Anagrams will have the
same sorted characters, which can be used as keys in the hash table.
8. Check if the Tree is Balanced
Problem Description: Given a binary tree, determine if it is height-balanced.
Implementation: Write a function that calculates the height of each subtree and checks if the difference
in heights between left and right subtrees is within one.

48
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ME202 Engineering Mechanics lab - MECH

0 0 3 1.5

Course Outcomes: At the end of the course, the student will be able to
1. Demonstrate knowledge of the principles governing the Law of forces and validate them through
experimental setups
2. Execute the experiments to achieve equilibrium in coplanar-concurrent force system
3. Asses the significance of friction in mechanical systems.
4. Check the equilibrium of objects subjected to diverse forces, delve into rotational dynamics, and apply
principles of conservation laws
5. Apply the principles of static equilibrium to analyse coplanar non-concurrent, parallel force systems
6. Apply the principle of mechanics to system of pulleys, compound pendulum and Bell-crank lever
CO-PO Mapping

COs PO1 PO6 PO8 PO9 PO10

CO1 3 2 3 3 2
CO2 3 2 3 3 2
CO3 3 2 3 3 2
CO4 3 2 3 3 2
CO5 3 2 3 3 2
CO6 3 2 3 3 2

Students have to perform any 10 of the following Experiments:

List of Experiments:
1. Verification of Law of Parallelogram of Forces.
2. Verification of Law of Triangle of Forces.
3. Verification of the Law of polygon for coplanar-concurrent forces acting on a particle in equilibrium and
to find the value of unknown forces considering particle to be in equilibrium using universal force table.
4. Determination of coefficient of Static and Rolling Frictions
5. Determination of Centre of Gravity of different shaped Plane Lamina.
6. Verification of the conditions of equilibrium of a rigid body under the action of coplanar non- concurrent,
parallel force system with the help of a simply supported beam.
7. Study of the systems of pulleys and draw the free body diagram of the system.
8. Determine the acceleration due to gravity using a compound pendulum.
9. Determine the Moment of Inertia of the compound pendulum about an axis perpendicular to the plane of
oscillation and passing through its centre of mass.
10. Determine the Moment of Inertia of a Flywheel.
11. Verification of Law of Moment using Rotation Disc Apparatus and Bell Crank Lever.

References:
1. Engineering Mechanics Lab manual.
2. S. Timoshenko, D. H. Young, J.V. Rao, S. Pati., Engineering Mechanics, 5th Edition, McGraw Hill Education.
3. Hibbeler R.C., Engineering Mechanics: Statics and Dynamics, 14th Edition, Pearson Education, Inc., New
Delhi, 2022.
List of Augmented Experiments
1. Prepare a couple for any engineering application
2. Prepare a truss and draw a FBD for it
3. Find the centroid of a composite plane
4. Prepare a demonstrative model for different force systems
5. Analysis of Projectile Motion: Launch projectiles at different angles and measure their range, height, and time
of flight. With an Objective: Verify the equations of motion for projectiles and determine the effect of launch
angle on range and maximum height.

49
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23EC202 Network Analysis Lab (ECE)

0 0 3 1.5

Course Outcomes :
1 Analyze the DC Transients of RL & RC circuits
2 Make use of network theorems to simplify the electrical circuits
3 Analyze the DC Transients of RL & RC circuits
4 Demonstrate the characteristics of series RL, RC circuits
5 Demonstrate the characteristics of series RLC circuits and resonant circuit for given specifications
6 Characterize and model the network in terms of all network parameters: Illustrate Kirchhoff’s laws,
mesh, and nodal analysis for DC circuits
COs – POs Mapping
COs PO1 PO2 PO4 PO5 PSO1
1 2 1 2 2
2 3 2 1 2 3
3 3 2 2 2 3
4 3 2 2 2 3
5 3 2 2 2 3
6 3 2 2 2 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
SYLLABUS:
The following experiments need to be performed using Simulation Software.
1. Verification of KCL and KVL for DC circuits.
2. Verification of mesh and nodal analysis for DC circuits
3. Verification of Superposition theorems for DC circuits
4. Verification of Thevenin’s and Norton's theorems for DC circuits
5. Verification of Maximum power transfer theorem for DC circuits
6. Determination of Impedance and Power factor of Series RL & RC circuits
7. Determination of Active, reactive, and apparent power of Series RL & RC circuit
8. Determination of Impedance, Power factor, Active, Reactive, and Apparent power of a series RLC
circuit
9. Construct a Series Resonance circuit to find the Q Factor and Bandwidth
10. Construct a Parallel Resonance circuit to find the Q Factor and Bandwidth
11. Determination of open circuit (Z) and short circuit (Y) parameters
12. Determination of hybrid (H) and transmission (ABCD) parameters
13. Analysis of DC transients in Series RL and Parallel RL circuits
14. Analysis of DC transients in Series RC and Parallel RC circuits
15. Analysis of D C transient and steady-state response of a 2nd order circuit by varying itsvarious
parameters and studying their effects on responses.

Textbook (s):
1. M.E Van Valkenburg, Network Analysis, Prentice Hall of India, 3rd Edition, 2015
2. W.H.Hayt, J.E.Kimmerly, and S.M.Durb, Engineering circuit analysis, McGraw Hill Education private
limited, 8th Edition, 2013
Software requirements:
Multisim/ Pspice/Orcad Equivalent simulation software tool, Computer Systems with requiredspecifications
References:
1. Network Analysis ME Van Valkenburg, Prentice Hall of India, revised 3rd Edition,2019.
Engineering Circuit Analysis by William H. Hayt, Jack Kemmerly, Jamie Phillips,Steven M. Durbin, 9th Edition
2020

50
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23EE202 Electrical Circuit Lab -EEE

0 0 3 1.5

Course Outcomes:

1. Demonstrate network reduction techniques using basic laws.

2. Compute the parameters of electrical equipment
3. Compute the parameters of magnetic circuit
4. Analyse series and parallel resonant circuits
5. Analyse maximum Power transfer from source to load
6. Apply network theorems to solve electrical circuits
7. COs – POs Mapping
COs PO
1 3
2 3
3 3
4 3
5 3
6 3
8. 3–Strongly linked | 2–Moderately linked| 1–Weakly linked

List of Experiments

S.No Name of Experiment COs

CYCLE 1 ( Hardware)
1 Verification of Kirchhoff's circuit laws. CO1
2 Determination of self, mutual inductances, and coefficient of coupling. CO3
3 Determination of Parameters of a choke coil. CO2
4 Verification of Superposition theorem CO6
5 Series and parallel resonance CO4
CYCLE 2 ( Simulation)
1 Verification of node and mesh analysis CO1
2 Verification of Thevenin’s and Norton’s Theorems CO6
3 Verification of Maximum power transfer theorem CO5
4 Verification of Compensation theorem CO6
5 Verification of Reciprocity and Millman’s Theorems CO6

List of Augmented Experiments:

1. Locus diagrams of R-L(L Variable) and R-C (C Variable) series circuits
2. Verification of network reduction techniques.
3. Determination of cold and hot resistance of an electric lamp
4. Determination of resonance frequency for a parallel tank circuit.
5. Verification of tellegan’s theorem.

Reference Books:

1. W.H.Hayt, J.E.Kimmerly, and S.M.Durbin, “Engineering Circuit Analysis”, Tata McGraw Hill, 8th Edition,
2015.
2. Charles K Alexander and Mathew N.O Sadiku, “Fundamentals of Electric Circuits”, Tata McGraw Hill,
5th Edition, 2013.
3. M.E Van Valkenburg, “Network Analysis”, Prentice Hall of India, 4th Edition, 2018.
4. P. Ramana, G.T.Chnadra Sekhar, G.Suresh, “Network Theory”, SChand and Company Ltd., 1st Edition,
202
5.
51
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CE201 ENGINEERING MECHANICS &BUILDING PRACTICES LAB-CIVIL

0-0-3-1.5

Course Outcomes: At the end of the course, the student will be able to
1. Evaluate the coefficient of friction between two different surfaces and between theinclined plane
and the roller.
2. Verify Law of Parallelogram of forces and Law of Moment using force polygon and bellcrank lever.
3. Determine the Centre of gravity different configurations
4. Understand the Quality Testing and Assessment Procedures
5. Understand the principles of Non-Destructive Testing.
6. Exposure to safety practices in the construction industry.
COs – POs Mapping

COs PO1 PO6 PO8 PO9 PO10

CO1 3 2 3 3 2
CO2 3 2 3 3 2
CO3 3 2 3 3 2
CO4 3 2 3 3 2
CO5 3 2 3 3 2
CO6 3 2 3 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Students have to perform any 10 of the following Experiments:

List of Experiments:
1. To study various types of tools used in construction.
2. Forces in Pin Jointed Trusses
3. Experimental Proof of Lami’s Theorem
4. Verification of Law of Parallelogram of Forces.
5. Determination of Center of Gravity of different shaped Plane Lamina.
6. Determination of coefficient of Static and Rolling Friction.
7. Verification of Law of Moment using Rotation Disc Apparatus and Bell Crank Lever
8. Study of Alternative Materials like M-sand, Fly ash, Sea Sand etc.
9. Field-Visit to understand the Quality Testing - report.
10. Safety Practices in Construction industry
11. Demonstration of Non-Destructive Testing - using Rebound Hammer & UPV
12. Study of Plumbing in buildings.
References:
1. Engineering Mechanics and Building Practices Lab manual.
2. S. Timoshenko, D. H. Young, J.V. Rao, S. Pati., Engineering Mechanics, 5th Edition, McGraw Hill Education.
3. Hibbeler R.C., Engineering Mechanics: Statics and Dynamics, 14th Edition, Pearson Education,
Inc., New Delhi, 2022.

52
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

3rd Semester
23CS301 Problem Solving using Python
3024

Course Outcomes

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

1. Explain the fundamentals of Python with syntax and semantics.
2. Apply conditional and control flow statements, and analyze strings and regular expressions for pattern
matching and text processing.
3. Understand and apply the built-in data structures such as dictionaries, sets, lists, and tuples for data
manipulation.
4. Demonstrate and apply the concepts of functions and functional programming techniques.
5. Understand and apply the file Handling and exception handling techniques.
6. Understand the principles of object oriented programing in Python and demonstrate the use of Modules and
Packages.

CO – PO Mapping
CO PO1 PO12
1 3 1
2 3 1
3 3 1
4 3 1
5 3 1
6 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12+8 Hours

Introduction: History and need for python programming, Identifiers, Statements, Variables, Keywords, Input-Output
statements, Indentation, command line arguments.
Data Types - Integers, Strings, Booleans. Operators - Arithmetic, Comparison/Relational, Assignment, Logical,
Bitwise, Membership, Identity. Expressions and order of evaluations - Precedence and Associativity. Built-in
Functions – Importing from Packages. Conditional Statements: If, Elif, Else statements, iteration statements - While,
For - Break, Continue and pass statements.

Applications of Python, REPL (Read, Evaluation, Print, Loop)

Practical Components
1. Basic Operations: Validating and Converting Date Formats and Numeric Systems in Python
2. Control Statements: Implementing Fibonacci Series and Advanced List Operations
3. Array Manipulations : Matrix Operations: Transpose, Symmetry Check, and Multiplication

Unit II 12+6 Hours

Collections: Lists: Create, Access, Slicing, Negative indices, List methods, List comprehensions – Tuples: Create,
Indexing and slicing, Operations on tuples – Dictionary: Create, add, and replace values, Operations on dictionaries –
Sets: Creation and operations.
Strings: Strings: Comparison, Formatting, Slicing, Splitting, Stripping . Regular Expressions: Matching, Search and
replace, Patterns.

collections.deque, grouping with Dictionaries

Practical Components
1. Array Manipulations: Intersection, Kth Largest Element, and Maximum Subarray in Lists
2. Working with Dictionaries: 6. Word Frequency Counting, Dictionary Merging, and Filtering
3. String Manipulation: Acronyms, Valid Parentheses, Anagram Check, and Common Prefix
4. Regular Expressions for Email Validation, Phone Number Extraction, and Password Strength Checking

Unit III 12 +8 Hours

Functions- Defining Functions, Calling Functions, Types of Arguments, Recursion, Anonymous Functions: Lambda
Expressions, Global and Local Variables. Functional Programming: map, filter and reduce, decorators. Modules and
53
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Packages- Built-in modules, User-Defined modules, itertools module. Numpy and Pandas: Introduction to Numpy
and Pandas packages of python, Basic operations on Numpy and Pandas.

Higher order function, keyworded variable length arguments.

Practical Components
1. Recursive Functions: Prime Factorization, Subsets Generation, and Fibonacci Sequence
2. Exploring Default and Keyword Arguments, Variable Scopes, and Lambda Functions
3. Functional Programming: Map, Filter, and Reduce Operations
4. Itertools Applications: Counting, Cycling, Permutations, Combinations, and Sliding Windows
5. Working with Numpy Arrays and Pandas DataFrames

Unit IV 12+10 Hours

Classes and Objects: Defining and instantiating Class, Class Attributes and Methods, Constructor, self-keyword -
inheritance – overriding methods from parent class – Instances as Attributes, inner class. File Handling-Creating files,
operations on files - Open, Close, Read and Write - Working with File Paths - File and Directory Operations. Exception
Handling- Exception, try except block, Raising Exceptions, User Defined Exception.

polymorphism, Abstract class and abstract methods.

Practical Components
1. Object-Oriented Programming: Creating and Using Classes and Objects
2. Inheritance and Method Overloading/Overriding in Python
3. File Handling and Simple File Explorer Implementation
4. Exception Handling: Custom Exceptions
Total: 48+32 Hours
Textbook (s)
1. Richard L. Halterman, “Fundamentals of Python Programming” , 3 rd Edition, Southern Adventist University,
2019.
2. Matthes, E. ,“Python Crash Course: A Hands-On, Project-Based Introduction to Programming”, 2nd Edition, No
Starch Press, 2019.
3. Willaim Mckenny, “Python for Data Analysis: Data Wrangling with Pandas, NumPy, and IPython” 2 nd Edition,
O’Reily 2017.
Reference(s)
1. Wesley J Chun, “Core Python Applications Programming”, 3rd Edition, Pearson Education India, 2015.
2. Mertz, D., “Functional Programming in Python”, 1st Edition, O'Reilly Media,2015.
3. Kenneth A. Lambert. “Fundamentals of Python: First Programs”, 2 nd Edition, Publisher: Cengage Learning
2018
4. Python Programming: A Modern Approach, VamsiKurama, Pearson 2017 Learning Python, Mark Lutz, Orielly,
5th Edition.
Internal Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 30 30 --
Understand 50 40 --
Apply 20 30 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

Remember
1. What are the benefits of Python?
2. What is an Interpreted language?
3. List any four string handling functions
Understand
1. Explain lists and tuples?
2. Differentiate between the two?
3. What are Dict and List comprehensions?
Apply
1. Explain user defined exception
2. Justify multiple inheritance is supported in python?
3. Design a simple GUI page using Tkinter
54
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ML302 Artificial Intelligence

3003
Course Outcomes
1. Summarize the fundamental concepts of Artificial Intelligence.
2. Understand the control strategies and production systems.
3. Illustrate the Concepts of Heuristic Search Techniques.
4. Demonstrate working knowledge of reasoning in the presence of incomplete and/or uncertain information
5. Make use of concept of Game Playing Algorithms.
6. Outline the concept of Planning System

CO–PO Mapping
CO PO1 PO2 PO3
1 2 1 2
2 2 2 3
3 3 1 1
4 1 2 2
5 1 3 2
6 1 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Introduction
Definition, AI problems, AI techniques, Defining problem as a state space search, Production systems-
Control Strategies, Problem characteristics, Production system characteristics. Problems – tic-tac-toe, 8-
puzzle problem, Chess problem, Water Jug Problem, Missionaries and cannibals problem, Monkey and
banana problem.
Application of AI-Tower of Hanoi problem- Travelling Salesman Problem
Unit II 12 Hours
Heuristic Search Techniques
Generate-and-test, Hill climbing, Best-first-search – OR Graphs – A* Algorithm, Problem reduction
– AND-ORGraphs – AO* Algorithm, constraint satisfaction - cryptarithmetic problem.
Depth-first search – Breadth-first search- Data abstraction
Unit III 12 Hours
Knowledge representation
Knowledge Representation Issues, Representation and mapping, Approaches to Knowledge
Representation, Frame Problem, Propositional logic, Predicate logic, Resolution, weak slot and filler
structure-semantic nets.
Filler structures-conceptual dependency-scripts
Unit IV 12 Hours
Game Playing and Planning
Mini-max search, Alpha-beta cutoffs, planning system, Block world problem, goal stack planning, hierarchical
planning, Natural language processing, syntactic processing. Decision trees, Perception, Vision, Speech
recognition.
Learning - Navigation – Manipulation - Robot Architecture

Textbook (s)
1. E. Rich K .Knight, and B. Nair, Artificial Intelligence, 3rdEdition, TMH, 1 July 2017
2. Russel Norvig, Artificial Intelligence A modern Approach, 3rd Edition, Pearson Education, 2010

Reference (s)
1. Patrick henry Winston, Artificial Intelligence, third edition, Pearson Education Asia, 2005
2. Dan W. Patterson, Introduction to Artificial intelligence and Expert Systems, 2nd Edition, PHI, 2009

55
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 40 40 --
Understand 30 40 --
Apply 30 20 70
Analyze -- -- 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. State the tasks, which are associated with A.I.
2. Give an example of crypt-arithmetic problem.
3. Define Speech Recogonition.
4. Recall Intelligence
Understand
1. Explain Turing Test.
2. Explain the characteristics of production system.
3. Write A* algorithm in detail and explain its functionality to solve 8-puzzle problem.
4. Explain the semantic analysis phase done through case grammars in Natural Language understanding
Apply
1. Distinguish between weak and strong slot filler structures
2. Discuss the tic-tac-toe problem in detail and explain how it can be solved using AI technique
3. Construct semantic net representation for the following:
(i) Pompeian (Marcus), Blacksmith (Marcus)
(ii) Mary gave the green flowered vase to her favorite cousin.

Analyze
1. Show that the tower of Hanoi problem can be classified under the area of AI. Give a state space representation
of the problem.
2. Give an example of a problem for which breadth-first search would work better than depth-first search.
Justify your answer.
3. Consider the following sentences:
John likes all kinds of food.
Apples are food.
Chicken is food
Anything anyone eats and isn’t killed by food.
Bill eats peanuts and is still alive.
Sue eats everything Bill eats.
(a) Translate these sentences into formula in predicate logic.
(b) Convert the formulas of part a into clause form.
Prove that John likes peanuts using resolution

56
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Open Book Exam Questions

Question 1:
Consider the following search tree produced after expanding node A, where each arc is labeled and the leaves are
labeled with the value of a heuristic function, h.

(i) Identify the node, which is expanded next by each of the following search methods?
(a) Breadth First Search
(b) Depth-First Search
(c) Best-First Search
(d) A* Search
(e) AO* Search
(ii) Construct the Min Max Tree for the above figure (ignoring the cost values)
(iii) Identify whether the tree is eligible for pruning or not, if it is yes trace the alpha beta prunes

57
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS303 Design and Analysis of Algorithms

3003
Course Outcomes

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

1. Analyse the performance of algorithms using space and time complexity, and asymptotic notations.
2. Implement algorithms using brute force and divide and conquer approaches.
3. Apply advanced data structures and graph algorithms to solve complex computational problems effectively.
4. Demonstrate the ability to solve problems efficiently using greedy approach.
5. Develop problem-solving skills by tackling complex computational problems using dynamic programming
and backtracking.
6. Apply branch and bound techniques to solve complex problems, and understand the concepts of NP-
completeness to identify NP-complete problems.
COs–POs Mapping
COs PO2 PO3
1 3 2
2 2 2
3 3 3
4 3 3
5 2 2
6 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 hours

Algorithm Analysis and Divide and Conquer

Fundamentals of algorithmic problem solving - Analysis framework - Performance Analysis: Space and Time
complexity - Growth of Functions: Asymptotic Notations - Mathematical Analysis of Non-recursive and Recursive
algorithms - Master's theorem - Brute Force String Matching Algorithm- Divide and Conquer: Merge sort, Quick
sort, Fibonacci search.

Interpolation search and Radix sort

Unit II 12 hours

Advanced Data Structures and Graph Algorithms:

Balanced Search Trees: AVL trees, B-trees - Heaps: Heapsort - Disjoint set: Find and Union Operations - Graphs:
Introduction, Representation - Graph Traversals: BFS, DFS, Topological sort.

Tries and Strongly Connected Components

Unit III 12 hours

Greedy and Dynamic Programming

Greedy Method: General method, Job sequencing with deadlines, Optimal Merge Patterns - Minimum cost
spanning trees: Prim’s and Kruskal’s Algorithms - Single source shortest path problem: Dijkstra’s Algorithm -
Dynamic Programming: General method, Matrix chain multiplication, 0/1 knapsack problem, All pairs shortest
path problem: Floyd Warshall Algorithm.

Graph coloring problem, Huffman Trees and Codes

Unit IV 12 hours

Backtracking and Brach and Bound

Backtracking: General method, n-queen problem, sum of subsets problem, Hamiltonian Circuit problem. Branch
and Bound: General method, Knapsack Problem, Traveling sales person problem, Assignment Problem.
Complexity Classes : P, NP and NP-Complete Problems.
Exhaustive Search, Space and Time Trade-Offs

Total: 48hours

58
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)

1. Introduction to The Design and Analysis of Algorithms, 3rdEdition, AnanyLevitin, Pearson Education, 2017.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L. Rivest, and C.Stein, PHI Pvt. Ltd./
PearsonEducation
3. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekaran, University press.
Reference (s)
1. Design and Analysis of algorithms,Aho,Ullman and Hopcroft,Pearsoneducation.
2. Algorithms–Richard Johnson BaughandM arcus Schaefer,Pearson Education.
3. www.geeksforgeeks.org
4. www.hackerearth.com
5. www.tutorialspoint.com

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 20 20 --
Understand 40 40 --
Apply 20 20 50
Analyze 20 20 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

Remember :
1. Define time complexity and space complexity in the context of algorithms.
2. What is the purpose of asymptotic notations like Big O, Big Omega, and Big Theta?
3. List the steps involved in the Merge Sort algorithm.
4. State the Master’s theorem for divide-and-conquer recurrences.
5. What are the key differences between AVL trees and B-trees?

Understand :l
1. Explain how the Brute Force String Matching Algorithm works and its time complexity.
2. Describe the basic idea of the Divide and Conquer approach with an example.
3. How does the Floyd-Warshall algorithm find the shortest paths between all pairs of vertices in a graph?
4. Explain the difference between a min-heap and a max-heap.
5. What is the significance of the depth-first search (DFS) in finding strongly connected components in a
graph?

Apply :
1. Apply the Quick Sort algorithm to the following list of numbers: [34, 7, 23, 32, 5, 62].
2. Using Dijkstra's algorithm, find the shortest path from a given source vertex to all other vertices in a
weighted graph.
3. Given a set of jobs with deadlines and profits, use the Greedy method to find the maximum profit
sequence.
4. Implement the BFS algorithm on a graph represented by an adjacency list.
5. Use the dynamic programming approach to solve the 0/1 Knapsack problem with given weights and
values.

Analyze :
1. Analyze the time complexity of the Radix Sort algorithm and compare it with other sorting algorithms like
Quick Sort and Merge Sort.
2. Compare and contrast the space efficiency of AVL trees and B-trees.
3. Analyze the advantages and disadvantages of using the Backtracking approach for solving the n-queen
problem.
4. Discuss the time complexity of the Floyd-Warshall algorithm and its feasibility for large graphs.
5. Examine the differences between P, NP, and NP-Complete problems, and provide examples of each.

59
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS305 Mathematical Foundation for Data Science

3003
Course Outcomes
After undergoing this course, the learners are enabled to
1.Demonstrate Vector Spaces and their applications.
2.Solve Problems involving, Linear Transformations and Inner product spaces
3.Apply generating functions and Characteristic roots to solve recurrence relations
4.Derive statements using the rules of inference for Mathematical logic.
5.Understand the basic knowledge of Graph theory and applications and the rules of inference for
Predicate logic.
6.Construct the minimum spanning tree using different algorithms.

CO-PO Mapping
CO PO1
1 3
2 3
3 3
4 3
5 3
6 3
3-Strongly linked | 2-Moderately linked | 1-Weaklylinked
Unit I
Vector Spaces and Linear Transformations

Vector Spaces: Definition, Properties of Vector Spaces, Subspaces, Algebra of Subspaces, Basis and
Dimension, Linear Span, Linear Independence and Dependence of vectors.

Linear Transformations: Definition, Properties, Range and Null Spaces, Rank-Nullity theorem,
Matrices of Transformations. (All theorems without Proof)
Singular Value Decomposition

Unit II
Inner Product Space and Recurrence Relations

Inner Product Spaces: Definition, Properties of Inner Product Spaces, Norm of a vector, Cauchy-
Schwarz’s Inequality (without Proof), Complete orthonormal set, Gram-Schmidt Orthogonalization
process.

Recurrence Relations: Generating Functions, Calculating Coefficient of Generating Functions,

Solving Recurrence Relations by Substitution method, Solving Recurrence Relations by Method of
Characteristic roots, Solving Recurrence Relations by generating functions
Bessel’s inequality
Unit III
Mathematical Logic
Propositional Logic: Statements and Notations, Connectives, Well-formed Formulas, Truth Tables,
Tautology, Equivalence Implication, Normal Forms, Rules of Inference for Statement Logic, Proof
Techniques, Proof by Contradiction, Method of Induction.

Predicative Logic: Quantifiers, Universal Quantifiers, Free & Bound Variables, Rules of Inference for
Predicate Logic.
Relations in Databases
Unit IV
Graph Theory
Basics of Graph Theory: Representation of Graphs, Degree of a Graph, Complete Graphs, Regular
60
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Graphs,Bipartite Graphs, Walk – Path – Circuit – Cycle, Planar Graphs, Euler’s Formula, Isomorphism,
Euler Circuit and Hamilton Cycle, Chromatic Number.

Trees: Definition and properties of tree, Spanning Tree, Breadth First Search (BFS) algorithm,
Depth First Search (DFS) algorithm, Minimum Spanning Tree, Kruskal algorithm, Prim’s algorithm.
Applications of Graphs and Trees, Ternary Tree
Textbook(s)
1. Gilbert Strang, “Linear Algebra and Learning from Data”, Wellesley, Cambridge Press, 2019.
2. Kenneth H. Rosen, Discrete Mathematics and Applications, 7th Edition, Tata McGraw Hill,
2015.
3. J. L. Mott, A. Kandel & T. P. Baker, Discrete Mathematics for Computer Scientists &
Mathematicians, Prentice Hall India, 2nd Edition, 2010.

Reference (s)
1. Tremblay J.P. and P. Manohar, Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw Hill,2007.
2. Erwin Kreyszig, Advanced Engineering Mathematics, Wiley India, 2015.
3. K Hoffman and R Kunze, Linear Algebra, Pearson Education, 2017.

Internal Assessment Pattern

Cognitive Int. Test 1 Int. Test 2 Assignment Test/
Level (%) (%) Open Book Exam
(%)
Remember 30 30 --
Understand 40 40 --
Apply 30 30 60
Analyze -- -- 40
Evaluate -- --
Create -- -- --
Total (%) 100 100 100

Remember
1. Define Vector Space.
2. State Hand shaking theorem.

Understand
1. Prove that “if is odd then n is odd” by the method of contradiction.
2. Explain about Euler circuit and Hamiltonian cycle with suitable examples.
Apply
1. Find rank of the transformation defined by using
Rank-Nullity Theorem.
2. Obtain the matrices U, V and S such that , where [ ] using Singular
Value Decomposition.
Analyze
1. Prove the validity of the following argument: "If I study, then I will pass in exam. If I do
not go to cinema, then I will study. But I failed in exam. Therefore, I went to cinema."
2. Draw a graph which contains an Eulerian circuit but not an Hamiltonian cycle with
justification

61
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Open Book Exam

1. Construct an AVL tree by inserting the following elements in the order given: {10, 6, 9, 4, 8,
7, 2, 11, 12, 3, 5, 1}, and balancing as necessary. Delete the elements in the following order
{9, 6, 2, 5, 10, 3, 1, 4, 7, 8, 12, 11} balancing as necessary. Show the intermediate steps of
deletion when re-balance (rotation) is used and end result of the insertion.
2. Model the matrix for the figure given below.

i. Draw the image corresponding to the matrix obtained by multiplying [ ] with

obtained matrix in (i)
ii. Sketch the image and write the corresponding matrix by rotating the following figure

through the angle about the point[ ].

62
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS306 Object Oriented Programming with JAVA

3003
Course Outcomes
1. Summarize object oriented programming concepts
2. Develop applications using different types of inheritances
3. Create and use user defined packages
4. Analyze and recover runtime exceptions arise in the applications
5. Apply parallel processing applications using threads
6. Develop interactive applications for standalone and Internet
COs–POs Mapping
COs PO1 PO2 PO3
1 3 2 3
2 3 1 3
3 1 1 2
4 2 1 3
5 3 1 3
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 13 Hours
Introduction to Java
Overview of Object Oriented Programming principles, Importance of Java to the Internet, Byte code, Methods,
classes and instances, Data types, arrays, control statements, simple java program, Classes and Objects–
constructors, methods, access control, this keyword, overloading methods and constructors, garbage collection,
java.lang – String, StringBuffer, StringBuilder, Type wrappers – Integer, Character, Float, Double, Boolean
Features of object oriented programming–Java History–Computer Programming Hierarchy–Role of Java
Programmer in Industry

Unit II 11 Hours
Inheritance, Packages & Interface
Inheritance: Basics, Using super, Multilevel Hierarchy, Method overriding, Dynamic Method Despatch, Using
Abstract classes, Using final with inheritance, Sealed Classes
Packages: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, Member
access rules, Java Collections – Arrays, ArrayList, Hashtable, StringTokenizer, Vector
Interface: Defining an interface, differences between classes and interfaces, implementing interface, variables in
interface and extending interfaces, Default Methods in Interfaces, Static Methods in Interface
Nested–Inner Class & Anonymous Classes–Generic Class Types

Unit III 12 Hours

Exception Handling & Multithreading
Exception handling: Concepts and benefits of exception handling, exception hierarchy, usage of try, catch, throw,
throws and finally, built-in and User Defined Exceptions
Multithreading: Definition thread, thread life cycle, creating threads, synchronizing threads, daemon threads
Control Flow In Exceptions– JVM reaction to Exceptions– Inter Communication of Threads– Critical Factor in
Thread–Deadlock
Unit IV 12 Hours
Applets & Event Handling
Applets: Concepts of Applets, life cycle of an applet, types of applets, creating applets, passing parameters to
applets, The AWT class hierarchy, user interface components labels, button, Text components
Event Handling: Events, Delegation event model, handling mouse and keyboard events, Adapter classes, inner
classes, Compare basic AWT components with swing components, More user interface components-canvas,
scrollbars, check box, choices, lists panels–scroll pane, dialogs, menu bar, layout managers.
Applet Security Policies–Anonymous Inner classes a Short–cut to Event Handling–Java Utilities (java.util Package)
63
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Total: 48 Hours

Textbook (s)
1. H. Schildt, Java: The complete reference, 7th Edition, TMH, 2006
2. T. A. Budd, An Introduction to Object–Oriented Programming, 3rd Edition, Addison Wesley Longman, 2002
Reference (s)
1. Dietal&Dietal, Java: How to Program, 8th Edition, PHI, 2010
2. C. S. Horstmann and G. Cornell, Core Java, Vol 1. Fundamentals, 7th Edition, Pearson Education, 2004
3. C. Horstmann, BIG JAVA Compatible with Java 5 & 6, 3rd Edition, Wiley Publishers, 2008

SAMPLE QUESTION (S)

Internal Assessment Pattern
Int. Test 1
Cognitive Level Int. Test 2 (%) Assignment Test1 (%)
(%)
Remember 25 15 10
Understand 30 15 30
Apply 25 40 30
Analyze 20 20 30
Evaluate -- 10 --
Create -- -- --
Total (%) 100 100 100

Remember
1. List all OOPs principles
2. Define class and object
3. Illustrate various data types supported by JAVA
4. State various access controls available in JAVA
5. Define inheritance
6. Define thread

Understand
1. Explain byte code
2. Explain the use of super, static and final keywords
3. Illustrate the use of try, catch, throw and throws
4. Java is purely object oriented programming language. Explain
5. Explain types of polymorphism with Example
Apply
1. Write statements that perform the following one-dimensional-array operations:
a) Set the 10 elements of integer array counts to zero
b) Add one to each of the 15 elements of integer array bonus
c) Display the five values of integer array best Scores in column format
2. Create two arrays that store all even no’s in one array and all odd no’s in another
array for a given set of elements
3. Write a java program to implements final variable, Method and classes
4. Explain the reason for the following code giving compiling errors.
abstractclassAbstractClass
{
abstractvoidabstractMethod()
{
System.out.println("First Method");
}
}
5. Write a java program to implement the following techniques
a) Method Overloading

64
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

b) Method Overriding
6. Write a Java program to implement Virtual function technique

Analyze
1. Compare and Contrast an abstract class and an interface
2. Differentiate method overloading and overriding
3. Differentiate abstraction and encapsulation
4. Identify the uses of calling a synchronize method inside a synchronize method
5. Identify memory leak problems in Java objects

65
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS307 Design and Analysis of Algorithms Lab

0 0 3 1.5
Course Outcomes

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

1. Analyze the performance of algorithms by implementing and measuring their space and time complexity
using asymptotic notations.
2. Implement algorithms using brute force and divide and conquer approaches, and assess their efficiency.
3. Implement advanced data structures and graph algorithms to solve complex computational problems, and
evaluate their performance.
4. Solve optimization problems efficiently using a greedy approach, and analyze the results.
5. Develop dynamic programming solutions to tackle complex computational problems, and measure their
effectiveness.
6. Apply backtracking and branch and bound techniques to solve complex problems.

Practical Components
1. Analysis of recursive algorithms
2. Analysis of Non-recursive algorithms
3. Solve the String matching problem using Brute Force approach
4. Solve sorting problem using divide and conquer approach
5. Implement heapsort algorithm using a max-heap.
6. Implement Simple Union and Find operation on disjoint-sets
7. Implement the graph traversal algorithm.
8. Implement topological sorting of a directed acyclic graph (DAG).
9. Find the minimum cost spanning tree for a given graph using greedy approach
10. Implement dijkstra’s algorithm using greedy approach
11. Solve matrix chain multiplication problem using dynamic programming
12. Solve the 0/1 knapsack using dynamic programming
13. Implement Floyd algorithm using dynamic programming
14. Find the sum of subsets using backtracking technique
15. Solve N queen problem using the backtracking technique.
16. Find the solution for Assignment Problem using branch and bound method

66
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS308 JAVA Lab

0 0 3 1.5
Course Outcomes
1. Make use of JAVA SDK environment to create - debug and run java programs
2. Create applications based on code reusability
3. Develop programs using threads
4. Develop and debug real time problems using exception handling
5. Create interactive applications using event handling mechanisms
6. Design Graphical User Interface using AWT components

COs PO2 PO3 PO4 PO5

1 3 2 3 1
2 3 2 3 1
3 2 2 2 1
4 2 2 3 1
5 2 2 3 2
6 2 3 2 2

List of Experiments
1. Case Study: Permutations and Combinations Calculator
User Input:
 The program should prompt the user to enter the total number of elements (n) and the number
of elements to be selected (r).
 Validate the input to ensure that both n and r are positive integers, and r is less than or equal to
n.
Functional Description:
 Create a method calculate Permutations that takes two integers n and r as input and returns
the number of permutations.
Formula nPr = n! / (n - r)!, where "!" denotes factorial.
 Create a method calculate Combinations that takes two integers n and r as input and returns
the number of combinations.
Formula nCr = n! / (r! * (n - r)!).
 Implement a separate method to calculate the factorial of a given integer.
Sample Output:
Enter the total number of elements (n): 5
Enter the number of elements to be selected (r): 3
Permutations (nPr): 60
Combinations (nCr): 10
2. Conversion Utility that allows users to convert measurements between different units.
User Input:
 The program should prompt the user to enter positive integer value for conversion type.
 The program should prompt the user to enter the positive input (feet/ meters/ miles/
kilometers) based on user option.
Functional Description:
 utilize method overloading to handle conversions between various units, such as feet to meters,
miles to kilometers, and vice versa.
formula:feet to meters - feet * 0.3048
miles to kilometers - miles * 1.60934
Sample Output:
Measurement Conversion Utility
1. Feet to Meters
2. Meters to Feet
3. Miles to Kilometers
4. Kilometers to Miles
5. Exit

67
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Enter your choice: 3

Enter the distance in miles: 5

5 miles is approximately 8.046 kilometers.
3. Case Study: BankAccount Class with Constructor Overloading
Functional Description:
 Create a BankAccount class to represent a bank account. The class should have private
attributes such as accountNumber (a unique identifier for the account), accountHolderName,
and balance (representing the current account balance).
 The class should have the following constructors:
o BankAccount(String accountNumber, String accountHolderName): Create an
account with a zero balance.
o BankAccount(String accountNumber, String accountHolderName, double
initialBalance): Create an account with the specified initial balance.
 Implement methods to:
o deposit(double amount): Add the given amount to the account balance.
o withdraw(double amount): Subtract the given amount from the account balance if
sufficient funds are available.
Sample Output:
Welcome to the Bank Account System
Creating a new account...
Enter the account holder's name: John Doe
Enter the initial balance: 500.0
Account created successfully.
Account Number: ACCT123456
Account Holder: John Doe
Balance: $500.00
What would you like to do?
1. Deposit
2. Withdraw
3. Exit
Enter your choice: 1
Enter the amount to deposit: 250.0
$250.00 deposited successfully.
Updated Balance: $750.00
4. Implement inheritance concept for below case study:
Note: class FictionBook extends class LibraryBook, class ClassicBook and class ScienceFictionBook
extends from FictionBook
 LibraryBook: Represents a general library book with attributes like title, author, and year,
along with a method displayBookInfo() to display book details.
 FictionBook: Extends LibraryBook and adds an additional attribute genre.
 ClassicBook: Extends FictionBook and adds an additional attribute publisher.
 ScienceFictionBook: Extends FictionBook and adds an additional attribute edition
5. Case Study: Abstract Class for Finding Areas of Different Shapes
User Input:
 The program should prompt the user to enter positive integer value to calculate type of area.
 The program should prompt the user to enter the input based on user option.
o Circle: Requires the radius as an input parameter
o Rectangle: Requires the length and width as input parameters.
o Triangle: Requires the base and height as input parameters.
o Square: Requires the side length as an input parameter.
Functional Description:
 Create an abstract class Shape that will serve as the base class for different shapes. Include an
abstract method calculateArea()
 Create concrete subclasses that extend the Shape class for different shapes like Circle,
Rectangle, Triangle and Square.
Sample Output:
Select a shape:
1. Circle
2. Rectangle
3. Triangle
68
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

4. Square
5. Exit
Enter your choice: 1

Enter the radius of the circle: 5

The area of the selected shape is: 78.53981633974483
6. Implement Dynamic Method Dispatch in Java.
7. i. Create an ArrayList of integers to store a collection of numbers. Implement methods to add elements to
the list, remove elements, update elements, and search for elements in the list.
ii. Create a Java program that accepts a string input from the user. Use the StringTokenizer class to
tokenize the input string into separate tokens based on specified delimiters (e.g., space, comma, etc.).
8. Demonstrating Mutability Differences between String, StringBuilder, and StringBuffer in Java
 Explain the Concept in 100 words.
 Perform string manipulation operation concatenation on each class
 Print the results of each class after modification operation
9. Demonstrate multiple inheritance-like behavior achieved through interface implementation.
10. Case Study: Java Program Illustrating Multiple Catch Clauses with Finally Block
Functional Description:
 Implement exception handling for possible exceptions that may occur during the division, such
as ArithmeticException and NumberFormatException.
 Use multiple catch clauses to handle ArithmeticException and NumberFormatException
separately.
 Use a finally block to execute code that should be performed regardless of whether an
exception occurred or not
Sample Output:
Enter the dividend: 10
Enter the divisor: 0
Division by zero is not allowed.
Execution completed.
11. Create your own custom exception classes to handle specific situations or errors that are not covered by
the built-in exception classes.
Functional Description:
 Create a custom exception class that extends the Exception class (or any other appropriate
superclass, depending on your requirements).
 Define the custom exception class to represent a specific error situation, such as
InvalidAgeException, which is thrown when an invalid age is provided.
 Use the custom exception class in a method to throw the exception when a certain condition is
met, such as when the age is less than zero or exceeds a specific limit.
Constraints:
The program should prompt the user to enter age integer value. Here, age<0 or age>120
Sample Output:
Enter age:-5
Exception: Invalid age. Age must be between 0 and 120.
12. Creates three threads by extending the Thread class. Each thread will display a specific message at a
regular interval. The messages to be displayed are as follows:
First thread: "Good Morning" every 1 second
Second thread: "Hello" every 2 seconds
Third thread: "Welcome" every 3 seconds
Note: implement the same by using Runnable interface.
13. Case Study: Java Program for Producer-Consumer Problem
User Input:
 The program should prompt the user to enter positive integer valuesfor bufferSize
 The program should prompt the user to enter positive integer values to produceCount and
consumeCount
Functional Description:
 Buffer Implementation:
o Create a shared buffer with a limited size (e.g., an array or an ArrayList) to hold the
produced items.
 Producer & Consumer Implementation:
o Create a Producer class & Consumer class that implements the Runnable interface.
o The Producer class should produce items and put them into the buffer.
69
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

o The Consumer class should consume items from the buffer.

o Implement synchronization to avoid race conditions when accessing the buffer.
Sample Output:
Enter Buffer Size:5

Enter Procedure Count:5

Enter Consumer Count:5
Produced: 0
Consumed: 0
Produced: 1
Consumed: 1
Produced: 2
Consumed: 2
Produced: 3
Consumed: 3
Produced: 4
Consumed: 4
14. Case Study: Java Program for a Basic Calculator using AWT
In this case study, we'll implement a Java program to create a basic calculator using AWT. The calculator
will have a simple graphical user interface (GUI) with buttons for numbers, arithmetic operations,
and a display to show the result of calculations.
AWT Implementation:
 Create a Java AWT to implement the calculator GUI.
 The AWT should have buttons for digits (0 to 9), arithmetic operations (addition, subtraction,
multiplication, division), and an equal (=) button to perform calculations.
Display and Input:
 Implement a display area where the user can see the entered numbers and the result of
calculations.
 Provide a way for users to input numbers and arithmetic operations using the GUI buttons.
Basic Calculations:
 Implement methods to handle basic arithmetic calculations (addition, subtraction,
multiplication, division).
 Perform calculations based on the user's input and display the result in the GUI.
User Interface:
 Design a user-friendly GUI with appropriate labels, buttons, and display areas.
 Use layout managers to organize the components effectively.
15. Case Study: Java Program for Temperature Converter using AWT
In this case study, we'll implement a Java AWT to create a Temperature Converter. The AWT will allow
users to convert temperatures between Celsius and Fahrenheit. The user will input a temperature
value in one unit, and the AWT will display the converted temperature in the other unit.
AWT Implementation:
 Create a Java AWTpplet to implement the temperature converter GUI.
 The AWT should have input fields for the temperature value and buttons to select the source
and target temperature units (Celsius or Fahrenheit).
 Use appropriate layout managers to organize the components effectively.
Conversion Logic:
 Implement methods to handle temperature conversions between Celsius and Fahrenheit.
 The temperature conversion formulas are:
o Fahrenheit to Celsius: C = (F - 32) * 5 / 9
o Celsius to Fahrenheit: F = (C * 9 / 5) + 32
User Interface:
 Design a user-friendly GUI with appropriate labels, input fields, and buttons.
 Display the converted temperature in the GUI after the conversion is performed.
16. Case Study: Java Swing Application for Job Application Form
In this case study, we'll implement a Java Swing application with a JFrame that contains fields for name,
age, email, and qualifications. The application will validate the form data when the user clicks the
"Submit" button. If all fields are filled, the data will be written to a file named "application_form.txt."
Swing Application:
 Create a Java Swing application with a JFrame to display the job application form.
 Design the form with labels for each field (name, age, email, qualifications) and corresponding
input fields (text fields or other appropriate components).
70
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

 Add a "Submit" button to the form to allow users to submit their job application.
Data Validation:
 Implement validation for the form data to ensure that all fields are filled before submission.
 Display error messages for missing fields or invalid data.
Data Writing:
 Create a method to write the validated form data to a file named "application_form.txt."
 The file should be created in the current working directory.
 Use appropriate file handling techniques to write the data.
User Interaction:
 Allow users to input their name, age, email, and qualifications using the form fields.
 Trigger the form data validation when the user clicks the "Submit" button.
 Display appropriate messages to inform the user about the success or failure of form
submission.

List of Augmented Experiments

1. New Patient Registry Management System
2. Restaurant Billing Management System
3. Library Management System
4. ATM Management System
5. Bus Ticket Booking Management System
6. Movie Ticket Booking Management System
7. Queuing Management System
8. Attendance Management System
9. Medical Store Billing Management System
10. Text Editor Projects in Java
11. Google Search Engine Filter
12. Electronic voting System
13. Day Planner
14. Library management System
15. Personal Finance Management System

Reading Material (s)

1. JAVA Lab manual, Department of CSE and IT, GMRIT, Rajam

71
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ESX01 Employability Skills I

0020
Course Outcomes
1. Demonstrate oral communication and writing skills as an individual to present ideas coherently
2. Introspect & develop life skills with constructive approach
3. Assess and improve analytical skills
4. Illustrate the knowledge of the basics of Unix/Linux commands
5. Apply the concepts of shell scripting on data and files
6. Understand the utility of SED to work on specific data

COs –POs Mapping

COs PO1 PO2 PO5 PO 8 PO10 PO12
CO1 - - - - 3 -
CO2 - - - - 2 2
CO3 2 - - 2 - -
CO4 3 - 2 2 - -
CO5 3 2 2 - - 2
CO6 2 2 2 - - -
3–Strongly linked | 2–Moderately linked| 1–Weakly linked

Unit-I
Communication Skills 16 hours
Communication Skills & Confidence: How Communication Skills affect Confidence? How to communicate
effectively.(with Examples)
Listening: Listening? , Listening Vs Hearing, Possible reasons for why people do not Listen at times, Active
Listening Vs Passive Listening, How Listening can affect our relationships? How Listening helps in Campus
Placements also? (with Examples)
Goal Setting: SMART Technique to Goal Setting, Putting First things First, SWOT Analysis and Time Management
Attitude & Gratitude: Attitude Vs Skills Vs Knowledge, Attitude Vs Behaviour, How to develop Positive Attitude?
Developing the attitude of Gratitude.
Public Speaking: JAM, J2M, Presentations by Students on General Topics.

Quantitative Aptitude 16 hours

Number system, L.C.M and H.C.F, Problems on Ages, Averages, Time and work, Pipes and cisterns

Unit-II
Module-1:
No of Hours: 16 Hours
Introduction: Importance of Competitive Programming, Conditional Statements, Loops, Nested Loops. Strings:
Declaration of strings, Accessing strings elements, operations

Practice Problems:
Week Topic Practice Problem Links
Introduction to Competitive Codechef, Hackerrank,Codeforces,
1
Programming Leetcode, interviewbit…etc
https://www.codechef.com/practice/tags/basic-programming-
Conditional Statements-I concepts
2
https://www.codechef.com/practice/tags/conditional-statements
https://www.codechef.com/practice/tags/basic-programming-
Conditional Statements-II concepts
3
https://www.codechef.com/practice/tags/conditional-statements
https://www.codechef.com/practice/tags/loops
https://leetcode.com/tag/math/
Loops-I
4 https://www.interviewbit.com/practice/#topics[]=math
https://www.codechef.com/practice/tags/basic-maths
https://www.codechef.com/practice/tags/loops
https://leetcode.com/tag/math/
Loops-II
5 https://www.interviewbit.com/practice/#topics[]=math
https://www.codechef.com/practice/tags/basic-maths
https://www.codechef.com/practice/topics/math
Nested Loops-I
6 https://www.interviewbit.com/practice/#topics[]=math
72
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

https://leetcode.com/tag/math/

https://www.codechef.com/practice/topics/math
Nested Loops-II
7
https://www.interviewbit.com/practice/#topics[]=math
https://leetcode.com/tag/math/
https://www.codechef.com/practice/topics/strings
Strings-I https://leetcode.com/tag/string/
8
https://www.interviewbit.com/practice/#topics[]=strings
https://www.codechef.com/practice/topics/strings
Strings-II https://leetcode.com/tag/string/
9
https://www.interviewbit.com/practice/#topics[]=strings

https://www.codechef.com/practice/topics/strings
10 String Matching Algorithms https://leetcode.com/tag/string/
https://leetcode.com/tag/string-matching/
https://www.interviewbit.com/practice/#topics[]=strings
Module-2:
No of Hours: 16 Hours
Arrays: Basics on Arrays: Creating elements, converting a string into array of characters, converting a number
into array of character, accessing array elements Recursion: Definition, examples and how recursion differs from
iteration.
Practice Problems:
Week Topic Practice Problem Links
https://www.hackerrank.com/domains/data-
structures?filters%5Bsubdomains%5D%5B%5D=arrays
11 Arrays - I https://leetcode.com/tag/array/
https://www.codechef.com/practice/topics/arrays
https://www.interviewbit.com/practice/#topics[]=arrays
https://www.hackerrank.com/domains/data-
structures?filters%5Bsubdomains%5D%5B%5D=arrays
12 Arrays - II https://leetcode.com/tag/array/
https://www.codechef.com/practice/topics/arrays
https://www.interviewbit.com/practice/#topics[]=arrays
https://www.interviewbit.com/practice/#topics[]=two-pointers
https://leetcode.com/tag/two-pointers/
13 2D Arrays & Matrix
https://leetcode.com/tag/matrix/
https://www.codechef.com/practice/tags/matrices
https://leetcode.com/tag/recursion/
14 Recursion - I
https://www.codechef.com/practice/tags/recursion
https://leetcode.com/tag/recursion/

Recursion - II & https://www.codechef.com/practice/tags/recursion

15
Assessment https://www.hackerearth.com/practice/basic-
programming/recursion/recursion-and-backtracking/practice-
problems/
Recursion - III & https://leetcode.com/tag/recursion/
16
Assessment - II https://www.codechef.com/practice/tags/recursion

Total: 32 Hours
References:
1. https://leetcode.com
2. https://www.codechef.com
3. https://www.hackerearth.com
4. https://www.interviewbit.com
5. https://www.hackerrank.com
73
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

4thSemester
23IT304 Database Management Systems
3003
Course Outcomes
1. Understand the fundamental concepts of data base and data models
2. Explain the use of Relational Algebra and integrity constraints in databases
3. Use SQL's Commands to handle the Database
4. Apply Normalization for schema refinement
5. Make use of the concept of transaction management and recovery system in databases
6. Outline Indexing concepts, different types of data
CO–PO Mapping
CO PO1 PO4 PO12
1 3 2 1
2 3 3 2
3 3 2 2
4 2 3 1
5 3 3 2
6 3 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Introduction to DBMS and ER Model 12 Hours
DBMS Vs. File System, instance and schema, Data abstraction, Data independence, database users and
database administrator, Database system structure, Introduction to Data Models (E-R Model, Relational
Model, Hierarchical Model, Network Model, Object Oriented Data Model), Database Design Process, Entities,
Attributes, Entity Sets, Relationships, Relationship Sets, Additional features of ER Model.

Applications of DBMS, Object Relational Data Model

Unit II
Introduction to Relational Model and Basic SQL Queries 12 Hours
Relational Algebra Operations: Selection, Projection, Rename, Set Operators, Joins, Division, Examples of
Relational Algebra Queries, Relational Calculus: Tuple Relational Calculus.
Integrity Constraints over Relations, Introduction to Views.
SQL Queries: Basic Structure, Set Operations, Aggregate Functions, Null values, Sub Queries, Group By And
Having Clauses, Outer Joins.
Domain Relational Calculus, Query Optimization
Unit III 12 Hours
Normalization and Transaction Management
Introduction To Schema Refinement - Problems Caused By Redundancy - Decomposition - Problems Related
To Decomposition - Functional Dependency - Closure of a Set of Fds - Attribute Closure - First - Second -
Third Normal Forms – BCNF - Multi Valued Dependencies – Fourth Normal Form, Join Dependency, Fifth
Normal Form
Transactions: Acid Properties of Transaction - Transaction States - Schedule: Serial Schedule - Concurrent
Schedules - Anomalies Associated with Concurrent Schedules (RW - WR - and WW Conflicts) - Serializability
- Conflict Serializability - and View Serializability.
EF Codd Rules, Domain Dependency
Unit IV 12 Hours
Locking, Recovery Systems, Indexing, Different Types of Data
Introduction to Lock Management-Lock Based Concurrency Control: 2pl-Strict 2pl-Concurrency without
Locking: Timestamp–Based Concurrency Control, Optimistic Concurrency Control. Introduction to Aries - the
Log - the Write-Ahead Log Protocol-Check Pointing Indexing: Types of Single-Level Ordered Indexes,
Multilevel Indexes Different Types of Data: Structured, Semi-Structured and Unstructured Data
Heap File, Hash File Organizations

Total: 48 Hours

74
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)

1. Elmasri & Navatha, Fundamentals of Database Systems, Pearson Education, 7 thEdition,2016

2. SilberschatzKorth, Database System Concepts, McGraw hill, 7 thEdition,2020

Reference (s)
1. SorayaSedkaoui, Data Analytics and Big Data, Wiley, 1st Edition,2018.
2. PeterRob&CarlosCoronel,DatabaseSystemsdesign,ImplementationandManagement,9th
Edition, 2010.
3. Raghurama Krishnan & Johannes Gehrke, Database Management Systems, TATA McGraw-Hill, 3rd
Edition,2003
th
4. C.J.Date, An Introduction to Database Systems, Pearson Education, 8 Edition,2006

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Open Book Exam (%)
(%)
Remember 40 40 --
Understand 30 40 --
Apply 30 20 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. List any four application of DBMS
2. Define data model
3. List any four applications for triggers
4. Define functional dependency
5. List the 4 properties of Transaction
Understand
1. Explain E-R Model with suitable example
2. Explain the role of integrity constraints in database design
3. Illustrate the working principle of ‘write a head log’ protocol
4. Differentiate 3NF and4NF
5. Explain Two Phase Locking Protocol
Apply
1. When multiple transactions are being executed by the operating system in a multiprogramming
environment, there are possibilities that instructions of one transaction are interleaved with some other
transaction. Apply the suitable concept to overcome the problem
2. Classify various normal forms according to their applicability
3. Give some real-world applications of Normalization
4. Illustrate the Commit and Rollback operations of Transaction Control
5. Give some real-world applications for Database indexing techniques
Analyze
1. Compare File processing system with DBMS
2. Analyze different locking protocol for concurrency control and serializability
3. Normalization will increase the complexity of the database design. Justify
4. Compare DDL and DML of SQL
5. Compare and Contrast Serializability and Recoverability
Evaluate
1. Is database redesign is necessary? explain
2. How can you evaluate the performance of two data models?
3. Evaluate the performance of query processor and list the corresponding metrics
4. How can you assess the throughput and delay for any DBMS?
5. How can you evaluate the impact of data models on the query processing?

75
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Open Book Exam Questions

Question 1:
Anitha has a large CD collection. Her friends like to borrow her CD's, and she has to keep track of who has what.
She maintains a list of friends, identified by unique FID's and a list of CD's, identified by CID's. With each friend
are the name and telephone numbers which she can call to get the CD back. With each CD is actor name and title.
Whenever a friend borrows a CD, She will enter that fact into her database along with the date borrowed.
Whenever the CD gets returned, that fact, too, gets noted along with the date returned. Anitha wants to keep a
complete history of her friends' borrowing habits so that she can ask favors of the heavy borrowers.
Draw an ER diagram to figure out the above situation and identify types of attributes and cardinality. Represent
this database as a collection of 3NF relational tables.

Question 2:
The relational scheme R(A,B,C,D,E,F) and set of functional dependencies AB -> D, E -> C, AF -> B. From this, find
out all super keys for this relation, and which of these super keys form a key.

76
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23IT403 Operating Systems

Course Outcomes 3003
1. Understand computer resources and operating system management.
2. Analyze various CPU Scheduling Algorithms for Process Management.
3. Examine process synchronization and coordination of operating system.
4. Analyze the Main Memory Management and allocation strategies.
5. Identify the use of Virtual Memory management policies with respect to storage management.
6. Identify the need of File-System Interface and I/O Systems.

CO–PO Mapping
CO PO1 PO12
1 3 2
2 3 2
3 3 2
4 3 2
5 3 2
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Operating-Systems Overview and Process Management 12 Hours
Operating-System Overview: Computer-System Organization and Architecture, Operating-System
Structure, Operating-System Operations & Services, System Calls & its types.
Threads: Multi Core Programming, Multithreading Models, Thread Scheduling algorithms.
Process Management: Process Concepts, Process Scheduling Criteria, Scheduling Algorithms and
evaluation.
Thread issues, Multilevel Queue, Multilevel feedback Queue Scheduling.

Unit II
Inter Process Communication Mechanism 12 Hours
Process Synchronization: Cooperative process, the Critical Section Problem, Peterson’s Solution,
Synchronization Hardware, Semaphores, Classical Synchronization problems.
Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock
Avoidance & Detection, Recovery from Deadlock.
Monitors, Synchronization Examples.

Unit III
Memory Management 12 Hours
Main Memory: Contiguous Memory allocation, Swapping, Segmentation, Paging, Segmented paging,
Multilevel paging.
Virtual Memory Management: Demand Paging, Page Replacement algorithms, Allocation of Frames.
Structure of page table, Thrashing, Memory-Mapped Files.

Unit IV
File System Interface &I/O Systems 12 Hours
Mass-Storage Structure: Disk structure, Disk Scheduling, Disk management, Raid Structure.
File System: Access Methods, Directory Structures, Allocation Methods, Free-Space Management.
I/O Systems: I/O hardware Application of I/O Interface, Kernel I/O Sub-System.
File Sharing, File System Recovery, Transforming I/O Requests to Hardware Operation.
Total: 48 Hours

Textbook (s)
1. Operating System Concepts, Abraham Silberschatz, Greg Gagne, Peter B. Galvin, 9th Edition, Wiley,
2016.
2. Operating Systems, Harvey M. Deitel,Paul J. Deitel, David R. Choffnes, 3rd Edition, Pearson
Prentice Hall,2004.

77
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Reference (s)
1. Operating Systems: Internals and Design Principles, William Stallings, 7th Edition, Pearson
Prentice Hall,2013.
2. Operating systems: A Concept based Approach, D. M. Dhamdhere, 2nd Edition, TMH,2006.
3. Operating System: A Design Approach, Crowley, 1st Edition, TMH,2001.
4. Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI,2009.

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 20 20 --
Understand 30 10 --
Apply 30 30 40
Analyze 10 20 30
Evaluate 10 20 30
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. List any four operating systems
2. Define operating system
3. List any four operating system services

Understand
1. Explain Systemcalls
2. Explain the role memory management in operating system
3. Illustrate the working principle critical section problem

Apply
1. When multiple transactions are being executed by the operating system in a multiprogramming
environment, there are possibilities that instructions of one transaction are interleaved with
some other transaction. Apply the suitable concept to overcome the problem
2. Give an example of a scenario that might benefit from a file system supporting an append-only
access write.
Analyze
1. Context switching between two threads of execution within the operating system is usually
performed by a small assembly language function. In general terms, what does this small
function do internally?
2. Compare CPU scheduling algorithms
3. Analyze the general strategy behind deadlock prevention, and give an example of a practical
deadlock prevention method.
Evaluate
1. Assuming the operating system detects the system is deadlocked, what can the operating system
do to recover from deadlock?
2. Describe how to implement a lock using semaphores

Open Book Exam Questions

1. A file to be shared among different processes, each of which has a unique number. The file can be
accessed simultaneously by several processes, subject to the following constraint: the sum of all
unique numbers associated with all processes currently accessing the file must be less than n.
Write a monitor to co-ordinate the access to the file. On may want to write start_access and
end_access monitor procedures.

2. Consider a paging system with the page table stored in memory:

a. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take?
b. If we add associative registers, and 75% of all page-table references are found in the associative
registers, what is the effective memory reference time?

78
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS403 Computer Organization and Architecture

3003

Course Outcomes
At the end of the course, students will be able to
1. Interpret the functional architecture of computing systems.(Understand).
2. Summarizethetypesofinstructionanditsmicrooperationwithaddressingmodes(Understand)
3. Identify various arithmetic operations on fixed, floating point numbers and its representation
(Apply)
4. Illustrate the concepts of control unit design and I/O processor(Understand)
5. Understand the memory hierarchy concepts(Understand)
6. Describe concept of parallelism and types of hazard(Understand)

CO-PO Mapping
CO PO1 PO12
1 3 2
2 2 2
3 3 1
4 3 2
5 3 2
6 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Overview & Microoperation 13 Hours
Components of a computer system – Performance measures - Classifying Instruction Set Architecture-
Representing instructions -Micro operation – Logical operations – Shift operations - instruction codes -
Computer Registers instruction –memory Reference instruction –Input-Output Reference instruction -
Instruction cycle -Addressing and addressing modes.

Trends in Technology-Arithmetic micro-operations

Unit II
Arithmetic Operations 11 Hours
ALU - Addition and subtraction with Signed Magnitude Data - Hardware Implementation – Multiplication
– Hardware Implementation for Signed Magnitude Data – Division - Hardware Implementation for Signed
Magnitude Data – Divide Overflow - Floating Point operations – Parallelism and Computer Arithmetic:
Sub wordParallelism.

BCD Adder-BCD Subtraction

UNIT III
Control Unit and Memory Systems 11 Hours
Basic MIPS implementation – Building data path – Control Implementation scheme – Memory hierarchy –
Cache basics – Measuring and improving cache performance - Virtual memory- Input/output system-
programmed I/O-DMA and Interrupts-I/O processors

Stack organization-RISC Vs CISC Architecture

Unit IV
Parallelism 13 Hours
Instruction-level-parallelism – Parallel processing challenges – Flynn's classification – Multicore
processors- Pipelining – Arithmetic pipeline –Instruction pipeline -Pipelined data path and control –
Handling Data hazards & Control hazards – Exceptions.
Vector processing –single processor Vs parallel processor Total: 48 Hours

79
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Text Book(s):

1. DavidA.PattersonandJohnL.Hennessey,“Computerorganizationanddesign:Thehardware
/software interface‟, Morgan Kauffman / Elsevier, Fifth edition, 2014.
2. M.Morris Mano,” Computer System Architecture”, 3rdedition, Pearson/PHI,2092.

Reference(s):

1. V.CarlHamacher, Zvonko G. Varanesic and Safat G. Zaky, “Computer Organization “, 6 thedition,

McGraw-Hill Inc,2012.
2. William Stallings “Computer Organization and Architecture, Seventh Edition, Pearson Education,
2007.
3. Andrew S Tanenbaum “Structured Computer Organization “, 5thedition, Pearson/PHI,2007

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Open book Test1 (%)
(%)
Remember 40 -- --
Understand 40 50 --
Apply 20 50 80
Analyze -- -- 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. What is micro operation?
2. Show the Register Reference Instruction format.
3. Define PC and MAR.
4. What are the two types of data representation?
5. Define Associative Memory

Understand
1. Identify the basic functional units of the system
2. Explain about logic micro operations and its applications with examples
3. Differentiate RISC and CISC architecture in terms of their instruction set and addressing modes.
4. Compare hardwired control unit is differing from micro programmed control unit designs
5. Demonstrate control memory

Apply
1. Starting from an initial value of R=11011101, determine the sequence of binary values in R after a
logical shift-left, followed by a logical shift-right and a circular shift-right.
2. Analyze the contents of Register A that holds 8 bit binary 11011001 and Determine the B-
operand and the logic micro operation to be performed in order to change the value in A to: (i)
01101101 (ii) 11111101State the differences between register stack and memory stack.
3. Perform the arithmetic operations (+70) + (+80) and (-70) + (-80) with binary numbers in
signed-2's complement representation. Use eight bits to accommodate each number together
with its sign. Show that overflow occurs in both cases, that the last two carries are unequal, and
that there is a sign reversal.
4. Show the hardware to be used for the addition and subtraction of two decimal numbers with
negative numbers in signed- 10's complement representation. Indicate how an overflow is
detected. Derive the flowchart algorithm and try a few numbers to convince yourself that the
algorithm produces correct results.

80
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

5. The procedure for aligning mantissas during addition or subtraction of floating-point numbers
can be stated as follows: Subtract the smaller exponent from the larger and shift right the
mantissa having the smaller exponent a number of places equal to the difference between the
exponents. The exponent of the sum (or difference) is equal to the larger exponents. Without
using a magnitude comparator, assuming biased exponents, and taking into account that only the
AC can be shifted, derive an algorithm in flowchart form for aligning the mantissas and placing
the larger exponent in the AC

Open book questions

Apply
1. SmithandGoodmanfoundthatforagivensmallsize,adirect–mappedinstructioncacheconsistently
outperformed a fully associative instruction cache using LRU replacement.

a. Explain how this would be possible (Hint: You can’t explain this with the three C’s model because
it “ignores” replacement policy)
b. Explain where replacement policy fits into the three C’s model, and explain why this means that
misses caused by a replacement policy are “ignored”- or, more precisely, cannot in general be
definitively classified by the three C’smodel.
c. Are there any replacement polices for the fully associative cache that would outperform the
direct-mapped cache? Ignore the policy of “do what a direct- mapped cache would do”.
d. Use a cache simulator to see if Smith and Goodman’s results hold for memory reference traces
that you have access to. If they do not hold, why not?

2. John takes two numbers in sign magnitude representation (the two numbers are same with different
signs), The 1's complement of one number is 6. The difference between 1's complement of these two
numbers is 32. Find the numbers. And also find the product of these two numbers using the result of 2's
complement value of these two numbers.

Analyze

1.A two-word instruction is stored in memory at an address designated by the symbol W. The address
field of the instruction (stored at W + 1) is designated by the symbol Y. The operand used during the
executionoftheinstructionisstoredatanaddresssymbolizedbyZ.Anindexregistercontainsthevalue
X. State how Z is calculated from the other addresses if the addressing mode of the instruction is a.direct
a. indirect c. relative d.indexed.

2. An 8-bit computer has a 16-bit address bus. The first 15 lines of the address are used to select a bank of
32K bytes of memory. The high-order bit of the address is used to select a register which receives the
contents of the data bus. Explain how this configuration can be used to extend the memory capacity of the
system to eight banks of 32K bytes each, for a total of 256K bytes of memory.

81
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23MA404 - Probability and Statistics using Python

3024
Course Outcomes:
1. List the basic data structures of Python and various libraries of Python.
2. Illustrate basic probability axioms and apply Bayes’ theorem related to engineering problems.
3. Differentiate between various distributions of random variables on given data.
4. Examine given dataset based on descriptive statistics.
5. Compare the null or alternative hypotheses using the suitable test statistic.
6. Choose appropriate curve fitting and correlation methods for a given data

CO-PO Mapping
CO PO1 PO4 PO12
1 3 1 2
2 3 2 2
3 1 3 1
4 3 2 1
5 3 2 1
6 2 3 1
3- Strongly linked | 2-Moderately linked | 1-Weaklylinked

Unit I 12+8 Hours

Fundamental of Python Programming
Strings, Files, Lists, Dictionaries, Tuples. Introduction to NumPy: Creating Numpy Arrays, Numpy Data
Objects, dtype, Numerical Operations. Numpy Arrays: Concatenating, Flatten, reshape, adding
Dimensions, Vector Stacking,Pandas DataFrame, Accessing and Changing values of DataFrames, Pandas
Pivot, groupby Introduction to Pandas: Reading and Writing Data in Pandas, Multi-level Indexing,
Data Visualization in Pandas
Objects and Classes
Practical Components
1. Experiments on Basic experiments on fundamentals on python
2. Exploratory Data Analysis using NumPy
3. Exploratory Data Analysis using Pandas
4. Exploratory Data Analysis using Matplotlib

Unit II 12+6 Hours

Random Variables and Probability Distributions
Introduction to Probability: Events, Axioms of Probability and Probabilities of events; Conditional
Probability, Bayes Theorem. Discrete and Continuous random variables; Expectation and Variance,
Distribution of a Random Variables: Discrete and Continuous Distributions- Bernoulli, Binomial,
Poison and Normal Distributions (without proofs); Central Limit Theorem (without proof).
Gaussian distribution
Practical Components
1. Simulation of random experiments and plot the empirical probability of each event, alongside
the theoretical probability.
2. Python script to find conditional probability of a given event.
3. Simulation of various probability distributions

Unit III 12+10 Hours

Sampling Theory and Testing of Hypothesis
Sampling: Population and sample, parameter and statistic, standard error. Parameter estimations,
Confidence Intervals, Unknown Standard Deviation. Hypothesis Testing: Null and alternative
hypothesis, level of significance, Type I and Type II errors, one tail and two-tail tests. Hypothesis testing
concerning one mean and proportions, two means –Proportions and their differences using Z-test,
Student’s t-test, F-test, Chi-square test.
One-way ANOVA
Practical Components
1. Python Modules for Descriptive Statistics
82
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

2. Write a python program to perform z-test, t- test for testing the Null hypothesis for single mean
3. Write a python program to perform z-test, t- test for testing the Null hypothesis for difference of
means
4. Write a python program to explore problems in F-test.
5. Write a python program to perform chi square for determine whether there is a significant
association between the two variables
Unit IV 12+8 Hours
Curve Fitting, Correlation & Regression
Curve Fitting: Introduction-fitting a straight line-second degree curve-exponential curve by method of
least squares. Correlation: Simple correlation, Karl Pearson’s Correlation coefficient and Spearman’s
rank correlation. Simple regression, multiple regression.
Covariance
Practical Components
1. Develop a straight line curve to fit some real world observations
2. Develop a exponential curve to fit some real world observations
3. Explore problems in Correlation with sample data
4. Explore problems in Regression with sample data
Total: 48+32 Hours
Text Books:
1. Probability & Statistics by T.K.V.Iyengar&B.Krishna Gandhi & Others, S.Chand (2016) 6th
edition.
2. E. Walpole, R. H. Mayers, S. L. Mayers and K. Ye, (2012), Probability and Statistics for Engineers
and Scientists,9th Edition, Pearson Education, ISBN: 978-8-131-71552-9.
3. Wes McKinney, Python for Data Analysis: Data Wrangling with Pandas, NumPy, and IPython,
2nd Edition, O’Reilly Media, Inc.
Reference Books:
1. Michael Baron, Probability and Statistics For Computer Scientists, 2nd Edition, CRC Press
2. Sheldon M. Ross, (2011), Introduction to Probability and Statistics for Engineers and Scientists,
4th Edition, Academic Foundation, ISBN: 978-8-190-93568-5.
Internal Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test(%)
Remember 10 10 --
Understand 50 30 --
Apply 40 60 --
Analyze -- -- --
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 --

SAMPLE QUESTION (S)

Remember
1. Define variable in python.
2. List any two differences between built-in and user defined functions.
3. List any two python packages used mathematics.
Understand

1. Explain use of probability and statistics in real world.

2. Illustrate about random variables in python.
Apply

1. Find different real time applications which use Markov process

2. Implement a queuing theory to handle multiple processes.

83
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS405 Foundations of Data Science

3013
Course Outcomes
1. Understand the pipeline of machine learning to apply on real world problems
2. Understand the need of Similarity and Dissimilarity between features in data
3. Importance of Pre-processing techniques in real-time
4. Identifying the characteristics of various Regression models in real-world
5. Identifying the characteristics of various supervised learning and ensemble models
6. Identifying the characteristics of various algorithms of unsupervised learning

COs–POs Mapping
CO PO1 PO2 PSO1 PSO2
1 3 2 1 1
2 3 2 2 2
3 2 2 2 2
4 2 3 3 2
5 2 3 3 2
6 3 3 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT I 12 hours
Introduction: Relation among AI, ML and Data Science, Importance of Data Science, Categorization of Data
Science Algorithms, Usecases; Data Science Process; Data Exploration: Objectives of Data Exploration, Forms of
Data (Structured, Semi Structured, Unstructured), Datasets (data objects and types of attributes/fields),
Characteristics of Datasets and corresponding Statistical Measures; Data Visualization: Univariate Visualization,
Multivariate Visualization, Visualization of Complex Data and Relations(High-Dimensional Data)
Discriminant Analysis, LDA

UNIT II 12 hours
Data Similarity/Dissimilarity: Data Matrix, Dissimilarity Matrix, Proximity/Similarity Measures for various
types of data (nominal, ordinal, binary, numerical, etc.), Dissimilarity for Attributes of Mixed Types, Cosine
Similarity; Data Preprocessing: Preprocessing Pipeline, Forms of Preprocessing, Data Cleaning, Data Integration,
Data Reduction, Data Transformation and Discretization.
Distance based similarity (Euclidean distance, Jaccard Similarity)

UNIT III 12 hours

Regression (forecast a given numerical quantity): Linear Regression, Logistic Regression (Regression for
Classification), Regularization; Classification: Classification Principles, Classification Model Evaluation Metrics
(Confusion Matrix, ROC and AUC, Lift Covers), Classification using Decision Trees, Bayesian Classification,
Distance based Classifier(k-NN), Support Vector Machines (SVM), ANN-based Classification;
LASSO and Ridge Regression

UNIT IV 12 hours
Ensemble Learning: Conditions for Ensemble Modeling, Ensemble Techniques (Voting, Bagging, Boosting and
Random Forest); Clustering: Clustering Principles, Applications/Purpose of Clustering- Clustering for
description/preprocessing/classification, Types of Clustering, Clustering Evaluation Parameters, Clustering
Algorithms (k-Means, Agglomerative/Divisive, DBSCAN and Self Organizing Maps) and Evaluation Metrics; Data
Science Tools: Examples;
ADABoost, XGBoost Total: 48 hours

Textbooks:
1. Vijay Kotu&Bala Deshpande, “Data Science: Concepts and Practice”, 2nd Edition, Morgan Kaufmann
Publication, 2017.
2. Jlawei Han & Micheline Kamber, “Data Mining: Concepts and Techniques”, 3rd Edition, Morgan Kaufmann
Publishers, 2012
3. Pang-Ning Tan et al., “Introduction to Data Mining”, 2 nd Edition, Pearson Publications, 2019.

References:
1. Vijay Kotu&Bala Deshpande, “Data Science: Concepts and Practice”, 2nd Edition, Morgan Kaufmann
Publication, 2017.
2. Tom M. Mitchell, "Machine Learning ",Tata McGraw Hill, 1997
3. SunilaGollapudi, “Practical Machine Learning” First Edition 2016,Packt Publishing Ltd.
84
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Open book Test1 (%)
(%)
Remember 20 20 --
Understand 50 30 --
Apply 30 30 80
Analyze -- 20 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Define machine learning
2. List the various similarity measures
Understand
1. Explain the need of pre-processing in machine learning
2. Differentiate between supervised and unsupervised algorithms

Apply
1. Give Decision trees to represent the Boolean Functions:
a. A && - B
b. b. A V [ B && C]
c. c. A XOR B
d. d. [A&&B] V [C&&D]

Open Book Question(s)

1. Suppose we clustered a set of N data points using two different clustering algorithms: k-means and
Gaussian mixtures. In both cases we obtained 5 clusters and in both cases the centers of the clusters
are exactly the same. Can 3 points that are assigned to different clusters in the kmeans solution be
assigned to the same cluster in the Gaussian mixture solution? If no, explain. If so, sketch an example
or explain in 1-2 sentences
2. Assume we have a set of data from patients who have visited UPMC hospital during the year 2011. A
set of features (e.g., temperature, height) have been also extracted for each patient. Our goal is to
decide whether a new visiting patient has any of diabetes, heart disease, or Alzheimer (a patient can
have one or more of these diseases). Suggest a suitable machine learning approach for the above
situation
3. Consider a Bayesian network B with boolean variables

a) Is there any variable(s) conditionally independent of X33 given X11 and X12? If so, list all
b) Is there any variable(s) conditionally independent of X33 given X22? If so, list all
c) Write the joint probability P(X11, X12, X13, X21, X22, X31, X32, X33) factored according to the
Bayes net. How many parameters are necessary to define the conditional probability distributions
for this Bayesian network?
d) Write an expression for P(X13 = 0, X22 = 1, X33 = 0) in terms of the conditional
probability distributions given in your answer to part (c).

85
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23IT308 Database Management Systems Lab

0 0 3 1.5
Course Outcomes
At the end of the course, students will be able to
1. Demonstrate ER Modeling concepts to design the Database
2. Apply integrity constraints on a database
3. Make use of DDL, DML, DCL, TCL commands in creation and manipulation of Database
4. Utilize sub queries to make the complex queries more readable
5. Implementation of database queries using PL/SQL
6. Experiment with triggers to maintain the referential integrity of data
CO-PO Mapping
CO PO4
1 3
2 3
3 3
4 3
5 3
6 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
List of Experiments
1. Design ER Model for a given application & Convert ER model to Relational Model.
2. Creating users - roles and Granting privileges.
3. Creating and altering tables for various relations in SQL using Integrity Constraints.
4. Implementing queries in SQL using
1.1 Insertion
1.2 Retrieval (operations like union - intersect – minus)
1.3 Updating
1.4 Deletion
5. Implement the following Sql operations in, any, all, between, like, exists , group by, Order by and
having etc.
6. Implementing the concepts of Rollback – commit, checkpoints and Views
7. Implementing Different Types- Joins (Left, Right, Inner & Outer Joins)
8. Implementing Different Types - sub queries and nested queries.
9. Experiment with built in functions in oracle (Numeric, Aggregate functions etc.)
10. Implementing TO_CHAR(),TO_DATE(),TO_NUMBER() & String Handling Functions.
11. Implementing operations on relations using PL/SQL.
12. Implementing functions, stored procedures using PL/SQL
13. Implementing cursors using PL/SQL
14. Implement Exception Handling using PL/SQL
15. Creating triggers using PL/SQL
16. Creating Packages using PL/SQL

List of Augmented Experiments

1. Inventory control management System
2. College Management System
3. Hospital management System
4. Library management System
5. Payroll management System
6. Health care organization Management System
7. Restaurant Management System
8. Blood Donation Management System
9. Art Gallery Management System
10. Hotel Management System
11. School Management System
12. Salary Management System
13. Wholesale Management System
14. Time Table Management System
15. Website Management
Reading Material (s)
1. Database Management Systems Lab Manual, Department of CSE, GMRIT,Rajam

86
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS407 Foundations of Data Science Lab 0 0 3 1.5

Course Outcomes
1. Demonstrate data formats and linear algebra matrices operation
2. Analyzing similarities/dissimilarities and visualizing data importance through plots
3. Demonstrate regression techniques on various datasets
4. Demonstrate Classification techniques on various datasets
5. Demonstrate Clustering techniques on various datasets
6. Build and evaluate the performance of various machine learning models
CO–PO Mapping

CO PO4 PO5 PO8

1 3 2 2
2 3 3 2
3 3 1 3
4 2 2 2
5 2 2 3
6 1 2 3

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Experiments:
1. Linear Algebra Operations
2. Data Formats, Processing& Transformation
3. Obtaining Statistical Properties of data
4. Basic Experiments on Data Visualization, Interpretation, and Identification of outliers
5. Single Valued Decomposition and PCA
6. Optimization Techniques
7. Regression and variants (Prediction)
8. Regression with regularization (Prediction/classification)
9. Decision Tree Induction, Rule Generation and Classification
10. Implementation of K-Nearest Neighbor Classifier
11. Implementation of Bayesian Classifier
12. Implementation of Ensemble models
13. Implementation of K-Means Clustering
14. Implementation of Hierarchical clustering
15. Implementation of DBSCAN Clustering
16. Build, Train, Test and Deployment on cloud environment (e.g.AWS/Google Cloud)

Augmented Experiments:
Classification:
1. Design and Deploy a machine learning model for health care System
Sample Datasets:
a. https://www.kaggle.com/datasets/rashikrahmanpritom/heart-attack-analysis-predictiondataset
b. https://www.kaggle.com/datasets/kmader/skin-cancer-mnist-ham10000
2. Design and Develop a machine learning model for Business Analytics
Sample Datasets:
a. https://www.kaggle.com/datasets/arashnic/hr-analytics-job-change-of-data-scientists
3. Design and Develop a machine learning model for Education institutions
Sample Datasets:
a. https://www.kaggle.com/datasets/spscientist/students-performance-in-exams
4. Design and Develop a machine learning model for TV Shows
Sample Datasets:
a. https://www.kaggle.com/datasets/shivamb/netflix-shows
5. Design and Develop a machine learning model for E-Commerce applications
87
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Sample Datasets:
a. https://www.kaggle.com/datasets/shivamb/netflix-shows
6. Design and Develop a machine learning model Supermarket store applications
Sample Datasets:
a. https://www.kaggle.com/datasets/surajjha101/stores-area-and-sales-data
Classification/Clustering:
7. Design and Develop a machine learning model for Drugs Review
Sample Datasets:
a. https://archive.ics.uci.edu/ml/datasets/Drug+Review+Dataset+%28Druglib.com%29
8. Design and Develop a machine learning model for Plants
Sample Datasets:
a. https://archive.ics.uci.edu/ml/datasets/Plants
9. Design and Develop a machine learning model for TV News Channel Commercial Detection
Sample Datasets:
a. https://archive.ics.uci.edu/ml/datasets/TV+News+Channel+Commercial+Detection+Dataset
10. Design and Develop a machine learning model for SMS Spam Collection
Sample Datasets:
a. https://archive.ics.uci.edu/ml/datasets/SMS+Spam+Collection

88
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ESX01 Employability Skills I

0022
Course Outcomes
1. Demonstrate oral communication and writing skills as an individual to present ideas coherently
2. Introspect & develop life skills with constructive approach
3. Assess and improve analytical skills
4. Apply the Inter Process Communication in Linux environment
5. Develop a simple communication application to communicate using TCP/UDP client server model
6. Develop solutions to real-world problems

COs – POs Mapping

COs PO1 PO2 PO5 PO8 PO10 PO12
CO1 - - - - 3 -
CO2 - - - - 2 2
CO3 2 - - 2 - -
CO4 3 - 2 2 - -
CO5 3 2 2 - - 2
CO6 2 2 2 - - -
3–Strongly linked | 2–Moderately linked| 1–Weakly linked

Unit-I
Communication Skills 16 hours
Building Confidence: Fear? Steps to Overcoming the Fear of Public Speaking? Self Esteem: Definition? Types of
Self Esteem, Causes of Low Self Esteem, Merits of Positive Self Esteem and Steps to build a positive Self Esteem.
Group Discussions (Practice): GD? GD Vs Debate, Overview of a GD , Skills assessed in a GD, Dos & Don’ts, &
Conducting practice sessions (SimpleTopics).
Motivational Talk: Team Work: Team Vs Group? Stages in Team Building, Mistakes to avoid and Lessons to
Learn (Through Stories or Can be a Case Specific)
Quantitative Aptitude 16 hours
Percentages, Profit and loss, Mixtures and Allegations, Simple Interest, Compound Interest

Unit-II
Linux Programming 32 hours
S.No Topic No.of
Hours
1 Understanding System Files
File Structures, System Calls for File Management – create, open, close, read, write, 4
lseek, link, symlink, unlink, stat, fstat, lstat, chmod, chown,
2 Directory API
2
opendir, readdir, closedir, mkdir, rmdir, umask.
3 Industry Essentials
Network Configurations and Inter Process Communications, Signals, Pipes and 4
Sockets
4 Services of Linux
Running Services on Linux, KVM Virtualization, Logical Volume Machine, Tiger VNC, 5
FTP Server, Yum Server

TEXT BOOKS:
1. W. Richard. Stevens (2013), Advanced Programming in the UNIX Environment, 3rd edition, Pearson
Education, New Delhi, India.
2. Behrouz A. Forouzan, Richard F. Gilberg. Thomson (2003), Unix and shell Programming, Cengage Learning
India

REFERENCES:
1. W. Richard Stevens, Andrew M. Rudoff, Bill Fenner (1998), UNIX Network Programming, PHI.
2. Graham Glass, King Ables (2006), UNIX for Programmers and Users, 3rd Edition, , Pearson Education

89
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
5th Semester
23IT405 Web Technologies
3024

Course Outcomes
At the end of the course, students will be able to
1. Illustrate client-side scripting tools to create and modify web pages.
2. Infer the knowledge of web programming to develop and maintain web pages.
3. Develop portable and dynamic web pages.
4. Demonstrate server-side scripting languages to develop business logic.
5. Make use of database connectivity to communicate database server from web server.
6. Test for client-server web application development in real time internet domains.

CO–PO Mapping
COCOsPOPO3 POPO5 PSPSO1
1 3 2 3
2 3 2 3
3 2 3 3
4 2 3 2
5 3 3 3
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Syllabus
Unit- I 12+8 Hours
HTML Tags
Introduction, Links, Lists, Tables, Forms, Canvas, Semantics, Plug-ins.CSS: Introduction, CSS Properties,
Selectors, Combinators, Controlling Fonts, Forms, Pseudo classes, Transitions, Animations (data-aos), 2D and
3D Transforms, Navigation Bar, Layouts,
Java Script: Introduction, Functions, Events, Validations, Objects, Document Object Model (DOM), Division
Replacement, Browser Object Model (BOM)

CSS Tooltips, Font Combinations.

Practical Components
1. Design the following static web pages required for Online Examination System web site.
a) Home Page
b) Login Page: a. Student Login Page b. Admin Login Page
c) Registration page
d) Test Page
e) Results Page.
2. For Specific pages of Online Examination System like Test page and Result page Apply different font
styles, font families, font colors, animations and other formatting styles to the above static web
pages.
3. Validate login page and registration page using Java Script.
4. Create an HTML page with any required JavaScript that takes a number from text field in the range
of 0 to 999 and shows it in words. It should not accept four and above digits, alphabets and special
characters.

Unit- II 12+8 Hours

Bootstrap
Responsive Design, Layouts, Grids, Media Queries, Components- Forms, Drop Downs, Cards, Input Groups,
Collapse, List Groups, Navbar, Popovers, Flex Box. Utilities- Borders, Positions, Scroll spy, Visibility, CSS
Components, SVG, Java Script Components. JSON: Introduction, Parsing, Objects, JSON arrays, Dynamic HTML
Data. jQuery: Selectors, Filters, Form Plug-ins, Auto Validations
Bootstrap icons, Jumbotron.
90
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Practical Components
1. Design an interactive area using HTML and CSS. Use JavaScript to implement the color change effect
during mouseover and reversion during mouse out.
2. Inner Function with Constant Addition: Design a function “createAdderWithConstant” that takes a
constant as a parameter and returns an inner function. The inner function, when given a number,
adds the constant to it and returns the result. Use the inner function to add the same constant to
different numbers.
3. Make the static pages Responsive and attractive using Bootstrap components (***Mobile View)
4. Validate login page and registration page using JQuery.

Unit- III 12+8 Hours

PHP
Introduction, Modal View Architecture (MVC), Creating PHP script, Running PHP script, Introduction to PHP,
Arrays, Functions, sending parameters in URL, working with Forms, working with Database: Running SQL
Queries, connecting with Databases, Uploading Files, PHP Sessions, Redirecting, Routing, Connecting PHP
with JavaScript and jQuery, Authentication.

PHP Cookies, PHP Exception Handling, Introduction to PHP Laravel

Practical Components
1. Write a PHP to connect to the database, Insert the details of the student who registered through
Online Examination System student login page including photograph.
2. Develop and demonstrate PHP Script for the following problems:
a. Write a PHP Script to find out the Sum of the Individual Digits.
b. Write a PHP Script to check whether the given number is Palindrome or not
3. Write a PHP program to insert the questions and respective answers into the database through
admin page, sending mails to registered students through admin.
4. Write a PHP program, assuming four users user1, user2, user3 and user4 having the passwords
pwd1, pwd2, pwd3 and pwd4 respectively. Create a Cookie and add these four user ID‟s and
passwords to this Cookie. Read the user id and passwords entered in the Login form (week1) and
authenticate with the values (user id and passwords) available in the cookies.
a. If he is a valid user (i.e., user-name and password match) you should welcome him by name
(user-name) else you should display “You are not an authenticated user”

Unit- IV 12+8 Hours

Flask
Introduction to Flask, Virtual Environment, features of flask, url building, routing, Templates and Jinja Code,
Rendering Templates, Static files, Building Forms, Sending Form data to Templates, Template Inheritance
(header, footer, etc), Session Tracking, connecting database (SQLite), Retrieving database values to
templates, File uploading, Sending Mails, Deployment of website.
wsgi file, csrf token, http methods.

Practical Components
1. Write a Flask code to connect to the database, and authenticate Login pages with jQuery and start a
Session for Student, Change password for Student
2. After user login, display Questions from the database into test page in shuffled manner using flask
and store in database.
3. Write a Flask code to do the following
a) Evaluate the answers of the test which is given by the student in the Test page.
b) Calculate the total score of the student and store it into the database and display score in
dashboard of student.

91
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
4. Using flask retrieve results in a responsive table format of all students with filtering. Deploy the
application developed in real time environment
Total: 48+32 Hours

Textbook(s):
1. Programming the World Wide Web, 8th edition Robert W. Sebesta, pearson.
2. Bootstrap: Responsive Web Development, 1st Edition, jake spurlock foreword by dave winer,
O’Reilly publications.

Reference Book(s):
1. Web programming with HTML, XHTML and CSS, 2e, Jon Duckett, Wiley India
2. Web programming Bai, Michael Ekedahl, CENAGE Learning, India edition.
3. An Introduction to Web Design + Programming, Paul S.Wang, India Edition
4. Flask Web Development 2e Miquel Grinberg O’Reilly publications.

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Lab Examination (%)
(%)
Remember 20 20 --
Understand 50 40 --
Apply 30 40 40
Analyze -- -- 20
Evaluate -- -- 40
Create -- -- --
Total (%) 100 100 100

Sample Question (S)

Understand
1. What is the use of cascading style sheet? Explain different style sheets used in HTML.
2. Explain string object with suitable example.
3. Illustrate how work java script events.
4. Describe procedure for how to connect PHP to MYSQL.
5. Explain AJAX technologies

Apply
1. Write an HTML program to display your class timetable.
2. Write a java script to find reverse of a given number using functions.
3. Design a responsive registration page using bootstrap.
4. Insert an image into a web page. Write a script which displays a message when the mouse is over the
image. The co-ordinates of the mouse should be displayed if click is attempted on the image.
5. A person X has created the table (emp) and inserted the data in the table. After the completion of
insertion, he found that one of the inserted record is invalid. So, write a PHP program to update the table
by deleting the invalid record. [ Assume database table name is emp (empno, ename, dept, age)]

Analyse
1. Compare traditional web application development with AJAX and analyze what way AJAX useful for real
time internet application.

92
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS502 Deep Learning for Data Science

3003
Course Outcomes
1. Illustrate the knowledge of the basic Concepts of Neural Networks.
2. Classify the various types of Learning rules.
3. Understand the concept of Single and Multi-Layer Perception.
4. Make use of different CNN models.
5. Compare different character encoding techniques.
6. Understand different Deep unsupervised models.
COs–POs Mapping
COs PO1 PO2 PO4 PO5 PO12
1 3 2 2 1 1
2 3 2 2 1 1
3 3 3 3 1 1
4 3 3 3 1 2
5 3 3 3 3 2
6 3 3 3 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Unit I 12 Hours
Introduction: Introduction to Deep Learning, Historical Trends in Deep Learning, The Neural
Network, limitations of traditional computer programs, The Mechanics of Machine Learning, The
Neuron, Expressing Linear Perceptron as Neurons, Feed-Forward Neural Networks, Linear Neurons
and Their Limitations, Types of Activation Function: Sigmoid, Tanh, ReLU, and Softmax, learning rules
Bias, Mean, Variance, Co-Variance

Unit II 12 Hours
Single Layer Perceptron: Adaptive Filtering Problem, Unconstrained Organization Techniques-
Method of Steepest Descent, Newton’s Method, Gauss Newton Method, Perceptron-Convergence
Theorem, Relation between Perceptron, Bayes Classifier for a Gaussian Environment
Multilayer Perceptron: Back Propagation Algorithm-Two Passes of Computation, Activation Function,
Rate of Learning, Sequential and Batch Model of Training, Stopping Criteria, optimization settings.
Linear Least Square Filters, Least Mean Square Algorithm, XOR Problem

Unit III 12 Hours

Convolution networks: Building blocks of CNNs, Architectures, Filters and Feature Maps, pooling
layers, Convolutions over volumes, Softmax regression, Deep Learning frameworks, Training and
testing on different distributions, Bias and Variance with mismatched data distributions, Transfer
learning, Multi-task learning, end-to-end deep learning.
CNN models: AlexNet, VGG –16, Residual Networks, YOLO
Keras ,tensorflow, data augmentation, Batch Normalization, Dropout

Unit IV 12 Hours
Recurrent Networks
One-hot encoding of words and charcters, using word embedings, Recurrent Neural Network Model,
Vanishing gradients with RNNs, Gated Recurrent Unit (GRU) LSTM (long short term memory), Encoder
Decoder sequence to sequence architectures.
Deep Unsupervised Learning: Autoencoders, variational Autoencoders, Generative adversarial
network.
n-grams ,bag-of-words, Bi directional RNN, Exploding gradient

Total: 48 Hours
93
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)
1. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow by Aurélien Géron, October
2022: Third Edition.
2. Simon Haykin, "Neural Networks - A comprehensive foundation", Pearson Education, 2003.
3. S. N. Sivanandam, S. N. Deepa, “Principles of Soft Computing”, Willy, 3rd edition, 2019.
4. Nikhil Buduma, “Fundamentals of Deep Learning”, ORELLIY, 1st Edition, 2017.
5. Laurene Fausett, "Fundamentals of Neural Networks" , Pearson Education, 2004.
6. Bengio, Yoshua, Ian J. Goodfellow, and Aaron Courville. "Deep Learning." An MIT Press book in
preparation,2015
Reference (s)
1. Satish Kumar,”Neural Networks: A Classroom Approach” Tata McGraw Hill Education, 2004.
2. Simon Haykin, " Neural networks and Learning Machines", Prentice Hall, 2008
3. Josh Patterson and Adam Gibson ”Deep Learning A Practitioner’s Approach” O’Reilly Media, Inc. 2017
SAMPLE QUESTION (S)
Internal Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Lab Examination %
Remember 20 20 ---
Understand 40 40 ---
Apply 40 40 40
Analyze --- --- 40
Evaluate --- --- 20
Create --- --- ---
Total (%) 100 100 100

Remember
1. Define Neural Networks.
2. Write Short notes on Hebbian Learning.
3. What is mean by Perceptron
4. What are the applications of Deep Learning?

Understand
1. What is are the benefits of Neural Networks?
2. How can deep learning models be optimized?
3. How do you evaluate deep learning models?
4. What are some common architectures used in deep learning?
Apply
1. Discuss some popular deep learning frameworks and libraries?
2. Discuss various activation function in CNN models

Analyze
1. Illustrate the working model of VGG-16 with diagram

96
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS503 Data Analytics and Visualization Techniques

3024
Course Outcomes
1. Explain the Data Analysis Fundamentals
2. Illustrate various data Visual aids
3. Categorize different data transformation and descriptive statistics
4. Identify different Correlation and Inferences from statistical tests
5. Make use of the concept Hypothesis Testing
6. Classify different Multivariate Analysis techniques
COs–POs Mapping
COs PO1 PO4 PSO1
1 3 2 3
2 3 3 3
3 3 2 3
4 2 3 3
5 3 3 3
6 3 2 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12+8 Hours

Data Analysis Fundamentals
Understanding data science, significance of EDA, steps in EDA. types of analysis (univariate, bivariate,
multivariate). Making sense of data: Numerical data-Discrete &continuous data, categorical data,
Measurment scales-Nominal, Ordinal, Interval, Ratio. Comparing EDA with classical and Bayesian analysis,
getting started with EDA: Numpy, Pandas,Scipy, and Matplotlib.
Grouping of data: Groupby mechanics, rearranging, reshaping data structures, data aggregation methods,
and cross-tabulation methods.
Objectives of Exploratory data Analysis, The applications of EDA
Practical Components
Experiment 1: Explore Scipy Library
Experiment 2: Explore Stat Library
Experiment 3: Experiment with all group by functionalities & cross tabulation methods
Experiment 4: Analyzing and Visualizing Real-World Data.

Unit II 12+8 Hours

Data transformation and descriptive statistics
Transformation techniques- performing data deduplication, replacing values, handling missing data,
renaming axis indexes, outlier detection and filtering. Permutation and random sampling, computing
indicators/dummy variables, string manipulations.
Correlation and Inferences: Introducing correlation, covariance, Pearson’s Correlation, Spearman’s Rank
Correlation.
Descriptive statistics: Understanding statistics, measure of central tendenacy, measure of dispersion
(standard deviation, variance, skewness, kurtosis, percentiles, quartiles)
Violin Plots, Inter Quartile Range, Discretization & binning, heatmaps
Practical Components
Experiment 5: Experiment with various data pre-processing & Transformation techniques
Experiment 6:Experiment and Analyse the correlations among attributes.
Experiment 7: Experiment with the statistical measures
Experiment 8: Outlier Detection and Handling.
Unit III 12+8 Hours
97
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Visualizing Distributions
Visualizing Amounts-Bar Plots, Grouped and Stacked Bars, Dot Plots and Heatmaps, Visualizing
Distributions: Histograms and Density Plots- Visualizing a Single Distribution, Visualizing Multiple
Distributions at the Same Time, Visualizing Distributions: Empirical Cumulative Distribution Functions and
Q-Q Plots-Empirical Cumulative Distribution Functions, Highly Skewed Distributions, Quantile Plots,
Visualizing Many Distributions at Once-Visualizing Distributions Along the Vertical Axis, Visualizing
Distributions Along the Horizontal Axis
Kernel Density Estimation (KDE), Geospatial Distributions, Interactive Visualization

Practical Components
Download the House Pricing dataset from Kaggle
Experiment 9: Use different Color scales on the Rainfall Prediction dataset
Experiment 10: Create different Bar plots for variables in any dataset
Experiment 11: Visualization of different Distributions in various ways
Experiment 12: Visualizing Empirical Cumulative Distribution Functions (ECDF) for Real-world Data.

Unit IV 12+8 Hours

Visualizing Associations & Time Series
Stacked Densities, Visualizing Proportions Separately as Parts of the Total ,Visualizing Nested Proportions-
Nested Proportions Gone Wrong, Mosaic Plots and Treemaps, Nested Pies ,Parallel Sets. Visualizing
Associations Among Two or More Quantitative Variables-Scatterplots, Correlograms, Dimension Reduction,
Paired Data. Fundamentals on Time Series Data, Visualizing Time Series and Other Functions of an
Independent Variable-Individual Time Series , Multiple Time Series and Dose–Response Curves, Time Series
of Two or More Response Variables
Multidimensional Scaling, MANOVA vs ANOVA
Practical Components
Experiment 13: Visualization through Pie charts, Stacked Bars & Stacked Densities
Experiment 14: Show an example of Skewed data and Experiment with different skewness removal
techniques
Experiment 15: For a sales dataset do a Time Series Visualization
Experiment 16: Geospatial Visualization for Regional Sales Analysis
Total: 45+32 Hours
Textbook (s)
1. Daniel J. Denis: Univariate, Bivariate, and Multivariate Statistics Using R: Quantitative Tools for Data
Analysis and Data Science, Wiley,2020
2. Mukhiya Suresh Kumar Mukhiya, Ahmed Usman Ahmed: Hands-On Exploratory Data Analysis with
Python: Perform EDA techniques to understand, summarize, and investigate your data, Packt, 2020
3. Claus Wilke, “Fundamentals of Data Visualization: A Primer on Making Informative and Compelling
Figures”, 1st edition, O’Reilly Media Inc, 2019.
4. Downey, Allen. Think stats: exploratory data analysis. " O'Reilly Media, Inc.", 2014.
5. Neil H. Spencer: Essentials of Multivariate Data Analysis, CRC Press,2014
Reference (s)
1. Wes McKinney : Python for Data Analysis 2nd Edition,Wiley,2013
2. Glenn J. Myatt, Wayne P. Johnson: Making Sense of Data I: A Practical Guide to Exploratory Data
Analysis and Data Mining, 2nd Edition,Wiley,2014
3. 1 Tony Fischetti, Brett Lantz, R: Data Analysis and Visualization,O’Reilly ,2016 2 OssamaEmbarak,
Data Analysis and Visualization Using Python: Analyze Data to Create Visualizations for BI
Systems,Apress, 2018
4. Wendy L. MartinezAngel R. MartinezJeffrey L. Solka: Exploratory Data Analysis with MATLAB, 2nd
Edition,CRC Press,2011
5. Radhika Datar, Harish Garg : Hands-On Exploratory Data Analysis with R , Packt,2020
6. Joseph F Hair, Barry J. Babin, Rolph E. Anderson, William C. Black: Multivariate Data Analysis
Cengage, 2018

98
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

SAMPLE QUESTION (S)

Internal Assessment Pattern
Int. Test 1 Open Book Exam (%)
Cognitive Level Int. Test 2 (%)
(%)
Remember 50 40 --
Understand 30 40 --
Apply 20 20 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

Remember
1. What is data science.
2. Define purpose of different data visualization aids
3. List any two steps involved in EDA.

Understand
1. Explain different data representation
2. Explain the role of various data grouping methods
3. Explain purpose of hypothesis testing in detail
Apply
1. Apply various visual aids to identify behavior of data
2. Make use of Multivariate Analysis methods for data nanlysis
3. Examine data with various distribution function
Analyze
1. Compare and contrast various data grouping methods.
2. Distinguish various methods to address problems with dummy variables
3. Examine various string handling methods
Evaluate
1. Evaluate the statistics of a given dataset
2. Justify the importance of data skewness
3. Measure data dispersion methods on a dataset
Open Book Exam Questions
Question 1:
Perform below analysis on a house price prediction dataset.
a) Univariate Analysis
i. Analysis of a numerical feature
ii. Analysis of a categorical feature
b) Bivariate Analysis
i. Relationship of a numerical feature with another numerical feature
ii. Relationship of a numerical feature with a categorical feature
Question 2:
Perform below analysis on weather prediction dataset.
1. Correlation Analysis
i. Correlation Heat Map
ii. Zoomed Heat Map
2. Investigation of missing values
1. What's missing? to what extent?
2. Visualizing missing values in a DataFrame
99
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23ML504 Computer Networks
3003

Course Outcomes
1. Understand the basic network infrastructure to learn the overall functions of networking systems
2. Classify various wired and wireless transmission media for data communication networks
3. Apply knowledge of different techniques of error detection and correction to detect and solve error
bit during data transmission.
4. Compare various routing algorithm and select an appropriate one for a routing design.
5. Design a proper routing for IP networks.
6. Understand the internal functionalities of main protocols such as HTTP, FTP, SMTP, TCP, UDP, IP.

CO-PO Mapping:
COs PO1 PO2 PO3
1 3 2 1
2 3 3 1
3 1 3 2
4 2 3 1
5 1 3 3
6 3 1 1
3- Strongly linked, 2- Moderately linked, 1- Weakly linked
SYLLABUS:
UNIT I 12 Hours
Network Hardware-Network Software-and Transmission Media
OSI-TCP/IP reference models, ARPANET, Network Topologies,
Physical Layer: Transmission media: Guided Media-Twisted Pair-Coaxial Cable-Fiber optics-Unguided
Media: Electromagnetic Spectrum, Radio Transmission and Microwave Transmission. Switching
Techniques: Circuit Switching-Packet Switching-Message Switching.
Taxonomy of networking devices.

Unit II Data link layer

12 Hours
Design Issues: Framing-error detection and correction-CRC-Elementary Data link Protocols: Stop and wait-
Sliding Window protocols: Go-back-n-Selective Repeat ARQ
Medium Access sub layer and Multiple Access protocols: ALOHA-CSMA-IEEE Standard 802.3 and Ethernet-
IEEE Standard 802.4: Token bus.

Data Link Control Protocols: HDLC-SLIP-PPP

Unit III Network Layer

12 Hours
Network Layer design issues-Virtual circuit and Datagram Subnets-Routing algorithms: shortest path
routing-Flooding-Hierarchical Routing-Distance vector routing-Broad cast and Multi cast routing, Congestion
Control: Congestion prevention policies.

Internet control protocols

Unit IV Transport Layer

12 Hours
Transport Services-Connection management - Elements of Transport Protocols-Internet Transport
Protocols: UDP and TCP. IPv4 & IPv6, Application Layer-Domain name system - Electronic Mail-WWW
ATM Transport protocol-Proxy Servers-Multimedia: Data compression-digital representation of analog signals

48 Hours

100
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Textbook (s)
1. Andrew S Tanenbaum, Computer Networks, 4th Edition, Pearson Education /PHI, 2002.
2. Behrouz A. Forouzan, Data Communications and Networking, 3rdEdition, Tata McGraw Hill
Higher Education, 2003

Reference (s)

1. Willam Stallings, Data and Computer Communications,8th Edition, Pearson Prentice Hall, 2007.
2. W.A. Shay, Thomson, Understanding communications and Networks, 3rd Edition, Cengage
Learning, 2005
SAMPLE QUESTION (S)
Internal Assessment Pattern
Int. Test 1 Open Book Exam (%)
Cognitive Level Int. Test 2 (%)
(%)
Remember 25 20 --
Understand 40 40 20
Apply 30 40 40
Analyze -- -- 40
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100
Sample Questions
Remember
1. List the applications of Computer Networks
2. Write two differences between OSI and TCP/IP models.
3. State 5 key assumptions in Dynamic channel allocation?
4. State the purpose of DNS.
5. Define congestion.
Understand
1. Illustrate OSI Reference model.
2. Explain various design issues of data link layer
3. What are the responsibilities of Data Link layer and explain Pure Aloha and Slotted Aloha
protocols.
4. Describe Distance Vector routing algorithm with example and explain count to infinity problem 5.
Represent the Manchester encoding for the bit stream: 0001110101.
Apply
1. What is the check summed frame transmitted if the message is 1101011011 and the generator
polynomial is x 4 + x + 1 using CRC
2. Can you think of any circumstances under which an open-loop protocol, (e.g., a Hamming code)
might be preferable to the feedback-type protocols?
3. Assuming that all routers and hosts are working properly and that all software in both is free of
all errors, is there any chance, however small, that a packet will be delivered to the wrong
destination?
4. The following data fragment occurs in the middle of a data stream for which the byte-stuffing
algorithm described in the text is used: A B ESC C ESC FLAG FLAG D. What is the output after
stuffing?
5. The following character encoding is used in a data link protocol: A: 01000111; B: 11100011;
FLAG: 01111110; ESC: 11100000 Show the bit sequence transmitted (in binary) for the four-
character frame: A B ESC FLAG when each of the following framing methods are used:
1. Character count.
2. Flag bytes with byte stuffing.
3. Starting and ending flag bytes, with bit stuffing.

101
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23MLC11 Computer Vision & Pattern Recognition
3003
Course Outcomes
1. Explain fundamental computer vision concepts, including applications and challenges.
2. Understand image processing techniques and their application in computer vision.
3. Apply feature detection and matching techniques to analyze image data.
4. Understand pattern recognition and machine learning concepts and their application in image analysis.
5. Describe and implement segmentation techniques to partition images into meaningful regions.
6. Understand and apply object detection and recognition techniques for identifying and analyzing objects in
images or sequences.
CO–PO Mapping
CO PO1 PO2 PO3
1 3 2 2
2 2 2 3
3 3 2 2
4 3 2 2
5 2 2 3
6 2 2 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Introduction to Computer Vision and Image Processing
Computer Vision: Introduction to computer vision - applications of computer vision - Image formation, Geometric
primitives, 2D transformations, and photometric image formation - Sampling and aliasing in images: Image
processing Techniques: Point operators: Thresholding, Image Enhancement - Linear filters - Non-Linear filters -
Multi-resolution representations : Gaussian pyramid, Laplacian Pyramid - wavelets: 1D Haar wavelet transform ,
2D Haar wavelet transform.
Neighborhood operators (morphological operations) and content-based image retrieval.

Unit II 12 Hours
Feature Detection and Matching
Feature detection : Image features - Edge Detection - Overview of edge detection methods, Prewitt, Sobel, and
Canny Edge detectors - Line detection: Hough Transform for line detection - Feature descriptors: Histogram of
Oriented Gradients (HOG), Local Binary Pattern (LBP), SIFT and SURF- Feature Matching techniques -
Performance Analysis.
Harris corner detection, and Piecewise Linear Approximation

Unit III 12 Hours

Pattern Recognition and Machine Learning
Introduction to pattern recognition: Pattern, Features, RST invariant features - Pattern recognition systems -
Different approaches to pattern recognition - Statistical Pattern Recognition: Bayesian decision theory and
discriminant functions. Supervised learning: Parametric methods (linear regression), Nonparametric methods (k-
nearest neighbors, decision trees) - Unsupervised learning: Clustering algorithms (k-means, mean shift clustering).
Neural pattern recognition: Structure and types of neural networks, Learning algorithms for neural networks.
Dimensionality reduction methods- PCA (Principal Component Analysis) and LDA (Linear Discriminant Analysis)

Unit IV 12 Hours
Image Analysis and Object Recognition
Segmentation techniques: Region-based segmentation: Split and merge, region growing, Contour-based
segmentation: Active contours, Clustering-based segmentation: K-means, mean shift. Object detection: Techniques
for object detection - Face recognition: Methods and challenges in face recognition - Instance recognition
Techniques – Image Classification – Semantic segmentation - Motion estimation: Optical flow, activity
recognition, motion estimation.
Medical image segmentation and Deep learning object detection
Total: 48 Hours

102
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Textbook (s)
1. Richard Szeliski, Computer Vision: Algorithms and Applications , Springer, 2022, ISBN: 978-
1848829343
2. Rober.J. Shelkoff, John Wiley & Sons , Pattern Recognition- Statistical, Structural and Neural
Approaches, Wiley, 2007, ISBN: 978-8126513703.
Reference (s)
1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, Wiley India, 2006, ISBN: 978-8126511167.
2. Simon J. D. Prince, Computer Vision: Models, Learning, and Inference, Cambridge University Press,
2012, 78-1107011793
3. Milan Sonka, Vaclav Hlavac, Roger Boyle, Image Processing, Analysis, and Machine Vision,
Brooks/Cole, 2007, ISBN: 978-0495082521.

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam
Remember 30 30 -
Understand 50 50 -
Apply 20 20 50
Analyze -- -- 50
Evaluate -- -- -
Create -- -- -
Total (%) 100 100 100

Remember
1. What is computer vision and what is its role in image processing?
2. Define Hough transform.
3. List the roles of linear filtering in image processing.
4. What is Instance recognition?
Understand
1. How does sampling affect the quality of an image?
2. Explain the working principles of K-nearest neighbors (KNN) and decision trees in pattern
recognition.
3. Explain the concept of wavelets and their use in multi-resolution representations.
4. Describe the process of feature detection in computer vision.
5. Describe the process of optical flow estimation and its applications in motion estimation.

Apply
1. Discuss the application of mean shift and mode finding in image segmentation.
2. Explain the concept of multi-resolution representations in image analysis. How are wavelets used in this
context?

Analyze
1. Analyze the impact of aliasing in images and discuss methods to mitigate its effects.
2. Compare and contrast parametric and nonparametric methods in supervised learning for pattern
recognition.
3. Analyze the challenges and potential solutions for object detection in crowded or occluded scenes.

103
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23CSC21 Web Programming Languages
3003
Course Outcomes
1. Understand web applications.
2. Analyze the templates and common scenarios of web development.
3. Examine various web programming languages and their usages.
4. Analyze the flow of data through various layers of web.
5. Identify the use of data management and compatibility of web browsers.
6. Identify the need of security and performance for a web application.
COs–POs Mapping
COs PO1 PO2 PO7 PO12

1 3 3 2 2
2 3 3 2 2
3 3 3 2 2
4 3 3 2 2
5 3 3 1 2
6 3 1 1 1

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Overview of the web
Web application Overview: Basic concepts of web, Hyper Text Mark-up Language (HTML) and Cascading
style sheets (CSS), Web programming languages
Web server: Introduction, Anatomy of HTTP transaction, Request and response structures, REST APIs. Data
management: Browser storage - Local storage & Session storage, Database storage
HTML, CSS, HTTP, Status codes

Unit II
12 Hours
Web programming in JavaScript
Introduction: Basic concepts – Arrays, objects, functions, classes and interfaces, ES6 JavaScript standard.
Node JS: Introduction, Node packages, HTTP web server – Creating a HTTP server that supports Create,
Read, Update and Delete operations via various HTTP methods, Adding common request parser
Express: Creating a web server with express and body parser packages
NodeJS, ES6, Node packages.

Unit III 12 Hours

Introduction: Basic concepts – Arrays, objects, methods, classes and interfaces, Extensible Markup
Language (XML).
Web programming techniques – Servlets, Java Server Pages (JSP)
Servlets: Introduction, creating a HTTP servlet for Create, Read, Update and Delete operations
Java Server Pages (JSP): Introduction, creating a JSP for Create, Read, Update and Delete operations
Servlet, XML, JSP

Unit IV 12 Hours
Web programming in Python
Introduction: Basic concepts – Arrays, objects, methods, classes and interfaces, Python’s HTTP
packageHTTP server: Introduction, creating a server that supports Create, Read, Update and Delete
operationsHTTP server, Python packages
Total: 48 Hours
Textbook (s)
1. Learn Web Development with Python, Fabrizio Romano, Gaston C. Hillar, Arun Ravindran, 1st
Edition, 2018.
104
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
2. Learn Java for Web Development, Vishal Layka, 1st Edition, 2014.
3. Node.js, John Bach, Alexander Aronowitz, 3rd Edition, 2021
Reference (s)
1. HTML 5 in simple steps, Kogent Learning Solutions Inc, Dreamtech Press.
2. Beginning HTML, XHTML, CSS, and JavaScript, John Duckett, Wiley India.
3. Beginning CSS: Cascading Style Sheets for Web Design, Ian Pouncey, Richard York, Wiley India.
4. Web Designing & Architecture-Educational Technology Centre, University of Buffalo.

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 20 20 --
Understand 30 10 --
Apply 30 30 40
Analyze 10 20 30
Evaluate 10 20 30
Create -- -- --
Total (%) 100 100 100

Sample
Question(s)
Remember
1. List any four HTML tags and CSS properties
2. Define web server
3. List four browser storage methods
Understand
1. What HTTP method should be used for updating data in a server?
2. Explain the of CSS in web development
3. Illustrate the working of a HTTP server

Apply
1. When user opens a website, the underlying web application wants to store browser
specific data.What is a good approach for saving the data?
2. Give an example of a scenario that might benefit from browser storage instead of
backendstorage.

Analyze
1. There is a common body parsing workflow that every request to a server must obey.
What is a good way to implement it?
2. Compare Servlet and Java Server Page
3. Analyze the general strategy behind cookies and session management.
Evaluate
3. Assuming the server received a permission error from the database, what is the best
way to propagate it to the user?
4. Describe how to implement user authentication in a web server.

Open Book Exam Questions

1. A file is to be stored in the web server. However, the access to this file is to be limited to
specificset of users. How can once achieve this using a web server?

2. Consider a request that yields data of high cardinality. How can one send the data
withoutaffecting the performance of the website?

105
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23MLC31 Fundamentals of Cloud Computing
3003
Course Outcomes
1. Interpret the architecture and infrastructure models of cloud computing, strengths, and
limitations of cloud computing.
2. Understand the virtualization concepts of machines and datacenters.
3. Infer the design concepts of cloud ready applications
4. Compare different cloud centre’s implementation
5. Understand the concepts of cloud scaling and disaster recovery
6. Interpret the security and risk issues in cloud computing
COs–POs Mapping
COs PO2 PO6 PO7 PO8
1 3 2 3 1
2 3 1 2 3
3 2 3 1 2
4 2 3 3 1
5 2 3 1 2
6 2 3 3 3
3–Stronglylinked|2–Moderatelylinked|1–Weaklylinked

Unit I 12 Hours
Cloud Computing

Cloud computing: Introduction, SOA, Cloud computing architectures, Value of cloud computing, Cloud
Infrastructure models including SaaS, PaaS, IaaS, Storage-as-a-Service, Database-as-a-Service,
Information-as-a-Service,Process-as-a-Service,Application-as-a-Service, Integration-as-a-Service, and
Security-as-a-Service. Public cloud, private cloud and hybrid cloud, Cloud Services.
Before moving into the cloud: Know Your Software Licenses, The Shift to a Cloud Cost Model. History of
Cloud Computing, Advantages of Cloud Computing, and Disadvantages of Cloud Computing.
Companies in the Cloud Today, Amazon Web Services, Google services, IBM Cloud, Windows Azure, Tata
Cloud, Salesforce.com

Unit II 13 Hours

Virtualization & Design

Virtualization,Virtualmachine, Implementation Levels of Virtualization,Virtualization Structures/Tools
and Mechanisms, Virtualization of CPU, Memory, and I/O Devices, Virtual Clusters and Resource
Management, Datacentre, Virtualization for Data-Centre Automation. Service Levels for Cloud
Applications Ready for the cloud: Web Application Design, Machine Image Design, Privacy Design,
Database Management.
Various hypervisors like VMware, KVM,oracleVM,

Unit III 12 Hours

Cloud centres, Scaling a Cloud Infrastructure and Disaster Recovery:
Cloud centres in detail: Comparing approaches, Xen, Eucalyptus, CloudStack, and OpenStack. Cloud
Scaling:Capacity Planning, Cloud Scale, Types of cloud scaling.
Disaster Recovery:Disasters in cloud,Disaster Recovery Planning, Cloud Disaster Management.
Requirements for modern data centres-high availability and Service Orientated-Infrastructures(SOI).Modern
data centre use case studies.

106
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Unit IV 11 Hours

Cloud Computing Software Security Fundamentals

Data Security, Network Security, Host Security, Compromise Response.
Cloud information Security Objectives, Cloud Security Services, Relevant Cloud Security Design
Principles, Secure Cloud Software Requirements, Approaches to Cloud Software Requirements
Engineering, Cloud Security Policy Implementation.
Cloud Computing Risk Issues: The CIA Triad, Privacy and Compliance Risks, Threats to Infrastructure
Data and Access Control, Cloud Access Control Issues, Cloud Service Provider Risks.
MicrosoftAzure, IBMBluemix
Total:48 Hours
Textbook(s)

1. GeorgeReese,Cloud ApplicationArchitectures,1stEdition O’ReillyMedia,2009

2. RonaldL.KrutzandRussell DeanVines,CloudSecurity,1stEdition,WileyPublishing,2010
Reference(s)
1. MichaelMiller,CloudComputing-
WebBasedApplicationsthatchangethewayyouworkandcollaborateonline, 1 st
Edition,PearsonEducation,Publishing, 2011
2. KaiHwang,GeoffreyCFoxandJackJ.Dongarra,Distributed&CloudComputingfromParallelProce
ssingtotheInternet ofThings,1stEdition, MK Publishing,2010
3. DavidSLinthicum,CloudComputingandSOAConvergenceinYourEnterprise:AStep-by-
StepGuide,1stEdition, Addison-Wesley, 2009

SAMPLEQUESTION(S)
Internal Assessment Pattern
Cognitive Level Int.Test1 (%) Int.Test2 (%) AssignmentTest3(%)
Remember 40 45 20
Understand 40 45 60
Apply 20 10
Analyze -- -- 20
Evaluate -- -- --
Create -- -- --
Total(%) 100 100 100

Remember
1. Define Cloud Computing.
2. List types of virtualization.
3. Define pro active scaling.
4. What is CIAT RAID?
Understand

1. Explain different cloud Infrastructure models.

2. Explain different levels of virtualization.
3. Explain about Recovery Point Objective.
4. With neat diagram explain the functioning of Xen Architecture.
5. List and explain various cloud service providers risks.

Analyze
1. Compare cloud center and service infrastructure.
2. Analyze different cloud services provided by Amazon
107
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23CS004 Principles of Programming Languages
3003
Course Outcomes
1. Explain the concepts of programming languages.
2. Describe syntax and semantics of programming languages.
3. Explain data types, and basic statements of programming languages.
4. Illustrate the concept of subprogram.
5. Demonstrate the concepts of ADT and OOP.
6. Summarize the concept of exception handling and event handling.

CO–PO Mapping
COs PO1 PO2 PO3 PO4
1 3 1 2 2
2 3 2 1 2
3 3 1 3 1
4 3 2 2 2
5 3 2 2 3
6 3 2 2 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Unit I
Preliminary Concepts 12 Hours
Reasons for studying concepts of programming languages, programming domains, language evaluation
criteria, influences on language design, language categories, language design trade-offs, implementation
methods, programming environments, Evolution of Major Programming Languages.
Syntax and Semantics: General problem of describing syntax, formal methods of describing syntax.
attribute grammars, describing the meanings of programs.
Unit II
Data types, Expressions and Statements, Control Structure 12 Hours
Names, Bindings, and Scopes: Introduction, names, variables, concept of binding, scope, scope and lifetime,
referencing environments, named constants
Data types: Introduction, primitive, character, string types, user defined ordinal types, array, associative
arrays, record, tuple types, list types, union types, pointer and reference types, type checking, strong typing,
type equivalence
Expressions and Statements: Arithmetic expressions, overloaded operators, type conversions, relational
and Boolean expressions, short- circuit evaluation, assignment statements, mixed-mode assignment
Control Structures: introduction, selection statements, iterative statements, unconditional branching.
Guarded commands.
Unit III
Subprograms 12 Hours
Subprograms: Fundamentals of subprograms, design issues for subprograms, local referencing
environments, parameter passing methods, parameters that are subprograms, calling subprograms
indirectly, overloaded subprograms, generic subprograms, design issues for functions, user defined
overloaded operators, closures, co routines
Implementing subprograms: General semantics of calls and returns, implementing simple subprograms,
implementing subprograms with stack-dynamic local variables, nested subprograms, blocks.
Implementing dynamic scoping.
Unit IV
ADT, OOP, Exception and Event Handling 12 Hours
Abstract Data types: The concept of abstraction, introductions to data abstraction, design issues, language
examples, parameterized ADT, encapsulation constructs, naming encapsulations
Object Oriented Programming: Design issues for OOP, OOP in Smalltalk, C++, Java, Ada 95, C#,
Implementation of Object-Oriented constructs.
Exception Handling and Event Handling: Introduction, exception handling in Ada, C++, Java.
Introduction to event handling, event handling with Java and C#.
Total: 48 Hours

108
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)
1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition, Addison Wesley, 2012.
2. Programming Languages, Principles & Paradigms, 2ed, Allen B Tucker, Robert E Noonan, TMH

Reference (s)
1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.
2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 2098.
3. Richard A. O’Keefe, “The craft of Prolog”, MIT Press, 2009.
4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition,
Springer, 2003
Internal Assessment Pattern
Int. Test 1
Cognitive Level Int. Test 2 (%) Open Book Exam (%)
(%)
Remember 50 40 --
Understand 50 50 --
Apply -- 10 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Define programming language?
2. Define named constants?
3. Define subprogram?
Understand
1. Explain numeric types?
2. Summarize grammars for simple assignment statements.
3. Discuss language evaluation criteria and the characteristics that affect them.
Apply
1. Identity the exceptions occurred in C++ and Ada.
2. Construct BNF notation for following:
a. For loop
b. If-else condition
c. Structure definition
3. Solve the given grammar is ambiguous or not.
<assign> -><id>=<expr>
<id>->A|B|C
<expr>-><expr>+<expr>
|<expr>*<expr>
|(<expr>)
|<id>

109
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23CS005 Mobile Computing
3003
Course Outcomes
1. Explain the basic concepts and fundamentals of mobile computing and telecommunication systems
along with various standards.
2. Illustrate the techniques, protocols related to GSM and GPRS architecture to perform requirements
analysis.
3. Explain major components of Mobile IP to improve the service qualities of a network
4. Compare various ad hoc routing protocols to examine the performance of network
5. Explain the architecture of Wireless Sensor Network and WLAN design issues and limitations.
6. Outline the basic knowledge in developing smart phone applications using various platforms, toolkits,
APIs and third party libraries

CO–PO Mapping
COs PO3 PO8
1 3 2
2 2 2
3 1 2
4 2 2
5 2 2
6 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Introduction to Mobile Communications 12 Hours
Overview: Mobile Communication and Mobile Computing – Architecture; Generations of
Telecommunications – 1G, 2G, 3G, 4G and 5G; Wireless Technologies – WPAN, WLAN, WMAN; Wireless
Medium Access Control (MAC) – Overview, SDMA, TDMA, FDMA, CDMA;
2G Technologies: GSM – Services, Architecture, Radio Interface, Protocol Stack, Localization, Call Handling,
Handover, Security; 2.5G – GPRS and 3G – EDGE.

Networking: Communication Modes, Basic Network Designs, Cellular Infrastructures

Unit II
Mobile Network Layer and Transport Layer 12 Hours
Mobile Network Layer: Mobile IP Overview, IP Packet delivery, Agent discovery and advertisement,
Registration, Tunneling and Encapsulation, Optimizations, Security, and Dynamic Host Configuration
Protocol (DHCP).
Mobile Transport Layer – Motivation, Traditional TCP, Classical TCP Approaches: Indirect TCP, Snooping
TCP, Mobile TCP, Transaction-oriented TCP; Optimizations, TCP for 2.5G/3G.

Multi Task gadget: wide area mobile data - air link standards for data - wireless application environment

Unit III
Mobile Ad-hoc Network (MANET) 12 Hours
Introduction to Mobile ad-hoc networks, Characteristics and features, Applications, Limitations; Routing
protocols – Design Issues, Routing algorithms: Proactive (DSDV & OLSR) and Reactive (DSR & AODV),
Security in ad hoc networks; Wireless LAN – IEEE 802.11 – System Architecture, Protocol Layers.
Wireless Sensor Network (WSN): Introduction, Architecture, Applications, Properties and Security.

Satellite systems: history - applications - basics - broadcast systems

Unit IV
Mobile Platforms and Applications 12 Hours
Mobile OS: Overview on Mobile Device Operation Systems (Android, iOS, Black Berry) – Architecture, App
110
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
development Kit; Introduction to Network Simulators: Characteristics, Applications, Limitations, Types of
Simulators: Wireless Application Protocol (WAP): Introduction, Architecture, Applications.
Application layer Protocols – FTP, SMTP, HTTP, DNS; Windows 10.
Total: 48 Hours

Textbook (s)
1. Raj Kamal, Mobile Computing, Oxford press, Third Edition, 2018
2. Jochen Schiller, Mobile Communications, Pearson Eduction, Secon Edition, 2020

Reference (s)
1. Asoke K Talukder, Hasan Ahmad and RoopaYavagal, Mobile Computing, Second Edition, McGraw Hill,
2010
2. Prasant Kumar Pattnail and Rajib Mall, Fundamentals of Mobile Computing, Second Edition, PHI
Learning Pvt. Ltd., 2015
3. Frank Adelstein, et al., Fundamentals of Mobile and Pervasive Computing, McGraw Hill, 2005
4. http://www.isi.edu/nsnam/ns/doc/ns_doc.pdf (NS2 manual)

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 30 25 10
Understand 25 15 20
Apply 25 20 30
Analyze 20 20 30
Evaluate -- 10 10
Create -- 10 --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Define Mobile Computing
2. List the applications of mobile computing
3. List the limitations of mobile computing
4. Define Mobile Adhoc Network
5. List the MANET routing issues

Understand
1. Explain mobile computing with architecture
2. Explain TDMA and FDMA with neat diagrams
3. Illustrate the different services provided by the GSM, Explain with system architecture
4. Explain IP Packet delivery with diagram
5. Describe DSSM (Direct Sequence Spread Spectrum)

Apply
1. Illustrate Registration process achieved in mobile network layer
2. Discuss the feature of tunneling and encapsulation
3. Illustrate the function of Dynamic Host Configuration Protocol (DHCP)
4. Discuss about security in Ad-hoc network
5. Illustrate the properties of MANETS

Analyze
1. Compare Snooping TCP and Indirect TCP

111
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
2. Analyze the performance of Dynamic Source Routing protocol
3. Compare about iOS and Blackberry Operating Systems
4. Compare NS2 and NS3 simulators
5. Explain about Android Operating System with architecture

Evaluate
1. Evaluate the performance of Wireless Datagram protocol
2. Evaluate the performance of DSDV
3. Evaluate the performance of DSR
4. How Traditional TCP is different from I-TCP
5. How localization and Call handling is performed

Open Book Exam Questions

Q1. Describe the functions of the MS and SIM. Why does GSM separate the MS and SIM? How and where is
user-related data represented/stored in the GSM system? How is user data protected from unauthorized
access, especially over the air interface? How could the position of an MS (not only the current BTS) be
localized? Think of the MS reports regarding signal quality.

Q2.Describe the Concept of GPRS. Using the best delay class in GPRS and a data rate of 115.2 kbit/s – how
many bytes are in transit before a first acknowledgement from the receiver could reach the sender (neglect
further delays in the fixed network and receiver system)? Now think of typical web transfer with 10 Kbyte
average transmission size – how would a standard TCP behave on top of GPRS (see chapters 9 and 10)?
Think of congestion avoidance and its relation to the round-trip time. What changes are needed?

112
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23CS006 Distributed Operating Systems
3003
Course Outcomes
1. Summarize the fundamental concepts of Distributed Operating Systems.
2. Illustrate the Concepts of Message passing system and Remote Procedure Calls.
3. Design and Implementation of Distributed Shared Memory and Structures.
4. Utilize the Synchronization and Distributed File Systems.
5. Make use of Resource Management and Process Management Concepts.
6. Outline the concept of Naming and Security in Distributed Operating Systems.

CO–PO Mapping
CO PO1 PO2
1 3 2
2 3 2
3 3 2
4 2 2
5 3 2
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Introduction and Communication in Distributed System 12 Hours
Introduction: Design Issues - Distributed Computing Environment - Message Passing - Features of Good
Message Passing System-Issues in IPC by Message Passing-Synchronization- Buffering
Remote Procedure Calls: The RPC Model - Transparency of RPC- Implementing RPC Mechanism - Stub
Generation - RPC Messages - Marshaling Arguments and Results - Server Management - Parameter-Passing
Semantics- Call Semantics

Communication Protocols for RPCs - Complicated RPCs - Client-Server Binding-Case Study: Sun RPC

Unit II
Distributed Shared Memory and Synchronization 12 Hours
Distributed Shared Memory: General Architecture of DSM Systems- Design and Implementation Issues of
DSM – Granularity - Structure of Shared Memory Space
Synchronization: Clock Synchronization - Event Ordering - Mutual Exclusion –Deadlocks- Election
Algorithms

Consistency Models-Replacement Strategy - Thrashing

Unit III
Resource Management and Distributed File Systems 11 Hours
Resource Management: Features of a Good Global Scheduling Algorithm - Task Assignment Approach – Load
Balancing Approach – Load Sharing Approach
Distributed File Systems: Introduction -Desirable Features of a Good Distributed File System - File Models –
File Accessing Models – File Sharing Semantics – File Caching Schemes - File Replication

Process Management - Process Migration- Threads- Case Study: DCE Distributed File Service

Unit IV
Naming and Security 12 Hours
Naming: Desirable Features of a Good Naming System - Fundamental Terminologies and Concepts - System-
Oriented Names - Object-Locating Mechanisms - Human-Oriented Names - Name Caches
Security: Potential Attacks to Computer Systems - Cryptography – Authentication

Access Control - Digital Signatures - Design Principles- Case Study: DCE Directory Service
Total: 48 Hours
113
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Textbook (s)
1. Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of India, 2009
2. Andrew S Tannebaum, ”Distributed Operating Systems”, Pearson Education, 2007

Reference (s)
1. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and Design”,
Fifth Edition, Pearson Education, 2012
2. Tanenbaum A.S., Van Steen M., “Distributed Systems: Principles and Paradigms”, Pearson Education,
2007
3. Liu M.L., “Distributed Computing, Principles and Applications”, Pearson Education, 2004.
4. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, USA, 2003

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 40 40 --
Understand 30 40 --
Apply 30 20 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. List any four advantages of Distributed operating systems
2. Define distributed operating systems.
3. List any five reasons why to build distributed operating System.
4. What are the features of good distributed file systems?
5. List the features of a Good Naming System

Understand
1. Explain the design issues of distributed operating systems.
2. Explain the role of Naming in distributed operating systems
3. Summarize the internal and external synchronization of Physical clocks
4. Differentiate Resource Management and Process Management
5. Explain in detail about security and authentication.
Apply
1. Construct the different protocols of RPC.
2. Identify the File shearing Semantics and file caching Schemes.
3. Develop the Bully and Ring Algorithm
4. Develop the scenario how might the clocks in two computers that are linked by a local network
be synchronized without reference to an external time source
5. Utilize the various deadlock prevention techniques with suitable example?
Analyze
1. Analyze the Concept of exception handling in RPC.
2. Examine the Concept of Thread.
3. Compare Fault tolerance and Thrashing.
4. Classify the deadlock avoidance techniques.
5. Simplify an algorithm using multicast and logical clocks for mutual exclusion.

114
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Open Book Exam Questions
Question 1:
A distributed system has DSM facility. The process-scheduling mechanism of this system selects another
process to run when a fault occurs for the currently running process, and theCPU is utilized while the block
is being fetched. Two system engineers arguing about how to better utilize the CPUs of this system have the
following opinions:

(a) The first one says that if a large number of processes are scheduled for execution at anode, the available
memory space of the node can be distributed among these processes that almost always there will be a
ready process to run when a page fault occurs. Thus, CPU utilization can be kept high.

(b) The second one says that if only a few processes are scheduled for execution at a node, the available
memory space of the node can be allocated to each of the few processes, and each process will produce
fewer page faults. Thus, CPU utilization can be kept high. Whose argument is correct? Give reasons for your
answer.
Question 2:
The password mechanism is used in a distributed system to authenticate users at login time. State the most
suitable locations (according to you) for storing the login program and the password file in the following
cases:

(a) The distributed system is based on the workstation-server model with each workstation having a small
hard disk of about 20 megabytes capacity.

(b) The distributed system is based on the workstation-server model. Some of the workstations are diskless
and others have a small hard disk of about 20 megabytes capacity.
(c) The distributed system is based on the processor-pool model.

115
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23DS507 Deep Learning Lab
0 0 3 1.5
Course Outcomes
At the end of the course, the students will be able to:
1. Design and implement the basic structure of neural network.
2. Design and develop the various Neural Network Models for classification problems.
3. Develop the different type of CNN models for solving real-time problems.
4. Understand and apply the transfer learning techniques with various standard DL models.
5. Develop the different type of RNN models for solving real-time problems.
6. Apply the deep learning models for solving various computer vision and NLP tasks.

CO–PO Mapping
CO PO4 PO5 PO8
1 3 2 2
2 3 3 2
3 3 3 2
4 2 2 3
5 2 2 2
6 1 1 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Lab Manual
1. Deep Learning for Data science Laboratory– AIDS Department, GMRIT
Textbook (s)
1. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow by Aurélien Géron,
October 2022: Third Edition.
2. Fundamentals of Deep Learning: Designing Next-generation Machine Intelligence
Algorithms by Nicholas Locascio and Nikhil Buduma O'Reilly Media; 1 edition (June 29,
2017)
3. Simon S. Haykin, Neural Networks, Prentice Hall, 2nd edition
4. B. Yegnanrayana , “Artificial Neural Networks” , PHI.

Reference (s)
1. Franchois Chollet, Deep Learning with Python
2. Deep Learning: A Practitioner's Approach by Adam Gibson and Josh Patterson
Shroff/O'Reilly; First edition (2017)
3. Python Deep Learning by Daniel Slater and Gianmario Spacagna, Packt Publishing; 2/e
(January 16, 2019)
4. Bishop, C., M., Pattern Recognition and Machine Learning, Springer, 2006
5. Kevin P. Murphy., Machine Learning: A Probabilistic Perspective

List of Experiments
Week 1: Define the Structure and Parameter’s Initialization in a Neural Network Model.
Week 2: Implement the Forward propagation and Compute the Cost Function.
Week 3: Implement Back propagation to get the gradients and Update parameters (gradient
descent)
Week 4: Build a Neural Network Model and predict the Output.
Week 5: Implement the Hebbian Learning neural networks.
Week 6: Digit and Character recognizer using CNN.
Week 7: Explore implementation of AlexNet.

116
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Week 8: Exploring Different CNN Models: VGG16, VGG19

Week 9: Exploring Different CNN Models: GoogleNet,
Week 10: Explore implementation of VGG16 with transfer learning and fine tuning
Week 11: One-hot encoding of words and characters using word embedding.
Week 12: Study the construction and working of Recurrent Neural Network.
Week 13: Explore LSTM
Week 14: GRU to predict stock prices based on historic data.
Week 15: Explore applications like Image segmentation and object detection.
Week 16: Automatic image captioning and video to text models.

Augmented Experiments:
(Students shall opt any one of the Augmented Experiments in addition to the regular experiments)

a. Image Segmentation
b. Object Detection
c. Human Facial Recognition.
d. Automatic image captioning
e. Stock Market Prediction.
f. Social Media
g. Aerospace
h. Defense
i. Healthcare
j. Signature Verification.
k. Social media
l. Aerospace
m. Defense
n. Healthcare
o. Handwriting Analysis
p. Speech Recognition
q. Weather forecasting

117
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Open Elective-II
23DS001 Fundamentals of Data Science
Course Outcomes
1. Understand the key steps and pipeline of Data Science and its application in solving real-world problems.
2. Recognize the importance of measuring similarity and dissimilarity between features in data for various
analysis tasks.
3. Appreciate the significance of pre-processing techniques in preparing data for analysis in real-time
scenarios.
4. Identify the characteristics and practical applications of different regression models used in real-world
scenarios.
5. Evaluate classification models using appropriate metrics, including the confusion matrix, to assess model
performance and make informed decisions.
6. Understand the principles of ensemble modeling and clustering, and apply appropriate ensemble
techniques to improve the accuracy and reliability of machine learning models.
COs–POs Mapping
COs PO3 PSO1 PSO2
1 2 2 2
2 2 3 3
3 2 3 3
4 2 2 2
5 2 2 2
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT-I 12+8 hours

Introduction: Relation among AI, ML and Data Science, Importance of Data Science; Data Science Process;
Data Exploration: Objectives of Data Exploration, Forms of Data(Structured, Semi Structured,
Unstructured),Datasets(data objects and types of attributes/fields), Characteristics of Datasets and
corresponding Statistical Measures;
Data Visualization: Univariate Visualization, Multivariate Visualization.
Categorization of Data Science Algorithms. Overview of different kind of dataset (i.e. text, image) and the
different format(ie. CSV, json).
Practical Components
1. Perform data exploration and statistical analysis on a real-world dataset to understand its
characteristics and calculate relevant statistical measures.
2. Explore datasets of different formats (text and image) and apply data exploration
techniquesaccordingly.
3. Visualize a dataset using univariate and multivariate visualization techniques to analyze the
distribution of data and explore relationships between variables.
4. Analyze a dataset using categorical data visualization techniques (bar plots, pie charts) to gain
insights into demographic patterns and distributions.

UNIT-II 12+8 hours

Data Similarity/Dissimilarity: Understanding data similarity and dissimilarity, Measures for comparing
different types of data (nominal, ordinal, binary, numerical).
Data Preprocessing: Data Preprocessing Pipeline, Preprocessing techniques for cleaning and integrating
data, Data reduction techniques for handling large datasets, Cosine Similarity.
Distance based similarity (Euclidean distance, Jaccard Similarity).
Practical Components
1. Apply data preprocessing techniques and impute missing values on a real-world dataset.
2. Select a large dataset and apply data reduction techniques such as feature selection and

118
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

dimensionality reduction (e.g., PCA, t-SNE) to handle its size while preserving important information
and patterns in the data.
3. Calculate the cosine similarity between pairs of text documents to measure their similarity.
4. Integrate multiple datasets and perform data cleaning to create a unified and consistent dataset.

UNIT-III 12+8 hours

Regression: Introduction to linear regression for forecasting numerical quantities, Logistic regression
for classification problems, Regularization techniques for improving model performance;
Classification:ClassificationPrinciples,ClassificationModelEvaluationMetrics(ConfusionMatrix),
Classification using Decision Trees, Distance based Classifier(k-NN),Bayesian classifier.
Regression vs Classification.
Practical Components
1. Perform linear regression on a dataset to forecast a specific target variable. Evaluate theperformance
of the regression model using appropriate evaluation metrics.
2. Apply the Decision Trees algorithm to build a classification model. Utilize appropriate
evaluationmetrics and construct a confusion matrix to assess the model's performance.
3. Perform linear regression on a dataset and apply regularization techniques such as L1 or
L2regularization to improve the model's performance.
4. Implement a Bayesian classifier to classify emails as spam or non-spam. Use appropriate
evaluation metrics to assess the classifier's performance.
UNIT-IV 12+8 hours
Ensemble Learning: Conditions for Ensemble Modeling, Overview of ensemble techniques(Voting,
Bagging,Boosting and Random Forest);
Clustering: Clustering Principles, Clustering for description/preprocessing/classification, Types of
Clustering, Clustering Evaluation Parameters, Clustering Algorithms (k-Means) and Evaluation metrics for
assessing the quality of clustering results;
Applications/ Purpose of Clustering.
Practical Components
1. Explore ensemble learning techniques such as Random Forest on a dataset suitable for
classification or regression.
2. Apply the K-means clustering algorithm on a dataset for classification purposes. Use
evaluation metrics to assess the quality of the clustering results and experiment with different
values of k.
3. Use a voting classifier to combine multiple classification algorithms and improve the accuracy of
thefinal model.
4. Perform Hyperparameter tuning for any Ensemble Algorithms(ie. RF )
Total: 48+32 Hours

Textbooks:
1. Vijay Kotu & Bala Deshpande, “Data Science: Concepts and Practice”, 2ndEdition,
MorganKaufmann Publication, 2017.
2. JlaweiHan&MichelineKamber,“DataMining:ConceptsandTechniques”,3rdEdition,MorganKau
f mannPublishers,2012.
3. Pang-NingTanetal.,“IntroductiontoDataMining”,2 ndEdition,PearsonPublications,2019.
References:
1. Vijay Kotu & Bala Deshpande, “Data Science: Concepts and Practice”, 2ndEdition,
MorganKaufmann Publication, 2017.
2. TomM.Mitchell,"MachineLearning",TataMcGrawHill,1997.
3. SunilaGollapudi,“PracticalMachineLearning”FirstEdition2016,PacktPublishingLtd.

119
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Internal Assessment Pattern

Cognitive Level Int.Test1(%) Int.Test1(%) OpenbookTest1(%)

Remember 20 20 --
Understand 50 30 --
Apply 30 30 80
Analyze -- 20 20
Evaluate -- -- --
Create -- -- --
Total(%) 100 100 100

SAMPLEQUESTION(S)
Remember
1. What are the different forms of data in data science? Provide examples for each form.
2. Name the statistical measures used to analyze datasets in data science.

Understand
1. Why is pre-processing important in machine learning? Explain with relevant examples
2. What is the difference between supervised and unsupervised algorithms? Provide an example for each
type.
Apply
1. Imagine you have a dataset containing information about houses. How would you handle the
followingscenarios using pre-processing techniques:
a. Data Cleaning: How would you deal with missing values in the dataset? What approach
wouldyou take to handle outliers or inconsistent data?
b. Data Integration: Suppose you have additional datasets with relevant information about
houses,such as neighborhood demographics or school ratings. How would you combine this
information with the existing dataset?
c. Data Reduction: The dataset contains numerous features. How would you simplify the
datasetby reducing the number of features without losing important information?
d. Data Transformation and Discretization: How would you standardize numerical features in
thedataset? Additionally, how would you convert continuous variables, such as house prices,
into categorical variables for analysis purposes?
Open Book Question(s)
1. Discuss the importance of data visualization in data science. Provide examples of univariate and
multivariate visualizations, and explain how they can be used to gain insights from complex datasets.
Support your answer with relevant illustrations or diagrams.
2. Compare and contrast supervised and unsupervised learning algorithms. Provide a detailed
explanation of each type, including their characteristics, applications, and differences in the training
process. Give an example scenario where you would use each type of algorithm.
3. Assume you have been given a dataset with various features related to customer demographics and
their purchasing behavior. Design a data science pipeline to address the following tasks:
a. Data exploration and statistical analysis of the dataset.
b. Preprocessing steps, including handling missing values, data cleaning, and feature transformation.
c. Applying a suitable regression model to predict customer spending based on the available features.
d. Evaluating the performance of the regression model using appropriate evaluation metrics.

120
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23TPX01 Term Paper

0 0 3 1.5
Course Outcomes
1. Interpret the literature to link the earlier research with the contemporary technologies
2. Communicate effectively as an individual to present ideas clearly and coherently
3. Review the research findings and its correlation to the latest applications
4. Prepare documents and present the concepts clearly and coherently
5. Inculcate the spirit of enquiry for self-learning
6. Identify interdisciplinary oriented topics

COs – POs Mapping

COs PO1 PO4 PO10 PO12
1 - 2 - -
2 - - 3 3
3 3 - - -
4 - - 3 -
5 - - - 3
6 1 - - -
3–Strongly linked | 2–Moderately linked| 1–Weakly linked

Term Paper: The term paper is a self-study report with an objective enhancing the students’ written
technical-communication and shall be carried out in 5th semester. Every student will take up this
either individually or as a batch of maximum four members and submit a report. The scope of the
term paper could be an exhaustive literature review choosing any engineering concept with
reference to standard research papers or an extension of the concept of earlier course work in
consultation with the term paper supervisor.

The report will be evaluated by a committee nominated by HoD with the approval of the Controller
of Examinations (CoE)

121
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ESX02 Employability Skills II

0020
Course Outcomes
1. Demonstrate oral communication and writing skills as an individual to present ideas coherently
2. Introspect & develop life skills with constructive approach
3. Assess and improve analytical skills
4. Understand the GUI of WEKA tool and can create new ARFF data.
5. Discover different Pre-Processing Techniques for different kinds of databases
6. Use Association rule mining algorithms to generate association rules

COs – POs Mapping

COs PO1 PO2 PO3 PO5 PO 6 PO8 PO10 PO12
CO1 - - - - - - 3 -
CO2 - - - - 3 - 2 2
CO3 2 - - - - 2 - -
CO4 3 - 3 2 - 2 - -
CO5 3 2 3 2 - - - 2
CO6 2 2 3 2 3 - - -
3–Strongly linked | 2–Moderately linked| 1–Weakly linked

Soft Skills:
No. of
Sl No. 5th Semester (Topic & Content)
Periods
Introduction to Campus Placements: Stages of Campus Placement, Skills
1. 02
assessed in Campus Placements & How to get ready?
Motivational Talk on Positive Thinking: Beliefs, Thoughts, Actions,
2. 02
Habits & Results (Success)
Resume Preparation: Resume? Templates? Mistakes to be avoided in a
3. 03
Resume, Steps to be followed in preparing it.(with examples)
Group Discussions (Recap): GD? Stages of a GD, Skills assessed in a GD,
4. 03
Blunders to be avoided, How to excel in a GD? (through Practice Sessions)
Psychometric Tests: Definition, Types of Psychometric Tests: Numerical
5. Computation, Data Interpretation, Verbal Comprehension, Verbal Critical 03
Reasoning and Personality Questionnaires
6. Exercises related to Communication: Story Writing, TAT etc 03
Total Periods 16

Quantitative Aptitude:
Sl No. Semester-V (Topic) No. of Periods
1. Square &Cube roots 02
2. Partnership 02
3. Partnership 02
4. Logarithms 02
5. Progressions 02
6. Mensuration 02
7. Mensuration 02
8. Data Sufficiency 02
Total Periods 16

122
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Module-1:
No of Hours: 16 Hours
Introduction: Importance of Competitive Programming, Conditional Statements, Loops, Nested Loops.
Strings, Arrays, Recursion and pointers

Practice Problems:

Week Topic Practice Problem Links

1 Introduction to CP Creating accounts on Global Coding Platforms

https://www.codechef.com/practice/tags/conditional-
2 Conditional Statements
statements

https://www.codechef.com/practice/tags/loops

3 Loops https://leetcode.com/tag/math/

https://www.interviewbit.com/practice/#topics[]=math

https://www.codechef.com/practice/topics/math
4 Nested Loops
https://www.interviewbit.com/practice/#topics[]=math

https://www.codechef.com/practice/topics/strings

5 Strings https://leetcode.com/tag/string/

https://www.interviewbit.com/practice/#topics[]=strings
https://www.hackerrank.com/domains/data-
structures?filters%5Bsubdomains%5D%5B%5D=arrays
https://leetcode.com/tag/array/
6 Arrays
https://www.codechef.com/practice/topics/arrays

https://www.interviewbit.com/practice/#topics[]=arrays
https://www.interviewbit.com/practice/#topics[]=two-
7 Two Pointer pointers
https://leetcode.com/tag/two-pointers/

https://leetcode.com/tag/recursion/
8 Recursion
https://www.codechef.com/practice/tags/recursion

123
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Module-2:
No of Hours: 16 Hours
Searching, Sorting, Linked List, Linked List: Double Linked List, Circular Linked List, Stack, Queue,
hashing

Practice Problems:
Week Topic Practice Problem Links
https://www.codechef.com/practice/topics/binary-search
https://leetcode.com/tag/binary-search/
9 Searching-I
https://www.interviewbit.com/practice/#topics[]=binary-search
https://www.codechef.com/practice/tags/searching
https://www.codechef.com/practice/topics/binary-search
https://leetcode.com/tag/binary-search/
10 Searching-II
https://www.interviewbit.com/practice/#topics[]=binary-search
https://www.codechef.com/practice/tags/searching
https://www.codechef.com/practice/topics/sorting
11 Sorting-I https://leetcode.com/tag/sorting/
https://leetcode.com/tag/merge-sort/
https://www.codechef.com/practice/topics/sorting
12 Sorting-II
https://leetcode.com/tag/sorting/
https://www.hackerrank.com/domains/data-
structures?filters%5Bsubdomains%5D%5B%5D=linked-lists
LinkedList: Double
13 LinkedList, https://leetcode.com/tag/linked-list/
Circular LinkedList https://www.interviewbit.com/practice/#topics[]=linked-lists
https://leetcode.com/tag/doubly-linked-list/
https://www.hackerrank.com/domains/data-
structures?filters%5Bsubdomains%5D%5B%5D=stacks
14 Stack https://leetcode.com/tag/stack/
https://www.interviewbit.com/practice/#topics[]=stacks-and-
queues
https://www.hackerrank.com/domains/data-
structures?filters%5Bsubdomains%5D%5B%5D=queues
15 Queue https://leetcode.com/tag/queue/
https://www.interviewbit.com/practice/#topics[]=stacks-and-
queues
16 Hashing https://www.interviewbit.com/practice/#topics[]=hashing

Total: 32 Hours
References:

1. https://leetcode.com
2. https://www.codechef.com
3. https://www.hackerearth.com
4. https://www.interviewbit.com
5. https://www.hackerrank.com

124
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23SIX01 Summer Internship I

0001
Course Outcomes
1. Demonstrate the application of knowledge and skill sets acquired from the course and
workplace in the assigned job function/s
2. Solve real life challenges in the workplace by analyzing work environment and conditions, and
selecting appropriate skill sets acquired from the course
3. Articulate career options by considering opportunities in company, sector, industry,
professional and educational advancement
4. Communicate and collaborate effectively and appropriately with different professionals in the
work environment through written and oral means
5. Demonstrate the ability to harness resources by examining challenges and considering
opportunities
6. Demonstrate appreciation and respect for diverse groups of professionals by engaging
harmoniously with different company stakeholders

COs – POs Mapping

COs PO1 PO2 PO8 PO10 PO12
1 3 - - - -
2 3 - - - -
3 - - - - 3
4 - - - 3 -
5 - 2 - - -
6 - - 3 - -

Summer Internship: As a part of curriculum in all branches of Engineering, it is mandatory for all
students to undergo summer internship Programme at industries (core or allied) / R & D
organization to get practical insight of their subject domain during summer break after the 4th
semester. This summer internship Programme shall be availed to a maximum duration of 4 weeks
and the assessment shall be carried out with both internal and external experts leading to
“Satisfactory” and “Non-Satisfactory Performance”, and it will not be accounted for the calculation of
CGPA.

125
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Audit Course
0000
Course Outcomes
1. Interpret the meaning of values and select their goals by self- Investigation based on personal
values activity
2. Interpret the major events and issues related to a period in Indian history
3. Assess the benefits and limitations of science and its application in technological developments
towards human welfare
4. Check the awareness regarding basic human rights and to uphold the dignity of every individual
5. Assess the individual and group behaviour, and understand the implications of organizational
behaviour on the process of management
6. Determine the appropriateness of various leadership styles and conflict management strategies
used in organizations

COs – POs Mapping

COs PO12
1 3
2 3
3 3
4 2
5 3
6 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Audit Courses: Audit courses are among the compulsory courses and do not carry any credits. All the
students shall register for one Audit courses in the beginning of 3 rdsemester. List of the courses will be
notified at the beginning of the third semester for all students and the student has to choose one audit
course under self-study mode at the beginning of third semester. All the students (regular and lateral
entry students) shall complete the audit course similar to other regular courses and the results will be
indicated with “Satisfactory” or “Not Satisfactory” performance.

126
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

6th Semester
23DS601 Optimization techniques for machine learning
3003
Course Outcomes
1. Understand the optimization fundamentals
2. Determine unconstrained optimization techniques
3. Understand constrained optimization and duality theory
4. Understand large scale optimization and regularization techniques
5. Understand advanced optimization techniques
6. Explain optimization for deep learning.

CO–PO Mapping
CO PO2 PO3 PSO1 PSO2
1 1 2 2 2
2 1 2 2 2
3 2 2 2 2
4 2 2 2 2
5 2 2 2 2
6 2 2 2 2

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Introduction to Optimization: Introduction to optimization problems and applications in machine learning,
Convexity, convex functions, and convex optimization
Unconstrained Optimization: Gradient descent, Newton's method, and their variants, stochastic gradient
descent
Proximal Methods, Online Learning, Distributed and Parallel Optimization

Unit II 12 Hours
Constrained Optimization: Linear programming and its applications in machine learning, Quadratic
programming and its applications in machine learning, Nonlinear programming and its applications in machine
learning
Convex Optimization: Convex optimization algorithms: sub gradient methods, projected gradient methods,
interior point methods. Duality theory and its applications in machine learning Convex relaxation and its
applications in machine learning
Karush-Kuhn-Tucker (KKT) Conditions, Duality in Convex Optimization, Robust Optimization
Unit III 12 Hours
Large Scale Optimization: Mini-batch gradient descent and stochastic gradient descent, Distributed
optimization algorithms, Optimization for online learning
Regularization and Sparsity: L1 and L2 regularization, Elastic net regularization and its applications in machine
learning, Group sparsity and its applications in machine learning

Optimization on Parallel Architectures, Sparse Recovery and Compressed Sensing

Unit IV 12 Hours
Advanced Optimization Techniques: Conjugate gradient methods and their variants, Quasi-Newton methods
and their variants, Trust region methods and their variants
Optimization for Deep Learning: Back propagation and optimization in deep learning, Optimization for
recurrent neural networks and long short-term memory networks, Optimization for generative models, such as
variational auto-encoders and generative adversarial networks

Gradient Clipping, Weight Initialization Techniques, Adaptive Learning Rate Methods

Total: 48 Hours

127
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)
1. "Convex Optimization" by Stephen Boyd and Lieven Vandenberghe
2. "Optimization for Machine Learning" by Suvrit Sra, Sebastian Nowozin, and Stephen Wright
3. "Numerical Optimization" by Jorge Nocedal and Stephen J. Wright

Reference (s)
1. "Stochastic Gradient Descent and Beyond" by Martin Jaggi
2. "Sparse Modeling: Theory, Algorithms, and Applications" by Irina Rish and Genady Grabarnik
Internal Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 50 40 --
Understand 30 40 --
Apply 20 20 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. What is optimization
2. Define purpose of optimization

Understand
1. Explain different convex optimization
2. Explain the advanced optimization techniques
Apply
1. Apply various visual aids to identify behavior of data
2. Make use of Multivariate Analysis methods for data analysis
Analyze
1. Compare and contrast various L1 and L2 regularization

Open Book Exam Questions

Question 1:
Perform below analysis on a house price prediction dataset.
a) Univariate Analysis
iii. Analysis of a numerical feature
iv. Analysis of a categorical feature
b) Bivariate Analysis
v. Relationship of a numerical feature with another numerical feature
vi. Relationship of a numerical feature with a categorical feature

Question 2:
Perform below analysis on weather prediction dataset.
1. Correlation Analysis

i. Correlation Heat Map

ii. Zoomed Heat Map
2. Investigation of missing values
i. What's missing? to what extent?
ii. Visualizing missing values in a data frame

128
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ML602 AUTOMATA THEORY AND LANGUAGE PROCESSORS

3003
Course Outcomes

1. Understand State machines, languages and computations

2. Understand regular grammars and regular languages
3. Design Pushdown automata for Context free languages
4. Acquire knowledge of compiler & its Phases
5. Construct parse table for a given context free grammar
6. Apply code optimization techniques to improve the performance of a program

CO–PO Mapping
CO PO1 PO2 P012
1 3 3 3
2 2 2 2
3 3 2 2
4 2 3 2
5 2 2 2
6 2 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Finite Automata: Finite automata model-Deterministic Finite Automata – Nondeterministic Finite automata -
Recognition of a language by an Automaton - Equivalence of DFA and NFA, Minimization of Finite Automata -
Regular sets: Regular Expressions-Arden’s theorem –Pumping Lemma for Regular Languages - Closure
Properties of Regular sets.
Applications of finite automata, Equivalence of finite automata.

Unit II 12 Hours
Context free language- Chomsky Classification of languages- Context-free grammar -simplification of Context
free Grammar- Chomsky Normal Form-Closure Properties of Context free Languages.
Pushdown Automata: PDA Model-Design-Acceptance by empty stack and final state- Non-deterministic PDA.
Context Sensitive Languages, Linear bounded automata

Unit III 12 Hours

Language Processing-Phases of a Compiler-Top-down Parsing: Derivation of a string- ambiguous grammar-Left
recursion-Left factoring-First and Follow-Non-Recursive Predictive Parsing- LL(1) Grammar-Bottom-up parsing:
Model of an LR Parsers-Construction of SLR Parsing Table.
Shift-Reduce parsing – Regular definitions

Unit IV 12 Hours
Intermediate Code generation and optimization: Three Address Code- Quadruples-Triples-Indirect
Triples-Machine Independent Code Optimization: Common Sub-expression Elimination-Constant Folding-
Copy Propagation-Dead Code Elimination-Strength Reduction-Loop Optimization -Basic Blocks-Flow Graph-
DAG for basic Blocks-Machine Dependent Code Optimization: Peephole Optimization
Syntax directed translation – DAG for expressions Total 48 Hours

Text Books:
1. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation,
3rd Edition, Pearson/Addison Wesley
2. Mishra & Chandra Sekharan, Theory of Computer Science& Automata Language and Computation,
3rd Edition, Prentice Hall of India
3. Alfred V Aho, Monica S Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers, Principles Techniques an
Tools,2nd Edition, Pearson.

Reference books:
1. P. Linz, Introduction to Formal Language and Computation, 2nd Edition, Narosa, 2006.
2. V. Raghavan, Principles of Compiler Design, 2nd Edition, TMH, 2011.

129
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 20 20 --
Understand 30 40 --
Apply 50 40 60
Analyze 40
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Write the analytical representation of NFA.
2. Define context free grammar.
3. Define token.
Understand
1. Explain the closure properties of regular languages.
2. Explain the phases of compiler.
3. Explain about code optimization techniques.
Apply
1. Design pushdown automata for L={anbn/n>=1}.
2. Calculate the first and follow functions for the given grammar-
S → (L) / a
L → SL’
L’ → ,SL’ / ∈
1. Construct SLR(1) parsing table for the following grammar
S’  S
S CC
C  cC
C d
Analyse

1. Differentiate Chomsky classification of languages.

2. How does machine dependent code optimization is different from machine independent code
optimization?

Open Book Exam Questions

1. Suppose r1 and r2 are regular expressions over the same alphabet Σ. We say r1 = r2 to denote equality of
the languages represented by r1 and r2. In other words, every string in the language represented by r1 is
also included in the language represented by r2 and vice versa. For each of the following pairs of regular
expressions over Σ = {0, 1}, either prove that they represent the same language, or give a string that is
present in the language of one but not in the language of the other. In the latter case, you must also
describe why your solution string is in the language of one regular expression, but not in that of the
other.
(a) r1 = 1 ∗ (1 + 0) ∗0 ∗ and r2 = (0 ∗1 ∗ ) ∗
(b) r1 = ((0 + 1) ∗0) ∗0 and r2 = (0 + 1) ∗0 ∗0
(c) r1 = (0 + 1) ∗01(0 + 1) ∗ and r2 = 1 ∗ (0 + 1) ∗0(0 + 1) ∗1

2. Construct the basic block and flow graph for the following C fragments

a=3;
b=4;
for(i=0;i<n;i++)
{
a=a*b+5;
a=a-4;
}
c=a+b*3;

130
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS603 Software Engineering

3003
Course Outcomes
1. Explain the need of Software Life Cycle Models
2. Build end-user requirements into system and software requirements,
3. Summarize the system models of software engineering
4. Identify and apply appropriate software architectures and patterns to carry out high level design
5. Choose various testing techniques during software development
6. Categorize Risk management and Software quality for software products

COs–POs Mapping
Cos PO4 PO5 PO8 PO11 PSO1
1 3 3 2 2 2
2 3 3 2 2 2
3 3 2 2 2 2
4 2 2 2 2 2
5 2 3 2 2 2
6 2 3 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours

Introduction to Software Engineering and SDLC, Software Myths, CMMI, Process models: Linear Sequential
model, Prototyping model, Evolutionary models: Spiral model, Agile developmental methodologies-Scrum
& XP
Incremental model, software development : Product based and application based

Unit II 12 Hours
Software Requirements: Functional and non-functional requirements, user requirements, system
requirements, interface specification. Software Requirements Engineering Process, Feasibility studies,
Requirements elicitation and analysis, requirements validation.
System models: Context models, behavioral models, data models, object models.

Structure of Software Requirements Document, Structured analysis methods

Unit III 12 Hours

Design concepts, data design, software architecture, Architectural styles and patterns, User interface design -
Golden rules, User interface analysis and design and steps. Conceptual model of UML, basic structural modeling,
Static and Dynamic UML diagrams : class diagrams, sequence diagrams, collaboration diagrams, use case
diagrams, etc.,
Data Acquisition System - Monitoring and Control System

Unit IV 12 Hours
Testing strategies and Risk Management: Testing levels: Unit testing, integration testing, system testing
– alpha and beta testing, Testing Types: black box and white box testing techniques, Cyclomatic Complexity,
debugging, Risk management - Risk types, strategies, estimation and Planning. Software Quality - Quality
assurance and its techniques
Software measurement, metrics for software quality
Total: 48 Hours
Textbook (s)
1. Roger S. Pressman, Software Engineering, A practitioner’s Approach, 8th Edition, McGraw-Hill
International Edition, 2015
2. I. Sommerville, Software Engineering, 7thEdition, Pearson education, 2004.
3. Rajib Mal, Fundamentals of software Engineering, 4th Edition, Eastern Economy Edition, 2014.

131
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Reference (s)
1. K K Aggarwal and Yogesh singh, Software engineering,3rd Edition, New age international
publication,2008

SAMPLE QUESTION (S)

Internal Assessment Pattern
Int. Test 1
Cognitive Level Int. Test 2 (%) Open Book Exam (%)
(%)
Remember 30 30 --
Understand 40 40 --
Apply 30 30 50
Analyze -- -- 50
Evaluate -- -- --
Create -- --
Total (%) 100 100 100

Remember
1. Define software engineering.
2. List different types software myths.
Understand
1. Applying the process of requirement analysis, discuss how the requirements can be collected
for aproject.
2. Applying debugging strategy fin an error from a code?
Apply
1. Applying the process of requirement analysis, discuss how the requirements can be collected
for aproject.
2. Applying debugging strategy fin an error from a code?
Analyze
1. Compare and Contrast software life cycle models.
2. Analyze risk types in the risk management.

Open Book Exam Questions

Assume that 10 errors have been introduced in the requirements model and that each error will be
amplified by a factor of 2:1 into design and an addition 20 design errors are introduced and then
amplified 1.5:1 into code where an additional 30 errors are introduced. Assume further that all units
testing will find 30 percent of all errors, integration will find 30 percent of the remaining errors, and
validation tests will find 50 percent of the remaining errors. No reviews are conducted. How many
errors will be releasedto the field.

132
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23MLC12 Machine Learning for Business Intelligence

3024

Course Outcomes
1. Understand the basic concepts of business analytics.
2. Identify the application of business analytics and use tools to analyze business data.
3. To know how to derive meaning form huge volume of data and information and knowledge discovering
process is used in business decision making.
4. Become familiar with various metrics, measures used in business analytics.
5. Illustrate various descriptive, predictive, and prescriptive methods and techniques.
6. Model the business data using various business analytical methods and techniques.

CO–PO Mapping
CO PO2 PO3 PSO1 PSO2
1 2 2 2 2
2 2 2 3 3
3 2 2 2 2
4 2 2 2 2
5 2 2 3 3
6 2 2 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT I 11+ 9 Hours

Introduction to Business Analytics: Introduction to Business Analytics, need and science of data driven (DD)
decision making, Descriptive, predictive, prescriptive analytics and techniques, big data analytics, Web and Social
media analytics, Machine Learning algorithms, framework for decision making, challenges in DD decision making
and future.
Recommender Systems, Automated Decision-Making, Reinforcement Learning for Decision-Making

Practical Components
1. Descriptive, Predictive analysis on numeric data
2. Implementation of central tendency models on an appropriate dataset
3. Sample case study on Types of Social Media Analytics Report
4. Sample case study on Decision making
UNIT II 12+ 9 Hours
Data mining, Text mining, Web mining, Spatial mining, Process mining, Data warehouse and datamarts. Data
mining process KDD, CRISP-DM, SEMMA and Domain-Specific, Classification and Prediction performance
measures -RSME, MAD, MAP, MAPE, Confusion matrix, Receiver Operating Characteristic curve & AUC; Validation
Techniques - hold-out, k-fold cross-validation, LOOCV, random subsampling, and bootstrapping.
Nested Cross-Validation, Stratified Cross-Validation, Time Series Cross-Validation
Practical Components
1. Measure Prediction performance with confusion matrix on sample dataset
2. Implement ROC curve and AUC
3. Implementation of K-fold cross validation for sample dataset
4. Implementation of bootstrapping with suitable datasets

UNIT III 11+ 6 Hours

Forecasting Techniques: Introduction, time-series data and components, forecasting accuracy, moving average
method, single exponential smoothing, Holt’s method, Holt-Winter model, Croston’s forecasting method,
regression model for forecasting, Auto regression models, autoregressive moving process, ARIMA, Theil’s
coefficient.
Coefficient of Variation, Shannon Diversity Index, Simpson's Diversity Index, Gini Coefficient
Practical Components
1. Implementation of various smoothing techniques on sample datasets
2. Implement Moving Average forecasting technique
3. Implement Holt-Winter forecasting technique
4. Implementation of regression for forecasting
5. Measure the Theil’s coefficient for suitable data

133
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

UNIT IV 11+ 6 Hours

Six Sigma: Introduction, origin, 3-Sigma Vs Six-Sigma process, cost of poor quality, sigma score, industry
applications, six sigma measures, DPMO, yield, sigma score, DMAIC methodology, Six Sigma toolbox
Statistical Process Control, Design of Experiments, Theory of Constraints (TOC
Practical Components
1. Illustrate difference between 3-sigma vs six-sigma process
2. Implementation of DMAIC method with suitable scenario
3. Case study on Enhancing Employee Management using Lean Six Sigma toolbox
48+32 Hours
Textbooks:

1. Jaiwei Ham and Micheline Kamber, Data Mining concepts and techniques, Kauffmann Publishers 2006
2. Efraim Turban, Ramesh Sharda, Jay E. Aronson and David King, Business Intelligence, Prentice Hall, 2008.
3. W.H.Inmon, Building the Data Warehouse, fourth edition Wiley India pvt. Ltd. 2005
4. Marc J. Schniederjans, Dara G. Schniederjans, Christopher M. Starkey, “Business Analytics Principles,
Concepts, and Applications with SAS”, Associate Publishers,2015.

References:
1. S. Christian Albright, Wayne L. Winston, “Business Analytics - Data Analysis andDecision Making”, 5th
Edition, Cengage, 2015.
2. U Dinesh Kumar, “Data Analytics”, Wiley Publications, 1st Edition, 2017.
3. Ralph Kimball and Richard Merz, The data warehouse toolkit, John Wiley, 3 rdedition,2013.
4. Michel Berry and Gordon Linoff, Mastering Data mining, John Wiley and Sons Inc,2nd Edition, 2011
5. https://machinelearningmastery.com/time-series-forecasting-methods-in-python-cheat-sheet/
6. https://leansixsigmatoolbox.com/2023/06/08/ongoing-education-lean-six-sigma-employee-
engagement/

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam
Remember 30 30 -
Understand 50 50 -
Apply 20 20 50
Analyze -- -- 50
Evaluate -- -- -
Create -- -- -
Total (%) 100 100 100
Remember
1. What is business intelligence?
2. Define predictive analysis

Understand
1. Explain the k-fold cross validation with a suitable machine learning algorithm
2. Explain forecasting techniques for time-series data

Apply
1. Illustrate difference between 3-sigma vs six-sigma process
2. Implementation of DMAIC method with suitable scenario

134
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CSC22 Web Application Developments Framework

3024

Course Outcomes
1. Understand the fundamentals of web framework.
2. Classify model, view and controller layers of a web application.
3. Design a web application using a framework.
4. Know the concept of Java web framework.
5. Understand and analyze how modern-day web applications are different from web sites.
6. Learn the technologies of Python web framework.
COs–POs Mapping
COs PO1 PO3 PO4
1 3 3 2
2 3 2 2
3 3 3 3
4 3 3 2
5 3 2 3
6 2 3 3

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT- I 10+4 Hours

Fundamentals of Web Framework
Web framework-History, Types of framework architectures, Model–view–controller (MVC), Three-tier
organization
Introduction to frameworks-Framework applications, General-purpose website frameworks-Server-side, Client-
side features
MVC, Three-tier organisation, Framework
Practical Components
1. Realization of separation of data, data fetch and representation logics
2. Realization of markup- language and it’s styling

UNIT- II 14+10 Hours

Angular – JavaScript web framework
Introduction – Angular MVC, Model, View, Controller, Ajax, Data binding
Angular concepts - Directives, Scopes, Controllers, Modules, Expressions
Developing a simple To-Do application using AngularJS (Developing a single page application)
MVC, Ajax, Data binding
Practical Components
1. Implementation of angular directives
2. Implementation of angular components
3. Implementation of custom/user-defined directive
4. Create a TODO Application using Angular JS
5. Implement routing and navigation in Angular JS

Unit III 13+12 Hours

React framework
Introduction to React: What is Full-Stack Web Development?, Node.js and NPM, Front-end JavaScript
Frameworks and Libraries Overview, Introduction to React, React App Overview, Introduction to JSX, React
Components, React Components: State and Props, React Components: Lifecycle Methods Part 1

React Router and Single Page Applications: Presentational and Container Components, React Components:
Lifecycle Methods Part 2, Functional Components, React Virtual DOM, React Router, Single Page Applications,
React Router: Parameters
React Forms, Flow Architecture and Introduction to Redux: Controlled Forms, Uncontrolled Components, The
Model-View-Controller Framework, The Flux Architecture, Introduction to Redux, React Redux Forms
Practical Components

135
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

1. React Components
2. React Router and Single page applications
3. Controlled Form Validation, Uncontrolled Forms
4. Create a TODO Application using React JS
5. Creating a movie list Application in React JS
6. Creating a Progressive web application with Reusable React Components

Unit IV 11+6 Hours

Django – Python web framework
Introduction to Django- History-Django Components-Alternate Components-MVC Architecture in Django
MVC creation in Django – Configuring Django, Creating model, view and controller in Django, REST in Django and
templates
MVC, Django, REST

Practical Components
1. Creating models for database queries
2. Writing Django template for rendering data
3. Implementation of REST API using Django

Total: 48+32 Hours

Textbook (s)
1. Angular: Up and Running, Shyam Seshadri, 1st Edition, O’Reilly, 2018
2. Struts the Complete Reference, James Holmes, 2nd Edition, Mc. Graw Hill Professional, 2006.
3. Programming with Django, Wiley Publishing
Reference (s)
1. Angular 6 for Enterprise-Ready Web Applications, Doguhan Uluca, 1st edition, 2018
2. The Definitive Guide to Django, Adrian Holovaty, Jacob Kaplan-Moss, Apress, 2009.
3. Struts 2 In Action, Donald Brown, Chad Michael Davis, Scott Stanlick, Dreamtech press, 2008.

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Assignment Test
(%)
(%)
Remember 20 10 --
Understand 50 40 --
Apply 30 30 --
Analyze -- 20 --
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 --

Sample Question (S)

Remember
1. Explain model, view and controller
2. List any 4 directives in Angular
3. List the Struts Tag Libraries.
4. Define a scope in Angular
5. Define a template in Django

Understand
1. Write a template in Django that conditionally renders data.
2. Write an example custom tag in Struts
3. Illustrate form validation in Struts.
4. Illustrate the use of ng-filter directive in AngularJS
5. Write an example snippet for ng-if directive in AngularJS
6. Differentiate between plain-validator and field-validator in Struts.
7. For a single Struts application, can we have multiple struts-config.xml files?

136
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Apply
1. Write a snippet that uses ng-for, ng-if and compare it with usage of ng-filter directives in
AngularJS
2. Write a sample code for creating a User model in Django that has the following properties:
a. Name (string)
b. Age (number
c. Email (email)
d. Phone number (number)
3. Write a sample Django template that renders the User data whose age is > 15.
4. Create an action Form bean in Struts.
5. Ilustrate the steps required for setting up validator framework in Struts

Analyze
1. What does the following code snippet in struts-config.xml do?
<exception
key="stockdataBase.error.invalidCurrencyType"
path="/AvailbleCurrency.jsp"
type="Stock.account.illegalCurrencyTypeException"
>
</exception>
2. When can global scope be used over local scope in AngularJS?
3. Why is ng-filter more preferrable than ng-if in AngularJS?
4. What happens to existing data in the database when models are edited in Django?
5. Write User and Group models with relevant attributes, where a User can be part of multiple groups.
Ensure that when a User is queried, the groups he belongs too are also part of the response.

137
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23MLC32 Cloud Services using AWS

3024

Course Outcomes
1. Comprehend different services provided AWS
2. Understand Identify and Access Management in AWS
3. Demonstrate AWS Directory services and AWS Artifact
4. Make use of Amazon Elastic Compute Cloud (EC2) to scalable computing capacity
5. Understand about Elastic File Systems and its features
6. Describe about AWS Storage Options
COs–POs Mapping
COs PO2 PO3 PO4 PO5 PO12
1 2 3 2 1 2
2 3 2 1 2 3
3 3 3 2 3 1
4 2 1 3 1 2
5 3 3 1 3 2
6 1 2 3 2 1

3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit-I 12+8 Hours
Introduction to AWS:
Classic Data Center , Virtualization, Service Comparison: AWS, Azure, and GCP, Amazon Web Services (AWS) and
its Benefits, AWS Global Infrastructure, Signup an AWS Free Tier Account.
Different Amazon Web Services, Ways to access AWS: CLI, Console, and SDKs, Explore Management Console and
Configure AWS CLI
AWS CloudShell
Practical Components
1. Signup an AWS Free Tier Account
2. Explore Management Console and configure AWS CLI
3. Access AWS: CLI, Console, and SDKs
4. Working with AWS services in AWS CloudShell

Unit-II 12+8 Hours

Identity and Access Management in AWS:
Identity and Access Management (IAM), Managing Users with IAM, Managing Permissions with Groups, IAM
Policy and its Elements, IAM Roles ,Password Policy, Best Practices for IAM
AWS Security Token Services, AWS Single Sign-on, AWS Resources Access Manager, Active directory, Microsoft
Active directory, AWS Directory Services, AWS Artifact, AWS Audit Manager, Accessing Billing and Alerts.
AWS Certificate Manager
Practical Components
1. Creating New Users, Roles, and Policies on AWS Console
2. Creating an user group for a collection of IAM users
3. Login to AWS Console via MFA
4. AWS Artifact

Unit-III 12+8 Hours

Amazon Elastic Compute Cloud (EC2):
Amazon Elastic Compute Cloud (EC2) and Its Benefits, Amazon Machine Image (AMI), Security Groups in AWS,
Authentication through Key-pair, Hardware Tenancy – Shared vs. Dedicated, Networking Layer in EC2: VPC,
Elastic Network Interface (ENI) and Its Attributes
Public IP vs. Elastic IP, Instance Store
Elastic Block Store (EBS), Its Features and Volume Types
Solid State Drive: General Purpose SSD and Provisioned IOPS
Hard Disk Drive: Throughput Optimized HDD and Cold HDD
Snapshots, Elastic File System (EFS) and Its Features, Amazon Batch, Windows File Server
Amazon FSx for Windows File Server

138
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Practical Components
1. Creating an EC2 instance and Custom AMI
2. Host the Website Inside EC2 instance
3. Create an Elastic IP and attaching an EBS Volume Externally
4. Creating a Snapshot

Unit-IV 12+8 Hours

AWS Storage Options:
Traditional Storage, Need to Move to Cloud Storage, Traditional vs. Cloud Storage Cost, Cloud Storage, Different
Storage Options Available on AWS, Simple Storage Service (S3) and Its Components, Working of S3, Bucket
Policy, Access Control List (ACL)
Cross-Region Replication (CRR) and Its Use Case, Amazon S3 Transfer Acceleration, Choice of Storage Classes on
S3, Lifecycle Policy of S3 Bucket, AWS Backup.
CDN: CloudFront, Storage Gateway
Practical Components
1. Hosting a Static Website on Amazon S3
2. Replicating Data Across Regions
3. Transfer and Retrieve Data from Glacier
4. Accessing Website Using CloudFront

48+32 Hours
Textbook(s):
1. Amazon Web Services (AWS) 2022 Everything You Need To Know About The Amazon Web Service From
Start To End, 2022, Maxwell Harris, Maxwell Harris.
2. Implementing AWS: Design, Build, and Manage your Infrastructure, Yohan Wadia, Rowan Udell, Lucas
Chan, Udita Gupta, packt publishers.

Internal Assessment Pattern

Cognitive Level Internal Test 1 Internal Test 2 Lab Examination %

% %
Remember 25 25 ---
Understand 50 25 ---
Apply 25 50 40
Analyze --- --- 20
Evaluate --- --- 40
Create
Total (%) 100 100 100

Sample Question(s)
Remember
1. List any two cloud services provided by Amazon AWS.
2. What is AWS Artifact?
3. Define EC2.
4. What is Access Control List?

Understand
1. What is Virtualization and explain about that.
2. Explain about Identity and Access Management (IAM).
3. Write and explain about AWS Directory Services.
4. Explain about Access Control List (ACL).

Apply
1. How do we sign up for an AWS Free Tier Account?
2. Illustrate the process of Move to Cloud Storage from normal storage.
3. How Cross-Region Replication (CRR) works?

139
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS007 Cloud Computing Essentials (Elective III)

3024
Course Outcomes
1. Interpret the architecture and infrastructure models of cloud computing, strengths, and limitations of
cloud computing.
2. Understand the virtualization concepts of machines and data centers.
3. Infer the design concepts of cloud ready applications
4. Compare different cloud centre’s implementation
5. Understand the concepts of cloud scaling and disaster recovery
6. Analyze the performance, scalability, and availability of the underlying cloud technologies and software
CO–PO Mapping
CO PO2 PO5 PO6 PO7 PO8
1 3 3 2 3 1
2 3 1 1 2 3
3 2 2 3 1 2
4 2 1 3 3 1
5 2 1 3 1 2
6 2 3 3 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12+6 Hours

Characterization of Distributed Systems: Introduction, Examples of Distributed Systems, Resource Sharing
and the Web, Challenges. System Models: Introduction, Architectural Models- Software Layers, System
Architecture, Variations, Interface and Objects, Design Requirements for Distributed Architectures,
Fundamental Models- Interaction Model, Failure Model, Security Model.
Communication between Distributed Objects- Object Model, Distributed Object Modal.

Practical Components:
1. Study of Cloud Computing & Architecture.
2. Install KVM/VMware Workstation for creating a virtual environment on windows platform. Concept:
Virtualization
3. Install a C compiler in the virtual machine created using virtual box and execute Simple Programs.

Unit II 12+8 Hours

Introduction to Cloud Computing
Overview of Computing Paradigm: Recent Trends in Computing, Evolution of Cloud Computing. Introduction to
Cloud Computing: Cloud Computing (NIST Model), Properties, Characteristics & Disadvantages, Role of Open
Standards. Cloud Computing Architecture: Cloud Computing Stack, Service Models (XaaS), Deployment Models.
Infrastructure as a Service (IaaS): Introduction to IaaS, Resource Virtualization. Platform as a Service (PaaS):
Introduction to PaaS, Cloud Platform and Management. Software as a Service (SaaS): Introduction to SaaS, Web
services, Web 2.0, Web OS.
Companies in the Cloud Today, Amazon Web Servies, Google services, IBM Cloud, Windows Azure, Tata Cloud,
Salesforce.com
Practical Components:
1. Install Google App Engine. Create hello world app and other simple web applications using python/java.
2. Use GAE launcher to launch the web applications.
3. Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not present in CloudSim.
4. Signup an AWS Free Tier Account and Explore Management Console and configure AWS CLI

Unit III 12+10 Hours

Virtualization & Design
Virtualization, Virtual machine, Implementation Levels of Virtualization, Virtualization Structures/Tools and
Mechanisms, Virtualization of CPU, Memory, and I/O Devices, Virtual Clusters and Resource Management, Data
140
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
centre, Virtualization for Data-Centre Automation. Service Levels for Cloud Applications Ready for the cloud:
Web Application Design, Machine Image Design, Privacy Design, Database Management.
various hypervisors like VMware, KVM, oracle VM, HTTPS,Electronic Payment

Practical Components:
1. Working on to transfer the files from one virtual machine to another virtual machine.
2. Working on to launch virtual machine using trystack (Online Openstack Demo Version)
3. Set up a pseudo-distributed, single-node Hadoop cluster backed by the Hadoop Distributed File System,
running on Ubuntu Linux. After successful installation on one node, configuration of a multi-node Hadoop
cluster(one master and multiple slaves).Hadoop file management: Adding files and directories, Retrieving
files, Deleting files
4. Run Wordcount application using Hadoop single node cluster.
5. Move files between regular Linux file-system and HDFS using put and get commands
Unit IV
Cloud Service Providers 12 + 8 Hours
EMC, EMC IT, Captiva Cloud Toolkit, Google, Cloud Platform, Cloud Storage, Google Cloud Connect, Google Cloud
Print, Google App Engine, Amazon Web Services, Amazon Elastic Compute Cloud, Amazon Simple Storage
Service, Amazon Simple Queue, service, Microsoft, Windows Azure, Microsoft Assessment and Planning Toolkit,
SharePoint, IBM, Cloud Models, IBM Smart Cloud, SAP Labs, SAP HANA Cloud Platform, Virtualization Services
Provided by SAP, Sales force, Sales Cloud.
Service Cloud: Knowledge as a Service, Rack space, VMware, Manjra soft, Aneka Platform
Practical Components:
1. Working and installation of Microsoft Azure
2. Working with Mangrasoft Aneka Software
3. Installation and Configuration of Justcloud
4. Working with AWS services in AWS CloudShell
Total: 48+32 Hours
Textbook (s)
1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems- Concepts and Design”, Fourth
Edition, Pearson Publication
2. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010
3. Cloud Computing: Principles and Paradigms, Editors: RajkumarBuyya, James Broberg, Andrzej M.
Goscinski, Wile, 2011
4. Cloud Computing: Principles, Systems and Applications, Editors: Nikos Antonopoulos, Lee Gillam,
Springer, 2012
5. Cloud Security: A Comprehensive Guide to Secure Cloud Computing, Ronald L. Krutz, Russell Dean
Vines, Wiley-India, 2010

Reference (s)
a) Michael Miller, Cloud Computing-Web Based Applications that change the way you work and
collaborate online, 1st Edition, Pearson Education, Publishing, 2011
b) Kai Hwang, Geoffrey C Fox and Jack J.Dongarra, Distributed & Cloud Computing from Parallel
Processing to the Internet of Things , 1st Edition, MK Publishing, 2010
c) David S Linthicum, Cloud Computing and SOA Convergence in Your Enterprise: A Step-by-Step Guide,
1st Edition, Addison-Wesley, 2009
d) Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather,
SubraKumaraswamy, ShahedLatif, O’Reilly, SPD, rp2011.

Internal Assessment Pattern

Cognitive Int. Test 1 Int. Test 2
Level (%) (%)
Remember 30 30

141
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Understand 40 40
Apply 30 30
Analyze -- --
Evaluate -- --
Create -- --
Total (%) 100 100

SAMPLE QUESTION (S)

Remember
1. Define Cloud Computing.
2. List types of virtualizations.
3. Define proactive scaling.
4. What is CIATriad?

Understand
1. Explain different cloud Infrastructure models.
2. Explain different levels of virtualization.
3. Explain about cloud Network security in detail.
4. Explain about Recovery Point Objective.
5. With neat diagram explain the functioning of Xen Architecture.
6. List and explain various cloud service providers risks.

Analyze
1. Compare cloud center and service infrastructure.
2. Analyze different cloud services provided by Amazon

142
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23CS008 Cryptography and Network Security (Elective III)
3024
Course Outcomes
1. Explain the fundamentals of Cryptography, encryption and decryption algorithms
2. Make use of the symmetric and public key cryptographic algorithms
3. Choose the various authentication applications for security
4. Interpret the functionalities of IP and web security.
5. Demonstrates the functionalities of firewalls
6. Explain various non-cryptographic protocol vulnerabilities
CO–PO Mapping
COs PO3 PO6 PO8
1 2 2 3
2 2 2 3
3 2 1 3
4 2 1 2
5 2 2 3
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12+10 Hours

Introduction: Security Attacks, Security Goals, Computer criminals, Methods of Defence, Security Services,
Security Mechanisms. Basics of Cryptography: Symmetric Cipher Model, Substitution Techniques,
Transportation, Techniques, Other Cipher Properties- Confusion, Diffusion, Block and Stream Ciphers. Block
Cipher Design Principles and Modes of Operations, Symmetric Key Cryptosystems: Principles of Private Key
System, Data Encryption Standard (DES), Strength of DES, Triple DES, International Data Encryption
Algorithm(IDEA), Advanced Encryption Standard (AES)
Blowfish, CAST-128.
Practical Components:
1. Write a program that contains a string (char pointer) with a value “Hello world”. The program should XOR
each character in this string with 0 and displays the result.
2. Write a program that contains a string (char pointer) with a value “Hello world”. The program should AND
or and XOR each character in this string with 127 and display the result.
3. Write a program to perform encryption and decryption using the following algorithms
a. Ceaser cipher
b. Substitution cipher
4. Write a program to perform encryption and decryption using the following algorithms
a. Mono-alphabetic cipher
b. Hill Cipher
5. Write a program to perform encryption using the following algorithms
a. Railfence Technique
b. Transposition Technique
Unit II 12+8 Hours
Public Key Cryptography: Principles of Public Key Cryptosystems, RSA Algorithm, Diffie-Hellman Key
Exchange. Cryptographic Hash Functions: Principles of Cryptographic Hash functions, Applications of
Cryptographic Hash Functions, Secure Hash Algorithm (SHA), Message Authentication Codes – Message
Authentication Requirements and Functions, HMAC, Digital Signatures, Elgamal Digital Signature Schemes
Digital Signature Standards
Practical Components:
1. Write a program to implement the Play-fair Cipher algorithm.
2. Write a program to implement the DES algorithm logic.
3. Write a program to implement the Blowfish algorithm logic.
Unit III 12+8 Hours
Authentication Applications: Kerberos, Key Management and Distribution, X.509 Directory Authentication
service, Public Key Infrastructure, Electronic Mail Security: Pretty Good Privacy, S/MIME. IP Security:
143
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Overview, Architecture, Authentication Header, Encapsulating Security Payload, Combining security
Associations, Internet Key Exchange,
Web Security: Web Security Considerations, Secure Sockets Layer and Transport Layer Security,.
HTTPS, Electronic Payment
Practical Components:
1. Write a Java program to implement RSA algorithm.
2. Calculate the message digest of a text using the SHA-1 algorithm.
3. Write a program to implement the Triple-DES algorithm logic.
4. Write a program to implement the AES algorithm logic.
Unit IV
Locking, Recovery Systems, Indexing, Different Types of Data 12 + 6 Hours
IDS and Firewalls: Intruders, Intrusion Detection, Password Management, Firewalls-Characteristics, Types of
Firewalls, Placement of Firewalls, Firewall Configuration, Trusted Systems. Non-cryptographic protocol
Vulnerabilities: DoS, DDoS, Session Hijacking and Spoofing, Software Vulnerabilities- Phishing, Buffer Overflow.
Format String Attacks, SQL InjectionCybercrime and Computer Crime, Intellectual Property.
Practical Components:
1. Implement the Diffie-Hellman Key Exchange mechanism.
2. Write a program that can encrypt and decrypt using a general substitution block cipher.
3. Write a program that can encrypt and decrypt in 4-bit in cipher clock chaining mode using DES.
Total: 48+32Hours

Textbook (s)
1. William Stallings, “Cryptography And Network Security – Principles and Practices”, 7th edition, Pearson
Education Limited 2017.
2. AtulKahate, "Cryptography and Network Security", 2nd edition Tata McGraw-Hill, 2003.
3. Behourz A Forouzan, Cryptography and Network Security, 2nd edition, Tata McGraw-Hill 2011

Reference (s)
1. Matt Bishop ,“Computer Security art and science ”, Second Edition, Pearson Education, 2002
2. Wade Trappe and Lawrence C. Washington, “Introduction to Cryptography with Coding Theory”
Second Edition, Pearson Education, 2007
3. Jonathan Katz, and Yehuda Lindell, Introduction to Modern Cryptography, CRC Press, 2007
4. Douglas R. Stinson, “Cryptography Theory and Practice”, Third Edition, Chapman & Hall/CRC, 2006
5. Wenbo Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, First Edition, 2006.
6. OWASP top ten security vulnerabilities: http://xml.coverpages.org/OWASPTopTen.pdf

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%)
Remember 30 30
Understand 40 40
Apply 30 30
Analyze -- --
Evaluate -- --
Create -- --
Total (%) 100 100

SAMPLE QUESTION (S)

Remember
1. Mention any two security attacks
2. List any two goals of security
3. Define Hash function

144
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Understand
1. Differentiate between asymmetric and symmetric key cryptography
2. How do we achieve authentication?
3. Differentiate between the two applications of hash function.

Apply
1. How do we apply PGP to the Email Security?
2. Implement firewall using iptables command.
3. Can message encryption itself provide measure of authentication?

Open Book Exam Questions

Question 1:
A man named Jones wanted to chat with his girlfriend Goldie. But he can see that all his family is around him
and even his girlfriend is also with her parents. So, he thought to send a secret message to his girlfriend. They
usually love to meet in the “Central Park”. Now Jones wants to send a message to Goldie as “Hi Goldie. How are
you. Because you are with your parents, and I am with my parents we cannot speak with each other. But I want
to meet you at our favourite place central park tomorrow after your class”. Help jones to convert the message to
unreadable format using the key of their favorite place. Also suggest him how would jones tell Goldie that the
letter is originated from Jones only.

Question 2:
You have decided to start a startup after graduation. But you alone cannot be doing this, so you have to ask help
from your friends. Suggest what techniques you require and which sort of people you would select so that your
company will be a huge success. Explain the techniques clearly to your friends and tell them what they have to
do in detail.

145
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS606 Optimization techniques for Machine Learning Lab

0 0 3 1.5
Course Outcome
1. Develop basic classification & regression ML models
2. Apply Un-constrained Optimization on non-linear programming
3. Understand the application of gradient descent algorithms.
4. Demonstrate the working of large Scale Optimization Techniques.
5. Illustrate forward and back-propagation neural network models
6. Demonstrate the application of optimization techniques on hyper parameters of DL Models

CO–PO Mapping
CO PO4 PO5
1 3 2
2 3 3
3 3 3
4 2 2
5 2 2
6 1 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Lab Manual
1. Optimization for Machine Learning Lab– AIDS Department, GMRIT.
Textbook (s)
1. "Optimization for Machine Learning" by SuvritSra, Sebastian Nowozin, and Stephen Wright
2. "Convex Optimization" by Stephen Boyd and LievenVandenberghe
3. "Numerical Optimization" by Jorge Nocedal and Stephen J. Wright
Reference (s)
1. "Stochastic Gradient Descent and Beyond" by Martin Jaggi
2. "Sparse Modeling: Theory, Algorithms, and Applications" by Irina Rish and GenadyGrabarnik
Lab Experiments
1. Implementation of Regression problem for a sample dataset
2. Implementation of Binary and Multiple-Class Classification for a sample datasets
3. Understanding and implementation of Gradient descent.
4. Solving Newton’s Method for optimization using Python programming.
5. Implementing and Interpreting Stochastic Gradient Descent
6. Solving a Linear and Non-Linear Programming problem with suitable dataset
7. Convex Optimization in Python using CVXPY and PULP
8. Illustration and implementation of Mini Batch gradient descent.
9. Implementation Elastic net Regression with L1 and L2 penalties
10. Implementing conjugate gradient method with python
11. Implementation and solution of Quasi Newton’s method for advanced optimization.
12. Illustration of Artificial Neural network and implementing MNIST dataset
13. ANN with back propagation using ReLu and Adam.
14. Implementing Convolution neural networks (cat vs dog dataset)
15. Implementing LSTM neural network for textual sentimental analysis.
16. Implement the Variational Auto-encoder in neural network.

146
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
Augmented experiments
1. Comparison of Optimization Algorithms
2. Hyper parameter Optimization
3. Regularization Techniques Comparison
4. Optimizing Neural Network Architecture
5. Large-scale Optimization for Deep Learning
6. Online Learning with Optimization
7. Optimization for Sparse Data
8. Optimization for Deep Reinforcement Learning

147
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23MPX01 Mini Project
0 0 3 1.5
Course Outcomes
1. Identify a contemporary engineering application to serve the society at large
2. Use engineering concepts and computational tools to get the desired solution
3. Justify the assembled/fabricated/developed products intended
4. Organize documents and present the project report articulating the applications of the
concepts and ideas coherently
5. Demonstrate ethical and professional attributes during the project implementation
6. Execute the project in a collaborative environment

COs – POs Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 3 2 - - - 3 2 - - - - -
2 3 3 - - 3 - - - - - - -
3 3 3 3 2 - - - - - - 2 -
4 - - - - - - - - - 3 2
5 - - - - - - - 3 - - - -
6 - - - - - - - 3 - - -
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Mini Project: The curriculum offers Mini Projects in two different forms viz: (i) Mini Project as a
mandatory component in all lab courses (ii) 2 credit Mini Project during 5th or 6th semester. With
respect to second one (ii) student will take mini project batch wise and the batches will be divided as
similar to lab courses. The report will be evaluated by a committee as nominated by CoE constituted
with internal & external panels

148
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
23ESX02 Employability Skills II
0022
Course Outcomes
1. Demonstrate oral communication and writing skills as an individual to present ideas coherently
2. Introspect & develop life skills with constructive approach
3. Assess and improve analytical skills
4. Choose appropriate Supervised Learning techniques for a given dataset
5. Apply different clustering techniques to characterize subgroups.
6. Communicate results in terms relevant to science, business etc.

COs – POs Mapping

COs PO1 PO2 PO3 PO5 PO6 PO 8 PO10 PO 12
CO1 - - - - - - 3 -
CO2 - - - - 3 - 2 2
CO3 2 - - - - 2 - -
CO4 3 - 3 2 - 2 - -
CO5 3 2 3 2 - - - 2
CO6 2 2 3 2 3 - - -
3–Strongly linked | 2–Moderately linked| 1–Weakly linked

Soft Skills:
Sl No. of
Topic & Content
No. Periods
Resume (Recap): Resume? Templates? Mistakes to be avoided in a
1. 01
Resume and Steps to be followed in preparing it.
Group Discussions (Recap) & Practice: GD? Stages of a GD, Skills
assessed in a GD, Blunders to be avoided, How to excel in a GD?
2. 01
Practice
sessions and sharing Feedback. (Screening sample Videos)
Interview Skills: Interview? Types of Interviews, Dos & Don’ts, Skills
assessed in an Interview, Mistakes to be avoided, How to equip oneself
3. to 03
excel? How to handle the Typical Interview Questions? (with
Examples)
4. Mock Interviews: Practice sessions with Feedback. 02
Exercises related to Communication: Email Writing, Voice Versant.,
5. 01
etc.
Total Periods 08

Quantitative Aptitude:
Sl.
Topic No. of Periods
No.
1. Time and Distance 01
2. Time and Distance 01
3. Problems on Trains 01
4. Problems on Trains 01
5. Blood relations 01
6. Ratio and Proportions 01
7. Calendars 01
8. Clocks 01
Total Periods 08
149
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Domain Specific:(Data Mining using WEKA)

Sl. No Topic No. of Periods
1. Classification of Data 3
General Approach to Solving Classification Problem-Decision Tree
Induction-Regression-Nearest-NeighborClassifiers-Bayesian Classifiers
2. Implement the Classification using Decision Tree Induction Algorithm. 2
(Practical)
3. Implement the Classification using Regression (Practical) 2
4. Implement the Bayesian Classification Algorithm(Practical) 1
5. Cluster analysis & Mining Complex Types of Data 4
Cluster analysis -K-means-Agglomerative Hierarchical Clustering
6. 1. Implement K-means clustering Algorithm. (Practical) 3
2. Implement Hierarchical clustering Algorithm (Practical)
Total Periods 15

Textbook (s)
1. Pang, Ning Tan, Michael Steinbach, Vipin Kumar Introduction to Data Mining, 3rd Edition, Pearson
Addison Wesley, 2016
2. Jiawei Han &MichelineKamber, Data Mining Concepts and Techniques, 3rd Edition, Morgan
Kaufmann, 2012

Reference (s)
1.Ian H. Witten, Eibe Frank, Mark A. Hall, Data Mining: Practical Machine Learning Tools and
Techniques, 3rd Edition, Morgan Kaufmann Publishers, 2011
2. Margaret H Dunham, Data Mining Introductory and advanced topics, 2nd Edition, Pearson Education,
2004
3. Arun K Pujari, Data Mining Techniques, 2nd Edition, University Press, 2099.

150
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023
AUDIT COURSE

Course Outcomes
At the end of the Audit Course the students will be able to
CO1: Interpret the meaning of values and select their goals by self- Investigation based on personal
values.
CO2: Interpret the major events and issues related to a period in Indian history.
CO3: Assess the benefits and limitations of science and its application in technological developments
towards human welfare
CO4: Check the awareness regarding basic human rights and to uphold the dignity of every individual.
CO5: Assess the individual and group behaviour and understand the implications of organizational
behaviour on the process of management.
CO6: Determine the appropriateness of various leadership styles and conflict management strategies
used in organizations.

Cos-POs Mapping:
COs PO12
CO1 3
CO2 3
CO3 3
CO4 2
CO5 3
CO6 2

151
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

7th Semester
Career Path III (ML Ops)
23MLC13 Conversational AI (Elective V)

3003
Course Outcomes
1. Understand the fundamentals & building blocks of Natural Language Processing.
2. Understand the basic Vectorization approaches.
3. Understand the basics of Conversational AI.
4. Understand the Dialog Management and Modeling.
5. Apply different rule based dialog management.
6. Make use of End-to-End Neural Dialogue Systems.

CO–PO Mapping
COs PO1 PO2 PO4 PO12 PSO1
1 3 2 1 1 1
2 2 3 1 3 1
3 3 2 2 3 2
4 2 3 1 3 3
5 1 3 2 3 3
6 1 2 3 1 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Introduction to NLP:
Definition, History, Building blocks of language, Approaches to NLP, NLP Pipeline, Deep learning in
NLP and Transformers in NLP.
Basic Vectorization approaches- One-Hot Encoding, Bag of Words, Bag of N-Gram, TF-IDF; Neural
language models, N-gram language model Sequence labeling for POS and Named Entities: POS tagging,
Named Entities tagging.

Evaluation of Named Entity Recognition, Markov chains.

Unit II 12 Hours
Introduction to Conversational AI: Introduction to AI assistants and their platforms: Types of AI
assistants and their platforms, Primary use cases for AI assistant technology: self-service assistant,
agent assist, and classification and routing.
Building your first conversational AI: Building a conversational AI for Fictitious Inc, What’s the
user’s intent and Responding to the user.
The applications of Conversational AI and Objective of Chatbots.

Unit-III 12 Hours
Dialog Management and Modelling
Introducing Dialogue Systems: Dialogue System, History, Present-day Dialogue System, Modelling
conversation in dialogue systems.
Rule-Based Dialogue Systems: A typical dialogue systems architecture and Tools for developing
dialogue systems and Evaluating Dialogue Systems
Challenges of the dialogue systems, Conversational Agents and Multimodal dialogue systems.

Unit IV 12 Hours
End-to-End Neural Dialogue Systems
Neural Network Approaches to Dialogue Modelling, A Neural Conversational Model, Introduction to
the Technology of Neural Dialogue and Open-Domain Neural Dialogue Systems.
Case Study: Chatbots in healthcare and mental health support, Voice-enabled devices and smart home
applications.
Objective of Conversational AI with Rasa and Design Principles of the Chatbot.
Total: 48 Hours

152
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)
1. Andrew R. Freed. Conversational AI: Chatbots that work, Manning; 1st edition (12 October 2021)
2. Yoav Goldberg. Neural Network Methods for Natural Language Processing, Morgan and Claypool Life
Sciences, 30 April 2017
3. Michael McTear . Conversational AI: Dialogue Systems, Conversational Agents, and Chatbots (Synthesis
Lectures on Human Language Technologies), Morgan & Claypool Publishers, 30 October 2020
4. Dan Jurafsky and James H. Martin. Speech and Language Processing (3rd ed. draft), Pearson, 22 Nov
2023.
Reference (s)
1. Xiaoquan Kong , Guan Wang . Conversational AI with Rasa by Packt., 1st edition, Oct 2021.
2. Stephan Bisser . Microsoft Conversational AI Platform for Developers End-to-End Chatbot Development
from Planning to Deployment.1st edition, 17 Feb 2021.
3. Lee Boonstra . The Definitive Guide to Conversational AI with Dialog flow and Google Cloud build
advanced enterprise chatbots, voice., 1st edition, 24 June 2021.
4. https://hao-cheng.github.io/ee596_spr2019/

Internal Assessment Pattern

Cognitive Level Int. Test 1(%) Int. Test 2 (%) Open Book Exam (%)
Remember 20 20 --
Understand 50 40 --
Apply 30 40 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. What is Natural Language Processing.
2. Define purpose of different building blocks of NLP
3. List any two challenges in NLP.
Understand
1. Explain the Spoken Language Understanding (SLU)
2. Explain the role of various Intent Classification.
Apply
1. Demonstrate the Frame-based SLU.
2. Make Use of Speech Technology in Dialogue System.
Analyze
1. Distinguish of modeling conversation in Dialogue systems.
2. Compare the Rule-Based Dialogue Systems and Evaluating Dialogue Systems.
Evaluate
1. Evaluate the End-to-End Neural Dialogue Systems.
2. Design an automated speech recognition system
Open book Question:
1. Design a model to analyse a given sentence is negative, positive or neutral for a given dataset and
build end to end system.
2. Design and develop a model to Chatbots in healthcare and mental health support.

153
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Career Path II (Full Stack Developer)

23CSC23 Web Application Databases (Elective V)

3003
Course Outcomes
At the end of the course, students will be able to
1. Understand how web-based client-server applications work.
2. Analyze architecture of various web-based applications.
3. Examine the requirements of structured and un-structured data.
4. Identify the structure of modern-day web applications.
5. Identify the use advanced querying techniques to enable faster data transfer.
6. Analyze the security issues in data transfer via the web.

CO – PO Mapping
COs PO2 PO3
1 3 3
2 3 3
3 3 3
4 3 3
5 3 3
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Syllabus
Unit I 12 Hours
Overview of Web databases
Web application Overview: Basic concepts of web, Web database architectures, Web database gateways,
Web-database programming: Client-side and server-side web database programming
Database gateways, CGI, Browser extensions

Unit II 12 Hours
Structured and unstructured Web databases
Structured databases: Structured data, Data models, Relational database management systems, MySQL –
Introduction, querying, updating and deleting data, Challenges of structured data.
Unstructured databases: Unstructured data and its usages, NoSQL databases, MongoDB- Introduction, querying,
updating and deleting data, Challenges of unstructured data- Cassandra, GraphQL
Structured data, unstructured data, Relational database, Document-based database

Unit III 12 Hours

Database connections & data operations
Connecting to database: Native database APIs, Database-independent APIs, Template-driven database access
packages, Third-party class libraries.
CRUD operations: Querying web database, User driven querying, writing to web databases – create, delete and
update.
JDBC, ODBC, template parsing.

Unit IV 12 Hours
Authentication, Authorization and Communication in web services
Web requests: Structure of web requests, JavaScript Object Notation (JSON), Request methods – GET, POST, PUT,
DELETE, response status codes
State management: Session management, cookies, request and response headers.
Security: User authentication, User authorisation, Proxy servers, Digital signatures, Digital certificates, SSL and
HTTPS.
Kafka, RabbitMQ
JSON, User authentication and authorisation
Total: 48 Hours

154
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)
1. Web Database Applications with PHP and MySQL, Hugh E. Williams, David Lane, 2nd Edition, O'Reilly, 2004.
2. NoSQL Distilled, PramodSadalage, Martin Fowler, 1st Edition, 2012

Reference (s)
1. Getting Started with NoSQL, GauravVaish, Paperback, Packt, 2013.
2. Fundamentals of Database Systems, ElmasriNavathe Pearson Education. 6th edition, 01 Jan 2013.
3. An Introduction to Database systems, C.J. Date, A.Kannan, S.SwamiNadhan, Pearson, 8th Edition.2004.
4. Web Application Security, Andrew Hoffman, O'Reilly, 2020.

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam (%)
Remember 20 20 --
Understand 30 10 --
Apply 30 30 40
Analyze 10 20 30
Evaluate 10 20 30
Create -- -- --
Total (%) 100 100 100

Sample Question(s)
Remember
1. List various database architecture layers
2. Define structured and unstructured data
3. List various database connections
Understand
1. Explain Data models
2. Explain the difference between structured and unstructured data
3. Illustrate how state management is achieved for web database requests
Apply
1. When the incoming data varies from request to request, storing and querying it appropriately is a critical
problem. Apply the concept of databases to solve this problem.
2. Give an example of a scenario that might benefit from a database that supports authorisation.
Analyze
1. Data needs to be secured from various users using authentication. How can this be achieved?
2. Compare various database connection techniques.
3. Analyze the general strategy behind state management and its importance.
Evaluate
1. Assuming the database has recognised an unusual activity, what can it do to protect the data?
2. Describe how to implement authorisation using SSL.

Open Book Exam Questions

1. Data is to be shared among various people of an organization with various roles. Data can be viewed by
anyone with proper authentication whereas only people with certain designation can update or delete data.
Write an authorization technique that can help achieve this.
2. Consider a messaging application that is built using a NoSQL database:
 Suggest a good type of NoSQL storage technique that can help improve performance
 If we use key-value based approach, what are the pitfalls of it?

155
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Career Path III (Cloud Computing)

23MLC33 Cloud Security Essentials (Elective V)
3003
Course Outcomes
1. Understand core concepts of the cloud computing paradigm
2. Learn about characteristics, advantages and challenges brought by the various models and services in cloud
computing.
3. Identify the known threats, risks, vulnerabilities and privacy issues associated with Cloud based services.
4. Understand security challenges, threats and risks involved in the cloud application
5. Anlayze the Security Requirements for the Architecture in cloud services
6. Understand Data Security and best practices involved in securing the cloud.

CO–PO Mapping
CO PO2 PO3
1 3 1
2 2 2
3 2 1
4 3 2
5 2 3
6 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Cloud Computing Software Security Fundamentals- Cloud Information Security Objectives, Cloud Security
Services, Relevant Cloud Security Design Principles,
Secure Cloud Software Requirements, Security Concerns, Risk Tolerance, Legal and Regulatory Issues

Unit II 12 Hours
Cloud Computing Risk Issues and Security Challenges:
The CIA Triad,Privacy and Compliance Risks,Threats to Infrastructure, Data, and Access Control, Cloud Service
Provider Risks, Disaster Recovery-Disaster Recovery Planning, Disasters in cloud, Cloud Disaster Management.
Security Challenges- Security Policy Implementation, Virtualization Security Management, VM Security
Recommendations, VM-Specific Security Techniques.

Unit III 12 Hours

Securing the cloud: Architecture and Data Security
Security Requirements for the Architecture, Security Patterns and Architectural Elements, Cloud Security
Architecture, Planning Key Strategies for Secure Operation.

Unit IV 12 Hours
Overview of Data Security in Cloud Computing, Data Encryption: Applications and Limits, Cloud Data Security:
Sensitive Data Categorization, Cloud Data Storage, Cloud Lock-in, Key strategies to secure the cloud, Best
practices for cloud computing, security monitoring
Total: 48 Hours
Textbook (s)
1. Russell Dean Vines and Ronald L. Krutz, Cloud Security: A Comprehensive Guide To Secure Cloud
Computing, Wiley India Pvt Ltd, 2010
2. Vic Winkler (J.R.), Securing The Cloud: Cloud Computing Security Techniques and Tactics,
Syngress/Elsevier ,2011
Reference (s)
1. Thomas Erl, Cloud Computing Design Patterns, Prentice Hall, 2015
2. Barrie Sosinsky, Cloud Computing Bible, Wiley India, 2011
3. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing: Principles and Paradigms,
Wiley, 2011

156
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Exam
Remember 50 40 -
Understand 30 40 -
Apply 20 20 50
Analyze -- -- 50
Evaluate -- -- -
Create -- -- -
Total (%) 100 100 100

Remember
1. Define Cloud Computing.
2. List Cloud Service Models
3. List Cloud Information Security Objectives
4. What is cloud foundry?
Understand
1. Identify Cloud Computing Risk Issues and Security Challenges
2. Explain the Data Security
3. Explain all session management techniques
4. Explain different cloud service models
Apply
1. Demonstrate the process for war file deployment in the cloud.
2. How does Sensitive Data Categorization happens in Cloud?
Analyze
1. Justify your answer which technique is used for Session management.
2. Deploy Security Challenges

157
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23IT010 Social Network Analysis (Elective V)

3003
Course Outcomes
At the end of the course, students will be able to
1. Acquire Knowledge to analyze Social Networks
2. Model, Aggregate and Represent Knowledge for Semantic Web
3. Use Extraction and Mining tools for Social Networks
4. Apply Reality Mining to Predict Human Behaviors for Social Communities
5. Apply various Algorithms for Evolution and Opinion Mining in Social Networks
6. Write algorithms and systems for expert location in social networks

CO – PO Mapping
COs PO2 PO4 PO5
1 2 2 3
2 2 2 3
3 2 1 3
4 2 1 2
5 2 2 3
6 2 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Syllabus
Unit I 11 Hours
Introduction
Introduction to Web, Limitations of current Web, Development of Semantic Web, Emergence of the Social Web,
Statistical Properties of Social Networks, Network analysis, Development of Social Network Analysis-Key
concepts and measures in network analysis, Discussion networks-Blogs and online communities-Web-based
networks
Case Studies of Social Network sites like Facebook-Twitter-LinkedIn etc.

Unit II 13 Hours
Evolution
Evolution in Social Networks– Framework, Tracing Smoothly Evolving Communities, Models
and Algorithms for Social Influence Analysis, Influence Related Statistics, Social Similarity and Influence,
Influence Maximization in Viral Marketing, Link Prediction in Social Networks, Feature based Link Prediction
Neurons &Social Actor-Advanced techniques in Link Prediction

Unit III 12 Hours

Mining Communities and Opinion Mining
Applications of Community Mining Algorithms, Node Classification in Social Networks
Opinion Extraction–Sentiment Classification and Clustering, Temporal Sentiment Analysis-Irony Detection in
Opinion Mining-Wish Analysis–Product Review Mining–Review Classification
Tracking Sentiments towards Topics over Time

Unit IV 12 Hours
Modelling and Visualization
Visualizing Online Social Networks, A Taxonomy of Visualizations, Graph Representation-Centrality-Clustering-
Node-Edge Diagrams-Visualizing Social Networks with Matrix-Based Representations-Node-Link Diagrams,
Hybrid Representations, Modelling and Aggregating Social Network Data, Random Walks and their Applications,
Ontological representation of Social Individuals and Relationships.
Use of Hadoop and MapReduce-Gephi 12 Hours
Total: 48 Hours
Textbook (s)
1. Charu C. Aggarwal, Social Network Data Analytics, Springer, 2011
2. Peter Mika, Social Networks and the Semantic Web, Springer, 1st Edition, 2007.
Reference (s)
1. BorkoFurht, Handbook of Social Network Technologies and Applications, Springer, 1st Edition, 2010.
2. GuandongXu, Yanchun Zhang and Lin Li, Web Mining and Social Networking, Techniques and
applications, Springer, 1st Edition, 2011.

158
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

3. Giles, Mark Smith, John Yen, Advances in Social Network Mining and Analysis, Springer,2010.
4. Ajith Abraham, Aboul Ella Hassanien, VáclavSnášel, Computational Social Network Analysis: Trends,
Tools and Research Advances, Springer, 2009.

SAMPLE QUESTION (S)

Internal Assessment Pattern
Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Comprehensive Test1 (%)
Remember 35 20 -
Understand 35 30 -
Apply 20 40 70
Analyze 10 10 20
Evaluate -- - 10
Create -- - -
Total (%) 100 100 100

Sample Question (S)

Remember
1. What are the limitations of current web?
2. List the statistical properties of social networks
3. Define social similarity.
4. What are the two different measures in influence related statistics
Understand
1. Explain about development of semantic web in research.
2. Demonstrate web based networks.
3. Illustrate the ways of visualizing social networks with matrix based representation and node – link
diagram.
4. Explain core methods of community detection and mining.
5. Explain algorithms and systems for expert location in social networks.
6. Outline the models and algorithms for social influence analysis.
Apply
1. Make use of the following graph to solve Degree Centrality, Between-ness Centrality and Cliques.

2. Solve Path, Length and Distance between nodes (i.e., Density measures) using SNA Data Processing
Tools.
3. Make use of the above graph to solve network density and cut points.
4. Develop random graphs using ErdosReini Model
5. Solve Weak Ties,Traidic closure for the following graph.

Analyse
1. Compute PageRank for the following figure.

2. Discover Spectral Clustering steps for the following graph.

1
Comprehensive test should contain only questions related to Higher Order Thinking (HOT) Skills Pertaining to this course

159
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

3. Examine the ways to visualize community’s hubs and node centrality measures using sna package.
4. Analyze positive, moderate and negative feeds using sentiment analysis on twitter data.

Open Book Exam Questions

1. Visualization of team data in Gephi-What should be my considerations?
2. How do we calculate data processing time using cloud analyst?

160
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ML001 Human Computer Interaction (Elective V)

3003
Course Outcomes
1. Demonstrate the capabilities of both humans and computers from the viewpoint of human information
processing.
2. Interpret typical human–computer interaction (HCI) models, styles, and various historic HCI paradigms.
3. Choose an interactive design process and universal design principles to designing HCI systems
4. Make use of HCI design principles, standards and guidelines.
5. Examine and identify user models, user support, socio-organizational issues, and stakeholder
requirements of HCI systems
6. Categorize and discuss HCI issues in groupware, ubiquitous computing, virtual reality, multimedia, and
Word Wide Web-related environments.
COs–POs Mapping
COs PO2 PO3
1 1 1
2 1 1
3 2 2
4 1 2
5 2 1
6 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Introduction
Importance of user Interface-definition, importance of good design, Benefits of good design, A brief history of
Screen design, The graphical user interface-popularity of graphics, the concept of direct manipulation, graphical
system, Characteristics, Web user-Interface popularity, characteristics-Principles of user interface.

Unit II 12 Hours
Design process
Human interaction with computers, importance of human characteristics human consideration, Human
interaction speeds, understanding business junctions, Screen Designing:-Design goals-Screen planning and
purpose, organizing screen elements, ordering of screen data and content-screen navigation and flow-Visually
pleasing composition amount of information-focus and emphasis-presentation information simply and
meaningfully-information retrieval on web-statistical graphics-Technological consideration in interface design.

Unit III 12 Hours

Windows
New and Navigation schemes selection of window, selection of devices based and screen based controls,
Components-text and messages, Icons and increases-Multimedia, uses problems, choosing colors.

Unit IV 12 Hours
Software tools &Interaction Devices
Specification methods, interface-Building Tools, Keyboard and function keys, pointing devices-speech
recognition digitization and generation-image and video displays-drivers.
Total: 48 Hours
Textbook (s)
1. Wilbert O Galitz, Wiley Dream Tech, The essential guide to user interface design, 3rd Edition, Wiley
Computer Publishing, 2007
2. Ben Shneidermann, Designing the user interface, 3rd Edition, Pearson Education Asia, 2008

Reference (s)
1. Alan Dix, Janet Fincay, GreGoryd, Abowd, Russell Bealg, Human Computer Interaction., 4th Edition,
Pearson Education, 2018

161
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Open Book Examination(%)
Remember 40 30 --
Understand 40 40 --
Apply 20 30 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Define Human Computer Interaction.
2. What is the basic goal of Human Computer Interaction?
3. State the long term goal of HCI
4. List the factors HCI designers must consider for User Interface Design

Understand
1. Demonstrate the HCI importance.
2. Extend the Trouble faced by human with Computers.
3. Illustrate Psychological Responses to Poor Design
4. Interpret Human-factor variables used in Comparison of pointing devices.

Apply
1. Identify the amount of Information need to Present in a page.
2. Organize the different Software tool specification methods.
3. Model out the six types interaction tasks properties of Pointing devices

Analyze
1. Distinguish the Focus and Emphasis of visual elements in web page design.
2. Categorize the Formatting of Menus.
3. Analyze organizational structure of Keyboard layouts

162
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS012 Wireless Adhoc Network (Elective-V)

3003
Course Outcomes
1. Understand the various challenging issues of wireless Adhoc networks.
2. Apply the MAC protocols using reservation and scheduling mechanisms.
3. Apply the routing protocols and transport layer protocol using various TCS mechanisms in wireless
Adhoc networks.
4. Understand the issues of MAC and network layer solution to provide quality of service.
5. Understand the significances of various battery management schemes for wireless Adhoc networks.
6. Analyze the security requirements and secure routing in wireless Adhoc networks.
COs–POs Mapping
COs PO2 PO3
1 2 3
2 3 2
3 3 3
4 2 3
5 1 3
6 2 3
3–Stronglylinked|2–Moderatelylinked|1–Weaklylinked

UNIT I 12 Hours
Wireless AdHoc Networks: Introduction, Properties, applications, limitations, Issues in AdHoc Wireless
Networks, Ad Hoc Wireless Internet. MAC Protocols: Introduction, Issues in Designing a MAC protocol for
AdHoc Wireless Networks, Design goals of a MAC Protocol for Ad Hoc Wireless Networks, Classifications of
MACProtocols, Contention-Based Protocols, Contention-Based Protocols with reservation Mechanisms.
Contention–Based MAC Protocols with Scheduling Mechanisms

UNIT II 12 Hours
Routing Protocols: Introduction, Issues in Designing a Routing Protocol for AdHoc Wireless Networks,
Classification of Routing Protocols, Proactive/ Table–Driven Routing Protocols, Reactive/ On–Demand Routing
Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols, Power – Aware Routing Protocols.
Transport Layer: Introduction, Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks,
Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks, Classification of Transport Layer
Solutions, TCP Over AdHoc Wireless Networks.
Other Transport Layer Protocol for AdHoc Wireless Networks.

UNIT III 12 Hours

Quality of Service: Introduction, Issues and Challenges in Providing QoS in AdHoc Wireless Networks,
Classification of QoS Solutions, MAC Layer Solutions, Network Layer Solutions, QoS Frameworks for Ad
HocWirelessNetworks.EnergyManagement:Introduction,NeedforEnergyManagementinAdHocWirelessNetwor
ks,ClassificationofAdHocWirelessNetworks,BatteryManagementSchemes,TransmissionPowerManagementSche
mes.
System Power Management Schemes.

UNIT IV 12 Hours
Security Protocols: Network Security Requirements, Issues and Challenges in Security Provisioning,
Network Security Attacks, Key Management, Secure Routing in AdHoc Wireless Networks.
Wireless Sensor Networks: Introduction, Sensor Network Architecture, Data Dissemination, Data Gathering,
Location Discovery.
Quality of a Sensor Network, Evolving Standards, Other Issues
Total: 48 Hours

Textbook(s)

1. AdHoc Wireless Networks: Architectures and Protocols-C.Siva Ram Murthy and B.S.Manoj,2004,PHI.
2. Wireless Ad-hoc and Sensor Networks: Protocols, Performance and Control Jagannathan Sarangapani, CRC
Press, Taylor & Francis, 1 January 2007.

163
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Reference(s)
1. Wireless Sensor Networks-C.S.Raghavendra, Krishna.M. Sivalingam, 2004, Springer.
2. Ad-HocMobileWirelessNetworks:Protocols&Systems,C.K.Toh,Firsted.PearsonEducation, 1st edition,
December 2001.

SAMPLEQUESTION(S)
Internal Assessment Pattern

Cognitive Level Int.Test1 (%) Int.Test2 (%) OBE(%)

Remember 40 50 20
Understand 35 30 20
Apply 25 20 60
Analyze -- -- --
Evaluate -- -- --
Create -- -- --
Total(%) 100 100 100

Remember
1. Find out the major significance of cellular wireless networks and Adhoc wireless networks.
2. List few latest application systems of Adhoc wireless networks.
3. Identify the challenging issues in Adhoc network configuration and maintenance.
4. Show the proactive steps to solve the hidden terminal problem.
5. List the transmission impediments of wireless channel.
6. List the issues that affect the design, deployment, and performance of adhoc wireless system.
7. List the benefits when deployment of a commercial adhoc wireless network compared to wired network.
8. Write the advantages of hybrid wireless networks.
9. Define Scalability.
10. Write the design goals of MAC protocol for ad-hoc networks.
11. Describe the issues of MAC protocol for adhoc networks in brief.
12. Show the classifications of MAC protocol.
13. Identify the effects of exposed terminal problem in wireless networks.
14. Relate the advantages of directional antennas of MMAC over MACAW.
15. Name the mechanisms used in MAC layer.
Understand
1. Summarize the issues that affect the deployment and performance of adhoc wireless system.
2. Outline the benefits when deployment of a commercial adhoc wireless networks compared to wired
network.
3. Compare Ad-hoc Networks and Wireless LAN.
4. Compare the efficiency of the packet queuing mechanism adopted in MACA and MACAW.
5. Relate contention-based protocols with reservation mechanisms and contention-based protocols with
scheduling mechanisms by means of packet delivery, reception, and acknowledgment ratio.
6. Describe the design strategies of MACAW protocol.
7. Illustrate various steps involved in five-phase reservation protocol with its frame format.
8. Compare the differences of Adhoc on-demand Distance vector routing protocol (AODV) and dynamic
sequence routing protocol (DSRP).
9. Identify any four reasons that lead to the quick power drain of nodes in mobile adhoc network.
10. Explain the sensor network architecture with a suitable illustration.
Apply
1. Calculate the maximum achievable data rate over a 9 KHz channel whose signal-to-noise ratio is 20 dB.
2. Think of four scenarios where wireless networks can replace wired networks in order to improve the
efficiency of people at their workplace. Briefly describe how in each case a wireless network will fit the
role better than a wired network.
3. Determine the transfer time of a 22 KB file with a mobile data network: (a) with a transmission rate of
10 Kbps and (b) repeat the same for 802.11 WLAN operating at 2 Mbps. (c) What is the length of the file
that WLAN can carry in the time that mobile data service carried a 20 KB file? (d) What do you infer from
the answers to the above questions?

164
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

4. Assume that in one slot in Bluetooth, 256 bits of payload could be transmitted. How many slots are
needed if the payload size is (a) 512 bits, (b) 728 bits, and (c) 1,024 bits. Assume that the non-payload
portions do not change.
5. With reference to the discussion on scatternets, illustrate the trade-off of synchronization and
bandwidth using a timing diagram. (Hint: Consider the case when a Bluetooth device acts as a master in
one piconet and as a slave in another.)
Analyze
1. Discuss the deployment scenarios for various HIPERLAN standards in the ETSI BRAN system.
2. Compare the EY-NPMA and the CSMA/CA mechanisms.
3. In serial communications, the baud rate of transmission is specified. Legacy applications on Bluetooth
devices specify the baud rate. In the case of old serial communications, the data rate is the specified baud
rate, but in the case of Bluetooth serial communications, it is not so. Why?
4. Identify and elaborate some of the important issues in pricing for multi-hop wireless communication.
5. Channel quality estimation can be done both at the sender and the receiver. Which is more
advantageous? Why?
6. Compare an adhoc network and a cellular network with respect to bandwidth usage and cost-
effectiveness.
7. Compare the pros and cons of using scheduling-based MAC protocols over reservation-based MAC
protocols.

Evaluate
1. Consider the topology given in below to simulate DSR,SSA, and ABR protocols for path establishment from
node 1 to node 10, find the paths found and the ratio of the number of Route
Requestpacketssentinthenetwork.(Linkslabeled"U"refertounstableones.)

2. Justify whether the LCC algorithm (when run consistently with node degrees or node IDs) gives a
deterministic result? If so, prove the above fact. Otherwise, give a counter-example.
3. Critique on how content-based multicasting (CBM) could be advantageous or disadvantageous as far
as the bandwidth utilization of the network is concerned.
4. Discuss how network security requirements vary in the following application scenarios of ad hoc
wireless networks:
A. Home Network
B. Classroom Network
C. Military Network
D. Emergency Search and Rescue Network
5. Discuss how security provisioning in ad hoc wireless networks differs from that in infrastructure-
based networks?

165
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS002 Data Visualization with Power BI

3003
Course Outcomes
1. Understand the fundamentals & building blocks of Data Visualization using Power BI.
2. Exemplify different Data Visualization charts and techniques.
3. Understand Data Transformation and Modeling.
4. Understand the concepts of DAX and Measures.
5. Apply different Visualization principles and techniques.
6. Make use of End-to-End Power BI Features.

CO–PO Mapping
COs PO1 PO2 PO4 PO12 PSO1
1 3 2 1 1 1
2 2 3 1 3 1
3 3 2 2 3 2
4 2 3 1 3 3
5 1 3 2 3 3
6 1 2 3 1 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Introduction to Data Visualization with Power BI 12 Hours
Introduction to Data Visualization: Overview, Basic Principles and data types, Types of Data Visualization, Tools
and Technologies, Effective Design Principles.
Introduction to Power BI: Definition, History, role in Business Intelligence, Capabilities, Building Blocks of Power
BI, Components of Power BI.
Comparison with other data visualization tools and create a semantic model.

Unit II 12 Hours
Exploring Power BI Features
Data loading and Transformation: Importing data from different data sources, Basic Transformation techniques,
Data Cleaning, Power Query for data transformation.
Data Modeling and visualization: Power BI Model Fundamentals, Star Schema Design, Analytic Queries, Data
granularity, relationships and cardinality, standard graphs and tables, Hierarchies and groups, slicers and filters.
Case Study : Analyzing a dataset using Basic Power BI Features.
Fact vs Dimension tables, Merging vs Appending tables.

Unit III
Power BI Integration and Collaboration 12 Hours
DAX and Measures: DAX- formulas, data types, functions, operators and variables, Measures – Simple measures,
compound measures, quick measures, Calculates Column vs Measures.
Integration and collaboration: Collaborative features in Power BI service, Real time dashboards, Streamline
datasets, Power BI Integration options.
Drill-downs, cross-filtering, and bookmarks.

Unit IV
Advanced Topics and Business Intelligence Solutions 12 Hours
Predictive Modeling, Power BI AI Features, DAX time intelligence functions, Model Security, Row level security,
Auditing and Monitoring power BI Usage, Performance Optimization.
Case Study: Power BI dashboard for a healthcare organization to analyze patient demographics, treatment
outcomes, and resource utilization.
Understanding OLAP (Online Analytical Processing) and multidimensional data modeling.
Total: 48 Hours

Textbook (s)
1. Greg Deckler and Brett Powell, “Microsoft Power BI Cook Book”, 2nd Edition, Packt Publisher, 2022.
Reference(s)
1. Errin O’ Connor, “Microsoft Power BI Dashboards Step by Step”, 1st Edition, Pearson Education, 2020.

166
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

SAMPLEQUESTION(S)
Internal Assessment Pattern

Cognitive Level Int.Test1 (%) Int.Test2 (%) OBE(%)

Remember 40 40 --
Understand 35 20 --
Apply 25 20 60
Analyze -- 20 40
Evaluate -- -- --
Create -- -- --
Total(%) 100 100 100

167
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS015 SOFTWARE PROJECT MANAGEMENT (Elective VI)

3003

Course Outcomes
1. Explain the concepts and issues of Software Project Management
2. Illustrate various Software Architectures
3. Classify Software Risks and Risk Management Strategies
4. Design effective software development model to meet organizational needs
5. Experiment with appropriate methodologies to develop a project schedule
6. Experiment with appropriate techniques to assess on going project performance

CO–PO Mapping
COs PO3 PO6
1 1 2
2 2 2
3 1 1
4 3 1
5 3 1
6 3 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 12 Hours
Conventional Software Management: The Waterfall Model, Conventional Software Management Performance.
Transition: The principles of conventional software Engineering, Principles of Modern software management,
transitioning to an iterative process.
Evolution of Software Economics: Software Economics, Software Cost Estimation. Improving Software
Economics: Reducing Software Product Size, Improving Software Processes, Improving Team Effectiveness,
Improving Automation, Achieving Required Quality, Peer Inspections.
Software Development Phases, Procedural vs Object Oriented Paradigm.

Unit II 12 Hours
Life Cycle Phases: Engineering and Production Stages, Inception, Elaboration, Construction, Transition Phases.
Artifacts of Software Process: The Artifact Sets, Types of Artifacts.
Software Architectures: A Management Perspective and Technical Perspective,
Workflows of the process: Software Process Workflows, Iteration Workflows.
Off-the-Shelf Components, Requirement Specification Document, Methods of Specification.

Unit III 12 Hours

Checkpoints of the Process: Major Milestones, Minor Milestones, Periodic Status Assessments.
Iterative Process Planning: Work breakdown Structures, Planning Guidelines, Cost and Schedule Estimating
process, Iteration Planning Process.
Project Organizations and Responsibilities: Line-of-Business Organizations, Project Organizations, Evolution
of Organizations.
Process Automation: Automation Building Blocks, The Project Environment.
CASE Tools for Requirements Specification, Planning and Estimation, Pragmatic Planning.

Unit IV 12 Hours
Project control and Process Instrumentation: The Seven Core Metrics, Management Indicators, Quality
Indicators, Life Cycle Expectations, Pragmatic Software Metrics, Metrics Automation, Tailoring the Process.
Future Software Project Management: Modern Project Profiles, Next Generation Software Economics,The
COCOMO Cost Estimation Model: Basic COCOMO
Bugs of testing, Bug tracking tools
Total: 48 Hours
Textbook (s)
1. Walker Royce, “Software Project Management – A Unified Framework”, 1stEdition, Pearson Education,
2005.
2. PankajJalote, “Software Project Management in Practice”, 1stEdition, Pearson Education, 2002.

168
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Reference (s)
1. Bob Hughes, “Mike Cotterell, Rajib Mall, Software Project Management”, 5thEdition, McGraw-Hill Higher
Education, 2011.
2. Joel Henry, “Software Project Management”, 1st Edition, Pearson Education, 2004.
3. Norman E. Fenton, Shari Lawrence Pfleeger, “Software Metrics: A Rigorous and Practical Approach “, 1st
Edition, PWS Publishing Company, 1997.

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Open Book Exam (%)
(%)
Remember 40 30 --
Understand 40 40 --
Apply 20 30 50
Analyze -- -- 50
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Define Software Process
2. List the phases of Software Development.
3. What is an Artifact?
4. What is Process Automation?

Understand
1. Explain various formal methods of specification.
2. Explain COCOMO II Model.
3. Explain Critical Path Methods to schedule a software project.

Apply
1. Identify the amount of Information need to present in a page.
2. Organize the different Software tool specification methods.
3. Assume that the size of an organic type software product has been estimated to be 32,000 lines of source code.
Assume that the average salary of software engineers be Rest. 15,000/- per month. Determine the effort required
to develop the software product and the nominal development time.

Open Book Questions

1. Calculate the effort and development time for the model related to your mini-project which was developed in
previous semester using COCOMO basic cost estimation model. (Take your mini-project size in KLOC)[Apply]
2. Analyze your mini-project with respect to changes using Type 0, Type 1, Type 2, Type 3 & Type 4 categories.
[ Apply ]

169
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23ML002 Reinforcement Learning (Elective VI)

Course Outcomes

The student will be able to

1. Understand the key principles and terminology in reinforcement learning
2. Understand how real-world problems can be structured as Markov Decision Processes
3. Describe the use of dynamic programming in reinforcement learning
4. Apply model-free reinforcement learning methods in reinforcement learning tasks.
5. Explain the concepts behind policy gradient methods and deep learning-based approaches in
reinforcement learning.
6. Identify various advanced reinforcement learning methods and summarize their applications in different
fields.

CO–PO Mapping
COs PO6 PO7
1 2 1
2 2 2
3 1 1
4 1 3
5 1 3
6 1 3

Unit 1: Introduction to Reinforcement Learning and Markov Decision Processes

Introduction to RL terminology: Agent, Environment, Action, State, Reward, Episode -Taxonomy of RL methods -
Reinforcement Learning Framework: Agent-environment interface, Goals and rewards. Markov Decision
Processes (MDPs): Understanding states, actions, and rewards, Episodes in RL, Markov property - Dynamics and
Returns: Transition probabilities and dynamics of MDPs, Calculation of returns.
Real world applications of reinforcement learning. 12 Hours

Unit 2: Dynamic Programming and Monte Carlo Methods

Policy and Value Functions - Bellman equations for value functions -Dynamic Programming in RL: Policy iteration
and value iteration, Limitations of dynamic programming - Monte Carlo Methods in RL: Monte Carlo Policy
Evaluation, Monte Carlo Control, Control without Exploring Starts, Importance Sampling in Policy Prediction,
Incremental Implementation, Policy Monte Carlo Control.
Eligibility Traces 12 Hours

Unit 3: Model-Free Control Methods

Temporal Difference Learning: TD learning Algorithms: TD(0) and TD(λ) algorithms. Model-Free Control
Algorithms: SARSA, Q-learning, Double Q-learning, n-step Bootstrapping methods - Exploration vs. exploitation
strategies: Exploration Strategies in RL, Exploration-exploitation trade-off.
Function approximation, hierarchical reinforcement learning 12 Hours

Unit 4: Advanced Algorithms and Strategies

Deep Reinforcement Learning: Introduction to Deep Q-Networks (DQN), Experience Replay, Target Networks -
Policy Gradient Methods: Basics of policy gradients, REINFORCE algorithm - Actor-Critic Methods: Combining
policy gradients with value functions, Actor-critic algorithms, Function Approximation in Actor-Critic - Proximal
Policy Optimization (PPO).
Policy Approximation, Multi-Agent Reinforcement Learning 12 Hours
Total: 48 Hours
Textbooks:
1. Richard S. Sutton and Andrew G. Barto, "Reinforcement Learning: An Introduction," Second Edition, The
MIT Press, 2019.
2. Marco Wiering and Martijn Van Otterlo, "Reinforcement Learning: State-of-the-Art," Adaptation,
Learning, and Optimization, Vol. 12, Springer, 2012.
3. Maxim Lapan, "Deep Reinforcement Learning Hands-On," Second Edition, Packt Publishing, 2018.

170
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Reference Books:
1. Csaba Szepesvári, "Algorithms for Reinforcement Learning," Synthesis Lectures on Artificial Intelligence
and Machine Learning, Morgan & Claypool Publishers, 2009.
2. Ian Goodfellow, Yoshua Bengio, and Aaron Courville, "Deep Learning," MIT Press, 2016.
3. Yuxi Li, "Reinforcement Learning Applications", arXiv preprint arXiv:1908.06973v1, 2019.

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) Assignment Test (%)
Remember 40 30 --
Understand 40 40 20
Apply 20 30 50
Analyze -- -- 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

171
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23SIX02 Summer Internship II

0 0 0 1.5
Course Outcomes
At the end of the summer internship students will be able to
1. Demonstrate communication skills to meet the requirement of industry
2. Develop logical thinking and analytical skills to thrive in competitive examinations
3. Use mathematical concepts to solve technical quizzes
4. Develop technical skills to work out real time problems
5. Develop algorithms for different applications
6. Solve industry defined problems using appropriate programming skills
CO–PO Mapping
COs PO1 PO2 PO5 PO6 PO10 PO12
CO1 - - - - 3 -
CO2 3 1 - - - -
CO3 3 - 3 - - 2
CO4 3 1 - - - -
CO5 3 1 3 3 - 1
CO6 3 1 3 - - 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

172
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23PWX01Project Work

0 0 16 8

Course Outcomes
At the end of the project work the students will be able to
1. Identify a contemporary engineering application to serve the society at large
2. Use engineering concepts and computational tools to get the desired solution
3. Justify the assembled/fabricated/developed products intended.
4. Organize documents and present the project report articulating the applications of the concepts and
ideas coherently
5. Demonstrate ethical and professional attributes during the project implementation.
6. Execute the project in a collaborative environment.
CO–PO Mapping
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 - - - 3 2 - - - - -
CO2 3 3 - - 3 - - - - - - -
CO3 3 3 3 2 - - - - - - 2 -
CO4 - - - - - - - - - 3 2
CO5 - - - - - - - 3 - - - -
CO6 - - - - - - - 3 - - -
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

173
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

8th Semester
23CS018 Information Retrieval Systems (Elective VIII)
0003

Course Outcomes
1. Explain the Objectives of Information Retrieval Systems and its relation to Digital Libraries and Data
warehouse
2. Illustrate various System Search Browse and Miscellaneous Capabilities
3. Explain Automatic Indexing, Information Extraction methods
4. Demonstrate Inverted file structures, N-gram data structure, and PAT data structure
5. Interpret Classical techniques of Information Retrieval, and additional techniques employed by Web search
engines
6. Learn to develop a small information retrieval system by using user search techniques and text search
Algorithms

CO–PO Mapping
COs PO1 PO2 PO3 PO4
1 3 2 2 2
2 3 2 2 2
3 2 3 1 1
4 2 3 1 1
5 2 3 1 1
6 3 3 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 11 Hours
Introduction: Definition, Objectives, Functional Overview, Relationship to DBMS, Digital libraries and Data
Warehouses.
Information Retrieval System Capabilities: Search, Browse, Miscellaneous.
Miscellaneous capabilities.

Unit II 13 Hours
Cataloging and Indexing: Objectives, Indexing Process, Automatic Indexing, Information Extraction.
Data Structures: Introduction, Stemming Algorithms, Inverted file structures, N-gram data structure,
PAT data structure, Signature file structure, Hypertext data structure.
Signature file structure, Hypertext data structure.

Unit III 12 Hours

Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural language, Concept indexing,
Hypertext linkages
Document and Term Clustering: Introduction, Thesaurus generation, Item clustering, Hierarchy of clusters.
Measurement Example-TREC Results.

Unit IV 12 Hours
User Search Techniques: Search statements and binding, Similarity measures and ranking, Relevance feedback,
Selective dissemination of information search, Searching the Internet and hypertext, Information Visualization
Text Search Algorithms: Introduction, Software text search algorithms, Hardware text search systems.
Hardware text search systems
Total: 48 Hours

Textbook (s)
1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and Implementation, Kluwer
Academic Press, 1997.
2. http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-in-information-retrieval-1.html

174
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Reference (s)
1. Frakes, W.B. and RicardoBaeza Yates, Information Retrieval Data Structures and Algorithms, 1st Edition
Prentice Hall, 1992.
2. Robert Korfhage, Information Storage & Retrieval, 1st Edition, John Wiley & Sons, 2005

Internal Assessment Pattern

Int. Test 1
Cognitive Level Int. Test 2 (%) Open Book Exam (%)
(%)
Remember 30 30 --
Understand 40 40 --
Apply 10 20 80
Analyze 20 10 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

SAMPLE QUESTION (S)

Remember
1. Define measures for IRS
2. Define PAT
3. State Browse capabilities
4. List automatic indexing
5. Recall term clustering algorithms

Understand
1. Explain Functional Overview
2. Explain Stemming algorithms
3. Summarize Brute force algorithms
4. Illustrate S/w text search Algorithms
5. Interpret standard test collection
6. Classify S/w & H/w text search system

Apply
1. Demonstrate Precision
2. Design a hybrid Indexing Data Structure
3. Use stemming Algorithms for IRS

Analyze
1. Analyze s/w and h/w indexing methods
2. Analyze search and Browse capabilities
3. Compare Pat and Stemming algorithms
4. Analyze Term clustering Algorithms

Evaluate
1. Determine which of the indexing algorithm is efficient
2. Check all automatic indexing methods for its efficiency
3. Compare S/w text search and H/w text search algorithms

175
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23CS019 Fundamentals of DevOps (Elective VIII)

0003
Course Outcomes:
1. Illustrate the need of Improvement and value of DevOps
2. Outline the Value Stream using DevOps
3. Describe the Organizational Change and transformation
4. Illustrate the Concept and Goal of Accelerate Flow
5. Outline Feedback Loops and its usage
6. Demonstrate the Concept and Goal of Learning

CO-PO Mapping:
COs PO1 PO3 PO5 PO8 PO10
1 3 3 3 3 3
2 2 2 2 2 2
3 1 2 1 1 2
4 3 2 2 1 2
5 3 3 3 3 2
6 2 3 2 1 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT I 12 Hours
Introduction to DevOps: Understanding Improvement, The Convergence, History, and Value of DevOps;
Understanding the Value Stream using DevOps: Analyzing the technology Value Stream; The ways of DevOps:
Flow, Feedback Loops, Culture of Continual Experimentation and Learning;

UNIT II 12 Hours
Value Stream in DevOps: Concept and Goals of Streams, Picking a Value Stream, Understanding Organizational
Change, Enabling Transformation;

UNIT III 13 Hours

Accelerate Flow: Concept and Goal of Accelerate Flow, Continuous Delivery Patterns and Practices, the
Deployment Pipeline, Creating Consistency in the Pipeline, Automated Testing, Deployment Strategies;
Amplifying the Feedback Loops: Concept and Goals of Feedback Loops, Creating a Service Reliability Culture,
Fast Feedback, Understanding Monitoring, Understanding Complexity

UNIT IV 11 Hours
Learning Acceleration with DevOps: Concept and Goal of Learning, Learning Organizations, Communication,
Blameless Culture;
Total: 48 Hours
Text Books:
1. Kim, G., Behr, K., and Spafford, G. (2013). The Phoenix Project: A Novel About IT, DevOps, and Helping Your
Business Win. IT Revolution Press
2. Kim, G., Humble, J., Debois, P., and Willis, J. (2016). The DevOps Handbook: How to Create World-Class
Agility, Reliability, and Security in Technology Organizations. IT Revolution Press

Reference Books:
1. Julian Fish ,The Practical Guide to Enterprise DevOps and Continuous Delivery, Addison-Wesley Professional,
February 2017.

Internal Marks Assessment:

Cognitive Level Int. Test 1(%) Int. Test 2(%) OBE Test (%)
Remember 25 25
Understand 40 30 40
Apply 20 20 30
Analyze 15 20 30
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

176
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Sample Questions
Remember
1) What is DevOps
2) Define Value Stream
3) What is Accelerate Flow
Understand
1) Explain about Ways of DevOps
2) Explain Picking Value Stream min DevOps
3) Describe Feedback Loops
Apply
1) Give Some Real Time Applications of DevOps

177
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23DS003 Cyber Security (Elective VIII)

0003
Course Outcomes
1. Explain the fundamental concepts of Cyber security
2. Demonstrate the web security and different attacks
3. Identify different network scanning and security measures
4. List out different types of Intrusion detection.
5. Model different types of Intrusion prevention systems
6. Outline different cyber-crimes, IT laws and acts.

CO–PO Mapping
COs PO1 PO3 PO4 PO5 PSO1
1 3 3 1 1 1
2 3 3 1 3 1
3 1 2 3 3 2
4 3 1 1 3 3
5 1 3 3 3 3
6 1 3 2 1 1
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I
Introduction to Cyber Security 12 Hours
What is Cyber Security, its need, cyber-threats, Cyber Warfare-Cyber Crime-Cyber terrorism-Cyber Espionage),
Career Growth, Statistics, Inferences, Need for a Comprehensive Cyber Security Policy, Classification of Cyber
Crimes, kinds of cybercrimes, Reasons for Cyber Crimes, Cyber Security Tools : Nmap, Metasploit, wireshark,
tcpdump, snort.
Cyber security awareness, social engineering, cyber stalking

Unit II
Web security 12 Hours
Same origin Policy, Cross Origin Resource Sharing, DDOS, SQL Injection, XSS, Homograph, Generating and storing
session tokens.
Networking Scanning & Security Measures:
Packet Sniffing and spoofing, Network scanning types, port scanning & its tools, and Network Architecture
Security Measures :IPtables(firewalls) , Webservers ( Nmap & Metasploit for securing webservers),
Cyber Threats and Attacks (Malware, DOS, MITM, Social engineering attacks, Spoofing, Phishing)
Cross-Site Request Forgery (XSRF/CSRF), spear phishing.

Unit III
Intrusion Detection System 12 Hours
Intruders, Intrusion Detection, Analysis Approaches, Network-Based IDS, Host-Based IDS, signature based IDS,
anomaly based IDS, advantages and disadvantages of NIDS and HIDS
Intrusion Detection Tools, snort architecture, snort rules, case studies of intrusion detection systems,Intrusion
detection exchange format.
Honeypots, different types of honeypots, benefits and dangers of honeypots
firewall vs IDS, Physical IDS, honeynet

Unit IV
Cyber Laws and Digital Forensics 12 Hours
Digital Forensics: Introduction to Digital Forensics, historical background of digital forensics, Forensic Software,
and Hardware, need for computer forensics science, special tools and techniques digital forensic life cycle,
challenges in digital forensic.
Law Perspective: Introduction to the Legal Perspectives of Cybercrimes and Cyber security, Cybercrime and the
Legal Landscape around the World, Why Do We Need Cyber laws, The Indian IT Act, Cybercrime Scenario in
India, Digital Signatures and the Indian IT Act.
Cybercrime and Punishment
Total: 48 Hours

178
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

Textbook (s)
1. Wenliang Du, Computer & Internet Security: A Hands-on Approach, (2020)
2. William Stallings, Lawrie Brown, Computer Security Principle sand Practice Third Edition,2015
3. Sunit Belapure and Nina Godbole, Cyber Security: Understanding Cyber Crimes, Computer Forensics and
Legal Perspectives, Wiley India Pvt. Ltd, 2011.
4. Nelson Phillips and Enfinger Steuart, “Computer Forensics and Investigations”, Cengage Learning, New Delhi,
6th edition 2018.

Reference (s)
1. Pande, Jeetendra. "Introduction to Cyber Security.”, (2017)
2. Pavan Duggal, Cyber frauds, cybercrimes & law in India. 21 July 2013.
3. Ali A. Ghorbani, Network intrusion detection and prevention concepts and techniques, Springer, 2010
4. Roberto Di Pietro, Luigi V. Mancini (2008), Intrusion Detection System, Springer
5. DafyddStuttard and Marcus Pinto. The Web Application Hacker's Handbook: Finding and Exploiting Security
Flaws, Wiley Publication, 2nd edition, 31 Aug 2011.

Internal Assessment Pattern

Cognitive Level Int. Test 1 (%) Int. Test 2 (%) OBE (%)
Remember 50 40 -
Understand 30 40 -
Apply 20 20 50
Analyze -- -- 50
Evaluate -- -- -
Create -- -- -
Total (%) 100 100 -

SAMPLE QUESTION (S)

Remember
1. What is cyber security?
2. Define security policy.
3. List classification in cyber security.
4. Define network scanning.
5. What is digital forensics?
Understand
1. Explain security policy for password protection.
2. Explain reasons for cyber crime.
3. Outline SQL injection attack.
4. Classify different approaches for packet filtering using firewall.
5. Explain IP Spoofing.
Apply
1. Apply IPS methods to prevent introduter.
2. Apply snort rules to detect intrusion
3. Identify open ports in a network using namp.
4. Plan to filter unauthorized packets using iptables
5. Build host based IPS.
Analyze
1. Compare and contrast iptables and snort.
2. Compare and contrast different tools to address DOS.
3. Examine different post scanning methods.
4. Distinguish nmap and metasploit.
5. Compare different tools related to digital forensics

179
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Syllabi | Academic Regulation 2023

23FIX01 Full Semester Internship (FSI)

0009
Course Outcomes

At the end of the Full Semester Internship the students are able to

1) Use the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to
the solution of complex engineering problems
2) Identify, formulate, review research literature, and analyze complex engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences
3) Select appropriate techniques, resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the limitations
4) Use ethical principles and commit to professional ethics and responsibilities and norms of the engineering
practice
5) Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary
settings
6) Communicate effectively on complex engineering activities with the engineering community and with society
at large, such as, being able to comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions

COs-POs Mapping:
COs PO1 PO2 PO5 PO8 PO9 PO10 PSO1 PSO2
CO1 3 - - - - - 3 3
CO2 - 3 - - - - 3 3
CO3 - - 3 - - - 3 3
CO4 - - - 3 - - - -
CO5 - - - - 3 - - -
CO6 - - - - - 3 - -
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

180
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors-Syllabi | Academic Regulation 2023

Minors- CSE- AI&DS

23DSM01 Fundamentals of Data Science
4004
Course Outcomes
1. Understand the pipeline of machine learning to apply on real world problems
2. Understand the need of Similarity and Dissimilarity between features in data
3. Importance of Pre-processing techniques in real-time
4. Identifying the characteristics of various Regression models in real-world
5. Identifying the characteristics of various supervised learning and ensemble models
6. Identifying the characteristics of various algorithms of unsupervised learning
COs–POs Mapping
CO PO1 PO2 PSO1 PSO2
1 3 2 1 1
2 3 2 2 2
3 2 2 2 2
4 2 3 3 2
5 2 3 3 2
6 3 3 3 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT I 15 hours

Introduction: Relation among AI, ML and Data Science, Importance of Data Science, Categorization of Data
Science Algorithms, Usecases; Data Science Process; Data Exploration: Objectives of Data Exploration,
Forms of Data (Structured, Semi Structured, Unstructured), Datasets (data objects and types of
attributes/fields), Characteristics of Datasets and corresponding Statistical Measures; Data Visualization:
Univariate Visualization, Multivariate Visualization, Visualization of Complex Data and Relations(High-
Dimensional Data)
Discriminant Analysis, LDA
UNIT II 15 hours

Data Similarity/Dissimilarity: Data Matrix, Dissimilarity Matrix, Proximity/Similarity Measures for

various types of data (nominal, ordinal, binary, numerical, etc.), Dissimilarity for Attributes of Mixed Types,
Cosine Similarity; Data Preprocessing: Preprocessing Pipeline, Forms of Preprocessing, Data Cleaning,
Data Integration, Data Reduction, Data Transformation and Discretization.

Distance based similarity (Euclidean distance, Jaccard Similarity)

UNIT III 15 hours

Regression (forecast a given numerical quantity): Linear Regression, Logistic Regression (Regression
for Classification), Regularization; Classification: Classification Principles, Classification Model Evaluation
Metrics (Confusion Matrix, ROC and AUC, Lift Covers), Classification using Decision Trees, Bayesian
Classification, Distance based Classifier(k-NN), Support Vector Machines (SVM), ANN-based Classification;
LASSO and Ridge Regression

UNIT IV 15 hours

Ensemble Learning: Conditions for Ensemble Modeling, Ensemble Techniques (Voting, Bagging, Boosting
and Random Forest); Clustering: Clustering Principles, Applications/Purpose of Clustering- Clustering for
description/preprocessing/classification, Types of Clustering, Clustering Evaluation Parameters, Clustering
Algorithms (k-Means, Agglomerative/Divisive, DBSCAN and Self Organizing Maps) and Evaluation Metrics;
Data Science Tools: Examples;

ADABoost, XGBoost Total: 60 hours

181
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors-Syllabi | Academic Regulation 2023

Textbooks:
1. Vijay Kotu&Bala Deshpande, “Data Science: Concepts and Practice”, 2nd Edition, Morgan Kaufmann
Publication, 2017.
2. Jlawei Han & Micheline Kamber, “Data Mining: Concepts and Techniques”, 3rd Edition, Morgan
Kaufmann Publishers, 2012
3. Pang-Ning Tan et al., “Introduction to Data Mining”, 2nd Edition, Pearson Publications, 2019.

References:
1. Vijay Kotu&Bala Deshpande, “Data Science: Concepts and Practice”, 2nd Edition, Morgan Kaufmann
Publication, 2017.
2. Tom M. Mitchell, "Machine Learning ",Tata McGraw Hill, 1997
3. SunilaGollapudi, “Practical Machine Learning” First Edition 2016,Packt Publishing Ltd.

Internal Assessment Pattern

Cognitive Int. Test Int. Test 2

1 (%) Assignment Test (%)
Level (%)
Remember 20 20 --
Understand 50 30 40
Apply 30 30 40
Analyze -- 20 20
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

182
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors-Syllabi | Academic Regulation 2023

23DSM02 Principles of Artificial Intelligence

4004
Course Outcomes
1. Summarize the fundamental concepts of Artificial Intelligence.
2. Understand the control strategies and production systems.
3. Illustrate the Concepts of Heuristic Search Techniques.
4. Demonstrate working knowledge of reasoning in the presence of incomplete and/or
uncertain information
5. Make use of concept of Game Playing Algorithms.
6. Outline the concept of Planning System

CO–PO Mapping
CO PO1 PO2 PO3
1 2 1 2
2 2 2 3
3 3 1 1
4 1 2 2
5 1 3 2
6 1 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

Unit I 15 Hours
Introduction

Definition, AI problems, AI techniques, Defining problem as a state space search, Production

systems-Control Strategies, Problem characteristics, Production system characteristics.
Problems – tic-tac-toe, 8-puzzle problem, Chess problem, Water Jug Problem, Missionaries and
cannibals problem, Monkey and banana problem.
Application of AI-Tower of Hanoi problem- Travelling Salesman Problem

Unit II 15 Hours
Heuristic Search Techniques
Generate-and-test, Hill climbing, Best-first-search – OR Graphs – A* Algorithm, Problem
reduction – AND-OR Graphs – AO* Algorithm, constraint satisfaction - cryptarithmetic
problem.
Depth-first search – Breadth-first search- Data abstraction

Unit III 15 Hours

Knowledge representation
Knowledge Representation Issues, Representation and mapping, Approaches to Knowledge
Representation, Frame Problem, Propositional logic, Predicate logic, Resolution, weak slot and
filler structure-semantic nets.
Filler structures-conceptual dependency-scripts

Unit IV 15 Hours
Game Playing and Planning
Mini-max search, Alpha-beta cutoffs, planning system, Block world problem, goal stack
planning, hierarchical planning, Natural language processing, syntactic processing. Decision
trees, Perception, Vision, Speech recognition.

Learning - Navigation – Manipulation - Robot Architecture

Total : 60 Hours
183
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors-Syllabi | Academic Regulation 2023

Textbook (s)
1. E. Rich K .Knight, and B. Nair, Artificial Intelligence, 3rdEdition, TMH, 1 July 2017
2. Russel Norvig, Artificial Intelligence A modern Approach, 3rd Edition, Pearson
Education, 2010

Reference (s)
1. Patrick henry Winston, Artificial Intelligence, third edition, Pearson Education
Asia, 2005
2. Dan W. Patterson, Introduction to Artificial intelligence and Expert Systems, 2nd
Edition, PHI, 2009

Internal Assessment Pattern

Cognitive Int. Test 1 Int. Test 2 Assignment Test

Level (%) (%) (%)
Remember 40 40 --
Understand 30 40 50
Apply 30 20 50
Analyze -- -- --
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

184
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors- Syllabi | Academic Regulation 2023

23DSM03 Statistics for Data Science using Python

4004

Course Outcomes
1. Understand the descriptive statics used in data science
2. Understand the basics of probability required for data science.
3. Illustrate the Concepts of probability distributions and hypothesis testing.
4. Demonstrate analysis of data with basic python libraries
5. Make use of data structures like list, dictionaries and dataframes.
6. Illustrate data visualization for some data sets using Matplotlib and Seaborn.

CO–PO Mapping
CO PO1 PO2 PO4
1 2 1 2
2 2 2 3
3 3 1 1
4 1 2 2
5 1 3 2
6 1 2 2
3–Strongly linked | 2–Moderately linked | 1–Weakly linked

UNIT-I 15 Hours
Descriptive Statistics and Basic Probability
What is Data, Measuring Data , Data science life cycle , Measures of Central Tendency:
Mean Median, Mode, Midrange, Measures of Dispersion: Range, Variance, Mean Deviation,
and Standard Deviation. Coefficient of variation: Moments, Skewness and Kurtosis.

Basics of Probability Random Experiment, Outcomes, Events, Probability, Random

variables

UNIT-II 15 Hours
Probability Distributions & Test of Hypothesis
Introduction to Probability Distributions, Mean and Variance of a Distribution, Binomial,
Poisson and Normal Distribution.

Hypothesis, Null and Alternate Hypothesis, Types of Errors: Type I and Type II, Testing of
Hypothesis,
t-test, z- test, F- test and Chi-Square Tests.

Unit-III 15 Hours
Data Analysis
Python overview: Data types, variables and basic operations. Reading from a text file, CSV
file, excel file.

Numpy : Introduction to Numpy , Numpy Array , Numpy Indexing , Numpy Operations

,Broadcasting Numpy Array.

185
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors- Syllabi | Academic Regulation 2023
Pandas : Introduction to Pandas , Series , Missing Data , Groupby, Operations , Merging, Joining
and concatenating , Missing Data , Data Input and Output.

Basic Data Structures: Lists, Dictionaries and DataFrames.

Unit IV 15 Hours
Data Visualization:
Introduction to data visualization, Matplotlib : Introduction , Matplotlib Drawing Graph
-- Histogram, Plotting, Box Plot ,scatter Plot, Bar chart, Heat maps

Seaborn: Introduction , Distribution , Categorical Plots , Matrix Plots, Regression Plots ,

Grids , Style and Colors Total : 60 hours

Textbooks

1. Gupta S.C and Kapoor V.K, Fundamentals of Mathematical Statistics, latest edition,
Sultan Chand & Sons, New Delhi, 2014.
2. Python for data science for dummies, John Paul Mueller, Luca Massaron, and Wiley

References

1. Introducing Data Science: Big Data, Machine Learning, and More, Using Python
Tools, Davy Cielen, Arno D.B. Meysman, et a1., Minning
2. Programming through Python, M. T. Savaliya, R. K. Maurya, G. M. Magar, STAREDU
Solutions

Internal Assessment Pattern

Cognitive Int. Test 1 Int. Test 2 Assignment test

Level (%) (%) (%)
Remember 40 40 --
Understand 30 40 50
Apply 30 20 50
Analyze -- -- -
Evaluate -- -- --
Create -- -- --
Total (%) 100 100 100

186
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors- Syllabi | Academic Regulation 2023
23DSM04 Deep Learning
4004

Course Outcomes
1.Illustrate the knowledge of the basic Concepts of Neural Networks.
2.Classify the various types of Learning rules.
3.Understand the concept of Single and Multi-Layer Perception.
4.Make use of different CNN models.
5.Compare different character encoding techniques.
6.Understand different Deep unsupervised models.
COs–POs Mapping
CO PO1 PO2 PO4 PO5 PO1
s 2
1 3 2 2 1 1
2 3 2 2 1 1
3 3 3 3 1 1
4 3 3 3 1 2
5 3 3 3 3 2
6 3 3 3 3 3
3–Strongly linked | 2–Moderately linked | 1–Weakly linked
Unit I 15 Hours
Introduction: Introduction to Deep Learning, Historical Trends in Deep Learning, The Neural
Network, limitations of traditional computer programs, The Mechanics of Machine Learning,
The Neuron, Expressing Linear Perceptron as Neurons, Feed-Forward Neural Networks,
Linear Neurons and Their Limitations, Types of Activation Function: Sigmoid, Tanh, ReLU,
and Softmax, learning rules
Bias, Mean, Variance, Co-Variance

Unit II 15 Hours
Single Layer Perceptron: Adaptive Filtering Problem, Unconstrained Organization
Techniques- Method of Steepest Descent, Newton’s Method, Gauss Newton Method,
Perceptron-Convergence Theorem, Relation between Perceptron, Bayes Classifier for a
Gaussian Environment
Multilayer Perceptron: Back Propagation Algorithm-Two Passes of Computation, Activation
Function,
Rate of Learning, Sequential and Batch Model of Training, Stopping Criteria, optimization
settings.
Linear Least Square Filters, Least Mean Square Algorithm, XOR Problem

Unit III 15 Hours

Convolution networks: Building blocks of CNNs, Architectures, Filters and Feature Maps,
pooling layers, Convolutions over volumes, Softmax regression, Deep Learning
frameworks, Training and testing on different distributions, Bias and Variance with
mismatched data distributions, Transfer learning, Multi-task learning, end-to-end deep
learning.
CNN models: AlexNet, VGG –16, Residual Networks, YOLO
Keras ,tensorflow, data augmentation, Batch Normalization, Dropout

187
 Department of CSE-Artificial Intelligence & Data Science, GMRIT | Minors- Syllabi | Academic Regulation 2023

Unit IV 15 Hours
Recurrent Networks

One-hot encoding of words and charcters, using word embedings, Recurrent Neural Network
Model, Vanishing gradients with RNNs, Gated Recurrent Unit (GRU) LSTM (long short term
memory), Encoder Decoder sequence to sequence architectures.
Deep Unsupervised Learning: Autoencoders, variational Autoencoders, Generative
adversarial network.

n-grams ,bag-of-words, Bi directional RNN, Exploding gradient

Total: 60 Hours
Textbook (s)

1. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow by Aurélien

Géron, October 2022: Third Edition.
2. Simon Haykin, "Neural Networks - A comprehensive foundation", Pearson Education,
2003.
3. S. N. Sivanandam, S. N. Deepa, “Principles of Soft Computing”, Willy, 3rd edition, 2019.
4. Nikhil Buduma, “Fundamentals of Deep Learning”, ORELLIY, 1st Edition, 2017.
5. Laurene Fausett, "Fundamentals of Neural Networks" , Pearson Education, 2004.
6. Bengio, Yoshua, Ian J. Goodfellow, and Aaron Courville. "Deep Learning." An MIT
Press book in preparation,2015
Reference (s)
1. Satish Kumar,”Neural Networks: A Classroom Approach” Tata McGraw Hill Education,
2004.
2. Simon Haykin, " Neural networks and Learning Machines", Prentice Hall, 2008
3. Josh Patterson and Adam Gibson ”Deep Learning A Practitioner’s Approach” O’Reilly
Media, Inc. 2017

SAMPLE QUESTION (S)

Internal Assessment Pattern

Cognitive Int. Test 1 Int. Test 2 Lab

Level (%) (%) Examination %
Remember 20 20 ---
Understand 40 40 ---
Apply 40 40 40
Analyze --- --- 40
Evaluate --- --- 20
Create --- --- ---
Total (%) 100 100 100

188