PESU BTech Jan2017 6thsemCourseInfo

GENERAL GUIDELINES
This book is to be brought to the class daily.

Students are not permitted to attend the class without the identity card, once issued.
Students should be well on time right from the first class.
Students should keep the Classrooms, Laboratories and Workshops clean.
Writing on desks and walls is strictly prohibited, failing which the students will be fined heavily. If the identity of
the individual is not established the entire class / students in the block will be fined.
Students are advised to show due respect to all faculty regardless of their department and maintain affable personality.
Students are to maintain absolute discipline and decorum, so as to promote the fair name of their college in all its
activities.
Students securing less than 85% attendance (with a condonation benefit of 10%) in any individual subject, theory
or laboratory, will not be allowed to take up the ESA.
Students are informed to clarify their doubts in the respective courses with the faculty by taking prior appointment.
Students are to inform their parents that they should follow up the progress of their wards by being in touch with the
institution authorities at regular intervals.
Ragging is punishable under Karnataka Education Act and is strictly prohibited. Any student involved in
ragging, will be severely punished which includes handing over the case to Police, rustication from the college
etc.
The suggestion boxes are maintained at strategic places in the campus. Students are to avail these facilities.
Students should come prepared with algorithm / flowchart / program / procedure for all the experiments before
attending the laboratory session.
Students should bring the data sheets and laboratory records complete in all respects to the laboratory.
Students are not supposed to alter the configuration of the system / any software on the systems.
Students are advised to be present for the mentor meetings conducted by the Faculty Advisors failing which appropriate
disciplinary action will be taken.
B Tech VI SEMESTER (2014-18 BATCH)
P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -1

Hours / week
Sl. No. Course Code Course Title Credits Course Type
L T P S
1. UE14CS351* Compiler Design 4 0 0 0 4 CC
2. UE14CS352 Unix System Programming 3 0 0 0 3 CC
3. UE14CS353** Web Technologies-II** 4 0 0 0 4 CC
4. CC
UE14CS354 Compiler Design Laboratory 0 0 2 0 1
Unix System Programming
5. UE14CS355 0 0 2 0 1 CC
Laboratory
6. UE14CS356 Web Technologies - II Laboratory 0 0 2 0 1 CC
Elective - III
7. UE14CS331$$ Computer Network Security 4 0 0 0 4 EC
8. UE14CS332 Storage Area Networks 4 0 0 0 4 EC
9. UE14CS333# Natural Language Processing 4 0 0 0 4 EC
High Performance Computing

10. UE14CS334## 4 0 0 0 4 EC
Architecture
11. UE14CS335$$ Advanced Computer Networks 4 0 0 0 4 EC
12. UE14CS336# Parallel Computing 4 0 0 0 4 EC
13. UE14CS337 Generic Programming 4 0 0 0 4 EC
Architecture of Open Source

14. UE14CS338 4 0 0 0 4 EC
Technologies
Elective -IV
15. UE14CS341 Cloud Computing 4 0 0 0 4 EC
16. UE14CS342## Ad-hoc Sensor Networks 4 0 0 0 4 EC
17. UE14CS343$$ Software Defined Networks 4 0 0 0 4 EC
18. UE14CS344 Knowledge Management 4 0 0 0 4 EC
19. UE14CS345 Semantic Web Technologies 4 0 0 0 4 EC
20. UE14CS346$ System Modeling and Simulation 4 0 0 0 4 EC
21. UE14CS347$$ Network Management 4 0 0 0 4 EC
22. UE14CS348# Digital Image Processing 4 0 0 0 4 EC

Total 19 0 6 0 22
Note: Prerequisite courses - *UE14CS202, UE14CS254; ** UE14CS204; $$UE14CS301; #UE14CS251; # #UE14CS253; $

UE14CS203;
ELECTIVES TO BE OPTED FOR SPECIALIZATION
Sl. No. SPECIALIZATION ELECTIVE III ELECTIVE IV
UE14CS332, UE14CS333, UE14CS344, UE14CS345,

A. Algorithms & Computing Models
UE14CS336, UE14CS337 UE14CS348
UE14CS331, UE14CS332, UE14CS341, UE14CS342,

B. Systems & Core Computing UE14CS334, UE14CS335, UE14CS343, UE14CS346,
UE14CS336, UE14CS338 UE14CS347, UE14CS348
UE14CS344, UE14CS345,
C. Data Science UE14CS333
UE14CS346

UE14CS351: COMPILER DESIGN (4-0-0-0-4)
# of Hours: 52
Class Chapter Title / Topics to be Covered
% of Portion covered
# Reference Literature
% of Cumulative
Syllabus %
1 Unit#1 Compilers: Language Processors
2 T1: Chapters 1, 3, 4 The Phases of a Compiler, Cousins of the Compiler.
3 Introduction, The Grouping of Phases, CompilerConstruction Tools.
1.1 - 1.2
4 Lexical Analysis, Lexical Analysis: The Role of the Lexical Analyzer, 19.23 19.23
3.13.5, 3.8
5 Input Buffering,
6 Specification of Tokens.
7 Recognition of Tokens,
8 A Language for Specifying Lexical Analyzers.
9 A Language for Specifying Lexical Analyzers : sample
programs.
10 Design of a Lexical Analyzer Generator.
11 Unit#2 Syntax Analysis: The role of the Parser, ContextFree
Grammar, Writing a Grammar.
T1: Chapter 4
12 Syntax Analysis, TopDown Parsing
13 4.1.1, 4.2- 4.7 BottomUp Parsing. 23.08 42.31
14 T1: Chapter 5 LR Parsers.
15 Syntax Directed SLR Parser.
Translation
16 LALR Parser.
5.1, 5.2.15.2.4, 5.3.1,
17 CLR Parser.
5.3.2, 5.4.1 5.4.3
18 Syntax Directed Translation: Syntaxdirected Definitions
19 Evaluation Orders for SDDs, Dependency Graphs, Ordering the
Evaluation of Attributes.
20 SAttributed Definitions, LAttributed Definitions.
21 Applications of Syntax-Directed Translation.
22 Syntax-directed Translation Schemes Postfix Translation
Schemes.
23 Unit #3 Syntax Directed Translation: SDT's with actions inside
Productions.
24 T1: Chapter 5 SDT's for L-Attributed Definitions.
25 Syntax Directed LAttributed SDDs & LL Parsing.
26 Translation BottomUp Parsing of LAttributed SDDs. 23.08 65.39
27 5.5.35.5.4 IntermediateCode Generation: Variants of Syntax Trees
T1: Chapters 6 Directed Acyclic Graphs for Expressions.
28 IntermediateCode Three-Address Code Addresses and Instructions.
29 Generation, Quadruples, Triples.
30 6.1-6.2,6.3.1 6.3.4 , Declarations.
31 6.6, 6.8, Storage Layout for Local Names.
32 Control flow.
33 Control flow translation of Boolean Expressions.

34 Switch-Statements.
35 Unit#4 Run-Time Environments: Storage Organization

36 Stack Allocation of space
37 T1: Chapters 7 Access to Non local Data on the stack
38 Run Time Code Generation: Issues in the design of a Code Generator.
39 Environments, The Target Language.
7.17.3 19.23 84.62
40 T1: Chapter 8 Addresses in the Target Code: Static allocation, Stack
Code Generation, allocation.
41 8.1 8.4 RunTime Addresses for Names.
42 Basic Blocks.
43 NextUse Information.
44 Flow Graphs.
45 Unit #5 Code Generation: optimization of Basic Blocks.
46 Machine Independent Optimization: Causes of Redundancy.
47 T1: Chapter 8 Global Common Subexpression.
48 Code Generation, Copy Propagation.
49 8.5 Dead Code Elimination.
50 T1: Chapter 9 The DataFlow Abstraction, The DataFlow Analysis
Machine Independent Schema.
51 Optimization DataFlow Schemas on Basic Blocks. 15.38 100
52 9.1 9.2 LiveVariable Analysis.
Text Book(s) & Reference Book(s):
Publication Information
Book Type Code Title & Author
Edition Publisher Year
CompilersPrinciples, Techniques and Tools
Text Book T1 Alfred V. Aho, Monica S. Lam, Ravi Sethi, 2nd Pearson Education 2009
Jeffery D. Ullman
Modern Compiler Design, Dick Grune, Kees
Reference
R1 van Reeuwijk, Henri E. Bal, Ceriel J.H. Jacobs, 2nd Pearson Education 2012
Book
Koen Langendoen,

UE14CS352: UNIX SYSTEM PROGRAMMING (3-0-0-0-3)
# of Hours: 39
Chapter % of portions covered
Class Title /
# Reference Topics to be Covered Percentage Cumulative
Literature
Unit #1 : Unix System Overview, File I/O
1 UNIX System Overview: Introduction

2 UNIX Architecture
File I/O : Introduction, , File Descriptors, open
3
T1 Function, creat Function, close Function
Ch 1.1 1.2, lseek Function, read Function, write Function, I/O
4 15 15
Ch 3.1 Efficiency
3.15, File Sharing, Atomic Operations, dup and dup2
5
Functions
sync, fsync, fdatasync Functions, fcntl Function,
6
ioctl Function
Unit #2 : Files & Directories
Files & Directories: Introduction, stat, fstat, & lstat

