PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY

STUDENT
INFORMATION
HANDBOOK

DEPT. OF COMPUTER SCIENCE & ENGINEERING

SEMESTER-5

2022-23

P.O. LIMDA, [Link], [Link]

PH .0 2 6 6 8 - 260338
 PARUL UNIVERSITY
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY, LIMDA

Faculty Representative Detail

[Link]
Name of Faculty Class / Div. Mobile No E-mail ID

1 PRATIBHA SHAKYA 5CSE/B14 9926283584 Pratibha.shakya20256@[Link]

2 SANDEEP MEHTA 5CSE / B15 9468752955 Sandeep.mehta22424@[Link]

SUBJECT COORDINATORS

Sr. Initial of Subject

Faculty Name Email id Mobile No. Subject Name
No Faculty code
FORMAL LANGUAGE
Garima
1 GB garima.bargujar21604@[Link] 8698239505 AND AUTOMATA
Bargujar
THEORY
2 Charmi Purohit CP charmi.purohit20973@[Link] 7990655783 WEB PROGRAMMING
[Link]
3
bagi
RB randheer.bagi19507@[Link] 8052500223 DATA EXPLORATION
INFORMATION AND
4 [Link] N S LNS lokesh.s21882@[Link] 80730399966
NETWORK SECURITY
Bhavikkumar WIRELESS
5 BKK bhavikkumar.kataria19381@[Link] 9909310920
Katariya NETWORKS
DATA MINING AND
Gaurav
6 GV gaurav.varshney19340@[Link] 8979747750 BUSINESS
Varshney
INTELLIGENT
[Link]
7 PP purnendu.pandey21562@[Link] 7082408416 IOT BASED SYSTEM
Pandey
Faculty List Of Be-Cse Sem-5b14

Faculty List Of Be-Cse Sem-5b15

 [Link]. CSE SEM-5 Teaching Scheme

Internal External Passing Passin Tot

Marks Marks Marks g al
(Theory + Marks Mar
CE) (Practi ks
cal)
Code Cred Lect Lab Tut T P C T P Int. + Int. +
it E Ext. Ext.
Subject

Web Programming 3 3 0 0 20 - 2 60 - 40 - 1
0 0
0
Web Programming Laboratory 1 0 2 0 - 20 - - 30 - 25 5
0
Data Mining and Business Intelligence 3 3 0 0 20 - 2 60 - 40 - 1
0 0
0
Data Mining and Business Intelligence 1 0 2 0 - 2 - - 3 - 25 5
Laboratory 0 0 0
Information and Network security 3 3 0 0 2 - 2 6 - 40 - 1
0 0 0 0
0
Information and Network security Laboratory 1 0 2 0 - 2 - - 3 - 25 5
0 0 0
Data Exploration 3 3 0 0 2 - 2 6 - 40 - 1
0 0 0 0
0
Data Exploration Laboratory 1 0 2 0 - 2 - - 3 - 25 5
0 0 0
Formal Language & Automata Theory 3 3 0 0 2 - 2 6 - 40 - 1
0 0 0 0
0
Programming Skills and Placement Essentials 1 1 0 0 - - 1 0 - 40 - 1
0 0
0 0
Open Elective - 1 2 2 0 0 2 - 2 6 - 40 - 1
0 0 0 0
0
Total 22 18 8 0 9
0
0

Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical
Theory Passing % : 40 Practical Passing % : 50
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering

SYLLABUS FOR 5th Sem BTech PROGRAMME

Data Exploration Laboratory

Type of Course: BTech

Prerequisite: Basic knowledge of Image Processing and Programming languages.
Rationale: This course provides a broad introduction of data exploration and its techniques. It makes sense of
the volumes of data you have collected? Need to incorporate data-driven decisions into your process? This
course provides an overview of machine learning techniques to explore, analyze, and leverage data. You will
be introduced to tools and algorithms you can use to create machine learning models that learn from data, and
to scale those models up to data exploration problems.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme

Credit External Total
Lect Hrs/ Tut Hrs/ Lab Hrs/ Internal
Week
T P T CE P
30 20 50
Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

Study Material: [Link]

Course Outcome:
At the end of the course, you will be able to:
1. Design an approach to leverage data using the steps in the machine learning process.
2. Apply machine learning techniques to explore and prepare data for modeling.
3. Identify the type of machine learning problem in order to apply the appropriate set of techniques.
4. Construct models that learn from data using widely available open source tools.
5. Analyze data exploration problems using scalable machine learning algorithms
List of Practical:

1. Perform descriptive analysis and identify the data type.

2. Implement a method to find out variation in data. For example the difference between highestand lowest marks
in each subject semester wise. Consider dataset by yourself.

3. Plot the graph showing result of student in each semester.

4. Plot the graph showing the geographical location of students.

5. Plot the graph showing number of male and female students.

6. Implement a method to treat missing value for gender and missing value for marks.

7. Implement outlier detection for marks.

8. Write a program to implement feature selection techniques

9. Implement linear regression to predict the 5th semester result of student.

10. Implement logistic regression and decision tree to classify the student as average or clever.
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech PROGRAMME
Data Exploration

Type of Course: B. Tech.

Prerequisite: Basic knowledge of the volumes of data and its collection with programming languages.
Rationale: This course provides a broad introduction of data exploration and its techniques. It makes sense of the
volumes of data you have collected? Need to incorporate data-driven decisions into your process? This course
provides an overview of machine learning techniques to explore, analyze, and leverage data. You will be introduced
to tools and algorithms you can use to create machine learning models that learn from data, and to scale those
models up to data exploration problems.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme
Credit External Internal Total
Lect Hrs/ Tut Hrs/ Lab Hrs/
T P T CE P
60 20 20 100
Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

Contents:
Teaching
Sr. Topic Weightage
Hrs.

Introduction:

What is data Exploration?, Steps in Data Exploration, Data Exploration

1 Techniques, why is data exploration important in data analytics? , Tools 15% 6
Used in Data Exploration.

Data Exploration & Preparation:

Steps of Data Exploration and Preparation, Data Terminology, Data Exploration,

Data Exploration through Summary Statistics, Data
2 Exploration through Plots, Data Preparation, Data Quality, Addressing 25% 12
Data Quality Issues.
Missing Value Treatment, Why missing value treatment is required? Why data
has missing values? methods handle missing value
Techniques of Outlier Detection and Treatment. What is an outlier?, types of
outliers, causes of outlier, impact of outliers on dataset Method to detect
outlier, Method to remove outlier.
The Art of Feature Engineering, introduction to Feature Engineering, the process
of Feature Engineering, Variable Transformation, methods of variable
transformation, feature variable creation and its benefits, Feature Selection,
Dimensionality Reduction.
 Classification:

Classification, Building and Applying a Classification Model, Classification

20%
Algorithms, k-Nearest Neighbors, Decision Tree, Naïve Bayes.

Evaluation of Machine Learning Models for Data Exploration:

Generalization and Overfitting, Using a Validation Set, Metrics to Evaluate

20%
Model Performance, Confusion Matrix, Model Evaluation.

Regression, Cluster Analysis, and Association Analysis:

5 20%
Regression Overview, Linear Regression, Cluster Analysis, k-Means
Clustering, Association Analysis, Cluster Analysis.

*Continuous Evaluation:
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Reference Books:
1. Data Analysis and Graphics with R: Robert Kabacoff.
2. Introduction to Machine Learning with Python: A Guide for Data Scientists – By Andreas C.Müller
and Sarah Guido.

Course Outcome:

At the end of the course, you will be able to:

• Design an approach to leverage data using the steps in the machine learning process.
• Apply machine learning techniques to explore and prepare data for modeling.
• Identify the type of machine learning problem in order to apply the appropriate set of techniques.
• Construct models that learn from data using widely available open source tools.
• Analyze data exploration problems using scalable machine learning algorithms.
 FACULTY OF ENGG. & TECH. - PIET
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SEMESTER: 5TH
Name of Teachers: Dr. Randheer Bagi Hrs./Week: 3 hrs

Planned Date

Subject: Data Exploration

Sr.
Name of Topic Teaching Hrs 5B14 5B15
No.
Unit
Introduction:
1
1 Welcome to Data Exploration with Machine Learning,
1 01-Jun 30-May
2 Big Data Integration and Processing, 1 01-Jun 31-May
Machine Learning Overview, Categories Of Machine
3 Learning Techniques, 1 02-Jun 31-May

Machine Learning Process, Goals and Activities in the

4 Machine Learning Process, 1 08-Jun 06-Jun
5 Scaling Up Machine Learning Algorithms, 1 08-Jun 07-Jun
6 Tools Used in Data Exploration. 1 09-Jun 07-Jun

Unit 2 Data Exploration & Preparation:

1 Data Terminology, 1 15-Jun 13-Jun
2 Data Exploration, 1 15-Jun 14-Jun

3 Data Exploration through Summary Statistics, 1 16-Jun 14-Jun

4 Data Exploration through Plots, 1 22-Jun 20-Jun
5 Data Preparation, 1 23-Jun 21-Jun
6 Data Quality, 1 29-Jun 21-Jun
7 Addressing Data Quality Issues, 1 29-Jun 27-Jun

8 Feature Selection, Feature Transformation, 1 30-Jun 28-Jun

9 Dimensionality Reduction, 1 06-Jul 28-Jun
10 Handling Missing Values. 1 06-Jul 04-Jul

Unit 3 Classification:
1 Classification, 1 07-Jul 05-Jul
2 Classification, 1 13-Jul 05-Jul
3 Building and Applying a Classification Model, 1 13-Jul 11-Jul
4 Classification Algorithms 1 14-Jul 12-Jul
5 k-Nearest Neighbors, 1 20-Jul 12-Jul
6 Decision Tree 1 20-Jul 18-Jul
7 Decision Tree 1 21-Jul 19-Jul
8 Naïve Bayes. 1 27-Jul 19-Jul

Evaluation of Machine Learning Models for Data

