Semester 3 Curriculum and Syllabus

R21 Curriculum, B.Tech CSE (AI & ML)

SEMESTER-3
Sl. No. Type Course No. Course Name L T P Credits
THEORY
1 BS YMT3001 Discrete Structures 3 0 0 3
2 BS YMT3002 Probability and Statistics 3 0 0 3
3 PC YCS3001 Digital Circuits and Logic Design 3 1 0 4
4 PC YCS3002 Data Structures and Algorithms 3 1 0 4
5 OE YCS3003 Object Oriented Programming 3 0 0 3
PRACTICAL
6 PC YCS3101
Digital Circuits Laboratory 0 0 3 1.5
Data Structures & Algorithms Labora-
7 PC YCS3102 0 0 3 1.5
tory
Object Oriented Programming Labora-
8 OE YCS3103 0 0 3 1.5
tory
MANDATORY NON-CGPA COURSE
9 MC YCS3501 Behavioral and Interpersonal Skills 0 0 3 0
SESSIONAL(ONLY INTERNAL EVALUATION)
10 PROJ YCS3201 Innovative Project I 0 0 3 1.5
TOTAL 15 2 15 23

Page 57 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YMT3001

Course Title Discrete Structures
Category Basic Science
LTP & Credits L T P Credits
3 0 0 3
Total Contact Hours 36
Pre-requisites None

Learning Objective:
In this course, the students will learn about the mathematical foundations of computer science.
The specific topics that would be covered include propositional calculus and proof techniques,
set theory and other derived algebraic structures, recurrence relations, and the theory of
graphs. The course will be very helpful for the students as it acts as prerequisite for various
next level courses like algorithms, automata theory, artificial intelligence, etc.

Course Outcome:
CO1: To explain the distinctive characteristics of propositional logic and its applications.

CO2: To demonstrate the applications of various proof techniques.

CO3: To explain the basic concepts of sets, relations, functions and various algebraic struc-
tures.

CO4: To understand the concept of recurrence relations and methods of solution.

CO5: To explain and analyze the concept of graphs and various graph algorithms.

Course Content:
Module 1: Propositional Logic [6L]
Introduction to Propositional Calculus: Propositions, Logical Connectives, Conjunc-
tion, Disjunction, Negation. Conditional Connectives, Implication, Converse, Contra-
positive, Inverse, Bi-conditional statements, Logical Equivalence, Tautology. Conjunc-
tive and disjunctive normal forms.

Module 2: Proof Techniques [6L]

Forward proof, proof by contradiction, contrapositive proofs, proof by mathematical
induction, proof of necessity and sufficiency.

Module 3: Sets, Relations and Functions [8L]

Operations on sets, relations and functions, binary relations, partial ordering relations,
equivalence relations. Finite and infinite seta, countable and uncountable sets. Alge-
braic structures with one binary operation: semigroups, monoids and groups. Algebraic
structures with two binary operations: rings and fields.

Module 4: Recurrence Relations [6L]

Recurrence relations: Formulation of different counting problems in terms of recurrence
relations. Solution of recurrence relations with constant coefficients by (i) iterative
method, (ii) characteristic roots method, (iii) generating functions method.

Page 58 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Module 5: Introduction to Graphs [10L]

Graphs and their basic properties: digraphs, weighted graph, connected and discon-
nected graph, bipartite graph, complement of a graph, regular graph, complete graph,
walk, path, circuit, Euler graph, cut set, cut vertices, adjacency and incidence matrices
of a graph, isomorphism. Graph coloring problem, planar graphs, trees.

Text/Reference Books:
1. C. L. Liu, “Elements of Discrete Mathematics”, Tata McGraw-Hill.

2. J-P. Tremblay and R. Manohar, “Discrete Mathematical Structures with Applications to Com-
puter Science”, McGraw-Hill Education.

3. S. K. Chakraborty and B. K. Sarkar, “Discrete Mathematics”, Oxford University Press.

4. R. Graham, D.E. Knuth and O. Patashnik, “Concrete Mathematics: A Foundation for Com-
puter Science”, Addison-Wesley.

