DEPARTMENT

OF
INFORMATION TECHNOLOGY, SMIT, MAJITAR

COURSE CURRICULUM FOR B.TECH (IT)

ACCORDING TO
NATIONAL EDUCATION POLICY-2020

APPLICABLE FOR

1ST YEAR FROM 2024-25 BATCH AND SUBSEQUENT BATCHES

ALSO, FOR 2023 BATCH (2ND YEAR ONWARDS)

Total Credits:

21+21+27 + 26 + 28 + 26 + 18 +13 = 180

{

1st Year
 FIRST YEAR B. TECH CURRICULUM 2024 (Common to all branches)
GROUP A (FIRST SEMESTER) GROUP B (FIRST SEMESTER
PHYSICS GROUP CHEMISTRY GROUP
Semester

Sub. Subject Name L T P C Sub. Subject Name L T P C

Cod Cod
e e
Engineering Mathematics–I 3 1 0 4 Engineering 3 1 0 4
Mathematics–I
Elements of Civil Engineering 2 1 0 3 Element of Mechanical 2 1 0 3
Engineering
I Engineering Physics 3 1 0 4 Engineering Chemistry 3 1 0 4
Basic Electronics 2 1 0 3 Element of Electrical 2 1 0 3
engineering
Communication Skills 2 0 0 2 CS101A1 Computer Programming 3 1 0 4
in C
Engineering Graphics 1 0 2 2 Environmental Science 2 0 0 1
Constitution of India 2 0 0 1
Workshop Practice 0 0 2 1 CS101A4 Computer Programming 0 0 2 1
Lab
Engineering Physics Lab 0 0 2 1 Engineering Chemistry 0 0 2 1
Lab
15 4 6 21 15 5 4 21
Total Contact Hours (L + T + P) 25 Total Contact Hours (L + T + P) 24
*Mandatory audit course *Mandatory audit course
GROUP A (SECOND SEMESTER) GROUP B (SECOND
SEMESTER)
Engineering Mathematics–II 3 1 0 4 Engineering 3 1 0 4
Mathematics–II
Element of 2 1 0 3 Elements of Civil 2 1 0 3
II Mechanical Engineering
Engineering
Engineering Chemistry 3 1 0 4 Engineering Physics 3 1 0 4
Element of 2 1 0 3 Basic Electronics 2 1 0 3
Electricalengineering
CS101A1 Computer Programming in C 3 1 0 4 Communication Skills 2 0 0 2
Environmental Science 2 0 0 1 Engineering Graphics 1 0 2 2
Constitution of India 2 0 0 1
CS101A4 Computer Programming Lab 0 0 2 1 Workshop Practice 0 0 2 1
Engineering Chemistry Lab 0 0 2 1 Engineering Physics Lab 0 0 2 1

15 5 4 21 15 4 6 21
Total Contact Hours (L + T + P) 24 Total Contact Hours (L + T + P) 25

Note: UHV–I has been introduced under Mandatory Induction Program.

 B.TECH. COURSE STRUCTURE – SEMESTER WISE
THIRD SEMESTER
Year Course Course Title Total Number of Contact Hours Credits
Code Lecture Tutorial Practical Total
(L) (T) (P) Hours
MA205A1 Discrete Mathematics 3 1 0 4 4
IT211A1 Digital Design and 3 1 0 4 4
Computer
Organization
IT212A1 Data Structures 3 1 0 4 4
IT213A1 Object Oriented 3 1 0 4 4
Programming
using C++
IT2**A3 Program Elective-I 3 1 0 4 4
2nd IT2**A2/ Open Elective-I/Minor/NCC 3 1 0 4 4
IT2**A8
IT214A4 Data Structures Laboratory 0 0 2 2 1
IT215A4 Object Oriented 0 0 2 2 1
Programming using
C++ Laboratory
IT216A5 Project Based Learning- I 0 0 2 2 1
TOTAL 18 6 6 30 27

FOURTH SEMESTER
Year Course Course Title Total Number of Contact Hours Credits
Code Lecture Tutorial Practical Total
(L) (T) (P) Hours
MA206A1 Probability, Statistics, and 3 1 0 4 4
Stochastic Processes
IT221A1 JAVA Programming 3 1 0 4 4

IT222A1 Database Management 3 1 0 4 4

Systems
IT2**A3 Program Elective-II 3 1 0 4 4

IT2**A2/ Open Elective-II/Minor/NCC 3 1 0 4 4

2nd IT2**A8
GN201A1 Universal Human 3 0 0 3 3
Values- II
Understanding
harmony and Ethical
Human Conduct
IT223A4 JAVA Programming 0 0 2 2 1
Laboratory
IT224A4 Database Management 0 0 2 2 1
Systems Laboratory
IT225A5 Project Based Learning- II 0 0 2 2 1
TOTAL 18 5 6 29 26
 FIFTH SEMESTER
Year Course Course Title Total Number of Contact Hours Credits
Code Lecture Tutori Practica Total
(L) al l (P) Hour
(T) s
IT311A1 Artificial Intelligence 3 1 0 4 4

IT312A1 Formal Languages and 3 1 0 4 4

Automata Theory
IT313A1 Computer Networks 3 1 0 4 4

IT314A1 Software Engineering 3 1 0 4 4

IT3**A3 Program Elective-III 3 0 0 3 3

3rd IT3**A2/ Open Elective- 3 1 0 4 4

IT3**A8 III/Minor/NCC
IT315A4 Artificial Intelligence 0 0 2 2 1
Laboratory
IT316A4 Computer Network 0 0 2 2 1
Laboratory
GN301A1 Quantitative Aptitude and 1 0 0 1 1
Logical Reasoning -I
IT317A5 Project Based Learning- III 0 0 2 2 1
IT318A9 Industrial Training-I 0 0 2 2 1
TOTAL 18 6 8 32 28

SIXTH SEMESTER
Year Course Course Title Total Number of Contact Hours Credit
Code Lectu Tutori Practica Total s
re al l (P) Hour
(L) (T) s
BA346A1 Industrial Management 2 0 0 2 2
IT321A1 Operating System 3 1 0 4 4
IT322A1 Web Technology and Web 3 1 0 4 4
Services
IT3**A3 Program Elective-IV 3 1 0 4 4
IT3**A3 Program Elective-V 3 1 0 4 4
3rd IT3**A2/ Open Elective-IV /Minor 3 1 0 4 4
IT3**A8
IT323A4 Operating System Laboratory 0 0 2 2 1
IT324A4 Web Technology and Web 0 0 2 2 1
Services Laboratory
GN302A1 Quantitative Aptitude and 1 0 0 1 1
Logical Reasoning -II
IT325A5 Mini Project 0 0 2 1 1
TOTAL 16 5 08 31 26
 SEVENTH SEMESTER
Year Course Course Title Total Number of Contact Hours Credit
Code Lectu Tutori Practic Total s
re al al Hour
(L) (T) (P) s
IT4**A2/ Open Elective-V/Minor 3 1 0 4 4
IT4**A8
4th IT4**A2 Choice-Based Elective 3 0 0 3 3
IT411A6 Major Project -Phase-I 0 0 20 20 10

IT412A9 Industrial Training-II 0 0 2 2 1

TOTAL 6 1 22 29 18
EIGHTH SEMESTER
Year Course Course Title Total Number of Contact Hours Credit
Code Lectu Tutori Practica Total s
re al l (P) Hour
(L) (T) s
4th IT4**A2/ Open Elective-VI /Minor 3 1 0 4 4
IT4**A8
IT421A6 Major Project -Phase-II 0 0 18 18 9
TOTAL 3 1 18 22 13

LIST OF ELECTIVES FOR 3rd SEMESTER

IPROGRAM ELECTIVE-I
Year COURSE COURSE TITLE CREDIT
CODE
IT211A3 Python Programming 4
IT212A3 System Simulation and Modelling 4
IT213A3 Information Systems and Security 4
2nd IT214A3 Microprocessors & Peripheral Devices 4
IT215A3 E-Commerce 4
IT216A3 Soft Skills and Interpersonal Communication 4

LIST OF ELECTIVES FOR 4TH SEMESTER

PROGRAM ELECTIVE-II
Year COURSE COURSE TITLE CREDIT
CODE
2nd IT221A3 Design and Analysis of Algorithms 4
IT222A3 Microcontrollers 4
IT223A3 Computer Graphics 4
 LIST OF ELECTIVES FOR 5TH SEMESTER
PROGRAM ELECTIVE-III
Year COURSE COURSE TITLE CREDIT
CODE
IT311A3 User Interaction(UI)- User Experience(UX) 3
IT312A3 Digital Image Processing 3
3rd IT313A3 Information Retrieval 3
IT314A3 Design Thinking 3
IT315A3 Data Warehousing & Data Mining 3
IT316A3 Big Data Analytics 3
IT317A3 Optimization Techniques 3
IT318A3 Internet of Things (IOT) 3

LIST OF ELECTIVES FOR 6TH SEMESTER

PROGRAM ELECTIVE-IV
Year COURSE COURSE TITLE CREDIT
CODE
IT321A3 Machine Learning 4
IT322A3 Natural language Processing 4
IT323A3 Latest Trends in Information Technology 4
IT324A3 System Programming 4
IT325A3 Bio Inspired Computing 4
IT326A3 Autonomous Mobile Robotics and Computational 4
Intelligence
IT327A3 Real Time Systems 4
IT328A3 Cloud Computing 4
IT337A3 Ad-hoc Wireless Networks 4
IT338A3 High Performance Computing 4
3rd

PROGRAM ELECTIVE-V
IT329A3 Deep Learning 4
IT330A3 Pattern Recognition 4
IT331A3 Web Content Management and Web 3.0 4
IT332A3 Soft Computing 4
IT333A3 Cyber Physical Systems 4
IT334A3 Social Network Analysis 4
IT335A3 Remote Sensing And Geographic Information System 4
IT336A3 Wireless Sensor Networks 4
IT339A3 Augmented Reality 4

LIST OF ELECTIVES FOR 7TH SEMESTER

CHOICE BASED ELECTIVE
Year COURSE COURSE TITLE CREDIT
CODE
IT481A2 Science, Technology and Society 3
4th IT482A2 Essence of Indian Traditional Knowledge 3
OPEN ELECTIVE/ MINOR - Cyber Security
SEMESTER COURSE CODE COURSE TITLE CREDIT
3rd IT210A2/ IT210A8 Introduction to Cryptography 4
th 4
4 IT220A2/ IT220A8 Introduction to Cyber Security
th 4
5 IT310A2/ IT310A8 Cyber Security Solutions
th 4
6 IT320A2/ IT320A8 Cyber Digital Forensics
th 4
7 IT410A2/ IT410A8 Block Chain Technology
8th IT420A2/ IT420A8 Ethical Hacking and Data Privacy 4

OPEN ELECTIVE/MINOR - Multimedia Computing and Communications

SEMESTER COURSE COURSE TITLE CREDIT
CODE
3rd IT219A2/ Multimedia fundamentals 4
IT219A8
4th IT229A2/ Mobile Computing and Communication 4
IT229A8
5th IT319A2/ Digital Signal Processing 4
IT319A8
6th IT329A2/ Multimedia Animation and Modeling 4
IT329A8
7th IT419A2/ Speech Processing 4
IT419A8
8th IT429A2/ Information Theory and Error Correcting Codes 4
IT429A8
 Sub Code: CS101A1 Credit:4 (L-3, T-1, P-0)

Sub Name: Computer Programming Using C

Questions to be set: 05 (All Compulsory)

Course Objectives: The main aim of the course is to teach basic computer programming concepts and
apply them to computer based problem solving methods, to teach the students problem solving using C
and to introduce them to different data structures like stacks, lists, etc.

Pre-requisites: There are no specific prerequisite for this course.

Course Outcomes (CO): On successful completion of this course, students should be able to:

1. Describe the working of hardware and software components necessary for functioning of a computer.
2. Describe the fundamentals of programming syntax and its definition by example of C language.
3. Explain the concepts of branching, loop construct, functions, pointers and structures of C language.
4. Write moderately difficult program for a specific goal.
5. Infer the syntax errors prompted by the C compiler and visualize the output of given code.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs. CO PO PSO
covered
Module in Introduction, Basic anatomy of the computer, ALU, 9 1,2 1
1: class Memory Devices and Memory Types, I/O Devices,
<Module Number Systems & Logic Gates. Levels of
Name> Programming Language, Application Programs,
System Programs,
Operating Systems, Translator, Linker, Loader,
Structured and Object-Oriented Programming,
Algorithms and Flowcharts.
History of C, Basic structure of a C program, Sample
programs, Programming style, Executing a C
program.
Character set, C tokens, Keywords and identifiers,
Constants, variables, Data types, Declaration of
variables, Defining symbolic constants, Declaring a
variable as constant, Declaring a variable as volatile,
Overflow and underflow of data.
**Assignment Declaration of storage class, Assigning of storage
Topics class

Module in Different categories of operators in C language, 9 2,3 1,2 2

2: class Arithmetic expressions, Evaluation of expressions,
<Module Precedence of arithmetic operators, Type
Name> conversions in expression, Operator precedence and
associativity, Mathematical functions. Reading a
character, Writing a character, Formatted input,
Formatted output.
 Decision making with IF statement, Simple IF
statement, IF---ELSE statement, Nesting of IF---
ELSE statement, ELSE IF ladder, Switch statement,
The ? : operator, The GOTO statement. WHILE
statement, DO statement, FOR statement, Jumps in
loops, Concise test expressions.
**Assignment
Topics

Module in One-dimensional arrays: Declaration, initialization 8 2,3 1,2 2

3: class of 1D array, Two dimensional arrays: Declaration,
<Module initialization of 2D array, Declaring and initializing
Name> string variables, Reading strings from terminal,
Writing strings to screen, Arithmetic operations on
strings, Putting strings together, Comparison of two
strings, String handling functions
**Assignment Multidimensional arrays and Dynamic arrays
Topics

Module in class Introduction to Pointers, Accessing a variable 8 3,4 1,2,3 2

4: through its pointer, Chain of pointers, Pointer
<Module expressions, Pointers and arrays, Pointers and
Name> character strings, Array of pointers.

Elements of user defined functions, Definitions of

functions, Return values and their types, Function
calls, Function declaration, Category of functions,
No arguments and no return values, Arguments but
no return values, Arguments with return values, No
Arguments but returns a value, Function that return
multiple values, Nesting of functions, Recursion,
Passing arrays to functions, Passing string to
functions, Scope, Visibility and lifetime of variables,
Pointers and function arguments, Functions
returning pointers, Pointers to functions
Preprocessor Directive – macro substitution.
**Assignment Dynamic Memory allocation- malloc, calloc, free,
Topics realloc, linked list and its applications.

Module in class Defining a structure, Declaration of structure 6 4,5 1,2,3 2

5: variables, Accessing structure members, Structure
<Module initialization, Copying and comparing structure
Name> variables, Operations on individual members, Arrays
of structures.

Defining and opening a file, Closing a file,

Input/output operations on a file, Error handling
during I/O operations, Random access to files,
Command line arguments.
 **Assignment Arrays within structures, Structures within
Topics structures, Structures and functions, Union, Size of
structures, Bit fields, Pointers and structures,
Troubles with pointers.

Text Books:
1. Programming in ANSI C by E. Balaguruswamy

Reference Books:
1. Mastering in C by K. Venugopal.
2. Fundamentals of C by Gottfried.
3. The C Programming by Kerningham and Ritchie.
4. Let Us C by Y. Kanetkar.
 Subject Code: CS101A4 Credit: 1 (L-0, T-0, P-2)

COMPUTER PROGRAMMING LAB

Course Objectives: In Computational practice lab, each student is required to develop programs
based upon each UNIT of Theory paper-Computer Programming using C
• To teach basic computer programming concepts and apply them to computer based problem solving methods.
• To teach the student problem solving using C.
• To introduce the students to the field of programming using C language.
• To introduce the student to data structures such as arrays, lists, stacks etc.

Prerequisites: There are no specific prerequisites for this lab.

Course Outcomes: After the completion of the complete syllabus, the student will be capable of the followings:

1. Examine basic Linux commands

2. Devise a solution for a given problem using an algorithm/flowchart
3. Write C programs to solve a given problem using decision statements, loop constructs, functions, pointers,
structure and files
4. Infer the syntax errors prompted by the C compiler and visualize the output of given code.
5. Practice good programming skills like indentation, in-line comments, and documentation.

LIST OF EXPERIMENTS

A. Introduction to Basic Linux Commands

B. Write a C Program to:
1. Print a message
2. Compute Arithmetic Operations(+, -,*,/,%)
3. Compute Simple and Compound Interest
4. Swap two variables with / without using third variable
5. Find the greatest among three numbers using
i) If statement
ii) Ternary operator
6. Find the roots of a quadratic equation
7. Design a basic calculator using
i) If-Else
ii) Switch case
8. Print the following pattern
*
**
***
****
*****
9. Find the sum of the following series:
i) 1+2+3+…….+N
ii) 12+22+32 +N2
10. Find the sum of digits in a number/
11. Find the reverse of a number
12. Check whether a number is palindrome or not
13. Find the sum of numbers in an array
14. Find the smallest and largest number in an array
15. Reverse an array
16. Perform linear search of an element in an array
17. Perform binary search of an element in an array
 18. Sort an array using bubble sort algorithm
19. Perform addition, subtraction and multiplication of two 2D
arrays
20. Perform basic operations on a string with / without using built-in
functions
21. Check whether a string is palindrome or not
22. Add two numbers using a user-defined function
23. Display the Fibonacci upto n-term using user-defined function
24. Find factorial of a number using recursion
25. Find sum of array elements using user-defined function
26. Swap two numbers using call by reference
27. Sort an array using pointers taking the help of any suitable sorting
algorithm
28. Create a structure to hold student data and display it
29. Implement linked list using self-referential structures.
30. Perform basic operations in a file

C. Introduction to the concept of Tower of Hanoi

Text Books:
1. Programming in ANSI C by E. Balaguruswamy

Reference Books:
1. Mastering in C by K. Venugopal.
2. Fundamentals of C by Gottfried.
3. The C Programming by Kerningham and Ritchie.
4. Let Us C by Y. Kanetkar.
Sub Code: MA205A1 Credit: 4 (L-3, T-1, P-0)
DISCRETE MATHEMATICS

Questions to be set: 05 (All Compulsory)

Course Objectives: The objective of this course is to familiarize on numerous counting techniques and
abstract structures which appear frequently in many areas such as Algorithm analysis, data structures,
database management system. Discrete mathematics plays a crucial role in enabling students of
computer science to tackle these problems. Graph theory has tremendous application in Computer
Networks, Switching. Group theory has enormous applications coding theory
Pre-requisites: Set theory, Permutations and Combinations, Relations, Functions, Differential&Integral
calculus.
Course Outcomes (CO’S): On successful completion of this course, students will be able to:
1. Solve problems using Counting Principles, Relations, Functions and Understand
lattices as algebraic structures.
2. Apply concepts of Group theory to model the real-world problems.
3. Analyze the use of graphs in engineering applications.
4. Solve problems using Permutation and Combination, Ordering, Recursion
and generating functions.
5. Evaluate problems related to mathematical logic. Extend the concepts of
Predicate Calculus in computer science.
**not more than 20% of total topics to be allotted for assignment.
Module Mode Topics Hrs CO PO PSO

Module 1: in class Set theory: Principle of inclusion and 10 1

<Lattices> exclusion, Relations,
and functions, Techniques of
Proofs, Pigeonhole
Principle; Partial ordering, lattice and algebraic
systems,

principle of duality, basic properties of algebraic

systems
defined by lattices, distributive and
complemented
Module 3: in class Graphs, Digraphs, Walk, Path, Cycles, 8 3
<Graph Connectedness, Tree, Computer representation
Theory> of relation, relation digraph, and graphs,
transitive closer and Warshall’s
Algorithm.
**Assignment Transitive closer and Warshall’s Algorithm. 3
Topics
Module 4: in class Elementary configurations: - Permutations and 7 4
<Ordering> Combinations, Generating functions, Partitions
and Compositions, Lexicographical and Fike's
orderings of permutations. Algorithms for
Lexicographical, Reverse Lexicographical and
Fike's ordering of permutation.
 **Assignment Reverse Lexicographical and Fike's 4
Topics ordering of
permutation.
Module 5: in class Predicate calculus: Connectives, Well-formed 10 5
<Predicate formula (WFF), Quantification, examples and
Calculus> properties of WFF into Causal form.
Module 3: Resolution and refutation, answer
<Graph extraction and simple examples.
Theory> **Assignment Resolution and refutation, answer extraction and 5
Topics simple examples.

in class Graphs, Digraphs, Walk, Path, Cycles, 8 3

Connectedness, Tree, Computer representation
of relation, relation digraph, and graphs,
transitive closer and Warshall’s
Algorithm.

Text Books:
1. Jean-Paul Tremblay and Manohar, R: Discrete Mathematical Structures with application to
Computer Science, McGraw Hill.
2. C.L. Liu: Elements of discrete mathematics, McGraw Hill.
3. Narasingh Deo: Graph theory with applications to Computer Science, PHI.
Reference Books:
1. B. Kolman, R.C. Busby & S. Ross.: Discrete Mathematical Structures, Pearson.
2. Principles of Artificial Intelligence; N. J. Nielson.
3. E. S. Page & L.B. Wilson: An introduction to Computational Combinatorics,
Cambridge University.
Sub Code: IT211A1 Credit: 4 (L-3, T-1, P-0)

DIGITAL DESIGN AND COMPUTER ORGANIZATION

Questions to be set: 05 (All Compulsory)

Course Objectives: To provide basic knowledge in digital electronics and internal architecture of a computer.
Pre-requisites: Knowledge of Number system and logic gates

Course Outcomes (CO): On successful completion of the course, students should be ble to:
1. Identify various combinational logic circuits and their applications.
2. Identify various sequential logic circuits and their applications.
3. Design basic digital circuits using HDL.
4. Analyze the competence of a computer system architecture.
5. Design alternative computer systems for improved performance.
**not more than 20% of total topics to be allotted for assignment.
Module Topics Hrs CO PO PSO

Module 1: Boolean Algebra: De-Morgan’s Theorem, Simplification of Logic 9 1

Basic Logic Circuits, Combinational Circuits: Introduction to K-map, Half and
Gates and Full Adder Circuit, Parallel Adder, Multiplexer, De multiplexer,
Combinational Decoder, Encoders, Comparators, 7-Segment Decoder, and
Circuits current trends in digital electronics
(Reversible logic)
Module 2: Latches and Flip-Flops, State Diagram and State Tables, Analysis 8 2
Sequential of Asynchronous Sequential Circuits, Analysis of Synchronous
Circuits Sequential Circuits, Design of Sequential Logic Circuit,
Asynchronous and Synchronous
Counter and Shift Register.
Module 3: Motivation and Introduction to HDL (VHDL/Verilog), Modules, 8 3
Hardware Language origins, simulation and synthesis, Behavioral modeling,
Descriptive Structural modeling
Language (HDL)
Module 4: Computer Architecture: von Neuman Architecture, Fetch Decode 10 4
Computer Execution Cycle, Machine instructions and addressing modes,
Architecture, ALU, data‐path and control unit
Memory and I/O Memory System: Caches, Virtual memory, I/O Introduction, DMA,
Interrupts
PC I/O systems
Module 5: Microarchitecture: Flynn’s Classification, Introduction, Single 8 5
Microarchitecture and multicycle processor, pipelined processor,
and Pipelining Performance Analysis,
Text Books:
1. David Money Harris & Sarah L. Harris (2012). Digital Design and Computer Architecture,
Morgan Kaufmann; 2nd edition
2. Douglas L. Perry (2017). VHDL: Programming by Example, McGraw Hill Education; 4th edition
3. Douglas Comer. (2019), Essentials of Computer Architecture, (2nd ed.), CRC Press
4. M. Morris Mano, (2017), Computer System Architecture, (3rd ed), Pearson.
5. William J. Fletcher, (1997), An Engineering approach to Digital Design, (1st ed), PHI.

Reference Books:
1. Joseph D. Dumas II,(2016), “Computer Architecture: Fundamentals and Principles of
Computer Design”, (2nd ed), CRC Publication.
2. C. H. Roth, (1998), “Digital System Design using VHDL”, (4th ed), PWS publication.
 Sub Code: IT212A1 Credit:4 (L-3, T-1, P-0)
DATA STRUCTURES
Questions to be set: 05 (All Compulsory)
Course Objectives: This course emphasizes on the organization of information, the implementation of
linear data structures such as linked lists, stacks, queues, and non-linear data structures such as trees, and
graphs. This course also explores recursion principles, the close relationship between data structures and
algorithms and the analysis of algorithm complexity.
Pre-requisites: Programming concepts and ‘C’ language.
Course Outcomes (CO): On successful completion of this course, students should be able to:
1. Describe the working of data structures like array, stack, queue, linked list, tree and graph
2. Explain common applications for array, stack, queue, linked list, tree and graph
3. Solve a given problem using appropriate data structures and algorithm
4. Discuss about the working of the principal algorithms for sorting, searching, and hashing
5. Correlate the performance of a program with respect to the choice of data structure & algorithm
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: in Definition, Algorithmic analysis: ‘Oh’ notation, 8 1

<Introduction> class Contiguous data structures: Representation of
multidimensional arrays, highly structured sparse
matrices using dimensioned arrays,
**Assignment String representation and manipulation.
Topics

Module 2: in Definition, Operations on stacks, Implementation 8 1, 2

<Stacks & class using array. Application of Stacks: Evaluation of
Queues> arithmetic expressions. Recursion: Use of recursive
techniques in enumeration problems and back
tracking algorithms, Recursion removal using
stacks.
Definition, Operations on queue, Implementation of
queues, Circular queues. Applications
**Assignment
Topics

Module 3: in Linear linked list: Insertion, Traversal and deletion 7 2,3

<Non- class operations on singly linked list.Varioustypes of
contiguous linked
Data list: Doubly linked list, Circular lists, Use of header
Structures> node in circular lists, Generalized (recursive) list,
Application of linear list.
**Assignment Representation and manipulation of sets, Strings
Topics and graphs.

Module 4: in class Definition of a tree and various terminologies used 10 2,3

in tree, Binary tree, Recursive and non-recursive
<Trees & tree traversal algorithms, Representation of n-ary
Graphs> trees using binary trees, Application of trees,
Expression trees. Search trees: Definition, Insertion,
Deletion and reversal, Height balanced search trees
(using AVL trees illustrative example) and weight
balanced search trees.
Terminology and representations: Introduction,
Definition and terminology, Graph representations,
Traversals, connected components and spanning
trees, Shortest path problem, Dijkstra’s algorithm.
**Assignment
Topics

Module 5: in class Sorting: Insertion, 2-way merge, Heap sort and 7 4,5
<Sorting and quick sort, Comparison of different sorts. Hashing
searching > technique: Hash tables, Different hashing functions,
Overflow handling, Methods for collision handling,
Theoretical evaluation.
**Assignment Radix sort. Searching: Linear, Binary search,
Topics Comparison of different methods. H

Text Books:

1. Ellis Horowitz and Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia.

2. Samanta, D., “Classic Data Structures”, PHI.
Reference Books:
1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson
2. E.M. Reingold and W.J. Hansen, “Data Structures”, CBS.
3. A. S. Tanenbaum, Y. Langsam, M.J. Augenstein, “Data Structures using C”, Pearson.
4. M. A. Weiss, “Data Structure and Algorithm Analysis in C”, Pearson
 Sub Code: IT213A1 Credit: 4 (L-3, T-1, P-0)

OBJECT ORIENTED PROGRAMMING USING C++

Questions to be set: 05 (All Compulsory)

Course Objectives: This course introduces C++ as an Object-Oriented Programming Language, building
on existing knowledge of C and Java. The unit covers the C++language with a focus on its object-
oriented features, and how these can be implemented as part of program designs and implementation.
The students will also study and gain practical experience with the implementation issues related to
object-oriented techniques, be able to build good quality software using object-oriented techniques and
understand the role of patterns in object-oriented design.
Pre-requisites: Computer Programming concepts
Course Outcomes (CO): On successful completion of this course, students should be able to:
1. Identify importance of object-oriented programming and difference between structured
oriented and object-oriented programming features.
2. Able to make use of objects and classes for developing programs.
3. Able to use various object-oriented concepts like operator overloading to solve different problems.
4. Apply virtual and pure virtual function & complex programming situations
5. Illustrate the process of data file manipulations using C++.

** Not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: In The Data types: Literal constant, Variables, 8 1

<Basic concepts Class Pointer types, String types, Constant qualifier,
of OOP > Reference types, The Boolean type, Enumeration
types, Array types, Typedef names, Volatile
qualifier, Class types, Expressions: Definition,
Operators: Arithmetic, Increment and
decrement, Conditional, Size of operator, New
and delete, Comma
**Assignment The bitwise operator, Precedence, Type
Topics conversions, Statements: Selection, Iteration,
Jump.
Module 2: In Inline functions, Linkage directives: Extern “C”, 10 2
< Procedural- Class Scope: Global objects and functions, Local
based objects, Dynamically allocated objects. Classes:
programming & Definition , Class object, Class member
Object–based functions, Constructors and destructors, Friend
programming > function and classes, Static class members,
Structures and unions, Bit field: A space saving
member, Classscope, Nested classes, Structured
programming and Object oriented programming
paradigm.
**Assignment Functions: Overview, Function prototype,
Topics Argument passing, Returning a value, Recursion

Module 3: In Overloaded declarations, the three steps of

< Overloaded Class overload resolution, Argument type conversions, 8 3
functions/ Overloading operators: Operators like =, (), ->,
operators <>, + and -- (Using both friend as well as
(polymorphism)& member functions, Importance of this pointer).

Generic Definition of generic programming, Function

programming template, Template arguments and overloading
using template function template
function & **Assignment Overloading function template
template classes> Topics

Module 4: in class Inheritance: Base class member access, 10 4

<Inheritance and Inheritance types, Protected mechanism, Virtual
io-stream library base classes. Virtual functions (Run-time
> polymorphism concept): Virtual functions, Pure
virtual functions, Early vs. late binding. The io-
stream library: Streams, Stream classes,
Managing unformatted and formatted I/O
operations, Manipulators.
**Assignment The io-stream library: Streams, Stream classes,
Topics Managing unformatted and formatted I/O
operations, Manipulators.
Module 5: in class Classes for file stream operations, Accessing 4 5
<Files/ exception files, Sequential I/O operations, Random access
handling > **Assignment Command- line arguments, Exception handling
Topics (throw, try, and catch)

Textbooks:
1. Herbert Schildt, “The Complete Reference C++”, Tata McGraw Hill.
2. E. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill.
Reference Books:
1. Bjarne Stroustrup, “C++ Programming Language”, Pearson.
2. Stanley B Lippman and Lajoie, “C++ Primer”, Pearson.
3. Saurav Sahay, “OOP with C++”, Oxford University Press.
4. B.L. Juneja and Anita Sethi, “Programming with C++”, New Age International Publication
 Sub Code: IT214A4 Credit: 1 (L-0, T-0, P-2)
DATA STRUCTURES LABORATORY

Course Objectives: The objective of this course is to get insight into the practical applications of various
algorithms.
Pre-requisites: Theory paper CS 1302 Data Structures and associated prerequisites
Course Outcomes (CO): On successful completion of this course, students should be able to:

1. Write program related to application of data structures using programming constructs of a language
like C programming language
2. Identify the suitable input and output for a specified problem statement
3. Conclude the working of various algorithms in terms of time and space complexity
4. Examine the errors encountered in the program using appropriate tools and fix them
5. Write well-indented and well-documented code

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Tips on C programming, Searching an array- 7.2 1
Introduction class Linear, Binary Search

**Assignment Insertion and Deletion on specific array positions

Topics

Module 2: in Matrix: Sparse and Compact Matrix 7.2 2

Matrix, Stack class Stack and Queue data structure
and Queue **Assignment Implementation of stack as a queue and vice versa
Topics

Module 3: in Linked List: Singly, Doubly, Singly-Circular 7.2 3

Linked List class
**Assignment Doubly-Circular
Topics

Module 4: in class Tree Data Structure 7.2 4

Tree Tree Traversal Algorithms: InOrder, PreOrder,
PostOrder
**Assignment Given InOrder and PreOrder, find out PostOrder
Topics traversal

Module 5: in class Graph algorithms: Breadth First Search 7.2 5

Graph
**Assignment Depth First Search
Topics
Text Books:
1. Ellis Horowitz and Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia.
2. Samanta, D., “Classic Data Structures”, PHI.
Reference Books:
1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson
2. E.M. Reingold and W.J. Hansen, “Data Structures”, CBS.
3. A. S. Tanenbaum, Y. Langsam, M.J. Augenstein, “Data Structures using C”, Pearson.
4. M. A. Weiss, “Data Structure and Algorithm Analysis in C”, Pearson.
 Sub Code : IT215A4 Credit: 1(L-0, T-0, P-2)
OBJECT ORIENTED PROGRAMMING USING C++ LABORATORY
Course Objectives: The student should be able to explain the fundamental properties of the C++
Language and to combine the elements of C++ language in developing structured programs.
Pre-requisites: C Programming and corresponding theory paper CS 1308 Object
Oriented Concepts &Programming using C++.
Course Outcomes(CO): On successful completion of this course, students should be able to:
1. To demonstrate the skills necessary to correctly compile, debug and test programs in C++
2. Apply class and object to program design and implementation
3. Understand the concept of constructor and destructor and apply the same in developing programs.
4. Apply C++ features like operator overloading to program design
5. Use of inheritance and polymorphism in developing structured program
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs C PO PS
covered O O
Module 1: in 1.1 Write a program to create a structure named “cricket” 1,
Structure class with following details:- 2
concepts a. Player nameb. Team name c.Batting average Using
Implementi structure cricket declare an array with 50 elements & read
ng classes information about all the players and display team- wise
and objects list containing names of players with their batting average
score.

1.2. Define a structure named “census” with following

three members:
i. A character array “city” to store the names.
ii. A long integer to store population of the city.
iii. A float number to store literacy level. Implement
the following:
i. Read the details for five cities randomly using an
array variable.
ii. Sort the city list alphabetically and display all the
details.
1.3. Define a structure named “Date” with three integer
members “day”, “month” and “year”. Develop an
interactive modular program to perform the following
tasks:
i. To read the data into structure members using a
function.
ii. Create a function named validate() to validate the date
Display the date in the format “April 29 2022” using a
function.

2.1 Create a class named circle with data member Radius,

pi (constant member) and area. Create following member
functions:
i. to accept the radius from the user
ii. to calculate the area of the circle
 iii. to display the details

2.2 Given that an EMPLOYEE class contains following

data members: Employee_Number, Employee_Name,
Basic, DA, IT, Net_Sal. Member Functions: to read the
data, to calculate Net_Sal and to print data members.
Write a C++ program to read the data of an employee and
compute Net_Sal of the employee (DA= 52% of Basic
and Income Tax(IT)=30% of the gross salary).While
writing consider following:
i. Initialize members using method.
ii. Create more than two objects.

**Assignment 2.3 Write an OOP in C++ to prepare a student Record

Topics using class and object with the following data members
and member functions:
Data Members: Name, Regn Number, and Marks in three
subjects
Member functions: Read, display and average marks

Module 2: in 3.1 Define a STUDENT class with USN, Name and 2

Array of class marks in 3 tests of a subject, declare an array of 10 student
objects objects find the average of two better marks for each
Function student. Print USN, Name and average marks of all the
overloading, students.
passing
objects as 3.2 Write an OOP in C++ to create a class Employee with
arguments data members as Name, Employee code and Gross salary.
and Include member functions to read input and display
returning output of individual objects. Create an array of 10
objects employees. Display the details of the employees with
highest and lowest gross salary.
3.3 Write an OOP in C++ to create a class called BOOK
with the following data members and member function:
Data Members: Title, Author, Price,ISBN No.
Member functions: Read, Display, Search_book(using
ISBN No).

4.1 Create an array of 5 BOOK type objects and

demonstrate all member functions.
Create a class named C_POWER with a function power()
to raise a number m to the power n. The function takes a
double value for m and int value for n, returns the result
correctly. Use a default value of 2 for n to make the
function to calculate squares when this argument is
omitted. Write another function that takes an int value of
m. Both functions should have same name. Write a main
function that gets values of m and n from user.

4.2 Write a C++ program to create a class called

COMPLEX and implement the following by overloading
functions ADD() that return a COMPLEX number.
 ADD(a, s2)- where a is an integer (real part) and s2 is a
complex number.
ADD(s1, s2)- where s1 and s2 are complex numbers.

**Assignment 4.3 Write a program in C++ to create a class named TIME

Topics that stores two time values in hours (float) and minutes
(integer). Perform the following operations by using a
function add():-
Add T1+T2 where , T1 and T2 are time objects.
Add T1+x where T1 is a TIME object and x is any integer.
Return time objects from the member function tomain()
and display.

Module 3: in 5.1 Write a C++ program to create a class called 3

Programs class STRING and implement the following
on operations.
constructor STRING s1=”SMIT” STRING s2=”MAJITAR”
s and STRING s3=s1+s2 (Use copy constructor).
destructors
Static data 5.2 Write a program in C++ to create a class named
and static student, create a constructor and destructor for the class
member and demonstrate sequence of execution of constructors
function and destructors.
6.1 Write a program in C++ to define a class named Bank.
Include the following data members:-
a. Name of account holder b. Account number c. type of
account d. balance amount in account
e. number of transactions in the bank(static data member)
Create the following member functions:-
i. To read inputs ii. To deposit an amount
To withdraw amount after checking current balance
Display number of transactions (use static function).

