Bachelor of Technology: Rtificial Ntelligence AND Achine Earning

BACHELOR OF TECHNOLOGY
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Components of Academic Programme
B.Tech (Artificial Intelligence and Machine Learning)
Minimum Duration : 8 Semesters (4 Years)
Maximum Duration : 12 Semesters (6 Year)
Total Number of Credits : 201 Credits
Course Components Credits

1. Compulsory Courses
I. Basic Science Courses (BSC) 16
II. Engineering Science Courses (ESC) 24
III Core Courses (CC) 93
.
2. Elective Courses
I. Programme Elective Courses (PEC) 14
II. Open Elective Courses (OEC) 9
3. Discipline-Centric Additional Courses
I. Seminar(SM) /Project (PJ)/ Intern(IN)/ Comprehensive Viva-Voce 20
(CM)
II. Humanities and Social Science Including Management (HSMC) 14
4 General Courses
I. Healthy Living and Fitness (HF) 1
II. Environmental Science (EV) 2
III General Proficiency (GP) 8
.
A. Requirement of Awards of Degree: - CGPA>= 4.5 Clearance of total no. of credits as 195 and any other condition as
per regulation and ordinances.
B. Audit Courses (AC) upto 4 credits may be done by a student as Extra Course(s) over and above the requirement for
award of this degree.
CURRICULUM STRUCTURE AND EVALUATION SCHEME W.E.F 2021-22
SEMESTER: I
COURSE MODULE TEACHING

WEIGHTAGE : EVALUATION
Physics Group PERIODS
COURSE
Credits L T P CWA MSE ESE Total
Code Title Component
Professional
THU101 HSMC 2 2 - - 25 25 50 100
Communication
TPH101 Engineering Physics BSC 3 3 - - 25 25 50 100
TMA101 Engineering Mathematics-I BSC 4 3 1 - 25 25 50 100
Basic Electrical
TEE101 ESC 3 3 - - 25 25 50 100
Engineering
Fundamental of Computer
TCS101 & Introduction to ESC 3 3 - - 25 25 50 100
Programming
THF101 Healthy Living & Fitness HF 1 1 - - 50 - 50 100
PPH151 Physics Lab BSC 1 - - 2 25 25 50 100
Basic Electrical
PEE151 ESC 1 - - 2 25 25 50 100
Engineering Lab.
Workshop and
PME151 ESC 3 1 - 4 25 25 50 100
Manufacturing Practices
PCS151 Computer Lab-I ESC 2 - - 4 25 25 50 100
SCS-101 MOOCS Seminar SM 1 - - - - - 100 100
GP101 General Proficiency GP 1 - - - - - 100 100
Total 25 16 1 12 275 225 700 1200

Chemistry Group PERIODS
COURSE
Professional
THU101 HSMC 2 2 - - 25 25 50 100
Communication
TCH101 Engineering Chemistry BSC 3 3 - - 25 25 50 100
Engineering
TMA101 BSC 4 3 1 - 25 25 50 100
Mathematics-I
Basic Electronics
TEC101 ESC 3 3 - - 25 25 50 100
Engineering
TEV101 Environmental Science EV 2 2 - - 25 25 50 100
Fundamental of 3 -
TCS101 Computer & Introduction ESC 3 - 25 25 50 100
to Programming
PCH151 Chemistry Lab BSC 1 - - 2 25 25 50 100
Engg. Graphics and

PME153 ESC 3 1 - 4 25 25 50 100
Design Lab.
PCS151 Computer Lab - I ESC 2 - - 4 25 25 50 100
Basic Electronics
PEC151 ESC 1 - - 2 25 25 50 100
Engineering Lab.
Total 25 17 1 12 250 250 600 1100

SEMESTER II

Physics Group PERIODS
COURSE
Advanced Professional
THU201 HSMC 2 2 - - 25 25 50 100
Communication
TPH201 Engineering Physics BSC 3 3 - - 25 25 50 100

Engineering
TMA201 BSC 4 3 1 - 25 25 50 100
Mathematics-II
Basic Electrical
TEE201 ESC 3 3 - - 25 25 50 100
Engineering
Programming for
TCS201 ESC 3 3 - - 25 25 50 100
Problem Solving
1 -
THF201 Healthy Living & Fitness HF 1 - 50 - 50 100
PPH251 Physics Lab BSC 1 - - 2 25 25 50 100
Basic Electrical
PEE201 ESC 1 - - 2 25 25 50 100
Engineering Lab.
Workshop and
PME251 ESC 3 1 - 4 25 25 50 100
Manufacturing Practices
PCS251 Computer Lab-II ESC 2 - - 4 25 25 50 100
Total 25 16 1 12 275 225 700 1200

PERIODS
Chemistry Group
COURSE
Advanced Professional
THU201 HSMC 2 2 - - 25 25 50 100
Communication
TCH201 Engineering Chemistry BSC 3 3 - - 25 25 50 100
Engineering
TMA201 BSC 4 3 1 - 25 25 50 100
Mathematics-II
Basic Electronics
TEC201 ESC 3 3 - - 25 25 50 100
Engineering
TEV201 Environmental Science EV 2 2 - - 25 25 50 100
3 -
Programming for
TCS201 ESC 3 - 25 25 50 100
Problem Solving
PCH251 Chemistry Lab BSC 1 - - 2 25 25 50 100

Engg. Graphics and
PME253 ESC 3 1 - 4 25 25 50 100
Design Lab.
PCS251 Computer Lab - II ESC 2 - - 4 25 25 50 100
Basic Electronics
PEC251 ESC 1 - - 2 25 25 50 100
Engineering Lab.
Total 25 17 1 12 250 250 600 1100

SEMESTER: III
COURSE MODULE TEACHING WEIGHTAGE : EVALUATION

PERIODS
COURSE L T P CWA MSE ESE Total

Credits
TCS-301 Logic Design CC 3 3 - - 25 25 50 100
TCS-302 Data Structures with C CC 3 3 - - 25 25 50 100
TCS-307 Object Oriented CC 3 3 - - 25 25 50 100

Programming with C++
TCS-372 Mathematics for AI and CC 4 3 - 2 25 25 50 100

Machine Learning
TMA-316 Discrete Structures and CC 4 3 1 - 25 25 50 100

Combinatorics
PCS-301 Logic Design Lab CC 2 1 - 2 25 25 50 100
PCS-302 Data Structures Lab CC 2 1 - 25 25 50 100

2
PCS-307 OOPS with C++ Lab CC 2 1 - 2 25 25 50 100
XCS-301 Career Skills HSMC 1 2 - - 25 25 50 100
XCS-310 Career Skills Lab HSMC 1 - - 1 25 25 50 100

CSP-301 Mini Project PJ 1 - - - - - 100 100
GP-301 General Proficiency GP 1 - - - - - 100 100
Total 28 20 1 9 250 250 800 1300
AUDIT COURSE: TOC301 PROBABILITY AND STATISTICS

SEMESTER: IV
COURSE MODULE TEACHING WEIGHTAGE:EVALUATION

PERIODS
COURSE L T P C WA MSE ESE Total

Credits
TCS-408 Java Programming CC 3 3 - - 25 25 50 100

Language
TCS-402 Finite Automata and CC 4 3 1 - 25 25 50 100

Formal Languages
TCS-403 Microprocessors CC 3 3 - - 25 25 50 100
TCS-404 Computer Organization CC 4 3 1 - 25 25 50 100
TCS-409 Design and Analysis of CC 3 3 - - 25 25 50 100

Algorithms
TCS-472 Introduction to AI and CC 4 3 - 2 25 25 50 100

Neural Networks
PCS-408 Java Programming Lab CC 2 1 - 2 25 25 50 100
PCS-403 Microprocessors Lab CC 2 1 - 2 25 25 50 100
PCS-409 DAA Lab CC 2 1 - 25 25 50 100

2
GP- 401 General Proficiency GP 1 - - - - - 100 100
Total 32 23 2 9 275 275 850 1400
AUDIT COURSE: TOC 401 COMPETATIVE PROGRAMMING

SEMESTER: V

PERIODS
COURSE Credits L T P CWA MSE ESE Total
TCS-501 System Software CC 4 3 1 - 25 25 50 100
TCS-502 Operating Systems CC 3 3 - - 25 25 50 100
TCS-503 Data Base Management CC 3 3 - - 25 25 50 100

Systems
TMA-502 Computer Based CC 3 3 - - 25 25 50 100

Numerical and
Statistical techniques
Program Elective-I PEC 4 3 - 2 25 25 50 100
PCS-506 Operating Systems Lab CC 2 1 - 2 25 25 50 100
PCS-503 DBMS Lab CC 2 1 - 2 25 25 50 100
PMA-502 CBNST Lab CC 2 1 - 2 25 25 50 100
Total 28 20 1 9 250 250 800 1300
PROGRAM ELECTIVE-I AUDIT COURSE: TOC 502: FOUNDATIONS OF CLOUD

COMPUTING TECHNOLOGIES
Course Code Course Name

TCS572 Applied Machine Learning Using Python
TCS-542 Information Retrieval and Web Search
TCS-521 User Interface Design (Through Swayam)
SEMESTER: VI

PERIODS
Code Title Component Credits
TCS-601 Compiler Design CC 3 3 - - 25 25 50 100
TCS-611 Software Engineering CC 3 3 - - 25 25 50 100
TCS-604 Computer Networks-I CC 3 3 - - 25 25 50 100
TCS 693 Full Stack Web CC 3 3 - - 25 25 50 100

Development
Program Elective-II PEC 4 3 - 2 25 25 50 100
PCS-601 Compiler Design Lab CC 2 1 - 25 25 50 100

2
PCS611 Software Engineering CC 2 1 - 25 25 50 100

2
Lab
PCS 693 Web Development Lab CC 2 1 - 2 25 25 50 100
Total 27 20 - 9 250 250 800 1300
PROGRAM ELECTIVE-II AUDIT COURSE: TOC601: COMPETATIVE PROGRAMMING
Course Course Name

Code
TCS-672 Deep Learning with Keras and Tensorflow
TCS-627 Information retrieval and Natural Language
Processing
TCS 673 Reinforcement Learning (Through Swayam)
SEMESTER: VII

PERIODS

Credits
TCS-703 Computer Networks-II CC 3 3 - - 25 25 50 100
TCS-704 Advance Computer CC 3 3 - - 25 25 50 100

Architecture
Open Elective-I OEC 3 3 - - 25 25 50 100
Open Elective-II OEC 3 3 - - 25 25 50 100
Program Elective-III PEC 3 3 - - 25 25 50 100
SCS-701 Seminar on Industrial SM 1 - - - - - 100 100

Interaction
CSP-701 Major Project- Phase 1 PJ 2 - - - - - 100 100
Total 19 15 - - 125 125 550 800
PROGRAM ELECTIVE-III
Course Code Component Course Name

TCS-731 DE Digital Forensics
TIT-721 DE Business Intelligence
TCS-756 DE Human computer interaction
TCS-722 DE Data warehousing and data mining
TCS- 799 DE Software Verification, Validation and Testing
TCS-717 DE Robotics (Through Swayam)
TCS-748 DE Speech Recognition and Understanding (Through
Swayam)
TCS-743 DE Foundation of Computer Security
OPEN ELECTIVE-I
COURSE CODE COURSE NAME

TOE-715 Self Driven Devices using AI and ML
TOE-702 Sensor Networks
TOE-703 Intellectual Property Rights for Engineers
TOE-704 Entrepreneurship and Small Business Management
TOE-705 Human Resource Planning and Development
TOE-706 Digital Signal Processing
OPEN ELECTIVE-II
COURSE CODE COURSE NAME
TOE-707 Cryptography and Network Security
TOE-708 Strategic Management
TOE-709 Customer Relationship Management
TOE-710 Corporate Communication
TOE-711 Digital Image Processing
TOE-712 Non-conventional resources and Energy systems

SEMESTER: VIII
COURSE DETAILS TEACHING WEIGHTAGE:EVALUATION

PERIODS
COURSE Credits L T P CWA MSE ESE Total
Course Title Component
Open Elective-III OEC 3 3 - - 25 25 50 100
TDM-881 Disaster Management HSMC 2 2 - - 25 25 50 100
Program Elective-IV PEC 3 3 - - 25 25 50 100
CSC-801 Comprehensive Viva-Voce CM 2 - - - - - 100 100
SCS 801 Seminar SM 1 - - - - - 100 100
CSP-801 Project Phase-II PJ 4 - - - - - 100 100
Total 16 8 - - 75 75 550 700
Program Elective - IV
Course Code Component CourseName

TCS821 DE Soft Computing
TCS822 DE Mobile Applications Development
TCS823 DE Multimedia Systems and Data
Compression (Through Swayam)
TCS824 DE Computer Graphics (Through
Swayam)
TCS826 DE Unix Systems Programming
TCS851 DE Storage Networks
TCS852 DE Pattern Recognition
TCS855 DE Agile Software Engineering
TCS857 DE Game Theory
TCS844 DE Biocomputation
TCS845 DE Advance Computer Vision
TCS846 DE Internet of Things
Open Elective-III
Course Code Course Name

Advanced Deep Learning and Image
TOE-812
Processing
TOE-802 Project Management
TOE-803 Corporate Leadership
TOE-804 Counseling Skills for Managers
TOE-805 Wind and Solar Energy Systems
TOE-806 Mobile Adhoc Networks
TOE-807 Embedded Systems
TOE-808 Speech Processing
TOE-809 Smart Grid Technology
Name of Department:- Computer Science and Engineering
1. Subject Code: Course Title: FUNDAMENTALS OF

TCS 101
COMPUTERS AND
2. Contact Hours: L: T: P: INTRODUCTION TO
3 - -
PROGRAMMING
3. Semester: I
4. Pre-requisite: Basic Knowledge of Mathematics
5. Course Outcomes: After completion of the course students will be able to
1. Learn the concepts of IT and understand the fundamentals of basic building blocks of computer
science.
2. Understand basic data types and syntax of C programming. .
3. Propose solution to problem by using tools like algorithm and flowcharts.
4. Analyze and select best possible solution for decision-based problems using decision making skills.
5. Develop the aptitude to solve iterative problems using different types of looping statements.
6. Implement complex problem as a collection of sub problems by applying modularization in applications
using functions.
6. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Generation of computers, Computer system memory hierarchy,
Input/Output, RAM/ROM, Software & Hardware, Understand bit,
Unit – I byte, KB, MB, GB and their relations to each other, Operating System
8
overview, Computer Networks Overview
Algorithms and Flow Charts – Examples of Flow charts for loops and
conditional statements
First C program - Hello world, How to open a command prompt on
Windows or Linux
How to read and print on screen - printf(),scanf(),getchar(), putchar()
Variables and Data types - Variables, Identifiers, data types and sizes,
type conversions, difference between declaration and definition of a
variable, Constants
Unit - II Life of a C program (Preprocessing, Compilation, Assembly, Linking,
Loading, Execution), Compiling from the command line, Macros, 10
Operators – equality and assignment, Compound assignment

operators, Increment and decrement operators, Performance
comparison between pre and post increment/decrement operators,
bitwise operators (AND, OR, NOT and XOR), Logical Operators,
comma operator, precedence and associativity, Logical operators
(AND, OR),
Unit – III Conditional statements (if statement, if-else statement, ternary 8
statement or ternary operator, nested if-else statement, switch
statement), Difference between performance of if else and switch,
Advantages of if else and switch over each other
Loops – ‘for’ loops, ‘while’ loops, ‘do while’ loops, entry control and
exit control, break and continue, nested loops
Arrays –Single and Multi-dimensional arrays, Initializing arrays,
Unit – IV computing address of an element in array, row major and column
major form of an array, character strings and arrays, segmentation 10
fault, bound checking, Sorting Algorithms – Bubble sort, insertion
sort, selection sort
Functions – Function prototype, function return type, signature of a
function, function arguments, call by value, Function call stack and
Activation Records, Recursion v/s Iteration, passing arrays (single and
Unit – V multi-dimensional) to functions,
7
Storage classes- Automatic, Static, Register, External, Static and
Dynamic linking implementation, C program memory (show different
areas of C program memory and where different type of variables are
stored), scope rules
Total 43
Text Books:
 Peter Prinz, Tony Crawford,”C in a Nutshell”, 1stEdition, Oreilly Publishers, 2011.

 Peter Norton, “Introduction to computers”, 6thEdition, TMH, 2009.
Reference Books:
 Steve Oualline, “Practical C programming”, 3rdEdition, Orielly Publishers, 2011.

 Brian W Kernighan, Dennis M Ritcie,”The C Programming Language”, 2ndEdition, Prentice Hall, 1988. R3. Herbert
Schildt,” C: The Complete Reference”, 4thEdition.TMH, 2000.
 E.Balagurusamy,”Programming in ANSI C”,6th Edition, McGraw Hill 2015
 YashwantKanetkar,”Let Us C”,8th Edition,BPB Publication 2007
1. Subject Code: TCS 201 Course Title: Programming for

Problem solving
2. Contact Hours: L: 3 T: - P: -
3. Semester: II
4. Pre-requisite: Basic Knowledge of Mathematics and Computer Fundamentals
1. Learn and apply concepts of strings for providing solutions to homogenous collection of data types
2. Propose solution to problem by using tools like algorithm and flowcharts.
3. Apply the concept of pointers to optimize memory management by overcoming the limitations of arrays.
4. Process and analyze problems based on heterogeneous collection of data using structures.
5. Apply concepts of file handling to implement data storage and retrieval tasks.
6. Implement the basic real life problems using python
Contact
UNIT CONTENTS
Hrs
Strings – Declaration of strings, Initialization of strings using arrays
and pointers, Standard library functions of <string.h>header file, Null-
Unit – I terminated strings, Char arrays and pointers, Pointers and Strings,
6
comparing two strings, find substring in a string, tokenizing a string
with strtok() function, pointer-based string-conversion function –
atoi()
Pointers –Basic of pointers and addresses, Pointers and arrays,
Pointer arithmetic, passing pointers to functions, call by reference,
Unit - II Dynamic memory management in C - malloc(), calloc(), realloc(),
free(), memory leak, 10
Dangling, Void, Null and Wild pointers
Structures - Structures, array of structures, structure within structure,
union, typedef, self-referential structure, pointer to structure
File Handling - Opening or creating a file, closing a file, File modes,
Reading and writing a text file using getc(), putc(),
Unit – III
fprintf() ,fscanf(),fgets(), fputs(),Difference between append and write
8
mode, Reading and writing in a binary file, counting lines in a text
file, Search in a text file, Random file accessing methods- feof(),
fseek(), ftell() and rewind() functions,
Introduction to Python-
History of Python, Need of Python Programming, Python features,
Installation of Python in Windows and Linux, First Python Program,
Unit – IV Running python Scripts, Variables, Reserved words, Lines and
indentation, Quotations, Comments, Input output. 10
Data Types, Operators and Expressions: Standard Data Types –
Numbers, strings, Boolean, Operators – Arithmetic Operators,
comparison Operators, assignment Operators, logical Operators,
Bitwise Operators.
Unit-V Control flow – if, if-elif-else, for, while, break, continue, pass, 10
range(), nested loops,
Data structures – List, Tuple, Dictionary
File Handling – Reading text file, writing text file, copying one file to
another
Total 44
Text Books:
 Peter Prinz, Tony Crawford,”C in a Nutshell”, 1stEdition, Oreilly Publishers, 2011.

 YashwantKanetkar,”Let Us C”,8th Edition,BPB Publication 2007
Reference Books:
 Steve Oualline, “Practical C programming”, 3rdEdition, Orielly Publishers, 2011.

 Brian W Kernighan, Dennis M Ritcie,”The C Programming Language”, 2ndEdition, Prentice Hall, 1988. R3. Herbert
Schildt,” C: The Complete Reference”, 4thEdition.TMH, 2000.
 E.Balagurusamy,”Programming in ANSI C”,6th Edition, McGraw Hill 2015
Logic Design
1. Subject Code: TCS 301 Course Title:
3. Semester: III
4. Pre-requisite: Basics of Mathematics, Basic knowledge of computer programming and components of

