GRAPHIC ERA HILL UNIVERSITY, DEHRADUN

SEMESTER V

Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 509 Course Title:

Machine Learning
2. Contact Hours: L: 3 T: - P: 2

3. Semester: V

4. Pre-requisite: TCS201, TCS421

5. Course Outcomes: After completion of the course students will be able to
1. Haveagoodunderstandingofthefundamentalissuesandchallengesofmachine learning: data,
model selection, model complexity,etc.
2. Distinguishthestrengthsandweaknessesofmanypopularmachinelearningapproaches.
3. Analyze the underlying relationships within and across Machine Learning algorithms and the
paradigms of supervised and un-supervised learning.
4. Utilize the structure and design concepts of neural networks applications to solve real life
problems
5. Plan and execute successful machine learning and big data projects, including selecting an
adequate process for the specific task and avoiding the machine learning pitfalls.
6. Evaluate the issues raised by current research in the field of machine learning
6.Detailed Syllabus
Contact
UNI CONTENT
Hrs
T
Review of Statistical Concepts: Mean, Median, Mode, Outliers, Range, Average
Deviation, Absolute Deviation, Squared Deviation, Standard Deviation, Total
Sum of Squares.
Unit – I Introduction to Machine Learning: What is Machine Learning, Introduction to
ML's three approaches: Supervised, Unsupervised and Reinforcement Learning.
Introduction to Python: BasicOpeartions, Lists, Tuples, Dictionaries,
Flow Control, Strings, File handling, Numpy, Scikit-learn 10

Introduction to Exploratory Data Analysis Introduction to Exploratory

Data Analysis (EDA) –Steps in EDA, Data Types: Numerical Data – Discrete
Unit - II data, continuous data – Categorical data
Data Transformation Transformation Techniques: Performing data
deduplication - replacing values – Discretization and binning. Introduction to
Missing data, handling missing data
Data Visualization using Matplotlib, Seaborn
Supervised Learning Algorithms: Linear Regression, Logistic
Unit – III Regression, Decision Trees, Random Forest, Support Vector Machine,K- 10
Nearest Neighbours, CN2 Algorithm, Naive Bayes

Unit -IV Clustering: K-means, Silhoutte Scores, Hierarchical Clustering,

Fuzzy c-means, DBScan
Dimensionality Reduction:Low Variance Filter, High Correlation 8
Filter, Backward Feature Elimination, Forward Feature
Selection,Principle Component Analysis, Projection Methods.
 Unit V Model Evaluation and Selection: Cross-validation, model evaluation metrics,
model selection, and hyperparameter tuning.
Hyperparameter Optimization Techniques Manual Search, Random Search,
Grid Search
Case study in Python for Hyperparameter Tuning
Total 49

Text and Reference Books

1. "Machine Learning For Dummies", John Paul Mueller and Luca Massaron
2. "A Course in Machine Learning", Hal Daumé III.
3. "Programming Collective Intelligence: Building Smart Web 2.0 Applications", Toby Segaran
4. "Building Machine Learning Systems with Python", WilliRichert and Luis Pedro Coelho
5. "Learning scikit-learn: Machine Learning in Python", Raúl Garreta and Guillermo Moncecchi
6. "Machine Learning in Action", Peter Harrington
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

1. Name of Department: - Computer Science and Engineering

Operating Systems
TCS 502
2. Subject Code: Course Title:

3. Contact Hours: L: 3 T: 0 P: 0
0
4. Examination Duration (Hrs): Theory 3 Practical

5. Relative Weight: CIE 25 MSE 25 SEE 50

6. Credits: 3

7. Semester: 4

8. Category of Course: DC

9. Pre-requisite: TCS 301, TCS 302, TCS 404

9. Course After completion of the course the students will be able to:
Outcome CO1 Understand the concept and design issues associated with an operating system.
**:
CO2: Identify the problems related to process management, synchronization and apply
learned methods to solve basic problems.

CO3. Explain the basics of memory management and the use of virtual memory in
modern operating systems.

CO4. Understand the concept deadlock avoidance, prevention, and detections

techniques.

CO5: Implementation of process management, memory management and file

management using system calls.

CO6: Analyze the data structures and algorithms used for developing an operating
system.
** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.
10. Details of the Course:

Sl. Contact
Contents
No. Hours
Introduction to Operating Systems, UNIX: What operating systems do; Operating
System structure; Operating System Services; User - Operating System interface; System
1 8
calls; Types of system calls; Operating System structure; Unix command: Command
Structure, Internal and External commands, filters; vi editor.
 Process Management: Process concept; Operations on processes; Multithreading
models; Threading issues. Process Scheduling: Basic concepts; Scheduling criteria;
Scheduling algorithms; Multiple-Processor scheduling; Thread scheduling.
2 10
Process Synchronization: Inter-process communication; Synchronization: The Critical
section problem; Peterson’s solution; Synchronization hardware; Semaphores; Classical
problems of synchronization.

Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for handling

deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery
from deadlock.
3 Memory Management: Memory Management Strategies: Background; Swapping; 10
Contiguous memory allocation; Paging; Structure of page table; Segmentation. Virtual
Memory Management: Background; Demand paging; Page replacement; Allocation of
frames; Thrashing
File System, Implementation of File System: File System: File concept; Access
methods; Directory structure; Protection. File system structure; Directory
implementation; Allocation methods; Free space management.
4 8
Secondary Storage Structures: Mass storage structures; Disk structure; Disk scheduling;
Disk management; Swap space management. Protection: Goals of protection, Principles
of protection, Access matrix.
File System, Implementation of File System: File System: File concept; Access
methods; Directory structure; Protection. File system structure; Directory
implementation; Allocation methods; Free space management.
5 8
Secondary Storage Structures: Mass storage structures; Disk structure; Disk
scheduling; Disk management; Swap space management. Protection: Goals of protection,
Principles of protection, Access matrix.
Total 44
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of Publication /
No. Reprint
Textbooks
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: 7st 2006
Operating System Principles, 7th edition, Wiley India,
2006.
2. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: 7th 2006
Operating System Principles, 7th edition, Wiley India, 2006.
3. Unix concepts and applications – Sumitabha Das 1st 2005

Reference Books
1. Andrew S Tanenbaum: Operating Systems: Design and 3rd 2006
Implementation, 3rd edition, Prentice Hall, 2006
2. Stuart E. Madnick, John Donovan: Operating Systems, 2008
Tata McGraw Hill, 2008
10.
12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V
Name of Department: - Computer Science and Engineering
Database Management
1. Subject Code: TCS-503 Course Title: System
2. Contact Hours: L: 3 T: P:
0 0

3. Examination Duration (Hrs): Theory 3 Practica l 0

4. Relative Weight: CIE 25 MSE 25 SEE 50

5. Credits: 3
6. Semester: 5th
7. Category of Course: DC
8. Pre-requisite: TCS 302, TCS 404

9. Course After completion of the course the students will be able to:
Outcome**: CO1: Understand the different issues involved in the design and implementation of a
database system.

CO2: Study the physical and logical database designs, database modeling, relational,
hierarchical, and network models.

CO3: Understand and use data manipulation language to query, update, and manage a
database.

CO4: Develop an understanding of essential DBMS concepts such as: database security,
integrity, concurrency.

