ST.

VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR

(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

Scheme of Examination - V Semester

Hours per
Credits Maximum Marks
Week
Sr Course
Course Title
No Code
Continual End Sem
L T P Total
Assessment Examination

-
1 DS501T Theory of Computation 3 - 3 30 70 100
Software Engineering and -
2 DS502T 2 2 15 35 50
Project Management
Machine Learning for Data
3 DS503T 3 - 3 30 70 100
Science
Machine Learning for Data
4 DS503P - - 2 1 25 25 50
Science Lab
5 DS504T Professional Elective-I 3 - 3 30 70 100
6 DS505P Computer Lab-II - - 2 1 25 25 50
7 DS506T Open Elective - I 3 - 3 30 70 100
Economics and
8 AS501T 4 4 30 70 100
Management
9 AS502T English for Engineers 2 2 25 25 50
Technical Skill
10 DS507P 2 1 50 - 50
Development
11 DS508P Career Development * 4 0 - - -
Total 20 0 10 23 255 495 750

* Career Development (Interpersonal Skills and Aptitude)

DS506T Open Elective - I DS504T Elective - I

Distributed Database &
DS506T(i) Data Analytics DS504T(i) Object Oriented
databases
Data Warehousing &
DS504T(ii)
Mining
Computer System
DS504T(iii)
Security

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

Scheme of Examination - VI Semester

Hours per
Credits Maximum Marks
Week
Sr Course
Course Title
No Code
Continual End Sem
L T P Total
Assessment Examination

- -
1 DS601T Operating System 3 3 30 70 100

Design and Analysis of -

2 DS602T 3 - 3 30 70 100
Algorithms
Design and Analysis of - -
3 DS602P 2 1 25 25 50
Algorithms Lab

Data Center Management

4 DS603T 3 - - 3 30 70 100
and Cloud Computing

5 DS604T Professional Elective-II 3 - - 3 30 70 100

6 DS605P Computer Lab III - - 2 1 25 25 50

7 DS606T Open Elective-II 3 4 30 70 100

Foundational Humanities
8 H 103/4 2 0
Elective
9 DS607P Project - I 2 2 50 50 100

10 DS608P Career Development* 4 0

11 DS609P Capstone Course – I ** 2 1 25 25 50
Total 17 0 12 21 275 475 750

* Career Development (Interpersonal Skills and Aptitude)

** Capstone Course – I (Comprehensive knowledge gained in Computer Science & Engineering (Data Science))

DS605T Open Elective - II Foundational Humanities Elective

DS605T(i) Business Intelligence H-103 Development of Societies
H-104 Philosophy
DS603T Professional Elective - II
DS603T(i) Soft Computing
DS603T(ii) Computer Vision
DS603T(iii) Cyber Laws and Ethics
DS603T(iv) Compiler Construction

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS501T Theory of Computation 3 - - 3
30 70 100

Course Objectives Course Outcomes

This course is intended Students will be able to
 To study the theoretical foundation of finite state machines  design the Finite State Machine with mathematical
and its application. representation.
 To study formal languages and related grammar.  define regular expression for the given Finite State
 To study basic computational function related to finite Machine and vice versa.
automaton.  represent context free grammar in various forms along
with its properties.
 design Push Down Automaton and Turing Machine as
FSM and its various representation.
 differentiate between decidable and undecidable
problems.

Unit I [7Hrs]
Strings, Alphabet, Language operations, Finite state machine definitions, Finite automation model, Acceptance of strings and
language, Non deterministic finite automaton, Deterministic finite automaton, Equivalence between NFA and DFA, Conversion of
NFA into DFA, Moore and Mealy machines.
Unit II [7Hrs]
Regular sets, Regular expressions, Identity Rule, 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 grammar and finite automaton, Inter conversion
between RE and RG.
Unit III [7Hrs]
Context free grammar, Derivation trees (Syntax tree and Parse tree), Ambiguous Grammar, Context Free Language (CFL),
Closure properties of CFL, Normal Form of grammar: Chomsky Normal form, Greibach normal form, CYK algorithm.
Unit IV [7Hrs]
Push Down Automaton, Turing Machine: Definition, Model of TM, Design of TM, Universal Turing Machine, Types of TM’s (proofs
not required), Turing Computable Functions, Linear bounded automaton.
Unit V [7Hrs]
Decidability and Undecidability of problems, Properties of recursive & recursively enumerable languages, Halting problems, Post
correspondence problem, Ackerman function, Recursive Function: Basic functions and operations on them, Primitive recursive
function, μ-recursive function, Bounded Minimization, Unbounded Minimization.
Text Books
S.N Title Authors Edition Publisher
nd
1 Introduction to Automata Theory, J. E. Hopcraft,R. 2 Edition Pearson Education,
Languages and Computation Motwani, J. D Ullman Aisa
rd
2 Theory of Computer Science, Automata, K. L. P. Mishra and N. 3 Edition PHI Learning.
Languages and Computation Chandrasekaran
Reference Books
S.N Title Authors Edition Publisher
nd
1 Introduction to Theory of Computation Sipser 2 Edition Cengage publications

2 An Introduction to Formal Languages Peter Linz

and Automata
3 Introduction to Langauges and the theory John Martin TMH Publication
of Automata
4 Elements of Theory of Computation Lewis H.P and
Papadimition C.H

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
Software Engineering and Project CA ESE Total
DS502T 2 - - 2
Management 15 35 50

Course Objectives Course Outcomes

This course is intended Students will be able to
 To provide understanding of software engineering  distinguish and apply software development techniques to
principles the different kinds of project.
 To enable students to understand stages involved in the  understand role of software engineer, analyze project
development of software project requirements and author a formal specification for a
 To get acquainted with software quality, reliability and software system.
software configuration management.  apply design process, steps for effective UI design
depending on the requirement of the project.
 design test cases, apply testing strategies and
demonstrate the ability to plan, estimate project.
 demonstrate the ability to work in development of software
using Agile-Scrum Development

Unit I [5Hrs]
What is Software?, Role of Software Engineer, software development phases Process Models: Waterfall Model, Prototype model
Evolutionary Models: Incremental model, Spiral Model, Agile process: Scrum, Extreme programming.

Unit II [5Hrs]
Requirements Engineering: Initiating the process, Eliciting Requirements, Building the Requirements Model, Negotiating,
Validating requirements, Requirements Analysis, Scenario-Based Analysis, Requirements Modeling strategies, Flow-Oriented
Modeling, Class based modeling, SRS.

Unit III [5Hrs]

Design: What is Design? Design Principles, Effective modular design, Design models: Data, Architectural Design. User Interface
Design: Rules, User Interface Analysis and Design.
Unit IV [5Hrs]
Software Testing: Testing Fundamentals, White Box Testing, Black Box Testing, Unit Testing, Integration Testing. Validation
Testing, Debugging. Software Projects: Project Planning objectives, Software Scope, Feasibility.

Unit V [5Hrs]
Software Quality Assurance: Concepts, Approaches, Software Quality Factor, Software Reviews, Software Reliability. Software
Configuration Management

Text Books
S.N Title Authors Edition Publisher
th
1 Software Engineering, A practitioner's Roger Pressman 7 Edition Tata Mcgraw Hill
approach
nd
2 Object Oriented Software Engineering Bernd Bruegge & 2 Edition,
Using UML Patterns and Java Allen H. Dutoit.

Reference Books
S.N Title Authors Edition Publisher
1 OOA and Design Grady Booch Ad. Wesly

2 OO Modeling and design Rambhaugh PHI

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS503T Machine Learning for Data Science 3 - - 3
30 70 100

Course Objectives Course Outcomes

This course is intended Students will be able to
 To introduce the basic concepts and techniques of  Apply various preprocessing techniques before solving the
machine learning. problems
 To understand major machine learning algorithms.  Use supervised machine learning techniques to solve different
 To identify machine learning techniques suitable for a problems.
given problem.  Apply probability based models to solve different problems.
 Apply statistical approach to the problem of pattern
classification
 Apply un-supervised and Reinforcement Learning techniques
to solve different problems

Unit I [7Hrs]

Foundations for ML: ML Techniques overview, Validation Techniques (Cross-Validations), Overfitting and under-fitting, Data
Normalization, Hypothesis Evaluation, Feature Reduction/Dimensionality reduction, Linear and Logistic regression.

Unit II [7Hrs]
Discriminative ML Methods: Classification and its use cases, Decision Tree, Algorithm for Decision Tree Induction, Creating a
Perfect Decision Tree, Confusion Matrix, Random Forest algorithm, Bagging and Boosting

Unit III [7Hrs]

Artificial Neural Network: Linear threshold units, Perceptron, Multilayer networks, Feature extraction, Feature selection
techniques: Filter Method, Wrapper Method, Dimensionality Reduction techniques: Introduction to PCA, LDA.

Unit IV [7Hrs]
Bayes Decision Theory: Bayes decision rule, Minimum error rate classification, Normal density and discriminant functions, Naïve
Bayes Classifiers, probably approximately correct (PAC) learning , Support Vector Machine.

Unit V [7Hrs]
Unsupervised Learning: Clustering (K means, Hierarchical Clustering), Reinforcement Learning, Elements of Reinforcement
Learning, Exploration vs. Exploitation dilemma, Q – Learning.

Text Books
S.N Title Authors Edition Publisher
1 Understanding Machine Learning: From Shalev-Shwartz,S., Ben- Cambridge University
Theory to Algorithms David,S Press
2 Pattern Recognition and machine learning Christopher Bishop Springer Verlag

Reference Books
S.N Title Authors Edition Publisher
1 Machine Learning- an Artificial Tom Mitchell 2nd Edition Morgan Kaufmann
Intelligence Approach
2 Algorithms for Clustering Data A. K. Jain and R. C. Dubes 5th Edition Prentice Hall PTR
3 Introduction to Machine Learning Ethem Alpaydin 2nd Edition PHI

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS503P Machine Learning for Data Science Lab 2 1
25 25 50

Course Objectives Course Outcomes

This course is intended Students will be able to
 To understand basic machine learning algorithm for  Apply various preprocessing techniques to prepare the data.
solving problem.  Use supervised machine learning techniques to solve
 To understand the usage of datasets in implementing different problems.
machine learning problems.  Apply probability based models to solve different problems.
 To understand various modern tools, packages and  Apply un-supervised and Reinforcement machine learning
techniques for machine learning. techniques to solve different problems.

Expt. No. Title of the experiment

1 To understand the usage of datasets in implementing machine learning problems.

To implement the concept of data pre-processing (Working with various data types, fixing values,
2 handling missing values and outliers, etc.) using public dataset.

3 To learn various modern tools, packages and techniques for machine learning.

4 To implement machine learning algorithm for solving problem.

Text Books
S.N Title Authors Edition Publisher
1 Understanding Machine Learning: From Shalev-Shwartz,S., Ben- Cambridge University
Theory to Algorithms David,S Press

2 Pattern Recognition and machine learning Christopher Bishop Springer Verlag

Reference Books
S.N Title Authors Edition Publisher
1 Machine Learning- an Artificial Tom Mitchell 2nd Edition Morgan Kaufmann
Intelligence Approach
2 Algorithms for Clustering Data A. K. Jain and R. C. Dubes 5th Edition Prentice Hall PTR
3 Introduction to Machine Learning Ethem Alpaydin 2nd Edition PHI

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
FIFTH SEMESTER

Course Code Course Name Th Tu Pr Credits Evaluation

Professional Ele – I : Distributed CA ESE Total
DS504T(i) 3 3
Database & Object Oriented databases 30 70 100

Course Objectives Course Outcomes

This course is intended Students will be able to
 concepts of distributed and object oriented database  Discuss basic concepts related to distribute DBMS.
management systems. Main focus is given to basic
 Exemplify design of distributed database.
concepts of DDBMS, distributed database design,
distributed query processing, distributed concurrency  Describe distributed query processing and concurrency
control, concepts of OODBMS, and language and
control.
design of object oriented database.
 Discuss basic concepts of OODBMS.
 Demonstrate language and design for distributed database.

[6Hrs]
Unit I
Introduction to Distributed Database: Distributed Data Processing, Concepts of Distributed Database. Distributed vs.
Centralized Database System; advantage and application. Transparency, performance and reliability, Problem areas of Distributed
Database. Integrity Constraints in Distributed databases.

Unit II [6Hrs]
Distributed Database Architectures : DBMS standardization, Architectural models for Distributed DBMS – autonomy,
distribution and heterogeneity, Distributed Database architecture – Client/Server , Peer – to – peer distributed systems, MDBMS
Architecture, Distributed Catalog management.
Unit III [8Hrs]
Distributed Database Design: Design strategies and issues. Data Replication. Data Fragmentation – Horizontal, Vertical and
Mixed. Resource allocation. Semantic Data Control in Distributed DBMS. Distributed Query Processing, Distributed
Transaction Management
Unit IV [8Hrs]
Object Oriented Database Concept: Data types and Object, Evolution of Object Oriented Concepts, Characteristics of Object
Oriented Data Model. Object Hierarchies – Generalization, Specialization, Aggregation. Object Schema. Enter-object
Relationships, Similarities and difference between Object Oriented Database model and Other Data models.
Unit V [8Hrs]
OODBMS Architecture Approach : The Object Oriented DBMS Architecture, Performance Issue in Object Oriented DBMS,
Application Selection for Object Oriented DBMS, the Database Design for an Object Relational DBMS. The Structured Types and
ADTs, Object identity, Extending the ER Model, Storage and Access Methods, Query Processing, Query Optimization, Data
Access API (ODBC, DB Library, DAO, ADO, JDBC, OLEDB), COBRA.

Text Books
S.N Title Authors Edition Publisher
1 Principles of Distributed Database Systems Ozsu, M. Tamer and Pearson Education
Patrick Valduriez
2 C.S.R. Prabhu PHI.
Object Oriented Database System – Approaches and
Architectures;,

Reference Books
S.N Title Authors Edition Publisher
1 Silberschatz, Abraham, Henry McGraw Hill
Database System Concepts F. Korth and S. Sudarshan
2 Database Management System –. Gerald V. Post McGraw Hill
3 Database Systems – Design, Peter Rob, Carlos Coronnel Course Technology.
Implementation and Management;

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
Professional Ele – I : CA ESE Total
DS504T(ii) 3 3
Data Warehousing & Mining 30 70 100

Course Objectives Course Outcomes

This course is intended Student will be able to
 familiar with the concepts of data warehouse and data  Understand the stages in building a Data Warehouse.
mining,  Apply various data preprocessing & data mining
 acquainted with the tools and techniques used for techniques to large data sets.
Knowledge Discovery in Databases.  Analyse multi-dimensional modelling techniques.
 able to perform classification and prediction of data.  Analyse and evaluate performance of algorithms for
Association Rules.
 Perform classification and clustering of data using suitable
classification and clustering algorithms.
 Compare and contrast different classifiers, different
clustering methods.

Unit I [8Hrs]
Data Warehousing and Business Analysis: - Data warehousing Components –Building a Data warehouse – Data Warehouse
Architecture – DBMS Schemas for Decision Support – Data Extraction, Cleanup, and Transformation Tools - Overview of ETL and
OLAP OLTP integration – comparison of OLAP with OLTP systems – ROLAP, MOLAP and HOLAP – Data Cube Computation
methods –Metadata – reporting tools – Query tools and Applications – Online Analytical Processing (OLAP) – OLAP and
Multidimensional Data Analysis – Data Warehouse implementation - Parallel execution – Materialized views. – Advanced SQL
support for OLAP.

Unit II [8Hrs]
Data Mining: - Fundamentals of Data Mining – Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data
Integration and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation- Efficient and Scalable
Data Mining Systems- Classification Of Data Mining Systems.
Basic concepts of Association Rule Mining: - Frequent Item set Mining Methods – Mining Various Kinds of Association Rules –
Association Mining to Correlation Analysis – Constraint-Based Association Mining.

Unit III [8Hrs]

Classification and Prediction: - Basic Concepts – Issues Regarding Classification and Prediction – Classification by Decision
Tree Induction – Bayesian Classification – Rule Based Classification – Lazy Learners – Classification by Back propagation –
Support Vector Machines – Associative Classification CSPE64– Rough set approach – Other Classification Methods – Prediction –
Accuracy Measures and Error Measures.

Unit IV [8Hrs]
Cluster Analysis: - Types of Data in Cluster Analysis - Measuring Data Similarity and Dissimilarity – A Categorization of Major
Clustering Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-
Based Clustering Methods – Clustering High-Dimensional Data – Constraint-Based Cluster Analysis – Outlier Analysis.

Unit V [8Hrs]
Mining Object, Spatial, Multimedia, Text and Web Data: Multidimensional Analysis and Descriptive Mining of Complex Data
Objects – Spatial Data Mining – Multimedia Data Mining – Text Mining – Mining the World Wide Web – Graph Mining – Mining
biological data, social networks – Mining time series and sequence data.

Text Books
S.N Title Authors Edition Publisher
1 Data Mining Concepts and Techniques Jiawei Han, Micheline Kamber and Jian Pei Third Elsevier
Reference Books
S.N Title Authors Edition Publisher
1 Introduction to Data Mining, 2007. Pang-Ning Tan, Michael Steinbach and Vipin Pearson
Kumar Education

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
2 Introduction to Data Mining with Case G. K. Gupta PHI
Studies
FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
Professional Ele – I : CA ESE Total
DS504T(iii) 3 3
Computer System Security 30 70 100

Course Objectives Course Outcomes

To prepare students with the technical knowledge and skills Students will be able to
needed to protect and defend computer systems and networks.  Understand common security terminology, threats,
vulnerabilities, and security design principles.
 Understand basic cryptography concepts, and specific
commonly used algorithms and protocols.
 Protect and defend computer systems and networks from
cybersecurity attacks.
 Expresses professional responsibilities and make
judgments based on legal and ethical principles in the
context of computing practice.
 Obtain hands-on experience in using common security
tools, such as firewalls, intrusion detection systems, and
port scanning software.

Unit I Concepts of Security [7Hrs]

The need for Security, Security Approaches, Principals of Security, Threats and attacks, Access control models, Efficiency and
Usability, Passwords, Social Engineering, Vulnerabilities from Programming Error .

Unit II Cryptography-I [8Hrs]

Number Theory: Prime numbers, Fermat’s Theorem, Chinese Remainder Theorem. Introduction to Classical ciphers: Affine,
Playfair, and Hill cipher. Block Cipher: DES, AES. Asymmetric Key Cryptosystems: RSA, Elgamal, Digital Signatures.

Unit III Cryptography-II [6Hrs]

Message Integrity and Authentication- Hash and MAC: SHA-512. Key Management: Kerberos, Diffie-Hellman, Digital Certificates,
PKI. Transport Layer Security-TLS, IP security, VPN, SSL, DNS security, Crypto Currency and Bitcoin.

Unit IV System Security [7Hrs]

Viruses, Worms, and other Malware: Virus and Worm Features, Internet Scanning Worms, Mobile Malware, and Botnets, Firewalls.

Unit V Practical Implementations of Security [7Hrs]

Cryptographic toolkits- Usage of real-life tools, Security and Operating Systems, Database security, Cloud security.

Text Books
S.N Title Authors Edition Publisher
1 Introduction to Computer Security Michael T. Goodrich Addison Wesley, 2011
and Roberto Tamassia
2 Cryptography and Network Security Atul Kahate 4e McGraw Hill

Reference Books
S.N Title Authors Edition Publisher
1 Cryptography and Network Security William Stallings 7e Pearson

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS505P Computer Lab-II 2 1
25 25 50

Course Objectives Course Outcomes

This course is intended Students will be able to
 To introduces and understand processes, tools, and  Understand the processes, tools, and methodologies used in
methodologies the software development lifecycle.
 to balance needs throughout the DevOps Methodology,  Combine software development and operations.
from coding and deployment to maintenance and  Make use of the Cloud Environment and its Services
updates.  Adopt an DevOps Methodology.

Expt. No. Title of the experiment

1 Introduction to SDLC, Agile and DevOps Methodology.

2 To Demonstrate Local Repository Management and Version Control Mechanism (VCS) Using Git.

3 To Demonstrate Remote Repository Management and Version Control Mechanism (VCS) Using GitHub.

To Demonstrate the concept of Branching in Local and Remote along with Conflict resolution mechanism
4 Using Git and GitHub.

To Demonstrate Build automation on the project available in remote repository (GitHub) using build tool
5 (MAVEN).

6 To demonstrate Jenkins tool installation and configuration over AWS Instance.

7 To Integrate Git, JDK, Maven and Jenkins for CICD Pipeline.

8 To Demonstrate Fully automate CICD Pipeline using Project Repository.

9 To Demonstrate configuration management, and application-deployment Using Ansible.

To Demonstrate platform as a service that use OS-level virtualization for software delivery Using Resource
10 Management and Configuration Using Docker.

Text Books
S.N Title Authors Edition Publisher

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
FIFTH SEMESTER

Course Code Course Name Th Tu Pr Credits Evaluation

CA ESE Total
DS506T(i) Open Elective – I - Data Analytics 3 3
30 70 100

Course Objectives Course Outcomes

This course aims to provide students with introductory Student will be able to
knowledge of several data analytic techniques that can  demonstrate basic data analytics concepts
be used for data science and business applications.  apply pre-processing techniques on collected data
 perform data computation and manipulation.
 perform data visualization.
 Perform exploratory data analysis.

Unit I [7Hrs]
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 [7Hrs]
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 [6Hrs]

Data computation - arrays Operations on arrays Indexing, slicing, and iterating Reading and writing arrays on files. Data
Manipulation - data structures & index operations, Reading and Writing data with different formats into Metadata for imported
Datasets.

Unit IV [6Hrs]
Data Visualization - Grids, axes, plots Markers, colors, fonts, and styling Types of plots - bar graphs, pie charts, histograms scatter
plots.

Unit V [7Hrs]
Exploratory Data Analytics: Descriptive Statistics – Mean, Standard Deviation, Skewness and Kurtosis – Box Plots –Pivot Table –
Heat Map, Generalization Error – Out-of-Sample Evaluation Metrics – Cross Validation – Overfitting – Under Fitting.

Text Books
S.N Title Authors Edition Publisher
1 Smarter Decisions : The Intersection of JojoMoolayil PACKT
IoT and Data Science
2 Doing Data Science Cathy O’Neil, Rachel O'Reilly
Schutt
3 Data Science and Big data Analytics David Dietrich, Barry EMC 2013
Heller, Beibei Yang
4 Handbook of Research on Cloud Raj, Pethuru IGI
Infrastructures for Big Data Analytics Global
5 The Data Science Design Manual Skiena, Steven S CRC press

Reference Books
S.N Title Authors Edition Publisher
1 Practical Data Science with R Nina Zumel, John Manning
Mount.
2 Data Science for business F. Provost, T Fawcett

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

FIFTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS507P 2 1
Technical Skill Development 50 50

Course Objectives Course Outcomes

This course is intended to understand how to create Students will be able to
applications using Full Stack Development techniques.  Make a choice from various front and back-end tools
 Understand and create applications on their own
 Design Web based solutions for real life problems
 Develop web-based application using suitable client side
and server-side code.
 Implement web-based application using effective database
access.

Expt. No. Title of the experiment

1 To create a website using HTML CSS and JavaScript.

2 To create a simple calculator Application using React JS
3 To create and Build a Password Strength Check using Jquery
4 Using the CMS design a web page using the drag and drop method.
5 Create a simple app landing page using Bootstrap.
6 To establish database connectivity using MySQL.
7 To perform insert/delete/update/join/etc. operations in MySQL.
8 Develop a working application/website by selecting a real-life problem statement (Mini-project).

Text Books
S.N Title Authors Edition Publisher
1. Full Stack JavaScript Development With Colin Ihrig 1st Edition
MEAN: MongoDB, Express, AngularJS,
and Node.JS, SitePoint
2. Learning PHP, MySQL, JavaScript, CSS Robin Nixon 3rd edition O'Reilly Media
& HTML5: A Step-by-Step Guide to
Creating Dynamic Websites

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
- - CA ESE Total
DS601T Operating System 3 3
30 70 100

Course Objectives Course Outcomes

This course is intended students will be able to
 Make the students familiar with the basics of Operating  Describe basic concept of Operating System
system  Identify and solve problems involving process management &
 Introduce the notion of process, various features of memory management.
process, CPU scheduling algorithm  Demonstrate security issues
 Discuss the goal and principles of system protection &
Security in modern computer system

Unit I [8Hrs]
Importance of Operating Systems, Basic Concepts and Terminology, An Operating System Acrhitecture, types of
Operating System ,Operating System as a Manager :Manager Memory Management Functions, Processor Management
Functions, Device Management Functions, Information Management Functions., Operating system concepts, Files and Security,
System calls for Process Management, for File Management and for Directory Management.

Unit II [8Hrs]
Management Processes Concept :Processes and Threads. Process Model and Thread Model. Job Scheduler, Process
Scheduling, operation on process,. Overview of Inter-process communication: Race Conditions, Critical Regions, Mutual Exclusion
with busy waiting etc. .CPU Scheduling: Introduction to Scheduling, Scheduling criteria, Scheduling Algorithms, Algorithm
Evaluation and Scheduling in different Systems.

Unit III [8Hrs]

Process Synchronization Synchronization Hardware, Semaphores, and Classical Problem of Synchronization, Monitors and
Atomic Transaction Introduction to Deadlocks: Graphical repersentaion of a deadlock,Deadlock strategies: Ignore a
deadlock,detect a deadlock ,Recover from a deadlock ,Prevent a deadlock,Avoid a deadlock

Unit IV [8Hrs]
Memory Management :Single Contiguous Memory Management ,Fixed Partition Memory Management : Introduction
,Allocation Algorithm,swapping ,relocation and address traslation Variable Parttion: Introduction ,Allocation Algorithm,swapping
,relocation and address traslation,Non-contigious Allocation -general concpts Paging ,Segmentation Virtual Memory
Management system :general concepts ,Page replacement algorithm

Unit V [8Hrs]
Operating system Security and protection :Introduction ,Security Threats ,Attacks on Security ,Security Violation through
parameters ,Computer Worms,Computer Virus:Types of virus,Infection method ,mode of operation , detection
,removal,prevention. Authentication :In centralised Environment ,Distibuted Environment Protection Mechnisum :Protection
Framwork ,Access Control List,Capabiltity List ,Combined Schemes

Text Books
S.N Title Authors Edition Publisher
1 Operating System A.Godbole 3rd Edition TMH
2 Operating System Concepts A.Silberschatz,Peter B. 8th edition
Galvin,Grag Gagne

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
- CA ESE Total
DS602T Design and Analysis of Algorithms 3 - 3
30 70 100

Course Objectives Course Outcomes

This course is intended to provide Student will be able to:
 Analysis of asymptotic performance of algorithms.  Apply various methods to solve recurrence relation and
 Analysis of asymptotic runtime complexity of algorithms analyze worst-case running times of algorithms using
including formulating recurrence relations. asymptotic notation.
 Understanding and way of designing of algorithms using  Implement greedy, divide & conquer algorithms and solve
greedy strategy, divide and conquer approach, dynamic recurrences describing the performance of each.
programming.  Understand dynamic-programming paradigm, analyze and
implement dynamic programming algorithms
 Describe the major graph algorithms and employ graphs to
model engineering problems
 Interpret the concepts of tractable and intractable
problems and the classes P, NP-Hard, and NP-Complete.

Unit I [8Hrs]
Mathematical foundation, Important summation, combinatorics and logarithmic formulas for algorithmic analysis, algorithmic design
principles, Review of asymptotic notations & growth of functions, Analysis Framework – Asymptotic Notations and its properties –
mathematical analysis for recursive and non-recursive algorithms, recurrences, solutions of recurrence relations using technique of
recursion tree method, substitution method, and master method, probability distributions, analyzing control structures.
Unit II [9Hrs]
Asymptotic notations for analysis of algorithms, best, worst case and average case analysis, amortized analysis and it’s
applications, analysis of sorting algorithms such as selection sort, insertion sort, bubble sort, heap sort, lower bound proof,
elementary and advanced data structures with operations on them and their time complexity, sorting networks.
Unit III [8Hrs]
Divide and conquer basic strategy, binary search, quick sort, merge sort, Fast Fourier Transform etc. Greedy method - basic
strategy, 0/1 knapsack problem, application to job sequencing with deadlines problem, Strassen’s Matrix Multiplication, minimum
cost spanning trees -Prim‘s algorithm and kruskal’s algorithm , single source shortest path - Dijkstra’s and Bellman Ford algorithm,
closest-pair and convex – hull problems etc.
Unit IV [9Hrs]
Dynamic Programming basic strategy, multistage graphs, all pairs shortest path Floyd Warshall algorithm, single source shortest
paths, optimal binary search trees, travelling salesman problem, matrix chain multiplication, longest common sub sequence
problem, Optimal Merge pattern – Huffman Trees.
Unit V [8Hrs]
Basic Traversal and Search Techniques, breadth first search and depth first search, connected components. Backtracking basic
strategy, 8-Queen’s problem, graph coloring, Hamiltonian Circuit Problem – Subset Sum Problem , randomized and approximate
algorithms, NP-hard and NP-complete problems, basic concepts, non-deterministic algorithms, NP-hard and NP-complete, Cook’s
Theorem, decision and optimization problems, polynomial reduction.

Text Books
S.N Title Authors Edition Publisher
1 Introduction to Algorithms Cormen T.H Prentice Hall of India

Reference Books
S.N Title Authors Edition Publisher
1 Computer Algorithms Horowitz, Sahani, Galgotia Publications
Rajsekharan Pvt. Ltd
2 Fundamentals of Algorithms Brassard, Bratley Prentice Hall
3 Data Structures and Algorithms Alfred V. Aho, John E. Reprint 2006 Pearson Education
Hopcroft , Jeffrey D.
Ullman

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
- - CA ESE Total
DS602P Design and Analysis of Algorithms Lab 2 1
25 25 50

Course Objectives Course Outcomes

This course is intended to provide Student will be able to:
 Analysis of asymptotic performance of algorithms.  Apply various methods to solve recurrence relation and
 Analysis of asymptotic runtime complexity of algorithms analyze worst-case running times of algorithms using
including formulating recurrence relations. asymptotic notation.
 Understanding and way of designing of algorithms using  Implement greedy, divide & conquer algorithms and solve
greedy strategy, divide and conquer approach, dynamic recurrences describing the performance of each.
programming.  Understand dynamic-programming paradigm, analyze and
implement dynamic programming algorithms
 Describe the major graph algorithms and employ graphs to
model engineering problems

Expt. No. Title of the experiment

1 Implementation and Time Analysis of sorting algorithms.Bubble Sort, Selection Sort, Insertion Sort,Merge
Sort and Quick Sort.
2 Implementation and Time Analysis of linear and binary search algorithms.
3 Implementation of Max-Heap sort algorithm.
4 Implementation and Time Analysis of factorial program using iterative and recursive method
5 Implementation of a knapsack problem using dynamic programming.
6 Implementation of chain matrix multiplication using dynamic programming.
7 Implementation of a knapsack problem using greedy method.
8 Implementation of Graph and Searching(BFS and DFS).
9 Implement Prim’s algorithm
10 Implement Kruskal’s algorithm.
11 Implement LCS problem.

Text Books
S.N Title Authors Edition Publisher
1 Introduction to Algorithms Cormen T.H Prentice Hall of India

Reference Books
S.N Title Authors Edition Publisher
1 Computer Algorithms Horowitz, Sahani, Galgotia Publications
Rajsekharan Pvt. Ltd
2 Fundamentals of Algorithms Brassard, Bratley Prentice Hall
3 Data Structures and Algorithms Alfred V. Aho, John E. Reprint 2006 Pearson Education
Hopcroft , Jeffrey D.
Ullman

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

SIXTH SEMESTER

Course Code Course Name Th Tu Pr Credits Evaluation

Data Center Management and Cloud CA ESE Total
DS603T 3 3
Computing 30 70 100

Course Objectives Course Outcomes

1. To understand Data center components, structure and Student will be able to
management.  To understand Data center and its components.
2. To understand Cloud Computing Service and  To understand Resource Management and Load Balancing in
Deployment models. data center.
3. To understand Cloud Infrastructure.  To understand Cloud Computing Service and Deployment
4. To understand Computing Services. models.
5. To understand Database, Networking and monitoring  To understand Computing and Database Services in cloud.
Services.  To understand Networking and monitoring Services in cloud

Unit I [6Hrs]
Introduction to Data Center: Data Center History, Components of Data centers, Data Center Tiers & Classes, Current Data
Center Standards, Data Center Topology
Data Center Structure, Data Center Construction, Data Center Space Relationships, Storage, Networks, Virtualization & Cloud,
High Availability Designs, Security components,, Multi-tier Applications

Unit II [6Hrs]
Data Canter Resource Management and Load Balancing: Distributed Management of Virtual Infrastructures, Server
consolidation, dynamic provisioning and resource management, Resource Optimization, Resource dynamic reconfiguration, Load
Balancing, various load balancing techniques.
Unit III [6Hrs]
Introduction to Cloud: Virtualization, Definition, Understanding and Benefits of Virtualization. Implementation Level of
Virtualization, Virtualization Structure and Mechanisms, Issues with virtualization, Cloud and Cloud Computing, Cloud Computing
Service Models, Cloud Computing Deployment Models.
Unit IV [8Hrs]
Computing and Database Services: Virtual machine, Security Groups, Authentication through Key-pair, Hardware Tenancy –
Shared vs. Dedicated, Understand cloud Storage , Block Store Its Features and Volume Type, File System and Its Features.
Cloud RDS and its benefits, Read Replica RDS, Authentication, DynamoDB, ElastiCache: Working, Redis vs Memcached,
RedShift, Kinesis
Unit V [8Hrs]
Networking and Monitoring Services: Networking Layer: VPC Elastic Network Interface (ENI) and Its Attributes, Different
Categories of IP Address, Public IP vs. Elastic IP, VPC – Benefits and Components, CIDR Notations, Network Access Control List
v/s Security Groups, NAT (Network Address Translation): NAT Devices, NAT Gateway and NAT instance, VPC peering. Monitor
related services.
Text Books
S.N Title Authors Edition Publisher
1 Cloud Computing Principles and Rajkumar Buyya, James Broberg, Wiley Publishers.2011
Paradigm
2 Cloud Security and Privacy An Enterprise Tim Mather, Subra Kumaraswamy O'Reilly
Perspective onRisks and Compliance
Reference Books
S.N Title Authors Edition Publisher
1 Distributed and cloud computing from Kai Hwang, Geoffrey C. Fox and Elsevier– 2012
Parallel Processing to the Internet of Jack J. Dongarra
Things
2 Cloud Computing : A Practical Approach Toby Velte, Anthony TVelte, Robert McGrawHill,2009
Elsenpeter

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS604P Computer Lab III 2 1
25 25 50

Course Objectives Course Outcomes

 To understand Data center components, structure and Student will be able to
management.  To understand Data center and its components.
 To understand Cloud Computing Service and  To understand Resource Management and Load
Deployment models. Balancing in data center.
 To understand Cloud Infrastructure.  To understand Cloud Computing Service and
 To understand Computing Services. Deployment models.
 To understand Database, Networking and monitoring  To understand Computing and Database Services in
Services. cloud.
 To understand Networking and monitoring Services in
cloud.

List of Experiments
1. To understand Data center and its components.
2. Sign-up for AWS free-tier account Explore Console and Configure CLI
3. User management through Identity Access Management (IAM)
4. Create an AMI Create an Elastic IP.
5. Host your website inside EC2 instance.
6. Storing an application data in MySQL DB using Relational Database Service (RDS) Creating Tables,
loading sample data and running queries
7. Create a Classic Load Balancer
8. Create a Non-default VPC and attach it to an EC2 instance
9. Accessing Internet inside Private Subnet using NAT Gateway
10. Connect two instances in different VPC’s using VPC peering

Text Books
S.N Title Authors Edition Publisher
1 Cloud Computing : A Practical Approach Toby Velte, Anthony McGrawHill,2009
TVelte, Robert
Elsenpeter
2 Learning Amazon Web Services (AWS): Mark Wilkins First Edition 1. Pearson, 2019
A Hands-On Guide to the Fundamentals
of AWS Cloud

Reference Books
S.N Title Authors Edition Publisher
1 AWS Certified Cloud Practitioner Anthony J. Sequeira Pearson, 2020.

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
CA ESE Total
DS603T(i) Soft Computing 3 3
30 70 100

Course Objectives Course Outcomes

The objective of this course is to Students will be able to
 familiarize with soft computing concepts  identify and describe soft computing techniques and their
 introduce and use the idea of Neural networks, fuzzy roles in building intelligent machines
logic and use of heuristics based on human experience  recognize the feasibility of applying a soft computing
 introduce and use the concepts of Genetic algorithm methodology for a particular problem
and its applications to soft computing using some  apply fuzzy logic and reasoning to handle uncertainty and
applications. solve engineering problems, genetic algorithms to
combinatorial optimization problems and neural networks to
pattern classification and regression problems
 effectively use modern software tools to solve real problems
using a soft computing approach and evaluate various soft
computing approaches for a given problem.
Unit I [8Hrs]
Soft Computing : Introduction of soft computing, soft computing vs. hard computing, various types of soft computing techniques,
applications of soft computing.
Artificial Intelligence : Introduction, Various types of production systems, characteristics of production systems, breadth first
search, depth first search techniques, other Search Techniques like hill Climbing, Best first Search, A* algorithm, AO* Algorithms.,
Prepositional and predicate logic, , forward Reasoning, backward reasoning, Weak & Strong Slot & filler structures, NLP.
Unit II [8Hrs]
Neural Network : Biological neuron, artificial neuron, definition of ANN, Perceptron training algorithm, Linear separability, learning
rule, ADALINE, MADALINE, different activation functions, EBPA, momentum, limitation, characteristics and application of EBPA,
Unit III [8Hrs]
Counter propagation network, Hopfield/ Recurrent network, associative memory, Hopfield v/s Boltzman machine. Adaptive
Resonance Theory: Architecture, classifications, Implementation and training.
Unit IV [8Hrs]
FUZZY SET THEORY: Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets –Member Function Formulation and
Parameterization – Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then Rules – Fuzzy
Reasoning – Fuzzy Inference Systems

Unit V [8Hrs]
NEURO FUZZY MODELING:Adaptive Neuro-Fuzzy Inference Systems ,Hybrid Learning Algorithm , Coactive Neuro Fuzzy
Modeling – Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum, Genetic algorithm : Fundamentals,
basic concepts, working principle, Applications & advances in GA
Text Books
S.N Title Authors Edition Publisher
1 Artificial Intelligence, , New Rich E and Knight K TMH
2 Neural Networks, Fuzzy Logic & S, Rajasekaran& G.A. PHI Publication.
Genetic Algorithms, Synthesis VijayalakshmiPai,
&applications,

Reference Books
S.N Title Authors Edition Publisher
1 Principles of Soft Computing, S.N. Sivanandam& S.N. Deepa Wiley Publications
2 Neural Network fundamental with Bose TMH
Graph , Algo.&Appl,

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)
SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
- CA ESE Total
DS603T(iv) Compiler Construction 3 - 3
30 70 100

