6th Semester

SYSTEM SOFTWARE WITH COMPILER DESIGN

Course code: IS61 Credits: 04

L: P: T: S: 4: 0: 0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 52

Course Objectives:
1. To understand, design and implement a lexical analyzer.
2. To understand, design and implement a parser.
3. To understand, design code generation schemes.
4. To understand optimization of codes and runtime environment.
Course Outcomes: After completion of the course, the graduates will be able to

CO1 Analyze the major concepts in language translation and compiler design.

CO2 Investigate the various phases of a compiler.

CO3 Construct simple lexical analyzers.

CO4 Distinguish the various types of parsers and generation of intermediate code.

CO5 Determine the issues in runtime environment creation.

CO6 Generate machine code for simple instructions.

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 2 2 - - - - - - - 2 -

CO2 1 2 2 - 1 - - - - - - 1

CO3 - 2 2 1 2 - - - - - - -

CO4 2 - 2 1 1 - - - - - - -

CO5 - 1 1 2 1 - - - - - - -

CO6 1 1 1 - 2 - - - - - - -
 Unit Course Content Hours COs
Introduction: Language processors; The structure of a Compiler; The
evolution of programming languages; The science of building a compiler;
Applications of Compiler technology; Lexical analysis, syntax analysis,
CO1
semantic analysis, intermediate code generation, code optimization, code
1 12 CO2
generation, symbol-table management. Lexical analysis: the Role of
Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition
of Tokens.

Syntax Analysis : Writing a grammar; Top-down Parsing; Bottom-up

Parsing; Introduction to LR Parsing: Simple LR; More powerful LR
2 parsers- canonical LR(1) Items, Constructing LR(1) sets of items, 10 CO4
canonical LR(1) parsing tables, Constructing LALR parsing tables.

Syntax-Directed Translation: Syntax-directed definitions; Intermediate

Code Generation: Variants of syntax trees; Three-address code;
3 10 CO1
Translation of expressions; Switch-statements.

Run-Time Environments: Storage Organization; Stack allocation of

4 space - Activation Trees, Activation Records; Heap management; 10 CO5
Introduction to garbage collection.
Code Generation: Issues in the design of Code Generator; The Target
Language; Addresses in the target code; Basic blocks and Flow graphs;
5 10 CO6
Optimization of basic blocks; A Simple Code Generator.

Self study component:

Note: 1.Questions for CIE and SEE not to be set from self-study component.
2. Assignment Questions should be from self-study component only.

1. Introduction to System Software: System Software, Application Software, Components making

up the System Software: Compilers, Assemblers, Editors and debuggers, Linkers and Loaders,
Macro processors.
2. Assemblers: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and
Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing
Modes, Program Relocation. Machine Independent Assembler Features – Literals, Symbol-
Definition Statements, Expression, Program Blocks, Control Sections, Programming Linking.

TEXT BOOKS
1. Alfred V Aho, Monica S.Lam, Ravi Sethi, Jeffrey D Ullman: Compilers - Principles,
Techniques and Tools, 2nd Edition, Pearson Education, 2007.

REFERENCE BOOKS
1. Charles N. Fischer, Richard J. leBlanc, Jr.: Crafting a Compiler with C, Pearson Education,
1991.
 2. Kenneth C Louden: Compiler Construction Principles & Practice, Cengage Learning,
1997.
3. Allen I. Holub: Compiler Design in C , Prentice-Hall, 1990.
4. Leland. L. Beck, System Software, 3rd Edition, Addison-Wesley, ISBN: 978-8-13176-281-3,
2010

Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 10 05 01 01
Apply 10 05 02 01
Analyze 02
Evaluate
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)

Remember 10
Understand 20
Apply 10
Analyze 10
Evaluate
Create
 COMPUTER NETWORK AND CYBER SECURITY

Course code: IS62 Credits: 04

L: P: T: S: 4:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 52

Course Objectives:
1. To gain an insight into the functionality of network layer from a design and performance
perspective.
2. To gain ample understanding of key concepts of transport layer protocols.
3. To understand the need and techniques for network security and cryptography.
4. To introduce the basic application layer protocols.
Course Outcomes: At the end of the course, student will be able to:

Mapping of Course outcomes to Program outcomes:

CO1 Develop capability to design networks based on their knowledge of layered

communication architecture and its functionalities (TCP/IP) in teams.
CO2 Design and build solutions for problems in routing.
CO3 Know how the different Internet Protocol message formats are designed and implemented
CO4 Identify different types of networks, their management and security issues.
CO5 Comprehend areas affected by cyber crime
CO6 Investigate the use of tools used in cyber security

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3 2 3 - - 2 2 3 3 3
CO2 3 3 3 3 3 1 - 2 2 3 3 3
CO3 - - 3 3 2 - - 2 2 - 3 3
CO4 3 3 3 3 3 1 - 2 2 3 3 3
CO5 2 1 - - - - - 3 3 - 3 3
CO6 3 3 3 3 3 1 - 2 2 3 3 3
Self-study component:
Unit Contents of the Unit Hours Cos
1. Packet Switching Networks-1: Network services and
internal network operation, Packet network topology, Routing
in Packet networks, Shortest path routing: Bellman-Ford CO1,CO2
11
algorithm. Shortest path routing. & CO3,CO4

2. Packet Switching Networks -2: Traffic management at the

Packet level, Traffic management at Flow level, Traffic
CO1,CO2,
management at flow aggregate level.TCP/IP-1: TCP/IP
10 &
architecture, The Internet Protocol, IPv6, UDP, Internet
CO3,CO4
Routing Protocols, Multicast Routing.

3. Applications, Network Management, Network Security:

Application layer overview, Domain Name System (DNS),
Remote Login Protocols, E-mail ,File Transfer and FTP,
World Wide Web and HTTP, Network management, CO1,CO2,
Overview of network security, Overview of security methods, 11 &
Secret-key encryption protocols, Public-key encryption CO3,CO4
protocols, Authentication, Authentication and digital
signature, Firewalls.

4. Introduction to Cybercrime: Cybercrime: Definition and

Origins of the Word, Cybercrime and Information Security,
Who are Cybercriminals?, Classifications of Cybercrimes,
Cybercrime: The Legal Perspectives, Cybercrimes: An Indian
Perspective, Cybercrime and the Indian ITA 2000, A Global
10 CO5&CO6
Perspective on Cybercrimes, Cybercrime Era: Survival
Mantra for the Netizens. Cyber offenses: How Criminals Plan
Them: How Criminals Plan the Attacks, Social Engineering,
Cyberstalking, Cybercafe and Cybercrimes.

5. Tools and Methods Used in Cybercrime: Introduction,