6.2 Write an OOP in C++ to demonstrate static members

of a class. Include static data members to count the
number of objects created for the class

**Assignment 6.3 Write an OOP in C++ to demonstrate static members

Topics function of a class to pre-initialize private static data
members. Also show restrictions that apply on static
member functions.

Module 4: in class 7.1 Create two classes DM and DB which stores the value 4
Friend in distances. DM stores distance in meters and
function centimeters and DB in feet and inches. Write a program
Implementi that can read values for the class objects and add one
ng linked object of DM with another object of DB. Use a friend
list in C++ function to carry out the addition operation. The object
Operator that stores the results may be a DM object or DB object,
overloadin depending on the units in which the results are required.
g The display should be in the format of feet and inches or
meters and centimeters depending on the object on
display. Use the concept of friend function.
7.2 Write an OOP in C++ to create a Class Twovalues
with two integer type data members and member function
to read values in those data members. Create another
Class Min_Max and declare it as friend of Class
Twovalues. Min_Max should have member functions
to find the minimum and maximum of two values.

7.3 Write an OOP in C++ to demonstrate the advantage

of overloading ‘+’ operator using friend function.

8.1 Write a C++ program to create a class called LIST

(linked list) with member functions to :-
Insert an element at any position and to display the list.
8.2 Write a C++ program to create a class called LIST
(linked list) with member functions to :-
Delete an element from any position and to display the
list.

8.3 Write an OOP in C++ to create a class called STACK

with an array of integer type data member and member
functions to PUSH/POP elements from the stack and
display the elements on the stack.

9.1 Write a program in C++ to overload unary minus

operator to change the sign of a number. Perform the
addition on the entered values from text boxes.

9.2 Write a C++ program to create a class called

COMPLEX and implement the following by overloading
+ operator:-
i. a+ s2; where a is an integer (real part) and s2 is a
complex number.
ii. s1+ s2 ; where s1 and s2 are complex numbers.
Return object and display the result.

9.3 Write a C++ program to create a class called STACK

using array of integers. Implement the following
operations by overloading the operators + and --.
i. s1=s1+element; where s1 is a object of the class
STACK and element is an integer to be pushed on
top of the stack.
ii. s1=s1--;where s1 is a object of the class STACK,
-- operator pops the element.
Note: Handle the STACK empty and STACK full
conditions.

9.4 Write a C++ program to create a class called

MATRIX using a two- dimensional array of integers.
Implement the following operations by overloading the
operator== which checks the compatibility of two
matrices to be added and subtracted. Perform the addition
and subtraction by overloading the operators + and –
respectively :-
 if(m1==m2)
{
m3=m1-m2; m4=m1+m2;
}
else display error
**Assignment 9.5 Write a C++ program to create a class called DATE.
Topics Accept two valid dates in the form dd/mm/yy. Implement
the following operations by overloading the operators +
and - .
i. no_of_days=d1-d2; where d1 and d2 are DATE
objects. d1>=d2 and no_of_days is an integer.
ii. d2=d1-no_of_days; where d1 is a DATE object
and no_of_days is an integer.
Module 5: in class 10.1 Write a program in C++ to create a template function 5
Template and perform bubble sort.
class and
template 10.2 Write a program, in C++ to create a template class
functions STACK and perform push and pop operations.
Inheritance
Run-Time 10.3 Write an OOP in C++ to create a template class
Polymorph ARRAY and implement run time boundary checking by
ism overloading [] operator.
Files in
C++ 11.1 Write a C++ program to create a class called
STUDENT with data members USN, Name and Age.
Using inheritance, create the classes UGSTUDENT and
PGSTUDENT having fields as Semester, Fees and
Stipend. Enter the data for at least 5 students. Find the
semester wise
average age for all UG and PG students separately.

11.2 Write an OOP in C++ to demonstrate accessing

derived class objects’ member using base class pointers.
Also show the sequence of execution of constructors and
destructors wheninheritance is involved.

12.1 WAP in C++ to create a class called Figure. Use this

class to store two double type values that could be used to
compute the area of various shapes (i.e., length, breadth
for rectangle and base, height for triangle). Derive two
specific classes called Triangle and Rectangle inherited
from super class Figure. Create a virtual function called
area( ) to compute and display the area of the basic shapes.
Redefine this function in derived classes to suit its
requirements.

12.2 Write a C++ to implement the following using the

concept of inheritance.-
 i. Create data member roll_no,reg_no and member
function get_number() to take input and
put_number() to display in the base class
STUDENT.
ii. The class Test contains a data member part1 and
part2.Redefine the above two functions.
iii. The class SCORE contains a member score.
Redefine get_number and put_number ().
iv. Redefine display function in RESULT class as
well to calculate total, where
TOTAL=part1+part2+score.

Note: Implement the concept of run-time

polymorphism, and include constructors in all the
classes.

12.3 Write an OOP in C++ to create a base class convert

with two data members val1 and val2 and two member
functions getinit() and getconvert() which return the
initial values and converted values. It includes a pure
virtual function compute() which must be defined by by
two derived classes lit_to_gal and far_to_cel. Each of
these classes have their own definition of compoute().
**Assignment 13.1 Write a program in C++ to create a file named
Topics “costs” and implement the following by creating menu
driven program:-
i. The file should contain two columns
“item_name” and “cost”.
ii. Insert data under these two columns assuming the
file is empty initially.
iii. Allow user to add more data as and when he
wants.
iv. Retrieve the item details if item name is given as
an input.
Display the entire content of the file.

13.2 Write a program in C++ to copy the contents of one

file into another in reverse order.

13.3 Write a program in C++ to change a particular

character in a file using command line.
Text Books:
1. Herbert Schildt, “The Complete Reference C++”, Tata McGraw Hill.
2. E. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill.
Reference Books:
1. Bjarne Stroustrup, “C++ Programming Language”, Pearson.
2. Stanley B Lippman and Lajoie, “C++ Primer”, Pearson.
3. Saurav Sahay, “OOP with C++”, Oxford University Press.
4. B.L. Juneja and Anita Sethi, “Programming with C++”, New Age International Publication.
Sub Code:MA206A1 Credit: 4 (L-3, T-1, P-0)
PROBABILITY, STATISTICS AND STOCHASTIC PROCESSES.
Questions to be set: 05
Questions to be answered: ALL
Course Objectives: The objective of this course is to enhance the capability of students to analyze the
problems related to random phenomena. Concepts on probability theory will be of immense help to the
students in analyze random experiments. Statistical Analysis plays a big role in areas like data mining and
information retrieval. Stochastic models have tremendous applications in queuing theory, finance,
Insurance . Students will find adequate tools in these modules which will be effective enough to solve
related problems.
Pre-requisites: Differential and Integral Calculus, Matrix Algebra, Permutation and Combination.

Course Outcomes (CO): After completing the course, the students will be able to
CO1: demonstrate basic principles of probability and understand a random variable that describe
randomness or an uncertainty in certain realistic situation.
CO2: comprehend concepts of discrete, continuous probability distributions and able to solve problems of
probability using various distributions.
CO3: analyse the statistical data for inference and apply various tests for testing the Hypothesis,
CO4: understand the various classifications of Random Processes that arise frequently and model them.
CO5: apply different Queuing models that appear in Computer Science

Module I: Probability Theory, Random Variables, and distribution: Introduction, Classical definition of
probability, Axiomatic definition of probability, Conditional probability, Baye’s theorem. Random
variables, Mean, Variance, Chebyshev’s inequality, Central limit theorem. [10 HR]
Module II: Conditional Probability and known distribution: Correlation coefficient, conditional
distributions, conditional expectations, and regression curves, Standard probability distributions
(Binomial, Poisson, Uniform, Normal, exponential, chi-square.), Reliability and MTTF. [10 HR]
Module III: Introduction to Statistics: Random sample, Sampling distribution, Statistic, Least square
curve fitting Parameter estimation: Unbiased estimate, Consistent estimate, Maximum likelihood
estimate, interval estimate. Testing of Hypothesis for mean with known variance for normal population.
[6 HR]
Module IV: Stochastic Processes: Introduction to Stochastic Process, Poisson Process, Discrete
parameter Markov Chains,. [8 HR]
Module V: Queuing Models: Concept of a queues: Basic idea of continuous parameter Markov chain,
Birth and death processes, 𝑀⁄𝑀⁄1⁄∞ , 𝑀⁄𝑀⁄1⁄𝑁,queuing systems. [6 HR]
Textbook:
K.S Trivedi, Probability & Statistics with Reliability, Queuing and Computer Science Applications, 2008,
Wiley.
P.L. Meyer : Introductory Probability theory and statistical Applications, Second Ed. Oxford & IBM
Publishers.
Miller & Freund: Probability & Statistics for Engineers, Eight Ed. Pearson Ltd.
Reference Books:
1. Introduction to Probability Theory and its Applications, William Feller, 2008, Wiley.
2. Introduction to Probability with Statistical Applications, Geza Schay, 2007, Birkhaus.
 Sub Code: IT221A1 Credit:4 (L-3, T-1, P-0)
JAVA PROGRAMMING
Questions to be set: 05 (All Compulsory)
Course Objectives: The Java Programming Language course provides students with a solid foundation for
programming with JAVA. It also highlights the creation of graphical user interfaces (GUIs), exceptions, file
input/output (I/O), and threads; and network programming.
Pre-requisites: Object Oriented Programming.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Demonstrate an ability describe and recall the various object-oriented concept
2. Formulate and interpret an object-oriented model and design solution using object oriented concepts.
3. Illustrate a diverse set of design solutions using techniques of Interface, Packages, File Handling,
Multi-threading, etc.
4. Select and design methodology using bottom up approach and solve open ended problems using Java.
5. Define and create modern engineering tools, techniques and resources to build software using
Java programming language.
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Evolution and features of java, Overview of java, 8 1,2
< Introduction Class Data types, Variables and arrays, Type conversion
to Java & and casting, Type promotion in expression, arrays.
Classes> Class fundamentals, Declaring objects, Assigning
object reference Variables, Introducing methods,
Constructors, ‘this’ keyword, The finalize() method.
**Assignment Two control statements, Lexical issues, Literals,
Topics Variables, Operators, Bitwise operators, Relational
operators, Boolean and logical operators, Assignment
Operators, The ‘?’ operator, Operator precedence,
JAVA statements. Garbage collection and stack class.
Module 2: In Overloading methods and constructors, using object 8 2,3
<Methods and Class as parameters, Argument passing, Returning objects,
classes & Access control, Static methods, Nested and inner
Strings classes, Command line argument.
handling> String constructors, String length, Special string
operators, Character extraction, String comparison,
String searching, String modification, Changing case
of characters within a string, Compression and String
buffer, String builder.
**Assignment Recursion
Topics

Module 3: In Basics of inheritance, Types of inheritance, Using 8 2,3

< Inheritance, Class super keyword, method overriding, Dynamic method
Interfaces and dispatch, Abstract class, Using final with inheritance,
Packages, The object class, Defining and implementing
 Exception interface, Extending interfaces, Nested interfaces,
Handling > Applying interfaces, Defining and creating packages,
Access protection, Importing packages.
Fundamentals, Exception types, Uncaught
exceptions, Using try and catch, Multiple catch
clauses, Nested try statements, Finally, Java’s built in
exceptions, Creating own exception classes
**Assignment Throws
Topics

Module 4: in class Java I/O classes and interfaces, The stream classes, 8 4,5
<Input/Output Byte streams, The character streams, The console
and file class, File class, Byte-stream class, Random access
handling & files.
Multithreaded Thread basics, Java’s thread model, Thread priorities,
programming> Messaging, Thread class and runnable interface. The
main thread, Creating a thread, Creating multiple
threads, Interthread communication,
Suspending/resuming and stopping threads.
**Assignment Synchronization.
Topics

Module 5: in class Networking basics, The networking classes and 8 5

< Network interfaces, The InetAddress class, Inet4Address, TCP
programming socket.
& Event Based The applet class, Repaint(), The HTML applet tag,
Programming> Passing Parameter to applet, Event handling,
**Assignment URL, URLConnection, HTTP/URL Connection,
Topics TCP/IP server sockets, Datagram socket and
Datagram Packet.
Using delegation event model, Abstract Window
program, Displaying information within a window,
AWT controls.

Text Books:
1. Programming With JAVA, 2nd Edition, E. Balaguruswami and TMH Publication.
2. Java: The Complete Reference, 7th Edition, Herbert Scheldt, TMH Publication
Reference Books:
1. The Java Programming Language: K.Arnold and J. Gosling.
2. Professional java Server Programming: Allamaraju.
3. JAVA2: The Complete Reference, 3rd Edition, Patrick Naughton
and HarbertSchildt, TMHPublication.
4. Internet & Java Program: R.Krishnamoorthy& S. Prabhu, New Age
Internet Publisher
Sub Code: IT222A1 Credit:4 (L-3,T-1, P-0)
DATABASE MANAGEMENT SYSTEMS
Questions to be set: 05 (All Compulsory)
Course Objectives: This course provides the basic information about relational Database
Management System and their development. The major objectives of the course is to
provide an introduction of DBMS and their use, be familiar with the basic DBMS
architecture, components, and interfaces, have experience using at least one modern
Database Management System, understand and use database models in database and
application design
Pre-requisites: Programming Concepts
Course Outcomes (CO): On successful completion of this course, students should be able to:

1. Describe fundamental elements of a relational database management system.

2. Design entity-relationship diagrams to represent simple database application scenarios.
3. Explain the basic concepts of relational data model, Entity-relationship model,
Relational database design, relational algebra and database language SQL.
4. Apply and relate the concept of transaction, concurrency control and recovery in database
5. Analyze various Normalization techniques and improve the database design by normalization

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PS

Module 1: In DBMS: Characteristics, Advantages, 8 1,2

Architecture.
<Introduction Class Database concept and architecture, Data
models,
& Data Instances and schema, Database
languages, Database
modelling > manager, Database administrator,
Database users,
Concept of centralized database
management system
and distributed database system. Entity
sets, attributes
types and keys, Entity Relationship (ER)
diagram,
Type role and structural constraints,
Enhanced entity-
relationship (EER), Object modelling,
Specialization
and generalization, Modelling of
union types,
Relational-algebra operations.
**Assign Data models: Definition, Purpose
ment and Types,
Topics Hierarchical models, Network model,
Relational
model.
Module 2: In Database design process, Relational 8 3
database design,
 <Database Class Relation schema, Functional
dependencies,
design > Membership and minimal covers,
Normal forms,
Multivalued dependencies, Join
dependencies,
Converting EER diagrams to relations.
**Assign Effect of de-normalization on database
ment performance.
Topics

Module 3: In File organizations, primary, 9 3,4

secondary index
< Data Class structures, various index structures -
hash-based,
Storage and dynamic hashing techniques, multi-
level indexes, B+

Indexes & trees. Query-by-example (QBE),

Database Introduction to SQL, Use of some
query special data types, Overview of SQL
languages > 92, Basic queries in SQL, Advanced
queries in SQL, Functions in SQL,
Basic data retrieval, Aggregation,
Categorization, Updates in SQL,
Embedded SQL and
4GLs, Procedural extension to SQL:
PL/SQL.
**Assign
ment
Topics
Module 4: in class Desirable properties of transactions, 9 4
Implementation
< Transaction of atomicity and durability,
Reconsistent model, Read
processing, only and write only model,
Concurrent executions,
Concurrency Schedules and recoverability,
Serializability of
control and schedules, Concurrency control,
Precedence graph.
backup & Overview of concurrency control,
Locking techniques,
recovery Lock based protocols, Time stamp
based protocols,
mechanisms Commit protocols, Optimistic
technique, Granularity
> of data items, Time stamp ordering
multi version
concurrency control, Deadlock
handling, Recovery
mechanisms, Database recovery
techniques based on
immediate and deferred update.
**Assign Concepts of database security
ment mechanisms, Case study
 Topics of Distributed Database Systems

Module 5: Overview of graph database, Structure 6

in class 5
and advantages
<Graph of graph database. An overview
of NoSQL,
Database & Characteristics of NoSQL, Advantages
and challenges
NoSQL > of NoSQL, NoSQL
storage types, Case study of MongoDB.
**Assign high level view of graph space, Property
ment graph model.
Topics

Text Books:
1. Elmasri and Navathe: “Fundamentals of Database Systems”, Addison Wesley.
2. Silberschatz, Korth, Sudarshan, “Database System Concepts”, McGraw-Hill

Reference Books:
1. Thomas Connolly, Carolyn Begg, “Database Systems – A Practical Approach to
Design, Implementationand Management”, Pearson Education.
2. Jefrey D. Ullman, Jenifer Widom, “A First Course in Database Systems”, Pearson Education.
3. Bipin C Desai, “An Introduction to Database Systems”, Galgotia.
4. Atul Kahate, “Introduction to Database Management Systems”, Pearson.
5. Ian Robinson, Jim Webber, Emil Eifrem,”Graph Databases”,O'Reilly Media.
6. Gaurav Vaish, ”Getting started with NoSQL”, Packt.
Sub Code: GN201A1 CREDIT 3: [L-3, T-0, P-0]

UNIVERSAL HUMAN VALUES-II: UNDERSTANDING

HARMONY and ETHICAL HUMAN CONDUCT

Course Objectives:
This introductory course input is intended:
1. To help the students appreciate the essential complementarily between 'VALUES' and
'SKILLS' to ensure sustained happiness and prosperity which are the core aspirations of all
human beings.
2. To facilitate the development of a Holistic perspective among students towards life and
profession as well as towards happiness and prosperity based on a correct understanding of the
Human reality and the rest of existence. Such a holistic perspective forms the basis of
Universal Human Values and movement towards value-based living in a natural way.
3. To highlight plausible implications of such a Holistic understanding in terms of ethical human
conduct, trustful and mutually fulfilling human behaviour and mutually enriching interaction
with Nature.
Thus, this course is intended to provide a much needed orientational input in value education to
the young enquiring minds.

Pre-requisites: None. However, it is desired that students may have gone through UHV-I: Universal
Human Values-Introduction

Course Outcome (CO):

1. Students are expected to understand self-exploration and Basic Human Aspirations.
2. To understand harmony in themselves (Human being).
3. To become more aware of their surroundings (family, society, nature); they would become
more responsible in life, and in handling problems with sustainable solutions, while keeping
human relationships and human nature in mind.
4. They would have better critical ability. They would also become sensitive to their
commitment towards what they have understood (human values, human relationship and
human society). It is hoped that they would be able to apply what they have learnt to their own
self in different day-to- day settings in real life, at least a beginning would be made in this
direction.
Therefore, the course and further follow up is expected to positively impact common graduate attributes like:
1) Holistic vision of life
2) Socially responsible behaviour
3) Environmentally responsible work
4) Ethical human conduct
5) Having Competence and Capabilities for Maintaining Health and Hygiene
6) Appreciation and aspiration for excellence (merit) and gratitude for all

Module 1 –Introduction to Value Education (9 Hrs)

Lecture 1: Right Understanding, Relationship and Physical Facility (Holistic Development and
the Role of Education)
Lecture 2: Understanding Value Education
Tutorial 1: Practice Session PS1 Sharing about Oneself
Lecture 3: Self-exploration as the Process for Value Education
Lecture 4: Continuous Happiness and Prosperity – the Basic Human Aspirations
Tutorial 2: Practice Session PS2 Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture 6: Method to Fulfil the Basic Human Aspirations
Tutorial 3: Practice Session PS3 Exploring Natural
 Acceptance

Module 2 – Harmony in the Human Being (9 Hrs)

Lecture 7: Understanding Human being as the Co-existence of the Self and the
Body Lecture 8: Distinguishing between the Needs of the Self and the Body
Tutorial 4: Practice Session PS4 Exploring the difference of Needs of Self and Body
Lecture 9: The Body as an Instrument of the Self
Lecture 10: Understanding Harmony in the Self
Tutorial 5: Practice Session PS5 Exploring Sources of Imagination in the Self
Lecture 11: Harmony of the Self with the Body
Lecture 12: Programme to ensure self-regulation and Health
Tutorial 6: Practice Session PS6 Exploring Harmony of Self with the Body

Module 3 – Harmony in the Family and Society (9 Hrs) Lecture 13:

Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship
Tutorial 7: Practice Session PS7 Exploring the Feeling of Trust
Lecture 15: 'Respect' – as the Right Evaluation
Tutorial 8: Practice Session PS8 Exploring the Feeling of Respect
Lecture 16: Other Feelings, Justice in Human-to-Human
Relationship Lecture 17: Understanding Harmony in the Society
Lecture 18: Vision for the Universal Human Order
Tutorial 9: Practice Session PS9 Exploring Systems to fulfil Human Goal

Module 4 – Harmony in the Nature/Existence (6

Hrs) Lecture 19: Understanding Harmony in the Nature
Lecture 20: Interconnectedness, self-regulation, and Mutual Fulfilment among the Four Orders of
Nature Tutorial 10: Practice Session PS10 Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture 22: The Holistic Perception of Harmony in Existence
Tutorial 11: Practice Session PS11 Exploring Co-existence in Existence

Module 5 – Implications of the Holistic Understanding – a Look at Professional Ethics

(9 Hrs)
Lecture 23: Natural Acceptance of Human Values
Lecture 24: Definitiveness of (Ethical) Human Conduct
Tutorial 12: Practice Session PS12 Exploring Ethical Human Conduct
Lecture 25: A Basis for Humanistic Education, Humanistic Constitution and Universal Human Order
Lecture 26: Competence in Professional Ethics
Tutorial 13: Practice Session PS13 Exploring Humanistic Models in Education
Lecture 27: Holistic Technologies, Production Systems and Management Models-Typical Case Studies
Lecture 28: Strategies for Transition towards Value-based Life and Profession
Tutorial 14: Practice Session PS14 Exploring Steps of Transition towards Universal Human Order

Content for Practice Sessions (Tutorials)

In order to connect the content of the proposals with practice (living), 14 practice sessions have been
designed. The full set of practice sessions is available in the Teacher’s Manual as well as the website.
Practice Sessions for Module 1 – Introduction to Value Education
PS1 Sharing about Oneself
PS2 Exploring Human
Consciousness PS3 Exploring
Natural Acceptance
Practice Sessions for Module 2 – Harmony in the Human Being
PS4 Exploring the difference of Needs of Self and Body
PS5 Exploring Sources of Imagination in the
Self PS6 Exploring Harmony of Self with the
Body
Practice Sessions for Module 3 – Harmony in the Family and Society
PS7 Exploring the Feeling of Trust PS8 Exploring the Feeling of
Respect PS9 Exploring Systems to fulfil
Human Goal
Practice Sessions for Module 4 – Harmony in the Nature (Existence)
PS10 Exploring the Four Orders of
Nature PS11 Exploring Co-existence
in Existence
Practice Sessions for Module 5 – Implications of the Holistic Understanding – a Look at
Professional Ethics
PS12 Exploring Ethical Human Conduct
PS13 Exploring Humanistic Models in Education
PS14 Exploring Steps of Transition towards Universal Human Order

Text Book
A Foundation Course in Human Values and Professional Ethics, R R Gaur, R Asthana, G P
Bagaria, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034- 47-1

The Teacher’s Manual

Teachers’ Manual for A Foundation Course in Human Values and Professional Ethics, R R Gaur,
R Asthana, G P Bagaria, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-
87034-53- 2

Reference Books
1. Jeevan Vidya: EkParichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – Pandit Sunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)
 Sub Code: IT223A4 Credit: 1 (0L+0T+2P)

JAVA PROGRAMMING LABORATORY

Objectives: To impart the programming knowledge and skill of Java. The major objective of this
course is to make the students aware of various features of Java programming language through
practical experiments.

Pre-requisites: OOPS with C++ Lab.

Course Outcomes (CO): On successful completion of this course, students will be able to
1. Create Java programs using the basic concepts of class, datatypes, variables, and arrays, operators etc.
2. Use the concepts of control statements, methods, inheritance etc. in Java programs.
3. Build packages and interfaces and develop multi-threaded Java models for synchronizing as well
as Inter thread communications & work with enumeration and metadata annotations.
4. Develop I/O applets.
5. Understand and apply Java networking and GUI concepts to develop client-server applications
and interactive interfaces.

Module Topics to be Topics Hrs CO PO PSO

covered
Module 1: in Familiarization with the Java development 7.2 1
Introduction class environment (IDE) .
to Java & Practice compiling and running Java programs
Classes using the command line or IDE.
Experiment with basic Java syntax including
variables, data types, and control structures..
**Assignment
Topics

Module 2: in Explore the concept of methods in Java and 7.2 2

Methods and class understand method overloading and overriding.
Classes, Practice creating and using classes to model real-
Strings world entities.
Handling Experiment with string manipulation operations
such as concatenation, substring, and searching.
**Assignment
Topics

Module 3: Understand the concept of inheritance and 7.2 3

Inheritance, explore the use of interfaces to define contracts.
Interfaces Learn about packages and how they organize
and classes into namespaces.
Packages, Practice handling exceptions in Java to write
Exception robust and fault-tolerant code.
Handling
**Assignment
Topics
Module 4: in class Explore different ways of reading input from the 7.2 4
Input/Out user and writing output to the console.
put and Understand file handling concepts in Java
File including reading from and writing to files.
Handling Practice using Java's built-in classes for file
input/output operations.
**Assignment
Topics

Module 5: in class Learn about networking concepts in Java 7.2 5

Network including sockets and URLs.
Programmin Understand event-driven programming using
g & Event- Java's Swing or JavaFX libraries.
Based Practice creating GUI applications with event
Programmin handling capabilities
g **Assignment
Topics
 Sub Code: IT224A4 Credit:1 (L-0, T-0, P-2)
DATABASE MANAGEMENT SYSTEMS LABORATORY
Questions to be set: 05 (All Compulsory)
Course Objectives: At least 10 experiments covering the entire syllabus of the corresponding
theory paperto be carried out using the theory studied /programming skill of the subject concerned
to get insight into thepractical applications of the theoretical studies. The outcome of the lab
classes must lead to a skilled and self-sustained program developer.
Pre-requisites: Corresponding theory paper Database Management Systems and associated
prerequisites.
Course Outcomes (CO): On successful completion of this course, the student should be able to:
1. Select appropriate SQL/MongoDB commands and functions for a given query on the
database.
2. Infer constraints and relationships between tables from conceptual/logical level schema and
convert them into relationship and integrity constraints at the physical level schema.
3. Write Oracle PL/SQL Programs for data processing.
4. Design nested queries for efficient data processing on the database.
5. Test an SQL interface of a multi-user relational DBMS package to create, secure, populate, maintain, and
query a database.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Implementation of DDL and DML commands of 0.5 1
Implementation Class SQL with suitable examples
of DDL and
DML **Assignment Write SQL queries for following question: 2.5 1
commands, Topics Customer (Cust id : integer, cust_name: string)
functions and Item (item_id: integer, item_name: string, price:
operators of integer)
SQL For the above schema, perform the following—
a) Create the tables and insert five records in each
table
b) Display the schema of each table
c) Change the data type of price from integer to
number.
d) Change the name of column/field item name to
I_name.
e) Delete the record of customer having cust_id ‗6‘
f) Add a column age in table Customer
g) Rename the attribute price in table Item to
Costprice
h) Add an attribute in table Item
i) Update the price of Item id ‘4‘ from 1000 to 2000
j) Update the name of Customer having id ‗001‘
k) Delete the contents of the table Customer
l) Display table Item in the following way:
 i) Selected rows all columns
ii) All rows selected columns
iii) All rows selected columns
iv) Selected rows selected columns
m) Drop table Customer
in Implementation of different types of functions with 0.5 1
class suitable examples.

**Assignment Create a table EMPLOYEE with following 2.5 1

Topics schema:
(Emp_no, E_name, E_address, E_ph_no,
Dept_no, Dept_name,Job_id, Designation ,
Salary,
DOJ)
Write SQL statements for the following query.
1. List the E_no, E_name, and Salary of all
employees working as MANAGER.
2. Display all the details of the employee whose
salary is more than the Salary of any manager
3. List the employees in the ascending order of
Designations of those joined after 1981.
4. Display the sum and average of salary of all
employees
5. List the employees who are either ‗CLERK‘ or
‗ANALYST‘.
6. List the employees who joined on 1-MAY-81, 3-
DEC-81, 17-DEC-81,19-JAN-80 .
7. List the employees who are working for the Dept
no 10 or20.
8. List the Employee names those starting with ‘S‘.
9. Display the name as well as the first five
characters of name(s) starting with ‘H‘
10. List the Employee names ending with ‘a‘.
11. Display the maximum and minimum salary of
employees
12. Display the count of employees in each
designation
in Implementation of different types of operators in 0.5 1
class SQL
**Assignment Create a table Salesmen with following schema: 2.5 1
Topics (salesman_id, name , city , age, commission)
Write SQL statements for the following query.
1. Filter those salesmen with all information who
comes from any of the cities Paris and Rome
2. Make a list of salesman_id, name, city and
commission of each salesman who live in cities
other than Paris and Rome
3. Write a SQL statement to find those salesmen
with all information who gets the commission
within a range of 100 and 500
4. Write a query to sort out those salesmen with all
information whose ID value is within any of
3007, 3008 and 3009.
 5. Write a SQL statement to find those salesmen
with all other information and name started with
any letter within 'A' and 'K'
6. Write a SQL statement to find that salesman with
all information whose name begins with the
letter 'B'.
7. Write a SQL statement to find all those salesmen
with all information whose names are ending
with the letter 'n'
8. Write a SQL statement to find those salesmen
with all information whose name containing the
1st character is 'N' and the 4th character is 'l' and
rests may be any character
9. Display the salesman details in ascending order of
his age
10. Display names of salesman containing two a‘s in
his name
11. Display the count of salesman within the age
group 25 to 35
12. Display the total number of salesman staying in
each city
Module 2: in Implementation of JAVA Database connectivity. 0.5 5
Java class
Connectivity **Assignment 1. Write a program to do the following: 2.5 5
Topics i) Develop the following JSP page:

ii) After giving the details of an employee, the

information should be stored in the database. The
message should be displayed as “Employee
information are stored successfully”. Create a table
named as “Login” having two columns User Id and
Password. Write a program to create a login page.
Once the user performs the login, the authentication
should be checked from the login table and ”Valid
Login” or ”Invalid Login” should be displayed.
Module 3: in Implementation of different types of Joins 0.5 2
SQL Joins, class
Subqueries and **Assignment Consider the following schema: 2.5 2
Constraints Topics Sailors (sid, sname, rating, age)
Boats (bid, bname, color)
Reserves (sid, bid, day(date))
 1. Find all information of sailors who have reserved
boat number 101.
2. Find the name of boat reserved by Bob.
3. Find the names of sailors who have reserved a red
boat, and list in the order of age.
4. Find the names of sailors who have reserved at
least one boat.
5. Find the ids and names of sailors who have
reserved two different boats on the same day.
6. Find the ids of sailors who have reserved a red
boat or a green boat.
7. Find the name and the age of the youngest sailor.
8. Count the number of different sailor names.
9. Find the average age of sailors for each rating
level.
10. Find the average age of sailors for each rating
level that has at least two sailors.
in class Implementation of Subqueries and Views 0.5 4

**Assignment Consider the following schema: 2.5 4

Topics Sailors (sid, sname, rating, age)
Boats (bid, bname, color)
Reserves (sid, bid, day(date))
Write subquery statement for the following queries.
1. Find all information of sailors who have reserved
boat number 101.
2. Find the name of boat reserved by Bob.
3. Find the names of sailors who have reserved a red
boat, and list in the order of age.
4. Find the names of sailors who have reserved at
least one boat.
5. Find the ids and names of sailors who have
reserved two different boats on the same day.
Database Management System Lab(CS 1462)
Computer Science and Engineering Page 39
6. Find the ids of sailors who have reserved a red
boat or a green boat.
7. Find the name and the age of the youngest sailor.
8. Count the number of different sailor names.
9. Find the average age of sailors for each rating
level.
10. Find the average age of sailors for each rating
level that has at least two sailors.
in class Implementation of different types of constraints 0.5 2

**Assignment Create a table called EMP with the following 2.5 2

Topics structure.
Name Type
---------- ----------------------
EMPNO NUMBER (6)
ENAME VARCHAR2 (20)
JOB VARCHAR2 (10)
DEPTNO NUMBER (3)
SAL NUMBER (7,2)
 1. Allow NULL for all columns except ename and
job.
2. Add constraints to check, while entering the
empno value (i.e) empno > 100.
3. Define the field DEPTNO as unique.
4. Create a primary key constraint for the table
(EMPNO).
5. Create another table and add foreign key in table
emp
in class Implementation of Database Backup & Recovery 0.5 2
Commands,
Rollback, Commit, save point.
**Assignment 1. Write a query to implement the save point. 2.5 2
Topics 2. Write a query to implement the rollback.
3. Write a query to implement the commit.
Module 4: in class Basics of PL/SQL 0.5 3
PL/SQL
**Assignment 1. Write a PL/SQL block to find the largest of two 2.5 3
Topics numbers.
2. Write a PL/SQL block to calculate the area of a
circle.
3. Write a PL/SQL block to calculate simple
interest and compound interest.
4. Write a PL/SQL block to find the sum of first
100 odd nos. and even nos.
5. Write a PL/SQL block to find the sum of first
100 natural nos.
in class PL/SQL Continued 0.5 3
**Assignment 1. Write a PL/SQL block to find the sum of digits 2.5 3
Topics of a number.
2. Write a PL/SQL block to reverse the digits of a
number.
3. Write a PL/SQL block to raise the salary by 20%
of given employee on following table.
Emp_Salary (eno, ename, city, salary)
4. Write a PL/SQL block to check whether a string
is a palindrome or not.
5. Write a PL/SQL block to check whether a given
number is a Armstrong number.
6. Write a PL/SQL block to find factorial of a
number.
7. Write a PL/SQL block to check whether a
number is prime or not.
8. Write a program to generate all prime numbers
below 100.
Module 5: in class Basics of MongoDB 0.5 1
MongoDB **Assignment Write a MongoDB query for the following: The 2.5 1
Topics collection in the database should have the name
‘Departments‘. It should have the following
fields: Departments (Dept_id, Dept_name,
Manager_id, Location) Insert at-least SIX records.
a) Find the names of all departments which are
located at Kolkata.
 b) Sort the departments according to increasing
order of their ‘Dept_id‘.
c) Find the names of all departments which are
located either in ‗Delhi‘ or ‘Bombay‘.
d) Rename the department name where
Manager_id is 100.
in class MongoDB continued 0.5 1
**Assignment Write a MongoDB query for the following: The 2.5 1
Topics collection in the database should have the name
‘Project‘. It should have the following fields:
Project(Project_id, P_name, Department,
no_of_member, P_cost ) Insert at-least SIX
records. a) Find the Project_id and P_name of all
projects belongs to ‘CSE‘ department.
b) Sort the projects alphabetically with respect to
project name.
c) Find the names of all projects belong to both
‘ECE‘ and ‘EE‘ department.
d) Change the P_cost for project_id=5 to
1,00,000.

Text Books:
1. Elmasri and Navathe: “Fundamentals of Database Systems”, Addison Wesley.
2. Silberschatz, Korth, Sudarshan, “Database System Concepts”, McGraw-Hill

Reference Books:
1. Thomas Connolly, Carolyn Begg, “Database Systems – A Practical Approach to
Design, Implementationand Management”, Pearson Education.
2. Jefrey D. Ullman, Jenifer Widom, “A First Course in Database Systems”, Pearson
Education.
3. Bipin C Desai, “An Introduction to Database Systems”, Galgotia.
4. Atul Kahate, “Introduction to Database Management Systems”, Pearson.
5. Ian Robinson, Jim Webber, Emil Eifrem,”Graph Databases”,O'Reilly Media.
6. Gaurav Vaish, ”Getting started with NoSQL”, Packt.
 Sub Code: IT311A1 Credit: 4(L-3, T-1, P-0)
ARTIFICIAL INTELLIGENCE
Questions to be set: 05 (All Compulsory)
Course Objectives: The aim of this course is to provide an introduction to some fundamental issues
and algorithms in artificial intelligence (AI). The course approaches AI from an algorithmic, computer
science- centric perspective. The course aims to provide some fundamental tools and algorithms
required to produce AI systems able to exhibit limited human-like abilities, particularly in the form of
problem solving by search, representing and reasoning with knowledge, planning, natural language
understanding, computer vision, automatic programming and machine learning.

Pre-requisites: Algorithms will be an essential component, in addition the course requires some mathematics
specially Calculus, Probability and statistics. Natural Sciences Mathematics or equivalent, and Discrete
Mathematics, are likely to be helpful although not essential. Mathematical Methods for Computer Science,
Probability, Logic and Proof, Prolog and Complexity Theory are likely to be useful.

Course Outcomes (CO): On successful completion of this course, the student should be able to:
1. Distinguish between the popular view of the field and the actual research results.
2. Appreciate the fact that the computational complexity of most AI problems requires us
regularly to deal with approximate techniques.
3. Describe different perspectives on what the problems of artificial intelligence are and how
different approaches are justified.
4. Design basic problem solving methods based on AI-based search, knowledge
representation, reasoning, planning, and machine learning algorithms.
5. Identify problems requiring AI based solutions.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Introduction: Definition of AI, Overview of 10 1,2
< Introduction Class Artificial Intelligence- Problems of AI, AI
to Artificial techniques, Turing test, Typical AI problems:
Intelligence & Tic -Tac- Toe problem, 8-puzzle problem, 8-
Machine Quenes problem.
Learning> Machine Learning: Learning- Supervised and
Unsupervised learning, adaptive Learning,
Reinforcement learning, Linear classification,
Loss minimization, Stochastic gradient
descent, K-Means Algorithm, The perceptron.
Learning by gradient descent. Multilayer
perceptron and the back propagation
algorithm, Deep learning, Auto-encoders,
CNNs, RNNs, Introduction to Natural
Language Processing.
 **Assignme Intelligent and Rational agents , Practical impact
