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),
Conditional statements (if statement, if-else statement, ternary
Unit – III statement or ternary operator, nested if-else statement, switch
8
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
Unit – V and 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
 Name of Department:- Computer Science and Engineering

1. Subject Code: IBM101 Course Title: Digital Workforce

Skill
2. Contact Hours: L: 3 T: - P: -
3. Semester: I

4. Pre-requisite: Basic Knowledge of Computer Fundamentals

5. Course Outcomes: After completion of the course students will be able to

1. Explore latest trends in technology

2. Use Javascript and HTML

3. Apply the CSS in web page design

4. Understand the enhancement in HTML5

5. Understand Dom and Wrappers

6. Work on programming example available at W3Cschools

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Brief History of Computing and latest trends in technology, Types of
Programming Languages, Secure Transactions, Evolution of the
Unit - I Internet 10
Introduction to HTML and JavaScript Programming:
Introduction to HTML
Structure of HTML page
What happens when a user clicks a url

Unit - II HTML page structure

10
Simple programming with JavaScript

Styling using CSS

What makes a good web application

Enhancements in HTML5

Unit – III Elements introduced in HTML5 and discontinued from HTML 4

10
Attributes and methods introduced in HTML5
 HTML page structure and DOM
Unit – IV
Data types, Primitives and Wrappers 12

Functions using Javascript

Modifying the contents of a page programmatically

Coding Examples from W3CSchools and IBM courseware

Total 42

Refernce Books:

IBM Courseware
 Name of Department:- Computer Science and Engineering

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

5. Course Outcomes: After completion of the course students will be able to

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
6. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Strings – Declaration of strings, Initialization of strings using arrays
and pointers, Standard library functions of <string.h>header file,
Unit - I Null-terminated strings, Char arrays and pointers, Pointers and
6
Strings, 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,
Dynamic memory management in C - malloc(), calloc(), realloc(),
Unit - II 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(), fprintf()
Unit – III ,fscanf(),fgets(), fputs(),Difference between append and write mode,
8
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.
 Control flow – if, if-elif-else, for, while, break, continue, pass, range(),
nested loops,
Data structures – List, Tuple, Dictionary
Unit-V 10
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Changing Business with

IBM201
Data Insight – Watson
2. Contact Hours: L: T: P: Analytics
3 - -
3. Semester: II

4. Pre-requisite: Basic knowledge of computer programming and components of computer system

5. Course Outcomes: After completion of the course students will be able to

1. Explore powerful visualizations of data in IBM® Cognos Analytics

2. discover patterns and relationships that impact businesses
3. Perform the sorting of data
4. Implement the sorting techniques in data
5. Prepare the data for business
6. Use the dashboard of IBM

6. Details of Syllabus

Contact
UNIT CONTENTS
Hrs
Dashboard Overview: Dashboards, Cognos Analytics dashboards: a
tutorial Scenario for the tutorial
Unit - I Uploading data, Creating a dashboard, What's next in Cognos Analytics?
6
Creating a dashboard, Templates, Changing the template on a tabbed
dashboard

Visualization: Creating a visualization in a dashboard, Exporting a

dashboard to PDF 9, Resetting a dashboard, Creating multilingual
dashboards, Exploring your data, Viewing the underlying data, Changing
the columns or members in a visualization, Selecting columns from a
different data asset, Drilling up and down in your data, Working with a
data point, Relinking data source connections, Resolving ambiguous data
source connections, Zooming in and out, Visualizations, Using a different
visualization type, Highlighting conditionally formatted data with color,
Showing data as points in a visualization, Showing data as sizable points
Unit - II in a visualization, Repeating a visualization by row or column, Setting a
8
timer to automatically refresh a visualization, Adding a title to a
visualization, Limiting data to top or bottom values in a dashboard
visualization, Sharing visualizations, Setting up drill-through, Adding a
drill-through definition, Editing a drill-through definition, Widgets, Adding
text, Adding images and shapes , Adding web pages, Adding video or
audio, Changing web pages, media, and images

Unit – III Filtering Data: Filtering data in one visualization, Highlighting data points
across visualizations 9, Adding a filter widget, Keeping or excluding data 6
points in a visualization, Disconnecting visualizations and filter widgets,
 Filtering data in the current tab, Filtering data in all tabs, Clearing filters,
Removing filters
Sorting Data: Sorting, Sorting in numerical order, Sorting in alphabetical
Unit – IV order, Calculations, Creating column calculations for all visualizations
Using the calculation editor, Formatting, Working with the legend 6
Changing colors, Stories: IBM COGNOS ANALYTICS: DASHBOARDS AND
STORIES (V)
Data Preparation: Changing the axis, Improving the visibility of labels
Adding labels in the visualization, Changing the label orientation
Unit – V
Connecting data points with smooth lines, Changing the size or color of 6
bubbles, Working with objects, Data properties, Changing how data is
aggregated, Editing column headings, Enabling data caching
Total 32
Reference Books: IBM Courseware
 Name of Department:- Computer Science and Engineering

Logic Design
1. Subject Code: TCS 301 Course Title:

2. Contact Hours: L: 3 T: - P: -
3. Semester: III

4. Pre-requisite: Basics of Mathematics, Basic knowledge of computer programming and components of

computer system

5. Course Outcomes: After completion of the course students will be able to

1. Learning of Boolean algebra and Gate level minimization

2. Designing of Combinational logic circuit
3. Analysis of Sequential (Synchronous and Asynchronous) circuits.
4. Design the ASM using data path and control subsystem.
5. Realising digital circuits using modern tools such as ORCAD
6. After successful completion of this course student will be able investigate digital design problems.

6. Details of Syllabus

Contact
UNIT CONTENTS
Hrs
Review of Number System: Digital Signals and Waveforms, Binary, Octal,
Hexadecimal; 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.).
Unit – III Sequential Logic Circuits: Triggering, Latches, Flip Flops: RS, JK, D and T
(Characteristics Table, Equation and Excitation Table), Flip Flop Conversion, 9
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.
10
Counter: Asynchronous Counter, Decoding Gates, Synchronous Counters,
Changing the Counter Modulus, Decade Counter, Presettable Counter,
Designing of Asynchronous and Synchronous Counters
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.
Design of Asynchronous Sequential Circuit: Analysis of Asynchronous
Sequential Circuit, Problems with Asynchronous Sequential Circuit, Circuit
Designing, Case study – ORCAD
Total 46
Text Book:
1. Donald P Leach, Albert Paul Malvino& Goutam Saha, “Digital Principle and Application,” 7th 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,” 10th
Edition, Pearson Education, 2007
 Name of Department:- Computer Science and Engineering

Data Structures with C

1. Subject Code: TCS 302 Course Title:

2. Contact Hours: L: 3 T: - P: -
3. Semester: III

4. Pre-requisite: Good Knowledge of Programming in C (TCS 101, TCS 201)

5. Course Outcomes: After completion of the course students will be able to

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.
6. Details of Syllabus

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
Unit – III Representation of Binary trees, Traversing Binary trees, Threaded Binary
trees. Traversing Threaded Binary trees, Huffman algorithm & Huffman tree. 9
Searching and Hashing: Sequential search, binary search, comparison and
analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash
Table Implementation
 Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort,
Unit – IV Heap Sort, Sorting on Different Keys, Practical consideration for Internal
Sorting. 9
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 indices,
Unit – V 8
Secondary indices, B+ Tree index Files, B Tree index Files, 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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS361 Course Title: Programming Using

Python
2. Contact Hours: L: 3 T: - P: 2
3. Semester: III

4. Pre-requisite: TCS 101, TCS 201

5. Course Outcomes: After completion of the course students will be able to