Proxy Servers and Anonymizers, Phishing, Password
Cracking, Keyloggers and Spywares, Virus and Worms,
Trojan Horses and Backdoors, Steganography, DoS and
10 CO5& CO6
DDoS Attacks, SQL Injection, Buffer Overflow, Phishing and
Identity Theft: Introduction, Phishing, Identity Theft (ID
Theft).

Note: NO questions from illustrative examples and from Self Study Component.
1. Develop any application using any tool to perform
2. System scanning for vulnerabilities[tools eg: NetCat,SoCat… etc]
3. To detect and remove virus or worms from the system[tools eg: Network Sniffers and
Injection tools – Tcpdump and Windump, Wireshark, Ettercap, Hping Kismet]
TEXT BOOKS:
 1 Communication Networks – Fundamental Concepts & key architectures, Alberto Leon Garcia
& Indra Widjaja, 2nd Edition,Tata McGraw-Hill, India (7 - excluding 7.6, 8)
2 Computer & Communication Networks, Nadir F Mir, Pearson Education, India
(9, 10 excluding 10.7, 12.1 to 12.3, 16, 17.1 to 17.6, 18.1 to18.3,18.5, 19, 20)
3 SunitBelapure and Nina Godbole, “Cyber Security: Understanding Cyber
Crimes,Computer Forensics And Legal Perspectives”, Wiley India Pvt Ltd, ISBN: 978-81-
265- 21791, 2013.

REFERENCE BOOKS:
1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata McGraw-
Hill, 2006.
2. William Stallings: Data and Computer Communication, 8th Edition,Pearson Education, 2007.
3. Larry L Peterson and Bruce S Davie: Computer Networks – A Systems Approach, 4th
Edition, Elsevier, 2007.
4. Wayne Tomasi: Introduction to Data Communications and Networking, Pearson Education,
2005.
5. Bernadette H Schell, Clemens Martin, “Cybercrime”, ABC – CLIO Inc, California, 2004

Assessment Pattern:
CIE –Continuous Internal Evaluation Theory (50 Marks)
Bloom’s Category Tests Assignments AAT1 AAT2
Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 10 05 01 01
Apply 10 05 02 01
Analyze 02 02
Evaluate
Create

*AAT 1– Alternate Assessment Tool 1

AAT 2 - Alternate Assessment Tool 2

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks

Theory(50)
Remember 10
Understand 20
Apply 5
Analyze 5
Evaluate 10
Create
 JAVA AND J2EE

Course code: IS63 Credits: 03

L: P: T: S: 3:0:0:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40
Course objectives:
1. To provide an introduction to java and object oriented concepts of java programming.
2. Understand the use and creation of packages and interfaces.
3. Analyze and use exception handling, event handling in java.
4. Create web applications using Servlets and JSP.
Course Outcomes: At the end of the course, student will be able to:

CO1 Express classes, its members and the relationships among them needed for a specific
problem.
CO2 Apply the basic concepts of object oriented programming in writing java programs.
CO3 Create and use packages and interfaces in Java programs.
CO4 Analyze and implement exception handling in Java.
CO5 Develop graphical user interface using swings.
CO6 Construct web applications using Servlets and JSP.

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 - 2 2 - - 2 - -
CO2 3 3 1 2 2 1 2 2 2 - 2 2
CO3 2 - 1 - 1 - 2 - 2 2 - -
CO4 1 3 - 2 - - 2 1 1 - - -
CO5 1 - 2 - 2 - 1 1 1 5 - -
CO6 2 3 2 2 2 1 2 1 1 2 2 2

Unit. Content of the Unit Hours COs

1. Introduction to Java: The Creation of Java, Java’s Magic: The 07 CO1
Bytecode, The Java Buzzwords, Object-Oriented Programming, A &
First Simple Program, Type Conversion and Casting, Automatic Type CO2
Promotion in Expressions, Arrays. Introducing Classes: Class
Fundamentals, Declaring Objects, Assigning Object Reference
Variables, Introducing Methods, Constructors, The this Keyword, The
finalize( ) Method.

2. A Closer Look at Methods and Classes: Overloading Methods, 08 CO1

Using Objects as Parameters, Returning Objects, Introducing Access &
Control, Understanding static, Introducing final, Introducing Nested CO2
 and Inner Classes, Using Command-Line Arguments, Varargs:
Variable-Length Arguments. Inheritance: Inheritance Basics, Using
super, Creating a Multilevel Hierarchy, When Constructors Are
Called, Method Overriding, Dynamic Method Dispatch, Using
Abstract Classes, Using final with Inheritance.

3. Packages and Interfaces: Packages, Access Protection, Importing 08 CO2,

Packages, Interfaces. Exception Handling: Exception-Handling CO3
Fundamentals, Exception Types, Using try and catch, throw, throws, &
finally, Java’s Built-in Exceptions, Creating Your Own Exception CO4
Subclasses. Multithreaded Programming: The Java Thread Model,
Creating a Thread, Creating Multiple Threads, Synchronization,
Suspending, Resuming, and Stopping Threads.

4. String Handling: The String Constructors, String Length, Special 09 CO2

String Operations, Character Extraction, String Comparison, &
Modifying a String. Event Handling: The Delegation Event Model, CO5
Event Classes, Sources of Events, Event Listener Interfaces, Using the
Delegation Event Model, Adapter Classes, Inner Classes. Introducing
Swing: Two Key Swing Features, Components and Containers, The
Swing Packages, A Simple Swing Application.

5. Java 2 Enterprise Edition Overview: Overview of J2EE and J2SE; 08 CO2

J2EE Multitier architecture. Servlets: Background; The Life Cycle of &
a Servlet; A simple Servlet; The Servlet API; The Javax.servlet CO6
Package; Reading Servlet Parameter; The Javax.servlet.http package;
Handling HTTP Requests and Responses; Using Cookies; Session
Tracking. JSP: Java Server Pages (JSP): JSP, JSP Tags, Request
String, Cookies, Session Objects.

Self-study component:

Note: 1.Questions for CIE and SEE not to be set from self-study component.
2. Assignment Questions should be from self-study component only.

UNIT 1: Garbage Collection.

UNIT 2: The Object Class , java.lang package
UNIT 3: java.io
UNIT 4: Using valueOf(), StringBuffer, StringBuilder, java collection framework
UNIT 5: Tomcat Apache server installation and execution
TEXT BOOKS:
1. The Complete Reference - Java: Herbert Schildt, 7th Edition, McGraw Hill, 2017.
2. Jim Keogh: J2EE - The Complete Reference, Tata McGraw Hill, 2007.

REFERENCE BOOKS:
1. Y. Daniel Liang: Introduction to JAVA Programming, 10th Edition, Pearson Education, 2015.
 2. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007.
3. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education, 2004.

Assessment Pattern:
CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 08 05 01 01
Apply 07 05 02 01
Analyze 05 02
Evaluate
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)
Remember 05
Understand 10
Apply 10
Analyze 10
Evaluate 10
Create 05
 PROBABILITY STATISTICS AND QUEUING THEORY

Course code: IS64 Credits: 04

L: P: T: S: 4:0:0:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 52

Course Objectives:
1. To understand probability concepts.
2. To understand and design solutions for probability distribution function
3. To understand & apply the knowledge of elementary probability models and queuing theory.
4. To understand how to design queuing models for real time problems.

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

CO1 Acquire knowledge on probability concept, probability distribution, hypothesis, regression

and queuing theory
CO2 Solve conditional probability and probability distribution function for real world events
CO3 Apply statistical data to test hypothesis and perform regression analysis
CO4 Analyze elementary probability models, statistical inferences and queuing theory
Decide which appropriate probabilistic or statistical models to be used for any engineering
CO5
problems
CO6 Construct queuing models for practical problems

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 1 3 1 3 3 3 3 3 2
CO2 2 3 3 1 3 1 3 3 3 3 3 2
CO3 3 3 3 1 3 1 3 3 2 2 3 1
CO4 3 3 3 1 3 1 3 3 3 3 3 2
CO5 2 2 3 1 2 1 2 3 2 3 3 2
CO6 1 1 2 1 2 1 2 3 3 3 3 2
 Unit Contents of the Unit Hours COs
Probability: Introduction, Sample spaces and events, Counting, The
axioms of Probability, Some Elementary theorems, Conditional 08 CO1
1
Probability, Baye’s theorem
Probability Distributions : Random variables, Binomial distribution,
Probabililty Densities – Continuous random variables, Normal 08 CO2
2
distribution, Sampling Distributions – Population and Samples

Inferences Concerns Means : Point Estimation, Interval Estimation, Test

08
3 of hypothesis, Null Hypothesis and Test of Hypothesis CO3

Curve Fitting : The method of Least squares, Curve Linear regression,

08
4 Multiple regressions, Inferences based on least square estimators CO4
CO5
Markov Process and Queuing Theory : Introduction, Markov Process,
Birth Death Process, Queuing Theory, Little’s Theorem, M/M/1 Queue, 08 CO6
5
M/M/r Queue

TEXT BOOKS:

1. Miller and Freund’s, Probability and Statistics for Engineers, 7th edition, Richard A Johnson,
PHI
2. Probability, Random Variables and Stochastic Processes, A. Papoulis and S. Unnikrishnan
Pillai, 4th edition,McGrawHill

REFERENCE BOOKS:
1. Probability & Statistics with Reliability, Queuing and Computer Science Applications, Kishore
S Trivedi, Wiley publications, 2nd edition, 2012
2. Applied statistics and Probability for engineers, Douglas C Montgomery, George C Runger, 5th
edition, Wiley India

E-BOOKS:
1. http:// www.sciencedirect.com/science/book/9780080571058
Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 08 05 01 01
Apply 07 05 02 01
Analyze 05 02
Evaluate
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)

Remember 05
Understand 10
Apply 10
Analyze 10
Evaluate 10
Create 05
 ELECTIVES – B

SYSTEM SIMULATION AND MODELING

Course code: IS641 Credits: 03

L: P: T: S: 3:0:0:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. To understand the concepts of system, models in general and simulation models in
particular
2. To Develop simulation models using general purpose programming language - Java, and
Simulation programming language – GPSS
3. Explore the various techniques to generate random numbers and and test for randomness
4. Verify, Validate and perform output analysis of a simulation model

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

CO1 Identify the concepts of simulation used to develop models

CO2 Design and develop models using simulation algorithm techniques
CO3 Design and develop techniques to generate and test random numbers
CO4 Apply the Concepts of Statistics to build Models
CO5 Verify, Validate and Perform output analysis of a simulation model
CO6 The student will be able to design and develop an input model for a given simulation
system

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 1 - - 1 - - - - 1 - 2
CO2 3 2 1 1 1 1 1 - 1 1 1 2
CO3 3 2 1 2 2 1 2 - 1 1 1 2
CO4 3 3 2 2 3 1 2 1 2 1 1 2
CO5 3 2 1 2 3 1 2 1 1 1 1 2
CO6 3 3 3 3 3 2 3 2 3 3 3 3
 Unit. Content of the Unit Hours COs
1. Introduction to Simulation: When simulation is the appropriate tool 08 CO1
and when it is not appropriate, Advantages and disadvantages of
Simulation, Areas of application, Systems and system environment,
Components of a system, Discrete and continuous systems, Model of a
system, Types of Models, Discrete-Event System Simulation, Steps in
a Simulation Study; Simulation examples: Simulation of queuing
systems, Simulation of inventory systems.

2. Concepts in Discrete-Event Simulation: The Event-Scheduling / 08 CO2

Time-Advance Algorithm, World Views, Manual simulation Using
Event Scheduling; List processing, Simulation in Java, Simulation in
GPSS; Statistical Models in Simulation: Review of terminology and
concepts, Discrete distributions, Continuous distributions-Uniform
distribution, Exponential distribution, Normal distribution. Statistical
Models in Simulation: Review of terminology and concepts Useful
statistical models, Discrete distributions, Continuous distributions,
Poisson process.

3. Random-Number Generation: Properties of random numbers, 08 CO3,

Generation of pseudo-random numbers; Techniques for generating CO4
random numbers; Tests for Random Numbers. Random-Variate &
Generation: Inverse transforms technique-Exponential Distribution, CO6
Uniform Distribution, Discrete Distributions, Acceptance-Rejection
technique: Poisson Distribution, Convolution method.

4. Queueing Models: Characteristics of queuing systems, Queuing 08 CO4

notation, Long-run measures of performance of queuing systems; &
Input Modeling: Data Collection, Identifying the distribution with CO5
data, Parameter estimation, Goodness of Fit Tests, Selecting input
models without data.

5. Verification and Validation of Simulation Models: Model building, 08 CO5

verification and validation, Verification of simulation models, &
Calibration and validation of models, Output Analysis for a Single CO6
Model: Types of simulations with respect to output analysis,
Stochastic nature of output data; Measures of performance and their
estimation.

Self-study component:
Note: 1.Questions for CIE and SEE not to be set from self-study component.
2. Assignment Questions should be from self-study component only.

UNIT 1: Simulation of inventory systems

UNIT 2: A study of Useful statistical models
UNIT 3: Basics of how to generate random numbers
UNIT 4: Long-run measures of performance of queuing systems
TEXT BOOK:

1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System
Simulation, Fourth Edition, Pearson Education, 2007.

REFERENCE BOOKS:

1. Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course, Pearson
/ Prentice-Hall, 2006.
2. Sheldon M. Ross: Simulation, Fourth Edition, Elsevier, 2006.
3. Averill M. Law: Simulation Modeling and Analysis, Fourth Edition, Tata McGraw-Hill, 2007.

Assessment Pattern:
CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 08 05 01 01
Apply 07 05 02 01
Analyze 05 02
Evaluate
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)
Remember 05
Understand 10
Apply 10
Analyze 10
Evaluate 10
Create 05
 PROGRAMMING THE WEB

Course code: IS642 Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40
Course Objectives:
1. To gain ample understanding on designing static web pages.
2. To understand the need and different techniques for programming the web.
3. To understand concept of java scripting, perl, cgi ruby, rails.
4. Use scripting languages, to create dynamic web pages with event handling.

Course Outcomes: At the end of the course, student will be able to:
CO1 To gain an insight of the internet and related internet concepts that are vital in
understanding web development
CO2 Discuss the insights of internet programming and implement complete application over
the web.
CO3 Demonstrate the important HTML tags for designing static pages and separate design
from content using Cascading Style sheet.
CO4 Utilize the concepts of JavaScript and Java
CO5 Use web application development software tools i.e. Ajax, XML, RUBY and RAILS
etc.
CO6 Use scripting languages, to create dynamic web pages with event handling

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 3 - 3 2 1 1 - 2 1 2
CO2 2 2 3 1 3 1 2 - 1 2 1 2
CO3 2 3 - 1 4 - 2 - 2 2 - 1
CO4 2 1 3 - 4 - 2 1 2 - - 2
CO5 2 1 2 2 4 2 1 - 1 2 - 1
CO6 2 1 3 - 1 - 3 2 1 1 - -

Unit. Content of the Unit Hours COs

1. Fundamentals of Web, XHTML – 1: Internet, WWW, Web
Browsers and Web Servers, URLs, MIME, HTTP, Security. CO1
XHTML: Basic syntax, Standard structure, Basic text markup, 08 &
Images, Hypertext Links, Lists, Tables, Forms. CO2

2. CSS: Introduction, Levels of style sheets, Style specification formats,

CO1
Selector forms, Property value forms, Font properties, List properties,
08 &
Color, Alignment of text, The box model, Background images,
CO2
Conflict resolution.JavaScript: Overview of JavaScript, Object
 orientation and JavaScript, Syntactic characteristics, Primitives,
operations, and expressions.

3. JavaScript: (continued) Screen output and keyboard input, Control

statements, Object creation and modification, Arrays,
Functions, Constructors, Pattern matching using regular expressions,
Errors in scripts. JavaScript and HTML Documents, Dynamic
Documents with JavaScript: The JavaScript execution environment, CO2,
The Document Object Model, Element access in JavaScript, Events 08 CO3&
and event handling, Handling events from the Body elements, Button CO4
elements, Text box and Password elements. Introduction to dynamic
documents, Positioning elements, Moving elements, Element
visibility.

4. XML: Introduction, Syntax, Document structure, Document type

definitions, XML schemas, Displaying raw XML documents,
Displaying XML documents with CSS. Perl, CGI Programming: CO2
Origins and uses of Perl, Scalars and their operations, Assignment 08 &
statements and simple input and output, Control statements, CO5
Fundamentals of arrays, Hashes.

5. The Common Gateway Interface; CGI linkage; Query string format;

Ruby, Rails: Origins and uses of Ruby, Scalar types and their
CO2
operations, Simple input and output, Control statements. Overview of
08 &
Rails, Document requests, Processing forms, Rails applications with
CO5
Databases.

Self-study component:
Note: NO questions from illustrative examples and from Self Study Component.

Unit 1: Frames
Unit 2: The <span> and <div> tags,
Unit 3: Changing colors and fonts, Dynamic content, Stacking elements, Locating the mouse
Cursor, reacting to a mouse click, Slow movement of elements.
Unit 4: XSLT style sheets, XML processors.
Unit 5: CGI.pm module, rails application layout.

TEXT BOOK:
1. Robert W. Sebesta: Programming the World Wide Web, 4th Edition, Pearson Education,
2008. (Listed topics only from Chapters 1 to 9, 11 to 15)

REFERENCE BOOKS:
1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to Program, 4th
Edition, Pearson Education, 2004.
 2. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley India,
2007.
3. Xue Bai et al: The web Warrior Guide to Web Programming, Cengage Learning, 2003.

E –Book :
1. http://anibal.gyte.edu.tr/hebe/AblDrive/80782032/w/Storage/104_2011_1_374_80782032/Do
wnloads/ch01.pdf

Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 08 05 01 01
Apply 07 05 02 01
Analyze 05 02
Evaluate
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)

Remember 05
Understand 10
Apply 10
Analyze 10
Evaluate 10
Create 05
 SOFTWARE PROJECT MANAGEMENT

Course code: IS643 Credits: 03

L: P: T: S: 3: 0: 0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course Objectives:
1. To introduce software project management concepts.
2. To introduce effective project management as a structured methodology for professional
software development.
3. To enhance the knowledge and skills of engineers to plan, evaluate, monitor and control
software projects.
4. To enhance development of qualitative projects to become successful
entrepreneur/engineers/project leaders.
Course Outcomes: At the end of the course, student will be able to:

CO1 Introduce and comprehend the software project management concepts.

Able to analyze effective project management as a structured methodology for
CO2
professional software development.
Develop and enhance the knowledge and skills of engineers to plan, evaluate, monitor
CO3
and control software projects.
CO4 Develop customer satisfied high quality software projects.

CO5 Transform engineers into successful entrepreneurs/project leaders.

CO6 Critique and justify effective and efficient project development process.

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 - - - - - - - 3 - 3 3
CO2 - - 3 - - 1 - - - - 3 3
CO3 - - 3 3 - - - - - - 3 -
CO4 - - - - - 3 3 3 - - 3 -
CO5 - - - - - - - - 3 3 3 3
CO6 - - 3 - - 3 3 - - - 3 -
Module Course Content Hours COs
1 Overview of Software Engineering, Process Models, Project CO1
Management Concepts, Software Process & Project Metrics 08 CO2
2 Software Project Planning, Stepwise : An overview of project CO3
planning 08 CO4

3 Project Evaluation & Selection of an appropriate project approach , CO3

Software Effort Estimation, Risk Analysis & Management, Review CO4
08
Session

4 Project Scheduling & Tracking, Activity Planning, Resource CO3

Allocation 08 CO5

5 Project Monitoring & Control, Managing Contracts, Managing CO5