computer system
1. Explain the Binary, Octal, Hexadecimal number system and Gate level minimization using K-Map and
Quine-McClusky Method.
2. Analyze and Design combinational circuits.
3. Evaluate the machanism of Flip Flops (RS, JK, D and T).
4. Know the working of Asynchronous and Synchronous Counters.
5. Design and Evaluate Synchronous and Asynchronous Sequential circuits.
6. Apply and implement logic design for digital design problems of the society.
6. Details of Syllabus
Contact
UNIT CONTENTS
Hrs
Review of Number System:positive and negative logic, Binary, Octal,
Hexadecimal; Code conversion, Complements, Signed Binary Numbers,
Arithmetic Operation, Binary Codes, Error Detection and Correction.
Unit – I
Boolean Algebra and Gate Level Minimization: Basic Definition, Boolean 10
Logic, postulates, Theorems and Properties. Digital Logic Gates, K-Map
Method for Minimization upto 6-Variables, Quine-Mc Clusky Method for
Minimization, NAND and NOR Gate Implementation.
Combinational Logic Circuit: Combinational circuits, Analysis Procedure,
Design Procedure, Binary Adder & Subtractor, Decimal Adder, Binary
Unit - II
Multiplier, Magnitude Comparator, Multiplexer, Demultiplexer, Decoder,
9
Encoder, Parity Generator & Checker, Programmable Array Logic,
Programmable Logic Array, Code Convertors (BCD, Gray and Seven
Segment Code etc.).
Sequential Logic Circuits: Triggering, Latches, Flip Flops: RS, JK, D and T
Unit – III
(Characteristics Table, Equation and Excitation Table), Difference between
9
latch and Flip Flop, Flip Flop Conversion, Race Around Condition, JK Master
Slave Flip Flop.
Register: Types of Register, Serial In-Serial Out, Serial In-Parallel Out,
Parallel In- Parallel Out, Parallel In- Serial Out, Universal Shift Register,
Unit – IV Application of Shift Registers.
Counter: Asynchronous Counter, Decoding Gates, Synchronous Counters, 10
Changing the Counter Modulus, Decade Counter, Presettable Counter,
Designing of Asynchronous and Synchronous Counters, Ring counter,
Johnson counter.
Design of Synchronous and Asynchronous Sequential Circuit:
Design of Synchronous Sequential circuit: Model Selection, State Transition
Diagram, State Synthesis Table, Design Equations and Circuit Diagram,
Unit – V Implementation using Read Only Memory, State Reduction Table and ASM
8
Chart, sequence detector.
Design of Asynchronous Sequential Circuit: Analysis of Asynchronous
Sequential Circuit, Problems with Asynchronous Sequential Circuit, Circuit
Designing.
Total 46
Text Book:
1. Donald P Leach, Albert Paul Malvino& Goutam Saha, “Digital Principle and Application,” 7 th Edition,
Tata McGraw Hill, 2010
2. Mano M. Morris and Ciletti M.D., “Digital Design,” Pearson Education 4th Edition.
Reference Books:
1. Charles H. Roth,“Fundamentals of Logic Design,Jr.,” 5th Edition, Thomson, 2004
2. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss,“Digital Systems Principles and Applications,” 10 th
Edition, Pearson Education, 2007
Data Structures with C

3. Semester: III
4. Pre-requisite: Good Knowledge of Programming in C (TCS 101, TCS 201)
1. Describe the concept of Data Structures and assess how the choice of data structures impacts the
performance of programs
2. Compare and contrast merits and demerits of various data structures in terms of time and memory
complexity.
3. Identify and propose appropriate data structure for providing the solution to the real world problems.
4. Implement operations like searching, insertion, deletion, traversing mechanism etc. on various data
structures
5. Be familiar with advanced data structures such as balanced search trees, hash tables, AVL trees,
priority queues, ADT etc.
6. To augment merits of particular data structures on other data structure to develop innovation in subject
of study.
Contact
UNIT CONTENTS
Hrs
Introduction: Basic Terminology, Pointer and dynamic memory allocation,
Elementary Data Organization, Data Structure operations, Algorithm
Complexity and Time-Space trade-off Arrays: Array Definition,
Representation and Analysis, Single and Multidimensional Arrays, address
calculation, application of arrays, Array as Parameters, Ordered List, Sparse
Unit – I Matrices. Stacks:Array. Representation and Implementation of stack,
10
Operations on Stacks: Push & Pop, Array Representation of Stack, Linked
Representation of Stack, Operations Associated with Stacks, Application of
stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of
postfix expression using stack. Recursion: Recursive definition and
processes, recursion in C, example of recursion, Tower of Hanoi Problem,
tail recursion.
Queues: Array and linked representation and implementation of queues,
Operations on Queue: Create, Add, Delete, Full and Empty. Circular queue,
Dequeue, and Priority Queue.
Unit – II
Linked list: Representation and Implementation of Singly Linked Lists, Two-
10
way Header List, Traversing and Searching of Linked List, Overflow and
Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion
Algorithms, Doubly linked list, Linked List in Array, Polynomial representation
and addition, Generalized linked list.
Trees: Basic terminology, Binary Trees, Binary tree representation,
algebraic Expressions, Complete Binary Tree. Extended Binary Trees, Array
and Linked Representation of Binary trees, Traversing Binary trees,
Unit – III
Threaded Binary trees. Traversing Threaded Binary trees, Huffman
9
algorithm & Huffman tree.
Searching and Hashing: Sequential search, binary search, comparison and
analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash
Table Implementation
Unit – IV Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort,
Heap Sort, Sorting on Different Keys, Practical consideration for Internal 9
Sorting.
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in
BST, Complexity of Search Algorithm, Path Length, AVL Trees
File Structures: Physical Storage Media File Organization, Organization of
records into Blocks, Sequential Files, Indexing and Hashing, Primary
Unit – V indices, Secondary indices, B+ Tree index Files, B Tree index Files, 8
Indexing and Hashing Comparisons, Graph, Traversal(DFS,BFS) ,Minimum
spanning tree
Total 46
Text/ Reference Books:
1. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., New Delhi.
2. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi-2002
3. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd., New Delhi.
4. K Loudon, “Mastering Algorithms with C”, Shroff Publisher & Distributors Pvt. Ltd.
5. Bruno R Preiss, “Data Structures and Algorithms with Object Oriented Design Pattern in C++”, Jhon Wiley & Sons,
Inc.
6. Adam Drozdek, “Data Structures and Algorithms in C++”, Thomson Asia Pvt
1. Subject Code: TCS 307 Course Title: Object Oriented

Programming with C++
3. Semester: III
4. Pre-requisite: TCS 101, TCS 201
1. Demonstrate the C++ Program uses data types, operators, expressions, array, strings and functions.
2. Implement Constructors (Parameterized, Copy), this pointer, friend function, dynamic objects, arrays of
objects,
3. Illustrate the Operator Overloading of +, -, pre-increment, post-increment, << and >>.
4. Implement the single, multiple, multilevel and hybrid inheritance in C++.
5. Illustrate function overloading, Overriding and virtual functions.
6. Carry out exception handling techniques and provide solutions to storage related problems using STL.
Contact
UNIT CONTENTS
Hrs
Introduction: Need of object oriented programming, Overview of C++,Header
Files and Namespaces, Sample C++ program, Different data types, operators,
Unit – I 10
expressions, and statements, arrays and strings, user-defined types Function
Components, argument passing .
Classes & Objects: Class Specification, Objects, Scope resolution operator,
Access members, Defining member functions, Data hiding, Constructors ,
Parameterized constructors, Destructors, Static data members, Static
member function , Friend functions, Passing objects as arguments, Returning
objects, Arrays of objects, Dynamic objects, Pointers to objects, Copy
Unit - II 9
constructors, This Pointer, initializer list.
Operator overloading :Fundamentals of Operator Overloading,
Overloading Binary Operators and unary operators using member
function,Operator overloading using friend functions such as +, - , pre-
increment, post-increment.
Inheritance: Necessity of inheritance,Types of inheritance with
examples,Base Class and Derivedclass,Public,private and protected access
Unit – III modifiers, Inheriting multiple base classes ,working of Constructors and 9
Destructors in Inheritance, Passing parameters to base class constructors,
Virtual base classes, Diamond problem
Virtual functions and Polymorphism: Polymorphism, function overloading,
Overriding Methods, Virtual function, Calling a Virtual function through a base
Unit – IV 9
class reference, Pure virtual functions, Abstract classes, Virtual Destructors ,Early
and late binding.
Unit – V I/O System Basics and STL: C++ stream classes, I/O manipulators, 9
fstream and the File classes, basic file operations, function templates,
Exception Handling: Exception handling fundamentals, Throwing an
Exception, Catching an Exception, Re-throwing an Exception, An
exception example,
STL: An overview, containers, vectors, lists, maps, Algorithms
Total 46
Text Books:
1. Herbert Schildt: “The Complete Reference C++”, 4th Edition, Tata McGraw Hill, 2003.
Mathematics for AI and Machine

Learning
2. Contact Hours: L: 3 T: - P: 2
3. Semester: III
4. Pre-requisite: Basic knowledge of Statistics and Probability, Python Course Objectives
1. Get basic understanding about statistical models and linear algebra and their use.
2. Apply probabilistic models in AI and ML.
3. Implement different matrix-based models.
4. Derive inference from different statistical data sets and data exploration.
5. Utilize the structure and design concepts of neural networks applications to solve real lifeproblems.
6. Plan and execute successful machine learning and big data projects, including selecting an adequate
process for the specific task and avoiding the machine learningpitfalls.
Contact
UNIT CONTENTS
Hrs
Unit – I Introduction to AI & ML:Definition of AI & ML, Use Cases in Business and
10
Scope, Scientific Method, Modelling Concepts, CRISP-DM Method.
Linear Algebra Basic- Vector spaces and subspaces, basis and
dimensions, linear transformation, four fundamental subspaces
Unit – II Matrix Theory- Norms and spaces, eigenvalues and eigenvectors, Special
Matrices and their properties, least squared and minimum normed 8
solutions
Matrix Decomposition Algorithm- SVD: Properties and applications, low
rank approximations, Gram Schmidt process, polar decomposition
Data exploration (histograms, bar chart, box plot, line graph, scatter plot),
Qualitative and Quantitative Data, Measure of Central Tendency (Mean,
Unit – III
Median and Mode),Measure of Positions (Quartiles, Deciles, Percentiles and
10
Quantiles),Measure of Dispersion (Range, Median, Absolute deviation about
median, Variance and Standard deviation), Anscombe's quartet, Other
Measures: Quartile and Percentile, Interquartile Range
Dimensionality Reduction Algorithm and JCF - Principal component
analysis, Linear discriminant analysis, Minimal polynomial and Jordan
canonical form.
Unit – IV Calculus – Basic concepts of calculus: Partial derivatives, gradient,
Directional derivatives, Jacobian, Hessian, Convex sets, Convex functions 8
and its properties.
Optimization – Unconstrained and Constrained optimization, Numerical
optimization techniques for constrained and Unconstrained optimization:
Newton’s method, Steepest descent method, Penalty function method.
Unit – V Statistical AnalysisInitial Data Analysis: Relationship between attributes: 9
Covariance, Correlation Coefficient, Chi Square, Measure of Distribution
(Skewness and Kurtosis), Box and Whisker Plot (Box Plot and its parts,
Using Box Plots to compare distribution) and other statistical graphs.
Probability: Probability (Joint, marginal and conditional probabilities),

Probability distributions (Continuous and Discrete), Density Functions
and Cumulative functions
Total 45
Text / Reference Books:

1. Dr. Mark Gardener, “Beginning R: The Statistical Programming Language”, John willey& Sons, 2012
2. John M. Quick, “Statistical Analysis with R”, Pckt Publishing, 2010
1. Subject Code: TMA 316 Course Title: Discrete Structures and

Combinatorics
2. Contact Hours: L: 3 T: 1 P: 0
3. Semester: III
4. Pre-requisite: TMA 101, TMA 201
1. Specify and manipulate basic mathematical objects such as sets, functions, and relations. Demonstrate
partial order relations and Lattices.
2. Apply the discrete probability and number theory to solve the engineering problems.
3. Produce convincing arguments, conceive and/or analyze basic mathematical proofs and discriminate
between valid and unreliable arguments.
4. Discriminate, identify and prove the properties of groups and subgroups
5. Apply the basic counting techniques to solve combinatorial problems
6. Demonstrate different traversal methods for trees and graphs. Model problems in Computer Science
using graphs and trees.
Contact
UNIT CONTENTS
Hrs
Relations and Functions:
Review of Sets,
Relations - properties, equivalence relation, matrix and Graph
representation, Closure operations
Unit – I 11
Functions, Types of functions, Invertability, Composition of functions and
Inverse functions,
Partially ordered Sets and Lattices. Lattice Properties, Lattices as Boolean
Algebra
Probability Theory
Basics of Probability, Conditional Probability; Random Variables, probability
Unit – II mass and density function, commutative distribution function, expected 9
values, mean, variance and standard deviation, Distributions: Binomial.
Poisson, normal, uniform,, exponential,
Fundamentals of Logic: Basic Connectives and Truth Tables, Logical
Equivalence – The Laws of Logic, Logical Implication – Rules of Inference.
Unit – III The Use of Quantifiers, 9
Methods of Proof: Different methods of proof – Direct Proof, Indirect Proof,
Counter examples, Principle of Induction.
Groups: Definitions, Examples, and Elementary Properties,
Homomorphism, Isomorphism, permutation groups and cyclic Groups,
subgroups, cosets, and Lagrange’s Theorem
Unit – IV Counting: 10
Set cardinality and counting, Sum and Product Rules, Inclusion Exclusion
Principles, Pigeonhole principle, permutations and combinations, Basics of
recurrence relations and, generating Functions
Graphs and Trees
Fundamentals of Graphs Graph types – undirected, directed, weighted; -
Unit – V 9
Representing graphs and graph isomorphism -connectivity-Euler and Hamilton
paths, Isomorphism Tree properties, traversal techniques;
Total 48
Text Books:
1. Kenneth H. Rosen:” Discrete Mathematics and its Applications”, 6th Edition, McGraw Hill, 2007.
2. Jayant Ganguly:” A Treatise on Discrete Mathematical Structures”, Sanguine-Pearson, 2010.
Reference Books:
1. D.S. Malik and M.K. Sen: “Discrete Mathematical Structures: Theory and Applications”, Thomson, 2004.
2. Thomas Koshy: “Discrete Mathematics with Applications”, Elsevier, 2005, Reprint 2008.
3.Ralph P. Grimaldi: “Discrete and Combinatorial Mathematics”, 5th Edition, Pearson Education, 2004.
4. S.B.Singh, Jaikishor and Ekata, “Discrete Mathematics”, Khanna Publication, 2011.
1. Subject Code: Course Title: Java Programming Language