5. N. Deo, “Graph Theory with Applications to Engineering and Computer Science”, Prentice-
Hall.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2 - - - - - - 1 1
CO2 2 1 2 - 2 1 - - - - - 1
CO3 2 3 2 2 - - - - - - 1 1
CO4 - 2 3 2 1 - - - - - - 1
CO5 1 - 2 1 1 2 - - - - 1 1

Page 59 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YMT3002

Course Title Probability and Statistics
Category Basic Science
LTP & Credits L T P Credits
3 0 0 3
Total Contact Hours 36
Pre-requisites None

Learning Objective:
In this course the students will learn about the basic knowledge of probability and statistics.
At the end of the course, the students will be able to solve different real life problems in the
field of artificial intelligence, data science etc.

Course Outcome:
CO1: To explain and demonstrate the distinctive characteristics of probability distribution.

CO2: To analyze the probability of real world uncertain phenomena by identifying proba-
bility distribution that fits the phenomena.

CO3: To explain and demonstrate the distinctive characteristics of statistics.

CO4: To apply and analyze the uses and limitations of statistical analysis.

Course Content:
Module 1: Basic Probability [3L]
Sample space and events, probability, axioms of probability, some elementary theorems,
conditional probability, Baye’s Theorem.

Module 2: Random Variable and Distribution [12L]

Discrete and continuous random variable, Probability density function and probability
mass function for single variable only, Distribution function and its properties, Defini-
tions of Expectation and Variance, properties and examples, Some important discrete
distribution: Binomial and Poisson distribution and related problems. Some important
continuous distribution: Normal, uniform and Exponential distributions and related
problems.

Module 3: Basic Statistics [9L]

Measures of central tendency, Measure of dispersion, Measure of skewness and kurtosis,
Correlation, regression and rank correlation.

Module 4: Applied Statistics [12L]

Curve fitting by the method of least squares: fitting of straight lines, second-degree
parabolas and more general curves. Sampling, Testing of hypothesis: Large sample
test for single proportion, difference of proportions, single mean, difference of means,
and difference of standard deviations. Small samples Test for single mean, difference
of means and correlation coefficients, test for ratio of variances - Chi-square test for
goodness of fit and independence of attributes.

Page 60 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Text/Reference Books:
1. E. Kreyszig, “Advanced Engineering Mathematics”, John Wiley & Sons.

2. B. S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers.

3. N. G. Das, “Statistical Methods (Combined Volume)”, Tata-McGraw Hill.

4. R. Garg and C. Prasad, “Advanced Engineering Mathematics”, Khanna Publishers.

5. S. Ross, “A First Course in Probability”, Pearson Education India.

6. W. Feller, “An Introduction to Probability Theory and its Applications, Vol. 1”, Wiley.

7. J. E. Freund and R. E. Walpole, “Mathematical Statistics”, Prentice Hall.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 1 1 1 - - - - - - 2 1
CO2 3 2 1 1 - - - - - - 1 1
CO3 3 2 2 1 - - - - - - - 1
CO4 3 2 2 1 - - - - - - 1 1

Page 61 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3001

Course Title Digital Circuits and Logic Design
Category Professional Core
LTP & Credits L T P Credits
3 1 0 4
Total Contact Hours 48
Pre-requisites None

Learning Objective:
In this course, the students will be taught about the representation of numbers in a com-
puter system, and how digital circuits can be designed using logic gates and flip-flops. Also,
the process of digital-to-analog and analog-to-digital conversion shall be covered. After the
completion of this course, the students will be in a better position to learn and understand
the basic operation of a computer system and how the various functional blocks can be im-
plemented.

Course Outcome:
CO1: To explain the binary number system, and its importance in digital circuit design.

CO2: To classify and analyze various ways of minimizing switching functions.

CO3: To understand the process of designing combinational logic circuits.

CO4: To understand the process of designing sequential logic circuit modules.

CO5: To understand and remember the process of analog-to digital and digital-to-analog
conversion.

Course Content:
Module 1: Number Systems and Binary Codes [7L]
Introduction to number systems: decimal, binary, octal, hexadecimal. Conversion from
one number system to another.
Signed number representation: sign-magnitude, 1’s complement and 2’s complement.
Addition and subtraction of numbers.
Binary codes: BCD, excess-3 code, Gray code.