CO5: Design and build a simple database system and demonstrate competence with the
fundamental tasks involved with modeling, designing, and implementing a DBMS.

CO6: Evaluate a business situation and designing & building a database application
** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.
10. Details of the Course:
Sl.
Contents Contact Hours
No.
Unit 1:
Introduction: An overview of DBMS; Advantages of using DBMS
approach; Database systems vs File Systems, Database system concepts
and architecture
1 Data models, schemas, and instances; Three-schema architecture and data 9
independence; Database languages and interfaces; The database system
environment; Centralized and client-server architectures; Classification of
Database Management systems.

Unit 2:
Entity-Relationship Model: Using High-Level Conceptual Data Models
2 9
for Database Design; An Example Database Application; Entity Types,
Entity Sets, Attributes and Keys; Relationship types, Relationship Sets,
 Roles and Structural Constraints; Weak Entity Types; Refining the ER
Design; ER Diagrams, Naming Conventions and Design Issues;
Relationship types of degree higher than two.

Relational Model and Relational Algebra: Relational Model Concepts;

Relational Model Constraints and Relational Database Schemas; Update
Operations, Transactions and dealing with constraint violations; Unary
Relational Operations: SELECT and PROJECT; Relational Algebra and
Calculus Operations from Set Theory; Binary Relational
Operations: JOIN and DIVISION; Additional Relational Operations.
Examples of Queries in Relational Algebra; Relational Database Design
Using ER- to-Relational Mapping.
3 11
SQL – 1: SQL Data Definition and Data Types; Specifying basic constraints
in SQL; Schema change statements in SQL; Basic queries in SQL; More
complex SQL Queries.

Insert, Delete and Update statements in SQL; Specifying constraints as

Assertion and Trigger; Views (Virtual Tables) in SQL; Additional features
of SQL; Database programming issues and techniques; Embedded SQL,
Dynamic SQL; Database stored procedures.

Optimization of SQL Queries through Indexes, Concepts of NoSQL.

Unit 4: Database Design – 1: Informal Design Guidelines for Relation
Schemas; Functional Dependencies; Normal Forms Based on Primary Keys;
General Definitions of Second and Third Normal Forms; Boyce-Codd
Normal Form
4 9
Properties of Relational Decompositions; Algorithms for Relational
Database Schema Design; Multivalued Dependencies and Fourth Normal
Form; Join Dependencies and Fifth Normal Form; Inclusion Dependencies;
Other Dependencies and Normal Forms

Unit 5:
Transaction Management: The ACID Properties; Transactions and
Schedules; Concurrent Execution of Transactions; Lock- Based
Concurrency Control; Performance of locking; Transaction support in SQL;
5 Introduction to crash recovery; 2PL, Serializability and Recoverability; 10
Lock
9Management; Log Files; Checkpointing; Recovering from a System Crash;
Media Recovery
Total 48
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of
No. Publication /
Reprint
Textbooks
1. McGraw-Hill. Date K., Swamynathan S. An Introduction to
2nd 2012
Database Systems. Eight Edition. Pearson.
2. Elmasri R. and Navathe S.B., Fundamentals of Database
2nd 2012
Systems.
 3. Fifth Edition.Pearson. Singh S.K., Database Systems-
2nd 2011
Concepts, Designs and Application. 2nd Edition. Pearson
4. Date, C.J. Introduction to Database Systems (Vol I & II) 8th
8th 2004
Edition. Addison- Wesley.

Reference Books
1. Silberschatz A. Korth H. F. Sudarshan S., Database System
1st 2014
Concepts. Sixth Edition

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

Name of Department: - Computer Science and Engineering Computer Based Numerical

1. Subject Code: TMA 502 Course Title: and Statistical Technique

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 SEE 50

5. Credits: 3

6. Semester: 5

7. Category of Course: DC

8. Pre-requisite: TMA 101, TMA 201

9. Course After completion of the course the students will be able to:
Outcome* CO1: Develop the notation of errors, finding of errors, roots and apply them in problem
*: solving in concern subject.
CO2: Understand the methods of interpolation techniques and apply them.
CO3: Elaborate the basics of numerical differentiation and integration and implement
them.
CO4: Explain the concepts of differential equation.
CO5: Elaborate the basics of correlation and regression, curve fitting and be able to
apply the methods from these subjects in problem solving.
CO6: Examine statistical techniques and able to relate these to real problems.

** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
Unit 1: Introduction to Numbers and their accuracy, Computer Arithmetic,
Mathematical preliminaries, Errors and their Computation, General error formula,
Order of Approximation.
Solution of Algebraic and Transcendental Equation: Bisection Method,
1 Iteration method, Secant Method, Newton Raphson method, Rate of convergence 10
and their algorithms.
Solution of system of linear equations: Gauss Elimination method, Gauss Jordan
method and Gauss Seidel method and their algorithms.

Unit 2: Interpolation: Introduction to Finite Differences, Difference

2 09
tables, Polynomial Interpolation: Newton’s forward and backward
formula, Central difference formulae: Gauss forward and backward
 formula. Interpolation with unequal intervals: Lagrange’s interpolation,
Newton divided difference formula and their algorithms.

Unit 3: Numerical Differentiation and Integration: Numerical Differentiation

for Interpolation Formulae, General Quadrature formula, Trapezoidal rule,
Simpson’s 1/3 and 3/8 rule and their algorithms.
3 09
Numerical Solution of Differential Equations: Euler’s explicit and implicit
methods, modified Euler’s method, Runge-Kutta Method, Solution of Boundary
Value Problem by Finite Difference Method and their algorithms.

Unit 4: Statistical Computation: Introduction to Method of least squares, Curve

4 08
Fitting of different types of curves. Data fitting with Cubic spline Interpolation.

Unit 5: Correlation and Regression Analysis: Introduction of correlation and

5 regression, Correlation coefficient and it’s application in computer science, Linear 09
and Nonlinear Regression, Multiple Regression.

Total 45
11. Suggested Books:
SL Name of Authors/Books/Publishers/Place of Edition Year of
. Publication Publication /
N Reprint
o.
Textbooks
1. Gupta C. B. Singh S. R. and Kumar Mukesh First 2016
“Engineering Mathematics for Semesters III and IV” edition
McGraw Hill Education,
2. Rajaraman V, “Computer Oriented Numerical First 2020
Methods”, Pearson Education. edition
Reference Books
1. Sastry, S. S, “Introductory Methods of Numerical Second 2009
Analysis”, Pearson Education.
2. Jain, Iyengar and Jain, “Numerical Methods for Fourth 2003
Scientific and Engineering Computations”, New Age
Int.

3. Steven C Chapra, “Applied Numerical Methods with Second 2007

Matlab”.

12 Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

PCS 502 Operating Systems Lab

. Course Outcome: After completion of the course the students will be able to:

CO1. Implement concept of system calls for process management.

CO2. Analyze and Implement various algorithms like FCFS, Priority and
Round Robin for CPU scheduling.
CO3. Simulate working of page replacement policies like FIFO, LRU.
CO4. Compare various algorithms for communication between processes like
pipe, named pipe, message queue and shared memory.

Details of the Course:

Sl. List of problems for which student should develop program and Contact
No. execute in the Laboratory Hours
Problem Statement 1: 3
1
Demonstration of FORK() System Call
Problem Statement 2:
2 Parent Process Computes the SUM OF EVEN and Child Process 3
Computes the sum of ODD NUMBERS using fork

