Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Engineering Mathematics III Course Code: ETUCAS301T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
The objective of this course is to familiarize the students with Laplace Transform, Fourier Transform, their application,
logic group, sets, lattices, Boolean algebra and Karnaugh maps. It aims to present the students with standard concepts and
tools at B.Tech first year to superior level that will provide them well towards undertaking a variety of problems in the
concern discipline.

Unit Content Hours

Partial Differential Equations: Origin of Partial Differential Equations, Linear and Non Linear
Partial Equations of first order, Lagrange’s Equations, Charpit’s method, Cauchy’s method of
1 8
Characteristics, Solution of Linear Partial Differential Equation of Higher order with constant
coefficients, Equations reducible to linear partial differential equations with constant coefficients.
Applications of Partial Differential Equations:
Classification of linear partial differential equation of second order, Method of separation of
2 8
variables, Solution of wave and heat conduction equation up to two dimension, Laplace equation
in two dimensions, Equations of Transmission lines.
Statistical Techniques I:
Introduction: Measures of central tendency, Moments, Moment generating function (MGF) ,
Skewness, Kurtosis, Curve Fitting , Method of least squares, Fitting of straight lines, Fitting of
3 8
second degree parabola, Exponential curves ,Correlation and Rank correlation, Regression
Analysis: Regression lines of y on x and x on y, regression coefficients, properties of regressions
coefficients and non linear regression.
Probability and Distribution: Introduction, Addition and multiplication law of probability,
Conditional probability, Baye’s theorem, Random variables (Discrete and Continuous Random
4 8
variable) Probability mass function and Probability density function, Expectation and variance,
Discrete and Continuous Probability distribution: Binomial, Poission and Normal distributions.
Sampling, Testing of Hypothesis and Statistical Quality Control: Introduction, Sampling
Theory (Small and Large) , Hypothesis, Null hypothesis, Alternative hypothesis, Testing a
Hypothesis, Level of significance, Confidence limits, Test of significance of difference of means,
5 8
T-test, F-test and Chi-square test, One way Analysis of Variance (ANOVA).Statistical Quality
Control (SQC) , Control Charts , Control Charts for variables ( X and R Charts), Control Charts for
Variables ( p, np and C charts).
Course Outcome:
 Remember the concept of partial differential equation and to solve partial differential equations
 Analyze the concept of partial differential equations to evaluate the problems concerned with partial differential
equations
 Understand the concept of correlation, moments, skewness and kurtosis and curve fitting
 Remember the concept of probability to evaluate probability distributions
 Apply the concept of hypothesis testing and statistical quality control to create control charts

Text Books:
 Erwin Kreyszig, Advanced Engineering Mathematics, 9thEdition, John Wiley & Sons, 2006.
 B. V. Ramana, Higher Engineering Mathematics, Tata Mc Graw-Hill Publishing Company Ltd., 2008.
 N.P.Bali, A Textbook of Engineering Mathematics-IV, Laxmi Publication, 10th Edition 2021
 H.K.Dass, Introduction to Engineering Mathematics - Volume IV, S Chand Publication, 2019 Edition

Reference Books:
 B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.
 T.Veerarajan : Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi.
 R.K. Jain and S.R.K. Iyenger: Advance Engineering Mathematics; Narosa Publishing House, New Delhi.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Data Structures Course Code: ETUCCS301T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
 Using computer science theory, students will construct and analysis various data structures and abstract data
types including lists, stacks, queues, trees, and graphs.
 Students will implement various sorting, searching, and hashing algorithms.
 Students will build a substantial, complex data structure.

Unit Content Hours

Introduction to Data Structure: Introduction: Basic Terminology, Elementary Data
Organization, Algorithm, Efficiency of an Algorithm, Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major
1 Order, and Column Major Order, Application of arrays, Sparse Matrices and their representations. 8
Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists, Doubly
Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal,
Polynomial Representation and Addition, Generalized Linked List.
Stacks: Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C,
Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion,
Tower of Hanoi Problem, Simulating Recursion, Principles of recursion, Tail recursion, Removal
2 8
of recursion Queues,
Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked
implementation of queues in C, Dequeue and Priority Queue.
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and
Dynamic Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees,
3 8
Array and Linked Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and
Postorder.
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices,
Adjacency List, Adjacency Multi list, Graph Traversal: Depth First Search and Breadth First
4 Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and 8
Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and
Dijikstra Algorithm.
Searching : Sequential search, Binary Search, Comparison and Analysis Internal Sorting: Insertion
Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical
consideration for Internal Sorting. Search Trees: Binary Search Trees (BST), Insertion and
5 8
Deletion in BST, Complexity of Search Algorithm, AVL trees, Introduction to m-way Search Trees,
B Trees. Hashing: Hash Function, Collision Resolution Strategies Storage Management: Garbage
Collection and Compaction.

