B.

Tech (Computer Science and Engineering-Core)

SEMESTER: IV
COURSE MODULE
COURSE
Cre
Compo
Code Title dits
nent
TCS-
Programming in Java DSC 3
408
TCS- Finite Automata and
DSC 3
402 Formal Languages
TCS-
Microprocessors DSC 3
403
TCS- Design and Analysis of
DSC 3
409 Algorithms
Discipline Specific
DSE 3
Elective
PCS-
Java Programming Lab DSC 1
408
PCS- 1
Microprocessors Lab DSC
403
PCS-
DAA Lab DSC 1
409
XCS-
Career Skills SEC 1
401
Practical for SEC 1
PESE
Employability Skill
400
Enhancement
SCS-
MOOCS Seminar VAC 1
401
GP-401 General Proficiency SEC 1

NQN-
Indian Constitution MNG 2
400

DISCIPLINE SPECIFIC ELECTIVE

COURSE CODE COURSE NAME

TCS-451 Virtualization and Cloud Computing
TCS-471 Statistical Data Analysis with R
TCS-495 Foundation of Cyber Security
TCS-421 Fundamentals of Statistics and AI
TCS-433 Blockchain and its Applications (Through
Swayam)
TCS-465 Linear Algebra (Through Swayam)
 B.Tech (Computer Science and Engineering-AI/ML Specialization)
SEMESTER: IV
COURSE MODULE
COURSE
Cre
Compo
Code Title dits
nent
TCS-
Deep Learning DSC 3
464
TCS- Finite Automata and
DSC 3
402 Formal Languages
TCS-
Microprocessors DSC 3
403
TCS- Design and Analysis of
DSC 3
409 Algorithms
TCS-
Programming in Java DSE 3
408
PCS-
Deep Learning Lab DSC 1
464
PCS- 1
Microprocessors Lab DSC
403
PCS-
DAA Lab DSC 1
409
XCS-
Career Skills SEC 1
401
PESE Practical for SEC 1
400 Employability Skill
Enhancement
SCS-
MOOCS Seminar VAC 1
401
GP-401 General Proficiency SEC 1

NQN-
Indian Constitution MNG 2
400
 B.Tech (Computer Science and Engineering-AI/DS Specialization)
SEMESTER: IV
COURSE MODULE
COURSE
Cre
Compo
Code Title dits
nent
TCS-
Programming in Java DSC 3
408
TCS- Finite Automata and
DSC 3
402 Formal Languages
TCS-
Microprocessors DSC 3
403
TCS- Design and Analysis of
DSC 3
409 Algorithms
TCS-
Introduction to Bigdata DSC 3
462
PCS-
Java Programming Lab DSC 1
408
PCS- 1
Microprocessors Lab DSC
403
PCS-
DAA Lab DSC 1
409
XCS-
Career Skills SEC 1
401
PESE Practical for SEC 1
400 Employability Skill
Enhancement
SCS-
MOOCS Seminar VAC 1
401
GP-401 General Proficiency SEC 1

NQN-
Indian Constitution MNG 2
400
 B.Tech (Computer Science and Engineering-Cyber Security
Specialization)
SEMESTER: IV
COURSE MODULE
COURSE
Cre
Compo
Code Title dits
nent
TCS-
Programming in Java DSC 3
408
TCS- Finite Automata and
DSC 3
402 Formal Languages
TCS-
Microprocessors DSC 3
403
TCS- Design and Analysis of
DSC 3
409 Algorithms
TCS- Foundation of Cyber
DSE 3
495 Security
PCS-
Java Programming Lab DSC 1
408
PCS- 1
Microprocessors Lab DSC
403
PCS-
DAA Lab DSC 1
409
XCS-
Career Skills SEC 1
401
PESE Practical for SEC 1
400 Employability Skill
Enhancement
SCS-
MOOCS Seminar VAC 1
401
GP-401 General Proficiency SEC 1

NQN-
Indian Constitution MNG 2
400
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS408 Course Title: Programming in JAVA

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: IV
7. Category of Course: DSC
8. Pre-requisite: Fundamental of Computer & Introduction to Programming (TCS 101),
Programming for problem solving(TCS 201), Data Structures with C(TCS 302), Object
Oriented Programming with C++ (TCS 307)

9. Course Outcome:

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

CO1 Explain the Java programming features and develop

programs to demonstrate the same.
CO2 Make use of object oriented concepts to develop
applications
CO3 Classify exceptions and demonstrate applications for file
handling and multithreading.
CO4 Analyze collection framework and develop applications
using GUI
CO5 Compare and utilize collection framework for
programming application
CO6 Design applications for event handling and accessing
databases using Java features.

10. Details of the Course:

 Contact
UNIT CONTENTS
Hrs

Introduction to Java : Java version history, Importance

and features of Java, Concepts of Java Virtual machine
(JVM), Setting up a Java Development Environment.

Variables and Data Types: Keywords, Constants,