1. Describe the principles of structured programming and be able to describe, design, implement, and
test structured programs using currently accepted methodology.
2. Explain what an algorithm is and its importance in computer programming.
3. Recognize and construct common programming idioms: variables, loop, branch, subroutine, and
input/output.
4. Define and demonstrate the use of the built-in data structures 'list' and 'dictionary'.
5. Apply idioms to common problems such as text manipulation, web page building, and working with
large sets of numbers.
6. Design and implement a program to solve a real-world problem using the language idioms, data
structures,, and standard library
6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
: Introduction To Python Programming
Introduction to Python: Importance of Python, Installing and working
with Python in Windows, Linux and Mac, Using Python as calculator,
Comments, How to define main function in Python
The concept of data types - Variables, Arithmetic Operators and
Expressions
Unit – I 10

String manipulations - Subscript Operator, Indexing, Slicing a string,

Converting strings to numbers and vice versa, split function
Control flow - if statements, for and while loops, nested loops, Short-
circuit (lazy evaluation), range() function, break and continue
statements, pass statements
Data Structures in Python
Data Structures:
Lists - Basic list operations, Replacing, inserting, removing an element;
Unit - II Searching and sorting a list, Methods of list objects, Using lists as 10
Stacks and Queues, How efficient lists are when used as stack or queue,
List and nested list Comprehensions
Tuple, Sets, Difference between list and tuple
 Dictionary - adding and removing keys, accessing and replacing values,
traversing dictionarie
: Python Functions and OOP Concepts
Python functions and modules - OS and SYS modules, Defining python
functions, calling a function, function arguments, Lambda and map
function, Importing python module
Unit – III 9
Useful Python Packages - BeautifulSoup, NumPy, iPython, tkinter
Classes and OOP - Class definition syntax, objects, class and instance
variables, Inheritance and multiple inheritance, Polymorphism,
Overloading, Overriding, Data Hiding
Regular Expressions in Python
Regular Expressions - re module, Searching a string (match and
search), Finding a string (findall), Break string into substrings (split),
Replace part of a string (sub)
Unit – IV Examples of Regex - Return the first word of a given string, Extract all 9
the words of a given string, Extract domain name from given e-mail
id’s, Extract date from given string, Return all the words of a string
that starts with vowel, Split a string with multiple delimiters, Retrieve
some information from HTML or XML file
File and Exception Handling in Python
File Handling - Reading keyboard input, opening and closing file, Read,
Write and Append mode, Create and Read a text file, Looping over a
Unit – V file object, Writing on a file, with statements, splitting lines in a text 10
file, Renaming and Deleting files
Exception Handling - Exceptions, Why use exceptions, Raising an
exception, try and except, try, except and else clause; try and finally
Total 48
Text Books:

 Kenneth A. Lambert, “The Fundamentals of Python: First Programs”, Cengage Learning., 2011

