Syllabus CSE (Data Science) N.E.P.

2020

Rashtrasant Tukadoji Maharaj Nagpur University, Nagpur

B. Tech. Sem-III (Computer Science and Engineering (Data Science) - Major)

Course Code Teaching Total Examination Scheme

Course
Sr. No. Name of Course Scheme (hrs.) Credit
Category
Th TU P Theory Practical BOS
Exam SEE CIE Min. SEE CIE Min. CS
Hrs.
1 PCC-II Data Structures and Algorithms BCSE3T09 3 - - 3 3 70 30 45 - - - CS
2 PCC-II Data Structures and Algorithms Lab BCSE3P09 - - 2 1 - - - - 25 25 25 CS
3 PCC-III Object Oriented Programming BCSE3T10 3 - - 3 3 70 30 45 - - - CS
4 PCC-III Object Oriented Programming Lab BCSE3P10 - - 2 1 - - - - 25 25 25 CS
5 MDM-I Mathematical foundations for Data BMD3T11 2 - - 2 3 70 30 45 - - - AS&H
Science
6 OE-I Open Elective – I BOE3T01 3 - - 3 3 70 30 45 - - - CSE
7 OE-I Open Elective – I Lab BOE3P01 - - 2 1 - - - - - 50 25 CSE
8 HSSM-I Entrepreneurship and Start-up BHM3T01 2 - - 2 3 70 30 45 - - - CS
9 VEC-I Constitution of India BE3T01 2 - - 2 3 70 30 45 - - - AS&H
10 CEP Community Engagement Project BCE3P01 - - 4 2 - - - - - 100 50 AS&H
Total 15 - 10 20 420 180 50 200 850

Open Elective – I ( T&P)

S. No Code Name of Subject
1 BOE3T01/P01 Data Structure
2 BOE3T01/P01 Python Programming
3 BOE3T01/P01 Object Oriented Concepts
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B. Tech. Computer Science & Engineering (Data Science)
III Semester

Course Title Mathematical Foundations for Course Code BMD3T11

Data Science

Teaching Hours / 02 Total Credits: 02

Week
CIE 30 SEE 70

Course Outcomes :
After completing the course, students will be able to

CO1 Apply the concepts of probability. Understand the random variables and probability
functions
CO2 Analyze the data of real world problems using special probability distributions and
Mathematical expectations.
CO3 Understand concepts of sampling theory and estimation which is used in the field of
data science
CO4 Learn the techniques of testing hypothesis and apply it to test the significance of
various data samples.
CO5 Apply the concept of Regression analysis to mathematical models generated by
various data samples.

UNIT I

Theory of Probability and Mathematical Expectation Probability: Review of probability of an

event, Conditional probability, Bayes’ rule, Review of discrete and continuous random variables,
Joint probability function and Joint probability distribution of DRV, Marginal probability function
and Conditional distribution of DRV.
Mathematical Expectation (DRV): Mathematical Expectation, Variance and Standard deviation,
Moments, Moment generating function, Expectation, Variance and Covariance of Joint Distribution,
Measures of central tendency: Mean, Median, Mode, Skewness and Kurtosis.

UNIT II

Special Probability Distributions: Introduction to Discrete and Continuous Distributions,

Geometric Distribution, Binomial Distribution, Poisson Distribution, Normal Distribution,
Exponential Distribution, Uniform Distribution.

UNIT III
Syllabus CSE (Data Science) N.E.P. 2020

Sampling Theory: Definition of population, sampling, static parameter, Types of sampling,

Expected values of sample mean and variance, Standard error, Sampling distribution of mean and
sampling distribution of variance.
Estimation: Estimation of parameters, Point estimation, Interval estimation, Bayesian estimation.

UNIT IV

Testing of Hypothesis: Hypothesis, Null hypothesis, Alternative hypothesis, Testing a hypothesis,

Level of significance, Confidence limits, Test of significance of difference of means, t-test, F-test
and Chi-squared test, One way and two way Analysis of Variance (ANOVA).

UNIT V

Multidimensional Analysis:
Multiple Linear Regression Model: Least square Estimation, R-squared and adjusted R-squared
coefficients, Problem of Multicollinearity, Regression equation of three variables, Lasso regression,
Ridge regression.
Factor Analysis: Centroid method, Principal component method.
Cluster Analysis: Non-hierarchical clustering, Hierarchical clustering.

BOOKS
(1) Advanced Engineering Mathematics (Wiley), Erwin Kreyzig.
(2) Higher Engineering Mathematics (Khanna Publishers), B. S. Grewal.
(3) Advanced Engineering Mathematics (S. Chand), H. K. Dass.
(4) Probability and Statistics (Schaum’s Outline Series), Murray Spiegel, John Schiller, R. A.
Srinivasan.
(5) Fundamentals of Statistics (Himalaya Publishing House), S. C. Gupta.
(6) Research Methodology Methods and Techniques (New Age Publications), C.R. Kothari,
Gaurav Garg.
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
III Semester

Course Title Data Structures and Algorithms Course Code BCSE3T09

Teaching Hours / Week 03 Total Credits: 03
CIE 30 SEE 70

S.N. Course Objectives

1 To learn the concept of Data Structure using efficient algorithms
2 To solve real world problem using Data Structure Concepts.

Course Outcomes :
After completing the course, students will be able to
CO1 Identify essential data structures and understand when it is appropriate to use them.
CO2 Explain the use of Abstract Data Types (ADTs) and ways they can be stored, accessed,
and manipulated.
CO3 Apply linear data structures to solve various real-world computing problems using
programming languages.
CO4 Analyze standard algorithms for searching and sorting.
CO5 Implement linear data structures to find solutions for given engineering applications.

UNIT 1
Introduction to Data Structures: Common Operations on Data Structures, Types of Data
Structures, Data Structures & Programming, Program Design & Complexities, Time
Complexity, Order of Growth, Asymptotic Notation.
Sorting and Searching: Introduction, Sorting Techniques: Insertion Sort, Selection Sort,
Merge Sort, Shell Sort, Radix Sort, Searching: Linear Search, Binary Search, Hashing

UNIT 2
Arrays: Introduction, Linear Arrays, Traversing, Insertion & Deletion, Sorting: Bubble Sort,
Searching: Linear & Binary Search
Linked Lists: Introduction, Representation in Memory, Traversing & Searching a Linked List,
Memory Allocation & Garbage Collection, Insertion & Deletion in Linked List, Header Linked
Lists, Circular Linked Lists, Two-Way Lists.

UNIT 3
Syllabus CSE (Data Science) N.E.P. 2020

Stacks: Array & Linked Representation of Stacks, Stack as ADT, Arithmetic Expressions:
Polish Notation, Applications of Stacks
Recursion: Towers of Hanoi, Recursive Procedure Implementation
Queues: Linked Representation of Queues, Queues as ADT, Circular Queues, Dequeues,
Priority Queues, Applications of Queues

UNIT 4
Binary Trees: Representation, Insertion, Deletion, Traversal: Preorder, Inorder,
Postorder,Traversal Algorithms Using Stacks, Header Nodes & Threads, Threaded Binary
Trees, Binary Search Trees (BSTs): Searching, Insertion, Deletion
Balanced Binary Trees: AVL Trees: Insertion & Deletion
m-way Search Trees: Searching, Insertion, Deletion
B-Trees & B+ Trees: Searching, Insertion, Deletion

UNIT 5

Graphs and their Applications: Introduction, Graph Theory Terminology, Sequential

Representation, Adjacency Matrix, Path Matrix, Linked Representation, Operations on Graphs,
Graph Traversal Techniques, Posets & Topological Sorting, Spanning Trees

BOOKS
Textbooks:
1. Aho, Hopcroft & Ullman, Data Structures and Algorithms, Addison-Wesley
2. H. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, MIT Press
3. Sahni, Data Structures, Algorithms, and Applications in C++, WCB/McGraw-Hill
Reference Books:
1. Alfred V. Aho, Jeffery D. Ullman, Data Structures & Algorithms, Pearson
2. M.T. Goodrich, R. Tamassia, D.M. Mount, Data Structures and Algorithms in Java
(5th Ed.)
3. Wirth, Algorithms and Data Structures, Prentice-Hall
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
III Semester

Course Title Data Structures and Course Code BCSE3P09

Algorithms Lab
Teaching Hours / Week 02 Total Credits: 01
CIE 25 SEE 25

Course Objective
To emphasize the application of data structures in developing and implementing efficient
programs and algorithms.

Course Outcomes :
After completing the course, students will be able to

CO1 Identify essential data structures and understand when it is appropriate to use.