nt Topics of AI
Module 2: In Problem solving by Search : Tic -Tac- Toe 11 2,3
< Problem Class problem, 8-puzzle problem, 8-Quenes
solving by problem. State space search, Uninformed
Search & search strategies: BFS, DFS, Depth Limited
Informed search, Iterative Deepening DFS, Bi-
Search directional depth first search.
Techniques> Informed Search Techniques : Informed
(Heuristic) Search Strategies, Best First
Search (BFS), Greedy BFS, A* Search,
Heuristic Functions, Iterative-Deepening A*,
Hill Climbing Search, Genetic Algorithms.
**Assignme Problems, Problem Space & search,
nt Topics Formulating problems: Pegs and Disks
problem, Missionary Cannibals problem
,Simulated Annealing Search, Local Beam
Search.
Module 3: In Adversarial Search : Game Trees, Optimal 7 4,5
< Adversarial Class Decision in Games: Minimax Algorithm,
Search & Alpha Beta Pruning, TD learning, Game
Bayesian theory.
Networks> Bayesian Networks : Bayesian inference,
Marginal independence, Hidden Markov
models, Learning Bayesian networks, Laplace
smoothing, Expectation Maximization,
Representing knowledge in an uncertain
domain, the semantics of Bayesian networks,
Dempster-Shafer theory, Fuzzy sets & fuzzy
logics.
**Assignme
nt Topics
Module 4: in class Constraint Satisfaction Problems: N-Queen 7 3,4,
< Constraint problem, Crossword puzzle, Map coloring 5
Satisfaction problem, Boolean satisfiability problem
Problems > (SAT). The backtracking algorithm for CSPs.
Heuristics for improving the search for a
solution. Forward checking.
**Assignme Constraint propagation and arc consistency.
nt Topics Backtracking, Back jumping using
Gaschnig’s algorithm, Graph-based back
jumping.
Module 5: in class Logic programming, forward verses backward 8
< Knowledge reasoning, matching, control knowledge.
representation **Assignme Knowledge representation issues, 4,5
and Reasoning nt Topics representation & mapping, approaches to
> knowledge representation, representing
 simple fact in logic, Syntax versus semantics,
Propositional logic, Predicate logic, Horn
clauses, First-order logic Resolution,
representing instant & ISA relationship,
computable functions & predicates,
resolution, natural deduction. Procedural
verses declarative knowledge

Text Books:
1. Russell, S. & Norvig, P. (2010). Artificial intelligence: a modern approach. Prentice Hall (3rd ed.).
2. Elaine Rich, Kevin Knight & Shivashankar B. Nair (2008). Artificial Intelligence (Third Edition) TMH.
3. Bishop, C. M. (2006) Machine Learning and Pattern Recognition. Berlin: Springer.

Reference Book:
1. Poole, D. L. & Mackworth, A. K. (2010). Artificial intelligence: foundations of computational
agents. Cambridge University Press.
2. Nilsson, N. J. (1998) Artificial Intelligence - A Modern Synthesis. Palo Alto: Morgan Kaufmann
 Sub Code: IT312A1 Credit:4(L-3, T-1, P-0)
FORMAL LANGUAGES AND AUTOMATA THEORY
Questions to be set: 05 (All Compulsory)
Course Objectives: This course builds upon preliminary knowledge delivered in discrete structure for computer
science and computer programming concepts. The main objectives of the course are to provide learners with a
detailed understanding of the mathematical models of the machines and their evolution through requirement
generation and advancement in languages. Thorough the concepts and operations in Formal Language and
Automata Theory, their use in Compiler Design and their application in Natural Language Processing.
Pre-requisites: Knowledge in discrete mathematics and in programming.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Explain different concepts in automata theory and formal languages.
2. Produce various grammars and their acceptors.
3. Analyze the various language acceptors.
4. Acquire a fundamental understanding of computational models related to decidability and
recursive enumerability.
5. Illustrate various proofs using mathematical principles

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: In Definitions: Language, Grammar, Automata, 9 1,2

<Introduction Class Relation between language, Grammar and
& Finite automata, Importance of automata theory.
Automata> Informal introduction: Drawing examples from
everyday life to bring out the essence of finite
automata, Finiteness and its importance in
automata theory. Deterministic finite automata:
Definition, Processing strings, Transition
functions, Language of a DFA; Nondeterministic
finite automata: Non-determinism, Definition,
Extended transition functions, Language of a NFA,
Equivalence of DFA and NFA, Kleene's theorem,
Epsilon transitions, Applications of Finite
automata in text search.
**Assignment Mathematical preliminaries: Sets, Logic,
Topics Functions, Relations, Languages.

Module 2: In Memory required to recognize a language, Regular 8 3,5

<Regular Class expressions, Regular expression to finite automata,
Expressions Finite automata to regular expression, Algebraic
and Regular laws for regular expressions, applications of
Languages> regular expressions, Criterion for regularity,
Regular languages. Pigeonhole principle, Pumping
lemma for regular languages, Closure properties.
 **Assignment Testing membership of regular languages,
Topics Equivalence of automata.

Module 3: in Definition, Leftmost and rightmost grammars, 6 2

<Context Free class Parse trees, Ambiguity: Ambiguous grammar,
Grammars and removing ambiguity. Normal forms, Applications
Languages> of context free grammars: Parsers.
**Assignment
Topics

Module 4: in class Definition of pushdown automata, Representing 10 2,3

<Pushdown pushdown automata, Acceptance by pushdown
Automata, automata: By final state, By empty stack,
Context Free Deterministic pushdown automata, Equivalence of
Languages & pushdown automata and context free grammars,
Turing Testing membership of context free, Decision
Machines> problems for context free languages.
Definition, Language of a Turing Machine,
Programming Turing Machines, The Church-
Turing Thesis, A simple programming language,
Extensions of the Basic Turing Machine.
**Assignment Pumping lemma for context free languages,
Topics Closure properties of context free languages,

Module 5: in class Definition, Enumeration, Chomsky hierarchy. 7 2,4

<Recursively The halting problem, the post correspondence
Enumerable problem.
Languages, Learning framework, Inductive inference.
Undecidability **Assignment Time and space complexity of Turing machines,
& Language Topics Complexity classes.
Learning> Grammar induction

Text Books:
1. John. E. Hopcroft, Rajeev Motwani, Jeffry.Ullman, Introduction to Automata Theory, Languages
and Computation, Pearson Education.
2. Peter Linz, An Introduction to Formal Languages and Automata, Narosa

Reference Books:
1. James. L. Hein, Discrete Structures, Logic and Computability, Narosa
2. Partha Niyogi, The Computational Nature of Language Learning and Evolution, PHI.
3. C.K. Nagpal, Formal Languages and Automata Theory, Oxford University Press, 2011.
4. John Martin , Introduction to Languages and the Theory of Computation, Tata McGraw Hill.
 Sub Code: IT313A1 Credit:4 (L-3, T-1, P-0)
COMPUTER NETWORKS
Questions to be set: 05 (All Compulsory)

Course Objectives: This course emphasizes on several computer network concepts, applications
and protocols in OSI as well as TCP/IP layered architecture. It also covers the various protocols of
various layers, their operations and applications. Further it discusses the concept of network
security, challenges and their counter measures.
Pre-requisites: Communication Techniques.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Understand and identify the engineering fundamentals concerning Data Communication and
Computer Network.
2. Identify the complex engineering problem involved in Data communication and its architecture
for a successful network based communication.
3. Ability to Practice and formulate a solution for an engineering problem concerning any layers in
Data Communication model
4. Demonstrate an ability to formulate and interpret a model based on the fundamentals of
Computer Networks
5. Compare and understand the IOS reference model and TCP-IP reference model for data
communication

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Introduction to data communications, Types of Network, 9 1,5

<Overview & class Store and forward, Packet Switching, Circuit Switching,
Data Link Layered architecture: OSI and TCP/IP, Performance
Layer > Metric: Delay, Throughput, Jitter Data link layer design
issue, Error detection and correction: Parity bit,
Polynomial: CRC. Elementary data link protocol:
Random Access: ALOHA, Slotted ALOHA, CSMA,
CSMA/CD, Controlled Access: Reservation, Polling.
Ethernet Frame Structure, L2 Addressing, ARP.

**Assignment
Topics

Module 2: in Network Topology and performance evaluation, Internet 9 1,2

< Network class Protocol: IPv4 and IP addressing and sub-netting.
Layer & Internet Control Message Protocol (ICMP), Mapping
Routing> Physical to Logical Address: Reverse Address
Resolution Protocol (RARP), Dynamic Host
Configuration Protocol (DHCP).
Structure of IP datagram, Network Address Translation
(NAT). Distance Vector routing (DVR), Link state
routing, and Interior gateway protocol: Routing
Information Prortocol (RIP) and Open Shortest Path First
(OSPF), Exterior gateway protocol: Border Gateway
Protocol (BGP).
**Assignment
 Topics

Module 3: in Functions of transport layer protocols: Reliable and 9 1,3

< class unreliable service, Introduction to Transmission Control
Transpor Protocol (TCP) and User Datagram Protocol (UDP),
t Layer> Header description of TCP and User Datagram Protocol
(UDP), Congestion control mechanism of TCP.

**Assignment
Topics

Module 4: in class Brief overview of protocols in Application Layer: 9 1,4

< Domain Name Systems, Hyper Text Transmission
Applicati Protocol,), Multimedia Application: Audio and video
on streaming using UDP, VoIP.
Layer> **Assignment
Topics

Module 5: in class Confidentiality, Authenticity, Integrity and Non- 4 1,2

< Network repudiation, Attacks, Introduction to Symmetric and
Security & asymmetric Cryptography. Wireless LAN: IEEE 802.11
Other specification, CSMA/CA.
Network Introduction to Cellular Network, Ad Hoc Network and
Technologies Software Defined Network
> **Assignment
Topics

Text Books:
1. Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw Hill.
2. William Stallings, “Data and Computer Communications”, PHI.
Reference Books:
1. Andrew S. Tanenbaum, “Computer Networks”, PHI.
2. A S Godbole, “Data Communication and Networking”, Tata McGraw Hill.
3. William C Y Lee, “Mobile Communication Engineering”, Tata McGraw Hill.
4. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Wiley
Sub Code: IT314A1 Credit:4 (L-3, T-1, P-0)
SOFTWARE ENGINEERING
Questions to be set: 05 (All Compulsory)
Course Objectives: This course presents a comprehensive study of software quality assurance, including
software quality control management, processes, systems, methods, standards, certification, and reliability
measurement.
Pre-requisites: Procedure oriented and object-oriented programming paradigm.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Demonstrate competence in using engineering fundamentals to visualize solutions using
knowledge of software engineering skills.
2. Extend an ability to formulate a solution plan and methodology for an engineering problem using
software engineering.
3. Apply an ability to formulate and interpret a model for project management.
4. Explain an ability to define complex problem, find and analyze requirements
5. Apply new software models, techniques and technologies to bring out innovative and novelistic
solutions for the growth of the society in all aspects and evolving into their continuous professional
development.
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: In The software engineering discipline-evaluation and 8 1

<Introduction class impact, Programs vs. software products, Emergence
& Software of software engineering, Notable changes in software
Life Cycle> development practice, System engineering, handling
complexity through Abstraction and Decomposition.
Life Cycle Models: Classical waterfall model,
Iterative waterfall model, Prototype model,
Evolutionary model, Spiral model, RAD model, Agile
models, Introduction to Agile software development,
Extreme Programming and Scrum, DevOps, Domain
Analysis.
**Assignment Comparison of different life cycle models.
Topics

Module 2: In Responsibilities of project manager, Project planning, 8 3

<Software class Metrics for project size estimation techniques,
Project Empirical estimation techniques, COCOMO,
Management Halstead’s software science, Staffing level estimation,
& Scheduling, Staffing, Risk management, Software
Requirements configuration management.
Analysis and Requirements gathering and analysis, Software
Specification> requirement specification (SRS), Traceability,
Overview of formal system development techniques.
**Assignment Organization and team structure.
Topics
 Characteristics of a Good SRS Document, IEEE 830
guidelines.
Module 3: In Good Software Design, Cohesion and coupling, 8 2
<Software class Control Hierarchy: Layering, Control Abstraction,
Design Depth and width, Fan-out, Fan-in, Software design
(Function- approaches, object oriented vs function oriented
Oriented and design.
Object- Overview of SA/SD methodology, structured
Oriented analysis, Data flow diagram, Extending DFD
Software technique to real life systems, structured design,
Design)> detailed design, Design review. Unified Modeling
Language (UML), UML Diagrams: Static and
Dynamic.
**Assignment
Topics

Module 4: in class Mode-based Vs Mode-less Interface, Types of user 8 4

<User interfaces, Component-based GUI development, User
interface interface design methodology: GUI design
design, methodology, Task and object modeling, Selecting a
Coding and metaphor, Interaction design and rough layout.
Testing> Coding, Code review, Testing-Basic Concept of
testing, Testing Strategies, Testing in the large vs.
testing in the small, Unit testing, Black-box testing,
Integration testing, System testing, Some general
issues associated with testing, Test driven
development, testing tools, Special Value Testing,
Combinatorial Testing, Decision Table Testing,
Cause effect graphing, Pairwise Testing, White box
Testing, Condition Testing, MC/DC Coverage,
MC/DC Testing, Path Testing, Dataflow and Mutation
Testing, Debugging, Program analysis tools.
**Assignment Characteristics of a Good User Interface, User
Topics Guidance and Online Help.
User interface inspection
Module 5: in class Software reliability, Statistical testing, Software 8 5
<Software quality and management, ISO 9000, SEI capability
Reliability maturity model, Personal software process (PSP), Six
And Quality sigma, Software quality metrics.
Management, Case and its scope, Case environment, Case support in
Computer software life cycle.
Aided Characteristics of software maintenance, Software
Software reverse engineering, Software maintenance processes
Engineering model, Estimation maintenance cost. Basics issues in
& Software any reuse program.
Maintenance **Assignment
and Reuse> Topics

Other characteristics of case tools, Towards second

generation case tool, Architecture of a case
environment.
Reuse approach, Reuse at organization level.
Text Books:
1. Rajib Mall, “Fundamentals of Software Engineering”, PHI.
2. Richard Fairley, “Software Engineering Concepts”, Tata McGraw Hill.
Reference Books:
1. Jalote Pankaj, “An integrated approach to Software Engineering”, Narosa.
2. Pressman R, “Software Engineering- Practioner Approach”, McGraw Hill.
3. Somerville, “Software Engineering”, Pearson
4. Budgen, “Software Design”, Pearson
 Sub Code: IT315A4 Credit:1(L-0, T-0, P-2)
ARTIFICIAL INTELLIGENCE LABORATORY
Course Objectives: This course is designed to offer a comprehensive introduction to the fundamental concepts
and algorithms in artificial intelligence (AI), with a focus on algorithmic and computer
Science-centric perspectives.
Pre-requisites: Proficiency in programming languages such as Python, Java, or C++, including knowledge of data
structures and algorithms. Familiarity with basic concepts in mathematics, including calculus, linear algebra, and
probability theory.
Course Outcomes (CO): On successful completion of this course, students should be able to:
1. Write program related to AI, Problem Solving and Machine Learning Fundamentals.
2. Problem solving by Search & Informed Search Techniques.
3. Comprehensive understanding of intelligent decision-making processes in complex and uncertain
environments.
4. Solving Constraint Satisfaction Problems for Model real-world problems.
5. Design, apply and Implementation of Knowledge Representation Structures

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Students will gain hands-on experience in 4 1
<Introductio class implementing a simple AI algorithm for a classic
n to AI, game, Students will understand the principles of
Problem supervised learning, gradient descent optimization,
Solving and and how to implement a simple classification model
Machine in Python, Students will gain hands-on experience
Learning in building and training an RNN model for
Fundamentals sentiment analysis, along with an understanding of
> basic NLP concepts and deep learning architectures.
**Assignment
Topics

Module 2: in Implement different uninformed search strategies to 4 2

<Problem class find the optimal move for a Tic-Tac-Toe game,
solving by Implement different informed search strategies to
Search & solve the 8-Puzzle problem using heuristic
Informed functions, Solve the 8-Queens problem using
Search various search techniques.
Techniques> **Assignment
Topics

Module 3: in Implementation of Minimax algorithm for playing 4 3

<Adversarial class Tic-Tac-Toe against an AI opponent, Construction
Search & of a Python-based chess engine that utilizes the
Bayesian Alpha-Beta Pruning algorithm for efficient move
Networks> selection, performing medical diagnosis using
Bayesian inference.
**Assignment
Topics
 Module 4: in class Implementation of the N-Queen problem using the 7.2 4
<Constraint backtracking algorithm and Map Coloring problem
Satisfaction using forward checking heuristic. These exercises
Problems> should provide a hands-on experience with
implementing CSPs, backtracking, and forward
checking in Python.
**Assignment
Topics

Module 5: in class Implementation of the concepts of propositional 7.2 5

logic, syntax, and semantics by performing various
<Knowledge operations like Syntax Checker, Truth Table
Representati Generator, Semantic Analyzer. Exploration of
on and predicate logic and its applications in knowledge
Reasoning representation by performing the exercises of
> Predicate Logic Parser, Knowledge Base
Constructor, Inference Engine.
**Assignment
Topics

** Assignment Topics: Exercises to be formulated by the course instructor to cover a range of AI and ML
topics and provide students with practical experience in implementing algorithms and models using Python.

Text Books:
1. Russell, S. & Norvig, P. (2010). Artificial intelligence: a modern approach. Prentice Hall (3rd ed.).
2. Elaine Rich, Kevin Knight & Shivashankar B. Nair (2008). Artificial Intelligence (Third Edition)
TMH.
3. Bishop, C. M. (2006) Machine Learning and Pattern Recognition. Berlin: Springer.

Reference Book:
1. Poole, D. L. & Mackworth, A. K. (2010). Artificial intelligence: foundations of computational
agents. Cambridge University Press.
2. Nilsson, N. J. (1998) Artificial Intelligence - A Modern Synthesis. Palo Alto: Morgan Kaufman.
 Sub-Code: IT316A4 Credit:1 (L-0, T-0, P-2)
COMPUTER NETWORKS LABORATORY
Course Objectives: At least 10 experiments covering the entire syllabus of the corresponding theory paper to
be carried out using the theory studied /programming skill of the subject concerned to get insight into
thepractical applications of the theoretical studies. The outcome of the lab classes must lead to a skilled and
self-sustained program developer.
Pre-requisites: Communication Technique and Data Communication
Course Outcomes (CO): On successful completion of this course, the student should be able to:
1. Identify and understand various functions used in socket programs
2. Develop and test of socket program for client server interaction for various purpose.
3. Implementing and Validate Sub network with static and various dynamic routing protocols.
4. Analyze the packet structure of various protocols used for communication
5. Understand the fundamentals of SDN
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to client-server architecture, 4 1,2
TCP Socket class Introduction to working of TCP, functions
Programs related to TCP Socket Programming.
**Assignment Program to write a simple Message passing 3 1,2
Topics TCP socket program, TCP Socket program with
specific aim, TCP socket program involving
multiple clients.
Module 2: in Introduction to client-server architecture, 4 1,2
UDP Socket class Introduction to working of UDP, functions
Programs related to UDP Socket Programming.
**Assignment Program to write a simple Message passing 3 1,2
Topics UDP socket program, UDP Socket program
with specific aim.
Module 3: In Introduction to classless IP, Introduction to 3 3
Creating/Designing Class CIDR and VLSM, Introduction to Network
Sub-network with Devices and Sub-netting, Basic Router
Static routing configuration followed by Static route
configuration
**Assignment To configure the sub-network with given 3 3
Topics requirements and configure the static route in
the topology for routing.
Module 4: in class Revision to CIDR and VLSM, revision to Basic 3 3
Creating/Designing Router configuration followed by Dynamic
Sub-network with route configuration
Dynamic routing **Assignment To configure the sub-network with given 3 3
Topics requirements and configure the Dynamic route
in the topology for routing.
Module 5: in class Introduction to Software Defined Network, 3 4,5
Introduction to Introduction to Installation of Mininet,
SDN and traffic Overview of Mininet environment,
Monitoring Introduction to tools like ipref and wire shark.
 **Assignment To establish and configure the simple SDN 3 4,5
Topics network topology and use tools like ipref and
wire shark for necessary analysis.

Text Books:
1. Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw-Hill
2. Andrew S. Tanenbaum, “Computer Networks”, PHI.
Reference Books:
1. William Stallings, “Data and Computer Communications”, PHI.
2. Alberto Leon-Garcia, Indra Widjaja, “Communication Networks – Fundamental Concepts and
Key Architectures”, Tata McGraw-Hill
 Sub-Code:GN301A1 Credit: 1 (L-1, T-0, P-0)

QUANTITATIVE APTITUDE AND LOGICAL REASONING – I

Questions to be set: 05 (All Compulsory)

Course Objective: The main aim of introducing “Quantitative Aptitude & Logical Reasoning” to university
students is to develop numerical skills among students and to prepare them for various examinations to enhance
better job prospects. This initiative is being taken to include essential mathematical principles to build students'
confidence. It is expected to expand students' knowledge and foster their logical reasoning and analytical thinking
abilities.

Pre-requisites: NIL

Course Outcomes (CO): On successful completion of this course, the student should be able to:

1. Solve variety of simple problems in the space of quantitative domain.

2. Use data to determine or to deduce other facts from a set of given data of less complexity.
3. Use shortcuts, tricks and techniques to solve the problems with moderate accuracy.
4. Demonstrate essential skills pertaining to public speaking, resume writing and telephone
etiquette.
5. Demonstrate basic skills during the placement interviews

Module Topics to Topics Hrs. CO PO PSO

be
covered
Module 1: In class Problems on Trains, Time and Distance, Height and 6 1
Quantitative Distance, Time and Work, Simple Interest,
Aptitude Compound Interest, Profit and Loss, Partnership,
Percentage, Problems on Ages, Calendar, Clocks,
Average, Area, Volume and Surface Area
Module 2: In class Sudoku, Number Puzzles, Missing Letter Puzzles, 3 2
Puzzles, Playing Card Puzzles, Clock Puzzles.
Problem
Solving and
Analysis
Module 3: In class Number Series, Letter and Symbol series, Verbal 5 3
Logical Classification Essential Part, odd man out and
Reasoning visual reasoning, Analogies, Artificial Language,
Matching Definitions, Making Judgements.
Module 4: In class Resume Writing, Public Speaking, Extempore, 4 4
Professional Telephone etiquette.
Builder
Module 5: In Class Mock Interview – Hard and Soft Skills 2 5
Use Cases Sector: FMCG, IT, Production, Manufacturing etc.

Text books:
1. Aggarwal, R. S. (2008). Quantitative Aptitude. S. Chand., ISBN: 9788121924986, 8121924987
2. Devi, S. (2005). Puzzles to puzzle you. Orient Paperbacks., ISBN: 8122200141, 9788122200140
 Sub-Code: IT318A9 Credit:1 (L-0, T-0, P-2)
INDUSTRIAL TRAINING-I
Course Objectives: The students are required either to undergo after 4th semester in the summer
break/Vacation Straining in industries or to attend summer training course on courses beyond the scope of
normal curriculum organized by the Department by calling experts from outside or to visit in industry for
gaining valuable knowledge

Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Select and provide comprehensive learning platform to students where they can enhance
their employ ability skills and become job ready along with real corporate exposure.
2. Adapt and enhance knowledge in one particular technology
3. Express and demonstrate self-confidence and helps in finding their own proficiency.
4. Develop leadership ability and responsibility to perform or execute the given task
5. Illustrate and practice within a real job situation.
Sub Code: BA346A1 Credit: 2 (L-2, T-0, P-0)

INDUSTRIAL MANAGEMENT

Questions to be set: 05 (All compulsory)

Course Objective: To provide basic knowledge of functions of management along with their practical implications

Pre-requisites: No pre-requisites

Course Outcomes (CO): On successful completion of this course, the student should be able to:

1. Provide basic knowledge and application of functions of management

2. Understand and apply principles of management evolved by pioneers of management.
3. Apply basic quantitative techniques for making decisions related to operations management
4. Apply various techniques for optimal production management
5. Apply concepts of materials management for maintaining optimal inventory

** Not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Philosophy and Development of Management
In Class thought. Concept and definition of management, 3 1
Introduction Functions and Roles
of Management, Social Responsibilities of Management.
**
Assignment 1
Topics
Taylor’s Scientific Management, Contribution of
In Class Henry 3 2
Pioneers in
Management Fayol, Maslow, McGregor, Gilbreth and Mayo.
**
Assignment 2
Topics
Concept of budget and budgetary control. Time-event
Quantitative In Class network analysis; ABC Analysis, Break-even Analysis;
Techniques in Decision Tables; Concept of productivity,
Managerial measuring 5 3
Decisions productivity, Use information technology
**
Assignment 3
Topics
Types of production; Types of Planning, Manufacturing
Planning; Production planning, Scheduling; Work study
Production
In Class & Method Study; Systems of wage payments, bonus, 5 4
Management
Automation. Organization of production, planning
and
control department.
**
Assignment 4
Topics
Practice of purchasing and materials management,
In Class quality, 4 5
Materials Inventory Management, EOQ model; Value Analysis
Management and Value Engineering.
 **
Assignment 5
Topics

Text Books:

1. H. Koontz and H. Weihrich, “Management”, McGraw Hill

2 Dobler W.D. “Purchasing & Materials Management”, TMHC, New Delhi
 Sub Code: IT321A1 Credit: 4 (L-3, T-1, P-0)
OPERATING SYSTEMS
Questions to be set: 05 (All Compulsory)
Course Objectives: The principles and concepts that govern the design of modern computer operating
systems are studied. Managing computing resources such as the memory, the processor and the
Input/output devices are covered. Algorithms for CPU scheduling, memory and general resource
allocation; process coordination and management; deadlocks and memory management techniques;
case studies of Linux operating systems are also covered.
Pre-requisites: Computer Organization and Programming Language concepts.
Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Describe the different operating system architectures and structures.

2. Select the appropriate scheduling algorithms or techniques for efficient utilization of computer
resource like CPU, Memory, etc.
3. Interpret theory of data inconsistency problem and provide a procedure for synchronization problem.
4. Manage various technical issues related to operating systems’ services using principles of
computer science and engineering.
5. Compose methods for analyzing the performance of various identified algorithms or
techniques in operating systems

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Basics of Computer Organization, Interrupt, Bus, 7 1

<Introduction> class ISA, CPU Operation. What operating systems do?
Operating system structure, Operating system
operations, Special-purpose systems, Operating
system services, User-operating system interface,
System calls, Types of system calls.
**Assignment Operating system design and implementation. Case
Topics study: Linux Design Principles

Module 2: in Process: Concept, Multithreaded programming, 9 2,5

<Process class Multithreaded models, Thread libraries, Threading
management > issues, Process scheduling criteria and algorithms,
Thread scheduling, Operating-system examples.
**Assignment Case study: Linux Process and I/O Scheduler.
Topics

Module 3: in Critical section problem, Peterson’s solution, 8 3

<Process class Synchronization hardware, Semaphores, Classic
synchronization> problems.
**Assignment Monitors, Examples.
Topics
 Module 4: in class System model, Characterization, Methods of 9 2,4
< Deadlock & handling deadlocks, Prevention, Avoidance,
Memory Detection and recovery. Fixed and variable
management > partition, Swapping, Paging and segmentation,
Structure of page table, Combined systems, Virtual
memory: Overlays, Demand paging, Copy-on-
write, Page replacement, Allocation of frames,
Thrashing, Allocating kernel memory. Case study:
Linux Memory Management
**Assignment
Topics

Module 5: in class File system concept, Access methods, Directory 7 2

< File systems & structure, File- system mounting, File sharing,
I/O systems> Protection.
Overview, Kernel I/O subsystem, Kernel Data
Structure, Transforming I/O requests to Hardware
Operations,
**Assignment Allocation methods.
Topics Case Study: Linux I/O Systems.

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Concepts”,
Wiley & Sons.Inc..
2. D M Dhamdhere, “Systems Programming & Operating Systems”, Tata McGraw-Hill.

Reference Books:
1. Andrew S. Tanenbaum, “Modern Operating systems”, PHI.
2. Mukesh Singhal, Niranjan G.Shivaratri, “Advanced Concepts in Operating Systems”, Tata McGraw-
Hill.
3. P. Balakrishna Prasad, “Operating Systems”, Scitech Publication.
4. William Stallings, “Operating Systems-Internals and Design Principles”, Pearson Education
 Sub Code: IT322A1 Credit: 4 (L-3, T-1, P-0)
WEB TECHNOLOGY AND WEB SERVICES
Questions to be set: 05 (All Compulsory)
Course Objectives:
1. To equip learners with adequate skills to conceptualize, design and develop well-engineered websystems.
2. To enable learners to apply free and open source web technologies for developing powerful and
scalable web applications.

Pre-requisites: Programming language concepts, Computer Networks, Database Systems.

Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Identify the various terms and components of HTML, CSS, JavaScript, PHP and Drupal
2. Illustrate various components of web development languages
3. Connect different modules of open source technologies for website development
4. Select appropriate web technology for implementing solution to a given problem
5. Construct a web domain using appropriate tools and techniques
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in History of internet and world wide web, World Wide 8 1,2
< class Web consortium, Web architecture, Web 2.0, HTTP
Introduction protocol, Personal, distributed and client-server
& HTML computing.
AND Introduction, editing XHTML, w3c XHTML
XHTML> validation service, headers, linking, images, special
characters, unsorted lists, nested and ordered lists,
XHTML tables, XHTML forms, internal linking.
**Assignment Web browser basics, Browser portability, meta
Topics elements.

Module 2: in HTML5 Basics, HTML5 Syntax, New HTML5 7 2

< HTML5> class Elements, Times and Dates, Browser Support,
Semantic Formatting, New Input Types and Attributes,
New Form Elements and Attributes, Playing Audio,
Playing Video.
**Assignment The Canvas, Other HTML5 Technologies.
Topics

Module 3: in Inline styles, embedded style sheets, conflicting styles, 9 1,3

<Style class linking external style sheets, positioning elements,
Sheets, backgrounds, element dimensions, Box Model and text
JQuery and flow, Media Types, Building a CSS drop-down menu.
Ajax> JQuery: Introduction, What JQuery does, Functions,
Selecting elements, Useful predefined Jquery
functions, Add page elements, Adding events, Ajax:
Introduction to Ajax: Overview of Ajax; The basics of
Ajax.
 **Assignment User style sheets. Formatting elements
Topics

Module 4: in class LAMP Technology, PHP: Origins and uses of PHP, 3,5
<Server Side Overview of PHP, General syntactic characteristic,
Programming Primitives, operations and expressions, Control
& Database statements, Looping, Arrays, Functions, Form
Access handling, Files.
through the Relational Databases, An introduction to SQL, The
Web > MySQL Database system, Database access with PHP
and MySQL.
**Assignment Cookies, Session tracking. Architectures for Database
Topics access

Module 5: in class Basics of CMS, Workflow management using CMS, 4,5

<Case Free and open source content management frameworks
studies: in PHP: Drupal. Drupal: Drupaltechnology Stack in
Drupal as a LAMP Platform, Drupal modules: Core, contributed
Content and custom modules, Drupal Theme
Management Configuration, Site Building: Content Type, Entity,
System > Nodes, Views, Blocks, Taxonmoy, User management.
**Assignment Wordpress, Joomlaand, permission and roles.
Topics

Text Books:
1. M. Deitel, P.J. Deitel, A. B. Goldberg, “Internet & World Wide Web How to program”, 3rd
Edition, Pearson Education, 4 th edition, PHI, 2011.
2. Robert W. Sebesta, “Programming the World Wide Web”, 4th Edition, Pearson Education.

Reference Books:

1. Chris Bates, “Web Programming Building Internet Applications”, 3rd Edition, Wiley India.
Joyce Farrell, XueBai, Michael Ekedahl, “The Web Warrior Guide to Web Programming”, Thomson
 Sub Code: IT323A4 Credit:1(L-0, T-0, P-2)
OPERATING SYSTEMS LABORATORY
Questions to be set: 05 (All Compulsory)
Course Objectives: At least 10 experiments covering the entire syllabus of the corresponding theory
paper to be carried out using the theory studied /programming skill of the subject concerned to get
insight into the practical applications of the theoretical studies. The outcome of the lab classes must
lead to a skilled and self-sustained program developer.
Pre-requisites: Corresponding theory paper Operating Systems and the associated prerequisites
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Analyze and debug various technical issues related to operating systems services and use
different types of Modern OS
2. Illustrate the concept of process and thread creation for executing user's task.
3. Apply the theory for implementing various process scheduling algorithms.
4. Produce optimal solution for data inconsistency problem by synchronizing processes and
threads and deadlock handling.
5. Examine the various memory management strategies for efficient resource utilization
and implement it.
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to Process Creation, Termination, 1.5 1
Implementation class and use of various system call.
Shell command
of System Call Unix Process Implementation of different Linux tools and the 7.5 1
Control Shell proc file system.
Programming
Implementation Write a shell program to calculate the factorial
of System Calls of a given number.
Interprocess
Communication Implement the fork() system call that generates
using PIPE. the factorial and gives a sequence of series like
Interprocess 1, 2, 6, 24, 120… in the child process. The
Communication number of the sequence is provided in the
using SIGNALS command line.

Implement the C program in which main

program accepts an integer array. Main
program uses the fork system call to create a
new process called a child process. Parent
process sorts an integer array and passes the
sorted array to child process through the
command line arguments of execve system call.
The child process uses execve system call to
load new program that uses this sorted array for
performing the binary search to search the
particular item in the array.
 Implementation of full duplex communication
between parent and child processes using Pipe.

Module 2: in Introduction to Process, Process Life Cycle, 2 2

Scheduling class Scheduling Criteria, and Various algorithms.
Algorithms
Implementation of WAP to implement various preemptive and 10 2
CPU non-preemptive scheduling algorithms,
Scheduling including Multi-level Scheduling algorithm.
Algorithms
Module 3: in Introduction to Process Synchronization and 1 3
Interprocess class solution to Critical Section Problem. Discuss
Communication various classical synchronization problem.
Interprocess Write a program that creates a shared memory 5 3
Communication segment and waits until two other separate
using shared processes writes something into that shared
memory Producer memory segment after which it prints what is
Consumer written in shared memory.
problem using
semaphore Write a C program to implement the givengame
to illustrate Interprocess Communicationusing
shared memory

Implement producer consumer problem

(bounded buffer) using multithreading and
semaphore.

Implement Reader Writers problem using

multithreading and semaphore.
Module 4: in class Introduction to Deadlock, Conditions for 0.5 4
Deadlock deadlock to occur and solution for deadlock
handling
Algorithm for Implement Banker’s algorithm for deadlock 2.5 4
Deadlock avoidance.
Avoidance
Module 5: in class Introduction to Memory management for 1 5
VM optimization.
Management Implement of Implement FIFO page replacement algorithm 5 5
Page Implement LRU page replacement
Replacement algorithm
Algorithm

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Concepts”, Wiley &
Sons.Inc..
2. D M Dhamdhere, “Systems Programming & Operating Systems”, Tata McGraw-Hill.

Reference Books:
3. Andrew S. Tanenbaum, “Modern Operating systems”, PHI.
4. Mukesh Singhal, Niranjan G.Shivaratri, “Advanced Concepts in Operating Systems”, Tata McGraw-
Hill.
5. P. Balakrishna Prasad, “Operating Systems”, Scitech Publication.
6. William Stallings, “Operating Systems-Internals and Design Principles”, Pearson Education
 Sub Code: IT324A4 Credit: 1 (L-0, T-0, P-2)

WEB TECHNOLOGY & WEB SERVICES LABORATORY

Objectives: The objective of this laboratory is to develop an ability to design and implement static and dynamic
website and also further develop web application.

Pre-requisites: Java Programming Lab.

Course Outcomes (CO): At the end of the course, the student will be able to:

1. To be able to design web pages.

2. To be able to create dynamic web pages.
3. To be able to illustrate the web data representation and services.
4. To be able to apply the concept of web programming by implementing the server side and client
side programming.
5. To develop web applications using PHP, manage databases with MySQL, and understand the
fundamentals of LAMP technology.

List of Programs:

1. Writing a validate function in java script to check the information submitted in the form is correct.

2. Write a function in java script to move a text in a page.

3. Write a function in java script to capture the Mouse Position.

4. Write a function in java script to opens printer dialogue to print current page.

5. Write a function in java script to show the date and time dynamically in the browser title bar.

6. Write a function in java script to disable both left and right button of a mouse and display an alert message.

7. Write a function in java script that asks the visitor for his or her name when entering your page, then prints a
"Hello" welcome message anywhere you wish in the body of the page. If the visitor does not type in a message, a
default message shows, instead.

8. Write a function in java script to presents text surrounded by three changing 'glow' colors, while also shifting
the vertical and horizontal layout for a striking animation effect strongly resembling neon light displays. Colors,
dimensions, and rate are all settable.