Reference Books:

 Laila M. Dawson ,”Python Programming for the Absolute Beginner “

 Zed A.Shaw ,”Learn Python the Hard Way “
 Mark Putz ,”Learning Python“
 Python Documentation (https://docs.python.org).
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 362 Course Title: Data Base Management

Systems
2. Contact Hours: L: 3 T: - P: -
3. Semester: III

4. Pre-requisite: TCS 201

5. Course Outcomes: After completion of the course students will be able to

1. Understand the different issues involved in the design and implementation of a database
system.
2. Study the physical and logical database designs, database modeling, relational, hierarchical,
and network models
3. Understand 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. Evaluate a business situation and designing & building a database applications
6. Detailed Syllabus

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; More
complex SQL 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; Embedded SQL,
Dynamic SQL; Database stored procedures.
 Database Design – 1: Informal Design Guidelines for Relation Schemas;
Functional Dependencies; Normal Forms Based on Primary Keys; General
Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form
Unit – IV 9
Properties of Relational Decompositions; Algorithms for Relational Database
Schema Design; Multivalued Dependencies and Fourth Normal Form; Join
Dependencies and Fifth Normal Form; Inclusion Dependencies; Other
Dependencies and Normal Forms
Transaction Management: The ACID Properties; Transactions and
Schedules; Concurrent Execution of Transactions; Lock- Based Concurrency
Unit – V Control; Performance of locking; Transaction support in SQL; Introduction to 9
crash recovery; 2PL, Serializability and Recoverability; Lock 9Management;
Log Files; Checkpointing; Recovering from a System Crash; Media Recovery
Total 47

Text Books:
1. Elmasri and Navathe: “Fundamentals of Database Systems”, 5th Edition, Pearson Education,
2007.
2. Raghu Ramakrishnan and Johannes Gehrke: “ Database Management Systems”, 3rd Edition,
McGraw-Hill, 2003.
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Data Science

IBM-311
Fundamentals
2. Contact Hours: L: 3 T: - P: 2
3. Semester: III

4. Pre-requisite: TCS101, TCS201

5. Course Outcomes: After completing this course students are able to

1. Earn basic knowledge of Cloud Technologies in use today

2. Strategic plan to move applications and services to the Cloud
3. Understand Cloud Segments and Cloud Deployment Models
4. Understanding how cloud application runs across mobile platform
5. Static Application Development using Service models
6. Understand deployment methodology and dashboard

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction to Big Data and Analytics

 Developing an understanding of the complete open-source Hadoop

ecosystem and its nearterm future directions
 Comparing and evaluating the major Hadoop distributions and their
ecosystem components, both their strengths and their limitations
 Gaining hands-on experience with key components of various big data
ecosystem components and their roles in building a complete big data
solution to common business problems
 Learning the tools that will enable you to continue your big data education
after the course
 Describing the functions and features of HDP
 Listing the IBM value-add components 11
Unit – I  Explaining what IBM Watson Studio is
 Giving a brief description of the purpose of each of the value-add components
 Exploring the lab environment
 Launching Apache Ambari
 Starting a variety of services using Apache GUI
 Exploring some of the directory structure on the Linux system
 Understanding the purpose of Apache Ambari in the HDP stack
 Understanding the overall architecture of Ambari, and Ambari’s relation to
other services and components of a Hadoop cluster
 Listing the functions of the main components of Ambari
 Explaining how to start and stop services from Ambari Web Console
 Managing Hadoop clusters with Apache Ambari o Start the Apache Ambari
web console and perform basic start/stop services o Explore other aspects of
the Ambari web server
  Understanding the basic need for a big data strategy in terms of parallel
reading of large data files and internode network speed in a cluster
 Describing the nature of the Hadoop Distributed File System (HDFS)
 Explaining the function of the NameNode and DataNodes in an Hadoop
cluster
 Explaining how files are stored and blocks ("splits") are replicated
 Filing access and basic commands with HDFS
 Describing the MapReduce model v1
 Listing the limitations of Hadoop 1 and MapReduce 1
 Reviewing the Java code required to handle the Mapper class, the
 Reducer class, and the program driver needed to access MapReduce
 Describing the YARN model
 Comparing Hadoop 2/YARN with Hadoop 1
 Run MapResuce and YARN jobs
 Creating and code a simple MapReduce job

Working on Hadoop, Spark and Understanding NO SQL

 Understanding the nature and purpose of Apache Spark in the Hadoop

ecosystem
 Listing and describing the architecture and components of the Spark unified
stack
 Describing the role of a Resilient Distributed Dataset (RDD)
 Understanding the principles of Spark programming
 Listing and describing the Spark libraries
 Launching and using Spark's Scala and Python shells
Unit – II 9
 Working with Spark RDD with Scala
 Listing the characteristics of representative data file formats, including
flat/text files, CSV, XML, JSON, and YAML
 Listing the characteristics of the four types of NoSQL datastores
 Describing the storage used by HBase in some detail
 Describing and compare the open source programming languages, Pig and
Hive
 Listing the characteristics of programming languages typically used by • Data
Scientists: R and Python

Understanding Zookeeper and Data Concepts

 Understanding the challenges posed by distributed applications and how

ZooKeeper is designed to handle them
 Explaining the role of ZooKeeper within the Apache Hadoop infrastructure
and the realm of Big Data management
 Exploring generic use cases and some real-world scenarios for ZooKeeper
 Defining the ZooKeeper services that are used to manage distributed systems
Unit – III 9
 Exploring and use the ZooKeeper CLI to interact with ZooKeeper services
 Understanding how Apache Slider works in conjunction with YARN to deploy
distributed applications and to monitor them
 Explaining how Apache Knox provides peripheral security services to an
Hadoop cluster
 Listing some of the load scenarios that are applicable to Hadoop
 Understanding how to load data at rest
 Understanding how to load data in motion
  Understanding how to load data from common sources such as a data
warehouse, relational database, web server, or database logs
 Explaining what Sqoop is and how it works
 Describing how Sqoop can be used to import data from relational systems into
Hadoop and export data from Hadoop into relational systems
 Briefing introduction to what Flume is and how it works
 Moving data into HDFS with Sqoop
 Explaining the need for data governance and the role of data security in this
governance
 Listing the Five Pillars of security and how they are implemented with HDP
 Discussing the history of security with Hadoop
 Identifying the need for and the methods used to secure Personal & Sensitive
Information
 Describing the function of the Hortonworks DataPlane Service (DPS)
 Defining streaming data
 Describing IBM as a pioneer in streaming data - with System S IBM Streams
 Explaining streaming data - concepts & terminology
 Comparing and contrasting batch data vs streaming data
 Listing and explaining streaming components & Streaming Data Engines
(SDEs)

Understanding Data Science and Notebooks

• Have a better understanding of methodology “scientific approach” methods

used & skills practiced by Data Scientists
• Recognizing the iterative nature of a data science project
• Outlining the benefits of using Data Science Notebooks
• Describing the mechanisms and tools used with Data Science Notebooks
• Comparing and contrasting the major Notebooks used by Data Scientists
• Getting started with Jupyter Notebook
• Data and notebooks in Jupyter
• How notebooks help data scientists
• Essential packages: NumPy, SciPy, Pandas, Scikit-learn, NLTK, BeautifulSoup,
…
Unit – IV 10
• Data visualizations: matplotlib, …, PixieDust
• Using Jupyter “Magic” commands
• Start Jupyter - it will open in a web browser
• Importing the lab file (all Jupyter files have a.ipynb suffix) into your default
workspace o This is now a copy of the provided lab file and you can do
anything with it o If you mess it up, you can re-import again later
• Exploring the component panels - some are markdown, some are code, some
are results of running the code (output data, visualizations, …)
• Learning how to run single panels - and then the whole script o You may
need to adjust the provided script to locate the data files thataccompany the
• Jupyter.ipynb file o Add some additional panels, as described in the lab
script

 Overview of Big SQL

 Understanding how Big SQL fits in the Hadoop architecture
 Start and stop Big SQL using Ambari and command line
Unit – V 9
 Connecting to Big SQL using command line
 Connecting to Big SQL using IBM Data Server Manager
 Configuring images
 Starting Hadoop components
 Start up the Big SQL and DSM services
 Connecting to Big SQL using JSqsh
 Executing basic Big SQL statements
 Exploring Big SQL through Ambari using DSM
 Describing and creating Big SQL schemas and tables
 Describing and listing the Big SQL data types
 Working with various Big SQL DDLs
 Loading data into Big SQL tables using best practices
 Creating and dropping simple Big SQL table
 Creating sample tables
 Moving data into HDFS
 Loading data into Big SQL tables
 Creating and working with views
 Creating external tables
 Describing Big SQL supported file formats
 Query Big SQL tables using various DMLs
 Connecting to Big SQL
 Query data with Big SQL
 Working with the ARRAY type
 Working with Big SQL functions
 Storing data in an alternate file format (Parquet)
 Configuring the Big SQL Server
 Configuring the Big SQL Scheduler
 Listing the registries for compiler and runtime performance improvement •
Backup and restore Big SQL
 Updating the database resource percentage for the Big SQL database
instance
 Inspecting the Big SQL scheduler configuration file
 Viewing the registries for the compiler and runtime performance
improvement
 Configuring authentication for Big SQL
 Managing security with Apache Ranger
 Enabling SSL encryption
 Configuring authorization of Big SQL objects
 Configuring impersonation in Big SQL
 Understanding the concept of Big SQL federation
 Listing the supported data sources
 Set up and configure a federation server to use different data sources
 Configuring Fluid Query with Big SQL
 What is Watson Studio?
 Setting up a project
 Working with collaborators
 Managing data assets
 Sign up for a Watson Studio account
 Creating a new project
 Managing a project
 Adding collaborators
 Loading data
 Managing the object storage
 Overview of Jupyter notebooks
  Creating notebooks
 Coding and running notebooks
 Sharing and publishing notebooks
 Creating a notebook
 Using notebooks
 Working with external data

Total 48

Reference Books: IBM Courseware

 Name of Department:- Computer Science and Engineering

1. Subject Code: TMA 316 Course Title: Discrete Structures and

Combinatorics
2. Contact Hours: L: 3 T: P: 0
3. Semester: III

4. Pre-requisite: TMA 101, TMA 201

5. Course Outcomes

1. Be able to specify and manipulate basic mathematical objects such as sets, functions, and relations .
Demonstrate an understanding of partial order relations and Lattices.
2. Understand the basics of discrete probability and number theory, and be able to apply the methods from
these subjects in problem solving.
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. Be able to apply 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.

6. Detailed Syllabus

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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TMA 402 Course Title: Computer Based Numerical

and Statistical Technique
2. Contact Hours: L: 3 T: - P: -
3. Semester: IV

4. Pre-requisite: TMA 101, TMA 201, TCS 101, TCS 201

5. Course Outcomes: After completion of the course students will be able to

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.

6. Detailed Syllabus

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 Siedel method.
Interpolation: Finite Differences, Difference tables, Polynomial Interpolation:
Newton’s forward and backward formula, Central difference formulae: Gauss
Unit - II forward and backward formula, Stirling’s, Bessel’s, Everett’s formula. 10
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, Data
Unit – V 10
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 402 Course Title: Finite Automata and

Formal Languages
2. Contact Hours: L: 3 T: 1 P: 0
3. Semester: IV

4. Pre-requisite: TMA 101, TMA 201

5. Course Outcomes: After completion of the course students will be able to

1. Understand the importance of formal languages in design of Programming Languages

2. Develop students ability to appreciate mathematical proofs for computations and algorithms
3. Identify different formal language classes and their relationships.
4. Analyze various decidable and undecidable problems of real world
5. Design solutions by proving or disprove theorems in automata theory using its properties
6. Formulate finite machines, push down automata and Turing machines for automated functioning of
devices.

6. Detailed Syllabus

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
Unit - II Regular Languages, Pumping Lemma for regular Languages. Application of 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, Simplification
Unit – III 9
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”
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 461 Course Title: Software Engineering

2. Contact Hours: L: 3 T: - P: 0
3. Semester: IV

4. Pre-requisite: Fundamentals of any Programming Language

5. Course Outcomes: After completion of the course students will be able to

1. Understand 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 ad 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.

7. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Introduction:What is Software Engineering and its history, Software Crisis,
Evolution of a Programming System Product, Characteristics of Software,
Brooks’ No Silver Bullet, Software Myths
Software Development Life Cycles: Software Development Process, The
Code-and-Fix model, The Waterfall model, The Evolutionary Model, The
Unit - I 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, Classes of User Requirements:
Enduring and Volatile; Sub phases of Requirement Analysis, Functional and
Non-functional requirements; Barriers to Eliciting User Requirements, The
Unit - II software requirements document and SRS standards, Requirements 9
Engineering, Case Study of SRS for a Real Time System
Tools for Requirements Gathering: Document Flow Chart, Decision Table,
Decision Tree; Structured Analysis: DFD, Data Dictionary, Introduction to non-
traditional Requirements Analysis Tools: FSM, Statecharts and Petrinets;
Software Design: Goals of Good Software Design, Design Strategies and
Methodologies, Data Oriented Software Design, Structured Design: Structure
Chart, Coupling, Cohesion,, Modular Structure, Packaging; Object Oriented
Design, Top-Down and Bottom-Up Approach, Design Patterns
Software Measurement and Metrics: Various Size Oriented Measures:
Unit – III 8
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

Unit – IV Testing, Regression Testing, Testing for Functionality and Testing for 10
Performance, Top-Down and Bottom-Up Testing Strategies: Test Drivers and
 Test Stubs, Structural Testing (White Box Testing), Functional Testing (Black
Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of Products.
Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk
Through, Code Inspection, Compliance with Design and Coding Standards,
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), Resource Allocation Models, 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:
1. Ian Sommerville,” Software Engineering”, Addison Wesley.
2. PankajJalote: “An Integrated Approach to Software Engineering”, Narosa Publishing House.
3. Carlo Ghezzi, M. Jarayeri, D. Manodrioli,” Fundamentals of Software Engineering”, PHI Publication.
4. Rajib Mall,” Fundamentals of Software Engineering”, PHI Publication.
5. Pfleeger, “Software Engineering”, Macmillan Publication.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 404 Course Title: Computer Organization

2. Contact Hours: L: 3 T: 1 P: 0
3. Semester: IV

4. Pre-requisite: Fundamentals of Computer System, TCS301

5. Course Outcomes: After completion of the course students will be able to

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.

6. Detailed Syllabus

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
Representation, Complement Systems: One’s complement and Two’s
Unit - I 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
Memory System: Basic Concepts, Types of Memory, Speed, Size, and Cost,
The Memory Hierarchy, Locality of Reference, Cache Memories – Mapping
Unit – IV 9
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Java Programming Language

TCS 408

2. Contact Hours: L: 3 T: - P: -
3. Semester: IV

4. Pre-requisite: TCS 101, TCS 201, TCS 302, TCS 307

5. Course Outcomes: After completion of the course students will be able to

1. Understand the object-oriented approach in programming alongwith the purpose and usage principles of
inheritance, polymorphism, encapsulation and method overloading etc.
2. Demonstrate ability to test and debug Java programs using IDE
3. Analyze, design and develop small to medium sized application programs that demonstrate professionally
acceptable programming standards
4. Demonstrate skills of developing event-driven programs using graphical user interfaces
5. Develop applications using Client/Server communication
6. Develop applications that involve storage and retrieval of data using databases.

7. 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 console and file.
9

Multithreaded programming:Java thread model, synchronization,

messaging, thread class, Runnable interface, inter thread communication,
Producer/ consumer problems, Wait () and notify ().
Networking in Java:Networking fundamentals, Client/server model, Internet
addresses, Sockets, networking classes and interfaces, using Java.net
Unit – IV package
9
 AWT &Swing:Introduction to Awt and Swings, Swings advantages over 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”, 2nd edition, Tata McGraw Hill,
2002.
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: IBM 401 Course Title: Cloud Application

Development
2. Contact Hours: L: 3 T: - P: -
3. Semester: IV

4. Pre-requisite: Basic Knowledge of Computer Science.

5. Course Outcomes: After completion of the course students will be able to

1) Describe the emerging paradigms that are leading to the adoption of cloud computing
2) Describe Infrastructure as a service (IaaS), platform as a service (PaaS), and software as a service
(SaaS)
3) Describe the features of cloud development platforms
4) Describe the underlying components of cloud development platforms
5) Create a cloud development platform application
6) Deploy and run a cloud development platform application