CO2 Explain use of Abstract data types & ways in which ADTs can be stored, accessed and
manipulated
CO3 Apply linear data structures to solve various real world computing problems using
programming language.
CO4 Analyze standard algorithms for searching and sorting
CO5 Implementation of linear data structure to find solution for given Engineering
applications

List of Practical:

1. To implement a Menu driven program for linear and binary search (Iterative and Recursive)
methods and demonstrate their constraints. (Compute Time and Space Complexity)
2. To implement a Menu driven program for sorting methods Selection sort, Insertion sort, Bubble
sort and Quick sort and analyze their performances. (Time required to sort the same data set)
3. To implement a Program to demonstrate the working of a stack.
4. To implement a Program to demonstrate the working of a Queue
5. To implement a Program for conversion of infix to postfix expression.
6. To implement a Program to apply the concepts of singly linked list.
7. To implement addition and deletion of a node in a doubly linked list.
8. To implement Stack and Queue using Link List
9. To implement the non- linear data structure binary tree.
10. To implement BFS and DFS in a graph.
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
III Semester
Course Title Object Oriented Programming Course Code BCSE3T10
Teaching Hours / Week 03 Total Credits: 03
CIE 30 SEE 70

Course Objective

1. This course introduced features of object oriented programming.

The course provide carrier opportunities in Implementation of various applications as object
2.
oriented concepts plays dominant role in software development.

Course Outcomes :
After completing the course, students will be able to

CO1 Articulate the principles of object oriented programming using C++

Understand function overloading, constructor overloading, operator overloading,
CO2
polymorphism & its uses in programming.
CO3 Implement inheritance concepts and its use for application development
CO4 Analyze of dynamic memory allocation and its use for software development
CO5 Implement concept of file handling in real life problems

UNIT-I: Principles of Object Oriented Programming

Introduction to OOPS: Differences between C and C++.A look at Procedure Oriented
Programming, Object Oriented Programming paradigm, basic concepts of OOP, Headers &
Name Spaces
UNIT-II: Functions & Polymorphism
Functions, Types of Functions, Constructor, Destructor, Function overloading & Ambiguity,
Operator Overloading, Function Overriding, Friend Function
UNIT-III: Inheritance & Virtual Functions
Inheritance and the Access Specifiers, Types of Inheritance, Pointers and references to derived
types, Virtual Functions
UNIT-IV: Pointers & Dynamic allocations
Static & Dynamic allocation using new and delete,* and →* operators, Creating conversion
functions, this pointer.
Syllabus CSE (Data Science) N.E.P. 2020

UNIT-V: Event Driven Programming

Graphics programming – Frame Components –working with 2D shapes – Using color, fonts,
and images – Basics of event handling – event handlers – adapter classes – actions – mouse
events – AWT event hierarchy-Introduction to Swing-layout management-Swing Components
– Text Fields, Text Areas – Buttons- Check Boxes – Radio Buttons- Lists-choices-Scrollbars –
Windows-Menus – Dialog Boxes.

BOOKS
Text Books:-
1. Object Oriented Programing in C++ -Robert Lafore, edition, Galgotia publications
2. The Complete Reference C++, Herbert Schildt, 4th Edition, TMH
Reference Books:
1. Let’s C++ by Y. Kanetkar, BPB publications
2. Object oriented programming with C++, E Balagurusamy, 4th edition, TMH
3. Object-Oriented Programming with C++, Sourav Sahay, Oxford University Press
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
III Semester

Course Title Object Oriented Programming Lab Course Code BCSE3P10

Teaching Hours / Week 02 Total Credits: 01

CIE 25 SEE 25

Course Objective

1. This course introduced features of object oriented programming.

The course provide carrier opportunities in Implementation of various applications as
2.
object oriented concepts plays dominant role in software development.

Course Outcomes :
After completing the course, students will be able to
CO1 Articulate the principles of object oriented programming using C++
Understand function overloading, constructor overloading, operator overloading,
CO2
polymorphism & its uses in programming.
CO3 Implement inheritance concepts and its use for application development
CO4 Analyze of dynamic memory allocation and its use for software development
CO5 Implement concept of file handling in real life problems

List of Practical’s:-

1. Write a C++ program to find both the largest and smallest number in a list of integers.
2. Write a Program to illustrate New and Delete Keywords for dynamic memory allocation
3. Write a program Illustrating Class Declarations, Definition, and Accessing Class Members.
4. Write a Program to Demonstrate Operator Overloading and Function Overloading.
5. Write a Program to Demonstrate Friend Function and Friend Class.
6. Write a Program to Generate Fibonacci Series use Constructor to Initialize the Data
Members.
7. Write a Program to illustrate default constructor, parameterized constructor and copy
constructors
8. Write a Program to Invoking Derived Class Member through Base Class Pointer
9. Write a Template Based Program to Sort the Given List of Elements.
10. Write a C++ program that uses function templates to find the largest and smallest number
in a list of integers and to sort a list of numbers in ascending order.
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B. Tech. Computer Science & Engineering (Data Science)
III Semester

Course Title Entrepreneurship and Start-up Course Code BHM3T01

Teaching Hours / Week 02 Th Total Credits: 02

CIE 30 Marks SEE 70 Marks

Course Outcomes :
After completing the course, students will be able to
Understand fundamental economic concepts and their relevance in business and
CO1
technology.
CO2 Analyze market structure, pricing strategies and taxation for business decision-making.

CO3 Demonstrate knowledge of entrepreneurship, Challenges and support system.

CO4 Apply the funding for startups successful entrepreneurial ventures.

UNIT 1
Basic concept of economics ,Demand and Supply Analysis, Elasticity of Demand and Its
Business Applications , Production and Cost Analysis

UNIT 2
Market and Market Structures, Perfect Competition, Monopoly, Monopolistic Competition,
Oligopoly,
Pricing strategies and Taxation

UNIT 3
Concept of entrepreneurship, characteristics of an Entrepreneur, types of Entrepreneurship,
Functions of Entrepreneurs, Women entrepreneurship in India, Problems and challenges of
women entrepreneurs, Government’s support system to develop women entrepreneurship.

UNIT IV
Funding for startups, angel funding, venture funding, difference between angel and venture
funding, private equity fund, ownership of startups, causes of startups failures, Startup success
case studies: Instagram, Linkedin, Snapchat, Whatsapp

TEXT BOOK REFERENCE

1. Modern Economic theory by K.K. Dewett, S Chand Publication, 2006.
2. Entrepreneurial Development By, S. S. Khanka S. Chand & Co. Ltd. New Delhi, 1999.
3. Industrial Economics and Entrepreneurship development by A.M. Sheikh, Nawaz Khan &
M.A. Tongo, S chand Publication
4. Small- Scale Industries and Entrepreneurship, By, Dr. Vasant Desai, Himalaya Publication
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
III Semester
Course Title Constitution of India Course Code BE3T01
Teaching Hours / Week 02 Th Total Credits: 02
CIE 30 Marks SEE 70 Marks

Course Outcomes :
After completing the course, students will be able to
CO1 Analyze the basic structure of Indian Constitution.
CO2 Remember the Fundamental rights and duties.
CO3 Know DPSP’s and Nation’s political structure.
CO4 Understand function of Parliament and Judiciary.

UNIT 1
Introduction to the Indian Constitution, Preamble of the Indian Constitution and key concepts,
Salient features of the Indian Constitution, Role and objective of Constituent Assembly.

UNIT 2
Fundamental rights meaning, significance, restrictions and limitations Fundamental duties and
its scope, difference between Fundamental rights and Fundamental duties

UNIT 3
Directive Principles of State Policy (DPSP’s) and its present relevance in India,
Union Executive- President, Prime Minister and Union cabinet.

UNIT IV
Parliament – role and function, Lok Sabha and Rajya Sabha, Judiciary system in India,
Supreme Court of India and other courts.

TEXT BOOK REFERENCE

1. Introduction to the Constitution of India by D D Basu.
2. Outlines of Indian Legal and Constitutional History by M P Jain.
3. Constitution of India by P M Bakshi
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
III Semester

Course Title Community Engagement Project Course Code BCE3P01

Teaching Hours / Week 04 Total Credits: 02

CIE 100 SEE -

Course Outcome:
• Gain an understanding of rural life, Indian culture and ethos and social realities
• Develop a sense of empathy and bonds of mutuality with the local community
• Appreciate significant contributions of local communities to Indian society and economy
• Learn to value the local knowledge and wisdom of the community
• Identify opportunities for contributing to community’s socio-economic improvements

