Syllabus for 3rd semester (CSE-AIML)

Statistics for Data Science (23CSH-233)

Theory :
Unit-1 Contact Hours:15
Descriptive Statistics Descriptive statistics basics
and Bayes Theorem Mean, median, and mode
Standard deviation
Use of the central tendency measures
Bayes Theorem
Data Visualization Types of visualization
Calculation and interpretation of graphs, plot, and measures
Unit-2 Contact Hours:15
Probability Distribution Concept of Random Variable, Bernoulli Distribution,
Binomial Distribution, Poisson Distribution, Normal
Distribution.
Correlation and Concept and types, Karl Pearson Method, Rank, Spearman
Regression Method, Least Square Method, Regression line by regression
coefficient
Unit-3 Contact Hours:15
Inferential Statistics Statistical Inference Terminology,
& Hypothesis Testing Hypothesis Testing,
Parametric Tests,
Non-parametric Tests
Industry Application Hypothesis Testing using Excel
Industry Practices & Applications of Statistics

Experiments :
Unit 1.
1. Import all the required Python Libraries and perform statistical functions.
2. Locate an open source data from the web. Provide a clear description of the data
and its source.
3. Load the any open source dataset into pandas data frame and perform EDA
4. Data Preprocessing: check for missing values in the data using pandas insult(),
describe() function to get some initial statistics. Provide variable descriptions. Types
of variables etc. Check the dimensions of the data frame.

Unit 2.
5. Data Formatting and Data Normalization: Summarize the types of variables by
checking the data types (i.e., character, numeric, integer, factor, and logical) of the
variables in the data set. If variables are not in the correct data type, apply proper type
conversions.
6. Turn categorical variables into quantitative variables in Python. In addition to the
codes and outputs, explain every operation that you do in the above steps and explain
everything that you do to import/read/scrape the data set.
7. Scan all variables for missing values and inconsistencies. If there are missing
values and/or inconsistencies, use any of the suitable techniques to deal with them.
Unit 3.
8. Scan all numeric variables for outliers. If there are outliers, use any of the suitable
techniques to deal with them.
9. Write a Python program to display some basic statistical details of the species of
‘Iris-setosa’, ‘Iris-versicolor’ and ‘Iris-versicolor’ of iris.csv dataset.
10. Implement Simple Naïve Bayes classification algorithm using Python/R on
iris.csv dataset.

Discrete Mathematics (23CST-237)

Unit-1
1. Boolean algebra
Introduction of Boolean algebra, truth table, basic logic gate, basic postulates of
Boolean algebra, principle of duality, canonical form, Karnaugh map.
2. Abstract algebra
Set, relation, group, ring, field.
Unit-2
3. Combinatorics
Basic counting, balls and bins problems, generating functions, recurrence relations.
Proof techniques, principle of mathematical induction, pigeonhole principle.
4. Graph Theory
Graphs and digraphs, complement, isomorphism, connectedness and
reachability,adjacency matrix, Eulerian paths and circuits in graphs and digraphs,
Hamiltonian paths and circuits in graphs and tournaments, trees; Planar graphs,
Euler’s formula, dual of a planer graph, independence number and clique number,
chromatic number, statement of Four-color theorem.
Unit-3
5. Logic
Propositional calculus - propositions and connectives, syntax; Semantics – truth
assignments and truth tables, validity and satisfiability, tautology; Adequate set of
connectives; Equivalence and normal forms; Compactness and resolution; Formal
reducibility - natural deduction system and axiom system; Soundness and
completeness.
 Database Management System (23CSH-243)

Unit-1 Introduction to Databases and Relational

Algebra
Overview of Database concepts, DBMS, Data Base System Architecture (Three
Databases: Level ANSI-SPARC Architecture), Advantages and Disadvantages
of DBMS, Data Independence, DBA and Responsibilities of DBA,
Relational Data Structure, Keys, Relations, Attributes, Schema and
Instances, Referential integrity, Entity integrity.
Data Models: Relational Model, Network Model, Hierarchical Model, ER Model:
Design, issues, Mapping constraints, ER diagram, Comparison of
Models
Relational .
Algebra
& Relational Introduction, Syntax, Semantics, Additional operators, Grouping and
Calculus: Ungrouping, Relational comparisons, Tuple Calculus, Domain
Calculus, Calculus Vs Algebra, Computational capabilities
Unit-2 Database storage structure and data
accessing techniques
Functional dependencies, Decomposition, Full Functional
Dependency (FFD), Transitive Dependency (TD), Join Dependency
Functional (JD), Multi-valued Dependency (MVD), Normal Forms (1NF, 2NF,
dependencies 3NF, BCNF), De-normalization.
and
Normalization:
Database Introduction, Threats, Counter Measures.
Security:

Control Introduction to conditional control, Iterative control and sequential

Structures: control statements, Cursors, Views.

Unit-3 Transactions and concurrency

Package, Parts of procedures, Parameter modes, Advantages of procedures,
Procedures and Syntax for creating triggers, Types of triggers, package specification
Triggers: and package body, developing a package, Bodiless package,
Advantages of packages.

Transaction Introduction to Transaction Processing, Properties of Transactions,

Management Serializ ability and Recoverability, Need for Concurrency Control,
and Locking Techniques, Time Stamping Methods, Optimistic
Concurrency Techniques and Granularity of Data items.
Control:
Database Introduction, Need for Recovery, Types of errors, Recovery
Recovery of Techniques
database:
Practicals/Experiments :

Unit 1.

1. Introduction to DBMS, RDBMS, Oracle and Basic SQL Commands

2. Create Tables and Specify Queries in SQL
3. To manipulate operations on the table
4. To manipulate restrictions on the table.
5. To implement structure of the table

Unit 2

6. To implement the concept of Joins.

7. To implement the concept of Grouping of Data
8. To implement the concept of Sub Query
9. To implement the concept of indexes, cursors, triggers and views

Unit 3

10. Design a case study for Company database/ Hospital Management System/
Railway Reservation System
 Operating Systems (23CSH-242)

Experiments :

Exp.
No. Name of the Experiments
UNIT-I
1.1 Installation of Linux operating system.
1. 1.2 Study of basic Linux commands.
2.1 Programs using the following system calls of Linux operating system:
2. fork, getpid,getppid, exit, wait, and close.
2.2 Use of Linux file related commands like ls, grep, cat, etc.
3.1 Programs using the I/O system calls of Linux operating system (open, read,
3. write etc). .
3.2 Study of basics of shell programming.
UNIT-II

4. 4.1 Write a program to show the use of echo.

4.2 Write a program to read the keywords in shell programming.
5. 5.1 Write a program using arithmetic operators in shell programming.
5.2 Write a program using relational operators in shell programming.
6.1 Write a program using Boolean operators in shell programming.
6. 6.2 Write programs using control structures in shell programming.

7. Write a program to demonstrate the difference between while and until

statement.
UNIT-III
8.1 Simulation of First come first serve CPU scheduling algorithm.
8. 8.2 Simulation of Shortest job first CPU scheduling algorithm.
9. 9.1 Simulation of Round Robin CPU scheduling algorithm.
9.2 Simulation of Priority based CPU scheduling algorithm.
10. Simulate the Bankers algorithm for deadlock avoidance and deadlock
prevention.
 Data Structures (23CSH-241)

UNIT-1 Basics, Complexity Analysis, Arrays Contact Hours:15

Concept of data and information, Introduction to Data Structures,
Introduction
Types of data structure: Linear and non-linear data structures,
to Data
operations on Data Structures, Algorithm complexity, Time-space
Structures
trade off, asymptotic notations.
Basic terminology, Linear arrays and their representation, Traversing
Linear Array,

Insertion & Deletion in arrays, searching – linear search, binary search,