7 Functions
8 File Types, SetUserID and SetGroupID
File Access Permissions, Ownership of New Files
9
and Directories, umask
access Function, chmod, fchmod Functions, Sticky
10
bit
T1
21 36
11 Ch 4.1 4.23 chown, fchown, & lchown Functions, File Size, File
Truncation
File Systems, link, unlink, remove, & rename
12
Functions
Symbolic Links, symlink & readlink Functions ,File
13
Times, utime Function
mkdir, & rmdir Functions, Reading Directories,
14
chdir, fchdir getcwd Functions, Device Special Files
Unit #3 : Process Environment, Process Control
15 Process Environment: Introduction 18 54

T1 main Function, Process Termination, Command
16
Ch 7.1 LineArguments, Environment List
7.11, Ch 8.1 Memory Layout of a C Program, Shared Libraries,
17 8.13 Memory Allocation, Environment Variables
setjmp and longjmp Functions, getrlimit and
18 setrlimit Functions
Process Control: Introduction, Process Identifiers,
19
fork, vfork
exit Functions, wait, waitpid, waitid, wait3, and
20
wait4 Functions
21 Race Conditions, exec Functions, Changing User
IDs and Group IDs, interpreter files, system

Function
Unit#4 : Process Relationships, Signals

Process Relationships: Introduction, Terminal
22
Logins, Network Logins
Process Groups, Sessions, Controlling Terminal, Job
23
Control, Shell Execution of Programs
Signals: Introduction, Signal Concepts, signal
24 T1 Function
Ch 9.1 9.6, Unreliable Signals, Interrupted System Calls,
25 Ch 9.8 9.9 Reentrant Functions, SIGCLD Semantics 20 74
26 Ch 10.1-10.7, kill, raise Functions, alarm and pause Functions
Ch 10.9- Signal Sets, sigprocmask Function, sigpending
27 10.19 Function
sigaction Function, sigsetjmp and siglongjmp
28
Functions
sigsuspend, abort Function, system Function, sleep
29
Function
Unit #5 : Interprocess Communication, Threads
Interprocess Communication :Introduction, Pipes,
30
popen, & pclose Functions
31 Coprocesses, FIFOs
XSI IPC, Identifiers and Keys, Permission Structure,
32 T1 Configuration Limits, Advantages and
Ch 15.1- Disadvantages
33 15.10 Message Queues
34 Ch 11.1-11.6 Semaphores 26 100
35 Shared Memory, Client Server Properties
36 Threads : Introduction, Thread Concepts
Thread Identification, Thread Creation, Thread
37
Termination
38 Thread Synchronization, Mutexes
Deadlock Avoidance, ReaderWriter Locks,
39
Condition Variables
Publication Info
Book Type Code Title Author
Edition Publisher
Advanced programming W. Richard Stevens,
in the UNIX Environment Stephen A Rago,
Text Book T1 2nd Edition Pearson
Foreword by Dennis
Ritchie

UE14CS353: Web Technologies-II (4-0-0-0-4)
# of Hours: 52
Chapter Title / % of Portion Covered

Class
Reference % of Cumulative
# Topics to be Covered
Literature Syllabus %
Unit 1 : AJAX
1 Hidden Frames Technique
2 Image based AJAX
3 Script based AJAX
4 XMLHttp Request, Cross domain requests
5 T1: 21-97 Maintaining history in AJAX calls. 19 19
6 Fetching binary data with XHR
7 AJAX Patterns Predictive Fetch
8 MultiStage download
9 Periodic Refresh
10 Fallback patterns and implementation
Unit 2 : Front-end libraries and Syndication
11 Submission Throttling
12 Submission Throttling
13 Bootstrap 3 Introduction
T1: 237-245, 193-
14 The Grid System
234
15 Fixed and Fluid Layouts
19 38
16 Tables and forms
T5: Relevant
17 Buttons and images
chapters
18 Feeds RSS vs Atom
19 Fetching and rendering feeds using RSS - a news reader
20 XML based parsers, JSON vs XML
Unit 3 : Reverse AJAX and Web Services
21 COMET- Http Streaming and Long Poll
22 Iframes Technique
23 Using XMLHttpRequest
24 Using XMLHttpRequest
25 T1:273-298 HTML5 Server sent events
19 57
26 Overview of COMET frameworks
27 Web Services Principles of REST and SOAP
28 RESTful Web services using PHP
29 Designing RESTful APIs
30 Designing RESTful APIs
Unit 4 : AJAX: Semantic Web Fundamentals and Networking
31 Introduction to Semantic Web 19 76
32 Web 3.0 and Semantic Web
33 T4: 1st Chapter Web 2.0 and Syntactic Web
34 T2: 231-245, 250- The Layered Cake
35 258,261-281 Networking and Performance Considerations timeouts,
retries
36 Handling server errors, multiple requests
37 http 1.1 two connection limit

38 Race conditions, caching on client side
39 Data compression
40 Request Management
Unit 5 : Security Considerations and Server side Frameworks
41 Web Attacks vulnerabilities, precautions
42 SQL injection, XST
43 XSS
44 CSRF and Http Authentication
45 Introduction to Frameworks
T2:283-316
46 T3: 1-40, 69-80, Overview of Ruby on rails and CakePHP 24 100
47 100-118, 133-150 Overview of Django and MEAN.IO
48 CodeIgniter PHP Framework Introduction
49 Installation and basics
50 User Management
51 Sending Emails and File I/O
52 Database Ops
Book Publication info

Code Author & Title
Type
nd
T1 Professional AJAX - Nicholas C Zakas et al 2 Edition Wrox 2007
Tata McGraw
T2 AJAX, The Complete Reference Thomas. A. Powell 2008
Hill
PACKT
Textbook T3 CodeIgniter 2 Cookbook Rob Foster - 2013
Publishing
Semantic Web: Concepts, Technologies and Applications -
T4 Karin K. Breitman, Marco Antonio Casanova and Walter - Springer 2007
Truszkowski
Riwanto
T5 Step by Step Bootstrap 3 Riwanto Megosinarso 1st Edition 2014
Megosinarso

#1
Statement Lex to count number of character, words, newlines, and
white spaces.
Objective Introduce students to the working of Lex tool.
Outcome Students will be able to use the basic lex commands
along with the different options.
Task #1 Deliverable Students must be able to provide a lex specification that

properly counts the number of words, lines and blanks.
Practice Problem 1. To read the source code of lex.yy.c file.
2. Make a note of minimum 15 routines mentioned
in lex.yy.c
3. Write a line about the working of these routines
in general.
4. Count the number of occurences of IF, FOR,
WHILE loop in lex.yy.c.
UE14CS354: COMPILER DESIGN LABORATORY (0-0-2-0-1)

# of Weeks: 12
#2
Statement Lex to remove comment lines.
Objective To help students get familiarized with the most basic
functionality of a lexical analyzer of removing
whitespaces and comments from a given program.
Outcome Students will be able to handle all the cases in which

comments can be given in the program and remove the
same.
Task #2
Deliverable Students must be able to justify their use on the different
regular expressions used in programs. Also count the
number of comments in a given file.
Practice Problem Write a program in a preferred programming language to
develop a simple lexical analyzer.
Input : C/C++ program
Output : Remove comments ; Generate Tokens; Store
generated tokens in table(Symbol table).
Task #3 #3
Statement
Lex to validate identifiers.
Objective Familiarize students with the way to handle keywords

separately from identifiers.
Outcome Students will be able to analyse the working of lexer and
parser together and how for a new language, reserved
words can be created and treated special depending on
the context.
Deliverable The output is verified at the terminal, students are asked
to modify their code to count the number of identifiers
and keywords and display both.
Practice Problem Write a program in a preferred programming language to
store and count the number of occurrences of a
keyword(present in a file) and identifier in a
table(symbol table) and match parenthesis.
#4
Statement
Yacc to validate context free grammars
Objective Familiarize students with validation of Type II grammars.

Outcome Students will be able to validate a given context free
grammar and check whether a given string belongs the
Task #4 grammar or not.
Deliverable The output is verified at the terminal, observations are
submitted and evaluation is done based on viva.
Practice Problem Check whether the given string a n b n (n>0) is accepted

by the
grammar or not.
To try out -v option with yacc and analyse y.output.
#5
Statement Yacc to implement semantic rules to calculate the
Task #5
expression that takes an expression with digits, + and *
and computes the value.
Objective To help students understand how an expression is

evaluated by the compiler with the help of symbol table.
Also, familiarize students on deciding associativity and
precendance of operators using a various options of the
YACC tool.
Outcome Students will be able to construct a calculator, validate

and evaluate a given expression.
to input valid and invalid expressions.
Practice Problem Yacc to evaluate a built-in functions whose syntax has
this form:
function_name (argument)
Make the program report an error if the user refers to an

uninitialized variable in any way except to store a value
in it.
#6
Statement Program to implement the functionalities required for
predictive parser.
Objective Familiarize students with working of a Top-down parser.

Outcome Students will be able to understand the use of FIRST and
Task #6 FOLLOW data structures in implementing the parsing
table.
to input different grammars and check the desired output.
Practice Problem To implement predictive parsing table given an
unambiguous grammar.
#7
Statement
Yacc to validate Nested IFELSE construct
Objective Familiarize students with working and interpretation of a