Unit – I
Appreciation of Rural Society:
Rural lifestyle, rural society, caste and gender relations, rural values with respect to community,
nature and resources, elaboration of “soul of India lies in villages’ (Gandhi), rural infrastructure.
Task to perform - Prepare a map (physical, visual or digital) of the village you visited and write
an essay about interfamily relations in that village. – Classroom discussions – Field visit** –
Assignment Map
Unit – II
Understanding rural and local economy and livelihood:
Agriculture, farming, land ownership, water management, animal husbandry, non-farm
livelihoods and artisans, rural entrepreneurs, rural markets, migrant labour.
Task to perform - Describe your analysis of the rural house hold economy, its challenges and
possible pathways to address. Circular economy and migration patterns. – Field visit** – Group
discussions in class – Assignment
Unit – III
Rural and local Institutions:
Traditional rural and community organisations, Self-help Groups, Panchayati raj institutions
(Gram Sabha, Gram Panchayat, Standing Committees), Nagarpalikas and municipalities, local
civil society, local administration.
Task to perform - How effectively are Panchayati Raj and Urban Local Bodies (ULBs)
institutions functioning in the village? What would you suggest to improve their effectiveness?
Present a case study (written or audio-visual). – Classroom – Field visit** – Group presentation
of assignment
Unit – IV
Rural and National Development Programmes:
Syllabus CSE (Data Science) N.E.P. 2020

History of rural development and current national programmes in India: Sarva Shiksha Abhiyan,
Beti Bachao, Beti Padhao, Ayushman Bharat, Swachh Bharat, PM Awaas Yojana, Skill India,
Gram Panchayat Decentralised Planning, National Rural Livelihood Mission (NRLM), Mahatma
Gandhi National Rural Employment Guarantee Act 2005 (MGNREGA), SHRAM, Jal Jeevan
Mission, Scheme of Fund for Regeneration of Traditional Industries (SFURTI), Atma Nirbhar
Bharat, etc
Task to perform - Describe the benefits received and challenges faced in the delivery of one of
these programmes in the local community; give suggestions about improving the implementation
of the programme for the poor. Special focus on the urban informal sector and migrant households.
– Classroom – Each student selects one program for field visit** – Written assignment

Assessment: Readings from e-content and reflections from field visits should be maintained
by each student in a Field Diary. Participation in Field Visits should be allocated 30% marks;
group field project should have 40% of total marks; presentation of field project findings to
the community institution should have 30% of total marks.

** Recommended field-based practical activities:

• Interaction with Self Help Groups (SHGs) women members, and study their functions and
challenges; planning for their skill-building and livelihood activities;
• Visit Mahatma Gandhi National. Rural Employment Guarantee Act 2005 (MGNREGS)
project sites, interact with beneficiaries and interview functionaries at the work site;
• Field visit to Swachh Bharat project sites, conduct analysis and initiate problem-solving
measures;
• Conduct Mission Antyodaya surveys to support under Gram Panchayat Development Plan
(GPDP);
• Interactive community exercise with local leaders, panchayat functionaries, grass-root
officials and local institutions regarding village development plan preparation and resource
mobilization;
• Visit Rural Schools/mid-day meal centres, study academic and infrastructural resources,
digital divide and gaps;
• Participate in Gram Sabha meetings, and study community participation;
• Associate with Social audit exercises at the Gram Panchayat level, and interact with
programme beneficiaries;
• Visit to local Nagarpalika office and review schemes for urban informal workers and
migrants;
• Attend Parent Teacher Association meetings, and interview school drop outs;
• Visit local Anganwadi Centre and observe the services being provided;
• Visit local NGOs, civil society organisations and interact with their staff and beneficiaries;
• Organize awareness programmes, health camps, Disability camps and cleanliness camps; •
Conduct soil health test, drinking water analysis, energy use and fuel efficiency surveys and
building solar powered village;
• Raise understanding of people’s impacts of climate change, building up community’s
disaster preparedness; 10 Guidelines for Fostering Social Responsibility & Community
Engagement in Higher Education Institutions in India 2.0
• Organise orientation programmes for farmers regarding organic cultivation, rational use of
irrigation and fertilizers, promotion of traditional species of crops and plants and awareness
against stubble burning;
• Formation of committees for common property resource management, village pond
maintenance and fishing;
• Identifying the small business ideas (handloom, handicraft, khadi, food products, etc.) for
rural areas to make the people self-reliant.
Syllabus CSE (Data Science) N.E.P. 2020

Teaching and Learning Methods:

A large variety of methods of teaching must be deployed.
An ICT based online module needs to be prepared for self-paced learning by students for one
credit which can be supplemented through discussions in the classroom.
Reading and classroom discussions, Participatory Research Methods and Tools, Community
dialogues, Oral history, social and institutional mapping, interactions with elected panchayat
leaders and government functionaries, Observation of Gram Sabha, Field visits to various village
institutions (see Section -3 Implementation Strategy).
Syllabus CSE (Data Science) N.E.P. 2020

Open Electives Syllabus

Third Semester B. Tech. (Computer Science & Engineering (Data Science))

Open Elective – I - Data Structure (TH)

Total Credits: 03 T + 01 P Subject Code : BOE3T01
Teaching Scheme : Examination Scheme :
Lectures: 2 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
Practical: 0 Hours/Week University Assessment:70 Marks
Course Category : OE-I BoS : CSE

Course Objectives
1 To learn the concept of Data Structure using efficient algorithms
2 To solve real world problem using Data Structure Concepts.

Course Outcomes
After completion of syllabus, students would be able to
Understand the efficiency of an algorithm based on time and space complexity and
CO 1
classify an appropriate searching and sorting techniques to solve given problems.
CO 2 Apply the concepts of stack and queues to solve real world problem.
CO 3 Apply the Linked List Concept to evaluate the expression.
CO 4 Analyze the different traversing techniques using tree.
Use various methods to represent graph and utilize graph concepts to solve real world
CO 5
problems and implement concept of hashing.

SYLLABUS
Allotment Mapped
of with CO
Details of Topic Number
Hours
L T/A CO
UNIT 1: Introduction to Algorithm
Introduction to Algorithm General Concepts of Data Structures;
Types of Data Structures with its properties and operations; Time
and Space Analysis of Algorithms, Big Oh, theta and omega
8 - 1
notations; Average, Best and Worst Case Analysis;
Sorting & Searching : Selection Sort, Insertion Sort, Heap Sort,
Shell Sort; Linear Search, Binary Search
UNIT 2: Stacks and Queues
Stack ADT: Concept, primitive operations, implementation of
stacks, multiple stacks, applications of stack, need for prefix and
postfix expressions, conversion from infix to prefix and postfix 7 - 2
expression, evaluation of prefix and postfix expression using
stack.
Syllabus CSE (Data Science) N.E.P. 2020

Queue ADT: Concept, operations, simple queue, circular queue,

double-ended and priority queue, applications of queue.

UNIT 3: Linked Lists

Concept, primitive operations, representation of linked lists, types
of linked list- singly linked list, circular linked list and doubly
7 - 3
linked list, polynomial manipulations: addition and multiplication
using linked list.
UNIT 4: Trees
Basic Tree terminologies, tree definition and properties, binary tree
and its operations, binary search tree (BST) and its operations,
threaded binary trees, AVL tree and its rotation, red black tree, B- 7 - 4
tree, B+ tree, tree traversal techniques, applications of tree traversal
techniques.
UNIT 5: Graphs and Hashing
Graphs: Graphs Representation, application of graphs, graph
traversals techniques- DFS and BFS.
7 - 5
Hashing: Hash functions and hash tables, properties, simple hash
function, methods for collision handling.

Text Books:
1. Fundamentals of Data Structures in C, Ellis Horowitz, Sartaj Sahani & Susan Anderson-
Freed, 2nd Edition, 2012, Universities Press.
2. Data Structures and Algorithms: Concepts, Techniques and Application, G.A.V. Pai, 3rd
Edition, 2012, Tata McGraw-Hill Education.

Reference Books:
1. Algorithms in a Nutshell, George T. Heineman, Gary Pollice& Stanley Selkow, 2nd Edition,
2016, O’Reilly Media, Inc.
2. Introduction to the Design and Analysis of Algorithms, AnanyLevitin, 3rd Edition, 2017,
Pearson Education.
3. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L
Rivest, Clifford Stein, 3rd Edition, 2015, MIT Press.
Syllabus CSE (Data Science) N.E.P. 2020

Open Elective – I - Data Structure Lab

Course Code:BOE3P01 Credits:01
Teaching Hours / Week : 02 P SEE : 25 M CIE : 25 M Total : 50 M
Total number of teaching hours: 24 Course Category : OE - I
BoS : CSE

List of Practical (Any 10-performance based and 1 virtual lab experiment)

Course Objective
The course develops programming skills to analyze and apply linear and non-linear data
structures to solve real-world problems that enhance employability.

Course Outcomes
After successful completion of this course the students will be able to:
CO1 Analyze: Analyze the performance of various algorithms based on time and space
complexity.
CO2 Apply: Apply appropriate searching and sorting techniques for a given problem
statement.
CO3 Create: Design applications using linear and nonlinear data structures to solve
engineering problems.
CO4 Evaluate: Choose appropriate data structures to solve given problems efficiently.

A minimum of Ten practical to be performed based on the theory course Data Structure
[BOE3T01].

Suggested References:
1. Algorithms in a Nutshell, George T. Heineman, Gary Pollice& Stanley Selkow, 2nd Edition,
2016, O’Reilly Media, Inc.
2. Introduction to the Design and Analysis of Algorithms, AnanyLevitin, 3rd Edition,
2017, Pearson Education.
3. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L
Rivest, Clifford Stein, 3rd Edition, 2015, MIT Press.
Syllabus CSE (Data Science) N.E.P. 2020

Open Elective – I - Python Programming (TH)

Total Credits: 03 T + 01 P Subject Code : BOE3T01
Teaching Scheme : Examination Scheme :
Lectures: 2 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
Practical: 0 Hours/Week University Assessment:70 Marks
Course Category : OE-I BoS : CSE

Course Objectives

1 To explain the basic concept of python, object oriented programming and illustrate coding
in Python Programming Language.
2 To make students capable of Implementing programs and applications using various
features of python programming

Course Outcomes

After completion of syllabus, students would be able to

CO1 Understand and implement the basic concept of python programming language.

CO2 Develop Code and test conditional statements of moderate size using the python
language.
CO3 Implement the concept of Function and modules in programming language

CO4 Understand and Implement the concept of object oriented programming in

python programming language

SYLLABUS

Allotment Mapped
of with CO
Details of Topic Hours Number

L T/A CO

Unit-I

UNIT I: Introduction to Python, Domains, Python Basics: Identifiers and

Keywords, Comments, Indentation and Multi-lining Python Types, 6
Operations and Conversions, Python Format, Python Operators.
Variables and Data Types, String Manipulation: Accessing Strings, Basic 1
Operations, String slices, Lists: Introduction, Accessing list, Operations,
Working with lists, Tuple: Introduction, Accessing tuples, Operations,
Sets and Dictionaries.

Unit -2
Syllabus CSE (Data Science) N.E.P. 2020

UNIT II: Operator Conditional Statements : If, If- else, Nested if-else, 6
Using NOT, AND, IN, Operator with If Else .Looping : For Loop
Syntax, For Loop Workflow, Examples of For, Loop, Range() Function 2
with for loop, Else Clause with For Loop, While Syntax, Examples,
Nested loops, Control Statements, Break, Continue, Pass.

Unit -3

UNIT III: Functions : Built-in, Functions, Library Functions, Defining 6

a function, Calling a function, Types of functions, Function, Arguments,
3
Mutable Arguments and Binding of Default Values, Global and local
Variables.

Unit -4

UNIT IV: Introduction to Object Oriented Programming (OOP), 6

Features of OOP, Python Class and Objects, Classes and methods, 4
Constructor and Destructor, Simple and Multiple Inheritance.

Unit -5

UNIT V: Working with Files: File Input Output, Read and Write 6
Operations, Set File offset in Python, Python File object methods. 5

Text Books:
1. Let Us Python- 7th Revised & Updated Edition By Yashavant Kanetkar, Aditya Kanetkar,
ISBN: 9789389845006, Edition: 2020/ 7th.
2. Core Python Programming Kindle Edition by Dr. R. Nageswara Rao.
Syllabus CSE (Data Science) N.E.P. 2020

Open Elective – I - Python Programming Lab

Course Code: BOE3P01 Credits: 01
Teaching Hours / Week : 02 P SEE : 25 M CIE : 25 M Total : 50 M
Total number of teaching hours: 24 Course Category : OE-I
BoS : CSE

A minimum of Ten practical to be performed based on the theory course Python

Programming [BOE3T01].

Text Books:
1. Let Us Python- 2nd Revised & Updated Edition By Yashavant Kanetkar, Aditya
Kanetkar, ISBN: 9789389845006, Edition: 2020/ 2nd.
2. Core Python Programming Kindle Edition by Dr. R. Nageswara Rao.
Syllabus CSE (Data Science) N.E.P. 2020

Open Elective – I - Object Oriented Concepts (TH)

Total Credits: 03 T + 01 P Subject Code : BOE3T01
Teaching Scheme : Examination Scheme :
Lectures: 3 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
Practical: 02 Hours/Week University Assessment:70 Marks
Course Category : OE-I BoS :CSE

Course Objectives
1 Learning to program in an object-oriented programming language, focusing those
who already have some experience with another programming language, and who
now wish to move on to an object-oriented one

Course Outcomes
After completion of syllabus, students would be able to
CO1 Develop programs efficiently using basic features of C++.
CO2 Employ object oriented concepts using classes and objects.
CO3 Explain advanced features of C++ specifically Polymorphism and Inheritance.
CO4 Design programs with dynamic binding to handle the memory efficiently.
CO5 Apply standard templates available in C++

SYLLABUS
Allotment Mapped
Details of Topic of with
Hours CO
Number
L T/A CO
UNIT 1:
Introduction to Objects, Encapsulation, Polymorphism, 8
Inheritance, Dynamic binding, Message Passing, Abstract 1
Classes, Access Modifiers. Basics of a Typical C++
Environment, Pre-processor Directives, Header Files and
Namespaces, Library files.

UNIT 2:
Syllabus CSE (Data Science) N.E.P. 2020

Classes and Data Abstraction: Introduction, Structures - Class 8

- Constructors - Destructors, Const Object And Const Member 2
Functions - Friend Function and Friend Classes, Using This
Pointer, Dynamic Memory Allocation, Static Class Members,
Container Classes And Integrators, Proxy Classes.

UNIT 3:
Polymorphism and Inheritance: Polymorphism - Function 6
Overloading, Operator Overloading, Inheritance and its types, 3
Casting - Overriding.

UNIT 4:
Virtual Functions and Files handling: Introduction to Virtual 7
Functions - Abstract Base Classes and Concrete Classes - 4
virtual base class - dynamic binding - pure virtual functions.
Streams and formatted I/O- File handling - object serialization,
namespaces - String - STL.

UNIT 5:

Templates and Exception Handling: Function Templates, 7

Overloading Template Functions, Class Template. Exception 5
Handling: Try, Throw, Catch, Rethrow - Exception
specifications.

Text Books:
1. Bjarne Stroustrup, “The C++ Programming Language”, Third Edition, Pearson
Education, 2000.
2. Robert Lafore, “Object Oriented Programming in C++”, Fourth Edition, Sams
Publishers, 2001.
3. P.J. Deitel, “C++ How to Program”, Prentice-Hall of India Pvt Ltd., Sixth edition, 2013.

Reference Books:
1. E. Balagurusamy, “Object Oriented Programming with C++”, McGraw Hill Company
Ltd., 2013.
2. B. Trivedi, “Programming with ANSI C++”, Oxford University Press, 2012.
3. Ira Pohl, “Object Oriented Programming using C++”, Pearson Education, Second Edition,
Reprint 2013.

Web link(s):

1. https://nptel.ac.in/courses/106/105/106105151/

2. www.w3schools.com
Syllabus CSE (Data Science) N.E.P. 2020

Open Elective – I - Object Oriented Concepts Lab

Course Code: BOE3P01 Credits: 01
Teaching Hours / Week : 02 P SEE : 25 M CIE : 25 M Total : 50 M
Total number of teaching hours: 24 Course Category : OE-I
BoS : CSE

Course Objective

Learning to program in an object-oriented programming language, focusing those who already

have some experience with another programming language, and who now wish to move on to
an object-oriented one
Course Outcomes
After successful completion of this course the students will be able to:
CO1 Develop programs efficiently using basic features of C++.

CO2 Employ object oriented concepts using classes and objects.

CO3 Explain advanced features of C++ specifically Polymorphism and Inheritance.
CO4 Design programs with dynamic binding to handle the memory efficiently.
CO5 Apply standard templates available in C++

A minimum of ten practical to be performed based on the theory course on

Object Oriented Concepts {BOE3T01]
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University, Nagpur

B. Tech. Sem-IV (Computer Science and Engineering (Data Science) - Major)

Sr. Course Name of Course Course Code Teaching Scheme Total