TCS 408
3. Semester: IV
4. Pre-requisite: TCS 101, TCS 201, TCS 302, TCS 307
5. Course Outcomes: After completion of the course students should be able to
1. Explain the Java programming features and develop programs to demonstrate the same.
2. Make use of object oriented concepts to develop applications
3. Classify exceptions and demonstrate applications for file handling and multithreading.
4. Analyze collection framework and develop applications using GUI.
5. Compare and utilize collection framework for programming applications
6. Design applications for event handling and accessing databases using Java features.
6.Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Introduction to Java :Importance and features of Java, Concepts of Java
Virtual machine (JVM) Keywords, Constants, Variables and data types,
operators and expressions, Control statements, Conditional
statements,loops and iterations,Wrapperclasses,Scanner Class: Scanner
Unit - I class methods (next(),nextLine() etc. 10
Concept of class: Class definition, adding variables and methods, creating

objects, constructors, defining methods, calling methods, Arrays,String
Handling in java( String, StringBuffer classes)
Object Oriented Programming concepts:Inheritance, super classes,
multilevel hierarchy, abstract and final classes, overloading and overriding
Packages and interfaces: Packages, Defining Packages, Using Packages,
import and static import, Access protection.
Unit - II 9
Interface:Defining Interfaces, abstract methods declarations, implementing
interfaces, extended interfaces, interface references.
Exception handling: Exception Types, Exception class, RuntimeException

Class, Error Class, Checked and uncheced Exceptions, Defining new
exceptions; Handling: try, catch and finally; throw statement, throws clause.
Input/Output:Basics, Byte and Character Streams, reading and writing from

Unit – III 9
console and file.
Multithreaded programming: Java thread model, synchronization,

messaging, thread class, Runnable interface, inter thread communication,
Producer/ consumer problems, Wait () and notify ().
Collection and Generic Framework: Introduction to Collection and Generic
Framework: Interfaces Iterator, List, Set, ArrayList, LinkedListHashSet and
ArrayDeque classes
Unit – IV AWT &Swing:Introduction to AWT and Swings, Swings advantages over 9
AWT, Swing applications,Swing Controls :
JButton ,JLabel , JCheckBox , JRadioButton , JList , JComboBox,
JTextFiled, JTextArea , JScrollBar, JTable, Graphics in swing
Event Handling:Event delegation model, classes, Event Listener
Interfaces,Adapter classes.
Unit – V Java Database Connectivity (JDBC):The Concept of JDBC, JBDC 9

drivers(Type1 Driver,Type4 Driver), Connection interface, Statement
interface, ResultSet interface, Creating and executing SQL statements.
Total 46
Text books:
1. Patrick Naughton and Herbert Schildt, “Java 2 The Complete Reference”, 9 th edition, McGraw Hill
Education, 2017.
2. Bruce Eckel, “Thinking in Java”, 4thedition,Pearson Education India, 2008
3. E. Balaguruswamy, “Programming with Java a Primer”, 4thedition, Tata McGraw Hill, 2009.
Reference Books:
1. Cay S Horstmann and Gary Cornell, “Core Java Volume –I and II”, Standard edition, Sun
Microsystems, 2001
2. Harvey Deitel and Paul Deitel, “Java How to Program” , 4thedition, PHI Learning, 2004
1. Subject Code: TCS 402 Course Title: Finite Automata and

Formal Languages
3. Semester: IV
4. Pre-requisite: TMA 101, TMA 201
1. Demonstrate the conversion of NFA into DFA, ϵ-NFA into DFA and Minimization of Finite Automata by
using Myhill-Nerode Theorem
2. Formulate DFA, RE and FA with output.
3. Design CFG and check the language is not CFL.
4. Design PDA and convert n-PDA into d-PDA.
5. Design Turing machines for addition, substraction, multiplication etc.
6. Formulate finite machines, push down automata and Turing machines for automated functioning of
devices.
Contact
UNIT CONTENTS
Hrs
Introduction; Alphabets, Strings and Languages; Automata and Grammars,
Deterministic finite Automata (DFA)-Formal Definition, Simplified notation:
State transition graph, Transition table, Language of DFA, Nondeterministic
Unit – I 10
finite Automata (NFA), NFA with epsilon transition, Language of NFA,
Equivalence of NFA and DFA, Minimization of Finite Automata,
Distinguishing one string from other, Myhill-Nerode Theorem
Regular expression (RE), Definition, Operators of regular expression and
their precedence, Algebraic laws for Regular expressions, Kleen’s Theorem,
Regular expression to FA, DFA to Regular expression, Arden Theorem, Non
Regular Languages, Pumping Lemma for regular Languages. Application of
Unit - II 10
Pumping Lemma, Closure properties of Regular Languages, Decision
properties of Regular Languages, FA with output: Moore and Mealy
machine, Equivalence of Moore and Mealy Machine, Applications and
Limitation of FA.
Context free grammar (CFG) and Context Free Languages (CFL): Definition,
Examples, Derivation, Derivation trees, Ambiguity in Grammar, Inherent
ambiguity, Ambiguous to Unambiguous CFG, Useless symbols,
Unit – III 9
Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure
proper ties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and
Membership, Pumping lemma for CFLs.
Push Down Automata (PDA): Description and definition, Instantaneous
Description, Language of PDA, Acceptance by Final state, Acceptance by
Unit – IV 10
empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA
and PDA to CFG, Two stack PDA.
Turing machines (TM): Basic model, definition and representation,
Instantaneous Description, Language acceptance by TM, Variants of Turing
Machine, TM as Computer of Integer functions, Universal TM, Church’s
Unit – V Thesis, Recursive and recursively enumerable languages, Halting problem, 8
Introduction to Undecidability, Undecidable problems about TMs. Post
correspondence problem (PCP), Modified PCP, Introduction to recursive
function theory.
Total 47
Text Book:
 Hopcroft, Ullman, “Introduction to Automata Theory, Languages and Computation”, Pearson Education.
 KLP Mishra and N. Chandrasekaran, “Theory of Computer Science: Automata, Languages and
Computation”, PHI Learning Private Limited, Delhi India.
Reference Books:
 Michael Sipser,” Introduction to Theory of Computation”, (2nd edition), Thomson, 2006

 Peter Linz, "An Introduction to Formal Language and Automata", Narosa Publishing house.
 Elaine Rich ,“Automata, Computability, Complexity-Theory and applications”
1. Subject Code: TCS 403 Course Title: Microprocessors
3. Semester: IV
4. Pre-requisite: TEC 101, TEC 201, TCS 101, TCS 301
1. Identify of 8085 and 8086 microprocessors and memory segmentation

2. Analysis of Instruction set of 8085and 8086.
3. Implementation of different programs on 8085 and 8086 based microcomputer kit.
4. Design the Interfacing of 8255 and 8085/8086.
5. Design & develop Interfacing of microprocessor with Timing Devices
6. Evaluate & Develop projects on embedded system using the foundation of microporcessor
Contact
UNIT CONTENTS
Hrs
Introduction to Microprocessors: Evolution of
Microprocessors,Microcomputer , different type of buses, Example of an
Unit – I 9
8085 based System, Microprocessor Internal Architecture, Pin diagram and
function of each pin, memory interfacing.
Programming with 8085: Instruction set, programming model of 8085,
addressing modes, assembly language programming, Timing and control,
Unit - II 10
peripheral I/O, memory mapped I/O, 8085 Interrupts, Stack and subroutines,
Machine & Instruction cycle of 8085.
16 Bit Processor: 16-bit Microprocessors (8086 ): Architecture, pin diagram,
Physical address, segmentation, memory organization, Bus cycle,
Unit – III 8
Addressing modes, Instruction set ,Assembly Language Programming of
8086, comparison of 8086 & 8088
Interfacing (Data Transfer) with Microprocessor: Data Transfer Schemes:
Introduction, handshaking signals, Types of transmission, 8255 (PPI), Serial
Unit – IV 8
Data transfer (USART 8251), memory interfacing, 8257 (DMA),
programmable interrupt Controller (8259).
Interfacing of Microprocessor with Timing Devices: Programmable Interval
Timer/ Counter (8253/8254): Introduction, modes, Interfacing of 8253,
Unit – V 9
applications, Need of ADC & DAC, resolution,Introduction to DAC & ADC,
ADC & DAC Interfacing (0808, 0809).
Total 44
Text Book:
1. Ramesh Gaonkar, “Microprocessor Architecture, Programming, and Applications with the 8085”, 5th
Edition, Penram International Publication (India) Pvt. Ltd.
2. Douglas V. Hall, “Microprocessors and Interfacing”, 2nd Edition, TMH, 2006.
Reference Book:
1. Kenneth L. Short, “Microprocessors and programmed Logic”, 2nd Ed, Pearson Education Inc.
2. A.K.Ray&K.M.Bhurchandi, “Advanced Microprocessors and peripherals” , Tata McGraw Hill, 2000.2nd
edition
1. Subject Code: TCS 404 Course Title: Computer Organization
3. Semester: IV
4. Pre-requisite: Fundamentals of Computer System, TCS301
1. Understand the basic components of a computer and milestones in their historical development.
2. Discuss the operation of the arithmetic unit including the algorithms & implementation of fixed-point and
floating-point addition, subtraction, multiplication & division.
3. Have a clear understanding of the elements of CPU working and Instruction Set Architecture
4. Identify the impact of the hierarchical memory system including cache memories and virtual on the
overall computer system design
5. Evaluate the various aspects I/O operations and their impact on the overall performance and
functioning of computers
6. Review the current trends in development of processor architectures with emphasis on instruction level
parallelism, latency operations in pipeline design, fault tolerance etc.
Contact
UNIT CONTENTS
Hrs
Introduction: The main components of a Computer, Historical
Development: First through Fourth Generation Computers, Moore’s Law,
The Von Neumann and Non Von Neumann Model, The Evolution of the Intel
x86 Architecture
Data Representation in Computer Systems: Signed Integer
Unit – I Representation, Complement Systems: One’s complement and Two’s 10
complement, Addition and Subtraction using signed numbers, Multiplication
of Positive Numbers, Signed Operand Multiplication, Integer Division;
Floating Point Representation, , The IEEE-754 Floating Point
Standard,Floating Point Arithmetic, Floating Point Errors
Machine Instructions and Programs: Memory Location and Addresses,

Memory Operations, Instructions and Instruction Sequencing, Addressing
Modes, , Execution of a Complete Instruction, Single Bus Organization,
Control Unit Operations: Instruction sequencing, Micro operations and
Register Transfer. Hardwired Control,
Unit – II 12
Micro-programmed Control: Basic concepts, Microinstructions and micro-
program sequencing
Performance – Processor Clock, Basic Performance Equation, Clock Rate,
Performance Measurement
Concept of Pipelining, Amdahl’s Law
Input/Output Organization: Accessing I/O Devices, Interrupts – Interrupt
Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices,
Unit – III 9
Controlling Device Requests, Exceptions, Direct Memory Access, Buses
Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB
Unit – IV Memory System: Basic Concepts, Types of Memory, Speed, Size, and 9
Cost, The Memory Hierarchy, Locality of Reference, Cache Memories –
Mapping Functions, Replacement Algorithms, Effective Access Time and Hit
Ratio, Virtual Memory-Paging, Advantages and Disadvantages of Paging
and Virtual Memory, Segmentation, Paging Combined with Segmentation,
Real World Example of Memory Management-Pentium 4 Memory
Management
Introduction to Alternative Architectures: RISC Machines, Flynn’s
Taxonomy, Parallel and Multiprocessor Architectures: Instruction level
pipelining,Superscalar and VLIW, Vector Processors, Interconnection
Unit – V 8
Networks, Shared Memory Multiprocessors, Closely and Loosely coupled
multiprocessors systems; Alternative Parallel Processing Approaches:
Dataflow Computing, Neural Networks.
Total 48
Text Books:
 William Stallings:” Computer Organization & Architecture”, 8th Edition, PHI, 2010.
 Carl Hamacher, ZvonkoVranesic, SafwatZaky:” Computer Organization”, 5th Edition, Tata McGraw Hill,
2002.
Reference Books:
 David A. Patterson, John L. Hennessy: “Computer Organization and Design – The Hardware / Software
Interface ARM Edition”, 4th Edition, Elsevier
 Linda Null, Julia Lobur: “Computer Organization and Architecture”, Jones and Bartlett Publishers, 2003
Edition
1. Subject Code: TCS 409 Course Title: Design and Analysis of

Algorithms
3. Semester: IV
4. Pre-requisite: TCS 101, TCS 201,TCS 302
1. Discuss various asymptotic notations to analyze time and space complexity of algorithms
2. Analyze the various paradigms for designing efficient algorithms using concepts of design and conquer,
greedy and dynamic programming techniques
3. Provide solutions to complex problems using the concept of back tracking and branch and bound
techniques.
4. Apply algorithm design techniques to predict the complexity of certain NP complete problems.
5. Implement Dijkstra’s, Bellman-ford, Prims, Kruskal’s algorithms to solve the real world problems like
traveling salesman problem, job sequencing, packet routing etc
6. Apply pattern matching algorithms like Rabin Karp Algorithm, Brute-force techniques etc to find a
particular pattern.
6.Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Asymptotic Notations and Searching Algorithms
Introduction to Algorithms - What is an Algorithm, Rate of growth,
Commonly used rate of growths, Types of analysis, Asymptotic Notations,
Unit – I Master theorem 8
Searching - Linear search (sorted and unsorted), Iterative and recursive
binary search, Exponential search, Tower of Hanoi and solving its recursion,
Fibonacci and solving its recursion
Sorting AlgorithmsSorting - Bubble sort, Insertion sort, selection sort,
quick sort, randomized quick sort, merge sort, Heap & Heap sort , counting
sort, External sorting, Radix sort , bucket sort.
Unit - II Divide sorting algorithms into following types - online sort, stable sort, in 10
place sort, Comparison of sorting algorithms on the basis of number of
swaps, by number of comparisons, recursive or iterative nature, time and
space complexity
Graph Algorithms
Representation of Graphs, Breadth-first search (BFS), depth-first search
(DFS), topological sort, Difference between BFS and DFSData structures
for disjoint sets - Finding cycle in a graph, Finding strongly connected
Unit – III 12
components
Minimum spanning trees - Kruskal and Prim algorithms (Greedy
Algorithms)Single source shortest paths - Dijkstra (Greedy Approach) and
Bellman ford (Dynamic Programming) algorithms, Working on -ve edge &
cycle, difference & similarity.
All pair shortest paths - The Floyd Warshall algorithm
Unit – IV Algorithm Design Techniques - Greedy and Dynamic 10
Programming
Greedy algorithms –Optimal substructure property,Activity selection
problem, Job sequencing problem, Huffman codes, fractional knapsack
problem
Dynamic Programming - Overlapping substructure property, Optimal
substructure property, Tabulation vs Memoization, Fibonacci numbers, 0/1
Knapsack problem, Longest common subsequence, Matrix chain
multiplication, Longest increasing subsequence.
Hashing, String Matching and NP-Completeness
Hashing - Introduction to Hashing, Hash function, Collision and collision
handling, - Chaining, Open addressing (longest probing, quadratic probing,
double hashing )
Unit – V String Matching - Naive string-matching algorithm, The Rabin-Karp 10
algorithm, The Knuth-Morris-Pratt algorithm,Trie.
NP-Completeness - Importance of NP-completeness, P, NP, NP Complete
and NP hard problems, Polynomial time and polynomial time verification,
The subset-sum problem, The traveling salesman problem
Total 50
Text Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein:” Introduction to Algorithms”, 2nd
Edition, PHI, 2006.
Reference Books:
1. Donald E.Knuth:”The Art of Computer Programming: Volume 1: Fundamental Algorithms”,3 rd Edition

2. Ellis Horowitz, Sartaj Sahni, SanguthevarRajasekaran:” Fundamentals of Computer Algorithms”, 2nd Edition,
University press, 2007.
3. Anany Levitin: “Introduction to the Design & Analysis of Algorithms”, 2nd Edition, Pearson Education, 2007.
1. Subject Code: Course Title: Introduction to AI and

TCS 472
Neural Network
3. Semester: IV
4. Pre-requisite: Course Prerequisites: Linear Algebra and Calculus, Probability Basics Course Objectives
1. Understand the basics of the theory and practice of Artificial Intelligence as a discipline and about
intelligent agents capable of problem formulation.
2. Analysis of informed search algorithms on well formulated problems.
3. Solve given problem using Propositional and First order logic.

4. Evaluations of different uninformed search algorithms on well formulate problems along with stating
valid conclusions that the evaluation supports.
5. Apply reasoning for non-monotonic AI problems.
6. Evaluate the issue raised by current research in the field of AI and ML.
Contact
UNIT CONTENTS
Hrs
Introduction: AI problems, foundation of AI and history of AI intelligent
Unit – I agents: Agents and Environments,the concept of rationality, the nature of
10
environments, structure of agents, problem solving agents,
problemformulation.
Searching: Searching for solutions, uniformed search strategies –
Breadth first search, depth first Search. Search with partial
Unit – II information (Heuristic search) Greedy best first search, A* search
Game Playing: Adversarial search, Games, minimax algorithm, 9
optimal decisions in multiplayer games, Alpha-Beta pruning,
Evaluation functions, cutting of search.
Knowledge Representation& Reasons logical Agents, Knowledge – Based

Agents, The Wumpus world, logic, propositional logic, Resolution patterns in
Unit – III
propositional logic, Resolution, Forward & Backward. Chaining.
9
First order logic. Inference in first order logic, propositional Vs. first order
inference, unification & lifts forward chaining, Backward chaining,
Resolution.
Characteristics of Neural Networks, Historical Development of
Neural Networks Principles, Artificial Neural Networks: Terminology,
Unit – IV Models of Neuron, Topology, Basic Learning Laws, Pattern
Recognition Problem, Basic Functional Units, Pattern Recognition 10
Tasks by the Functional Units.
Unit – V Feed-forwardNeuralNetworks:Introduction, Analysis of pattern Association 8

Networks, Analysis of Pattern Classification Networks, Analysis of pattern
storage Networks. Analysis of Pattern Mapping Networks.Analysis of Linear
Autoassociative FF Networks, Analysis of Pattern Storage
Networks.Competitive Learning Neural Networks &Complex pattern
Recognition
Total 46
TextBooks :
1. Artificial Intelligence – A Modern Approach. Second Edition, Stuart Russel, Peter Norvig,
PHI/PearsonEducation.
2. ArtificialNeuralNetworksB.YagnaNarayana,PHI
References:
1. Artificial Intelligence,2ndEdition,E.RichandK.Knight(TMH).
2. Artificial Intelligence and Expert Systems – Patterson PHI.
3. Expert Systems: Principles and Programming – Fourth Edn, Giarrantana/ Riley, Thomson.
4. PROLOG Programming for Artificial Intelligence. Ivan Bratka- Third Edition – Pearson Education.
5. Neural Networks Simon Haykin PHI
6. Artificial Intelligence, 3rd Edition, Patrick Henry Winston., Pearson Edition.
1. Subject Code: Course Title: System Software

TCS 501
3. Semester: V
4. Pre-requisite: TCS 301, TCS 403, TCS 307
1. Define system software and differentiate system software with other softwares.
2. Assess the working of Assembler, Loader/Linker and Macroprocessor.
3. Understand the concept of passes in translators.
4. Determine the purpose of linking, and types of linking.
5. Develop the system software according to machine limitations.
6. Compare and Contrast the various text editors.
Contact
UNIT CONTENTS
Hrs
Machine Architecture: Introduction, System Software and its relation to
Unit - I Machine Architecture, Simplified Instructional Computer (SIC), Architecture 9
of SIC Machine , SIC Programming Examples
Assemblers: Basic Assembler Functions, A Simple SIC Assembler,
Algorithm and Data Structures for Assemblers, Machine Dependent
Assembler Features - Instruction Formats & Addressing Modes, Program
Relocation.
Unit - II 9
Machine Independent Assembler Features – Literals, Symbol-Definition
Statements, Expression, Program Blocks, Control Sections and
Programming Linking, Assembler Design Operations - One-Pass Assembler,
Multi-Pass Assembler
Loaders and Linkers: Basic Loader Functions - Design of an Absolute
Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features –
Relocation, Program Linking, Algorithm and Data Structures for a Linking
Loader; Machine-Independent Loader Features - Automatic Library Search,
Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage,
Unit – III 10
Bootstrap Loaders
Editors and Debugging Systems: Text Editors - Overview of Editing
Process, User Interface, Editor Structure, Interactive Debugging Systems -
Debugging Functions and Capabilities, Relationship With Other Parts Of The
System, User-Interface Criteria
Macro Processor: Basic Macro Processor Functions - Macro Definitions
and Expansion, Macro Processor Algorithm and Data Structures, Machine-
Independent Macro Processor Features - Concatenation of Macro
Unit – IV 8
Parameters, Generation of Unique Labels, Conditional Macro Expansion,
Keyword Macro Parameters, Macro Processor Design Options, General-
Purpose Macro Processors, Macro Processing Within Language Translators
Unit – V Lex and Yacc :Lex and Yacc - The Simplest Lex Program, Recognizing 10
Words With LEX, Symbol Tables, Grammars, Parser-Lexer Communication,
The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running
LEX and YACC, LEX and Hand- Written Lexers, Using LEX - Regular
Expression, Examples of Regular Expressions, A Word Counting Program,
Parsing a Command Line.
Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What
YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules
Section, Symbol Values and Actions, The LEXER, Compiling and Running a
Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed
Tokens.
Total 46
1. Leland.L.Beck: “ System Software: an introduction to systems programming”, 3 rd Edition, Addison-
Wesley, 1997.
2. John.R.Levine,” Tony Mason and Doug Brown: Lex and Yacc”, O'Reilly, SPD, 1998.
1. Subject Code: Course Title: Operating Systems

TCS 502
3. Semester: V
4. Pre-requisite: TCS 301, TCS 403, TCS 404
1. Understand the concept and design issues associated with an operating system
2. Identify the problems related to process management and synchronization and apply learned
methods to solve basic problems
3. Explain the basics of memory management andthe use of virtual memory in modern operating
systems.
4. Understand the concept deadlock avoidance, prevention and detections techniques.
5. Implementation of process management, memory management and file management using system
calls.
6. Analyze the data structures and algorithms used for developing an operating systems
Contact
UNIT CONTENTS
Hrs
Introduction to Operating Systems, UNIX: What operating systems do;
Operating System structure; Operating System Services; Type of Operating
Unit – I
system, User - Operating System interface; System calls; Types of system 8
calls; System programs; Operating System structure.
Process Management: Process concept; Process scheduling; Operations
on processes; Multi-Threaded Programming: Overview; Multithreading
models; Threading issues. Process Scheduling: Basic concepts; Scheduling 10
criteria; Scheduling algorithms; Multiple-Processor scheduling; Thread
Unit - II scheduling.
Process Synchronization: Inter-process communication; Synchronization:
The Critical section problem; Peterson’s solution; Synchronization hardware;
Semaphores; Classical problems of synchronization.
Deadlocks: Deadlocks: System model; Deadlock characterization; Methods

for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock
detection and recovery from deadlock. 10
Unit – III Memory Management: Memory Management Strategies: Background;
Swapping; Contiguous memory allocation; Paging; Structure of page table;
Segmentation. Virtual Memory Management: Background; Demand paging;
Page replacement; Allocation of frames; Thrashing.
File System, Implementation of File System: File System:File concept;
Access methods; Directory structure; File system mounting; File sharing;
Protection. Implementing File System: File system structure; Directory 8
implementation; Allocation methods; Free space management.
Unit – IV
Secondary Storage Structures, Protection : Mass storage structures;
Disk structure; Disk scheduling; Disk management; Swap space
management. Protection: Goals of protection, Principles of protection,
Access matrix.
Unix Command: Command structure, Internal and external commands,
filter,vi editor.
Shell Programming: Shell scripts, Running script in the current shell, 8
Pattern Matching, Redirection, String handling, Conditional Parameter
Unit – V
Substitution, Shell functions.
Case Study: The Linux Operating System: Linux history; Design
principles; Kernel modules; Process management; Scheduling; Memory
management; File systems, Input and output; Inter-process communication.
Total 44
Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne:” Operating System Principles”, 7th edition,
Wiley India, 2006.
2. William Stallings: “Operating Systems: Internals and Design Principles”, 6th edition, Pearson, 2009
3. SumitabhaDas,”Unix concepts and applications”
Reference Books:
1. Andrew S Tanenbaum: “Operating Systems: Design and Implementation”, 3rd edition, Prentice Hall,
2006
2. Stuart E. “Madnick, John Donovan: Operating Systems”, Tata McGraw Hill, 2008
1. Subject Code: TCS 503 Course Title: Data Base Management

Systems
3. Semester: V
1. Identify the different issues involved in the design and implementation of a database system.
2. Identify the physical and logical database designs, database modeling, relational, hierarchical,
and network models
3. Recognize and use data manipulation language to query, update, and manage a database.
4. Develop an understanding of essential DBMS concepts such as: database security, integrity,
concurrency,
5. Design and build a simple database system and demonstrate competence with the fundamental
tasks involved with modeling, designing, and implementing a DBMS.
6. Design & develop a database application to appraise a business situation.
Contact
UNIT CONTENTS
Hrs
Introduction: An overview of DBMS; Advantages of using DBMS approach;
Database systems vs File Systems, Database system concepts and
architecture
Unit – I Data models, schemas and instances; Three-schema architecture and data 9
independence; Database languages and interfaces; The database system
environment; Centralized and client-server architectures; Classification of
Database Management systems.
Entity-Relationship Model: Using High-Level Conceptual Data Models for
Database Design; An Example Database Application; Entity Types, Entity
Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and
Unit - II 9
Structural Constraints; Weak Entity Types; Refining the ER Design; ER
Diagrams, Naming Conventions and Design Issues; Relationship types of
degree higher than two.
Relational Model and Relational Algebra : Relational Model
Concepts; Relational Model Constraints and Relational Database Schemas;
Update Operations, Transactions and dealing with constraint violations;
Unary Relational Operations: SELECT and PROJECT; Relational Algebra
Operations from Set Theory; Binary Relational Operations : JOIN and
DIVISION; Additional Relational Operations; Examples of Queries in
Relational Algebra; Relational Database Design Using ER- to-Relational
Mapping.
Unit – III 11
SQL – 1: SQL Data Definition and Data Types; Specifying basic constraints
in SQL; Schema change statements in SQL; Basic queries in SQL; Single
Row Function ,group function, sub queries.
Insert, Delete and Update statements in SQL; Specifying constraints as

Assertion and Trigger; Views (Virtual Tables) in SQL; Additional features of
SQL; Database programming issues and techniques; Database stored
procedures.
Unit – IV Database Design – 1: Informal Design Guidelines for Relation Schemas; 9
Functional Dependencies; Normal Forms Based on Primary Keys; General
Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form
Properties of Relational Decompositions; Lossy & Lossless decomposition,
Algorithms for Relational Database Schema Design; Multivalued
Dependencies and Fourth Normal Form; Join Dependencies and Fifth
Normal Form.
Transaction Management: The ACID Properties; Transactions and
Schedules; Concurrent Execution of Transactions; Lock- Based
Concurrency Control, Transaction support in SQL; Introduction to crash
Unit – V 9
recovery; 2PL, Serializability and Recoverability; Lock 9Management; Log
Files; Checkpointing; Deadlock handling, Recovering from a System Crash;
Media Recovery
Total 47
Text Books:
1. Elmasri and Navathe: “Fundamentals of Database Systems”, 5 th Edition, Pearson Education,
2007.
2. Karth, silbertz,Silberschatz, “Database Concepts”, McGraw Hill.
3. Raghu Ramakrishnan and Johannes Gehrke: “ Database Management Systems”, McGraw-Hill.
Name of Department: - Computer Science and Engineering
1. Subject Code: TMA 502 Course Title: Computer Based Numerical

and Statistical Technique
3. Semester: V
4. Pre-requisite: TMA 101, TMA 201, TCS 101, TCS 201
1. Develop the notion of errors, finding of errors, roots and apply them in problem solving in concern
subject.
2. Use effectively interpolation techniques and use them for numerical differentiation and integration.
3. Interpret asymptotic notation, its significance, and be able to use it to analyse asymptotic performance
for basic algorithmic examples.
4. Examine statistical control techniques and be able to relate these to practical examples.
5. Elaborate the basics of regression, curve fitting and be able to apply the methods from these subjects
in problem solving.
6. Explain the concepts of numerical solutions of ordinary differential equations.
Contact
UNIT CONTENTS
Hrs
Introduction: Numbers and their accuracy, Computer Arithmetic,
Mathematical preliminaries, Errors and their Computation, General error
formula, Error in series approximations.
Solution of Algebraic and Transcendental Equation:
Unit – I 10
Bisection Method, Iteration method, Method of false position, Newton-
Raphson method, Rate of convergence of Iterative methods.
Solution of system of linear equations: Gauss Elimination method, Gauss
Jordan method and Gauss Seidel method.
Interpolation: Finite Differences, Difference tables, Polynomial
Interpolation: Newton’s forward and backward formula, Central difference
Unit – II formulae: Gauss forward and backward formula, Stirling’s, Bessel’s, 10
Everett’s formula. Interpolation with unequal intervals: Lagrange’s
interpolation, Newton divided difference formula.
Numerical Differentiation and Integration: Introduction, Numerical
Unit – III differentiation Numerical Integration: Trapezoidal rule, Simpson’s 1/3 and 3/8 9
rule, Weddle’s rule
Numerical Solution of differential Equations: Taylor’s Method, Picard’s
Unit – IV Method, Euler’s and modified Euler’s method, Runge-Kutta Method, Milne’s 9
Predictor Corrector Method
Statistical Computation: Frequency charts, Curve fitting by method of
least squares, fitting of straight lines, polynomials, exponential curves etc,
Unit – V 10
Data fitting with Cubic splines, Regression Analysis, Linear, Non linear
Regression and Multiple regression
Total 48
Text Books:
 Rajaraman V, “Computer Oriented Numerical Methods”, Pearson Education, 2000.

 Grewal B S, “Numerical methods in Engineering and Science”, Khanna Publishers, Delhi, 2005.
Reference Books:
 Goyal, M, “Computer Based Numerical and Statistical Techniques”, Laxmi Publication (P) Ltd., New
Delhi, 2005.
 Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering Computations”, New Age Int,
2003.
 T Veerarajan, T Ramachandran, “Theory and Problems in Numerical Methods, TM, 2004.
 Francis Scheld, “Numerical Analysis”, TMH, 2010.
 Sastry, S. S, “Introductory Methods of Numerical Analysis”, Pearson Education, 2009.
1. Subject Code: Course Title: Applied Machine

TCS 572
Learning using Python
3. Semester: V
4. Pre-requisite: TCS 372
7. Use Python for handling Data preprocessing tasks of missing values, encoding, feature scaling, train
and test split
8. Implement linear and polynomial regression, Ridge and lasso Regression
9. Implement various type of classification methods including SVM, Naive bayes, decision tree, and
random forest
10. Interpret Unsupervised learning and implement clustering algorithms
11. Perform tuning of ML solutions, Bias-variance tradeoff and perform Dimension Reduction
12. Summarize datasets through data visualization using appropriate python libraries
Contact
UNIT CONTENTS
Hrs
Introduction: Machine-Learning Process, Role of Python in Machine
Learning, Review of Python essentials
Feature Engineering: What is Feature, Why Feature Engineering, Feature
Unit – I
Extraction, Feature Selection, Feature Engineering Methods: Handling 10
Numerical Features, Categorical Features, Time-based features, Text
features, Missing Data, Dimension Reduction
Feature Engineering with Python, Pandas
Regression: Introduction, Example of Regression, Simple Regression,
Multiple Regression: Polynomial Regression, Assumptions in Regression
Unit – II
Analysis, Model Assessment: Training error, Generalized Error, Testing
9
Error, Bias-variance Tradeoff; Ridge Regression, Lasso Regression, Non-
Parametric Regression: K-Nearest Neighbor Regression, Kernel Regression;
Python implementations
Classification: Introduction and Examples, Classification Model,
Unit – III Classification Learning Steps, Common classification algorithms: k-Nearest
Neighbor, Decision Trees: Tree Terminologies, Decision Tree Learning, 9
Decision Boundaries, Random Forest, Naive Bayes, Support Vector
Machines; Python implementations
Un-Supervised Learning: Introduction, Unsupervised vs Supervised
Unit – IV Learning, Application of Unsupervised Learning, Clustering, Partitioning
methods, K Means Clustering: Problems with random assignment of cluster 10
centroid, Finding value of K; Hierarchical Clustering: Distance Metrices,
Linkage; Python implementations
Unit – V Data Visualization: Line chart, Bar chart, Pie chart, Histograms, Scatter
8
Plot, Box plot; Python implementations
Total 46
Text Book:
3. SaikatDutt, S Chandramouli, Amit Kumar Das: "Machine Learning", 1st Edition, Pearson, 2018
Reference Books:
3. Abhishek Vijayvargia: “Machine Learning with Python”,Jr., 1st edition, BPB, 2018
1. Subject Code: TCS-542 Course Title: Information Retrieval and

Web Search
3. Semester: V
4. Pre-requisite:
1. Understand the various paradigms of Information Retrieval
2. compare various classification techniques
3. Understand the working of data structure of Information Retrieval.
4. Analyze the working of Page rank algorithm.
5. Implement various probabilistic models in Information Retrieval.
6. Have experience of building a document retrieval system including the implementation of a relevance
feedback mechanism;
UNIT CONTENTS Contact

Hours
Unit-1 Introduction to information retrieval, why text information retrieval? Text 8
representation in IR, Text Preprocessing, Tokens and terms, Normalization,
Morphological normalization, stemming, porter’s algorithm, stop-word removal, Index
term and term weight, IR paradigms.
Unit -2 Data structures and tolerant retrieval, Data structures for inverted index, Inverted index 9
dictionary as a hash table, Inverted index dictionary as a hash table, Inverted index
dictionary as a tree, Wild-card queries, Wild-card queries and permuterm index,
Spelling correction, Document correction, N-gram index for spelling correction
Unit-3 Probabilistic Information Retrieval, Probabilistic ranking principle, Formalization of the 8

prob. ranking principle, Probabilistic relevance ranking, Binary independence model
Unit-4 Classification, Clustering, and Learning to Rank, LSI – Singular Value Decomposition, 9
Continuous Bag-of-Words (CBOW), Supervised machine learning, Supervised
classification, Text Classification, Logistic regression, Convolutional neural network,
Cluster Analysis, Text clustering
Unit -5 Link Analysis in Web Search, Exploiting linked structure of the Web, Link Analysis, 9
PageRank hypothesis, PageRank for weighted graphs, HITS algorithm.
1. Subject Code: Course Title: User Interface Design

TCS521
3. Semester: I
4. Pre-requisite:
1. Basic HTML: Structure and HTML Tags, Images, List, Tables, Anchors and Form Elements
2. CSS : Inline, Internal and External Stylesheet, Borders, Backgrounds, text and margin properties
3. HTML5: Features, Semantic Tags, New Input Elements, Media Tags, Graphics and HMTL API’s
4. CSS3 : Features, border radius, box shadow, image border, custom web font, backgrounds - Advanced
text effects(shadow), 2D and 3D Transformations, Transitions to elements, Animations
1. Understand the concepts and architecture of the World Wide Web. To understand and practice Markup
Language.
2. Understand and practice Embedded Dynamic Scripting on Client-side Internet Programming. To understand and
practice Web Development Techniques on client-side.
3. Investigate the features of NoSQL MongoDB Database and use Server-side JS Framework
4. Implement Client-side JS Framework.
5. Identify and deploy common abstract user interface components
6. Analyze a user interface context (consisting of one or more user types and one or more tasks/activities) and
choose an appropriate type of user interface
6.Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
HTML5: What is HTML5 - Features of HTML5 – Semantic Tags –
New Input Elements and tags - Media tags (audio and video tags) –
Designing Graphics using Canvas API - Drag and Drop features –
Geolocation API - Web storage (Session and local storage).
Unit – I
8
CSS3: What is CSS3 – Features of CSS3 – Implementation of border
radius, box shadow, image border, custom web font, backgrounds -
Advanced text effects(shadow) - 2D and 3D Transformations -
Transitions to elements - Animations to text and elements
Responsive Design: What is RWD – Introduction to RWD Techniques
– Fluid Layout, Fluid Images and Media queries - Introduction to
Unit – II RWD Framework
10
Twitter Bootstrap – Bootstrap Background and Features - Getting
Started with Bootstrap - Demystifying Grids – OffCanvas - Bootstrap
Components - JS Plugins – Customization
Unit – III Introduction - Core features - Data types and Variables - Operators, 10
Expressions and Statements - Functions & Scope - Objects - Array,
Date and Math related Objects - Document Object Model - Event
Handling – Browser Object Model - Windows and Documents - Form
handling and validations.
Object-Oriented Techniques in JavaScript - Classes – Constructors
and Prototyping (Sub classes and Super classes) – JSON –
Introduction to AJAX.
Introduction – jQuery Selectors – jQuery HTML - Animations –
Effects – Event Handling – DOM – jQuery DOM Traversing, DOM
Manipulation – jQuery AJAX
What is NoSQL Database - Why to Use MongoDB - Difference
Unit – IV
between MongoDB & RDBMS - Download & Installation -
10
Common Terms in MongoDB – Implementation of Basic CRUD
Operations using MongoDB
Introduction - What is Node JS – Architecture – Feature of Node JS -
Installation and setup - Creating web servers with HTTP (Request &
Unit – V
Response) – Event Handling - GET & POST implementation - 7
Connect to NoSQL Database using Node JS – Implementation of
CRUD operations.
Total 45
Reference Books:
1. Harvey & Paul Deitel& Associates, Harvey Deitel and Abbey Deitel, “Internet and World Wide Web - How To
Program”, Fifth Edition, Pearson Education, 2011.
2. Achyut S Godbole and Atul Kahate, “Web Technologies”, Second Edition, Tata McGraw Hill, 2012.
3. Thomas A Powell, Fritz Schneider, “JavaScript: The Complete Reference”, Third Edition, Tata McGraw Hill, 2013.
4. David Flanagan, “JavaScript: The Definitive Guide, Sixth Edition”, O'Reilly Media, 2011
5. Bear Bibeault and Yehuda Katz, “jQuery in Action”, January 2008
6. Nathan Rozentals, “Mastering TypeScript”, April 2015
7. Nate Murray, Felipe Coury, Ari Lerner and Carlos Taborda, “ng-book, The Complete Book on Angular 4”
September 2016
8. Amol Nayak, “MongoDB Cookbook Paperback” , November 2014
9. KrasimirTsonev, “Node.js by Example Paperback”, May 2015
Reference Links:
1. Web link for Responsive Web Design - https://bradfrost.github.io/this-is-responsive/

2. Ebook link for JavaScript -https://github.com/jasonzhuang/tech_books/tree/master/js
3. Web link for TypeScript: https://www.typescriptlang.org/
4. Web link for Angular4.0: https://angular.io/
5. Web link for Node.js :https://nodejs.org/en/
6. Web link for MongoDB: https://www.mongodb.com/
1. SubjectCode: TCS 601 Compiler Design

Course Title:
2. ContactHours: L: 3
T: - P: -
3. Semester:VI
4. Pre-requisite: TCS-402
5. Course Outcomes: After completion of the course students will be ableto
1. Appraise the principles of compiler design like lexical, syntactical, semantic analysis, code

generation and optimization.
2. Compare and contrast various parsing techniques such as SLR, CLR, LALR, etc.
3. Use annotated tree to design the semantic rules for different aspects of programming language.
4. Implement lexical analyzer and parser by using modern tools like Flex and Bison.
5. Examine patterns, tokens & regular expressions for solving a problem in the field of data mining.
6. Design a compiler for a concise programming language.
6. DetailedSyllabus
UNIT CONTENTS CONTACT Hrs
Introduction: Compiler Introduction; Analysis of source program; Phases and
Passes of Compiler; Symbol table & its implementation; Cousins of a
Unit – I Compiler; Compiler Construction Tools; Bootstrapping: Regular Grammar and 9
Regular Expressions.
Lexical analysis: Role of a Lexical Analyzer; Input Buffering; Specifications of
Tokens; Recognition of Tokens; LEX Tool and its Implementation
Syntax Analysis: Introduction toCFG; Writing a Grammar; Ambiguous
Unit - II Grammars; Role of a Parser; Basic Parsing Techniques; Top-down Parsing;
Bottom-up Parsing; Operator-Precedence Parsing; Parser Generators (YACC) 10
Syntax-Directed Translation: Syntax-Directed Definitions; Constructions of
Syntax Trees; Bottom-Up Evaluation of S-Attributed Definitions; L-Attributed
Unit – III Definitions; Top-Down Translation. 10
Run-Time Environments: Source Language Issues; Storage-Allocation
Strategies, Parameter Passing: Stack/Heap Allocation. Error Handling
Intermediate Code Generation (ICG): Intermediate Code; ICG using Postfix
Notation, Syntax Tree, Directed Acyclic Graph (DAG); Three Address Code;
Quadruples & Triples; Back Patching; Intermediate Languages; Declarations;
Assignment Statements; Boolean Expressions; Case Statements;; Procedure
Unit – IV Calls; Array References: 12
Code Optimization: Introduction toCode Optimization; Principal Sources of
Optimization; Machine Dependent & Independent Code Optimization;
Peephole optimization; Global and Local Optimization of Basic Blocks.
Code Generation: Code Generation Issues; The Target Machine; Basic Blocks
And Flow Graphs; Next-Use Information; A Simple Code Generator; Register
Unit – V Allocation & Assignment; DAG Representation of Basic Blocks; Generating 9
CodeFrom DAG.
Compiler Development: Planning a Compiler; Compiler Development
Approaches; Compiler development environment; Testing &Maintenance.
Total 50
Text Books:
1. AlfredVAho,RaviSethi,JeffreyDUllman:“Compilers-Principles,TechniquesandTools”, Pearson
Education,2007.
Reference Books:
1. Charles N. Fischer, Richard J. leBlanc, Jr.:” Crafting a Compiler with C”, Pearson Education, 1991.
2. Andrew W Apple: “Modern Compiler Implementation in C”, Cambridge University Press, 1997.
3. Kenneth C Louden: “Compiler Construction Principles & Practice”, Thomson Education, 1997.
1. Subject Code: TCS 611 Course Title: Software Engineering
3. Semester: VI
4. Pre-requisite: Basics of Programming
1. Discuss Software Development Life Cycle and importance of engineering the software.
2. Development of efficient software requirement specification for desired product.
3. Compare various software development methodologies and conclude on their
applicability in developing specific type of product.
4. Construct an efficient design specification document for attainment of user desired
product.
5. Develop applications using the concepts of various phases of software development life
cycle.
6. Study various software testing techniques and identify their relevance to developing a
quality software.
Contact
UNIT CONTENTS
Hrs
Introduction:What is Software Engineering and its history, Software Crisis,
Evolution of a Programming System Product, Characteristics of Software,
Type of requirements- User requirement and System
requirement ,functional& non-functional requirements, Software Myths
Software Development Life Cycles: Software Development Process, The
Unit – I Code-and-Fix model, The Waterfall model, The Evolutionary Model, The 10
Incremental Implementation, Prototyping, The Spiral Model, Software
Reuse, Critical Comparisons of SDLC models, An Introduction to Non-
Traditional Software Development Process: Rational Unified Process,
Rapid Application Development, Agile Development Process
Requirements: Importance of Requirement Analysis, User Needs,

Software Features and Software Requirements, Requirement Engineering
Process(RE Process), Functional and Non-functional requirements;
Requirement Elicitation Techniques, The software requirements
Unit - II document and SRS standards, Case Study of SRS for a Real Time 9
System
Tools for Requirements Gathering: Decision Table, Decision Tree;
Structured Analysis: DFD, Data Dictionary, E R Diagrams.
Unit – III Software Design: Goals of Good Software Design, Design Strategies and 8
Methodologies, Data Oriented Software Design, Structured Design:
Structure Chart, Coupling, Cohesion,, Modular Structure, Packaging;
Object Oriented Design, Top-Down and Bottom-Up Approach, Design
architecture.
Software Measurement and Metrics: Various Size Oriented Measures:
Halestead’s Software Science, Function Point (FP) Based Measures,
Cyclomatic Complexity Measures: Control Flow Graphs.
Development: Selecting a Language, Coding Guidelines, Writing Code,
Code Documentation
Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance

Testing, Regression Testing, Testing for Functionality and Testing for
Performance, Top-Down and Bottom-Up Testing Strategies: Test Drivers
and Test Stubs, Structural Testing (White Box Testing), Functional Testing
Unit – IV 10
(Black Box Testing), Design test cases & Test suite preparation, Alpha
and Beta Testing of Products. Static Testing Strategies: Formal Technical
Reviews (Peer Reviews), Walk Through, Code Inspection, Automated
Testing
Software Maintenance and Software Project Management: Software as
an Evolutionary Entity, Need for Maintenance, Categories of
Maintenance:Preventive, Corrective and Perfective Maintenance, Cost of
Maintenance, Software Re-Engineering, Reverse Engineering. Software
Configuration Management Activities, Change Control Process, Software
Unit – V Version Control, An Overview of CASE Tools. Estimation of Various 8
Parameters such as Cost, Efforts, Schedule/Duration, Constructive Cost
Models (COCOMO), Software Risk Analysis and Management.
Software Quality Assurance: SQA Plans, ISO 9000 models, SEI-CMM
Model
Total 45
Text Books:
1. R. S. Pressman,” Software Engineering: A Practitioners Approach”, McGraw Hill.
2. P.K.J. Mohapatra,” Software Engineering (A Lifecycle Approach)”, New Age International
Publishers
Reference Books:
7. Ian Sommerville,” Software Engineering”, Addison Wesley.
8. Pankaj Jalote:” An Integrated Approach to Software Engineering”, Narosa Publishing
House.
9. Carlo Ghezzi, M. Jarayeri, D. Manodrioli,” Fundamentals of Software Engineering”, PHI
Publication.
10. Rajib Mall,” Fundamentals of Software Engineering”, PHI Publication.
11. Pfleeger, “Software Engineering”, Macmillan Publication.
1. Subject Code: TCS 604 Course Title: Computer Network-I
3. Semester: VI
1. Characterize and appreciate computer networks from the view point of components and
from the view point of services
2. Display good understanding of the flow of a protocol in general and a network protocol in
particular
3. Model a problem or situation in terms of layering concept and map it to the TCI/IP stack
4. Select the most suitable Application Layer protocol (such as HTTP, FTP, SMTP, DNS,
Bittorrent) as per the requirements of the network application and work with available
tools to demonstrate the working of these protocols.
5. Design a Reliable Data Transfer Protocol and incrementally develop solutions for the
requirements of Transport Layer
6. Describe the essential principles of Network Layers and use IP addressing to create
subnets for any specific requirements
Contact
UNIT CONTENTS
Hrs
Introduction: Computer Networks and the Internet, Overall view: As
components and as services; What is a protocol, what is a network
protocol, Access Networks and Physical Media, Circuit and Packet
Switching, Internet Backbone, Delays: Processing, Queing, Transmission
Unit – I 11
and Propagation delays
The Layered Architecture: Protocol Layering, The OSI Reference Model
and the TCP/IP protocol stack, History of Computer Networking and the
Internet
Application Layer: Principles and Architectures of Network Applications,
Client and Server processes, the idea of socket, Transport services
available to Application Layer especially in the internet.
Application Layer Protocols: The Web and http: Persistent and Non-
persistent connections, http message format, cookies, proxy server,
conditional GET
Unit - II 12
File Transfer Protocol
Email: smtp, mail message formats, mail access protocols: pop3, imap,
MIME
DNS: Services, How it works, Root, Top-Level and Authoritative DNS
servers, Resource Records, DNS messages
A simple introduction to p2p file distribution: BitTorrent
Unit – III Transport Layer: Introduction and Services, The Transport layer in 6
internet, Difference between Connection Oriented and Connectionless
services
UDP: Segment structure, checksum in UDP
Transport Layer2:The principles behind connection oriented data transfer,

designing a connection oriented protocol, stop-and-wait, Go Back N,
Selective Repeat
Unit – IV TCP: Connection Establishment, TCP header, Sequence and 6
acknowledgement numbers, Round Trip Time, Flow Control, Congestion
Control
Network Layer I: Introduction, Packet Forwarding and Routing, Difference

between Virtual Circuits and Datagram networks, The internals of a router:
Input ports, output ports, switching architecture
The Internet Protocol(IP), Datagram format, IP fragmentation, IPv4
addressing, subnets, CIDR, classful addressing, DHCP, Network Address
Translation(NAT), Universal Plug and Play as a provider of NAT, Internet
Unit – V 10
Control Message Protocol(ICMP), IPv6 Header, Moving from IPv4 to IPv6:
tunnelling, A brief discussion on IP security

(Note: Network Layer will continue with Routing Algorithms in Computer
Networks II in the next semester)
Total 45
Text Books:
1. Computer Networking: “A Top Down Approach (5th edition)”, Ross and Kurose,
Pearson/Addison-Wesley

Reference Books:
1. Andrew Tanenbaum and David Wetherhall, “Computer Networks(5th edition)”, Prentice
Hall
2. Peterson and Davie, “Computer Networks: A System Approach (4th edition)”, Elsevier
3. Forouzan, “Data Communication and Networking (4th edition)”, McGraw Hill
4. William Stallings: “Data and Computer Communication”, 8th Edition, Pearson Education,
2007
5. Nader F. Mir:” Computer and Communication Networks”, Pearson Education, 2007.
1. Subject Code: Course Title: Full Stack Web

TCS 693
Development
3. Semester: VI
1. Describe the concepts of WWW including browser and HTTP protocol.

2. List the various HTML tags and use them to develop the user-friendly web pages.
3. Define the CSS with its types and use them to provide the styles to the web pages at
various levels.
4. Develop the modern web pages using the HTML and CSS features with different layouts
as per need of applications.
5. Use the JavaScript to develop the dynamic web pages.
6. Use server-side scripting with PHP to generate the web pages dynamically using the
database connectivity.

Hrs
1 HTML 8
Basics of HTML, formatting and fonts, commenting code, hyperlink, lists, tables,
images, forms, XHTML, Meta tags, Character entities, frames and frame sets,
Browser architecture and Web site structure. Overview and features of HTML5.0,
data list.
2 CSS 8
Need for CSS, introduction to CSS, basic syntax and structure, using CSS, type of
CSS(inline CSS, internal CSS, external CSS), CSS Box model , material design,
SCSS, background images, colors and properties, manipulating texts, using fonts,
borders and boxes, margins, padding lists, positioning using CSS, Introduction to
Bootstrap.
3 JavaScript and jQuery 10

Client-side scripting with JavaScript, variables, functions, conditions, loops and
repetition, Pop up boxes, Advance JavaScript: JavaScript and objects, JavaScript
own objects, the DOM and web browser environments, Manipulation using DOM,
forms and validations,
DHTML: Combining HTML, CSS and JavaScript, Events and buttons.
Introduction to jQuery. Introduction to XML, uses of XML, simple XML, XML key
components, DTD and Schemas,
4 PHP 11
Introduction and basic syntax of PHP, decision and looping with examples, PHP
Hrs
and HTML, Arrays, Functions, Browser control and detection, string, Form
processing, Files.
Advance Features: Cookies and Sessions, Basic commands with PHP examples,
Connection to server, creating database, selecting a database, listing database,
listing table names, creating a table, inserting data, altering tables, queries, deleting
database, deleting data and tables. XAMPP Server Configuration, introduction to
laravel.
5. Web Application Deployment 8

Concept of WWW, Internet and WWW, HTTP Protocol: Request and Response
paradigm, Web browser and Web servers, Features of Web 2.0. Concepts of
effective web design, Web design issues including Browser, Bandwidth and Cache,
Display resolution, Look and Feel of the Website, Page Layout and linking, User
centric design, Sitemap, Planning and publishing website, Designing effective
navigation, Introduction to CMS. Ajax, AngularJS, JSON.
Total 45
1. Ralph Moseley and M. T. Savaliya ,“Developing Web Applications”, , Wiley-India

2. “Web Technologies”, Black Book, dreamtech Press
3. “HTML 5”, Black Book, dreamtech Press
4. Joel Sklar ,“Web Design”, Cengage Learning
5. “Developing Web Applications in PHP and AJAX”, Harwani, McGrawHill
6. P.J. Deitel&H.M. ,“Internet and World Wide Web How to program”, Deitel, Pearson
1. Subject Code: Course Title: Deep Learning with

TCS 672
Keras and Tensorflow
3. Semester: VI
4. Pre-requisite: Mathematics, Knowledge of computer programming and Machine learning

fundamentals
1. Learning of Neural Networks

2. Designing of Deep Neural Networks
3. Analysis of Deep Neural Networks output in terms of various performance metrics.
4. Design the ASM using data path and control subsystem.
5. Implementation of Deep learning modelsusing modern tools such as Keras and
Tensorflow.
6. After successful completion of this course student will be able investigate deep learning
problems.
Contact
UNIT CONTENTS
Hrs
Review of Fundaments of AI and ML:What is Artificial Intelligence and
Machine learning, Brief History of AI, Concept of UL, SL and RL;
Unit – I Regression (Linear and Logistic) and Classification, Instance based
10
learning, Bayesian Learning, Reinforcement Learning fundamentals
Artificial Neural Network: Basic Definition, Artificial Neural Logic, Keras
and its elements, Tensorflow, Neural NetworkRepresentation.
Neural Network and Tools:Neural Network Learning- backpropagation
algorithm, parameters learning for a neural network. Designing a deep
Unit – II neural network, Neural network implementation with Keras and
Tensorflow. 10
Deep learning:Deep learning successes last decade,Keras and
Tensorflow for Deep learning models, Applications of Deep learning,
Challenges of Deep learning.
Unit – III Deep Neural Net Optimization, Tuning and
Interpretability:Optimization algorithms. Learning rate, Momentum, SGD, 9
Adagrad, NAG, RMSprop, Adadelta, Adam.
Convolution Neural Nets:Success and History, CNN Network Design
Unit – IV and Architecture, Deep Convolutional Models.
Recurrent Neural Networks:Sequence of Data, Sense of Time, RNN 9
introduction, LSTM, Concept of GRUs (Gated Recurrent Units),
Comparison of LSTM and GRUs
Unit – V Autoencoders: 8
Introduction to Autoencoders, Applications of Autoencoders, Autoencoders
of Anomaly Detection.
Case study and Project: Deep learning for Text analysis using Keras and
Tensorflow (Implementation using R or Python).
Total 46
Text Book:
4. Antonio Gulli:”Deep learning avec keras et tensorflow”, 2th Edition, O’Reilly, 2020
Reference Books:
4. Simon Haykin: “Neural Networks and Learning Machines”, 3rd Edition, Pearson,
Prentice Hall
5. Bharath Ramsundar and Reza Zadeh: ”TensorFlow for Deep Learning: from Linear
Regression to Reinforcement Learning”, O’Reilly Media, 2018
1. Subject Code: Course Title: Information Retrieval

TCS 627
and Natural Language
2. Contact Hours: L: 3 T: - P: 2 Processing
3. Semester: V
4. Pre-requisite: Basics of Python Programming Language
7. Demonstrate key concepts from NLP are used to describe and analyze language
8. Examine linguistic properties of English Language
9. Implement POS Tagging and Named Entity Recognition using Python
10. Construct NLP solutions by choosing between traditional and deep learning techniques
11. Explore different Information Retrieval model
12. Acquire the necessary experience to design, and implement real applications using
Information Retrieval systems.
Contact
UNIT CONTENTS
Hrs
Introduction to Natural Language Understanding: Overview, Differences
between Programming Languages and Natural Languages, Modern
Applications of NLP, Basic Steps of NLP: Tokenization, Stemming,
Unit – I
Lemmatization, POS Tags, Named Entity Recognition, Chunking 8
Why NLP is hard: Ambiguity in Language
Regular Expressions
Introduction to NLP libraries: SpaCy and NLTK
Data Sourcing for NLP, Web Scrapping using Python
Bag of Words Model, Implementation of Bag of Words model in Python
Unit – II
using NLTK
9
Linguistic Analysis, Language Properties, Syntactic and Semantic
Analysis Tool, Morphenes in Linguistics, Difference between Inflectional
and Derivational Morphene
POS Tagging and Named Entity Recognition in SpaCy, Parts-of-Speech
Tagging Baseline, Named Entity Recognition Baseline, Analyzing
Sentence Structure, Converting text to features and labels, Naive Bayes
Unit – III
Classifier, Leveraging Confusion Matrix
9
How to identify the who, what, and where of your texts using pre-trained
model
Modeling and Semantic Analysis in NLP, Latent Semantic Analysis,
Semantics and Word Vectors with SpaCy
Topics in Information retrieval, Dictionary and Postings, Tolerant Retrieval,
Unit – IV Term Weighting and Vector Space model, Query Expansion, Probabilistic
Information Retrieval, 10
Text classification, Examples of Text Classification, Linear Classifiers,
Deep Learning Techniques
Unit – V Evaluate an information retrieval system, average precision (AP) and the 9
normalized discounted cumulative gain (nDCG), practical issues in
evaluation, including statistical significance testing and pooling, feedback
techniques in information retrieval, eb crawling, web indexing, optimize
ranking of documents in web search
Total 45
Text Book:
5. D. Jurafsky, J. H. Martin: "Speech and Language Processing", Pearson Education, 2nd
Edition
6. Nitin Indurkhya and Fred J Damerau: "Handbook of natural language processing,"
Chapman and Hall/CRC, 2010
Reference Books:
6. C.D. Manning, P. Raghavan, H. Schütze: "Introduction to Information Retrieval",
Cambridge, 2008
1. Subject Code: TCS 703 Course Title: Computer Networks-II
3. Semester: VII
1. Analyze Global and Centralized Routing protocols and utilize tools (such as NS2)
to examine routing protocols of LS and DV types
2. Evaluate and select the appropriate technology to meet Data Link Layer
requirements
3. Specify the devices, components and technologies to build a cost-effective LAN
4. Appreciate issues for supporting real time and multimedia traffic over public
network
5. Describe the key benefited of SDN, in particular those benefits brought about by
the separation of data and control planes.
6. Implement client server applications with TCP/UDP Socket Programming
Contact
UNIT CONTENTS
Hrs
Routing Algorithms: Introduction, global vs decentralized routing, The Link
State(LS) Routing Algorithm, The Distance Vector (DV) Routing Algorithm,
Unit - I 9
Hierarchical Routing, Routing in the Internet: RIP, OSPF, BGP;
Introduction to Broadcast and Multicast Routing
Link Layer and Local Area Networks: Introduction to Link Layer and its
services, Where Link Layer is implemented?, Error detection and
correction techniques: Parity checks, Checksumming, CRC; Multiple
Unit - II Access protocols: Channel Partitioning, Random Access (Slotted Aloha, 10
Aloha, CSMA), Taking Turns; Link Layer Addressing: MAC addresses,
ARP, Ethernet, CSMA/CD, Ethernet Technologies, Link Layer Switches,
Switches vs Routers, VLANS
Multimedia Networking: Introduction, Streaming Stored Audio and Video,
Real Time Streaming Protocol(RTSP), Making the Best of the Best Effort
Unit – III 9
Services, Protocols for Real Time Interactive Applications: RTP, RTCP,
SIP, H.323; Providing multiple classes of service.
Generalized forwarding and SDN Match , Action, Open flow, SDN Control
Unit – IV Plane , SDN controller and SDN control Application , Open flow protocol, 9
Data and control plane Interaction , SDN : PAST and FUTURE.
Unit – V Network Programming: Sockets-Address structures, TCP sockets, 8
creating sockets, bind, listen, accept, fork and exec function, close
function; TCP client server: Echo server, normal startup, terminate and
signal handling, server process termination, crashing and rebooting of
server, host shutdown; Elementary UDP sockets: UDP echo server, lack
of flow control with UDP
Total 45
Text Book:
1. “Computer Networking A Top Down Approach, Kurose and Ross”, 5th edition, Pearson
Reference Book:
1. Douglas E. Comer, Pearson ,“Internetworking with TCP/IP Volume 1 and 2 “,; 6 edition
1. Subject Code: TCS 704 Course Title: Advanced Computer

Architecture
3. Semester: VII
1. Analyze the classes of computers, and new trends and developments in computer
architecture.
2. Evaluate advanced performance enhancement techniques such as pipelines ,dynamic
scheduling branch predictions, caches.
3. Compare and contrast the modern computer architectures such as RISC, Scalar, and
multi CPU systems.
4. Critically evaluate the performance of different CPU architecture.
5. Improve the performance of applications running on different CPU architectures.
6. Develop applications for high performance computing systems.
Contact
UNIT CONTENTS
Hrs
Fundamentals: Computer Architecture and Technology Trends, Moore's
Law, Classes of Parallelism and Parallel Architectures, Instruction Set
Architecture: The Myopic View of Computer Architecture, Trends in
Unit - I Technology, Trends in Cost, Processor Speed, Cost, Power, Power 10
Consumption, Fabrication Yield
Performance Metrics and Evaluation: Measuring Performance, Benchmark
Standards, Iron Law of Performance, Amdahl's Law, Lhadma's Law
Memory Hierarchy Design: Basics of Memory Hierarchy, Coherence and
locality properties, Cache memory organizations, Cache Performance,
Unit - II 9
Cache optimization techniques, Virtual Memory, Techniques for Fast
Address Translation
Pipelining: What is pipelining, Basics of a RISC ISA, The classic five-stage
Unit – III pipeline for a RISC processor, Performance issues in pipelining, Pipeline 10
Hazards
Branches and Prediction: Branch Prediction, Direction Predictor,
Hierarchical Predictors, If Conversion, Conditional Move
Unit – IV 8
Instruction Level Parallelism: Introduction, RAW and WAW, dependencies,
Duplicating Register Values, ILP
Multiprocessor architecture: taxonomy of parallel architectures.
Unit – V Centralized shared-memory, Distributed shared-memory architecture, 9
Message passing vs Shared Memory
Total 46
Text/ Reference Books
1. John L. Hennessy, David A. Patterson, “Computer Architecture: A Quantitative

Approach” 5th edition, Morgan Kaufmann
2. ”by Kai Hwang ,“Advanced Computer Architecture”, McGraw Hill Publishing
1. Subject Code: TCS 731 Course Title: Digital Forensics
2. Contact Hours: 3L: - T: - P:

3. Semester: VII
4. Prerequisite:
1. Understand the importance of a systematic procedure for investigation of data

found on digital storage media that might provide evidence of wrong-doing.
2. Identify and document potential security breaches of computer data that
suggest violations of legal, ethical, moral, policy and/or societal standards
3. Use tools for faithful preservation of data on disks for analysis and find data
that may be clear or hidden on a computer or another device
4. Work with computer forensics tools used in data analysis, such as searching,
absolute disk sector viewing and editing, recovery of files, password cracking,
etc.
5. Present the results of forensics analysis as an expert.
6. Discuss the Cyber Laws and Cyber Crimes.
6. Details of the Course: -
Contact
UNIT CONTENTS
Hrs
Cyber Crimes, Laws and Cyber Forensics: Introduction to IT
laws & Cyber Crimes, The World and India
Cyber Forensics Investigation: Introduction to Cyber Forensic
Investigation, Investigation Tools, eDiscovery, Digital Evidence
Unit – I 9
Collection, Evidence Preservation, E-Mail Investigation, E-Mail
Tracking, IP Tracking, E-Mail Recovery, Encryption and
Decryption methods, Search and Seizure of Computers, Recovering
deleted evidences, Password Cracking
Unit - II Digital Forensics Fundamentals: Introduction to Incident 9
response, digital forensics stepwise procedure,
Computer/network/Internet forensic and anti-forensics , Unix/Linux
incident response, Unix/Linux forensics investigation steps and
technologies, Memory forensics, Windows incident response tools ,
Windows forensics tools
Data and Evidence Recovery- Introduction to Deleted File

Recovery, Formatted Partition Recovery, Data Recovery Tools,
Data Recovery Procedures and Ethics, Preserve and safely handle
original media, Document a “Chain of Custody”, Complete time line
analysis of computer files based on file creation, file modification
and file access, Recover Internet Usage Data, Recover Swap
Files/Temporary Files/Cache Files, Introduction to Encase Forensic
Edition, Forensic Tool Kit (FTK) etc, Use computer forensics
software tools to cross validate findings in computer evidence-
related cases, Dump Analysis, Browser forensics, Multimedia
forensics, Taking RAM dump and Volatile Memory Analysis
Software Security: Memory Layout, Buffer Overflow, Code Injection, Other
Memory Exploits, Format String Vulnerabilities, Defenses against low-level
exploits: Memory Safety, Type Safety, Avoiding Exploitation, Return Oriented
Programming, Control Flow Integrity, Secure Coding; Web Security: Basics, SQL
Unit – III 10
Injection, Countermeasures, Session Hijacking, Cross Site Scripting, Program
Analysis
Image Analysis: Using software to analyze an image, Searching image for
evidence, File carving
Hardware Security: Digital System Specification, Watermarking, Good
Watermarks, Fingerprinting, Hardware metering, Physical Attacks and
Unit – IV 8
Countermeasures, Modular Exponentiation (ME) Basics, ME in Cryptography,
ME Implementation and Vulnerability, Montgomery Reduction
Analysis and Validation: Types of Investigation Software, Validating Forensics
Data, Data Hiding Techniques, Performing Remote Acquisition, Network
Forensics, Email Investigations, Cell Phone and Mobile Devices Forensics,
Unit – V 8
Virtual Machin Forensics, Cloud forensics, Live forensics
Case Studies: Blackmailing, Credit-Card fraud, Hosting Obscene Profiles, Illegal
money transfer, Fake Travel Agent
Total 44
TEXT BOOKS:
1. Bill Nelson, Amelia Phillips, Frank Enfinger, Christopher Steuart, ―”Computer Forensics and
Investigations”, Cengage Learning, India Edition, 2016
2. MarjieT.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3rd Edition, Prentice
Hall
REFERENCES:
1. Kenneth C.Brancik ―”Insider Computer Fraud Auerbach “, Publications Taylor &; Francis
Group
2. “CEH official Certfied Ethical Hacking Review Guide”, Wiley India Edition, 2015
1. Subject Code: TIT 721 Course Title: Business Intelligence
3. Semester: VII
4. Pre-requisite: TCS671
1. Understand the frameworks of Business Intelligence

2. Categorize the structured, semi structured and unstructured data
3. Create the schemas for data warehouse
4. Perform the multi dimensional data modeling
5. Use of different visualization techniques
6. Use of Business Intelligence for ERP
Contact
UNIT CONTENTS
Hrs
Business view of Information Technology Application
Business Enterprise Organization, its functions, and core business
process, Baldrige Business Excellence Framework:- Leadership,
Strategic Planning, Customer Focus, Measurement, Analysis and
Unit - I 10
Knowledge Management
Workforce Focus, Process Management
Key Purpose of using IT in Business, Enterprise Application
(ERP/CRM etc) and Bespoke IT Application
Types of Digital Data, Getting to know structured data, characteristics
of structured data, were does structured data come from? , Hassle free
Retrieval
Getting to know unstructured data, were does unstructured data comes
from? , How to manage unstructured data? How to store unstructured
data? Solutions to storage challenges of unstructured data, how to
Unit - II 9
extract information from stored unstructured data? , UIMA: A possible
solution for unstructured data
Getting to know semi structured data, where does semi structured data
come from? , How to manage semi structured data, modeling semi
structured data (OEM), How to extract information from semi
structured data, XML : A solution for semi structured data management
Unit – III Introduction to OLTP and OLAP 9
OLTP:- Queries that an OLTP system can process, Advantage of an
OLTP system, Challenges of an OLTP system, The queries that OLTP
cannot answer
OLAP:-one dimension data, two dimension data, three dimension data,
should we go beyond the third dimension, queries that an OLAP
system can process, Advantage of an OLAP system
Different OLAP Architecture:-MOLAP, ROLAP, HOLAP
Data Models for OLTP and OLAP, Role of OLAP tools in the BI
Architecture
OLAP operations on multidimensional data
BI component framework:- Business layer, Administration and
operational layer, Implementation layer
Who is BI for? - BI for Management, Operational BI, BI for process
Improvement, BI to improve customer experience
Business Intelligence Application:-Technology Solutions, Business
solutions
BI roles and Responsibility:-BI program team roles, BI project team
Unit – IV 8
roles, Best practice in BI/DW
Popular BI tools
Need for Data Warehouse, What is a Data Mart, Goals of a Data
Warehouse
Multidimensional data modeling:- Data modeling Basics, Types of
Data model, Data Modeling Techniques, Fact table, Dimension table,
Dimensional modeling life cycle
Measure, Metrics, KPIs, and Performance Management
Understanding Measure and performance, Measurement system
terminology, Fact based Decision Making and KPIS, KPI usage in
companies
Unit – V Basics of Enterprise Reporting:- Report standardization and 9
presentation practices, Enterprise reporting characteristics in OLAP
world, Balance score cards, Dashboards, How do you create
Dashboards, Scorecards Vs Dashboards
BI and Cloud Computing, Business Intelligence for ERP systems
Total 45
Reference Book:
R.N. Prasad and Seema Acharya ,“Fundamentals of Business Analytics”, Wiley India
1. Subject Code: TCS 756 Course Title: Human Computer

Interaction
3. Semester: VII
4. Pre-requisite: Fundamentals of Computer architecture
1. Explain the capabilities of both humans and computers from the viewpoint of human
information processing.
2. Describe typical human–computer interaction (HCI) models, styles, and various historic
HCI paradigms.
3. Apply an interactive design process and universal design principles to designing HCI
systems.
4. Describe and use HCI design principles, standards and guidelines.
5. Analyze and identify user models, user support, socio-organizational issues, and
stakeholder requirements of HCI systems.
6. Discuss tasks and dialogs of relevant HCI systems based on task analysis and dialog
design.
Contact
UNIT CONTENTS
Hrs
Introduction : Importance of user Interface – definition, importance of good
design. Benefits of good design. A brief history of Screen design.The
Unit – I graphical user interface – popularity of graphics, the concept of direct 8
manipulation, graphical system, Characteristics, Web user – Interface
popularity, characteristics- Principles of user interface
Design process – Human interaction with computers, importance of
Unit – II human characteristics human consideration, Human interaction speeds, 8
understanding business junctions
Screen Designing : Design goals – Screen planning and purpose,
organizing screen elements, ordering of screen data and content – screen
navigation and flow – Visually pleasing composition – amount of
Unit – III 9
information – focus and emphasis – presentation information simply and
meaningfully – information retrieval on web – statistical graphics –
Technological consideration in interface design
Unit – IV Windows – New and Navigation schemes selection of window, selection of 8
devices based and screen based controls.
Components – text and messages, Icons and increases – Multimedia,
colors, uses problems, choosing colors
Software tools – Specification methods, interface – Building Tools.

Unit – V Interaction Devices – Keyboard and function keys – pointing devices – 8
speech recognition digitization and generation – image and video displays
– drivers
Total 41
.Text Books :
1. “The essential guide to user interface design”, Wilbert O Galitz, Wiley DreamaTech.
2. “Designing the user interface”. 3rd Edition Ben Shneidermann , Pearson Education Asia.
Reference Book:
1. “Human – Computer Interaction”. ALAN DIX, JANET FINCAY, GRE GORYD, ABOWD,
RUSSELL BEALG, PEARSON.
1. Subject Code: TCS 722 Course Title: Data Warehousing and Data
Mining
3. Semester: VII
4. Pre-requisite: Excellent knowledge of Database Management Systems
1. Describe the fundamental concepts, benefits and problem areas associated with data
warehousing
2. Understand the various architectures and main components of a data warehouse.
3. Find the issues that arise when implementing a data warehouse.
4. Understand the techniques applied in data mining.
5. Compare and contrast OLAP and data mining as techniques for extracting knowledge
from a data warehouse.
6. Find the association rules.
Contact
UNIT CONTENTS
Hrs
Overview, Motivation(for Data Mining),Data Mining-Definition &
Functionalities, Data Processing, Form of Data Preprocessing, Data
Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression,
Unit – I Computer and Human inspection),Inconsistent Data, Data Integration and 9
Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality
reduction, Data Compression, Numerosity Reduction, Clustering,
Discretization and Concept hierarchy generation
Concept Description:- Definition, Data Generalization, Analytical
Characterization, Analysis of attribute relevance, Mining Class
comparisions, Statistical measures in large Databases. Measuring Central
Tendency, Measuring Dispersion of Data, Graph Displays of Basic
Unit – II Statistical class Description, Mining Association Rules in Large 8
Databases, Association rule mining, mining Single-Dimensional Boolean
Association rules from Transactional Databases– Apriori Algorithm, Mining
Multilevel Association rules from Transaction Databases and Mining Multi-
Dimensional Association rules from Relational Databases
Unit – III What is Classification & Prediction, Issues regarding Classification and 9
prediction, Decision tree, Bayesian Classification, Classification by Back
propagation, Multilayer feed-forward Neural Network, Back propagation
Algorithm, Classification methods K-nearest neighbor classifiers, Genetic
Algorithm. Cluster Analysis: Data types in cluster analysis, Categories of
clustering methods, Partitioning methods. Hierarchical Clustering- CURE
and Chameleon, Density Based Methods-DBSCAN, OPTICS, Grid Based
Methods- STING, CLIQUE, Model Based Method –Statistical Approach,
Neural Network approach, Outlier Analysis
Data Warehousing: Overview, Definition, Delivery Process, Difference
between Database System and Data Warehouse, Multi Dimensional Data
Unit – IV 9
Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept
hierarchy, Process Architecture, 3 Tier Architecture, Data Marting
Aggregation, Historical information, Query Facility, OLAP function and
Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface,
Unit – V 8
Security, Backup and Recovery, Tuning Data Warehouse, Testing Data
Warehouse
Total 43
Books:
1. M.H.Dunham,”DataMining:Introductory and Advanced Topics” Pearson Education
Jiawei Han, Micheline Kamber, ”Data Mining Concepts & Techniques” Elsevier
1. Subject Code: TCS 799 Course Title: Software Verification and