Problem Statement 3:
3 3
Demonstration of WAIT() System Call

Problem Statement 4:
4 Implementation of ORPHAN PROCESS & ZOMBIE PROCESS 3

Problem Statement 5:
5 Implementation of PIPE 3

Problem Statement 6:
6 3
Implementation of FIFO

7 Problem Statement 7: 3
Implementation of MESSAGE QUEUE
 Problem Statement 8:
8 3
Implementation of SHARED MEMORY

Problem Statement 9:
9 Implementation of FIRST COME FIRST SERVED SCHEDULING 3
ALGO

1 Problem Statement 10:

3
0 Implementation of SHORTEST JOB FIRST SCHEDULING ALGO
Problem Statement 11:
1
3
1 Implementation of PRIORITY SCHEDULING ALGO

Problem Statement 12:

1
3
2 Implementation of First comes first serve page replacement policy

Problem Statement 13:

1
3
3 Implementation of Least recent used page replacement policy

Problem Statement 14:

1
Demonstration of execl() where child process executes "ls" 3
4
COMMAND and Parent process executes "date" COMMAND

Problem Statement 15:

1
Implementation of COMMAND ls|wc USING PIPES. 3
5

Total 45

Text Books:

Authors Name Title Edition Publisher, Country Year

Abraham Operating System 7th Edition Wiley India 2006
Silberschatz, Peter Principles
Baer Galvin, Greg
Gagne:
Sumitabha Das Unix concepts and 4th Edition McGraw Hill Education 2017
applications
Reference Books:
Authors Name Title Edition Publisher, Country Year
Andrew S Tanenbaum Operating 3rd Prentice Hall, 2006
Systems: Edition
Design and
Implementation,
Stuart E. Madnick, John Operating 1st Edition Tata McGraw Hill, 2008
Donovan: Systems,
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

PMA 502 CBNST LAB

Course Outcome: After completion of the course the students will be able to:

CO1. Implement the methods (Bisection, False position, Newton

Raphson and Iteration) to find the roots of non-linear equations.
CO2. Implement the method to interpolate numerically using Newton’s
forward difference, Newton’s backward difference, Lagrange’s.
CO3. Implement the method to integrate numerically using
Trapezoidal, Simpsons 1/3 and 3/8.
CO4. Implement the method to find numerical solution of ordinary
differential equations by Euler’s method, Runge-Kutta (fourth
order) method

Details of the Course:

Sl. List of problems for which student should develop program and execute Contact
No. in the Laboratory Hours
Problem Statement 1:
1
WAP to find the roots of non-linear equation using Bisection method.
Problem Statement 2:
2
WAP to find the roots of non-linear equation using False position method.
Problem Statement 3:
3 WAP to find the roots of non-linear equation using Newton’s Raphson
method.
Problem Statement 4:
4
WAP to find the roots of non-linear equation using Iteration method.
Problem Statement 5:
5 WAP to interpolate numerically using Newton’s forward difference
method.
Problem Statement 6:
6 WAP to interpolate numerically using Newton’s backward difference
method.

7 Problem Statement 7:
WAP to interpolate numerically using Lagrange’s method.
Problem Statement 8:
8
WAP to Integrate numerically using Trapezoidal rule.
Problem Statement 9:
9
WAP to Integrate numerically using Simpson’s 1/3 rules.
 Problem Statement 10:
10
WAP to Integrate numerically using Simpson’s 3/8 rules.
Problem Statement 11:
11 WAP to find numerical solution of ordinary differential equations by
Euler’smethod.
Problem Statement 12:
12 WAP to find numerical solution of ordinary differential equations
by Runge-Kutta(fourth order) method.
Problem Statement 13:
13
WAP to linear Curve fitting by least – square approximations.
Total

Text Books:
Authors Name Title Edition Publisher, Country Year
Gupta C. B. Singh Engineering 1st Edition McGraw Hill Education, 2016
S. R. and Kumar Mathematics for
Mukesh Semesters III and
IV
Rajaraman V, Computer 1st Edition Pearson Education. 2020
Oriented
Numerical
Methods”

Reference Books:
Authors Name Title Edition Publisher, Country Year
Sastry, S. S, Introductory 2nd Edition Pearson Education 2009
Methods of
Numerical
Analysis”
Jain, Iyengar and Jain Numerical 4th Edition New Age Int. 2003
Methods for
Scientific and
Engineering
Computations”,
Steven C Chapra Applied 2nd Edition McGraw Hill 2007
Numerical
Methods with
Matlab”.
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

Name of Department: - Computer Science and Engineering

Database Management
1. Subject Code: PCS-503 Course Title: System Lab

2. Contact Hours: L: 0 T: 1 P: 2

3. Examination Duration (Hrs): Theory 0 Practical 3

4. Relative Weight: CIE 25 MSE 25 SEE 50
5. Credits: 2

6. Semester: 5th

7. Category of Course: DC

8. Pre-requisite: TCS 302, TCS 404

9. Course After completion of the course the students will be able to:
Outcome**: CO1: Students get practical knowledge on designing and analysis of conceptual model
and mapping of conceptual model to relational database systems.
CO2: Design and implement SQL queries using DDL and DML concepts for updation
and managing a database.
CO3: Design and implement advance SQL queries such as relational constraints,
joins, set operations, aggregate functions, and views.
CO4: Design and implement queries using optimization techniques.
CO5: Application of transaction control language (TCL), data control language
(DCL) in SQL to evaluate practical implications of DBA such as transaction,
recovery, and security.
** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.

10. Details of the Course:

Sl. List of problems for which student should develop program and execute Contact
No. in the Laboratory Hours
Week 1: (Store all your data in a file named `db.sql` and email it to
yourself for future reference and use in subsequent labs.)
1.  Create a Scenario based ER-Models with the entities. (Hospital
Details like: Wards, Patients, Doctor, Bills etc)
 Convert this ER-model into table with all the entities. (Minimum
five Entities).
  Insert random data in each column of all the tables.
 Update the table by applying some conditions.(For example:
using alter command)
 Apply the `DELETE` and `DROP` command, and then review the
results.
Week 2:
 Create a user and provide the GRANT privileges to the user on
the database then REVOKE the given privileges.
 Insert any five records in the previous schema and apply the
2. rollback. Also check the results.
 Add default, check, unique and not null constraints to the schema.
 Insert NULL values and check the results.
 Add duplicate value and try to make a column as primary key,
check what happen to the table.

Week 3: (If the Employee table is not present in the `db.sql` file,
please create it.)
 Create an Employee table with the following attributes and
constraints:
Employee Table - (Employee Id. (Primary key), Name,
Department, Age (check >18), Salary, City).
 Display the total number of employees.
 Retrieve all information of employees whose age is 22.
3.  Fetch the employee id, name, and department, whose salary >=
50000.
 Print the name of the employees and label the column as "Full
Name" for those employees whose department name is 'Finance'
and age is 22.
 Print the department names from the employee table without
having the duplicates.
Perform similar queries until the end of the lab session.

Week 4:
 Find out the maximum and minimum salary from the employee
table.
 Show the total salary and average salary of all the employees.
 Show all the details of the employees who have the same salary.