Unit - I 10
Variables and data types, operators and expressions,
Control statements, Conditional statements, loops and
iterations,

Introduction to Arrays: Declaring, Initializing, Accessing

and Modifying arrays
Methods and their uses: void method, void with
parameters, Pass by Value vs Pass by reference,
Recursive Methods, Understanding the Method Call stack
Object Oriented Programming in Java: Inheritance,
super classes, multilevel hierarchy, abstract and final
classes, overloading and overriding
Unit - II 10
Packages and interfaces: Packages, Defining Packages,
Using Packages, import and static import, Access
protection.
Interface: Defining Interfaces, abstract methods
declarations, implementing interfaces, extended
interfaces, interface references.

Exception handling: Exception Types, Exception class,

Runtime Exception Class, Error Class, Checked and
unchecked Exceptions, Defining new exceptions;
Handling: try, catch and finally; throw statement, throws
Unit – clause.
9
III Input/Output: Basics, Byte and Character Streams,
reading and writing from console and file.
Multithreaded programming: Java thread model,
synchronization, messaging, thread class, Runnable
interface, inter thread communication, Producer/ consumer
problems, Wait () and notify ().
Java Collection and Generic Framework: Introduction to
Collection and Generic Framework: Interfaces Iterator, List,
Unit – Set, Array List, Linked List Hash Set and Array Deque
9
IV classes
Java Swing: Introduction to Swings, Swing applications,
Swing Controls :
 Java FX: JavaFX basics, stage, scene, pane, JavaFX
Layouts and Scene builder, Animations in JavaFX
Event Handling: Event delegation model, classes, Event
Listener Interfaces,Adapter classes.
Java Database Connectivity (JDBC): The Concept of
Unit – V JDBC, JDBC drivers, Querying / Retrieving Data, Update, 8
Delete Statements, and Inserting related records (To be
used with MySQL or PostgreSQL)

Total 46

Text Books:

Authors Name Title Edition Publisher, Country Year

Herbert Schildt Java 2 The 9th Edition McGraw Hill 2017

Complete Education
Reference

E. Programming 6th Edition McGraw Hill 2019

Balaguruswamy with Java- a Education
Primer

Reference Books:

Authors Name Title Edition Publisher, Year

Country

Kathy Sierra, Bert Head First 3rd Edition O'Reilly Media, Inc. 2022
Bates, Trisha Gee Java: A Brain-
Friendly Guide

Cay S. Horstmann Core Java, 12th Edition Addison-Wesley 2021

Volume I Professional
(Fundamentals)
and Volume II

Cay S. Horstmann Core Java 12th Edition Oracle Press 2021

Volume II
(Advanced
Features)
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

Finite Automata and Formal
1. Subject Code: TCS 402 Course Title:
Languages
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: IV
7. Category of Course: DSC
8. Pre-requisite: Engineering Mathematics-I (TMA 101), Engineering Mathematics-II
(TMA 201)

9. Course After completion of the course the students will be able to:
Outcome: CO1: Demonstrate the conversion of NFA into DFA, ϵ-NFA into
DFA and Minimization of Finite Automata by using Myhill-
Nerode Theorem
CO2: Formulate DFA, RE and FA with output.
CO3: Design CFG and check the language is not CFL.
CO4: Design PDA and convert n-PDA into d-PDA.
CO5: Design Turing machines for addition, subtraction,
multiplication etc.
CO6:Formulate finite machines; push down automata and
Turing machines for automated functioning of devices.

10.Details of the Course:

Contact
UNIT CONTENTS
Hrs

Introduction; Alphabets, Strings and Languages; Automata

and Grammars, Deterministic finite Automata (DFA)-
Unit – I Formal Definition, Simplified notation: State transition 10
graph, Transition table, Language of DFA,
Nondeterministic finite Automata (NFA), NFA with epsilon
transition, Language of NFA, Equivalence of NFA and
 DFA, Minimization of Finite Automata, Distinguishing one
string from other, Myhill-Nerode Theorem

Regular expression (RE), Definition, Operators of regular

expression and their precedence, Algebraic laws for
Regular expressions, Kleen’s Theorem, Regular
expression to FA, DFA to Regular expression, Arden
Theorem, Non Regular Languages, Pumping Lemma for
Unit - II 10
regular Languages. Application of Pumping Lemma,
Closure properties of Regular Languages, Decision
properties of Regular Languages, FA with output: Moore
and Mealy machine, Equivalence of Moore and Mealy
Machine, Applications and Limitation of FA.

Context free grammar (CFG) and Context Free Languages

(CFL): Definition, Examples, Derivation, Derivation trees,
Ambiguity in Grammar, Inherent ambiguity, Ambiguous to
Unambiguous CFG, Useless symbols, Simplification of
Unit – III 9
CFGs, Normal forms for CFGs: CNF and GNF, Closure
proper ties of CFLs, Decision Properties of CFLs:
Emptiness, Finiteness and Membership, Pumping lemma
for CFLs.