Validation and Testing
2. Contact Hours: L: 3 T: P: -
3. Semester: VI
4. Pre-requisite: TIT 501
1. Demonstrate the application of verification and validation tasks and their outcomes
during the software life cycle.
2. Apply various verification and validation techniques based on various characteristics of
the system/software (safety, security, risk, etc).
3. Differentiate between the overall role of verification and validation and the specific role of
software/system testing.
4. Compare and Contrast the theoretical and practical limitations to software verification
and validation analysis.
5. Apply appropriate planning and scoping to a verification and validation effort based on
the needs of the software system being developed.
6. Develop a software verification and validation plan that reflects an understanding of
verification and validation objectives, and appropriate problem/risk identification and
tracking.
Contact
UNIT CONTENTS
Hrs
Introduction: What is software testing and why it is so hard?, Error,
Fault, Failure, Incident, TestCases, Limitations of Testing, Goals of
software Testing, Principles of software testing ,Bugs –States of Bug, Bug
Unit – I life cycles or defect life cycle, Types of Bug, Software Testing Life Cycle 11
(STLC),V-Testing Model, Verification activities ,Validation activities ,Test
case design, Test suite.
Functional Testing: Boundary Value Analysis, Equivalence Class

Testing, Decision Table Based Testing, Cause Effect Graphing
Unit – II Technique. 12
Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity,
Graph Metrics, Data Flow Testing, Mutation testing.
Reducing the number of test cases:
Unit – III Prioritization guidelines, Priority category, Scheme, Risk Analysis, 12
Regression Testing, Smoke testing , Sanity Testing.
Testing Activities: Unit Testing, Levels of Testing, Integration Testing,
Unit – IV 10
System testing, Debugging, Debugging process, Debugging techniques.
Unit – V Object Oriented Testing: Issues in Object Oriented Testing, Class
Testing, GUI Testing, Object Oriented Integration and System Testing.
Testing Tools: Static Testing Tools, Dynamic Testing Tools,
Characteristics of Modern Tools.
Total 45
Text Books:
 William Perry, “Effective Methods for Software Testing”, John Wiley &