4.
 Display the employees name from lowest salary to the highest
salary.
 Display the employee name and salary (department-wise) for
employees, whose salary is greater than or equal to 10,000 and
age is greater than 25.
 Week 5:
 Fetch the information of employees who belong to the city "Delhi"
or "Pune."
 Print the name and department of employees whose ID is in the
range from 2001 to 2005.
 Show the names of employees who belong to the same city (use
5. the IN operator).
 Check whether the all employee is belongs to the same city or not.
(use ALL operator)
 Check whether the all employee is belongs to the same city or not.
(use ANY operator)
 Check whether the all employee is belongs to the same city or not.
(use Exists operator)

Week 6:
 Show the record of employees who are working in the 'CSE'
department.
 Fetch the names of employees whose names start with the letters
'ay'.
 Fetch the information of employees, including their names and
departments, whose names end with the letters 'sh'.
 Display the employee names and their departments of employees,
6.
whose city name starts with 'D' or ends with 'h'.
 Print all records of employees whose salary is greater than 15,000
and whose name starts with 'h'.
 Print the names of employees whose names consist of exactly
three letters.
 Print the names of employees along with their city for those whose
names have at least five letters.

Week 7:
 Create two tables named as employee and department with the
given constraints and attributes:
Employee table - (Employee Id.(Primary key), Department ID,
Name, Age (check >18), Salary, City)
Department table - (Department Id, and Department name)
7.  Display the details of employees along with their corresponding
department names.
 Print the names of employees who are not assigned to any
department.
 Print the employee names and department names for employees
whose salary is greater than 25,000. (Using left join).
 Display the names of employees along with their department
names for those who are not assigned to any department.
  Print the employee names and their corresponding department
names for employees with a salary greater than 25,000. (Using
right join).
 Display the names of departments along with the names of
employees who are older than 30 years.

Week 8:
 Create the table to keep track of customer records and their order.
Customer table - (Name as Not null, Customer_id as primary key,
Age, Address)
Order table - (Customer_id, order_id, date).
 Apply the full join and the full outer join to the schema and review
8. the results.
 Display the name of the city as "destination" for customers who
have placed orders.
 Apply the cross join and check the results.
 Display the customer names and order IDs for customers who
have placed orders from the same city.

Week 9:
 Create the Student table, Register table and Program table.
Student table - ( Roll no. as primary key, Name as not null, city)
Program table - ( Program ID as primary key, Program Name as
not null, Program Fee not less than 10000, Department)
Register table - ( Program ID and Roll no. as primary composite
key)
 Display the details of students who are registered in the "MCA"
program.
 Display the list of all students, who are registered in at least one
program.
9.  Display the details of programs that have fees greater than the
average fee.
 Display the names of students who are registered in a program
having fees less than 30000.
 Display the details of students who have not registered in any
course.

 Display the names of programs in which a maximum number of

students are registered.

 Display the names of programs in which a minimum number of

students are registered.

Week 10:
10.
 Find out the second minimum salary of an employee.
  Find out the second minimum salary of an employee without using
limit, dense range, and order by clause.

 Find out the third maximum salary of an employee.

 Find out the third maximum salary of an employee without using

limit, dense range, and order by clause.

 Display the names and salaries of employees who earn more than
the average salary of their department.

 Fetch the list of the employee who belongs to the same

department but earns less than the second employee.

 Display the names of employees who are older than their

colleagues in the same department.

Week 11:
 Create a row level trigger for the customers table that would fire
for INSERT or UPDATE or DELETE operations performed on the
EMPLOYEE table. This trigger will display the salary difference
between the old values and new values.
 Add a new employee with the salary value inserted and check the
11. result.

 Try to update the existing employee salary and see what happens.

 Delete a record of employees and check what happens.

 Convert employee name into uppercase whenever an employee

record is inserted or updated.

Week 12:
Case study 1: (General Hospital)
A hospital relies on a database to manage its operations effectively. This
database helps keep track of various aspects, including different wards
like the General Ward, Emergency Ward, and Specific Ward. Each ward
contains patients who are admitted based on their General Practitioner's
12. (GP) recommendation and the approval of a consultant from the hospital.
When a patient is admitted, the hospital records essential personal details
such as their name, age, gender, address, and contact information. This
information is crucial for medical and administrative purposes. Additionally,
the hospital maintains a separate register to record all medical tests and
treatments for each patient, ensuring that their medical history is
thoroughly documented. Patients may undergo multiple tests during their
stay, and the database is designed to link each patient with these test
 records. Each patient is assigned a leading consultant who oversees their
treatment, but they may also be examined by other doctors if needed.

The database also tracks the connections between patients, consultants,

and doctors. Consultants and doctors might specialize in different medical
fields and can treat patients from various wards, adding flexibility to the
care provided. Overall, this database ensures that patient information,
medical records, and hospital operations are managed efficiently. It
supports the hospital in delivering high-quality care, streamlining
administrative tasks, and addressing the specialized needs of patients and
medical staff.

Based on the details provided in the case study, address the

following requirements:

Create an ER diagram based on the hospital's database system case

study. Include entities like patients, wards, consultants, and doctors with
relevant attributes such as Patient ID, Ward ID, and Consultant ID. Also,
none of the entities in the template are marked as weak; if you wish to
change that, you may. You will need to specify two things:

a. Specify all attributes and keys for each entity. Clearly define
relationships, such as patients being associated with wards, consultants,
and doctors, and include connections between patients and their medical
tests.
b. Define all relationships and constraints, including primary keys,
cardinality, and participation constraints. Show how a patient can undergo
multiple tests and be treated by various doctors.
Note: Model most constraints from the description. If some constraints
can't be represented, provide comments explaining the limitations.

Week 13:
Case Study 2: (Tracking the Employee Record)
An organization has implemented a detailed database system to manage
and track its employees and departmental activities. The organization is
divided into various departments, each with a unique identification number
and name. Each department is managed by a designated manager, who
is responsible for overseeing the operations within that department.

13. Additionally, some departments may be located in different geographic

locations, reflecting the organization’s diverse operational reach. The
database maintains comprehensive records for each employee, including
their name, identification number, birth date, address, gender, and salary.
Employees are assigned to specific departments, and the system tracks
the date on which a manager was appointed to each department, ensuring
that managerial changes are recorded accurately. Beyond departmental
assignments, the database captures supervisory relationships where
employees may be directly supervised by others. This helps in
understanding the hierarchical structure within the organization. Moreover,
every project undertaken by the organization is managed by a specific
department, although employees from various departments may be
assigned to these projects based on their expertise and the project’s
requirements.
For each project, the database includes details such as the project name,
project number, and location. Additionally, it records the hours spent by
employees on each project, providing insights into individual contributions
and project progress. This tracking helps in managing project resources
effectively and ensures that employees’ time and efforts are properly
accounted for. Overall, this database system facilitates efficient
management of employee information, departmental structures, and
project assignments. It allows the organization to monitor departmental
performance, manage employee roles and responsibilities, and track the
progress of various projects with precision. This comprehensive approach
ensures that all aspects of employee and project management are well-
coordinated and effectively managed.

Based on the details provided in the case study, address the

following requirements:

Create an ER diagram representing the organization's database system.