Course Outcome:
 Students demonstrate an ability to apply knowledge of computing and mathematics appropriate to the discipline
including computer science theory, recursion, and order N analysis.
 Implement an N-way tree with correct insertion and deletion such that it stores words that are displayed in
alphabetical order given an in-order traversal, will display the words in alphabetical order.
 Given a cyclic-directed graph with weighted lengths, determine the shortest path between two nodes. Then
generate the transitive closure given a starting node.
Text Books:
 Aaron M. Tenenbaum, YedidyahLangsam and Moshe J. Augenstein, “Data Structures Using C and C++”, PHI
Learning Private Limited, Delhi India
 Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
 Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
 Thareja, “Data Structure Using C” Oxford Higher Education.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Computer Organization & Architecture Course Code: ETUCCS302T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
 Specify the hardware components of a computer its architecture and performance evaluation
 Specify the instruction set of MIPS architecture to build a basic processor
 Design construct and analyse a basic processor using single cycle, multi cycle, and pipelined techniques.
 Analyse and specify new memory interactions to improve the performance of a computing system.
 Design and optimize the performance of memory hierarchy for modern processors.

Unit Content Hours

Introduction to Computers: Basic of Computer, internal organization of CPU, Functional Units
of digital system and interconnection, Software, Basic Operational Concepts, Data
1 Representation, Fixed-Point Representation, Floating-Point Representation, bus architecture, 8
types of buses and bus arbitration. Register, Processor organization, general registers organization,
stack organization and addressing modes.
ALU and Micro Operations: Multiplication: Signed operand multiplication, Booths algorithm
and array multiplier. Division and Logic operations. Floating point arithmetic operation, Basic
2 Computer Organization: Instruction Codes, Computer Registers, Computer Instructions, Timing
8
and Control, Instruction Cycle, Memory-Reference Instructions, Input-Output and Interrupt.
Central Processing Unit: Introduction, General Register Organization, Stack Organization,
Instruction Formats, Addressing Modes with numerical examples, Data Transfer and Manipulation,
Program Control, Program Interrupt, Types of interrupts, CISC Characteristics, RISC
3 Characteristics. Introduction to Parallel Processing, Pipelining, Polling and Handshaking Controls,
8
Control Design: Hardwired & Micro Programmed (Control Unit), Control Memory, Address
Sequencing, Conditional and Unconditional Branching, Micro program Example.
Memory Organization: Basic concept of memory and hierarchy, semiconductor RAM memories,
2D & 2 1/2D memory organization. Memory Hierarchy, Main Memory, Auxiliary Memory,
4 Associative Memory, Cache Memory, Virtual Memory. 8
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous Data
Transfer, Modes of Transfer, Priority Interrupt, Direct Memory Access.
Parallel Computing; Multiprocessor and thread level parallelism- classification of parallel
architecture-models of communication and memory architecture-Symmetric shared memory
5 architecture-cache coherence protocols-distributed shared memory architecture 8
Data Parallelism and Microprocessor; Data Level Parallelism-Vector processors-SIMD
extensions, GPU, GPU and CUDA, Overview of CUDA C;
Course Outcome:
 Understanding basic design of computer with modern computer architecture
 Understanding CPU organization, Memory Organization, I/O Organization
 Understanding various data transfer schemes with interrupt Handling
 Understanding architecture, and concept of Parallel Computing

Text Books:
 D. A. Patterson and J. L. Hennessy, Computer Organisation and Design: The Hardware/Software Interface, 5/e, Morgan
Kaufmann, 2014.
 J. L Hennessy and D. A. Patterson, A. Computer Architecture: A Quantitative approach, 6/e, Morgan Kaufmann, 2017.
 M. Morris Mano, Computer System Architecture

Reference Books:
 V. P. Heuring and H. F. Jordan, Computer System Design and Architecture, Prentice Hall, 2003.
 D. A. Patterson and J. L. Hennessy,Computer Organisation and Design: The Hardware/ Software Interface, 5/e,
Harcourt Asia Pte Ltd (Morgan Kaufman), 2014
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Discrete Structure & Theory of Logic Course Code: ETUCCS303T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
 To enable the students to learn the operations on Sets.
 To understand the Algebraic Structures and their properties.
 To learn the advanced concepts in Graphs.
 To understand the Mathematical logic and its applications