programming construct.
Outcome Students will be familiarized with the working of a
construct and write syntax directed definition for the
Task #7
same.
Deliverable The output is verified at the terminal and students are
asked to modify their code taking into consideration
nested IF and IF-ElSE statements, also count the number
of valid and invalid IF or IF-ELSE statements. Students
may also be asked to validate other programming
constructs such as WHILE, FOR etc.
Practice Problem Match the function signature with the function call.
Task #8 #8
Statement
Convert The BNF rules into Yacc form and write code to
generate abstract syntax tree.
Objective To help students understand working of intermediate

code phase of the compiler.
Outcome Students will be familiarized with the working and

interpretation of abstract syntax tree.
to modify the input program and provide an
interpretation of the output.
Practice Problem Write an algorithm to convert intermediate code to
assembly code.
#9
Statement Mini Project
Objective Work in teams and get familiarized with over all working
Task #9 of a language processing system.
Outcome Students will be able to implement front-end/back-end/
mini compiler/mini-assembler.
Deliverable A report that describes the mini project implemented.
Mini Project List

1 Implement a mini compiler which takes as input a C program and produces as output optimized
intermediate code/assembly code. The programming construct to focus : IF and IF-ELSE loop.
intermediate code/assembly code.. The programming construct to focus : while loop.
intermediate code/assembly code.. The programming construct to focus : for loop.
intermediate code/assembly code.. The programming construct to focus : do-while loop.
5 Implement a mini compiler which takes as input a C++ program and produces as output optimized
intermediate code/assembly code.. The programming construct to focus : IF and IF-ELSE loop.
9 Implement a mini compiler which takes as input a Java program and produces as output optimized
intermediate code/assembly code.. The programming construct to focus : IF and IF-ELSE loop.
13 Implement a mini compiler which takes as input a Python program and produces as output optimized
intermediate code/assembly code.. The programming construct to focus : while loop and do-while loop.
14 Implement a Two-pass assembler, which takes as input an assembly code and produces as output Object
code.
15 Implement a Linker/Loader module of a language processing system,taking as input the object code.
UE14CS355: UNIX SYSTEM PROGRAMMING LABORATORY (0-0-2-0-1)
# of Weeks: 12
#1
Statement 1. Experiment with open system call.
2. Experiment with lseek system call
Open an existing file in read-write mode.
Seek to different positions in file and make
observations.
Objective Familiarize students with open and lseek system calls
Outcome Students will be able to use open and lseek systems
calls and understand the concept of umask, permissions
Task #1 and file holes.
Deliverable Write programs to create file with permissions, open
file and perform seeking at different positions in file
using open and lseek calls.
Practise Programs 1. Experiment with different file modes and
flags using open system call.
2. Write a program to display a file in reverse
using lseek system call.
3. Bring out the difference between open and
create system call.
#2
Statement 1. Experiment with dup2 and fcntl system calls. 2.
Write a program to combine stdout and
stderr streams into a single file
Objective Familiarize students with dup2 and fcntl system calls.
Outcome Students will be able to understand the concept of inode
structure, file descriptors and duplicating file
Task #2 descriptors.
Deliverable Program to demonstrate duplicating file descriptors
using dup2 and fcntl calls.
Practise Programs 1. Write a program to demonstrate duplicating
file descriptors using dup.
2. Write a program to append a file using fcntl
function.
3. Can the status of all file flags be changed
using fcntl once the file is open?
ask #3 #3
Statement 1. Simulate stat command. Display the
following :
file type, file permissions, file size, inode
number, time stamp, no: of links
2. Change permissions of an open file using
chmod function. How does umask affect
the effective permissions?
Objective Familiarize students with file type, file permissions,
file size, inode number, time stamp, no: of links and
chmod functions.
Outcome Student will be able to visualize inode structure of a
file.
Students will be able to modify the permissions of the
file programmatically.
Deliverable Program to simulate stat command and display file
attributes.
Program to change the file permissions using chmod
fumction.
Practise Programs 1. When does time stamp of a file change?
2. Does ownership of the file decide whether
chmod is successful or not.
3. Using access function check for the
existence of the file.
#4
Statement 1. Write a program to open a directory and
read directory contents using opendir and
readdir calls.
2. What happens if we open a symbolic link
and read the file? How to read contents of
symbolic link?
Objective Familiarize students with opendir, readdir, and
symbolic link.
Outcome Students will be able to write programs to open and
Task #4 read contents of a directory and delete files.
Students will be able to understand the concept of
symbolic links.
Deliverable Program to open and read directory contents.
Program to create and read symbolic link.
Practise Programs 1. Write a program to remove all empty files in a given
directory?
2. Write a program to create hard link to a
directory.
3. When does time stamp of a directory
change.
Task #5 #5
Statement 1. Given code using fork() system call, analyse
code, find output and make observations
2. Write a program in which the parent displays
uppercase characters A-Z and child displays lowercase
characters a-z with a delay of max of 2 seconds
between each character. Run the program repeatedly
and see if there is racing.
Objective Familiarize students with fork system call

Outcome Students will be able write programs to create processes
using fork call and understand sharing of address space
Students will be able to observe concurrent execution
by parent and child processes.
Deliverable Program demonstrating creation of processes. The
output is verified at the terminal and evaluation done
based on viva and observations.
Practice Programs 1. Write a program to create a process using
vfork call. Examine the difference between
vfork and fork call.
2. Will open files in parent remain open in
child process.
3. Demonstrate the use of wait function using
various exit status.
#6
Statement 1. Experiment with different exec calls
2. Experiment behaviour of environment
variables on fork
3. Demonstrate creation of orphan and zombie
Process
Objective Familiarize students with variants of exec system call,
creation of orphan and zombie processes
Observe behaviour of environment variables on fork.
Outcome Students will be able to observe overlaying of address
space of a process on exec call
Students will be able to examine behaviour of
Task #6 environment variables on fork
Students will be able to write programs to create orphan
and zombie processes.
Deliverable Program to demonstrate overlaying of address space
using different exec calls
Program to create orphan and zombie process.
Program to create and set values for environment
variables and demonstrate behaviour on fork
Practise Programs 1. Write a program to avoid zombie processes.
2. Write a program to print the environment
variables in Unix.
3.Experiment with different variance of exec
system calls.
Task #7 #7
Statement 1. Demonstrate difference between static and dynamic
linking
2. Create static and dynamic libraries
3. Experiment with set-user bit
Objective Familiarize students with static and dynamic linking
and creation of static and dynamic libraries.
Teach students how to run programs with special
permissions using set-user ID
Observe what happens to open files on exec
Outcome Students will be able to analyse difference between
static and dynamic linking and execute commands to
create static and dynamic libraries
Students will be able to execute programs with special
permissions
Deliverable Execute commands to create static and dynamic
libraries
Write programs that can run with special permissions
Practise Programs 1. Write a program to demonstrate the effect of close-
on-exec (FD_CLOEXEC) flag on open files.
2. Demonstrate the use of sticky bit on a file.
#8
Statement 1. Experiment signals on fork and exec.
2. Experiment with signal and sigaction system call
Objective Experiment behaviour of signals on fork and exec call.
Demonstrate difference between signal and sigaction
system call
Outcome Students will be able to observe the behaviour of
signals on fork and exec call.
Task #8 Students will be able to use signal and sigaction calls
for signal handling and explore why signal handling is
essential to system programming
Deliverable Program to demonstrate signal handling using signal
and sigaction calls
Practise Programs 1. Experiment using signal system call.
2. Can every signal be handled or ignored?
Demonstrate with example.
3. Using sigaction system call demonstrate
how to avoid creation of zombie processes.
Task #9 #9
Statement 1. Write program to synchronize parent and
child processes using signal and pause calls.
2. Experiment on exec as to what happens to
pending signals
Objective Use signal and pause calls to synchronize execution of
parent and child processes
Demonstrate blocking and unblocking signals for a
process and check status of pending signals
Examine what happens to pending signals on exec.
Outcome Students will be able to write programs to synchronize
processes using signal and pause.
Students will be able to write programs to block,
unblock and check status of pending signals
Deliverable Program to synchronize processes using signal and
pause.
Program to block, unblock and check status of pending
signals
Practise Programs 1. In kill function, what happens when signal number is
0?
2. Examine signal mask after fork and exec?
3. Demonstrate difference between
SIG_UNBLOCK and SIG_SETMASK in
sigprocmask function?
#10
Statement 1. Write program to create and use message queue as an
IPC mechanism
2. Implement client server communication using pipes.
Objective Use message queue for inter process communication
between client and server process
Study working of message queue and data structures
associated with message queue.
Demonstrate communication between related processes
using pipes
Outcome Student will be able to write program to create message
queue and use it to demonstrate IPC.
Student will be able to write program using pipes and
Task #10 demonstrate two way communication between parent
and child process.
Deliverable Program to create message queue and use it as IPC
mechanism between related and unrelated processes.
Program using pipes and demonstrate two way
communication between parent and child process.
Practise Programs 1. Create a FIFO and demonstrate
communication between two unrelated
processes.
2. Demonstrate the use of type argument in
popen with an example.
3. What happens if the message queue is
removed when the queue contains #
number of messages?
Task #11 #11