Unit 4 Exploration:
1 Generalization and Overfitting, 1 27-Jul 25-Jul
2 Generalization and Overfitting, 1 28-Jul 26-Jul
3 Using a Validation Set, 1 17-Aug 26-Jul
4 Using a Validation Set, 1 17-Aug 01-Aug
5 Metrics to Evaluate Model Performance, 1 18-Aug 02-Aug
6 Metrics to Evaluate Model Performance, 1 24-Aug 02-Aug
7 Confusion Matrix, 1 24-Aug 16-Aug
8 Confusion Matrix, 1 25-Aug 16-Aug
9 Model Evaluation. 1 01-Sep 22-Aug
10 Model Evaluation. 1 01-Sep 23-Aug

Unit 5 Regression, Cluster Analysis, and Association Analysis:

1 Regression Overview, 1 07-Sep 23-Aug
2 Linear Regression, 1 07-Sep 29-Aug
3 Linear Regression, 1 08-Sep 30-Aug
4 Cluster Analysis, 1 14-Sep 30-Aug
5 Cluster Analysis, 1 14-Sep 05-Sep
6 k-Means Clustering, 1 15-Sep 06-Sep
7 k-Means Clustering, 1 21-Sep 06-Sep
8 Association Analysis 1 21-Sep 12-Sep
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech PROGRAMME
Data Mining

Type of Course: BTech

Prerequisite: Database Management System
Rationale: This course helps the students to understand the overall architecture of a data warehouse and methods
for data gathering and data pre-processing using OLAP tools. The different data mining models and techniques will
be discussed in this course. Data mining and data warehousing applications in bioinformatics will also be explored.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme
Credit External Total
Lect Hrs/ Tut Hrs/ Lab Hrs/ Internal
T P T CE P
60 20 20 100
Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

Contents:
Teaching
Sr. Topic Weightage
Hrs.
Introduction to data mining (DM):

Importance of Data Mining, Data Mining-Definition and Functionalities,

1 Classification of Data mining systems, Data mining Architecture, KDD,DM task 10% 6
primitives, Major Issues in Data Mining, Data mining Technologies,
Applications of Data Mining.

Overview and concepts Data Warehousing and BusinessIntelligence:

2 Reporting and Analysis of data, Raw data to valuable information - 5% 2

Lifecycle of Data, Business Intelligence, Relation between BI, DM andDW.

Data Warehousing and Online Analytical Processing:

Introduction, Motivation for Data Warehouse, Multitier Architecture, ETL 20% 6

process, Multidimensional Data Model, Schemas for Multidimensional
3 Data Models, Data Warehouse Models - Enterprise Warehouse, Data
Mart, and Virtual Warehouse, The Role of Concept Hierarchies, OLAPServer,
Typical OLAP Operations, Dimensional analysis.

Data Pre-processing:

Data Quality, Data Objects and Attribute Types, Basic StatisticalDescriptions

of Data, Data Visualization, Reasons of Missing Values,
4 &Noisy Data, Tasks in Data Preprocessing, Cleaning, Integration, 15% 6
Reduction, Transformation and Discretization, Concept HierarchyGeneration.
 Mining Frequent Patterns, Associations, and Correlations:

Market Basket Analysis, Association Rules, Multidimensional & Multilevel

association rules, Frequent Item sets, Frequent Itemset Mining Methods
Apriori algorithm, Improved Apriori algorithm, Pattern- Growth Approach: FP- 15%
growth, Generating Association Rules from Frequent Item sets, Interesting
Pattern Evaluation Methods, Correlationanalysis.

Classification:

Classification vs. prediction, Supervised learning, Approach to Classification:

Decision Tree Induction, Bayes Classification Methods, Rule-Based 15%
Classification, Model Evaluation and Selection, Advanced Classification
Methods.

Clustering:

Unsupervised learning, Cluster Analysis: Partitioning Methods,

10%
Hierarchical Methods, Density-Based Methods, Evaluation of
Clustering, Outlier Detection

Applications:

Introduction to spatial mining, multimedia mining, temporal mining, text 10%

mining and web mining with related algorithms.

*Continuous Evaluation:
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Reference Books:
1. Data Mining concepts and Techniques (Textbook)Jiawei Han, Micheline Kamber; Elsevier
2. Data Mining Techniques Arun K. Pujari; Universities Press
3. Modern Data Warehousing, Data Mining and Visualization George M. Marakas Pearson
4. Data Warehousing Reema Theraja; Oxford Press

COURSE OUTCOMES:

After undergoing the course, Students will be able to understand

1. Design a data mart or data warehouse for any organization
2. Develop skills to write queries using DMQL
3. Extract knowledge using data mining techniques
4. Adapt to new data mining tools.
5. Apply the techniques of clustering, classification, association finding, feature selection and visualizationto real
world data
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech PROGRAMME
Data Mining Laboratory

Type of Course: BTech

Prerequisite: Database Management System

Rationale: This course helps the students to understand the overall architecture of a data warehouse and methods for
data gathering and data pre-processing using OLAP tools. The different data mining models and techniques will be
discussed in this course. Data mining and data warehousing applications in bioinformatics will also be explored.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme
Credit External Total
Lect Hrs/ Tut Hrs/ Lab Hrs/ Internal
T P T CE P
30 20 50
Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

List of Practical:
1. Practical-1

Design and Create cube by identifying measures and dimensions for Star Schema, Snowflakeschema and
fact Constellation Schema.

2. Practical-2

Make an OLAP cube and perform Roll Up and Drill Down operations on it. Show the Apex andBase
cuboid for the same. Draw Star-net query model for the cube.

3. Practical-3

Create calculated member using arithmetic operators and member property of dimension member.

4. Practical-4

Design and Create cube by identifying measures and dimensions for Design storage using storagemode
MOLAP, ROLAP and HOLAP.

5. Practical-5
Perform Pre-processing on a dataset. Apply various Filters and discuss the effect of each filterapplied.
a. Handle Missing Values
b. Handle Infrequent Nominal Values
c. Derive an attribute from the existing attribute
d. Sampling
e. Discretization
1) Use Weka Tool 2) Use XL Miner Tool

6. Practical-6
Perform different binning techniques to smooth out the noise in the dataset. Make sure that the user should
have the choice to apply all the possible techniques. Show the output of different bins. Use histogram to
partition the dataset into groups.
 7. Practical-7

Perform regression on the data set using R programming.

8. Practical-8

Perform Association rule mining using WEKA tool.

9. Practical-9

Perform classification with WEKA tool.

f. using Decision Tree Classifier
g. using Naïve Bayes Classifier
h. using Multilayer Perceptron

10. Practical-10

Perform Clustering using WEKA tool

COURSE OUTCOMES:

After undergoing the course, Students will be able to understand

1. Design a data mart or data warehouse for any organization

2. Develop skills to write queries using DMQL
3. Extract knowledge using data mining techniques
4. Adapt to new data mining tools.
5. Apply the techniques of clustering, classification, association finding, feature selection and visualizationto real
world data
Name of Teacher: Gaurav
Varshney, Kishori Shekokar, Hrs. Per week:3
Rasna Patel
Planned Dates
Subject: DATA MINING

Sr.
Name of Topic 5B10 5B1 5B1 5B1
No 5B11 5B15
2 3 4
.
GV
KS GV RP RP RP
Introduction to data mining
1 30/5
(DM): Importance of Data 1/6 31/05 30/5 1/6 1/6
Mining
Introduction to data mining
2 (DM): Data Mining-Definition 01/06
2/6 02/06 31/5 2/6 2/6
and Functionalities
Introduction to data mining
3 02/06
(DM): Classification of Data 3/6 03/06
mining systems 3/6 3/6 3/6
4 Introduction to data mining 6/6
7/6 06/6
(DM): Data mining Architecture 8/6 8/6 8/6
5 Introduction to data mining 8/6
9/6 9/6 07/06 9/6 9/6
(DM): KDD
6 Introduction to data mining 9/6
10/6 10/6
(DM): KDD 10/6 10/6 10/6
7 Introduction to data mining
(DM): DM task primitives, 13/6
14/6 13/6
15/6 15/6 15/6
Major Issues in Data Mining
8 Introduction to data mining 15/6
(DM): Data mining Technologies, 16/6 13/6
Applications of Data Mining 16/6 16/6 16/6
9 Overview and concepts of Data
Warehousing and Business
Intelligence: Reporting and 16/6
17/6 14/6
Analysis of data, Raw data to
valuable information - Lifecycle 17/6 17/6 17/6
of Data
10 Overview and concepts of Data
Warehousing and Business 20/6
Intelligence: Business 21/6 17/6
Intelligence, Relation Between 22/6 22/6 22/6
BI,DM and DW
11 Data Warehousing and Online
Analytical Processing: 22/6 23/6 23/6 20/6 23/6 23/6
Introduction, Motivation for
Data Warehouse
12 Data Warehousing and Online
Analytical Processing: Multitier
23/6 24/6 24/6 21/6 24/6 24/6
Architecture, ETL process

13 Data Warehousing and Online