Unit Content Hours

Sets: Definition of sets, Types of Sets, Operations on Sets ,Cartesian Product of Sets. Relation:
Definition, types of relation, composition of relations, equivalence relation, partial ordering
1 relation, Closure of Relations. Functions: Definition, type of functions, composition of functions,
8
recursively defined functions.
Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian
2 group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, 8
Normal subgroup, Homomorphism and isomorphism of Groups, examples and standard results.
Hasse Diagram and Lattices: Introduction, ordered set, Posets, Hasse diagram of partially
3 ordered set, isomorphic ordered set, well ordered set, properties of Lattices, and complemented 8
lattices.
Mathematical Logic: Proposition, First order logic, Basic logical operations , truth tables,
4 tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, 8
Theory of Inference, predicates, Universal and existential quantifiers
Graphs: Simple graph, multi graph, graph terminology, representation of graphs, Adjacency and
Incidence Matrices, Spanning, Euler graphs, Hamiltonian path and circuits, Shortest Path,
Bipartite, Regular, Planar and connected graphs, connected components in a graph, Graph coloring
5 , chromatic number, isomorphism and Homomorphism of graphs. Combinatorics: Basic Counting
8
Technique, Pigeon-hole Principle, Recurrence Relation, Generating function, Polya's Counting
Theorem

Course Outcome:
 Understand the basic principles of sets and operations in sets.
 Demonstrate an understanding of relations and functions and be able to determine their properties.
 Demonstrate the ability to write and evaluate a proof or outline the basic structure of and give examples of each
proof technique described.
 Demonstrate different traversal methods for Graphs.

Text Books:
 Discrete Mathematics and Its Applications, By Kenneth H Rosen, McGraw Hill
 B. Kolman, R.C Busby and S.C Ross, "Discrete Mathematics Structures", Prentice Hall
 Discrete Mathematical Structures with Applications to Computer Science, By J. P. Tremblay, R.Manohar,
McGraw Hill.

Reference Books:
 Graph Theory With Applications to Engineering and Computer Science, By Prentice Hall, Englewood Cliffs, N.
J
 Combinatorics: Theory and Applications, By V. Krishnamurthy, East-West Press Pvt. Ltd., New Delhi
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Python Programming Course Code: ETUCCS304T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
 Master the fundamentals of writing Python programs.
 Learn core Python scripting elements such as variables and flow control structures
 Discover how to work with lists and sequence data
 Write Python functions to facilitate code reuse
 Use Python to read and write files
 Work with the Python standard library and modules.

Unit Content Hours

Introduction to Python Language: Introduction to Python: Python variables, Python basic
1 Operators, Understanding python blocks. Python Data Types, Declaring and using Numeric data 8
types: int, float etc.
Control Structures: Python Program Flow Control Conditional blocks: if, else and else if, Simple
for loops in python, For loop using ranges, string, list and dictionaries. Use of while loops in python,
2 Loop manipulation using pass, continue, break and else. Programming using Python conditional
8
and loop blocks.
Strings, Lists, Tuples and Dictionaries,: Python Complex data types: Using string data type and
string operations, Defining list and list slicing, Use of Tuple data type. String, List and Dictionary,
3 Manipulations Building blocks of python programs, string manipulation methods, List 8
manipulation. Dictionary manipulation, Programming using string, list and dictionary in-built
functions. Python Functions, Organizing python codes using functions.
Functions & Modules: Defining a function, Calling a function, Types of functions, Function
4 Arguments, Anonymous functions, Global and local variables. Importing module, Math module, 8
Packages and their composition
File Handling: Python File Operations: Reading files, Writing files in python, Understanding read
5 functions, read(), readline(), readlines(). Understanding write functions, write() and writelines() 8
Manipulating file pointer using seek Programming, using file operations.

Course Outcome:
 Understanding basic programming skills using Python programming language.
 Understanding the notion of data types and complex data types such as lists, tuples etc.
 Understanding the concept of decision making and iterative control structure in python.
 Understanding the concepts of functions and file handling in Python.

Text Books:
 R Nageswar Rao, Core Python Programming, 2018.
 Eric Mathews, Python Crash Course, 2019.

Reference Books:
 Practical Programming: An introduction to Computer Science Using Python, second edition, Paul Gries,
Jennifer Campbell, Jason Montojo, The Pragmatic Bookshelf.
 Exploring Python, Timothy A. Budd, Mc Graw Hill Education
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Data Structures Lab Course Code: ETUCCS301P

