B.Tech.

CSE (AI & ML) (AI&ML) SVCE R23 Regulations

SRI VENKATESWARA COLLEGE OF ENGINEERING

(Autonomous)
Karakambadi Road, TIRUPATI – 517507

COMPUTER SCIENCE AND ENGINEERING (AI&ML)

B.Tech. – II Year I Semester

S.
Course Code Course Name Category L T P Credits
No
MA23ABS302 Discrete Mathematics and Graph BS
1 3 0 0 3
Theory
EC23AES301 Digital Logic and Computer ES
2 3 0 0 3
Organization
CS23APC301 Advanced Data Structures and PC
3 3 0 0 3
Algorithms Analysis
4 AM23APC301 Artificial Intelligence PC 3 0 0 3
CS23APC302 Object-Oriented Programming PC
5 3 0 0 3
Through JAVA
CS23APC303 Advanced Data Structures and PC
6 0 0 3 1.5
Algorithms Analysis Lab
7 AM23APC302 Artificial Intelligence Lab PC 0 0 2 1
CS23APC304 Object-Oriented Programming PC
8 0 0 3 1.5
Through JAVA Lab
9 CS23ASC302 Python Programming SC 0 1 2 2

Total 21

II Year B.Tech. CSE (AI & ML) – I Semester

L T P C
Page 1 of 20 3 0 0 3
https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

(MA23ABS302) DISCRETE MATHEMATICS AND GRAPH THEORY

COURSE OBJECTIVES:

The objective of this course are to:

 To describe logical sentences in terms of predicates, quantifiers, and
logical connectives in theory of inference for the statement calculus.
 To demonstrate the application of basic methods of discrete mathematics in
Computer Science problem solving.

COURSE OUTCOMES:
CO 1: Apply mathematical concepts and logical reasoning to solve problems in
different fields of Computer science and information technology.
CO 2: Categorize the properties of Algebraic Structures to find the given sets are
Semi group, Monoid and Groups.
CO 3: Analyze the concepts of Combinations, permutations and Binomial theorems.
CO 4: Analyze the concepts of Generating and Recurrence relations for solving
Homogeneous and In-Homogeneous equations.
CO 5: Apply Graph Theory in solving in computer science problems.

UNIT I: 9 Periods

Mathematical Logic: Introduction, Statements and Notation, Connectives, Well-formed

formulas, Tautology, Duality law, Equivalence, Implication, Normal Forms, Functionally
complete set of connectives, Inference Theory of Statement Calculus, Predicate Calculus,
Inference theory of Predicate Calculus.

UNIT II: 10 Periods

Set theory: The Principle of Inclusion- Exclusion, Pigeon hole principle and its application,
Functions, Composition of functions, Inverse Functions, Recursive Functions.
Algebraic structures: Algebraic systems-Examples and General Properties, Semi groups
and Monoids, groups, sub groups, Homomorphism, Isomorphism.

UNIT III: 9 Periods

Elementary Combinatorics: Combinations and Permutations, Enumeration of

Combinations and Permutations, Enumerating Combinations and Permutations with
Repetitions, Enumerating Permutations with Constrained Repetitions, Binomial Coefficients,
The Binomial and Multinomial theorems.

UNIT IV: 9 Periods

Recurrence Relations: Generating Functions of Sequences, Calculating Coefficients of

Generating Functions, Recurrence relations, Solving Recurrence Relations by Substitution
and Generating functions, The Method of Characteristic roots, Solutions of in homogeneous
Recurrence Relations.

UNIT V: 8 Periods

Graphs: Basic Concepts, Isomorphism and Sub-graphs, Trees and their Properties,
Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multi-graphs
and Euler Circuits, Hamiltonian Graphs.
Total Periods: 45

TEXT BOOKS:

Page 2 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to

Computer Science, Tata Mc Graw Hill, 2002.
2. Kenneth H. Rosen, Discrete Mathematics and its Applications with Combinatorics and
Graph Theory, 7th Edition, McGraw Hill Education (India) Private Limited.

REFERENCE BOOKS:

1. Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for
Computer Scientists & Mathematicians, 2nd Edition, Pearson Education.
2. Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science.

