Minor courses offered by the Department of Computer Science & Engineering

Contact
S.No. Cat. Course Credits Remarks
hours
1. CEE Computer Organization CSN14001 4 4
2. CEE Object Oriented Programming CSN14002 4 4
3. CES Analysis of Algorithms CSN15001 4 4
4. CES Operating System CSN15002 4 4
5. CES Database Management System CSN16001 4 4
6. PCE Machine Learning with Python CSN17001 4 4

Honors courses offered by the Department of Computer Science & Engineering

Contact
S.No. Cat. Course Credits Remarks
hours
1. CEE Network Security CSN15003 4 4
Network Protocol Design & Implementation
2. CES 4 4
CSN15004
3. CEE Advanced Computer Network CSN16002 4 4
4. CES Software Defined Networking CSN16003 4 4
5. CES Data Center Networking CSN16004 4 4
6. CEE Distributed Ledger Technology CSN17002 4 4
7. CES IOT Security & Trust CSN17003 4 4
8. CEE IOT, ML and Deep Learning CSN17004 4 4

Research courses offered by the Department of Computer Science & Engineering

Contact
S.No. Cat. Course Credits Remarks
hours
Introduction to Bioinformatics and Genomics
1. CES 4 4
CSN15005
2. CEE Soft Computing CSN15006 4 4
3. CEE Data Security and Application Security CSN16005 4 4
4. CEE Data Analytics CSN16006 4 4
5. CES High Performance Computing CSN16007 4 4
6. CEE Big Data CSN17005 4 4
7. CES Medical Image Processing CSN17006 4 4

10 | P a g e
Course Works in Minor Basket

115 | P a g e
 Database Management System
Syllabus

Prerequisite: Basic of Data Structures.

L-T-P: 3-0-2, Credits: 4 Type: Core Essential Subjects (CES)

Course Description
In this course students will study the basic functions and capabilities of database management systems
(DBMS). Emphasis is placed on the use of DBMS in solving information processing problems which will
include database design case studies as well as SQL programming assignments along with transactions. A
lab course is associated with it to strengthen the concepts.
Course Objective

Students undergoing this course are expected to:

1 Understand the basic concepts and the applications of database systems.
2 Understand the relational database design principles.
3 Master the basics of SQL and construct queries using SQL.
4 Familiar with the basic issues of transaction processing and concurrency control.
5 Familiar with database storage structures and access techniques.

Course Outcomes
CO Course Outcomes (Action verb should be in italics) Bloom’s taxonomy
Numbers
CO-1 Demonstrate the basic elements of a relational database Identify/Knowledge
management system.
CO-2 Design entity relationship and convert entity relationship Creating
diagrams into RDBMS.
CO-3 Create SQL queries on the respect data into RDBMS and Analyzing/ Creating
formulate SQL queries on the data by understanding the
concepts of normalization and query optimization.
CO-4 Apply and Relate the concept of transaction, concurrency Applying
control and recovery in database.
CO-5 Recognize and Identify the use of indexing and hashing Understanding/Compre
technique used in database design. hension

Mapping Course Outcomes with Program Outcomes:

Correlation Matrix
Note: Enter numbers 1, 2 or 3, where the correlation levels are matching
4. Slightly (Low)
5. Moderately (Medium)
6. Substantially (High)
If there is no correlation, the cell is to be left blank or put (-).

Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10
Outcomes
CO1 2 - - 2 1 - - - 2 2
CO2 2 - 2 2 2 - - - - 2
CO3 1 2 2 2 2 - 1 2 - 1

116 | P a g e
 CO4 - - - 3 3 - 2 - 1 -
CO5 1 3 2 - - 3 - - - 1
CO
(Average)
1.2 1.0 1.2 1.8 1.6 0.6 0.3 0.4 0.6 1.2
Course
Average

Syllabus