Sons, New York, 1995.
 CemKaner, Jack Falk, Nguyen Quoc, “Testing Computer Software”,
Second Edition, Van Nostrand Reinhold, New York, 1993.
 Boris Beizer, “Software Testing Techniques”, Second Volume, Second
Edition, Van Nostrand Reinhold, New York, 1990.
 Louise Tamres, “Software Testing”, Pearson Education Asia, 2002
Reference Books:
 Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”,
Fifth Edition, McGraw-Hill International Edition, New Delhi, 2001.
 Boris Beizer, “Black-Box Testing – Techniques for Functional Testing of
Software and Systems”, John Wiley & Sons Inc., New York, 1995.
 K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age
International Publishers, New Delhi, 2003.
 Marc Roper, “Software Testing”, McGraw-Hill Book Co., London, 1994.
 Gordon Schulmeyer, “Zero Defect Software”, McGraw-Hill, New York,
1990.
 Watts Humphrey, “Managing the Software Process”, Addison Wesley
Pub. Co. Inc., Massachusetts, 1989.
 Boris Beizer, “Software System Testing and Quality Assurance”, Van
Nostrand Reinhold, New York, 1984.
 Glenford Myers, “The Art of Software Testing”, John Wiley & Sons Inc., New York,
1979.
1. Subject Code: TCS 717 Robotics