Statement Write program to create and use shared memory as an
IPC mechanism
Objective Demonstrate IPC between related and unrelated
processes using shared memory
Study data structures associated with shared memory
segment and examine how shared memory segments
are used on fork.
Outcome Students will be able to create shared memory segments
and use it as IPC.
Deliverable Program to create shared memory segment and use it as
IPC between related and unrelated processes.
Practise Programs 1. How do you remove a shared memory
segment?
2. What happens when you try to remove a
shared memory segment when it is used by
some process?
3. Can one process attach the same shared
memory segment more than once?
#12
Statement 1. Write program to synchronize access to
shared memory segment using semaphore.
2. Write program to synchronize execution of
two processes using two semaphores.
Objective Demonstrate synchronized access to shared memory by
two processes using semaphore
Demonstrate synchronized execution of two processes
using two semaphores
Study data structures associated with semaphore set.
Outcome Students will be able to write program to use
Task #12 semaphore for synchronized access to shared area
among two processes and also for synchronized
execution of processes.
Deliverable Program to demonstrate synchronized access to shared
resources among two processes using semaphore.
Practise Programs 1. How do you initialize a semaphore?
2. What happens when semaphore set is
removed? Is the removal immediate or does
it gets delayed until processes using the
semaphores terminate?
3. Demonstrate with example the use of
SEM_UNDO flag.
UE14CS356: WEB TECHNOLOGIES II LABORATORY (0-0-2-0-1)
# of Weeks: 12
#1
Statement To demonstrate hidden frames AJAX technique:
Create an HTML page that has a form with 4 text
fields. The fields are USN, NAME, DEPT and GPA.
Only the "USN" field is editable. The "NAME",
"DEPT" and "GPA" fields are NOT editable. They are
READ-ONLY. The student can enter a valid USN in
the USN field. As soon as the student exits the "USN"
field, an AJAX call is made to a server script. The
server returns the NAME, DEPT and GPA values
corresponding to the USN entered. If the USN entered
is invalid, the server returns "INVALID USN". This
string is then appended (next to the USN field) on the
screen. If proper values are returned for NAME,
DEPT and GPA, the values are populated into the
respective text fields. (Remember these are read-only
and hence only the server can populate these using
Javascript. The server side script can be trivial and
return hard-coded values). Implement the
Task
functionality using hidden iframes. Demonstrate the
unique advantage of this technique.
Objective There are two main objectives in attempting this

exercise. The first is to understand the need for AJAX.
The second is to implement one such technique using
Hidden IFrames.
Outcome Student will be able to design a basic web page

containing iframe and use the Ajax technique.
Deliverable A simple web page having HTML5 controls, and
AJAX call technique to call a page from server.
Practice Programs Build a page that simulates registration to a
course at PES University. Demonstrate the
AJAX POST request using Hidden Iframes.
For the same problem above, use hidden frames
(not iframes) to validate a username selected
by a student. The status (whether username is
taken or not)must come and sit next to the
username text field.
#2
Statement To demonstrate multistage download using AJAX: A
book-search web page served by localhost is rich in
content and GUI. It has multiple images to display, a
search form for the front-end user to search for a book, a
set of links which might interest the user and also general
information on how to use the site. Use Multi-stage
download pattern to demonstrate good user experience
with this page. On entering an ISBN in the search box
and searching for it, return the matching book from the
server. The server maintains book information in a
database.
Objective There are two main objectives in attempting this

Task exercise. The first is to understand the need for
multistage download in an AJAX program. The second is
to understand the design issues involving such web sites.
Outcome Student will be able to design a complex web page

containing links, images, etc. and demonstrate multiple
AJAX calls for multistage download
Deliverable A web page containing multiple images, their captions,
links, text etc which get loaded at multiple stages(using
AJAX call) once we load the page.
Practice Programs 1. Build a website to simulate stock trading. Assume
you are a stock broker trying to trade online.
Provide an area which has a continous self-
refreshing stream of stock prices (real time)
2. Build a website that simulates cricket score-board
refresh. Choose an appropriate period.
#3
Statement To demonstrate Periodic refresh (with exponential
back-off feature). : A Website provides for Engg seat
Counseling. The user can opt colleges - PESIT and
RVCE and courses - CSE or ECE. The number of seats
are limited and hence there is a <div> at the top of the
page which displays the total number of seats available
for each course/college. Since multiple users can access
the website and opt for courses, this information must
be frequently refreshed. Demonstrate the functionality
by employing the periodic refresh pattern. Implement a
simple fallback pattern for this using exponential back-
off method.
Objective The main objective of this exercise is to familiarize

Task
students with Periodic Refresh pattern. Fallback patterns
are also dealt with. Students will be able to decide when
to use Periodic refresh, the periods to be chosen for the
same and the fallback patterns to be used.
Outcome Student will be able to develop a web page and use the
XHR AJAX technique to do periodic refresh and
fallback in a page when needed.
Deliverable A web page containing HTML5 elements, CSS styles,
and demonstrate page periodic refresh and the fallback
pattern.
Practice Programs 1. Build a page that incorporates Multi-Stage
download pattern. Include video in this and
load the video asynchronously using the XHR
technique
Task #4
Statement To demonstrate usage of AJAX, HTML5 with
Bootstrap 3: Build a web page that demonstrates basic
UI effects of the Bootstrap Library. Demo the use of the
Grid classes, Fixed/fluid layouts, Table related classes,
Image related classes, Form related classes and Alert
classes. Also build a photo slideshow using JQuery
libraries. There must be atleast 3 photos in the album.
When the first photo is displayed, only a "next" link is
available. When the second photo is displayed, there is a
"next" and "previous" link. When the last photo is
displayed, we only have a "previous" link. Provide
animations for displaying the photos. That is, the photos
should enter the screen in an animated manner (enter
from top-left or top-right or expand from center etc)
Objective The main objective of this exercise is to familiarize the

student with the powers of the Bootstrap Library
(including Jquery).
Outcome Student will be able to use simple Bootstrap classes and

JS code to get powerful UI effects with simple code.
Deliverable A Web Page rich in GUI effects/animations,
demonstrating Bootstrap features (including AJAX and
Jquery)
Practice Programs Build an HTML5 page and demonstrate
animations and AJAX calls using the JQUERY
Library.
For the problem statement (above) demonstrate
the use of Bootstrap classes to accomplish
Custom Dialog boxes and popovers.
#5
Statement To demonstrate use of AJAX with RSS for
automatic updates to web sites : Implement a
Javascript/AJAX program to fetch RSS feeds from a
well-known RSS feed site. Provide a scrolling display of
latest news on your page. You can use xparser.js if you
like.

students with RSS format. RSS stands for Really Simple
Syndication and is a popular XML-based way of
automatic updates to web sites. Clients need not visit
Task web sites to find out if changes have taken place to it.
Outcome Student will be able to develop a web page and use RSS
for automatic update of information on the browser
(without visiting server manually).
Deliverable A Web site containing volatile information on server and
a browser page which updates automatically using RSS
and AJAX Call.
Practice Programs For the XSS attack code built as part of the Lab
exercise, demonstrate how the server can protect
itself against both the temporary and permanent
attacks.Also demonstrate how it can protect the
client cookies from being stolen.
Use PHP sessions to demonstrate how a CSRF
attack can take place.
#6
Task
Statement To demonstrate usage of REVERSE AJAX AKA
COMET : Use the Reverse AJAX technique to build a
web-based chat application. The application is two-way
browser-based. That is, we have a window in which one
user types his messages. From other other side, the
second user also updates a browser window. Show the
chat windows side-by-side and demo it.

students with reverse AJAX. A Chat tool is developed
(Web based) where the server sends data to the client
whenever it finds it. This prevents repeated polling from
the client side and avoids wastage of bandwidth.
Outcome Student will be able to design a web page for chat

application using Reverse AJAX call and Server-Sent
Events approach.
Deliverable A web page to demonstrate a server-based Chat
application using reverse AJAX technique and Server-
sent Events approach.
Practice Programs Demonstrate an ATOM based news scroll
feature. Parse the XML using xparser.
Demonstrate a brute force parser for ATOM-
based News feeds.
#7
Statement To implement REST-ful Web Services : By
implementing a single server side PHP script,
demonstrate the working of a RESTful Web Service. The
service must essentially provide the CREATE, READ
and UPDATE operations. For each operation, the server
returns data in json format. Also implement a PHP script
which acts as client to this service. You need to show
URL mapping using Apaches configuration file.

students with Web Services. Most applications on the
Web are now offered as Web Services. Hence this
program uses PHP to implement a RESTful Web
Service.
Task
Outcome Student will be able to design a web page to demonstrate
the design and implementation of REST-ful Web
Services
Deliverable A simple HTML page making a call to a PHP script. The
PHP script making a call to a RESTful web service and
retrieving JSON and sending it back to the browser.
Basic CRUD operations must be supported.
Practice Programs Design and implement RESTful web services
for the following use case.
- A user can search for a player's stats between two years
and game format(one day cricket/ test match cricket)
Build a PHP script client to call a RESTful web
services. Make the "DELETE" call.(you will
need to authenticate the user for "DELETE"
functionality)
#8
Statement To demonstrate an XSS attack (non-persistent and
Task
persistent) : Create a PHP server script that just takes a
username as parameter from a client and greets the user.
Demonstrate the Reflected XSS vulnerability by building
an evil hacker page that lures an unsuspecting user to it
and exploits the vulnerability. Similarly build a PHP
script that saves user-entered comments to a database.
Demonstrate the Persistent XSS vulnerability in this
case. Show how you can alter the server-side scripts to
offer basic protection against these attacks.
Objective The aim of this exercise is to make students aware of