Online Learning Resources:

1. http://www.cs.yale.edu/homes/aspnes/classes/202/notes.pdf

Page 3 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

II Year B.Tech CSE (AI & ML) – I Semester

(EC23AES301) DIGITAL LOGIC AND COMPUTER ORGANIZATION L T P C

Course Objectives:
3 0 0 3
The main objective of the course is to
 Provide students with a comprehensive understanding of digital logic design principles
and computer organization fundamentals
 Describe memory hierarchy concepts
 Explain input/output (I/O) systems and their interaction with the CPU, memory, and
peripheral devices

Course Outcomes:

CO1: Understand the properties of Boolean algebra, logic operations and design of
Combinational Circuits.
CO2: Analyze & Design sequential Circuits and demonstrate an understanding of the
design of the functional units of a digital computer system.
CO3: Understand the architecture of modern computer, and also understanding of how the
computer performs arithmetic operations on positive and negative numbers.
CO4: Describe memory hierarchy concepts, including cache memory, virtual memory, and
secondary storage, and evaluate their impact on system performance and
scalability.
CO5: Understand of I/O devices communicating with Processing Unit and also knowing the
characteristics of multi processors.

UNIT I 10 Periods

Data Representation: Binary Numbers, Fixed Point Representation. Floating Point

Representation. Number base conversions, Octal and Hexadecimal Numbers, complements,
Signed binary numbers, Binary codes
Digital Logic Circuits-I: Basic Logic Functions, Logic gates, universal logic gates,
Minimization of Logic expressions. K-Map Simplification, Combinational Circuits, Decoders,
Multiplexers

UNIT II 9 Periods

Digital Logic Circuits-II: Sequential Circuits, Flip-Flops, Binary counters, Registers, Shift
Registers, Ripple counters
Basic Structure of Computers: Computer Types, Functional units, Basic operational
concepts, Bus structures, Software, Performance, multiprocessors and multi computers,
Computer Generations, Von- Neumann Architecture

UNIT III 10 Periods

Computer Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast

Adders, Multiplication of Positive Numbers, Signed-operand Multiplication, Fast
Multiplication, Integer Division, Floating-Point Numbers and Operations
Processor Organization: Fundamental Concepts, Execution of a Complete Instruction,
Multiple-Bus Organization, Hardwired Control and Multi programmed Control

UNIT IV 9 Periods

The Memory Organization: Basic Concepts, Semiconductor RAM Memories, Read-Only

Memories, Speed, Size and Cost, Cache Memories, Performance Considerations, Virtual
Memories, Memory Management Requirements, Secondary Storage

UNIT V 8 Periods

Page 4 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

Input /Output Organization: Accessing I/O Devices, Interrupts, Processor Examples,

Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces

Total Periods: 45

Textbooks:

1. Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 6th edition,

McGraw Hill, 2023.
2. Digital Design, 6th edition, M. Morris Mano, Pearson Education, 2018.
3. Computer Organization and Architecture, William Stallings, 11th edition, Pearson, 2022.

Reference Books:

1. Computer Systems Architecture, M.Moris Mano, 3rd edition, Pearson, 2017.

2. Computer Organization and Design, David A. Paterson, John L. Hennessy, Elsevier, 2004.
3. Fundamentals of Logic Design, Roth, 5th edition, Thomson, 2003.

Online Learning Resources:

https://nptel.ac.in/courses/106/103/106103068/

II Year B.Tech CSE (AI & ML) – I Semester L T P C

3 0 0 3
(CS23APC301) ADVANCED DATA STRUCTURES AND ALGORITHM
ANALYSIS

Page 5 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

COURSE OBJECTIVES:

The objective of this course is to:

● Provide knowledge on advance data structures frequently used in Computer

Science
domain
● Develop skills in algorithm design techniques popularly used
● Understand the use of various data structures in the algorithm design

COURSE OUTCOMES:

CO1: Illustrate the working of the advanced tree data structures and their
applications
CO2: Understand the Graph data structure, traversals and apply them in
various contexts.
CO3: Use various data structures in the design of algorithms
CO4: Recommend appropriate data structures based on the problem being
solved
CO5: Analyze algorithms with respect to space and time complexities
CO6: Design new algorithms.