Semester: 3 L T P C
0 0 2 1

List of Experiments:
Write C Programs to illustrate the concept of the following:
 Implementation of multi-dimensional array and operations on arrays
 Implementation of singly, doubly, circular linked list.
 Implementation of Bubble, Insertion, Selection, Merge, Heap and Quick sorting Algorithms in non-
recursive fashion.
 Implementation of Bubble, Insertion, Selection, Merge, Heap and Quick sorting Algorithms using
recursive.
 Implementation of Linear and Binary Searching Algorithm.
 Implementation of Stack using array and linked list.
 Implementation of Queue using array and linked list.
 Implementation of Circular Queue using array and linked list.
 Implementation of Priority Queue.
 Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree, Insertion and
Deletion in BST.
 Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path algorithm.

Laboratory Outcomes:
Upon successful completion of this course, student will be able

 Students demonstrate an ability to apply knowledge of computing and mathematics appropriate to the
discipline including computer science theory, recursion, and order N analysis.
 Implement an N-way tree with correct insertion and deletion such that it stores words that are displayed
in alphabetical order given an in-order traversal, will display the words in alphabetical order.Given a
cyclic-directed graph with weighted lengths, determine the shortest path between two nodes. Then
generate the transitive clouser given a starting node.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Computer Organization Lab Course Code: ETUCCS302P

Semester: 3 L T P C
0 0 2 1

List of Experiments:

 To Implementing HALF ADDER, FULL ADDER using basic logic gates

 Implementing Binary -to -Gray, Gray -to -Binary code conversions.
 Implementing 3-8 line DECODER.
 Implementing 4x1 and 8x1 MULTIPLEXERS.
 Verify the excitation tables of various FLIP-FLOPS.
 Design of an 8-bit Input/ Output system with four 8-bit Internal Registers.
 Design of an 8-bit ARITHMETIC LOGIC UNIT.
 Design the data path of a computer from its register transfer language description.
 Design the control unit of a computer using either hardwiring or microprogramming based on its register
transfer language description.
 Implement a simple instruction set computer with a control unit and a data path.
Laboratory Outcomes:
Upon successful completion of this course, student will be able

 To understand the hierarchical memory system, cache memories and virtual memory
 To understand the different ways of communicating with I/O devices and standard I/O interfaces
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Discrete Structure & Logic Lab Course Code: ETUCCS303P

Semester: 3 L T P C
0 0 2 1

List of Experiments:
Write C Programs to illustrate the concept of the following:

 To create two sets and perform the Intersectison operation on sets.

 To create two sets and perform the Difference operation on sets.
 To create two sets and perform the Symmetric Difference Operation.
 To perform the Power Set operation on a set.
 To Display the Boolean Truth Table for AND, OR , NOT .
 To find Cartesian Product of two sets
 For minimum cost spanning tree.
 For finding shortest path in a Graph
 Working of Computation software
 Discover a closed formula for a given recursive sequence vice-versa
 Recursion and Induction
 Practice of various set operations
 Counting
 Combinatorial equivalence
 Permutations and combinations
Upon successful completion of this course, student will be able

 To implement basic discrete structures algorithms.

 To analyze algebraic techniques and implement algebraic operations.
 To implement logical problems like Boolean algebra, poker hand problem and birthday problem.
 To implement closed formula of recursive sequence.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Python Programming Lab Course Code: ETUCCS304P

Semester: 3 L T P C
0 0 2 1

List of Experiments:

 Write a program to demonstrate different number data types in Python

 Write a program to compute distance between two points taking input from the user using
Pythagorean Theorem.
 Write a Program for checking whether the given number is a even number or not.
 Write a Python script that prints prime numbers less than 20.
 Write a program to create, concatenate and print a string and accessing sub-string from a given string.
 Write a program to create, append, and remove lists in python.
 Write a program to demonstrate working with tuples in python.
 Write a python program to define a module to find Fibonacci Numbers and import the module to
another program.
 Write a python program to define a module and import a specific function in that module to another
program
 Write a script named copyfile.py. This script should prompt the user for the names of two text files.
The contents of the first file should be input and written to the second file.
 Write a Python class to implement pow(x, n).

Laboratory Outcomes:
Upon successful completion of this course, student will be able

 Understand and comprehend the basics of python programming.

 Demonstrate the principles of structured programming and be able to describe, design, implement, and