UNIT-I: Database system concept and architecture, Entity Relationship and Enhanced E-R.
UNIT-II:Relational Data Model and Relational Algebra, SQL, Indexing, Query Optimization.
UNIT III: Relational Database Design, Normalization principles and normal forms.
UNIT IV: Transaction concept and concurrency control.
UNIT V: Data storage, indexing, query processing and physical design.
UNIT VI: DBMS: Case Study

Text Books

1. Silberschatz, Abraham, Henry F. Korth, and Shashank Sudarshan. Database system concepts. Vol.
4. New York: McGraw-Hill, 1997.
2. Elmasri, R., et al. Fundamentals of Database Systems. Addison-Wesleypublisher, 2000.
3. Garcia-Molina, Hector, Jeffrey D. Ullman, and Jennifer Widom. Database system implementation. Vol.
672. Upper Saddle River, NJ:: Prentice Hall, 2000.
4. Ramakrishnan, Raghu, Johannes Gehrke, and Johannes Gehrke. Database management systems.
Vol. 3. New York: McGraw-Hill, 2003.

Reference Books

1. Garcia-Molina, Hector. Database systems: the complete book. Pearson Education India, 2008.

2. Garcia-Molina, Hector, Jeffrey D. Ullman, and Jennifer Widom. Database system implementation. Vol.
672. Upper Saddle River, NJ:: Prentice Hall, 2000.

117 | P a g e
 Operating System
Syllabus

Prerequisite: Computer Programming, Data Structures and Computer Organization

L-T-P: 3-0-2, Credits: 4 Type: Core Essential Subjects (CES)
Course Description
In this course students will study the basic facilities provided in modern operating systems. The emphasis
will be on understanding general concepts that are applicable to a wide range of operating systems, rather
than a discussion of the features of any one specific system. However, for gaining in-depth knowledge the
pedagogical operating systems such as XV6 can be used to demonstrate the working at code level. Topics
that will be covered in the course include protected kernels, processes and threads, concurrency and
synchronization, memory management, virtual memory, file systems, secondary storage, protection, and
security.
Course Objectives

Students undergoing this course are expected to:

1 gain extensive knowledge on principles and modules of operating systems
2 understand key mechanisms in design of operating systems modules
3 understand process management, concurrent processes and threads, memory management, virtual
memory concepts, deadlocks
4 compare performance of processor scheduling algorithms
5 produce algorithmic solutions to process synchronization problems
6 use modern operating system calls such as Linux process and synchronization libraries
Course Outcomes
CO Bloom’s
Course Outcomes (Action verb should be in italics
Numbers taxonomy
Demonstrate the knowledge of Operating Systems both at system call Identify/
CO-1
level and code level. Knowledge
Compare and analyze the different implementation approach of Creating/
CO-2
system programming and operating system abstractions. Analyzing
Analyzing,
CO-3 Formulate synchronization problem and develop the solution for same
Creating
CO-4 Interpret various OS functions used in different operating systems. Applying
Understanding/Co
CO-5 Learning about real life applications of Operating System in every field.
mprehension

Mapping Course Outcomes with Program Outcomes

Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10
Outcomes
CO1 2 - - - - 2 - - - 2
CO2 - - - - - - 2 - - -
CO3 - - - - - - - - - -
CO4 - 3 - - - - - - - -
CO5 2 - - - - - - - - 2
CO (Average)
0.8 0.6 - - - 0.4 0.4 - - 0.8
Course Average
3-High, 2-Medium, 1-Low

118 | P a g e
 Syllabus

UNIT-1: Introduction and Overview

UNIT-II:Process fundamentals, scheduling, synchronization.

UNIT III:Inter-process communication, Deadlock.

UNIT IV:Memory management and virtual memory.

UNIT V: File system and secondary storage.

UNIT VI: Protection and security issues, Case studies e.g., Linux, Solaris and Android.

Text Books:

1. Operating Systems, by William Stallings.

2. Operating Systems Concepts by Silberschatz, Galvin, and Gagne.

3. The Design of the UNIX Operating System, by Maurice J. Bach.

4. Advanced Programming in the UNIX Environment, by W. R. Stevens & S. A.Rago.

Reference Books:

1. The Design and implementation of the 4.4 BSD UNIX operating system by Marshall Kirk McKusick,
Keith Bostic, Michael J. Karels, John S. Quarterman.

2. xv6: A simple, Unix-like teaching operating system by Russ Cox, FransKaashoek and Robert
Morris.

119 | P a g e
 Object Oriented Programming

Prerequisite: Basics of Programming

L-T-P: 2-0-2, Credits: 3 Type: Core Elective Subjects (CEL)

Course Description
This is an introductory course, where students learn and practice essential programming skills using the
Java programming language. This course provides an overview of Object Oriented
Programming (OOP) concepts using Java/C++. It helps to understand basic OOP concepts and assist in
applying these concepts. The principles behind OOP discussed. It covers object-oriented principles such as
classes, objects, abstraction, composition, Inheritance, polymorphism, and interfaces. These concepts can
be implemented in the Java language. Along the way, many of the Java library classes are seen that can be
organized to solve a variety of problems. The Java collection classes are studied. Additional topics include
exception handling, database connectivity with JDBC, and multi-threading. The course is programming
intensive. By the end of this course student will able to understand the basics of OOP and be prepared to
take on more complex challenges. A lab course is associated with it to strengthen the concepts.
CO Course Outcomes (Action verb should be in italics) Bloom’s taxonomy
Numbers
CO-1 Understand the Basic concept of Object Orientation, object Understanding/
identity and Encapsulation. Comprehension:
CO-2 Understand the Basic concept of Basic Structural Modeling. Understanding/ Comprehension
CO-3 Know the knowledge of Object-oriented design, Object Identify/Knowledge/Remember
design.
CO-4 Know the knowledge of Basics of Java or C++. Identify/Knowledge/Remember
CO-5 Understand the Basics of object and class in Java or C++. Understanding Analyzing

Mapping Course Outcomes with Program Outcomes:

Correlation Matrix
Note: Enter numbers 1, 2 or 3, where the correlation levels are matching
1. Slightly (Low)
2. Moderately (Medium)
3. Substantially (High)
If there is no correlation, the cell is to be left blank or put (-).
Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10
Outcomes
CO1 2 - - 1 - - - 2 - -
CO2 2 2 - 1 - - - - - -
CO3 2 - 1 - - - - - -
CO4 2 - 1 - - - 2 - -
CO5 1 1 2 1 - - - 1 - -
CO
(Average)
1.8 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 0.0
Course
Average

120 | P a g e
 Syllabus

UNIT I: INTRODUCTION
The meaning of Object Orientation, object identity, Encapsulation, information hiding, polymorphism,
generosity, importance of modeling, principles of modeling, object-oriented modeling, Introduction to UML,
conceptual model of the UML, Architecture.
UNIT II: BASICS OF JAVA OR C++
Core Java: Introduction to Object Oriented Software development through Java. Classes and Objects.
UNIT-III Abstraction, Inheritance, Polymorphism, Nested classes and interfaces, Exceptions, Strings,
Packages, The I/O Package.
UNIT IV:Advanced Java: Event Handling, AWT, Swing, Applets, Multi-Threading, Generic, The collection
frameworks, Introduction to socket programming, Java Database connectivity (JDBC).

TextBooks:
1. Kathy Sierra and Bert Bates, ―Head First Java‖, 2nd edition, O‘Reilly
2. Herbert Schildt , ―Java : The Complete Reference‖, 9th edition, Oracle Press
3. Cay S. Horstmann and Gary Cornell , ―Core Java Volume I & II‖, 10th edition, Prentice-Hall
4. Tony Gaddis, ―Starting Out with Java: From Control Structures through Objects‖, 6th edition,
Pearson
5. David Flanagan, ―Java in a Nutshell‖, 5th edition, O‘Reilly

121 | P a g e
 Analysis of Algorithms
Syllabus

Prerequisite:Engineering Mathematics, Data Structures and Discrete Mathematics

L-T-P: 3-0-0, Credits: 3 Type: Core Essential Subjects(CES)

Course Description
Algorithms are recipes for solving computational problems. This course teaches techniques for the design
and analysis of efficient algorithms for various applications, emphasizing methods useful in practice.
Course Objective

Students undergoing this course are expected to:

1 To understand the problems in computing
2 To use/design the most efficient of the available/suitable techniques to solve these problems
3 To obtain efficiency of the algorithm is to be analyzed in the domains of time, space and energy
4 A lab course is also associated with it to strengthen the concepts.

Course Outcomes
CO Course Outcomes (Action verb should be in italics) Bloom’s taxonomy
Numbers
CO-1 Apply knowledge of computing and mathematics for Applying
designing and implementing problem solving algorithms.
CO-2 Analyze the best, average and worst-case performance of Analyzing
the algorithms using asymptotic bounds.
CO-3 Choose and apply best suitable algorithm to find optimal Creating/Applying
solution of engineering problems
CO-4 Demonstrate a familiarity with various classes of algorithms Identify/Knowledge
and data structures.
CO-5 Realize the limits of computer algorithms via P, NP and NP- Identify/Knowledge
complete problems.

Mapping Course Outcomes with Program Outcomes:

Correlation Matrix
Note: Enter numbers 1, 2 or 3, where the correlation levels are matching
4. Slightly (Low)
5. Moderately (Medium)
6. Substantially (High)
If there is no correlation, the cell is to be left blank or put (-).

Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10
Outcomes
CO1 3 2 2 2 3 1 - - 1 -
CO2 3 2 3 2 3 2 1 2 - -
CO3 3 2 3 2 3 2 1 - -
CO4 3 3 2 2 3 1 - - 1 -
CO5 3 2 3 2 3 3 - - 2 3

122 | P a g e
 CO
(Course 3.0 2.2 2.6 2.0 3.0 1.8 0.4 0.4 0.8 0.6
Average)

Syllabus

UNIT 1: Sorting and complexity analysis: Time and Space Complexity, Different Asymptotic notations and
their mathematical significance. Analysis of sorting algorithms of different complexity classes. Heaps, Heat
Sort and Priority Queues.
Divide and Conquer Algorithms: Binary Search, Merge sort, Multiplication of Large Integers, Closest Pair,
Strassen‘s Algorithm, Recurrences and Masters‘ Method, Quick Sort and Order Statistics.
UNIT II: Greedy Algorithms with Graph Recapitulation: Graph representation and Traversals, Minimum
Spanning Trees and Shortest Paths in a Graph, Dial‘s Algorithm, Travelling Salesman Problem, Knapsack
Problem, Job Sequencing Problem, Vertex Cover Problem, Maximum Network Flow, Huffman Coding and
Encoding, Coin Change Problem, Discussion on Load Balancing Problem.
UNIT III: Dynamic Programming: Principle of Optimality, Cases where Greedy Algorithms Fails, 0/1
Knapsack, Coin Change Problem, Matrix Chain Multiplication, Optimal Binary Search Tree, Longest
Common Subsequence, All-pairs Shortest Path Problem, Rod Cutting Problem, Memorization.
Backtracking: Hamiltonian Cycle, N-Queens Problem, Maze Problem, Sum of Subset Problem, Designing
Generic Backtracking Algorithm.
UNIT IV: Number Theoretic Algorithms: The GCD, Modular Arithmetic, Chinese Remainder Theorem,
Cyclic Groups, Linear Programming and Duality, Primality Testing.
Text Processing: Naïve String Matching, Rabin Karp Algorithm, String Matching using Finite Automata,
KMP Algorithm.
UNIT V: NP-Completeness and Approximation algorithm:
P class, NP class, NP hard class, NP complete class – their interrelationship, Satisfiability Problem and
Reducibility Examples. Necessity of Approximation Scheme, Polynomial Time Approximation with
Examples.

Text Books

1. Cormen, Thomas H., et al. Introduction to algorithms. MIT press, 2009.

2. Horowitz, Ellis, SartajSahni, and Susan Anderson-Freed. Fundamentals of data structures. Vol. 20.
Potomac, MD: Computer science press, 1976.
3. Sedgewick, Robert, and Philippe Flajolet. An introduction to the analysis of algorithms. Pearson
Education India, 2013.

Reference Books

1. Levitin, Anany. Introduction to Design and Analysis of Algorithms, 2/E. Pearson Education India,
2008.
2. Kozen, Dexter C. The design and analysis of algorithms. Springer Science & Business Media, 1992.

123 | P a g e
 Machine Learning with Python
Syllabus

Prerequisite: Computer Programming, Basics of Mathematics and Statistics

L-T-P: 3-0-0,Credits: 3 Type: Core Elective (CEL)

Course Description
This course contents various machine learning algorithms and its application in real life. Its contents
supervised, unsupervised, reinforcement learning, clustering, bayes theorem concept and application of
machine learning.
Course Objectives
Students undergoing this course are expected to:
1 This course is designed for students: To introduce the fundamental concepts of machine
learning and its applications.
2 Students may explore the understanding of machine learning with their underlying
mathematical concepts, issues and challenges, including data, model selection, model
complexity, strengths and weaknesses and their relevant applications.

Course Outcomes
CO
Course Outcomes (Action verb should be in italics) Bloom’s taxonomy
Numbers
CO-1 Understanding the nature of data, and model selection. Identify/Knowledge
CO-2 Describe the various classification algorithms. Comprehension
Develop and apply clustering base algorithm for finding
CO-3 Applying
relationships between data variables.
Understanding of back propagation algorithm for the training of
CO-4 Understanding
neural networks
Design and implement various machine learning algorithms in a
CO-5 Creating
range of real-world applications.

Mapping Course Outcomes with Program Outcomes:

Correlation Matrix
Note: Enter numbers 1, 2 or 3, where the correlation levels are matching
1. Slightly (Low)
2. Moderately (Medium)
3. Substantially (High)

Course
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10
Outcomes
CO1 2 3 3 2 3 - - - - -
CO2 2 3 3 2 3 - - - - -
CO3 2 3 3 3 3 1 - - - -
CO4 3 3 3 3 3 - - - - -
CO5 2 3 3 3 3 2 - - 2 -
CO
(Course 2.2 3 3 2.6 3 0.6 - - 0.4 -
Average)

124 | P a g e
 Syllabus

UNIT I: Introduction to Machine Learning; Supervised Learning, Unsupervised Learning, Reinforcement

Learning, Machine learning basics: capacity, over fitting and under fitting, hyper parameters and validation
sets, bias & variance.
UNIT II: Bayes Theorem Concept Learning Maximum Likelihood classifier, Bayesian Belief Networks,
Decision-trees, univariate and multivariate decision tree, network equivalent of decision trees, over fitting
and evaluation.
UNIT III: Logistic Regression, Support Vector Machine, Kernel function and Kernel SVM, Instant based
Learning: k- Nearest Neighbor, locally weighted Regression, Radial Bases Functions; Case Based Learning.
UNIT IV: Clustering: k-means, adaptive hierarchical clustering, and Gaussian mixture model, Neural
network: Perception, multilayer network, back propagation.
UNIT V: Applications of machine learning (Case studies): Business Analytics, Natural language processing,
Computer vision, Internet of Things, bio-informatics etc.

Text Books
1. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
2. Mohri, M., Rostamizadedh, A., and Talwalkar, A., Foundations of Machine Learning, The MIT Press
(2012)

Reference Books
1. EthemAlpaydin, (2004) ―Introduction to Machine Learning (Adaptive Computation and Machine
Learning)‖, The MIT Press
2. T. astie, R. Tibshirani, J. H. Friedman, ―The Elements of Statistical Learning‖, Springer (2nd ed.),
2009

125 | P a g e
 Computer Organization
Syllabus

Prerequisite: Basic knowledge prior to digital electronics, Basic functional units of a computer system
L-T-P: 3-0-0, Credits: 3Type: Core Essential Subjects (CES)

Course Objectives

Students undergoing this course are expected to:

This course will discuss the basic concepts of computer architecture and organization that can help
1 the participants to have a clear view as to how a computer system works. Examples and
illustrations will be mostly based on a popular Reduced Instruction Set Computer (RISC) platform.
This course qualitatively and quantitatively examines computer design trade-offs and teaches the
2 fundamentals of computer architecture and organization, including CPU, memory, registers,
arithmetic unit, control unit, and input/output components
3 Understand the fundamentals of computer architecture.
4 Design and implement single-cycle and pipelined data paths for a given instruction set architecture.
Understand the performance trade-offs involved in designing the memory subsystem, including
5
cache, main memory and virtual memory.

Course Outcomes
CO
Course Outcomes (Action verb should be in italics) Bloom’s taxonomy
Numbers
Study of the basic structure and operation of a digital Computer
CO-1 Identify/Knowledge
system.
Analysis of the design of arithmetic & logic unit and understanding of
CO-2 Analyzing
the fixed point and floating-point arithmetic operations.
Implementation of control unit techniques and the concept of
CO-3 Applying
Pipelining
Understanding the hierarchical memory system, cache memories
CO-4 Analyzing/understanding
and virtual memory
Understanding the different ways of communicating with I/O devices
CO-5 Understanding
and standard I/O interfaces

Mapping Course Outcomes with Program Outcomes

Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10
CO1 2 2 1 1 2 2
CO2 3 3 2 2 1 2
CO3 2 1 1 3 2 2 2 1
CO4 3 1 3 3 1 2 2
CO5 1 2 1 2
CO (Average) Course
2.2 1.8 1.6 1.8 1.6 1.2 - - 0.4 1
Average
3-High, 2-Medium, 1-Low

126 | P a g e
 Syllabus

UNIT 1: Introduction: Functional units of digital system and their interconnections, buses, bus architecture,
types of buses and bus arbitration. Register, bus and memory transfer. Processor organization, general
registers organization, stack organization and addressing modes.
UNIT II: Arithmetic and logic unit: Look ahead carries adders. Multiplication: Signed operand
multiplication, Booths algorithm and array multiplier. Division and logic operations. Floating point arithmetic
operation, Arithmetic & logic unit design. IEEE Standard for Floating Point Numbers.
Unit III: Control Unit: Instruction types, formats, instruction cycles and sub cycles (fetch and execute etc),
micro operations, execution of a complete instruction. Program Control, Reduced Instruction Set Computer,
Pipelining. Hardwire and micro programmed control: micro programme sequencing, concept of horizontal
and vertical microprogramming.
Unit IV: Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 ½ D memory
organizations. ROM memories. Cache memories: concept and design issues & performance, address
mapping and replacement Auxiliary memories: magnetic disk, magnetic tape and optical disks Virtual
memory: concept implementation.
UNIT V: Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types of
interrupts and exceptions. Modes of Data Transfer: Programmed 1/0, interrupt initiated 1O and Direct
Memory Access., I/O channels and processors. Serial Communication: Synchronous & asynchronous
communication, standard communication interfaces.

Text Books
1. Computer System Architecture - M. Mano
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill Fifth Edition,
Reprint 2012
3. John P. Hayes, Computer Architecture and Organization, Tata McGraw Hill, Third Edition, 1998,
Reference books
4. William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson
Education, Seventhedition, 2006.
Reference Books
1. Behrooz Parahami, ―Computer Architecture‖, Oxford University Press, Eighth Impression, 2011.
2. Fundamentals of Microprocessors & Microcontrollers by B.RAMDHANPAT RAI PUBLICATIONS,
NEW DELHI
3. David A. Patterson and John L. Hennessy, ―Computer Architecture-A Quantitative Approach‖,
Elsevier, a division ofteed India Private Limited, Fifth edition, 20121
4. Swati Saxena Computer Organization, Dhanpat Rai Publications, NEW DELHI

127 | P a g e