Course Title:
3. Semester: VII
4. Pre-requisite: Basics of Mathematics
5. Course Outcomes
 Understanding the history, concepts and key components of robotics technologies.

 Understanding the control systems related to robotics.
 Analysis of various robot sensors, end effectors and their perception principles that
enable a robot to analyse their environment, reason and take appropriate actions
toward the given goal.
 Analyze the robot motion, kinematics, navigation and path planning.
 Designing the programming principles for robot control system.
 Plan, design and implement robotic systems, algorithms and software capable of
operating in complex and interactive environments.
Contact
UNIT CONTENTS
Hrs
FUNDAMENTALS OF ROBOTICS:
Unit - I Brief history of robotics, robotics market, future 8
perspectives of robotics, robot anatomy, robot drive
systems, precision of movement, end effectors.
CONTROL SYSTEM AND COMPONENTS:
Unit – II Basic control system concepts and model, controllers,
robot sensors and actuators, velocity sensors, power 8
transmission system, modeling and control of single joint
robot.
ROBOT END EFFECTORS AND SENSORS:
Unit – III
Types of end effectors, mechanical grippers, other types 12
of grippers, robot/end effectors interface, transducers
and sensors.
ROBOT MOTION ANALYSIS AND CONTROL
Unit – IV
Introduction to manipulator kinematics, homogeneous 6
transformation, robot kinematics, manipulator path
control, robot dynamics.
Unit – V 6
MACHINE VISION:
Introduction to machine vision, Sensing and digitizing
function in machine vision, image processing and
analysis.
Total 40
Text Book
M P Groover, Industrial Robotics, TMH, 2nd Edition
S R Deb and Sankha Deb, Robotics Technology and Flexible Automation, TMH.
Reference Books
S.K Saha, Introduction to Robotics, TMH, 2ndEdition
R.K. Mittal, I.J. Nagrath, Robotics & Control, TMH, 2005
Craig. J. J, Introduction to Robotics- Mechanics and Control, Pearson Education

India, 3nd Edition.
1. Subject Code: TCS 748 Course Title: Speech

Recognition and
2. Contact Hours: L: 3 T: - P: - Understanding
3. Semester: VII
4. Pre-requisite: Mathematics, Machine Learning, Programming
1. Learn the concepts of speech recognition and speech understanding.

2. Understand Automatic Speech Recognition.
3. Understand different parsing techniques and Language model.
4. Learn different technique of speech recognition.
5. Understand different component of speech understanding.
6. Able to implement text to speech system and Dialogue Systems and Chatbots.
Contact
UNIT CONTENTS
Hrs
Introduction, Speech Recognition overview, Speech Understanding,
spoken language system architecture, Automatic Speech
Recognition (ASR), Applications areas of ASR, Types of ASR,
Unit - I
Text-to-Speech Conversion, sound and human speech systems, 9
Production of speech sounds, phonetics and phonology, syllables
and words, syntax and semantics,
Fundamentals of Speech,Basic Signal Processing

Unit - II Concepts,SignalMeasurements,Signal Processing in Speech
Recognition,Hidden Markov Models (HMMs),Acoustic Modeling 10
and Training,Speech Recognition Using HMMs,Neural network
speech recognition.
Regular Expressions, Text Normalization, N-gram Language
Unit – III Models, Naive Bayes and Sentiment Classification, Logistic
Regression, Vector Semantics and Embeddings, Neural Networks 10
and Neural Language Models, Part-of-Speech Tagging, Sequence
Processing with Recurrent Networks
Constituency Grammars, Constituency Parsing, Statistical
Unit – IV
Constituency Parsing, Dependency Parsing, Logical Representations
10
of Sentence Meaning, Computational Semantics and Semantic
Parsing
Unit – V spoken language understanding: written vs. spoken languages, 8
dialog structure, semantic representation, sentence interpretation,
discourse analysis, dialog management,response generation and
rendition
Case study: TEXT-TO-SPEECH SYSTEMS, Dialogue Systems and
Chatbots
Total 47
Text Books:
1.Daniel Jurafsky and James H. Martin. 2000. Speech and Language Processing: An Introduction to
Natural Language Processing, Computational Linguistics, and Speech Recognition
2.Xuedong Huang, Alex Acero, Hsiao-Wuen Hon, and Raj Reddy. 2001. Spoken Language Processing: A
Guide to Theory, Algorithm
1. Subject Code: TCS-743 Course Title: Foundation of

Computer Security
2. Contact Hours: L: 3 T: - P:
3. Semester: VII
4. Pre-requisite: Fundamentals of Computer System, Programming language and Mathematics
1. Explain the three pillars of cyber security, types of hackers and penetration testing.
2. Implement the scripting concepts used in cyber security.
3. Use the netcat, ping and wireshark tools to analyze the security of network.
4. Use the Javascript, php, sql to analyze the web security.
5. Explain the use of cyber security protocols for cyber threats.
6. Analyze the security level of web applications.
Contact
UNIT CONTENTS
Hrs
Introduction to Cyber Security
What is Cyber security, Why we need Cyber security, The Zero Trust
Model, Ethical Hacking
Protect Against - Unauthorised Modification, Unauthorised Deletion and
Unauthorised Access
Unit – I Three pillars of Cyber Security - Confidentiality, Availability and Integrity 9
Steps to fix a crime - Identify Cyber Threats, Analyse and Evaluate Threat,
Treatment
Type of Hackers - White Hat, Great Hat, Black Hat
Penetration Testing and its Phases - Reconnaissance, Scanning, Gaining
Access, Maintaining Access, Covering Tracks
Linux Basics and Scripting for Ethical Hacking
Bash, Linux commands, man page, Adding and deleting, users and adding
them to sudo group, switching users, creating, copying, moving and
removing file, Writing and appending text to a file, File permissions,
working with editors, grep, cut command, Starting and stopping services,
Unit – II 9
Automating tasks with cron jobs
Introduction to Bash Scripting - Basics of Bash or Shell Scripting,
conditional statements, loops, Manipulating files
Introduction to Python - Basics of Python, conditional statements,
loops,list, tuple, dictionary, functions
Unit – III Networking Basics for Ethical Hacking 10
Virtualization - Installing and configuring virtual machine, Configuration of
network - NAT, Bridged and Host only, Dual boot system
TCP/IP - IPv4 and IPv6, IP Address, Mac Address, Subnets, TCP 3-way
handshake, DNS
Communication between VMs or Setting up network between machines,
netcat - The Swiss Army Knife of TCP/IP Connections, use netcat to
Listen on a port, pushing a command shell back to listener, transfer files,
Ping command
Wireshark - A Packet Sniffing Tool
Basics of Web and Web Security
Introduction to Java Script - Basics of Javascript, Input validation, Cross
Unit – IV site scripting (XSS) attack 9
Introduction to PHP and SQL - Basics of PHP, Input Validation,
Phishing, Spear Phishing, Sql Injection Attack
Introduction to Cyber Threats and System Hacking
Cyber Threats - Malware, password attacks, Distributed denial-of-service
(DDos), Ransomware attack, Eavesdropping attack (man in the middle
Unit – V attack), Birthday attack, buffer overflow attack, IP and Mac address 10
spoofing, Steganography, Anonymous browsing, Introduction to tor
browser, Introduction to VPN, Secure Sockets Layer (SSL), Secure Shell
(SSH)
Total 47
Text/Reference Books:
1. Georgia Weidman ,“Penetration Testing: A Hands-On Introduction to Hacking,” No

Starch Press Inc., 2014.
2. Nina Godbole ,SunitBelapure, “Cyber Security:Understanding Cyber Crimes, Cyber
Forensics and Legal Perspectives,” Wiley India, 2011.
1. Subject Code: TOE715 Course Title: Self Driven

Devices using AI
2. Contact Hours: L: 3 T: - P: - and ML
3. Semester: VII
4. Pre-requisite: Basics of probability theory, Basic continuous and discrete maths is an

advantage. Some knowledge of computer programming and components of computer system.
1. Analyze basic principles of Artificial Intelligence.

2. Design intelligent agents.
3. Apply automated rezoning about object.
4. Identify the basic areas of AI including probelm solving, knowledge representation,
deciaion making, perception and action.
5. to master the fundamentals of machine learning, mathematical framework and learning
algorithms.
6. Design implement varios clustring algorithms.
Contact
UNIT CONTENTS
Hrs
Introduction: - Preliminaries of artificial intelligence and machine
learning, Physical Symbol System Hypothesis, production systems,
Characteristics of production systems; Breadth first search and depth first
search techniques. Heuristic search Techniques: Hill Climbing, Iterative
Unit – I deepening DFS, bidirectional search. Analysis of search methods. A*
10
algorithm, and their analysis. Introduction to Genetic Algorithms.
Varieties of machine learning, learning input/output functions, bia, sample
application. Boolean functions and their classes, CNF, DNF, decision lists.
Version spaces for learning, version graphs, learning search of a version
space, candidate elimination methods.
Automated Reasoning: - representing and reasoning about objects,
relations, events, actions, time, and space; predicate logic, situation
calculus, Syntax - Informal and formal semantics - Equivalence - De
Unit – II 9
Morgans laws - Decidable problems - Many-sorted logic - first-order,
higher-order logic, Formal program techniques - pre- and post-conditions,
derivation and verification of programs -SPIN Tool.
Unit – III Uncertain Knowledge: - Bayesian networks; Basics of decision theory, 10
sequential decision problems, elementary game theory; Problem-solving
through Search - forward and backward, state-space, blind, heuristic,
problem-reduction, A, A*, AO*, minimax, constraint propagation, neural
and stochastic; Introduction to intelligent agents; Machine Learning -
Foundations of supervised learning - Decision trees and inductive bias,
Regression Vs Classification, Supervised - Linear Regression, Logistic
Regression.
Network-based representation and reasoning:-Semantic networks,
Unit – IV Conceptual Graphs, frames. Description logic (DL), concept language,
9
reasoning using DL. Conceptual dependencies (CD), scripts, reasoning
using CD. Introduction to natural language processing.
Generalisation, Training, Validation and Testing:- Problem of
Overfitting, Bias vs Variance ,Confusion Matrix, Precision, Recall, F
Measure, Support Vector Machine, Decision Tree, Random Forest,
Perceptron, Beyond binary classification, Boosting and bagging,
Unit - V bootstrapping - Advanced supervised learning - K-Nearest Neighbour, 9
Markov model, Hidden Markov Model - Nearest Neighbor Classification -
Gaussian processes - Unsupervised Learning - Dimensionality Reduction
Techniques, Linear Discriminant Analysis - Clustering: K-means,
Hierarchical, Spectral ,subspace clustering, association rule mining
Total 47
Text Book:
7. Russell, Norvig,”Artificial Intelligence: A Modern Approach”, 3 rd Edition, Prentice Hall,
2010.
8. Andreas, C. Mullerand Sarah Guido, “Introduction to Machine Learning with Python A
guide for data scientists”,O'Reilly.
9. Dan W.Patterson, “Introduction to AI & Expert System”,Prentice -Hall, 1990.
References:
1. Hastie, Tibshirani and Friedmanm,” The elements of statistical learning”, 2 nd Edition,

Springer, 2009.
2. Daphne Koller and Friedman, “Probabilistic Graphical Models - Principles and
Techniques”, The MIT Press, 2009.
1. Subject Code: TOE 702 Course Title: Sensor Networks
2. Contact Hours: 3L: - T: - P:

3. Semester: VII
4. Prerequisite: TCS631
1. Understand the wireless sensor networks basics and characteristics.

2. Analyze various medium access control protocols.
2. Describe routing and data gathering protocols.
3. Understand embedded operating systems.
5. Describe WSN applications.
6. Use various WSN protocols for different applications in real-time.
6. Details of the Course: -
Contact
UNIT CONTENTS
Hrs
Introduction to Wireless Sensor Networks:Introduction:
Motivations, Applications, Performance metrics, History and
Design factors, Traditional layered stack, Cross-layer designs,
Sensor Network Architecture.
Characteristics of WSN: Characteristic requirements for WSN -
Unit – I Challenges for WSNs – WSN vs Adhoc Networks - Sensor node 9
architecture – Commercially available sensor nodes –Imote, IRIS,
Mica Mote, EYES nodes, BTnodes, TelosB, Sunspot -Physical layer
and transceiver design considerations in WSNs, Energy usage
profile, Choice of modulation scheme, Dynamic modulation scaling,
Antenna considerations.
Medium Access Control Protocols:Fundamentals of MAC
protocols - Low duty cycle protocols and wakeup concepts –
Unit – II Contentionbased protocols - Schedule-based protocols - SMAC - 9
BMAC - Traffic-adaptive medium access protocol (TRAMA) - The
IEEE 802.15.4 MAC protocol.
Unit – III Routing and Data Gathering Protocols:Routing Challenges and 10
Design Issues in Wireless Sensor Networks, Flooding and gossiping
– Data centric Routing – SPIN – Directed Diffusion – Energy aware
routing - Gradient-based routing - Rumor Routing – COUGAR –
ACQUIRE – Hierarchical Routing - LEACH, PEGASIS – Location
Based Routing – GF, GAF, GEAR, GPSR – Real Time routing
Protocols – TEEN, APTEEN, SPEED, RAP - Data aggregation -
data aggregation operations - Aggregate Queries in Sensor
Networks - Aggregation Techniques – TAG, Tiny DB
Embedded Operating Systems:Operating Systems for Wireless
Sensor Networks – Introduction - Operating System Design Issues -
Examples of Operating Systems – TinyOS – Mate – MagnetOS –
Unit – IV MANTIS - OSPM - EYES OS – SenOS – EMERALDS – PicOS – 8
Introduction to Tiny OS – NesC – Interfaces and Modules-
Configurations and Wiring - Generic Components -Programming in
Tiny OS using NesC, Emulator TOSSIM
Applications of WSN: Current Trends in WSN, Future scope of
WSN in Various Field like IOT, Machine Learning. WSN
Applications - Home Control - Building Automation - Industrial
Automation - Medical Applications - Reconfigurable Sensor
Unit – V Networks - Highway Monitoring - Military Applications - Civil and 9
Environmental Engineering Applications - Wildfire Instrumentation
- Habitat Monitoring - Nanoscopic Sensor Applications – Case
Study: IEEE 802.15.4 LR-WPANs Standard - Target detection and
tracking - Contour/edge detection - Field sampling
Total 45
TEXT BOOKS
1.Kazem Sohraby, Daniel Minoli and TaiebZnati, “ Wireless Sensor Networks Technology,
Protocols, and Applications“, John Wiley & Sons, 2007.
2.Holger Karl and Andreas Willig, “Protocols and Architectures for Wireless Sensor Networks”,
John Wiley & Sons, Ltd, 2005.
REFERENCE BOOKS
1.K. Akkaya and M. Younis, “A survey of routing protocols in wireless sensor networks”,
Elsevier Ad Hoc Network Journal, Vol. 3, no. 3, pp. 325--349
2.Philip Levis, “ TinyOS Programming”
3.Anna Ha´c, “Wireless Sensor Network Designs”, John Wiley & Sons Ltd,
1. Subject Code: TDM 881 Course Title: Disaster Management
3. Semester: VIII
4. Pre-requisite: None
1- Study and investigate the various types of Hazards and disasters and create
awareness in the community to effectively prevent and react to such incidents.
2- Investigate and analyze hazards, disasters and measure their interrelationships with
the developing humanitarian activities for solving future disaster problems.
3- To study, analyze and build skills to respond to disasters and hazards with community
participation for controlling climate change.
4- To develop skills by training disaster forces and communities for successful Disaster
Risk Reduction.
5- Understand the Disaster Management Laws and Policies and effectively apply for
prevention and building the Disaster management system.
6- Building robust reaction and response systems by Technological innovations and skill
building.
Contact
UNIT CONTENTS
Hrs
Introduction, Definitions and Classification:
Concepts and definitions - Disaster, Hazard, Vulnerability, Resilience, Risks

Natural disasters : Cloud bursts, earth quakes, Tsunami, snow, avalanches,
landslides, forest fires,diversion of river routes (ex. Kosi river), Floods,
Droughts Cyclones, volcanic hazards/ disasters(Mud volcanoes): causes and
Unit – I distribution, hazardous effects and environmental impacts of naturaldisasters, 9
mitigation measures, natural disaster prune areas in India, major natural
disasters in
India with special reference to Uttarakhand.Man-induced disasters: water
logging, subsidence, ground water depletion, soil erosion,, release
of toxic gases and hazardous chemicals into environment , nuclear explosions
Unit – II Inter-relationship between Disasters and Development 8
Factors affecting vulnerabilities, differential impacts, impacts of development

