School of Computer Science and Engineering

CURRICULUM AND SYLLABI

(2020-2021)
B. Tech. Computer Science and Engineering with Specialization in Data Science
School of Computer Science and Engineering

B. Tech (CSE) - Specialization in Data Science

CURRICULUM AND SYLLABUS

2020-2021
.
(
5
6
7
8
8
9
5
+
8
:
5
9
;
8
<
=
 VISION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY

Transforming life through excellence in education and research.

MISSION STATEMENT OF VELLORE INSTITUTE OF

TECHNOLOGY

World class Education: Excellence in education, grounded in ethics and

critical thinking, for improvement of life.
Cutting edge Research: An innovation ecosystem to extend knowledge and
solve critical problems.
Impactful People: Happy, accountable, caring and effective workforce and
students.
Rewarding Co-creations: Active collaboration with national & international
industries & universities for productivity and economic development.
Service to Society: Service to the region and world through knowledge and
compassion.

VISION STATEMENT OF THE SCHOOL OF COMPUTER SCIENCE AND

ENGINEERING

To be a world-renowned centre of education, research and service in computing and

allied domains.

MISSION STATEMENT OF THE SCHOOL OF COMPUTER SCIENCE

AND ENGINEERING

• To offer computing education programs with the goal that the students become
technically competent and develop lifelong learning skill.

• To undertake path-breaking research that creates new computing technologies and

solutions for industry and society at large.

• To foster vibrant outreach programs for industry, research organizations, academia

and society.

 B.Tech-CSE (Spl. in Data Science)

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

1. Graduates will be engineering practitioners and leaders, who would help

solve industry’s technological problems.

2. Graduates will be engineering professionals, innovators or entrepreneurs

engaged in technology development, technology deployment, or engineering

system implementation in industry.

3. Graduates will function in their profession with social awareness and

responsibility.

4. Graduates will interact with their peers in other disciplines in industry and

society and contribute to the economic growth of the country.

5. Graduates will be successful in pursuing higher studies in engineering or

management.

6. Graduates will pursue career paths in teaching or research.

 B.Tech-CSE (Spl. in Data Science)

PROGRAMME OUTCOMES (POs)

PO_01: Having an ability to apply mathematics and science in engineering

applications.
PO_02: Having a clear understanding of the subject related concepts and of
contemporary issues and apply them to identify, formulate and analyse complex
engineering problems.
PO_03: Having an ability to design a component or a product applying all the
relevant standards and with realistic constraints, including public health, safety,
culture, society and environment
PO_04: Having an ability to design and conduct experiments, as well as to
analyse and interpret data, and synthesis of information
PO_05: Having an ability to use techniques, skills, resources and modern
engineering and IT tools necessary for engineering practice
PO_06: Having problem solving ability- to assess social issues (societal, health,
safety, legal and cultural) and engineering problems
PO_07: Having adaptive thinking and adaptability in relation to environmental
context and sustainable development
PO_08: Having a clear understanding of professional and ethical responsibility
PO_09: Having cross cultural competency exhibited by working as a member or
in teams
PO_10: Having a good working knowledge of communicating in English –
communication with engineering community and society
PO_11: Having a good cognitive load management skills related to project
management and finance
PO_12: Having interest and recognise the need for independent and lifelong
learning
 B.Tech-CSE (Spl. in Data Science)

ADDITIONAL PROGRAMME OUTCOMES (APOs)

APO_01: Having an ability to be socially intelligent with good SIQ (Social

Intelligence Quotient) and EQ (Emotional Quotient)

APO_02: Having Sense-Making Skills of creating unique insights in what is

being seen or observed (Higher level thinking skills which cannot be codified)

APO_03: Having design thinking capability

APO_04: Having computational thinking (Ability to translate vast data in to
abstract concepts and to understand database reasoning

APO_05: Having Virtual Collaborating ability

APO_06: Having an ability to use the social media effectively for productive use

APO_07: Having critical thinking and innovative skills

APO_08: Having a good digital footprint

 B.Tech-CSE (Spl. in Data Science)

PROGRAMME SPECIFIC OUTCOMES (PSOs)

Year of Commencement: 2013

1. Apply computing theory, languages and algorithms, as well as mathematical

and statistical models, and the principles of optimization to appropriately

formulate and use data analysis.

2. Apply the principles and techniques of database design, administration, and

implementation to enhance data collection capabilities and decision-support

systems. Ability to critique the role of information and analytics in supporting

business processes and functions.

3. Invent and use appropriate models of data analysis, assess the quality of input,

derive insight from results, and investigate potential issues. Also to organize big

data sets into meaningful structures, incorporating data profiling and quality

standards.
 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING
B.Tech –CSE Specialization in Data Science
Proposed Curriculum (2020 -21)

Sl. NO Category Total No. of Credits

1 University Core 53
2 Programme Core 65
3 University Elective 12
4 Programme Elective 30
Total 160
University Core [53 Credits]

Sl.No Course Course Title L T P J C Pre-Req Category

Code
1 ENG1002 Effective English (Bridge Course) 0 0 4 0 Pass - H
2 ENG1901/ 0 0 2 4 A Pass in VIT
1902/1903 English for Engineers 2 EPT or H
ENG1002
3 CHY1701 Engineering Chemistry 3 0 2 0 4 - S
4 PHY1701 Engineering Physics 3 0 2 0 4 - S
5 MAT1011 Calculus for Engineers 3 0 2 0 4 - S
6 MAT2001 Probability and Statistics for 2 1 2 0
4 - S
Engineers
7 FLC4097 Foreign Language 2 0 0 0 2 - H
8 HUM1021 Ethics and Values 1 0 0 4 2 - H
9 CSE1001 Problem Solving and Programming 0 0 6 0 3 - E
10 CSE1002 Problem Solving and Object 0 0 6 0
3 - E
Oriented Programming
11 MGT1022 Lean Startup Management 1 0 0 4 2 - M
12 CSE3999 Technical Answers to Real Word 1 0 0 8
2 - E
Problems
13 CSE3099 Industrial Internship 0 0 0 0 1 - E
14 CSE4099 Capstone Project 0 0 0 0 12 - E
15 CSE4098 Comprehensive Examination 0 0 0 0 1 - E
16 STS4097 Soft Skills (6 courses) 3 0 0 0 6 - H
17 CHY1002 Environmental Science 3 0 0 0 0 - S
18 PHY999 Introduction to Innovative Projects 1 0 0 4 1 - S
19 EXC4097 Co/Extracurricular Activity 0 0 0 0 0 - M
Total 53 Credits

B.Tech (CSE-Specialisation in Data Science) Curriculum 1

 Program Core (65 credits) – CSE– 55 credits + DS -10 credits

Sl.No Course Course Title L T P J C Pre-Req Category

Code
1 MAT1014 Discrete Mathematics and Graph Theory 3 1 0 0 4 - S
2 EEE1001 Basic Electrical and Electronics 2 0 2 0 3 - E
Engineering
3 CSE1003 Digital Logic and Design 3 0 2 0 4 - E
4 CSE2001 Computer Architecture and Organization 3 0 0 0 3 - E
5 CSE2013 Theory of Computation 3 0 0 0 3 - S
6 CSE2010 Advanced C Programming 2 0 2 0 3 CSE1001 E
7 CSE2003 Data Structures and Algorithms 3 0 2 0 4 - E
8 CSE2011 Cryptography and Network Security 3 0 0 0 3 - E
9 CSE1004 Network and Communication 3 0 2 0 4 - E
10 CSE2004 Database Management System 3 0 2 0 4 - E

11 CSE2005 Operating Systems 3 0 2 0 4 - E

12 CSE2015 Internet Programming and Web 3 0 2 0 4 CSE2004 E
Technologies
13 CSE3035 Principles of Cloud Computing 3 0 2 0 4 - E
14 CSE1007 Java Programming 3 0 2 0 4 - E
15 CSE3050 Data Visualization & Presentation 3 0 2 0 4 - E
Total 55 Credits

Data Science Core – (10 Credits)

Sl.No Course Course Title L T P J C Pre-Req Category

Code
1 MAT1006 Mathematical Modeling for Data Science 2 0 2 0 3 - E

2 CSE3042 Programming for Data Science 3 0 2 0 4 - E

3 CSE3040 Predictive Analytics 2 0 0 4 3 - E

Total 10 Credits

B.Tech (CSE-Specialisation in Data Science) Curriculum 2

 Program Electives (30 Credits)

CSE [ Minimum 10 Credits]

Sl.No Course Course Title L T P J C Pre-Req Category

Code
1 MAT3004 Applied Linear Algebra 3 1 0 0 4 MAT2002 S
2 CSE4024 Advanced Java Programming 3 0 2 0 4 - E
3 CSE1006 Blockchain and Cryptocurrency 3 0 0 0 3 - E
Technologies
4 CSE4003 Cyber Security 3 0 0 4 4 - E
5 CSE3014 Computer Graphics 3 0 0 0 3 - E
6 CSE2014 Compiler Design 3 0 2 0 4 CSE2013 E
7 CSE4039 Distributed Computing Systems 3 0 0 0 3 - E
8 CSE3009 Internet of Things 3 0 0 4 4 - E
9 CSE4022 Natural Language Processing 3 0 0 4 4 - E
10 CSE3034 Nature Inspired Computing 3 0 0 0 3 - E
11 CSE2016 Microprocessor and Microcontrollers 3 0 2 0 4 - E
12 CSE4007 Mobile Computing 3 0 0 4 4 - E
13 CSE3022 Soft Computing 3 0 0 4 4 - E
14 CSE3039 Software Quality and Testing 3 0 0 0 3 - E
15 CSE3001 Software Engineering 2 0 2 4 4 - E
16 CSE4019 Image Processing 3 0 0 4 4 - E
17 CSE4037 Open Source Programming 3 0 2 0 4 - E
18 CSE3011 Robotics and its Applications 3 0 2 0 4 - E
19 CSE3501 Information Security Analysis and
2 0 2 4 4 - E
Audit
20 CSE3502 Information Security Management 2 0 2 4 4 - E
21 MAT2002 Applications of Differential and
DifferenceEquations 3 0 2 0 4 MAT1011 E

22 CSE2012 Design and Analysis of Algorithms 3 0 2 0 4 CSE2003 E

DS Electives [Minimum 10 Credits]

Sl.No Course Course L T P J C Pre-Req Category

Code Title
1 CSE3013 Artificial Intelligence 3 0 0 4 4 - E
2 BCD2002 Bayesian Data Analysis 3 0 0 4 4 - E

B.Tech (CSE-Specialisation in Data Science) Curriculum 3

 3 CSE3037 Big Data Analytics 3 0 0 4 4 - E
4 BCD2002 Business Intelligence and Analytics 3 0 0 0 3 - E
5 BCD3001 Cognitive Systems 3 0 0 4 4 - E
6 CSE3019 Data Mining: Concepts and 3 0 0 4 4 - E
Techniques
7 BCD3002 Data Modeling and Simulation 3 0 0 0 3 - E
8 CSE3038 Deep Learning 3 0 0 4 4 - E
9 BCD4001 Decision support systems and 3 0 0 0 3 - E
Intelligent systems
10 BCD4002 Information Extraction and Retrieval 3 0 0 0 3 - E

11 BCD4003 Intelligent Database System 3 0 0 4 4 - E

12 BCD4004 Knowledge Representation and

3 0 0 4 4 - E
Reasoning
13 CSE4020 Machine Learning 3 0 2 0 4 - E

14 CSE3014 Nature Inspired computing for Data

3 0 0 4 4 - E
Science
15 BCD4006 Time series analysis and Forecasting 3 0 0 0 3 - E

Notation: L-Lecture, T-Tutorial, P-Practical, J-Project, C-Credits

B.Tech (CSE-Specialisation in Data Science) Curriculum 4

Course code Data Structures and Algorithms L T P J C
CSE2003 3 0 2 0 4
Pre-requisite Nil Syllabus version
v. xx.xx
Course Objectives:
1. To understand the basic concepts of data structures and algorithms.
2. To differentiate linear and non-linear data structures and the operations upon them.
3. Ability to perform sorting and searchingin a given set ofdata items.
4. To comprehend the necessity of time complexity in algorithms.

Expected Course Outcome:

1. Understanding the fundamental analysis and time complexity for a given problem.
2. Articulate linear data structures and legal operations permitted on them.
3. Articulate non-linear data structures and legal operations permitted on them.
4. Applyinga suitable algorithm for searching and sorting.
5. Understanding graph algorithms, operations, and applications.
6. Understanding the importance of hashing.
7. Applying the basic data structures to understand advanced data structure operations and
applications.
8. Application ofappropriate data structures to find solutions to practical problems.

Student Learning Outcomes (SLO): 1,5,6,9,11

1. Having an ability to apply mathematics and science in engineering applications.
5. Having design thinking capability.
6. Having an ability to design a component or a product applying all the relevant standards and
with realistic constraints.
9. Having problem solving ability- solving social issues and engineering problems.
11. Having an interest in lifelong learning.

Module:1 Introduction to Algorithms and Analysis 6 hours CO:1

Overview and importance of algorithms and data structures. Fundamentals of algorithm analysis,
Space and time complexity of an algorithm, Types of asymptotic notations and orders of growth,
Algorithm efficiency – best case, worst case, average case, Analysis of non-recursive and recursive
algorithms, Asymptotic analysis for recurrence relation – Recursive Tree Method.

Module:2 Linear Data Structures 8 hours CO: 2,8

Array- 1D and 2D array , Stack - Applications of stack: Expression Evaluation - Conversion of
Infix to postfix and prefix expression, Tower of Hanoi.
Queue - Types of Queue: Circular Queue, Double Ended Queue (deQueue), Applications – Priority
Queue using Arrays - List - Singly linked lists – Doubly linked lists - Circular linked lists,
Applications -Polynomial Manipulation - Josephus problem(permutation)

Module:3 Sorting and Search Techniques 8 hours CO:4,8

Searching - Linear Search and binary search, Applications - Finding square root of ‘n’-Longest
Common Prefix
Sorting – Insertion sort - Selection sort – Bubble sort – (Counting Sort) - Quick sort- Merge sort ,
Analysis, Applications - Finding the ‘n’ closest pair’s

Module:4 Non-linear Data Structures - Trees 6 hours CO:5,8

Tree - Terminology, Binary Tree – Terminology and Properties, Tree Traversals, Expression Trees –
Binary Search Trees – operations in BST – insertion, deletion, finding min and max, Finding the kth
minimum element in a BST, Applications – Dictionary

Module:5 Non-linear Data Structures - Graphs 6 hours CO:3,8

Graph – basic definition and Terminology – Representation of Graph – Graph Traversal: Breadth First
Search (BFS), Depth First Search (DFS) - Minimum Spanning Tree: Prim's, Kruskal's- Single Source
Shortest Path: Dijkstra’s Algorithm.

Module:6 Hashing 4 hours CO:6,8

Hash functions, open hashing-separate chaining, closed hashing - linear probing, quadratic probing,
double hashing, random probing, rehashing, extendible hashing, Applications – Dictionary-
Telephone directory

Module:7 Heaps and Balanced Binary Search Trees 5 hours CO:7,8

Heaps - Heap sort, Applications -Priority Queue using Heaps
AVL trees – Terminology - basic operations(rotation, insertion and deletion

Module:8 Recent Trends 2 hours CO:8

Recent trends in algorithms and data structures
Total Lecture hours: 45 hours

Text Book(s)
1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms ,
Third edition, MIT Press, 2009.

2 Mark A. Weiss,Data Structures & Algorithm Analysis in C++, 3rd edition, 2008, PEARSON.

Reference Books
1. Kurt Mehlhorn, and Peter Sanders – Algorithms and Data Sturctures The Basic Toolbox,
Springer-Verlag Berlin Heidelberg, 2008.
2. Horowitz, Sahni, and S. Anderson-Freed , Fundamentals of Data Structures in C
UNIVERSITIES PRESS,Second Edition,2008.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Experiments (Indicative) CO:3,4,5
1. Implementation of Stack and its applications 4 hours
2. Implementation of queue and its applications 4 hours
3. Linked List 4 hours
4. Searching algorithm 2 hours
5. Sorting algorithm – insertion, bubble, selection etc. 2 hours
6. Randomized Quick sort and merge sort 2 hours
7. Binary Tree traversals 2 hours
8. Binary search tree 2 hours
9. DFS, BFS 3 hours
10. Minimum Spanning Tree – Prim’s and Kruskal’s 3hours
11. Single source shortest path algorithm – Connected Components and finding 2 hours
a cycle in a graph
Total Laboratory Hours 30 hours
Mode of evaluation:
Recommended by Board of Studies 09-09-2020
Approved by Academic Council No. 59 Date 24-09-2020