Arrays sorting – insertion sort , selection sort , bubble sort , Quick Sort,
merging arrays & merge sort , complexity analysis of each algorithm,
Multi-dimensional arrays and their representation, Pointers; Pointer
Arrays, Records; Record structure, representation of records in
Memory, Parallel Arrays, sparse matrices and their storage
UNIT-2 Linked Lists, Stacks, Queues Contact Hours:15
Linear linked list, Representation of Linked Lists in Memory,
Traversing a linked list, searching a linked list, insertion in & deletion
Linked List from linked list, Header Linked List, doubly linked list, Operations on
doubly linked list, complexity analysis of each algorithm, Application
of linked lists.
Basic terminology, Sequential and linked representations, Operations
on stacks: PUSH &POP, Application of stacks: Parenthesis matching,
Stacks evaluation of postfix expressions, conversion from infix to postfix
representation. Meaning and importance of recursion, principles of
recursion & implementation of recursive procedure
Linear queue, Sequential and linked representation of Linear queue,
Queues
Circular queue, Operations on queue, Deques, Priority queue.
UNIT-3 Graph, Trees, Hashing and Files Contact Hours:15
Graphs Graph Theory terminology, sequential representation of graphs
(adjacency matrix, Path Matrix), traversing a graph, Operations on
Graph.
Trees Basic terminology, Binary Trees, Representation of Binary Trees in
Memory, traversing Binary Trees, Traversal Algorithms using stacks,
Header Nodes; Threads, Binary Search trees, Searching, Inserting &
Deleting in Binary Search Trees, AVL Search trees, B Trees, Heap
& Heap Sort.
Hashing & Fil Hash Table, Hash Functions, Collision Resolution Strategies, Hash
e Table Implementation. Concepts of files, Organization of records into
Organization Blocks, File organization: Sequential, Relative, Index Sequential,
Inverted File
Practicals :

Unit 1

1. Design, Develop and Implement a menu driven Program in C for the following
Array operations
a. Creating an Array of N Integer Elements
b. Display of Array Elements with Suitable Headings
c. Inserting an Element (ELEM) at a given valid Position (POS)
d. Deleting an Element at a given valid Position(POS)
e. Exit. Support the program with functions for each of the above operations.
2. Design, Develop and Implement a program in C for the following operations on
Strings a. Read a Main String (STR),
a Pattern String (PAT) and a Replace String (REP).
b. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in
STR with REP if PAT exists in STR. Repost suitable messages in case PAT does not
exist in STR.
Support the program with functions for each of the above operations.
3. Design, Develop and Implement a menu driven Program in C for the following
operations on STACK of Integers (Array Implementation of Stack with maximum
size MAX)

a. Push an Element on to Stack

b. Pop an Element from Stack

c. Demonstrate how Stack can be used to check Palindrome

d. Demonstrate Overflow and Underflow situations on Stack e. Display the status of

Stack

f. Exit

Unit 2

4. Design, Develop and Implement a Program in C for converting an Infix Expression

to Postfix Expression. Program should support for both parenthesized and free
parenthesized expressions with the operators: +, -, *, /, %( Remainder), ^ (Power) and
alphanumeric operands.
5. Design, Develop and Implement a Program in C for the following Stack
Applications a. Evaluation of Suffix expression with single digit operands and
operators: +, -, *, /, %, ^ b. Solving Tower of Hanoi problem with n disks.
6. Implement and demonstrate the functionality of a circular queue in C, including
operations for insertion (enqueuing) and deletion (dequeuing) of elements.

Unit 3

7. To implement and demonstrate operations on multivariable polynomials using

linked lists in C. The operations include:
 1. Representing and evaluating a polynomial P(x,y,z)P(x, y, z)P(x,y,z).
2. Adding two polynomials POLY1(x,y,z)POLY1(x, y, z)POLY1(x,y,z) and
POLY2(x,y,z)POLY2(x, y, z)POLY2(x,y,z) to obtain their sum.

8. To implement and demonstrate basic operations on a Binary Search Tree (BST)

using linked lists in C. The operations include:

1. Creating a BST.
2. Searching for an element in the BST.
3. Displaying the BST using different traversal methods: Inorder, Preorder, and
Postorder.

9. To implement and demonstrate the traversal of a graph using Breadth-First Search

(BFS) and Depth-First Search (DFS) techniques. The graph will be represented using
an adjacency matrix, and the program will allow the user to:

1. Print all nodes reachable from a given starting node using BFS.
2. Print all nodes reachable from a given starting node using DFS.

10. To implement and demonstrate open addressing for collision handling in a hash
table using linear probing. The program will allow the user to:

1. Insert employee records with four-digit keys into a hash table.

2. Display the contents of the hash table after all insertions.
 Aptitude (23TDT-212)