Course Objectives Course Outcomes

This course is intended Students will be able to
 Provide an understanding of the fundamental principles in  Understand fundamentals of compiler and identify the
compiler design relationships among different phases of the compiler.
 Provide the skills needed for building compilers for various  Understand the application of finite state machines,
situations that one may encounter in a career in Computer recursive descent, production rules, parsing, and
Science. language semantics.
 Learn the process of translating a modern high-level  Analyze & implement required module, which may include
language to executable code required for compiler front-end, back-end, and a small set of middle-end
construction. optimizations.
 Use modern tools and technologies for designing new
compiler.

Unit I [8Hrs]
Introduction to Compilation Process, Compilers & Translators, Phase structure of Compiler, Design of Lexical Analysis.

Unit II [8Hrs]
Specifying Syntactic Structure of Programming Language using Context Free Grammars, The role of Parser, Top-down Parsing,
Bottom-Up Parsing, Predictive Parsers, Recursive Decent Parser.

Unit III [8Hrs]

Construction of efficient LR Parsers (SLR, CLR & LALR), Canonical Collection of set of items and construction of Parsing table,
Implementation of LR Parsing table.

Unit IV [8Hrs]
Syntax Directed Translation Scheme: Intermediate Code, Postfix notation, Parse tree and Syntax Trees, Three address codes,
quadruples, triples, Translation of Arithmetic Expression, Boolean expressions, Control Statements. Array references, Procedure
Calls, Declarations, Case Statements, Use of Compiler writing tools (Lex/ Flex, Yacc / Biason).