projects such asdams, embankments, changes in land use etc. climate
change adaption, relevance of indigenous knowledge, appropriate technology
and local resources, sustainable development and its role in disaster
mitigation, roles and responsibilities of community, panchayat raj
institutions/urban local bodies, state, centre and other stake holders in disaster
mitigation.
Disaster Management (Pre-disasterstage, Emergency stage and Post

Disaster Stage)
1. Pre-disaster stage (preparedness): Preparing hazard zonation maps,

predictably/forecastingand warning, preparing disaster preparedness plans,
land use zoning, preparedness through information, education and
communication (IEC), disaster resistant house construction, population
Unit – III reduction in vulnerable areas, awareness 9
2. Emergency Stage: Rescue training for search & operation at national &
regional level,immediate relief, assessment surveys
3. Post Disaster stage: Rehabilitation and reconstruction of disaster affected
areas; urban disaster mitigation: Political and administrative aspects, social
aspects, economic aspects, environmental aspects.
Disaster Management Laws and Policies in India
Environmental legislations related to disaster management in India: Disaster

Management Act,2005; Environmental policies & programs in India-
Unit – IV Institutions &nationalcenters for natural disaster mitigation: National Disaster 8
Management Authority (NDMA):structure and functional responsibilities,
National Disaster Response Force (NDRF): Rule andresponsibilities, National
Institute Of Disaster Management (NlDM): Rule and responsibilities.
Total 34
.
Text Books:
 M MSulphey,” Disaster Management”, PHI, 2016

1. Subject Code: TCS 821 Course Title: Soft Computing
3. Semester: VIII
4. Pre-requisite: Good Knowledge of Artificial intelligence
1. Summarize about soft computing techniques and their applications

2. Analyze various neural network architectures
3. Design perceptrons and counter propagation networks.
4. Classify the fuzzy systems
5. Analyze the genetic algorithms and their applications.
6. Compose the fuzzy rules.
Contact
UNIT CONTENTS
Hrs
Fundamentals of ANN: The Biological Neural Network, Artificial Neural
Networks -Building Blocks of ANN and ANN terminologies: architecture,
Unit – I 9
setting of weights,activation functions - McCulloch-pitts Neuron Model,
Hebbian Learning rule, Perceptionlearning rule, Delta learning rule.
Models of ANN: Single layer perception, Architecture, Algorithm,
application procedure- Feedback Networks: Hopfield Net and BAM - Feed
Unit – II 8
Forward Networks: BackPropogation Network (BPN) and Radial Basis
Function Network (RBFN) – SelfOrganizing Feature Maps: SOM and LVQ
Fuzzy Sets, properties and operations - Fuzzy relations, cardinality,
Unit – III 9
operations andproperties of fuzzy relations, fuzzy composition.
Fuzzy variables - Types of membership functions - fuzzy rules: Takagi and
Unit – IV Mamdani –fuzzy inference systems: fuzzification, inference, rulebase, 9
defuzzification.
Genetic Algorithm (GA): Biological terminology – elements of GA:
encoding, types ofselection, types of crossover, mutation, reinsertion – a
Unit – V 9
simple genetic algorithm –Theoretical foundation: schema, fundamental
theorem of GA, building block hypothesis.
Total 44
TEXT BOOKS :
 S. N. Sivanandam, S. Sumathi, S.N. Deepa, “Introduction to Neural Networks using
MATLAB 6.0 “, Tata McGraw-Hill, New Delhi, 2006
 S. N. Sivanandam, S.N. Deepa, “Principles of Soft Computing”, Wiley-India, 2008.
 D.E. Goldberg, “Genetic algorithms, optimization and machine learning”, Addison
Wesley 2000.
REFERENCE BOOKS :
 Satish Kumar,” Neural Networks – A Classroom approach”, Tata McGraw-Hill, New
Delhi, 2007.
 Martin T. Hagan, Howard B. Demuth, Mark Beale, “Neural Network Design”, Thomson
Learning, India, 2002.
 B. Kosko,” Neural Network and fuzzy systems”, PHI, 1996.
 Klir& Yuan, “Fuzzy sets and fuzzy logic – theory and applications”, PHI, 1996.
 Melanie Mitchell, “An introduction to genetic algorithm”, PHI, India, 1996.
1. Subject Code: TCS 822 Course Title: Mobile Applications

Development
3. Semester: VIII
4. Pre-requisite: Excellent Knowledge of JAVA programming and Database Management

System
1. Identify and apply the key technological principles and methods for delivering and
maintaining mobile applications,
2. Evaluate and contrast requirements for mobile platforms to establish appropriate
strategies for development and deployment,
3. Develop and apply current standard-compliant scripting/programming techniques for the
successful deployment of mobile applications targeting a variety of platforms,
4. Carry out appropriate formative and summative evaluation and testingutilising a range of
mobile platforms,
5. Interpret a scenario, plan, design and develop a prototype hybrid and native mobile
application,
6. Investigate the leading edge developments in mobile application development and use
these to inform the design process.
Contact
UNIT CONTENTS
Hrs
Getting started with Mobility
Mobility landscape, Mobile platforms, Mobile apps development, Overview
Unit – I of Android platform, setting up the mobile app development environment 9
along with an emulator, a case study on Mobile app development
Building blocks of mobile apps

App user interface designing – mobile UI resources (Layout, UI elements,
Draw-able, Menu), Activity- states and life cycle, interaction amongst
activities.
App functionality beyond user interface - Threads, Async task, Services –
Unit – II 8
states and life cycle, Notifications, Broadcast receivers, Telephony and
SMS APIs
Native data handling – on-device file I/O, shared preferences, mobile
databases such as SQLite, and enterprise data access (via
Internet/Intranet)
Unit – III Sprucing up mobile apps 9
Graphics and animation – custom views, canvas, animation APIs,
multimedia – audio/video playback and record, location awareness, and
native hardware access (sensors such as accelerometer and gyroscope)
Testing mobile apps
Debugging mobile apps, White box testing, Black box testing, and test
Unit – IV 9
automation of mobile apps, JUnit for Android, Robotium, MonkeyTalk
Taking apps to Market

Versioning, signing and packaging mobile apps, distributing apps on
Unit – V 8
mobile market place
Total 43
1. Jeff McWherter, Scott Gowell, “Professional Mobile Application Development”,Wrox Publication.

2. “Mobile Application Development “Black Book, Dreamtech Press
1. Subject Code: TCS 823 Course Title: Multimedia Systems and

Data Compression
3. Semester: VIII
4. Pre-requisite: Excellent knowledge of Computer Network and Communication
1. Demonstrate the basic concept of multimedia information representation. Delve into the
requirement of multimedia communication in today’s digital world.
2. Compare circuit mode and packet mode.Explain QoS and its applications.
3. Summarize the various multimedia information representations.
4. Compute Arithmetic, Huffman, Lempel –Ziv and Lempel–Ziv Welsh coding. Summarize
Joint Photographic Expert Group (JPEG).
5. Differentiate between the audio compression techniques: PCM, DPCM, ADPCM, LPC,
CELPC and MPEG. Differentiate MPEG1, MPEG2 and MPEG4.
6. Construct Haptic Interfaces and Virtual reality Systems
Contact
UNIT CONTENTS
Hrs
Introduction to Multimedia Presentation and Production, Multisensory
Perception,
Digital Representation of Data: Why it is required, Analog to Digital
Conversion and Digital to Analog Conversion, Nyquist’s Theorem, Relation
Unit – I between Sampling Rate and Bit Depth, Quantization Error, Fourier 10
Representation, Pulse Modulation
Describing Multimedia Presentations: SMIL
Text: Typeface, Fonts; Tracking, Kerning, Spacing; Optical Character
Recognition; Unicode Standard; Text to Voice
Data Compression: Approaches to compression, Basic Techniques: Run-
Length Encoding ; Statistical Methods: Information Theory Concepts,
Variable-Size codes, Shanon-Fano coding, Huffman coding, Adaptive
Unit – II 9
Huffman Coding, Arithmetic Coding; Dictionary Methods: LZ77(Sliding
Window), LZ78, LZW; Various LZ Applications, Deflate: zip and Gzip,
LZMA and 7-zip.
Image types, how we see color, Vector and Bitmap, Color Models: RGB,
CMYK, Lab, HSL, HSB/HSV, YUV, conversion between different color
models; Basic steps of image processing, Scanner, Digital Camera,
Gamma Correction, General Study of the following image formats:
Unit – III 9
BMP,TIF,PNG,GIF,SVG
Image Compression: Approaches, Image Transforms, The Discrete
Cosine Transform, Detailed study of JPEG,JPEG-LS, Progressive image
compression, JBIG
Acoustics and the Nature of Sound Waves, Fundamental Characteristics
of Sound, Musical Note, Pitch, Beat, Rhythm, Melody, Harmony and
Tempo; Elements of Audio Systems, General study of Microphone,
Amplifier, Loudspeaker, Mixer; Digital Audio, Synthesizers, MIDI, MIDI
Connections, MIDI messages, Staff Notation, Sound Card, Audio Codecs:
AIFF, WAV, Apple Lossless, Dolby TrueHD, DTS-HD Master Audio,
Unit – IV FLAC, WMA, Audio Playing Software, Audio Recording using Dolby, Dolby 9
Digital and Dolby Digital Surround EX, Voice Recognition
Video: Analog Video, Transmission of Video Signals, Chroma Sub
sampling, Composite and Components Video, NTSC, PAL and SECAM,
Digital Video, High Definition TV, Video Recording Formats; Video
Compression, MPEG, MPEG-4; General Study of the following formats
and codecs: avi, flv, m4v
Multimedia Messaging Service(MMS): MMS standard, MMS Architecture,
An Engineering perspective on How a MMS is created, sent and retrieved
Unit – V Introduction to Virtual Reality: Components of a VR System, Haptic 8
Interfaces, Virtual Reality Programming, Impact of Virtual Reality, Case
study of Second Life
Total 45

1. Ranjan Parekh, “Principles of Multimedia”, McGraw Hill, 2006
2. David Salomon, “Data Compression: The Complete Reference”, Fourth Edition, Springer
Books
3. GrigoreBurdea, Philippe Coiffet, “Virtual reality technology, Volume 1”, Wiley, 2003
1. Subject Code: TCS 824 Course Title: Computer Graphics
3. Semester: VIII
4. Pre-requisite: Excellent knowledge of mathematics
Understand the structure of modern computer graphics systems

1.
Understand the basic principles of implementing computer graphics primitives
2.
Familiarity with key algorithms for modeling and rendering graphical data
3.
Develop, design and problem solving skills with application to computer graphics
4.
Gain experience in constructing interactive computer graphics programs using OpenGL
5.
6. Assess the two dimensional viewing
Contact
UNIT CONTENTS
Hrs
Introduction: What is Computer Graphics and what are the applications,
Graphics Systems: Video Display Devices, Raster Scan and Random
Scan Displays, Flat Panel Displays, Three-Dimensional Viewing Devices;
Video Controller, Input Devices, Graphics on the Internet, Graphics
Unit – I Software, Coordinate Representations 11
Introduction to OpenGL, Basic OpenGL syntax, Related Libraries, Header
Files, Display-Window Management using GLUT, A complete OpenGL
program
Geometric Transformations: Two Dimensional Translation, Rotation and

Scaling, Matrix Representations and Homogeneous Coordinates, Inverse
Transformations, Composite Transformations, Reflection, Shear, Raster
Methods for Geometric Transformations, Geometric Transformations in
three-dimensional space, Affine Transformations, OpenGL Geometric-
transformation programming examples
Unit – II 10
Two Dimensional Viewing: Viewing Pipeline, The Clipping Window,
Normalization and Viewport Transformations, Clipping Algorithms: Cohen-
Sutherland Line Clipping, Liang-Barsky Line Clipping; Line clipping against
non rectangular clip windows; Polygon Clipping: Sutherland-Hodgman,
Weiler-Atherton; Curve Clipping, Text Clipping
Unit – III Three Dimensional viewing, Transformations from world to viewing 9

coordinates, 3-D clipping
Three-Dimensional Object Representations: Polyhedra, Curved and
Quadric surfaces, Blobby Objects, Spline Representations, Bezier Spline
curves, Bezier Surfaces, B-Spline curves, B-Spline Surfaces, Octrees,
Introduction to fractals
Visible Surface Detection Methods: Classification, Back-Face Detection,

Depth-Buffer method, A-buffer method, Scan-Line method, Curved
Surfaces
Illumination Models and Surface Rendering Methods: Basic Illumination
Unit – IV 10
models- Ambient light, Diffuse Reflection, Specular Reflection and the
Phong model; Polygon Rendering Methods: Gouraud Surface Rendering,
Phong Surface Rendering; Ray Tracing, Texture Mapping
Total 40
Text Book:
1. Computer Graphics with OpenGL by Donald Hearn and M. Pauline Baker, Third Edition,
2004, Pearson
Reference Books:
1. J.D. Foley, A. Dam, S.K. Feiner, Graphics Principle and Practice , Addison Wesley
2. Rogers, “ Procedural Elements of Computer Graphics”, McGraw Hill
3. Steven Harrington, “Computer Graphics: A Programming Approach” , TMH
4. Edward Angel, Interactive Computer Graphics – A Top Down Approach with OpenGL
1. Subject Code: TCS 826 Course Title: Unix Systems Programming
3. Semester: VIII
4. Pre-requisite: Excellent Knowledge of Operating Systems and C- programming
1. Experiment with various system calls

2. Compare between ANSI C AND C++ AND POSIX standards
3. Mapping the relationship between UNIX Kernel support for files
4. Use Kernel support for process creation and termination and memory allocation
5. Analyze Process Accounting process UID ,Terminal logins, network logins
6. Analyze process control,Deamon characteristics, coding rules and error logging
Contact
UNIT CONTENTS
Hrs
Introduction to System Programming, File I/O, Difference between
Buffered and Unbuffered I/O, I/O system calls: open(), close(), read(),
write(), Effect of I/O buffering in stdio and the kernel; synchronized I/O,
Unit – I Seeking to a file offset: lseek(), File control: fcntl(), Locking, Open file 9
status flags, Open files and file descriptors, Duplicating file descriptors
with dup, dup2 and fcntl. A brief recap of Buffered I/O, Forays into
Advanced I/O
Processes: Process ID and Parent process ID, Memory layout, Running
and Terminating a process, Waiting for Terminated child processes (fork,
the exec family, wait, waitpid), copy on write, Advanced Process
Unit – II Management: Process Priorities, nice(), Setting the scheduling policy 10
Processes and Inter-Process Communication: Introduction, pipes, FIFOs,

Unit – III 9
XSI IPC: Message Queues, Semaphores, Shared Memory
Signals: Signal types and default actions, Basic Signal management,
signal function, unreliable signals, SIGCLD, Sending signals, Signal sets,
Unit – IV 8
Blocking signals (the signal mask), Interruption and restarting of system
calls, Designing signal handlers
Network Programming: Sockets, Operation, Socket types, Client/Server
Models, Connection Based Services, Handling Out of Band Data,
Unit – V 9
Connectionless Services, Design issues of Concurrent and iterative
servers, Socket options
Total 45
1. Richard Stevens and Stephen Rago,” Advanced Programming in the Unix Environment”,
Addison-Wesley
2. Michael Kerrisk,” The Linux Programming Interface”, No Starch Press
1. Subject Code: TCS 851 Course Title: Storage Networks
3. Semester: VIII
4. Pre-requisite: Knowledge of Database and Networking is required
1. Understand the different aspects of storage management

2. Describe the various applications of RAID
3. Compare and contrast the I/O Techniques
4. Categorize virtualization on various levels of storage network
5. Estimate the various requirements of storage management systems
6. Design a complete data center and enhance employability in this field
Contact
UNIT CONTENTS
Hrs
Introduction to Storage Technology
Introduction to storage network, Five pillars of IT, parameters related with
storage, data proliferation, problem caused by data proliferation,
Hierarchical storage management, Information life cycle management
Unit – I 10
(ILM), Role of ILM, Information value vs. time mapping, Evolution of
storage, Storage infrastructure component, basic storage management
skills and activities, Introduction to Datacenters, Technical & Physical
components for building datacenters
Technologies for Storage network
Server centric IT architecture & its limitations, Storage centric IT
architecture & advantages, replacing a server with storage networks, Disk
subsystems, Architecture of disk subsystem, Hard disks and Internal I/O
channel, JBOD, RAID& RAID levels, RAID parity, comparison of RAID
Unit – II 9
levels, Hot sparing, Hot swapping, Caching : acceleration of hard disk
access, Intelligent Disk subsystem architecture
Tape drives: Introduction to tape drives, Tape media, caring for Tape&
Tape heads, Tape drive performance, Linear tape technology, Helical
scan tape technology
Unit – III I/O techniques 10
I/O path from CPU to storage systems, SCSI technology – basics &
protocol, SCSI and storage networks, Limitations of SCSI
Fibre channel: Fibre channel, characteristic of fibre channel, serial data
transfer vs. parallel data transfer, Fibre channel protocol stack, Links,
ports & topologies, Data transport in fibre channel,
Addressing in fibre channel, Designing of FC-SAN, components,
Interoperability of FCSAN, FC products
IP Storage: IP storage standards (iSCSI, iFCP, FCIP, iSNS), IPSAN
products, Security in IP SAN, introduction to InfiniBand, Architecture of
InfiniBand
NAS – Evolution, elements & connectivity, NAS architecture
Storage Virtualization
Introduction to storage virtualization, products, definition, core concepts,
Unit – IV virtualization on various levels of storage network, advantages and 9
disadvantages, Symmetric and asymmetric virtualization, performance of
San virtualization, Scaling storage with virtualization
Management of storage Networks
Management of storage network, SNMP protocol, requirements of
Unit – V management systems, Management interfaces, Standardized and 8
proprietary mechanism, In-band& Out-band management, Backup and
Recovery
Total 46

1. "Storage Networks: The Complete Reference", R. Spalding, McGraw-Hill
2. "Storage Networking Fundamentals: An Introduction to Storage Devices, Subsystems,
Applications, Management, and Filing Systems", Marc Farley, Cisco Press.
3. "Designing Storage Area Networks: A Practical Reference for Implementing Fibre
Channel and IP SANs, Second Edition", Tom Clark Addison Wesley
1. Subject Code: TCS 852 Course Title: Pattern Recognition
3. Semester: VIII
4. Pre-requisite: Knowledge of Probability theory, mathematics and algorithms is required
1. Explain and compare a variety of pattern classification, structural pattern recognition,

and pattern classifier combination techniques.
2. Summarize, analyze, and relate research in the pattern recognition area verbally and in
writing.
3. Apply performance evaluation methods for pattern recognition, and critique
comparisons of techniques made in the research literature.
4. Apply pattern recognition techniques to real-world problems such as document analysis
and recognition.
5. Implement simple pattern classifiers, classifier combinations, and structural pattern
recognizers.
6. Describe the various clustering methods
Contact
UNIT CONTENTS
Hrs
Introduction : Machine perception, pattern recognition example, pattern
recognition systems, the design cycle, learning and adaptation
Unit – I Bayesian Decision Theory : Introduction, continuous features – two 10
categories classifications, minimum error-rate classification- zero–one loss
function, classifiers, discriminant functions, and decision surfaces
Normal density : Univariate and multivariate density, discriminant functions
for the normal densitydifferent cases, Bayes decision theory – discrete
features, compound Bayesian decision theory and context
Unit – II 9
Maximum likelihood and Bayesian parameter estimation : Introduction,
maximum likelihood estimation, Bayesian estimation, Bayesian parameter
estimation–Gaussian
Un-supervised learning and clustering : Introduction, mixture densities and
identifiability, maximum likelihood estimates, application to normal
mixtures, K-means clustering. Date description and clustering – similarity
Unit – III measures, criteria function for clustering 10
Component analyses : Principal component analysis, non-linear
component analysis; Low dimensional representations and multi
dimensional scaling
Discrete Hidden MorkovModels : Introduction, Discrete–time markov
Unit – IV process, extensions to hidden Markov models, three basic problems for 9
HMMs.
Continuous hidden Markov models : Observation densities, training and
Unit – V 8
testing with continuous HMMs, types of HMMs
Total 46
Text/ ReferenceBooks :
1. Richard O. Duda, Peter E. Hart, David G. Stroke. Wiley,“Pattern classifications”,
student edition, Second Edition.
2. LawerenceRabiner,“Fundamentals of speech Recognition”, Biing – Hwang
Juang Pearson education.
1. Subject Code: TCS 855 Course Title: Agile Software

Engineering
3. Semester: VIII
1. Describe two or more agile software development methodologies.