Unit-1
Vedic maths: Mental Calculations; How to find square root, cube root,
Chapter
squares, cubes; Approximations; How to solve tough calculations in less
1.1
time
Number System: Number Chart: Real numbers, Imaginary numbers,
Chapter
Rational numbers, Irrational numbers, Integers, Whole numbers &
1.2
Natural numbers, Prime and composite numbers;
Direction sense: Concept of left and right turn (direction), clockwise and
anticlockwise movement with East, West, North and South direction,
Chapter
basic problem based on above concepts, complex problems based on
1.3
above concepts, passage-based problems, problems based on data
sufficiency
Coding decoding: Concept of EJOTY to learn alphabets, Letter Coding,
Chapter1.4 Number Coding, Substitution Coding, Mixed letter and number coding,
how to solve abstract problems.
Unit 2
Chapter Percentage:Concept of Percentages, concept of percentage increase and
2.1 percentage decrease, concept of successive percentages.
Problems on AgesApplication of concept of ration on problems of ages
Chapter
related to past and future, Understanding of linear equations, Application
2.2
of short tricks.
Ratio-Proportion & Variation Concept of Ratio, Concept of Proportion,
Chapter
combining ratios, Word problem on Ratios, Concept of Direct & Indirect
2.3
variation between two variables, Equating the constant of variation.
Data Interpretation Introduction of topic, Analyze data in Tabular
Chapter2.4
Representations, Line Graph, Bar Graph, Miscellaneous.
Unit 3
Average and Weighted Average Concept of Mean, Different type of
Chapter
mean- Arithmetic, Geometric, Harmonic, Application of means while
3.1
taking average in different types of questions.
Chapter Time & Work Basic problems based on above using LCM method, Basic
3.2 work problems base on efficiency of manpower.
Chapter Time, Speed & Distance Questions based on Average speed, relative
3.3 speed, Concept of trains.
Chapter Inequalities Basic problem on Inequalities, coded inequalities, Problem on
3.4 deciphering inequalities.

Agile Development Methodology (23CST-247)

Unit-1 Design thinking, Principles and Software Contact Hours:15 Hours

Development Methodology
About Design Introduction to Design thinking, Importance of Design thinking.
Thinking History of Design thinking, Introduction to principles of Design
thinking, Focus on user outcomes, Relentless invention, Diverse
empowered teams. Difference between design thinking and agile
 methodology

Software Definition of Project, Project Vs. Operations, Relationship between

Development Project, Program and Portfolio, Features of Project, Measuring
Methodology Project Success, Phases of Project.

Unit-2 Project Execution and Agile Management Contact Hours:15 Hours

Project Waterfall Model, Advantages and disadvantages of Waterfall Model,
Execution V-Model, Advantages and Disadvantages of V-Model, Agile,
Methodologies Advantages and Disadvantages of Agile development.

Theories of Agile Software Development – Traditional Model vs. Agile Model -

Agile Classification of Agile Methods – Agile Manifesto and Guiding
Management Principles, Agile Framework, Extreme Programming (XP), Rational
and Scrum Unifies Process (RUP), Feature Drive Development (FDD), Test
Driven Development (TDD), Scrum and Kanban.

Foundation of Scrum, Scrum Team, Roles in scrum team, Sprints,

Definition of Ready.

Unit-3 Scrum Artifacts, Sprint and DevOps Contact Hours:15 Hours

Scrum Artifacts Product Backlog, Sprint Backlog, Sprint Burndown chart,
& Scrum Impediment List.
Ceremonies Sprint Planning, Daily Scrum Meeting, Purpose of daily Scrum,
Daily Standup Characteristics, Product Backlog refinement(PBR)/
Grooming, Sprint Review meeting. Sprint retrospective.
Scrum Sprint Sprint Goal, User Stories, Story Point, Definition of Done, Team
Planning & Velocity, Burn down chart, Defect Density. Introduction to DevOps,
DevOps DevOps vs. Agile, DevOps Principles, DevOps on CI/CD.

Universal Human Values, Ethics and Life Skills - II (23UCT-296)

Unit 1: Personal & Professional Values

1. Value Education, 2. Character Formation
3. Power of Mind-Therapeutic methods, 4. Positive Attitude
5. Professional Values and Ethics

Unit 2: Social Values

6. Right Conduct, 7. Valuing Traditions,
8. Collaboration and Tolerance, 9. Appreciating Diversity
10. Nurturing Peace

Unit 3: Environmental and Existential Values

11. Nature and Nurture, 12. Protection and Conservation
13. Sustainability in Life, 14. Secured Future
15. Youth for Climate Regulation