Push Down Automata (PDA): Description and definition,

Instantaneous Description, Language of PDA, Acceptance
Unit – IV by Final state, Acceptance by empty stack, Deterministic 10
PDA, Equivalence of PDA and CFG, CFG to PDA and PDA
to CFG, Two stack PDA.

Turing machines (TM): Basic model, definition and

representation, Instantaneous Description, Language
acceptance by TM, Variants of Turing Machine, TM as
Computer of Integer functions, Universal TM, Church’s
Unit – V Thesis, Recursive and recursively enumerable languages, 8
Halting problem, Introduction to Undecidability,
Undecidable problems about TMs. Post correspondence
problem (PCP), Modified PCP, Introduction to recursive
function theory.

Total 47
Text Books:

Authors Name Title Edition Publisher, Year

Country

J. Hopcroft, R. Introduction to 3rd Pearson 2008

Motwani, and J. Automata Theory, Edition Education India
Ullman. Languages, and
Computation,

KLP Mishra and N. Theory of 3rd Prentice Hall Of 2007

Chandrasekaran, Computer Science: Edition India
Automata,
Languages and
Computation

Reference Books:

Authors Name Title Edition Publisher, Year

Country

Michael Sipser Introduction to the 3rd PWS Publishing 2012

Theory of Edition Company
Computation

Peter Linz Introduction to 6th Jones and Bartlett 2016

Formal Languages Edition Publishers, Inc.
and Automata
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS403 Course Title: Microprocessors

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: IV
7. Category of Course: DSC
8. Pre-requisite: Basic Electronics Engineering(TEC 101 / TEC201), Fundamental of Computer
& Introduction to Programming (TCS 101), TCS 301

9. Course After completion of the course the students will be able to:
Outcome:
CO1 Identify of 8085 and 8086 microprocessors and memory
segmentation
CO2 Analysis of Instruction set of 8085and 8086.
CO3 Implementation of different programs on 8085 and 8086
based microcomputer kit.
CO4 Design the Interfacing of 8255 and 8085/8086.
CO5 Design & develop Interfacing of microprocessor with
Timing Devices1
CO6 Evaluate & Develop projects on embedded system
using the foundation of microprocessor

10. Details of the Course:

Contact
UNIT CONTENTS
Hrs

Introduction to Microprocessors: Evolution of

Microprocessors, Microcomputer , different type of buses,
Unit – I Example of an 8085 based System, Microprocessor 9
Internal Architecture, Pin diagram and function of each pin,
memory interfacing.
 Programming with 8085: Instruction set, programming
model of 8085, addressing modes, assembly language
Unit - II programming, Timing and control, peripheral I/O, memory 10
mapped I/O, 8085 Interrupts, Stack and subroutines,
Machine & Instruction cycle of 8085.

16 Bit Processor: 16-bit Microprocessors (8086 ):

Architecture, pin diagram, Physical address, segmentation,
Unit – III memory organization, Bus cycle, Addressing modes, 8
Instruction set ,Assembly Language Programming of 8086,
comparison of 8086 & 8088

Interfacing (Data Transfer) with Microprocessor: Data

Transfer Schemes: Introduction, handshaking signals,
Unit – IV Types of transmission, 8255 (PPI), Serial Data transfer 9
(USART 8251), memory interfacing, 8257 (DMA),
programmable interrupt Controller (8259).

Interfacing of Microprocessor with Timing Devices:

Programmable Interval Timer/ Counter (8253/8254):
Unit – V Introduction, modes, Interfacing of 8253, applications, 9
Need of ADC & DAC, resolution, Introduction to DAC &
ADC, ADC & DAC Interfacing (0808, 0809).

Total 45

Text Books:

Authors Name Title Edition Publisher, Year

Country

Ramesh Microprocessor 6th Penram 2013

Gaonkar Architecture, International
Programming, and Publication (India)
Applications with the Pvt. Ltd
8085

A. K. Ray & K. Advanced 3rd Tata McGraw Hill 2012

M. Bhurchandi Microprocessors and
peripherals
 Muhammad Ali 8051 Microcontroller 2nd Pearson / PHI 2007
Mazidi, Janice & Embedded System, publication
Gillispie Mazidi,

Reference Books:

Authors Name Title Edition Publisher, Year

Country

Douglas V. Hall, Microprocessors 3rd Tata McGraw Hill 2012

and Interfacing,

Barry B. Brey, The Intel 8th Pearson 2012

Microprocessors
Architecture
Programming
and interfacing,
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS409 Course Title: Design and Analysis of Algorithms

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: IV
7. Category of Course: DSC
8. Pre-requisite: Fundamental of Computer & Introduction to Programming(TCS101),
Programming for problem solving(TCS201), Data Structures with C(TCS302)