Unit V [8Hrs]
Symbol Tables: Contents, Representing scope information. Error detection and Recovery: Error handling, Lexical-phase, Syntactic
phase and semantic phase. The principle sources of optimization, Loop optimization, The DAG representation, Introductory Data
Flow analysis, Introduction to Code Generation: Object programs, Problems in Code Generation, Register allocation and
assignment, Code generation from DAG, Peephole optimization.

Text Books
S.N Title Authors Edition Publisher
1 Compilers Principles, Techniques & Alfred V. Aho, Jeffrey D. Ullman & Ravi 2 Pearson
Tools Sethi Education
2 Principles of Compiler Design by, Alfred V. Aho, Jeffrey D. Ullman Addison Wesley
Publication
Reference Books
S.N Title Authors Edition Publisher
1 Compiler Design Dr. O.G. Kakde Laxmi Publication
2 Introduction to Compiling Techniques : J.P. Bennett McGraw-Hill Publication
First Course Using ANSI C, Lex and
Yacc”, ,

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24
 ST. VINCENT PALLOTTI COLLEGE OF ENGINEERING & TECHNOLOGY,NAGPUR
(An autonomous institution affiliated to Rashtrasant Tukadoji Maharaj Nagpur University)
B. Tech. Scheme of Examination & Syllabus 2022-23
COMPUTER SCIENCE & ENGINEERING (DATA SCIENCE)