9. Write a function in java script to create links with over- and under-lines that move from side to side on
mouseOver.

10. Write a function in java script to launch a popup window without the Windows frame or titlebar.

11. Write a JavaScript program for simple Calculator.

12. Various programs related to XML.

 Sub Code: GN302A1 Credit: 1 (L-1, T-0, P-0)
QUANTITATIVE APTITUDE AND LOGICAL REASONING - II

Questions to be set: 05 (All Compulsory)

Course Objective:
The key objective of this course is to strengthen the numerical skills and logical abilities & skills of university
students and prepare them for various competitive exams, thereby improving their employment opportunities.
This initiative aims to incorporate fundamental mathematical principles to build students' confidence.
Additionally, it seeks to broaden their knowledge and foster their logical reasoning and analytical thinking
skills.
Pre-requisites: NIL

Course Outcomes (CO): On successful completion of the course, the students will be able to:

1. Student will be able to solve variety of problems simple to complex in the space of
quantitative domain.
2. Students will be able to use data to determine or to deduce other facts from a set of given
data which are simple to complex.
3. Students will be able to use shortcuts, tricks and techniques to solve the problems with high
accuracy.
4. Students will be able to demonstrate essential skills pertaining to business communications.
5. Students will be able to demonstrate advanced skills required at the time of placement
interviews.

Module Topics to Topics Hrs. CO PO PSO

be
covered
Module 1: In class Problems on Permutations and Combinations, 8 1
Quantitative Probability, Numbers, Problems on Numbers,
Aptitude Problems on HCF and LCM, Decimal Fraction,
Simplification, Square Root and Cube Root, Surds
and Indices, Ratio and Proportion, Chain Rule,
Pipes and Cistern, Boats and Streams, Allegation
and Mixtures, Logarithm, Races and Games,
Stocks and Shares, Probability, True Discount, Odd
man out and Series.
Module 2: In class Logical Connectives and Syllogisms, Data 3 2
Puzzles, Interpretation, Cases, Venn Diagrams.
Problem
Solving and
Analysis
Module 3: In class Verbal Reasoning, Logical Problems, Logical 4 3
Logical Games, Data Arrangement and Blood Relations,
Reasoning Analyzing Arguments, Statement and Assumption,
Course of action, Statement and Conclusion,
Theme Detection, Cause and Effect, Statement and
Argument, Logical Deduction.
Module 4: In class CV Writing, Verbal & Non Verbal 2 4
Professional Communication, Group Discussion, Netiquettes,
Builder
Module 5: In Class Mock Interview on Hard and Soft Skills 3 5
Use Cases Sector - IT, FMCG, Product, Financials,
Manufacturing, Production, Construction etc.
 Text books:
1. Aggarwal, R. S. (2008). Quantitative Aptitude. S. Chand., ISBN: 9788121924986, 8121924987
2. Devi, S. (2005). Puzzles to puzzle you. Orient Paperbacks., ISBN: 8122200141, 9788122200140
 Sub Code: IT325A5 Credit:1 (L-0, T-0, P-2)
MINOR PROJECT

Course Objective: The students are required to undertake innovative and research-oriented project
under the direct supervision of a faculty member of the department. The mini project should not only to
reflect their knowledge gained in the previous semesters but also to acquire additional knowledge and
skill of their own effort.
Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Describe the basic concepts of computer science related to the problem under consideration
2. Identify an appropriate engineering problem to be solved
3. Construct an appropriate design methodology for software development and demonstrate
effective communication and writing skills
4. Experiment on a designed model and develop an ability to work in a team.
5. Evaluate the project based on application of knowledge and practical understanding of the model.
 Sub Code: IT411A6 Credit:10 (L-0, T-0, P-20)
MAJOR PROJECT-PHASE I

Course Objective: The students are required to undertake innovative and research-oriented project, not
only to reflect their knowledge gained in the previous semesters but also to acquire additional knowledge
and skill of their own effort.
During this phase, the students are required to submit progress of their work in phases to make the
department aware of his/her project. At the end, students have to report to the internal guides/faculty
members for final refinement and documentation. It is mandatory to follow the engineering methodologies
in carrying out the project work. The project is evaluated through internal presentation before the panel
of faculty members followed by the evaluation by external examiner appointed by the university.

Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Analyse, design and implement a computational system to meet desired needs within realistic
constraints.
2. Apply modern programming languages and technologies to develop a sustainable and robust
software / hardware application or perform qualitative analysis on computational systems using
appropriate tools.
3. Propose set of alternative design solutions to problems for which standard algorithmic solutions
do not exist.
4. Express ethics, values and respects legal as well as social issues for the computing profession
or computational application.
5. Justify the technical design incorporated in the computational system with the help of in-depth
analysis, presentation as well as document pertaining to the project work.
 Sub-Code: IT412A9 Credit:1 (L-0, T-0, P-2)
INDUSTRIAL TRAINING-II
Course Objectives: The students are required either to undergo after 6th semester in the summer
break/Vacation Straining in industries or to attend summer training course on courses beyond the scope of
normal curriculum organized by the Department by calling experts from outside or to visit in industry
for gaining valuable knowledge.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Select and provide comprehensive learning platform to students where they can enhance
their employ ability skills and become job ready along with real corporate exposure.
2. Adapt and enhance knowledge in one particular technology
3. Express and demonstrate self-confidence and helps in finding their own proficiency.
4. Develop leadership ability and responsibility to perform or execute the given task
5. Illustrate and practice within a real job situation.
 Sub Code: IT421A6 Credit:9 (L-0, T-0, P-18)
MAJOR PROJECT-PHASE II

Course Objective: The students are required to undertake innovative and research-oriented project, not
only to reflect their knowledge gained in the previous semesters but also to acquire additional knowledge
and skill of their own effort.
During this phase, the students are required to submit progress of their work in phases to make the
department aware of his/her project. At the end, students have to report to the internal guides/faculty
members for final refinement and documentation. It is mandatory to follow the engineering
methodologies in carrying out the project work. The project is evaluated through internal presentation
before the panel of faculty members followed by the evaluation by external examiner appointed by the
university.

Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Analyse, design and implement a computational system to meet desired needs within realistic
constraints.
2. Apply modern programming languages and technologies to develop a sustainable and robust
software / hardware application or perform qualitative analysis on computational systems
using appropriate tools.
3. Propose set of alternative design solutions to problems for which standard algorithmic
solutions do not exist.
4. Express ethics, values and respects legal as well as social issues for the computing profession
or computational application.
5. Justify the technical design incorporated in the computational system with the help of in-depth
analysis, presentation as well as document pertaining to the project work.
 Sub Code: IT211A3 Credit:4 (L-3, T-1, P-0)
PYTHON PROGRAMMING
Questions to be set: 05 (All Compulsory)
Course Objectives: This course introduces Python as imperative, functional, procedural and object oriented
programming language. Python also serves as a scripting language for web applications. The units cover the
Python language with a focus on its object-oriented features, web applicability and how these can be implemented
as part of program designs and implementation. The students shall also gain knowledge on practical applications
of python in scientific computing using libraries such as NumPy, Matplotlib etc.
Pre-requisites: Computer Programming concepts of C, C++ etc.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Define the basic structure of python programming.
2. Differentiate imperative, functional and procedural programming features in Python
3. Practice features for designing and implementing python program.
4. Compose applications using various libraries and concepts of Python.
5. Select methods to build and package Python modules for reusability

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in History, need of python programming, data 8 1,2
<Introduction class types, variables, expressions, operators,
& Python sequence, list, tuple, set, dictionary, print
Program statement, etc.
Flow Conditional blocks using if, else and elseif,
Control> Simple for loops in python, For loop using
ranges, string, Use of while loops in python,
Loop manipulation using pass, continue, break
and else,
**Assignment Programming using Python conditional and
Topics loops block, Functions.

Module 2: in Concept of class, object and instances, 8 2,3

< Python class Constructor, class attributes and destructors,
Object–based Real time use of class, Inheritance, overlapping
programming and overloading operators,
> **Assignment Adding and retrieving dynamic attributes of
Topics classes.

Module 3: in
< Error and class Difference between an error and Exception,
Exceptions & Handling Exception, try except block, Raising
Python Exceptions, User Defined Exceptions. 8 3
Regular Powerful pattern matching and searching, Real
Expression time parsing of networking or system data,
 and GUI Widgets and basic components, Layout options,
design > Event handling.

**Assignment Real time parsing of networking or system data,

Topics Widgets and basic components

Module 4: in class SQL Database connection using python, 8 4

<Python Creating and searching tables, Reading and
Database storing config information on database,
Interaction Programming using database connections,
and File Reading config files in python, Writing log files
Operation> in python, Understanding read functions: read(),
readline() and readlines().
**Assignment
Topics

Module 5: in class Study of modules for creating graphical user 8 4,5

< Python interfaces, connecting to relational databases,
Standard generating pseudorandom numbers, arithmetic
Library & with arbitrary precision decimals, manipulating
Applications> regular expressions, unit testing, Python
Package Index (PyPI).
APIs for scripting: Web Server Gateway
Interface, Web frameworks like Django,
Libraries for scientific computing such as
NumPy, SciPy and Matplotlib.
**Assignment Pylons, Pyramid, TurboGears,web2py,
Topics Tornado, Flask, Bottle, Zope etc.

Text Books:
1. Mark Lutz, “Programming Python”, O'Reilly.
2. W.Chun, “Core Python Programming”, Pearson.

Reference Books:
1. Allen Downey, “Think Python”, Green Tea Press
2. Mark Lutz, “Learning Python”, 3rd Edition, O'Reilly
3. Guido van Rossum and Jr. Fred L. Drake , “An Introduction to Python”, Network Theory Ltd.
 Sub Code: IT212A3 Credit: 4(L-3, T-1, P-0)

SYSTEM SIMULATION AND MODELING

Questions to be set: 05 (All Compulsory)
Course Objectives: This course envisages the fundamentals of discrete event simulation (DES),
which includesdiscrete event simulation methodology, development of simulation models,
verification and validation, and the design of simulation experiments.

Pre-requisites: Probability & Statistics and System Analysis concepts.

Course Outcomes: On successful completion of this course, students will be able to:
1. Explain the understanding of mathematical modeling through use in computer system modellingand
simulations
2. Describe the system behavior in investigating discrete event simulation, modeling and system
dynamics
3. Develop simulation models
4. Test validity of model through analysis of output data
5. Simulate the models for the purpose of optimum control by using different software.
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: in Components of a system, Model of a 8 1

Introduction to class system, Types of models, Discrete and
Simulation & Examples continuous systems, Components and
organization of a discrete event simulation
model, Continuous simulation, Monte Carlo
simulation, Steps in simulation study,
Advantages Disadvantages. Simulation of
Queuing systems, Simulation of inventory
systems, Simulation of Reliability Systems.

**Assignment Combined discrete continuous simulation,

Topics pitfalls of simulation

Module 2: in The event scheduling approach, The 8 1,2

General Principles and class process interaction approach, The activity
Modeling Complex scanning approach, List processing in
Systems. Statistical simulation: Approaches to storing lists in a
Models in Simulation computer, Time-shared computer model.
Review of terminology and concepts,
Useful statistical models, discrete
distributions, Continuous distributions.
**Assignment Multi-teller Bank with Jockeying, Job-
Topics Shop Model, Efficient event-list
manipulation.
Module 3: in Characteristics of queuing systems, 9 2,3
Queueing class Queueing Notations, Transient and Steady-
Theory & State behaviour of Queues, Long –Run
measures of performance of Queueing
 Random Systems, Steady state behavior of Infinite
Number population Morkovian models [M/G/1
Generation only].
Properties of random numbers, Generation
of pseudo random numbers, Random-
Number Generators : Linear Congruential
Generators, Combined Linear Congruential
Generators. Building Valid, Credible, and
Appropriately Detailed.

**Assignment Networks of Queues. Feedback Shift

Topics Register Generators, Tests for Random
Number Generators
Module 4: in class Guidelines for determining the level of 9 3
Simulation Model Details, Verification of Simulation
Models and Computer Programs, Techniques for
Selecting increasing Model Validity and Credibility.
Input Identifying the distribution with data,
Probability Estimation of Parameters, Determining how
Distributions representative the fitted distributions are,
Selecting input Models in the absence of
data, Models of arrival Processes(Poisson
process, Non stationary Poisson process,
batch arrivals).

**Assignment Statistical Procedures for Comparing

Topics Real- World Observations and
Simulation Output Data.
Module 5: in class Transient and Steady State behavior of a 9 4,5
Output Data Analysis for stochastic process, Types of simulations
a Single System and with respect to output analysis. Common
Experimental Design mistakes in experimentation, Types of
Experimental Designs, 2k factorial Designs.

**Assignment 2kr factorial Designs.

Topics

Text Books:
1. Averill M Law, “Simulation Modeling and Analysis”, Tata McGraw Hill.
2. Banks, Carson, Nelson, Nicol, “Discrete-Event System Simulation”, Pearson Education.

Reference Books:
1. Raj Jain, “The Art of Computer Systems Performance Analysis: Techniques for
Experimental Design,Measurement, Simulation, and Modeling”, John Wiley &
Sons.
2. Gordon, “System Simulation”, Prentice Hall.
3. Singh V.P, “System Modeling and Simulation”, New Age International.
4. Frank L. Severence, “System ModelingAnd Simulation: An Introduction”, Wiley
Sub Code: IT213A3 Credit: 4(L-3, T-1, P-0)

INFORMATION SYSTEMS AND SECURITY

Questions to be set: 05 (All Compulsory)

Course Objectives: To enable students to comprehend the development, design, and

implementation of Management Information Systems (MIS), and to understand the fundamentals
of information security assessment and security auditing.

Pre-requisites: Nil

Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Understand the basic principles of Management Information System and distinguish planning
and control of management system.
2. Identify the benefits and challenges of enterprise systems.
3. Examine the security risk assessment, control and measure the various security
management processes.
4. Demonstrate the security audit tasks and the key aspects of legal and ethical issues.
5. Develop skills in security auditing, logging, and audit trail analysis and understand the dynamics of
intellectual property, privacy, and ethical issues.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs
covered
Module 1: in Introduction to 6
Understanding class Management Information
MIS Systems, History of MIS,
Impact of MIS, Role and
Importance, MIS
Categories, Managers and
Activities in IS, Types of
Computers Used by
Organizations in Setting up
MIS.
**Assignment Hardware support for MIS.
Topics

Module 2: in Introduction, The Decision 6

Conceptual class Making Process, System
Foundations Approach to Problem
and Kinds of Solving, The Structure of
Information Management Information
Systems System.
Introduction, Types of
Management Systems
Concepts of Management
Organization, Planning and
Control: Introduction,
Differences between
planning and control
information, Systems
Analysis, Systems Design.
 **Assignment MIS Planning and
Topics Development: Introduction,
Planning, development.
Module 3: in Introduction, Business 6
MIS and BPR class Process Re – Engineering,
Improving a process in
BPR, Object Oriented
methodology, BPR –
Current Focus, MIS
Organization
Structure: Introduction,
MIS at Management levels,
Strategic Level Planning,
Operational Level
Planning, Economic and
Behaviour Theories.
Enterprise Resource
Planning: Introduction,
Basics of ERP, Evolution of
ERP.
**Assignment Enterprise Systems in
Topics Large Organizations,
Benefits and Challenges of
Enterprise Systems.
Module 4: in class IT Security Management, 6
IT Security Organizational Context and
Management Security Policy, Security
and Risk Risk Assessment, Detailed
Assessment Security Risk Analysis.
Security Controls, Plans,
and Procedures: IT Security
Management
Implementation, Security
Controls or Safeguards, IT
Security Plan.
**Assignment Implementation of
Topics Controls, Implementation
Follow-up.
Module 5: in class Overview, Physical 6
Physical, Security Threats, Physical
Infrastructure Security Prevention and
and Human Mitigation Measures,
Resources Recovery from Physical
Security Security Breaches,
Integration of Physical and
Logical Security.
Security Awareness,
Training, and Education,
Employment Practices and
Policies.
**Assignment E-Mail and Internet Use
Topics Policies, Computer
Security Incident Response
Teams.
 Module 6: in class Security Auditing 6
Security Architecture, Security
Auditing, Audit Trail, Implementing
Legal and the Logging Function,
Ethical Audit Trail Analysis.
Aspects Cybercrime and Computer
Crime.
**Assignment Intellectual Property,
Topics Privacy, Ethical Issues.

Text Books:

1. W. Stallings, Computer Security: Principles and Practice, 2nd Edition, Prentice Hall, ISBN: 0132775069,
2011.
2. M. Stamp, Information Security: Principles and Practice, 2nd Edition, Wiley, ISBN:
0470626399, 2011.
3. James A O’Brien, Management Information Systems, Tata McGraw Hill.

Reference Books:

1. M. E. Whitman and H. J. Mattord, Principles of Information Security, 4th Edition, Course

Technology, ISBN: 1111138214, 2011.
2. M. Bishop, Computer Security: Art and Science, Addison Wesley, ISBN: 0-201-44099-7,
2002.
3. G. McGraw, Software Security: Building Security In, Addison Wesley, ISBN: 0321356705, 2006.
Sub Code: IT214A3 Credit: 4(L-3, T-1, P-0)
MICROPROCESSORS AND PERIPHERAL DEVICES
Questions to be set: 05 (All Compulsory)
Course Objectives: The course is intended to give students good understanding of internal architectural details
and functioning of 8085 and 8086 microprocessors. The students will have thorough and in-depth knowledge
of microprocessors, its architecture, working principles including timing diagrams and assembly language
programming using hand assembly as well as assembler. This course also highlights 8051Microcontroller.
Pre-requisites: Digital Circuits & Logic Design and Computer Organization & Architecture.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Identify and describe the structure and functions of basic elements of 8085, 8086
Microprocessors andvarious peripheral devices.
2. Sketch block diagrams of Microprocessors and peripheral devices. Illustrate the execution of
instructionsby the MP using timing diagrams. Explain interfacing of MP with peripheral devices
3. Design circuit diagrams for interfacing the MP with peripheral devices as per the problem
statement forcreating an application
4. Write programs for microprocessors and MP based applications using assembly language
5. Describe the MP-specific assembly language constructs and syntaxes.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Microprocessors Evolution and Types, Overview of 9 1,2
<Introduction class microprocessor-based systems. Pin description
to &Internal Architecture of 8085, Multiplexed
microprocessor data/address bus, Addressing modes of 8085, 8085
& 8085> instructions, Instruction cycle, Machine cycle, Bus
timing of 8085, and 8085 interrupts. Programming
using 8085 instructions using hand assembly.
Counters and time delays.
**Assignment 8085 Stacks and subroutines.
Topics

Module 2: in Pin descriptions of 8086, internal architecture of 9 1,3

< Introduction class 8086, 8086 instructions, interrupts of 8086&
to 8086> interrupt vector table.
**Assignment Addressing modes supported by 8086
Topics

Module 3: in An introduction to assembly language 8 4,5

<Assembly class programming in 8086, macros, procedures.
language 8086 address and data buses, RAM/ROM
programming interfacing to 8086, 8086 port addressing space.
using 8086 & **Assignment Assembler directives. DOS interrupt 21H
Memory Topics functions, I/O mapped I/O and memory mapped
System Design I/O, designing a port address decoder.
and I/O System
Design>
Module 4: in class Introduction to 8259 PIC, 8254 PIT, 8251 7 3
<Introduction USART.
to Peripheral **Assignment 8255 PPI
Devices > Topics

Module 5: in class Internal architectures of 80286 and 80386, special 7 3

<Introduction registers of 80286 and 80386.
to 80286, **Assignment Memory management in 80286 and 80386,
80386 and Topics Architecture 16 bit & 32 bit processors.
8051
microcontroller
>

Text Books:
1. Microprocessor Architecture, Programming and Applications with 8085, by Ramesh Gaonkar,
PenramInternational Publishing (India) Pvt. Ltd., Fifth Edition.
2. The 8088 and 8086 Microprocessors: Programming, Interfacing, Software, Hardware, and
Applications,by Walter A. Triebel and Avtar Singh, Pearson Education, Fourth Edition.
3. Microprocessors and Microcomputer based system design, by MahamedRafiquzzaman, UBS,
1994(Only for MOTORALA 68000 Microprocessor)

Reference Books:

1. Microprocessor X86 Programming - K R Venugopal and Raj Kumar, BPB Publications, 1995.
2. IBM PC Assembly Language Programming, by Peter Abel, Pearson Education Asia, Fifth edition.
3. Advanced Microprocessors & Peripherals Architecture, Programming &Interfacing , by A K Ray,
K MBhurchandi, Tata Mcgraw Hill Publishing Company Limited, 2000.
 Sub Code: IT215A3 Credit: 4 (L-3, T-1, P-0)
E-COMMERCE

Questions to be set: 05 (All Compulsory)

Course Objectives: To provide advanced concepts and technologies in depth for e-commerce, provide
with the necessary quantitative reasoning and analysis to deal with critical questions for modern e-
business development, introduce models for satisfying performance from a complex e-commerce
application and introduce related topics such as security and legal, ethical, and social issues.

Pre-requisites: Nil

Course Outcomes (CO): At the end of the course, the student will be able to:
1. Understand E-commerce activities and apply E-commerce business models in various applications.
2. Identify various E-commerce marketing concepts.
3. Identify various security threats in E-commerce environment.
4. Apply basic cryptography techniques to enable secure E-commerce.
5. Illustrate E-commerce payment systems and explain intellectual property rights.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to E-commerce: – What is E- 7 1
Introduction to class Commerce – E-commerce and E-business –
E-Commerce Features of e-commerce technology – Types
and E- of E-commerce
Commerce E-Commerce Business Models: –
Business Introduction – Key elements – B2C Business
Models model – B2B Business model – C2C Business
model – P2P Business model
**Assignment Survey of various existing E-Commerce business 1
Topics models

Module 2: in E-commerce Infrastructure: – The Internet – 7 2

E-Commerce class WWW – Building an E-commerce website
Infrastructure E-Commerce Marketing Concepts: – Basic
and E- marketing concepts – Consumer Behavior –
Commerce Internet marketing – Online marketing
Marketing communications
concepts **Assignment Brief history of the Internet and brief history of the 2
Topics world wide web(WWW).
 Module Topics to be Topics Hrs CO PO PSO
covered
Module 3: in class Security Threats in E-Commerce Environment: – 8 3
E-Commerce Malicious code, Unwanted programs, Phishing and
Security identity theft, Hacking and cybervandalism, Credit
card fraud, Spoofing and spam web sites, Denial of
Service(DoS) attacks.
Basic Cryptography for protecting communications in
the Internet: – Security concerns – Security
requirements – Encryption-Private key encryption –
The key distribution problem– Diffie-Hellman key
exchange protocol–Public key encryption–RSA
encryption algorithm-Message digest–MD5 message
digest algorithm– Other message digest algorithms –
Digital signature – Digital certificate – Certificate
revocation.
Securing Channels of Communication: – Secure
Sockets Layer(SSL) – Secure HyperText Transfer
Protocol (S-HTTP) – Virtual Private Networks
(VPN)
Protecting Networks: – Firewalls–- Packet Filtering
Routers – Application Gateways

**Assignment Examples of firewall systems. 3

Topics
Module 4: in E-Commerce Payment Systems: – Introduction – 7 4
E-Commerce class Types of Payment system – Credit card E-Commerce
Payment transactions – Digital wallets – Digital Cash –
Systems Electronic Billing Presentation and payment
**Assignment Survey payment system of any popular E- 4
Topics Commerce web site.

Module 5: in Ethical, Social and Political Issues in E-commerce – 7 5

Ethical, class Understanding ethical, social and political issues –
Social and Privacy and Information Rights – Intellectual
Political Property Rights – Governance – Public safety and
Issues in E- Welfare
commerce **Assignment IT Act 2000 of India. 5
Topics

Text Books:
1. E-Commerce: Business, Technology, Society, Kenneth C.Laudon & Carol G.Traver, 2008, Pearson
Education.

Reference Books:
1. Digital Money: The New Era of Internet Commerce, Daniel Lynch and Lundquist,1996, John
Wiley
2. Web Commerce Technology Handbook, Daniel Minoli & Emma Minoli, 1998,McGraw Hill
3. Frontiers of Electronics Commerce, Kalakota Whinston Stone, 1996, Addison Wesley
4. Developing E-Commerce Sites: An Integrated Approach, Vivek Sharma & Rajiv Sharma, 2000,
Pearson Education
5. E-Business and E-commerce Management, Dave Chaffey, 2009, Pearson Education
 Sub Code: IT216A3 Credit: 4(L-3, T-1, P-0)
SOFT SKILLS AND INTERPERSONAL COMMUNICATION
Questions to be set: 05 (All Compulsory)
Course Objectives: This course aims at holistic development of students and improves their
employability skills.
Pre-requisites: Prior knowledge of any particular subject is not a mandatory requirement. Ability to
read, write and understand English language is expected from students. After completion of the course a
student is expected to show improved communication skills
Course Outcomes(CO): On completion of the course, the students will be able to:
1. Apply knowledge of human communication and language processes as they
occur across various contexts.
2. Evaluate key theoretical approaches used in inter disciplinary field of communication.
3. Choose and apply at least one of the appropriate approaches to the
analysis and evaluation of human communication.
4. Assess and evaluate primary academic writing associated
with the communication discipline.
5. Develop knowledge, skills, and judgment around human communication that
facilitate their ability to work collaboratively with others

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Importance of Communication, stages of 8 1

Basics of class communication, modes of communication,
Communication barriers to communication, strategies for
Comprehension effective communication, listening:
and analysis Importance, types, barriers, Developing
effective listening skills Comprehension of
technical and non-technical material, Reading
for Facts, Guessing Meanings from Context,
Skimming, Scanning, Inferring Meaning.
**Assignment
Topics
Module 2: in Effective sentences, cohesive writing, clarity and 3 2
Writing class conciseness in writing, Better paragraphs
Writing Skills – Structure and Presentation of
Different Types of Writing – Letter
writing/Resume Writing/ e-correspondence/
Technical Report Writing.

**Assignment Technical Report Writing

Topics
Module 3: in Story Telling for impactful communication, 6 3,5
Professional class Group Discussions, Dialogue writing,
Personality Extempore, Debates, Role Plays, Conversation
Attributes Practice, Code and Content, Stimulus &
& Self Response, PronunciationEtiquette, Tone: Rising
Grooming tone; Falling Tone, Flow inSpeaking, Speaking
with a purpose, personality, Empathy,
 Branding yourself, Influencing others
**Assignment Case Studies: Speech / TedTalks
Topics
Module 4: in class Internal Business Communication: Writing 12 3,4
Business Memos, Circulars, Notices, Report writing,
Writing / Instruction, Business Letters, Resumes, Job
Correspondence applications, communication through email Oral
Presentation Presentations (individual or group), Seminars,
Skills PPTs Written Presentations through Posters,
Projects, Reports, emails, Assignments, Class
room presentation; style, method, Individual
conferencing; essentials, Public Speaking;
method; Techniques; Clarity of substance;
Emotion; Humor, Overcoming Stage Fear;
Audience Analysis & retention of audience
interest; Audience Participation

**Assignment
Topics

Module 5: in class Distinction between General and Technical 8 5

Technical Communication, Technical Report: Definition &
Communication importance, Thesis/Project writing: structure &
Interpersonal importance, synopsis writing: Methods,
Communication Technical research Paper writing: Methods &
style, Seminar & Conference paper writing,
Critical thinking, Discourse competence,
combination of expression & conclusion, Socio-
linguistic competence, Cross-cultural
communication,
**Assignment
Topics

Text Books
1. Technical Communication – Principles and Practices by Meenakshi Raman& Sangeeta Sharma, Oxford
Univ. Press, 2007, New Delhi.
2. Personality Development and Soft Skills by Barun K. Mitra, OUP, 2012, New Delhi.

Reference Books
1. Spoken English- A Manual of Speech and Phonetics by R.K.Bansal &J.B.Harrison, Orient
Blackswan, 2013, New Delhi.
2. Business Correspondence and Report Writing by Prof. R.C. Sharma &Krishna Mohan, Tata McGraw
Hill & Co. Ltd., 2001, New Delhi.
3. Practical Communication: Process and Practice by L.U.B. Pandey;
4. A.I.T.B.S. Publications India Ltd.; Krishan Nagar, 2014, Delhi.
5. Skills for Effective Business Communication by Michael Murphy,Harward University, U.S.
6. Business Communication for Managers by Payal Mehra, Pearson Publication, Delhi
7. Ashraf M.Rizvi., Effective Technical Communication. Tata-McGraw, 2005
Sub Code: IT221A3 Credit: 4 (L-3, T-1, P-0)
DESIGN AND ANALYSIS OF ALGORITHMS
Questions to be set: 05 (All Compulsory)
Course Objectives: This course builds upon preliminary knowledge delivered in Data Structures. The main
objectives of the course are to provide thorough knowledge and understanding of different algorithm
analysis techniques, design strategies and their applications. Special purpose machines, some critical
problems and innovative techniques are used in solving them.
Pre-requisites: Data Structures and Programming concepts.
Course Outcomes (CO): On successful completion of this course, students should be able to:
1. Define asymptotic notations and solve problems related to it
2. Calculate time and space complexities for recursive/non-recursive algorithm based on following
algorithmdesign techniques - divide and conquer, greedy, dynamic programming and branch and
bound.
3. Select appropriate algorithm design technique to solve a given problem.
4. Explain the working of existing algorithm / algorithm design techniques
5. Discuss and describe the classes P, NP, and NP-Complete
** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO

covered
Module 1: In Definition, aim of the subject, designing algorithms 9 1
<Algorithms Class and Analyzing algorithms: An introduction,
& Performance of a program: Space and Time
Mathematical complexity. Asymptotic notations and common
preliminaries Functions
> **Assignment Example Asymptotic notation: Insertion sort
Topics

Module 2: In The basics of divide & conquer method, Merge sort , 7 2

< Class Quick sort, Solving recurrences: Substitution
Recurrences method, Recursion tree method, Finding maximum
and divide and minimum, Strassen's matrix multiplication,
and conquer Binary search.
> **Assignment Master method: Proof of master method
Topics

Module 3: in Basics of greedy method, Applications- 0/1 7 3

< Greedy class Knapsack Problem – Topological sorting-Heapsort,
method > Huffman codes, Activity selection, Minimum
spanning tree-Kruskal's algorithm, Prim's algorithm,
Single source shortest path: Dijkstra's algorithm
**Assignment Topological sorting – Bipartite Cover
Topics

Module 4: in class Basics of dynamic programming, Applications- 9 4

< Dynamic Matrix chain multiplication, longest common
programming subsequence, Traveling salesperson problem, all pair
shortest Path-Floyd and Wars hall’s algorithm.
 & Back Backtracking Method, Applications-Container
Tracking > Loading, 0/1 Knapsack Problem, Max Clique,
Travelling Salesperson, Board Permutation
**Assignment Non-Crossing Subsets of Nets
Topics

Module 5: in class Branch and Bound Method, Applications-Container 8 5

< Branch Loading, 0/1 Knapsack Problem, Max Clique,
And Bound Travelling Salesperson. Basic Concepts, P NP, NP
& NP Complete, NP Hard problems, Travelling Salesman
completeness Problem.
> **Assignment Board Permutations.
Topics

Text Books:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, “Introduction to Algorithms”, PHI.
2. Sartaj Sahni, “Data Structures, Algorithms amd Applications in C++”, University Press.

Reference Books:
1. A. Levitin, “Introduction to the Design and Analysis of Algorithms”, Pearson Education.
2. S. Basse, A. Van Gelder, “Computer Algorithms-Introduction to Design and Analysis”, Pearson.
3. Alfred V. Aho, John E. Hop croft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Addison
Wesley.
4. M. A. Weiss, “Data Structure and Algorithm Analysis in C”, Pearson Education.
 Sub Code: IT222A3 Credit: 4 (L-3, T-1, P-0)

MICROCONTROLLERS

Questions to be set: 05 (All Compulsory)

Course Objectives: To know the difference between microprocessor and microcontroller, deal with
several microcontroller-based embedded systems and know microcontroller-based assembly language
programming.

Pre-requisites: Microprocessors.

Course Outcomes (CO): On successful completion of this course, students should be able to:

1. Understand different types of microcontrollers, their pin configurations, and internal architectures.
2. Understand the 8051 microcontroller's architecture, I/O operations, special function registers, and
addressing modes.
3. Apply various instruction sets of 8051 microcontrollers for developing programs.
4. Apply knowledge of interrupts, timers, and serial communications within the 8051 microcontroller
system.
5. Illustrate interfacing of peripheral devices with 8051 microcontrollers

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Introduction to Microcontrollers: Definition 7 1
Introduction class of a microcontroller- Difference between
microprocessors and microcontrollers -
Different types of microcontrollers - Intel
MCS-51 family of microcontrollers –
ATMEL AVR – INTEL MCS-96 - ARM

**Assignment A survey on 8,16 ,and 32-bit

Topics microcontrollers.

Module 2: In General architecture: Pins and signals – 7 2

General class internal architecture -program memory and
architecture, data memory – system clock and reset.
I/O ports and
special I/O ports and special function registers: SFR
function map and functions – A – B - PSW – SP
registers, and – port registers P0, P1, P2, P3 – PCON.
addressing
modes of Addressing modes: Instruction format –
8051 addressing modes
microcontroll
er
**Assignment Addressing modes of ATMEL AVR and
Topics ARM microcontrollers.
Module Topics to be Topics Hrs CO PO PSO
covered
Instruction set In Data transfer instructions: forms of MOV 8 3
of 8051 Module 3: instructions, 8/16 bit data load.
microcontrolle class Arithmetic instructions: – ADD – SUBB –
r INC – DEC instructions.
Program branching instructions: –
unconditional jumps – conditional branching.
Subroutines and stack: – LCALL – ACALL –
RET instructions – nesting of subroutines.
Logical instructions: – ANL – ORL – XRL –
CPL – rotate instructions.
Boolean variable manipulation: – SETB –
CLR – MOV – JC – JNC – JB – JNB – ANL
– ORL – CPL instructions.
Advanced instructions: – MOVC – MOVX _
XCH – XCHD – MUL – DIV – DAA –
JMP – SWAP – JBC – RETI instructions.
**Assignment Programming examples: – Copy block – shift
Topics block – sum of series – bubble sorting etc
using 8051 instruction sets.

Module 4: In External interrupts: – INT0 – INT1 – related 7 4

Interrupts in class SFRs – ISR.
8051 Timer/Counter interrupts: – functioning of
microcontrolle Timer 0 and Timer 1 – related SFRs – ISR –
r Timer.
Serial communication and serial interrupts: –
overview – related SFRs – serial
communication modes – serial
communication issues
**Assignmen Examples of interrupts based on case study
t Topics

Module 5: In Interfacing – memory – keyboard – display 7 5

Interfacing class ADC – DAC – Motors – software examples
and Power **Assignment Power management – power saving modes –
Management Topics case study

Textbooks:
1. 8051 Microcontroller: Internals, Instructions, Programming and Interfacing, Subrata Ghoshal, 2010, Pearson
Education.

Reference Books:
1. Microcontrollers: Architecture, Programming, Interfacing and System Design, Raj Kamal, 2009, Pearson
Education
2. Embedded systems and Robots: Projects using the 8051 microcontroller by Subrata Ghoshal, 2009, Cengage
Learning India.
3. The 8051 Microcontroller by Kenneth J. Ayala, 2008, Cengage Learning India
 Sub Code: IT223A3 Credit:4 (L-3, T-1, P-0)
COMPUTER GRAPHICS

Questions to be set: 05 (All Compulsory)

Course Objectives: This course highlights the overview of display devices and peripherals,
software and techniques used in computer graphics. Study of the principles of interactive computer
graphics; systems organization and device technologies for raster and vector displays; region
filling techniques; 2-D and 3- D viewing, clipping, segmentation and interaction handling; 3-D
geometrical transformations, projections and hierarchical data structures for graphics modelling
including hidden lines and surfaces, lighting, texturing, shading and colour models.
Pre-requisites: Programming concepts and Basic Mathematics
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Describe the competence in application of mathematical modelling to computer graphics
2. Explain an ability to interpret a solution plan and methodology for an engineering problem
using computergraphics
3. Discuss an ability to conduct investigations of technical issues related to computer vision
with their levelof knowledge and understanding
4. Illustrate an ability to advance an engineering design to defined end state
5. Compare different algorithms used to solve a computer vision problem.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Display devices, Hard copy devices, Interactive 8 1
<Introduction, Class input devices, Display processors.
overview of Points and lines, Line drawing algorithm, Anti-
graphics systems aliasing lines, Circle generating algorithms
& Output (Bresenham’s), Ellipse, Other curves, Character
primitives> generation.
**Assignment
Topics

Module 2: In Line styles, Color and intensity, Solid area scan 8 2,4
< Attributes of Class conversion, Character attributes, Inquiry
output primitives functions, Bundled attributes.
& Two Basic Transformations, Homogenous co-
dimensional ordinates, Composite Transformations,
transformations> Reflections, Shear
**Assignment
Topics

Module 3: In Windowing concepts, Clipping Algorithms, Line 9 2,3

< Windowing Class clipping (Cohen Sutherland & Mid-point sub
and clipping, division), Area Clipping, Text Clipping, Window
Segments, to view port transformation.
Interactive input Concepts, Segment files, Attributes, Segment
methods> naming schemes, Default error conditions.
Physical input devices, Logical classification
of input devices, Interactive picture
construction techniques.
**Assignment
Topics

Module 4: in class Basic modeling concepts, Master co-ordinates 7 4