Include key entities such as Departments, Employees, and Projects. For
each Department, capture attributes like Department ID, Department
Name, Manager ID, and Location. For Employees, include attributes such
as Employee ID, Name, Birth Date, Address, Gender, Salary, and
Department ID. Projects should have attributes like Project ID, Project
Name, and Project Location.

a. Specify all attributes and primary keys for each entity. Clearly define
relationships between entities, such as employees being assigned to
departments, departments managing projects, and supervisory
relationships among employees.
b. Define the relationships and constraints, including primary keys,
cardinality, and participation constraints. For example, a department can
manage multiple projects, and employees can work on multiple projects
while reporting to one or more supervisors.
Note: Include comments to address any constraints from the case study
that cannot be fully represented in the ER diagram. Ensure the diagram
accurately reflects the management of employee information,
departmental structures, and project assignments as described.

Based on the provided case study, perform the following queries:

a. Write an SQL query to identify the department(s) with the highest
average salary among its employees.
b. Write an SQL query to list all employees who are directly supervised by
more than one manager.
c. Write an SQL query to find the project(s) with the highest total hours
spent by employees.
 d. Write an SQL query to find all employees who have never been
assigned to any project.
e. Write an SQL query to list each department along with the total number
of projects managed by the department and the total number of employees
assigned to it.

Week 14:
Case Study 2: (Trainee Record in a Institution)

A training institute requires a sophisticated database to effectively track

the progress of trainees in their various training programs. Trainees enroll
in different programs, such as Java Developer, Full Stack Developer, and
Data Scientist. Each of these programs consists of several courses offered
by the institute, each with its own unique code, title, and number of credit
hours. Courses are overseen by an instructor, who may also be involved
in teaching the course. In addition to the main instructor, each course has
one or more teaching assistants who help facilitate the course. An
instructor can manage and teach multiple courses across different
programs, reflecting their expertise and versatility. The database captures
detailed information about each course, including its unique code, title,
credit hours, the instructor responsible for managing and teaching the
course, the teaching assistants assigned, and the department to which the
course belongs. Each course may have prerequisites, which means that
some courses must be completed before others can be taken. This
requirement ensures that trainees follow a structured learning path.
Additionally, some training programs have mandatory courses that all
trainees must complete to successfully finish the program.
14.
For trainees, the database records essential details such as their ID
numbers, names, addresses, the training program they are enrolled in, and
their academic performance. This includes information on the courses they
have taken and the grades they received. By maintaining these records,
the database helps monitor each trainee's progress and ensures they meet
the necessary requirements for their chosen program. This database
system plays a crucial role in managing the training institute’s operations.
It provides a clear view of course offerings, tracks the performance of
trainees, and ensures that the educational requirements and prerequisites
are properly enforced. This comprehensive approach allows the institute
to deliver a well-organized training experience and supports both the
instructors and trainees in achieving their educational goals.

Based on the details provided in the case study, address the

following requirements:

Develop an ER diagram to model the training institute's database system,

incorporating all key entities and their attributes. The primary entities to
include are Trainees, Programs, Courses, Instructors, and Teaching
Assistants. For each entity, specify attributes and primary keys: Trainees
should have Trainee_ID, Name, Address, Program_ID, and Performance
 details. Courses should include Course_Code, Title, Credit_Hours,
Prerequisites, and links to Instructors and Teaching Assistants.

a. Define the relationships between entities, such as Trainees being

enrolled in Programs, Courses assigned to Programs, and Instructors and
Teaching Assistants managing and teaching Courses. Include
relationships for course prerequisites and mandatory courses within
Programs.
b. Clearly specify key constraints like primary keys for each entity and
cardinality and participation constraints for relationships. For instance, a
Course may have multiple Teaching Assistants and prerequisites, while a
Trainee can be enrolled in multiple Courses.
Note: Add comments to highlight any constraints from the case study that
are challenging to represent in the ER diagram. Ensure the diagram
effectively captures the management of trainees' progress, course
requirements, and instructor roles as outlined.

Based on the provided case study, perform the following queries:

a. Write an SQL query to show the names and IDs of trainees who have
completed all the required courses for their program.
b. Write an SQL query to get the names of instructors and the courses they
teach, including any courses that have prerequisites.
c. Write an SQL query to find the average grade for each course and list
the courses where the average grade is below than 70%.
d. Write an SQL query to find the trainees who have signed up for the most
courses, no matter which program they are in.
e. Write an SQL query to list all courses and the total hours all trainees
have spent on each course.
Total 40

11. Suggested Books:

S. Name of Authors/Books/Publishers Edition Year of Publication /

No. Reprint

Text Books

1. RamezElmasri, Shamkant, B. Navathe, “Database 7th 2015

Systems”, Pearson Education, 7Th Edition.

3. M L Gillenson, “Introduction to Database 2nd 2012

Management”, Wiley Student Edition

Reference Books
 1. Mary Beth Roeser: [1Oracle® Database] SQL 2nd 2017
Language Reference 12c Release 1 (12.1) E41329-
25

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

Name of Department: - Computer Science and Engineering

Cloud-Based Application
1. Subject Code: TCS 552 Course Title: Development and Management

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 SEE 50
5. Credits: 3

6. Semester: 5

7. Category of Course: DE

8. Prerequisite: TCS-451

9. Course After completion of the course the students will be able to:
Outcome**: CO1: Recognize the cloud based application development platforms and
economic benefits.
CO2: Analyze the use case of various cloud service provider’s applications and
platforms.
CO3: Apply the advanced cloud computing application’s concepts.
CO4: Analyze the use case of cloud-based application deployment and
management concepts.
CO5: Explore the use case of various cloud platforms, offered services and
security aspects.

CO6: Develop and deploy the cloud based server-side application using Node.js
and the front-end using React.

** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.

10. Details of the Course:

SL. Contact
Contents
NO. Hours
Unit 1:
Fundamental of Cloud Based Applications
Cloud Data centers, Software stack, Virtualization, software defined networks
1 and storage, cloud storage, and programming models, Clouds Based Application 9
development motivating factors, benefits, challenges, service models, SLAs and
security. Concepts behind data center design and management, Economic and
technological benefits of the cloud paradigm.
2 Unit 2:
Cloud Platforms in Industry 9

Amazon Web Services: Compute Services, Storage Services, Communication