test structured programs using currently accepted methodology.
 Explain the use of the built-in data structures list, sets, tuples and dictionary.
 Make use of functions and its applications.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Professional Proficiency (B. Tech.) – III Course Code: PTSPPET30T

Semester: 3 L T P C
2 0 0 0
Course Objectives:
 To put in use the basic mechanics of Grammar.
 To provide an outline to effective Organizational Communication.
 Understand the role of communication in personal & professional success.
 Prepare and present messages with a specific intent.

Unit Content Hours

Components of Technical Writing and Functional Grammar, Fundamentals of Technical
1 6
Communication, Technical Style & Written Communication-Level 3
2 Quantitative and Qualitative Aptitude-Level 3 6
3 Reasoning and Logic Building- Level 3 6
Advanced Programming Practices-1:
4 Graphs- Concepts, Applications and Examples, Operations- DFS, BFS, Finding Spanning Trees, 6
Shortest Path Algorithms, Flow Control, Cut, Max Flow Min Cut Algorthm etc.
Advanced Programming Practices-2:
5 Greedy Algorithms- Concept, Applications and Examples 6
Back Tracking Algorithms - Concepts, Applications and Examples
Course Outcome:
 Students would be able to create substantial base by the formation of strong professional vocabulary for its
application at different platforms and through numerous modes as Comprehension, reading, writing and speaking
etc.
 Students will cultivate relevant technical style of communication & presentation at their work place & also
for academic uses
 Students will apply it at their work place for writing purposes such as Presentation/official drafting/administrative
communication and use it for document/project/report/research paper writing
 Students will apply it for practical and oral presentation purposes by being honed up in presentation skills and
voice-dynamics. They will apply techniques for developing interpersonal communication skills and positive
attitude leading to their professional competence.

Text Books:
 Improve your Writing ed. V.N. Arora and Laxmi Chandra, Oxford Univ. Press, 2001, New Delhi.
 Technical Communication- Principles and Practices by Meenakshi Raman & Sangeeta Sharma, Oxford
Univ. Press, 2007, New Delhi.
 Functional skills in Language and Literature, by R.P. Singh, Oxford Univ. Press, 2005, New Delhi.
 Ashraf Rizvi, "Effective Technical Communication", 2ndEdition, McGraw Hill Education, 2017 .
 Salaria, R. S. Data Structures & Algorithms Using C++. KHANNA PUBLISHING HOUSE, 2012.

Reference Books:
 Communication Skills for Engineers and Scientists, Sangeeta Sharma et.al. PHI Learning Pvt. Ltd, 2011, New
Delhi.
 Business Correspondence and Report Writing by Prof. R. C. Sharma & Krishna Mohan, Tata McGraw Hill &
Co. Ltd. , 2001, New Delhi.
 Word Power Made Easy by Norman Lewis, W.R. Goyal Pub. & Distributors, 2009, Delhi.
 Developing Communication Skills by Krishna Mohan, Mecra Bannerji- Macmillan India Ltd. 1990, Delhi
 Kanetkar, Yashavant. Data Structures Through C: Learn the fundamentals of Data Structures through C. Bpb
Publications, 2019.
 Kanetkar, Yashavant P. Understanding Pointers In C. Bpb Publications, 2003.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Introduction to Data Science Course Code: ETUCCS306T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
 To apply basic exploratory analysis to identify abnormalities in data (i.e., missing values, outliers, redundant
features, etc.)
 To perform the appropriate feature transformations for processing categorical data and for making non-linear
representations in linear models
 To identify the appropriate set of algorithms (i.e., regression vs. decision tree vs. clustering) for a given problem
statement, and give an appropriate analysis of the pros/cons of each for the problem at hand
 To explain relevant data science theories and concepts, such as model regularization and optimization. Design
and implement an experiment incorporating data science principles.
 To explore ethical implications surrounding privacy, data sharing, and algorithmic decision making for a given
data science approach.

Unit Content Hours