27/6
Analytical Processing: 28/6 24/6
Multidimensional Data Model 29/6 29/6 29/6
14 Data Warehousing and Online
Analytical Processing: Schemas 29/6
30/6 27/7
for Multidimensional Data 30/6 30/6 30/6
Models
15 Data Warehousing and Online
Analytical Processing: Schemas 30/6
1/7 01/7 28/6 1/7 1/7
for Multidimensional Data
Models
16 Data Warehousing and Online
Analytical Processing: Data
Warehouse Models - Enterprise 4/7
05/7 1/7
6/7 6/7 6/7
Warehouse,Data Mart, and
Virtual Warehouse
17 Data Warehousing and Online
Analytical Processing: The Role 6/7
7/7 4/7
7/7 7/7 7/7
of Concept Hierarchies
18 Data Warehousing and Online
Analytical Processing: OLAP 7/7
8/7 05/7
8/7 8/7 8/7
Server
19 Data Warehousing and Online 11/7
Analytical Processing: Typical 12/7 08/7
13/7 13/7 13/7
OLAP Operations
20 Data Warehousing and Online 13/7
Analytical Processing: 14/7 11/7
14/7 14/7 14/7
Dimensional analysis
22
Data Pre-processing: Data 14/7 15/7 15/7 15/7
Quality, Data Objects and 15/7 12/7
Attribute Types
23
Data Pre-processing: Basic 18/7 20/7 20/7 20/7
Statistical Descriptions of Data, 19/7 15/7
Data Visualization
24
Data Pre-processing: Reasons of
Missing Values, & Noisy Data, 20/7
21/7 18/7
Tasks in Data Preprocessing: 21/7 21/7 21/7
Cleaning
25
Data Pre-processing: Tasks in 21/7
Data Preprocessing: Integration, 22/7 22/7 19/7 22/7 22/7
Reduction
26
Data Pre-processing: Tasks in 25/7
Data Preprocessing: Integration, 27/7 26/7 22/7 27/7 27/7
Reduction
27
Data Pre-processing: Tasks in 27/7
Data Preprocessing: 28/7 28/7 25/7 28/7 28/7
Transformation
28 Data Pre-processing: 28/7
Discretization, Concept 29/7 29/7 26/7 29/7 29/7
Hierarchy Generation.
29 Mining Frequent Patterns,
Associations, and Correlations:
Market Basket Analysis, 1/8
12/8 02/8 29/7 12/8 12/8
Association Rules,
Multidimensional & Multilevel
association rules
30 Mining Frequent Patterns,
Associations, and Correlations: 17/8
17/8 12/8 01/8 17/8 17/8
Frequent Itemsets, Frequent
Itemset Mining Methods
31 Mining Frequent Patterns,
Associations, and Correlations: 18/8
17/8 16/8 02/8 17/8 17/8
Apriori algorithm, Improved
Apriori algorithm
32 Mining Frequent Patterns,
Associations, and Correlations: 22/8
18/8 18/8 12/8 18/8 18/8
Apriori algorithm, Improved
Apriori algorithm
33 Mining Frequent Patterns,
Associations, and Correlations: 24/8
Pattern-Growth Approach: FP- 18/8 23/8 16/8 18/8 18/8
growth, Generating Association
Rules from Frequent Itemsets
34 Mining Frequent Patterns,
Associations, and Correlations: 25/8
Pattern-Growth Approach: FP- 24/8 25/8 22/8 24/8 24/8
growth, Generating Association
Rules from Frequent Itemsets
35 Mining Frequent Patterns,
Associations, and Correlations: 25/8
24/8 26/8 23/8 24/8 24/8
Interesting Pattern Evaluation
Methods
36 Mining Frequent Patterns, 29/8
Associations, and Correlations: 25/8 30/8 26/8 25/8 25/8
Correlation analysis.
37 29/8
Classification: Classification vs. 25/8 01/9 29/8 25/8 25/8
prediction, Supervised learning
38 1/9
Classification: Approach to 26/8 01/9 30/8 26/8 26/8
Classification: Decision Tree
 Induction

39
Classification: Approach to 1/9
Classification: Decision Tree 26/8 02/9 30/8 26/8 26/8
Induction
40 5/9
Classification: Rule-Based 7/9 02/09 02/9 7/9 7/9
Classification
41 5/9
Classification: Bayes 7/9 06/09 02/09 7/9 7/9
Classification Methods
42 7/9
Classification: Model 7/9 06/9 5/9 7/9 7/9
Evaluation and Selection
43 7/9
Classification: Advanced 8/9 08/9 5/9 8/9 8/9
Classification Methods
44 8/9
Classification: Advanced 8/9 08/9 6/9 8/9 8/9
Classification Methods
45 8/9
Clustering: Unsupervised 9/9 09/9 06/9 9/9 9/9
learning
46 12/9 9/9 9/9 9/9 9/9
Clustering: Cluster Analysis: 09/9
Partitioning Methods
47 12/9
Clustering: Hierarchical 14/9 13/9 9/9 14/9 14/9
Methods
48 14/9
Clustering: Hierarchical 14/9 13/9 12/9 14/9 14/9
Methods
49 14/9
Clustering: Density-Based 15/9 15/9 12/9 15/9 15/9
Methods
50 15/9
Clustering: Density-Based 15/9 15/9 13/9 15/9 15/9
Methods
51 15/9
Clustering: Evaluation of 16/9 16/9 13/9 16/9 16/9
Clustering
52 19/9 16/9 16/9 16/9 16/9 16/9
Clustering: Outlier Detection
53 19/9
Applications: Introduction to 21/9 20/9 16/9 21/9 21/9
spatial mining
54
Applications: multimedia
21/9 20/9 19/9
mining, temporal mining
22/9 22/9 22/9

55
Applications: text mining and 21/9
web mining with related 22/9 20/9
23/9 23/9 23/9
algorithms
56
Applications: text mining and 22/9
web mining with related 23/9 23/9
23/9 23/9 23/9
algorithms
 PARUL UNIVERSITY - FACULTY OF ENGINEERING & TECHNOLOGY
Department of Civil Engineering
Syllabus for 5th Semester [Link]
Programme
Disaster Preparedness & Planning Management (203104346)
Type of Course: [Link]
Prerequisite: Environmental Studies

Rationale: This subject is conceptual applications of principles of management to mitigate various disasters.

Teaching and Examination Scheme:

Teaching Scheme
Examination Scheme
(Hrs./Week)
Credit External Internal Total
Lect Tut Lab
T P T CE P
2 0 0 2 60 00 20 20 00 100
Lect- Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

Contents:
Teaching
Sr. Topic Weightage
Hrs.
Introduction:
Introduction - Concepts and definitions: disaster, hazard, vulnerability,risks-
1. severity, frequency and details, capacity, impact, prevention, mitigation) 10% 03

Disasters:
Disasters - Disasters classification; natural disasters (floods, draught, cyclones,
volcanoes, earthquakes, tsunami, landslides, coastal erosion,soil erosion,
2. forest fires etc.); manmade disasters (industrial pollution,artificial flooding 25% 07
in urban areas, nuclear radiation, chemical spills, transportation accidents,
terrorist strikes, etc.); hazard and vulnerability profile of India, mountain and
coastal areas, ecological fragility.
Disaster Impacts:
Disaster impacts (environmental, physical, social, ecological, economic, political,
3. etc.); health, psycho-social issues; demographic aspects (gender, age, special 25% 08
needs); hazard locations; global and nationa disaster trends; climate change and
urban disasters.
Disaster Management Cycle and Framework:
Disaster Risk Reduction (DRR) - Disaster management cycle – its phases;
prevention, mitigation, preparedness, relief and recovery; structural and non-
structural measures; risk analysis, vulnerability andcapacity assessment;
early warning systems, Post-disasterenvironmental
4. 25% 08
response (water, sanitation, food safety, waste
management, disease control, security, communications); Roles and
responsibilities of government, community, local institutions, NGOs andother
stakeholders; Policies and legislation for disaster risk reduction,DRR
programmes in India and the activities of National Disaster Management
Authority.
Disasters, Environment and Development:
Factors affecting vulnerability such as impact of developmental projects and
5. environmental modifications (including of dams, land-use changes, urbanization 15% 04
etc.), sustainable and environmental friendly recovery; reconstruction and
development methods.
*Continuous Evaluation:
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Text/Reference Books:
1. [Link] (Home page of National Disaster Management Authority)
2. [Link] (National Disaster management in India, Ministry of Home Affairs)
3. Pradeep Sahni, 2004, Disaster Risk Reduction in South Asia, Prentice Hall.
4. Singh B.K., 2008, Handbook of Disaster Management: Techniques & Guidelines, Rajat Publication.
5. Ghosh G.K., 2006, Disaster Management, APH Publishing Corporation
6. Disaster Medical Systems Guidelines. Emergency Medical Services Authority, State of California, EMSAno.214,
June 2003
7. Inter Agency Standing Committee (IASC) (Feb. 2007).IASC Guidelines on Mental Health and
Psychosocial Support in Emergency Settings. Geneva: IASC

Course Outcome:

After Learning the course the students shall be able to:

1. Understand the application of Disaster Concepts to Management.

2. Analyze Relationship between Development and Disasters.
3. Apprehend categories of Disasters and
4. Realize the responsibilities of society towards Disaster Management.
 FACULTY OF ENGG. & TECH. - PIET
PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SEMESTER: 5TH

Name of Teacher: Alka Tomar, Hrs./Week: 2 hrs

Akshay Rathod Planned Date

Teaching
Sr. no. Name of Topic 5B14 5B15
hrs

UNIT-1 Introduction: 3 HRS