Services.
Google App Engine: Architecture, Core Concepts, Application Life Cycle, Cost
Model, Observations.
Microsoft Azure: Azure Core Concepts, SQL Azure, Azure Compute and
Storage, Azure Database and Networking, Monitoring and Managing Azure
Solutions.
IBM Cloud (Kyndryl), Salesforce, Heroku, Alibaba Cloud, Oracle Cloud,
Tencent Cloud, OVHcloud, DigitalOcean, and Linode (Akamai).
Case study on available Cloud Platforms in Industry.
Unit 3:
Advanced Cloud Computing
Energy Efficiency in Clouds, Green Cloud Computing Architecture, Market
based Management of Clouds, Market-Oriented Cloud Computing, Reference
Model for MOCC.
Federated Clouds/Intercloud: Definition, Characterization, Cloud Federation
3 Stack, Technologies for Cloud Federation. 9
Third Party Cloud Services, MetaCDN, Spot Cloud, Cloud Authentication
Protocols, Cloud Security Threats with Cloud Apps.
Virtualized CPU, memory and I/O resources, network (SDN) and storage (SDS),
Key role of virtualization to enable the cloud. Cloud storage concepts like data
distribution, durability, consistency and redundancy.
Case study on Advanced Cloud Computing services.
Unit 4:
Cloud Management
Fundamentals of Cloud Management, Management Services, Cloud properties,
Multi-tier Application Deployment in Clouds, Challenges, Requirements,
4 Service Level Agreements (SLAs),Billing& Accounting.
9
Cloud Policy and Governance: Risk Management and Regulatory Practices.
Cloud Analytics and Cost Metrics.
Case study on Cloud Management Services, Distributed file systems, NoSQL
databases, object storage using HDFS, CephFS, HBASE, MongoDB,
Cassandra, DynamoDB, S3, and Swift.
Unit 5:
Cloud Based Secured Applications Development
Current trends in cloud computing i.e. IoT, Big Data, Machine Learning. Cloud
Infrastructure Security, Network level security, Host level security, Application
level security, Access management and control.
MapReduce, Spark and GraphLab programming models, Develop and deploy
5 the cloud based server-side application using Node.js and the front-end using
React, Case Study on Open Source and Commercial Clouds applications: 9
Amazon EC2, Amazon S3,Amazon Redshift, GitHub Repository, AWS IoT
Core, AWS IoT Device Defender, AWS IoT Device Management, AWS IoT
FleetWise, AWS IoT SiteWise, AWS IoT Events, AWS IoT TwinMaker, AWS
IoT Analytics, Azure IoT Hub, Azure IoT Central, Azure Digital Twins, Azure
IoT Edge, Azure Percept, Azure Sphere, and Azure RTOS.
Design and Deploy a Restaurant Application to Cloud.
Total 45 Hrs.
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of Publication
No. / Reprint
Textbooks
1. Mastering Cloud Computing by Rajkumar Buyya, 1st 2013.
Vecchiola & Selvi (Published by McGraw Hill Education
Pvt. Ltd),
2 Cloud Management & Security by Imad. M. Abbadi 3rd 2014.
(WILEY Publication
Reference Books
1. Cloud Computing – A Hands-On Approach by Arshdeep 1st 2014
Bahga, Vijay Madisetti.

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

Name of Department: - Computer Science and Engineering

Communication
1. Subject Code: TCS 531 Course Title: models and protocols

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 ESE 50

5. Credits: 3

6. Semester: V

7. Category of Course: DE

8. Pre-requisite: NA

9. Course After completion of the course the students will be able to:
Outcome**:
CO1: Understand the common network communication primitives as part of
programming tasks in various languages.

CO2: Discuss the various Protocols used in Communication

CO3: Analyze more complex protocol engineering and network management tasks

CO4: Understand terminology, concepts, and technologies required for

telecommunication in local area networks (LANs) and on the global Internet

CO5: Describe and analyze the Data Encoding and Transmission techniques.

CO6: Use of network management tools

** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.

10. Details of the Course:

Contact
S.NO. Contents
Hours
Unit 1:
Introduction and Overview:Key elements of communications and networking,
Layered protocol model, Network edge, End systems, access networks, links,
1 9
Network core, Packet switching, circuit switching, network structure,
Multiplexing, Delay, loss and throughput in networks, Protocol layers, service
models, Networks under attack: security, History.
 2 Unit 2:
9

Application Layer: Principles of network applications, Web and HTTP, FTP,

Electronic Mail, SMTP, POP3, IMAP, DNS, P2P applications, Video streaming
and content distribution networks, Ethereal (network packet sniffer), Socket
programming with UDP and TCP

Unit 3:
Data Encoding and Transmission: Data encoding and transmission concepts,
Digital data transmission over digital signal: NRZ encoding, Multilevel binary
encodings, Biphase encodings, Scrambling techniques, Digital data transmission
over analog signal: Public telephone system, Amplitude Shift Keying (ASK),
3 Frequency Shift Keying (FSK), Phase Shift Keying (PSK), Performance of digital 10
to analog modulation schemes, Quadrature Amplitude Modulation (QAM), Analog
data transmission over digital signal: Digitization, Pulse Code Modulation, Non-
linear encoding, Delta modulation, Analog data transmission over analog signal:
Asynchronous transmission, Synchronous transmission, Ethernet link layer frame
example.
Unit 4:
4 Data Link Control: Introduction and services, Error detection and correction, 8
Multiple access protocols, LANs, Addressing & ARP, Ethernet, Switches, VLANs,
PPP, Link virtualization, MPLS, Data center networking, Web request processing.
Unit 5: Wireless and Mobile Networks

5 Wireless, Wireless links, characteristics, CDMA, IEEE 802.11 wireless LANs

(“Wi-Fi”), Cellular Internet Access: Architecture, Standards (e.g., 3G, LTE), 9
Mobility, Principles: addressing and routing to mobile users, Mobile IP, Handling
mobility in cellular networks, Mobility and higher-layer protocols
Total 45
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of
No. Publication /
Reprint
Textbooks
1. 1.Douglas E. Comer,” Internetworking with TCP/IP 6th 2014
Volume One - 6th Edition” Publisher is Pearson, © 2014
2. Protocol specifications (RFCs) and other readings will 1st 2008
also be assigned

Reference Books
1. Seymour Lipschutz, Data Structures Schaum's Outlines, 1st 2014
McGraw Hill

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V
Name of Department: - Computer Science and Engineering
Computer System Security
1. Subject Code: Course Title:
TCS 591

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs): Theory 3 Practica l 0

4. Relative Weight: CIE 25 MSE 25 SEE 50
5. Credits: 3
6. Semester: V
7. Category of Course: DE
8. Pre-requisite: TCS-491

9. Course After completion of the course, the students will be able to:
Outcome**: CO1: Explain different security threats and attacks.

CO2: Know the working of different attacks and security protocols.

CO3: Analyze the different security protocols.

CO4: Use programming to implement security protocols.

CO5: Use programming to implement security protocols.

CO6: Develop system security protocols

** Describe the specific knowledge, skills, or competencies the students are expected to acquire or
demonstrate.
10. Details of the Course:

Sl. Contact
Contents
No. Hours
Unit 1:
Introduction to System security:
Control hijacking attacks buffer overflow, integer overflow, bypassing browser
1 memory protection, Sandboxing and Isolation, Tools and techniques for writing 10
robust application software, Security vulnerability detection tools, and techniques
program analysis (static, concolic and dynamic analysis), Privileges, access
control, and Operating System Security, Exploitation techniques, and Fuzzing
 Unit 2:
Software security:
2 Vulnerabilities, Attacks, and Countermeasures: Privileged programs (Set-UID 10
programs) and vulnerabilities & Privilege Separation, Buffer Overflow
vulnerability and defences, Return-to-libc attack, Race, Condition vulnerability

and attack, Dirty COW attack, Format String vulnerability and attack, Shellshock
attack, Heartbleed attack Interactivity, Annotation, and Arrangement;