possible XSS attacks on web sites. There are two
variations here (non-persistent and persistent).
Outcome Student will be able to develop Web sites which can
counter basic XSS attacks.
Deliverable A simple vulnerable server script (for demo). An evil
client page (hackers) for demo. Student will alter code
to show how we can protect against XSS attacks.
Practice Programs Build a web page that lists (in a corner) all the
users currently logged on to a server. This must
be done using reverse AJAX. You can assume a
database table has all the users currently logged
in. Use the XHR technique.
Challenge: Simulate the google docs
functionality using reverse AJAX. Two users
can simultaneously edit a document and both
can see the changes together.(Assume only user
updates the document at any given instance)
#9
Statement Mini Project : Build a Web Site that has at least 6 pages.
The site should employ AJAX techniques, features of
the Bootstrap Library and any server-side framework
(not Code-Igniter).
The site should be based on a theme. This could be any

theme of your choice. For instance, some themes could
be - Diwali, Independence day, Cricket World Cup,
Olympics etc.
In the Server-side framework chosen by you,

Task
demonstrate atleast authentication, email-sending and
ORM.
Objective To enable students to use Server side Frameworks in

designing the next generation Web Sites.
Outcome Student will be able to design a web site that employs
Server-side Frameworks and other technologies learnt in
class.
Deliverable A Web Site containing at least 6 pages, that
demonstrates the use of powerful features of Server-side
Frameworks and AJAX/Bootstrap.
UE14CS331 : COMPUTER AND NETWORK SECURITY (4-0-0-0-4)
PART A : THEORY
# of Hours :52
Chapter Title / % of Portion Covered

Class
Reference Topics to be Covered Reference Cumulativ
#
Literature Chapter e
UNIT I Overview and Perimeter Security
1-2 T1, Ch1, 8, 9 Overview : Computer Security Concepts, Requirements, Architecture,
Trends, Strategy
3-6 Plus Readings: Firewall and Intrusion Prevention systems : Firewalls, Types of
Firewalls, Intrusion Prevention, Unified Threat management
7-10 Intrusion Detection : Intrusion Detection, Host based, Network based,
Honeypots
Readings :
For Overview
1. Measuring Pay-per-Install: The Commoditization of Malware
Distribution by J. Caballero, C. Grier, C. Kreibich, V. Paxson
(gives a feel of security market)
For Perimeter Security 20% 20%
1. Intrusion and intrusion detection by John McHugh (highlighted
3 and section 4 rest optional)
2. Next generation firewalls by Gartner, Palo Alto
3. Magic Quadrant for Enterprise Network Firewalls, Gartner
Optional Readings :
1. https://www.owasp.org/index.php/Application_Threat_Modelin
g
2. Reflections on trusting trust by Ken Thompson
3. Gartner=Designing an Adaptive Security Architecture
4. Distributed Firewall by Bellovin
UNIT II Authentication and Access Control
11-14 T1: User Authentication : Password, Password-based, token based,
Ch 3,4,23 Biometric, Remote User authentication
15 - Access Control : Principles, Access Rights, Discretionary Access
17 Readings
Control, Unix File Access Control, Role Based Access Control
18 - Internet Authentication Applications : Kerberos, X.509, PKI,
21 Federated Identity Management
Readings :
1. The Quest to Replace Passwords: A Framework for
Comparative Evaluation of Web Authentication Schemes.
20% 40%
Optional readings :
1. Operating Systems Security, T. Jaegeri, 2008. Chapter 4,
Security in Ordinary Operating Systems.
2. SetUID Demystified, Chen, Dean, and Wagner, 2002. (till
section 5)
3. Steiner, Jennifer G., Clifford Neuman, et al. "Kerberos: An
Authentication Service for Open Network Systems." USENIX
Conference (1988).
4. Intelligence Driven Identity and Access Management - EMC
UNIT III Cryptographic Tools and Algorithms
31-33 T1: Cryptographic Tools : Confidentiality with symmetric encryption,
Ch 2,20,21 Message Authentication & Hash Functions, Digital Signatures, Random
Numbers
34-37 Symmetric Encryption and Message Confidentiality : DES, AES,
Stream Ciphers, Cipher Block Modes of Operation, Key Distribution
38-41 Public Key Cryptography and Message Authentication : Secure Hash
Functions, HMAC, RSA, Diffie Hellman Algorithms
Readings :
1. Programming Satan's Computer Ross Anderson and Roger
21% 79%
Needham
2. SSL certicates Symantec whitepaper
T1: Ch: 2 , Ch: 20 , Ch: 21
Optional Readings :
1. Why crypto systems fail - Ross Anderson
2. Cryptography protocol practices Needham
3. The BREACH attack: encryption and compression don't mix, by
Gluck, Harris, and Prado (Read at least overview)
4. Handbook of Applied Cryptography, by A. Menezes, P. van
Oorschot, and S. Vanstone (for basics)
UNIT IV Security Protocols, Malware and Software Security
42-45 T1: Internet Security Protocols and standards : SSL, TLS, IPSEC, S/
Ch: 22,6,10,11? MIME
46-48 Malicious Software : Types of Malware, Viruses & Counter Measures,
Worms, Bots, Rootkits
49-52 Software Security : Buffer Overflows, Sta;ck overflows, Defense, Other
overflow attacks, Software Security Issues, Handling Program Input,
Writing Safe Program Code, Interacting with the Operating System and
Other Programs, Handling Program Output
Readings :
1. Smashing The Stack For Fun And Profit, Aleph One 21% 100%
2. Advanced-targeted-attacks Fireeye
3. Gartner 2013- Threats from SSL traffic
T1: Ch: 22 , Ch: 6 , Ch: 10, Ch 11?
Optional Readings :
1. Buffer Overflow : A;ttacks and Defenses by Crispin Cowan
2. ForceHTTPS: protecting high-security web sites from
network attacks, by A. Barth and C. Jackson (Prefer
Mandatory )
3. The case for short-lived certificates. by Topalovic et al. (only
the problem)
Network Protocols & Android ( Optional based on time)
Network Protocol security : TCP/IP and other network protocols
security
Android security
Readings :
1. A look back at Security Problems in the TCP/IP Protocol

Suite, S. Bellovin, ACSAC 2004.
2. Understanding Android Security Enck, Ongtang, and
McDaniel, 2009 (Security Enforcement section)
Optional Readings :
1. TaintDroid: An Information-Flow Tracking System for
Realtime Privacy Monitoring on Smartphones, Enck et al.
Book Type Code Author & Title Publication

Computer Security : Principles and Practice, William 3rd Nov
Text book T1 Stalling & Lawrie Brown, Pearson
Edition 2015
Syllabus for test:

Test # Syllabus
T1/T2 Class # 1- 21
Project Presentations &
T2
Assignment
UE14CS331: COMPUTER AND NETWORK SECURITY (4-0-0-0-4)

PART B : Assignments/ Projects
Week
Program # List of programs
#
Assignments and Projects will be assigned in 3rd week of the course
NOTE: Project Presentations will be presented in class
UE14CS332: STORAGE AREA NETWORK (4-0-0-0-4) # of Hours: 52
% Of Portions
UNIT Chapter Title/
Class Topics To Be Covered Covered
NO. Reference Literature
Cumulative
Introduction to Storage 1-2 Introduction to Storage Systems

Systems and Intelligent 3-4 Fundamental Architectures of Storage systems
1. Disk Systems 5-6 Relevance of Storage Networking 23.00
7-8 Architecture of Disk Subsystems
JBODs, RAID Levels, Instant Copies, Remote Mirroring,
9-12
Availability of Disk Subsystems
Storage Area Network 13-15 IO Path, SCSI
2 16-21 Fibre Channel 52.00
& NAS 22-23 IP Storage: iSCSI and others
24-27 NAS Architecture
3 Cloud Storage and 28-30 Cloud storage

Storage Virtualization 31-32 Writing to storage 70.00
Storage Virtualization
33-36
SAN Arch, SAN 37-39 SAN HW and SW Arch
4 Management and 40-42 SAN Management 88.00
Archival, Backup Archival, Backup and Restoration
43-46
Security and iSCSI 47-48 Security
5 100.00
deployment demo 49-50 iSCSI deployment demonstration
51-52 iSCSI deployment demonstration
Reference Publication Info

Title & Author
books Edition Year
Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Wiley
1 2009
Explained Second
2 Storage Networks: The complete Reference Robert Spalding Osborne 2003
Storage Networks Explained: Basics and Application of Fibre Channel SAN,
3 Wiley 2015
NAS, ISCSI, INFINIB and FOCE by Rainer Erkens and others
Storage Area Network Essentials: A complete Guide to Understanding and
4 Wiley 2001
Implementing SANs
5 Various Articles from Internet, Published Papers Current
UE14CS334: HIGH PERFORMANCE COMPUTING AND ARCHITECTURE (4-0-0-0-4)
# of Hours: 52 (each class is of 2 hour duration)

% of Cumulative
Syllabus %
1 Unit#1 Introduction to performance, high performance computing
applications, metrics, benchmarks, motivating example.
Introduction to Overview of computer systesms and their impact on
Performance and performance
2 architecture T1,T2 Tools to measure performance, Concuurrency and Parallelism,
Types of parallelism, architectures Tools to study performance 19.5 19.5
3 Amdahls law, Gustafsons law, Multi-cores, GPGPU
introduction
4 Threading overview, creation, hardware support cores
5 Interconnection networks in processors
6 Unit 2: Threading Application programming models distributed and shared 23.0