UNIT – I: 9
periods

Introduction to Algorithm Analysis: Space and Time Complexity analysis,

Asymptotic Notations.
AVL Trees – Creation, Insertion, Deletion operations, and Applications.
Heap Trees (Priority Queues) – Min and Max Heaps, Operations and Applications

UNIT – II: 9 periods

Graphs – Terminology, Representations, Basic Search and Traversals,

Connected Components and Biconnected Components, applications
Divide and Conquer: The General Method, Quick Sort, Merge Sort, Strassen’s
Matrix multiplication, Convex Hull Problem.

UNIT – III: 9 periods

Greedy Method: General Method, Job Sequencing with deadlines, Knapsack

Problem, Minimum cost spanning trees, Single Source Shortest Paths
Dynamic Programming: General Method, All pairs shortest paths

UNIT – IV: 9 periods

Dynamic Programming: 0/1 Knapsack, String Editing, Travelling Salesperson

problem.
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem,
Graph Coloring, 0/1 Knapsack Problem

UNIT – V: 9 periods

Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling
Salesperson problem.
Introduction to NP Hard and NP Complete Problems: Basic Concepts.
Total Periods: 45

Page 6 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

TEXTBOOKS:

1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta,

Dinesh 2nd Edition Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar
Rajasekaran 2nd Edition University Press

REFERENCES:

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

ONLINE LEARNING RESOURCES:

1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html
3. Abdul Bari,1. Introduction to Algorithms (youtube.com)

II Year B.Tech. CSE (AI & ML) (AI&ML) – I Semester

L T P C
3 0 0 3
(AM23APC301) ARTIFICIAL INTELLIGENCE
(Common to ALL Branches)

Page 7 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

PRE-REQUISITE:

 Knowledge in Computer Programming.

 A course on “Mathematical Foundations of Computer Science.”
 Background in linear algebra, data structures and algorithms, and probability.

COURSE OBJECTIVES:

The objective of this course are to:

 The students should be made to study the concepts of Artificial Intelligence.

 The students should be made to learn the methods of solving problems using
Artificial Intelligence.
 The students should be made to introduce the concepts of Expert Systems.
 To understand the applications of AI, namely game playing, theorem proving, and
machine learning.
 To learn different knowledge representation techniques.

COURSE OUTCOMES:

CO 1: Understand the AI, Intelligent agents and environment.

CO 2: Apply the search strategies and concept of problem reduction.
CO 3: Understand the fundamentals of knowledge representation and reasoning.
CO 4: Apply the concepts of learning from observation.
CO 5: Analyze architecture of expert systems and language models.

UNIT I: 9 Periods

Introduction: AI problems, foundation of AI and history of AI.

Intelligent agents: Agents and Environments, the concept of rationality, the nature of
environments, structure of agents, problem-solving agents, problem formulation, Strong AI
and Weak AI.

UNIT II: 9 Periods

Searching: Searching for solutions, uninformed search strategies – Breadth-first search,

Depth-first search.
Search with partial information (Heuristic search): Hill climbing, A*, AO* Algorithms.
Problem reduction.
Game Playing: Adversarial search, Games, Mini-max algorithm, Optimal decisions in
multiplayer games, Problems in Game playing, Alpha-Beta pruning, Evaluation functions.

UNIT III: 9 Periods

Representation of Knowledge: Knowledge representation issues, predicate logic - logic

programming, semantic nets - frames and inheritance, constraint propagation, representing
knowledge using rules, rules-based deduction systems.

Reasoning under uncertainty: Review of probability, Bayes’ probabilistic inferences, and

Dempster-Shafer theory.

UNIT IV: 10 Periods

Logic concepts: First-order logic, Inference in first-order logic, Propositional vs. first-order
inference, Unification & lifts, Forward chaining, Backward chaining, Resolution.

Page 8 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

Learning from observation: Inductive learning, Decision trees, Explanation-based

learning, Statistical learning methods, Reinforcement learning.

UNIT V: 8 Periods

Expert Systems: Architecture of expert systems, Roles of expert systems – Knowledge

Acquisition, Meta knowledge, Heuristics.