No. Category (hrs.) Credit Examination Scheme
Th TU P Theory Practical
Exam SEE CIE Min. SEE CIE Min. BOS
Hrs.
1 PCC-IV Introduction To Data Science BCSE4T12 3 - - 3 3 70 30 45 - - - CS
2 PCC-IV Introduction To Data Science BCSE4P12 - - 2 1 - - - - 25 25 25 CS
Lab
3 PCC-V Theory of Computation BCSE4T13 3 - - 3 3 70 30 45 - - - CS
4 PCC-VI Computer Networks BCSE4T14 2 - 2 - 70 30 45 - - - CS
5 PCC-VI Computer Networks Lab BCSE4P14 - 2 1 3 - - - 25 25 25 CS
6 OE-II Open Elective - II BOE4T02 2 - - 2 3 70 30 45 - - - CSE
7 VSC-II Software Tools -I BVE4P02 - - 4 2 - - - - 50 50 50 CS
8 AEC-II Critical Thinking and Problem BAE4T02 2 - - 2 3 70 30 45 - - - AS&H
Solving
9 Environmental Science 2 - - 2 3 70 30 45 - - - Civil
HSSM-II BHM4T02
10 VEC-II Universal Human Value BVE4T02 2 - - 2 3 70 30 45 - - - AS&H
Total 16 08 20 490 210 100 100
Exit option: Award of UG Diploma in Major and Minor with 80 credits and an additional 8 credits as per exit basket

Open Electives-II
S. No. Subject Code Subject Name
1 BOE4T02-A Computer Networks
2 BOE4T02-B Cyber Laws
3 BOE4T02-C Operating System
 Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
IV Semester

Course Title Introduction To Data Science Course Code BCSE4T12

Teaching Hours / Week 03 Total Credits: 03

CIE 30 SEE 70

Course Objective
To equip students with the theoretical knowledge and practical skills necessary to work on Data
Science projects, including data collection, preprocessing, exploratory data analysis, model
development, and evaluation. By the end of the course, students will be proficient in applying Data
Science techniques to real-world problems.

Course Outcomes :
After completing the course, students will be able to

Students will be able to explain the evolution of Data Science, identify the roles
CO1 involved, describe the stages of a Data Science project, and recognize the
applications and data security challenges in various industries.
Students will be able to collect, clean, integrate, and preprocess data from multiple
CO2 sources, applying techniques like data reduction and discretization to prepare data
for analysis.
Students will be able to perform descriptive statistical analysis and use visualization
CO3 techniques (box plots, heat maps, pivot tables) to explore data and identify patterns
or relationships.
Students will be able to develop, evaluate, and interpret simple and multiple
CO4 regression models, use polynomial regression, and build machine learning pipelines
for prediction and decision-making.
Students will be able to evaluate model performance using techniques like cross-
CO5 validation, identify overfitting and underfitting, and optimize models using methods
like Ridge Regression and Grid Search.

Unit – I: Introduction
Introduction to Data Science – Evolution of Data Science – Data Science Roles – Stages in a Data
Science Project – Applications of Data Science in various fields – Data Security Issues.
Unit – II: Data Collection and Data Pre-Processing
Data Collection Strategies – Data Pre-Processing Overview – Data Cleaning – Data Integration and
Transformation – Data Reduction – Data Discretization.
Unit – III: Exploratory Data Analytics
Descriptive Statistics – Mean, Standard Deviation, Skewness and Kurtosis – Box Plots – Pivot
Table – Heat Map – Correlation Statistics – ANOVA.
Unit – IV: Model Development
Simple and Multiple Regression – Model Evaluation using Visualization – Residual Plot –
Distribution Plot – Polynomial Regression and Pipelines – Measures for In-sample Evaluation –
Prediction and Decision Making.
Unit – V: Model Evaluation
Generalization Error – Out-of-Sample Evaluation Metrics – Cross Validation – Overfitting – Under
Fitting and Model Selection – Prediction by using Ridge Regression – Testing Multiple Parameters
by using Grid Search.
Syllabus CSE (Data Science) N.E.P. 2020

BOOKS
1. Jojo Moolayil, “Smarter Decisions : The Intersection of IoT and Data Science”, PACKT, 2016.
2. Cathy O’Neil and Rachel Schutt , “Doing Data Science”, O'Reilly, 2015.
3. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data Analytics”, EMC 2013
4. Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big Data Analytics”, IGI Global.

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
IV Semester

Course Title Introduction To Data Science Lab Course Code BCSE4P12

Teaching Hours / Week 02 Total Credits: 01

CIE 25 SEE 25

Course Objective
1
Understand the different career paths in Data Science and their respective skills.
.
2 Gain hands-on experience in the end-to-end data science process, from data collection to
. model evaluation
3
Develop, evaluate, and optimize machine learning models for practical applications.
.

Course Outcomes :
After completing the course, students will be able to
CO1 Recognize various roles in Data Science and the skills required for each.
Gain practical knowledge in handling data collection, preprocessing, analysis, and
CO2
model development.
Analyze and solve real-world challenges using Data Science in fields like healthcare,
CO3
finance, and marketing.
Build, evaluate, and optimize machine learning models using regression and other
CO4
techniques.
CO5 Address data security issues and ethical concerns in Data Science projects.

1. Exploring Data Science Roles and Careers

• Objective: Research and create a presentation on Data Science roles.
• Tools: Microsoft PowerPoint / Google Slides.
2. Data Collection from APIs
• Objective: Collect and store structured data using APIs (e.g., Twitter API, News API).
• Tools: Python (requests, JSON, pandas).
3. Data Cleaning and Pre-processing
• Objective: Handle missing values, remove duplicates, and fix inconsistent data.
• Tools: Python (pandas, NumPy).
4. Data Integration and Transformation
• Objective: Merge data from multiple sources and apply transformation techniques.
• Tools: Python (pandas), SQL.
Syllabus CSE (Data Science) N.E.P. 2020

5. Exploratory Data Analysis (EDA) with Visualization

• Objective: Compute descriptive statistics, box plots, and heatmaps.
• Tools: Python (pandas, Matplotlib, Seaborn).
6. Correlation Matrix and ANOVA
• Objective: Analyze feature correlation and perform ANOVA to compare groups.
• Tools: Python (Seaborn, scipy.stats, statsmodels).
7. Implementing Linear Regression
• Objective: Develop simple and multiple linear regression models.
• Tools: Python (scikit-learn).
8. Polynomial Regression and Model Comparison
• Objective: Implement polynomial regression and compare with linear regression.
• Tools: Python (scikit-learn, Matplotlib).
9. Creating Pipelines for Model Development
• Objective: Automate data preprocessing and model training.
• Tools: Python (scikit-learn).
10. Cross-Validation and Generalization Error
• Objective: Evaluate model performance using k-fold cross-validation.
• Tools: Python (scikit-learn).
11. Overfitting and Underfitting Demonstration
• Objective: Train models on sample datasets and analyze overfitting/underfitting.
• Tools: Python (scikit-learn, Matplotlib).
12. Hyper-parameter Tuning with Grid Search
• Objective: Optimize model performance using Grid Search.
• Tools: Python (scikit-learn).

Rashtrasant Tukadoji Maharaj Nagpur University

B. Tech. Computer Science & Engineering (Data Science)
IV Semester

Course Title Theory of Computation Course Code BCSE4T13

Teaching Hours / Week 03 Total Credits: 03

CIE 30 SEE 70

Course Objective
To give an overview of the theoretical foundations of computer science from the perspective
1.
of formal languages
2. To illustrate finite state machines to solve problems in computing

3. To familiarize Regular grammars, context frees grammar.

Syllabus CSE (Data Science) N.E.P. 2020

Course Outcomes :
After completing the course, students will be able to

CO1 Able to understand mathematical preliminaries, FSM, Moore and Mealy Machines

Understand the concepts of regular: sets, expression, grammar and Chomsky

CO2
Hierarchy
CO3 Able to understand CFG, CFL and PDA
CO4 Able to design Turing Machine and Types of TM

Understand the concepts of Decidability, Undecidability, recursively enumerable

CO5
languages, Halting problems, Post correspondence problem and Church Hypothesis

UNIT-I

