Syllabus 2023 New - Compressed 119 170

GRAPHIC ERA (DEEMED TO BE 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: 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: 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
SEMESTER V
Name of Department: - Computer Science and Engineering Computer Based Numerical

1. Subject Code: TMA 502 Course Title: and Statistical Technique
5. Credits: 3
6. Semester: 5
8. Pre-requisite: TMA 101, TMA 201
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.
demonstrate.

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
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
SEMESTER V

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

5. Credits: 2
6. Semester: 5th
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.
demonstrate.
Sl. List of problems for which student should develop program and execute in Contact
No. the Laboratory Hours
Problem Statement 1:
Granting Permissions: Data Control Language (DCL) Commands: 2
1.
Grant/Revoke.
Creation of database/tables for different applications (DDL commands):
2. 2
Creating tables (without constraints)
3. Problem Statement 3: 2
Creation of database/tables for different applications (DDL commands):
Creating tables (with Column level and Table level constraints)
Inserting data into database (DML Commands): updating / deleting records in a
4. table. 2
5. TCL command: saving (commit) and undoing (rollback) 2
6. Data retrieval (DR) command: Fetching data from database using SELECT, 2
FROM and WHERE command (Projection and Selection)
7. 2
Perform the following: Altering a Table, Dropping/ Truncating/ renaming
Tables, backing up/ restoring a database
For a given set of relational schemas, create tables and perform the following:
8. Simple queries; Simple queries with aggregate functions (group by and having 2
clause).
Queries involving, Date functions, string functions (character manipulations and
9. 2
case manipulation functions)

10. 2
Math functions, CASE, DECODE, Implicit and explicit typecasting functions.
11. Join Queries: Inner join, Equi-join, natural join, Outer join (LEFT-OUTER 3
JOIN, RIGHT OUTER JOIN and FULL OUTER JOIN)
12. Subqueries-with IN clause, with EXISTS clause 2

For a given set of relation tables perform the following: Creating Views (with and
13. without Check options), Dropping a view, Selecting data from a view. 3

For a given set of relation tables perform the following: Creating Views (with
14. and without Check options), Dropping a view, Selecting data from a view. 2

15. Generate primary key values with Sequence. 2
16. optimization of queries with Indexes 2
17. Applying SYNONYMS on database objects. 2

18. Introduction to Dynamic SQL 2

19. Introducing Triggers on data objects 3

20. 3
Introducing Procedures on data objects for optimization of queries
Total 40
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
SEMESTER V

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

5. Credits: 3
6. Semester: 5
7. Category of Course: DE
8. Prerequisite: TCS-451
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.
demonstrate.

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.
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.
SEMESTER V
1. Subject Code: TCS 571 Course Title: Big Data Visualization

5. Credits: 3
6. Semester: V
8. Pre-requisite: Fundamental of Cloud Computing and Bigdata TCS 351
9. Course After completion of the course, the students will be able to:
Outcome**: CO1: Create and adapt visualizations to represent complex data sets and
emphasize targeted concepts for effective communication
CO2: Analyze and interpret large volumes of data to identify patterns, trends,
and insights.
CO3: Apply data visualization techniques to communicate complex data sets
effectively.
CO4: Develop skills in storytelling with data, effectively conveying narratives
through visual representations.
CO5: Demonstrate proficiency in using tools and technologies for big data
visualization.
CO6: Use leading open-source and commercial software packages (Tableau) to
create and publish visualizations that enable clear interpretations of big,
complex, and real-world data
** 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: Techniques for visual data representations: Data Visualization,
Information Visualization, Concept Visualization, Strategic Visualization,
Metaphor Visualization, and Compound Visualization.
1 Visualization design objectives: Methodology, Establishing intent, 10
The visualization's function-explain, explore, exhibit; Tone-analytical and
abstract, key factors in a visualization project, The eight hats of data visualization
design
2 Unit 2: Demonstrating Editorial Focus: Importance of editorial focus, 10

Preparing and familiarizing of data, Refining the editorial focus, Using visual
analysis to find stories
Conceiving and Reasoning: Preparing data, Refining, The Visualization
anatomy - Data Representation: choosing correct visualization method, physical
properties of data, degree of accuracy in interpretation, creating an appropriate
design metaphor, choosing the final solution; The Visualization anatomy-
Data presentation: Interactivity, Annotation, and Arrangement;
Unit 3: Taxonomy of Data Visualization: Choosing appropriate chart type:

Dot plot, Column chart, Floating bar, pixelated bar chart, Histogram,
Slopegraph, Radial chart, Glyph chart, Sankey diagram, Area size chart;
Assessing hierarchies and part-to-whole relationships: Pie chart, Stacked bar
chart, Square pie, Treemap, Circle packing diagram, Bubble hierarchy, Tree
3 Hierarchy; Showing changes over time: Line chart, Sparklines, Area chart, 9
Horizon chart, Stacked area chart, Candlestick chart, Barcode chart, Flow map;
Plotting connections and relationships: Scatter plot, Bubble plot, Scatter plot
matrix, Heatmap, Parallel sets, Radial network, Network Diagram; Mapping
geospatial data: Choropleth map, dot plot map, Bubble plot map, Isarithmic map
Unit 4: Tools for data visualization: Tableau, Google Charts, Datawrapper,

4 9
Chartio, IBM Watson Analytics, and Sisense
Unit 5: Data Visualization through Tableau: Tableau basics, connecting

Tableau to various datasets, creating bar charts, area charts, maps, scatterplots,
pie charts, and tree maps; Create Interactive Dashboards, storylines, Joins, Data
5 Blending, Table calculations, parameters, Dual axis charts, Export results from 8
Tableau to other software, Work with time-series data, Creating data extracts,
Aggregation, Granularity and Level of detail, Adding filters, create data
hierarchies, Adding actions to dashboards
Total 46
No. / Reprint
Textbooks
1. Andy Kirk, Data Visualization: a successful design process, 1st 2015
Packt Publishing
Reference Books
1. Tamara Munzer, Visualization Analysis and Design, CRC 2nd 2014
Press
SEMESTER V

Communication
1. Subject Code: TCS 531 Course Title: models and protocols
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 3
6. Semester: V
8. Pre-requisite: NA
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
demonstrate.

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
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
SEMESTER V
Computer System Security
1. Subject Code: Course Title:
TCS 591

5. Credits: 3
6. Semester: V
8. Pre-requisite: TCS-491
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.
CO6: Develop system security protocols

demonstrate.
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

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
SEMESTER V
1. Subject Code: TCS 509 Course Title: Machine Learning
2. Contact Hours: L: 3 T: P: 0

5. Credits: 3
6. Semester: V
8. Pre-requisite: Design and Analysis of Algorithm, Fundamental of Statistics and AI (TCS 421 /
Statistical Data Analysis with R (TCS 471), Discrete Structures and Combinatorics (TMA 316)
Outcome**: CO1: Acquire concepts and methods in statistical machine learning
CO2: Analyze fundamental principles of machine learning algorithms
CO3: Understand machine learning motivated by case-studies
CO4: Investigate and evaluate key topics in machine learning
algorithms for data science industry
demonstrate.

Sl. Contact
Contents
No. Hours
Unit 1:
Machine learning foundation
Review of logic and knowledge system - language, axiom, hypothesis, theorem,
logic & types, what is ML, Inductive bias in ML, AI pyramid, Pattern
classification pipeline, Linear algebra in ML, Probabilistic logic and statistical
1 inference (Random expt./ variable, CDF, WLLN, Bayes, Markov & Chernoff 14
bound, Hypothesis testing and performance indices - ROC, Estimation -
detection, Optimality of Bayes, bias-variance, underfit-overfit, entropy as
Information, Cover’s packing lemma, Curse of dimensionality, Case study:
Wealth – optimal payoffs in portfolios (stock market)
Unit 2:
Unsupervised Learning
Clustering, Clustering methods – Partition vs. Hierarchical, k-Means and k-
2 8
Medoids, Hierarchical: Agglomerative & Divisive, Error Analysis in Clustering,
Ensemble - clustering, Case study: Clustering in Health care, Causal cluster,
Graph cluster
Unit 3:
Supervised Learning
Main objectives and types of Supervised methods (Parametric, Semi parametric,
3 Non-parametric), Linear Regression and Weiner filter, Grammar based/
10
Inductive learning - Decision Trees – CART, ID-3, Pruning metrics for tree; D-
tree examples, Linear SVM (basics and V-C bound), k-NN rule and examples,
Learning as Factorization, Ensemble learning: Bagging, Boosting. Case studies:
covered for mentioned Supervised learning techniques.
Unit 4:
Reinforcement & Interaction Learning
4 Basic model of Reinforcement Learning as game (Agent, Critic, Environment),
8
Optimal policy & Q – values, Bellman equation, Case studies on R Learning
Active learning, Deep Reinforcement, Transfer learning with examples,
Federated Machine Learning with examples.
Unit 5:
Special topics in Machine Learning
Sentiment Mining: NLP pipeline process, Data Analytics – Big data and Hadoop
5 8
model, Business Analytics – Competitive Machine Learning, ANN building
blocks (problem solving), Deep learning, Feed forward, Backpropagation, C-
NN, Recurrent-NN.
Total 48

No. Publication /
Reprint
Textbooks
1. Pattern classification – R, Duda, P. Hart and D. Stork, 2nd. 2007
Wiley Publisher
2. The Elements of Statistical Learning – J. Friedman, R. 3rd. 2017
Tibshirani and T. Hastie, Springer Publisher
3. Pattern Recognition and Machine Learning – C. Bishop, 2nd. 2016
Springer Publisher
4. Deep Learning – A. Courville, I. Goodfellow, Y. Bengio, 2nd. 2016

MIT Press
Reference Textbooks
1. Machine Learning – Tom M. Mitchell, Mc Graw Hill 1st 2017
Publisher
2. Introduction to Machine Learning – E. Alpaydin, PHI 3rd. 2015
Publisher
3. Elements of Information Theory – T M. Cover, J A. Thomas, 2nd. 2006

Wiley Publisher
12. Mode of Internal Seminar – presentation on topic in ML & internal viva

OR
Evaluation
Simulation of ML method with real dataset & internal viva
SEMESTER V
Name of Department: - Computer Science and Engineering Introduction to

Artificial Intelligence
1. Subject Code: TCS 562 Course Title:
and Data Science
2. Contact Hours: L: 3 T: 0 P: 0 ProfessionaCommunic
ation
3. Examination Duration (Hrs.): Theory 3 Practical 0
5. Credits: 3
6. Semester: 5
Outcome**: CO1: Understand the concepts of Artificial Intelligence and Data Science
with their related terminologies.
CO2: Analyze and Apply various programming skills for understanding
Data nature and its requirements.
CO3: Analyze and apply various modelling techniques for basic data
Analytics.
CO4: Demonstrate Problem Solving using AI algorithms.
CO5: Understand, Apply and Demonstrate different techniques and tools
for Data Analysis.
CO6: Analyze Real World Case Studies on Applications of Data Science.
demonstrate.

Sl.
Contents Contact Hours
No.
Unit 01:
Data Science History, Data Science and Related Terminologies,
Types of Analytics, Applications of Data Science, Data Science
Process Models.
1 Introduction to AI, History and Foundation of AI, Intelligence, and 10
it’s type,
Categorization of Artificial Intelligent based System, Agents &
Environments, Applications, and Current trends in AI
Unit 02:
2 Introduction to Data, Types, Data Preprocessing, Understanding 10
Data Requirements, Dealing with Erroneous/Missing Values,
Standardizing Data, Steps involved in EDA using Python
Programming/R.
Knowledge and Reasoning in AI: Knowledge based Agents, Syntax
and Semantics, Forward Chaining, Backward Chaining, Knowledge
Engineering, Belief Network
Unit 3:
Introduction to Modelling Techniques, Supervised Learning
Algorithms- Regression, Classification, and Unsupervised Learning
3 Algorithms- Clustering, Association Rule Mining 10
Feature Selection, Dimensionality Reduction, Independent and
Dependent Variables, Relationship between Variables: Correlation,
Multicollinearity, Factor Analysis, Treatment of Outliers
Unit 4:
4 Problem Solving Agent, Formulating Problems, Example Problems, 10
Uninformed Search Methods, Informed Search Method, Local
Search Methods, Genetic algorithms, Adversarial Search
Unit 5:
Applications of Analytics in Healthcare, Applications of Analytics in
5 Agriculture, Applications of Analytics in Business, Applications of 8
Analytics in Sports, Forms of Learning, Introduction to Expert
Systems, Expert System Architecture, Capstone Project
Total 48
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
SEMESTER V

Multi-Modal Data Processing
1. Subject Code: TCS-563 Course Title: and Learning

4. Relative Weight: CIE 25 PRS 0 MSE 25 SEE 50 PRE 0
5. Credits: 3
6. Semester: 5
8. Pre-requisite:
Outcome**: CO1: To discuss multimodal data and its applications
CO2: To apply text processing techniques in the relevant applications
CO3: To analyze various speech processing approaches
CO4: To create a model based on digital image and video processing
CO5: To analysis data of imbalance for multimodal design
CO6: To compare various types of processing such as Text process,
Speech processing, Image and Video processing
demonstrate.

Sl. Contact
Contents
No. Hours
Unit 1:
1 Introduction: Introduction to Multimodal data and applications, 8
Challenges of multimodal data, Data collection & cleaning.
Unit 2:
Text Processing: Text normalization, Lemmatization, Morphology,
2 Subword tokenization; Text processing and statistics: TFIDF, BM-25, 9
Zipf’s law, Hipf’s law; Language models and smoothing techniques; Vector
space models.
Unit 3:
Speech Processing: Speech production and perception, Acoustic and
3 articulatory phonetics; Short-term analysis: Need and windowing, Energy, 9
Zero-crossing rate, Autocorrelation function, Fourier transform,
Spectrogram; Short-term synthesis: Overlap-add method; Cepstrum
analysis: Basis and development, mel-cepstrum.
Unit 4:
Digital Image and Video Processing: Point processing, Neighborhood
4 processing, Enhancement, Edge detection, Segmentation, Feature 9
descriptors, Restoration, Morphological operations, Image transforms,
Spatial and temporal data handling.
Unit 5:
Multi-modal data synchronization and fusion: Data understanding and
5 quality estimation, meta data filtering, amount of data estimation for 8
multimodal design, data synchronization and fusion, imbalance data
analysis for multimodal design.
Total 43

No. / Reprint
Textbooks
1. R. C. Gonzalez, R. E. Woods, Digital Image 1st 2008
Processing, Pearson, Prentice-Hall
2. R. Klette, Concise Computer Vision: An Introduction 1st 2014
Into Theory And Algorithms, Springer
3. L. R. Rabiner, R. W. Schafer, Introduction To Digital 1st 2007
Speech Processing, Now Publishers Inc
4. A But, A Miasnikov, G Ortolani, Multimodal Deep 1st 2019
Learning With Tensorflow: Translate Mathematics Into
Robust Tensorflow Applications With Python, Packt
Publishing Limited
5. M Yang, B Rosenhahn, V Murino, Multimodal Scene 1st 2019
Understanding: Algorithms, Applications And Deep
Learning, Academic Press Inc
Reference Books
1. D. Jurafsky, J.H. Martin, Speech And Language 3rd 2022
Processing, (Online Available
At Https://Web.Stanford.Edu/~Jurafsky/Slp3/)
2. J-P Thiran, F Marqués And H Bourlard, Multimodal 1st 2009
Signal Processing: Theory And Applications For
Human-Computer Interaction, Academic Press
SEMESTER V

Data Science: Visualization with
TCS-549 Tableau Specialization

5. Credits: 3
6. Semester: 5
8. Pre-requisite:
Outcome**: CO1: Clean up, format and analyze data to prepare for interactives
CO2: Design visualizations that represent the relationships contained
in complex data sets and adapt them to highlight the ideas we want to
communicate
CO3: Use principles of human perception and cognition in
visualization design.
CO4: Identify the statistical analysis needed to validate the trends
present in data visualizations.
CO5: Critically evaluate visualizations and suggest improvements and
refinements.
CO6: Use leading open source and commercial software packages
(Tableau) to create and publish visualizations that enable clear
interpretations of big, complex and real world data
demonstrate.

Sl. Contact
Contents
No. Hours
UNIT 01:
Context of Data Visualization: Visualization as a discovery tool, Bedrock
of visualization as a discovery tool, Visualizing the past, Different Data
Visuals for Different Needs, The classic case of London 1855 cholera
1 10
epidemic and how it changed the face of visualization, The 20th Century
advancements, Computer-based Visualization, The Power of Human
Perception, Different Data Calls for Different Views, Leveraging
Composition and Interactivity, Using Data to Tell Stories
Visualization design objectives: Methodology, Establishing intent, The
visualization's function-explain, explore, exhibit; Tone-analytical and
abstract, key factors in a visualization project, The eight hats of data
visualization design
UNIT 02:
Demonstrating Editorial Focus: Importance of editorial focus, Preparing

and familiarizing of data, Refining the editorial focus, Using visual analysis
to find stories
Conceiving and Reasoning: Preparing data, Refining, The Visualization

2 10
anatomy - Data Representation: choosing correct visualization method,
physical properties of data, degree of accuracy in interpretation, creating
an appropriate design metaphor, choosing the final solution; The
Visualization anatomy- Data presentation: Interactivity, Annotation and
Arrangement;
Unit 03:
Taxonomy of Data Visualization: Choosing appropriate chart type: Dot
plot, Column chart, Floating bar(Gantt chart), pixelated bar chart,
Histogram, Slopegraph, Radial chart, Glyph chart, Sankey diagram, Area
size chart; Assessing hierarchies and part-to-whole relationships: Pie
chart, Stacked bar chart, Square pie, Tree map, Circle packing diagram,
3 Bubble hierarchy, Tree Hierarchy; Showing changes over time: Line chart, 9
Sparklines, Area chart, Horizon chart, Stacked area chart, Candlestick
chart (or box and whiskers plot, OHLC chart), Barcode chart, Flow map;
Plotting connections and relationships: Scatter plot, Bubble plot, Scatter
plot matrix, Heatmap, Parallel sets, Radial network, Network Diagram;
Mapping geo-spatial data: Choropleth map, dot plot map, Bubble plot map
, Isarithmic map
Unit 04:
Collaborative Visual Analysis: Supporting Asynchronous Collaborative

Information Visualization, Designing for social data analysis, Design
considerations for collaborative visual analytics
Constructing and Evaluating the Design Solution: Nested model for

4 9
visualization design and validation, Challenge of information visualization
evaluation, Visualization software, applications and programs; Charting
and statistical analysis tools, programming environments, tools for
mapping, The construction process, Approaching the finishing line, Post-
launch evaluation, Developing the capabilities
Unit 05:
Data Visualization through Tableau: Tableau basics, connecting tableau

to various datasets, creating bar charts, area charts, maps, scatterplots,
pie charts, tree maps; Create Interactive Dashboards, storylines, Joins,
5 8
Data Blending, Table calculations, parameters, Dual axis charts, Export
results from Tableau to other software, Work with timeseries data,
Creating data extracts, Aggregation, Granularity and Level of detail,
Adding filters, create data hierarchies, Adding actions to dashboards
Total 46

No. / Reprint
Textbooks
1. Andy Kirk, “Data Visualization: a successful design 1st 2012
process”, Packt Publishing, 2012
Reference Books
1. Tamara Munzer, “Visualization Analysis and Design”, 1st 2014
CRC Press
SEMESTER V
1. Subject Code: TCS-582 Course Title: Introduction to AI & ML
3. Examination Duration (Hrs): Theory 3 Practical

0
5. Credits: 3
6. Semester: 5
8. Pre-requisite:
Outcome**: CO1: Ability to compare different AI algorithms in terms of design issues,
computational complexity, and
assumptions
CO2: Apply basic search techniques and AI algorithms for problem solving
CO3: Identify the machine learning algorithms which are more appropriate for
various types of learning tasks in
various domains
CO4: Analyse and Differentiate various classification approaches
CO5: Implement machine learning algorithms on real datasets
CO6: The student will learn about the basic concepts of ANN and CNN
demonstrate.

Sl. Contact
Contents
No. Hours
Unit 1: Introduction to AI: Definitions, Foundations AI, History of AI,
Intelligent Agents, Structure of Intelligent Agents, Environments; Problem
1 8
solving Agents, Problem Formulation, Search Strategies, Constraint
Satisfaction Search, Informed search Methods
Unit 2: Knowledge representation and reasoning: Agents that Reason
Logically, Propositional Logic and Inference,
First-Order Logic, Inference in First-Order Logic
2 Planning and Learning: Introduction to Planning, Types, Learning from 8
observations, Forms of Learning,
Inductive Learning, Learning decision trees, Reinforcement Learning
Unit 3: Data Preprocessing, Machine Learning process, Feature scaling,

3 8
Simple Linear Regression, Multiple Linear Regression, Polynomial
Regression, Support Vector Regression, Decision Tree Regression,
Evaluating the Regression Models Performance
Unit 4: Logistic Regression, K-Nearest Neighbors, Support Vector

4 8
Machine, Decision Tree Classification, Random Forest Classification
Unit 5: K-Means clustering, Hierarchical Clustering, Apriori, Eclat, Artificial

5 Neural Networks, Activation Function, Gradient Descent, Stochastic 8
Gradient Descent, Backpropagation, Convolutional Neural Networks
Total 40

No. / Reprint
Textbooks
1. Laurence Moroney, AI and Machine Learning for 1st 2020
Coders, O’REILLY Media
2. Stuart Russell and Peter Norvig, Artificial Intelligence: 3rd 2015
A Modern Approach, Pearson Education India
3. Elaine Rich, Kevin Knight and Shivashankar B. Nair, 3rd 2017
Artificial Intelligence, McGraw-Hill
Education
Reference Books
1. Dan W. Patterson, Introduction to Artificial Intelligence 1st 2015
and Expert Systems, Pearson
Education India
2. Devroye L., Gyorfi L., Lugosi G., A Probabilistic 1st 1996
Theory of Pattern Recognition, Springer
SEMESTER V
1. Subject Code: TCS 543 Course Title: Knowledge

Representation

5. Credits: 3
6. Semester: 5
8. Pre-requisite: TCS 409, Design Analysis and Algorithm, TCS 343

Mathematical Foundations for Artificial Intelligence
Outcome**: CO1: Use logic programming and knowledge representation languages for
modelling simple application domains in Artificial Intelligence
CO2: Apply reasoning mechanisms in knowledge representation languages to test
the correctness of models and to formulate more expressive queries.
CO3: Design ontology-based knowledge systems with reasoning mechanism;
integrate with other systems for building applications.
CO4: Understand the entire process of how to design, construct, and query a
knowledge graph to solve real-world problems.
** Describe the specific knowledge, skills or competencies the students are expected
to acquire or demonstrate.
Contact
Sl. No. Contents
Hours
Principles of knowledge representation, Propositional Logic- Proof
Systems, Natural Deduction, Tableau Method, Resolution Method. First
1 Order Logic Syntax and Semantics, Unification, Forward Chaining, Horn 10
Fragments of First Order Logic.
Rule based systems, The Rete Algorithm, Rete example, Programming

2 rule Based Systems, Description Logics, Reasoning in Description 9
Logics, Structure Matching, Classification, Extensions of DL
The ALC Language, Ontology Representation languages, Ontology

3 9
Languages- RDF, RDFS-Rule Interchange Format, Logic programming
with OWL: OWL-Building OWL ontology- SPARQL- RDF/OWL
ontology processing using Graph databases
Non monotonic logics 4 hours Classical vs non-monotonic logic. Ways to

4 achieve non-monotonicity-Stable Model Semantics querying Semantic 8
Nets and Frames.
5 Discussions on Contemporary Issues in knowledge representation 6

Total 42
No. Publication /
Reprint
Textbooks
1. Franz Baader, Ian Horrocks, Carsten Lutz, Uli Sattler, An 1st 2017
Introduction to Description Logic, Cambridge University
Press
2. Ronald Brachman & Hector Levesque, Knowledge 1st 2004
Representation and Reasoning, Morgan Kaufmann
3. Frank van Harmelen, Vladimir Lifschitz and Bruce Porter 1st 2008
(Eds), Handbook of Knowledge Representation
Foundations of Artificial Intelligence
4. Ian Robinson, Jim Webber, Emil Eifrem, Graph Databases, 2nd 2015
O'Reilly Media
Reference Books
1. Pascal Hitzler, Markus Kroetsch, and Sebastian Rudolph, 1st 2009
Foundations of Semantic Web Technologies, Chapman &
Hall/ CRC Textbooks in Computing
SEMESTER V
Name of Department: - Computer Science and Engineering Introduction to Artificial

Intelligence
1. Subject Code: TCS 542 Course Title:
3. Examination Duration (Hrs.): Theory 3 Practical 0

4. Relative Weight: CIE 25 PRS 0 SEE 50
5. Credits: 3
6. Semester: V
8. Pre-requisite: TCS 343 Mathematical Foundations for Artificial Intelligence
Outcome**: CO 1: Understand the basics of the theory and practice of Artificial Intelligence.
CO 2: Learn the basics of Artificial Intelligence programming.
CO 3: Understand various searching techniques use to solve the AI problems.
CO 4: Apply knowledge representation techniques and problem solving strategies to
common AI applications.
CO 5: Build self-learning and research skills to tackle a topic of interest on his/her
own or as part of a team.
CO 6: Apply the knowledge of AI and agents in developing multidisciplinary real
world projects

Sl. Contact
Contents
No. Hours
Unit 1: Introduction
What is AI? , Foundation of AI, State space representation. Intelligent Systems:
1 Categorization of Intelligent System, Components of AI Program, Types of AI, 8
Foundations of AI, Applications of AI, Current trends in AI, Intelligent Agents:
Anatomy, structure, Types.
Unit 2: Problem Solving
2 Solving problem by Searching: Problem Solving Agent, Formulating Problems. 10
Uninformed Search Methods: Breadth First Search (BFS), Depth First Search
(DFS), Depth Limited Search, Depth First Iterative Deepening (DFID), Informed
Search Methods: Greedy best first Search, A* Search, Memory bounded heuristic
Search. Local Search Algorithms and Optimization Problems: Hill climbing
search Simulated annealing, Local beam search
Unit 3: Uncertain Knowledge and Reasoning
Acting under uncertainty, Basic Probability Notation, Inference using full joint
3 8
distributions, Bayes Rule and its use.
Unit 4: Knowledge Representation

First order predicate calculus, Horn Clauses, Introduction to PROLOG, Semantic
4 10
NetsPartitioned Nets, Minskey frames, Case Grammar Theory, Production Rules
KnowledgeBase, The Inference System, Forward & Backward Deduction
Unit 5: Expert System and Programing Language
Expert System Existing Systems (DENDRAL, MYCIN), domain exploration,
5 Meta Knowledge, Expertise Transfer, Self Explaining System 12
Programming Language: Introduction to programming Language, LISP,
PROLOG
Total 48

No. Publication /
Reprint
Textbooks
1. G F. Luger, Artificial Intelligence: Structures and Strategies 6th 2021
for Complex Problem Solving,
2. Dan W. Patterson, Introduction to Artificial Intelligence and 1st 1990
Expert Systems, PHI
3 1st 2012
Eileen Mc Daniel, Stephen McDaniel, The
Accidental Analyst: Show Your Data Who’s Boss
Freak Analytics
Reference Books
1. Stuart J. Russell and Peter Norvig, Artificial Intelligence a 3rd 2009
Modern Approach, McGraw Hill
SEMESTER V
1. Subject Code: Course Title: Artificial Intelligence Lab

PCS 542
3. Examination Duration (Hrs): Theory 0 Practical 3 hr
5. Credits: 2
6. Semester: V
8. Pre-requisite: TCS 409 Design and Analysis of Algorithm, TCS 341Python

programming for computing
9. Course After completion of laboratory the students will be able to:

Outcome**:
CO1: Implement methods in AI
CO2: Analyze AI algorithms and applications

Contact
S. N. Contents
Hours
To program problem-solving by path traversal search over graph
1 2
using BFS, DFS, UFS
To program problem-solving by path traversal using A*
2 2
algorithm (Informed Search)
To use lobe.ai user interface and perform manual labeling,
2 2
training and testing for supervised object recognition in Image
To understand and develop basic KR (Knowledge Representation) tools

3 from practical AI problem definitions: KR methods 2
To take two - category input data file and use thresholding to
4 design binary classifier for dataset 1 dimensional, 2 dimensional 2
dataset
To register and use monkeylearn.com and create model, train
and classify sentiments that lead to sentiment prediction using
5 2
corpus of hotel reviews as part of NLU
To register and use Teachable machine (Google API) and perform multiple
6 2
class / pose analysis and classification.
To use quillbot.com and study basic machine transcription roles in
7 summarization: as NLP application 2
To use quillbot.com and study basic machine transcription roles

8 2
in grammar checker (syntax): as NLP application
To use quillbot.com and study basic machine transcription roles
9 2
in paraphrasing: as NLP application
Program probabilistic model given: it is Friday and that a
student is absent is 3 %. Since there are 5 school days in a
10 week, the probability that it is friday is 20 %. What is the 2
probability that a student is absent given that today is friday.
Program Bayesian rule in python to get the result.
To extract intra-day stock market data for 4 stocks and write
11 program that: plots the values, develops linear regression, 2
derive mean and correlation.
To program best fit distributions for at least 2 discrete
12 2
distributions and estimate mean and variance for the dataset.
To program best fit distributions for at least 2 continuous
13 2
distributions and estimate mean and variance for the dataset.
To program method using Z score, DB for detection of
14 2
Outliers in dataset
To study role of correlation as strong, weak and moderate
15 2
between underlying features as function of sample size
To develop knowledge discovery and association rule map for
16 2
healthcare dataset

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

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

5. Credits: 3
6. Semester: V
8. Pre-requisite: TCS 101, Fundamental of Computer & Introduction to Programming

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.

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;
Introduction to Broadcast and Multicast Routing.
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, VLANS
Total 45
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

SEMESTER Vth

Computer Networks Lab
1. Subject Code: PCS 511 Course Title:

4. Relative Weight: PRS 25 MSE 25 PRE 50
5. Credits: 2
6. Semester: 5th
8. Pre-requisite: Computer networks

Outcome**: CO1: Understand various components that make up a computer network,
including routers, switches, hubs, servers, and clients and learn about the basic
commands used troubleshooting.
CO2: Design UTP cable for cross and direct connection using crimping tool.
CO3: Implement the common network protocols such as TCP/IP, UDP, HTTP,
DNS, DHC and FTP Understand how these protocols function and their role in
facilitating communication between devices using network simulation tool like
Packet tracer.
CO4: Apply the static and dynamic routing concepts in the network core and
monitoring network traffic using Wireshark and develop skills in
troubleshooting network connectivity issues.
CO5: Design network applications using UDP and TCP socket programing
concepts and network design principles and test these applications using real
or virtual network devices.

Sl. List of problems for which student should develop program and execute Contact
No. in the Laboratory Hours
2
1. Familiarization of Network Environment, Understanding and using network
utilities: ipconfig, netstat, ping, telnet, ftp, traceroute etc.
2. Familiarization with Transmission media and tools: Co-axial cable, UTP 2

cable, Crimping tool, Connectors etc.
Preparing the UTP cable for cross and direct connection using crimping tool.
3. Installation and introduction of simulation tool. (Packet Tracer) 2
4. To configure a basic network topology consisting of routers, switches, and 2

end devices such as PCs or laptops. Configure IP addresses and establish
connectivity between devices. (Using packet Tracer)
To configure a DHCP server on a router or a dedicated DHCP server device.
5. Assign IP addresses dynamically to devices on the network and verify 2
successful address assignment. (Using packet Tracer)
6. To configure a local DNS server to resolve domain names within a network. 2
(Using packet Tracer)
7. To analyze complete TCP/IP protocol suite layer’s headers using Wire 2
Shark
Static Routing: Configure static routes on multiple routers to enable
8. 2
communication between different networks. Test the connectivity by pinging
between hosts in different networks. (Using packet Tracer)
Dynamic Routing (RIP): Configure routers to use the Routing Information
Protocol (RIP) for dynamic routing. Enable RIP on the interfaces connected
9. 2
to different networks and verify that routes are being learned and propagated.
Test the connectivity between hosts in different networks. (Using packet
Tracer)
Dynamic Routing (OSPF): Configure routers to use the Open Shortest Path
First (OSPF) routing protocol. Set up OSPF on the routers and advertise
10. 2
network information. Verify that OSPF is establishing neighbor relationships
and propagating routes. Test connectivity between hosts in different
networks. (Using packet Tracer)
TCP Client-Server Communication:
Implement a TCP client program that sends a message to a TCP server
program.
11. Implement the corresponding TCP server program that receives the message 2
and displays it.
Test the communication between the client and server by exchanging
messages
(Using ‘C’ Language)
UDP Client-Server Communication:
Implement a UDP client program that sends a message to a UDP server
12. program. 2
Implement the corresponding UDP server program that receives the message
and displays it
(Using ‘C’ Language)
Optional programs for advanced learner
1. 2
File Transfer using TCP:
Implement a TCP server program that listens for incoming connections.

Implement a TCP client program that sends a file to the server.
The server should receive the file and save it on the local machine.
Verify the successful transfer by comparing the original file with the received
file
Chat Application using TCP:
Implement a TCP client program for a chat application.
2. Implement the corresponding TCP server program. 2

Multiple clients should be able to connect to the server and exchange
messages.
Test the chat application by simulating multiple clients communicating with
each other.
DNS Lookup using UDP:
Implement a UDP client program that sends a domain name to a DNS server.
3. 2
Implement the corresponding DNS server program that resolves the domain
name to an IP address.
The server should send the resolved IP address back to the client.
Test the program by performing DNS lookups for different domain names
HTTP Server using TCP:
Implement a TCP server program that acts as an HTTP server.
4. 2
The server should be able to handle HTTP requests and send back appropriate
HTTP responses.
Test the server by accessing it through a web browser and requesting different
resources.
5. Virtual LANs (VLANs): Create multiple VLANs and configure inter-VLAN 2

routing using a router or Layer 3 switch. Assign hosts to different VLANs and
test communication between hosts in different VLANs.
6. Problem Statement 6: 2
Access Control Lists (ACLs): Implement access control lists on routers to
control traffic flow based on source/destination IP addresses, port numbers,
or protocols. Test the ACLs by allowing or denying specific types of traffic
between hosts.
Network Address Translation (NAT): Configure Network Address
7. Translation on a router to translate private IP addresses to public IP addresses 2
and vice versa. Test connectivity between hosts with private IP addresses and
hosts on the public internet.
Total 38

S. No. Name of Authors/Books/Publishers Edition Year of
Publicati
on /
Reprint
Text Books
1. Behrouz A. Forouzan, “Data Communications and Networking 6th 2022

with TCPIP Protocol Suite, 6/e”, McGraw Hill
Reference Books
1. Ross and Kurose, Computer Networking: “A Top-Down 5th 2017

Approach (5th edition)”, Pearson/Addison-Wesley
SEMESTER V

Computer System
TCS 597
Security
3 0 0 ProfessionaCommuni
2. Contact Hours: L: T: P:
cation
4. Relative Weight: CIE 25 MSE 25 SEE

50
5. Credits: 3
6. Semester: 5th
8. Pre-requisite: TCS-492 Fundamental of Cyber Security

Outcome**: CO1: Explain different security threats and attacks.
CO2: Know the working of different attacks and security protocols.
CO3: Analyze the different security protocols.
CO6: Develop system security protocols

Sl. Contact
Contents
No. Hours
Introduction to System security:
Control hijacking attacks buffer overflow, integer overflow, bypassing
browser memory protection, Sandboxing and Isolation, Tools and techniques
1 for writing robust application software, Security vulnerability detection tools, 10
and techniques program analysis (static, concolic and dynamic analysis),
Privileges, access control, and Operating System Security, Exploitation
techniques, and Fuzzing
Software security:
Vulnerabilities, Attacks, and Countermeasures: Privileged programs (Set-
UID programs) and vulnerabilities & Privilege Separation, Buffer Overflow
vulnerability and defences, Return-to-libc attack, Race, Condition
2 vulnerability and attack, Dirty COW attack, Format String vulnerability and 10
attack, Shellshock attack, Heartbleed attack Interactivity, Annotation, and
Arrangement;
Web Security:
Same origin Policy, Cross site scripting attack, Cross site request forgery
3 attack, Sql Injection attack, Clickjacking attack, Content Security Policies 10
(CSP) in web, Web Tracking, Session Management and User Authentication,
Session Integrity, Https, SSL/TLS, Threat Modelling
Smartphone Security:
Android vs. ioS security model, threat models, information tracking, rootkits,
4 Access control in Android operating system, Rooting android devices, 9
Repackaging attacks, Attacks on apps, Whole- disk encryption, hardware
protection, Viruses, spywares, and keyloggers and malware detection
Hardware and system security:
Meltdown Attack, spectre attack, Authentication and password, Access
5 control concept, Access control list, Capability, Sandboxing, Threats of 6
Hardware Trojans and Supply Chain Security, Side Channel Analysis based
Threats, and attacks. Issues in Critical Infrastructure and SCADA Security.
Total 45
No. Publication /
Reprint
Textbooks
Reference Books
12. Mode of Evaluation Test / Quiz / Assignment / Mid Term Exam / End Term
Exam

SEMESTER V
Name of Department: - Computer Science and Engineering Computer System

1. Subject Code: PCS-597 Course Title: Security Lab
4. Relative Weight: PRS 25 MSE 25 SEE 50
5. Credits: 2
6. Semester: 5th
8. Pre-requisite:
Outcome**: 1. Explain different security threats and attacks
2. Know the working of different attacks and security protocols

3. Analyse the different security protocols
4. Use programming to implement security protocols
5. Apply security mechanisms to secure various applications
6. Develop system security protocols
Ex. NAME OF THE PROGRAM Hours

No.
1. Practical demonstration of buffer overflow vulnerability and attack. Also 2
write down the solutions available to mitigate the buffer overflow attack.
2. Practical demonstration of race condition and vulnerability and attack. What 2

are possible solutions for race condition vulnerability.
3. Practical demonstration of dirty cow vulnerability and attack. 2

4. Installation and demonstration of burp suite tool. 2
5. 2
Installation and demonstration of metasploit tool.
6. Practical demonstration of XSS using burp suite tool. 2
7. Practical demonstration of CSRF vulnerability and attack. What are the 2

possible solutions for CSRF?
8. Practical demonstration of SQL injection vulnerability and attack. What are 2

the possible solutions for SQLi?
9. Installation and demonstration of wireshark tool. 2
10. Practical demonstration of HTTPs using the wireshark tool. 2

11. Practical demonstration of ICMP using the wireshark tool. 2
12. Case study of hardware security and attacks like Stuxnet and hardware 2
trojan.
13. Case study of side channel attack. 2

Total 26
11.Suggested Books:
No. Publication
/ Reprint
Textbooks
Reference Books

SEMESTER V

Blockchain for
1. Subject Code: TCS 556 Course Title: IoT systems

5. Credits: 3
6. Semester: 5
8. Pre-requisite: Fundamental of IoT (TCS 331), Fundamental of Cyber

Security (TCS 391)
Outcome**:
CO1: Explain blockchain and its uses.
CO2: Know the mechanisms of IoT-based systems CO3: Identify the

needs of data preprocessing.
CO3: Know the mechanisms of IoT-based systems.
CO4. Use blockchain in the designing of IoT-based systems.
CO5: Apply blockchain to different IoT-based application frameworks.
CO6: Implement IoT-based secure application frameworks.

Sl. Contact
Contents
No. Hours
UNIT-1
Introduction of IoT
1 Overview of IoT, Motivations, Applications of IoT, Internet of Things IoT 8
Architecture, IoT Frameworks, Vulnerabilities of IoT, Security
requirements, Threat analysis, IoT security tomography and layered
attacker model, Security model for IoT.
UNIT-2
Security and blockchain
Threats and threat models, data confidentiality, data integrity,

2 8
authentication and access control, non-repudiation and availability,
overview of blockchain, what is block, data structure of the blockchain,
structure of a block, block header, block identifiers: block header hash,
genesis block, linking of blocks, merkle trees, and use of merkle root.
UNIT-3
Cryptography in blockchain
Concept of divisibility, prime numbers, importance of prime numbers in
cryptography, euclid theorem for GCD, extended euclidean algorithm,
modular arithmetic, random number generators, deterministic and
3 12
nondeterministic random number generators, XOR, bit shifts, euler's
totient theorem, chinese remainder theorem, RSA, Diffie Hellman key
exchange protocol, Elliptic curve cryptography (ECC), ElGamal
encryption system. DSS algorithm, RSADS algorithm, ECDSA
algorithm, Message integrity, hash functions, MAC functions, HMAC
UNIT-4
Blockchain technology
Use of ECDSA in blockchain implementation, use of merkle root in

payment verification, use of hash functions to chain blocks, use of
digital signatures to sign transactions, differences between ethereum
4 and bitcoin, block format, mining algorithm, Proof of Work (PoW), Proof 10
of Stake (PoS), Delegated Proof of Stake (DPoS), Proof of Burn (PoB),
Byzantine Fault Tolerance (BFT), account management, contracts and
transactions, decentralized applications using ethereum proof-of-stake
(PoS) algorithm, smart construct, structure of a smart contact, use of a
smart contract, remix platform, blockchain implementation through
smart contact.
UNIT-5
Blockchain enabled IoT security.
Applications and uses of blockchain enabled IoT security, Challenges,

5 and issues of blockchain enabled IoT security, blockchain in banking, 10
use of blockchain in e-commerce, marketing, and logistic operations,
blockchain in IoT ecosystem, blockchain in IoT-based smart healthcare
applications, use of blockchain in IoT-enabled smart farming,
blockchain in transportation system and future research aspects.
Total 48

No. Publication /
Reprint
Textbooks
1. William Stallings, “Cryptography and Network Security: 1st 2020
Principles and Practice”, Pearson publication, 2020.
2. William Stallings, “Cryptography and Network 2nd 2020

Security: Principles and Practice”, Pearson
publication, 2020.
3. Harshita Patel, Ghanshyam Singh Thakur, 1st 2020
“Blockchain Applications in IoT Security”, 1st Edition,
IGI Global, 2020.
Reference Books
1. Sudhir K. Sharma, Bharat Bhushan, Parma N. Astya, 1st 2021
Narayan C. Debnath, "Blockchain Applications for
Secure IoT Frameworks: Technologies Shaping the
Future," Bentham books, 2021.
2. William Stallings, “Network Security Essentials: 6th 2016
Applications and Standards”, 6th Edition, Prentice Hall,
2016

SEMESTER V

Block chain Technology
1. Subject Code: TCS-592 Course Title: and its application

5. Credits: 3
6. Semester: 5th
8. Pre-requisite: TCS 302 Data Structure with C, TCS 332 Fundamental of
Information security and Block Chain
Outcome**: CO1: Explain blockchain technology and its immutable property.
CO2: Know the working of distributed ledger.
CO3: Analyze the different consensus protocols.
CO4: Use Ethereum to implement Blockchain.
CO5: Apply blockchain techniques in different applications.
CO6: Develop blockchain based frameworks to secure a
communication environment

Sl. Contact
Contents
No. Hours
Introduction to blockchain- Overview of blockchain, structure of a block, block header,
1 block identifiers: block header hash and block height, genesis block, linking of blocks, 10
merkle trees, and use of merkle root in payment verification
Application of cryptography to blockchain- Overview of ECDSA, DSA and RSADS, use
2 of hash functions to chain blocks, use of digital signatures to sign transactions 9
Distributed ledger- Introduction to distributed systems, fault tolerance and paxos,

byzantine agreement, authenticated agreement, eventual consistency & bitcoin
3 8
consistency- availability and partitions, bitcoin, smart contracts, weak consistency,
distributed storage, consistent hashing mechanism
Blockchain mining and consensus-Overview of various consensus algorithms,
decentralized consensus, independent verification of transactions, mining nodes,
aggregating transactions into blocks, constructing the block header, successfully
4 10
mining of block, validating a new block, assembling and selecting chains of blocks,
consensus attacks, DoS attack on blockchain, changing the consensus rules, soft fork
signaling with block version
Ethereum- Differences between ethereum and bitcoin, block format, mining algorithm,
proof-of-stake (PoS) algorithm, account management, contracts and transactions,
decentralized applications using ethereum proof-of-stake (PoS) algorithm, contracts,
5 and transactions. 8
Applications of blockchain technology- Blockchain in banking and marketing, smart
contracts, blockchain of Internet of Things, blockchain in healthcare, Future Research
directions of blockchain technology
Total 45
No. Publication /
Reprint
Textbooks
1. George Icahn, “Blockchain: the complete guide to understanding 4th 2020
blockchain technology”, 2020.
2. Antony lewis, “The basics of bitcoins and blockchains: an 5th 2018
introduction to cryptocurrencies and the technology that
powers them” 2020.
Reference Books
1. Andreas M. Antonopoulos, “Mastering Bitcoin: unlocking digital 2nd 2017
cryptocurrencies”, O'Reilly Media,(2e) 2017.
2. Roger Wattenhofer, “Distributed Ledger Technology, 2nd 2017
The science of the Blockchain”, Inverted Forest
Publishing, (2e), 2017

SEMESTER VI
1. Subject Code: TCS 601 Course Title: Compiler Design
5. Credits: 3
6. Semester: VI

Syllabus 2023 New - Compressed 119 170

Uploaded by

Copyright:

Available Formats

Syllabus 2023 New - Compressed 119 170

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus 2023 New - Compressed 119 170

Uploaded by

Copyright:

Available Formats

GRAPHIC ERA (DEEMED TO BE UNIVERSITY), DEHRADUN

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

4. Relative Weight: CIE 25 MSE 25 SEE 50

Relational Model and Relational Algebra: Relational Model Concepts;

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

Optimization of SQL Queries through Indexes, Concepts of NoSQL.

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

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

4. Relative Weight: CIE 25 MSE 25 SEE 50

8. Pre-requisite: TMA 101, TMA 201

10.Details of the Course:

Unit 2: Interpolation: Introduction to Finite Differences, Difference

Unit 3: Numerical Differentiation and Integration: Numerical Differentiation

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

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

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

Name of Department: - Computer Science and Engineering

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

8. Pre-requisite: TCS 302, TCS 404

10.Details of the Course:

Problem Statement 10:

Problem Statement 13:

Problem Statement 14:

Problem Statement 15:

16. optimization of queries with Indexes 2

Problem Statement 17:

17. Applying SYNONYMS on database objects. 2

Problem Statement 18:

Problem Statement 19:

Problem Statement 20:

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

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

1. Mary Beth Roeser: [1Oracle® Database] SQL 2nd 2017

Name of Department: - Computer Science and Engineering

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

CO3: Apply the advanced cloud computing application’s concepts.

10.Details of the Course:

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS 571 Course Title: Big Data Visualization

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

8. Pre-requisite: Fundamental of Cloud Computing and Bigdata TCS 351

10. Details of the Course:

2 Unit 2: Demonstrating Editorial Focus: Importance of editorial focus, 10

Unit 3: Taxonomy of Data Visualization: Choosing appropriate chart type:

Unit 4: Tools for data visualization: Tableau, Google Charts, Datawrapper,

Unit 5: Data Visualization through Tableau: Tableau basics, connecting

Name of Department: - Computer Science and Engineering

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

4. Relative Weight: CIE 25 MSE 25 ESE 50

CO2: Discuss the various Protocols used in Communication

CO4: Understand terminology, concepts, and technologies required for

CO6: Use of network management tools

10. Details of the Course:

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

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

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.