6. Detailed Syllabus

Unit Content Contact

Hrs
Unit 1 Describe what HTML does, List the objectives of HTML5,Describe the 8
document types that are supported in HTML5,Describe the document object
model (DOM) tree, some of the differences between HTML4 and
HTML5,List some HTML document API properties and methods, how
scripting is enabled in browsers, browser support for HTML5 features
Describe JavaScript primitives and objects, how variables are declared and
used in JavaScript
,Describe JavaScript control structures, Describe functions in JavaScript,
Describe the document object model (DOM) hierarchy, Describe the window
and document objects
Identify the DOM objects that are commonly used in JavaScript applications
for working with HTML documents, Create HTML web pages, Use style
statements in HTML documents, Connect scripts to documents, Write
JavaScript functions, Create interactive alert and confirm window objects
Use JavaScript to modify the document object model (DOM).
List new elements in HTML5, Describe HTML5 structural elements: section,
article, header, footer, figure, fig caption, Describe the attributes of the
HTML5 input element: tel, email, datetime, number, range, color.
Create a web page and insert a simple HTML5 form layout, Add new markup
elements, Use input types that include attributes such as email to perform
client-side validation
Test the application. How the course met its learning objectives, Submit an
evaluation of the class, Identify other Web Application Server Education
courses that are related to this course, Access the Web Application Server
Education website, Locate appropriate resources for further study

Unit 2 Define cloud computing, the factors that lead to the adoption of cloud 10
computing, the choices that developers have when creating cloud
applications, infrastructure as a service, platform as a service, and software
 as a service, Describe a development platform, Describe the architecture of
a development platform
Identify the runtimes and services that a development platform offers.
Describe the cloud development platform’s infrastructure types, how to
create an application in a cloud development platform, cloud development
platform’s dashboard, catalog, and documentation features, how the
application route is used to test an application from the browser, how to bind
services to an application in the cloud development platform, the
environmental variables used within the services of the cloud development
platform, cloud development platforms organizations, domains, spaces and
users.
How to manage your account with the Cloud Foundry CLI, how to create a
Node.js application that runs on the cloud development platform the features
in the cloud development platform that help you set up a cooperative
workstation environment, how to setup and use the cloud application
development platform’s plug-in for Eclipse, the role of Node.js for server-
side scripting.
Set up a cloud application trial account, Log in to the cloud application from
a browser session, InitializeCreater’ your cloud application account, Create
a cloud application from an existing template,Add a service to the
application from the service catalog, Test the application with the resource
endpoint once the application has started ,Follow getting started option on
the cloud development platform to use the CLI, Install Cloud Foundry CLI
,Deploy an app from local source code using the Cloud Foundry CLI, Test
the application with the resource endpoint after the app is started
Download the Eclipse and required plugins for developing cloud applications
on Eclipse, Configure Eclipse to work with the cloud development platform,
Push applications from Eclipse to the cloud development platform

Describe the cloud development platform’s DevOps services, Describe the

capabilities of the DevOps services
Briefly highlight the web IDE features in the DevOps services

Describe how to connect the Git repository client to your DevOps services
project Explain the pipeline build and deploy processes used by DevOps
services Describe how DevOps services integrate with the cloud
development platform, Describe the agile planning tools in the cloud
development platform.

Sign in to DevOps, Explore public projects in DevOps, Sign in to the cloud

development platform and DevOps

Create a Git repository in DevOps services to manage your source code,

View and edit code in DevOps, Build and deploy code from DevOps to the
cloud development platform, Test the application on the cloud development
platform.
Describe the characteristics of REST APIs. , Explain the advantages of the
JSON data format. Example of REST APIs using Watson
Unit 3 Describe the main types of data services in a cloud development platform, 8
Describe the benefits of Cloudant.
Explain how Cloudant databases and documents are accessed from the
cloud development platform
Describe how to use REST APIs to interact with Cloudant database.

Create a starter Node.js application with a Cloudant DB service from a

Cloud development platform boilerplate
Review the service environment variables Download the application
package to the workstation
 Review the application source code Push the application to the cloud
development platform
Access the Cloudant console and documentation Explore the features of the
Cloudant dashboard
Run the Cloudant application, Run the application and add data to the
Cloudant database
Verify the data that is store in the database from the Cloudant dashboard.

Describe the cloud development platform’s Mobile Backend as a Service