and OpenMP memory, pthreads, data races, synchronization, mutual
T2 exclusion.
7 Designing for threads programming patterns, data structure
choice, reader/writer locks, deadlocks 42.5
8 OpenMP computation of Pi, parallel, false sharing
9 OpenMP synchronization, critical section, atomics, loop
worksharing and scheduling
10 OpenMP - sections, locks, memory models, storage attributes
11 MPI - introduction to MPI
12 Unit #3 CUDA motivating example, matrix multiplication 19.5 61.5
13 Kernel functions
14 Lab class to try CUDA
15 CUDA, T3 CUDA threads, blocks
16 Latency tolerance with CUDA
17 Unit #4 Cache memories, hierarchies, locality of refrence, writing cache 19.5
friendly code
18 Memory and Cache optimizations working with simulators
19 performance Case Study: Intel Core i7 memory hieracrhcy 80.7
20 T1,T2 Memory consistency models
21 Guest Lecture 1. - ARM
22 Unit #5: Compiler Role of compiler in performance elimintiy loop inefficiencies 19.5 100
23 optimizations and Reducing procedure calls, eliminating unneeded memory
performance references
24 T2 Compiler how they are achieved?
25 Guest Lecture 2 - CDAC
26 Putting it all together example case study HPC app and its
optimization

Hennessey and Patterson, Computer
Text Book T1 5 Morgan Kaufmann 2011
Architecture: A Quantitative Approach,
TextBook T2 Randal Bryant and David OHalloran Computer 2 Prentice Hall 2011
Systems: A Programmers Perspective
David Kirk and Wen-meiHwu, Programming
Morgan Kaufmann
TextBook T3 Massively Parallel Processors: A Hands On 1 2010
Approach,
Morgan Kaufmann
Reference Gerassimos Barlas, Multicore and GPU 1
R1 2014
Book programming: An integrated approach
UE14CS 335 : ADVANCED COMPUTER NETWORKS (4-0-0-0-4)
# of Hours: 52
% of Syllabus Cumulative
%
Unit#1 -Introduction & Bridging the gap
1 Quick revision of what was learnt in last semester
2 Driving factors for the next generation networks
3 Elements of modern networking
4 Requirements and technology
5 Bridging the gap : IPV6 Need, Features
6 T1- Sec 1.1 to 1.5 IPV6-Header Migration from IPV4 to IPV6
7 T2- Sec 4.4 & 4.6 Hierarchical routing in internet
T1- Sec 9.1 20 20
8 BGP
9 VLANs- Definition-Benefits
10 IEEE 802.Q standards
Unit#2-End devices & Access technology-Part#1
11 MPLS-Principles
12 Augmenting TCP for wireless networks
13 The IOT Era; Scope of Internet Of Things
14 IOT Architecture
15 Components of IOT Enabled Things; Sensors
16 Actuators, Microcontrollers, Transceivers, RFID
17 IOT Implementation
18 IOT Implementation
19 R1- Sec 5.8 Case study : Cisco IOT System
T1- Sec 14.1
20 Wireless & Mobile Networks-Elements of wireless
T2- Sec 6.2, 6.3, 6.4 & 23 43
networks
6.5
21 Challenges in wireless networks
22 Cellphone architecture and working principles
23 Typical Transmission & Media Access technologies
Unit#3-Access technology Part#2
24 Mobility aspects of wireless networks
25 2G-3G-4G-5G : What do they mean ?
26 Wi-Fi Networks Features
27 Elements of Wi-Fi networks and Principles
28 Wireline access technologies
29 Carrier grade Networks 21 64
30 T2- Sec 6.3-6.5 LTE - Introduction
31 T2- Sec 7.1 LTE Architecture-Protocols and standards
32 Internet telephony-VOIP- Challenges -Building blocks
33 Basics of Voice digitization.
34 VOIP protocols-H.323, SIP
Unit#4-Network Core-Part#1
35 Core network-requirements-Challenges
36 SONET Principles
37 Architecture-Key protocols
38 Software Defined Networks : Background & Motivation
39 SDN Data Plane &Open flow : Data plane functions
40 R3 Sec 6.5 Data plane protocols 20 84
41 T1-Sec 3, 4,5 OpenFlow Logical Network Decice
42 OpenFlow protocol
43 SDN Control Plane Architecture
44 Control plane functions-interfaces
Unit#5-Network Core Part#2
45 SDN Application Plane -Architecture
46 Application plane user interface
47 Data center networking & Big Data over SDN
48 T1 Sec 6 Guest lecture 16 100
49 Revision/Seminars
Foundations of Modern Networking, William Addison-
Text Book T1 1 2015
Stallings Wesley
Computer Networking - A Top-down approach,
6 Pearson 2016
Text Book T2 James F Kurose, Keith W
1
Reference Next Generation Network Services--
R1 [ Special WILEY 2015
Book Technologies & Strategies, Neill Wilkinson
Indian Edition]
1
Pearson
Computer Networks- A Top-down Approach
Reference 2012
R2 -Behrouz A Forouzan, Firouz Mosharraf [ Special
Book3
Indian Edition]
UE14CS336 PARALLEL COMPUTING (4-0-0-0-4)
# of Hours: 52
% of Cumulativ
Syllabus e%
1 Unit#1 Parallelism vs. Concurrency
2 Parallelism vs. Pipelining
3 Understanding Instruction Level and Memory Level Parallelism
4 Parallelism contd.
5 Flynn's taxonomy: SISD, SIMD, MISD, MIMD 22 22
6 The need for parallelism
7 Amdahl's Law vs. Gustafson's Law
8 Exploring Parallelizable Regions
9 contd.
10 Unit#2 The Fork-Join Model
11 contd.
12 Parallel contd.
13 Programming Programming with Fork-Join in OpenMP and Java
14 Paradigms contd. 22 44
15 contd.
16 Message Passing
17 Programming with MPI in C
18 contd.
19 Unit #3 Task level and data level parallelism
20 TAO Analysis
21 Parallel Applications of TAO analysis to Graph Analytics
22 Programming contd.
23 Models Bulk Synchronous Parallel model 20 64
24 contd.
25 Map Reduce Algorithms
26 contd.
27 contd.
28 Unit#4 Introduction to the GPU Model
29 contd.
30 GPU Programming CUDA Programming
31 contd.
32 contd.
20 84
33 GPU Trends
34 contd.
35 contd.
37 Paper Reading/Guest Lecture
38 Paper Reading/Guest Lecture
39 Unit #5 Concurrent data structures: Java 1.8 concurrent collections
40 contd.
16 100
41 Advanced Topics contd.
42 Paper Readings
43 To 52 Project Presentations and Discussions
Introduction to Parallel Computing, Ananth
Text Book T1 Grama, George Karypis, Vipin Kumar and Anshul 2 Pearson 2003
Gupta
UE14CS338: ARCHITECTURE OF OPEN SOURCE TECHNOLOGIES (4-0-0-0-4)
# of Hours: 52
% of Cumulativ
Syllabus e%
1 Unit#1 Intro to network programming
2 Basics of Network Evolution of socket programming
3 Programming Evolution of socket programming
4 Practical assignment and exercises
5 Evolution of socket programming
6 Evolution of socket programming 19.5 19.5
7 Evolution of socket programming
9 Scalable web architectures
10 Scalable web architectures
11 Unit#2 Architecture of Boa Web Server
12 Architecture of Boa Web Server
13 Web Server Architecture of Apache Web Server
14 Technologies Practical assignment and exercises
15 Architecture of Apache Web Server 19.5 39.0
16 Architecture of Apache Web Server
17 Architecture of Nginx Web Server
21 Unit #3 Introduction to version Control
22 Centralized version Control
23 Git and GDB Distributed Version Control
24 Intro to Git
25 Git Architecture 15.5 54.0
27 GDB architecture
28 GDB Architecture
29 Unit#4 Bash Architecture
30 Bash Architecture
31 Bash, NoSql, Chrome Practical assignment and exercises
32 Networking Practical assignment and exercises
33 High Performance networking in Chrome
34 High Performance networking in Chrome 23.00 77.00
35 Practical work: 500 lines or less
37 NoSql Eco System
38 NoSql Eco System
41 Unit #5 Mini Project implementation
42 Mini Project implementation
43 Mini project Mini Project implementation
44 And Paper Mini Project implementation
45 Presentation Mini Project implementation
48 Mini Project implementation 23.00 100
Resource Publication Information

Code Title & Author
Type Edition Publisher Year
Web URL T1 Aosabook.org web web 2016
UE14CS341: CLOUD COMPUTING (4-0-0-0-4)
# of Hours: 52
% of Cumulative
Syllabus %
1 Unit#1 Introduction background, business case
2 Introduction computing models, history
3 Introduction and Background REST, RPCs
4 Background Background Hardware virtualization
5 Background principles of distributed computing
19.5 19.5
6 Unit 2: IaaS basics Openstack overview
7 Software Virtualization
8 Openstack deep dive 1 Nova and Swift
23.0
9 Openstack deep dive 2 Cinder,Keystone and Neutron
10 Amazon compute 42.5
11 Amazon storage
12 Unit #3 Cloudwatch
13 Containers
14 Project defintion 19.5 61.5
15 Paas Azure architecture
16 Guest Lecture 1 - virtualization
17 Unit #4 Design Scaling computation
18 considerations Scaling Storage
19 Storage virtualization 19.5
20 File systems
21 Multi-tenancy 80.7
22 Unit #5: Security and Software as a service