9. Course After completion of the course the students will be able to:
Outcome:
CO1 Discuss various asymptotic notations to analyse time
and space complexity of algorithms
CO2 Analyse the various paradigms for designing efficient
algorithms using concepts of design and conquer,
greedy and dynamic programming techniques
CO3 Provide solutions to complex problems using the
concept of back tracking and branch and bound
techniques.
CO4 Apply algorithm design techniques to predict the
complexity of certain NP complete problems.
CO5 Implement Dijkstra’s, Bellman-ford, Prims, Kruskal’s
algorithms to solve the real world problems like
traveling salesman problem, job sequencing, packet
routing etc.
CO6 Apply pattern matching algorithms like Rabin Karp
Algorithm, Brute-force techniques etc, to find a
particular pattern.

10. Details of the Course:

Contact
UNIT CONTENTS
Hrs

Unit – I Asymptotic Notations and Searching Algorithms 8

 Introduction to Algorithms - What is an Algorithm,
Rate of growth, Commonly used rate of growths,
Types of analysis, Asymptotic Notations, Master
theorem

Searching - Linear search (sorted and unsorted),

Iterative and recursive binary search, Exponential
search, Tower of Hanoi and solving its recursion,
Fibonacci and solving its recursion

Sorting Algorithms Sorting - Bubble sort, Insertion

sort, selection sort, quick sort, randomized quick sort,
merge sort, Heap & Heap sort , counting sort, External
sorting, Radix sort , bucket sort.
Unit - II 10
Divide sorting algorithms into following types -
online sort, stable sort, in place sort, Comparison of
sorting algorithms on the basis of number of swaps,
by number of comparisons, recursive or iterative
nature, time and space complexity

Graph Algorithms
Representation of Graphs, Breadth-first search (BFS),
depth-first search (DFS), topological sort, Difference
between BFS and DFS Data structures for disjoint
sets - Finding cycle in a graph, Finding strongly
connected components
Unit – III Minimum spanning trees - Kruskal and Prim 12
algorithms (Greedy Algorithms) Single source
shortest paths - Dijkstra (Greedy Approach) and
Bellman ford (Dynamic Programming) algorithms,
Working on -ve edge & cycle, difference & similarity.

All pair shortest paths - The Floyd Warshall

algorithm

Algorithm Design Techniques - Greedy and

Dynamic Programming
Greedy algorithms –Optimal substructure property,
Unit – IV Activity selection problem, Job sequencing problem, 10
Huffman codes, fractional knapsack problem

Dynamic Programming - Overlapping substructure

property, Optimal substructure property, Tabulation vs
 Memorization, Fibonacci numbers, 0/1 Knapsack
problem, Longest common subsequence, Matrix
chain multiplication, Longest increasing
subsequence.

Hashing, String Matching and NP-Completeness

Hashing - Introduction to Hashing, Hash function,

Collision and collision handling, - Chaining, Open
addressing (longest probing, quadratic probing,
double hashing )

String Matching - Naive string-matching algorithm,

Unit – V The Rabin-Karp algorithm, The Knuth-Morris-Pratt 10
algorithm,Trie.

NP-Completeness - Importance of NP-

completeness, P, NP, NP Complete and NP hard
problems, Polynomial time and polynomial time
verification, The subset-sum problem, The traveling
salesman problem

Total 50

Text Books:

Authors Name Title Edition Publisher, Country Year

Thomas H. Cormen, Introduction 4th Edition MIT Press 2022

Charles E. Leiserson, to
Ronal L. Rivest, and Algorithms
Clifford Stein

Reference Books:

Authors Title Edition Publisher, Year

Name Country
Donald Knuth Art of Computer 3rd Addison- 1998
Programming, The: Edition Wesley
Volume 1: Fundamental
Algorithms (ART OF
COMPUTER
PROGRAMMING)

Ellis Horowitz, Fundamentals of 2nd Universities 2007

Sartaj Sahni, Computer Algorithms Edition press
Sanguthevar
Rajasekaran:”

Anany Levitin Introduction to the Design 2nd Pearson 2008

& Analysis of Algorithms Edition Education
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

Virtualization and Cloud
1. Subject Code: TCS451 Course Title:
Computing
2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs): Theory 3 Practical 0
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 3
6. Semester: IV
7. Category of Course: DSE
8. Pre-requisite: Fundamental of Computer & Introduction to Programming(TCS 101),
Fundamental of Cloud Computing and Bigdata(TCS351)

9. Course After completion of the course the students will be able to:
Outcome:
CO1 Discuss the different paradigms of cloud computing.
CO2 Contrast parallel and distributed computing.
CO3 Identify the concept of virtualization technique.
CO4 Apply virtualization technique in cloud computing
platform.
CO5 Describe the architectures of cloud computing.
CO6 Demonstrate the Use case of the virtualization and
cloud computing services.

10. Details of the Course:

Contact
UNIT CONTENTS
Hrs
Introduction to Cloud Computing
Why Cloud Computing (CC)? Different Perspectives on CC,
Different Stakeholders in CC, Total cost of ownership (TCO) of
on-premises IT, Cloud Computing Taxonomy, Characteristics
of cloud computing, Characteristics of cloud computing as per
NIST, Cloud Definitions. Cloud Computing at a Glance, The
Unit - I 9
Vision of Cloud Computing, Cloud Computing Reference
Model, Challenges Ahead, Historical Developments,
Distributed Systems, Virtualization, Web 2.0, Service-Oriented
Computing, Utility-Oriented Computing, Building Cloud
Computing Environments, Application Development,
Infrastructure and System Development, Computing Platforms
 and Technologies, Amazon Web Services (AWS), Google
AppEngine, Microsoft Azure, Hadoop, Force.com and
Salesforce.com

Virtualization
Introduction, Characteristics of Virtualized Environments,
Taxonomy of Virtualization Techniques, Execution
Virtualization, Types of hardware virtualization: Full
virtualization - partial virtualization - para virtualization
Desktop virtualization: Software virtualization – Memory
Unit - II 9
virtualization - Storage virtualization – Data Virtualization –
Network virtualization, Virtualization and Cloud Computing,
Pros and Cons of Virtualization, Technology Examples, Xen:
Para virtualization, VMware: Full Virtualization, Microsoft
Hyper-V.

Virtual Machines
Virtual machines basics, Process virtual machines: Memory
architecture emulation, Instruction emulation, Operating system
Unit –
emulation, Dynamic binary optimization, High level VN 8
III
architecture, System virtual machines: Resource virtualization
(Processors, Memory, Input/Output), Case Study of Intel VT-x

Parallel and Distributed Computing

Eras of Computing, Parallel vs. Distributed Computing,
Elements of Parallel Computing, What is Parallel Processing?,
Hardware Architectures for Parallel Processing, Approaches to
Parallel Programming, Levels of Parallelism, Laws of Caution,
Unit – Elements of Distributed Computing, General Concepts and
8
IV Definitions, Components of a Distributed System, Architectural
Styles for Distributed Computing, Models for Inter-Process
Communication, Technologies for Distributed Computing,
Remote Procedure Call, Distributed Object Frameworks,
Service Oriented Computing

Cloud Computing Architecture

Fundamental Cloud Architectures - Workload Distribution
Architecture - Resource Pooling Architecture - Dynamic
Scalability Architecture – Elastic Resource Capacity
Architecture -Service Load Balancing Architecture – Cloud
Bursting Architecture - Elastic Disk Provisioning Architecture –
Unit – V 9
Redundant Storage Architecture. Cloud Computing Reference
Architecture (CCRA):
Introduction, benefits of CCRA, Migrating into a Cloud:
Introduction, Challenges while migrating to Cloud, Broad
approaches to migrating into the cloud, Seven-step model of
migration into a cloud, Migration Risks and Mitigation.
 Total 43
Text Books:

Authors Name Title Edition Publisher, Country Year

Rajkumar Buyya, Mastering 1st McGraw Hill 2017

Christian Vecchiola, Cloud Edition Education
S.Thamarai Selvi Computing

Jim Smith , Ravi Nair Virtual 1st Morgan Kaufmann 2005

Machines: Edition
Versatile
Platforms for
Systems and
Processes

Pachghare V. K. Cloud 1st PHI Learning Pvt 2016

Computing Edition Ltd

Reference Books:

Authors Name Title Edition Publisher, Country Year

Barrie Sosinsky Cloud 1st Edition Wiley 2011

Computing
Bible
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

Statistical Data Analysis with
1. Subject Code: TCS471 Course Title: R

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs): Theory 3 Practical 0
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 3
6. Semester: IV
7. Category of Course: DSE
8. Pre-requisite: Engineering Mathematics-I (TMA101), Programming for problem
solving(TCS 201), Fundamental of Cloud Computing and Bigdata(TCS351)

9. Course After completion of the course the students will be able to:
Outcome:
CO1 Understand the concepts of statistics
CO2 Apply the probability distribution techniques in different
applications.
CO3 Understand the needs of data pre-processing
CO4 Implement the manipulation and processing of data in R
CO5 Apply the concepts of functions in R
CO6 Understand the use of R in data Analytics

10. Details of the Course:

Contact
UNIT CONTENTS
Hrs

Statistics: Introduction to Statistics- Descriptive Statistics,

Summary Statistics Basic probability theory, Statistical
Unit – I 9
Concepts (uni-variate and bi-variate sampling, distributions, re-
sampling, statistical Inference, prediction error),

Probability Distribution: Introduction to Probability, Probability

Unit - II Distribution (Continuous and discrete- Normal, Bernoulli, 10
Binomial, Negative Binomial, Geometric and Poisson
distribution) , Bayes’ Theorem, Central Limit theorem, Data
 Exploration & preparation, Concepts of Correlation, Regression,