< & modeling transformations, structured
Modelin display files, symbol operations, combining
gmethods modeling & viewing operations.
&Three 3-D Co-ordinate system, Display techniques, 3-
dimensional D
concepts> Representation, Polygon surfaces, Curved
surfaces, 3-D transformations.
**Assignment
Topics

Module 5: in class Projections, Viewing transformations, 8 5

< 3-D viewing & Implementations of viewing operations.
Hidden surface Depth buffer algorithms, Scan line coherence
& hidden line algorithms, Area coherence algorithm, Priority
removal:> algorithms, Shading & color model.
**Assignment
Topics

Text Books:
1. Donald Hearn & M. Pauline Baker, “Computer Graphics”, PHI.
2. William M. Newman Robert F. Spronill, “Principles of Interactive Computer Graphics, McGraw-Hill.

Reference Books:
1. Steven Harington, “Interactive Computer Graphics”, Tata McGraw Hill.
2. Dabod G. Rfgers, “Procedure elements for Computer Graphics”, McGraw Hill.
3. A. Plastick & Gordon Kalley , “Computer Graphics, Schaum’s Outline series”, McGraw Hill.
4. Amarendra N Sinha and Arun D Udai , “Computer Graphics”, McGraw Hill.
 Sub Code: IT311A3 Credit:3 (L-3, T-0, P-0)
USER INTERFACE / USER EXPERIENCE DESIGN (UI/UX DESIGN)
Questions to be set: 05 (All Compulsory)
Course Objectives: To understand the basic process of web designing. To grasp the concept of
user experience with respect to the user interface. To understand the trends of UI/UX development.
Pre-requisites: Coordinate Geometry, Basic Computing Knowledge
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Select and utilize design thinking processes and UX/UI tools
2. Differentiate between user interface and user experience design
3. Discover how typography and layout enrich the user experience
4. Distinguish various tools available for user interface design
5. Assess various HCI (human-computer interaction) and the psychology behind user decision-making.
** not more than 20% of total topics to be allotted for assignment.
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In What is UI? What is UX? History of UI and UX 7 1,2
<Introduction Class Design
to UI/UX
design history> **Assignment
Topics

Module 2: In Wireframing - Introduction, Designing Process, 8 2,4

< UI Design Class Picking Tools, Setting a grid and determine a layout
Tools & UX box, Typography, Grayscale, Conclusion, UI Design
Design> and Prototyping – Introduction, General Prototyping
Scheme, Other Tools – Golden Ratio Typography
Calculator, Zeplin.
Introduction – An overview of UX Design Process
and Documentation, How They All Relate, Guiding
Principles, Objective Processes In a Subjective
Environment.
**Assignment
Topics

Module 3: In Why Product Definition Matters, The Kickoff 9 3

< Defining and Class Meeting, Lean & Business Model Canvas, Concept
Researching a Maps &
Product before Mockups, Defining Your Vision.
Diving Into Why Research Matters, Market Segmentation
Design &> Report, Survey Results, Heuristic Evaluations, User
Research Report, Analytics Reports, Research, Test,
Validate.
**Assignment
Topics
 Module 4: in class Why Analysis is Important, Personas, User 8 3,4
Stories &
< Analyzing Job Stories, Defining Your Vision, User
Task
Users Before Matrix, User Content Matrix,
Prioritized
Diving Into Requirements Spreadsheet.
Design & Iterated Sketching & Wireframing,
Detailed
Product Design Mockups, Prototypes, Design Specifications,
Define,
Process & Design and
Documentation Refine.
Essentials> **Assignment
Topics

Module 5: in class Build It, Eat Your Own Dogfood, Feed 8 4,5
Your
<Product Dogfood to Others, Use What Works and
Scrap the
Implementation Rest.
& lunch Create a Product Launch, Plan, Create
content to
Process & empower customers and sales teams, Pack a
punch
Documentation with your product launch.
Essentials> **Assignment
Topics

Text Books:
1. Dominik Pacholczyk, Web UI Design Best Practices, UXPin
2. Jerry Cao, Chris Bank, The Guide To UX DESIGN PROCESS & DOCUMENTATION ,-
UXPin – 2015
3. Frank Chimero, The Shape of Design, First Edition 2012, Licensed under the Creative
Commons Attribution Non-Commercial Share-Alike 3.0 Unported License
http://creativecommons.org/licenses/by-nc-sa/3.0/

Reference Books:
1. https://pidoco.com/en/help/ux/user-interface-design
2. https://www.interaction-design.org/literature/topics/ui-design
3. https://ebooks.webflow.com/ebook/the-modern-web-design-process
 Sub Code: IT312A3 Credit: 3(L-3, T-0, P-0)
DIGITAL IMAGE PROCESSING

Questions to be set: 05 (All Compulsory)

Course Objectives: The objective of this course is to provide the students a general
understanding of the fundamentals of digital image processing. It also introduces analytical
toolswhich are currently used in digital image processing. By the end of the course student will
be able to develop any software/programs that uses image enhancement, segmentation,
restoration, enhancement, representation and description, etc.

Pre-requisites: Computer Graphics, Engineering Mathematics and Probability & Statistics

Course Outcomes: On successful completion of this course, students will be able to:
1. Describe the fundamental concepts of a digital image processing system.
2. Analyze images in the spatial domain using mathematical transformation function.
3. Write the procedure for implementing various image enhancement techniques.
4. Interpret image segmentation and representation techniques.
5. Select the morphological operation for extracting different features from an image.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to Digital Image, Digital image 7 1
< Introduction class representation, Fundamental steps in Image
& Digital Processing, Elements of DIP systems., Image
Image
Fundamentals> formation, Sampling and Quantization, Relationships
between pixels, Linear and Nonlinear operations,
Basics of Image Interpolation and Re-sampling:
Zooming and Shrinking.
**Assignment Elements of Visual Perception
Topics

Module 2: in Enhancement by Point Processing, Histogram 9 2, 3

< Image class Processing, Mask Processing examples, Different
Enhancement
noise model,Various Spatial Filtering. Introduction to
in Spatial
domain and the Fourier Transform, The discrete Fourier
frequency Transform, Properties of the two-dimensional Fourier
Domain > Transform, Smoothing Frequency-domain filters,
Sharpening Frequency domain filters.

**Assignment
Topics
 Module 3: in Fundamentals, Image Compression Models. 9 4
< Image class Similarity based and dissimilarity based image
Compression segmentation, various threshold techniques, Point,

& Line and Edge detection, Region Growing, K-means

Segmentation> segmentation. Various Color models and color image
Segmentation and Other color image processing.

**Assignment Error Free Compression, Lossy Compression.

Topics

Module 4: in class Introduction of image morphology and its properties. 9 5

< Image Basic morphological operation-erosion and dilation
Morphology,
and its application. Advanced morphological
Representation
and operation- open, close and hit-or-misstransformation.
Description Other advanced morphologicaloperation- thickening,
Schema> thinning, skeletonization, boundary extraction, region
filling.
Various Representation and description Schemes,
Different types of Boundary Descriptors and
RegionalDescriptors
**Assignment
Topics

Module 5: in class Patterns and Pattern Classes, Recognition based on 6 4

<Object Decision-theoretic methods, structural methods.
Recognition >
**Assignment
Topics

Text Books:
1. Rafael C Gonzalez, Richard E Woods, “Digital Image Processing”, Pearson EducationPublications.
2. RajjanShinghal, “Pattern Recognition”, Oxford Publications.

Reference Books:
1. Chanda and Majumder, “Digital Image Processing and Analysis”, Prentice Hall Publications.
2. Rafael C Gonzalez, Richard E Woods, “Digital Image Processing with
Matlab”,Pearson EducationPublications.
3. S. Sridhar, “Digital Image Processing”, Oxford University Press.
4. Jayaraman, “Digital Image Processing”, McGraw Hill.
Sub Code: IT313A3 Credit: 3(L-3, T-0, P-0)
INFORMATION RETRIEVAL
Questions to be set: 05 (All Compulsory)
Course Objectives:
The course explores information retrieval models, Web Search Engines, Link Analysis, Hadoop, Map
Reduce, and document text mining techniques for a holistic understanding.

Pre-requisites: Data Mining, Artificial Intelligence

Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Define information retrieval models.
2. Develop Web Search Engine.
3. Analyze the different tools, techniques and algorithms with an experiment.
4. Experiment with Hadoop and Map Reduce.
5. Select appropriate tools and techniques.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in The impact of the web on IR - The role of artificial 7 1
<Introduction> class intelligence (AI) in IR – IR Versus Web Search -
Components of a Search engine- Characterizing the
web.
**Assignment Introduction -History of IR- Components of IR -
Topics Issues –Open source Search engine Frameworks

Module 2: In Term weighting - TF-IDF weighting- cosine 7 2

<Information Class similarity – Preprocessing - Inverted indices -
Retrieval > efficient processing with sparse vectors – Language
Model based IR - Probabilistic IR –Latent Semantic
Indexing - Relevance feedback and query
expansion.
**Assignment Boolean and vector-space retrieval models-
Topics

Module 3: In Web size measurement - search engine 9 3

<Web Search Class optimization/spam – Web Search Architectures -
Engine– crawling - metacrawlers- Focused Crawling - web
Introduction indexes –- Near-duplicate detection - Index
and Crawling Compression - XML retrieval.
> **Assignment Web search overview, web structure, the user, paid
Topics placement, search engine optimization/ spam.
Module 4: in class Searching and Ranking – Relevance Scoring and 10 4
< Web Search ranking for Web – Similarity - Hadoop & Map
–Link Reduce - Evaluation -Personalized search -
Analysis and Collaborative filtering and content-based
Specialized recommendation of documents and products –
Search > handling “invisible” Web - Snippet generation,
Summarization, Question Answering, Cross-
Lingual Retrieval.
**Assignment Link Analysis –hubs and authorities – Page Rank
Topics and HITS algorithms -

Module 5: in class Categorization algorithms: naive Bayes; decision 7 5

<Document trees; and nearest neighbor - Clustering algorithms:
Text Mining > agglomerative clustering; k-means; expectation
maximization (EM).
**Assignment Information filtering; organization and relevance
Topics feedback – Text Mining -Text classification and
Clustering

Text Books:
1. C. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval , Cambridge
UniversityPress, 2008.
2. Ricardo Baeza -Yates and Berthier Ribeiro - Neto, Modern Information Retrieval: The Concepts
andTechnology behind Search 2 nd Edition, ACM Press Books 2011.

Reference Books:
1. Bruce Croft, Donald Metzler and Trevor Strohman, Search Engines: Information Retrieval in
Practice,1st Edition Addison Wesley, 2009.
2. Mark Levene, An Introduction to Search Engines and Web Navigation, 2 nd Edition Wiley, 2010.
3. Stefan Buettcher, Charles L. A. Clarke, Gordon V. Cormack, Information Retrieval:
Implementing andEvaluating Search Engines, The MIT Press, 2010.
Sub Code: IT314A3 Credit: 3(L-3, T-0, P-0)
DESIGN THINKING
Questions to be set: 05 (All Compulsory)
Course Objectives: Design Thinking is a systematic approach to innovation and creative problem-solving that
can be used in many disciplines. Design Thinking applies the methodologies of design to challenges in business
and society—which makes it central to innovation and creativity.
Pre-requisites: Innovative Problem-Solving ability, design and design theory, organizational behavior, and
social psychology.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Express the design process as a tool for innovation
2. Understand the unique needs of a company around specific challenges
3. Demonstrate the value of developing a local network and assist students in making lasting
connectionswith the business community.
4. Develop communication skills necessary to facilitate high performance team formation and
maintenanceand build empathy for target audiences from different “cultures”.
5. Develop and test innovative ideas through a rapid iteration cycle.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
Covered
Module 1: in Introduction to design thinking, History, creativity, 7 1
<Introduction> class innovation and design, Design Thinking Mindset,
Various approaches to design thinking i.e. Empathy,
Analysis, Solution, Testing.
**Assignment
Topics

Module 2: in Process Stages of Designing for Growth, Empathy 8 2,3

<Design class and Understanding, Clarify, Aim of empathize in
thinking in design thinking process, purpose, importance and its
practice> use in design thinking, Customer journey Map, Case
Study 4- stage Karmic Design Thinking process,
Interviewing & Empathy-building Techniques.
**Assignment
Topics

Module 3: in 5 whys, Use of multi-whys method in design 9 3,4

<Analysis & class thinking- an Example, Conflict of interest, Principles
Solution> of a design sprint and how to make it happen, Create
a Set of Scenarios for the Case Study.
TRIZ (Theory of Inventive Problem Solving),
Exercise on Tea-cup story, Business Model Canvas
and Design Research.
 **Assignment
Topics

Module 4: in class Types of Prototypes, Target Audience Testing, 8 4

< Prototype Customer reactions to prototype, Forms of testing in
and Testing & Design Thinking, testing as an iterative process,
General Developing and Testing Prototypes, case study on
Design ReMotion Knee by DRev, Story on elephant andblind
Thinking men, Defining & Testing Business Models &
Practices > Business Cases.
Visualization Techniques and Diagrams, Use of
Diagrams and Maps in Design Thinking, Exercise:
Create an Empathy Map, Create a Mind Map, Create
a Journey Map
**Assignment
Topics

Module 5: in class Cautions and Pitfalls, Assumptions, Exercise: 8 4,5

< Adopt and Assumptions, Pitfalls and Cautions in Design
Adapt Design Thinking Workgroups, Final Words and Best
Thinking & Practices, Exercise: Take the Practices Back to the
Design Office.
Thinking for Story telling - Predictability – Strategic Foresight -
strategic Change – Sense Making -Extreme Competition –
innovations > experience design - Standardization – Humanization
- Creative Culture – Rapid prototyping, Strategy and
Organization – Business Model design.
**Assignment
Topics

Text Books:
1. Change by Design: How Design Thinking Transforms Organizations and Inspires Innovation by Tim
Brown Kindle Edition
2. HBR's 10 Must Reads on Design Thinking (with featured article "Design Thinking" By Tim Brown)
Paperback by Harvard Business Review (Author), Tim Brown (Author), Clayton M. Christensen
(Author), Indra Nooyi (Author), Vijay Govindarajan (Author)

Reference Books:
1. Design Thinking: Understanding How Designers Think and Work , Kindle Edition by Nigel Cross
(Author) Format: Kindle Edition.
2. Solving Problems with Design Thinking: Ten Stories of What Works (Columbia Business School
Publishing) Kindle Edition by Jeanne Liedtka (Author), Andrew King (Author), Kevin Bennett (Author).
3. Idris Mootee, "Design Thinking for Strategic Innovation: What They Can't Teach You at Business or
Design School", John Wiley & Sons 2013. (Unit IV).
4. Book - Solving Problems with Design Thinking - Ten Stories of What Works (Columbia Business School
Publishing) Hardcover – 20 Sep 2013 by Jeanne Liedtka (Author), Andrew King (Author), kevin Bennett
(Author).
 Sub Code: IT315A3 Credit: 3(L-3, T-0, P-0)
DATA WAREHOUSING AND DATA MINING
Questions to be set: 05 (All Compulsory)
Course Objectives: This course is indent for understanding the techniques behind the recent development in
data warehousing and data mining. The data warehousing part of the module aims to give students a good
overview of the ideas and the techniques, which are behind recent developments in the data warehousing and
On-Line Analytical Processing (OLAP) fields, in terms of data models, query languages, conceptual design
methodologies, and storage techniques. The data mining part discusses various tools and techniques used to
find out the interesting patterns from data.
Pre-requisites: Data structures, Concepts of Algorithms, Fundamentals of probability & statistics
and programming skills
Course Outcomes: On successful completion of this course, students will be able to:
1. Distinguish the concepts of data warehousing and data mining
2. Illustrate the dimensional modelling technique for designing a data warehouse and data
warehouse architectures and OLAP
3. Explain the knowledge discovery process.
4. Deduction of data mining tasks and study their well-known techniques
5. Apply various data mining techniques in varied problem scenarios

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Introduction, Definition, Multidimensional data 10 1,2
<Data Class transformation, OLAP operations, Warehouse
Warehousing schema, Ware house Server, Meta data, OLAP
& Data engine. Introduction, Definition, KDD vs. DM,
Mining> DBMS vs. DM, DM techniques, Issues and
challenges in DM.
**Assignment DM applications
Topics

Module 2: In A prior algorithm, Partition, Incremental, Dynamic 11 3

< Association Class item set counting, FP-tree growth, Incremental and
Rules & border algorithms. Bayesian classification, Two
Classification: class and generalized class classification,
Parametric Classification error, Decision boundary,Non-
and Non- parametric methods for classification.
Parametric **Assignment Discriminant functions
Technology > Topics
 Module 3: in Clustering analysis, Types of data in cluster 7 3,4
< Clustering class analysis, Partitioning algorithms, Hierarchical,
> Density based,
Grid based, Model based algorithms.
**Assignment High dimensional & Categorical data clustering
Topics

Module 4: in class Decision tree induction, Tree pruning, Extracting 7 4

<Decision classification rules from decision trees, Decision
Trees > tree construction algorithms.
**Assignment Decision tree construction with presorting
Topics

Module 5: in class Text mining, Web mining, Spatial data mining. 5 5

<Unstructured
Data Mining> **Assignment Multimedia data mining.
Topics

Text Books:
1. Jiawei Han, MichelineKamber, “Data Mining: Concepts and Techniques”, Elsevier.
2. A K Pujari, “Data Mining Concepts”, University Press.
Reference Books:
1. Ian H. Witten, Eibe Frank, “Data Mining Practical Machine Learning Tools and Techniques with
JavaImplementations”, Morgan Kaufmann Publishers.
2. Alex Berson, Stephen J. Smith, “Data Warehousing, Data Mining and OLAP”, Tata McGrawHill.
3. Richard O. Duda, Peter E. Hart, “Pattern Recognition and Scene Analysis”, Wiley.
4. VikramPudi, P. Radha Krishna, “Data Mining”, Oxford University Press.
 Sub Code: IT316A3 Credit: 3(L-3, T-0, P-0)
BIG DATA ANALYTICS

Questions to be set: 05 (All Compulsory)

Course Objectives: To provide an in-depth understanding of a Big Data system and its features.

Pre-requisites: Basic knowledge of DBMS.

Course Outcomes (CO): At the end of the course, the student will be able to
1. Understand NoSQL.
2. Understand Properties of a Big Data system.
3. Understand Computing on the batch layer
4. Apply Storing real-time views
5. Analyze performance metrics and develop solutions for serving layer databases, focusing on
normalization and dynamic data management.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
Covered
Module 1: In class Scaling with a traditional database – NoSQL 7 1
A New is not a panacea -- Desired properties of a Big
Paradigm Data system – The problems with fully
for Big Data incremental architectures – Lamda
Architecture – Recent trends in technology.
**Assignment
Topics

Module 2: In class The properties of data – The fact-based model 7 2

Data model for representing data – Graph schemas.
for Big Data
**Assignment
Topics

Module 3: In class Storage requirements for the master dataset – 7 4

Data Choosing a storage solution for the batch
storage on layer – How distributed filesystems work –
the batch Storing a master dataset with a distributed
layer filesystem.
**Assignment
Topics

Module 4: in class Computing on the batch layer – 7 3

Batch layer Recomputation algorithms vs. incremental
algorithms – Scalability in the batch layer –
MapReduce : a paradigm for Big Data
computing.
**Assignment
Topics
 Module 5: in class Performance metrics for the serving layer – 7 5
Serving The serving layer solution to the
layer normalization problem – Requirements for a
serving layer database. Storing real-time
views
**Assignment
Topics

TEXT BOOK

1. Nathan Marz, James Warren, “Big Data: Principles and best practices of scalable real-time data
stems, Manning Publishing.

REFERENCE BOOK(S)
1. Research Articles
 Sub Code: IT317A3 Credit:3(L-3, T-0, P-0)
OPTIMIZATION TECHNIQUES
Questions to be set: 05 (All Compulsory)
Course Objectives: The objective of this course is to understand the need and origin of the optimization
methods andto get a broad picture of the various applications of optimization methods used in engineering.
This course is indentfor designing and controlling complex systems, solving hard problems of efficiently
allocating scarce resources usingin complete information, and developing sustainable strategies to master
situations of conflict and co-operation usingscientific methods and information technology.

Pre-requisites: Quantitative Analysis using C/C++, Design and Analysis of Algorithms and Probability &
Statistics.

Course Outcomes: On successful completion of this course, students will be able to:
1. Demonstrate the knowledge and understanding of the basic ideas underlying optimization
techniques.
2. Apply the mathematical approach to optimization problems relevant to engineering
3. Analyze the robustness of continuous linear optimization problems solutions using sensitivity
analysis.
4. Ability to understand and interpret the results and information provided by a particular method.
5. Compare the robustness of continuous linear optimization problems solutions using various
techniques

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to OR modeling approach and various 8 1
< Introduction class real- life situations, Linear programming problems and
to Operations applications, Solving Linear Programming problem
Research > using simultaneous equations and Graphical Method,
Simplex Method and extensions, Sensitivity analysis
- Duality theory. Transportation model.

**Assignment Transshipment problems and Assignment

Topics problems.

Module 2: in Bellman’s principle of optimality, Examples on the 10 2

< Dynamic class application on routing problem, Inventory problem
Programming Simplex problem.
and Network PERT and CPM, Probability of achieving completion
Analysis > data, Cost analysis, Graph reduction theory, Updating.

**Assignment Marketing problem. Resource allocation,

Topics Resource smoothing.
 Module 3: in Inventory problem, Variables in an inventory 8 3
< Inventory class problem, Inventory models with penalty, Storage
Method > andQuantity discount, Inventory models with
probability, Demand, Multi item deterministic model.
Simulation, Types of simulation models.
**Assignment Safety stock, Applications of simulation for
Topics Inventory problems.
Module 4: in Poison arrivals and Exponential service times, 7 3,4
< Queuing class Waiting time and Idle time cost, Single channel and
Theory > Multi- channel problem. Monte Carlo technique
applied to queuing problems.

**Assignment Applications of simulation for Queuing problems.

Topics Poisson arrivals and service time.
Module 5: in Introduction – Minimax (maximin) – Criterion and 7 4,5
< Theory of class optimal strategy – Solution of games with saddle
Games > points– Rectangular games without saddle points – 2
X 2 games, Examples on the application of theory of
games. – Dominance principle – mX2 & 2Xn games
- Graphical method and Linear programming method
for different problems.
**Assignment Decision trees.
Topics

Text Books:
1. Hamdy A. Taha, “Operations Research”, Fifth edn., Macmillan Publishing Company.
2. Kumar Gupta, Prem and Hira, D.S., “Operations Research”, S Chand & Company Limited.
3. Swarup, Kanti, Gupta, P.K. and Manmohan, “Operations Research”, Sultan Chand & Sons.
Reference Books:
1. Operations Research – Schaum outline series, MH
2. V.K. Kapoor-- Operations Research
3. Hiller F. and Leibermann G. J., “Operation Research”, Holder Day Inc.
4. Srinath L.S., “PERT & CPM Principles and Applications”, Affiliate East West Press (P).
Sub Code: IT318A3 Credit: 3(L-3, T-0, P-0)
INTERNET OF THINGS
Questions to be set: 05 (All Compulsory)
Course Objectives: To provide students with a foundation in computing, communication and
information technologies.by making student to realize the revolution of Internet in Mobile Devices,
Sensor Networks and Cloud technology. Also, to develop the teamwork skills, multidisciplinary
approach, and an ability to relate information technology to overcome real world and social issues
inducing students with good computing and communication knowledge so as to understand, analyze,
design, and innovate a new system.

Pre-requisites: Computer Networks, knowledge of basic Wireless & Wired Networking, Wireless
Sensor Networks and programming language.

Course Outcomes (CO): On completion of the course, it is expected to endow the students with skills to:
1. Visualize the impact of information technology solutions on the society.
2. Identify the application areas of IOT.
3. Identify building blocks of Internet of Things and characteristics.
4. Establish interconnection and integration of the physical world and the cyber space.
5. Design & develop IOT Devices.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to Internet of Things (IoT): 4 1
< Introduction class Fundamentals of Internet of Things, IoT Definition,
to Internet of Characteristics of IoT, IoT Vision, IoT Functional
Things (IoT)> View, Application Areas.

**Assignment
Topics
Module 2: in Domain Specific IOTs : Home Automation, Cities, 6 2
< Domain class Environment, Energy, Retail, Logistics,
Specific IOTs > Agriculture, Industry, Health & Life Style.
**Assignment
Topics
Module 3: in Architectural overview, Components of IoT system, 10 3
< IoT class Devices and gateways, Local and wide area
Technology networking, Data management, Business processes
Fundamentals> in IoT, IoT analytics, Knowledge management
**Assignment
Topics
Module 4: in class Design principle for connected devices, IoT system 10 4
< Design layers and design standardization, Networks and
principle for Communication: Networking Technology and
IoT > Communication Technology, Protocols in IOT,
Security, Privacy & Trust in IoT.
**Assignment
Topics
Module 5: in class Hands-on-IoT : IoT Physical Devices & Endpoints: 10 5
< Hands-on-IoT What is an IoT Device, Exemplary Device, Board,
& IoT Linux on Raspberry Pi, Interfaces, Types of sensors.
 opportunity and IoT opportunity and challenges : Various case
challenges > studies, opportunity and challenges in IoT.
**Assignment
Topics

Text Books:
1. Ovidiu Vermesan,Peter Friess"Internet of Things –From Research and Innovation to market
Deployment",River Publishers.
2. Jan Ho¨ ller, Vlasios Tsiatsis, Catherine Mulligan, Stamatis Karnouskos, Stefan Avesand,
3. David Boyle "From Machine-to-Machine to the Internet of Things Introduction to a New Age of
Intelligence",Academic Press Elsevier.
4. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-onApproach)”, 1 st Edition, VPT,
2014.

Reference Books:
1. "Internet of Things" Copyright 2016 by Tutorials Point (I) Pvt. Ltd.
2. Tim O’Reilly & Cory Doctorow "Opportunities and Challenges in the IoT",O’Reilly
publication.
Pethuru Raj, Anupama C.Raman,"The Internet of Things, Enabling Technologies,platforms and use
cases", CRC Press.
 Sub Code: IT321A3 Credit: 4(L-3, T-1, P-0)

MACHINE LEARNING
Questions to be set: 05 (All Compulsory)
Course Objectives: It reflects recent developments while providing a comprehensive introduction to the fields
of pattern recognition and machine learning. It is aimed at advanced undergraduates assuming no previous
knowledge of pattern recognition or machine learning concepts.
Pre-requisites: Knowledge of multivariate calculus and basic linear algebra and basic probability theory.
Course Outcomes (CO): On completion of the course it is expected to endow the students with
skills to:

1. Identify methods to solve ML problems.

2. Design pattern recognition program systems using approaches of these theories for
solvingvarious real-world problems.
3. Identify importance of tolerance of imprecision and uncertainty for design of
robust andlow-cost intelligent machines.
4. Describe areas of application of ML.
5. Formulate solution strategies for solving ML problems in real life.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Polynomial Curve Fitting, Probability Theory: 8 1
< Class Expectations and Co-variances, Bayesian
Introduction probabilities, The Gaussian distribution, Curve fitting
and Linear re-visited. Linear Basis Function Models: Maximum
Models for likelihood and least squares, Sequential learning,
Regression > Regularized least squares.
**Assignment The Bias-Variance Decomposition: Bayesian Linear
Topics Regression, Parameter distribution, Predictive
distribution.
Module 2: In Discriminant Functions: Two classes, Multiple classes, 7 2
< Linear Class Least squares for classification, Probabilistic
Models for Generative Models: Continuous inputs.
Classification **Assignment Maximum likelihood solution, Probabilistic
> Topics Discriminative Models: Fixed basis functions, Logistic
regression.
Module 3: In Maximum Margin Classifiers: 9 3
< Sparse Class Overlapping class distributions, Relation
Kernel to logistic regression, Multiclass SVMs,
Machines and Dual Representations, Constructing
Kernel Kernels, Radial Basis Function Networks.
Methods >
**Assignment
Topics

Module 4: in class Basic concepts: The artificial neuron, The McCulloch- 7 4

< Neural Pitts neural model, The perceptron neural network
Networks > architectures: Single layer feed forward ANNs.
 **Assignment Multi-layer feed forward ANNs, Activation function,
Topics Generalized delta rule, The Back propagation
Algorithm: Learning, Parameter optimization,
Convolutional networks: Auto-sparse encoders.
Module 5: in class K-means Clustering, Mixtures of 9 5
< Mixture Gaussians, Maximum likelihood.
Models and Principal Component Analysis:
EM, Maximum variance formulation,
Continuous Markov Models, Hidden Markov
Latent Models, Maximum likelihood for the
Variables and HMM,
Sequential **Assignment EM for Gaussian mixtures, Applications
Data > Topics of PCA, PCA for high-dimensional data,
The forward- backward algorithm.

Text Books:
1. Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer.
2. David J.C. Mackay, “Information Theory, Inference and Learning Algorithms”, Cambridge University
Press, 2003.

Reference Books:
1. Andrew Ng, “Lecture Notes on Machine Learning”.
Sub Code: IT322A3 Credit: 4(L-3, T-1, P-0)
NATURAL LANGUAGE PROCESSING
Questions to be set: 05 (All Compulsory)
Course Objectives:
1. To introduce the fundamental concepts and theory of Natural Language Processing and its practical
applications

2. To highlight Linguistic (knowledge-based) and statistical approaches to language processing in the three major
subfields of NLP: syntax (language structures), semantics (language meaning), and pragmatics/discourse
(the interpretation of language in context).

Pre-requisites: A strong mathematical background, Proficiency with algorithms, Critical thinking and
problem-solving skills
Course Outcomes(CO): On completion of the course it is expected to endow the students withs kills to:

1. Describe the fundamental concepts and techniques of natural language processing.

2. Distinguish among the various techniques of NLP, taking into account the assumptions, strengths, and
weaknesses of each.
3. Use appropriate descriptions, visualizations, and statistics to communicate the problems and their
solutions.
4. Analyze large volume text data generated from a range of real-world applications.
5. Employ semantic models in NLP for various applications, including social media monitoring and market
analysis

* not more than 20% of total topics to be allotted for assignment

Module Topics to be Hrs CO PO PSO
covered
Topics
Module 1: in class Origins And Challenges Of NLP, 7 1
Empirical Laws, Text Processing,
Introduction to
Spell Correction, Edit Distance,
Natural
Weighted Edit Distance, Noisy
Language
Channel Model for Spelling
Processing
Correction
**Assignment Application of NLP in different 1
Topics domain
Module 2: in class N Gram Language Models, 7 2
Evaluation of Language Models,
Language
Basic Smoothing, Advanced
Modelling
Smoothing Models
**Assignment Application of Language Models in 2
Topics auto-completion of sentences, auto
spell-check, and semantic analysis
Module 3: in class Introduction, Finite State Method for 7 3
Morphology, Introduction to POS
Computation
Tagging, HMM For POS Tagging,
Morphology Viterbi Decoding For HMM,
Parameter Learning, Baum Welch
 Algorithm, Maximum Entropy
Models, Conditional Random Fields
**Assignment Application of POS Tagging in Entity 3
Topics Recognition and Question Answering
Module 4: in class Introduction, Parsing, CKY, PCFGs, 7 4
Inside-Outside Probabilities,
Syntactic
Dependency Grammar and Parsing
Analysis
Transition Based Parsing, MST
Based Dependency Parsing
**Assignment Application of Syntactic Analysis in 4
Topics Information Extraction
Module 5: in class Distribution semantics Models, 7 5
Word Embedding, Lexical
Semantics in
Semantics, Word Sense
NLP
Disambiguation, Novel Word Sense
Detection, Topic Modelling, Latent
Dirichlet Allocation, Gibbs sampling
for LDA, LDA Variants and
Applications
**Assignment Application of Semantics in Social 5
Topics Media Monitoring, Market Research
and Product Analysis

Text Books:
1. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to Natural
Language Processing, Computational Linguistics and Speech, Pearson Publication, 2014David J.C.
Mackay, “Information Theory, Inference and Learning Algorithms”, Cambridge UniversityPress, 2003.

Reference Books:
1. James Allen, “Natural Language Understanding”, 2/e Pearson Education
2. L.M. Ivansca, S. C. Shapiro, “Natural Language Processing and Language Representation”, University Press
3. Sowmya Vajjala, Bodhisattwa Majumder, Anuj Gupta, Harshit Surana. 2020. Practical Natural Language
Processing. O'Reilly.
4. Hobson Lane, Cole Howard, Hannes Hapke. 2019. Natural Language Processing in Action
 Sub Code: IT323A3 Credit: 4(L-3, T-1, P-0)

LATEST TRENDS IN INFORMATION TECHNOLOGY

Questions to be set: 05 (All Compulsory)
Course Objectives: The objective of this course is to create awareness and provide exposure to the changing
trends and advances in the chosen topics in Information Technology.

Pre-requisites: Nil

Course Outcomes(CO): On completion of the course it is expected to endow the students withs kills to:

1. Apply uninformed and heuristic search algorithms in artificial intelligence tasks.

2. Discuss the importance of big data in data analytics and evaluate methodologies for handling and
processing big data.
3. Implement various machine learning techniques and analyze their applications in real-world scenarios.
4. Explain fundamental concepts of cyber security and assess challenges and vulnerabilities in information
security systems.
5. Identify IoT architecture components, analyze IoT applications, and evaluate security measures and
challenges in IoT implementation
* not more than 20% of total topics to be allotted for assignment
Module Topics to be Hrs CO PO PSO
covered
Topics
Module 1: in class Uninformed Search, Heuristic Search, 6 1
Knowledge Representation and
Introduction
Reasoning, Natural Language
to Artificial
Processing, Understanding, Learning.
Intelligence
**Assignment Application of NLP. 1
Topics

Module 2: in class Introduction, Handling and Processing 6 2

Big Data, Data Model for Big Data,
Introduction
Data Storage, Methodological
to Big Data
Challenges and Problems in Big Data.
**Assignment Importance of Big Data in Data 2
Topics
Analytics.
Module 3: In class Introduction, Approaches and 7 3
Topics Techniques in Machine Learning,
Introduction
Ensemble Learning, Decision Tree
to Machine
Learning, Computational Learning
Learning.
Theory, Artificial Neural Networks,
Support Vector Machines, Bayesian
Learning, Challenges in Machine
Learning. Introduction to Deep Neural
Networks, Recent Developments,
Challenges in Deep Learning.

**Assignment Application of various ML techniques. 3

Topics
Application of Deep Learning.
 Module 4: in class Information Security Concepts, 8 4
Security Threats and Vulnerabilities,
Introduction
Security Law and Standards,
to Cyber
Challenges in Cyber Security.
Security
**Assignment Importance of cyber security. 4
Topics
Module 5 in class Introduction, Use of Devices in IoT, 7 5
IoT Architecture, Applications of IoT,
Introduction
IoT Protocols, IoT Security,
to Internet of
Challenges in IoT.
Things.
**Assignment Limitation of security in IoT devices 6 5
Topics and applications of IoT.

Text books:
Artificial Intelligence, Elaine Rich and Kevin Knight, 3rd ed., 2009, McGraw Hill.
Reference books:
1. Latest Research articles as decided by the instructor.
2. Machine Learning for Dummies, John Paul Mueller and Luca Massaron, 1st ed. 2016, For Dummies.
3. Pattern Recognition and Machine Learning, Christopher Bishop, 2016, Springer New York.
4. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Trevor Hastie, Robert
Tibshirani & Jerome Friedman, Springer.
5. Deep Learning, Ian Goodfellow and Yoshua Bengio and Aaron Courville, 2016, MIT Press.
6. Securing the Internet of Things, Shancang Li Li Da Xu, 2017, Syngress, Elsivier.
7. Internet of Things and its Applications, Satish Jain, Shashi Singh, 1st ed. 2020, BPB Publications.
8. Introduction to Information Security and Cyber Laws, Surya Prakash Tripathi, 2014, Dreamtech Press.
Sub Code: IT324A3 Credit: 4(L-3, T-1, P-0)
SYSTEM PROGRAMMING
Questions to be set: 05 (All Compulsory)
Course Objectives: This course emphasizes on systems programs: operating systems, assemblers,
compilers, interpreters, macro processors and loaders. This course also discusses the design of the system
programs: assembler, linkers and loaders.
Pre-requisites: Programming language Design, Data Structures and Microprocessor and Peripheral
Devices.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Describe the evolution of Programming and understand how an Operating and other system software
haveevolved since its inception.
2. Examine various system programs and it's usage for proper functioning of Computer System.
3. Analyze the theory and design the procedure for implementing assembler and macro-processor
systemprograms.
4. Compare various program loading schemes and discuss issues pertaining to design of some
loadingschemes.
5. Understand the basic concepts of Compiler Program and issues related to its design.
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction to application software and systems 7 1,2
< Scope of class software, Concept of hardware, System software
Systems concept, System design and methods of system design,
Programming Properties of good and structured system, Software and
and software hierarchy, Machine structure.
Background **Assignment Components of a system programming, Evolution of
> Topics Operating Systems, Operating System functions

Module 2: in General machine structure, Instruction set, Machine 8 3

<General class language, Assembly language (IBM-360).
machine Assemblers, General design procedure, Design of
structure and assembler: One pass assembler
machine **Assignment Two pass assembler
language & Topics
Assemblers >
Module 3: in Macros language and macro processer: Macro 8 3,4
< Macros> class instruction arguments, Conditional macro expansion,
Macro calls within macros, Macro instructions
defining macros.
**Assignment Implementation of restricted facility: A two pass
Topics algorithm.