23 Futures Cloud security
24 Cloud data center security 19.5 100
25 Guest Lecture 2
26 Future problems
(1 class is of 2 Hour duration)
Dinkar Sitaram and Geeta Manjunath, Moving to
Text Book T1 the cloud- Developing Apps in the new world of 1 Elsevier 2012
Cloud Computing
UE14CS342: ADHOC SENSOR NETWORKS (4-0-0-0-4)
# Of Hours: 52
Chapter % of Portions Covered

Class # Title/Referen Topics to be covered Reference
Cumulative
ce Literature Chapter
Brief introduction to Computer Networks, OSI reference model,
1. TCP/IP reference model. Cellular and Ad Hoc Wireless Networks,
Applications of Ad Hoc wireless networks
2. Wireless Sensor Networks, Hybrid wireless networks
Issues in Ad Hoc Wireless Networks, Ad hoc wireless Internet:
3.
Unit: I MAC Protocols for Ad Hoc Wireless Networks
Introduction, Issues in designing a MAC protocol for Ad Hoc
4.
INTRODUC wireless networks
17.30 17.30
5. TION Design Goals for a MAC Protocol for Ad Hoc wireless networks
Classification of MAC Protocols: Contention based protocols,
6.
Contention based protocols with reservation mechanisms
Contention based MAC protocols with scheduling mechanisms,
7.
MAC protocols that use directional antennas
Directional Busy-tone based MAC protocols, Directional MAC
8.
protocols for Ad Hoc Wireless Networks
9. Other MAC Protocols
Introduction, Issues in designing a routing protocol for Ad hoc
10.
wireless networks, Classification of routing protocols
11. Table-driven routing protocols, On-demand routing protocols,
Hybrid routing protocols, Routing protocols with efficient flooding
mechanisms
Unit: II
12.
Hierarchical routing protocols, Power-aware routing protocols
13. Routing
14. Protocols for Multicast Routing Protocols: Issues in designing a multicast
17.30 34.60
Ad Hoc routing protocol, Operation of multicast routing protocols,
15.
Wireless Architecture reference model for multicast routing protocols
16. Networks Classification of multicast routing protocols, Tree based multicast
routing protocol: Bandwidth efficient multicast routing protocol,
17. Multicast routing protocol based on zone routing,
Associativity-based Adhoc Multicast routing, Energy Efficient
18. Multi Casting.
19. Unit: III Introduction

20. Transport Issues in designing a transport layer protocol
Layer and Design goals of a transport layer protocol, Classification of 23.07 57.67
21. Security Transport Layer Solutions,
Protocols for
22. Ad Hoc TCP over Adhoc Wireless, Networks,
23.
24.
25. Other Transport Layers for Ad hoc wireless networks,
26.
27.
28.
Networks Ad hoc transport protocol, Security in Ad hoc wireless networks,
29.
30.
Network Security Attacks
31.
32. Key Management
33. Secure Routing in Ad hoc wireless networks.

Quality of Service Frameworks for Ad hoc Wireless Networks:
34.
QoS Models, QoS resource reservation signaling
35. Unit: IV INSIGNIA, INORA, SWAN, Proactive RTMAC
Energy Management in Ad hoc Wireless Networks: Introduction,
36. QOS and Need for energy management, Classification of energy
Energy management schemes
37. Management 19.23 76.9
in Adhoc Battery management schemes: Battery characteristics, Device
38. dependent schemes
sensor
39.
Networks
40. Data link layer solutions, Network layer solutions, Transmission
41. Power Management Schemes: Data link layer solutions,
42. Network layer solutions, Higher Layer Solutions, System Power
43. Management Schemes
44. Introduction, Application of Sensor Networks
Comparison with Ad hoc wireless networks, Issues and challenges
45.
in design, Sensor Network Architecture
Data Dissemination: Flooding, gossiping, Rumor routing,
46. Unit: V Sequential assignment routing
Sensor protocols for information via Negotiation, Cost Field
47. Wireless 23.07 100
Approach
Sensor
48. Geographic hash table Data Gathering: Direct transmission, Power
Networks
49. efficient gathering for sensor information systems
50. Binary scheme, chain based three level schemes. MAC Protocols
51. for Sensor Networks
52. Location Discovery, Quality of a Sensor Network
Ad Hoc Wireless Networks
Text Book T1 Architectures and Protocols, C.Siva -- Pearson 2004
Ram Murthy and B.S. Manoj.
Wireless Sensor Networks: Morgan
Text Book T2 Information Processing Approach, -- Kaufmann 2004
Feng ZHAO and Leonidas GUIBAS. Publishers
UE14CS343: SOFTWARE DEFINED NETWORKS (4-0-0-0-4)
# of Hours: 52
% of Cumulativ
Syllabus e%
1 Unit#1 Course Intro, Scheme and plans
2 Basics of SDN Elements of Modern Networking
3 Networks: Requirements and Technology
4 Introduction to SDN, Background and Motivation
5 Distributed and Control Plane
6 Practical assignment and exercises 19.5 19.5
7 SDN: Data Plane and Openflow
8 SDN: Control Plane
9 SDN Application Plane
11 Unit#2 SDN Controllers : General Concept
12 SDN Cotrollers: VMWare, Nicira
13 SDN Controllers SDN Controllers: Mininet, Pox, Ryu, Trema, Floodlight
15 SDN Controllers: Opendaylight 19.5 39.0
16 SDN Controllers: Coordination and Cooperation
17 SDN: Traffic Engineering, PCE
19 Network Programmability
20 Network Programmability
21 Unit #3 Data Center Concepts and Constructs
22 Data Center Concepts and Constructs
23 Data Center and Virtualization: Concepts and Architecture
24 NFV NFV Functionality
25 Network Virtualization 15.5 54.0
27 Business Applications
28 Business Applications
29 Unit#4 SDN Traffic Engineering
30 SDN Traffic Engineering
31 SDN Future SDN Startsups
33 SDN in other environments
34 SDN in other environments 23.00 77.00
35 SDN business ramifications
37 Data Center Implementation
41 Unit #5 Mini Project implementation
42 Mini Project, Mini Project implementation
43 Paper presentation Mini Project implementation
48 Mini Project implementation 23.00 100
Resource Publication Information

Code Title & Author
Software Defined Networks 2nd Ed, Auth: Culver,
Book T1 2nd Mofgan Kaufman 2016
Black, Goransson
st
Book T2 Software Defined Networks, Gray, Nadeau 1 OReilly 2013
Foundations of Modern Networking: SDN, NFV,
Book T3 1st Pearson 2015
QoE, IoT and Cloud. Author: William Stallings
Software Defined Networking with OpenStack,
Reference R1 1st Packt Publishing 2016
Voruganti, Subramanian
UE14CS344: KNOWLEDGE MANAGEMENT (4-0-0-0-4)
# of Hours: 52
Book Publication Information

Code Title & Author
1. Knowledge Management, Elias M. Pearson Education
Text Book T1 - 2007
Awad and Hassan Ghaziri Inc
2. Ten Steps to Maturity in Knowledge
Text Book T2 Management Lessons in Economy, 6th Chandos Publishing 2006
J.K. Suresh and Kavi Mahesh
UE14CS346: SYSTEM MODELING AND SIMULATION (4-0-0-0-4)
% of Portion
Class Chapter Title / Reference Covered
Topics to be Covered
# Literature % of Cumulative
Syllabus %
1 Unit I 23.10 23.10
Principles of modeling and simulation;
Introduction to
2 Simulation: Model taxonomies;
3 T1: 1.1-1.12,2.1-2.6 Fundamentals of queuing theory;
Book 4 Random variate generation; Publication Information

Code Title & Author
5 Monte Carlo simulation;
6 Discrete Event System Simulation, By Jerry