Covariance, Outliers.
Introduction to R and Data Pre-processing: Introduction &
Unit – Installation of R, R Basics, Finding Help, Code Editors for R,
10
III Command Packages, Manipulating and Processing Data in R,
Reading and Getting Data into R, Exporting Data from R
Objects and Data Types: Data Objects-Data Types & Data
Structure. Viewing Named Objects, Structure of Data Items,
Unit –
Manipulating and Processing Data in R (Creating, Accessing, 8
IV
Sorting data frames, Extracting, Combining, Merging, reshaping
data frames), Control Structures
Functions: Functions in R (numeric, character, statistical),
working with objects, Viewing Objects within Objects,
Constructing Data Objects, Building R Packages, Running and
Manipulating Packages, Non parametric Tests- ANOVA, chi-
Unit – V 9
Square, t-Test, U-Test, Introduction to Graphical Analysis, Using
Plots(Box Plots, Scatter plot, Pie Charts, Bar charts, Line Chart),
Plotting variables, Designing Special Plots, Simple Liner
Regression, Multiple Regression
Total 46

Text Books:

Authors Name Title Edition Publisher, Year

Country

Mark Gardener Beginning R: 1st Edition Wiley 2013

The
Statistical
Programming
Language

Gareth James, An 2nd Edition Springer 2021

Daniela Witten, Introduction
Trevor Hastie, to Statistical
Robert Tibshirani Learning:
with
 Applications
in R

Reference Books:

Authors Name Title Edition Publisher, Country Year

N Das Statistical 1st Edition McGraw Hill 2017

Methods Education
(Combined
edition
volume 1 &
2)
Paperback
– 1 July
2017
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

Foundation of Cyber Security
1. Subject Code: TCS 495 Course Title:

2. Contact Hours: L: 4 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: IV
7. Category of Course: DSE
8. Pre-requisite: Introduction to Cryptography (TCS392)

9. Course After completion of the course the students will be able to:
Outcome:
CO1 Explain different cyber threats and attacks
CO2 Know the working of various cyber-attacks and cyber
security protocols
CO3 Analyse the different cyber security protocols.
CO4 Use scripting language to implement security protocols.
CO5 Apply security techniques to secure web applications
CO6 Develop cyber security protocols.

10. Details of the Course:

Sl. Contact
Contents
No. Hours
Unit 1: Introduction to Cyber Security
What is Cyber security, why we need Cyber security, The Zero
Trust Model, Overview of ethical hacking.
Protect Against - Unauthorized Modification, Unauthorized
Deletion and Unauthorized Access.
Three pillars of Cyber Security - Confidentiality, Availability and
1 Integrity. 9
Steps to fix a crime - Identify Cyber Threats, Analyse and
Evaluate Threat, Treatment.
Type of Hackers - White Hat, Great Hat, Black Hat.
Penetration Testing and its Phases - Reconnaissance,
Scanning, Gaining Access, Maintaining Access, Covering
Tracks.
Unit 2: Linux Basics and Scripting for Ethical Hacking
2 10
 Bash, Linux commands, man page, adding and deleting, users
and adding them to sudo group, switching users, creating,
copying, moving and removing file, Writing and appending text
to a file, file permissions, working with editors, grep, cut
command, starting and stopping services
Introduction to Bash scripting - Basics of Bash or Shell scripting,
conditional statements, loops, manipulating files
Introduction to Python - Basics of Python, conditional
statements, loops, list, tuple, dictionary, functions.

Unit 3: Networking Basics for Ethical Hacking

Virtualization - Installing and configuring virtual machine,

Network address translation, differences of IPv4 and IPv6, IP
Address, Mac Address, TCP 3-way handshake,
3 9
netcat - The Swiss Army Knife of TCP/IP Connections, use
netcat to Listen on a port, pushing a command shell back to
listener, transfer files, ICMP and Ping command, use of
Wireshark tool.

Unit 4: Basics of Web and Web Security

The client-server model for the web, various web threats and
4 attacks, web cross site scripting (XSS) attack and use of 9
scripting languages, phishing attacks, spear phishing, SQL
injection attack, use of web penetration testing tools.

Unit 5: Introduction to Cyber Threats and System Hacking

Cyber threats - malware, password attacks, distributed denial-

5 of-service (DDos), ransomware attack, eavesdropping attack 10
(man in the middle attack), birthday attack, IP and mac address
spoofing, anonymous browsing and use of tor browser.

Total 47

Text Books:

Authors Name Title Edition Publisher, Year

Country
Anne Kohnke, The Complete 1st edition Taylor & Francis 2022
Dan Guide to Ltd
Shoemaker, Cybersecurity
Ken E. Sigler Risks and Controls
(Internal Audit and
IT Audit)
 Penetration 1st Edition No Starch Press, 2014
Georgia Testing: A Hands- USA
Weidman On Introduction to
Hacking
Nina Godbole Cyber security : 1st Edition Wiley, India 2011
and Sunit understanding
Belapure cyber crimes,
computer forensics
and legal
perspectives

Reference Books:

Authors Name Title Edition Publisher, Year