Introduction to Data Science: Learn about the need for data science, with emphasis on data;
Visualization and ethical aspects involved in data science and engineering processes; Various
applications of data science
Mathematical Foundations for Data Science: Learn about concepts in linear algebra and use it
as a platform to model physical problems; Analytical and numerical solutions of linear equations;
Mathematical structures, concepts, and notations used in discrete mathematics
1 Introduction to Statistical Methods: Learn about basic and some advanced concepts of 8
probability and statistics; Concepts of statistics in solving problems arising in data science
Data Mining: Learn about data pre-processing & cleaning; Association rule mining, classification,
clustering techniques.
Machine Learning: Learn about basic concepts and techniques of Machine Learning; Using recent
machine learning software for solving practical problems; How to do independent study and
research in the field of Machine Learning
Data Visualization and Interpretation: Learn about design principles, human perception and
effective storytelling with data; Modern visualization tools and techniques
Graphs - Algorithms and Mining: Learn about concepts of graph theory to understand; How Graph
theory concepts are used in different contexts, ranging from puzzles and games to social sciences/
engineering/ computer science; Model problems in real-world using graphs; Applying mining
algorithms to get information from graph structures
2 Advanced Topics in Data Processing: Learn about advanced strategies for data processing; The 8
relationship between the scale of data and the systems used to process it; The importance of
scalability of algorithms as the size of datasets increase
Information Retrieval: Learn about structure and organization of various components of an IR
system; Information representation models, term scoring mechanisms, etc. in the complete search
system; Architecture of search engines, crawlers, and the web search; Cross-lingual retrieval and
multimedia information retrieval
Deep Learning: Learn about deep learning techniques, constructing deep network structures
3 specific to applications and tuning for parameters
8
Natural Language Processing: Learn about natural language processing techniques such as Parts-
of-Speech tagging, syntactic and semantic modeling of languages
4 Artificial and Computational Intelligence : Learn about classic AI Techniques 8
Probabilistic Graphical Models : Learn about representation, learning and reasoning techniques for
graphical models
Big Data Systems: Learn about concepts related to big data and its processing; Applying the
5 concepts of storage, retrieval, interfaces and processing frameworks to a given problem and design 8
solutions for the same by choosing the relevant ones.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Outcome:
 Identify and describe the methods and techniques commonly used in data science.
 Demonstrate proficiency with the methods and techniques for obtaining, organizing, exploring, and analysing
data.
 Recognize how data analysis, inferential statistics, modeling, machine learning, and statistical computing can be
utilized in an integrated capacity.
 Create and modify customizable tools for data analysis and visualization per the evaluation of characteristics of
the data and the nature of the analysis.
 Demonstrate the ability to clean and prepare data for analysis and assemble data from a variety of sources.

Text Books:
 An introduction to Data Science by Jeffrey Stanton
 The Elements of Data Analytic Style by Jeff Leek
 Exploratory Data Analysis with R, by Roger Peng
 OpenIntro Statistics, by Diez, Barr, and Centinkaya-Rundel
 R Programming for Data Science, by Roger Peng

Reference Books:
 Jojo Moolayil, “Smarter Decisions : The Intersection of IoT and Data Science”, PACKT, 2016.
 Cathy O’Neil and Rachel Schutt , “Doing Data Science”, O'Reilly, 2015.
 David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data Analytics”, EMC 2013
 Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big Data Analytics”, IGI Global.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Data Analytics Lab Using 'R' Course Code: ETUCCS306P

Semester: 3 L T P C
0 0 2 1

List of Experiments:

 To perform the basic mathematical operations in r programming

 Implementation of vector data objects operations
 Implementation of matrix, array and factors and perform va in R
 Implementation and use of data frames in R
 Create Sample (Dummy) Data in R and perform data manipulation with R
 Study and implementation of various control structures in R
 Data Manipulation with dplyr package
 Data Manipulation with data.table package
 Study and implementation of Data Visualization with ggplot2
 Study and implementation data transpose operations in R
Laboratory Outcomes:
Upon successful completion of this course, student will be able

 Install, Code and Use R Programming Language in R Studio IDE to perform basic tasks on Vectors,
Matrices and Data frames.
 Describe key terminologies, concepts and techniques employed in Statistical Analysis.
 Define, Calculate, Implement Probability and Probability Distributions to solve a wide variety of
problems.
 Conduct and Interpret a variety of Hypothesis Tests to aid Decision Making.
 Understand, Analyse, Interpret Correlation and Regression to analyse the underlying relationships
between different variables.
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Cloud Computing Course Code: ETUICS305T

Semester: 3 L T P C
3 0 0 3

Course Objectives:
 This course gives students an insight into the basics of cloud computing along with virtualization, cloud computing
is one of the fastest growing domain from a while now. It will provide the students basic understanding about
cloud and virtualization along with it how one can migrate over it.

Unit Content Hours