Unit 3:
Web Security:
Same origin Policy, Cross site scripting attack, Cross site request forgery attack,
3 10
Sql Injection attack, Clickjacking attack, Content Security Policies (CSP) in
web, Web Tracking, Session Management and User Authentication, Session
Integrity, Https, SSL/TLS, Threat Modelling
Unit 4:
Smartphone Security:
Android vs. ioS security model, threat models, information tracking, rootkits,
4 9
Access control in Android operating system, Rooting android devices,
Repackaging attacks, Attacks on apps, Whole- disk encryption, hardware
protection, Viruses, spywares, and keyloggers and malware detection
Unit 5:
Hardware and system security:
Meltdown Attack, spectre attack, Authentication and password, Access control
5 6
concept, Access control list, Capability, Sandboxing, Threats of Hardware
Trojans and Supply Chain Security, Side Channel Analysis based Threats, and
attacks. Issues in Critical Infrastructure and SCADA Security.
Total 45

11. Suggested Books:

SL. Name of Authors/Books/Publishers Edition Year of Publication /
No. Reprint
Textbooks
1. Security in Computing, Book by Charles P Pfleeger and 5th 2015
Shari Lawrence Pfleeger, V edition
2. Cryptography and Network Security: Principles and 7th 2017
Practice, Book by William Stallings, VII edition
Reference Books

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

TCS 512 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. Contact Hours: L: 3 T: 0 P: 0

2. Examination Duration (Hrs.): Theory 3 Practical 0

3. Relative Weight: CIE 25 MSE 25 SEE 50

4. Credits: 3

5. Semester: 5

6. Category of Course: DC

7. Pre-requisite: Python
Programming

9. Course After completion of the course the students will be able to:
Outcome**: CO1: Understand the concepts of Artificial Intelligence and Machine
Learning with their related terminologies.
CO2: Analyze and Apply various programming skills and libraries for
understanding Data nature and its requirements.
CO3: Analyze and apply various modelling techniques for basic data
Analytics.
CO4: Demonstrate Problem Solving using ML algorithms.
CO5: Understand, Apply and Demonstrate different techniques and tools
for Analysis.
CO6: Analyze Real World Case Studies on Applications of Artificial
Intelligence and Machine Learning
** Describe the specific knowledge, skills or competencies the students are expected to acquire or
demonstrate.

10. Details of the Course:

Sl.
Contents Contact Hours
No.
Unit 01:

Introduction to AI: Definitions, Foundations AI, History of AI,

Intelligent Agents, Structure of Intelligent Agents, Environments;
1 Problem solving Agents, Problem Formulation, Search 10
Strategies, Constraint Satisfaction Search, Informed search
Methods

Unit 02:
2 Knowledge representation and reasoning: Agents that Reason 10
Logically, Propositional Logic and Inference,
First-Order Logic, Inference in First-Order Logic
 Planning and Learning: Introduction to Planning, Types, Learning
from observations, Forms of Learning,
Inductive Learning, Reinforcement Learning
Unit 3:
Introduction to Machine Learning: What is Machine Learning,
Introduction to ML's three approaches: Supervised, Unsupervised
3 and Reinforcement Learning, Important Statistical Concepts used 10
in Machine Learning, Current Status of Machine Learning

Supervised Learning Algorithms: Linear Regression, Logistic

Regression, Gradient Descent, Decision Trees, Random Forest,
Support Vector Machine, ,K- Nearest Neighbors, Naive Bayes
Unit 4:
4 Clustering: K-means, Hierarchical Clustering, 10
Dimensionality Reduction, Principle Component Analysis.
Model Evaluation and Selection: Cross-validation, model evaluation
metrics, model selection, and hyperparameter tuning.
Hyperparameter Optimization Techniques Manual Search, Random
Search, Grid Search
Case study in Python for Hyperparameter Tuning
Unit 5:
Problem Solving Agent, Formulating Problems, Example Problems,
5 Uninformed Search Methods, Informed Search Method, Local 8
Search Methods, Genetic algorithms, Adversarial Search

Total 48
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of Publication
No. / Reprint
Textbooks
1. Deepak Khemani, A First Course in Artificial 6th 2018
Intelligence, McGraw Hill Education
2. N. P. Padhy, Artificial Intelligence and 1st 2005
Intelligent Systems, Oxford
3 B.Uma Maheshwari, R.Sujatha, Introduction to Data 1st 2021
Science, Wiley
4 Jake VanderPlas, Python Data Science Handbook, 1st 2022
O’Reilly
Reference Books
1. Stuart J. Russell and Peter Norvig, Artificial Intelligence 3rd 2009
a Modern Approach, McGraw Hill

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

TCS 592 DEEP LEARNING FUNDAMENTALS

Deep Learning

S.No. Topic

History of Deep Learning, Deep Learning Success Stories

1
2 Machine learning basics

Introduction to deep learning, Neural Network Basics

3

McCulloch Pitts Neuron, Thresholding Logic, Perceptrons,

Perceptron Learning Algorithm and Convergence, Multilayer
Perceptrons (MLPs), Representation Power of MLPs
4
Sigmoid Neurons, Gradient Descent, Feedforward Neural
Networks, Representation Power of Feedforward Neural
5 Networks

6 Feedforward Neural Networks, Backpropagation

Gradient Descent (GD), Momentum Based GD, Nesterov

Accelerated GD, Stochastic GD, AdaGrad, RMSProp, Adam
7

Bias Variance Tradeoff, L2 regularization, Early stopping,

Dataset augmentation, Parameter sharing and tying,
Injecting noise at input, Ensemble methods, Dropout
8

Greedy Layerwise Pre-training, Better activation functions,

Better weight initialization methods, Batch Normalization
9
Convolutional Neural Networks, LeNet, AlexNet, ZF-Net,
10 VGGNet, GoogLeNet, ResNet
Visualizing Convolutional Neural Networks, Guided
Backpropagation, Deep Dream, Deep Art, Fooling
11 Convolutional Neural Networks
12 Learning Vectorial Representations Of Words
 Recurrent Neural Networks, Backpropagation Through Time
(BPTT), Vanishing and Exploding Gradients, Truncated BPTT
13
Gated Recurrent Units (GRUs), Long Short Term Memory
(LSTM) Cells, Solving the vanidhing gradient problem with
14 LSTMs
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS 511 Course Title: Computer Networks

2. Contact Hours: L: 3 T: 0 P: 0

3. Examination Duration (Hrs):Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 SEE 50

5. Credits:
3
6. Semester:
V
7. Category of Course:
DC

8. Pre-requisite: NIL
 9. Course After completion of the course the students will be able to:
Outcome**: CO1: Apply and Characterize computer networks from the view point of
components and from the view point of services.
CO2: Display good understanding of the flow of a protocol in general and a
network protocol in particular
CO3: Evaluate and Select the most suitable Application Layer protocol (such as
HTTP, FTP, SMTP, DNS, BitTorrent) as per the requirements of the network
application and work with available tools to demonstrate the working of these
protocols.
CO4: Design a Reliable Data Transfer Protocol and incrementally develop
solutions for the requirements of Transport Layer
CO5: Describe the essential principles of Network Layers and use IP addressing to
create subnets for any specific requirements
CO6: Evaluate and select the appropriate technology to meet Data Link Layer
requirements and design a framework to implementing TCP/IP protocol suite.
** Describe the specific knowledge, skills or competencies the students are expected
to acquire or demonstrate.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
Unit 1: Introduction: Computer Networks and the Internet, Overall view: As
components and as services; What is a protocol, what is a network protocol,
Access Networks and Physical Media, Circuit and Packet Switching, Internet
1 Backbone, Delays: Processing, Queuing, Transmission and Propagation delays, 11
The Layered Architecture: Protocol Layering, The OSI Reference Model and
the TCP/IP protocol stack, History of Computer Networking, and the Internet.