Country
OccupyTheWeb Linux Basics for Illustrated No Starch Press, 2018
Hackers: Getting Edition USA
Started with
Networking,
Scripting, and
Security in Kali
 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

Fundamental of Statistics and
1. Subject Code: TCS421 Course Title: AI
2. Contact Hours: L: 3 T: 0 P: 0
3. Examination Duration (Hrs): Theory 4 Practical 0
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 3
6. Semester: 4
7. Category of Course: DSE
8. Pre-requisite: Engineering Mathematics-I (TMA101), Engineering Mathematics-II
(TMA201), Python Programming for Computing (TCS341)

9. Course After completion of the course the students will be able to:
Outcome:
CO1 Demonstrate knowledge of statistical and exploratory
data analysis data analysis techniques utilized in
decision making.
CO2 Apply principles of Data Science to the analysis of
business problems.
CO3 To use Machine Learning Algorithms to solve real-world
problems.
CO4 To provide data science solution to business problems
and visualization.
CO5 To learn the basic concepts and techniques of AI and
machine learning
CO6 To explore the various mechanism of Knowledge and
Reasoning used for building expert system

10. Details of the Course:

S. Contact
Contents
No. Hours
Unit 1:
Introduction to AI
1 Definition, Problem, State space representation. Intelligent 10
Systems:
Categorization of Intelligent System, Components of AI
Program,
 Foundations of AI, Applications of AI, Current trends in AI,
Intelligent
Agents: Anatomy, structure, Types

Unit 2:
Problem solving

Solving problem by Searching: Problem Solving Agent,

Formulating
Problems. Uninformed Search Methods: Breadth First
2 Search (BFS),
Depth First Search (DFS), Depth Limited Search, Depth
First Iterative 9
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:
An Introduction to Data Science, Data Processing and
Visualization

Definition, working, benefits and uses of Data Science,

Data science vs. Business Intelligence, The data science
3 process, Role of a Data Scientist.
9
Data Processing and Visualization: Data Formatting,
Exploratory Data Analysis, Filtering, and hierarchical
indexing using Pandas. Data Visualization: Basic
Visualization Tools, Specialized Visualization Tools,
Seaborn Creating and Plotting Maps.

Unit 4:
Statistical Data Analysis & Inference

Populations and samples, Statistical modelling, probability

distributions, fittings a model, Statistical methods for
evaluation, Exploratory Data Analysis, Getting started with 9
4
R, Manipulating and Processing data in R, working with
function in R, working with descriptive Statistics, Working
with graph plot in R.
 Unit 5:
Statistical Applications
5
Basic Statistical operations, Linear Regression Analysis, 8
Logistic and Exponential Regression, Time Series
Analysis, Probability Distribution, ANOVA, Correlation and
Covariance.
Total 45

Text Books:

Authors Name Title Edition Publisher, Country Year

Tom M. Mitchell Machine 1st Edition McGraw Hill 2017

Learning Education

K.G. Srinivasa, Statistical 1st Edition Oxford University 2017

G.M. Siddesh, Programming Press
Chetan Shetty, in R
Sowmya B.J.

Reference Books:

Authors Name Title Edition Publisher, Country Year

 GRAPHIC ERA HILL UNIVERSITY
SEMESTER IV

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS464 Course Title: Deep Learning

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: IV
7. Category of Course: DSC
8. Pre-requisite: Fundamentals of Artificial Intelligence and Machine Learning (TCS364),
Python Programming (TCS346)

9. Course Outcome: After completion of the course, the students will be able to:
CO1: Define the fundamental concepts of artificial neural
networks and differentiate between perceptrons and deep
neural networks.
CO2: Describe the architecture and functionalities of
Convolutional Neural Networks (CNNs) for image
processing tasks.
CO3: Implement basic neural network architectures using
popular deep learning libraries.
CO4: Analyze the impact of different activation functions on the
performance of neural networks.
CO5: Choose suitable deep learning architectures (CNNs,
RNNs) based on the specific problem and data
characteristics.
CO6: Design and implement a deep learning model (e.g., CNN
or LSTM) to solve a simple engineering-related problem
10. Details of the Course:
Sl. Contact
Contents
No. Hours

30
 UNIT 1: Introduction to Neural Networks and Deep Neural
Networks
Basics of neural networks, Perceptrons and activation functions,
1 10
Architecture of a simple neural network
Multi-layer perceptrons (MLP), Forward propagation and
backpropagation, Loss functions and optimization algorithms
UNIT 2: Convolutional Neural Networks (CNNs)

2 Understanding convolutions and pooling, Architecture of CNNs, Applications 10

in image recognition and processing
UNIT 3: Recurrent Neural Networks (RNNs) and LSTMs

3 Basics of RNNs, Problems with RNNs (vanishing and exploding gradients), 10

Long Short-Term Memory (LSTM) networks
UNIT 4: Advanced Topics in Deep Learning

4 Autoencoders, Generative Adversarial Networks (GANs), Transfer learning 10