CLOUD COMPUTING LANDSCAPE: Cloud impact in our lives, Cloud enterprise adoption,
Cloud services, Summary & resources
1 CLOUD INDUSTRY ADOPTION: Drivers for Digital Transformation, Cloud Impact in Banking,
9
Cloud Impact in Education, Summary & resources
API PLATFORM REVOLUTION: Cloud Culture of Change, API Platforms Landscape, APIs
driving the Cloud platform revolution, Summary & resources
DATA IN THE CLOUD
2 Where and how will data be used?, Why use NoSQL?, Attributes of NoSQL databases, Summary 18
& resources
CLOUD AND AI: AI Industry Adoption, AI Evolution, Empowered Cloud Apps with AI,
Summary & resources
CLOUD FOR MULTI-CHANNEL: The Need for a Multi-channel platform, Multi-channel
platform characteristics, Rapid and Intelligent, Summary and resources
CLOUD SECURITY: Cloud Security landscape, Security concerns in microservices, OAuth
3 protocol, Summary & resources
18
DEVOPS FRAMEWORK: What is DevOps?, DecOps Agile Culture, DevOps Lifecycle,
Summary & resources

Course Outcome:
 Understand the evolution and impact of cloud computing in the world today
 Understand the evolution and impact of cloud computing in the world today
 Explore end-to-end case studies for every key cloud industry and identify common patterns: public cloud, private
cloud, hybrid cloud
 Understand technical aspects of cloud solutions: software as a service, platform as services and infrastructure as
a service
 Build cognitive solutions, leveraging AI and data science in cloud solutions.
 Understand industry practices to design and build agile cloud solutions, using the cloud Garage methodology
 Work in teams jointly exploring real-world cloud scenarios
 Prototype bespoke cloud solutions leveraging industry-proven concepts, technologies and mythologies

Text Books:
 Zen of Cloud Learning Cloud Computing by Examples by Haishi Bai
 Cloud Computing, A Practical Approach by Toby Velte, Anthony Velte, Robert Elsenpeter
 Cloud and Distributed Computing: Algorithms and Systems by Rajiv Misra, Yashwant Singh Patel

Reference Books:
 https://journals.sagepub.com/doi/full/10.1155/20
 https://www.ibm.com/in-en/cloud
 Link: https://www.ibm.com/in-en/clo
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: DevOps Course Code: ETUICS305P

Semester: 3 L T P C
0 0 2 1
List of Experiments:
Create an IBM Cloud Account
ACME AIRLINE CLOUD ADOPTION
Prepare your Environment
Creating an APP
Developing an App
Acme Business Case- Preparing the APP
Prepare Your Environment
Creating an App
Developing an App
Acme Business Case – Preparing the App
MAINTENANCE CREW CLOUD APP
Digital App Builder Data Sets
Cloud Management
Return to the Digital App Builder
Preview Dataset in Action
ADD AI TO MAINTENANCE CREW APP
Create Cloud Cognitive Services
Connect Services to your App
Train and Implement Cognitive Services
ADD MULTI-CHANNEL SUPPORT
Android Studio
Enabling Android in Digital App Builder
Preview your APP in Android Device
SECURE THE MAINTENANCE CREW APP
Login Security
Mobile Phone Authorization
Test new security functionality
EXPLORE TOOLCHAINS
Enable Toolchains
Create and Explore the Garage Method
Finalize the Creation of Toolchain
Agile Planning
Continuous Integration and Delivery
Manage IBM Cloud Apps
Manage App Using New Relic & PagerDuty
Slack and PagerDuty Integration
Learn from Users
DEVELOP & TEST MICROSERVICES
Create Microservices Toolchain
Configure Tool Integrations
Configure Tool Integrations
View Build & Deployment Actibity
Manager Access
Configure Pager Duty
Submit an Issue
Modify Code
IDENTIFY AN ERROR
Fix the Problem and Deploy
Fix the Problem and Deploy
Explore the DevOps Insights
Improve Deployment Management
Improve Visibility
Delete Tools and Artifacts
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Introduction to Cyber Security Course Code: ETUACS309T

Semester: 3 L T P C
2 0 0 0

Course Objective:

The Cyber security Course will provide the students with foundational Cyber Security principles, Security architecture,
risk management, attacks, incidents, and emerging IT and IS technologies. Students will gain insight into the importance
of Cyber Security and the integral role of Cyber Security professionals. Cyber law is also referred to as the Law of the
Internet. These cyber laws help businesses to prevent any kind of identities and data theft, privacy violation and fraud.

Unit Content Hours