Unit 2: Application Layer: Principles and Architectures of Network

Applications, Client and Server processes, the idea of socket, Transport
services available to Application Layer especially in the internet Application
Layer Protocols: The Web and http: Persistent and Nonpersistent connections,
http message format, cookies, proxy server, conditional GET, File Transfer
2 11
Protocol, Email: smtp, mail message formats, mail access protocols: pop3,
imap, MIME, DNS: Services, How it works, Root, Top-Level and Authoritative
DNS servers, Resource Records, DNS messages A simple introduction to p2p
file distribution: BitTorrent

Unit 3: Transport Layer: Introduction and Services, The Transport layer in

internet, Difference between Connection Oriented and Connectionless services,
UDP: Segment structure, checksum in UDP, stop-and-wait, Go Back N,
3 6
Selective Repeat, TCP: Connection Establishment, TCP header, Sequence and
acknowledgement numbers, Round Trip Time, Flow Control, Congestion,
Control.
 Transport Layer: Introduction and Services, The Transport layer in internet,
Difference between Connection Oriented and Connectionless services UDP:
Segment structure, checksum in UDP

Unit 4: Network Layer: Introduction, Packet Forwarding and Routing,

Difference between Virtual Circuits and Datagram networks, The internals of a
router: Input ports, output ports, switching architecture The Internet
Protocol(IP), Datagram format, IP fragmentation, IPv4, addressing, subnets,
CIDR, classful addressing, DHCP, Network Address Translation(NAT),
Universal Plug and Play as a provider of NAT, Internet Control Message
4 Protocol(ICMP), IPv6 Header, Moving from IPv4 to IPv6: tunnelling. Routing 6
Algorithms: Introduction, global vs decentralized routing, The Link State(LS)
Routing Algorithm, The Distance Vector (DV) Routing Algorithm,
Hierarchical Routing, Introduction to Routing in the Internet: RIP, OSPF, BGP;

Unit 5: Link Layer and Local Area Networks: Introduction to Link Layer and
its services, Where Link Layer is implemented? Error detection and correction
techniques: Parity checks, Checksum, CRC; Multiple Access protocols:
5 Channel Partitioning, Random Access (Slotted Aloha, Aloha, CSMA), Taking 10
Turns; Link Layer Addressing: MAC addresses, ARP, Ethernet, CSMA/CD,
Ethernet Technologies, Link Layer Switches, Switches vs Routers

Total 45
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of
No. Publicati
on /
Reprint
Textbooks
1. Computer Networking: “A Top Down Approach (5th edition)”, 7th 2017
Ross and Kurose, Pearson/Addison-Wesley
Reference Books
1. Andrew Tanenbaum and David Wetherhall, “Computer Networks”, 5th 2010
Prentice Hall
2. Peterson and Davie, “Computer Networks: A System Approach”, 4th 2007
Elsevier

3. Forouzan, “Data Communication and Networking”, McGraw Hill 5th 2013

4. William Stallings: “Data and Computer Communication”, Pearson 8th 2007

Education, 2007
5. Nader F. Mir:” Computer and Communication Networks”, 1st 2007
Pearson Education.

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term
Exam
 GRAPHIC ERA HILL UNIVERSITY, DEHRADUN
SEMESTER V

Name of Department: - Computer Science and Engineering

Computer Vision
1. Subject Code: TCS 548 Course Title:

2. Contact Hours: L: 3 T: 0 P:

3. Examination Duration (Hrs): Theory 3 Practical 0

4. Relative Weight: CIE 25 MSE 25 SEE 50

5. Credits:

6. Semester:
6th
7. Category of Course:
DE

8. Pre-requisite: TCS 301, Any Programming Language

 9. Course After completion of the course the students will be able to:
Outcome**: CO1: Understand the principals the Image Processing terminology used to
describe features of images.
CO2: Understand the mathematical foundations for digital manipulation of
images
CO3: Design, code and test digital image processing applications using
MATLAB.
CO4: Analyze a wide range of problems and provide solutions related to the
design of imageprocessing systems through suitable algorithms,
structures, diagrams, and other appropriate methods.
CO5: Plan and undertake a major individual image processing project.
CO6: Write programs in Matlab for digital manipulation of images; image
acquisition; preprocessing; segmentation.
** Describe the specific knowledge, skills or competencies the students are expected
to acquire or demonstrate.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
Unit 1:
INTRODUCTION TO IMAGE PROCESSINGAND COMPUTER VISION: Pixels,
Intensity, Coordinate Conventions, Sampling and Quantization, Histogram Analysis,
Videos, Image Processing Pipeline, Image Processing and Computer Vision Research
1 Areas: Low-level, Mid-Level and High-Level Vision. INTRODUCTION TO MATLAB /
9
OCTAVE:Basic Opeartions, Image / Video handling, Flow Control, Vectorization.
INTRODUCTION TO PYTHON:Basic Opeartions, Lists, Tuples, Strings, Dictionaries,
Flow Control, Numpy, Image/Video handling, OpenCV, PIL, Orange.
Unit 2: IMAGE PROCESSING / LOW-LEVEL VISION: Image Enhancement in Spatial
Domain, Image Enhancement in Frequency Domain, Edge Detection, Image
Restoration, Color Image Processing, Wavelet Transform, Image Compression,
2 Morphological Image Processing, Color Image Processing, Stereo Vision, Motion 9
Analysis, Local and Image Features, Visual Saliency

Unit 3: MID-LEVEL VISION: Hough Transform, Otsu Thresholding, k-means, GraphCut,

3 GrabCut, Normalized Cut, Watersheds, Skeleton Extraction, Object Proposals, 11
Cosegmentation, Background Subtraction in Videos, Motion History Image

Unit 4: HIGH-LEVEL VISION: Image Classification, Object Localization, Object

4 Recognition, Object Detection, CNN, AlexNet, VGG, GoogleNet, DenseNet, FCN for 9
Semantic Segmentation, YOLO, Image Captioning, generative adversarial networks

Unit 5:
APPLICATIONS OF IMAGE PROCESSING AND COMPUTER VISION: Video
5 Surveillance Systems, Medical Diagnosis, Facial recognition system, Automatic activity 10
recognition system, Fire detection System, traffic sign detection and recognition

Total 48
11. Suggested Books:
SL. Name of Authors/Books/Publishers Edition Year of Publication
No. / Reprint
Textbooks
1. Digital Image Processing, by R. C. Gonzalez, R. E. Woods 4th 2017
and S. L. Eddins , Publisher: Pearson. Edition
2. Digital Image Processing using Matlab, by R. C. Gonzalez, 2nd 2017
R. E. Woods and S. L. Eddins , Publisher: Pearson.
3. Deep Learning for Computer Vision, by Rajalingappaa 1st 2018
Shanmugamani, Publisher: O Reilly
Reference Books
1. Deep Learning with Keras by Antonio Gulli, Sujit Pal, 1st 2017
Publisher: O Reilly
2. Programming Computer Vision with Python", Jan Salem, 1st 2012
Publisher: O Reilly

12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term Exam