Module 4: in class Loaders, Loader schemes, Compile and go loaders, 8 4

< Loaders> General loader scheme: Absolute loaders, Subroutine
linkages, Relocating loader, Loader schemes binders,
Linking loaders, Overlays, Dynamic binders, Design
of an absolute loader.
**Assignment Design of a direct linking loader.
Topics
Module 5: in class Introduction, Language processing activities, 9 5
< Language Fundamentals of language processing, Fundamentals
processor & of language specification.
Compilers> Introduction to compilers, Aspects of compilation,
Compilation of expressions, Compilation of control
structures,
**Assignment Language processor development tools.
Topics Memory allocation, Code optimization, Interpreters.

Text Books:
1. John J. Donovan, “Systems Programming”, Tata McGraw Hill.
2. Srimanta Pal, “Systems Programming”, Oxford.
Reference Books:
1. D M Dhamdhere, “Systems Programming & Operating Systems”, Tata McGraw Hill.
2. Aho, Ulmann, Sethi , “Compiler Design”, Pearson Education.
3. Leland L.Beck, D.Manjula, “System Software-An Introduction to System Programming”, Pearson
A.C. Shalini, “System Software”, SCITECH Publication
Sub Code: IT325A3 Credit: 4(L-3, T-1, P-0)
BIO INSPIRED COMPUTING
Questions to be set: 05 (All Compulsory)
Course Objectives: The course aims to cover bio-inspired theorems and algorithms, including random
walk, simulated annealing, genetic algorithm, differential evolution, swarm optimization, and ant colony
for feature selection. Additionally, it explores their applications in image processing.
Pre-requisites: Programming language Design, Data Structures and Microprocessor and Peripheral
Devices.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Understand bio-inspired computing algorithms, such as genetic algorithms and swarm optimization,
for optimization tasks.
2. Apply random walk and annealing techniques in stochastic optimization and search problems.
3. Analyze meta heuristic algorithms, including firefly algorithm and particle swarm optimization, for
solving complex optimization problems.
4. Comprehend the application of bio-inspired computing in image processing
5. Analyze the convergence and performance of bio-inspired algorithms through parameter tuning and
control mechanisms.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Hrs CO PO PSO
covered
Topics
Module1: in class Introduction to algorithm - Newton ' s 6 1
method - optimization algorithm - No-
Introduction
Free-Lunch Theorems - Nature-Inspired
Metaheuristics -Analysis of Algorithms
- Nature Inspires Algorithms -
Parameter tuning and parameter control.
**Assignment Application of Bio inspired computing 1
Topics

Module 2: in class Random variables - Isotropic rand om 6 2

walks - Levy distribution and flights -
Random Walk
Markov chains - step sizes and search
and Annealing
efficiency - Modality and intermittent
search strategy - importance of
randomization- Eagle strategy-
Annealing and Boltzmann Distribution
- parameters -SA algorithm
**Assignment Stochastic Tunneling. 2
Topics
Module 3: in class Introduction to genetic algorithms and - 7 3
role of genetic operators - choice of
Genetic
parameters - GA variants - schema
Algorithms
theorem - convergence analysis -
and
introduction to differential evolution -
Differential
variants - choice of parameters
Evolution
convergence analysis - implementation.
**Assignment Application of Genetic Algorithm 3
Topics
 Module 4: in class Swarm intelligence - PSO algorithm - 6 4
accelerated PSO - implementation -
Swarm
convergence analysis - binary PSO - The
Optimization
Firefly algorithm - algorithm analysis -
and Firefly
implementation - variants- Ant colony
Algorithm
optimization toward feature selection.
**Assignment Application of Particle Swarm 4
Topics Optimization

Module 5: in class Bio-Inspired Computation and its 10 5

Applications in Image Processing: An
Application in
Overview - Fine- Tuning Enhanced
Image
Probabilistic Neural Networks Using
Processing
Meta-heuristic-driven Optimization,
Fine-Tuning Deep Belief Networks
using Cuckoo Search - Improved
Weighted Thresholded Histogram
Equalization Algorithm for Digital
Image Contrast Enhancement Using Bat
Algorithm - Ground Glass Opacity
Nodules Detection and Segmentation
using Snake Model - Mobile Object
Tracking Using Cuckoo Search
**Assignment Case study: An application of Bio 5
Topics inspired computing in image processing

Text Books:
1. Yang, Xin-She, et al., eds. Swarm intelligence and bio-inspired computation: theory and applications. Newnes,
2013.
2. Eiben, A.E., Smith, James E, "Introduction to Evolutionary Computing", Springer 2015.
3. Xin-She Yang, Jaao Paulo papa, "Bio-Inspired Computing and Applications in Image Processing", Elsevier
2016
Sub Code: IT326A3 Credit: 4(L-3, T-1, P-0)
AUTONOMOUS MOBILE ROBOTICS AND COMPUTATIONAL INTELLIGENCE
Questions to be set: 05 (All Compulsory)
Course Objectives: The course will cover basic principles of design and practice of intelligent
robotics systems including the algorithms for the analysis of the data obtained by vision and range
sensors, basic principles of modeling kinematics and dynamics and design of basic control strategies.
Emphasize will alsobe given on formulating interesting robotics tasks and show how they can be
accomplished by individual robot or cooperative robot teams (such as flocking, foraging as well as
robotic soccer).
Pre-requisites: Design and Analysis of Algorithms, Basic Mathematics (linear algebra,
calculus andprobability), Soft computing.
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Identify application of Robots
2. Describe the evolution, kind of robots and basics of design of a Robotics System
3. Choose correct choices of Locomotion, Kinematics, Perception techniques
4. Apply Intelligent Algorithms for decision making in Motion Planning and path optimization
5. Develop simple robot control systems integrating perception, planning, and action

** Not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: In Definition, Applications of mobile robotics, History 11 1,2
< Introduction Class of mobile robotics, Reference control scheme of a
& Design of mobile robotics environment, Temporal
system and decomposition of architecture, Control
navigation decomposition, Hybrid architecture, Mobile
architecture > architecture, Perception.
**Assignment Representation and the mapping process.
Topics

Module 2: In Issues for locomotion, Legged mobile robots, 12 3

< Locomotion Class Wheeled mobile robots, Kinematics introduction,
& Forward and reverse kinematics, Wheeled
Kinematics> kinematics and its constraints, Mobile system
locomotion, Human biped locomotion as a rolling
polygon.
**Assignment Representation of robot position through the
Topics reference frame.

Module 3: In Sensors for mobile robots, Sensor classification, 7 3

< Perception Class Characterization and sensor performance, Wheeled
& motor sensor, Ground bases beacon, Localization
Navigation> overview, Path planning.
**Assignment Active ranging, Motion/Speed sensor, Vision based 3
Topics sensors.
Module 4: In Class Swarm intelligence, Evolutionary computation. 5 4.
<
Computational
intelligence >
 **Assignment Artificial immune system, Ant algorithm. 4.
Topics
Module 5: In Class This chapter is included to provide hands on 5 5
< Mobile introduction to the field of mobile robotics and
robot various issues in designing and planning of robot
programming work environment. It includes construction and
>
programming of robotic agents using robotic kits
and microcontrollers applying concepts
of locomotion, perception.

**Assignment Navigation and computational intelligent algorithms. 5

Topics
Text Books:
1. Ronald Siegwart, Illah R. Nourbakhsh, “Introduction to Autonomous Mobile Robots”, MIT Press,
2. Andries P. Engelbrecht , “Computational Intelligence: An Introduction”, Wiley 2nd Edition, 2007
Reference Books:
1. Ronald C. Arkin , “Intelligent Robotics and Autonomous Agents”, MIT Press, 1997
2. Ulrich Nehmzow, “Mobile Robotics: A practical Introduction”, Springer-Verlag London, 2003
3. Robin R. Murphy, “Introduction to AI Robotics”, MIT Press, 2000
4. Leandro N. de Castro and Jonathan Timmis, “Artificial Immune system: A new Computational
Intelligence Approach”, Springer-Verlag, Germany 2002
 Sub Code: IT327A3 Credit:4(L-3, T-1, P-0)
REAL TIME SYSTEMS
Questions to be set: 05 (All Compulsory)
Course Objectives: The objective of this course is to provide a general understanding of the Real Time
Systems (RTS). It covers the scheduling aspects of tasks with emphasis on timing constraints and
scheduling principles. By the end of the course, the students shall be able to differentiate the scheduling,
database and communication aspects of Real Time Systems from those of traditional Operating Systems
(OS). Students will also be familiar with different programming platforms for developing Real Time
Operating Systems (RTOS)
Pre-requisites: Operating System, Computer Network and DBMS.
Course Outcomes(CO): On successful completion of this course, students will be able to:
1. Discuss the concepts of Real-Time systems and interpret its model.
2. Recognize the characteristics of a real-time system
3. Develop and document on an architectural design of a real-time system
4. Express an ability to select appropriate algorithms for task scheduling and resource management in
Real Time System.
5. Illustrate Real-time Operating Systems and Fault Tolerant applications of Real-Time Systems
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Definition and concepts of RTS, Issues in Real Time 5 1,2
<Introduction> class Computing, Broad categories and characteristics of
Real Time (RT) systems, RT tasks classification,
Modeling of Time constraints, Task Assignment and
Scheduling
**Assignment Mode changes and Fault Tolerant Scheduling
Topics

Module 2: In Basics on RT task scheduling, RT task scheduling 10 1,4

< Real Time Class algorithms, Preemptive RT algorithms (Earliest
task deadline first, RMA), Static priority scheduling
scheduling> protocols, Resource sharing among RT Tasks,
Priority inversion, Priority inheritance protocol
(PIP), HLP, PCP, Different types of priority
inversion under PCP, Scheduling RT tasks in
multiprocessor and distributed systems
**Assignment
Topics

Module 3: In RTOS definition and characteristics, comparison 11 1,5

< Real Time Class with general-purpose OSs, light-weight vs. heavy-
Operating weight RTOSs, Commercial RTOS: UNIX V,
System & Real UNIX based RTOS, RT POSIX, RT capabilities of
time Windows NT, Windows CE, Performance
communication benchmarking of RTOS Characteristics of RT
> traffic, Models for traffic characterization,
 Applications requiring RT communication, Soft and
hard RT communication in a LAN, Network
Topologies, Fault tolerant Routing, Fault Error
containment Redundancy, Bounded access
protocols for LANs, Performance comparison, QoS
framework.
**Assignment QoS models
Topics

Module 4: in class Definition, Real time vs General Purpose Databases, 6 1,4

< Real time Transaction priorities, Transaction Aborts,
databases> Concurrency control issues, Disk Scheduling
Algorithms, Two phase Approach to improve
Predictability, Maintaining Serialization
Consistency, Commercial RT databases
**Assignment
Topics

Module 5: in class Reliability Evaluation Techniques, Software error 8 1,3

< Evaluation models, Clock Synchronization, Fault Tolerant
Techniques and Synchronization in hardware and software.
Clock Programming Languages and Tools, Desired
Synchronization language characteristics, Data typing, Control
& Programming Structures, Facilitating Hierarchical Decomposition,
languages and Packages, Programming Environments, Run time
tools > support
**Assignment
Topics

Text Books:
1. Rajiv Mall, “Real Time Systems, Theory and Practice”, 2nd Edition, Pearson Education, 2007.
2. J.W. Liu, “Real Time systems”, Pearson Education, 5th Edition, 2004.
Reference Books:
1. Phillip Laplante, Prentice Hall, “Real Time Systems Design and Analysis”, 3rd Edition.
2. Krishna & Shin, “Real Time systems”, Tata McGraw Hill, 1999.
Mark H. Klein, Thomas Ralya, “Practitioner’s Handbook for Real-Time Analysis”, 2nd
Edition, Kluwers Academic Publishers, 1994.
4. Hassan Gomaa, “Software Design Methods for Concurrent and Real-time
Systems”, AddisonWesley.
5. Stuart Bennett, “Real Time Computer Control – An Introduction”, Prentice Hall of India, 1998.
6. S.T. Allworth and R.N.Zobel, “Introduction to real time software design”, Macmillan,
2nd Edition, 1987.
Sub Code: IT328A3 Credit: 4(L-3, T-1, P-0)
CLOUD COMPUTING
Questions to be set: 05 (All Compulsory)
Course Objectives: This course gives an introduction to cloud computing and its techniques -
Infrastructureas a Service (IaaS), Platform-as-a-Service (PaaS), Software as a Service (SaaS), issues,
ecosystem and case studies
Pre-requisites: Operating Systems and Computer Network.
Course Outcomes(CO): On completion of the course it is expected to endow the
studentswith skills to:
1. Analyse the Service Oriented Architecture and Cloud Computing paradigms.
2. Implement and evaluate a service mashup.
3. Analyse the enterprise models in cloud computing.
4. Evaluate a Software as a Service (SaaS) application.
5. Illustrate the Security issues associated with the Cloud Computing paradigm.

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: In Cloud computing, History of cloud computing, Cloud 12 1,3

Understanding Class architecture, Cloud storage, Why cloud computing
Cloud matters, Advantages of cloud computing,
Computing Disadvantages of cloud computing, Companies in the
and Privacy cloud today, Federation in the cloud, Presence in the
and Security cloud, Privacy and its relation to cloud-based
in Cloud information systems, Security in the cloud, Common
computing standards in the cloud, End-user access to the cloud
computing.
**Assignment
Topics

Module 2: In Web-based application, Pros and cons of cloud service 7 2,4

Developing Class development, Types of cloud service development,
Cloud Software as a service, Platform as a service, Web
Services services, On demand computing, Discovering cloud
services, Development services and tools, Amazon
Ec2, Google app engine, IBM clouds
**Assignment
Topics

Module 3: In Software utility application architecture, 7 2,4

Cloud Utility Class Characteristics of a SaaS, Software utility
and Business applications, Cost versus value, Software application
profit services framework, Common enablers, Conceptual
view, to reality, Business profits, Implementing
database systems for multitenant architecture
**Assignment
Topics

Module 4: in class Centralizing email communications, Collaborating on 7 4,5

schedules, Collaborating on To-Do Lists
 Cloud Collaborating contact lists, Cloud computing for the
Computing community, Collaborating on group projects and
for Everyone events, Cloud computing for the corporation
**Assignment
Topics

Module 5: in class Collaborating on calendars, Schedules and task 7 5

Using cloud management, Exploring online scheduling
services applications, Exploring online planning and task
management, Collaborating on event management,
Collaborating on contact management, Collaborating
on project management, Collaborating on word
processing, Collaborating on databases, Storing and
sharing files.
**Assignment
Topics

Text Books:
1. Michael Miller, “Cloud computing: Web based applications that change the way you work
andcollaborateonline”, Pearson.
2. Haley Beard, “Cloud computing best practices for managing and measuring processes for on
demandcomputing, Applications and data centers in the cloud with SLAs”, Emereo.

Reference Books:
1. Guy Bunker and Darren Thomson, “Delivering Utility Computing”, John Wiley & Sons.
2. George Reese, “Cloud Application Architectures”, O’Reilly.
3. Lee Gillam, “Cloud Computing: Principles, Systems and Applications”, Springer.
4. Brian J. S. Chee, Curtis Franklin, Jr., “Cloud Computing: Technologies and Strategies of theUbiquitous
Data Center”, CRC Press
Sub Code: IT337A3 Credit: 4(L-3, T-1, P-0)
AD HOC WIRELESS NETWORKS
Questions to be set: 05 (All Compulsory)
Course Objectives: This course will introduce the students to the diverse literature on ad-hoc
wireless networks, and expose them to the fundamental issues in designing and analyzing ad-
hocwireless network systems. A detailed study on related technologies and standards ranging
from networking, OS support and algorithms, to security will constitute the syllabus. The
primary concern will be protocol design, communication and computational challenges
posed by ad hoc wireless networking systems.

Pre-requisites: Data Communication, Computer Network

Course Outcomes (CO): On completion of the course it is expected to endow the students with skills to:
1. Describe the unique issues in ad-hoc/sensor networks.
2. Enumerate current technology trends for the implementation and
deployment ofwireless ad-hoc/sensor networks.
3. Discuss the challenges in designing MAC, routing and transport
protocols forwireless ad-hoc/sensor networks.
4. Explain the challenges in designing routing and transport protocols for wireless Ad-
hoc/sensornetworks.
5. Recognize the various sensor network Platforms, tools and applications.

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Introduction to wireless networks, Infrastructure 5 1,2

Ad Hoc class based and Infrastructure less wireless networks,
Wireless issues and challenges of Infrastructure-less networks,
Networks Layered architecture in Ad hoc networks
**Assignment
Topics

Module 2: in Introduction to MAC layer, Design issues and 8 1,2

MAC class challenges, MAC layer protocols for Ad hoc
Protocols for networks –MACA, MACAW, BTMA, DBTMA, RI-
Ad Hoc BTMA
Wireless **Assignment
Networks Topics

Module 3: in Introduction to Routing, Design issues and 10 3,4

Routing class challenges in Routing, Routing protocols for Ad hoc
Protocols for networks– DSDV, AODV, ZRP, CGSR and LAR,
Ad Hoc Multicast Routing – Issues in Multicast routing, Tree
Wireless Based and Mesh based Multicast routing
Networks **Assignment
Topics

Module 4: in class Issues and challenges for designing transport layer 10 1,4
Transport protocol, Transport layer solutions – Feedback based
Layer: TCP, Split TCP, Ad hoc TCP. Introduction on QoS
 Introduction services in Adhoc network, Issues and challenges in
to Transport providing QoS in Ad hoc networks, Frameworks for
Layer, Ad hoc networks – QoS Model, RSVP, SWAN
Quality of
Service in Ad **Assignment
Hoc Wireless Topics
Networks
Module 5: in class Introduction on Security of ad hoc wireless 7 3,4
Security in networks, Issues and challenges in securityprovision
Ad hoc for ad hoc wireless protocols, Network layer attack,
Network transport layer attack, Requirement of secure routing
Energy protocol for adhoc wireless network – Security-
Management Aware AODV protocol Introduction, Need for
in Ad Hoc energy management in Ad hoc network. Battery
Wireless management schemes – DLL solutions, Network
Networks layer solutions Unaddressed issues in Ad hoc
Recent networks.
Trends in Ad **Assignment Ad hoc Internet, Ultra-Wide-Band-Radio
hoc networks Topics communication Wireless Fidelity, Optical wireless
networks

Text Books:
1. C. Siva Ram Murthy, B.S. Manoj, “Ad Hoc Wireless Networks
Architectures andProtocols”,Pearson Publication.
2. Charles E Perkins, “Ad Hoc Networking” Addison-Wesley.

Reference Books:
1. Toh CK, “Ad Hoc Mobile Wireless Networks”, PHI.
2. LabiodHouda, “Wireless Ad Hoc and Sensor Networks”, Wiley.
3. William Stallings “Wireless Communication and Networks”, Pearson.
4. Prashant Mohapatra, SrikanthKrishnamurthy,“Ad Hoc Networks
TechnologyandProtocols”,Springer.

.
 Sub Code: IT338A3 Credit: 4(L-3, T-1, P-0)

HIGH PERFORMANCE COMPUTING

Questions to be set: 05 (All Compulsory)
Course Objective: The overall goal is to acquaint students with parallel computations in current
hardware and software tools, and trends in parallel scientific computing, to provide an opportunity to
build and executesample parallel codes, program in multicore and cluster architectures.
The theoretical and practical mix of the HPC Software development programs has the
following objectives:
1. To explore the fundamental concepts of Parallel programming and HPC Solutions and their
applications.
2. To develop in-depth knowledge and understanding of HPC domain.
3. To understand the various search methods and visualization techniques.
4. To learn to use various HPC tools.
5. To understand the applications using Map Reduce Concepts, OpenMP, CUDA, MPI,
Xeon Phiprogramming.

Pre-requisites: Programming in C/C++, basic knowledge of UNIX/Linux shell, familiarity with

basicnumerical algorithms and computer architecture.

Course Outcomes: On completion of the course it is expected to endow the students

withskills to:
1. Define the fundamental concepts and techniques in parallel computation structuring and design.
2. Describe several parallelization methodologies and paradigms.
3. Choose various mathematical paradigms describing parallel computing systems.
4. Explain the architectures of high-performance computing systems.
5. Select appropriate application/platform for algorithm implementation.
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: In High performance computing: Why, and why now? 8 1

Introduction and Class Concepts and scientific applications, Parallel
Categories of decomposition, basic architecture and OS concepts,
machines Multi-core CPUs, High-speed interconnects, High
performance file systems, GPU systems, Multicore
and many core shared memory machines via the
work-span model, distributed memory machines
like clusters and supercomputers via network
models, and sequential or parallel machines with
deep memory hierarchies.
**Assignment High performance clusters
Topics

Module 2: In Parallel computer architecture and parallel software, 8 2,3

Parallel Class processor and memory systems of parallel
computing and computers, different types of parallelism (on
HPC tools instruction level, on computational task level and
data parallelism), Profiling and Debugging of codes
tools: gprof, Vtune, Performance library like mkl,
Demo of the sample code by using the above tools.
 **Assignment Performance models for parallel systems, gdb,
Topics lapack, fft , Analysis tools like : ITAC , MPI
libraries.
Module 3: In Shared memory multiprocessing programming ( 8 2,3
Programming of Class OpenMP). OpenMP Programming Model, OpenMP
multicore API Overview, Compiling OpenMP Programs,
systems OpenMP, Synchronization Constructs, Directives,
Data Scope Attribute Clauses, Directive Binding
and Nesting Rules, Run-Time Library Routines,
Environment Variables, Thread Stack Size and
Thread Binding, Monitoring, Debugging and
Performance Analysis Tools for OpenMP,
**Assignment Case-Studies (Algorithms and Parallelization
Topics Approaches), Matrix –Matrix-multiplication.

Module 4: in class Message Passing Interface (MPI) and approaches 8 4,5

Programming of for the parallelization of programs: General
cluster systems Introduction, Point-to-Point Communication,
Blocking vs. Non-blocking sends, Collective
Communication, MPI hybrid models, profiling, and
debugging.

**Assignment Case Studies (Algorithms and Parallelization

Topics Approaches)

Module 5: in class Compilers, Environment Management Routines: 8 4,5

MPI Point to Point Communication Routines, MPI
Implementations Message Passing Routine Arguments, Blocking
and Hybrid Message Passing Routines, Non- blocking Message
programming Passing Routines, Derived Data Types Group and
(OpenMP and Communicator Management Routines Numerical
MPI) libraries & high performance I/O libraries,
Introduction to multi-threading accelerators,

**Assignment Collective Communication Routines, Virtual

Topics Topologies, A Brief introduction on MPI-2 and
MPI-3.

Text Books:
1. Michael J Quinn, “Parallel Programming in C with MPI and OpenMP”,
McGraw-HillHigher Education.
2. Ananth Grama, Anshul Gupta, George Karypis and Vipin
Kumar,“Introduction toParallel Computing”, Pearson Education India.
3. V. Rajaraman and C. Siva Ram Murthy, “Parallel Computers –
Architecture andProgramming”, Prentice-Hall of India, 2003.

Reference Books:
Georg Hager, Gerhard Wellein, "Introduction to High Performance Computing for Scientists and
Engineers",Chapman & Hall / CRC Computational Science series, 2011
Sub Code: IT329A3 Credit: 4(L-3, T-1, P-0)
DEEP LEARNING
Questions to be set: 05 (All Compulsory)
Course Objective: Deep Learning has received a lot of attention over the past few years and has
been employed successfully by companies like Google, Microsoft, IBM, Facebook, Twitter etc.
This course is an introduction to deep learning, a branch of machine learning concerned with the
development and application of modern neural networks. Deep learning algorithms extract layered
high-level representations of data in a way that maximizes performance on a given task.

Pre-requisites: Machine Learning, Calculus, Linear Algebra, Probability & Statistics

Course Outcomes: Upon successful completion of the course, the students are expected to be able to:

1. Describe deep learning techniques and computing environment that are suitable for the
applicationsunder consideration.
2. Discuss various solution plans and methodologies for an engineering problem using Deep Learning.
3. Classify the different technical issues related to Deep Architectures consistent with their level
ofknowledge and understanding.
4. Develop a set of alternative design solutions to problems for which standard algorithmic solutions do
notexist.
5. Apply Deep Learning techniques to solve real-life problems which directly or indirectly benefits to
thesociety.
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: In History, success stories, Basic Perceptron, linear and 8 1,2

Introduction Class nonlinear reparability, Linear Regression, Learning
and Deep Feed Algorithms: Hebb Rule, Perceptron learning.
Forward Pitfalls: overfitting, underfitting, bias, estimators and
Networks variance, Multilayer Perceptrons(MLPs),Activation
Functions:Sigmoid, Hyperbolic Tangent and ReLU.
Gradient Descent, Backpropagation Algorithm.

**Assignment
Topics

Module 2: In Regularization, Parameter noise penalties, Dataset 8 1,2

Regularization Class Augmentation, Noise Robustness, Learning Vs.
for Deep Optimization, Challenges in Neural Network
Learning Optimization, Stochastic Gradient Descent,
and Stochastic Gradient Descent with momentum,
Optimization Stochastic Gradient Descent with Nesterov
for Training momentum.
Deep Models **Assignment
Topics
 Module 3: in Architectures, convolution /pooling layers, 8 3
Convolution class feature
Neural extraction, Convolution Algorithm,
Networks unsupervisedfeatures, applications of CNN in
different areas.
**Assignment
Topics

Module 4: in class Recurrent Neural Networks, Bidirectional 8 3,4

Recurrent Neural Networks, Encoder-Decoder sequence
Neural to sequence architecture. Deep Recurrent
Networks and Networks: Recursive Neural Networks, Long-
Recursive Nets Short Term Memory.
**Assignment
Topics

Module 5: in class Applications of deep learning in computer 8 4,5

Applications of vision,speech recognition, Natural
Deep Learning Language Processing,
Sentence Classification using CNN.
**Assignment
Topics

Text Books:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville. “Deep Learning”.
2. Duda, R.O., Hart, P.E., and Stork, D.G. “Pattern Classification”. Wiley-
Interscience. 2ndEdition, 2001.
3. Laurene Fausett, “Fundamentals of Neural Networks”.

Reference Books:
1. Theodoridis, S. and Koutroumbas, K. “Pattern Recognition”. Edition 4. Academic
Press,2008.
2.Francois Chollet , “Deep Learning with Python”
3. Bishop, C. M. “Neural Networks for Pattern Recognition”. Oxford University Press.
1995. 4.Hastie, T., Tibshirani, R. and Friedman, J. T”he Elements of Statistical Learning”.
Springer.2001.
Sub Code: IT330A3 Credit: 4(L-3, T-1, P-0)
PATTERN RECOGNITION
Questions to be set: 05 (All Compulsory)
Course Objective: The objective of this course is to provide an introduction to basic concepts and
methodologies for Pattern Recognition, and to develop a foundation that can be used as the basis
for further study and research in this field.

Pre-requisites: Engineering Mathematics-III and IV

Course Outcomes: Upon successful completion of the course, the students are expected to be able to:

1. Describe the components and processes of a pattern recognition system. To understand

supervised learning techniques of pattern recognition systems.
2. Explain decision trees and Bayes classification basics.
3. Discuss nearest neighbor and linear classification concepts
4. Summarize clustering techniques fundamentals.
5. Outline principles of syntactic pattern recognition

** Not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Preview of Inductive Learning – A Specific-to- 6 1

Introduction to a class General Procedure – A General-to-Specific Procedure
Pattern – Overview of Classifiers.
Recognition
System
**Assignment
Topics

Module 2: in Basics – Building a Decision Tree – Classifying by 8 2

Decision Trees, class using a Decision Trees, Simplifying Bayes
Bayes Classification – Estimation of Probabilities – Naive
Classification, Bayes with Binary Attributes – Continuous Attribute
Values – Performance of Bayes Classifier.

**Assignment
Topics
Module 3: in Underlying Idea – Numeric Attribute Values – Non- 8 3
Nearest class numeric Attribute Values – Mixed Attribute Values –
Neighbour Performance of Nearest Neighbor Classifier, Training
Classification, a Linear Classifier – The Two-class case – Higher
Linear Dimensional Attribute Space.
Classification
**Assignment
Topics
 Module 4: in class Agglomerative Hierarchical Clustering – k- 7 4
Clustering: Means Clustering – Non-numeric Attributes.
Basics
**Assignment
Topics

Module 5: in class Strings and Grammars – Chomsky Normal 7 5

Syntactic Pattern Form – Parsing – Stochastic Grammars
Recognition
**Assignment
Topics

Text Book:
1. Pattern Recognition: Techniques and Applications, Rajjan Shinghal, Oxford University Press

Reference Books:
1. Pattern Recognition: Statistical, Structural and Neural networks, Robert Schalkoff, 2005, John Wiley &
Sons Inc.
2. Pattern Classification, Richard O.Duda, Peter E. Hart & David G. Strok, John Wiley & Sons, Inc.
Sub Code: IT331A3 Credit: 4(L-3, T-1, P-0)

WEB CONTENT MANAGEMENT AND WEB 3.0

Questions to be set: 05 (All Compulsory)
Course Objective: This course enables students to understand the basic terminology and concepts
of the Web 3.0, Distributed Computing Systems and Block Chains

Pre-requisites: Web Technology and Web Services

Course Outcomes: Upon successful completion of the course, the students are expected to be able to:
1. Describe the fundamentals of Web 3.0 is and its key features and applications.
2. Explain the concepts of distributed computing and decentralized systems.
3. Discuss symmetric key cryptography, including substitution and transposition techniques.
4. Outline the principles of public key cryptography and message authentication.
5. Summarize the types and uses of block chains.

** Not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in What Is Web 3.0? Web 3.0, Cryptocurrency and 7 1

Introduction class Blockchain, Web 3.0 Technologies, Evolution of the
Web 3.0 Technologies, Key Features of Web 3.0, Web
3.0 Applications
**Assignment
Topics

Module 2: in Definition of Distributed Computing System, Relation 8 2

Distributed class to parallel systems, Synchronous vs Asynchronous
Computing and execution, Design issues and challenges, Models of
Decentralized communication networks, Global state of distributed
System system, Models of process communication,
Decentralized system.
**Assignment
Topics
Module 3: in Symmetric Cipher Model – Substitution Techniques – 7 3
Symmetric Key class Transposition Techniques –Block Ciphers and the
Cryptography Data Encryption Standards: Simplified DES – The
Data Encryption Standard
**Assignment
Topics
 Module 4: in class Principles of Public-Key Cryptography – The 8 4
Public Key RSA Algorithm – Key Management – Diffie-
Cryptography Hellman Key Exchange – Authentication
and Message Requirements – Authentication Functions –
Authentication Message Authentication and Hash Functions –
MD5 Message Digest Algorithm – Digital
Signature and Authentication Protocols
**Assignment
Topics

Module 5: in class Blockchain, Types of blockchains- Public 8 5

Blockchains block chains, Private block chains, Hybrid
block chains, Sidechains, Smart contracts,
Uses of block chains-Cryptocurrencies,
Financial services, Games, Supply chain,
Domain names, Other uses.
**Assignment
Topics

Text Book

1. Blockchain and Web 3.0- Social, Economic, and Technological Challenges, 2019, Publisher: Taylor &
Francis, Giuseppe Destefanis, Massimo Ragnedda
2. Distributed Computing, Ajay D. Kshemakalyani, Mukesh Singhal, 2008, Cambridge University Press
3. Cryptography and Network Security-Principles and Practices, William Stallings, 2003, Pearson
Education

Reference Book(S)

1. Web 3.0 Startups- Online Marketing Strategies for Launching & Promoting Any Business on the Web, By
R. L. Adams · 2013
2. Blockchain and Crypto Currency, 2020, Springer Singapore, Chris Dai, Kenichi Masuda, Makoto Yano,
Yoshio Kishimoto
 Sub Code: IT332A3 Credit: 4(L-3, T-1, P-0)

SOFT COMPUTING
Questions to be set: 05 (All Compulsory)
Course Objectives: This course provides a comprehensive study on various computational techniques (suchas
Genetic Algorithm, ANN, Fuzzy Logic etc.) used in computer science for modelling or solving complex
problems for which more conventional methods have not yielded low cost, analytic and complete solutions.
Pre-requisites: Data Structures, Design and Analysis of Algorithms and Artificial Intelligence.

Course Outcomes (CO): On completion of the course the students will be able to:
1. Identify Soft Computing principles and techniques and apply them in logical reasoning.
2. Identify fuzzy and predicate logic logic applications and implement them in solving basic
engineeringproblems.
3. Visualize and employ Rough decision systems.
4. Formulate solutions to real life engineering problems Basic ANN models.
5. Employ Genetic Algorithms for solving real life optimization problems.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PS
covered O
Module 1: in Introduction: Definition and Concept of Soft 10 1
< class Computing, Aspects of Soft Computing, Dealing
Introductio with Vagueness- Fuzzy Systems, Rough Sets,
n& Fuzzy Modeling the Brain-Human Cognition, Artificial
Set Theory Neural Networks, Modeling Nature’s
> Optimization Process- Natural Evolution, Genetic
Algorithms, Other Evolutionary Processes,
Synergy Among the Soft Computing Techniques
Fuzzy Set Theory: Review of Crisp Set theory -
Sets and subsets, Definitions, Concepts, Notations
and Operations on sets, De Morgan’s Law, Fuzzy
Sets – Fuzziness/vagueness, Membership function
- Crisp membership, Fuzzy membership, Membership
profiles, Fuzzy sets - Definition, Notation, Features,
Transformation. FuzzyMembership Functions -Some
Popular Membership Function, Transformations on
Membership Functions, Fuzzy set operations,
Properties, De Morgan’s Law, Fuzzy Relations,
Operations on fuzzy relations

**Assignment
Topics
Module 2: Generalized Modus Ponens, Fuzzy Inference,
< Fuzzy Generalized Modus Tollens
Logic & Propositional Logic: Propositions, Propositionallogic
Propositional well-formed formulae, Properties of wffs,
Logic > Interpretation of logical expression, Logical
equivalence, Tautology/ Contradiction/ Consistency,
Validity of an argument
**Assignment
Topics
 Module 3: in Predicate Logic: Limitations of propositional logic, 11 2,3
< Predicate class Predicate logic well-formed formulae,
Logic & Properties of FOPL wffs, Rules of Inference,
RoughSets > Deductive Rules, Modus ponens, Universal
Specialization, Chain Rule, Simplification,
Resolution, Modus Tollens, Addition, Non-
deductive Rules, Abduction, Induction, Analogy.
Rough Sets : Information Systems & Decision
Systems, Indiscernibility, Set Approximations-
Lower & Upper Approximations, Rough set
properties, Rough Membership: Rough
Membership Function, Properties, Rough set
Categories, Roughly B-definable, Internally B-
definable, Externally B- definable, Totally B-
definable, Reducts: Reduct & Minimal Reduct,
Discernibility Mattrix & Discernibility Function
**Assignment
Topics
Module 4: in class Artificial Neural Networks : Basic Concepts-The 5 4
< Artificial Biological Neuron, The Artificial Neuron,
Neural Characteristics of the Brain, Computation in Termsof
Networks > Patterns -Pattern Classification, Pattern Association,
The McCulloch- Pitts Neural Model,The Perceptron,
Neural Network Architectures - Learning by Neural
Nets, Multilayer Feed forward, The Back
propagation Algorithm - Learning,
Parameter Choice, Initialization, Stopping criteria,
Training set, Data Representation, Hidden Layers.
**Assignment
Topics
Module 5: in class Genetic Algorithms - Natural Evolution, 5 5
<Advanced Chromosomes, Natural Selection , Cross-over,
Search Mutation, Basic GA, Encoding a solution as
Algorithms > chromosome / decoding it, Fitness Function,
Population, GA operators- Selection, Tournament,
Roulette Wheel, Cross-over, Mutation, GA
parameters , Convergence
**Assignment
Topics

Text Books:
1. J.-S.R. Jang, C. -T. Sun, E.Mizutani, “Neuro-Fuzzy And Soft Computing-A
Computational Approach to Learning and Machine Learning”, Pearson Education.
2. LaureneFausett, “Fundamentals of Neural Networks – Architechture, Algorithms andApplications”,
Prentice Hall.
Reference Books:
1. Simon Haykin, “Neural Networks – A Comprehensive Foundation”, Prentice Hall.
2. Jerry M. Mendel, “Uncertain Rule-Based Fuzzy Logic Systems: Introduction and NewDirections”,
Prentice Hall
3. Melanie Mitchell, “An Introduction to Genetic Algorithms”, MIT Press.
4. Jan Komorowski, Lech Polkowski, Andrej Skowron, "Rough Sets- A Tutorial",(Electronic Copy)
5. ZbigniewSuraj, "An Introduction to Rough Set Theory and Its Applications- A
Tutorial", , ICENCO'2004, Cairo, Egypt, (Electronic Copy).
Sub Code: IT333A3 Credit: 4(L-3, T-1, P-0)
CYBER PHYSICAL SYSTEMS
Course Objective: The objective of this course is to develop an exposition of the challenges in
implementing a cyber-physical system from a computational perspective, but based equally on the
principles of automated control. The course aims to expose the student to real world problems in
this domain and provide a walk through the design and validation problems for such systems.

Pre-requisites: Nil

Course Outcomes: Upon successful completion of the course, the students are expected to be able to:

1. Understand the basic building blocks of Cyber Physical Systems (CPS), and basic principles of design
and validation of CPS.
2. Apply the principles of dynamical systems for designing controller.
3. Identify the CPS implementation issues.
4. Illustrate safe reinforcement learning, secure task mapping, and partitioning.
5. Understand the principles of secure task mapping and partitioning in Cyber-Physical Systems (CPS)
deployments, as well as the concept of state estimation for attack detection.

** Not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: In Cyber-Physical Systems (CPS) in the real world – 7 1

Introduction to Class Basic principles of design and validation of CPS –
Cyber-Physical Industry 4.0 – AutoSAR – IIOT implications –
Systems(CPS) Building Automation – Medical CPS, Processors –
and CPS Sensors – Actuators – CPS Network - WirelessHart –
Platform CAN – Automotive Ethernet – Scheduling Real Time
Components CPS tasks

**Assignment Applications of Industry 4.0

Topics

Module 2: In Dynamical Systems and Stability – Controller Design 7 2

Principles of Class Techniques – Performance under Packet drop and
Dynamical Noise .
Systems
**Assignment Survey of a few dynamical systems.
Topics
Module 3: In From features to automotive software components – 8 3
CPS Class Mapping software components to ECUs – CPS
implementation Performance Analysis - effect of scheduling – bus
issues latency – sense and actuation faults on control
performance – network congestion – Building real-
time networks for CPS

**Assignment
Topics Metrics for CPS performance analysis.
 Module 4: In Safe Reinforcement Learning – Robot motion 7 4
Intelligent CPS Class Topics control – Autonomous Vehicle control –
Gaussian Process Learning – Smart Grid
Demand Response – Building Automation

**Assignment Applications of smart grid systems.

Topics

Module 5: In Secure Task mapping and Partitioning – State 7 5

Secure Class Topics estimation for attack detection – Automotive
Deployment of Case study: Vehicle ABS hacking – Power
CPS Distribution Case study: Attacks on
SmartGrids.

**Assignment Detection and diagnosis of attacks on

Topics SmartGrids.

Text Book

1. Alur, Rajeev. Principles of cyber-physical systems. MIT Press, 2015.

2. Lee, Edward Ashford, and Sanjit A. Seshia. Introduction to embedded systems: A cyber-physical systems
approach. MIT Press, 2016.

Reference Book(S)

1. Lee, Edward A., and Sanjit A. Seshia. "An introductory textbook on cyber-physical systems." Proceedings of the
2010 Workshop on Embedded Systems Education. ACM, 2010.
2. Talcott, Carolyn. "Cyber-physical systems and events." Software-Intensive Systems and New Computing
Paradigms. Springer, Berlin, Heidelberg, 2008. 101-115.
Sub Code: IT334A3 Credit: 4(L-3, T-1, P-0)
SOCIAL NETWORK ANALYSIS
Questions to be set: 05 (All Compulsory)
Course Objectives: To understand how the world is connected -- socially, strategically and
technologically and why it matters and to introduce the basic notions and model used for social
networkanalysis.

Pre-requisites: Graph Theory

Course Outcomes (CO): On completion of the course, it is expected to endow the students with skills to:
1. Define competence in Social Network Analysis fundamentals.
2. Explain and extend the competence in structural models of Social Network fundamentals.
3. Illustrate the ability to formulate and interpret several Social Network.
4. Represent the Social Network analysis results.
5. Analyze Social Network Graphs to reach a valid conclusion

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Motivation, Social Network Perspectives, 8 5

Introduction class Introduction to Network, Centrality measures,
Balance and Homophily.
**Assignment
Topics
Module 2: in Basic Graph Theory for Social Network, Models for 12 4,3
SNA Models class Network Growth, Link Analysis
**Assignment
Topics

Module 3: in Community Detection, Link Prediction, Clustering of 6 1

Social class connectivity
Networks
**Assignment
Topics

Module 4: in class Cascade Behavior, Link Analysis 6 3

Analysis

**Assignment
Topics

Module 5: in class Graph Representation, Graph Mining, Case Studies 8 2, 1

Graphs

**Assignment
Topics
Text Books:
1. S. Wasserman and K. Faust. Social Network Analysis: Methods and
Applications,Cambridge University Press, 1994
2. D. Easley and J. Kleinberg, Networks, Crowds and Markets: Reasoning about a
highlyconnected world, Cambridge University Press, 2010

Reference Books:
1. Peter R. Monge, Noshir S. Contractor, Theories of communication networks.
OxfordUniversity Press, 2003.
2. Duncan Watts. Six degrees: the science of a connected age. Norton, 2004.
Sub Code: IT335A3 Credit: 4(L-3, T-1, P-0)
REMOTE SENSING AND GEOGRAPHIC INFORMATION SYSTEM
Questions to be set: 05 (All Compulsory)
Course Objectives: Introduce the principles of remote sensing to students who are beginners in this
field. Much as the text book has laid out, fundamental knowledge on the physics of remote sensing,
aerial photographic techniques, photogrammetric, multispectral, hyper-spectral, and thermal imaging,
and RADARand LIDAR image analysis will be introduced. The newest technology in the field will also
be discussed. The subject will be synthesized by developing an overall application of the discipline, not
just knowledge in one aspect. The course will be taught with an emphasis on the geographical
applications of remote sensing; however, in certain instances other disciplines will be introduced as well.
Lab assignments will supplement classroom discussion and reading assignments. At the end of the
semester students should have a good understanding and basic skills of remote sensing.

Pre-requisites: Real Time System, Digital Image Processing

Course Outcomes (CO): On completion of the course, it is expected to endow the students with skills to:
1. Define the concepts and recognize the characteristics of a real-time system.
2. Identify and implement important software engineering principles for real-time system
development.
3. Produce an architectural design of a real-time system.
4. Evaluate the real-time systems in appropriate terminology and the real-time characteristics of a
given system to assist in deciding which software or kernel is appropriate for a problem.
5. Interpret and contrast the design of a real-time system in a range of commonly understood formats

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Top Hrs CO PO PSO
covered ics
Module 1: in Introduction of Remote Sensing- 5 1
< Physics of class Electromagnetic spectrum, physics of remote
Remote Sensing sensing-Effects of atmosphere-scattering-
> Different types- Absorption-Atmospheric
Window-Energy interaction with surface
features-Spectral Reflectance of vegetation, soil
and water- atmospheric influence on spectral
response patterns- multi concept in Remote
Sensing
**Assignment
Topics
Module 2: In Class Data Acquisition: Types of platforms- Different 7 2,3
types aircraft- Manned and Unmanned space
Data crafts– sun synchronous and geo synchronous
Accquistion satellites-Types and characteristics of different
platforms
LANDSAT,SPOT,IRS,INSAT,IKONOS,QUIC
KBIRD, etc. – Photographic products, B/W,
colour, colour IR film and their characteristics –
resolving power of lens and film–Opto
mechanical electro optical sensors – across track
and along track scanners – multi spectral
scannersn and thermal scanners – geometric
characteristics of scanner imagery – calibration
**Assignment
Topics
 Module 3: in Microwave scatterometry – types of RADAR – 7 3,4
Scattering class SLAR – resolution – range and azimuth – real
System aperture and synthetic aperture RADAR.
Characteristics of Microwave images- topographic
effect – different types of Remote Sensing
platforms –air borne and space borne sensors –
ERS, JERS, RADARSAT, RISAT –
Scatterometer, Alimeter- LiDAR Remote Sensing,
principles, applications
**Assignment
Topics
Module 4: in class Multi Spectral & Hyper Spectral Remote Sensing: 9 4
Multi Spectral Sensors characteristics – principle of spectroscopy
& Hyper – imagine spectroscopy – field conditions,
Spectral compound spectral curve, Spectral library,
Remote Sensing radiative models, processing procedures,derivative
and Thermal spectrometry, thermal remote sensing – thermal
Radiation sensors, principles, thermal data processing,
Principles and applications.
Thermal Thermal Radiation Principles and Thermal
Imaging Imaging:
Thermal remote sensing– thermal sensors,
principles, thermal data processing, applications
**Assignment
Topics
Module 5: in class Data analysis: resolution- spatial, spectral, 12 5
Data analysis & radiometric and temporal resolution- signal to
Applications of noise ratio- data products and their characteristics
remote sensing – visual and digital interpretation –basic principles
of data processing –radiometric correction –image
enhancement –image classification – principles of
lidar, aerial laser terrain mapping.
Applications of remote sensing: Remote sensing of
soils and geomorphology, Remote Sensing of
vegetation, Remote sensing of water resources and
Urban applications using remote sensing imagery.
**Assignment
Topics

Text Books:
1. Jensen, John R., 2000, Remote Sensing of the Environment: An Earth Resource
Perspective, NewJersey: Prentice Hall, 544 pages. ISBN 0-13-489733-1.
Reference:
1. Lillsand T.M. and Keifer, R.W. Remote sensing and Image Interpretation, VI edition of John
Wiley& Sons-2000.
2. John R. Jesen, Introductory Digital Image Processing: A Remote Sensing Perspective, 2nd
Edition,1995.
3. John A.Richards, Springer-Verlag, Remate Sensing Digital Image Analysis 1999.
4. Paul Curran P.J. Principles of Remote Sensing, ELBS, 1995.
5. Charles Elachi and JakobJ.vanZyl, Introduction to the Physics and Techniques of Remote
Sensing,Wiley Series in Remote Sensing and Image Processing, 2006.
6. Sabins, F.F.Jr, Remote Sensing Principles and Image Interpretation, W.H. Freeman &co,
1978.
Sub Code: IT336A3 Credit:4 (L-3, T-1, P-0)
WIRELESS SENSOR NETWORKS
Questions to be set: 05 (All Compulsory)
Course Objectives: This course provides an introduction to the area of wireless sensor networks. A detailed
study on related technologies and standards ranging from networking, OS support and algorithms,to security will
constitute the syllabus. Its primary concern will be protocol design, communication and computational
challenges posed by Wireless Sensor based networking systems
Pre-requisites: Data Communication, Computer Networks, Knowledge of Ad Hoc WirelessNetworks
desirable.
Course Outcomes: On completion of the course, it is expected to endow the students with skillsto:
1. List and describe the engineering fundamentals of wireless communication applied insensor
network.
2. Identify and relate the complex engineering problem relating to sensor network
architectures and functions.
3. Formulate a solution plan and methodology by Applying appropriate theory, practicesandtools
to the development of wireless sensor network with respect to its applications area.
4. Differentiate and select optimal design scheme suitable for wireless sensor network.
5. Discuss and compare the design principles and implementation of a variety of key sensor networking
protocols and algorithms.
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: In Definition, Requirement and Evolution 8 1

Introduction to Class of Wireless Sensor Networks (WSN),
Wireless Examples of WSNs, Difference
Sensor between WSNs and Ad Hoc Wireless
Networks and Networks, IEEE 1451 and Smart
Infrastructure Sensors, Transducers and Physical
Control & Transduction Principles, Sensors for
Communication Smart Environments, Commercially
Networks Available Wireless Sensor Systems,
Self-Organization and Localization.
Network Topology, Communication
Protocols and Routing, Topology
Control, Clustering, Time
Synchronization, Power Management,
Network Structure and Hierarchical
Networks, Historical Development and
Standards.

**Assignment
Topics

Module 2: In A Tracking Scenario, Problem Formulation, 9 2

Canonical Class Distributed Representation and Inference of States,
Problem Tracking Multiple Objects, Sensor Models and
Performance Comparison and Metrics,
Localization Localization, ranging techniques, range-based
and Tracking, localization, GPS-based localization; range-free
Signal localization; event-driven localization. Signal
Processing and Conditioning, Digital Signal Processing, Decision
Decision Making and User Interface. Carrier Sense Multiple
Making and Access, Multiple Access with Collision Avoidance
Medium (MACA) and MACAW, MACA By Invitation,
Access Control IEEE 802.11, IEEE 802.15.4 and ZigBee;
protocols Characteristics of MAC Protocols in Sensor
Networks, Types of MAC Protocols.
**Assignment
Topics

Module 3: In Introduction, Key Assumptions, 7 2,3

Networking Class Medium Access Control, routing
Sensors and metrics, Issues and Challenges for
Routing Routing in WSN, Routing Based on
Network Structure, Routing Based on
Protocol Operation, categories of
routing protocol, flooding and
gossiping, data-centric routing,
proactive routing, on- demand routing,
hierarchical routing, location-based
routing
**Assignment
Topics

Module 4: in class Requirement, Issues and Challenges for 8 4

Security for different security protocols for WSNs,
Sensor Security Parameters, Sensor Network
Networks Limitations, Requirements for
Bootstrapping Security in Sensor
Networks, Evaluation Metrics, Single
Network-Wide Key, Using
Asymmetric Cryptography, Pairwise-
shared Keys, Bootstrapping Security
off a Trusted Base Station.
**Assignment
Topics

Module 5: in class Sensor Database Challenges, Query Interfaces, 8 5

Sensor High Level Database Organization, In Network
Network Aggregation, Data Centric Storages, Distributed
Databases and Hierarchal Aggregation, Temporal Data.
Applications Emerging Applications, Future Research
and Future Directions.
Directions
**Assignment
Topics
 Text Books:
1. Feng Zhao &Leonidas Guibas, Wireless Sensor Networks: An InformationProcessing Approach,
Elsevier Publication.
2. Jun Zheng & Abbas Jamalipour, Wireless Sensor Networks: A NetworkingPerspective, Wiley
Publication.
Reference Books:
2. Waltenegus Dargie & Christian Poellabauer, Fundamentals of Wireless SensorNetworks: Theory
and Practice, Wiley Publication,
3. Holger Karl &Andreas Willig, Protocols and Architectures for Wireless SensorNetworks, Wiley
Publication.
4. Robert Faludi, Building Wireless Sensor Networks, O’Reilly Publication.
5. Shahin Farahani, ZigBee Wireless Networks and Transceivers, 1st Edition, ElsevierPublication
 Sub Code: IT339A3 Credit: 4(L-3, T-1, P-0)

AUGMENTED REALITY
Questions to be set: 05 (All Compulsory)
Course Objectives: The syllabus is aimed to provide students with a solid background in alternative
3D compositing techniques using computer vision with applications in interactive interfaces – most
notably augmented reality interfaces on mobile devices. It also provides students with a comprehensive
knowledgein 3D vision and develop skills in the design and development of interactive augmented
reality games.

Pre-requisites: Students must have successfully completed a course in computer graphics.

Course Outcomes: On successful completion of this course, students will be able to:
1. Develop interactive augmented reality applications for both PC based mobile devices using a
varietyof novel input devices.
2. Describe a knowledge of the research literature in Augmented Reality for both compositing
andinteractive applications.
3. Create environment using AR/VR technology which can help us in our life.
4. It is easy to use this kind of technology to illustrate applications with AR toolkit and mobile AR.
5. Estimate the knowledge of the research literature in Augmented Reality for both compositing
andinteractive applications.

** not more than 20% of total topics to be allotted for assignment

Module Mode Top Hrs CO PO PSO
ics
Module 1: In Definition of Augmented Reality, History 6 2
of
Introduction to Class Augmented Reality, AR Systems Overview.
Input
Augmented and Output Devices for AR · Optical vs. Video
See-
Reality Through AR · Sample Applications –
medical,
military, manufacturing. Research Directions
–
tracking, interaction techniques, outdoor AR.
**Assignment
Topics

Module 2: In The Importance of Accurate Head Tracking / 7 1

The
Tracking for Class Tracking Problem · The Choice of the
Tracking
Augmented Technologies · Registration + Calibration –
static
Reality and dynamic · Real Time
Performance
Characteristics - spatial, temporal,
system
robustness · Scheduling and Fusing
Sensor
Information · Approaches to head
motion
prediction.
 **Assignment
Topics

Module 3: In The Importance of Effective AR Interface 9 3

Design ·
Interaction Class Basic Properties of AR Environments used
in
Techniques for Designing AR Interfaces · Interaction
Techniques
Augmented Based on Traditional Tracking Techniques
–
Reality magnetic, etc · Novel Input Devices -
InfoPoint
device from Sony CSL · Tangible and
Graspable
Interaction Approaches - ARgroove ·
Augmented
Reality Information Browsers · AR Widgets
and
Graphical Interface Elem ents · Evaluating
AR
**Assignment
Topics
Module 4: In Class Introduction to Computer Supported 9 4
Collaborative Collaboration AR Collaboration vs. Traditional
Augmented Computer Supported Collaborative Work •
Reality & Methods for Developing Collaborative AR
Heterogeneous Interfaces • Case Studies: - Face-to-Face
AR User Collaboration – Shared Space - Remote
Interfaces Collaboration – AR Conferencing, Wearable
AR Conferencing - Seamless
Collaboration – The MagicBook.
Flavors of augmented reality: video
mixing, optical blending, projection devices,
spatially augmented reality, Combining AR with
other user interface metaphors: Immersive
virtual reality, desktop metaphor,
mobile/wearable computing, ubiquitous
computing, tangible user interfaces,
computer supported collaborative work ,
Distributed graphics Sample, Application Areas.
**Assignment
Topics
Module 5:Mobile Introduction to Wearable and Situated 9 5
AR & Computing
Developing AR in a Mobile Setting , Current
Applications with Implementations/Examples –Outdoor AR,
ARToolKit Tracking a Mobile User , Mobile Display and
Computing Hardware, Environmental Modeling,
User Interface Issues , Example Solutions for
Mobile Applications.Overview of ARToolKit,
Computer Vision Based Tracking and
Registration Methods used in ARToolKit.
Steps for Developing a Simple AR
Application.ARToolKit-based Interaction
Methods. Future Developments with ARToolKit.
Demonstrations: MagicBook, VOMAR, ExView,
SimpleTest.
 **Assignment
Topics

Text Books:
1. Burdea, G. C. and P. Coffet. Virtual Reality Technology, Second Edition. Wiley-IEEE Press,
2003/2006.
2. Alan B. Craig, Understanding Augmented Reality, Concepts and Applications, Morgan
Kaufmann, 2013.

References Books:
1. Alan Craig, William Sherman and Jeffrey Will, Developing Virtual Reality Applications,
Foundations of Effective Design, Morgan Kaufmann, 2009.
 Sub Code: IT481A2 Credit: 3(L-3, T-0, P-0)
SCIENCE, TECHNOLOGY AND SOCIETY
Questions to be set: 05 (All Compulsory)
Course Objectives: This course aims to foster an understanding of science as a cultural and societal
practice, exploring its historical, philosophical, and sociological dimensions and the dynamic interplay
between science, technology, and society.

Pre-requisites: Nil

Course Outcomes (CO): On completion of the course it is expected to endow the students with skills to:

1. Understand science as a socio- cultural product in specific historical context.

2. Analyze philosophical, historical, and sociological perspectives on science and technology,
recognizing science as a practice deeply embedded in culture and society
3. Emphasize the dynamic nature of the relations between wider cultural practices, on the one
hand, and, scientific practices, on the other in a comparative analytical framework.
4. Explain the perspectives on the relationships between science and technology, and between
science, technology, and society
5. Identify the essential theories needed to analyze the dynamics between science and society
across various contexts and disciplines.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in class Methods of Science: Issues and Perspectives, 7 1
Science as Culture Social Context of Production of Scientific
Knowledge, Demarcation, Autonomy and
Cognitive Authority of Science, Challenges:
Cognitive, Legal, Ethical, Feminist and
Ideological.

**Assignment
Topics

Module 2: in class Science as Social Institution and Ethos of 5 1

Organisation of Science, Inequalities in Science, Critique of the
Production of Mertonian Paradigm, Knowledge Production:
Scientific Social and Cultural Contexts.
Knowledge and
Professionalisation **Assignment
of Science Topics
Module 3: in class Social Legitimation, Meanings, Interests, 5 2
< Society and Values and the Modern State..
Culture:
Resources and
Legitimation of
Knowledge **Assignment
Topics
 Module 4: in class Hierarchical, Symbiotic and Coalescing, 6 2
Perspectives on Science and Technology, and their Human
Science - Roots: Philosophy of Science and Technology,
Technology Technology as Knowledge, Technological
Relationship: Shaping of Society and Social Shaping of
Technology
**Assignment

Module 5: in class Science in Colonial India, Reception of 5 3

Science in Modern Science in India, Science after
Colonial and Independence
Post- colonial **Assignment
India
Module 6: in class Information and Communication Society - 6 4
Emerging Implications for Work, Social Relations,
Technologies Governance and Control, Biotechnology -
Implications for the Meanings of Life and Life,
Processes, Application in Agriculture,
Healthcare and Environment.
**Assignment

Module 7: in class Responses of the Civil Society. 2 4

New Ethical
Codes for New
Technologies
**Assignment
Module 8: in class Changing Context of the Production of 4 5
Science: From Knowledge, The Intellectual Property Rights
Public Resource Regime, Science: From Curiosity- driven
to Intellectual Research to Contract Obligations
Property
**Assignment

References:

1. A.F. Chalmers (1976) What is this thing called Science? Milton Keynes: The Open University Press
2. T.S. Kuhn (1970) The Structure of Scientific Revolutions. Chicago: Chicago University Press (first
published in 1962).
3. D. Oldroyd (1986) The Arch of Knowledge: An Introductory Study of the Philosophy and Methodology
of Science. New York and London: Methuen.
4. D. Bloor (1991) Knowledge and Social Imagery. Chicago: The University of Chicago Press (first
published in 1976).
5. M. Biagioli ed., (1999) The Science Studies Reader.
 Sub Code: IT482A2 Credit: 3(L-3, T-0, P-0)
ESSENCE OF INDIAN TRADITIONAL KNOWLEDGE
Questions to be set: 05 (All Compulsory)
Course Objectives: To facilitate the students with the concepts of Indian traditional knowledge and
to make them understand the Importance of roots of knowledge system.

Pre-requisites: Nil

Course Outcomes (CO): On completion of the course it is expected to endow the students with skills to:

1. Understand the concept of Traditional knowledge and its importance.

2. Know the need and importance of protecting traditional knowledge
3. Know the various enactments related to the protection of traditional knowledge
4. Understand the concepts of Intellectual property to protect the traditional knowledge
5. Understand the traditional knowledge in different sectors.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in class Define traditional knowledge, nature and 8 1
Introduction to characteristics, scope and importance, kinds of
traditional traditional knowledge, the physical and social
knowledge contexts in which traditional knowledge develop,
the historical impact of social change on
traditional knowledge systems. Indigenous
Knowledge (IK), characteristics, traditional
knowledge vis-à-vis indigenous knowledge,
traditional knowledge Vs western knowledge
traditional knowledge vis-à-vis formal
knowledge
**Assignment
Topics
Module 2: in class The need for protecting traditional knowledge 8 2
Protection of Significance of TK Protection, the value of TK
traditional in the global economy, Role of Government to
knowledge harness TK

**Assignment
Topics
Module 3: in class A: The Scheduled Tribes and Other Traditional 8 3
Legal Forest Dwellers (Recognition of Forest Rights)
framework and Act, 2006, Plant Varieties Protection and
Traditional Farmers Rights Act, 2001 (PPVFR Act);
Knowledge B: The Biological Diversity Act 2002 and
Rules 2004, the protection of traditional
knowledge
bill, 2016. Geographical indications act 2003
**Assignment
Topics
 Module 4: in class Systems of traditional knowledge protection, 6 4
Traditional Legal concepts for the protection of traditional
knowledge and knowledge, Certain non IPR mechanisms of
intellectual traditional knowledge protection, Patents and
property traditional knowledge, Strategies to increase
protection of traditional knowledge, global legal
FORA for increasing protection of Indian
Traditional Knowledge.
**Assignment

Module 5: in class Traditional knowledge and engineering, 5 5

Traditional Traditional medicine system, TK and
knowledge in biotechnology, TK in agriculture, Traditional
different sectors societies depend on it for their food and
healthcare needs, Importance of conservation
and sustainable development of environment,
Management of biodiversity, Food security of
the country and protection of TK
**Assignment

Text Books:
1. Traditional Knowledge System in India, by Amit Jha, 2009.
2. Traditional Knowledge System and Technology in India by Basanta Kumar Mohanta and Vipin
Kumar Singh, Pratibha Prakashan 2012.

References:
1. Traditional Knowledge System in India by Amit Jha Atlantic publishers, 2002
2. "Knowledge Traditions and Practices of India" Kapil Kapoor, Michel Danino
Sub Code: IT210A2/ IT210A8 Credit:4 (L-3, T-1, P-0)
INTRODUCTION TO CRYPTOGRAPHY
Questions to be set: 05 (All Compulsory)
Course Objectives: Objectives: The objective of this subject is to understand the principles of
various encryption algorithms including symmetric and public key cryptography. It also deals with
various hashing algorithms and network security mechanisms.
Pre-requisites: Computer Networks.
Course Outcomes (CO): On successful completion of this course, students should be able to:
1. Identify the services, mechanisms, and attacks outlined in the OSI Security Architecture relevant
to information security
2. Explain the principles of symmetric ciphers, including substitution and transposition techniques,
and analyze the strengths and operations of block ciphers and DES.
3. Apply public-key encryption techniques such as RSA and Diffie-Hellman, calculate using basic
number theory, and evaluate digital signature and authentication protocols.
4. Implement secure communication protocols for electronic mail and IP security, and assess the
effectiveness of these security measures.
5. Implement secure communication protocols for electronic mail and IP security, and assess the
effectiveness of these security measures.
** not more than 20% of total topics to be allotted for assignment
Module Mode Topics Hrs CO PO PSO

Module 1: in Services, Mechanisms and Attacks – The OSI 8 1

<Introduction> class Security Architecture

**Assignment
Topics

Module 2: in Substitution Techniques – Transposition 8 2

Symmetric class Techniques – Stenography –Block Ciphers and the
Ciphers Data Encryption Standards: Simplified DES –
Block Cipher Principles – The Data Encryption
Standard – The strength of DES – Block Cipher
design principles – Block Cipher modes of
Operation –Traffic Confidentiality – Key
Distribution – Random Number Generation

**Assignment
Topics

Module 3: in Number Theory: Prime and Relatively Prime 8 3

<Public- class Numbers, Modular Arithmetic, Fermat’s and
Key Euler’s Theorems, Testing for Optimality, Euclid’s
Encryptio Algorithm, Discrete Logarithms – The RSA
n Algorithm – Key Management – Diffie-Hellman
Key Exchange – Message Authentication and Hash
Functions – MD5 Message Digest Algorithm –
 Digital Signature and Authentication Protocols

**Assignment
Topics

Module 4: in class Electronic mail Security: Pretty good Privacy – 8 4

Network S/MIME – IP Security: IP Security Overview – IP
Security security architecture – Authentication Header –
Encapsulation Security

**Assignment
Topics
Module 5: in class Web Security considerations – Secure Socket and 8 5
Web Security transport layer security – Secure Electronic
Transaction – Viruses and related threats – Firewalls:
Firewall Design Principles

**Assignment
Topics

Text Book

1. Cryptography and Network Security-Principles and Practices, William Stallings, 2003, Pearson Education

Reference Books

1. Cryptography and Network Security, B.A. Forouzan,2008, MaGraw Hill

2. Internet Cryptography, Richard E. Smith, 1997, Addison Wesley
3. Internet Security, Professional Reference, Derek Atkins et al, 1997, TechMedia
4. Cryptography and Network Security, Atul Kahate, 2007, McGraw Hill
5. Applied Cryptography, Bruce Schneier, 1995, John Wiley and Sons Inc.
6. Modern Cryptography: Theory and Practice, Wenbo Mao, 2004, Pearson Education
 Sub Code: IT220A2/ IT220A8 Credit:4 (L-3, T-1, P-0)
INTRODUCTION TO CYBER SECURITY
Questions to be set: 05 (All Compulsory)
Course Objectives: The course is designed to present the basic concepts of cyber security. It addresses
the key issues of security vulnerabilities on software development, operating system and the web.
Solutions provided by cryptography has been discussed especially based on intrusion detection system.
The syllabus also gives a brief introduction to cyber forensics.
Pre-requisites: Basics of Computer Networks
Course Outcomes (CO): On completion of the course, it is expected to endow the
studentswith skills to:
1. Discover the concepts of cyber security and its social, technical and political techniques.
2. Illustrate on the various Intrusion detection and prevention techniques.
3. Analyze various algorithms based on Cryptography and Network security.
4. Assess various methods of handling investigations in the field of cyber forensics.
5. Explain the legal and social issues in the development and management of cyber security.

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: In Overview of Cyber Security, Internet 10 1

Governance –
Introduction Class Challenges and Constraints, Cyber Threats:-
Cyber
to Cyber Warfare-Cyber Crime-Cyber terrorism-
Cyber
Security Espionage, Need for a Comprehensive Cyber
Security
Cyber Policy, Need for a Nodal Authority, Need for
an
Security International convention on Cyberspace Cyber
Security
Vulnerabilities Vulnerabilities-Overview, vulnerabilities in
software,
and Cyber System administration, Complex
Network
Security Architectures, Open Access to Organizational
Data,
Safeguards Weak Authentication, Unprotected
Broadband
communications, Poor Cyber Security
Awareness.
Cyber Security Safeguards- Overview, Access
control,
Audit, Authentication, Biometrics,
Cryptography,
Deception, Denial of Service Filters, Ethical
Hacking,
Firewalls, Intrusion Detection Systems,
 Response,
Scanning, Security policy, Threat Management.
**Assignm
ent
Topics

Module 2: In Introduction, Basic security for HTTP 10 1,2

Applications
Securing Web Class and Services, Basic Security for SOAP
Services,
Application, Identity Management and Web Services,
Authorization
Services and Patterns, Security Considerations, Challenges.
Servers Intrusion, Physical Theft, Abuse of
Privileges,
Intrusion Unauthorized Access by Outsider, Malware
infection,
Detection and Intrusion detection and Prevention Techniques,
Anti-
Prevention Malware software, Networkbased Intrusion
detection
Systems, Network based Intrusion
Prevention
Systems, Host based Intrusion prevention
Systems, Security Information Management,
Network Session Analysis, System Integrity
Validation
**Assign
ment
Topics
Module 3: i Introduction to Cryptography, Symmetric key 10 3
Cryptography n Cryptography, Asymmetric key Cryptography,
and Network c Message Authentication, Digital Signatures,
Security l Applications of Cryptography. Overview of
a Firewalls-Types of Firewalls, User Management,
s VPN Security Security Protocols: - security at the
s Application Layer-PGP and S/MIME, Security at
Transport Layer- SSL and TLS, Securityat
Network Layer-IPSec
**Assign
ment
Topics
Module 4: in class Introduction, Cyber Security Regulations, Roles 5 4
Cyberspace ofInternational Law, the state and Private Sector
and the Law in Cyberspace, Cyber Security Standards. The
INDIAN Cyberspace, National Cyber Security
Policy 2013
**Assign
ment
Topics
Module 5: in class Introduction to Cyber Forensics, Handling 5 4,5
Cyber Preliminary Investigations, Controlling an
Forensics Investigation, Conducting disk-based analysis,
Investigating Information-hiding, Scrutinizing E-
mail, Validating E-mail header information,
Tracing Internet access, Tracing memory in real-
 time

**Assign
ment
Topics

Text Books:
1. John R Vacca, “Computer and Information Security Handbook”, 3rd Edition, Elsevier,2013,
ISBN: 9780128038437.
2. Albert Marcella, Jr., DougMenendez, “Cyber Forensics: A Field Manual for Collecting,
Examining, and Preserving Evidence of Computer Crimes”, Second Edition, CRC Group, Taylor
& Francis, ISBN 9780849383281.
3. William Stallings, “Cryptography and Network Security”, Pearson.

Reference Books:
1. George K Kostopoulus, “Cyber space and Cyber Security “, Second Edition, CRCGroup,
Taylor & Francis, ISBN 9781138057715
2. Behrouz A Frouzan, “Cryptography and Network Security”, Tata McGraw Hill.
 Sub Code: IT310A2/ IT310A8 Credit:4 (L-3, T-1, P-0)
CYBER SECURITY SOLUTIONS
Questions to be set: 05 (All Compulsory)
Course Objectives: To make aware of existing cybersecurity solutions

Pre-requisites: Internet Technology, Data Communication and Computer Networks.

Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Understand different cyber-attacks and their solutions.

2. Understand the concept related to security in embedded system.
3. Analyze and apply different techniques for intrusion detection and firewall system security.
4. Evaluate wireless network security measures, and design security enhancements using WEP,
WPA, and other protocols in wireless network environments.
5. Understand the technology for network perimeter security and know the operations of different
malicious software.

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hr C P PS
s O O O
Module 1: in Major Cyber Attacks Past One Year, Cyber- 8 1
Introduction class Security Solutions, Antivirus & Mobile App
Security, Authentication: Biometrics,
Cryptography, Data Loss Prevention (DLP),
DDOS Attack Protection.
**Assignme
nt Topics

Module 2: in Fraud Detection and Prevention, IAM- Identity 6 2

Embedded class & Access Management, Intrusion Detection:
System Log Analysis & Management, Mainframe
Security Security.
**Assignme
nt Topics

Module 3: in Log Analysis & Management, Mainframe 6 3

Intrusion class Security, Password Management, Patch
Detection, Management, Penetration testing, Privileged
Firewall Access Management (PAM), Public Key
Security Infrastructure (PKI), Risk Analysis.
**Assignme
ntTopics

Module 4: in class Wireless Communications and WLAN 8 4

Wireless Standards, WLAN Architecture, Essentials,
Network Wireless Security Vulnerabilities, WEP, Device
Security Authentication and Access Control, WPA
Encryption and Decryption, WPA Security
Strength and Weaknesses, Bluetooth Security,
Wireless Mesh Network Security.
**Assignmen
tTopics
Module 5: in class General Framework, Packet Filters, Stateless 8 5
Network Filtering, Application Gateways, Cache
 Perimeter Gateways, Firewall Configurations, Single-
Security, Homed Bastion Host System, Network Security
Malicious Topology, Network Address Translations,
Software Dynamic NAT, Virtual Local-Area Network,
Viruses, Virus Types, Virus Infection Schemes,
Virus Structures, Compressor Viruses, Virus
Disseminations, Win Virus Infection
Dissection, Virus Creation Toolkits, Worms,
Common Worm Types, The Email Attachments.
**Assignmen
tTopics

Text Books:
1. Computer Network Security Theory and Practice, Jie Wang, ISBN 978-3-540-79697-8
Springer Berlin Heidelberg New York.
2. Cyber Security Solutions, N K Goyal.

Reference Books:
1. Cryptography and Network Security, B.A. Forouzan,2008, MaGraw Hill.
2. Internet Cryptography, Richard E. Smith, 1997, Addison Wesley.
3. Internet Security, Professional Reference, Derek Atkins et al, 1997, TechMedia.
4. Cryptography and Network Security, Atul Kahate, 2007, McGraw Hill.
5. Applied Cryptography, Bruce Schneier, 1995, John Wiley and Sons Inc.
6. Modern Cryptography: Theory and Practice, Wenbo Mao, 2004, Pearson Education.
Sub Code : IT320A2/IT320A8 Credit: 4 (L-3, T-1, P-0)
Cyber Forensics
Questions to be set: 05 (All Compulsory)

Course Objectives: This is a basic undergraduate-level course covers the fundamentals of cyber forensics,
types of forensic systems, evidence collection, cyber law and cyber crime.

Pre-requisites: Nil
Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Evaluate various types of computer forensics technologies for uncovering hidden data and identifying malicious
software..

2. Employ a range of cyber forensics tools to investigate digital security systems and analyze case studies.

3. Assess the significance of evidence collection in cyber forensics investigations.

4. Analyze the basic principles of law as they apply to cyberspace, including jurisdictional issues and legal
precedents.
5. Analyze the concepts of digital signatures, public-key infrastructure, and certification authorities in the context
of cybercrime investigation.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Information Security Investigations, 7 1
Introduction class Corporate Cyber Forensics, Scientific
to Cyber method in forensic analysis,
forensics investigating large scale Data breach
cases. Analyzing malicious software.
Types of Computer Forensics
Technology, Types of Military
Computer Forensic Technology,
Types of Law Enforcement:
Computer Forensic Technology,
Types of Business Computer Forensic
Technology, Specialized Forensics
Techniques, Hidden Data and How to
Find It, Spyware and Adware,
Encryption Methods and
Vulnerabilities, Protecting Data from
Being Compromised Internet Tracing
Methods, Security and Wireless
Technologies, Avoiding Pitfalls with
Firewalls Biometric Security Systems
**Assignment
Topics
Module 2: in Internet Security Systems, Intrusion 7 2
Types of class Detection Systems, Firewall Security
Computer Systems, Storage Area Network
Forensics Security Systems, Network Disaster
Systems Recovery Systems, Public Key
Infrastructure Systems, Wireless
Network Security Systems, Satellite
 Encryption Security Systems, Instant