(MBaaS), Describe the MBaaS architecture, Describe the Push Notifications
service, Describe the Mobile Client Access service, Describe the Mobile
Quality Assurance service, Describe how to create mobile applications by
using MobileFirst Services Starter Boilerplate.

Create a MobileFirst Services Starter application on a cloud development

platform, Set up the Android development environment, Clone the mobile
application from DevOps, Configure the front end of the application
Install the Android virtual device, Run the Android application on mobile
emulator.

Create a MobileFirst Services Starter application on the cloud development

platform, Configure Google Cloud Messaging Service, Configure the Push
Notifications service, Clone the mobile application from Github.
Configure the front-end mobile app, Run the Android application on a mobile
device emulator
Send push notifications from the cloud development platform and receive
them on the mobile device emulator.

Unit 4 Explain the origin and purpose of the Node.js SDK JavaScript framework, 10
simple web server with JavaScript, Import the Node.js SDK modules into
your script, Create an SDK for Node.js application, First Node.js application,
Deploy a Node.js SDK application on a cloud platform, Create a Node.js
module and use it in your code. Explain the concept of anonymous callback
functions, Create a callback function to intercept network traffic, Parse
network traffic with sockets, Understand asynchronous callbacks, code in a
Node.js application

Unit 5 Define a package dependency, Create an Express server object, Handle 7

inbound HTTP method calls for a server resource, and Create a callback
function to intercept HTTP method calls. Parse JSON data from an HTTP
message-, Create a Hello World Express application, Create Simple HTML
view for your application, Understand Express routing, Use third-party
modules in Node.js.
Understand the Watson Natural Language Understanding service Clone a
cloud application, Use Bootstrap to create a responsive web page, Use
AngularJS, Controllers to create interactive web pages, Use AngularJS
Services to, interact with back-end web services Use AngularJS directives,
such as ng- repeat, to enrich your user interface (UI).

Reference Books: IBM COURSEWARE

 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS-561 Course Title: Hadoop

Fundamentals
2. Contact Hours: L: 3 T: - P: -
3. Semester: IV

4. Pre-requisite: Object Oriented Programming

5. Course Outcomes: After completion of the course students will be able to

1. Understand the various paradigms of Hadoop

2. Compare the Hadoop distributed file systems with other file systems
3. Understand the storage mechanism in distributed storage architecture
4. Create Map-Reduced program
5. Apply query through HiveQL
6. Explore the challenges of Bigadata

6. Detailed Syllabus

UNIT CONTENTS Contact Hours

Unit-1 Big Data Overview: Understanding of Big Data, What it is and why It Matters, 8
Tools and technique used in Big Data, How Big Data transforming Business,
Applications of Big data, Challenges of Big Data
Unit -2 Hadoop: What is Hadoop, Hadoop Distributed file System, HDFS architecture, 9
Daemons of Hadoop, Google file system, Hadoop Ecosystem, Hadoop core
components.
Unit-3 Data Storage in Hadoop, Data replication, Installation, and set-up of Hadoop, 8
Accessing HDFS through CLI and Java based approach, Fault Tolerance.
Unit-4 Map-reduce: Introduction to MapReduce, Basic flow of MapReduce program, 9
Types of file input formats in MapReduce, Writable in MapReduce,
implementation of Combiner and Reducer through a program.
Unit -5 Introduction to Hive, Hive Architecture, Hive vs RDBMS, Demonstration of 9
Basic HiveQL, Case Study: Flight Data Analysis
Text Book:

1. Tom White, “Hadoop: A definitive guide, 3/e”, O’ Reilly Press, 2012.

Reference Books:
1. Apache Hadoop Yarn 2nd Edition ( Jeff Markham, Arun C. Murthy, Doug Eadline, Vinod
Kumar Vavilapalli, Joseph Niemiec, Neil Trevett)
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Operating Systems

TCS 502

2. Contact Hours: L: 3 T: - P: -
3. Semester: V

4. Pre-requisite: TCS 301, TCS 403, TCS 404

5. Course Outcomes: After completion of the course students will be able to

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

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction to Operating Systems, UNIX: What operating systems do;
Operating System structure; Operating System Services; User - Operating
Unit – I System interface; System calls; Types of system calls; System programs; 8
Operating System structure; Unix command: Command Structure, Internal
and External commands, filters; vi editor.
Process Management: Process concept; Process scheduling; Operations
on processes; Multi-Threaded Programming: Overview; Multithreading
models; Threading issues. Process Scheduling: Basic concepts; 10
Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling;
Thread scheduling.
Unit – II 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;
Unit – IV
Access methods; Directory structure; File system mounting; File sharing;
 Protection. Implementing File System: File system structure; Directory 8
implementation; Allocation methods; Free space management.
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.
Shell Programming: Shell scripts, Running script in the current shell,
Pattern Matching, Redirection, String handling, Conditional Parameter
Substitution, Shell functions. 8
Unit – V 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. Sumitabha Das ,”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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 572 Course Title: Bigdata Storage and

Processing
2. Contact Hours: L: 3 T: - P: -
3. Semester: VI

4. Pre-requisite: TCS 404, TCS 408

5. Course Outcomes: After completion of the course students will be able to

1. Understand the various paradigms of Big Data

2. Use Hadoop distributed file system

3. Create the Hadoop Cluster
4. Explain NoSQL databases
5. Create the Map Reduce based programs
6. Understand the I/O system of Hadoop

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Big Data Overview: Understanding Big Data, Capturing Big data,
Unit - I Benefitting from big data, management of big data, Organizing big 8
data, Analyzing big data, Technological challenges from big data.
Hadoop Distributed File System (HDFS), HDFS design, HDFS
Unit - II concepts: Data node, name node, Command line interface, File 9
system, Data flow, limitations
Hadoop I/O: Data integrity, compression, serialization, File based
data structures, Concept of Map Reduce, features, types and
Unit – III 9
formats, Working of Map Reduce: Shuffle and sort, Task execution,
Job tracker, task tracker
Setting up a Hadoop cluster: Basic system requirements, installation
and cluster formation, Modes of installation: standalone, pseudo-
Unit – IV distributed and distributed, purpose of different mode of installations 8
and applications

NoSQL Databases:- RDBMS Vs NoSQL, Types of No SQL

Unit – V Databases, Architecture of NoSQL Databases, CAP Theorem, 9
HBase Architecture, Reading and writing data
Total 43

Text Books:

1. Tom White, Hadoop: A definitive guide, 3/e, O’ Reilly Press, 2012.

Reference Books:

2. Fei Hu, Big Data: Storage, Sharing and Security, CRC Press, Taylor and Francis, 2016.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 601 Course Title: Compiler Design

2. Contact Hours: L: 3 T: - P: -
3. Semester: VI

4. Pre-requisite: TCS 501

5. Course Outcomes: After completion of the course students will be able to

1. Understand the various phases and fundamental 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. Study usage of 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. Study knowledge of patterns, tokens & regular expressions for solving a problem in the
field of data mining.
6. Design a compiler for concise programming language.

6. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Introduction, Lexical analysis: Compilers; Analysis of Source Program;
The Phases of a Compiler; Cousins of the Compiler; The grouping of
Unit – I phases; Compiler- Construction tools. 9
Lexical analysis: The Role of Lexical Analyzer; Input Buffering;
Specifications of Tokens; Recognition of Tokens.
Syntax Analysis – 1: The Role of the Parser; Context-free Grammars;
Writing a Grammar; Top-down Parsing; Bottom-up Parsing.
Unit – II 9
Operator-Precedence Parsing; LR Parsers; Using ambiguous grammars;
Parser Generators
Syntax-Directed Translation: Syntax-Directed definitions; Constructions
of Syntax Trees; Bottom-up evaluation of S-attributed definitions; L-
Unit – III attributed definitions; Top-down translation. Run-Time Environments : 8
Source Language Issues; Storage Organization; Storage-allocation
strategies, Storage-allocation in C; Parameter passing
Intermediate Code Generation: Intermediate Languages; Declarations;
Assignment statements; Boolean Expressions; Case statements; Back
patching; Procedure calls.