SIXTH SEMESTER
Course Code Course Name Th Tu Pr Credits Evaluation
- CA ESE Total
DS605T(i) Open Elective II :Business Intelligence 3 - 3
30 70 100

Course Objectives Course Outcomes

This course is intended Students will be able to
To enhance the ability of a student for examining Business  Explain the fundamentals of business intelligence
Intelligence (BI) as a broad category of applications and  Link data mining with business intelligence.
technologies for gathering, storing, analyzing, sharing and  Articulate modern BI concepts and practices, including
providing access to data to help enterprise users make better knowledge integration, sourcing and managing BI
managerial decisions solutions.
 Realize the crucial role that Business Intelligence plays in
careers as well as in business and society in the 21st
century.

Unit I [8Hrs]
Introduction : Data Definitions and Analysis Techniques:Elements, Variables, and Data categorization,Levels of
Measurement,Data management and indexing,Introduction to statistical learning and R-Programming
Descriptive Statistics:Measures of central tendency,Measures of location of dispersion, Practice and analysis with R
programming
Unit II [8Hrs]
Basic Analysis Techniques:Statistical hypothesis generation and testing,Chi-Square test,t-Test,Analysis of variance,Correlation
analysis,Maximum likelihood test
Data analysis techniques:Regression analysis,Classification techniques,Clustering,Association rules analysis
Unit III [8Hrs]
Case studies and projects:Understanding business scenarios,Feature engineering and visualization,Scalable and parallel
computing with Hadoop and Map-Reduce,Sensitivity Analysis
Business Intelligence Essentials: Introduction&Overview of BI ,Types of Business Intelligence, Business Intelligence Platform,
Dynamic roles in Business Intelligence, Roles of Business Intelligence in Modern Business- Challenges of BI, Creating Business
Intelligence Environment, Business Intelligence Landscape,

Unit IV [8Hrs]
Decision Making and Decision Support Systems: A BI perspective, Foundation and Technologies for decision
Making,Information gathering ,Managing BI,BI User Segmentation,Gathering BI Requirements, Introduction to Tableau.

Unit V [8Hrs]
Modeling and Analysis,Knowledge Management and Collaborative Systems,Strategic Approach to BISocial media, big data and
data mining,Business Analytics: Emerging Trends and Future Impacts

Text Books
S.N Title Authors Edition Publisher
1 Business Intelligence: The Savvy David Loshin Newnes
Manager's Guide
2 Business Intelligence: Practices, 1. Rajiv Sabherwal, Wiley & Sons.
Technologies, and Management Irma Becerra-
Fernandez.John
Reference Books
S.N Title Authors Edition Publisher
1 Business Intelligence: Making Decisions Jerzy Surma, Business Expert Press
Through Data Analytics, ,

February 2023 1 Applicable for

Chairman - BoS Dean – Academics Date of Release Version 2023-24