Module 2: Logic Families and Minimization of Switching Functions [10L]

Logic gates and their functionalities.
Logic families: TTL, nMOS, CMOS, pass transistor logic. Realization of gates.
Boolean algebra, truth tables and switching functions. Minimization of completely
and incompletely specified switching functions: Karnaugh Map and Quine-McCluskey
methods.

Module 3: Combinational Logic Circuits [9L]

Realization of Boolean functions using NAND/NOR gates.
Half-adder, full-adder and ripple-carry adder/subtractor.
Decoders, Encoders and Multiplexers: applications in logic design.

Module 4: Sequential Logic Circuits [9L]

Clocks, flip-flops and latches.

Page 62 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Types of flip-flops: SR, D, JK, T; Edge-triggered and master-slave flip-flops.

State table and state diagram, state minimization, synthesis of finite state machines
(FSMs).

Module 5: Counters and Registers [6L]

Synchronous and asynchronous counters, up/down counters. Applications of counters.
Registers: parallel-in parallel-out and shift registers, linear feedback shift register
(LFSR).
Applications of registers in data paths.

Module 6: D/A and A/D Conversion Techniques [7L]

Boolean algebra, truth tables and switching functions. Minimization of completely
and incompletely specified switching functions: Karnaugh Map and Quine-McCluskey
methods.
Digital-to-analog converters: principle of operation, weighted resistor and resistive lad-
der D/A converters.
Analog-to-digital converters: resolution and accuracy. Types of A/D converters: flash
type, counter type, successive-approximation type.

Text/Reference Books:
1. Z. Kohavi and N. K. Jha, “Switching and Finite Automata Theory (3rd Ed.)”, Cambridge
University Press.

2. M. Morris Mano, “Digital Design (3rd Ed.)”, Pearson.

3. G. De Micheli, “Synthesis and Optimization of Digital Circuits”, Tata-McGraw-Hill.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 - - 2 - - 2 - 1 2
CO2 1 3 3 - - 2 - - 2 - 1 1
CO3 2 2 2 1 2 2 - - 2 - 1 2
CO4 2 2 2 1 2 2 - - 2 - 1 1
CO5 2 2 2 - 1 2 - - 2 - 1 2

Page 63 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3002

Course Title Data Structures and Algorithms
Category Professional Core
LTP & Credits L T P Credits
3 1 0 4
Total Contact Hours 48
Pre-requisites Fundamentals of Programming

Learning Objective:
In this course, the students will be taught about the significance of non-linear data structures
with respect to the access and organization of data, various algorithmic approaches to write
programs to solve problems in different engineering domains by using different data structures,
merits and demerits of altered algorithms in terms of time-complexity.

Course Outcome:
CO1: To differentiate how the choices of data structure and algorithm methods impact the
performance of program.

CO2: To solve problems based upon different data structure and also write programs.

CO3: To identify appropriate data structure and algorithmic methods in solving problem.

CO4: To discuss the computational efficiency of the principal algorithms for sorting, search-
ing, and hashing.

CO5: To compare and contrast the benefits of dynamic and static data structures imple-
mentations.

Course Content:
Module 1: Introduction of Data Structure [11L]
Concepts of data structures, Abstract Data Type.
Algorithms and programs, basic idea of pseudo-code, Properties of an algorithm.
Algorithm efficiency and analysis, time and space analysis of algorithms – order nota-
tions.
Array: Different representations – row major, column major.
Sparse matrix − its implementation and usage, Array representation of polynomials.
Linked List: Singly linked list – operations, Doubly linked list – operations.
Circular linked list – operations, Linked list representation of polynomial and applica-
tions.
Binary codes: BCD, excess-3 code, Gray code.
Module 2: Linear Data Structure [10L]
Stack and its implementations (using array and linked list).
Applications (Infix, Prefix, and Postfix with their conversions, Postfix Evaluation).
Queue, circular queue, de-queue.
Implementation of queue- linear and circular (using array and linked list).
Recursion:Principles of recursion - use of stack, tail recursion.
Applications - The Tower of Hanoi, Eight-queen problem.

Page 64 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Module 3: Nonlinear Data Structure [18L]