2. Identify the benefits and pitfalls of transitioning to agile.
3. Compare agile software development to traditional software development models.
4. Apply agile practices such as test-driven development, standup meetings, and pair
programming to their software engineering practices.
5. Apply the agile testing
6. Describe the agile in current market scenario.
Contact
UNIT CONTENTS
Hrs
Fundamentals of Agile:
The Genesis of Agile, Introduction and background, Agile Manifesto
and Principles, Overview of Agile Methodologies – Scrum
methodology, Extreme Programming, Feature Driven development,
Unit – I 10
Design and development practices in an Agile projects, Test Driven
Development, Continuous Integration, Refactoring, Pair
Programming, Simple Design, User Stories, Agile Testing, Agile
Tools
Agile Project Management:
Agile Scrum Methodology, Project phases, Agile Estimation,
Planning game, Product backlog, Sprint backlog, Iteration planning,
User story definition, Characteristics and content of user stories,
Unit – II 10
Acceptance tests and Verifying stories, Agile project velocity, Burn
down chart, Sprint planning and retrospective, Daily scrum, Scrum
roles – Product Owner, Scrum Master, Scrum Developer, Scrum
case study, Tools for Agile project management
Unit – III Agile Software Design and Programming: 9
Agile Design Principles with UML examples, Single Responsibility
Principle, Open Closed Principle, Liskov Substitution Principle, Interface
Segregation Principles, Dependency Inversion Principle, Need and
significance of Refactoring, Refactoring Techniques, Continuous
Integration, Automated build tools, Version control, Test-Driven
Development (TDD), xUnit framework and tools for TDD
Agile Testing:
The Agile lifecycle and its impact on testing, Testing user stories -
Unit – IV acceptance tests and scenarios, Planning and managing Agile testing, 9
Exploratory testing, Risk based testing, Regression tests, Test
Automation, Tools to support the Agile tester
Agile in Market:
Market scenario and adoption of Agile, Roles in an Agile project, Agile
applicability, Agile in Distributed teams, Business benefits, Challenges in
Unit – V 8
Agile, Risks and Mitigation, Agile projects on Cloud, Balancing Agility with
Discipline, Agile rapid development technologies
Total 46
Text Book:
1. Ken Schawber, Mike Beedle, “Agile Software Development with Scrum”,
Pearson, 2008
1. Subject Code: TCS857 Course Title: Game Theory
3. Semester: VIII
4. Pre-requisite: Excellent knowledge of programming and mathematics
1. Identify strategic situations and represent them as games

2. Find dominant strategy equilibrium, pure and mixed strategy Nash equilibrium,
3. Solve simple games using various techniques
4. Analyze economic situations using game theoretic techniques
5. Recommend and prescribe which strategies to implement
6. Find the needs of extensive games.
Contact
UNIT CONTENTS
Hrs
Introduction, Strategic Games: What is game theory? The theory of
rational choice; Interacting decision makers.
Strategic games; Examples: The prisoner’s dilemma, Bach or Stravinsky,
Matching pennies; Nash equilibrium; Examples of Nash equilibrium;
Best-response functions; Dominated actions; Equilibrium in a single
population: symmetric games and symmetric equilibria.
Unit – I 11
Mixed Strategy Equilibrium: Introduction; Strategic games in which
players may randomize; Mixed strategy Nash equilibrium; Dominated
actions; Pure equilibria when randomization is allowed, Illustration: Expert
Diagnosis; Equilibrium in a single population, Illustration: Reporting a
crime; The formation of players’ beliefs; Extensions; Representing
preferences by expected payoffs
Extensive Games: Extensive games with perfect information; Strategies
and outcomes; Nash equilibrium; Subgame perfect equilibrium; Finding
subgame perfect equilibria of finite horizon games: Backward induction.
Illustrations: The ultimatum game, Stackelberg’s model of duopoly, Buying
votes.
Unit – II 10
Extensive games: Extensions and Discussions: Extensions: Allowing
for simultaneous moves, Illustrations: Entry in to a monopolized industry,
Electoral competition with strategic voters, Committee decision making,
Exit from a declining industry; Allowing for exogenous uncertainty,
Discussion: subgame perfect equilibrium and backward induction
Unit – III Bayesian Games, Extensive Games with Imperfect Information: 10
Motivational examples; General definitions; Two examples concerning
information; Illustrations: Cournot’s duopoly game with imperfect
information, Providing a public good, Auctions; Auctions with an arbitrary
distribution of valuations.
Extensive games with imperfect information; Strategies; Nash equilibrium;
Beliefs and sequential equilibrium; Signaling games; Illustration: Strategic
information transmission.
Strictly Competitive Games, Evolutionary Equilibrium: Strictly

competitive games and maximization; Maximization and Nash equilibrium;
Strictly competitive games; Maximization and Nash equilibrium in strictly
competitive games.
Evolutionary Equilibrium: Monomorphic pure strategy equilibrium; Mixed
strategies and polymorphic equilibrium; Asymmetric contests; Variations
on themes: Sibling behavior, Nesting behavior of wasps, The evolution of
sex ratio
Iterated Games: Repeated games: The main idea; Preferences;
Repeated games; Finitely and infinitely repeated Prisoner’s dilemma;
Unit – IV Strategies in an infinitely repeated Prisoner’s dilemma; Some Nash 8
equilibria of an infinitely repeated Prisoner’s dilemma, Nash equilibrium
payoffs of an infinitely repeated Prisoner’s dilemma
Coalitional Games and Bargaining: Coalitional games. The Core.
Illustrations: Ownership and distribution of wealth, Exchanging
Unit – V homogeneous items, Exchanging heterogeneous items, Voting, Matching. 8
Bargaining as an extensive game; Illustration of trade in a market; Nash's
axiomatic model of bargaining
Total 47
Text Books:
1. Martin Osborne: “An Introduction to Game Theory”, Oxford University Press, Indian
Edition, 2004.
Reference Books:
1. Roger B. Myerson: “Game Theory: Analysis of Conflict”, Harvard University Press, 1997.
1. Subject Code: TCS844 Course Title: Bio computation

3. Semester: VIII
4. Pre-requisite: Basic Knowledge of Statistics, Design and Analysis of Algorithms
1. Understand the basic concepts of Bioinformatics and its significance in

Biological data analysis.
2. Illustrate of sequence alignment and analysis.
3. Use computational methods, tools and algorithms employed for Biological
Data Interpretation.
4. Apply probabilistic model to determine important patterns.
5. Analyze and develop models for better interpretation of biological data to extract
knowledge.
6. Implement complex problem as a collection of sub problems by applying modularization
in applications using functions.
Contact
UNIT CONTENTS
Hrs
DNA Computing: DNA Structure, and Processing , Computational
operations and Step involve in DNA computing, Bio-soft
Computing Based on DNA Length, Beginnings of Molecular
Unit – I
Computing- Adelman Experiment. RNA secondary structure 8
prediction: Base pair maximisation and the Nussinov folding
algorithm, Energy minimisation and the Zuker folding algorithm,
Design of covariance models, Application of RNA fold.
Unit - II Genetic Algorithm:- Basic Concepts, Reproduction, Cross over,
Mutation, Fitness Value, Optimization using GAs; Applications of 10
GA in bioinformatics.
Hidden Markov Model: Markov processes and Markov Models,
Hidden Markov Models. Forward and Backward Algorithms, Most
Unit – III
probable state path: Viterbi algorithm, Parameter Estimation for
8
HMMs:-Baum-Welch Algorithm, EM Algorithm, Applications of
profile HMMs for multiple alignment of proteins and for finding
genes in the DNA.
Unit – IV Support Vector Machines: Introduction, hyperplane separation 10
(maximum and soft margin hyperplanes), linear classifier, Kernel
functions, Large Margin Classification, Optimization problem with
SVM, Applications of SVM in bioinformatics. Bayesian network:
Bayes Theorem, Inference and learning of Bayesian network, BN
and Other Probabilistic Models.
Artificial Neural Network: Historic evolution – Perceptron,
characteristics of neural networks terminology, models of neuron
Mc Culloch – Pitts model, Perceptron, Adaline model, Basic
Unit – V
learning laws, Topology of neural network architecture, single layer 7
ANN, multilayer perceptron, back propagation learning, input -
hidden and output layer computation, back propagation algorithm,
Applications of ANN
Total 43
Text Books:
1. Biological sequence analysis: Probabilistic models of proteins and nucleic acids by Richard Durbin,
Eddy, Anders Krogh, 1998
2. An introduction to bioinformatics algorithms by Neil C. Jones, Pavel Pevzner. MIT Press.2004
3. Algorithms for Molecular Biology by Ron Shamir Lecture, Fall Semester, 2001
4. Neural Networks: A Systematic Introduction by Raul Rojas. Springer. 1996
5. DNA Computing: New Computing Paradigms By Gheorghe Paun, Grzegorz Rozenberg, ArtoSalomaa.
Reference Books:
1. Bioinformatics: the machine learning approach by Pierre Baldi, SørenBrunak. MIT Press.2001
1. Subject Code: TCS-845 Course Title: Advance

Computer Vision
3. Semester: VIII
4. Pre-requisite: Basic Knowledge of Mathematics
1. Recognize and describe both the theoretical and practical aspects of computing with
images. Connect issues from Computer Vision to Human Vision.
2. Understand extraction of features from given image.
3. Understand concept of motion analysis and video processing.
4. Understand fundamental concept of Augmented reality and virtual reality.
5. Analyze a wide range of problems and provide solutions related to the design of
computer vision based systems through suitable algorithms, structures, diagrams, and
other appropriate methods.
6. Build computer vision applications.
Contact
UNIT CONTENTS
Hrs
Introduction : Image Processing, Computer Vision and Computer
Graphics , What is Computer Vision - Low-level, Mid-level, High-
level , Overview of Diverse Computer Vision Applications:
Unit – I
Document Image Analysis, Biometrics, Object Recognition, 8
Tracking, Medical Image Analysis, Content-Based Image Retrieval,
Video Data Processing, Multimedia, Virtual Reality and Augmented
Reality
Feature Extraction: Edges detection; Line detectors (Hough
Unit – II
Transform), SIFT, SURF, HOG, Gaussian derivative filters, Gabor 10
Filters and DWT.
Background subtraction, Spatio-Temporal Analysis, KLT, Optical
Unit – III flow: Optical flow computation, Global and local optical flow
10
estimation, Optical flow in motion analysis, Analysis based on
correspondence of interest points: Detection of interest points.
Augmented and Mixed Reality, Taxonomy, technology and features
Unit – IV of augmented reality, difference between AR and VR, Challenges
8
with AR, AR systems and functionality, Augmented reality methods,
visualization techniques for augmented reality.
Unit – V Case studies: Automatic activity recognition system and usage in 7
various applications, Importance of computer vision in Smart City
Development, Deep learning in computer vision.
Total 43
Text Books:
Computer Vision: Algorithms and Applications, Richard Szeliski, 2010.
Reference Books:
Computer Vision: A Modern Approach, D. Forsyth and J. Ponce, 2010
Deep Learning: Algorithms and Applications, I. Goodfellow, Y. Bengio and A. Courville, 2017.
Alan B. Craig, Understanding Augmented Reality, Concepts and Applications, Morgan Kaufmann, 2013.
E. R. Davies, Computer & Machine Vision, Fourth Edition, Academic Press, 2012
1. Subject Code: TCS 846 Course Title: Internet of Things

3. Semester: VIII
4. Pre-requisite: Fundamentals of Computer System, TCS301
1. Explain the terms used in IoT and its architecture.

2. Describe the key technologies of IoT and IoT objects.
3. Use the RFID technologies in IoT applications.
4. Interpret the data transmission and security challenges.
5. Identify and manage the resources used in IoT.
6. Identify the security requirements of basic IoT applications.
Contact
UNIT CONTENTS
Hrs
INTRODUCTION
Introduction to Internet of Things: History of IoT, About IoT, Overview and
Unit – I Motivations, Examples of Applications, Internet of Things Definitions and 8
Frameworks: IoT Definitions, IoT Architecture, General Observations, ITU-
T Views, Working Definition, IoT Frameworks, Basic Nodal Capabilities.
FUNDAMENTAL IoT MECHANISMS AND KEY TECHNOLOGIES
Identification of IoT Objects and Services, Structural Aspects of the IoT,
Environment Characteristics, Traffic Characteristics, Scalability,
Unit – II Interoperability, Security and Privacy, Open Architecture, Key IoT 10
Technologies, Device Intelligence, Communication Capabilities, Mobility
Support, Device Power, Sensor Technology, RFID Technology, Satellite
Technology.
RADIO FREQUENCY IDENTIFICATION TECHNOLOGY
RFID: Introduction, Principle of RFID, Components of an RFID system,
Issues EPCGlobal Architecture Framework: EPCIS & ONS, Design issues,
Technological challenges, Security challenges, IP for IoT, Web of Things.
Unit – III Wireless Sensor Networks: History and context, WSN Architecture, the 10
node, Connecting nodes, Networking Nodes, Securing Communication
WSN specific IoT applications, challenges: Security, QoS, Configuration,
Various integration approaches, Data link layer protocols, routing protocols
and infrastructure establishment.
RESOURCE MANAGEMENT IN THE INTERNET OF THINGS
Clustering, Software Agents, Clustering Principles in an Internet of Things
Architecture, Design Guidelines, and Software Agents for Object
Representation, Data Synchronization. Identity portrayal, Identity
Unit – IV 10
management, various identity management models: Local, Network,
Federated and global web identity, user-centric identity management,
device centric identity management and hybrid-identity management,
Identity and trust.
INTERNET OF THINGS PRIVACY, SECURITY AND GOVERNANCE
Vulnerabilities of IoT, Security requirements, Threat analysis, Use cases
and misuse cases, IoT security tomography and layered attacker model,
Identity establishment, Access control, Message integrity, Non-repudiation
Unit – V 10
and availability, Security model for IoT.
Internet of Things Application: Smart Metering Advanced Metering
Infrastructure, e-Health Body Area Networks, City Automation, Automotive
Applications, Home Automation, Smart Cards.
Total 48
Text Books
1. Daniel Minoli, “Building the Internet of Things with IPv6 and MIPv6: The Evolving World of
M2M Communications”, ISBN: 978-1-118-47347-4, Willy Publications
2. Bernd Scholz-Reiter, Florian Michahelles, “Architecting the Internet of Things”, ISBN 978-3-
642-19156-5 e-ISBN 978-3-642-19157-2, Springer
3. Parikshit N. Mahalle& Poonam N. Railkar, “Identity Management for Internet of Things”, River
Publishers, ISBN: 978-87-93102-90-3 (Hard Copy), 978-87-93102-91-0 (ebook).
Reference Books
1. HakimaChaouchi, “The Internet of Things Connecting Objects to the Web” ISBN : 978-1-
84821-140-7, Willy Publications
2. Olivier Hersent, David Boswarthick, Omar Elloumi, The Internet of Things: Key Applications
and Protocols, ISBN: 978-1-119-99435-0, 2 nd Edition, Willy Publications
3. Daniel Kellmereit, Daniel Obodovski, “The Silent Intelligence: The Internet of Things”,.
Publisher: Lightning Source Inc; 1 edition (15 April 2014). ISBN-10: 0989973700, ISBN-13: 978-
0989973700.
4. Fang Zhaho, Leonidas Guibas, “Wireless Sensor Network: An information processing

approach”, Elsevier, ISBN: 978-81-8147-642-5.
1. Subject Code: Course Title: Advanced Deep

TOE812
Learning and Image
2. Contact Hours: L: T: P: Processing
- -
3. Semester: VIII
4. Pre-requisite: Basic Knowledge of Mathematics, Any Programming Language
1. Identify the fundamental steps of the Image Processing used to describe features of images.
2. Identify the mathematical foundations for digital manipulation of images
3. Design, code and test digital image processing applications using MATLAB/OPENCV.
4. Analyze a wide range of problems and provide solutions related to the design of image
processing systems through suitable deep learning technique.
5. Analyze the morphological algorithms and classification methods for image processing.
6. Write programs in MATLAB/OPENCV for digital manipulation of images; image acquisition;
preprocessing;

Contact
UNIT CONTENTS
Hrs
Fundamentals of Image processing and Image Transforms: Basic steps of Image
processing system, sampling and quantization of an Image, Basic relationship
between pixels, Basic operations in Spatial domain: contrast stretching, power
Unit - I
law transformation, bit-plan slicing, arithmetic and logic based operations. 8
Image Transforms: Discrete Fourier Transform, Discrete Cosine Transform (DCT),
Discrete Wavelet transforms. Image processing operations using MATLAB/
OPENCV.
Image Processing Techniques: Image Enhancement: Histogram Processing,
Smoothing filters, Sharpening filters; Image restoration, Image Compression–
Unit - II
coding Redundancy, spatial and temporal redundancy, Compression models
10
Segmentation: Segmentation concepts, point, line and Edge detection,
Thresholding, region based segmentation.
Introduction to Morphology, Some basic Morphological Algorithms,

Unit – III
Representation, Boundary Descriptors, Regional Descriptors, Chain Code,
8
Structural Methods, Image classification: Artificial Neural Network, Decision
Tree, SVM.
Deep learning: Introduction to Deep Learning and Computer Vision , Feed
Unit – IV
Forward Neural Networks,Introduction to CNNs, Optimization for training Deep 10
neural networks, Introduction to DL packages/ Important architectures, CNNs,
Recurrent Neural Networks, Deep Reinforcement Learning.
Applications: Multi focus/multi-modality image fusion using CNN, Image
Unit – V denoising using deep learning, 3D Medical Image Analysis and reconstruction,
7
Anomaly Detection System using deep learning, Image captioning using deep
learning.
Total 43
Text Books:
 R. C. Gonzalez, R. E. Woods. Digital Image Processing. Addison Wesley Longman, Inc., 1992.
 Mark Nixon and Alberto S. Aquado, Feature Extraction & Image Processing for Computer Vision,
Third Edition, Academic Press, 2012.
Reference Books:
 Image Processing, Analysis, and Machine Vision. Sonka, Hlavac, and Boyle. Thomson.
 E. R. Davies, Computer & Machine Vision, Fourth Edition, Academic Press, 2012
 Simon J. D. Prince, Computer Vision: Models, Learning, and Inference, Cambridge University
Press, 2012

Bachelor of Technology: Rtificial Ntelligence AND Achine Earning

Uploaded by

Copyright:

Available Formats

Bachelor of Technology: Rtificial Ntelligence AND Achine Earning

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Bachelor of Technology: Rtificial Ntelligence AND Achine Earning

Uploaded by

Copyright:

Available Formats

BACHELOR OF TECHNOLOGY

ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Minimum Duration : 8 Semesters (4 Years)

Maximum Duration : 12 Semesters (6 Year)

Total Number of Credits : 201 Credits

Course Components Credits

COURSE MODULE TEACHING

TPH101 Engineering Physics BSC 3 3 - - 25 25 50 100

TMA101 Engineering Mathematics-I BSC 4 3 1 - 25 25 50 100

THF101 Healthy Living & Fitness HF 1 1 - - 50 - 50 100

PPH151 Physics Lab BSC 1 - - 2 25 25 50 100

PCS151 Computer Lab-I ESC 2 - - 4 25 25 50 100

SCS-101 MOOCS Seminar SM 1 - - - - - 100 100

GP101 General Proficiency GP 1 - - - - - 100 100

Total 25 16 1 12 275 225 700 1200

COURSE MODULE TEACHING

TCH101 Engineering Chemistry BSC 3 3 - - 25 25 50 100

TEV101 Environmental Science EV 2 2 - - 25 25 50 100

PCH151 Chemistry Lab BSC 1 - - 2 25 25 50 100

Engg. Graphics and

PCS151 Computer Lab - I ESC 2 - - 4 25 25 50 100

GP101 General Proficiency GP 1 - - - - - 100 100

Total 25 17 1 12 250 250 600 1100

B.Tech (Artificial Intelligence and Machine Learning)

COURSE MODULE TEACHING

TPH201 Engineering Physics BSC 3 3 - - 25 25 50 100

PPH251 Physics Lab BSC 1 - - 2 25 25 50 100

PCS251 Computer Lab-II ESC 2 - - 4 25 25 50 100

SCS-201 MOOCS Seminar SM 1 - - - - - 100 100

GP201 General Proficiency GP 1 - - - - - 100 100

Total 25 16 1 12 275 225 700 1200

COURSE MODULE TEACHING

TCH201 Engineering Chemistry BSC 3 3 - - 25 25 50 100

TEV201 Environmental Science EV 2 2 - - 25 25 50 100

PCH251 Chemistry Lab BSC 1 - - 2 25 25 50 100

PCS251 Computer Lab - II ESC 2 - - 4 25 25 50 100

GP201 General Proficiency GP 1 - - - - - 100 100

Total 25 17 1 12 250 250 600 1100

B.Tech (Artificial Intelligence and Machine Learning)

COURSE MODULE TEACHING WEIGHTAGE : EVALUATION

COURSE L T P CWA MSE ESE Total

TCS-301 Logic Design CC 3 3 - - 25 25 50 100

TCS-302 Data Structures with C CC 3 3 - - 25 25 50 100

TCS-307 Object Oriented CC 3 3 - - 25 25 50 100

TCS-372 Mathematics for AI and CC 4 3 - 2 25 25 50 100

TMA-316 Discrete Structures and CC 4 3 1 - 25 25 50 100

PCS-301 Logic Design Lab CC 2 1 - 2 25 25 50 100

PCS-302 Data Structures Lab CC 2 1 - 25 25 50 100

PCS-307 OOPS with C++ Lab CC 2 1 - 2 25 25 50 100

XCS-301 Career Skills HSMC 1 2 - - 25 25 50 100

XCS-310 Career Skills Lab HSMC 1 - - 1 25 25 50 100

SCS-301 MOOCS Seminar SM 1 - - - - - 100 100

GP-301 General Proficiency GP 1 - - - - - 100 100

Total 28 20 1 9 250 250 800 1300

AUDIT COURSE: TOC301 PROBABILITY AND STATISTICS

COURSE MODULE TEACHING WEIGHTAGE:EVALUATION

COURSE L T P C WA MSE ESE Total

TCS-408 Java Programming CC 3 3 - - 25 25 50 100

TCS-402 Finite Automata and CC 4 3 1 - 25 25 50 100