Strings, Alphabet, Language operations, Finite state machine definitions, Finite automation
model, Acceptance of strings and language, Non deterministic finite automation, Deterministic
finite automation, Equivalence between NFA and DFA, Conversion of NFA into DFA,
Minimization of FSM, Equivalence between two FSM's Moore and Mealy machines
UNIT-II
Regular sets, Regular expressions, Identity rules, Manipulation rules, Manipulation of regular
expressions, Equivalence between RE and FA, Inter conversion, Pumping lemma, Closure
properties of regular sets (proofs not required), Chomsky hierarchy of languages, Regular
grammars, Right linear and left linear grammars, Equivalence between regular linear
programming and FA. Inter conversion between RE and RG.
UNIT-III
Context free grammar, Derivation trees, Chomsky normal form, Grelbach normal form, Push
down automata, Definition, Model acceptance of CFL, Equivalence of CFL and PDA, Inter
conversion, Closure properties of CFL(Proofs omitted), Pumping Lemma of CFL., Introduction
of DCFL. and DPDA
UNIT-IV
Turing Machine: Definition, Model of TM, Design of TM, Universal Turing Machine,
Computable function, Recursive enumerable language, Types of 'TM's (proofs not required),
Linear bounded automata and Context sensitive language, Counter machine
UNIT-V
Decidability and Undecidability of problems, Properties of recursive & recursively enumerable
languages, Halting problems, Post correspondence problem, Ackerman function, and Church's
hypothesis. Recursive Function: Basic functions and operations on them, Bounded
Minimalization, Primitive recursive function, p-recursive function, Primitive recursive predicates,
Mod and Div functions, Unbounded Minimalization, Equivalence of Turing Computable function
and -recursive function.

BOOKS
Text Books:-
1. Introduction to Automata Theory, Languages and Computation by J. E. Hopcraft, R. Motwani,
J. D Ullman, second Edition, Pearson Education, Aisa
2. An Introduction to Formal Languages and Automata by Peter Linz
3. Introduction to Langauges and the theory of Automata by John Martin, Third Edition (TMH)
Reference Books:
1. Theory of Computation, by Dr. O. G. Kakde, University Press (Laxmi Publication)
2. Elements of Theory of Computation by Lewis H.P and Papadimitiou C.H
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
IV Semester

Course Title Computer Networks Course Code BCSE4T14

Teaching Hours / Week 02 Total Credits: 02

CIE 30 SEE 70

Course Objectives
1. To understand the computer network architectures.
2. To make aware of design and performance perspective of network architectures.
3. To discuss current trends in communication

Course Outcomes :
After completing the course, students will be able to

Understand the fundamentals of computer networks, network models, and

CO1 communication protocols.
Analyze various transmission media, switching techniques, and data
CO2 communication principles.
Apply error detection techniques, MAC protocols, and routing algorithms for
CO3 efficient data communication.
Evaluate transport and application layer protocols along with network security
CO4 mechanisms.
Understand the fundamentals of computer networks, network models, and
CO5 communication protocols.

UNIT 1: Introduction to Computer Networks (6 Hours)

Use of computer networks in data science, Network hardware: LANs, MANs, WANs, Internetworks,
Network software: Protocol hierarchies, interfaces, and services, Connection-oriented vs.
connectionless services, Service primitives, relationship of services to protocols, OSI reference
model vs. TCP/IP reference model

UNIT 2: Data Transmission and Physical Layer (6 Hours)

Theoretical basis for data communication: Fourier analysis, bandwidth-limited signals, Maximum
data rate of a channel, Transmission media: Twisted pair, coaxial cable, fiber optics, Wireless
transmission: Microwave, satellite, and mobile communication, Multiplexing techniques,
Switching techniques: Circuit switching, packet switching, ATM networks: Virtual circuits vs.
circuit switching

UNIT 3: Data Link and Network Layer (7 Hours)

Data link layer: Design issues, error control, flow control, Error detection & correction: CRC,
Hamming code, Data link protocols: Stop-and-wait, sliding window (Go-Back-N, Selective Repeat),
Medium access control: ALOHA, CSMA/CD, CSMA/CA, IEEE 802.3 (Ethernet), IEEE 802.11 (Wi-Fi),
Network layer services: Routing, IP addressing, subnetting, Routing algorithms: Shortest path,
distance vector, link state routing, Congestion control: Traffic shaping, load shedding, choke
packets
Syllabus CSE (Data Science) N.E.P. 2020

UNIT 4: Transport and Application Layer (6 Hours)

Transport layer services: Flow control, error control, Transport protocols: TCP, UDP, Connection
management: Establishing & releasing connections, Multiplexing, crash recovery, Quality of
Service (QoS) in networks, Application layer protocols: HTTP, FTP, SMTP, DNS, Network security
fundamentals: Firewalls, encryption, secure communication

BOOKS
Text Books
1. Computer Networks, Andrew S. Tanenbaum, David J. Wetherall, Fifth Edition, Pearson
Education
2. Data Communication And Networking, Behrouz A. Forouzam, Fourth Edition,
McGraw Hill
3. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition, Pearson
Education
Reference Books
1. Jean Walrand , PravinVaraiya, High-Performance Communication Networks (The
Morgan Kaufmann Series in Networking), Second Edition, Morgan Kaufmann
Publishers
2. V. S. Bagad, I. A. Dhotre, Computer Communication Networks, Third Edition, Technical
Publications, Illustrated
3. Norman Abramson, Franklin F. Kuo, Computer-communication networks, Fourth
Edition, Prentice-Hall, 1973, Illustrated

e-Books
1. Fayez Gebali, Analysis of Computer and Communication Networks, First Edition,
Springer
2. An Introduction to Computer Networks, Peter L Dordal, Department of Computer
Science, Loyola University Chicago
(http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdf)
3. TCP/IP Network Administration, Craig Hunt

Rashtrasant Tukadoji Maharaj Nagpur University

B. Tech. Computer Science & Engineering (Data Science)
IV Semester

Course Title Computer Networks Lab Course Code BCSE4P14

Teaching Hours / Week 02 Total Credits: 01

CIE 25 SEE 25

List of Practical (Any 8-performance based and 1 virtual lab experiment)

1. Study of Networks and layered communications, understanding of Network
equipment, wiring in details.
2. Study of basic network command and Network configuration commands
3. Install and configure Network Devices: HUB, Switch and Routers
4. Introduction to Packet Tracer, creating of a LAN and connectivity test in the
LAN.
5. Configure a Network topology using packet tracer software
6. Overview of IP Addressing and sub-net masking.
7. Study of Basic Router Configuration, Static Routing Implementation.
8. Observing Static and Dynamic Routing
9. Packet capture and header analysis by wire-shark (TCP,UDP,IP)
10. Configuring a Cisco Router as a DHCP Server
11. Configuring RIP
Syllabus CSE (Data Science) N.E.P. 2020

Rashtrasant Tukadoji Maharaj Nagpur University

B. Tech. Computer Science & Engineering (Data Science)
IV Semester

Course Title Software Tools - I Course Code BVE4P02

Teaching Hours / Week 04 Total Credits: 02

CIE 50 SEE 50

Course Objective
1. Equip students with practical experience in using modern software tools and programming
languages essential for data science.
2. Introduce students to R and Julia, alongside established tools like Docker and Git, for
performing specialized tasks in statistical analysis, high-performance computing, version
control, and data visualization.

Course Outcomes :
After completing the course, students will be able to

CO1 Use Docker to containerize data science environments and workflows.

CO2 Leverage R for advanced statistical analysis and visualizations.
CO3 Use Julia for high-performance data analysis and optimization tasks.
Manage code and collaboration using Git for version control and project
CO4
management.

Unit 1: Introduction to Docker and Containerization

Introduction to Docker and containerization in data science. Building and managing Docker
containers for data science environments. Using Docker Compose for orchestrating multi-
container applications. Benefits of containerization for reproducibility and deployment.

Practical Exercises:
1. Create a Python-based Docker container for a data science project.
2. Use Docker Compose to manage a multi-container data science stack.
Unit 2: Data Science with R
Introduction to R for statistical computing and data analysis. Basic syntax and data manipulation
in R using dplyr. Data visualization with ggplot2. Building machine learning models in R using
caret. Advanced statistical analysis in R.
Practical Exercises:
1. Perform exploratory data analysis (EDA) on a dataset using R.
2. Visualize data trends and patterns with ggplot2.
3. Build a machine learning model in R using the caret library.
Unit 3: High-Performance Data Science with Julia
Introduction to Julia for high-performance data science and mathematical computing. Basic
syntax and operations in Julia. Data manipulation with DataFrames.jl. Visualization in Julia
using Plots.jl. Optimization and modeling with JuMP in Julia.
Practical Exercises:
1. Perform basic data manipulation and visualization in Julia using DataFrames.jl and
Plots.jl.
2. Solve optimization problems and perform advanced computations using JuMP.
Unit 4: Version Control with Git
Syllabus CSE (Data Science) N.E.P. 2020

Introduction to Git for version control and collaboration. Working with Git repositories (local
and remote). Branching, merging, and resolving conflicts. Using GitHub and GitLab for
project hosting and collaboration. Best practices for Git workflows (e.g., Git Flow, pull
requests).

Practical Exercises:
1. Set up a Git repository for a data science project and make commits.
2. Collaborate with others using GitHub to manage project versions and track changes.
3. Merge changes and resolve conflicts in a collaborative environment.