Trees: Basic terminologies, forest, tree representation (using array and linked list).
Binary trees - binary tree traversal (pre-, in-, post- order).
Threaded binary tree – operations.
Binary search tree- operations (creation, insertion, deletion, searching).
Concept of Max-Heap and Min-Heap (creation, deletion).
Height balanced binary tree – AVL tree (insertion, deletion with examples only).
Graph traversal and connectivity – Depth-first search (DFS), Breadth-first search (BFS)
– concepts of edges used in DFS and BFS (tree-edge, back-edge, cross-edge, and
forward-edge). Minimal spanning tree – Prim’s algorithm, Kruskal’s algorithm (ba-
sic idea of greedy methods).
Module 4: Searching and Sorting [9L]
Sorting Algorithms: Bubble sort, Insertion sort, Selection sort – with notion of com-
plexity.
Quick sort, Merge sort – with complexity, Radix sort – with complexity.
Searching: Sequential search, Binary search, Interpolation Search– with complexity.
Hashing: Hashing functions, Collision resolution techniques.
Text/Reference Books:
1. E. Horowitz, S. Sahni and S. Anderson-Freed, “Fundamentals of Data Structures of C”, Uni-
versities Press.

2. S. Lipschutz, “Data Structures”, Tata McGraw Hill Education (India) Private Limited.

3. A. M. Tanenbaum, “Data Structures in C”, Pearson.

4. R. Thareja, “Data Structures Using C”, Oxford.

5. A.K. Rath, A. K. Jagadev, “Data Structure Using C”, Scitech Publications.

6. T. H. Coreman, “Introduction to Algorithms”, MIT Press.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 3 - - - - 3 - 2
CO2 2 2 1 2 1 2 3 2 2 - - 2
CO3 2 2 1 2 1 2 - 2 3 - 2
CO4 2 1 2 2 1 2 - - - - - 2
CO5 3 2 2 2 1 3 - - - - - 2

Page 65 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3003

Course Title Object Oriented Programming
Category Open Elective
LTP & Credits L T P Credits
3 0 0 3
Total Contact Hours 36
Pre-requisites Fundamentals of Programming

Learning Objective:
This course introduces the student to the concepts of C++ in computer science. The course
will allow the students to acquire knowledge to make functions, files with emphasis on different
object oriented paradigm used in C++.

Course Outcome:
CO1: To study the process of interaction between objects, classes and functions.

CO2: To acquire basic knowledge of Object Orientation with different properties.

CO3: To analyze various string handling functions with various I/O operations.

CO4: To remember basic code reusability feature with respect to Inheritance.

Course Content:
Module 1: C++ Introduction [8L]
Introduction to C++ and object-oriented concepts, C++ Standard Library, Basics
of a Typical C++ Environment, Pre-processors Directives, illustrative C++ programs.
Header Files and Namespaces, library files. Introduction to objects and object-oriented
programming, Encapsulation (Information Hiding), Access Modifiers: Controlling ac-
cess to a class, method, or variable (public, protected, private, package), Other Modi-
fiers, Polymorphism: Overloading, Inheritance, Overriding Methods, Abstract Classes,
Reusability, Class’ behaviors.

Module 2: Classes and Data Abstraction [7L]

Introduction, Structure Definitions, Accessing Members of Structures, Class Scope and
accessing Class Members, Separating Interface from Implementation, Controlling Ac-
cess Function And Utility Functions, Initializing Class Objects: Constructors, Using
Default Arguments With Constructors, Using Destructors, Classes : Const(Constant)
Object And Const Member Functions, Object as Member of Classes, Friend Func-
tion and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New
and Delete, Static Class Members, Container Classes And Integrators, Proxy Classes,
Function overloading.

Module 3: Inheritance and Polymorphism [9L]

Operator Overloading, Inheritance, and Virtual Functions and Polymorphism: Funda-
mentals of Operator Overloading, Restrictions On Operators Overloading, Operator
Functions as Class Members vs. as Friend Functions, Overloading, ¡¡, ¿¿ Overload-
ing Unary Operators, Overloading Binary Operators. Introduction to Inheritance,
Base Classes And Derived Classes, Protected Members, Casting Base-Class Pointers
to Derived-Class Pointers, Using Member Functions, Overriding Base–Class Members

Page 66 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

