3rd_sem
3rd_sem
3rd_sem
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)
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.
CO3: To explain the basic concepts of sets, relations, functions and various algebraic struc-
tures.
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.
Page 58 of 179
R21 Curriculum, B.Tech CSE (AI & ML)
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.
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)
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.
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.
Page 60 of 179
R21 Curriculum, B.Tech CSE (AI & ML)
Text/Reference Books:
1. E. Kreyszig, “Advanced Engineering Mathematics”, John Wiley & Sons.
6. W. Feller, “An Introduction to Probability Theory and its Applications, Vol. 1”, Wiley.
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)
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.
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.
Page 62 of 179
R21 Curriculum, B.Tech CSE (AI & ML)
Text/Reference Books:
1. Z. Kohavi and N. K. Jha, “Switching and Finite Automata Theory (3rd Ed.)”, Cambridge
University Press.
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)
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)
2. S. Lipschutz, “Data Structures”, Tata McGraw Hill Education (India) Private Limited.
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)
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.
CO3: To analyze various string handling functions with various I/O operations.
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.
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.
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.
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)
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
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)
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.
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.
Page 70 of 179
R21 Curriculum, B.Tech CSE (AI & ML)
Text/Reference Books:
1. C. E. Balagurusamy, “Data Structures using C”, McGraw Hill.
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)
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.
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]
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.
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)
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.
Page 74 of 179
R21 Curriculum, B.Tech CSE (AI & ML)
Text/Reference Books:
1. P. Hartley, Interpersonal Communication,Routledge, 1993.
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