BOOKS
1) "R for Data Science" by Hadley Wickham and Garrett Grolemund
2) "Learning Julia" by Zacharias Voulgaris and Ranjan Sinha
3) "Docker for Data Science" by Josh Cook
4) "Pro Git" by Scott Chacon and Ben Straub (for Git)

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech. Computer Science & Engineering (Data Science)
IV Semester

Critical Thinking and Problem

Course Title Course Code BAE4T02
Solving

Teaching Hours / Week 2 Total Credits: 2

CIE 30 SEE 70

Course Objective
Develop critical thinking skills for problem identification and analysis in computational
1.
contexts.
Equip students with strategies to solve complex problems using structured approaches
2.
and logic.
Enhance the ability to evaluate, compare, and select optimal solutions based on data-
3.
driven insights.
Foster creativity and innovation in problem-solving by applying analytical methods in
4.
real-world scenarios.
Encourage collaboration and communication of ideas clearly and effectively within the
5.
scope of technical problems.

Course Outcomes :
After completing the course, students will be able to

Demonstrate the ability to identify and define problems and apply critical thinking
CO1
methods to evaluate solutions.
Apply logical and analytical techniques to solve computational problems, using
CO2
both algorithmic and heuristic approaches.
Develop structured problem-solving methods to assess problems, generate
CO3
solutions, and test the validity of solutions.
Assess and optimize solutions based on complexity, scalability, and efficiency
CO4
considerations.
Effectively communicate problem-solving processes and solutions, utilizing both
CO5
written and oral forms.
Syllabus CSE (Data Science) N.E.P. 2020

Unit 1: Introduction to Critical Thinking and Problem Solving

Definition and importance of critical thinking in problem-solving. Cognitive biases and their
impact on problem-solving. Introduction to the problem-solving life cycle (identification,
analysis, solution generation, implementation, and evaluation). Techniques for enhancing
logical thinking: Deductive and inductive reasoning. Analyzing real-world problems in Data
Science.
Unit 2: Problem-Solving Techniques
Algorithmic thinking: Problem breakdown and step-by-step approaches. Pseudocode and
flowcharting for designing solutions. Heuristic methods in problem-solving (e.g., trial and
error, rules of thumb). Application of divide and conquer, dynamic programming, greedy
algorithms. Problem-solving strategies in Data Science (e.g., classification, regression,
clustering).
Unit 3: Complex Problem Solving and Optimization
Strategies for solving complex problems in Data Science (multi-step problems). Optimization
techniques (greedy algorithms, dynamic programming, and backtracking). Analyzing time and
space complexity (Big O notation). Problem-solving in algorithmic design (sorting, searching,
graph algorithms). Case studies: Solving complex real-world Data Science problems.

Unit 4: Creativity and Innovation in Problem Solving

The role of creativity in solving non-trivial problems. Creative problem-solving techniques
(brainstorming, lateral thinking, mind mapping). Divergent and convergent thinking in Data
Science problem solving. Design thinking approach to solve data-driven problems. Case studies
on creative solutions in Data Science (e.g., recommendation systems, anomaly detection).
Unit 5: Communication and Collaborative Problem Solving
Effective communication of problem-solving steps and solutions. Collaboration techniques in
problem-solving (working in teams, agile methodologies). Writing and presenting technical
reports and documentation. Visualizing data and problem-solving processes. Peer review and
constructive feedback in collaborative settings.

BOOKS
1) "Critical Thinking: A Concise Guide" by Tracy Bowell and Gary Kemp
2) "The Art of Problem Solving, Vol. 1: The Basics" by Richard Rusczyk
3) "Thinking, Fast and Slow" by Daniel Kahneman
4) "How to Solve It: A New Aspect of Mathematical Method" by George Pólya
5) "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein (for
algorithmic problem-solving)

Environmental Science
Total Credits: 02 T Subject Code : BHM4T02
Teaching Scheme : Examination Scheme :
Lectures: 2 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
University Assessment: 70 Marks

Course Objectives
1 To aware about air and water pollution and its control techniques
To get students acquainted with environment pollution, waste management and laws related
2
to it.

Course Outcomes
After completion of syllabus, students would be able to
Identify different types of air pollution's as well as explain their causes, detrimental effects
1
on environment and effective control measures.
Syllabus CSE (Data Science) N.E.P. 2020

Recognize various sources of water pollutants and interpret their causes and design its
2
effective control measure
3 Illustrate various types of pollutants and waste management.
Analyze various social issues related to environment and challenges in implementation of
4
environmental laws.

SYLLABUS

Allotment Mapped
of with CO
Details of Topic Hours Number
L T/A CO
Unit-I Air pollution and its control techniques:
Contaminant behaviour in the environment, Air pollution due to
SOx, NOx, photochemical smog, Indoor air pollution Natural
pathways for degradation: Carbon cycle, Sulphur cycle, Nitrogen
cycle, Oxygen cycle. Factors responsible for altering the
composition of atmosphere (deforestation, burning of fossil fuels, 6 1
industrial and vehicular emissions, CFCs). Techniques to control
Air pollution, ambient air quality and continuous air quality
monitoring, Control measures at source, Kyoto Protocol, Carbon
Credits.
Unit -2 Water pollution and its control techniques:
Major sources of water pollution: Eutrophication, acid mine drains,
pesticides and fertilizers, dyeing and tanning, marine pollution,
micro plastics, Techniques to control water pollution: Conventional
waste water treatment-types of sewage, sewerage system,
alternative systems, primary, secondary and tertiary processes 6 2
including aerobic and anaerobic techniques, safe disposal and its
utility. Treatment schemes for waste water from dairy, textile, power
plants, pharmaceutical industries, and agro based industries such as
rice mills
Unit -3 Other Environmental Pollution & Waste Management:
Soil pollution: Soil around us, Soil water characteristics, soil
pollution.
Causes, effects & control : noise pollution, nuclear & radiation
hazards, marine pollution (Oil spills & Ocean Acidification)
Solid waste management: Composting, vermiculture, landfills,
hazardous waste treatment, bioremediation technologies, 6 3
conventional techniques (land farming, constructed wetlands), and
phytoremediation. Degradation of xenobiotics in environment:
Petroleum hydrocarbons, pesticides, heavy metals Introduction,
types of e-wastes, environmental impact, e-waste recycling, e-waste
management rules.
Unit -4 Social Issues and the Environmental Laws
Concept of Sustainable development, Water conservation, rain
water harvesting, watershed Management, Resettlement and
rehabilitation of people; its problems and concerns. Environmental
Laws (brief idea only)
Environment Protection Act, Air (Prevention and Control of
Pollution) Act, Water (Prevention and control of Pollution) Act,
6 4
Wildlife Protection Act, Forest Conservation Act Issues involved in
enforcement of environmental legislation. Different government
initiatives (brief idea only)- National ambient air quality standard
2009, Swachh Bharat Abhiyan, National afforestation program and
Act- 2016, National River conservation plan and National Ganga
River basin authority, Formation of National Green Tribunal
Syllabus CSE (Data Science) N.E.P. 2020

Activity
Field Trip & Report Writing Case-study & Report Writing

Reference Books
1) Benny Joseph, Environmental Studies, Mc Graw Hill Education (India) Private Limited
2) B. K. Sharma, Environmental Chemistry, Goel Publishing House, Meerut
3) P Aarne Vesilind, J. Jeffrey Peirce and Ruth F. Weiner, Environmental Pollution
and Control, Butterworth-Heinemann
4) D. D. Mishra, S. S. Dara, A Textbook of Environmental Chemistry and Pollution Control S.
Chand & Company Ltd.
5) Shree Nath Singh, Microbial Degradation of Xenobiotics, Springer-Verlag Berlin Heidelberg
6) Indian Environmental Law: Key Concepts and Principles edited by Shibani Ghosh, Publisher
Orient, Black Swan, 2019. ISBN, 9352875796.
7) P. Thangavel & Sridevi, Environmental Sustainability: Role of Green technologies,
Springer publications.

Rashtrasant Tukadoji Maharaj Nagpur University