and fine-tuning
UNIT 5: Practical Applications of Deep Learning

5 Natural Language Processing (NLP), Autonomous vehicles, Medical image 8

analysis
Total 48
Text Books:
Authors Name Title Edition Publisher, Country Year
John D. Kelleher Deep Learning 1st Edition MIT Press, USA 2019
Francois Chollet Deep Learning 2nd Manning Publications 2024
with Python Edition Co., USA
Amlan Chakrabarti Deep Learning 1st Edition Pearson, India 2021
Amit Kumar Das,
Saptarsi Goswami,
Pabitra Mitra
Reference Books:
Authors Name Title Edition Publisher, Country Year
Maxime Chevalier- Recurrent Neural 1st Packt Publishing Ltd, 2021
Boisvert, Julien Networks for Edition UK
Rougerie, and Fabian- Beginners
Robert Picard
Aurélien Géron Hands-On 2nd O'Reilly Media, Inc., 2024
Machine Edition USA
Learning with

31
 Scikit-Learn,
Keras &
TensorFlow

GRAPHIC ERA HILL UNIVERSITY

SEMESTER IV

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS 462 Course Title: Introduction to Big Data

2. Contact Hours: L: 3 T: 1 P: 0
3. Examination Duration (Hrs): Theory 3 Practical 0
4. Relative Weight: CIE 25 MSE 25 ESE 50
5. Credits: 3
6. Semester: IV
7. Category of Course: DSE

8. Pre-requisite: (TCS-342) Introduction to Statistical Data Science, TCS-302 Data

structures with C

9. Course Outcome: After completion of the course, the students will be able to:
CO1: Outline the theory of big data, and explain challenges of
big data
CO2: Understand the types of Big data and its characteristics
CO3: Compare Business Intelligence Vs Big Data
CO4: Get the idea of NoSQL databases, different types of
NoSQL/NewSQL datastores
CO5: Discuss various types of Big Data analytics
CO6: Elaborate a Big Data management architecture

32
10. Details of the Course:
Sl. Contact
Contents
No. Hours
Unit 1:
Big Data and its Challenges
Defining Big Data, Characteristics of Big Data, Evolution of Big
Data, Traditional Business Intelligence vs Big Data, The Evolution
of Data Management, Understanding the Waves of Managing
1 Data, creating manageable data structures, Web and content 9
management, Managing big data. Building a Successful Big Data
Management Architecture, beginning with capture, organize,
integrate, analyze, and act, Setting the architectural foundation,
Performance matters, Traditional and advanced analytics.
Unit 2:
Big Data Types and its Sources
Defining Structured Data Exploring sources of big structured data,
Understanding the role of relational databases in big data Defining
Unstructured Data, exploring sources of unstructured data,
2 Understanding the role of a CMS in big data management. Looking 8
at Real-Time and Non Real-Time Requirements, Putting Big Data
Together, managing different data types, integrating data types
into a big data environment.

Unit 3:
Technology Foundations of Big Data
Exploring the Big Data Stack: - Layer 0: Redundant Physical
Infrastructure - Physical redundant networks, Managing hardware:
Storage and servers, Infrastructure operations - Layer 1: Security
3 9
Infrastructure, Interfaces and Feeds to and from Applications and
the Internet- Layer 2: Operational Databases. Layer 3: Organizing
Data Services and Tools. Layer 4: Analytical Data Warehouses,
Big Data Analytics, Big Data Applications.

33
 Unit 4:
Introduction to NoSQL and NewSQL
Introduction to NoSQL, Uses, Features and Types, Need,
Advantages, Disadvantages and Application of NoSQL, Overview
of NewSQL. RDBMSs Are Important in a Big Data Environment.
4 8
PostgreSQL relational database. Nonrelational Databases. Key-
Value Pair Databases - Riak keyvalue database. Document
Databases MongoDB, CouchDB . Columnar Databases, HBase
columnar database. Graph Databases- Neo4J graph database.
Unit 5:
Big Data Analytics
Basic analytics, Advanced analytics, Operationalized analytics,
5 Monetizing analytics. Modifying Business Intelligence Products to 8
Handle Big Data, Studying Big Data Analytics Examples,
Terminologies used in Big Data environment.
Total 42

Text Books:
Authors Name Title Edition Publisher, Country Year
Judith Hurwitz, Alan Big Data 1st Wiley, United States 2013
Nugent , Fern Halper , for
Marcia Kaufman Dummies
Subhashini Big Data 2nd Wiley, United States 2019
Chellappan Seema and
Acharya Analytics
DT Editorial Services Big Data 1st Dreamtech Press, 2016
New Dehli

Reference Books:
Authors Name Title Edition Publisher, Country Year
Michele Big Data, Big 1st Wiley, United States 2013
Chambers, Analytics:
Michael Emerging

34
Minelli , Ambiga Business
Dhiraj Intelligence and
Analytic Trends
for Today's
Businesses

35