Performance Banks
measures of queuing systems
T1 5th Pearson Education 2013
Et Al
7 Unit II Managing event lists 18.60 41.70
Text
Building Discrete
Numerical EventFor Engineers By Steven C.
Methods th
Book 8 T2 Simulation queue disciplines, and priorities6 McGraw Hill 2015
Chapra&Models
Raymond P. Canale
T1: 3.1,6.1-6.3, Papers
9 T3 related to simulation
Simulation WithofArena ByApplication to simulation
W. David Kelton Et Al of computer
5th McGraw Hill 2013
computer systems subsystems and concurrent processes.
10-11 Project Stage I Project selection & literature survey
presentations
12 Unit III Input data analysis to determine distributions
Introduction to simulation
13 languages and Analysis of simulation output
packages,Design of 15.38 57.08
14
Simulation Experiments Tests of significance and design of experiments
T1: 9.1-9.7, 10.1-10.4,
15
11.1-11.3 Variance Reduction Techniques
16 Modeling systems using differential equations
17 principles of numerical integration
Unit IV
18 Continuous System numerical integration methods, 19.23 76.31
Simulation
19 T2: 25.1-25.4, 28.2 simulation of discontinuities (combined
discrete-continuous simulation),
20 Application to population ecology and other
systems.
21 The need for agent based simulation, agent
concepts characteristics and interaction
Unit V topologies,
Agent Based Simulation
22 agent based simulation platforms (NetLogo and
(Refer class notes,
publicly available others), 23 100
material on this topic)
23 Applications examples.
Project Final
24-26 Project Work and Presentations
UE14CS347: NETWORK MANAGEMENT # of Hours: 52
Cum % Of
Unit Chapter Title/
Class Topics To Be Covered Portions
No. Reference Literature
Covered
Introduction to Introduction, Network Management, Network topologies, functions
Network Management and types, Challenges of managing a network, Internet and Network
and the Management. Administrative Entities their autonomy and
responsibilities in terms of policies, Current state of managing
network, NM Big Picture, and the Activities/IT groups which
1-8
support them, Network Devices and Services which need to be
managed, Benefits of Automation, Maturity of network
1. management, How do organizations build their networks and what 27.00
are the expectations from an NMS, Research in Network
Management
Network Management who is best suited for providing a network
9-10 management system to manage the components? What should a
typical NM system provide, Architectural Approaches of NMS
OSI and IETF based NM approaches and Dumbell Architecture of
11-14
NM interoperability
Network Devices and Network Services, Network Elements And
Element Management 15-18 Element Management, Effect Of Physical Organization On
2 & Configuration and Management, Examples of Network Elements And Services 46.00
Fault Management 19-21 Configuration Management
22-24 Fault Management
3 Accounting Mgmt., 25-26 Accounting Management
Performance Mgmt., 27-29 Performance Management 60.00
Security Management 30-31 Security Management
SNMP, CIM, 32-33 Intro to SDN and its relationship to NM, Autonomic Computing
4 WEBEM, SNIA 34-37 SNMP-Recap 77.00
38-40 CIM, WEBEM, SNIA
NM Open Source Tool Network Management Tool Installation, Configuration, Demo and
41-48
deployment, presentation
5 Experience sharing SNMP Manager, Agent and MIB development and demo 100.00
and SNMP 48-52
implementation
Publication Info
Publisher Year
Text Book T1 Automated Network Management Systems, Douglas Addison-Wesley
E Comer
Communications Network Management, Terplan, Prentice-Hall, Englewood
Text Book T2 1991
Kornel Cliffs, N.J.
Text Book T3 SNMP, SNMPv2 and CMIP, Reading, Mass., Addison-Wesley 1993
Stallings, William
Text Book T4 Advances in Network Management Jianguo Ding 2010
Articles Various Articles from Internet, Published Papers
UE14CS 348: DIGITAL IMAGE PROCESSING (4-0-0-0-4)
# of Hours: 52
% of Cumulativ
Syllabus e%
1 Unit#1 Introduction to digital image processing
2 Introduction Origins, example fields and various components
3 T: Basics of visual perception
4 Chapter 1,2 Image acquisition
5 Sampling
6 Quantization 19.23 19.23
7 Relationship between pixels
8 Review of relevant linear algebraic concepts
9 Interesting problems in the field of image processing
10 Case studies
Unit#2 Image enhancement in the spatial domain: background
11 Basics of spatial processing, Negative, log,, power law
Image enhancement Piece wise linear functions
12 In the spatial domain Histograms and using histogram statistics for processing
13 T: Histogram equalization and matching 19.23 38.46
14 Chapter 3 Mechanics of spatial filtering
15 3.1-3.6 Correlation and convolution
16 Smoothing and sharpening filters, order statistics filtering
17 First and second derivatives for filtering
18 Image gradient
19 Case studies/ review
21 Unit #3 Image Enhancement in the frequency domain
Basics of the Fourier transform and interpreting an image in the
Image enhancement transformed domain
in the frequency Correspondences between the space and frequency domains
22 domain Smoothing in the frequency domain 19.23 57.69
23 T1: Sharpening in the frequency domain
24 Chapter 4, 7 Ideal versus optimal filters
25 4.7-4.10 Types of noise that can affect an image and enhancement
26 7.1 Evaluating the performance of the filter
27 Introduction to multiresolution transformations or the space-
frequency domain
28 Image transformation and subband coding for denoising,
compression and feature extraction
31 Unit#4 Morphological processing basics
32 Erosion, dilation, open and closing
33 Morphological Hit or miss
34 processing and image Some algorithms boundary extraction, hole filling, thinning
35 segmentation Gray scale morphology
36 T: Segmentation basics point, line and edge detection 19.31 77.00
37 Chapter 9, 10 Thresholding global, using Otsus method, multiple thresholds
38 9.1-9.6 Segmentation using region-growing and region-merging
39 10.1-10.5 Segmentation using morphological operations revisited
40 An overview of other segmentation techniques
41 Unit #5 Color image processing basics

42 Color models, pseudo color images
43 Color image Color transformations
44 processing and basics Smoothing and sharpening of color images
45 of image compression Image segmentation based on color
46 T: Noise in color images
47 Chapters 6, 8 Basics of image compression - concept of redundancy
48 6.1-6.9 Some encoding techniques Huffman coding 23.00 100
49 8.1-8.2 Run length coding, symbol based encoding
50 Block transform coding
51 Compression of color images
52 An insight to extending these ideas to process video frames
Text Book T Digital Image Processing Gonzalez and Woods 3 Pearson 2008
Digital Image Processing and Analysis Scott E. CRC Press
R1 1 2014
Umbaugh
Reference Digital Image Procesing - S.Jayaraman, McGraw Hill Ed. (India) Pvt.2013
Ltd.
R2 Scilab
Book S.Esakkirajan, T.Veerakumar
Digital Signal and Image Processing - Tamal John Wiley
R3 1 2004
Bose

PESU BTech Jan2017 6thsemCourseInfo

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

PESU BTech Jan2017 6thsemCourseInfo

Hochgeladen von

Copyright:

Verfügbare Formate

GENERAL GUIDELINES

This book is to be brought to the class daily.

or laboratory, will not be allowed to take up the ESA.

institution authorities at regular intervals.

attending the laboratory session.

disciplinary action will be taken.

B Tech VI SEMESTER (2014-18 BATCH)

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -1

1. UE14CS351* Compiler Design 4 0 0 0 4 CC

2. UE14CS352 Unix System Programming 3 0 0 0 3 CC

3. UE14CS353** Web Technologies-II** 4 0 0 0 4 CC

6. UE14CS356 Web Technologies - II Laboratory 0 0 2 0 1 CC

7. UE14CS331$$ Computer Network Security 4 0 0 0 4 EC

8. UE14CS332 Storage Area Networks 4 0 0 0 4 EC

9. UE14CS333# Natural Language Processing 4 0 0 0 4 EC

High Performance Computing

11. UE14CS335$$ Advanced Computer Networks 4 0 0 0 4 EC

12. UE14CS336# Parallel Computing 4 0 0 0 4 EC

13. UE14CS337 Generic Programming 4 0 0 0 4 EC

Architecture of Open Source

15. UE14CS341 Cloud Computing 4 0 0 0 4 EC

16. UE14CS342## Ad-hoc Sensor Networks 4 0 0 0 4 EC

17. UE14CS343$$ Software Defined Networks 4 0 0 0 4 EC

18. UE14CS344 Knowledge Management 4 0 0 0 4 EC

19. UE14CS345 Semantic Web Technologies 4 0 0 0 4 EC

20. UE14CS346$ System Modeling and Simulation 4 0 0 0 4 EC

21. UE14CS347$$ Network Management 4 0 0 0 4 EC

22. UE14CS348# Digital Image Processing 4 0 0 0 4 EC

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -2

Note: Prerequisite courses - *UE14CS202, UE14CS254; ** UE14CS204; $$UE14CS301; #UE14CS251; # #UE14CS253; $

ELECTIVES TO BE OPTED FOR SPECIALIZATION

Sl. No. SPECIALIZATION ELECTIVE III ELECTIVE IV

UE14CS332, UE14CS333, UE14CS344, UE14CS345,

UE14CS331, UE14CS332, UE14CS341, UE14CS342,

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -3

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -4

35 Unit#4 Run-Time Environments: Storage Organization

Text Book(s) & Reference Book(s):

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -5

1 UNIX System Overview: Introduction

Files & Directories: Introduction, stat, fstat, & lstat

15 Process Environment: Introduction 18 54

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -6

Unit#4 : Process Relationships, Signals

Text Book(s) & Reference Book(s):

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -7

Chapter Title / % of Portion Covered

37 http 1.1 two connection limit

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -8

Text Book(s) & Reference Book(s):

Book Publication info

P.E.S.University B.Tech.6th Semester Course Information - CSE Jan- May 2017 -9

Task #1 Deliverable Students must be able to provide a lex specification that

UE14CS354: COMPILER DESIGN LABORATORY (0-0-2-0-1)

Outcome Students will be able to handle all the cases in which

Objective Familiarize students with the way to handle keywords

Objective Familiarize students with validation of Type II grammars.

Practice Problem Check whether the given string a n b n (n>0) is accepted

Objective To help students understand how an expression is

Outcome Students will be able to construct a calculator, validate

Make the program report an error if the user refers to an

Objective Familiarize students with working of a Top-down parser.

Objective Familiarize students with working and interpretation of a

3. UE14CS353 Web Technologies-II 4 0 0 0 4 CC