Unit – IV 9
Code Generation: Issues in the design of Code Generator; The Target
Machine; Run-time Storage Management; Basic blocks and Flow graphs;
Next-use information; A Simple Code Generator; Register allocation and
assignment; The dag representation of basic blocks; Generating code from
dags.
 Code Optimization, Compiler Development: Code Optimization:
Introduction; The principal sources of optimization; Peephole optimization;
Optimization of basic blocks; Loops in flow graphs.
Unit – V 9
Compiler Development: Planning a compiler; Approaches to compiler
development; the compiler development environment; Testing and
maintenance.
Total 44
Text Books:
1. Alfred V Aho, Ravi Sethi, Jeffrey D Ullman: “Compilers- Principles, Techniques and Tools”,
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 604 Course Title: Computer Network-I

2. Contact Hours: L: 3 T: - P: -
3. Semester: VI

4. Pre-requisite: TCS 505

5. Course Outcomes: After completion of the course students will be able to

1. 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
6. Detailed Syllabus
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 and
Unit – I 11
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
 Transport Layer: Introduction and Services, The Transport layer in internet,
Difference between Connection Oriented and Connectionless services
Unit – III 6
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS-610 Course Title: Design and Analysis of

Algorithms
2. Contact Hours: L: 3 T: - P: -
3. Semester: VI

4. Pre-requisite: TCS 101, TCS 201

5. Course Outcomes: After completion of the course students will be able to

1. Understand 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.

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
Unit – I Notations, Master theorem 8
Searching - Linear search (sorted and unsorted), Iterative and
recursive binary search, Tower of Hanoi and solving its recursion,
Fibonacci and solving its recursion
Sorting Algorithms Sorting - Bubble sort, Insertion sort, selection
sort, quick sort, randomized quick sort, merge sort, heap sort,
counting sort, External sorting
Unit – II Divide sorting algorithms into following types - online sort, stable 10
sort, in place sort, Comparison of sorting algorithms on the basis of
number of swaps, by number of comparisons, recursive or iterative
nature, time and space complexity
Graph Algorithms
Unit – III Representation of Graphs, Breadth-first search (BFS), depth-first 12
search (DFS), topological sort, Difference between BFS and DFS
 Data structures for disjoint sets - Finding cycle in a graph, Finding
strongly connected components
Minimum spanning trees - Kruskal and Prim algorithms (Greedy
Algorithms) Single source shortest paths - Dijkstra (Greedy
Approach) and Bellman ford (Dynamic Programming) algorithms All
pair shortest paths - The Floyd Warshall algorithm
Algorithm Design Techniques - Greedy and Dynamic
Programming
Greedy algorithms - Activity selection problem, Job sequencing
problem, Huffman codes, fractional knapsack problem
Unit – IV 10
Dynamic Programming - Overlapping substructure property,
Optimal substructure property, Tabulation vsMemoization, Fibonacci
numbers, 0/1 Knapsack problem, Longest common subsequence,
Matrix chain multiplication
Hashing, String Matching and NP-Completeness
Hashing Data Structure - Introduction to Hashing, Hash function,
Collision and collision handling, Collision handling - Chaining, Open
addressing
Unit – V String Matching - Naive string-matching algorithm, The Rabin- 10
Karp algorithm, The Knuth-Morris-Pratt algorithm
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”,3rd

Edition
2. Ellis Horowitz, SartajSahni, SanguthevarRajasekaran:” Fundamentals of Computer Algorithms”,
2nd Edition, University press, 2007.
3. AnanyLevitin:” Introduction to the Design & Analysis of Algorithms”, 2nd Edition, Pearson
Education, 2007.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 693 Course Title: Full Stack Web Development

2. Contact Hours: L: 3 T: - P: -
3. Semester: VI

4. Pre-requisite: TCS 408, TCS 503

5. Course Outcomes: After completion of the course students will be able to

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.
6. Detailed Syllabus

UNIT CONTENTS Contact

Hrs

1 HTML 8
Basics of HTML, formatting and fonts, commenting code, color, 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

2 CSS 8
Need for CSS, introduction to CSS, basic syntax and structure, using CSS, type of
CSS, 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,
 UNIT CONTENTS Contact
Hrs

4 PHP 11
Introduction and basic syntax of PHP, decision and looping with examples, PHP
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.

5. Web Application Deployment 8

Concept of WWW, Internet and WWW, HTTP Protocol: Request and Response,
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

Text/ Reference Books:

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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 703 Course Title: Computer Networks-II

2. Contact Hours: L: 3 T: - P: -
3. Semester: VII

4. Pre-requisite: TCS 604