People and Organizing teams 08 CO6

Self study component:

Note:
1. Questions for CIE and SEE not to be set from self-study component.
2. Assignment Questions should be from self-study component only.

What is Open Source and leveraging Open source for increasing productivity, Agile &
Iterative processes, Modern development process for project in SMAC ( Social, Mobile,
Analytics & Cloud) & review

TEXT BOOKS

1. Pressman, R.S., Software Engineering : A Practitioner’s Approach, 7th (Alternate) Edition,

McGraw Hill, 2010
2. Hughes, B and Cotterell, M., Software Project Management, 5th Edition, TMH, 2009

REFERENCE BOOKS

1. Sommerville, Ian: Software Engineering, 9th Edition, Pearson, 2011

2. Pankaj Jalote, Software Project Management in Practice, Pearson Education, 2002
Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 02 -- 02 01
Understand 08 -- 01 01
Apply 10 05 -- 01
Analyze 05 05 02
Evaluate 05
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Marks
Bloom’s Category Theory(50)
Remember 10
Understand 08
Apply 10
Analyze 10
Evaluate 10
Create 02
 DESIGN PATTERNS
Course code: IS644 Credits: 03
L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. To understand formal notations and concepts of Design Patterns using object concepts.
2. To understand design of document editors using case study.
3. To learn designing of various structural patterns.
4. To learn designing of various behavioural patterns.
Course Outcomes: At the end of the course, student will be able to:

Distinguish between various formal notations and gain knowledge of concepts of Design
CO1
Patterns using object concept.
CO2 Understand and apply common design patterns to incremental / iterative development.
CO3 Identify appropriate design patterns for a given problem.
CO4 Design document editors using case study.
CO5 Design various structural patterns.
CO6 Design various behavioral patterns

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 1 - - - 1 1 1 - 2 1
CO2 3 2 1 1 2 - 1 1 2 2 2 -
CO3 3 2 - - 2 1 - - 1 1 1 -
CO4 3 3 2 1 2 1 - - 1 1 1 -
CO5 3 2 1 - 1 - 1 2 1 1 1 -
CO6 3 3 2 1 2 - - - 1 1 1 2
 Unit Contents of the Unit Hours Cos
1. Introduction To Design Patterns: Class diagram, Object
diagram, Interaction diagram Examples. List, Iterator, List
Iterator, Point, Rect, coding in C++, Design Pattern
Definition, Design Patterns in Small Talk MVC, Describing
08 CO1&CO2
Design Patterns, Catalog of Design Patterns, Organizing the
Catalog, Solving of Design Problems using Design Patterns,
Selection of a Design Pattern, use of Design Patterns.

2. Designing a Document Editor: A Case Study - Design

problems, Document structure, Formatting, Embellishing the
User Interface, Supporting Multiple Look and Feel standards, 08 CO3&CO4
Supporting Multiple Window Systems.

3. Design Patterns Catalog: Creational Patterns, Abstract

Factory, Builder, Factory Method, Prototype, Singleton.
08 CO2
Discussion of Creational Patterns.

4. Structural patterns 1: Adapter, Bridge, Composite, And

Decorator, Structural patterns 2: Façade. Flyweight. Proxy.
08 CO5
Discuss of Structural Patterns.

5. Behavioral Patterns 1: Chain of Responsibility Command,

Interpreter. Behavioral Patterns 2: Iterator. Mediator.
08 CO6
Observer. State. Strategy. Template Method. Visitor.

TEXT BOOK:

1. Gamma, Belm, Johnson, “Design Patterns: Elements of Reusable Object Oriented

Software”,1995, PEA.

REFERENCE BOOKS:

1. Cooper, “Java Design Paterns”, Pearson.

2. Horstmann, “Object Oriented Design and Pattetrns”, Wiley.
3. Ali Bahrami, “Object Oriented Systems Development”, 1999, MCG.
4. Larman, “Applying UML Patterns”, PEA.
Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 02 -- 02 01
Understand 08 -- 01 01
Apply 10 05 -- 01
Analyze 05 05 02
Evaluate 05
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Marks
Bloom’s Category Theory(50)
Remember 10
Understand 08
Apply 10
Analyze 10
Evaluate 10
Create 02
 ELECTIVES – C

FUNDAMENTALS OF IOT

Course code: IS651 Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course Objectives:
1. To gain an insight into the fundamentals of Internet of Things (IOT)
2. To gain ample understanding of IOT security events
3. To understand the need and techniques for IOT solutions
4. To introduce the basic security issues with respect to IOT
Course Outcomes: At the end of the course, student will be able to:
Understand limitations and prospect of wireless and mobile networks for Internet
CO1
of Things.
CO2 Analyze the societal impact of IoT security measures.
CO3 Develop critical thinking skills.
CO4 Analyze, design or develop parts of an Internet of Things solution
CO5 Evaluate ethical and probable security issues related to the Internet of Things
CO6 Investigate business models and map it toward selected IOT solutions

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 - - - - - - - - - -
CO2 - - - - - 3 2 - - - - -
CO3 3 2 - 3 - - - - - - - -
CO4 3 - 3 3 - - - - - - - -
CO5 - - - - - - 2 3 - - - -
CO6 - - 2 3 - - - - - - - -

Unit Contents of the Unit Hours Cos

1. M2M to IoT Introduction: The Vision-Introduction, From
M2M to IoT, M2M towards IoT-the global context, A use 08 CO1,CO2,&
case example CO3,CO4

2. M2M to IoT- A Market Perspective– Introduction, Some

Definitions, M2M Value Chains, IoT Value Chains, An
emerging industrial structure for IoT, The international driven
global value chain and global information monopolies. M2M 08 CO1,CO2,&
to IoT-An Architectural Overview– Building an architecture, CO3,CO4
Main design principles and needed capabilities, An IoT
architecture outline.
 3. M2M and IoT Technology Fundamentals Devices and
gateways, Local and wide area networking, Data
management, Business processes in IoT, Everything as a 08 CO5 & CO6
Service(XaaS), M2M and IoT Analytics.

4. IoT Architecture-State of the Art Introduction, State of the

art, Architecture Reference Model- Introduction, Reference
Model and architecture, IoT reference Model. IoT Reference
Architecture Introduction, Functional View, Information 08 CO5 & CO6
View, Deployment and Operational View, Other Relevant
architectural views

5. Real-World Design Constraints- Introduction, Technical

Design constraints-hardware is popular again, Data
representation and visualization, Interaction and remote
control. Industrial Automation- Service-oriented
08 CO4 & CO6
architecture-based device integration, SOCRADES: realizing
the enterprise integrated Web of Things, IMCAESOP: from
the Web of Things to the Cloud of Things.