Natural Language Processing: Language Models, Phrase Structure grammar, Speech

Recognition, Machine Translation.

Case Study: Chatbot, Voice Assistants.

Total Periods: 45

TEXT BOOKS
1. S. Russell and P. Norvig, “Artificial Intelligence – A Modern Approach,” Third Edition,
Pearson Education.
2. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE),” McGraw Hill.

REFERENCES:
1. David Poole, Alan Mackworth, Randy Goebel, “Computational Intelligence: A Logical
Approach,” Oxford University Press.

2. G. Luger, “Artificial Intelligence: Structures and Strategies for Complex Problem

Solving,” Fourth Edition, Pearson Education.

3. J. Nilsson, “Artificial Intelligence: A New Synthesis,” Elsevier Publishers.

4. Saroj Kaushik, “Artificial Intelligence,” CENGAGE Learning.

5. Stuart Russell, “Human Compatible: Artificial Intelligence and the Problem of

Control”.

Page 9 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

II Year B.Tech. CSE (AI & ML) – I Semester

L T P C
(CS23APC302) OBJECT ORIENTED PROGRAMMING 3 0 0 3
THROUGH JAVA

COURSE OBJECTIVES:

The objective of this course are to:

• Identify Java language components and how they work together in
Applications.
• Learn the fundamentals of object-oriented programming in Java, including
defining classes, invoking methods, using class libraries.
• Learn how to extend Java classes with inheritance and dynamic binding and how
to use exception handling in Java applications.
• Understand how to design applications with threads in Java.
• Understand how to use Java apis for program development.

COURSE OUTCOMES:

CO1: Analyze problems, design solutions using OOP principles, and implement them
efficiently in Java. (L4)
CO2: Design and implement classes to model real-world entities, with a focus on
attributes, behaviors, and relationships between objects (L4)
CO3: Demonstrate an understanding of inheritance hierarchies and
polymorphic behaviour, including method overriding and dynamic method
dispatch. (L3)
CO4: Apply Competence in handling exceptions and errors to write robust and fault-
tolerant code. (L3)
CO5: Perform file input/output operations, including reading from and writing to
files using Java I/O classes, graphical user interface (GUI)
programming using JavaFX.
CO6: Choose appropriate data structure of Java to solve a problem

UNIT I: 9 Periods

Object Oriented Programming: Basic concepts, Principles, Program Structure in Java:

Introduction, Writing Simple Java Programs, Elements or Tokens in Java Programs, Java
Statements, Command Line Arguments, User Input to Programs, Escape Sequences
Comments, Programming Style.

Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration of
Variables, Data Types, Type Casting, Scope of Variable Identifier, Literal Constants,
Symbolic Constants, Formatted Output with printf() Method, Static Variables and
Methods, Attribute Final.

Introduction to Operators, Precedence and Associativity of Operators, Assignment

Operator ( = ), Basic Arithmetic Operators, Increment (++) and Decrement (- -)
Operators, Ternary Operator, Relational Operators, Boolean Logical Operators, Bitwise
Logical Operators.

Control Statements: Introduction, if Expression, Nested if Expressions, if–else

Expressions, Ternary Operator?:, Switch Statement, Iteration Statements, while
Expression, do–while Loop, for Loop, Nested for Loop, For–Each for Loop, Break
Statement, Continue Statement.

UNIT II: 9 Periods

Page 10 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

Classes and Objects: Introduction, Class Declaration and Modifiers, Class

Members, Declaration of Class Objects, Assigning One Object to Another, Access Control
for Class Members, Accessing Private Members of Class, Constructor Methods for
Class, Overloaded Constructor Methods, Nested Classes, Final Class and Methods,
Passing Arguments by Value and by Reference, Keyword this.

Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded

Constructor Methods, Class Objects as Parameters in Methods, Access Control,
Recursive Methods, Nesting of Methods, Overriding Methods, Attributes Final and Static.

UNIT III: 9 Periods

Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in

Computer Memory, Accessing Elements of Arrays, Operations on Array Elements,
Assigning Array to Another Array, Dynamic Change of Array Size, Sorting of Arrays,
Search for Values in Arrays, Class Arrays, Two-dimensional Arrays, Arrays of Varying
Lengths, Three-dimensional Arrays, Arrays as Vectors.