Unit-I: Introduction to Cybercrime: Introduction, Cybercrime: Definition and Origins of the Word,
Cybercrime and Information Security, Who are Cybercriminals? , Classifications of Cybercrimes,
1 8
Cybercrime: The Legal Perspectives, Cybercrimes: An Indian Perspective, Cybercrime and the Indian ITA
2000, A Global Perspective on Cybercrimes
Unit-II: Cyber offenses: How Criminals Plan Them –Introduction, How Criminals Plan the Attacks, Social
Engineering, Cyber stalking, Cyber cafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Vector
2 8
Cloud Computing. Introduction, Proxy Servers and Anonymizers, Phishing, Password Cracking, Key loggers
and Spywares, Virus and Worms, Trojan Horses and Backdoors, Steganography, DoS and DDoS Attacks.
Unit-III: Cybercrime Mobile and Wireless Devices:
Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit Card Frauds in Mobile
and Wireless Computing Era, Security Challenges Posed by Mobile Devices, Registry Settings for Mobile
3 Devices, Authentication Service Security, Attacks on Mobile/Cell Phones, Mobile Devices: Security 8
Implications for Organizations, Organizational Measures for Handling Mobile, Organizational Security Policies
and Measures in Mobile Computing Era, Laptops.
Unit-IV: Cybercrimes and Cyber security:
Why Do We Need Cyber laws: The Indian Context, The Indian IT Act, Challenges to Indian Law and
4
Cybercrime Scenario in India, Consequences of Not Addressing the Weakness in Information Technology Act,
8
Digital Signatures and the Indian IT Act, Information Security Planning and Governance, Information Security
Policy Standards, Practices, The information Security Blueprint, Security education, Training and awareness
program, Continuing Strategies

Text Books:

 Cyber Security: Understanding Cyber Crimes, Computer Forensics and Legal Perspectives, Nina Godbole,
Sunit Belapure, Wiley.
 Principles of Information Security, Micheal E.Whitman and Herbert J.Mattord, Cengage Learning.

Reference Books:
 Information Security, Mark Rhodes, Ousley, MGH
 Syllabus for Bachelor of Technology (CS) Second Year

Course Title: Design Thinking Course Code: ETUCAS310P

Semester: 3 L T P C
0 0 2 1

Course Objective(s):
The objective of this Course is to provide the new ways of creative thinking and Learn the innovation cycle of Design
Thinking process for developing innovative products which useful for a student in preparing for an engineering career.

Course Content:
Unit 1: An Insight to Learning: Understanding the Learning Process, Kolb’s Learning Styles, Assessing and Interpreting

Unit 2: Remembering Memory: Understanding the Memory process, Problems in retention, Memory enhancement
techniques

Unit 3: Emotions: Experience & Expression: Understanding Emotions: Experience & Expression, Assessing Empathy,
Application with Peers

Unit 4: Basics of Design Thinking: Definition of Design Thinking, Need for Design Thinking, Objective of Design
Thinking, Concepts & Brainstorming, Stages of Design Thinking Process (explain with examples) – Empathize, Define,
Ideate, Prototype, Test

Unit 5: Being Ingenious & Fixing Problem: Understanding Creative thinking process, Understanding Problem Solving,
Testing Creative Problem Solving

Unit 6: Process of Product Design: Process of Engineering Product Design, Design Thinking Approach, Stages of Product
Design, Examples of best product designs and functions, Assignment – Engineering Product Design

Unit 7: Prototyping & Testing: What is Prototype? Why Prototype? Rapid Prototype Development process, Testing, Sample
Example, Test Group Marketing

Unit 8: Celebrating the Difference: Understanding Individual differences & Uniqueness, Group Discussion and Activities
to encourage the understanding, acceptance and appreciation of Individual differences

Unit 9: Design Thinking & Customer Centricity: Practical Examples of Customer Challenges, Use of Design Thinking to
Enhance Customer Experience, Parameters of Product experience, Alignment of Customer Expectations with Product
Design

Unit 10: Feedback, Re-Design & Re-Create: Feedback loop, Focus on User Experience, Address “ergonomic challenges,
User focused design, rapid prototyping & testing, final product, Final Presentation – “Solving Practical Engineering
Problem through Innovative Product Design & Creative Solution”.

Course Outcomes (CO):

Student will able to
1. Compare and classify the various learning styles and memory techniques and Apply them in their engineering
education
2. Analyze emotional experience and Inspect emotional expressions to better understand users while designing
innovative products
3. Develop new ways of creative thinking and Learn the innovation cycle of Design Thinking process for developing
innovative products
4. Propose real-time innovative engineering product designs and Choose appropriate frameworks, strategies,
techniques during prototype development
5. Perceive individual differences and its impact on everyday decisions and further Create a better customer experience