Messaging (IM) Security Systems,
Net Privacy Systems, Identity
Management Security Systems,
Identity Theft, Biometric Security
Systems ,Router Forensics. Cyber
forensics tools and case studies.
Ethical Hacking: Essential
Terminology, Windows Hacking,
Malware, Scanning, Cracking.
**Assignment
Topics
Module 3: in Why Collect Evidence, Collection 7 3
Evidence class Options Obstacles, Types of
Collection Evidence, The Rules of Evidence,
and Data Volatile Evidence, General
Seizure Procedure, Collection and Archiving,
Methods of Collection, Controlling
Contamination: The Chain of
Custody, Reconstructing the Attack,
The digital crime scene, Investigating
Cybercrime, Investigating Web
attacks, Investigating network Traffic
,Identification of Data: Timekeeping,
Forensic Identification and Analysis
of Technical Surveillance Devices,
Reconstructing Past Events.
**Assignment
Topics
Module 4: in class Basic of law, Understanding cyber 7 4
Cyber Law space, Defining cyber law, Scope and
jurisprudence, Concept of
jurisprudence, Overview of Indian
legal system, Introduction to IT Act
2000, Amendment in IT Act.
**Assignment
Topics
Module 5: in class Types of cyber crimes –against 7 5
Cyber individuals institution, and states-
Crimes various offenses and punishments,
digital signature-concepts of public
key and private key, certification
authorities and their role, creation and
authentication of digital signature. E-
contracting –salient features of
Econtracts, formation of E-contracts
and types, E-governance, E-
governance models, E-
commercesalient features and
advantages.
**Assignment
Topics
Text Book(s):
1. Cyber Forensics - Concepts and Approaches, Ravi Kumar &B Jain, 2006, Icfai University Press
2. Cyber Law Crimes, Barkha and U. Rama Mohan, Third Edition ,2017, Asia LawHouse .

Reference Books:

1. Understanding Cryptography: A Textbook for Students and Practitioners,ChristofPaar, Jan Pelzl, 2010,
Second Edition,Springer.
2. Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures for Ethical Hackers &
IT Security Experts, Ali Jahangiri,First edition, 2009
3. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council Press 12 Series:
Computer Forensics),2010
4. “Internet Complete Reference, Harley Hahn, Second Edition, 1996, Osborne/McGraw- Hill
5. Internet and Web design, , Ramesh Bangia Firewall Media, (An imprint of Lakshmi Publications Pvt.
Ltd. ). Second Edition 2006.
6. Cyber Laws Simplified,ViveekSood, Fourth reprint 2008,McGrawHill.
Sub Code: IT410A2/ IT410A8 Credit: 4(L-3, T-1, P-0)
BLOCKCHAIN TECHNOLOGY
Questions to be set: 05 (All Compulsory)
Course Objectives: The syllabus is aimed at giving a basic understanding of cryptocurrency, its
importanceand the use of block chain technology. It is focused on defining the technological backbone
of Bitcoin fundamentals and expands the concepts to building the block chain technology. It guides us
to understand the history of digital currency, the polices involving laws and organizations, the latest
trends, and the communities involved; which facilitates us to construct, visualize and understand the
ecosystem of block chain technology and its environment on which it is deployed.
Pre-requisites: Basics of Cryptography and Economics
Course Outcomes (CO): On completion of the course it is expected to endow the students with skills to:
1. Describe crypto currencies and block chain fundamentals.
2. Explain individual building blocks and understand the working mechanism of any block
chaintechnology.
3. Discover the modern engineering tools, techniques and resources in the field of block chain
technology.
4. Differentiate between different versions of block chain technology.
5. Illustrate use of block chain technology in a broader context like health, banking sector and
identifysecurity concerns in block chain technology.

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: In Trustless system, Decentralized transactions. 10 1

Introduction Class History: How and when Block chain & Bitcoin
Basics started, Milestones on the development of bit coin:
creation, exchanges, Bitcoin: Nakamoto consensus,
Research Perspectives & Challenges, Bitcoin
mining strategy and attacks, Bitcoin community,
economics & politics. Block Chain: What is Block
chain? Distinction between Blockchain vs
Cryptocurrency vs Token, Pillars of Block chain ,
Industry Applications of Blockchain.

**Assignment Crypto currencies: Bitcoin / Ethereum, How to Buy

Topics Bitcoin/Ethereum - How to Set up a Wallet.

Module 2: In How Blockchain (and Bitcoin) Work, Peer to Peer 10 1,2

Working Class network, What is a block?, block chain drive Proof
Mechanism of Work, Byzantine Generals, Distributed
Mining and consensus, Cryptography: Hashing, Data Integrity,
Cryptocurrencies Merkle Trees, Public v Private Key Cryptography,
Bitcoin and block sizes Mining : Proof of Work v
Stake, how miners make money- business model,
overview, the purpose, impact to the world,
Motivations, incentives, strategy. Pools : CPUS and
GPUs.
**Assignment Revenue at a Protocol Level : Block
Topics Rewards/Fees/ETC
 Module 3: in Public and Private Blockchains, JP Morgan Quorum, 6 3
Blockchain class IBM’s stuff, Using blockchain - Numerai, DAO, etc.
Types Lightning networks and plasma, Sidechains, Digital
Rights - ownership and accessibility, Industry -
healthcare, identity, finance, Paradigm shift/future/big
picture.

**Assignment
Topics
Module 4: in class What is it?, Security Implications, 1 PC 1 vote , 9 4
Consensus Environmental, Segwit and Forks, What is a smart
Building, contract? Smart contract legal issues. Regulation
Regulation and and Anonymity: ICO and SEC ruling, its anonymity,
Anonymity Governments regulating bitcoin, Anti Money
Problems with Laundering ,Political Implications on blockchain,
Blockchain Government’s current position and its effects on
blockchain. Anonymity - Zcash, Security and
Safeguards, Protection from attackers, Hacks on
exchanges, What is stopping adoption?, Scalability
problems, Network attacks to destroy Bitcoin, Case
Study: Failed currencies & Blockchain
**Assignment
Topics
Module 5: in class Bitcoin creation and economy, Limited Supply and 5 4,5
Bitcoin and Deflation, Hacks , Ethereum concept and Ethereum
Ethereum classic, Altcoins : Major Altcoins - Zcash, Ripple,
Blockchain NEO Building on the Blockchain - Pros and cons of
applications different implementations , Use cases of the
different types Government, Identity management,
Auto executing contracts, Three signature escrow,
Triple entry accounting, Elections and voting?,
Ethereum Interaction - Smart Contract and Token ,
Languages , How to create your own blockchain.

**Assignment
Topics

Text Books:
1. Arvind Narayanan, Joseph Bonneau, Edward Felten, “Bitcoin and
CryptocurrencyTechnologies: A Comprehensive Introduction”, Kindle
Edition.
2. Andreas M. Antonopoulo,”Mastering Bitcoin: Programming the Open
Blockchain”,2ndEdition, Kindle Edition.
Other References:
1. https://bitcoin.org/bitcoin.pdf
2. http://scet.berkeley.edu/wp-content/uploads/BlockchainPaper.pdf.
3. http://chimera.labs.oreilly.com/books/1234000001802/ch07.html#_introduction_2
4. https://www.evry.com/globalassets/insight/bank2020/bank-2020---block chain-powering-the-
internet-of-value---whitepaper.pdf
 Sub Code: IT420A2/ IT420A8 Credit: 4(L-3, T-1, P-0)
ETHICAL HACKING AND DATA PRIVACY
Questions to be set: 05 (All Compulsory)
Course Objectives: The course is focused at understanding and analyzing the behavior of hackers to
learn and evaluate their thought and actions which is aimed at harnessing information and hardware that
they are not authorized to use. It also helps the learner understand the architecture of modern
communication tools and protocols to apprehend their limitations, vulnerability and places of security
issues and concerns. The course introduces the modern practices used by hackers and also reflects on
the countermeasures taken by the system to keep a check on the vulnerabilities it is being exposed to.

Pre-requisites: Basics of Computer Network, Operating System, Web technology.

Course Outcomes: On completion of the course it is expected to endow the students with skills to:
1. Demonstrate competence in applying acquired expertise in computer networks.
2. Determine an ability to interpret and evaluate behavior of malwares and their counter measures.
3. Evaluate the approaches used by hackers and work on its countermeasures to reach a valid conclusion.
4. Explain an ability to identify the limitation of tools used to break an insecure web application.
5. Decide the problem in the decision-making process between possible options using tools.

** not more than 20% of total topics to be allotted for assignment

Module Mode Topics Hrs CO PO PSO

Module 1: in Fundamentals of computer networking. TCP/IP 8 1

Introduction class protocol stack, Understanding security goals and
services, Introduction to hacking: Threat, Exploit,
What is Penetration test? Vulnerability Vs
Penetration testing, Categories of Penetration test.
Phases involved in hacking, Foot printing,
Scanning, System Hacking, Session Hijacking.
Writing Reports, Structure of a Penetration Testing
Report, Vulnerability Assessment Summary, Risk
Assessment, Methodology, Linux Basics: File
Structure, Cron Job, Users, Common Applications,
BackTrack, Services.

**Assignment
Topics

Module 2: in Active, Passive and Sources of information 8 3

Information class gathering, Copying Websites Locally, Neo Trace,
Gathering, Intercepting a Response, WhatWeb, Netcraft,
Target Interacting with DNS Servers, Fierce, Zone
Enumeration Transfer with Host Command and Automation,
and Port DNS Cache Snooping- Attack Scenario,
Scanning Automating Attacks, SNMP - Problem, Sniffing
Techniques Passwords. Target enumeration and Port Scanning
Techniques.
**Assignment
Topics

Module 3: in Basics, Pros and cons of Vulnerability Assessment, 8 1,4

class NMap, Testing SCADA Environments with Nmap,
Vulnerability Nessus, Sniffing: Active and passive sniffing, Man
Assessment & in the middle attacks, ARP Protocol Basics-
Network working, Attacks, DoS Attacks, Dsniff tool: Using
Sniffing and ARP Spoof to Perform MITM Attacks, Sniffing
Information Pictures with Drifnet, Sniffing with Wireshark,
security Ettercap- ARP Poisoning, Hijacking Session with
MITM Attack, ARP Poisoning with Cain and Abel,
Sniffing Session Cookies with Wireshark,
Automating Man in the Middle Attacks, DNS
Spoofing, DHCP Spoofing, Introduction to
cryptography, private-key encryption, public-key
encryption. Key exchange protocols, cryptographic
hash functions, applications. Steganography,
biometric authentication, lightweight cryptographic
algorithms. Elements of hardware security: side-
channel attacks, physical unclonable functions
**Assignment
Topics

Module 4: in class Understanding Network Protocols, Attacking 8 2,5

Basics Of Network Remote Services, Common Target
Exploitation Protocols, Attacking SMTP, Attacking SQL
Servers, Client Side Exploitation Methods: E- Mails
Leading to Malicious Attachments & Malicious
Links, Compromising Client Side Update, Malware
Loaded on USB Sticks, Social engineering attacks.
Malware threats, penetration testing by creating
backdoors Post exploitation: Acquiring Situation
Awareness, Privilege Escalation, Maintaining
Access, Windows exploit
basics: Buffer Overflows, Significance of Buffer
Overflow Vulnerability.
**Assignment
Topics

Module 5: in class Wireless Hacking: Requirements, Aircracking, 8 3,5

Wireless & Hidden SSIDs, Monitor Mode, Monitoring Tool-
Web Hacking Beacon Frames on Wireshark, Airodump-ng,
Wireless Adapter in Monitor Mode, Determining
the Target, Cracking a WPA/WPA2 Wireless
Network Using Aircracking, Capturing Packets and
Four-Way Handshake, Web Hacking : Attacking
the Authentication , Brute Force and Dictionary
Attacks. Attacking Authentication: Attacking
Session Management, Design Flaws in
Authentication Mechanisms Attacking Forgotten
Password Functionality, attacking Password change
functions. Countermeasures to authentication
attacks. SQL Injection: Attacking SQL Servers,
Sniffing, Brute Forcing and finding Application
Configuration Files, Input validation attacks.
Preventive Measures. Web Application Threats,
Web Application Hacking, Cross Site Scripting /
XSS Flaws / Countermeasures Correct Web
 Application Set-up.

**Assignment
Topics

Text Books:
1. Rafay Baloch,”Ethical Hacking and Penetration Testing Guide”, CRC Press, 2015.
2. Patrick Engebretson,”The Basics of Hacking and Penetration Testing: Ethical Hacking and
PenetrationTesting Made Easy”, Syngress Media, Second Revised Edition, 2013.

Reference Books:
2. Michael T. Simpson, Kent Backman, James E. Corley, “Hands On Ethical Hacking and
NetworkDefense”, Cengage Learning, 2012.
Sub Code: IT219A2/IT219A8 Credit: 4 (L-3, T-1, P-0)
MULTIMEDIA FUNDAMENTALS

Questions to be set: 05 (All Compulsory)

Course Objectives: This is a basic undergraduate-level course on Honours Specialization in Multimedia

Computing & Communications that covers the fundamentals of Multimedia.The course covers different
media such as text, image, audio, video, and also different compression techniques applicable to these media.
The students will learn about the basics of text, image, video, and audio formation and processing, the basics
of multimedia compression and representation. The students will be exposed to dealing with text, image,
audio, and video data in various multimedia applications. Various approaches involved in multimedia
communications are also covered in this course.

Pre-requisites: Basic Knowledge on Programming in C.

Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Understand multimedia data digitization principles of analog signals with encoder and decoder design, and to
become familiar with multimedia data representation for text, images, audio, and video with special emphasis on
PCM speech, and basic concept of broadcast Television.

2. Become acquainted with color fundamentals for images and video signals, digitization formats for video
signals, and the basics of Image processing with special emphasis on filters, binary Image analysis,
processing of 2D images, thresholding, convolution, edge and corner detection, mathematical morphology,
and shape descriptors.

3. Implement various compression algorithms such as Static Huffman Coding, Arithmetic Coding, Lempel-Ziv-
Welsh coding for text compression, and to understand various image compression techniques such as Joint
Photographic Expert Group (JPEG) with special emphasis on Transform Coding.

4. Apply audio and video processing fundamentals with special emphasis on audio compression techniques such
as Pulse Code Modulation (PCM), Differential Pulse Code Modulation (DPCM), Predictive Differential Pulse
Code Modulation, Adaptive Differential Pulse Code Modulation (ADPCM) with subband coding, Perceptual
Coding with special emphasis on sensitivity of the human ear, frequency masking, temporal masking, and key
concepts of Linear Predictive Coding (LPC).

5. Explain basics of multimedia networks, multiplexing technologies in multimedia networks, wired and wireless
networks, multipath fading with special emphasis on various fading models, radio propagation models, and to
become familiar with multimedia network communications and applications with special emphasis on
multimedia communication standards and protocols.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Definition of Multimedia, Components of Multimedia, [7] 1 1,2,3 1,2
Multimedia class Multimedia data and multimedia systems,
and Classification of Multimedia Systems,
Representation Characteristics of Multimedia Data, Uses of
of Multimedia Multimedia.
Data Analog signals, Digital signals, Nyquist sampling
theorem, Digitization principle of analog signals
with special emphasis on audio signals, Encoder
design, Decoder design, Sound versus Music
signals.
 Representation of Text, Image, Audio, and Video.

**Assignment Representation of images in digital camera. 1 1,2,3 1,2

Topics
Module 2:, in Color fundamentals, color signals, Chrominance and [7] 2 1,2,3 1,2
Color class Luminance, digitization of audio (PCM speech),
Fundamentals, image, and video, basic concepts of scanning
Digitization sequence for video signals, digitization formats
Formats, and of digital video.
Basics of Image 1 bit images, 8 bit Gray level images, 24 bit color
Processing images, 8 bit color images, Color Look Up
Tables(LUTs), filters, binary Image analysis,
processing of 2D images, thresholding,
convolution, edge and corner detection,
mathematical morphology, and shape
descriptors.

**Assignment Conversion from RGB to YCbCr format 2 1,2,3 1,2

Topics
Module 3: in The need for compression – lossless compression [7] 3 1,2,3 1,2
Multimedia class versus lossy compression, Examples of text
Data compression algorithms, redundancy and
compression relevancy of image data, image compression
techniques,

: Basics of Information Theory, Run Length Coding,

Variable Length Coding, Huffman Coding,
Dictionary Based Coding, Arithmetic Coding.
Distortion measures, Fourier Transform, Fast Fourier
Transform (FFT), Discrete Cosine Transform
(DCT), Moving into the Frequency Domain,
Relationship between DCT and FFT, 1D DCT and
2D DCT, Performing DCT Computations, 2D
DCT on Image Blocks, 2D DCT Basis Functions,
Transform Coding, Main steps of JPEG image
compression.
**Assignment A comparative study on text compression algorithms. 3 1,2,3 1,2
Topics
Module 4: in class Basics of digital audio, quantization and [7] 4 1,2,3
Fundamentals transmission of Audio. The need for audio
of Audio and compression, Audio compression approaches
Video such as Differential Pulse Code Modulation,
Processing Adaptive Differential Pulse Code Modulation,
Adaptive Predictive Coding, Linear Predictive
Coding, Perceptual Coding, MPEG audio
coders.
Fundamental concepts of video, video compression,
MPEG video coding, MPEG4, 7, and beyond.

**Assignment A comparative study on video compression 4 1,2,3 1,2

Topics algorithms.
Module 5: in class Basics of Multimedia Networks – Multiplexing [7] 5 1,2,3
Technologies – Wireless versus Wired
 Multimedia Technology – Basics of Wireless Communication
Networks and – Wireless Networks – Radio Propagation
Multimedia Models.
Transmission Quality of Multimedia Transmission – Multimedia
over IP – Multimedia over ATM Networks –
Multimedia Communication Standards and
Protocols

**Assignment Multimedia transmission over the Internet. 5 1,2,3 1,2

Topics

Text Book(s):
1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu “Fundamentals of Multimedia”, Springer, Third Edition, 2021

Reference Books:
1. P. Havaldar and G. Medioni “Multimedia Systems – Algorithms, Standards and Industry Practices”, Cengage
Learning – First Edition, 2009.
2. W. Burger & M. Burge “Digital Image Processing: An algorithmic introduction using Java”, Springer - Second
Edition, 2016
3. F. Halsall, “Multimedia Communications: Applications, Networks, Protocols, and Standards”, Pearson, 2001.
Sub Code: IT229A2/ IT229A8 Credit: 4(L-3, T-1, P-0)
MOBILE COMPUTING AND COMMUNICATION
Questions to be set: 05 (All Compulsory)
Course Objectives: To introduce the characteristics, basic concepts and systems issues in mobile
computing. To illustrate architecture and protocols in mobile computing and to identify the trends
andlatest development of the technologies in the area. Location of mobile devices, judicious use
of bandwidth, relocation of computation, are some of the key issues which will constitute the topics
for further exploration. To evaluate critical design tradeoffs associated with different mobile
technologies, architectures, interfaces and business models and how they impact the usability,
security, privacy and commercial viability of mobile computing services and applications.

Pre-requisites: Data communication and Computer networks.

Course Outcomes (CO): On completion of the course it is expected to endow the students
withskills to:

1. Examine fundamentals of wireless communications.

2. Analyze security, energy efficiency, mobility, scalability, and their unique
characteristics inwireless networks.
3. Develop basic skills for cellular networks design.
4. Apply knowledge of TCP/IP extensions for mobile and wireless networking.
5. Measure the awareness of the life-long learning, business ethics, professional
ethics andcurrent marketing scenarios.
** not more than 20% of total topics to be allotted for assignment
Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction and evolution of mobile computing and 9 1
<Introduction, class wireless communication, mobile computing
Mobile functions, mobile computing device, middleware
Network and and gateways, mobile computing architecture: 3tier
Transport design considerations for mobile computing, Mobile
Layer > Network layer – mobile IP, goals, assumptions and
requirement, entities, mobile Ipv6. Mobile transport
Layer-Traditional and classical TCP, TCP over 2.5
(3.0) G wireless networks.

**Assignment Multiple access techniques: FDMA, TDMA,

Topics CDMA, SDM, TDD, FDD. IP packet delivery,
agent discovery, registration, tunneling and
encapsulation, optimizations,
Module 2: in GSM: Mobile services, system architecture, radio 8 2
< GSM and class interface, protocols, localization and calling,
GPRS > handover, security. GPRS: introduction, network
architecture, network enhancements, channel
coding, protocol
architecture, network operations, data services in
GPRS applications, limitations.
**Assignment
Topics

Module 3: In CDMA, EDGE, UMTS, UTRAN, OFDM, HSPA, 7 3

 < Cellular Class LTE, Wi-Max, mobile satellite communication.
Technology >
**Assignment
Topics
Module 4: in class Communication Asymmetry, classification of data 9 4
< Data delivery mechanism, data dissemination broadcast
Dissemination models, selective tuning and indexing techniques,
and Data synchronization, synchronization software for
Synchronizati mobile devices, synchronization protocols.
on in Mobile
Computing > **Assignment
Topics
Module 5: in class Mobile agent, applications framework, application 7 5
< Mobile server, gateways, service discovery, device
Devices and management.
Mobile **Assignment Mobile file system, Mobile Operating Systems,
Operating Topics Characteristics, Basic functionality of Operating
System > Systems. Case Study: Android OS.

Text Books:
1. Raj Kamal, Mobile Computing, 2/e , Oxford University Press-New Delhi.
2. J. Schiller, “Mobile Communication”, Addison Wesley, 2000.
3. Asoke K Taukder, Roopa R Yavagal, Mobile Computing, Tata McGraw Hill
Pub Co., NewDelhi, 2005.

Reference Books:
1. Reza B'Far (Ed), "Mobile Computing Principles", Cambridge University Press.
2. MukeshSinghal, NiranjanG.Shivaratri, “Advanced Concepts in Operating Systems”, Tata
McGraw- Hill.
 Sub Code: IT319A2/ IT319A8 Credit: 4 (L-3, T-1, P-0)
DIGITAL SIGNAL PROCESSING

Questions to be set: 05 (All Compulsory)

Course Objectives: This course aims to develop proficiency in analyzing signals and systems in both time
and frequency domains, fostering strong analytical skills in digital filter design, and exploring various
applications of digital signal processing.

Pre-requisites: Calculus

Course Outcomes (CO): Upon successful completion of the course, students should be able to:
1. Illustrate signals, systems and their significance.
2. Analyze the signals using various digital transforms DFT, FFT etc.
3. Design IIR filters with desired frequency responses.
4. Design FIR filters with desired frequency responses.
5. Use MATLAB/OCTAVE software in implementing real-world applications of digital signal
processing.

Module Topics to be Topics Hrs CO PO PSO

covered
Module 1: in Continuous-Time and Discrete-Time Signals, 8 1
Signals and class Continuous-Time and Discrete-Time Systems, Basic
Systems System Properties, LTI Systems and its properties,
Generation of Signals and basic operations using
MATLAB/OCTAVE.

**Assignment
Topics
Module 2: in Discrete Time Fourier Transform (DTFT), Discrete 8 2
Frequency class Fourier Transform (DFT)
Analysis Discrete Cosine Transform (DCT), Z-Transform,
ROC, Poles & Zeros,
Estimating Power Spectral Density
Frequency analysis of signals and systems using
MATLAB/OCTAVE

**Assignment
Topics
Module 3: in Characterizing Digital Filters: Filter Coefficients, 8 3
Design of IIR class Filter Responses , Zeros and Poles
Filter Introduction to Analog IIR Filters; Design of Digital
IIR Filters & Structures

**Assignment
Topics
Module 4: in class Design of FIR filter using Window and Constrained 8 4
Design of FIR Least-Squares methods, FIR filter structures
Filters **Assignment
Topics
Module 5: in class Basics of Adaptive filters; Real-world applications of 8 5
Adaptive Filters digital signal processing in Engineering using
and DSP MATLAB/OCTAVE
Applications **Assignment
Topics

Text Books:
1. Alan V. Oppenheim, Alan S. Willsky, S. Hamid Nawab (1996).Signals and Systems (2nd ed.). PHI
2. John G Proakis, Dimitris Manolakis (2007). Digital Signal Processing (4th ed. ). Pearson
3. S.K.Mitra (2013). Digital Signal Processing: A Computer - Based Approach (4th edition). McGraw Hill
Education.
Reference Books:
1. K.S. Thyagarajan (2019). Introduction to Digital Signal Processing Using MATLAB with Application to
Digital Communications (1st Edition)Springer
2. Vinay K. Ingle and John G. Proakis (2011). Digital Signal Processing Using MATLAB (3rd Edition). CL
Engineering.
 Sub Code: IT329A2/IT329A8 Credit:4 (L-3, T-1, P-0)

MULTIMEDIA ANIMATION AND MODELING

Questions to be set: 05 (All Compulsory)

Course Objectives: The main objective of this course is to introduce various aspects of multimedia
components like text, images and graphics, audio, sound, and video, and provide the students the fundamental
knowledge of multimedia animation with special emphasis on the use of image and video editing tools with
software.

Pre-requisites: Multimedia Fundamentals

Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Describe the various elements and aspects of multimedia and animation.

2. Understand the role played by various multimedia such as images and Graphics.

3. Learn to add pictures, graphics, sound and animation to prepare a project for the web.

4. Learn the fundamentals of Animation.

5. Apply tools and techniques to create basic 2D and 3D animation.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Multimedia: Concept of Multimedia, Multimedia [7] 1 1,2,3 1,2
Introduction to class applications, Advantage of Digital Multimedia,
Multimedia Multimedia system Architecture, Overview of
Animation, Multimedia Animation, The Stages of a Multimedia
Multimedia Project, Using Text in Multimedia, Font editing and
Authoring and design tools, Hypermedia and Hypertext, Designing
Tools for the World Wide Web, Developing for the Web,
Text for the Web, Images for the Web, Sound for the
Web, Animation for the Web.
Multimedia Authoring and Tools: Multimedia
Authoring, Multimedia Authoring Metaphors,
Multimedia Production, Multimedia Presentations,
Some Useful Editing and Authoring Tools
**Assignment Discuss the various applications of Multimedia 1 1,2,3 1,2
Topics Animation.
Module 2: in [7] 2 1,2,3 1,2
Images and class Images and Graphics: Making Still Images, Bitmaps,
Graphics Vector Drawing, 3-D Drawing and Rendering, Color,
Understanding Natural Light and Color,
Computerized Color, Color Palettes, Image File
Formats, Graphics Animation Files.

**Assignment Explain principle of color fundamentals for images 2 1,2,3 1,2

Topics and Graphics.
Module 3: in Image Editing software: selection tools, working with [7] 3 1,2,3 1,2
Image Editing class layers, masks and channels, correcting and enhancing
photographs, typographic design and vector drawing,
working with 3D images, producing files for the web.
 **Assignment A survey of image enhancement tools. 3 1,2,3 1,2
Topics
Module 4: in class Animation Fundamentals: Introduction and definition [7] 4 1,2,3 1,2
Animation of animation, Principles, Types and uses, Methods and
Fundamentals Techniques of animation, Basic animation, Text and
image animation, Time line construction and
management, Masking Motion and shape Tweening,
Morphing, Onion skinning, Animation File Formats,
Keyframe animation, Working with symbols and
Animation Software.
**Assignment An extensive literature review of various animation 4 1,2,3 1,2
Topics software.
Module 5: in class Basic 2D and 3D animation : Overview of 2D [7] 5 1,2,3 1,2
Basic 2D and animation and its features, Drawing tools, types of
3D animation panels, transformation, property panel, working with
objects, group, bitmap, Controlling Movie clips with
code, Working with Dynamic Text fields and Input
Text Fields, Loading external content and other
movies, Dynamic pre-loaders, Interactivity with code,
Difference between 2D and 3D animation, Tweening
and motion along a path, Controlling movie playback,
Text and hyperlink, adding sound and movie.
Introduction to 3D animation and its basic concepts,
and its applications.
**Assignment Implementation of a 2D animation for displaying 5 1,2,3 1,2
Topics dynamic text.

Text Books:

1. Tay Vaughan, “Multimedia: Making it Work”, McGraw Hill Professional Ninth Edition, 2014
2. Ranjan Parekh, "Principles of Multimedia", Tata McGraw-Hill, Second Edition, 2012

Reference Books:

1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu “Fundamentals of Multimedia”, Springer, Third Edition, 2021
2. P. Havaldar and G. Medioni “Multimedia Systems – Algorithms, Standards and Industry Practices”,
Cengage Learning – First Edition, 2009.
 Sub Code : IT419A2/ IT419A8 Credit: 4 (L-3, T-1, P-0)
SPEECH PROCESSING
Questions to be set: 05 (All Compulsory)
Course Objectives: The objectives of this course are for students to learn the fundamental theories and
techniques of speech processing. This will be achieved through the mathematical derivation and treatment of
the topics as well as through implementation in programming assignments.
Pre-requisites: Digital Signal Processing
Course Outcomes (CO): On successful completion of this course, students will be able to:
1. Identify speech production and classification, demonstrating proficiency in analyzing speech acoustics.
2. Apply windowing, spectral analysis, and time-domain parameters to discriminate speech from silence
and estimate pitch periods using autocorrelation functions.
3. Explain principles of Automatic Speech Recognition (ASR) systems, including Linear Predictive
Analysis and Hidden Markov Models, evaluate systems, and solve implementation issues.
4. Demonstrate proficiency in utilizing homomorphic systems for tasks such as pitch detection and
formant estimation and understanding LP analysis methods.
5. Apply speech enhancement techniques like spectral subtraction, Wiener filtering, and multi-
microphone approaches, understanding Text-to-Speech synthesis and its applications.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs CO PO PSO
covered
Module 1: in Introduction, Articulatory Phonetics – Production and 5 1
Basic class Classification of Speech Sounds; The process of
Concepts: Speech Production, Acoustic Phonetics: vowels,
diphthongs, semivowels, nasals, fricatives, stops and
affricates; Applications of Speech Signal Processing,
Digital Models for Speech Signals: Vocal Tract,
Radiation, Excitation. Short-term Fourier transform
(STFT): overview of Fourier representation
**Assignment Filter-Bank and LPC Methods with neumericals. 1
Topics

Module 2: in Windowing and Spectra of Windows, Time-Domain 8 2

Speech class Parameters: signal analysis in Time Domain, Short-
Analysis Time average magnitude, Short-Time Average zero-
crossing rate (ZCR), Speech Vs Silence
discrimination using energy and zero crossing, Short-
Time auto correlation function, Short-Time Average
Magnitude Difference Function, Pitch period
estimation using the autocorrelation function.
**Assignment Development of a signal processing algorithms to 2
Topics analyze speech signals and evaluate the performance
of the developed algorithms using real-world speech
recordings
Module 3: in Introduction to Automatic Speech Recognition (ASR) 5 3
Speech class systems. Basic principles of Linear Predictive
Modelling Analysis: The Autocorrelation Method, The
Covariance Method. Hidden Markov Models: Markov
Processes, HMMs – Evaluation, Optimal State
Sequence – Viterbi Search, Baum-Welch Parameter
Re-estimation, Implementation issues.
**Assignment Application of Automatic Speech Recognition in real 3
Topics life application through computer programming.
 Module 4: in class Introduction, Homomorphic Systems for 8 4
Homomorphic Convolution: Properties of the Complex Cepstrum,
Systems with Computational Considerations, The Complex
Linear Cepstrum of Speech, Pitch Detection, Formant
Prediction Estimation, The Homomorphic Vocoder. Linear
(LP) Analysis Prediction (LP) analysis: Basis and development,
Levinson-Durbin’s method, normalized error, LP
spectrum, LP cepstrum, LP residual
**Assignment Explore a contemporary research paper or project that 4
Topics applies either homomorphic systems for convolution
or linear prediction analysis in the domain of speech
processing. Summarize the key findings,
methodologies used, and discuss the potential
implications of the study in advancing speech signal
processing techniques.
Module 5: in class Nature of interfering sounds, Speech enhancement 6 5
Text-to- techniques: Single Microphone Approach: spectral
Speech subtraction, Enhancement by re-synthesis, Comb
Synthesis filter, Wiener filter, Multi microphone Approach.
Text-to-Speech Synthesis: Concatenative and
waveform synthesis methods, subword units for TTS,
intelligibility and naturalness – role of prosody,
Applications and present status.
**Assignment Design and implement challenges of a speech 5
Topics enhancement algorithm that combines both single
microphone and multi-microphone approaches.

Text Books:
1. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer-Verlag London Limited
2011.
2. D. A. Forsyth, J. Ponce, Computer Vision: A Modern Approach, Pearson Education,
2003.
Reference Books:
1. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, Second
Edition, Cambridge University Press, March 2004.
2. K. Fukunaga; Introduction to Statistical Pattern Recognition, Second Edition, Academic Press,
Morgan Kaufmann, 1990.
3. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Addison- Wesley, 1992.
 Sub Code: IT429A2/IT429A8 Credit: 4 (L-3, T-1, P-0)

Information Theory and Error Correcting Codes

Questions to be set: 05 (All Compulsory)

Course Objectives: To introduce to the students the fundamentals of information theory and coding theory
with special emphasis on the concepts of amount of information of a source, entropy of a source, channel
capacity, error-detection and error-correction codes with illustrations of linear block codes, cyclic codes, BCH
codes, convolution codes etc.

Pre-requisites: Probabilities and Statistics.

Course Outcomes (CO): On successful completion of this course, students will be able to:

1. Explain concept of dependent and independent Sources, measure of information, Entropy, Mutual
information, Entropy Rates of a Stochastic Process.
2. Represent the information using Shannon Encoding, Shannon Fano, Prefix and Huffman Encoding
Algorithms
3. Model the continuous and discrete communication channels using input, output and joint probabilities
4. Determine a codeword comprising of the check bits computed using Linear Block codes, Cyclic Codes,
and Reed-Solomon codes.
5. Design the encoding and decoding circuits for BCH codes, Reed-Solomon codes, and Convolution codes.

** not more than 20% of total topics to be allotted for assignment

Module Topics to be Topics Hrs. CO PO PSO
covered
Module 1: in Information Theory Fundamentals: Uncertainty and [7] 1 1,2,3 1,2
Information class Information –Measure of information- Entropy -Joint
Theory Entropy and Conditional Entropy- Relationship
Fundamentals Between Entropy and Mutual Information- Chain Rules
for Entropy, Relative Entropy, and Mutual Information
- Entropy Rates of a Stochastic Process -Markov
Chains-Markov Statistical Model for Information
Sources-Entropy and Information rate of Markov
Sources, General overview of digital communication
systems. Source coding versus channel coding.

**Assignment Discrete memoryless channel – channel capacity, - 1 1,2,3 1,2

Topics fundamental theorem of information theory.
Module 2: in [7] 2 1,2,3 1,2
Source Coding class Source Coding: Purpose of encoding-Encoding of the
Source Output- Shannon's Encoding Algorithm-
Shannon Fano Encoding Algorithm -Source coding
theorem- Optimal Codes-Bounds on the Optimal Code
Length- Prefix Codes-Kraft Inequality for Uniquely
Decodable
Codes- Kraft McMillan Inequality property-Huffman
Codes- Some Comments on Huffman Codes -
Optimality of Huffman Codes- Shannon–Fano–Elias
Coding- Competitive Optimality of the Shannon Code-
Generation of Discrete Distributions from Fair Coins-
 Arithmetic Coding- Lempel–Ziv Coding-Optimality of
Lempel–Ziv Algorithms.
**Assignment A survey on Dictionary Based Coding - 2 1,2,3 1,2
Topics
Module 3: in Channel Capacity: Communication Channels- Channel [7] 3 1,2,3 1,2
Channel class Models – Channel Capacity – Channel Coding -
Capacity and Channel Matrix of Discrete Communication channels-
Gaussian Joint Probability Matrix-Binary Symmetric Channel-
Channels System
Channel Capacity- Channel Capacity of Noiseless
Binary Channel- Channel Capacity of Binary
Symmetric Channel, Channel Capacity of Binary
Erasure Channel, Channel Capacity of Noisy Channel
with Nonoverlapping Outputs- Channel Coding
Theorem- Information capacity theorem – The Shannon
Limit-Zero-Error Codes, Source–Channel Separation
Theorem

Gaussian Channel: Definition of Gaussian Channels-

Bandlimited Channels-Parallel Gaussian Channels-
Channels with Colored Gaussian Noise - Gaussian
Channels with Feedback.
**Assignment Various types of communication channels and - 3 1,2,3 1,2
Topics comparative study on their channel capacities.
Module 4: in class Error Control Coding: Introduction – Examples of Error [7] 4 1,2,3 1,2
Error Control Control Coding – Methods of controlling Errors –Types
Coding and of Errors –Types of Codes.
Error
Correcting Linear Block Codes: Matrix description of Linear
Codes Block Codes – Error detection & Correction
capabilities of Linear Block Codes – Hamming Codes
– Standard Array and Syndrome Decoding
Cyclic Codes: Algebraic Structure of Cyclic Codes–
Generator Polynomial – Generator and Parity check
Matrices- Encoding using an (n-k) Bit Shift register-
Syndrome Calculation, Error Detection and Correction-
Burst Error Correction – Golay codes – CRC (Cyclic
Redundancy Check) codes.
**Assignment Error correcting codes, Decoding of cyclic codes. - 4 1,2,3 1,2
Topics
Module 5: in class BCH codes: Description of BCH codes – Encoding and [7] 5 1,2,3 1,2
BCH Codes decoding – Reed Solomon Codes.
and
Convolution Convolution Codes: Introduction – Tree codes and
Codes Trellis codes – Polynomial description of convolution
codes – Distance notions for convolution codes –
Generating function – Matrix description – Viterbi
decoding – Distance Bounds – Performance bounds –
Known good convolution codes – Turbo codes and
decoding.
**Assignment An overview of non-cyclic codes for error detection. - 5 1,2,3 1,2
Topics
Text Books:

1. J. A. Thomas and T. M. Cover, “Elements of information Theory”, Wiley, 2006.

2. Shu Lin and Daniel J. Costello, “Error Control Coding”, PHI Learning, 2004

Reference Books:

1. H. Bhat, G. Rao,” Information Theory and Coding”, Cengage, 2017.

2. T.R.N. Rao & E. Fujiwara,” Error Control Coding for Computer Systems”, PHI Learning, 1989.