Inheritance: Introduction, Process of Inheritance, Types of Inheritances,

Universal Super Class- Object Class, Inhibiting Inheritance of Class Using Final, Access
Control and Inheritance, Multilevel Inheritance, Application of Keyword Super,
Constructor Method and Inheritance, Method Overriding, Dynamic Method Dispatch,
Abstract Classes, Interfaces and Inheritance.

Interfaces: Introduction, Declaration of Interface, Implementation of Interface, Multiple

Interfaces, Nested Interfaces, Inheritance of Interfaces, Default Methods in Interfaces,
Static Methods in Interface, Functional Interfaces, Annotations.

UNIT IV: 9 Periods

Packages and Java Library: Introduction, Defining Package, Importing

Packages and Classes into Programs, Path and Class Path, Access Control,
Packages in Java SE, Java.lang Package and its Classes, Class Object,
Enumeration, class Math, Wrapper Classes, Auto-boxing and Auto- unboxing, Java
util Classes and Interfaces, Formatter Class, Random Class, Time Package, Class Instant
(java.time.Instant), Formatting for Date/Time in Java, Temporal Adjusters Class,
Temporal Adjusters Class.

Exception Handling: Introduction, Hierarchy of Standard Exception Classes,

Keywords throws and throw, try, catch, and finally Blocks, Multiple Catch
Clauses, Class Throwable, Unchecked Exceptions, Checked Exceptions.

Java I/O and File: Java I/O API, standard I/O streams, types, Byte streams, Character
streams, Scanner class, Files in Java(Text Book 2)

UNIT V: 9 Periods

String Handling in Java: Introduction, Interface Char Sequence, Class String,

Methods for Extracting Characters from Strings, Comparison, Modifying,
Searching; Class String Buffer.

Multithreaded Programming: Introduction, Need for Multiple Threads Multithreaded

Programming for Multi-core Processor, Thread Class, Main Thread- Creation of New
Threads, Thread States, Thread Priority-Synchronization, Deadlock and Race Situations,
Inter-thread Communication - Suspending, Resuming, and Stopping of Threads.

Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying text and
image, event handling, laying out nodes in scene graph, mouse events

Page 11 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

(Text Book 3)
Total Periods: 45
TEXT BOOKS:

1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.

2. Joy with JAVA, Fundamentals of Object Oriented Programming,
DebasisSamanta, MonalisaSarma, Cambridge, 2023.
3. JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.

REFERENCES:

The complete Reference Java, 11th edition, Herbert Schildt,TMH

1. Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson

ONLINE RESOURCES:

1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0128804
64547618816347shared/overview

Page 12 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

II Year B.Tech. CSE (AI & ML) – I Semester L T P C

0 0 3 1.5
(CS23APC303) ADVANCED DATA STRUCTURES AND
ALGORITHM ANALYSIS LAB

COURSE OBJECTIVES:

The objective of this course are to:

• Acquire practical skills in constructing and managing Data structures
• Apply the popular algorithm design methods in problem-solving scenarios

COURSE OUTCOMES:

CO1: Design and develop programs to solve real world problems with the popular
algorithm design methods.
CO2: Demonstrate an understanding of Non-Linear data structures by developing
implementing the operations on AVL Trees, B-Trees, Heaps and Graphs.
CO3: Critically assess the design choices and implementation strategies of algorithms
and data structures in complex applications.
CO4: Utilize appropriate data structures and algorithms to optimize solutions for specific
computational problems.
CO5: Compare the performance of different of algorithm design strategies
Design algorithms to new real world problems

EXPERIMENTS COVERING THE TOPICS:

• Operations on AVL trees, B-Trees, Heap Trees

• Graph Traversals
• Sorting techniques
• Minimum cost spanning trees
• Shortest path algorithms
• 0/1 Knapsack Problem
• Travelling Salesperson problem
• Optimal Binary Search Trees
• N-Queens Problem
• Job Sequencing

SAMPLE PROGRAMS:

1. Construct an AVL tree for a given set of elements which are stored in a file. And
implement insert and delete operation on the constructed tree. Write contents of
tree into a new file using in-order.
2. Construct Min and Max Heap using arrays, delete any element and display the
content of the Heap.
3. Implement BFT and DFT for given graph, when graph is represented by
a) Adjacency Matrix b) Adjacency Lists
4. Write a program for finding the bi-connected components in a given graph.
5. Implement Quick sort and Merge sort and observe the execution time for various
input sizes (Average, Worst and Best cases).
6. Compare the performance of Single Source Shortest Paths using Greedy method
when the graph is represented by adjacency matrix and adjacency lists.
7. Implement Job sequencing with deadlines using Greedy strategy.
8. Write a program to solve 0/1 Knapsack problem Using Dynamic
Programming.
9. Implement N-Queens Problem Using Backtracking.
10. Use Backtracking strategy to solve 0/1 Knapsack problem.
11. Implement Travelling Sales Person problem using Branch and Bound
approach.

Page 13 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

REFERENCES:

1. Fundamentals of Data Structures in C++, Horowitz Ellis, SahniSartaj, Mehta, Dinesh,

2ndEdition, Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, SartajSahni, Sanguthevar
Rajasekaran, 2nd Edition, University Press
3. Data Structures and program design in C, Robert Kruse, Pearson Education
Asia
4. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw
Hill

ONLINE LEARNING RESOURCES:

1. http://CSE (AI & ML)01-iiith.vlabs.ac.in/

2. http://peterindia.net/Algorithms.html

II Year B.Tech. CSE (AI & ML) (AI&ML) – I Semester

L T P C
0 0 2 1
(AM23APC302) ARTIFICIAL INTELLIGENCE LAB

COURSE OBJECTIVES:

Page 14 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

The objective of this course are to:

 To teach the methods of implementing algorithms using artificial intelligence
techniques
 To illustrate search algorithms
 To demonstrate the building of intelligent agents

COURSE OUTCOMES:

CO1: To analyze searching algorithms.

CO2: To solve Artificial intelligence problems
CO3: To design chatbot and virtual assistant

LIST OF EXPERIMENTS:

1. Write simple fact for the statements using PROLOG.

2. Write predicates One converts centigrade temperatures to Fahrenheit, the other
checks if a temperature is below freezing.
3. Write a program to solve the Monkey Banana problem.
4. Write a program to implement DFS and BFS
5. Write a Program to find the solution for traveling salesman Problem
6. Write a program to implement Simulated Annealing Algorithm
7. Write a program to find the solution for the wumpus world problem
8. Write a program to implement 8 puzzle problem
9. Write a program to implement Towers of Hanoi problem
10. Write a program to implement A* Algorithm
11. Write a program to implement Hill Climbing Algorithm
12. Build a Chatbot using AWS Lex, Pandora bots.
13. Build a bot that provides all the information related to your college.
14. Build a virtual assistant for Wikipedia using Wolfram Alpha and Python

Textbooks:
1. David Poole, Alan Mackworth, Randy Goebel,”Computational Intelligence: a logical
approach”, Oxford University Press, 2004.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem
solving”, Fourth Edition, Pearson Education, 2002.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers, 1998.
4. Artificial Neural Networks, B. Yagna Narayana, PHI
5. Artificial Intelligence, 2nd Edition, E.Rich and K.Knight, TMH.
6. Artificial Intelligence and Expert Systems, Patterson, PHI.

II Year B.Tech. CSE (AI & ML) – I Semester

L T P C
(CS23APC304) OBJECT ORIENTED PROGRAMMING THROUGH 0 0 3 1.5
JAVA LAB

COURSE OBJECTIVES:

Page 15 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

The objective of this course are to:

• Practice object-oriented programming in the Java programming language
• Implement Classes, Objects, Methods, Inheritance, Exception, Runtime
Polymorphism, User defined Exception handling mechanism
• Illustrate inheritance, Exception handling mechanism, JDBC connectivity
• Construct Threads, Event Handling, implement packages, Java FX GUI

COURSE OUTCOMES:

CO1: Demonstrate a solid understanding of Java syntax, including data types, control
structures, methods, classes, objects, inheritance, polymorphism, and exception
handling.
CO2: Apply fundamental OOP principles such as encapsulation, inheritance,
polymorphism, and abstraction to solve programming problems
effectively.
CO3: Familiar with commonly used Java libraries and APIs, including the
Collections Framework, Java I/O, JDBC, and other utility classes.
CO4: Develop problem-solving skills and algorithmic thinking, applying OOP
concepts to design efficient solutions to various programming challenges.
CO5: Proficiently construct graphical user interface (GUI) applications using
JavaFX
CO6: Develop new programs for solving typical computer science problems

EXPERIMENTS COVERING THE TOPICS:

● Object Oriented Programming fundamentals- data types, control structures

● Classes, methods, objects, Inheritance, polymorphism,
● Exception handling, Threads, Packages, Interfaces
● Files, I/O streams, JavaFX GUI

SAMPLE EXPERIMENTS:

EXERCISE – 1:

a) Write a JAVA program to display default value of all primitive data type of JAVA
b) Write a java program that display the roots of a quadratic equation ax2+bx=0.
Calculate the discriminate D and basing on value of D, describe the nature of root.

EXERCISE – 2

a) Write a JAVA program to search for an element in a given list of elements using
binary search mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubble
sort
c) Write a JAVA program using StringBuffer to delete, remove character.

EXERCISE – 3

a) Write a JAVA program to implement class mechanism. Create a class, methods

and invoke them inside main method.
b) Write a JAVA program implement method overloading.
c) Write a JAVA program to implement constructor. Write a JAVA program to implement
constructor overloading.

EXERCISE – 4

a) Write a JAVA program to implement Single Inheritance

b) Write a JAVA program to implement multi level Inheritance
c) Write a JAVA program for abstract class to find areas of different shapes

EXERCISE – 5

Page 16 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

a) Write a JAVA program give example for “super” keyword.

b) Write a JAVA program to implement Interface. What kind of Inheritance can be
achieved?
c) Write a JAVA program that implements Runtime polymorphism

EXERCISE – 6

a). Write a JAVA program that describes exception handling mechanism b)

Write a JAVA program Illustrating Multiple catch clauses
b). Write a JAVA program for creation of Java Built-in Exceptions
c). Write a JAVA program for creation of User Defined Exception

EXERCISE – 7

a) Write a JAVA program that creates threads by extending Thread class. First thread
display “Good Morning “every 1 sec, the second thread displays “Hello “every 2
seconds and the third display “Welcome” every 3 seconds, (Repeat the same by
implementing Runnable)
b) Write a program illustrating is Alive and join ()
c) Write a Program illustrating Daemon Threads.
d) Write a JAVA program Producer Consumer Problem

EXERCISE – 8

a) Write a JAVA program that import and use the user defined packages
b) Without writing any code, build a GUI that display text in label and image in an
ImageView (use JavaFX)
c) Build a Tip Calculator app using several JavaFX components and learn how to
respond to user interactions with the GUI

TEXTBOOKS:

1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.

2. Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis
Samanta, Monalisa Sarma, Cambridge, 2023.
3. JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th edition, Pearson.

REFERENCES BOOKS:

1. The complete Reference Java, 11th edition, Herbert Schildt,TMH

2. Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson

ONLINE RESOURCES:

1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0128804
64547

Page 17 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

L T P C
II Year B.Tech. CSE (AI & ML) – I Semester 0 1 2 2

(CS23ASC302) PYTHON PROGRAMMING

COURSE OBJECTIVES:

The objective of this course are to:

• Introduce core programming concepts of Python programming language.
• Demonstrate about Python data structures like Lists, Tuples, Sets and
dictionaries
• Implement Functions, Modules and Regular Expressions in Python
Programming and to create practical and contemporary applications using these

COURSE OUTCOMES:

CO1: Classify data structures of Python

CO2: Apply Python programming concepts to solve a variety of computational
problems
CO3: Understand the principles of object-oriented programming (OOP)
in Python, including classes, objects, inheritance, polymorphism, and
encapsulation, and apply them to design and implement Python programs
CO4: Become proficient in using commonly used Python libraries and
frameworks such as JSON, XML, NumPy, pandas
CO5: Exhibit competence in implementing and manipulating fundamental data
structures such as lists, tuples, sets, dictionaries
CO6: Propose new solutions to computational problems

