BOS CSE-Data Science(10!5!25)
BOS CSE-Data Science(10!5!25)
(Full time)
Department of Computer Science and Engineering
DATA SCIENCE
4 Years B.Tech. Course Structure (2025-26)
(Effective for students admitted into I Year from Academic Year 2024-2025
onwards
&
B.Tech.(Lateral Entry Scheme)
(Effective for the students admitted into II Year through Lateral Entry Scheme from
the Academic Year 2025-2026 onwards
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
DATA SCIENCE
3 ES
Introduction to Data Science 3 0 0 3
Advanced Data Structures &Algorithms
4 PC Analysis 3 0 0 3
Object-Oriented Programming Through
5 PC 3 0 0 3
JAVA
6 PC Data Science Lab 0 0 3 1.5
Object-Oriented Programming Through
7 PC 0 0 3 1.5
JAVA Lab
SEC Python programming
8 0 1 2 2
Audit
9 Course Environmental Science 2 0 0 -
Total 15 2 10 20
4 PC DBMS 3 0 0 3
Course Outcomes:
CO1: Remember and understand key data science concepts like data types and preprocessing. (L2)
CO2: Explain data wrangling, feature engineering, and model evaluation concepts. (L2)
CO3: Apply Python, R, or SQL to manipulate and analyze datasets. (L3)
CO4: Analyze datasets for patterns, trends, and relationships. (L4)
CO5: Evaluate models and design end-to-end data science solutions. (L6)
UNIT I:
Introduction to Data science, benefits and uses, facets of data, data science process in brief, big data
ecosystem and data science
Data Science process: Overview, defining goals and creating project charter, retrieving data, cleansing,
integrating and transforming data, exploratory analysis, model building, presenting findings and building
applications on top of them
Unit II:
Applications of machine learning in Data science, role of ML in DS, Python tools like
sklearn, modeling process for feature engineering, model selection, validation and prediction, types of
ML, semi-supervised learning
Handling large data: problems and general techniques for handling large data, programming tips for
dealing large data, case studies on DS projects for predicting malicious URLs, for building recommender
systems
UNIT III:
No SQL movement for handling big data: Distributing data storage and processing with Hadoop
framework, case study on risk assessment for loan sanctioning, ACID principle of relational
databases, CAP theorem, base principle of NoSQL databases, types of NoSQL databases, case study on
disease diagnosis and profiling
UNIT IV:
Tools and Applications of Data Science: Introducing Neo4jfor dealing with graph databases, graph
query language Cypher, Applications graph databases, Python libraries like nltk and SQLite for
handling Text mining and analytics, case study on classifying Reddit posts
UNIT V:
Data Visualization and Prototype Application Development: Data Visualization options, Cross filter,
the JavaScript MapReduce library, creating an interactive dashboard with dc.js, Dashboard
development tools. Applying the Data Science process for real world problem solving scenarios as a
detailed case study.
Text book:
1) “Introducing to Data Science using Python tools”, Davy Cielen, Arno D. B. Meysman, and
Mohamed Ali, Manning Publications Co, Dream tech press, 2016
2) “Data Science with Jupiter”, Prateek Gupta, BPB publishers, 2019 for basics
Reference Books:
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 1 1 0 0 0 0 0 0 0 3 2
CO2 3 2 2 2 2 0 0 0 0 0 0 0 3 2
CO3 3 3 3 3 3 0 0 0 0 0 0 0 3 3
CO4 3 3 2 3 3 0 0 0 0 0 0 0 3 3
CO5 3 3 3 3 3 0 0 0 0 0 0 0 3 3
Avg 3.0 2.6 2.4 2.0 2.0 0 0 0 0 0 0 0 3.0 2.6
Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert
Course Objectives:
Course Outcomes:
CO1: Understand algorithm performance, asymptotic notation, and implement AVL and B-Trees with
applications. (L3)
CO2: Implement heap trees, graph algorithms, and solve divide-and-conquer problems. (L3)
CO3: Apply greedy and dynamic programming algorithms for optimization problems. (L3)
CO4: Implement backtracking and branch-and-bound methods for problem solving. (L3)
CO5: Analyze NP-hard and NP-complete problems and solve related graph and scheduling problems.
(L4)
UNIT – I:
Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic Notations.
AVL Trees – Creation, Insertion, Deletion operations and Applications B-Trees – Creation, Insertion,
Deletion operations and Applications
UNIT – II:
Heap Trees (Priority Queues) – Min and Max Heaps, Operations and Applications
Graphs – Terminology, Representations, Basic Search and Traversals, Connected Components and
Disconnected Components, applications Divide and Conquer: The General Method, Quick Sort,
Merge Sort, Strassen’s matrix multiplication, Convex Hull.
UNIT – III:
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem, Minimum cost
spanning trees, Single Source Shortest Paths Dynamic Programming: General Method, All pair’s
shortest paths, Single Source Shortest Paths – General Weights (Bellman Ford Algorithm), Optimal
Binary Search Trees, 0/1 Knapsack, String Editing, Travelling Salesperson problem
UNIT – IV:
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph Coloring, 0/1
Knapsack Problem Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling
Salesperson problem
UNIT – V:
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem NP Hard Graph Problems:
Clique Decision Problem (CDP), Chromatic Number Decision Problem (CNDP), Traveling Salesperson
Decision Problem (TSP) NP Hard Scheduling Problems: Scheduling Identical Processors, Job Shop
Scheduling
Text books:
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh,
2nd Edition, Universities Press, 2008.
2. Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran 2nd
Edition, University Press, 2008.
Reference Books:
1. Data Structures and program design in C, Robert Kruse, 2e, Pearson Education Asia, 2006.
2. An introduction to Data Structures with applications, Trembley & Sorenson, 2 e , McGraw Hill,2017.
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, 1988.
6. Fundamentals of Data Structures in C++: Horowitz Sahni & Mehta, Galgottia Pub, 2008.
7. Data structures in Java, Thomas Standish, Pearson Education Asia, 2010.
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 3 2 0 0 0 1 1 0 0 3 3
CO2 3 2 3 3 2 0 0 0 1 1 0 0 3 3
CO3 3 2 3 3 3 0 0 0 1 1 0 0 3 3
CO4 3 2 2 3 2 0 0 0 1 1 0 0 3 3
CO5 3 2 2 3 3 0 0 0 1 1 0 0 3 3
Avg 3.0 2.0 2.6 3.0 2.4 0 0 0 1.0 1.0 0 0 3.0 3.0
Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert
Course Objectives:
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:
After completion of the course, students will be able to
CO1: Understand Java programming fundamentals, including OOP principles and program structure.
(L2)
CO2: Implement OOP principles, advanced features, constructors, recursion, and access control. (L3)
CO3: Implement arrays and OOP concepts including vectors. (L3)
CO4: Demonstrate packages, exception handling, Java I/O, and file handling for applications. (L3)
CO5: Design and develop real-world Java applications with strings, multithreading, JDBC, and
JavaFX GUI. (L5)
UNIT I:
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 print() 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:
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:
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:
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 until 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 Throw able, 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:
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 Database Connectivity: Introduction, JDBC Architecture, Installing My SQL and My SQL
Connector/J, JDBC Environment Setup, Establishing JDBC Database Connections, Result Set
Interface
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 (Text Book 3)
Text Books:
1. JAVA one step ahead, Anitha Seth, B. L. Juneja, 1e, Oxford, 2017.
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, 2018.
References Books:
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464547618
816347_shared/overview
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 2 2 0 0 0 1 1 0 0 3 3
CO2 3 3 3 2 2 0 0 0 1 1 0 0 3 3
CO3 3 2 3 3 3 0 0 0 1 1 0 0 3 3
CO4 3 2 3 3 3 0 0 0 1 1 0 0 3 3
CO5 3 2 3 3 3 0 0 0 2 2 0 0 3 3
Avg 3.0 2.4 2.8 2.6 2.6 0 0 0 1.2 1.2 0 0 3.0 3.0
Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert
The main objective of the course is to inculcate the basic understanding of Data Science
and its practical implementation using Python.
Course Outcomes:
CO1: Create, define, and manipulate operations on NumPy arrays. (L3)
CO2: Define and implement operations on pandas data structures. (L3)
CO3: Implement visualizations using matplotlib. (L3)
CO4: Define and implement machine learning and NLP techniques using scikit-learn and NLTK. (L3)
List of Experiments
5. https://www.analyticsvidhya.com/blog/2020/02/beginner-guide-matplotlib-data-
visualization-exploration-python/6.
6. https://www.nltk.org/book/ch01.html
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 0 0 0 1 1 0 0 3 3
CO2 3 3 3 2 2 0 0 0 1 1 0 0 3 3
CO3 3 2 3 2 3 0 0 0 1 1 0 0 3 3
CO4 3 3 3 3 3 0 0 0 1 1 0 0 3 3
Avg 3.0 2.75 3.0 2.25 2.5 0.0 0.0 0.0 1.0 1.0 0.0 0.0 3.0 3.0
Course Objectives:
The aim of this course is 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:
After completion of the course, students will be able to
CO1: Demonstrate understanding of Java syntax, data types, control structures, methods, classes, and
objects. (L2)
CO2: Apply OOP principles and exception handling to solve programming problems. (L3)
CO3: Familiarize with Java libraries, APIs, threads, Collections Framework, I/O, and JDBC. (L2)
CO4: Design GUI applications proficiently using JavaFX. (L4)
Sample Experiments:
Exercise – 1:
a) Write a JAVA program to display default value of all primitive data type of JAVA
2
b) Write a java program that display the roots of a quadratic equation ax +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 String Buffer 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.
d) 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 multilevel Inheritance
c) Write a JAVA program for abstract class to find areas of different shapes
Exercise - 5
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
c) Write a JAVA program for creation of Java Built-in Exceptions
d) 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
1. Write a JAVA program that import and use the user defined packages
2. Without writing any code, build a GUI that display text in label and image in an Image
View (use JavaFX)
3. Build a Tip Calculator app using several JavaFX components and learn how to respond to user
interactions with the GUI
Exercise – 9
a) Write a java program that connects to a database using JDBC
b) Write a java program to connect to a database using JDBC and insert values into it.
c) Write a java program to connect to a database using JDBC and delete values from it
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 1 0 0 0 1 1 0 0 3 2
CO2 3 3 3 2 2 0 0 0 2 1 0 0 3 3
CO3 3 2 3 2 1 0 0 0 1 1 0 0 3 2
CO4 3 3 3 2 2 0 0 0 2 2 0 0 3 3
Avg 3.0 2.5 2.75 2.0 1.5 0.0 0.0 0.0 1.5 1.25 0.0 0.0 3.0 2.5
Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert
Course Outcomes:
After completion of the course, students will be able to
CO1: Understand Python programming basics including syntax, data types, operators, control flow,
and exception handling. (L2)
CO2: Apply functions, string manipulations, and list operations using Python programming constructs.
(L3)
CO3: Demonstrate knowledge of dictionaries, tuples, and sets for data storage and manipulation. (L3)
CO4: Implement file handling and object-oriented programming concepts including classes,
inheritance, and polymorphism. (L3)
CO5: Utilize Python libraries and tools for data science tasks including JSON, NumPy, Pandas, and
data visualization. (L3)
UNTI-I
History of Python Programming Language, Thrust Areas of Python, Installing Anaconda Python
Distribution, Installing and Using Jupiter 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...else…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.
i) Arithmetic Operators ii) Relational Operators iii) Assignment Operators iv) Logical Operators
v) Bit wise Operators vi) Ternary Operator vii) Membership Operators
viii) Identity Operators
5. Write a program to add and multiply complex numbers
6. Write a program to print multiplication table of a given number.
UNIT-II:
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, Built-In Functions Used on
Lists, List Methods, del Statement.
Sample Experiments:
UNIT-III: 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, using zip () Function, Sets, Set Methods, Frozen set.
Sample Experiments:
1. Write a program to create tuples (name, age, address, college) for at least two members
and concatenate the tuples and print the concatenated tuples.
2. Write a program to count the number of vowels in a string (No control flow allowed).
3. Write a program to check if a given key exists in a dictionary or not.
4. Write a program to add a new key-value pair to an existing dictionary.
5. Write a program to sum all the items in a given dictionary.
UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data, Reading
and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python OS and OS path
Modules.
Object-Oriented Programming: Classes and Objects, Creating Classes in Python, Creating Objects in
Python, Constructor Method, Classes with Multiple Objects, Class Attributes Vs Data Attributes,
Encapsulation, Inheritance, Polymorphism.
Sample Experiments:
1. Write a program to sort words in a file and put them in another file. The output file should have
only lower-case words, so any upper-case words from source must be lowered.
2. Python program to print each line of a file in reverse order.
3. Python program to compute the number of characters, words and lines in a file.
4. Write a program to create, display, append, insert and reverse the order of the items in the
array.
5. Write a program to add, transpose and multiply two matrices
6. Write a Python program to create a class that represents a shape. Include methods to calculate
its area and perimeter. Implement subclasses for different shapes like circle, triangle, and
square.
UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy
with Python, Pandas.
Sample Experiments:
1. Python program to check whether a JSON string contains complex object or not.
2. Python Program to demonstrate NumPy arrays creation using array () function.
3. Python program to demonstrate use of ndim, shape, size, d-type.
4. Python program to demonstrate basic slicing, integer and Boolean indexing.
5. Python program to find min, max, sum, cumulative sum of array
6. Create a dictionary with at least five keys and each key represent value as a list where this
list contains at least ten values and convert this dictionary as a pandas
7. data frame and explore the data through the data frame as follows:
a) Apply head () function to the pandas data frame
b) Perform various data selection operations on Data Frame
8. Select any two columns from the above data frame, and observe the change in one
Attribute with respect to other attribute with scatter and plot operations in matplotlib
Reference Books:
1. Introduction to Python Programming, Gowri Shankar S, Veena A., 1e,CRC Press,2019.
nd
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2 Edition, Pearson, 2024
3. Introduction to Programming Using Python, Y. Daniel Liang, 1e,Pearson, 2017.
Online Learning Resources/Virtual Labs:
1. https://www.coursera.org/learn/python-for-applied-data-science-ai
2. https://www.coursera.org/learn/python?specialization=python#syllabus
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 1 1 0 0 0 1 1 0 0 3 2
CO2 3 2 3 2 2 0 0 0 2 1 0 0 3 3
CO3 3 2 2 2 1 0 0 0 1 1 0 0 3 2
CO4 3 3 3 2 2 0 0 0 2 2 0 0 3 3
CO5 3 3 3 3 3 0 0 0 2 2 0 0 3 3
Avg 3.0 2.4 2.6 2.0 1.8 0 0 0 1.6 1.4 0 0 3.0 2.6
Course Outcomes:
CO1: Understand the fundamentals of data engineering, its lifecycle, and data engineer responsibilities
and skills. (L2)
CO2: Analyze the data engineering lifecycle and key components including data generation, storage,
ingestion, and transformation. (L4)
CO3: Design effective data architectures and practical data generation from various sources. (L5)
CO4: Evaluate storage systems, data ingestion methods, and considerations for efficient data
engineering. (L4)
CO5: Apply and optimize data queries, transformations, and analytics for business and machine
learning. (L3)
UNIT-I:
Introduction to Data Engineering: Definition, Data Engineering Life Cycle, Evolution of Data
Engineer, Data Engineering Versus Data Science, Data Engineering Skills and Activities, Data Maturity,
Data Maturity Model, Skills of a Data Engineer, Business Responsibilities, Technical Responsibilities,
Data Engineers and Other Technical Roles.
UNIT-II:
Data Engineering Life Cycle: Data Life Cycle Versus Data Engineering Life Cycle, Generation:
Source System, Storage, Ingestion, Transformation, Serving Data.
Major undercurrents across the Data Engineering Life Cycle: Security, Data Management, Data
Ops, Data Architecture, Orchestration, Software Engineering.
UNIT-III:
Designing Good Data Architecture: Enterprise Architecture, Data Architecture, Principles of Good
Data Architecture, Major Architecture Concepts.
Data Generation in Source Systems: Sources of Data, Files and Unstructured Data, APIs, Application
Databases (OLTP), OLAP, Change Data Capture, Logs, Database Logs, CRUD, Source System Practical
Details.
UNIT-IV:
Storage: Raw Ingredients of Data Storage, Data Storage Systems, Data Engineering Storage
Abstractions, Data warehouse, Data Lake, Data Lakehouse.
Ingestion: Data Ingestion, Key Engineering considerations for the Ingestion Phase, Batch Ingestion
Considerations, Message and Stream Ingestion Considerations, Ways to Ingest Data
UNIT-V:
Queries, Modeling and Transformation: Queries, Life of a Query, Query Optimizer, Queries on
Streaming Data, Data Modelling, Modeling Streaming Data, Transformations, Streaming
Transformations and Processing.
Serving Data for Analytics, Machine Learning and Reverse ETL: General
Considerations for serving Data, Business Analytics, Operational Analytics, Embedded
Analytics, Ways to serve data for analytics and ML, Reverse ETL.
Text Books:
1. Joe Reis, Matt Housley, Fundamentals of Data Engineering, O'Reilly Media, In., June 2022,
ISBN:9781098108304
Reference Books:
1. Data Engineering with Python, Paul Crickard , Pack Publishing, October 2020.
2. The Data Warehouse Toolkit: The Definitive Guide to Dimensional Modeling, Ralph Kimball,
Margy Ross, Wiley, 3rd Edition, 2013
3. Data Pipelines Pocket Reference: Moving and Processing Data for Analytics, James Densmore,
O'Reilly Media, 1st Edition, 2021
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 1 1 0 0 2 0 0 1 3 2
CO2 3 2 2 2 2 1 0 0 2 0 0 1 3 3
CO3 3 3 3 3 2 1 0 0 2 0 0 1 3 3
CO4 3 2 2 2 2 1 0 0 2 0 0 1 3 2
CO5 3 3 3 3 3 2 0 0 2 0 0 2 3 3
Avg 3.0 2.6 2.6 2.6 2.0 1.2 0 0 2.0 0 0 1.2 3.0 2.6
Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert
Course Objectives:
Introduce database management systems and to give a good formal foundation on the relational
model of data and usage of Relational Algebra
Introduce the concepts of basic SQL as a universal Database language
Demonstrate the principles behind systematic database design approaches by covering conceptual
design, logical design through normalization
Provide an overview of physical design of a database system, by discussing Database indexing
techniques and storage techniques
Course Outcomes:
CO1: Understand the basics of Database Management Systems including file systems, database
models, architecture, and ER model. (L2)
CO2: Analyze the relational model, basic SQL commands, relational algebra, and relational calculus.
(L4)
CO3: Construct SQL and relational algebra queries for CRUD operations, nested queries, aggregation,
joins, and views. (L3)
CO4: Discuss functional dependency and normalization techniques with examples. (L2)
CO5: Describe transaction processing, concurrency control, and indexing techniques. (L2)
UNIT- I:
Introduction: Database system, Characteristics (Database Vs File System), Database Users,
Advantages of Database systems, Database applications. Brief introduction of different Data Models;
Concepts of Schema, Instance and data independence; Three tier schema architecture for data
independence; Database system structure, environment, Centralized and Client Server architecture for
the database.
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set, relationship,
relationship set, constraints, sub classes, super class, inheritance, specialization, generalization using ER
Diagrams.
Unit-II:
Relational Model: Introduction to relational model, concepts of domain, attribute, tuple, relation,
importance of null values, constraints (Domain, Key constraints, integrity constraints) and their
importance, Relational Algebra, Relational Calculus. BASIC SQL: Simple Database schema, data
types, table definitions (create, alter), different DML operations (insert, delete, update).
UNIT-III:
SQL: Basic SQL querying (select and project) using where clause, arithmetic & logical operations, SQL
functions (Date and Time, Numeric, String conversion). Creating tables with relationship, implementation of
key and integrity constraints, nested queries, sub queries, grouping, aggregation, ordering, implementation of
different types of joins, view (updatable and non-updatable), relational set operations.
UNIT-IV:
Schema Refinement (Normalization): Purpose of Normalization or schema refinement, concept of functional
dependency, normal forms based on functional dependency Lossless join and dependency preserving
decomposition, (1NF, 2NF and 3 NF), concept of surrogate key, Boyce- Code normal form (BCNF), MVD,
Fourth normal form(4NF), Fifth Normal Form (5NF).
UNIT- V:
Transaction Concept: Transaction State, ACID properties, Concurrent Executions, Serialize ability,
Recoverability, Implementation of Isolation, Testing for Serialize ability, lock based, time stamp
based, optimistic, concurrency protocols, Deadlocks, Failure Classification, Storage, Recovery and
Atomicity, Recovery algorithm.
Introduction to Indexing Techniques: B+ Trees, operations on B+ Trees, Hash Based
Indexing:
Text Books:
Reference Books:
th
1. Introduction to Database Systems C J Date, 8 edition, Pearson, 2006.
2. Database Management System RamezElmasri, Shamkant B. Navathe, 6th edition, Pearson, 2010.
3. Database Principles Fundamentals of Design Implementation and Management, Carlos Coronel,
Steven Morris, Peter Robb, Cengage Learning, 2012.
Web-Resources:
1. https://nptel.ac.in/courses/106/105/106105175/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_0127580666728202
2456_shared/overview
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 1 1 0 0 1 0 0 1 3 2
CO2 3 3 3 3 2 1 0 0 1 0 0 1 3 3
CO3 3 3 3 3 2 1 0 0 1 0 0 1 3 2
CO4 2 2 2 2 1 1 0 0 2 0 0 1 2 2
CO5 2 2 2 2 1 2 0 0 1 0 0 1 2 2
Avg 2.6 2.4 2.4 2.4 1.4 1.2 0 0 1.2 0 0 1.0 2.6 2.2
The main objective of this course is to teach how build data engineering infrastructure and data
pipelines.
Course Outcomes:
CO1: Build data engineering infrastructure for effective data management. (L3)
CO2: Demonstrate reading and writing files using appropriate tools and techniques. (L3)
CO3: Build data pipelines and integrate them with dashboards for real-time insights. (L3)
CO4: Deploy data pipelines in production environments for operational use. (L3)
Experiments:
Reference Books:
1. Data Engineering with Python, Paul Crickard, Packt Publishing, October 2020.
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 2 1 0 0 1 0 0 1 3 2
CO2 2 3 3 3 2 1 0 0 1 0 0 1 3 2
CO3 3 3 3 3 2 2 0 0 2 0 0 1 3 3
CO4 2 2 3 3 2 2 0 0 2 0 0 1 3 3
Avg 2.5 2.5 3.0 2.75 2.0 1.5 0.0 0.0 1.5 0.0 0.0 1.0 3.0 2.5
Dr G. Jaya Suma Dr K. Venkata Rao Dr CH Ramesh
University Nominee Subject Expert Subject Expert
Course Objectives:
Course Outcomes:
CO1: Understand the basics of Database Management Systems including file systems, database
models, architecture, and ER model. (L2)
CO2: Analyze relational models, basic SQL commands, relational algebra, and relational calculus.
(L4)
CO3: Construct SQL and relational algebra queries for CRUD operations, nested queries, aggregation,
joins, and views. (L3)
CO4: Discuss functional dependencies, normalization techniques, transaction processing, concurrency
control, and indexing techniques with examples (L2)
Sample Experiments:
1. Creation, altering and dropping of tables and inserting rows into a table (use constraints
while creating tables) examples using SELECT command.
2. Queries (along with subqueries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION,
INTERSET, Constraints. Example :- Select the roll number and name of the student who
Secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN),
4. GROUP BY, HAVING and Creation and dropping of Views.
5. Queries using Conversion functions (to_char, to_number and to_date), string functions
(Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date
functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest, trunc,
round, to_char, to_date)
6.
i. Create a simple PL/SQL program which includes declaration section, executable
section and exception –Handling section (Ex. Student marks can be selected from
the table and printed for those who secured first class and an exception can be raised
if no records were found)
ii. Insert data into student table and use COMMIT, ROLLBACK and SAVEPOINT in
PL/SQL block.
7. Develop a program that includes the features NESTED IF, CASE and CASE expression. The
program can be extended using the NULLIF and COALESCE functions
8. Program development using WHILE LOOPS, numeric FOR LOOPS, nested
Loops using ERROR Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE-
APPLICATION ERROR.
9. Programs development using creation of procedures, passing parameters IN and OUT of
PROCEDURES.
10. Program development using creation of stored functions, invoke functions in SQL Statements
and write complex functions.
11. Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR,
WHERE CURRENT of clause and CURSOR variables.
12. Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers and
INSTEAD OF Triggers
13. Create a table and perform the search operation on table using indexing and non- indexing
techniques.
14. Write a Java program that connects to a database using JDBC
15. Write a Java program to connect to a database using JDBC and insert values into it
16. Write a Java program to connect to a database using JDBC and delete values from it
Course Objectives:
1. This course introduces the fundamentals of Exploratory Data Analysis
2. It covers essential exploratory techniques for understanding multivariate data by
summarizing it through statistical methods and graphical methods.
Course Outcomes:
UNIT-I
Exploratory Data Analysis Fundamentals: Understanding data science, the significance of EDA,
Steps in EDA, Making sense of data, Numerical data, Categorical data, Measurement scales,
Comparing EDA with classical and Bayesian analysis, Software tools available for EDA, Getting
started with EDA.
Sample Experiments:
1. a) Download Dataset from Kaggle using the following link:
https://www.kaggle.com/datasets/sukhmanibedi/cars4u
b) Install python libraries required for Exploratory Data Analysis (numpy, pandas, matplotlib, sea
born)
2. Perform Numpy Array basic operations and Explore Numpy Built-in functions.
3. Loading Dataset into pandas data frame
4. Selecting rows and columns in the data frame
UNIT-II
Visual Aids for EDA: Technical requirements, Line chart, Bar charts, Scatter plot using seaborn, Polar
chart, Histogram, Choosing the best chart
Case Study: EDA with Personal Email, Technical requirements, Loading the dataset, Data
transformation, Data cleansing, Applying descriptive statistics, Data refactoring, Data analysis.
Sample Experiments:
1. Apply different visualization techniques using sample dataset
a) Line Chart b) Bar Chart c) Scatter Plots d) Bubble Plot
2. Generate Scatter Plot using seaborn library for iris dataset
3. Apply following visualization Techniques for a sample dataset
a) Area Plot b) Stacked Plot c) Pie chart d) Table Chart
4. Generate the following charts for a dataset.
a) Polar Chart b) Histogram c) Lollipop chart
5. Case Study: Perform Exploratory Data Analysis with Personal Email Data
UNIT-III
Data Transformation: Merging database-style data frames, concatenating along with an axis, Merging
on index, Reshaping and pivoting, Transformation techniques, Handling missing data, Mathematical
operations with NaN, Filling missing values, Discretization and binning, Outlier detection and filtering,
Permutation and random sampling, Benefits of data transformation, Challenges.
Sample Experiments:
1. Perform the following operations
a) Merging Data frames
b) Reshaping with Hierarchical Indexing
c) Data Deduplication
d) Replacing Values
2. Apply different Missing Data handling techniques
a) NaN values in mathematical Operations
b) Filling in missing data
c) Forward and Backward filling of missing values
d) Filling with index values
e) Interpolation of missing values
3. Apply different data transformation techniques
a) Renaming axis indexes
b)Discretization and Binning
c) Permutation and Random Sampling
d) Dummy variables
UNIT-IV
Descriptive Statistics: Distribution function, Measures of central tendency, Measures of dispersion,
Types of kurtosis, Calculating percentiles, Quartiles, Grouping Datasets, Correlation,
Understanding univariate, bivariate, multivariate analysis, Time Series Analysis
Sample Experiments:
1. Study the following Distribution Techniques on a sample data
a) Uniform Distribution
b) Normal Distribution
c) Gamma Distribution
d) Exponential Distribution
e) Poisson Distribution
f) Binomial Distribution
2. Perform Data Cleaning on a sample dataset.
3. Compute measure of Central Tendency on a sample dataset
a) Mean b) Median c) Mode
4.Explore Measures of Dispersion on a sample dataset
Variance b) Standard Deviation c) Skewness d) Kurtosis
5. a) Calculating percentiles on sample dataset
b) Calculate Inter Quartile Range (IQR) and Visualize using Box Plots
5. Perform the following analysis on automobile dataset.
a) Bivariate analysis b) Multivariate analysis
6. Perform Time Series Analysis on Open Power systems dataset
UNIT-V
Model Development and Evaluation: Unified machine learning workflow, Data preprocessing, Data
preparation, Training sets and corpus creation, Model creation and training, Model evaluation, best
model selection and evaluation, Model deployment
Case Study: EDA on Wine Quality Data Analysis
Sample Experiments:
1. Perform hypothesis testing using stats models library
a) Z-Test b) T-Test
2. Develop model and Perform Model Evaluation using different metrics such as prediction score, R2
Score, MAE Score, and MSE Score.
3. Case Study: Perform Exploratory Data Analysis with Wine Quality Dataset
Text Book:
a) Hands-On Exploratory Data Analysis with Python, Suresh Kumar Mukhiya, Usman Ahmed,
Packt Publishing, 2020.
References:
1. Exploratory Data Analysis Using R, Ronald K. Pearson, CRC Press, 2020
2. Hands-On Exploratory Data Analysis with R: Become an expert in exploratory data analysis
using R packages, Radhika Datar, Harish Garg, 1st Edition, Packt Publishing, 2019
Web References:
1. https://github.com/PacktPublishing/Hands-on-Exploratory-Data-Analysis-with- Python
2. https://www.analyticsvidhya.com/blog/2022/07/step-by-step-exploratory-data-
analysis-edu-using-python/#h-conclusion
3. https://github.com/PacktPublishing/Exploratory-Data-Analysis-with-Python-
Cookbook
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 1 1 0 0 0 0 0 0 0 0 3 2
CO2 3 3 2 1 0 0 0 0 0 0 0 0 3 3
CO3 3 3 3 2 0 0 0 0 0 0 0 0 3 3
CO4 3 2 1 1 0 0 0 0 0 0 0 0 2 2
CO5 3 3 3 2 0 0 0 0 0 0 0 0 3 3
Avg 3.0 2.6 2.0 1.4 0 0 0 0 0 0 0 0 2.8 2.6