in a Derived Class, Public, Protected and Private Inheritance, Using Constructors and
Destructors in derived Classes, Implicit Derived–Class Object To Base- Class Object
Conversion, Composition Vs. Inheritance. Introduction to Virtual Functions, Abstract
Base Classes and Concrete Classes, Polymorphism, New Classes and Dynamic Binding,
Virtual Destructors, Polymorphism, Dynamic Binding.

Module 4: Files and I/O Streams and Templates [6L]

Files and Streams, Creating a Sequential Access File, Reading Data From A Sequen-
tial Access File, Updating Sequential Access Files, Random Access Files, Creating A
Random Access File, Writing Data Randomly To a Random Access File, Reading Data
Sequentially from a Random Access File. Stream Input/Output Classes and Objects,
Stream Output, Stream Input, Unformatted I/O (with read and write), Stream Manip-
ulators, Stream Format States, Stream Error States. Function Templates, Overloading
Template Functions, Class Template, Class Templates and Non-Type Parameters, Tem-
plates and Inheritance, Templates and Friends, Templates and Static Members.

Module 5: Exception Handling [6L]

Introduction, Basics of C++ Exception Handling: Try Throw, Catch, Throwing an
Exception, Catching an Exception, Rethrowing an Exception, Exception specifications,
Processing Unexpected Exceptions, Stack Unwinding, Constructors, Destructors and
Exception Handling, Exceptions and Inheritance.

Text/Reference Books:
1. H. M. Deitel, “Instructor’s Manual: C++ how to Program”, Prentice Hall.

2. S. Lipschutz, “Data Structures”, Tata McGraw Hill Education (India) Private Limited.

3. E. Balagurusamy, “Object-Oriented Programming with C++”, Tata McGraw-Hill.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 2 - - - 2 3 - 3
CO2 3 2 - - 2 2 - - 2 - 3
CO3 3 3 3 1 2 2 2 - 2 - - 3
CO4 2 2 2 3 2 2 - - 1 - - 3

Page 67 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3101

Course Title Digital Circuits Laboratory
Category Professional Core
LTP & Credits L T P Credits
0 0 3 1.5
Total Contact Hours 36
Pre-requisites None

Learning Objective:
In this laboratory course, the students will be conducting hands-on sessions for the design and
implementation of combinational and sequential digital circuit modules, and also interfacing
LED and 7-segment display units.

Course Outcome:
CO1: To understand and test the functionalities of basic gates.

CO2: To understand Boolean functions using various combinational circuit modules (like
gates, multiplexer, decoder, etc.)

CO3: To understand and verify the functions of flip-flops and other sequential circuit ele-
ments (like counter, register, etc.)

CO4: To understand and analyze complex digital systems and verify the functionality.

Course Content:
1. Design a basic inverter using transistors, obtain the transfer characteristics, and measure the
propagation delay. Repeat the experiment using an inverter chip. [1 day]

2. Given a Boolean function, minimize it and realize the function using NAND gates. Using 555
timer, design a rectangular waveform generator of a given frequency. [1 day]

3. Design full-adder using basic gates. Cascade two such full-adders to realize a 2-bit adder.
Connect LEDs to observe the outputs, and verify the functionality. [1 day]

4. Verify the functionality of multiplexer and decoder chips. Implement a 4-variable Boolean
function using 8-to-1 multiplexer. [1 day]

5. Implement RS and JK master-slave flip-flops using NAND gates and verify their functionali-
ties. Verify the functionality of J-K flip-flop chip. [1 day]

6. Using JK or D flip-flops, design a 4-bit shift register and verify the functionality. Modify the
designs to make it into (a) ring counter, (b) Johnson counter and verify the functionality. [1
day]

Page 68 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

7. Design a 3-bit synchronous counter that counts in some arbitrary count sequence. Apply a
square wave at the clock input, and analyze the waveforms observed. [1 day]

8. Design a 2-digit BCD counter, and display the count value on 7-segment display units. [1 day]

9. Design an 8-bit modulo-N counter for some arbitrary value of N. Connect a D/A converter
at the output of the counter and observe the output waveform. Analyze the operation for
various values of N. Use the circuit to display the transfer characteristic of a NOT gate on the
oscilloscope. [1 day]