UNTI-I: 9 Periods

History of Python Programming Language, Thrust Areas of Python, Installing

Anaconda Python Distribution, Installing and Using Jupyter Notebook.
Parts of Python Programming Language: Identifiers, Keywords,
Statements and Expressions, Variables, Operators, Precedence and Associativity,
Data Types, Indentation, Comments, Reading Input, Print Output, Type Conversions,
the type () Function and Is Operator, Dynamic and Strongly Typed Language.
Control Flow Statements: if statement, if-else statement, if .elif else, Nested if
statement, while Loop, for Loop, continue and break Statements, Catching
Exceptions
Using try and except Statement.

Sample Experiments:

1. Write a program to find the largest element among three Numbers.

2. Write a Program to display all prime numbers within an interval
3. Write a program to swap two numbers without using a temporary variable.
4. Demonstrate the following Operators in Python with suitable examples.
 Arithmetic Operators
 Relational Operators
 Assignment Operators
 Logical Operators
 Bit wise Operators Ternary Operator
 Membership Operators Identity Operators
5. Write a program to print multiplication table of a given number.

Page 18 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

UNIT-II: 9 Periods

Functions:Built-In Functions, Commonly Used Modules, Function Definition and Calling

the function, return Statement and void Function, Scope and Lifetime of Variables,
Default Parameters, Keyword Arguments, *args and **kwargs, Command Line
Arguments.
Strings: Creating and Storing Strings, Basic String Operations, Accessing
Characters in String by Index Number, String Slicing and Joining, String
Methods, Formatting Strings.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists.

Sample Experiments:

6. Write a program to define a function with multiple return values.

7. Write a program to define a function using default arguments.
8. Write a program to find the length of the string without using any library
functions.
9. Write a program to check if the substring is present in a given string or not.
10. Write a program to perform the given operations on a list:
i. Addition ii. Insertion iii. slicing
11. Write a program to perform any 5 built-in functions by taking any list.

UNIT-III: 9 Periods

Dictionaries: Creating Dictionary, Accessing and Modifying key : value Pairs in

Dictionaries, Built-In Functions Used on Dictionaries, Dictionary Methods, del
Statement. Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple()
Function, Indexing and Slicing in Tuples, Built-In Functions Used on Tuples,
Relation between Tuples and Lists, Relation between Tuples and
Dictionaries.

Sample Experiments:

12. Write a program to create tuples (name, age, address, college) for at least two
members and concatenate the tuples and print the concatenated tuples.
13. Write a program to count the number of vowels in a string (No control flow
allowed).
14. Write a program to sum all the items in a given dictionary.

UNIT-IV: 9 Periods

Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write
Data, Python os and os.path Modules.
Object-Oriented Programming: Classes and Objects, Creating Classes in Python,
Creating Objects in Python, Constructor Method, method overloading, constructor
overloading, classes with Multiple Objects, Inheritance,
Polymorphism.

Sample Experiments:

15. Write a program to create Classes and Objects in Python.

Page 19 of 20 https://svce.edu.in
B.Tech. CSE (AI & ML) (AI&ML) SVCE R23 Regulations

16. Write a program to implement inheritance concept.

17. Write a Python program to implement method overloading, constructor
overloading

UNIT-V: 9 Periods

Introduction to Data Science: NumPy, Pandas, Matplotlib libraries.

Sample Experiments:

18. Python Program to demonstrate NumPy arrays creation using array ()

function.
19 Python program to demonstrate use of ndim, shape, size, dtype.
20. Python programs to demonstrate different ways to create Pandas Dataframe.
21. Python programs to demonstrate various plots in matplotlib

REAL TIME PROJECT:

Dice Rolling Simulator in Python

Total Periods: 45

REFERENCES:

1. Gowrishankar S, Veena A., Introduction to Python Programming, CRC Press

1st Edition, 2018
nd
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2 Edition,
Pearson, 2024
3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson 1st
Edition 2017.

ONLINE LEARNING RESOURCES:

1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus

Page 20 of 20 https://svce.edu.in