1 Introduction - Concepts and definitions 1 30/5 30/5
Disaster, hazard, vulnerability,
2/6 3/6
2 risks- severity, frequency and details 1
capacity, impact, prevention,
6/6 6/6
3 mitigation 1
UNIT-2 Disasters: 7 HRS
1 Disasters - Disasters classification 1 9/6 10/6
(floods, draught,
13/6 13/6
2 cyclones, volcanoes, earthquakes) 1
manmade disasters (industrial pollution,
16/6 17/6
3 artificial flooding in urban areas, 1
"nuclear radiation, chemical spills,
20/6 20/6
4 transportation accidents, terrorist strikes" 1
"hazard and vulnerability
23/6 24/6
5 profile of India" 1
6 mountain and coastal areas 1 27/6 27/6

7 ecological fragility 1 30/6 01/07

UNIT-3 Disaster Impacts: 8 HRS

1 Disaster impacts (environmental, physical, social, 1 4/7 4/7
ecological, economic,
political, etc.); 7/7 8/7
2 1
3 1 11/7 11/7
health, psycho-social issues; demographic aspects
4 (gender, age, special needs); 1 14/7 15/7

5 1 18/7 18/7
hazard locations
6 1 21/7 22/7
global and national
25/7 25/7
7 disaster trends 1
8 climate change and urban disasters. 1 28/7 29/7

UNIT-4 Disaster Management Cycle and Framework: 8 HRS

Disaster Risk Reduction (DRR) - Disaster
1/8 1/8
1 management cycle 1
phases; prevention, mitigation, preparedness, relief
18/8 12/8
2 and recovery; 1
3 structural and non-structural measures 1 22/8 22/8
 risk analysis, vulnerability and
25/8 26/8
4 capacity assessment; early warning systems 1
Post-disaster
environmental response (water, sanitation, food safety,
waste 29/8 29/8
management, disease control, security,
5 communications); 1
Roles and
responsibilities of government, community, local
1/9 2/9
institutions, NGOs and
6 other stakeholders; 1
7 Policies and legislation for disaster risk reduction, 1 5/9 5/9
DRR programmes in India and the activities of National
Disaster 8/9 9/9
8 Management Authority 1
UNIT-5 Disasters, Environment and Development: 4 HRS
Factors affecting vulnerability such as impact of
12/9 12/9
1 developmental projects 1
environmental modifications (including of dams, land-
use changes, 15/9 16/9
2 urbanization etc.), 1
3 sustainable and environmental friendly recovery 1 19/9 19/9

4 reconstruction and development methods 1 22/9 23/9

 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech PROGRAMME
Formal Language & Automata Theory

Type of Course: B. Tech

Prerequisite: Calculus, Data Structures, and Algorithms

Rationale: Formal Language & Automata Theory helps in natural language processing to solve a problemon a
model of computation, using an algorithm. It enables to learn in which machine can be made to think.
Teaching and Examination Scheme:

Teaching Scheme Examination Scheme

Credit External Total
Lect Hrs/ Tut Hrs/ Lab Hrs/ Internal
Week
T P T CE P
60 20 20 100
Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P – Practical

Contents:

Teaching
Sr. Topic Weightage
Hrs.
Introduction:

Alphabet, languages and grammars, productions and derivation,Chomsky 10%

hierarchy of languages.

Regular languages and finite automata:

Regular expressions and languages, deterministic finite automata (DFA) and

equivalence with regular expressions, nondeterministic finiteautomata (NFA) 20%
and equivalence with DFA, regular grammars and equivalence with finite
automata, properties of regular languages, pumping lemma for regular
languages, minimization of finite automata.

Grammars:

Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach

normal forms, nondeterministic pushdown automata (PDA) and equivalence
with CFG, parse trees, ambiguity in CFG, pumping lemma for context-free
languages, deterministic pushdown automata, closure properties of CFLs.
Context-sensitive languages: Context-sensitive grammars (CSG) and languages, 30% 10
linear bounded automata, and equivalence with CSG.
Turing machines:

The basic model for Turing machines (TM), Turing-recognizable (recursively 20% 7
enumerable) and Turing-decidable (recursive) languages and their closure
properties, variants of Turing machines, nondeterministic TMs and equivalence
with deterministic TMs, unrestricted grammars and equivalence with Turing
machines, TMs as enumerators.

Computable Functions: Primitive Recursive Functions, Bounded

Mineralization, Regular function, Recursive Functions, Partial, total, constant
10%
functions.
Undecidability:

Church Turing thesis, universal Turing machine, the universal and

10%
diagonalization languages, reduction between languages and Rice s theorem,
undecidable problems about languages.
*Continuous Evaluation:
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Reference Books:
1. Introduction to Automata theory, languages, and Computation (Textbook) John E. Hopcroft, Rajiv
Motwani, and Jeffery D. Ullman; Pearson
2. Elements of the Theory of Computation
Harry R. Lewis and Christos H. Papadimitriou; Pearson Education Asia Automata and
Computability
Dexter C. Kozen; Undergraduate Texts in Computer Science, Springer
3. Introduction to the Theory of Computation Michael Sipser; PWS Publishing
4. Introduction to Languages and The Theory of ComputationJohn Martin; Tata Mc Graw Hill

Course Outcome:
After Learning the course, the students shall be able to:
1. Create a formal notation for strings, languages, and machines.
2. Compare computability and non-computability and Decidability and undecidability
3. Understand The language whether it is regular or not.
4. Design finite automata to accept a set of strings of a language.

5. Design context-free grammar to generate strings of context-free language.

6. Determine the equivalence of languages accepted by Push Down Automata and languages
generated by context free grammar.

7. Write the hierarchy of formal languages, grammars, and machines.

 FACULTY OF ENGG. & TECH. - PIET

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SEMESTER: 5 TH

Name of Teachers: Garima Hrs./Week: 3 hrs

Bargujar
Planned Date

Subject: Formal Language &

Automata Theory

Sr. Name of Topic Teaching 5B1 5B2 5B3 5B4 5B5 5B6 5B7
No. Hrs

UNIT- Introduction: 6 hours

1

1 Alphabet 1 31/5 31/5 30/5 1/6 31/5 31/5 3/6

2 Languages and 1
01/6 01/6 1/6 3/6 2/6 01/6 6/6
grammars

3 Languages and 1
grammars 02/6 03/6 2/6 3/6 2/6 03/6 6/6

4 Productions and 1
07/6 07/6 6/6 8/6 3/6 07/6 10/6
derivation

5 Productions and 1
08/6 08/6 8/6 10/6 7/6 08/6 13/6
derivation

6 Chomsky hierarchy of 1
09/6 10/6 9/6 10/6 9/6 10/6 13/6
languages

UNIT- Regular languages 7 Hours

2 and finite automata:
 9 Regular expressions 1
14/6 14/6 13/6 15/6 10/6 14/6 17/6
and languages

10 Deterministic finite 1
automata
15/6 15/6 15/6 17/6 14/6 15/6 17/6
(DFA) and equivalence
with regular
expressions

11 Non-deterministic finite 1

automata (NFA) and 16/6 17/6 16/6 17/6 16/6 17/6 20/6
equivalence with DFA

12 Regular grammars and 1

equivalence with finite 21/6 21/6 20/6 22/6 17/6 21/6 20/6
automata

13 Properties of regular 1
22/6 22/6 22/6 24/6 21/6 22/6 24/6
languages

14 Pumping lemma for 1

23/6 24/6 23/6 29/6 23/6 24/6 24/6
regular languages

15 Minimization of finite 1
28/6 28/6 27/6 1/7 24/6 28/6 27/6
automata

UNIT- Grammars:
10 Hours
3

17 Context-free grammars 1
(CFG) and languages 29/6 29/6 29/6 1/7 28/6 29/6 27/6
(CFL)

18 Chomsky and Greibach 1

normal forms 30/6 01/6 30/6 6/7 30/6 01/6 1/7

19 Non-deterministic 1
pushdown automata
(PDA) 05/7 05/7 4/7 8/7 1/7 05/7 4/7

and equivalence with CFG

20 Parse trees 1 06/7 06/7 6/7 8/7 5/7 06/7 4/7

21 Ambiguity in CFG 1 07/7 08/7 7/7 13/7 7/7 08/7 8/7

 22 Pumping lemma for 1
context-free languages 12/7 12/7 11/7 15/7 8/7 12/7 11/7

23 Deterministic pushdown 1 13/7 13/7 13/7 15/7 12/7 13/7 11/7

automata

24 Closure properties of 1
CFLs
14/7 15/7 14/7 20/7 14/7 15/7 15/7

25 Context-sensitive 1
languages: Context-
sensitive grammars (CSG) 19/7 19/7 18/7 22/7 15/7 19/7 18/7
and languages

26 Linear bounded automata, 1

and equivalence with CSG 20/7 20/7 20/7 22/7 19/7 20/7 18/7

Turing machines:
UNIT-
4 7 Hours

27 The basic model for 1 21/7 22/7 21/7 27/7 21/7 22/7 22/7
Turing machines (TM)

Turing-
28 recognizable(recursively 1
enumerable) and Turing-
decidable (recursive)
languages 26/7 26/7 25/7 29/7 22/7 26/7 25/7

and their closure

properties

Turing-
28 recognizable(recursively 1
enumerable) and Turing-
decidable (recursive)
languages 27/7 27/7 27/7 29/7 26/7 27/7 25/7

and their closure

properties

variants of Turing
29 machines 1
28/7 29/7 28/7 12/8 28/7 29/7 29/7

30 nondeterministic TMs and 1

equivalence with 02/8 02/8 1/8 12/8 29/7 02/8 1/8
deterministic TMs

31 unrestricted grammars 1
and equivalence with 16/8 12/8 17/8 17/8 2/8 12/8 1/8
Turing machines
 TMs as
32 1
Enumerators 17/8 16/8 18/8 24/8 12/8 16/8 12/8

UNIT- Computable Functions:

6 Hours
5

33 Computable Functions: 1
Primitive Recursive 18/8 17/8 22/8 26/8 16/8 17/8 15/8
Functions

34 Bounded Mineralization 1 23/8 23/8 24/8 26/8 18/8 23/8 15/8

35 Regular function 1 24/8 24/8 25/8 3/9 23/8 24/8 19/8

Recursive Functions 1 25/8 26/8 29/8 3/9 25/8 26/8 22/8

Partial, total functions 1 30/8 30/8 1/9 7/9 26/8 30/8 22/8

36 Constant functions 1 01/9 02/9 5/9 9/9 30/8 02/9 26/8

UNIT- Undecidability:
6 Hours
6

37 Church Turing thesis 1 13/9 13/9 7/9 9/9 30/8 13/9 29/8

38 Universal Turing machine 1 14/9 14/9 8/9 14/9 1/9 14/9 29/8

39 The universal and 1

15/9 16/9 12/9 16/9 1/9 16/9 2/9
diagonalization languages

40 Reduction between 1
languages and Rice s
20/9 20/9 14/9 16/9 2/9 20/9 12/9
theorem

41 Reduction between 1
languages and Rice s
21/9 21/9 15/9 21/9 13/9 21/9 12/9
theorem

42 Undecidable problems 1 22/9 23/9 19/9 23/9 15/9 23/9 16/9

about languages.
 FACULTY OF ENGG. & TECH. - PIET

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SEMESTER: 5TH

Name of Teachers: Garima Bargujar Hrs./Week: 3 hrs

Planned Date

Subject: Formal Language & Automata

Theory

Sr. Name of Topic Teaching 5B8 5B9 5B10 5B11 5B12 5B13 5B14
No. Hrs

UNIT- Introduction: 6 hours

1

1 Alphabet 1
30/5 30/9 31/6 31/5 30/5 31/6 31/5

2 Languages and grammars 1

01/6 31/5 31/6 31/5 01/06 31/6 31/5

3 Languages and grammars 1

03/06 2/6 2/6 1/6 03/06 2/6 1/6

4 Productions and derivation 1

06/06 6/6 7/6 7/6 06/06 7/6 7/6

5 Productions and derivation 1

08/06 7/6 7/6 7/6 08/06 7/6 7/6

6 Chomsky hierarchy of languages 1

10/06 9/6 9/6 8/6 10/06 9/6 8/6

UNIT- Regular languages and finite

2 automata: 7 Hours
 9 Regular expressions and languages 1
13/06 13/6 14/6 14/6 13/6 13/06 13/06

10 Deterministic finite automata 1

(DFA) and equivalence with regular 15/06 14/6 14/6 14/6 14/6 15/06 14/06
expressions

11 Non-deterministic finite 1

automata (NFA) and equivalence with 17/06 16/6 16/6 15/6 16/6 17/06 17/06
DFA

12 Regular grammars and equivalence 1

with finite automata 20/06 20/6 21/6 21/6 20/6 20/06 20/06

13 Properties of regular languages 1

22/06 21/6 21/6 21/6 21/6 22/06 21/06

14 Pumping lemma for regular languages 1

24/06 23/6 23/6 22/6 21/6 24/06 22/06

15 Minimization of finite automata 1

27/06 27/6 28/6 28/6 23/6 27/06 24/06

UNIT- Grammars:
3 10 Hours

17 Context-free grammars (CFG) and 1

languages (CFL) 29/06 28/6 28/6 28/6 27/6 29/06 27/06

18 Chomsky and Greibach normal forms 1

01/07 30/6 30/6 29/6 28/6 01/07 28/06

19 Non-deterministic pushdown automata 1

(PDA)
04/07 4/7 5/7 5/7 30/6 04/07 29/06
and equivalence with CFG

20 Parse trees 1
06/07 5/7 5/7 5/7 4/7 06/07 04/07

21 Ambiguity in CFG 1
08/07 7/7 7/7 6/7 5/7 08/07 05/07

22 Pumping lemma for context-free 1

languages 11/07 11/7 12/7 12/7 7/7 11/07 06/07
 23 Deterministic pushdown automata 1
13/07 12/7 12/7 12/7 11/7 13/07 08/07

24 Closure properties of CFLs 1

15/07 14/7 14/7 13/7 12/7 15/07 11/07

25 Context-sensitive languages: Context- 1

sensitive grammars (CSG) and
18/07 18/7 19/7 19/7 14/7 18/07 12/07
languages

26 Linear bounded automata, and 1

equivalence with CSG 20/07 19/7 19/7 19/7 18/7 20/07 13/07

Turing machines:
UNIT-
4 7 Hours

27 The basic model for Turing machines 1

(TM) 22/07 21/7 21/7 20/7 19/7 22/07 15/07

Turing-recognizable(recursively
28 enumerable) and Turing-decidable 1
(recursive) languages
25/07 25/7 26/7 26/7 21/7 25/07 18/07
and their closure properties

Turing-recognizable(recursively
28 enumerable) and Turing-decidable 1
(recursive) languages
27/07 26/7 26/7 26/7 25/7 27/07 19/07
and their closure properties

variants of Turing machines

29 1
29/07 28/7 28/7 27/6 26/7 29/07 20/07

30 nondeterministic TMs and equivalence 1

with deterministic TMs 01/08 1/8 2/8 2/8 28/7 01/08 22/07

31 unrestricted grammars and 1

equivalence with Turing machines 12/08 12/8 2/8 2/8 1/8 12/08 25/07

TMs as
32 1
Enumerators 17/08 16/8 16/8 16/8 2/8 17/08 26/07

UNIT- Computable Functions:

5 6 Hours

33 Computable Functions: Primitive 1

Recursive Functions 22/08 18/8 16/8 16/8 16/8 22/08 27/07
 34 Bounded Mineralization 1
24/08 22/8 18/8 17/8 18/8 24/08 29/07

35 Regular function 1
26/08 23/8 23/8 23/8 22/8 26/08 01/08

Recursive Functions 1
29/08 25/8 23/8 23/8 23/8 29/08 02/08

Partial, total functions 1

02/09 29/8 25/8 24/8 25/8 02/09 12/08

36 Constant functions 1
12/09 20/8 30/8 30/8 29/8 12/09 16/08

UNIT- Undecidability:
6 6 Hours

37 Church Turing thesis 1

14/09 1/9 30/8 30/8 30/8 14/09 17/08

38 Universal Turing machine 1

16/09 12/9 1/9 31/8 1/9 16/09 22/08

39 The universal and 1

19/09 13/9 13/9 13/9 1/9 19/09 23/08
diagonalization languages

40 Reduction between languages and 1

Rice s
21/08 15/9 13/9 13/9 12/9 21/08 24/08
theorem

41 Reduction between languages and 1

Rice s
23/08 19/9 15/9 14/9 13/9 23/08 26/08
theorem

42 Undecidable problems about 1

languages. 23/08 20/9 20/9 20/9 15/9 23/08 29/08

FACULTY OF ENGG. & TECH. - PIET

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

 SEMESTER: 5TH

Name of Teachers: Garima Bargujar Hrs./Week: 3 hrs

Planned Date

Subject: Formal Language & Automata

Theory

Sr. Name of Topic Teaching 5B15 5B16 5B17 5B18 5B19 5B20 5B21
No. Hrs

UNIT- Introduction: 6 hours

1

1 Alphabet 1
30/5 31/5 30/5 31/5 1/6 30/5 30/5

2 Languages and grammars 1

01/6 1/6 02/6 1/6 1/6 31/5 2/6

3 Languages and grammars 1

03/06 2/6 03/6 1/6 2/6 3/6 3/6

4 Productions and derivation 1

06/06 7/6 06/06 7/6 8/6 6/6 6/6

5 Productions and derivation 1

08/06 8/6 09/06 8/6 8/6 7/6 9/6

6 Chomsky hierarchy of languages 1

10/06 9/6 10/06 8/6 9/6 10/6 10/6

UNIT- Regular languages and finite

2 automata:

9 Regular expressions and languages 1

13/06 14/6 13/6 14/6 15/6 13/6 13/6

10 Deterministic finite automata 1

(DFA) and equivalence with regular 15/06 15/6 16/6 15/6 15/6 14/6 16/6
expressions
 11 Non-deterministic finite 1

automata (NFA) and equivalence with 17/06 16/6 17/6 15/6 16/6 17/6 17/6
DFA

12 Regular grammars and equivalence 1

with finite automata 20/06 21/6 20/6 21/6 22/6 20/6 20/6

13 Properties of regular languages 1

22/06 22/6 23/6 22/6 22/6 21/6 23/6

14 Pumping lemma for regular 1

languages 24/06 23/6 24/6 22/6 23/6 24/6 24/6

15 Minimization of finite automata 1

27/06 28/6 27/6 28/6 29/6 27/6 27/6

UNIT- Grammars:
3 10 Hours

17 Context-free grammars (CFG) and 1

languages (CFL) 29/06 29/6 30/6 29/6 29/6 28/6 30/6

18 Chomsky and Greibach normal forms 1

01/07 30/6 1/7 29/6 30/6 1/7 1/7

19 Non-deterministic pushdown 1
automata (PDA)
04/07 5/7 4/7 5/7 6/7 4/7 4/7
and equivalence with CFG

20 Parse trees 1
06/07 6/7 7/7 6/7 6/7 5/7 7/7

21 Ambiguity in CFG 1
08/07 7/7 8/7 6/7 7/7 8/7 8/7

22 Pumping lemma for context-free 1

languages 11/07 12/7 11/7 12/7 13/7 11/7 11/7

23 Deterministic pushdown automata 1

13/07 13/7 14/7 13/7 13/7 12/7 14/7

24 Closure properties of CFLs 1

15/07 14/7 15/7 13/7 14/7 15/7 15/7
 25 Context-sensitive languages: 1
Context-sensitive grammars (CSG)
18/07 19/7 18/7 19/7 20/7 18/7 18/7
and languages

26 Linear bounded automata, and 1

equivalence with CSG 20/07 20/7 21/7 20/7 20/7 19/7 21/7

Turing machines:
UNIT-
4 7 Hours

27 The basic model for Turing machines 1

(TM) 22/07 21/7 22/7 20/7 21/7 22/7 22/7

Turing-recognizable(recursively
28 enumerable) and Turing-decidable 1
(recursive) languages
25/07 26/7 25/7 26/7 27/7 25/7 25/7
and their closure properties

Turing-recognizable(recursively
28 enumerable) and Turing-decidable 1
(recursive) languages
27/07 27/7 28/7 27/7 27/7 26/7 28/7
and their closure properties

variants of Turing machines

29 1
29/07 28/7 29/7 27/7 28/7 29/7 29/7

30 nondeterministic TMs and 1

equivalence with deterministic TMs 01/08 2/8 01/8 02/8 17/8 1/8 1/8

31 unrestricted grammars and 1

equivalence with Turing machines 12/8 16/8 12/8 16/8 17/8 2/8 12/8

TMs as
32 1
Enumerators 17/8 17/8 18/8 17/8 18/8 12/8 18/8

UNIT- Computable Functions:

5 6 Hours

33 Computable Functions: Primitive 1

Recursive Functions 22/8 18/8 22/8 20/8 24/8 16/8 22/8

34 Bounded Mineralization 1
24/8 23/8 25/8 23/8 24/8 22/8 25/8

35 Regular function 1
26/8 24/8 26/8 24/8 25/8 23/8 26/8
 Recursive Functions 1
29/8 25/8 29/8 24/8 1/9 26/8 29/8

Partial, total functions 1

2/9 30/8 1/9 30/8 14/9 29/8 1/9

36 Constant functions 1
12/9 1/9 2/9 13/9 14/9 30/8 2/9

UNIT- Undecidability:
6 6 Hours

37 Church Turing thesis 1

14/9 13/9 12/9 14/9 15/9 2/9 12/9

38 Universal Turing machine 1

16/9 14/9 15/9 14/9 15/9 12/9 15/9

39 The universal and 1

19/9 15/9 16/9 20/9 21/9 13/9 16/9
diagonalization languages

40 Reduction between languages and 1

Rice s
21/9 20/9 19/9 20/9 21/9 16/9 19/9
Theorem

41 Reduction between languages and 1

Rice s
23/9 21/9 22/9 21/9 22/9 19/9 22/9
Theorem

42 Undecidable problems about 1

languages. 23/9 22/9 23/9 21/9 22/9 20/9 23/9
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech Programme
Information and Network Security Laboratory

Type of Course: B Tech

Prerequisite: Students should be familiar with basic concepts of Software Flaws, Data Structures,
andMathematics including Random numbers, Number theory, and finite fields.

Rationale: This course introduces the fundamental principles of cryptography and its applications in thenetwork
security domain as well as the software development domain. This subject covers various important topics
concerned with information security like symmetric and asymmetric cryptography, hashing, message and user
authentication, digital signatures, key distribution, and an overview of the malware technologies. The subject also
covers the applications of all of these in real-lifesituations.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme
Credit External Internal Total
Lect Hrs/ Tut Hrs/ Lab Hrs/
Week Week Week
T P T CE P
30 20 50

Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

List of Practical:

1. Implement Caesar cipher encryption-decryption

2. Implement Monoalphabetic cipher encryption-decryption

3. Implement Playfair cipher encryption-decryption

4. Implement Polyalphabetic cipher encryption-decryption

5. Implement Hill cipher encryption-decryption

6. Implement Simple Transposition encryption-decryption

7. Implement One time pad encryption-decryption

8. Implement Diffi-Hellmen Key exchange Method

9. Implement RSA encryption-decryption algorithm

10. Demonstrate working of Digital Signature using Cryptool

 Course Outcome:
After Learning the course, the students shall be able to:
1. Define the concepts of Information security and their use.
2. Describe the principles of symmetric and asymmetric cryptography.
3. Understand the concepts of hashing with algorithms and apply them.
4. Understand and use message authentication and its requirement.
5. Understand the concepts of digital signature and digital certificates.
6. Understand and use the various key management and remote authentication mechanisms.
7. Understand the concept of system and software security.
8. Understand vulnerabilities in software flaws and concept of malware.
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech Programme
Information and Network Security

Prerequisite: Students should be familiar with basic concepts of Software Flaws, Data Structures,
andMathematics including Random numbers, Number theory, and finite fields.

Rationale: This course provides an introduction to the fundamental principles of cryptography and its applications
on the network security domain as well as software development domain. This subject covers various important
topics concern to information security like symmetric and asymmetric cryptography, hashing, message and user
authentication, digital signatures, key distribution and overview of the malware technologies. The subject also
covers the applications of all of these in real lifesituations.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme
Credit External Internal Total
Lect Hrs/ Tut Hrs/ Lab Hrs/
Week Week Week
T P T CE P
60 20 20 100

Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

Contents:
Teaching
Sr. Topic Weightage
Hrs.
Introduction:

Computer Security Concept, The OSI Security Architecture, Security Attacks,

Security Services, Security Mechanism, A Model for NetworkSecurity, 5%

Classical Encryption Techniques:

Symmetric Cipher Model, Cryptanalysis, Cryptanalysis Attacks, Substitution
Techniques: Caesar Cipher, Monoalphabetic Cipher, HillCipher, Playfair 10%
Cipher, Polyalphabetic Cipher, OTP, Transposition Techniques,
Steganography
Block Ciphers and the Data Encryption Standard:
Stream ciphers and block ciphers, Block Cipher Principles, Data Stream
ciphers and block ciphers, Confusion & Diffusion, Block CipherPrinciples, 15%
Data Encryption Standard (DES), Deferential and Linear Cryptanalysis,
Avalanche Effect, strength of DES, Design principles ofblock cipher.

Multiple Encryption and Triple DES

Multiple encryption and triple DES, Electronic Code Book, Cipher Block
Chaining Mode, Cipher Feedback mode, Output Feedback mode, Counter 10%
mode
 Number theory and Advance Encryption Standard:

The Euclidean Algorithm, Modular Arithmetic, Finite Fields of the Form

5 GF(p), Polynomial Arithmetic, Advance Encryption Standard(AES):
structure, key expansion 15% 6

Asymmetric Ciphers:
Prime Numbers, Principles of Public-Key Cryptosystems, The RSA
6 Algorithm, Diffie Hellman Key Exchange, Man in the Middle attack
15% 4

Cryptographic Data Integrity Algorithms:

Hash Function: Hash Function and its Application, Security

Requirements for Cryptographic Hash Functions, Hash Functions
7 Based on Cipher BlockChaining, Secure Hash Algorithm (SHA). 20% 8
MAC: Message Authentication Requirements, Message Authentication
Functions, Requirements for Message Authentication Codes, Securityof
MACs, HMAC
Digital Signature: Introduction to Digital Signatures, Digital Signature
Standard.
Key Management and Distribution:
Symmetric Key Distribution: Symmetric Key Distribution Using Symmetric
Encryption, Symmetric Key Distribution Using Asymmetric
8 Encryption, Asymmetric Key Distribution: Distribution of Public Keys,
X.509 certificates 10% 4
Advanced Topics: Firewall, Intruders, Virus, Trojans, Malware,
Ransomware.
*Continuous Evaluation:
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Reference Books:
1. Cryptography and Network Security (Textbook) William Stallings; Pearson Education
2. Cryptography & Network Security Behrouz A. Forouzan; Tata McGraw-Hill
3. Information Security Principles and PracticeDeven Shah, Wiley-India
4. Information Security Principles and PracticeMark Stamp; Wiley India edition
5. Information systems security Nina Godbole; Wiley Publications,2008

Course Outcome:
After Learning the course, the students shall be able to:
1. Define the concepts of Information security and their use.
2. Describe the principles of symmetric and asymmetric cryptography.
3. Understand the concepts of hashing with algorithms and apply them.
4. Understand and use message authentication and its requirement.
5. Understand the concepts of digital signature and digital certificates.
6. Understand and use the various key management and remote authentication mechanisms.
7. Understand the concept of system and software security.
8. Understand vulnerabilities in software flaws and concept of malware.
 FACULTY OF ENGG. & TECH. - PIET

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SEMESTER: 6TH

Name of Teachers: Hrs./Week: 3 hrs

Ankit Chauhan, Dr. Planned Date
LNS
Lokesh,Digvijaysinh
Mahida,F7,F9,F11

Subject:
Information and
Network Security

Sr. Name of Teachin 5B 5B 5B 5B 5B 5B 5B 5B 5B 5B1 5B1

No. Topic g Hrs 1 2 3 4 5 6 7 8 9 4 5

AC F1 F7 DM LN F1 F1 DM LN F9 F7
1 S 1 1 S

UNIT Introductio 2 hours

-1 n

1 Computer 1
Security
30- 30- 31- 30- 30- 30- 30- 31- 30-
Concept, The 30-5 31-5
5 5 5 05 5 5 5 5 5
OSI Security
Architecture

2 Security 1
Attacks,
Security 31-
Services,
31- 05 31- 31- 31-
Security 1-6 1-6 2-6 2-6 31-5 2-6
5 02- 5 5 5
Mechanism,
A Model for 06
Network
Security

UNIT Classical
-2 Encryption 6 Hours
Techniques

3 Symmetric 1
Cipher 06- 31-
2-6 3-6 3-6 3-6 3-6 3-6 3-6 1-6 2-6
Model 06 5

4 Substitution 1
Technique 3-6 6-6 7-6 7-6 6-6 6-6 6-6 7-6 6-6 6-6 7-6
 5 Substitution 1
Techniques 8-6 7-6 8-6 9-6 7-6 9-6 7-6 9-6 7-6 7-6 9-6

6 Transpositio 1
n
10- 10- 13- 10- 10- 10- 10-
Techniques, 9-6 7-6 8-6 9-6
6 6 06 6 6 6 6
Steganograp
hy

7 Transpositio 1
n
13- 14- 14- 13- 13- 13- 14- 13-
Techniques, 9-6 13-6 14-6
6 6 06 6 6 6 6 6
Steganograp
hy

UNIT Block
-3 Ciphers and
the Data 8 Hours
Encryption
Standard

8 Block Cipher 1
Principles 10- 14- 15- 16- 13- 16- 14- 14- 13-
14-6 14-6
6 6 6 06 6 7 6 6 6

9 Data 1
Encryption 10- 17- 17- 20- 14- 17- 14- 16- 14-
15-6 16-6
Standard 6 6 6 06 6 6 6 6 6
(DES)

10 Data 1
Encryption 15- 20- 21- 21- 14- 20- 20- 16- 14-
20-6 16-6
Standard 6 6 6 6 6 6 6 6 6
(DES)

11 Data 1
Encryption 15- 21- 22- 23- 17- 23- 21- 17- 17-
21-6 21-6
Standard 6 6 6 6 6 6 6 7 6
(DES)

12 Deferential 1
and Linear 16- 24- 24- 27- 20- 24- 21- 21- 20-
22-6 23-6
Cryptanalysi 6 6 6 6 6 6 6 6 6
s

13 Block Cipher 1
Design 17- 27- 28- 26- 21- 27- 27- 23- 21-
27-6 23-6
Principles 6 6 6 6 6 6 6 6 6

14 Block Cipher 1
Operation 22- 28- 29- 30- 24- 30- 28- 23- 24-
28-6 28-6
6 6 6 6 6 6 6 6 6

15 RC4 1
23- 27- 28- 24- 27-
1-7 1-7 4-7 1-7 29-6 30-6
6 6 6 6 6

UNIT Multiple
-4 Encryption
and Triple 4 Hours
DES

16 Multiple 1
encryption 24- 28- 28- 28-
4-7 5-7 5-7 4-7 4-7 4-7 30-6
and triple 6 6 6 6
DES
 17 Electronic 1
Code Book,
Cipher 29- 30-
5-7 6-7 7-7 1-7 7-7 5-7 1-7 5-7 5-7
Block 6 6
Chaining
Mode,

18 Cipher 1
Feedback
mode,
Output 30- 11-
8-7 8-7 4-7 8-7 5-7 1-7 4-7 6-7 7-7
Feedback 6 7
mode,
Counter
mode

19 Polynomial 1
Arithmetic 11- 12- 12- 11- 11-
1-7 5-7 5-7 5-7 11-7 7-7
7 7 7 7 7

UNIT Number
-5 theory and
Advanced 7 Hours
Encryption
Standard

16 The 1
Euclidean 12- 13- 14- 14- 12-
6-7 8-7 7-7 8-7 12-7 12-7
Algorithm 7 7 7 7 7

17 Modular 1
Arithmetic 15- 15- 18- 11- 15- 12- 11-
7-7 8-8 13-7 14-7
7 7 7 7 7 7 7

18 Groups, 1
Rings, and
18- 19- 19- 12- 18- 18- 12- 12-
Fields, Finite 8-7 18-7 14-7
7 7 7 7 7 7 7 7
Fields of the
Form GF(p),

19 Polynomial 1
Arithmetic 13- 19- 20- 21- 15- 21- 19- 14- 15-
19-7 19-7
7 7 7 7 7 7 7 7 7

20 Advance 1
Encryption
Standard(AE 14- 22- 22- 25- 18- 22- 19- 15- 18-
20-7 21-7
S): structure, 7 7 7 7 7 7 7 7 7
key
expansion

21 Advance 1
Encryption
Standard(AE 15- 25- 26- 26- 19- 25- 25- 19- 19-
25-7 21-7
S): structure, 7 7 7 7 7 7 7 7 7
key
expansion

22 Advance 1
Encryption
Standard(AE 20- 26- 27- 28- 22- 28- 26- 21- 22-
26-7 26-7
S): structure, 7 7 7 7 7 7 7 7 7
key
expansion

UNIT Asymmetric
-6 Ciphers
 23 Prime 1
Numbers,
21- 29- 29- 25- 29- 26- 22- 25-
Fermat’s and 1-8 27-7 28-7
7 7 7 7 7 7 7 7
Euler’s
Theorems

24 Testing for 1
Primality 22- 26- 26- 26- 26-
1-8 2-8 2-8 1-8 1-8 2-8
7 7 7 7 7

25 Principles of 1
Public-Key 27- 10- 16- 29- 12- 28- 29-
2-8 1-8 2-8 16-8
Cryptosyste 7 8 8 7 8 7 7
ms

26 The RSA 1
Algorithm 27- 12- 12- 18- 18- 29-
1-8 2-8 1-8 2-8 18-8
7 8 8 8 8 7

27 Diffie- 1
Hellman Key 27- 16- 16- 22- 22-
2-8 2-8 2-8 2-8 10-8 18-8
Exchange 7 8 8 8 8

UNIT Cryptograp
-7 hic Data
7 Hour
Integrity
Algorithms

28 Hash 1
Function:
Hash
Function and
its
Application, 28- 22- 17- 23- 2-8- 25- 16- 12- 16-
16-8 23-8
Security 8 8 8 8 8 8 8 8 8
Requirement
s for
Cryptographi
c Hash
Functions,

29 Hash 1
Functions
28- 23- 23- 25- 16- 26- 16- 16- 16-
Based on 17-8 25-8
8 8 8 8 8 8 8 8 8
Cipher Block
Chaining

30 Secure Hash 1
Algorithm 29- 26- 24- 29- 19- 29- 22- 18- 19-
22-8 25-8
(SHA) 8 8 8 8 8 8 8 8 8

31 Message 1
Authenticati
on
12- 29- 26- 30- 22- 23- 19- 22-
Requirement 1-9 23-8 30-8
8 8 8 8 8 8 8 8
s, Message
Authenticati
on Functions

32 Requirement 1
s for
17- 30- 30- 23- 23- 23- 23-
Message 1-9 2-9 24-8 1-9
8 8 8 8 8 8 8
Authenticati
on Codes

33 Security of 1
18- 26- 12- 29- 25- 26-
MACs, 2-9 2-9 1-9 29-8 1-9
8 8 9 8 8 8
HMAC
 34 Introduction 1
to Digital
Signatures, 19- 29- 13- 30- 26- 29-
3-9 3-9 1-9 30-8 3-9
Digital 8 8 9 8 8 8
Signature
Standard

UNIT Key
–8 Managemen
5 Hour
t and
Distribution

35 Symmetric 1
Key
Distribution 24- 10- 30- 16- 30- 30- 30-
4-9 2-9 2-9 10-9
Using 8 9 8 9 8 8 8
Symmetric
Encryption

36 Symmetric 1
Key
Distribution 25- 13- 10- 19- 30-
2-9 2-9 2-9 2-9 3-9 12-9
Using 8 9 9 9 8
Asymmetric
Encryption

37 Firewall, 1
Intruders, 26- 16- 11- 20-
2-9 2-9 3-9 1-9 2-9 4-9 12-9
Virus, 8 9 9 9
Trojans,

38 Malware, 1
Ransomwar
e 31- 17- 13- 20-
3-9 3-9 3-9 1-9 3-9 10-9 17-9
8 9 9 9

39 Pseudorando 1
m Number
20- 17- 23- 10-
Generation 1-9 3-9 3-9 2-9 3-9 11-9 19-9
9 9 9 9
Using a
Block Cipher
 PARUL UNIVERSITY - FACULTY OF ENGINEERING &
TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SYLLABUS FOR 5th SEM B. TECH. PROGRAMME
WEB PROGRAMMING LABORATORY

Type of Course: [Link].

Prerequisite: Basic Understanding of DBMS, Algorithms and Programming
Rationale: This course is design to provide knowledge about data mining, data warehouse and business
intelligence. This course aims to teach students the techniques and concepts involved in data mining and their
application in various areas

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme
(Hrs/Week)
Cr Total
External Internal

Theory Practical Theory *C.E. Practical

30 20 50

L- Lectures; T- Tutorial/Teacher Guided Student Activity; P- Practical; Cr- Credit; *C.E– Continuous Evaluation
(Presentation, Assignment, Progressive assessment etc.)

Course Outcome:
After learning the course, the students should be able to:

1. Understand the various steps in designing a creative and dynamic website

2. Code and design web page using HTML5 & CSS3
3. Understand the best practices for creating a good website / application.
4. Develop dynamic web pages.
5. Able to Develop Website using Web Technology
6. Create web pages, web sites and web applications using client scripting languages.

1. Create a web page containing resume with the help of basic HTML tags.
2. Create a web page to display the Restaurant menu using ordered, unordered and nested list.
3. Create the below given table.

4. Using Frames Divide the web page as follow

 5. Create a HTML5 web page which shows the use of Canvas.
6. Create a HTML5 web page which shows the use of Audio & Video.
7. Create a student registration form using the following tags <form>, <input>, <textarea>, <button>,
<select>, <option>The registration form must consist of following information:
First Name, Middle Name, Last Name, Gender (use radio button), Address, Phone No., email id, Hobbies(use
checkbox), City, State, Country, College Name (use dropdown menu)
8. Create a HTML5 web page which shows the use of Geolocation.
9. Apply inline, internal and external style sheet to the student registration form.
10. Implement 2D transformation on Web page.
11. To create an html page to explain the use of various predefined functions in an array & Date object in
JavaScript.
12. Write a Program to show use of alert, confirm and prompt box.
i. Ask user to input some week Day. Match it with actual current Week day( Use DateObject to get the
current week day) If both values matches display a message “HIT” else display a message “MISSED”.

ii. Caluculate the BMI of a user by asking him for his Weight(Kilograms) & Heigth(Meters). Formula:-
BMI=m/h^2.
13. Write JavaScript to perform the following operations:
a. to find highest from given three values
b. to calculate factorial of n
14. Write JavaScript to perform the following operations:
a. to calculate sum of 1 to n
b. to check whether given number is palindrome or not
15. Write a Java Script program to print current date & time

16. Create CD Catalogue Table in XML and display it using XSL Style Sheet
17. Creating the JavaScript file to handle our json
18. Write a PHP code to print your personal details.
19. Write a PHP code to shows the use of Decision Making and find out if given number is prime or not prime.
20. Write a PHP code for database connection with MySQL and also perform Insert and Delete.
 PARUL UNIVERSITY - Faculty of Engineering and Technology
Department of Computer Science & Engineering
SYLLABUS FOR 5th Sem BTech PROGRAMME
Web Programming

Type of Course: BTech

Prerequisite: Programming, TCP/IP protocols and client-server development.
Rationale: web programming enables student to create web based application as per requirement ofmarket which is
driven by Internet based applications.

Teaching and Examination Scheme:

Teaching Scheme Examination Scheme

Credit External Total
Lect Hrs/ Tut Hrs/ Lab Hrs/ Internal
T P T CE P
60 20 20 100
Lect - Lecture, Tut - Tutorial, Lab - Lab, T - Theory, P - Practical, CE - CE, T - Theory, P - Practical

Contents:
Teaching
Sr. Topic Weightage
Hrs.
Introduction to HTML:

The development process, basic HTML, formatting and fonts, commenting

code, color, hyperlink, lists, tables, images, simple HTML Forms, web site
structure, frames and frame sets.
15%
Introduction to HTML5: what is HTML5, Main Structure, basic tags likeheader,
footer, article, section, Text, Forms, Video and Audio, Canvas,Drag & Drop,
Geolocation.

Style sheets:

Introduction to CSS, what is requirement of CSS, basic syntax and structure,

CSS Box Model, using CSS, background images, colors and properties,
manipulating texts, using fonts, borders and boxes, margins, padding lists,
15%
positioning using CSS, CSS2
CSS3: Transparency, Gradients, Backgrounds, Round borders, Typography,
Shadows, Transformations, Transitions.
 JavaScript:

Overview of JavaScript, Introduction to Client side scripting, need for

JavaScript, How to develop JavaScript, simple JavaScript, variables, ,Control
statements, loops and repetition, JavaScript arrays, functions,
3 Constructors, JavaScript objects and user defined objects, HTML DOM, 20% 8
Browser Object Model, event handling in JavaScript. Form
validation using JavaScript regular expression, Pop up boxes.

DHTML: Combining HTML, CSS and JavaScript, Events and buttons

XML:

Introduction to XML, uses of XML, simple XML, XML key components,

4 DTD and Schemas, Using XML with application. Transforming XMLusing 10% 5
XSL and XSLT

JSON AND JQUERY:

Introduction of jQuery, Uses of jQuery, Syntax, Selectors and Events,

5 JSON, Use of JSON. 10% 5

PHP:

6 Environment Setup, Variable Types, Constants, Operator Types, 15% 6

Decision Making, Arrays, Strings, Web Concepts, File Inclusion, GET&
POST, Functions, Cookies, Sessions, File Uploading, Object
Oriented Programming with PHP

PHP and MySQL:

7 Basic commands with PHP examples, Connection to server, creating 15% 6

database, selecting a database, listing database, listing table names,
creating a table, inserting data, altering tables, queries, deleting
database, deleting data and tables, PHP myadmin and database

*Continuous Evaluation:
It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.
Reference Books:
1. Web Technology, Moseley and Savaliya, Wiley India
2. HTML 5 Black Book 2Ed, Kogent Learning Solutions Inc, dreamtech
3. Web Design, Joel Sklar, Cengage Learning
4. Learning PHP, MySQL, JavaScript, CSS & HTML5, 3rd Edition, Robin Nixon, O'Reilly
5. PHP: The Complete Reference By Steven Holzner, McGrawhill
Course Outcome:
1. Summarize the server side scripts for designing web-based services with database connectivity.
2. Use the various HTML tags with appropriate styles to display the various types of contents
effectively.
3. Develop the dynamic web pages using HTML, CSS and JavaScript applying web design principlesto
make pages effective.
4. Design the server-side PHP scripts using various features for creating customized web services.
5. Create a web application using advanced web programming features including AJAX and jQuery
using concepts of Web API.

FACULTY OF ENGG. & TECH. - PIET

PARUL INSTITUTE OF ENGINEERING & TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SEMESTER: 5TH
Name of Kiran Parmar, Mosam Patel, Hitakshi Patel,
Teachers: Nitin Pandya, Digvijay Basiya, Charmi
Purohit, Harsh Kantawala, Yash Raval
5B14 5B15

Unit Name of Topic HK CP

1 Introduction to HTML

1 The development process, basic HTML, 31/05/22 30/05

formatting and fonts, commenting code
2 color, hyperlink, lists, tables, images, simple 02-06-22 02-06
HTML Forms, web site structure,
3 frames and frame sets. 03-06-22 03-06

4 Introduction to HTML5: what is HTML5, Main 03-06-22 6-6

Structure, basic tags like header, footer
5 article, section, Text, Forms, Video and Audio 13/06/22 9-9

6 Canvas, Drag & Drop, Geolocation 14/06/22 10-6

2 Style Sheets

7 Introduction to CSS, Requirement of CSS, 20/06/22 13/6

basic syntax and structure
8 CSS Box Model, using CSS, background 21/06/22 16/6
images
9 colours and properties, manipulating texts, 23/06/22 17/6
using fonts
 10 borders and boxes, margins, padding lists, 23/06/22 20/6
positioning using CSS, CSS2
11 CSS3: Transparency, Gradients, Backgrounds 27/06/22 23/6

12 Round borders, Typography, Shadows, 30/06/22 24/6

Transformations, Transitions
3 JavaScript

13 Overview of JavaScript, Introduction to 05-07-22 27/6

Client-side scripting, need for JavaScript
14 How to develop JavaScript, simple JavaScript, 07-07-22 30/06

15 variables, control statements, loops and 11-07-22 1-7

repetition
16 JavaScript arrays, functions 12-07-22 4-7

17 Constructors, JavaScript objects and user- 14/07/22 7-7

defined objects
18 HTML DOM, Browser Object Model, Event 14/07/22 8-7
handling in JavaScript
19 Form validation using JavaScript regular 18/07/22 11-7
expression, Pop up boxes.
20 DHTML: Combining HTML, CSS and JavaScript, 19/07/22 14/7
Events and buttons
4 XML

21 Introduction to XML, uses of XML 25/07/22 15/7

22 simple XML, XML key components 26/07/22 18/7

23 DTD and Schemas 26/07/22 21/7

24 Using XML with application 28/07/22 22/7

25 Transforming XML using XSL and XSLT 01-08-22 25/7

5 JSON AND JQUERY

26 Introduction of jQuery 04-08-22 29/7

27 Uses of jQuery 16/08/22 1-8

28 Syntax 17/08/22 12-8

 29 Selectors and Events 18/08/22 18/8

30 JSON, Use of JSON. 22/08/22 22/8

6 PHP

31 Environment Setup, Variable Types, 25/08/22 25/08

Constants, Operators, Decision making
32 Arrays, Strings 29/08/22 26/8

33 Web Concepts, File Inclusion 30/08/22 29/8

34 GET & POST, Functions 01-09-22 1-9

35 Cookies, Sessions, File Uploading 01-09-22 2-9

36 Object-Oriented Programming with PHP 05-09-22 12-9

7 PHP and MySQL:

37 Basic commands with PHP examples 08-09-22 15/9

38 connection to the server, creating a database, 12-09-22 16/9

selecting a database, listing database
39 Table creation and Data insertion 13/09/22 19/9

40 Altering table data 17/9 19/9

41 Delete Queries 18/9 22/9

42 PHP my admin and database 20/9 23/9

 PARUL INSTITUTE OF ENGINEERING AND
TECHNOLOGYCOMPUTER SCIENCE & ENGINEERING
DEPARTMENT
5TH SEMESTER ROLL CALL LIST-2021-22-B14-DIVISION

Sr. No Enrollment No Name of students Division :

1 200303125001 DHIVER MAHIMN HIRALAL
2 200303125002 MEETKUMAR ASHWINBHAI MORI
3 200303125003 TANU YADAV
4 200303125004 DESAI JENIL PRASHANTKUMAR
5 200303125005 ABIR BANERJEE
6 200303125006 BEHL ADITYA RISHIRAJ
7 200303125007 MITUL AMIT DESAI
8 200303125008 HADPE HARSHKUMAR VIJAYBHAI
9 200303125010 PATEL MUKULKUMAR JIGNESHBHAI
10 200303125011 PATEL PRACHI DHANESHKUMAR
11 200303125012 PATEL PRIYANSHU NARESHKUMAR
12 200303125013 SAHIL PATEL
13 200303125014 RAHEVAR DHRUVI HARICHANDRASINH
14 200303125015 RAOL KRISHNARAJ HEMENDRASINH
15 200303125016 RATHOUR ADITYASINGH ANENDRASINGH
16 200303125017 TALAVIYA VINAY MUKESHBHAI
17 200303125018 YADAV ABHISHEK SURESH
18 200303125019 A RAKESH
19 200303125020 AJJAPALLY NITHISH REDDY
20 200303125021 ALA MANIKANTA RAJU
21 200303125022 LAKSHMIKRISHNASAI ALLE
22 200303125023 ANURAJULA RANGA PAVAN
23 200303125024 BANALA RAM CHARAN NARASIMHA
24 200303125025 BANDI NAVANEETH
25 200303125026 BHUKYA GANESH
26 200303125027 BOLLU NITHIN CHOWDARY
27 200303125028 BOSUKONDA SRINIVAS CHNADRA
28 200303125029 CHALAMALA SATYANARAYANA
29 200303125030 CHALLA VINAY
30 200303125031 CHANUMOLU LALITH ADITHYA
31 200303125032 DABBAKUTI KRISHNAKIREETI
32 200303125033 DASOJU PRADEEP
33 200303125034 DIRISALA PRADEEPTHI
34 200303125035 DUGGIRALA VENKAT ADITYA
35 200303125036 GALI VENKATA NARAYANA REDDY
36 200303125037 GANTA AJAY KUMAR
37 200303125038 GAYAM SANTHOSH REDDY
38 200303125039 GULLIPALLI HITESH DURGA
39 200303125040 SELVARAJ ABHI GURUGUBELLI
40 200303125041 JAGATHA JAYENDRA GANESH
41 200303125042 JAVVADI JAYA KRISHNA
42 200303125043 JETTY AAKASH 5B14
 43 200303125044 KANIKANTI SAI HARSHA
44 200303125045 KANNEDARI NAGA DATHA SAI YASWANTH
45 200303125046 KOLIPAKA AJITH CHETHAN
46 200303125047 KOMMINENI BHARATH NAIDU
47 200303125048 KONATHAM PAVAN KUMAR REDDY
48 200303125049 KORUPROLU VIJAY SAI
49 200303125050 KOTHMEERKAR ASHISH
50 200303125051 MAGANTI NARESH
51 200303125052 MANAM KOWSHIK
52 200303125053 MANAM MOHAN KISHAN
53 200303125054 MANIKONDA SAI RATHNA
54 200303125055 MANIKYALA SAI

PARUL INSTITUTE OF ENGINEERING AND

TECHNOLOGY
COMPUTER SCIENCE & ENGINEERING
DEPARTMENT
5TH SEMESTER ROLL CALL LIST-2021-22-B15-DIVISION

Sr. No Enrollment No Name of students Division :

1 200303125056 MATTUPALLI PHANIMOHAN
2 200303125057 MULE SRAVANTH REDDY
3 200303125058 PALAPARTHI LOKESH
4 200303125059 PALLAPATI SAIDULU
5 200303125060 PALLE CHANDRAHASAN REDDY
6 200303125061 PAMARTHI VENKATA SANDEEP
7 200303125062 PARISA TARUN KUMAR
8 200303125063 HARSH PATEL
9 200303125064 PONDUGULA SIVA REDDY
10 200303125065 EMANI JAGADISH REDDY
SAYYAPUREDDY TEJA VENKATA
11 200303125067 SATYANARAYANA
12 200303125068 TANDRA VENNELA
13 200303125069 VANKAMAMIDI PHANI SAKETH
14 200303125070 YANAMADALA NAGA SAI SARAVANAN
YERUVA GANGADHARA SRINIVASA AKHIL
15 200303125071 REDDY
16 200303125072 SARIKA D
17 200303125073 BHANDARI VINITKUMAR SURESH
18 200303125074 CHAUDHARI TEJAS DAGADU
19 200303125075 ABHIJAY GOSWAMI
20 200303125076 PRAKHAR GUPTA
21 200303125077 HARSHIT MALVIYA
22 200303125078 MIND YOGESH SUBHASH
23 200303125079 KUNAL KUMAR
24 200303125080 KESHU PATIDAR
25 200303125081 PATIL KARTIKBHAI KIRAN 5B15
26 200303125082 PATIL KAUSHAL BHUPENDRA
27 200303125083 HARSH RAJ
28 200303125084 SIDDHARTH SINGH RAJPUT
29 200303125085 SAMAL SHIVAM TAPAN
30 200303125086 AKSHAT ANAND
31 200303125087 DIPTI VATSA
32 200303125901 VADLAMUDI RAJEEV
33 210303125701 KALAVADIYA UMANGBHAI BIPINBHAI
34 210303125702 PATEL KENIL HASMUKH
35 210303125703 DESAI KATHAN CHANDRAKANT
36 210303125704 GOSULA MAHESH