Self-study component:
Note: NO questions from illustrative examples and from Self Study Component.
Unit 1: Differing Characteristics
Unit 2: Standards considerations.
Unit 3: Knowledge Management
Unit 4: Other Relevant architectural views
Unit 5: Commercial Building Automation

TEXT BOOKS:
1. Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis Karnouskos, David
Boyle, “From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence”, 1 st Edition, Academic Press, 2014.

REFERENCE BOOKS:
1.Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-on-Approach)”, 1 st
Edition, VPT, 2014.
2. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, 1st Edition, Apress Publications, 2013
Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 10 05 01 01
Apply 10 05 02 01
Analyze 02 02
Evaluate
Create

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks

Theory(50)
Remember 10
Understand 20
Apply 5
Analyze 5
Evaluate 10
Create
 ARTIFICIAL INTELLIGENCE

Course code: IS652 Credits: 03

L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. Learn the role of intelligent agents in AI.
2. Analyze logical agents.
3. Usage of first order logic.
4. Assessing knowledge representation in AI.

Course Outcomes: At the end of the course, student will be able to:
CO1 Apply the basic concepts of intelligent agents & problem solving agents.
CO2 Choose search method for particular problem.
CO3 Discover Knowledge of logical agents and logic.
CO4 Analyze the basic principles of first order logic.
CO5 Design and develop knowledge representation methods.
CO6 Examine Planning skills and uncertainty.

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 1 1 1 - - - 1 2 3
CO2 3 3 3 2 2 1 - - - 1 1 3
CO3 3 3 3 1 1 1 - - - 1 2 3
CO4 2 2 3 1 1 1 - - - 1 1 3
CO5 3 3 3 1 1 1 - - - 1 1 3
CO6 3 2 3 1 1 1 - - - 1 2 3

Unit Contents of the Unit Hours Cos

1. Introduction: What is AI? Intelligent Agents: Agents and
environment; Rationality; the nature of environment; the
structure of agents. Problem solving: Problem-solving agents;
Example problems; Uninformed search strategies. Informed 08 CO1, CO2
Search, Exploration: Informed search strategies; Heuristic
functions.

2. Adversial search: Games; Optimal decisions in games;

Alpha-Beta pruning. Logical Agents: Knowledge-based
08 CO2, CO3
agents; The wumpus world as an example world; Logic;
propositional logic Reasoning patterns in propositional logic;
 Effective propositional inference; Agents based on
propositional logic.

3. First-Order Logic, Inference in First-Order Logic – 1:

Representation revisited; Syntax and semantics of first-order
logic; Using first-order logic; Knowledge engineering in first-
08 CO4
order logic. Propositional versus first-order inference;
Unification and lifting.

4. Knowledge Representation: Ontological engineering;

Categories and objects; Actions, situations, and events;
Mental events and mental objects; The Internet shopping
08 CO5
world; Reasoning systems for categories; Reasoning with
default information; Truth maintenance systems.

5. Planning, Uncertainty, Probabilistic Reasoning: Planning:

The problem; Planning with state-space approach; Planning
graphs; Planning with propositional logic. Uncertainty:
Acting under certainty; Inference using full joint
distributions; Independence; Bayes’ rule and its use.
08 CO6
Probabilistic Reasoning: Representing knowledge in an
uncertain domain; The semantics of Bayesian networks;
Efficient representation of conditional distributions; Exact
inference in Bayesian networks.

TEXT BOOK:

1. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, 3rd Edition,
Pearson Education, 2015.

REFERENCE BOOKS:

1. Elaine Rich, Kevin Knight: Artificial Intelligence, 3rd Edition, Tata McGraw Hill, 2009.
2. Nils J. Nilsson: Principles of Artificial Intelligence, Elsevier, 1980.
Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 10 05 01 01
Apply 10 05 02 01
Analyze 02 02
Evaluate
Create

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks

Theory(50)
Remember 10
Understand 20
Apply 5
Analyze 5
Evaluate 10
Create
 OBJECT ORIENTED MODELING AND DESIGN

Course code: IS653 Credits: 03

L: P: T: S: 3: 0: 0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course Objectives:
1. Design and develop the Software Model using Unified Modeling language
2. Describe and implement Object Oriented Modeling using UML notations.
3. Design Class model, State model and Interaction model using Object oriented and UML
notations.
4. Construct interaction models using Use case and Sequence diagrams

Course Outcomes: After completion of the course, the graduates will be able to

CO1 Introduce the Unified Modeling Language concepts in object oriented modeling.

CO2 Build Class Model.

CO3 Analyze, Build and classify the State model

CO4 Construct interaction models using use cases diagrams

Develop and construct Sequence Diagrams and Activity diagrams
CO5

CO6 Design and develop Software Model using UML notations

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 1 - - - - - - 2 3 3
CO2 1 2 2 - - - - 3 - 3 3
CO3 1 1 1 - - - - - - - 2 3
CO4 1 2 1 - - - - 3 3 - 2 -
CO5 1 1 1 1 1 - - 3 3 - 2 -
CO6 1 2 2 - 3 - - 3 2 1 3 2
 Unit Course Content Hours COs
Introduction, Modeling Concepts, class Modeling: What is Object
Orientation? What is OO development? OO themes; Evidence for
usefulness of OO development; OO modeling history Modeling as Design
Technique: Modeling; abstraction; The three models. Class Modeling:
1 08 CO1
Object and class concepts; Link and associations concepts; Generalization
and inheritance; A sample class model; Navigation of class models;
Practical tips.

Advanced Class Modeling, State Modeling: Advanced object and class

concepts; Association ends; N-ary associations; Aggregation; Abstract
classes; Multiple inheritance; Metadata; Reification; Constraints; Derived CO2
2 08
data; Packages; Practical tips. State Modeling: Events, States, Transitions CO3
and Conditions; State diagrams; State diagram behavior; Practical tips.

Advanced State Modeling, Interaction Modeling: Advanced State

Modeling: Nested state diagrams; Nested states; Signal generalization;
Concurrency; A sample state model; Relation of class and state models;
3 Practical tips. Interaction Modeling: Use case models; Sequence models; 08 CO4
Activity models. Use case relationships; Procedural sequence models; CO5
Special constructs for activity models.

Process Overview, System Conception, Domain Analysis: Process

Overview: Development stages; Development life cycle. System
Conception: Devising a system concept; Elaborating a concept; Preparing
4 a problem statement. Domain Analysis: Overview of analysis; Domain 08 CO6
class model; Domain state model; Domain interaction model; Iterating the
analysis.

Application Analysis, System Design : Application Analysis:

Application interaction model; Application class model; Application state
model; Adding operations. Overview of system design; Estimating
performance; Making a reuse plan; Breaking a system in to sub-systems;
CO6
5 Identifying concurrency; Allocation of sub-systems; Management of data 08
storage; Handling global resources; Choosing a software control strategy;
Handling boundary conditions; Setting the trade-off priorities; Common
architectural styles; Architecture of the ATM system as the example.

Self study component:

Note: 1.Questions for CIE and SEE not to be set from self-study component.
2. Assignment Questions should be from self-study component only.

1. Class Design:Overview of class design; Bridging the gap; Realizing use cases; Designing
algorithms; Recursing downwards, Refactoring; Design optimization; Reification of behavior;
Adjustment of inheritance; Organizing a class design; ATM example.
 2. Legacy Systems: Reverse engineering; Building the class models; Building the interaction
model; Building the state model; Reverse engineering tips; Wrapping; Maintenance.
TEXT BOOKS
1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML,
2 nd Edition, Pearson Education, 2005.

REFERENCE BOOKS
1. Grady Booch et al: Object-Oriented Analysis and Design with Applications, 3rd Edition,
Pearson Education, 2007.
2. Brahma Dathan, Sarnath Ramnath: Object-Oriented Analysis, Design and Implementation,
Universities Press, 2009.
3. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, Wiley-
Dreamtech India, 2004.
4. Simon Bennett, Steve McRobb and Ray Farmer: Object-Oriented Systems Analysis and
Design Using UML, 2nd Edition, Tata McGraw-Hill, 2002.

Assessment Pattern:
CIE –Continuous Internal Evaluation Theory (50 Marks)
Bloom’s Category Tests Assignments AAT1 AAT2
Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 10 05 01 01
Apply 10 05 02 01
Analyze 02 02
Evaluate
Create

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)
Remember 10
Understand 20
Apply 5
Analyze 5
Evaluate 10
Create
 INFORMATION TECHNOLOGY SERVICE MANAGEMENT

Course code: IS654 Credits: 03

L: P: T: S: 3:0:0:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course Objectives:
1. To develop an understanding of the "state of the art" of IT service management thinking
including IT service systems
2. To understand the service system worldview in order to develop a service mindset and service
development from both a product and process perspective.
3. To gain an appreciation of the complexities associated with implementing change during IT
services.
4. To extend the knowledge scope from Technique to Management, and from Software
Engineering to Service Science
Course Outcomes: After completion of the course, the graduates will be able to

CO1 Assessing the need for Service Management in Information Business Sector
Determining the importance of adhering to Information Technology Service
CO2
Management Framework
Illustrating the implementation of service management process through various
CO3
strategies and design methods
CO4 Mapping the service design to build and deploy IT Services
Facilitating the delivery of services effectively and efficiently to fulfill the user
CO5
requests
CO6 Adapting the service methods to facilitate quality management

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - - 2 3 - - 1 - - - 2
CO2 3 - - 3 - - - - - 2 - -
CO3 3 - - - - - 1 - 1 2 - -
CO4 - 3 3 - 3 - - - - 3 - -
CO5 - 3 - - 2 1 1 - - - - -
CO6 - - 2 3 1 - - - - - - 3
 Course Content Hours COs
Unit
1 Service Management Introduction: The Importance of IT Service
Management Processes, IT Service Management Frameworks,
Introduction to the Service Life Cycle, Introduction to ITIL, IT
Governance, Organizational maturity, Benefits and risks of ITSM 08 CO1
frameworks, Service Life Cycle: concept and overview. Service
Strategy-I: Basic concepts, Processes and other activities.

2 Service Strategy-II: Organization, Methods, Techniques and Tools.

Service Design: Basic concepts, Processes and other activities, CO2
08
Organization, Implementation CO3

3 Service Transition: Basic concepts, Processes and other activities,

Organization, Methods, Techniques and Tools, Implementation. 08 CO4
CO5
4 Service Operation: Basic concepts, Processes and other activities,
Organization, Methods, Techniques and Tools, Implementation. 08 CO6

5 Continual Service Improvement: Basic concepts, Processes and other

CO6
activities, Organization, Methods, Techniques and Tools, Implementation. 08

Self-Study Component:

Unit 1: Complementary Frameworks, IT Service Management Standard – ISO/IEC 20000,

Assessing Process Maturity
Unit 2: Service Strategy: Implementation
Unit 3: Service Design Methods, Techniques and Tools
Unit 4: Service Operation: Functions and Processes
Unit 5: Continual Service Improvement: Functions and Processes

TEXT BOOKS:

1. Foundations of IT Service Management: based on ITIL by Jan van Bon, Arjen de Jong, Axel
Kolthof, Mike Pieper, Ruby Tjassing, Annelies van der Veen, Tieneke Verheijen, 3rd Edition,
Van Haren Publishing, Zaltbommel, September 2007 (Chapters: 2, 3,4,5,6,7)
2. Foundations of ITIL: Volume 3: Based on ITIL V3 (Best Practice IT Management), Jan Van
Bon, Annelies van der Veen, Van Haren Publishing, November 2007
REFERENCE BOOK:

1. The Official Introduction to the ITIL, Service Lifecycle, Stationery Office Books, May 2007

Assessment Pattern:

CIE –Continuous Internal Evaluation Theory (50 Marks)

Bloom’s Category Tests Assignments AAT1 AAT2

Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 08 05 01 01
Apply 07 05 02 01
Analyze 05 02
Evaluate
Create 02

*AAT 1– Alternate Assessment Tool 1: Quiz

AAT 2 - Alternate Assessment Tool 2: Surprise Test

SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)

Remember 05
Understand 10
Apply 10
Analyze 10
Evaluate 10
Create 05
 COMPUTER NETWORKS AND CYBER SECURITY LAB

Course code: ISL67 Credits: 02

L: P: T: S: 0: 2: 0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50

Course Objectives:
1. To understand the design and implementation of routing concepts
2. To gain insight into flow control and congestion control mechanisms
3. To understand the concept of wired networks using TCP through simulation
4. To understand the concept of wireless networks using UDP through simulation

Course Outcomes: After completion of the course, the graduates will be able to

Simulate wired and wireless topology in NCTUns simulator using features like X
CO1
graph.
Implement and use IPC mechanisms, routing protocols, error detection and correction
CO2
methods.
CO3 Implement cryptographic algorithms like RSA for data communication
CO4 Implement congestion control algorithms like Buffer overflow attack
CO5 Implement methods to overcome password cracking attacks
CO6 Detect Buffer overflow attacks

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3 2 3 - - 2 2 3 3 3
CO2 3 3 3 3 3 1 - 2 2 3 3 3
CO3 - - 3 3 2 - - 2 2 - 3 3
CO4 3 3 3 3 3 1 - 2 2 3 3 3
CO5 2 1 - - - - - 3 3 - 3 3
CO6 3 3 3 3 3 1 - 2 2 3 3 3