5. Course Outcomes: After completion of the course students will be able to

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. Identify the availability strategies in a Network Management System that will
improve network availability and limit the effects of failures
6. Implement client server applications with TCP/UDP Socket Programming
6. Detailed Syllabus
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 Access
Unit – II protocols: Channel Partitioning, Random Access (Slotted Aloha, Aloha, 10
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.
Network Management: What it is, Infrastructure of Network Management,
Unit – IV 9
The Internet standard Management Framework, SNMP
Network Programming: Sockets-Address structures, TCP sockets,
creating sockets, bind, listen, accept, fork and exec function, close
function; TCP client server: Echo server, normal startup, terminate and
Unit – V signal handling, server process termination, crashing and rebooting of 8
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 704 Course Title: Advanced Computer

Architecture
2. Contact Hours: L: 3 T: - P: -
3. Semester: VII

4. Pre-requisite: TCS 404

5. Course Outcomes: After completion of the course students will be able to

1. Discuss the classes of computers, and new trends and developments in computer
architecture
2. Study 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

6. Detailed Syllabus
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. Centralized
Unit – V shared-memory, Distributed shared-memory architecture, Message 9
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 750 Course Title: Cloud Orchestration and

Load Balancing
2. Contact Hours: L: 3 T: - P: -
3. Semester: VII

4. Pre-requisite: TCS 651

5. Course Outcomes: After completion of the course students will be able to

1. Understand the concepts in cloud automation, orchestration and loadbalancing.

2. Identify the need for and techniques behind automation, orchestration and load
balancing.
3. Identify the need forkey scheduling considerations in the cloud.
4. Describe cloud management techniques.
5. Evaluate different cloud load balancing for cloud software deployment.

6. Evaluate fault tolerant techniques for cloud software deployment.

6. Detailed Syllabus

Sl. No. Contents Contact Hours

Introduction to automation, orchestration and load balanincg.
Identify the need for and techniques behind automation and
Unit I orchestration of resources, as well as key scheduling 8
considerations in the cloud.
Recall and describe cloud management techniques such as 6
middleware, resource provisioning, metering, and
Unit II orchestration.

Unit III Describe and evaluate different cloud software deployment 8

considerations such as scaling strategies, load balancing, fault
tolerance, accounting for tail latencies and optimizing for cost.
Case study of any one or two of the following:
IBM Cloud Orchestrator, Ingram Micro Cloud Orchestrator,
Microsoft Azure Automation, Microsoft Cycle Computing,
Morpheus, OpenStack Heat orchestration engine, Saltstack,
Zymr etc.
Heat orchestration service, Heat orchestration Template(HoT)
Explain the main execution flow, scheduling and fault
Unit IV tolerance concepts in the MapReduce programming model. 10
4.5.3. Recall and contrast different cloud programming models
(MapReduce, Spark, GraphLab, Spark Streaming and
Samza).
 5
Unit V Students will work in teams to design and implement a
complete web-service that uses the REST interface to respond
to queries that require running an analytics job on a large data 12
set which is stored in a database. In this team project, student
teams are expected to use different tools and services to
achieve build a performing web-service that meets the
requirements. The students' web-services are evaluated
through a load generator for a fixed time period (several hours)
by measuring the cost of cloud resources used and their
system’s performance (throughput).

Total 44

Text/Reference Book:
1. Barrie Sisisky, “Cloud Computing Bible” ,Published by Wiley Publishing, Inc.
2. Felipe Gutierrez ,“Spring Cloud Data Flow: Native Cloud Orchestration Services for
Microservice”
3. Adnan Ahmed Siddiqui, “OpenStack Orchestration”, Packt Publishing Ltd
4. “Practical Load Balancing: Ride the Performance Tiger (Expert's Voice in Networking)”,
Apress
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 771 Course Title: Natural Language

Processing Using Big Data
2. Contact Hours: L: 3 T: - P: -
3. Semester: VII

4. Pre-requisite: TCS 507, TCS 601

5. Course Outcomes: After completion of the course students will be able to

1. Demonstrate key concepts from NLP are used to describe and analyze language
2. Examine linguistic properties of English Language
3. Implement POS Tagging and Named Entity Recognition using Python
4. Construct NLP solutions by choosing between traditional and deep learning techniques
5. Apply classifiers and modelling techniques for Text Classification
6. Build a conversational dialog system using the principles of NLP

6. Detailed Syllabus

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
using NLTK
Unit - II 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 Classifier,
Leveraging Confusion Matrix
Unit – III 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
 Text classification, Examples of Text Classification, Linear Classifiers, Deep
Learning Techniques, Language Modelling, Prediction a sequence of text,
Unit – IV Higher Abstraction for Texts, traditional models of distributional 8
semantics. Machine Translation, Vectorization techniques and processing
using python
Case Study: Building a NLP based chatbot/dialog system, Main building
Unit – V blocks, Intents, Entities, Dialog, Building a chatbot from scratch, Deep 11
Learning Frameworks
Total 45

Text/ Reference Books:

1. D. Jurafsky, J. H. Martin, Speech and Language Processing, Pearson Education

2. Nitin Indurkhya and Fred J Damerau, "Handbook of natural language processing,"

Chapman and Hall/CRC

3. Ian Goodfellow, Yoshua Bengio, and Aaron Courville, Deep Learning,

http://www.deeplearningbook.org. MIT Press

Name of Department: - Computer Science and Engineering

1. Subject Code: TCS 731 Course Title: Digital Forensics

2. Contact Hours: 3L: - T: - P:

3. Semester: VII

4. Prerequisite:

5. Course Outcomes: After completion of the course students will be able to

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
Digital Forensics Fundamentals: Introduction to Incident
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
Unit - II 9
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
Unit – V 8
Forensics, Email Investigations, Cell Phone and Mobile Devices Forensics, 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
 Name of Department: - Computer Science and Engineering

1. Subject Code: TCS 791 Course Title: Sensor Networks

2. Contact Hours: 3L: - T: - P:

3. Semester: VII

4. Prerequisite: TCS631

5. Course Outcomes: After completion of the course students will be able to

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.
Routing and Data Gathering Protocols:Routing Challenges and
Design Issues in Wireless Sensor Networks, Flooding and gossiping
– Data centric Routing – SPIN – Directed Diffusion – Energy aware
Unit – III routing - Gradient-based routing - Rumor Routing – COUGAR – 10
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,
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 756 Course Title: Human Computer

Interaction
2. Contact Hours: L: 3 T: - P: -
3. Semester: VII

4. Pre-requisite: Fundamentals of Computer architecture

5. Course Outcomes: After completion of the course students will be able to

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.

6. Detailed Syllabus

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 human
Unit – II 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 information
Unit – III 9
– focus and emphasis – presentation information simply and meaningfully
– information retrieval on web – statistical graphics – Technological
consideration in interface design
 Windows – New and Navigation schemes selection of window, selection of
devices based and screen based controls.
Unit – IV 8
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 722 Course Title: Data Warehousing and Data
Mining
2. Contact Hours: L: 3 T: - P: -
3. Semester: VII

4. Pre-requisite: Excellent knowledge of Database Management Systems

5. Course Outcomes: After completion of the course students will be able to

1. Describe the fundamental concepts, benefits and problem areas associated with
datawarehousing
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.
6. Detailed Syllabus

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 Databases, 8
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
What is Classification & Prediction, Issues regarding Classification and
prediction, Decision tree, Bayesian Classification, Classification by Back
propagation, Multilayer feed-forward Neural Network, Back propagation
Unit – III Algorithm, Classification methods K-nearest neighbor classifiers, Genetic 9
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS861 Course Title: Distributed Systems

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: TCS 604

5. Course Outcomes: After completion of the course students will be able to

1. Characterize Distributed Systems and understand the Theoretical Foundations

for Distributed Systems
2. Evaluate various distributed mutual exclusion algorithms
3. Demonstrate knowledge of deploying different distributed deadlock algorithms in
various models of distributed systems.
4. Determine the appropriate use of different Agreement protocols
5. Identify the state of a distributed system to apply the appropriate context of
commit protocols
6. Utilize real life DFS (NFS4 and GFS) to examine work of distributed file systems
6. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Characterization of Distributed Systems: Introduction, Examples of
distributed Systems, Resource sharing
Theoretical Foundation for Distributed System: Limitation of Distributed
Unit – I system, absence of global clock, shared memory, Logical clocks, 9
Lamport’s& vector logical clocks, Causal ordering of messages, Birman-
Schiper-Stephenson protocol, Global State: Chandy-Lamport algorithm,
Termination detection: Huang’s Algorithm
Distributed Mutual Exclusion: Classification of distributed mutual exclusion,
Requirements of mutual exclusion algorithms, Performance metric for
distributed mutual exclusion algorithms. Non-Token Based Algorithms:
Unit – II Lamport, Ricart-Agrawala, Rouicarol-Carvalho; Quorum Based Algorithms: 10
Maekawa; Token-Based Algorithms: Suzuki-Kasami
Leader Election in a Ring: LeLann& Chang-Robert’s Algorithm, Hirshberg-
Sinclair Algorithm
Distributed Deadlock Detection: system model, Wait for Graphs, Deadlock
handling strategies, Centralized dead lock detection, Path pushing
algorithms, Chandy’s et all edge chasing algorithm.
Unit – III Agreement Protocols: Introduction, System models, classification of 8
Agreement Problem, Byzantine agreement problem, Consensus problem,
Interactive consistency Problem, Byzantine Agreement problem,
Application of Agreement problem
Commit Protocols: Distributed Transactions, Transaction System
Architecture, System Failure modes, Two Phase commit protocol, Handling
Unit – IV 9
of Failures: Site failure, Coordinator failure, Network Partition, Recovery and
Concurrency Control, Three Phase Commit protocol
 Self Stabilization: Definition, Randomized Self Stabilization, Probabilistic
Self stabilization, Issues in design of self-stabilization algorithms, Dijkstra’s
self-stabilizing token ring
Distributed file systems: Design Goals, DFS architecture, Naming
Schemes, Mounting Remote Directories, Caching to improve performance,
Design issues of cache, cache location, Cache update policies, Cache
consistency, Sharing semantics in DFS, Stateless vs Stateful service NFS,
Basic NFS architecture, Caching in NFS3, NFS v4 improvements, NFSv4
details: Compounding, Open/Close, Locking, Caching, Open Delegation,
Unit – V Recalling Delegation, Replication and Security 10
Case Study: Google File System(GFS): Design constraints, Architectural
Design, GFS Architecture, Single Master Design, Chunk Size, Metadata,
System Interactions, Write process, Consistency Model, Master
Operations, Locking Operations, Replica Placements, Garbage collection,
Fault Tolerance and Diagnosis

Total 46

Text/ Reference Books:

1. Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill
2. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”,
Pearson Ed.
3. Gerald Tel, "Distributed Algorithms", Cambridge University Press
Laxmi Publicationa (P) Ltd., New Delhi.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TIT-851 Course Title: Business Intelligence

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: TCS671

5. Course Outcomes: After completion of the course students will be able to

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

6. Detailed Syllabus
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 extract
Unit – II 9
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
Introduction to OLTP and OLAP
OLTP:- Queries that an OLTP system can process, Advantage of an
Unit – III 9
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 presentation 9
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 821 Course Title: Soft Computing

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Good Knowledge of Artificial intelligence

5. Course Outcomes: After completion of the course students will be able to

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.
7. Detailed Syllabus

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 Forward
Unit - II 8
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 simple
Unit – V 9
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 823 Course Title: Multimedia Systems and

Data Compression
2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Excellent knowledge of Computer Network and Communication

5. Course Outcomes: After completion of the course students will be able to

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

6. Detailed Syllabus

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
Unit – III models; Basic steps of image processing, Scanner, Digital Camera, 9
Gamma Correction, General Study of the following image formats:
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, FLAC, WMA, Audio
Unit – IV Playing Software, Audio Recording using Dolby, Dolby Digital and Dolby 9
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

Text/ Reference Books:

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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 824 Course Title: Computer Graphics

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Excellent knowledge of mathematics

5. Course Outcomes: After completion of the course students will be able to

1. Understand the structure of modern computer graphics systems

2. Understand the basic principles of implementing computer graphics primitives
3. Familiarity with key algorithms for modeling and rendering graphical data
4. Develop, design and problem solving skills with application to computer graphics
5. Gain experience in constructing interactive computer graphics programs using OpenGL
6. Assess the two dimensional viewing
6. Detailed Syllabus

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 Software,
Unit – I 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

Three Dimensional viewing, Transformations from world to viewing

coordinates, 3-D clipping
Unit – III 9
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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 825 Course Title: Computational Geometry

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Excellent knowledge of Graph Theory

5. Course Outcomes: After completion of the course students will be able to

1. Analyze randomized algorithms for small domain problems.

2. Use line-point duality to develop efficient algorithms.
3. Apply geometric techniques to real-world problems in graphics.
4. Solve linear programs geometrically
5. Understand the use of randomization in computational geometry
6. Describe the voronoi diagrams and its applications

7. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Convex hulls: construction in 2d and 3d, lower bounds; Triangulations:
Unit – I polygon triangulations, representations, point-set triangulations, planar 10
graphs
Voronoi diagrams: construction and applications, variants; Delayney
Unit - II triangulations: divide-and-conquer, flip and incremental algorithms, duality 9
of Voronoi diagrams, min-max angle properties
Geometric searching: point-location, fractional cascading, linear
programming with prune and search, finger trees, concatenable queues,
Unit – III 10
segment trees, interval trees; Visibility: algorithms for weak and strong
visibility, visibility with reflections, art-gallery problems
Arrangements of lines: arrangements of hyper planes, zone theorems,
Unit – IV many-faces complexity and algorithms; Combinatorial geometry: Ham- 9
sandwich cuts
Sweep techniques: plane sweep for segment intersections, Fortune's
sweep for Voronoi diagrams, topological sweep for line arrangements;
Unit – V Randomization in computational geometry: algorithms, techniques for 8
counting; Robust geometric computing; Applications of computational
geometry
Total 46
Text/ Reference Books

1. Franco P. Preparata and Michael Ian Shamos; “Computational Geometry: An

Introduction “,SpringerVerlag ,1985.
2. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf
,“Computational Geometry, Algorithms and Applications”,; Springer-Verlag, 1997.
from Springer.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 826 Course Title: Unix Systems

Programming
2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Excellent Knowledge of Operating Systems and C- programming

5. Course Outcomes: After completion of the course students will be able to

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

6. Detailed Syllabus

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, Seeking to a file
Unit – I 9
offset: lseek(), File control: fcntl(), Locking, Open file 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 Management:
Unit - II 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, Blocking
Unit – IV 8
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
Text/ Reference Books:

1. Richard Stevens and Stephen Rago,” Advanced Programming in the Unix Environment”,
Addison-Wesley
2. Michael Kerrisk,” The Linux Programming Interface”, No Starch Press
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 851 Course Title: Storage Networks

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Knowledge of Database and Networking is required

5. Course Outcomes: After completion of the course students will be able to

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

6. Detailed Syllabus

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
I/O techniques
I/O path from CPU to storage systems, SCSI technology – basics &
protocol, SCSI and storage networks, Limitations of SCSI
Unit – III 10
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

Text/ Reference Books:

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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 852 Course Title: Pattern Recognition

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Knowledge of Probability theory, mathematics and algorithms is required

5. Course Outcomes: After completion of the course students will be able to

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

6. Detailed Syllabus

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 measures,
Unit – III 10
criteria function for clustering
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 855 Course Title: Agile Software

Engineering
2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: TCS 602

5. Course Outcomes: After completion of the course students will be able to

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.

6. Detailed Syllabus

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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS857 Course Title: Game Theory

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite: Excellent knowledge of programming and mathematics

5. Course Outcomes: After completion of the course students will be able to

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.

6. Detailed Syllabus

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
 Bayesian Games, Extensive Games with Imperfect Information:
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.
Unit – III 10
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; Strategies in an
Unit – IV infinitely repeated Prisoner’s dilemma; Some Nash equilibria of an infinitely 8
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.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 810 Course Title: Virtual Reality

2. Contact Hours: L: 3 T: - P: -
3. Semester: VIII

4. Pre-requisite:

5. Course Outcomes: After completion of the course students will be able to

1. Demonstrate an understanding of techniques, processes, technologies and equipment

used in virtual reality
2. Identify appropriate design methodologies for immersive technology development,
especially from a physiological perspective
3. Exploit the characteristics of human visual perception in Virtual Reality techniques
4. Provide rendering to VR specific problems
5. Effectively categorize the benefits/shortcomings of available VR technology platforms.
6. Discuss the use of geometry in virtual reality

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction: Goals, VR definitions, Birds-eye view (general,
hardware, software, sensation and perception), Applications of VR,
Technical framework, Mixed and Augmented Reality
Geometry of Virtual Worlds: Geometric modeling, Transforming
Unit - I models, Matrix algebra, 2D and 3D rotations, Axis-angle 8
representations, Quaternions, Converting and multiplying rotations,
Homogeneous transforms, Eye Transforms, Canonical view
transform, Viewport Transform
Light and Optics: Interpretations of light, Refraction, Simple
lenses, Diopters, Imaging properties of lenses, Lens aberrations,
Unit - II 9
Photoreceptors, Sufficient resolution for VR, Light Intensity, Eye
movements for VR, Neuroscience of vision
Visual Perception and Tracking Systems: Depth perception,
Motion Perception, Frame rates and displays, Orientation Tracking,
Unit – III Tilt drift correction, Yaw drift correction, Tracking with a camera, 9
Perspective n-point problem, Filtering, Lighthouse approach

Visual Rendering: Shading models, rasterization, Pixel shading,

Unit – IV VR specific problems, Distortion shading, Post-rendering image 9
wrap
 Audio: Physics and physiology, Auditory perception, Auditory
Localization, Rendering, Spatialization and display, Combining
other senses, Spatial Sound
Unit – V 8
Interfaces: Locomotion, Manipulation, System Control, Social
Interaction, VR Engines and Other Aspects of VR, Evaluation of
VR systems
Total 43

Text Books:

1. Grigore C. Burdea , Philippe Coiffet, “Virtual Reality Technology”, Wiley-IEEE press

2. Marschner, Shirley "Fundamentals of Computer Graphics", 4th Edition, CRC Press 2016
3. LaValle "Virtual Reality", Cambridge University Press, 2016
4. “Virtual Reality”, Steve Lavalle (online open book)

Reference Books:

1. K. S. Hale and K. M. Stanney, “Handbook on Virtual Environments”, 2nd edition, CRC Press,
2015
2. George Mather,” Foundations of Sensation and Perception:” Psychology Press