10. Design a data path consisting of an ALU, registers and multiplexers. Hence design the control
path to compute the GCD of two numbers. [1 day]

Text/Reference Books:
1. Z. Kohavi and N. K. Jha, “Switching and Finite Automata Theory (3rd Ed.)”, Cambridge
University Press

2. M. Morris Mano, “Digital Design (3rd Ed.).

3. G. De Micheli, “Synthesis and Optimization of Digital Circuits”, Tata-McGraw-Hill.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 - 3 2 3 2 - - 2 - 2 3
CO2 1 2 2 1 - 2 - - 2 - 2 3
CO3 1 2 2 1 1 2 - - 2 - 2 3
CO4 2 2 2 2 1 2 - - 2 - 2 3

Page 69 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3102

Course Title Data Structures and Algorithms Laboratory
Category Programme Core
LTP & Credits L T P Credits
0 0 3 1.5
Total Contact Hours 36
Pre-requisites a) Fundamentals of Programming

Learning Objective:
In this course, the students will learn about C program based implementation ofdifferent
algorithmic approaches by using non-linear and linear data structures to solve problems in
different engineering domains.

Course Outcome:
CO1: To choose appropriate data structure as applied to specified problem definition.

CO2: To compare operations like searching, insertion, deletion, traversing mechanism on

various data structures.

CO3: To explain various practical applications of data structures.

CO4: To analyze how to store, manipulate and arrange data in an efficient manner.

CO5: To demonstrate how to implement various data structures using arrays and linked list.

Suggestive List of Experiments:

1. Experiments on arrays [1 day]
Addition and Multiplication of Arrays
Implementation of Sparse Matrices

2. Experiments on Abstract Data Types [2 days]

Implementation of stack using Array
Applications of stack –infix to postfix conversion, expression evaluation

3. Experiments on Linked List [2 days]

Implementation of linked lists and its operations– insertion, deletion and reverse
Implementation of stacks and queues using linked list.
Polynomial addition and polynomial multiplication.

4. Experiments on Searching and Sorting [2 days]

Searching: Linear Search, Binary Search
Sorting: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort

5. Experiments on Non-linear Data Structures [2 days]

Traversals of binary tree, Binary Search Tree (BST), Threaded binary tree
Height balanced binary tree – AVL tree (insertion, deletion)
B- Trees – insertion, deletion

Page 70 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

6. Experiments on Hashing [1 day]

Implementation of Hash tables and its operations – searching, inserting, and deleting, handling
collisions.

7. Innovative Experiments [2 days]

Case study of solving complex problems from various engineering domains using suitable data
structures (e.g., mesh analysis in electrical circuits, event-driven simulation, etc.).

Text/Reference Books:
1. C. E. Balagurusamy, “Data Structures using C”, McGraw Hill.

2. E. Horowitz, S. Sahni and S. Anderson-freed, “Fundamentals of Data Structures of C”, Uni-

versities Press.

3. A. K. Sharma, “Data Structures using C”, Pearson.

4. 4. R. Thareja, “Data Structures using C”, Oxford University Press.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 2 2 - - 2 1 - -
CO2 - 2 2 - 2 2 - - 2 1 - 2
CO3 2 1 1 - - 2 - - 2 - - -
CO4 3 2 - 2 - 2 - - 2 - 1 -
CO5 - - 2 1 2 2 - - 2 - 1 2

Page 71 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3103

Course Title Object Oriented Programming Laboratory
Category Open Elective
LTP & Credits L T P Credits
0 0 3 1.5
Total Contact Hours 36
Pre-requisites a) Fundamentals of Programming

Learning Objective:
The main objectives of this course is to understand the fundamental principles and approaches
of object oriented programming using C++.

Course Outcome:
CO1: To understand and remember object-oriented programming concepts using the C++
language.

CO2: To understand and analyze the principles of data abstraction, inheritance and poly-
morphism.

CO3: To understand and remember the concepts of virtual functions.

CO4: To understand formatted and unformatted I/O operations.

CO5: To apply exception handling.

Course Content:
1. Programming using basic features of C++.
Executing programs in UNIX environment. Understand pre-processors directives, header Files
and namespaces, library files, variables, data types, operators, control, basic loop control,
through simple C++ programs. [3 days]

