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 should be able to

1. Explain the Java programming features and develop programs to demonstrate the same.
2. Make use of object oriented concepts to develop applications
3. Classify exceptions and demonstrate applications for file handling and multithreading.
4. Analyze collection framework and develop applications using GUI.
5. Compare and utilize collection framework for programming applications
6. Design applications for event handling and accessing databases using Java features.
6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction to Java :Importance and features of Java, Concepts of Java
Virtual machine (JVM) Keywords, Constants, Variables and data types,
operators and expressions, Control statements, Conditional
statements,loops and iterations,Wrapperclasses,Scanner Class: Scanner
Unit - I class methods (next(),nextLine() etc. 10

Concept of class: Class definition, adding variables and methods, creating

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

Exception handling: Exception Types, Exception class, RuntimeException

Class, Error Class, Checked and uncheced Exceptions, Defining new
exceptions; Handling: try, catch and finally; throw statement, throws clause.

Input/Output:Basics, Byte and Character Streams, reading and writing from

Unit – III console and file.
9

Multithreaded programming: Java thread model, synchronization,

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

Unit – V Java Database Connectivity (JDBC):The Concept of JDBC, JBDC 9

drivers(Type1 Driver,Type4 Driver), Connection interface, Statement
interface, ResultSet interface, Creating and executing SQL statements.

Total 46

Text books:

1. Patrick Naughton and Herbert Schildt, “Java 2 The Complete Reference”, 9 th edition, McGraw Hill
Education, 2017.
2. Bruce Eckel, “Thinking in Java”, 4thedition,Pearson Education India, 2008
3. E. Balaguruswamy, “Programming with Java a Primer”, 4thedition, Tata McGraw Hill, 2009.

Reference Books:

1. Cay S Horstmann and Gary Cornell, “Core Java Volume –I and II”, Standard edition, Sun
Microsystems, 2001
2. Harvey Deitel and Paul Deitel, “Java How to Program” , 4thedition, PHI Learning, 2004
 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. Demonstrate the conversion of NFA into DFA, ϵ-NFA into DFA and Minimization of Finite Automata by
using Myhill-Nerode Theorem
2. Formulate DFA, RE and FA with output.
3. Design CFG and check the language is not CFL.
4. Design PDA and convert n-PDA into d-PDA.
5. Design Turing machines for addition, substraction, multiplication etc.
6. Formulate finite machines, push down automata and Turing machines for automated functioning of
devices.

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
Regular Languages, Pumping Lemma for regular Languages. Application of
Unit - II 10
Pumping Lemma, Closure properties of Regular Languages, Decision
properties of Regular Languages, FA with output: Moore and Mealy
machine, Equivalence of Moore and Mealy Machine, Applications and
Limitation of FA.
Context free grammar (CFG) and Context Free Languages (CFL): Definition,
Examples, Derivation, Derivation trees, Ambiguity in Grammar, Inherent
ambiguity, Ambiguous to Unambiguous CFG, Useless symbols,
Unit – III 9
Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure
proper ties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and
Membership, Pumping lemma for CFLs.
Push Down Automata (PDA): Description and definition, Instantaneous
Description, Language of PDA, Acceptance by Final state, Acceptance by
Unit – IV 10
empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA
and PDA to CFG, Two stack PDA.
Unit – V Turing machines (TM): Basic model, definition and representation, 8
Instantaneous Description, Language acceptance by TM, Variants of Turing
Machine, TM as Computer of Integer functions, Universal TM, Church’s
Thesis, Recursive and recursively enumerable languages, Halting problem,
 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 403 Course Title: Microprocessors

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

3. Semester: IV

4. Pre-requisite: TEC 101, TEC 201, TCS 101, TCS 301

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

1. Identify of 8085 and 8086 microprocessors and memory segmentation

2. Analysis of Instruction set of 8085and 8086.
3. Implementation of different programs on 8085 and 8086 based microcomputer kit.
4. Design the Interfacing of 8255 and 8085/8086.
5. Design & develop Interfacing of microprocessor with Timing Devices1
6. Evaluate & Develop projects on embedded system using the foundation of microporcessor

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction to Microprocessors: Evolution of
Microprocessors,Microcomputer , different type of buses, Example of an
Unit – I 9
8085 based System, Microprocessor Internal Architecture, Pin diagram and
function of each pin, memory interfacing.
Programming with 8085: Instruction set, programming model of 8085,
addressing modes, assembly language programming, Timing and control,
Unit - II 10
peripheral I/O, memory mapped I/O, 8085 Interrupts, Stack and subroutines,
Machine & Instruction cycle of 8085.
16 Bit Processor: 16-bit Microprocessors (8086 ): Architecture, pin diagram,
Physical address, segmentation, memory organization, Bus cycle,
Unit – III 8
Addressing modes, Instruction set ,Assembly Language Programming of
8086, comparison of 8086 & 8088
Interfacing (Data Transfer) with Microprocessor: Data Transfer Schemes:
Introduction, handshaking signals, Types of transmission, 8255 (PPI), Serial
Unit – IV 8
Data transfer (USART 8251), memory interfacing, 8257 (DMA),
programmable interrupt Controller (8259).
Interfacing of Microprocessor with Timing Devices: Programmable Interval
Timer/ Counter (8253/8254): Introduction, modes, Interfacing of 8253,
Unit – V 9
applications, Need of ADC & DAC, resolution,Introduction to DAC & ADC,
ADC & DAC Interfacing (0808, 0809).
Total 44

Text Book:
1. Ramesh Gaonkar, “Microprocessor Architecture, Programming, and Applications with the 8085”, 5th
Edition, Penram International Publication (India) Pvt. Ltd.
2. Douglas V. Hall, “Microprocessors and Interfacing”, 2nd Edition, TMH, 2006.
Reference Book:
1. Kenneth L. Short, “Microprocessors and programmed Logic”, 2nd Ed, Pearson Education Inc.
2. A.K.Ray&K.M.Bhurchandi, “Advanced Microprocessors and peripherals” , Tata McGraw Hill, 2000.2nd
edition
 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
Unit – I Representation, Complement Systems: One’s complement and Two’s 10
complement, Addition and Subtraction using signed numbers, Multiplication
of Positive Numbers, Signed Operand Multiplication, Integer Division;
Floating Point Representation, , The IEEE-754 Floating Point
Standard,Floating Point Arithmetic, Floating Point Errors

Machine Instructions and Programs: Memory Location and Addresses,

Memory Operations, Instructions and Instruction Sequencing, Addressing
Modes, , Execution of a Complete Instruction, Single Bus Organization,
Control Unit Operations: Instruction sequencing, Micro operations and
Register Transfer. Hardwired Control,
Unit - II 12
Micro-programmed Control: Basic concepts, Microinstructions and micro-
program sequencing
Performance – Processor Clock, Basic Performance Equation, Clock Rate,
Performance Measurement
Concept of Pipelining, Amdahl’s Law
Input/Output Organization: Accessing I/O Devices, Interrupts – Interrupt
Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices,
Unit – III 9
Controlling Device Requests, Exceptions, Direct Memory Access, Buses
Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB
Unit – IV Memory System: Basic Concepts, Types of Memory, Speed, Size, and 9
Cost, The Memory Hierarchy, Locality of Reference, Cache Memories –
Mapping Functions, Replacement Algorithms, Effective Access Time and Hit
Ratio, Virtual Memory-Paging, Advantages and Disadvantages of Paging
and Virtual Memory, Segmentation, Paging Combined with Segmentation,
 Real World Example of Memory Management-Pentium 4 Memory
Management
Introduction to Alternative Architectures: RISC Machines, Flynn’s
Taxonomy, Parallel and Multiprocessor Architectures: Instruction level
pipelining,Superscalar and VLIW, Vector Processors, Interconnection
Unit – V 8
Networks, Shared Memory Multiprocessors, Closely and Loosely coupled
multiprocessors systems; Alternative Parallel Processing Approaches:
Dataflow Computing, Neural Networks.
Total 48

Text Books:
 William Stallings:” Computer Organization & Architecture”, 8th Edition, PHI, 2010.
 Carl Hamacher, ZvonkoVranesic, SafwatZaky:” Computer Organization”, 5th Edition, Tata McGraw Hill,
2002.

Reference Books:
 David A. Patterson, John L. Hennessy: “Computer Organization and Design – The Hardware / Software
Interface ARM Edition”, 4th Edition, Elsevier
 Linda Null, Julia Lobur: “Computer Organization and Architecture”, Jones and Bartlett Publishers, 2003
Edition
 Name of Department:- Computer Science and Engineering

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

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

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

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

1. Discuss various asymptotic notations to analyze time and space complexity of algorithms
2. Analyze the various paradigms for designing efficient algorithms using concepts of design and conquer,
greedy and dynamic programming techniques
3. Provide solutions to complex problems using the concept of back tracking and branch and bound
techniques.
4. Apply algorithm design techniques to predict the complexity of certain NP complete problems.
5. Implement Dijkstra’s, Bellman-ford, Prims, Kruskal’s algorithms to solve the real world problems like
traveling salesman problem, job sequencing, packet routing etc
6. Apply pattern matching algorithms like Rabin Karp Algorithm, Brute-force techniques etc to find a
particular pattern.

6.Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
Asymptotic Notations and Searching Algorithms
Introduction to Algorithms - What is an Algorithm, Rate of growth,
Commonly used rate of growths, Types of analysis, Asymptotic Notations,
Unit – I Master theorem 8
Searching - Linear search (sorted and unsorted), Iterative and recursive
binary search, Exponential search, Tower of Hanoi and solving its recursion,
Fibonacci and solving its recursion
Sorting AlgorithmsSorting - Bubble sort, Insertion sort, selection sort,
quick sort, randomized quick sort, merge sort, Heap & Heap sort , counting
sort, External sorting, Radix sort , bucket sort.
Unit - II Divide sorting algorithms into following types - online sort, stable sort, in 10
place sort, Comparison of sorting algorithms on the basis of number of
swaps, by number of comparisons, recursive or iterative nature, time and
space complexity
Graph Algorithms
Representation of Graphs, Breadth-first search (BFS), depth-first search
(DFS), topological sort, Difference between BFS and DFSData structures
for disjoint sets - Finding cycle in a graph, Finding strongly connected
Unit – III 12
components
Minimum spanning trees - Kruskal and Prim algorithms (Greedy
Algorithms)Single source shortest paths - Dijkstra (Greedy Approach) and
Bellman ford (Dynamic Programming) algorithms, Working on -ve edge &
cycle, difference & similarity.
All pair shortest paths - The Floyd Warshall algorithm
Unit – IV Algorithm Design Techniques - Greedy and Dynamic 10
 Programming
Greedy algorithms –Optimal substructure property,Activity selection
problem, Job sequencing problem, Huffman codes, fractional knapsack
problem
Dynamic Programming - Overlapping substructure property, Optimal
substructure property, Tabulation vs Memoization, Fibonacci numbers, 0/1
Knapsack problem, Longest common subsequence, Matrix chain
multiplication, Longest increasing subsequence.
Hashing, String Matching and NP-Completeness
Hashing - Introduction to Hashing, Hash function, Collision and collision
handling, - Chaining, Open addressing (longest probing, quadratic probing,
double hashing )
Unit – V String Matching - Naive string-matching algorithm, The Rabin-Karp 10
algorithm, The Knuth-Morris-Pratt algorithm,Trie.
NP-Completeness - Importance of NP-completeness, P, NP, NP Complete
and NP hard problems, Polynomial time and polynomial time verification,
The subset-sum problem, The traveling salesman problem
Total 50

Text Books:

1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein:” Introduction to Algorithms”, 2nd
Edition, PHI, 2006.

Reference Books:

1. Donald E.Knuth:”The Art of Computer Programming: Volume 1: Fundamental Algorithms”,3 rd Edition

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

1. Subject Code: Course Title: Virtualization and Cloud

TCS 451
Computing
2.Contact Hours: L: 3T: - P: 2
3. Semester: IV
4. Pre-requisite: TCS 101, TCS351
5. Course Outcomes: After completion of the course students will be able to
1. Discuss the different paradigms of cloud computing.
2. Contrast parallel and distributed computing.
3. Identify the concept of virtualization technique.
4. Apply virtualization technique in cloud computing platform.
5. Describe the architectures of cloud computing.
6. Demonstrate the Use case of the virtualization and cloud computing services.
6 Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction to Cloud Computing
Why Cloud Computing (CC)? Different Perspectives on CC, Different Stakeholders
in CC, Total cost of ownership (TCO) of on-premises IT, Cloud Computing
Taxonomy, Characteristics of cloud computing, Characteristics of cloud computing
as per NIST, Cloud DefinitionsCloud Computing at a Glance, The Vision of Cloud
Unit - I Computing, Cloud Computing Reference Model, Challenges Ahead, Historical 9
Developments, Distributed Systems, Virtualization, Web 2.0, Service-Oriented
Computing, Utility-Oriented Computing, Building Cloud Computing Environments,
Application Development, Infrastructure and System Development, Computing
Platforms and Technologies, Amazon Web Services (AWS), Google AppEngine,
Microsoft Azure, Hadoop, Force.com and Salesforce.com
Virtualization
Introduction, Characteristics of Virtualized Environments, Taxonomy of
Virtualization Techniques, Execution Virtualization, Types of hardware
virtualization: Full virtualization - partial virtualization - para virtualization
Unit - II 9
Desktop virtualization: Software virtualization – Memory virtualization - Storage
virtualization – Data Virtualization – Network virtualizationVirtualization and
Cloud Computing, Pros and Cons of Virtualization, Technology Examples, Xen:
Para virtualization, VMware: Full Virtualization, Microsoft Hyper-V.
Virtual Machines
Virtual machines basics, Process virtual machines: Memory architecture emulation,
Unit – III Instruction emulation, Operating system emulation, Dynamic binary optimization, 8
High level VN architecture, System virtual machines: Resource virtualization
(Processors, Memory, Input/Output), Case Study of Intel VT-x
Parallel and Distributed Computing
Eras of Computing, Parallel vs. Distributed Computing, Elements of Parallel
Computing, What is Parallel Processing?, Hardware Architectures for Parallel
Processing, Approaches to Parallel Programming, Levels of Parallelism, Laws of
Unit – IV Caution, Elements of Distributed Computing, General Concepts and Definitions, 8
Components of a Distributed System, Architectural Styles for Distributed
Computing, Models for Inter-Process Communication, Technologies for Distributed
Computing, Remote Procedure Call, Distributed Object Frameworks, Service
Oriented Computing
Unit – V Cloud Computing Architecture 9
Fundamental Cloud Architectures - Workload Distribution Architecture - Resource
Pooling Architecture - Dynamic Scalability Architecture – Elastic Resource
Capacity Architecture -Service Load Balancing Architecture – Cloud Bursting
Architecture - Elastic Disk Provisioning Architecture – Redundant Storage
Architecture. Cloud Computing Reference Architecture (CCRA):
 Introduction, benefits of CCRA, Migrating into a Cloud: Introduction, Challenges
while migrating to Cloud, Broad approaches to migrating into the cloud, Seven-step
model of migration into a cloud, Migration Risks and Mitigation.
Total 43

Text Books:
 Mastering Cloud Computing by RajkumarBuyya etc., Published by McGraw Hill, 2013
 Virtual Machines by James E. Smith, Ravi Nair, Published by MK Publishers
 V K Pachghare, Cloud Computing, PHI, 2016

Reference Books:
 Barrie Sosinsky , Cloud Computing Bible, Wiley Publishing Inc.,2011
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Statistical Data

TCS 471
Analysis with R
2. Contact Hours: L: 3 T: - P: 2
3. Semester: IV

4. Pre-requisite: TMA101, TCS 201, TCS351

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

1. Understand the concepts of statistics

2. Apply the probability distribution techniques in different applications.
3. Understand the needs of data preprocessing
4. Implement the manipulation and processing of data in R
5. Apply the concepts of functions in R
6. Understand the use of R in data Analytics

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Statistics: Introduction to Statistics- Descriptive Statistics, Summary
Statistics Basic probability theory, Statistical Concepts (uni-variate and bi-
Unit – I 9
variate sampling, distributions, re-sampling, statistical Inference, prediction
error),
Probability Distribution: Introduction to Probability, Probability Distribution
(Continuous and discrete- Normal, Bernoulli, Binomial, Negative Binomial,
Unit - II Geometric and Poisson distribution) , Bayes’ Theorem, Central Limit 10
theorem, Data Exploration & preparation, Concepts of Correlation,
Regression, Covariance, Outliers.
Introduction to R and Data Preprocessing: Introduction & Installation of
R, R Basics, Finding Help, Code Editors for R, Command Packages,
Unit – III Manipulating and Processing Data in R, Reading and Getting Data into R, 10
Exporting Data from R
Objects and Data Types: Data Objects-Data Types & Data Structure.
Viewing Named Objects, Structure of Data Items, Manipulating and
Unit – IV Processing Data in R (Creating, Accessing, Sorting data frames, Extracting, 8
Combining, Merging, reshaping data frames), Control Structures
Functions:Functions in R (numeric, character, statistical), working with
objects, Viewing Objects within Objects, Constructing Data Objects, Building
R Packages, Running and Manipulating Packages, Non parametric Tests-
Unit – V ANOVA, chi-Square, t-Test, U-Test, Introduction to Graphical Analysis, 9
Using Plots(Box Plots, Scatter plot, Pie Charts, Bar charts, Line Chart),
Plotting variables, Designing Special Plots, Simple Liner Regression,
Multiple Regression
Total 46

Text/ Reference Books:

1. Dr. Mark Gardener, “Beginning R: The Statistical Programming Language”, John willey& Sons, 2012
2. John M. Quick, “Statistical Analysis with R”, Pckt Publishing, 2010
Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 431 Course Title: Microcontroller and Its

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

4. Pre-requisite: TCS331

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

1. Understanding the concept of embedded system.

2. Assembly language programming of 8051
3. Study of Arduino.
4. Interfacing of different IC with 8051.
5. Design and develop systems based on 8051 micro-controller and its interfaces.
6. Understand the working of interrupts
6. Detailed Syllabus
 Sl. Contents Contact
No. Hours

1 MICROCONTROLLER: Difference between Microprocessors and Micro- 10

controllers, Types of Micro-controllers, Memory structure of 8051,
Processor Architecture – Harvard v/s Von Neumann, CISC v/s RISC,
8051 Architecture ,Micro-controller Memory types – control storage,
variable area, stack, hardware register space, SFR,8051 pin diagram..

2 9
8051 Instruction Set:
Addressing modes, external addressing, Instruction execution, Instruction
set – data movement, arithmetic, bit operators, branch, Software
development tools like assemblers, simulators, O/P file formats.
Assembling and running an 8051 program, 8051 data types, 8051 flag bits
and the PSW register, 8051 register banks and stack
3 9
PROGRAMMING OF 8051 and INTERRUPTS:
Programming of 8051, I/O bit manipulation. Timer, counter, programming
of timer, 8051 interrupts, Interrupts priority in the 8051, and interrupts
programming.

4 INTRODUCTION TO ARDUINO IDE PLATFORM 9

Introduction to ATMEGA328 microcontroller and to Arduino IDE,

Hardware,Characteristics,Interfacing with different peripheral
devices,Debugging hardware errors,Using PWM I/O pins,Interfacing
Arduino hardware with Internet of Things

5 8
INTERFACING:
Interfacing with 8051: LCD, Keyboard, ADC, DAC interfacing, Sensor
interfacing and Signal Conditioning, Stepper motor and DC motor, Basics
of serial communications, 8051 connection to RS-232, 8051 serial port
programming assembly.
Total 45

Text Books
1. Mazidi,”The 8051 Microcontrollers & Embedded Systems”, Pearson Education, 2007
2. MykePredko ,“Programming and Customizing the 8051 Micro-controller”,Tata McGraw-Hill edition,
2003
3. Brad Kendall,”Arduino Make use of:A complete beginner guide”,2013
Reference Books
1. Kenneth Ayala, “The 8051 Microcontroller”, West Publishing Company, 1993
2. Julien Bayle,”C-Programming for Arduino” , 2013
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Introduction to Cryptography

TCS 491

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

4. Pre-requisite: None

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

1. Classify security vulnerabilities involved in data communication over Internet and make use of classical
algorithms to address the vulnerabilities.
2. Make use of symmetric block ciphers to secure data transmission and storage
3. Analyze challenges involved in key distribution and select approache that can be adopted
4. Evaluate different Public Key algorithms, their mathematical background and make use of the same for
data communication and message authentication
5. Categorize types of viruses, worms, intrusion and decide measures to counter the threats.
6. Criticize the legal aspects related to Cybercrime, Intellectual Property, Privacy, Ethical Issues.
6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction: Computer Security Concepts: The OSI Security
Architecture, Security Attacks, Security Services, Security
Mechanisms, a Model for Network Security, Standards
Unit - I
Cryptography fundamentals and terminology; Cryptanalysis and 8
Brute-Force Attack, Fundamental techniques of cryptography –
Substitution and Transposition; Classical Ciphers; Basics of
Steganography
Modern Cryptography : Symmetric Encryption and Message
Confidentiality: Symmetric Encryption Principles,Fiestal structure.
Unit - II
Symmetric Block Encryption Algorithms Simple DES, DES and 9
Simple AES, Stream Ciphers and RC4, Random and Pseudorandom
Numbers,
Symmetric key distribution using symmetric encryption: A Key
Distribution Scenario, Session Key Lifetime, A Transparent Key
Unit – III Control Scheme, Decentralized Key Control, Controlling Key Usage
10
Mathematical Background for cryptography: Prime and Relatively
Prime Numbers, Euclid’s algorithm for GCD, Extended Euclid’s
Algorithm for Multiplicative Inverse, Euler’s Totient function.
Public-Key Cryptography: Public-Key Encryption Structure,
Applications for Public-Key Cryptosystems, Requirements for Public-
Unit – IV Key Cryptography, The RSA Public-Key Encryption Algorithm, Digital
Signature. 9
Message Authentication: Approaches to Message Authentication,
Authentication Using Conventional Encryption, Message
Authentication without Message Encryption, MD5 Hash Algorithm.
Unit – V Electronic mail security-pretty good privacy (PGP). 8
System Security: Intruders, Intrusion Detection, Password
Management, Types of Malicious Software, Viruses, Virus
Countermeasures, Worms and Principles of Firewalls
Legal and Ethical Aspects: Cybercrime and Computer Crime,
 Intellectual Property, Privacy, Ethical Issues
Total 44

Text Books:

 William Stallings, Network Security Essentials – Applications and Standards, 4th edition, Pearson
Education, 2011
 William Stallings , Cryptography and Network Security, 7th Edition , Pearson Education, 2017
Reference Books:

 Behrouz Forouzan , Cryptography and Network Security, 3rd Edition, McGraw Hill, 2015
 Atul Kahate, "Cryptography and Network Security", Third edition, McGraw Hill Education, 2017.
 Name of Department:- Computer Science and Engineering

1. Subject Code: Course Title: Fundamental of Statistics

TCS 421
and AI
2. Contact Hours: L: 3 T: 1 P: 2
3. Semester: IV

4. Pre-requisite: TMA101, TMA201

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

1. Demonstrate knowledge of statistical and exploratory data analysis data analysis techniques
utilized in decision making.
2. Apply principles of Data Science to the analysis of business problems.
3. To use Machine Learning Algorithms to solve real-world problems.
4. To provide data science solution to business problems and visualization.
5. To learn the basic concepts and techniques of AI and machine learning
6. To explore the various mechanism of Knowledge and Reasoning used for building expert
system.
6.Detailed Syllabus
 Sl. Contents Contact
No. Hours

1 Introduction to AI 10

Definition, Problem, State space representation. Intelligent Systems:

Categorization of Intelligent System, Components of AI Program,
Foundations of AI, Applications of AI, Current trends in AI, Intelligent
Agents: Anatomy, structure, Types.

2 Problem solving 9

Solving problem by Searching: Problem Solving Agent, Formulating

Problems. Uninformed Search Methods: Breadth First Search (BFS),
Depth First Search (DFS), Depth Limited Search, Depth First Iterative
Deepening (DFID), Informed Search Methods: Greedy best first Search,
A* Search, Memory bounded heuristic Search. Local Search Algorithms
and Optimization Problems: Hill climbing search Simulated annealing,
Local beam search.

3 An Introduction to Data Science 9

Definition, working, benefits and uses of Data Science, Data science vs BI,
The data science process, Role of a Data Scientist.

4 Statistical Data Analysis & Inference 9

Populations and samples, Statistical modelling, probability distributions,

fittings a model, Statistical methods for evaluation, Exploratory Data
Analysis, Getting started with R, Manipulating and Processing data in R,
working with function in R, Working with descriptive Statistics, Working
with graph plot in R.

5 Statistical Applications 8

Basic Statistical operations, Linear Regression Analysis, Logistic and

Exponential Regression, Time Series Analysis, Probability Distribution,
ANOVA, Correlation and Covariance.

Total 45

Text/ Reference Books:

1. Tom M. Mitchell. "Machine Learning" McGraw-Hill, 1997. 

“Statistical programming in R”, Oxford University Press 2017
 Name of Department: - Computer Science and Engineering

1. SubjectCode: TCS 601 Compiler Design

Course Title:
2. ContactHours: L: 3
T: P:
- -
3. Semester:VI

4. Pre-requisite: TCS-402

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

1. Appraise the principles of compiler design like lexical, syntactical, semantic analysis, code

generation and optimization.
2. Compare and contrast various parsing techniques such as SLR, CLR, LALR, etc.
3. Use annotated tree to design the semantic rules for different aspects of programming language.
4. Implement lexical analyzer and parser by using modern tools like Flex and Bison.
5. Examine patterns, tokens & regular expressions for solving a problem in the field of data mining.
6. Design a compiler for a concise programming language.

6. DetailedSyllabus
UNIT CONTENTS CONTACT Hrs
Introduction: Compiler Introduction; Analysis of source program; Phases and
Passes of Compiler; Symbol table & its implementation; Cousins of a
Unit – I Compiler; Compiler Construction Tools; Bootstrapping: Regular Grammar and 9
Regular Expressions.
Lexical analysis: Role of a Lexical Analyzer; Input Buffering; Specifications of
Tokens; Recognition of Tokens; LEX Tool and its Implementation
Syntax Analysis: Introduction toCFG; Writing a Grammar; Ambiguous
Unit - II Grammars; Role of a Parser; Basic Parsing Techniques; Top-down Parsing;
Bottom-up Parsing; Operator-Precedence Parsing; Parser Generators (YACC) 10
Syntax-Directed Translation: Syntax-Directed Definitions; Constructions of
Syntax Trees; Bottom-Up Evaluation of S-Attributed Definitions; L-Attributed
Unit – III Definitions; Top-Down Translation. 10
Run-Time Environments: Source Language Issues; Storage-Allocation
Strategies, Parameter Passing: Stack/Heap Allocation. Error Handling
Intermediate Code Generation (ICG): Intermediate Code; ICG using Postfix
Notation, Syntax Tree, Directed Acyclic Graph (DAG); Three Address Code;
Quadruples & Triples; Back Patching; Intermediate Languages; Declarations;
Assignment Statements; Boolean Expressions; Case Statements;; Procedure
Unit – IV Calls; Array References: 12
Code Optimization: Introduction toCode Optimization; Principal Sources of
Optimization; Machine Dependent & Independent Code Optimization;
Peephole optimization; Global and Local Optimization of Basic Blocks.
Code Generation: Code Generation Issues; The Target Machine; Basic Blocks
And Flow Graphs; Next-Use Information; A Simple Code Generator; Register
Unit – V Allocation & Assignment; DAG Representation of Basic Blocks; Generating 9
CodeFrom DAG.
Compiler Development: Planning a Compiler; Compiler Development
Approaches; Compiler development environment; Testing &Maintenance.
Total 50
Text Books:
1. AlfredVAho,RaviSethi,JeffreyDUllman:“Compilers-Principles,TechniquesandTools”, Pearson
Education,2007.
Reference Books:
1. Charles N. Fischer, Richard J. leBlanc, Jr.:” Crafting a Compiler with C”, Pearson Education, 1991.
2. Andrew W Apple: “Modern Compiler Implementation in C”, Cambridge University Press, 1997.
3. Kenneth C Louden: “Compiler Construction Principles & Practice”, Thomson Education, 1997.
 Name of Department:- Computer Science and Engineering

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

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

4. Pre-requisite: Basics of Programming

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

1. Discuss Software Development Life Cycle and importance of engineering the software.
2. Development of efficient software requirement specification for desired product.
3. Compare various software development methodologies and conclude on their
applicability in developing specific type of product.
4. Construct an efficient design specification document for attainment of user desired
product.
5. Develop applications using the concepts of various phases of software development life
cycle.
6. Study various software testing techniques and identify their relevance to developing a
quality software.

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,
Type of requirements- User requirement and System
requirement ,functional& non-functional requirements, Software Myths
Software Development Life Cycles: Software Development Process, The
Unit – I Code-and-Fix model, The Waterfall model, The Evolutionary Model, The 10
Incremental Implementation, Prototyping, The Spiral Model, Software
Reuse, Critical Comparisons of SDLC models, An Introduction to Non-
Traditional Software Development Process: Rational Unified Process, Rapid
Application Development, Agile Development Process

Requirements: Importance of Requirement Analysis, User Needs, Software

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

Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance

Testing, Regression Testing, Testing for Functionality and Testing for
Performance, Top-Down and Bottom-Up Testing Strategies: Test Drivers
and Test Stubs, Structural Testing (White Box Testing), Functional Testing
Unit – IV 10
(Black Box Testing), Design test cases & Test suite preparation, Alpha and
Beta Testing of Products. Static Testing Strategies: Formal Technical
Reviews (Peer Reviews), Walk Through, Code Inspection, Automated
Testing
Software Maintenance and Software Project Management: Software as
an Evolutionary Entity, Need for Maintenance, Categories of
Maintenance:Preventive, Corrective and Perfective Maintenance, Cost of
Maintenance, Software Re-Engineering, Reverse Engineering. Software
Configuration Management Activities, Change Control Process, Software
Unit – V 8
Version Control, An Overview of CASE Tools. Estimation of Various
Parameters such as Cost, Efforts, Schedule/Duration, Constructive Cost
Models (COCOMO), Software Risk Analysis and Management.
Software Quality Assurance: SQA Plans, ISO 9000 models, SEI-CMM Model

Total 45

Text Books:
1. R. S. Pressman,” Software Engineering: A Practitioners Approach”, McGraw Hill.
2. P.K.J. Mohapatra,” Software Engineering (A Lifecycle Approach)”, New Age International
Publishers

Reference Books:
1. Ian Sommerville,” Software Engineering”, Addison Wesley.
2. Pankaj Jalote:” 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 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. 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,
Unit – I Internet Backbone, Delays: Processing, Queing, Transmission and 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
Unit – III Transport Layer: Introduction and Services, The Transport layer in internet, 6
Difference between Connection Oriented and Connectionless services
 UDP: Segment structure, checksum in UDP

Transport Layer2:The principles behind connection oriented data transfer,

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

Network Layer I: Introduction, Packet Forwarding and Routing, Difference

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

Total 45
Text Books:
1. Computer Networking: “A Top Down Approach (5th edition)”, Ross and Kurose,
Pearson/Addison-Wesley
 
Reference Books:
1. Andrew Tanenbaum and David Wetherhall, “Computer Networks(5th edition)”, Prentice
Hall
2. Peterson and Davie, “Computer Networks: A System Approach (4th edition)”, Elsevier
3. Forouzan, “Data Communication and Networking (4th edition)”, McGraw Hill
4. William Stallings: “Data and Computer Communication”, 8th Edition, Pearson Education,
2007
5. Nader F. Mir:” Computer and Communication Networks”, Pearson Education, 2007.
 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, hyperlink, lists, tables,
images, forms, XHTML, Meta tags, Character entities, frames and frame sets,
Browser architecture and Web site structure. Overview and features of HTML5.0,
data list.

2 CSS 8
Need for CSS, introduction to CSS, basic syntax and structure, using CSS, type of
CSS(inline CSS, internal CSS, external CSS), CSS Box model , material design,
SCSS, background images, colors and properties, manipulating texts, using fonts,
borders and boxes, margins, padding lists, positioning using CSS, Introduction to
Bootstrap.

3 JavaScript and jQuery 10

Client-side scripting with JavaScript, variables, functions, conditions, loops and
repetition, Pop up boxes, Advance JavaScript: JavaScript and objects, JavaScript
own objects, the DOM and web browser environments, Manipulation using DOM,
forms and validations,
DHTML: Combining HTML, CSS and JavaScript, Events and buttons.
Introduction to jQuery. Introduction to XML, uses of XML, simple XML, XML key
components, DTD and Schemas,

4 PHP 11
Introduction and basic syntax of PHP, decision and looping with examples, PHP
 UNIT CONTENTS Contact
Hrs

and HTML, Arrays, Functions, Browser control and detection, string, Form
processing, Files.
Advance Features: Cookies and Sessions, Basic commands with PHP examples,
Connection to server, creating database, selecting a database, listing database,
listing table names, creating a table, inserting data, altering tables, queries, deleting
database, deleting data and tables. XAMPP Server Configuration, introduction
tolaravel.

5. Web Application Deployment 8

Concept of WWW, Internet and WWW, HTTP Protocol: Request and Response
paradigm, Web browser and Web servers, Features of Web 2.0. Concepts of
effective web design, Web design issues including Browser, Bandwidth and Cache,
Display resolution, Look and Feel of the Website, Page Layout and linking, User
centric design, Sitemap, Planning and publishing website, Designing effective
navigation, Introduction to CMS. Ajax, AngularJS, JSON.

Total 45

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 691 Course Title: Image Processing and

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

3. Semester: VI

4. Pre-requisite: TCS 301, Any Programming Language

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

1. Identify the principals the Image Processing terminology used to describe features of
images.
2. Identify the mathematical foundations for digital manipulation of images
3. Design, code and test digital image processing applications using MATLAB/OpenCV.
4. Analyze a wide range of problems and provide solutions related to the design of image
processing systems through suitable algorithms, structures, diagrams, and other
appropriate methods.
5. Analyze the image segmentation, object recognition & image classification methods.
6. Develop methods for computer vision & image processing Application

6. Detailed Syllabus
Contact
UNIT CONTENTS
Hrs
INTRODUCTION TO IMAGE PROCESSINGAND COMPUTER VISION:
Pixels, Intensity, Coordinate Conventions, Sampling and Quantization,
Histogram Analysis, Videos, Image Processing Pipeline, Image Processing
and Computer Vision Research Areas: Low-level, Mid-Level and High-Level
Vision.
Unit – I 10
INTRODUCTION TO MATLAB / OCTAVE:BasicOpeartions, Image / Video
handling, Flow Control, Vectorization.
INTRODUCTION TO PYTHON:BasicOpeartions, Lists, Tuples, Strings,
Dictionaries, Flow Control, Numpy, Image/Video handling, OpenCV, PIL,
Orange.
IMAGE PROCESSING / LOW-LEVEL VISION:
Image Enhancement in Spatial Domain, Image Enhancement in Frequency
Unit - II Domain, Edge Detection, Image Restoration, Color Image Processing, 12
Wavelet Transform, Image Compression, Morphological Image Processing,
Stereo Vision, Motion Analysis, Local and Image Features, Visual Saliency.
MID-LEVEL VISION:
Hough Transform, Otsu Thresholding, k-means, GraphCut, GrabCut,
Unit – III 9
Normalized Cut, Watersheds, Skeleton Extraction, Object Proposals, Co-
segmentation, Background Subtraction in Videos, Motion History Image
HIGH-LEVEL VISION:
Image Classification, Object Localization, Object Recognition, Object
Unit – IV 9
Detection, CNN, AlexNet, VGG, YOLO, Image Captioning, generative
adversarial networks
 APPLICATIONS OF IMAGE PROCESSING AND COMPUTER VISION:
Video Surveillance Systems, Automatic activity recognition system, Medical
Unit – V image reconstruction , Medical Image Denoising, Multimodality medical 8
image fusion , Face Recognition and Detection ,Automatic car tracking
system.
Total 48

Text/ Reference Books:

1. "Digital Image Processing using Matlab", R. C. Gonzalez, R. E. Woods and S. L. Eddins

2. "Programming Computer Vision with Python", Jan Salem
3. "Mastering OpenCV with Practical Computer Vision Projects", D. L. Baggio, S. Emami,
D. M. Escrivá, K Levgen, N. Mahmood, J. Saragih,R.Shilkrot.
4. "Learning OpenCV 3 Computer Vision with Python", Joe Minichino and JosphHowse
5. "Deep Learning with Keras", Antonio Gulli
6. "Hands-On Machine Learning with Scikit-Learn and TensorFlow ", AurélienGéron
7. "Deep Learning for Computer Vision", RajalingappaaShanmugamani
 Name of Department: - Computer Science and Engineering

1. Subject Code: TCS 651 Course Title: DevOps on Cloud

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

3. Semester: VI

4. Prerequisite: Students should have a strong technology background, an

understating of cloud infrastructure and skill with a scripting language to master this
course.

5. Course Outcomes: On completion of this course, the student should be able to

1. Define and understand ideas of DevOps.

2. Describe and demonstrate how DevOps relate to working in the cloud.
3. Describe and demonstrate how DevOps relate to Agile and ITIL.
4. Use a public/private cloud environment as a framework to examine the ideas of
DevOps.
5. Examine some use cases, possible architectures, automation, continuous
delivery, and the public/private cloud toolsets for DevOps.
6. Implement the software engg practices

6. Details of the Course: -

Contact
UNIT CONTENTS
Hrs
An introduction to Software Engineering, SDLC, Agile Framework, An
Unit – I introduction to DevOps, Gain insights of the DevOps environment, DevOps 9
Vs Agile, DevOps Ecosystem.
Version Control with Git, Install GIT and work with remote repositories, GIT
workflows, Branching and Merging in Git. Understand the importance of
Unit - II 9
Continuous Integration, Introduction to Jenkins, Jenkins management. Build
and automation of Test using Jenkins and Maven.
Continuous Testing, learn and Install Selenium, create test cases in
Unit – III Selenium, Integrate Selenium with Jenkins, Continuous Deployment, Install 10
and configure puppet, understand master-slave architecture of puppet.
Introduction to Docker, understanding images and containers, Docker
Unit – IV Ecosystem, Introduction to Docker Networking, configuration management, 8
configuration management with Ansible, Differentiate Ansible and Puppet.
Containerization using Kubernetes, Integrate Docker and Kubernetes, Auto-
Unit – V scaling, Continuous monitoring with Nagios, operate continuous monitoring 8
tools, Implement Nagios commands.
Total 44
Books:
1. Gene Kim and George Spafford ,“The Visible Ops Handbook by Kevin Behr”, IT
Process Institute.
2. Michael Hüttermann ,”DevOps for Developers”.
3. by Eliyahu M. Goldratt, Jeff Cox ,DavidWhitford (Other Contributor) ,“The Goal: A
Process of Ongoing Improvement”,
 4. Material provided by the instructor
References:
5. “Continuous Delivery: Reliable Software Releases through Build, Test, and
Deployment Automation “, Jez Humble and David Farley
6. “The Phoenix Project”, Gene Kim, Kevin Behr, George Spafford
 Name of Department:- Computer Science and Engineering

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

Processing
2. Contact Hours: L: 3 T: - P: 2
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, HBase 9
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 619 Course Title: Network and System

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

4. Prerequisite: TCS591

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

1. Explainthe basics of computer security

2. Elaborate the cryptographic techniques.
3. Discuss the transport layer security
4. Find the pros and cons of various key distribution methods
5. Analyze the wireless Network security
6. Find the level of system security
6. Details of the Course: -

Contact
UNIT CONTENTS
Hrs
Introduction
Computer Security Concepts, The OSI Security Architecture, Security
Unit – I 9
Attacks, Security Services, Security Mechanisms, Models for network
security, standards.
Cryptography
Symmetric Encryption and Message Confidentiality Symmetric
Encryption Principles, Symmetric Block Encryption Algorithms, Random and
Pseudorandom Numbers, Stream Ciphers and RC4, Cipher Block Modes of
Unit - II Operation. 9
Public-Key Cryptography and Message Authentication 61 Approaches to
Message Authentication, Secure Hash Functions, Message Authentication
Codes, Public-Key Cryptography Principles, Public-Key Cryptography
Algorithms, Digital Signatures
Network security Application – I
Key Distribution and User Authentication
Symmetric Key Distribution Using Symmetric Encryption, Kerberos, Key
Distribution Using Asymmetric Encryption, X.509 Certificates, Public-Key
Unit – III Infrastructure, Federated Identity Management 10
Transport-Level Security
Web Security Considerations, Secure Socket Layer and Transport Layer
Security, Transport Layer Security,
HTTPS, Secure Shell (SSH)
Unit – IV Network security Application - II 8
Wireless Network Security
IEEE 802.11 Wireless LAN Overview, IEEE 802.11i Wireless LAN Security,
Wireless Application Protocol Overview, Wireless Transport Layer Security,
WAP End-to-End Security
 Electronic Mail Security
Pretty Good Privacy, S/MIME, DomainKeys Identified Mail,
IP Security
IP Security Overview, IP Security Policy, Encapsulating Security Payload,
Combining Security Associations, Internet Key Exchange, Cryptographic
Suites

System Security
Intruders
Intruders, Intrusion Detection, Password Management,
Malicious Software
Types of Malicious Software, Viruses, Virus Countermeasures, Worms,
Unit – V Distributed Denial of Service Attacks. 10
Firewalls
The Need for Firewalls, Firewall Characteristics, Types of Firewalls, Firewall
Basing, Firewall Location and Configurations,
Legal and Ethical Aspects
Cybercrime and Computer Crime, Intellectual Property, Privacy, Ethical
Issues
Total 46

Text/ Reference Books:

1. W. Stallings,” Network Security Essentials”. Prentice Hall, 2003.
2. Ch. P. Pfleeger, S. L. Pfleeger „Security in Computing”, 4th Edition Prentice Hall, 2006
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS425/TCS632 Course Title: Artificial

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

3. Semester: IV
4. Pre-requisite: TCS 101, TCS351
5. Course outcomes: After completion of the course students will be able to

1. An ability to analyze a problem, identify and define the computing requirements

appropriate to its solution.
2. An ability to design, implement and evaluate a system / computer based system
process, component or program to meet desired needs
3. An ability to identify, formulate and solve engineering problems using the concepts of
Artificial Intelligence.
4. Design and conduct experiments as well as analyze and interpret data using Machine
Learning Algorithms
5. An ability to use current techniques and skills necessary for computing and engineering
practice
6. Get familiarized with the tools mandatory for handling problem solving techniques

6.Detailed Syllabus

UNIT CONTENTS Contact

hrs
UNIT I INTRODUCTION
Introduction - Foundation and history of AI - AI Problems and techniques -
AI programming languages – Introduction to LISP and PROLOG –
Problem spaces and searches - Blind search strategies; Breadth first -
Depth first – Heuristic search techniques Hill climbing - Best first – A*
algorithm AO* algorithm – game trees - Minimax algorithm – Game
playing – Alpha beta pruning.
UNIT II KNOWLEDGE REPRESENTATION

Knowledge representation issues – Predicate logic – logic programming –

Sematic nets - Frames and inheritance - constraint propagation –
Representing Knowledge using rules – Rules based deduction system.
UNIT III REASONING UNDER UNCERTAINTY

Introduction to uncertain knowledge review of probability – Baye’s

Probabilistic inferences and Dempster Shafer theory –Heuristic methods –
Symbolic reasoning under uncertainty- Statistical reasoning – Fuzzy
reasoning – Temporal reasoning- Non monotonic reasoning.

UNIT IV PLANNING AND LEARNING

 Planning - Introduction, Planning in situational calculus - Representation
for planning – Partial order planning algorithm- Learning from examples-
Discovery as learning – Learning by analogy – Explanation based learning
–Introduction to Neural nets Genetic Algorithms.
UNIT V EXPERT SYSTEMS

Expert systems - Architecture of expert systems, Roles of expert systems

- Knowledge Acquisition - Meta knowledge, Heuristics. Typical expert
systems - MYCIN, DART, XOON, Expert systems shells.

Text/Reference Books:

1. Daugherty, Paul R., and H. James Wilson. Human+ machine: reimagining work in the
age of AI. Harvard Business Press, 2018.
2. Prateek, J.: Artificial Intelligence with Python, pp. 14–16. Packt Publishing, Birmingham
(2017).
3. Husain, Amir. The sentient machine: The coming age of artificial intelligence. Simon and
Schuster, 2017.
4. Kaplan, Jerry. Artificial intelligence: What everyone needs to know. Oxford University
Press, 2016.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TDM 881 Course Title: Disaster Management

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

4. Pre-requisite: None

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

1- Study and investigate the various types of Hazards and disasters and create
awareness in the community to effectively prevent and react to such incidents.   
2- Investigate and analyze hazards, disasters and measure their interrelationships with
the developing humanitarian activities for solving future disaster problems.
3- To study, analyze and build skills to respond to disasters and hazards with community
participation for controlling climate change.
4- To develop skills by training disaster forces and communities for successful Disaster
Risk Reduction.
5- Understand the Disaster Management Laws and Policies and effectively apply for
prevention and building the Disaster management system.
6- Building robust reaction and response systems by Technological innovations and skill
building.
6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction, Definitions and Classification:

Concepts and definitions - Disaster, Hazard, Vulnerability, Resilience, Risks

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

Unit – II Inter-relationship between Disasters and Development 8

Factors affecting vulnerabilities, differential impacts, impacts of development

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

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

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

Disaster Management Laws and Policies in India

Environmental legislations related to disaster management in India: Disaster

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

Total 34
.
Text Books:

 M MSulphey,” Disaster Management”, PHI, 2016

 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. Designperceptions 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 :
1. Satish Kumar,” Neural Networks – A Classroom approach”, Tata McGraw-Hill, New
Delhi, 2007.
2. Martin T. Hagan, Howard B. Demuth, Mark Beale, “Neural Network Design”, Thomson
Learning, India, 2002.
3. B. Kosko,” Neural Network and fuzzy systems”, PHI, 1996.
4. Klir& Yuan, “Fuzzy sets and fuzzy logic – theory and applications”, PHI, 1996.
5. Melanie Mitchell, “An introduction to genetic algorithm”, PHI, India, 1996.
 Name of Department:- Computer Science and Engineering

1. Subject Code: TCS 822 Course Title: Mobile Applications

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

4. Pre-requisite: Excellent Knowledge of JAVA programming and Database Management

System

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

1. Identify and apply the key technological principles and methods for delivering and
maintaining mobile applications,
2. Evaluate and contrast requirements for mobile platforms to establish appropriate
strategies for development and deployment,
3. Develop and apply current standard-compliant scripting/programming techniques for the
successful deployment of mobile applications targeting a variety of platforms,
4. Carry out appropriate formative and summative evaluation and testingutilising a range of
mobile platforms,
5. Interpret a scenario, plan, design and develop a prototype hybrid and native mobile
application,
6. Investigate the leading edge developments in mobile application development and use
these to inform the design process.

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Getting started with Mobility
Mobility landscape, Mobile platforms, Mobile apps development, Overview of
Unit - I Android platform, setting up the mobile app development environment along 9
with an emulator, a case study on Mobile app development

Building blocks of mobile apps

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

Taking apps to Market

Versioning, signing and packaging mobile apps, distributing apps on mobile
Unit – V 8
market place

Total 43
Text/ Reference Books:

1. Jeff McWherter, Scott Gowell, “Professional Mobile Application Development”,Wrox Publication.

2. “Mobile Application Development “Black Book, Dreamtech Press
 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
models; Basic steps of image processing, Scanner, Digital Camera, Gamma
Correction, General Study of the following image formats:
Unit – III 9
BMP,TIF,PNG,GIF,SVG
Image Compression: Approaches, Image Transforms, The Discrete Cosine
Transform, Detailed study of JPEG,JPEG-LS, Progressive image
compression, JBIG
 Acoustics and the Nature of Sound Waves, Fundamental Characteristics of
Sound, Musical Note, Pitch, Beat, Rhythm, Melody, Harmony and Tempo;
Elements of Audio Systems, General study of Microphone, Amplifier,
Loudspeaker, Mixer; Digital Audio, Synthesizers, MIDI, MIDI Connections,
MIDI messages, Staff Notation, Sound Card, Audio Codecs: AIFF, WAV,
Apple Lossless, Dolby TrueHD, DTS-HD Master Audio, FLAC, WMA, Audio
Unit – IV 9
Playing Software, Audio Recording using Dolby, Dolby Digital and Dolby
Digital Surround EX, Voice Recognition
Video: Analog Video, Transmission of Video Signals, Chroma Sub sampling,
Composite and Components Video, NTSC, PAL and SECAM, Digital Video,
High Definition TV, Video Recording Formats; Video Compression, MPEG,
MPEG-4; General Study of the following formats and codecs: avi, flv, m4v
Multimedia Messaging Service(MMS): MMS standard, MMS Architecture, An
Engineering perspective on How a MMS is created, sent and retrieved
Unit – V Introduction to Virtual Reality: Components of a VR System, Haptic 8
Interfaces, Virtual Reality Programming, Impact of Virtual Reality, Case
study of Second Life
Total 45

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

Understand the structure of modern computer graphics systems

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

Unit – III Three Dimensional viewing, Transformations from world to viewing 9

coordinates, 3-D clipping
Three-Dimensional Object Representations: Polyhedra, Curved and Quadric
surfaces, Blobby Objects, Spline Representations, Bezier Spline curves,
 Bezier Surfaces, B-Spline curves, B-Spline Surfaces, Octrees, Introduction
to fractals

Visible Surface Detection Methods: Classification, Back-Face Detection,

Depth-Buffer method, A-buffer method, Scan-Line method, Curved Surfaces
Illumination Models and Surface Rendering Methods: Basic Illumination
Unit – IV models- Ambient light, Diffuse Reflection, Specular Reflection and the 10
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

6.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 of 9
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
OtfriedSchwarzkopf ,“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 (ILM), Role of ILM,
Unit - I 10
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 levels, Hot sparing,
Unit - II 9
Hot swapping, Caching : acceleration of hard disk access, Intelligent Disk
subsystem architecture
Tape drives: Introduction to tape drives, Tape media, caring for Tape& Tape
heads, Tape drive performance, Linear tape technology, Helical scan tape
technology
Unit – III I/O techniques 10
I/O path from CPU to storage systems, SCSI technology – basics & protocol,
SCSI and storage networks, Limitations of SCSI
Fibre channel: Fibre channel, characteristic of fibre channel, serial data
transfer vs. parallel data transfer, Fibre channel protocol stack, Links, ports
& topologies, Data transport in fibre channel,
Addressing in fibre channel, Designing of FC-SAN, components,
 Interoperability of FCSAN, FC products
IP Storage: IP storage standards (iSCSI, iFCP, FCIP, iSNS), IPSAN
products, Security in IP SAN, introduction to InfiniBand, Architecture of
InfiniBand
NAS – Evolution, elements & connectivity, NAS architecture
Storage Virtualization
Introduction to storage virtualization, products, definition, core concepts,
Unit – IV virtualization on various levels of storage network, advantages and 9
disadvantages, Symmetric and asymmetric virtualization, performance of
San virtualization, Scaling storage with virtualization
Management of storage Networks
Management of storage network, SNMP protocol, requirements of
Unit – V management systems, Management interfaces, Standardized and 8
proprietary mechanism, In-band& Out-band management, Backup and
Recovery
Total 46

 
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.
Unit – V Continuous hidden Markov models : Observation densities, training and 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, Acceptance
Unit - II 10
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 Extensive games: Extensions and Discussions: Extensions: Allowing for 10

simultaneous moves, Illustrations: Entry in to a monopolized industry,
Electoral competition with strategic voters, Committee decision making, Exit
from a declining industry; Allowing for exogenous uncertainty, Discussion:
subgame perfect equilibrium and backward induction
Unit – III Bayesian Games, Extensive Games with Imperfect Information: 10
Motivational examples; General definitions; Two examples concerning
 information; Illustrations: Cournot’s duopoly game with imperfect information,
Providing a public good, Auctions; Auctions with an arbitrary distribution of
valuations.
Extensive games with imperfect information; Strategies; Nash equilibrium;
Beliefs and sequential equilibrium; Signaling games; Illustration: Strategic
information transmission.

Strictly Competitive Games, Evolutionary Equilibrium: Strictly

competitive games and maximization; Maximization and Nash equilibrium;
Strictly competitive games; Maximization and Nash equilibrium in strictly
competitive games.
Evolutionary Equilibrium: Monomorphic pure strategy equilibrium; Mixed
strategies and polymorphic equilibrium; Asymmetric contests; Variations on
themes: Sibling behavior, Nesting behavior of wasps, The evolution of sex
ratio
Iterated Games: Repeated games: The main idea; Preferences; Repeated
games; Finitely and infinitely repeated Prisoner’s dilemma; 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
Unit - I Geometry of Virtual Worlds: Geometric modeling, Transforming models, 8
Matrix algebra, 2D and 3D rotations, Axis-angle 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, Photoreceptors,
Unit - II Sufficient resolution for VR, Light Intensity, Eye movements for VR,
9
Neuroscience of vision
Visual Perception and Tracking Systems: Depth perception, Motion
Perception, Frame rates and displays, Orientation Tracking, Tilt drift
Unit – III correction, Yaw drift correction, Tracking with a camera, Perspective n-point 9
problem, Filtering, Lighthouse approach

Visual Rendering: Shading models, rasterization, Pixel shading, VR

Unit – IV specific problems, Distortion shading, Post-rendering image wrap
9
Audio: Physics and physiology, Auditory perception, Auditory Localization,
Rendering, Spatialization and display, Combining other senses, Spatial
Unit – V Sound 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
 Name of Department:- Computer Science and Engineering

1. Subject Code: TOE 811 Course Title: Mobile Computing

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

4. Pre-requisite: TIT 704, TCS 703

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

1. Explain the concepts, techniques, protocols and architecture employed in wireless local
area networks, cellular networks, and Adhoc Networks
2. Describe and analyze the network infrastructure requirements to support mobile devices
and users.
3. Interpret data management issues and distributed file system.
4. Asses the important issues and pertaining to clustering in wireless networks.
5. Value assessment of mobile agent in mobile computing environment.
6. Investigate Adhoc Routing Protocol.

6. Detailed Syllabus

Contact
UNIT CONTENTS
Hrs
Introduction, issues in mobile computing, overview of wireless telephony:
cellular concept, GSM: air-interface, channel structure, location
Unit - I 9
management: HLR-VLR, hierarchical, handoffs, channel allocation in cellular
systems, CDMA, GPRS
Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11,
Blue Tooth, Wireless multiple access protocols, TCP over wireless, Wireless
Unit - II 8
applications, data broadcasting, Mobile IP, WAP: Architecture, protocol
stack, application environment, applications
Data management issues, data replication for mobile computers, adaptive
Unit – III clustering for mobile wireless networks, CODA File system, Disconnected 9
operations
Mobile Agents computing, security and fault tolerance, transaction
Unit – IV 8
processing in mobile computing environment.
Ad Hoc networks, localization, MAC issues, Routing protocols, global state
routing (GSR), Destination sequenced distance vector routing (DSDV),
Unit – V Dynamic source routing (DSR), Ad Hoc on demand distance vector routing 9
(AODV), Optimized link state routing protocol (OLSR), QoS in Ad Hoc
Networks, applications
Total 43
.
Text/ Reference Books:
1. D.P. Agarwal, Qing Amazing”Introduction to wireless and Mobile systems” , Cengage learning
India
2. J. Schiller,” Mobile Communications”, Addison Wesley.
3. Raj Pandya “Mobile and personal communication systems and services” IEEE press.
4. Kukumgarg , “Mobile computing – Theory and practice ”, pearson.