Experiment
Contents of the experiment Hours Cos
No.
1. Simulate a three nodes point – to – point network with duplex links
between them. Set the queue size and vary the bandwidth and find the
3 CO1
number of packets dropped.

2. Simulate a four node point-to-point network with the links connected as

follows:
n0 – n2, n1 – n2 and n2 – n3. Apply TCP agent between n0-n3 and 3 CO1
UDP between n1-n3. Apply relevant applications over TCP and UDP
agents changing the parameter and determine the number of packets
 sent by TCP / UDP.
3. Simulate the transmission of ping messages over a network topology
consisting of 6 nodes and find the number of packets dropped due to CO1
3
congestion. CO2

4. Simulate an Ethernet LAN using n nodes (6-10), change error rate and CO1
data rate and compare throughput. 3
CO4
5. Simulate an Ethernet LAN using n nodes and set multiple traffic nodes CO1
and plot congestion window for different source / destination. 3
CO4
6. Simulate simple ESS and with transmitting nodes in wire-less LAN by
CO1
simulation and determine the performance with respect to transmission
3 CO2
of packets.
CO4
7. Write a program for error detecting code using CRC-CCITT (16- bits). CO1
3 CO3
CO4
8. Write a program for distance vector algorithm to find suitable path for
transmission. 3 CO1

9. Using TCP/IP sockets, write a client – server program to make the

client send the file name and to make the server send back the contents
3 CO1
of the requested file if present.

10. Implement the above program using as message queues or FIFOs as CO1
IPC channels. 3
CO3
11. Write a program for simple RSA algorithm to encrypt and decrypt the CO1
data. 3 CO4
CO5
12. Write a program to illustrate Buffer overflow attack CO1
3 CO4
CO6

TEXT BOOKS:

1. Communication Networks – Fundamental Concepts & key architectures, Alberto Leon Garcia
& Indra Widjaja, 2nd Edition,Tata McGraw-Hill, India
2. Computer & Communication Networks, Nadir F Mir, Pearson Education, India
3. SunitBelapure and Nina Godbole, “Cyber Security: Understanding Cyber Crimes, Computer
Forensics And Legal Perspectives”, Wiley India Pvt Ltd, ISBN: 978-81-265- 21791, 2013.

REFERENCE BOOKS:

1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata

McGraw-Hill, 2006.
2. William Stallings: Data and Computer Communication, 8th Edition,Pearson Education,
2007.
 3. Larry L Peterson and Bruce S Davie: Computer Networks – A Systems Approach, 4th
Edition, Elsevier, 2007.
4. Wayne Tomasi: Introduction to Data Communications and Networking, Pearson
Education, 2005.
5. Bernadette H Schell, Clemens Martin, Cybercrime , ABC – CLIO Inc, California, 2004

Assessment Pattern:

CIE –Continuous Internal Evaluation Lab (50 Marks)

Continual Internal IA Test Marks Final Marks

Evaluation Marks (25) (25) (50)

SEE –Semester End Examination Theory (50 Marks)

 JAVA AND J2EE LAB

Course code: ISL68 Credits: 02

L: P: T: S: 0: 2: 0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50

Course Objectives:
1. To provide an introduction to java and object oriented concepts in java programming.
2. Understand the creation and use of packages and interfaces.
3. Analyze and use exception handling in java.
4. Create web applications using Servlets and JSP.

Course Outcomes: After completion of the course, the graduates will be able to

CO1 Write, compile and execute java programs.

CO2 Apply the basic concepts of object oriented programming in writing java programs.
CO3 Design and use classes, packages and interfaces
CO4 Analyze and implement exception handling, event handling
CO5 Develop graphical user interface using swings
CO6 Construct web applications using Servlets and JSP

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 - 2 2 - - 2 - -
CO2 3 3 1 2 2 1 2 2 2 - 2 2
CO3 2 - 1 - 1 - 2 - 2 2 - -
CO4 1 3 - 2 - - 2 1 1 - - -
CO5 1 - 2 - 2 - 1 1 1 5 - -
CO6 2 3 2 2 2 1 2 1 1 2 2 2

Experiment
Contents of the experiment Hours COs
No.
(a) Write a Java program to implement linear search.
CO1
1. (b) Write a java program for sorting a given list of names. 3
CO2
(a) Write a java program that illustrates the multilevel inheritance.
(b) Write a java program that illustrates the multiple inheritances by CO1
2. 3
using interfaces. CO2

(a) Write a Java program to implement the concept of importing classes CO1
3. from user defined package and creating packages. 3 CO3
(b) Write a Java program that reads a line of integers and then displays
 each integer and the sum of all integers. (use StringTokenizer class)

(a) Write a program to perform arithmetic operations using static

members CO1
4. 3
(b) Write a program to read and print n numbers using arrays CO2

(a) Write a Java program to display the use of String class and its
methods. CO1
5. (b) Write a Java program to practice using String Buffer class and its 3 CO2
methods.

Write a java program that implements a multi-thread application that

has three threads. First thread generates random integer every 1 second CO1
and if the value is even, second thread computes the square of the CO2
6. 3
number and prints. If the value is odd, the third thread will print the CO3
value of cube of the number.

Write a program to implement the concept of Exception Handling by

CO1
7. creating user defined exceptions. 3
CO4
CO1
8. Write a Java Program to demonstrate Mouse events. 3 CO2
CO4
Write a Java program with Servlets to create a dynamic HTML form to
accept and display user name and password with the help of ‘get()’ and CO3
9. 3
‘post()’ methods. CO5

CO3
10. Write a Java Servlet program to demonstrate session tracking. 3
CO5
CO2
Write a JAVA JSP program to implement verification of a particular
11. 3 CO3
user login and display a welcome page.
CO5
CO2
12 Write simple JSP program to display a phrase with increasing font size. 3 CO3
CO5

TEXT BOOKS:

1. The Complete Reference - Java: Herbert Schildt, 7th Edition, McGraw Hill, 2017.
2. Jim Keogh: J2EE - The Complete Reference, Tata McGraw Hill, 2007.
REFERENCE BOOKS:

1. Y. Daniel Liang: Introduction to JAVA Programming, 10th Edition, Pearson Education,

2015.
2. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007.
3. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education, 2004.
Assessment Pattern:

CIE –Continuous Internal Evaluation Lab (50 Marks)

Continual Internal
IA Test Final Marks
Evaluation Marks
Marks (25) (50)
(25)

SEE –Semester End Examination Theory (50 Marks)