2. Functions and String Manipulation

Writing functions, selection statements, review of functions and parameters, command line
arguments, recursion, I/O streams, arrays and string manipulation, pointers, structures and
unions.
Longest common subsequence problem. [2 days]

3. Object Oriented Programming

Programs to demonstrate fundamentals of classes, abstract class, virtual class, overriding,
template class, constructors-destructors and deal with member functions, operator overload-
ing and polymorphism (both static and dynamic), inheritance, derived class handling. [2 days]

4. Exception handling, Input/output and Dynamic Memory Management

Write simple programs to demonstrate exception handling, I/O management, creation of linked
list using dynamic memory management. [3 days]

Page 72 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

5. Innovative Experiments
Demonstrate read write operations from USB flash drive. Generate command line-based tic-
tac-toe game. institute premises.
[2 days]

Text/Reference Books:
1. H. M. Deitel, “Instructor’s Manual: C++ how to Program”, Prentice Hall.

2. E. Balagurusamy, “Object-Oriented Programming with C++”, Tata McGraw-Hill.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 2 2 - - 1 - - 1
CO2 3 2 2 - 1 2 - - 1 - - 2
CO3 2 3 2 3 1 2 - - 2 - - 1
CO4 1 - - - 1 2 - - 1 2 - 2
CO5 2 1 1 - 1 2 1 - 2 - - 2

Page 73 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Course Code YCS3501

Course Title Behavioral and Interpersonal Skills
Category Mandatory Non-CGPA Course
LTP & Credits L T P Credits
0 0 3 0
Total Contact Hours 36
Pre-requisites None

Learning Objective:
In this course, the students will be taught about how to represent himself as a good human
being and also able to learn to deal with different people with his/her interpersonal skillsets
and behaviour. After the completion of this course, the students will be in a better position
to learn and understand the basic interpersonal skills.

Course Outcome:
CO1: To understand how to handle workplace interpersonal communication in an effective
manner.

CO2: To enhance the students skills with strong oral and written interpersonal communica-
tion.

CO3: To prepare students to critically analyze workplace situations and take appropriate
decisions.

CO4: To prepare students campus ready through proper behavioral and interpersonal groom-
ing.

CO5: To enhance skill set to design and frame team based Project Report and Presentation.

Course Content:
Module 1: Interpersonal Communication [9L]
The skills of Interpersonal Communication, Gender/Culture Neutrality, Rate of Speech,
Pausing, Pitch Variation and Tone, Corporate Communication, Branding and Identity.

Module 2: Interpersonal Communication Vs Workspace Communication [9L]

Workplace Communication, Modes of Communication (Telephone, Conference Call,
Team Huddle, Public Relation etc.), Communication with Clients, Customers, Suppliers
etc., Organizing/Participating in Business Meeting, Note Taking, Agenda, Minutes

Module 3: Business Etiquette and Corporate Life [9L]

Presenting oneself in the Business Environment, Corporate Dressing and Mannerism,
Table Etiquette (Corporate Acculturation, Office parties, Client/Customer invitations
etc.), E-mail Etiquette, Activity based Case Study.

Module 4: Movie Making : Corporate Business Meeting [9L]

Team based Brainstorming, Process Planning and Developing Plot, People manage-
ment. Documentation and Scripting, Shooting the Movie: Location and Camera, Post
Production and Editing, Movie Review: Feedback and Analysis.

Page 74 of 179
 R21 Curriculum, B.Tech CSE (AI & ML)

Text/Reference Books:
1. P. Hartley, Interpersonal Communication,Routledge, 1993.

2. C.Garsten, Palgrave, Workplace Vagabonds: Career and Community in Changing Worlds of

Work, Macmillan, 2008.

3. F.Moore, Ashgate,Transnational Business Cultures Life and Work in a Multinational Corpo-

ration,2005

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 - - - 3 - - 2 - 1
CO2 1 3 3 - - - 3 - - 2 - -
CO3 - - 2 1 2 2 - - - 2 - 1
CO4 - - 2 1 2 2 - - - 3 - -
CO5 2 - 2 - 1 2 - - - 3 - 1

Page 75 of 179