B.Tech (COMPUTER SCIENCE & ENGINEERING (Data Science)
IV Semester
UNIVERSAL HUMAN
Course Title Course Code BVE4T02
VALUES
Teaching Hours / Week 02 Th Total Credits: 02
CIE 30 Marks SEE 70 Marks

Course Outcomes :
After completing the course, students will be able to
Understand the importance of human values and ethics for a harmonious life and
CO1
society.
Develop clarity about relationships, happiness, and prosperity from a holistic
CO2
perspective.
Apply universal human values in personal and professional life for ethical
CO3
decision-making.
Evaluate the role of human values in sustainable development and social well-
CO4
being.

UNIT 1
Introduction to Universal Human Values, Need and Importance of Universal Human Values,
Understanding Human Aspirations and Purpose of Life, Five Dimensions of Human Values:
Individual, Family, Society, Nature, and Existence
UNIT 2
Understanding the Self: "I" and the Body, Harmony of Thoughts, Behavior, and Work , Family
as the Fundamental Unit of Society, Trust and Respect in Relationships , Ethical Values in
Personal and Professional Life
UNIT 3
Society and Mutual Fulfillment: Humanistic Education, Health, and Justice, Universal Order:
Role of Ethics in Social Systems , Coexistence with Nature: Environmental Ethics and
Sustainability , Holistic Perspective on Economic and Technological Growth
UNIT IV
Holistic Development and Professional Ethics, Role of Human Values in Education, Science,
and Technology , Ethical Dilemmas in Professional Life and Their Resolution, Corporate Social
Responsibility (CSR) and Ethical Leadership

TEXT BOOK REFERENCE

1. "Human Values and Professional Ethics" – R.R. Gaur, R. Sangal, G.P. Bagaria. Publisher:
Excel Books
2. "Essence of Human Values" – A.N. Tripathi Publisher: New Age International
3. "Human Values" – Prof. A. Alavudeen, R. Kalil Rahman, and M. Jayakumaran Publisher:
Laxmi Publications
Syllabus CSE (Data Science) N.E.P. 2020

4. "Professional Ethics and Human Values" – M. Govindarajan, S. Natarajan, V.S.

Senthilkumar. Publisher: Prentice Hall India (PHI Learning)
Syllabus CSE (Data Science) N.E.P. 2020

Bachelor of Technology in Computer Science Engineering (Data Science)

Semester – IV (Open Electives – II)

Computer Networks
Total Credits: 02 T Subject Code : BOE4T01
Teaching Scheme : Examination Scheme :
Lectures: 2 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
Practical: 0 Hours/Week University Assessment:70 Marks
Course Category : OE-II BoS :CE

Course Objectives
1 The objective of the course is to equip the students with a general overview of the
concepts and fundamentals of computer networks.
2 Familiarize the students with the standard models for the layered approach to
communication between machines in a network and the protocols of the various layers.

Course Outcomes
After completion of syllabus, students would be able to
Understand the knowledge of the basic computer network & functions of each layer in
1
the OSI and TCP/IP reference model.
2 Understand the knowledge of network protocols & its working.
3 Understand the concepts of transport layer and its protocol.
4 Identify and gain the working of application layer and its protocol.

SYLLABUS

Mapped
Allotment
with
of
Details of Topic CO
Hours
Number
L T/A CO
UNIT 1:
Introduction - Network hardware & software, Reference models- The
OSI Reference Model - the TCP/IP, Topologies, Transmission
media, Datalink Layer-Ethernet, Token ring, wireless LANs, Issues
7 1
with data link Protocols, Encoding framing and error detection and
correction-sliding window Protocol-Medium access control

UNIT 2:
Network layer - Design issues, Routing algorithms, Congestion
control algorithms, Internetworking, Internet Protocol (IP), Classful 7 2
and Classless addresses, ARP, RARP,ICMP,IGMP

UNIT 3:
Transport layer - Design issues, Elements of transport protocol,
Congestion control, The Internet’s Transmission Control Protocol
5 3
(TCP), User Datagram Protocol (UDP), and Transport Services.

UNIT 4:
Syllabus CSE (Data Science) N.E.P. 2020

Application layer - Design issues, DNS, FTP, HTTP, SMTP, POP3,

IMAP 5 4

Text Books:
1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5th Edition. Pearson
Education/PHI

Reference Books:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TM

Cyber Laws
Total Credits: 02 T Subject Code : BOE4T02
Teaching Scheme : Examination Scheme :
Lectures: 2 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
Practical: 0 Hours/Week University Assessment:70 Marks
Course Category : OE-II BoS :CE

Course Objectives
1 To enable learner to understand, explore, acquire Cyber Law.
2 Develop Competencies For Dealing With Frauds And Deceptions & IT Acts.

Course Outcomes
After completion of syllabus, students would be able to
1 Understand the intellectual property issues emerging from cyberspace.
2 Understand cyber crime at global and Indian perspective
3 Understanding of relationship between commerce and cyberspace
4 Understand the Information Technology Act and legal frame work of right to privacy.

SYLLABUS
Mapped
Allotment
with
of
Details of Topic CO
Hours
Number
L T/A CO
UNIT 1:
Cyber laws and rights in today's digital age; IT Act, Intellectual
Property Issues connected with use and management of Digital Data,
6 1
Emergence of Cyberspace, Cyber Jurisprudence.

UNIT 2:
Cyber Crimes against Individuals, Institution and State, Hacking,
Digital Forgery, Cyber Stalking/Harassment, Cyber terrorism, Cyber 6 2
Defamation, Different offenses under IT Act, 2000,Cyber Torts.

UNIT 3:
Syllabus CSE (Data Science) N.E.P. 2020

E-commerce- Legal issues, E-commerce- Legal issues, Legal Issues

in Cyber Contracts, Cyber Contract and IT Act 2000,The
6 3
UNCITRAL Model law on Electronic Commerce

UNIT 4:
I.P.R. & Cyber Space, Intellectual Property Issues and Cyberspace –
The Indian Perspective, Overview of Intellectual Property related
Legislation in India, Copyright law & Cyberspace, Trademark law & 6 4
Cyberspace, Law relating to Semiconductor Layout & Design

Text Books:
1. The Information Technology act, 2000, Bare Act-Professional Book Publishers, New
Delhi.
2. Aparna Viswanathan, “Cyber Law- Indian and International Perspectives On Key
Topics Including Data Security, E-Commerce, Cloud Computing and Cyber Crimes”.

Reference Books:
1. "Cyber Law: Legal and Practical Considerations for Computer, E-commerce, and
Intellectual Property" by Brett J. Trout.
2. "Cyber law: Management and Entrepreneurship" by Patricia L. Bellia, Paul Schiff
Berman, and David G. Post4. Chris Reed & John Angel, Computer Law, OUP, New
York, (2007)
3. Web Link: https://onlinecourses.swayam2.ac.in/cec24_cs14/preview

Operating System
Total Credits: 02 T Subject Code : BOE4T03
Teaching Scheme : Examination Scheme :
Lectures: 2 Hours/Week Duration of University Exam : 03 Hrs.
Tutorials: 0 Hours/Week College Assessment: 30 Marks
Practical: 0 Hours/Week University Assessment:70 Marks
Course Category : OE-II BoS :CE

Course Objectives
1 Provide basic knowledge of computer operating system structures and functioning.
2 Understand various problems related to concurrent operations and their solutions.
3 Compare several different approaches to memory management, file management and
process management

Course Outcomes
After completion of syllabus, students would be able to
1 Outline the basic concept of operating systems
2 Analyze the working of operating system in process of scheduling/allocation approaches
3 Examine the working of deadlock and memory management.
4 Identify the working of File Management System.
Syllabus CSE (Data Science) N.E.P. 2020

SYLLABUS

Allotment Mapped
of with CO
Details of Topic Number
Hours
L T/A CO
UNIT 1:
Basics of operating systems: Definition, Types, Structure, Services,
System Calls, System Boot, System generation, System Design & 6 1
implementation

UNIT 2:
Process & CPU Scheduling: Process concept, operations on
process, Inter-Process Communication, Threads, Multithreading
Model, Process Scheduling, Scheduling Criteria, Scheduling 6 2
Algorithms
UNIT 3:
Deadlock & Memory Management: Deadlock Characterization,
Deadlock Prevention, Detection and Avoidance, Recovery form
Deadlock, Memory Management basic concept, memory allocation, 6 3
paging segmentation, virtual memory, page fault, page replacement
algorithm: FIFO, LRU, Optimal.
UNIT 4:
File Management: File Concept, Access Methods, Directory
Structure, File System Structure, Allocation Methods, Disk
Structure, Disk scheduling, Disk scheduling algorithms, Disk 6 4
Management.

Text Books:
1. Operating System Concepts – Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 8th edition,
Wiley-India, 2009.
2. Mordern Operating Systems – Andrew S. Tanenbaum, 3rd Edition, PHI 3. Operating Systems: A
Spiral Approach – Elmasri, Carrick, Levine, TMH Edition

Reference Books:
1. Operating system Third Edition, Achyut S. Godbole, Atul Kahate,Tata M GrawHill.
2. Operating system concepts & design -2nd Edition ,Milan Milenkovic Tata MGraw Hill.
3. D. M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw- Hill, 2013