B.Tech AI DS - Syllabus
B.Tech AI DS - Syllabus
B.Tech AI DS - Syllabus
B. Tech
Artificial Intelligence and Data Science
SYLLABUS
SEMESTER 1
COMMUNICATIVE ENGLISH
L T P C
2 1 0 3
COURSE OBJECTIVES:
To help learners develop the basic reading skills as required for academic purposes
To help learners develop the writing abilities as required in academic contexts
To help learners develop their listening skills, which will enable them t o listen to
lectures and comprehend them by asking questions and seeking clarifications
To help learners develop their speaking skills and speak fluently in real contexts
To help learners develop vocabulary, as required in academic contexts
To help learners gain the expertise required in grammar for them to function well in academic
contexts
Reading: Reading short narratives and descriptions from newspapers including dialogues and
conversations
Writing: Paragraph writing (topic sentence, main ideas, organization, cohesive devices)
Listening: Telephonic conversations, short presentations and TV news
Speaking: Sharing information of a personal kind, Greeting, Taking leave
Language development: Prepositions, Conjunctions, Clauses
Vocabulary development: Guessing meanings of words in context
Reading: Reading longer texts and different types of texts (journalistic, literary)
Writing: Letter writing (informal or personal letters), E-mails (conventions of personal email)
Listening: Listening to dialogues or conversations and completing exercises based on them
Speaking: Speaking about oneself, Speaking about one’s friend, Role-plays
Language development: Tenses (simple and continuous)
Vocabulary development: Synonyms, Antonyms, Phrasal verbs
EXTENDED WRITING:
TOTAL PERIODS: 45
COURSE OUTCOMES:
TEXT BOOK:
1. Board of Editors. Using English: A Course Book for Undergraduate Engineers and
Technologists. Orient BlackSwan Limited, Hyderabad, 2015.
VECTOR SPACES: 12
Semigroup - Group - Ring - Field (Definitions and examples) - Vector Space: Subspace - Linear
Independence and Dependence - basis and dimension
LINEAR TRANSFORMATION: 12
Linear Transformation - Range Space and Null Space - Rank and nullity - Dimension Theorem
MATRIX DECOMPOSITION: 12
TOTAL PERIODS: 60
COURSE OUTCOMES:
TEXT BOOK:
1. Friedberg A.H, Insel A.J. and Spence L, Linear Algebra, Prentice Hall of India, New
Delhi, 2004.
L T P C
3 0 0 3
COURSE OBJECTIVES:
Enable the students to
Understand the characteristics of sound; production and applications of ultrasound.
Develop an understanding of quantum mechanical concepts and their theories.
Explain the theories of physics of semiconductors.
Describe the principle of laser action and their production.
Analyse the propagation of light through optical fibres and losses in fibre optic
communication.
ACOUSTICS: 4
ULTRASONICS: 5
QUANTUM PHYSICS: 9
Planck’s theory (derivation) - Deduction of Wien’s displacement law and Rayleigh-Jeans law
from Planck’s theory - Properties of Matter waves - wave particle duality - Schrödinger’s wave
equation - Time-independent and time-dependent equations - Physical significance of wave
function - Particle in a one dimensional box and extension to three dimensional box -
Degeneracy of electron energy states - Quantum free electron theory - Density of states -
Fermi-Dirac statistics - Free electron concentration in metals.
SEMICONDUCTORS: 9
FIBRE OPTICS: 9
Principle and propagation of light in optical fibres - Numerical aperture and Acceptance angle,
Types of optical fibres (material, mode & refractive index) - Losses in fibres - Attenuation,
dispersion - Fibre Optical Communication system (Block diagram) - Active and passive
sensors - pressure, strain, displacement.
TOTAL PERIODS: 45
COURSE OUTCOMES:
TEXT BOOK:
1. M. N. Avadhanulu, P. G. Kshirsagar , “A text book of Engineering Physics” , S.
Chand & Co. Ltd. Revised Edition 2014.
Definition, scope and importance of Environment - Need for public awareness - Concept of an
Ecosystem - Structure and function of an Ecosystem - producers, consumers and decomposers
- Energy Flow in the Ecosystem - Ecological succession - Food chains, Food webs and
ecological pyramids - Introduction, types, characteristic features, structure and function of the
a) Forest Ecosystem, b) Grassland Ecosystem, c) Desert Ecosystem, d) Aquatic Ecosystems
(Ponds, Streams, Lakes, Rivers, Oceans, Estuaries)
ENVIRONMENTAL POLLUTION: 6
Definition - causes, effects and control measures of: a) Air Pollution, b) Water Pollution,
c) Soil Pollution, d) Marine Pollution, e) Noise Pollution, f) Thermal Pollution, g) Nuclear
Hazards - Soil waste management: causes, effects and control measures of municipal solid
wastes - Role of an individual in prevention of pollution - Pollution case studies - Disaster
management: floods, earthquake, cyclone and landslides - Field study of local polluted site -
urban/rural/industrial/agricultural
NATURAL RESOURCES: 7
Forest Resources: Use and over-exploitation, deforestation, case studies - Timber Extraction,
mining, dams and their effects on forests and tribal people - Water resources: use and over-
utilization of surface and ground water, floods, drought, conflicts over water, dams, benefits
and problems - Mineral resources: use and exploitation, environmental effects of extracting
and using mineral resources, case studies - Food resources: world food problems, changes
caused by agriculture and overgrazing, fertilizer-pesticide problems, water logging, salinity,
case studies - Energy resources: growing energy needs, renewable and non-renewable energy
sources, use of alternate energy sources, case studies - Land resources: land as a resource, land
degradation, man induced landslides, soil erosion and desertification - role of an individual in
TOTAL PERIODS: 30
COURSE OUTCOMES:
TEXT BOOKS:
L T P C
3 0 0 3
COURSE OBJECTIVES:
C PROGRAMMING BASICS: 12
Arrays - Initialization - Declaration - One dimensional and Two dimensional arrays - Strings:
String operations - String Arrays - Simple programs: sorting, searching, matrix operations
Introduction - need for Structure data type - Structure definition - Structure declaration -
Structure within a structure - Union - Programs using Structures and Unions - Storage classes
- Preprocessor directives - Simple programs: singly linked list, doubly linked list
Console input output functions - disk input output functions - data files - Additional Features
in C: command line arguments, bit wise operators, enumerated data types, type-casting
TOTAL PERIODS: 45
TEXT BOOK:
1. Kernighan, B.W and Ritchie, D. M, “The C Programming language”, 2nd edition, Pearson
Education, 2006
L T P C
2 0 2 3
COURSE OBJECTIVES:
Number systems: Decimal, Binary, Octal and Hexadecimal - Conversion from one system to
another - Floating point representation of numbers - Arithmetic operations - 1's complement,
2's complement - Study on BCD: Codes - Introduction to Digital Circuits: Advantages and
Disadvantages of Digital circuits over Analog circuits - Logic gates: truth tables.
Introduction to basic laws of Boolean Algebra - Mixed logic: Multilevel gating networks - Sum
of products and Product of sum - Simplification of four variable Boolean equations using
Karnaugh maps, Quine-McClusky method.
Binary Adder and Subtractor: Half adder - Full adder - Half Subtractor - Full Subtractor - 4 bit
parallel adder and subtractor - 3-bit binary decoder - Two phase method - Decimal to BCD
encoder - 8-to-1 multiplexer - 1-to-8 multiplexer.
Flip-flops: Triggering of flip-flops (SR, D, JK and T) - Study of 3 bit and 4 bit binary
asynchronous counter - Design of synchronous counter - Shift registers (SISO, SIPO, PISO,
PIPO) - Memories (RAM, ROM, EPROM, FLASH) - State Diagram - State Table - State
Assignment.
TOTAL PERIODS: 30
TOTAL PERIODS: 15
COURSE OUTCOMES:
TEXT BOOK:
L T P C
0 0 4 2
COURSE OBJECTIVES:
TOTAL PERIODS: 30
COURSE OUTCOMES:
L T P C
0 0 4 2
COURSE OBJECTIVE:
LIST OF EXPERIMENTS:
TOTAL PERIODS: 30
COURSE OUTCOMES:
Develop strategies and skills to enhance their ability to read and comprehend texts in
engineering and technical contexts.
Foster their ability to write convincing job applications and effective reports.
Develop their speaking skills to make technical presentations, participate in group
discussions.
Strengthen their listening skill which will help them comprehend lectures and talks in
their areas of specialization.
To help learners develop vocabulary, as required in engineering contexts
To help learners gain the expertise required in grammar for them to function well in
engineering contexts
INTRODUCTION: 9
Listening- Listening to longer technical talks and completing exercises based on them
Speaking- describing a process; making enquiries
Reading - reading longer technical texts- identifying the various transitions in a text-
paragraphing Writing- interpreting charts, graphs; writing formal letters/emails including
complaints
Vocabulary Development- vocabulary used in formal letters/emails and reports
Language Development- impersonal passive voice, numerical adjectives.
TOTAL PERIODS: 45
COURSE OUTCOMES:
TEXT BOOK:
1. Sudarshana, N.P. and Savitha, C. (2018). English for Engineers. Cambridge University
Press.
L T P C
3 0 0 3
COURSE OBJECTIVES:
PROBABILITY THEORY: 9
STATISTICAL AVERAGES: 9
PROBABILITY DISTRIBUTIONS: 9
RANDOM PROCESSES: 9
TOTAL PERIODS: 45
TEXT BOOK:
1. Gupta, S.C. and Kapoor, V.K. (2007): Fundamentals of Mathematical Statistics, 11th
Edn., (Reprint), Sultan Chand and Sons.
L T P C
2 0 0 2
COURSE OBJECTIVES:
Data and types: int, float, boolean, string, list - variables - expressions - statements -
simultaneous assignment - precedence of operators - comments - in-built modules and
functions - Conditional: boolean values and operators, conditional (if), alternative (if-else),
case analysis (if-elif-else)
Iteration: while, for, break, continue, pass - Functions: function definition, function call, flow
of execution, parameters and arguments, return values, local and global scope, recursion -
Strings: string slices, immutability, string functions and methods, string module
CONTAINERS: 8
Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list
parameters, nested lists, list comprehension - Dictionaries: operations and methods, looping
and dictionaries, reverse lookup, dictionaries and lists, dictionary comprehension - Tuples:
tuple assignment, tuple as return value, tuple operations
Files: Text files, reading and writing files, format operator, file names and paths - command
line arguments - Exceptions: try-catch, types of exception handling
TOTAL PERIODS: 30
TEXT BOOK:
L T P C
COURSE OBJECTIVES: 3 0 0 3
Basic Terminology - Data Organization - Abstract Data Types - Data Structures: Types and
Operations - Time and Space Complexity analysis: Big-Oh, Ω, θ, little-oh notations - Growth
rates - Time-Space Tradeoff - Time complexity analysis of some example problems.
LISTS: 7
List ADT - Array Implementation of List - Operations on lists: Insertion, Deletion, Merging -
Linked Lists: Singly Linked list, Doubly linked list, Circular linked list - Operations on linked
lists - The Polynomial ADT - Cursor implementation of lists
STACKS: 6
QUEUES: 5
TREES: 7
Tree ADT - Implementation of trees - Tree traversals - Binary trees - Binary Search Trees
(BST): Operations on BSTs - Expression trees - AVL trees: Operations on AVL trees - Splay
trees - Red-Black trees - B-Trees - Heaps - Types of heaps.
GRAPHS: 7
Graph ADT - Implementation of Graphs - Traversal: Breadth First Search, Depth first search -
Topological sort - Minimum spanning tree: Prim’s Algorithm & Kruskal’s algorithm -
Dijkstra’s Algorithm - Applications of graphs.
Searching: Linear Search, Binary Search - Sorting: Bubble sort, Selection sort, Insertion sort,
Quick Sort, Merge Sort, Shell sort, Counting Sort.
HASHING: 3
Hash Tables - Hash Functions - Separate Chaining - Linear Probing - Quadratic Probing - Open
addressing - Rehashing - Extendible hashing.
TOTAL PERIODS: 45
COURSE OUTCOMES:
Upon completion of the course, the students will be able to
Describe the importance of data structures in programming
Explain the concepts and applications of various linear data structures
Identify the suitable non-linear data structure for a given context
Use appropriate searching and sorting algorithms for a problem
Describe the concepts and algorithms related to hashing
TEXT BOOK:
1. Mark Allen Weiss, “Data Structures & Algorithm Analysis in C”, Pearson Education,
Second Edition, 2002.
L T P C
3 0 0 3
COURSE OBJECTIVES:
• To make students understand the basic structure and operation of digital computer
• To understand the hardware-software interface
• To familiarize the students with arithmetic and logic unit and implementation of fixed
point and floating-point arithmetic operations
• To expose the students to the concept of pipelining
• To familiarize the students with hierarchical memory system including cache memories
and virtual memory
• To expose the students with different ways of communicating with I/O devices and
standard I/O interfaces
PROCESSOR FUNDAMENTALS: 9
COMPUTER ARITHMETIC: 12
Representing unsigned and signed integer numbers - Floating point system - Integer addition
and subtraction - Adders: Ripple carry adder, Carry Look Ahead adders - Integer multiplication
and division - High-Radix Multipliers and High-Radix Dividers - Redundant number systems
- Residue number systems
MEMORY SYSTEMS: 9
Interconnection structures, Bus - PCI, Mesh, Hyper cube, Ring, Star - I/O Interface Systems:
Keyboard, Monitor, Mouse, Bluetooth, USB, Flash
ILP ARCHITECTURES: 9
TOTAL PERIODS: 45
TEXT BOOK:
Introduction: Need for data science - Benefits and uses - Facets of data - Big data ecosystem -
The data science process: Retrieving data - Cleansing, integrating and transforming data - Data
analysis - Build the models - Presenting findings and building applications
Introduction to Python - Fundamental Python Libraries for Data Scientists: Numpy - Scipy -
ScikitLearn - Pandas - Matplotlib - IDE - Data Manipulation with Python
DESCRIPTIVE STATISTICS: 8
STATISTICAL INFERENCE: 8
MACHINE LEARNING: 10
TOTAL PERIODS: 45
COURSE OUTCOMES:
After the completion of this course, students will be able to:
TEXT BOOK:
1. Davy Cielen, Arno D B Meysman, Mohamed Ali, “Introducing Data Science - Big data,
Machine Learning, and more using Python tools”, Manning Publications Co, 2016.
L T P C
0 0 4 2
COURSE OBJECTIVES:
TOTAL PERIODS: 30
COURSE OUTCOMES:
Upon completion of the course, the students will be able to
Develop programs using appropriate linear data structures.
Identify and implement the suitable non-linear data structure for a given problem.
Implement appropriate searching and sorting algorithms for a problem.
Develop programs using basic hashing concepts.
L T P C
0 0 4 2
COURSE OBJECTIVES:
1. Use Linux shell commands, use Python in interactive mode, and an editor
2. Write simple programs (area of a geometric shape, simple interest, solve quadratic
equation, net salary)
3. Write programs using conditional statements (leap year, maximum of 2 numbers,
maximum of 3 numbers, simple calculator, grade of the total mark)
4. Develop programs using loops and nested loops (gcd, prime number, integer division,
sum of digits of an integer, multiplication table, sum of a series, print patterns, square
root using Newton’s method)
5. Develop programs using functions (sine and cosine series, Pythagorean triplets)
6. Develop programs using recursion (efficient power of a number, factorial, Fibonacci
number)
7. Develop programs using strings (palindrome, finding substring) without using in-built
functions
8. Develop programs using lists and tuples (linear search, binary search, selection sort,
insertion sort, quicksort)
9. Develop programs using nested lists (matrix manipulations)
10. Develop simple programs using dictionaries (frequency histogram, nested dictionary)
11. Develop programs using Files (read and write files)
12. Develop programs to perform any task by reading arguments from the command line
TOTAL PERIODS: 30
COURSE OUTCOMES: