ENGINEERING MATHEMATICS-IV

[As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15MAT41 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Formulate, solve and analyze engineering problems.
• Apply numerical methods to solve ordinary differential equations.
• Apply finite difference method to solve partial differential equations.
• Perform complex analysis.
• Interpret use of sampling theory.
• Apply joint probability distribution and stochastic process.
Module 1 Teaching
Hours
Numerical Methods: Numerical solution of ordinary differential equations of first order 10 Hours
and first degree, Picard’s method, Taylor’s series method, modified Euler’s method,
Runge-Kutta method of fourth order. Milne’s and Adams-Bashforth predictor and
corrector methods (No derivations of formulae). Numerical solution of simultaneous first
order ordinary differential equations, Picard’s method, Runge-Kutta method of fourth
order
Module 2
Numerical Methods: Numerical solution of second order ordinary differential equations, 10 Hours
Picard’s method, Runge-Kutta method and Milne’s method. Special Functions: Bessel’s
functions- basic properties, recurrence relations, orthogonality and generating functions.
Legendre’s functions - Legendre’s polynomial, Rodrigue’s formula, problems.
Module 3
Complex Variables: Function of a complex variable, limits, continuity, differentiability,. 10 Hours
Analytic functions-Cauchy-Riemann equations in Cartesian and polar forms. Properties
and construction of analytic functions. Complex line integrals-Cauchy’s theorem and
Cauchy’s integral formula, Residue, poles, Cauchy’s Residue theorem with proof and
problems. Transformations: Conformal transformations, discussion of
transformations: = , = , = + ( / ) and bilinear transformations.
Module 4
Probability Distributions: Random variables (discrete and continuous), probability 10 Hours
functions. Poisson distributions, geometric distribution, uniform distribution, exponential
and normal distributions, Problems. Joint probability distribution: Joint Probability
distribution for two variables, expectation, covariance, correlation coefficient.
Module 5
Sampling Theory: Sampling, Sampling distributions, standard error, test of hypothesis 10 Hours
for means and proportions, confidence limits for means, student’s t-distribution, Chi-
square distribution as a test of goodness of fit. Stochastic process: Stochastic process,
probability vector, stochastic matrices, fixed points, regular stochastic matrices, Markov
chains, higher transition probability.
Course Outcomes: After studying this course, students will be able to:
• Use appropriate numerical methods to solve first and second order ordinary differential
equations.
• Use Bessel's and Legendre's function which often arises when a problem possesses axial and
spherical symmetry, such as in quantum mechanics, electromagnetic theory, hydrodynamics
and heat conduction.
• State and prove Cauchy’s theorem and its consequences including Cauchy's integral formula.
• Compute residues and apply the residue theorem to evaluate integrals.
• Analyze, interpret, and evaluate scientific hypotheses and theories using rigorous statistical
methods.
Graduate Attributes
• Engineering Knowledge
• Problem Analysis
• Life-Long Learning
• Conduct Investigations of Complex Problems
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. B.V.Ramana "Higher Engineering Mathematics" Tata McGraw-Hill, 2006.
2. B. S. Grewal,” Higher Engineering Mathematics”, Khanna publishers, 42nd edition, 2013.
Reference Books:
1. N P Bali and Manish Goyal, "A text book of Engineering mathematics" , Laxmi
publications, latest edition.
2. Kreyszig, "Advanced Engineering Mathematics " - 9th edition, Wiley, 2013.
3. H. K Dass and Er. RajnishVerma, "Higher Engineering Mathematics", S. Chand, 1st ed,
2011.
 SOFTWARE ENGINEERING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CS42 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Outline software engineering principles and activities involved in building large
software programs.
• Identify ethical and professional issues and explain why they are of concern to
software engineers.
• Describe the process of requirements gathering, requirements classification,
requirements specification and requirements validation.
• Differentiate system models, use UML diagrams and apply design patterns.
• Discuss the distinctions between validation testing and defect testing.
• Recognize the importance of software maintenance and describe the intricacies
involved in software evolution.
• Apply estimation techniques, schedule project activities and compute pricing.
• Identify software quality parameters and quantify software using measurements and metrics.
• List software quality standards and outline the practices involved.
• Recognize the need for agile software development, describe agile methods, apply
agile practices and plan for agility.

Module 1 Teaching
Hours
Introduction: Software Crisis, Need for Software Engineering. Professional Software 12 Hours
Development, Software Engineering Ethics. Case Studies.
Software Processes: Models: Waterfall Model (Sec 2.1.1), Incremental Model
(Sec
2.1.2) and Spiral Model (Sec 2.1.3). Process activities.
Requirements Engineering:
Requirements Engineering Processes (Chap 4).
Requirements Elicitation and Analysis (Sec 4.5). Functional and non-functional
requirements (Sec 4.1). The software Requirements Document (Sec 4.2). Requirements
Specification (Sec 4.3). Requirements validation (Sec 4.6). Requirements Management
(Sec 4.7).
Module 2
System Models: Context models (Sec 5.1). Interaction models (Sec 5.2). Structural 11 Hours
models (Sec 5.3). Behavioral models (Sec 5.4). Model-driven engineering (Sec 5.5).
Design and Implementation: Introduction to RUP (Sec 2.4), Design Principles (Chap
17). Object-Oriented design using the UML (Sec 7.1). Design patterns (Sec 7.2).
Implementation issues (Sec 7.3). Open source development (Sec 7.4).
Module 3
Software Testing: Development testing (Sec 8.1), Test-driven development (Sec 8.2), 9 Hours
Release testing (Sec 8.3), User testing (Sec 8.4). Test Automation (Page no 42, 70,212,
231,444,695).
Software Evolution: Evolution processes (Sec 9.1). Program evolution dynamics (Sec
9.2). Software maintenance (Sec 9.3). Legacy system management (Sec 9.4).
 Module 4
Project Planning: Software pricing (Sec 23.1). Plan-driven development (Sec 23.2). 10 Hours
Project scheduling (Sec 23.3): Estimation techniques (Sec 23.5). Quality management:
Software quality (Sec 24.1). Reviews and inspections (Sec 24.3). Software measurement
and metrics (Sec 24.4). Software standards (Sec 24.2)
Module 5
Agile Software Development: Coping with Change (Sec 2.3), The Agile Manifesto: 8 Hours
Values and Principles. Agile methods: SCRUM (Ref “The SCRUM Primer, Ver 2.0”)
and Extreme Programming (Sec 3.3). Plan-driven and agile development (Sec 3.2). Agile
project management (Sec 3.4), Scaling agile methods (Sec 3.5):
Course Outcomes: After studying this course, students will be able to:
• Design a software system, component, or process to meet desired needs within realistic
constraints.
• Assess professional and ethical responsibility
• Function on multi-disciplinary teams
• Use the techniques, skills, and modern engineering tools necessary for engineering practice
• Analyze, design, implement, verify, validate, implement, apply, and maintain software
systems or parts of software systems.
Graduate Attributes
• Project Management and Finance
• Conduct Investigations of Complex Problems
• Modern Tool Usage
• Ethics
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Ian Sommerville: Software Engineering, 9th Edition, Pearson Education, 2012.
(Listed topics only from Chapters 1,2,3,4, 5, 7, 8, 9, 23, and 24)
2. The SCRUM Primer, Ver 2.0, http://www.goodagile.com/scrumprimer/scrumprimer20.pdf
Reference Books:
1. Roger S. Pressman: Software Engineering-A Practitioners approach, 7th Edition, Tata
McGraw Hill.
2. Pankaj Jalote: An Integrated Approach to Software Engineering, Wiley India
Web Reference for eBooks on Agile:
1. http://agilemanifesto.org/
2. http://www.jamesshore.com/Agile-Book/
 DESIGN AND ANALYSIS OF ALGORITHMS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CS43 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Explain various computational problem solving techniques.
• Apply appropriate method to solve a given problem.
• Describe various methods of algorithm analysis.
Module 1 Teaching
Hours
Introduction: What is an Algorithm? (T2:1.1), Algorithm Specification (T2:1.2), 10 Hours
Analysis Framework (T1:2.1), Performance Analysis: Space complexity, Time
complexity (T2:1.3). Asymptotic Notations: Big-Oh notation (O), Omega notation (Ω),
Theta notation (Θ), and Little-oh notation (o), Mathematical analysis of Non-Recursive
and recursive Algorithms with Examples (T1:2.2, 2.3, 2.4). Important Problem Types:
Sorting, Searching, String processing, Graph Problems, Combinatorial Problems.
Fundamental Data Structures: Stacks, Queues, Graphs, Trees, Sets and Dictionaries.
(T1:1.3,1.4)
Module 2
Divide and Conquer: General method, Binary search, Recurrence equation for divide 10 Hours
and conquer, Finding the maximum and minimum (T2:3.1, 3.3, 3.4), Merge sort, Quick
sort (T1:4.1, 4.2), Strassen’s matrix multiplication (T2:3.8), Advantages and
Disadvantages of divide and conquer. Decrease and Conquer Approach: Topological
Sort. (T1:5.3)
Module 3
Greedy Method: General method, Coin Change Problem, Knapsack Problem, Job 10 Hours
sequencing with deadlines (T2:4.1, 4.3, 4.5). Minimum cost spanning trees: Prim’s
Algorithm, Kruskal’s Algorithm (T1:9.1, 9.2). Single source shortest paths: Dijkstra's
Algorithm (T1:9.3). Optimal Tree problem: Huffman Trees and Codes (T1:9.4).
Transform and Conquer Approach: Heaps and Heap Sort (T1:6.4).
Module 4
Dynamic Programming: General method with Examples, Multistage Graphs (T2:5.1, 10 Hours
5.2). Transitive Closure: Warshall’s Algorithm, All Pairs Shortest Paths: Floyd's
Algorithm, Optimal Binary Search Trees, Knapsack problem ((T1:8.2, 8.3, 8.4),
Bellman-Ford Algorithm (T2:5.4), Travelling Sales Person problem (T2:5.9), Reliability
design (T2:5.8).
Module 5
Backtracking: General method (T2:7.1), N-Queens problem (T1:12.1), Sum of subsets 10 Hours
problem (T1:12.1), Graph coloring (T2:7.4), Hamiltonian cycles (T2:7.5). Branch and
Bound: Assignment Problem, Travelling Sales Person problem (T1:12.2), 0/1
Knapsack problem (T2:8.2, T1:12.2): LC Branch and Bound solution (T2:8.2), FIFO
Branch and Bound solution (T2:8.2). NP-Complete and NP-Hard problems: Basic
 concepts, non-deterministic algorithms, P, NP, NP-Complete, and NP-Hard classes
(T2:11.1).
Course Outcomes: After studying this course, students will be able to
• Describe computational solution to well known problems like searching, sorting etc.
• Estimate the computational complexity of different algorithms.
• Devise an algorithm using appropriate design strategies for problem solving.
Graduate Attributes
• Engineering Knowledge
• Problem Analysis
• Design/Development of Solutions
• Conduct Investigations of Complex Problems
• Life-Long Learning
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
T1. Introduction to the Design and Analysis of Algorithms, Anany Levitin:, 2rd Edition, 2009.
Pearson.
T2. Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd Edition, 2014,
Universities Press
Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 3rd Edition, PHI
2. Design and Analysis of Algorithms , S. Sridhar, Oxford (Higher Education)
 MICROPROCESSORS AND MICROCONTROLLERS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CS44 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Make familiar with importance and applications of microprocessors and microcontrollers
• Expose architecture of 8086 microprocessor and ARM processor
• Familiarize instruction set of ARM processor
Module 1 Teaching
Hours
The x86 microprocessor: Brief history of the x86 family, Inside the 8088/86, 10 Hours
Introduction to assembly programming, Introduction to Program Segments, The Stack,
Flag register, x86 Addressing Modes. Assembly language programming: Directives &
a Sample Program, Assemble, Link & Run a program, More Sample programs, Control
Transfer Instructions, Data Types and Data Definition, Full Segment Definition,
Flowcharts and Pseudo code.
Text book 1: Ch 1: 1.1 to 1.7, Ch 2: 2.1 to 2.7
Module 2
x86: Instructions sets description, Arithmetic and logic instructions and programs: 10 Hours
Unsigned Addition and Subtraction, Unsigned Multiplication and Division, Logic
Instructions, BCD and ASCII conversion, Rotate Instructions. INT 21H and INT 10H
Programming : Bios INT 10H Programming , DOS Interrupt 21H. 8088/86 Interrupts,
x86 PC and Interrupt Assignment.
Text book 1: Ch 3: 3.1 to 3.5, Ch 4: 4.1 , 4.2 Chapter 14: 14.1 and 14.2
Module 3
Signed Numbers and Strings: Signed number Arithmetic Operations, String operations. 10 Hours
Memory and Memory interfacing: Memory address decoding, data integrity in RAM
and ROM, 16-bit memory interfacing. 8255 I/O programming: I/O addresses MAP of
x86 PC’s, programming and interfacing the 8255.
Text book 1: Ch 6: 6.1, 6.2. Ch 10: 10.2, 10.4, 10.5. Ch 11: 11.1 to 11.4
Module 4
Microprocessors versus Microcontrollers, ARM Embedded Systems :The RISC design 10 Hours
philosophy, The ARM Design Philosophy, Embedded System Hardware, Embedded
System Software, ARM Processor Fundamentals : Registers , Current Program Status
Register , Pipeline, Exceptions, Interrupts, and the Vector Table , Core Extensions
Text book 2:Ch 1:1.1 to 1.4, Ch 2:2.1 to 2.5
Module 5
Introduction to the ARM Instruction Set : Data Processing Instructions , Branch 10 Hours
Instructions, Software Interrupt Instructions, Program Status Register Instructions,
Coprocessor Instructions, Loading Constants, Simple programming exercises.
Text book 2: Ch 3:3.1 to 3.6 ( Excluding 3.5.2)
Course Outcomes: After studying this course, students will be able to
 • Differentiate between microprocessors and microcontrollers
• Design and develop assembly language code to solve problems
• Gain the knowledge for interfacing various devices to x86 family and ARM processor
• Demonstrate design of interrupt routines for interfacing devices
Graduate Attributes
• Engineering Knowledge
• Problem Analysis
• Design/Development of Solutions
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Danny Causey, The x86 PC Assembly
Language Design and Interfacing, 5th Edition, Pearson, 2013.
2. ARM system developers guide, Andrew N Sloss, Dominic Symes and Chris Wright,
Elsevier,Morgan Kaufman publishers, 2008.
Reference Books:
1. Douglas V. Hall: Microprocessors and Interfacing, Revised 2nd Edition, TMH, 2006.
2. K. Udaya Kumar & B.S. Umashankar : Advanced Microprocessors & IBM-PC Assembly
Language Programming, TMH 2003.
3. Ayala : The 8086 Microprocessor: programming and interfacing - 1st edition, Cengage
Learning
4. The Definitive Guide to the ARM Cortex-M3, by Joseph Yiu, 2nd Edition , Newnes, 2009
5. The Insider’s Guide to the ARM7 based microcontrollers, Hitex Ltd.,1st edition, 2005
6. ARM System-on-Chip Architecture, Steve Furber, Second Edition, Pearson, 2015
7. Architecture, Programming and Interfacing of Low power Processors- ARM7, Cortex-M and
MSP430, Lyla B Das Cengage Learning, 1st Edition
 OBJECT ORIENTED CONCEPTS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CS45 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Learn fundamental features of object oriented language and JAVA
• Set up Java JDK environment to create, debug and run simple Java programs.
• Create multi-threaded programs and event handling mechanisms.
• Introduce event driven Graphical User Interface (GUI) programming using applets and
swings.
Module 1 Teaching
Hours
Introduction to Object Oriented Concepts: 10 Hours
A Review of structures, Procedure–Oriented Programming system, Object Oriented
Programming System, Comparison of Object Oriented Language with C, Console I/O,
variables and reference variables, Function Prototyping, Function Overloading. Class
and Objects: Introduction, member functions and data, objects and functions, objects and
arrays, Namespaces, Nested classes, Constructors, Destructors.
Text book 1: Ch 1: 1.1 to 1.9 Ch 2: 2.1 to 2.6 Ch 4: 4.1 to 4.2
Module 2
Introduction to Java: Java’s magic: the Byte code; Java Development Kit (JDK); the 10 Hours
Java Buzzwords, Object-oriented programming; Simple Java programs. Data types,
variables and arrays, Operators, Control Statements.
Text book 2: Ch:1 Ch: 2 Ch:3 Ch:4 Ch:5
Module 3
Classes, Inheritance, Exceptions, Packages and Interfaces: Classes: Classes 10 Hours
fundamentals; Declaring objects; Constructors, this keyword, garbage collection.
Inheritance: inheritance basics, using super, creating multi level hierarchy, method
overriding. Exception handling: Exception handling in Java. Packages, Access
Protection, Importing Packages, Interfaces.
Text book 2: Ch:6 Ch: 8 Ch:9 Ch:10
Module 4
Multi Threaded Programming, Event Handling: Multi Threaded Programming: What 10 Hours
are threads? How to make the classes threadable ; Extending threads; Implementing
runnable; Synchronization; Changing state of the thread; Bounded buffer problems, read-
write problem, producer consumer problems. Event Handling: Two event handling
mechanisms; The delegation event model; Event classes; Sources of events; Event
listener interfaces; Using the delegation event model; Adapter classes; Inner classes.
Text book 2: Ch 11: Ch: 22
Module 5
The Applet Class: Introduction, Two types of Applets; Applet basics; Applet 10 Hours
Architecture; An Applet skeleton; Simple Applet display methods; Requesting repainting;
 Using the Status Window; The HTML APPLET tag; Passing parameters to Applets;
getDocumentbase() and getCodebase(); ApletContext and showDocument(); The
AudioClip Interface; The AppletStub Interface;Output to the Console. Swings: Swings:
The origins of Swing; Two key Swing features; Components and Containers; The Swing
Packages; A simple Swing Application; Create a Swing Applet; Jlabel and ImageIcon;
JTextField;The Swing Buttons; JTabbedpane; JScrollPane; JList; JComboBox; JTable.
Text book 2: Ch 21: Ch: 29 Ch: 30
Course Outcomes: After studying this course, students will be able to
• Explain the object-oriented concepts and JAVA.
• Develop computer programs to solve real world problems in Java.
• Develop simple GUI interfaces for a computer program to interact with users, and to
understand the event-based GUI handling principles using Applets and swings.
Graduate Attributes
• Programming Knowledge
• Design/Development of Solutions
• Conduct Investigations of Complex Problems
• Life-Long Learning
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Sourav Sahay, Object Oriented Programming with C++ , 2nd Ed, Oxford University
Press,2006
(Chapters 1, 2, 4)
2. Herbert Schildt, Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007.
(Chapters 1, 2, 3, 4, 5, 6, 8, 9,10, 11, 21, 22, 29, 30)
Reference Book:
1. Mahesh Bhave and Sunil Patekar, "Programming with Java", First Edition, Pearson
Education,2008, ISBN:9788131720806
2. Herbert Schildt, The Complete Reference C++, 4th Edition, Tata McGraw Hill, 2003.
3. Stanley B.Lippmann, Josee Lajore, C++ Primer, 4th Edition, Pearson Education, 2005.
4. Rajkumar Buyya,S Thamarasi selvi, xingchen chu, Object oriented Programming with java,
Tata McGraw Hill education private limited.
5. Richard A Johnson, Introduction to Java Programming and OOAD, CENGAGE Learning.
6. E Balagurusamy, Programming with Java A primer, Tata McGraw Hill companies.

Note: Every institute shall organize a bridge organize on C++ either in the vacation or in the
beginning of even semester.
 DATA COMMUNICATION
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CS46 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Comprehend the transmission technique of digital data between two or more computers and a
computer network that allows computers to exchange data.
• Explain with the basics of data communication and various types of computer networks;
• Illustrate TCP/IP protocol suite and switching criteria.
• Demonstrate Medium Access Control protocols for reliable and noisy channels.
• Expose wireless and wired LANs along with IP version.
Contents Teaching
Hours
Module 1
Introduction: Data Communications, Networks, Network Types, Internet History, 10 Hours
Standards and Administration, Networks Models: Protocol Layering, TCP/IP Protocol
suite, The OSI model, Introduction to Physical Layer-1: Data and Signals, Digital
Signals, Transmission Impairment, Data Rate limits, Performance, Digital Transmission:
Digital to digital conversion (Only Line coding: Polar, Bipolar and Manchester coding).
Module 2
Physical Layer-2: Analog to digital conversion (only PCM), Transmission Modes, 10 Hours
Analog Transmission: Digital to analog conversion, Bandwidth Utilization:
Multiplexing and Spread Spectrum, Switching: Introduction, Circuit Switched Networks
and Packet switching.
Module 3
Error Detection and Correction: Introduction, Block coding, Cyclic codes, Checksum, 10 Hours
Forward error correction, Data link control: DLC services, Data link layer protocols,
HDLC, and Point to Point protocol (Framing, Transition phases only).
Module 4
Media Access control: Random Access, Controlled Access and Channelization, 10 Hours
Wired LANs Ethernet: Ethernet Protocol, Standard Ethernet, Fast Ethernet, Gigabit
Ethernet and 10 Gigabit Ethernet, Wireless LANs: Introduction, IEEE 802.11 Project
and Bluetooth.
Module 5
Other wireless Networks: WIMAX, Cellular Telephony, Satellite networks, Network 10 Hours
layer Protocols : Internet Protocol, ICMPv4,Mobile IP, Next generation IP: IPv6
addressing, The IPv6 Protocol, The ICMPv6 Protocol and Transition from IPv4 to IPv6.
Course Outcomes: After studying this course, students will be able to
• Illustrate basic computer network technology.
• Identify the different types of network topologies and protocols.
• Enumerate the layers of the OSI model and TCP/IP functions of each layer.
• Make out the different types of network devices and their functions within a network
 • Demonstrate the skills of subnetting and routing mechanisms.

Graduate Attributes
1. Engineering Knowledge
2. Design Development of solution(Partly)
3. Modern Tool Usage
4. Problem Analysis
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Book:
Behrouz A. Forouzan, Data Communications and Networking 5E, 5th Edition, Tata McGraw-Hill,
2013. (Chapters 1.1 to 1.5, 2.1 to 2.3, 3.1, 3.3 to 3.6, 4.1 to 4.3, 5.1, 6.1, 6.2, 8.1 to 8.3, 10.1 to 10.5,
11.1 to 11.4, 12.1 to 12.3, 13.1 to 13.5, 15.1 to 15.3, 16.1 to 16.3, 19.1 to 19.3, 22.1 to 22.4)
Reference Books:
1. Alberto Leon-Garcia and Indra Widjaja: Communication Networks - Fundamental Concepts
and Key architectures, 2nd Edition Tata McGraw-Hill, 2004.
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. Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007
 DESIGN AND ANALYSIS OF ALGORITHM LABORATORY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CSL47 IA Marks 20
Number of Lecture Hours/Week 01 I + 02 P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
• Design and implement various algorithms in JAVA
• Employ various design strategies for problem solving.
• Measure and compare the performance of different algorithms.
Description
Design, develop, and implement the specified algorithms for the following problems using Java
language under LINUX /Windows environment.Netbeans/Eclipse IDE tool can be used for
development and demonstration.
Experiments
1 Create a Java class called Studentwith the following details as variables within it.
A (i) USN
(ii) Name
(iii) Branch
(iv) Phone
Write a Java program to create nStudent objects and print the USN, Name, Branch, and
Phoneof these objects with suitable headings.

B Write a Java program to implement the Stack using arrays. Write Push(), Pop(), and
Display() methods to demonstrate its working.

2 A Design a superclass called Staff with details as StaffId, Name, Phone, Salary. Extend
this class by writing three subclasses namely Teaching (domain, publications),
Technical (skills), and Contract (period). Write a Java program to read and display at
least 3 staff objects of all three categories.

B Write a Java class called Customer to store their name and date_of_birth. The
date_of_birth format should be dd/mm/yyyy. Write methods to read customer data as
<name, dd/mm/yyyy> and display as <name, dd, mm, yyyy> using StringTokenizer
class considering the delimiter character as “/”.

3 A Write a Java program to read two integers a andb. Compute a/b and print, when b is not
zero. Raise an exception when b is equal to zero.

B Write a Java program that implements a multi-thread application that has three threads.
First thread generates a random integer for every 1 second; second thread computes the
square of the number andprints; third thread will print the value of cube of the number.

4 Sort a given set of n integer elements using Quick Sort method and compute its time
complexity. Run the program for varied values of n> 5000 and record the time taken to sort.
Plot a graph of the time taken versus non graph sheet. The elements can be read from a file or
can be generated using the random number generator. Demonstrate using Java how the divide-
and-conquer method works along with its time complexity analysis: worst case, average case
and best case.
 5 Sort a given set of n integer elements using Merge Sort method and compute its time
complexity. Run the program for varied values of n> 5000, and record the time taken to sort.
Plot a graph of the time taken versus non graph sheet. The elements can be read from a file or
can be generated using the random number generator. Demonstrate using Java how the divide-
and-conquer method works along with its time complexity analysis: worst case, average case
and best case.

6 Implement in Java, the 0/1 Knapsack problem using (a) Dynamic Programming method (b)
Greedy method.

7 From a given vertex in a weighted connected graph, find shortest paths to other vertices using
Dijkstra's algorithm. Write the program in Java.

8 Find Minimum Cost Spanning Tree of a given connected undirected graph using
Kruskal'salgorithm. Use Union-Find algorithms in your program.

9 Find Minimum Cost Spanning Tree of a given connected undirected graph using
Prim's algorithm.

10 Write Java programs to

(a) Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
(b) Implement Travelling Sales Person problem using Dynamic programming.

11 Design and implement in Java to find a subset of a given set S = {Sl, S 2,.....,Sn} of n positive
integers whose SUM is equal to a given positive integer d. For example, if S ={1, 2, 5, 6, 8}
and d= 9, there are two solutions {1,2,6}and {1,8}. Display a suitable message, if the given
problem instance doesn't have a solution.

12 Design and implement in Java to find all Hamiltonian Cycles in a connected undirected
Graph G of n vertices using backtracking principle.

Course Outcomes: The students should be able to:

• Design algorithms using appropriate design techniques (brute-force, greedy, dynamic
programming, etc.)
• Implement a variety of algorithms such assorting, graph related, combinatorial, etc., in a high
level language.
• Analyze and compare the performance of algorithms using language features.
• Apply and implement learned algorithm design techniques and data structuresto solve real-
world problems.
Graduate Attributes
• Engineering Knowledge
• Problem Analysis
• Modern Tool Usage
• Conduct Investigations of Complex Problems
• Design/Development of Solutions
Conduction of Practical Examination:
All laboratory experiments (Twelve problems) are to be included for practical
examination. Students are allowed to pick one experiment from the lot.
To generate the data set use random number generator function.
Strictly follow the instructions as printed on the cover page of answer script for breakup
of marks
Marks distribution: Procedure + Conduction + Viva: 20 + 50 + 10 (80). Change of
experiment is allowed only once and marks allotted to the procedure
 MICROPROCESSOR AND MICROCONTROLLER LABORATORY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – IV
Subject Code 15CSL48 IA Marks 20
Number of Lecture Hours/Week 01 I + 02 P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
• To provide practical exposure to the students on microprocessors, design and coding
knowledge on 80x86 family/ARM. To give the knowledge and practical exposure on
connectivity and execute of interfacing devices with 8086/ARM kit like LED displays,
Keyboards, DAC/ADC, and various other devices.

Description
Demonstration and Explanation hardware components and Faculty in-charge should explain 8086
architecture, pin diagram in one slot. The second slot, the Faculty in-charge should explain instruction
set types/category etc. Students have to prepare a write-up on the same and include it in the Lab
record and to be evaluated.

Laboratory Session-1: Write-up on Microprocessors, 8086 Functional block diagram, Pin diagram and
description. The same information is also taught in theory class; this helps the students to understand
better.

Laboratory Session-2: Write-up on Instruction group, Timing diagrams, etc. The same information is
also taught in theory class; this helps the students to understand better.

Note: These TWO Laboratory sessions are used to fill the gap between theory classes and practical
sessions. Both sessions are evaluated as lab experiments for 20 marks.
Experiments
• Develop and execute the following programs using 8086 Assembly Language. Any suitable
assembler like MASM/TASM/8086 kit or any equivalent software may be used.
• Program should have suitable comments.
• The board layout and the circuit diagram of the interface are to be provided to the student
during the examination.
• Software Required: Open source ARM Development platform, KEIL IDE and Proteus for
simulation
SOFTWARE PROGRAMS: PART A
1. Design and develop an assembly language program to search a key element “X” in a list of ‘n’
16-bit numbers. Adopt Binary search algorithm in your program for searching.
2. Design and develop an assembly program to sort a given set of ‘n’ 16-bit numbers in
ascending order. Adopt Bubble Sort algorithm to sort given elements.
3. Develop an assembly language program to reverse a given string and verify whether it is a
palindrome or not. Display the appropriate message.
4. Develop an assembly language program to compute nCr using recursive procedure. Assume
that ‘n’ and ‘r’ are non-negative integers.
 5. Design and develop an assembly language program to read the current time and Date from the
system and display it in the standard format on the screen.
6. To write and simulate ARM assembly language programs for data transfer, arithmetic and
logical operations (Demonstrate with the help of a suitable program).
7. To write and simulate C Programs for ARM microprocessor using KEIL (Demonstrate with
the help of a suitable program)
Note : To use KEIL one may refer the book: Insider’s Guide to the ARM7 based
microcontrollers, Hitex Ltd.,1st edition, 2005
HARDWARE PROGRAMS: PART B
8. a. Design and develop an assembly program to demonstrate BCD Up-Down Counter (00-99)
on the Logic Controller Interface.
b. Design and develop an assembly program to read the status of two 8-bit inputs (X & Y)
from the Logic Controller Interface and display X*Y.
9. Design and develop an assembly program to display messages “FIRE” and “HELP”
alternately with flickering effects on a 7-segment display interface for a suitable period of
time. Ensure a flashing rate that makes it easy to read both the messages (Examiner does not
specify these delay values nor is it necessary for the student to compute these values).
10. Design and develop an assembly program to drive a Stepper Motor interface and rotate the
motor in specified direction (clockwise or counter-clockwise) by N steps (Direction and N
are specified by the examiner). Introduce suitable delay between successive steps. (Any
arbitrary value for the delay may be assumed by the student).
11. Design and develop an assembly language program to
a. Generate the Sine Wave using DAC interface (The output of the DAC is to be
displayed on the CRO).
b. Generate a Half Rectified Sine waveform using the DAC interface. (The output of
the DAC is to be displayed on the CRO).
12. To interface LCD with ARM processor-- ARM7TDMI/LPC2148. Write and execute
programs in C language for displaying text messages and numbers on LCD
13. To interface Stepper motor with ARM processor-- ARM7TDMI/LPC2148. Write a program
to rotate stepper motor

Study Experiments:
1. Interfacing of temperature sensor with ARM freedom board (or any other ARM
microprocessor board) and display temperature on LCD
2. To design ARM cortex based automatic number plate recognition system
3. To design ARM based power saving system
Course Outcomes: After studying this course, students will be able to
• Learn 80x86 instruction sets and gins the knowledge of how assembly language works.
• Design and implement programs written in 80x86 assembly language
• Know functioning of hardware devices and interfacing them to x86 family
• Choose processors for various kinds of applications.
Graduate Attributes
• Engineering Knowledge
• Problem Analysis
• Modern Tool Usage
• Conduct Investigations of Complex Problems
• Design/Development of Solutions
Conduction of Practical Examination:
• All laboratory experiments (all 7 + 6 nos) are to be included for practical examination.
• Students are allowed to pick one experiment from each of the lot.
• Strictly follow the instructions as printed on the cover page of answer script for breakup of
marks
• PART –A: Procedure + Conduction + Viva: 10 + 25 +05 (40)
• PART –B: Procedure + Conduction + Viva: 10 + 25 +05 (40)
• Change of experiment is allowed only once and marks allotted to the procedure part to be
made zero.
 MANAGEMENT AND ENTREPRENEURSHIP FOR IT INDUSTRY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS51 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Explain the principles of management, organization and entrepreneur.
• Discuss on planning, staffing, ERP and their importance
• Infer the importance of intellectual property rights and relate the institutional support
Module – 1 Teaching
Hours
Introduction – Meaning, nature and characteristics of management, scope and 10 Hours
functional areas of management, goals of management, levels of management,
brief overview of evolution of management. Planning- Nature, importance, types
of plans, steps in planning, Organizing- nature and purpose, types of
organization.
Module – 2
Staffing- meaning, process of recruitment and selection. Directing and 10 Hours
controlling- meaning and nature of directing, leadership styles, motivation
theories. Controlling- meaning, steps in controlling, methods of establishing
control, Communication- Meaning and importance, Coordination- meaning and
importance
Module – 3
Entrepreneur – meaning of entrepreneur, types of entrepreneurship, stages of 10 Hours
entrepreneurial process, role of entrepreneurs in economic development,
entrepreneurship in India, barriers to entrepreneurship. Identification of business
opportunities- market feasibility study, technical feasibility study, financial
feasibility study and social feasibility study.
Module – 4
Preparation of project and ERP - meaning of project, project identification, 10 Hours
project selection, project report, need and significance of report, contents,
formulation, guidelines by planning commission for project report Enterprise
Resource Planning: Meaning and Importance- ERP and Functional areas of
Management – Marketing / Sales- Supply Chain Management – Finance and
Accounting – Human Resources – Types of reports and methods of report
generation
Module – 5
Micro and Small Enterprises: Definition of micro and small enterprises, 10 Hours
characteristics and advantages of micro and small enterprises, steps in establishing
micro and small enterprises, Government of India indusial policy 2007 on micro and
small enterprises, case study (Microsoft), Case study(Captain G R Gopinath),case
study (N R Narayana Murthy & Infosys), Institutional support: MSME-DI, NSIC,
SIDBI, KIADB, KSSIDC, TECSOK, KSFC, DIC and District level single window
agency, Introduction to IPR.
Course outcomes: The students should be able to:
• Define management, organization, entrepreneur, planning, staffing, ERP and outline
 their importance in entrepreneurship
• Utilize the resources available effectively through ERP
• Make us of IPRs and institutional support in entrepreneurship
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Principles of Management -P. C. Tripathi, P. N. Reddy; Tata McGraw Hill, 4th / 6th
Edition, 2010.
2. Dynamics of Entrepreneurial Development & Management -Vasant Desai Himalaya
Publishing House.
3. Entrepreneurship Development -Small Business Enterprises -Poornima M
Charantimath Pearson Education – 2006.
4. Management and Enterpreneurship- Kanishka Bedi- Oxford University Press-2017
Reference Books:
1. Management Fundamentals -Concepts, Application, Skill Development Robert Lusier
– Thomson.
2. Entrepreneurship Development -S S Khanka -S Chand & Co.
3. Management -Stephen Robbins -Pearson Education /PHI -17th Edition, 2003
 COMPUTER NETWORKS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS52 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Demonstration of application layer protocols
• Discuss transport layer services and understand UDP and TCP protocols
• Explain routers, IP and Routing Algorithms in network layer
• Disseminate the Wireless and Mobile Networks covering IEEE 802.11 Standard
• Illustrate concepts of Multimedia Networking, Security and Network Management
Module – 1 Teaching
Hours
Application Layer: Principles of Network Applications: Network Application 10 Hours
Architectures, Processes Communicating, Transport Services Available to
Applications, Transport Services Provided by the Internet, Application-Layer
Protocols. The Web and HTTP: Overview of HTTP, Non-persistent and
Persistent Connections, HTTP Message Format, User-Server Interaction:
Cookies, Web Caching, The Conditional GET, File Transfer: FTP Commands &
Replies, Electronic Mail in the Internet: SMTP, Comparison with HTTP, Mail
Message Format, Mail Access Protocols, DNS; The Internet's Directory Service:
Services Provided by DNS, Overview of How DNS Works, DNS Records and
Messages, Peer-to-Peer Applications: P2P File Distribution, Distributed Hash
Tables, Socket Programming: creating Network Applications: Socket
Programming with UDP, Socket Programming with TCP.
T1: Chap 2
Module – 2
Transport Layer : Introduction and Transport-Layer Services: Relationship 10 Hours
Between Transport and Network Layers, Overview of the Transport Layer in the
Internet, Multiplexing and Demultiplexing: Connectionless Transport: UDP,UDP
Segment Structure, UDP Checksum, Principles of Reliable Data Transfer:
Building a Reliable Data Transfer Protocol, Pipelined Reliable Data Transfer
Protocols, Go-Back-N, Selective repeat, Connection-Oriented Transport TCP:
The TCP Connection, TCP Segment Structure, Round-Trip Time Estimation and
Timeout, Reliable Data Transfer, Flow Control, TCP Connection Management,
Principles of Congestion Control: The Causes and the Costs of Congestion,
Approaches to Congestion Control, Network-assisted congestion-control
example, ATM ABR Congestion control, TCP Congestion Control: Fairness.
T1: Chap 3
Module – 3
The Network layer: What's Inside a Router?: Input Processing, Switching, 10 Hours
Output Processing, Where Does Queuing Occur? Routing control plane, IPv6,A
Brief foray into IP Security, Routing Algorithms: The Link-State (LS) Routing
Algorithm, The Distance-Vector (DV) Routing Algorithm, Hierarchical Routing,
Routing in the Internet, Intra-AS Routing in the Internet: RIP, Intra-AS Routing
in the Internet: OSPF, Inter/AS Routing: BGP, Broadcast and Multicast Routing:
Broadcast Routing Algorithms and Multicast.
T1: Chap 4:4.3-4.7
Module – 4
Wireless and Mobile Networks: Cellular Internet Access: An Overview of 10 Hours
Cellular Network Architecture, 3G Cellular Data Networks: Extending the
Internet to Cellular subscribers, On to 4G:LTE,Mobility management: Principles,
Addressing, Routing to a mobile node, Mobile IP, Managing mobility in cellular
Networks, Routing calls to a Mobile user, Handoffs in GSM, Wireless and
Mobility: Impact on Higher-layer protocols.
T1: Chap: 6 : 6.4-6.8
Module – 5
Multimedia Networking: Properties of video, properties of Audio, Types of 10 Hours
multimedia Network Applications, Streaming stored video: UDP Streaming,
HTTP Streaming, Adaptive streaming and DASH, content distribution Networks,
case studies: Netflix, You Tube and Kankan.
Network Support for Multimedia: Dimensioning Best-Effort Networks,
Providing Multiple Classes of Service, Diffserv, Per-Connection Quality-of-
Service (QoS) Guarantees: Resource Reservation and Call Admission
T1: Chap: 7: 7.1,7.2,7.5
Course outcomes: The students should be able to:
• Explain principles of application layer protocols
• Recognize transport layer services and infer UDP and TCP protocols
• Classify routers, IP and Routing Algorithms in network layer
• Understand the Wireless and Mobile Networks covering IEEE 802.11 Standard
• Describe Multimedia Networking and Network Management
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. James F Kurose and Keith W Ross, Computer Networking, A Top-Down Approach,
Sixth edition, Pearson,2017 .
Reference Books:
1. Behrouz A Forouzan, Data and Communications and Networking, Fifth Edition,
McGraw Hill, Indian Edition
2. Larry L Peterson and Brusce S Davie, Computer Networks, fifth edition, ELSEVIER
3. Andrew S Tanenbaum, Computer Networks, fifth edition, Pearson
4. Mayank Dave, Computer Networks, Second edition, Cengage Learning
 DATABASE MANAGEMENT SYSTEM
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS53 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Provide a strong foundation in database concepts, technology, and practice.
• Practice SQL programming through a variety of database problems.
• Demonstrate the use of concurrency and transactions in database
• Design and build database applications for real world problems.
Module – 1 Teaching
Hours
Introduction to Databases: Introduction, Characteristics of database approach, 10 Hours
Advantages of using the DBMS approach, History of database applications.
Overview of Database Languages and Architectures: Data Models, Schemas,
and Instances. Three schema architecture and data independence, database
languages, and interfaces, The Database System environment. Conceptual Data
Modelling using Entities and Relationships: Entity types, Entity sets,
attributes, roles, and structural constraints, Weak entity types, ER diagrams,
examples, Specialization and Generalization.
Textbook 1:Ch 1.1 to 1.8, 2.1 to 2.6, 3.1 to 3.10
Module – 2
Relational Model: Relational Model Concepts, Relational Model Constraints 10 Hours
and relational database schemas, Update operations, transactions, and dealing
with constraint violations. Relational Algebra: Unary and Binary relational
operations, additional relational operations (aggregate, grouping, etc.) Examples
of Queries in relational algebra. Mapping Conceptual Design into a Logical
Design: Relational Database Design using ER-to-Relational mapping. SQL:
SQL data definition and data types, specifying constraints in SQL, retrieval
queries in SQL, INSERT, DELETE, and UPDATE statements in SQL,
Additional features of SQL.
Textbook 1: Ch4.1 to 4.5, 5.1 to 5.3, 6.1 to 6.5, 8.1; Textbook 2: 3.5
Module – 3
SQL : Advances Queries: More complex SQL retrieval queries, Specifying 10 Hours
constraints as assertions and action triggers, Views in SQL, Schema change
statements in SQL. Database Application Development: Accessing databases
from applications, An introduction to JDBC, JDBC classes and interfaces, SQLJ,
Stored procedures, Case study: The internet Bookshop. Internet Applications:
The three-Tier application architecture, The presentation layer, The Middle Tier
Textbook 1: Ch7.1 to 7.4; Textbook 2: 6.1 to 6.6, 7.5 to 7.7.
Module – 4
Normalization: Database Design Theory – Introduction to Normalization using 10 Hours
Functional and Multivalued Dependencies: Informal design guidelines for
relation schema, Functional Dependencies, Normal Forms based on Primary
Keys, Second and Third Normal Forms, Boyce-Codd Normal Form, Multivalued
Dependency and Fourth Normal Form, Join Dependencies and Fifth Normal
Form. Normalization Algorithms: Inference Rules, Equivalence, and Minimal
Cover, Properties of Relational Decompositions, Algorithms for Relational
Database Schema Design, Nulls, Dangling tuples, and alternate Relational
Designs, Further discussion of Multivalued dependencies and 4NF, Other
dependencies and Normal Forms
Textbook 1: Ch14.1 to 14.7, 15.1 to 15.6
Module – 5
Transaction Processing: Introduction to Transaction Processing, Transaction 10 Hours
and System concepts, Desirable properties of Transactions, Characterizing
schedules based on recoverability, Characterizing schedules based on
Serializability, Transaction support in SQL. Concurrency Control in
Databases: Two-phase locking techniques for Concurrency control, Concurrency
control based on Timestamp ordering, Multiversion Concurrency control
techniques, Validation Concurrency control techniques, Granularity of Data
items and Multiple Granularity Locking. Introduction to Database Recovery
Protocols: Recovery Concepts, NO-UNDO/REDO recovery based on Deferred
update, Recovery techniques based on immediate update, Shadow paging,
Database backup and recovery from catastrophic failures
Textbook 1: 20.1 to 20.6, 21.1 to 21.7, 22.1 to 22.4, 22.7.
Course outcomes: The students should be able to:
• Identify, analyze and define database objects, enforce integrity constraints on a
database using RDBMS.
• Use Structured Query Language (SQL) for database manipulation.
• Design and build simple database systems
• Develop application to interact with databases.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Fundamentals of Database Systems, RamezElmasri and Shamkant B. Navathe, 7th
Edition, 2017, Pearson.
2. Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014,
McGraw Hill
Reference Books:
1. Silberschatz Korth and Sudharshan, Database System Concepts, 6th Edition, Mc-
GrawHill, 2013.
2. Coronel, Morris, and Rob, Database Principles Fundamentals of Design,
Implementation and Management, Cengage Learning 2012.
 AUTOMATA THEORY AND COMPUTABILITY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS54 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Introduce core concepts in Automata and Theory of Computation
• Identify different Formal language Classes and their Relationships
• Design Grammars and Recognizers for different formal languages
• Prove or disprove theorems in automata theory using their properties
• Determine the decidability and intractability of Computational problems
Module – 1 Teaching
Hours
Why study the Theory of Computation, Languages and Strings: Strings, 10 Hours
Languages. A Language Hierarchy, Computation, Finite State Machines
(FSM): Deterministic FSM, Regular languages, Designing FSM,
Nondeterministic FSMs, From FSMs to Operational Systems, Simulators for
FSMs, Minimizing FSMs, Canonical form of Regular languages, Finite State
Transducers, Bidirectional Transducers.
Textbook 1: Ch 1,2, 3,4, 5.1 to 5.10
Module – 2
Regular Expressions (RE): what is a RE?, Kleene’s theorem, Applications of 10 Hours
REs, Manipulating and Simplifying REs. Regular Grammars: Definition,
Regular Grammars and Regular languages. Regular Languages (RL) and Non-
regular Languages: How many RLs, To show that a language is regular, Closure
properties of RLs, to show some languages are not RLs.
Textbook 1: Ch 6, 7, 8: 6.1 to 6.4, 7.1, 7.2, 8.1 to 8.4
Module – 3
Context-Free Grammars(CFG): Introduction to Rewrite Systems and Grammars, 10 Hours
CFGs and languages, designing CFGs, simplifying CFGs, proving that a
Grammar is correct, Derivation and Parse trees, Ambiguity, Normal Forms.
Pushdown Automata (PDA): Definition of non-deterministic PDA, Deterministic
and Non-deterministic PDAs, Non-determinism and Halting, alternative
equivalent definitions of a PDA, alternatives that are not equivalent to PDA.
Textbook 1: Ch 11, 12: 11.1 to 11.8, 12.1, 12.2, 12,4, 12.5, 12.6
Module – 4
Context-Free and Non-Context-Free Languages: Where do the Context-Free 10 Hours
Languages(CFL) fit, Showing a language is context-free, Pumping theorem for
CFL, Important closure properties of CFLs, Deterministic CFLs. Algorithms and
Decision Procedures for CFLs: Decidable questions, Un-decidable questions.
Turing Machine: Turing machine model, Representation, Language acceptability
by TM, design of TM, Techniques for TM construction.
Textbook 1: Ch 13: 13.1 to 13.5, Ch 14: 14.1, 14.2, Textbook 2: Ch 9.1 to 9.6
Module – 5
Variants of Turing Machines (TM), The model of Linear Bounded automata: 10 Hours
Decidability: Definition of an algorithm, decidability, decidable languages,
Undecidable languages, halting problem of TM, Post correspondence problem.
Complexity: Growth rate of functions, the classes of P and NP, Quantum
Computation: quantum computers, Church-Turing thesis.
Textbook 2: Ch 9.7 to 9.8, 10.1 to 10.7, 12.1, 12.2, 12.8, 12.8.1, 12.8.2
Course outcomes: The students should be able to:
• Acquire fundamental understanding of the core concepts in automata theory
and Theory of Computation
• Learn how to translate between different models of Computation (e.g.,
Deterministic and Non-deterministic and Software models).
• Design Grammars and Automata (recognizers) for different language classes
and become knowledgeable about restricted models of Computation
(Regular, Context Free) and their relative powers.
• Develop skills in formal reasoning and reduction of a problem to a formal
model, with an emphasis on semantic precision and conciseness.
• Classify a problem with respect to different models of Computation.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Elaine Rich, Automata, Computability and Complexity, 1st Edition, Pearson
Education,2012/2013
2. K L P Mishra, N Chandrasekaran , 3rd Edition, Theory of Computer Science, PhI, 2012.
Reference Books:
1. John E Hopcroft, Rajeev Motwani, Jeffery D Ullman, Introduction to AutomataTheory,
Languages, and Computation, 3rd Edition, Pearson Education, 2013
2. Michael Sipser : Introduction to the Theory of Computation, 3rd edition, Cengage
learning,2013
3. John C Martin, Introduction to Languages and The Theory of Computation, 3rd Edition,
Tata McGraw –Hill Publishing Company Limited, 2013
4. Peter Linz, “An Introduction to Formal Languages and Automata”, 3rd Edition, Narosa
Publishers, 1998
5. Basavaraj S. Anami, Karibasappa K G, Formal Languages and Automata theory, Wiley
India, 2012
6. C K Nagpal, Formal Languages and Automata Theory, Oxford University press, 2012.
 OBJECT ORIENTED MODELING AND DESIGN
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS551 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Describe the concepts involved in Object-Oriented modelling and their benefits.
• Demonstrate concept of use-case model, sequence model and state chart model for a
given problem.
• Explain the facets of the unified process approach to design and build a Software
system.
• Translate the requirements into implementation for Object Oriented design.
• Choose an appropriate design pattern to facilitate development procedure.
Module – 1 Teaching
Hours
Introduction, Modelling Concepts and Class Modelling: What is Object 8 Hours
orientation? What is OO development? OO Themes; Evidence for usefulness of
OO development; OO modelling history. Modelling as Design technique:
Modelling; abstraction; The Three models. Class Modelling: Object and Class
Concept; Link and associations concepts; Generalization and Inheritance; A
sample class model; Navigation of class models; Advanced Class Modelling,
Advanced object and class concepts; Association ends; N-ary associations;
Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification;
Constraints; Derived Data; Packages.
Text Book-1: Ch 1, 2, 3 and 4
Module – 2
UseCase Modelling and Detailed Requirements: Overview; Detailed object- 8 Hours
oriented Requirements definitions; System Processes-A use case/Scenario view;
Identifying Input and outputs-The System sequence diagram; Identifying Object
Behaviour-The state chart Diagram; Integrated Object-oriented Models.
Text Book-2:Chapter- 6:Page 210 to 250
Module – 3
Process Overview, System Conception and Domain Analysis: Process Overview: 8 Hours
Development stages; Development life Cycle; System Conception: Devising a
system concept; elaborating a concept; preparing a problem statement. Domain
Analysis: Overview of analysis; Domain Class model: Domain state model;
Domain interaction model; Iterating the analysis.
Text Book-1:Chapter- 10,11,and 12
Module – 4
Use case Realization :The Design Discipline within up iterations: Object 8 Hours
Oriented Design-The Bridge between Requirements and Implementation; Design
Classes and Design within Class Diagrams; Interaction Diagrams-Realizing Use
Case and defining methods; Designing with Communication Diagrams; Updating
the Design Class Diagram; Package Diagrams-Structuring the Major
Components; Implementation Issues for Three-Layer Design.
Text Book-2: Chapter 8: page 292 to 346
Module – 5
Design Patterns: Introduction; what is a design pattern?, Describing design 8 Hours
patterns, the catalog of design patterns, Organizing the catalog, How design
patterns solve design problems, how to select a design patterns, how to use a
design pattern; Creational patterns: prototype and singleton(only);structural
patterns adaptor and proxy(only).
Text Book-3:Chapter-1: 1.1, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8,Chapter-3,Chapter-4.
Course outcomes: The students should be able to:
• Describe the concepts of object-oriented and basic class modelling.
• Draw class diagrams, sequence diagrams and interaction diagrams to solve
problems.
• Choose and apply a befitting design pattern for the given problem.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Michael Blaha, James Rumbaugh: Object Oriented Modelling and Design with UML,2nd
Edition, Pearson Education,2005
2. Satzinger, Jackson and Burd: Object-Oriented Analysis & Design with the Unified
Process, Cengage Learning,2005.
3. Erich Gamma, Richard Helm, Ralph Johnson and john Vlissides: Design Patterns –
Elements of Reusable Object-Oriented Software,
Pearson Education,2007.
Reference Books:
1. Grady Booch et.al.: Object-Oriented Analysis and Design with Applications,3rd
Edition,Pearson Education,2007.
2. 2.Frank Buschmann, RegineMeunier, Hans Rohnert, Peter Sommerlad, Michel Stal:
Pattern –Oriented Software Architecture. A system of Patterns , Volume 1, John Wiley
and Sons.2007.
3. 3. Booch, Jacobson, Rambaugh : Object-Oriented Analysis and Design with
Applications, 3rd edition, pearson, Reprint 2013
 SOCIAL NETWORK ANALYSIS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15IS552 IA Marks 20
Number of Lecture Hours/Week 03 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Discuss essential knowledge of network analysis applicable to real world data, with
examples from today’s most popular social networks.
Module 1 Teaching
Hours
Introduction to social network analysis and Descriptive network analysis: 8 Hours
Introduction to new science of networks. Networks examples. Graph theory
basics. Statistical network properties. Degree distribution, clustering coefficient.
Frequent patterns. Network motifs. Cliques and k-cores.
Module 2
Network structure, Node centralities and ranking on network: Nodes and 8 Hours
edges, network diameter and average path length. Node centrality metrics:
degree, closeness and betweenness centrality. Eigenvector centrality and
PageRank. Algorithm HITS.
Module 3
Network communities and Affiliation networks: Networks communities. 8 Hours
Graph partitioning and cut metrics. Edge betweenness. Modularity clustering.
Affiliation network and bipartite graphs. 1-mode projections. Recommendation
systems.
Module 4
Information and influence propagation on networks and Network 8 Hours
visualization: Social Diffusion. Basic cascade model. Influence maximization.
Most influential nodes in network. Network visualization and graph layouts.
Graph sampling. Low -dimensional projections
Module 5
Social media mining and SNA in real world: FB/VK and Twitter analysis: 8 Hours
Natural language processing and sentiment mining. Properties of large social
networks: friends, connections, likes, re-tweets.
Course Outcomes: The students should be able to:
• Define notation and terminology used in network science.
• Demonstrate, summarize and compare networks.
• Explain basic principles behind network analysis algorithms.
• Analyzing real world network.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from
each module.
Text Books:
1. David Easley and John Kleinberg. "Networks, Crowds, and Markets: Reasoning
About a Highly Connected World." Cambridge University Press 2010.
 2. Eric Kolaczyk, Gabor Csardi. “Statistical Analysis of Network Data with R (Use R!)”.
Springer, 2014.
3. Stanley Wasserman and Katherine Faust. "Social Network Analysis. Methods and
Applications." Cambridge University Press, 1994.
Reference Books:
1. NIL
 ADVANCED JAVA AND J2EE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CS553 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Identify the need for advanced Java concepts like Enumerations and Collections
• Construct client-server applications using Java socket API
• Make use of JDBC to access database through Java Programs
• Adapt servlets to build server side programs
• Demonstrate the use of JavaBeans to develop component-based Java software

Module – 1 Teaching
Hours
Enumerations, Autoboxing and Annotations(metadata): Enumerations, 8 Hours
Enumeration fundamentals, the values() and valueOf() Methods, java
enumerations are class types, enumerations Inherits Enum, example, type
wrappers, Autoboxing, Autoboxing and Methods, Autoboxing/Unboxing occurs
in Expressions, Autoboxing/Unboxing, Boolean and character values,
Autoboxing/Unboxing helps prevent errors, A word of Warning. Annotations,
Annotation basics, specifying retention policy, Obtaining Annotations at run
time by use of reflection, Annotated element Interface, Using Default values,
Marker Annotations, Single Member annotations, Built-In annotations.
Module – 2
The collections and Framework: Collections Overview, Recent Changes to 8 Hours
Collections, The Collection Interfaces, The Collection Classes, Accessing a
collection Via an Iterator, Storing User Defined Classes in Collections, The
Random Access Interface, Working With Maps, Comparators, The Collection
Algorithms, Why Generic Collections?, The legacy Classes and Interfaces,
Parting Thoughts on Collections.
Module – 3
String Handling :The String Constructors, String Length, Special String 8 Hours
Operations, String Literals, String Concatenation, String Concatenation with
Other Data Types, String Conversion and toString( ) Character Extraction,
charAt( ), getChars( ), getBytes( ) toCharArray(), String Comparison, equals( )
and equalsIgnoreCase( ), regionMatches( ) startsWith( ) and endsWith( ), equals(
) Versus == , compareTo( ) Searching Strings, Modifying a String, substring( ),
concat( ), replace( ), trim( ), Data Conversion Using valueOf( ), Changing the
Case of Characters Within a String, Additional String Methods, StringBuffer ,
StringBuffer Constructors, length( ) and capacity( ), ensureCapacity( ),
setLength( ), charAt( ) and setCharAt( ), getChars( ),append( ), insert( ), reverse(
), delete( ) and deleteCharAt( ), replace( ), substring( ), Additional StringBuffer
Methods, StringBuilder
Text Book 1: Ch 15
Module – 4
Background; The Life Cycle of a Servlet; Using Tomcat for Servlet 8 Hours
Development; A simple Servlet; The Servlet API; The Javax.servlet Package;
Reading Servlet Parameter; The Javax.servlet.http package; Handling HTTP
Requests and Responses; Using Cookies; Session Tracking. Java Server Pages
(JSP): JSP, JSP Tags, Tomcat, Request String, User Sessions, Cookies, Session
Objects
Text Book 1: Ch 31 Text Book 2: Ch 11
Module – 5
The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview 8 Hours
of the JDBC process; Database Connection; Associating the JDBC/ODBC
Bridge with the Database; Statement Objects; ResultSet; Transaction Processing;
Metadata, Data types; Exceptions.
Text Book 2: Ch 06
Course outcomes: The students should be able to:
• Interpret the need for advanced Java concepts like enumerations and collections in
developing modular and efficient programs
• Build client-server applications and TCP/IP socket programs
• Illustrate database access and details for managing information using the JDBC API
• Describe how servlets fit into Java-based web application architecture
• Develop reusable software components using Java Beans
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
th
1. Herbert Schildt: JAVA the Complete Reference, 7 /9th Edition, Tata McGraw Hill,
2007.
2. Jim Keogh: J2EE-TheCompleteReference, McGraw Hill, 2007.

Reference Books:
th
1. Y. Daniel Liang: Introduction to JAVA Programming, 7 Edition, Pearson Education,
2007.
nd
2. Stephanie Bodoff et al: The J2EE Tutorial, 2 Edition, Pearson Education,2004.
3. Uttam K Roy, Advanced JAVA programming, Oxford University press, 2015.
 PROGRAMMING LANGAUGES
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15IS554 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Acquaint with discipline of programming
• Familiarize with semantics of different constructs of languages
• Introduce different programming paradigms
• Illustrate use of different languages and their applications
Module – 1 Teaching
Hours
Overview, Names, Types, Type systems 8 Hours
Module – 2
Semantics, semantic interpretation 8 Hours
Module – 3
Functions, function implementation, memory management 8 Hours
Module – 4
Imperative programming, object oriented programming, functional programming 8 Hours
Module – 5
Logic programming, event-driven programming, concurrent programming 8 Hours
Course outcomes: The students should be able to:
• Select appropriate languages for given applications
• Demonstrate usage and justification of different languages
• Compare and contrast the strengths and weaknesses of different languages
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Programming languages by Allen B. Tucker and Robert E. Noonan
Reference Books:
NIL
 COMPUTER NETWORK LABORATORY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CSL57 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
• Demonstrate operation of network and its management commands
• Simulate and demonstrate the performance of GSM and CDMA
• Implement data link layer and transport layer protocols.
Description (If any):
For the experiments below modify the topology and parameters set for the experiment and
take multiple rounds of reading and analyze the results available in log files. Plot necessary
graphs and conclude. Use NS2/NS3.
Lab Experiments:
PART A
1. Implement three nodes point – to – point network with duplex links between them.
Set the queue size, vary the bandwidth and find the number of packets dropped.
2. Implement transmission of ping messages/trace route over a network topology
consisting of 6 nodes and find the number of packets dropped due to congestion.
3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source / destination.
4. Implement simple ESS and with transmitting nodes in wire-less LAN by simulation
and determine the performance with respect to transmission of packets.
5. Implement and study the performance of GSM on NS2/NS3 (Using MAC layer) or
equivalent environment.
6. Implement and study the performance of CDMA on NS2/NS3 (Using stack called
Call net) or equivalent environment.

PART B
Implement the following in Java:
7. Write a program for error detecting code using CRC-CCITT (16- bits).
8. Write a program to find the shortest path between vertices using bellman-ford
algorithm.
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 of the requested file if present.
10. Write a program on datagram socket for client/server to display the messages on
client side, typed at the server side.
11. Write a program for simple RSA algorithm to encrypt and decrypt the data.
12. Write a program for congestion control using leaky bucket algorithm.

Study Experiment / Project:

NIL
Course outcomes: The students should be able to:
• Analyze and Compare various networking protocols.
• Demonstrate the working of different concepts of networking.
 • Implement, analyze and evaluate networking protocols in NS2 / NS3
Conduction of Practical Examination:
1. All laboratory experiments are to be included for practical examination.
2. Students are allowed to pick one experiment from part A and part B with lot.
3. Strictly follow the instructions as printed on the cover page of answer script
4. Marks distribution: Procedure + Conduction + Viva: 80
Part A: 10+25+5 =40
Part B: 10+25+5 =40
5. Change of experiment is allowed only once and marks allotted to the procedure part to be
made zero.
 DBMS LABORATORY WITH MINI PROJECT
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15CSL58 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
• Foundation knowledge in database concepts, technology and practice to groom
students into well-informed database application developers.
• Strong practice in SQL programming through a variety of database problems.
• Develop database applications using front-end tools and back-end DBMS.
Description (If any):
PART-A: SQL Programming (Max. Exam Mks. 50)
• Design, develop, and implement the specified queries for the following problems
using Oracle, MySQL, MS SQL Server, or any other DBMS under
LINUX/Windows environment.
• Create Schema and insert at least 5 records for each table. Add appropriate
database constraints.
PART-B: Mini Project (Max. Exam Mks. 30)
• Use Java, C#, PHP, Python, or any other similar front-end tool. All
applications must be demonstrated on desktop/laptop as a stand-alone or web
based application (Mobile apps on Android/IOS are not permitted.)
Lab Experiments:
Part A: SQL Programming
1 Consider the following schema for a Library Database:
BOOK(Book_id, Title, Publisher_Name, Pub_Year)
BOOK_AUTHORS(Book_id, Author_Name)
PUBLISHER(Name, Address, Phone)
BOOK_COPIES(Book_id, Branch_id, No-of_Copies)
BOOK_LENDING(Book_id, Branch_id, Card_No, Date_Out, Due_Date)
LIBRARY_BRANCH(Branch_id, Branch_Name, Address)
Write SQL queries to
1. Retrieve details of all books in the library – id, title, name of publisher,
authors, number of copies in each branch, etc.
2. Get the particulars of borrowers who have borrowed more than 3 books, but
from Jan 2017 to Jun 2017.
3. Delete a book in BOOK table. Update the contents of other tables to reflect
this data manipulation operation.
4. Partition the BOOK table based on year of publication. Demonstrate its
working with a simple query.
5. Create a view of all books and its number of copies that are currently
available in the Library.
2 Consider the following schema for Order Database:
SALESMAN(Salesman_id, Name, City, Commission)
CUSTOMER(Customer_id, Cust_Name, City, Grade, Salesman_id)
ORDERS(Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id)
Write SQL queries to
1. Count the customers with grades above Bangalore’s average.
 2. Find the name and numbers of all salesman who had more than one customer.
3. List all the salesman and indicate those who have and don’t have customers in
their cities (Use UNION operation.)
4. Create a view that finds the salesman who has the customer with the highest
order of a day.
5. Demonstrate the DELETE operation by removing salesman with id 1000. All
his orders must also be deleted.
3 Consider the schema for Movie Database:
ACTOR(Act_id, Act_Name, Act_Gender)
DIRECTOR(Dir_id, Dir_Name, Dir_Phone)
MOVIES(Mov_id, Mov_Title, Mov_Year, Mov_Lang, Dir_id)
MOVIE_CAST(Act_id, Mov_id, Role)
RATING(Mov_id, Rev_Stars)
Write SQL queries to
1. List the titles of all movies directed by ‘Hitchcock’.
2. Find the movie names where one or more actors acted in two or more movies.
3. List all actors who acted in a movie before 2000 and also in a movie after
2015 (use JOIN operation).
4. Find the title of movies and number of stars for each movie that has at least
one rating and find the highest number of stars that movie received. Sort the
result by movie title.
5. Update rating of all movies directed by ‘Steven Spielberg’ to 5.
4 Consider the schema for College Database:
STUDENT(USN, SName, Address, Phone, Gender)
SEMSEC(SSID, Sem, Sec)
CLASS(USN, SSID)
SUBJECT(Subcode, Title, Sem, Credits)
IAMARKS(USN, Subcode, SSID, Test1, Test2, Test3, FinalIA)
Write SQL queries to
1. List all the student details studying in fourth semester ‘C’ section.
2. Compute the total number of male and female students in each semester and in
each section.
3. Create a view of Test1 marks of student USN ‘1BI15CS101’ in all subjects.
4. Calculate the FinalIA (average of best two test marks) and update the
corresponding table for all students.
5. Categorize students based on the following criterion:
If FinalIA = 17 to 20 then CAT = ‘Outstanding’
If FinalIA = 12 to 16 then CAT = ‘Average’
If FinalIA< 12 then CAT = ‘Weak’
Give these details only for 8th semester A, B, and C section students.
5 Consider the schema for Company Database:
EMPLOYEE(SSN, Name, Address, Sex, Salary, SuperSSN, DNo)
DEPARTMENT(DNo, DName, MgrSSN, MgrStartDate)
DLOCATION(DNo,DLoc)
PROJECT(PNo, PName, PLocation, DNo)
WORKS_ON(SSN, PNo, Hours)
Write SQL queries to
1. Make a list of all project numbers for projects that involve an employee
whose last name is ‘Scott’, either as a worker or as a manager of the
department that controls the project.
 2. Show the resulting salaries if every employee working on the ‘IoT’ project is
given a 10 percent raise.
3. Find the sum of the salaries of all employees of the ‘Accounts’ department, as
well as the maximum salary, the minimum salary, and the average salary in
this department
4. Retrieve the name of each employee who works on all the projects
controlledby department number 5 (use NOT EXISTS operator).
5. For each department that has more than five employees, retrieve the
department number and the number of its employees who are making more
than Rs. 6,00,000.
Part B: Mini project
• For any problem selected, write the ER Diagram, apply ER-mapping rules,
normalize the relations, and follow the application development process.
• Make sure that the application should have five or more tables, at least one
trigger and one stored procedure, using suitable frontend tool.
• Indicative areas include; health care, education, industry, transport, supply chain,
etc.
Course outcomes: The students should be able to:
• Create, Update and query on the database.
• Demonstrate the working of different concepts of DBMS
• Implement, analyze and evaluate the project developed for an application.
Conduction of Practical Examination:
1. All laboratory experiments from part A are to be included for practical
examination.
2. Mini project has to be evaluated for 30 Marks.
3. Report should be prepared in a standard format prescribed for project work.
4. Students are allowed to pick one experiment from the lot.
5. Strictly follow the instructions as printed on the cover page of answer script.
6. Marks distribution:
a) Part A: Procedure + Conduction + Viva:10 + 35 +5 =50 Marks
b) Part B: Demonstration + Report + Viva voce = 15+10+05 = 30 Marks
7. Change of experiment is allowed only once and marks allotted to the procedure
part to be made zero.
 CRYPTOGRAPHY, NETWORK SECURITY AND CYBER LAW
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15CS61 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Explain the concepts of Cyber security
• Illustrate key management issues and solutions.
• Familiarize with Cryptography and very essential algorithms
• Introduce cyber Law and ethics to be followed.
Module – 1 Teaching
Hours
Introduction - Cyber Attacks, Defence Strategies and Techniques, Guiding 10 Hours
Principles, Mathematical Background for Cryptography - Modulo Arithmetic’s,
The Greatest Comma Divisor, Useful Algebraic Structures, Chinese Remainder
Theorem, Basics of Cryptography - Preliminaries, Elementary Substitution
Ciphers, Elementary Transport Ciphers, Other Cipher Properties, Secret Key
Cryptography – Product Ciphers, DES Construction.
Module – 2
Public Key Cryptography and RSA – RSA Operations, Why Does RSA Work?, 10 Hours
Performance, Applications, Practical Issues, Public Key Cryptography Standard
(PKCS), Cryptographic Hash - Introduction, Properties, Construction,
Applications and Performance, The Birthday Attack, Discrete Logarithm and its
Applications - Introduction, Diffie-Hellman Key Exchange, Other Applications.
Module – 3
Key Management - Introduction, Digital Certificates, Public Key Infrastructure, 10 Hours
Identity–based Encryption, Authentication–I - One way Authentication, Mutual
Authentication, Dictionary Attacks, Authentication – II – Centalised
Authentication, The Needham-Schroeder Protocol, Kerberos, Biometrics, IPSec-
Security at the Network Layer – Security at Different layers: Pros and Cons,
IPSec in Action, Internet Key Exchange (IKE) Protocol, Security Policy and
IPSEC, Virtual Private Networks, Security at the Transport Layer - Introduction,
SSL Handshake Protocol, SSL Record Layer Protocol, OpenSSL.
Module – 4
IEEE 802.11 Wireless LAN Security - Background, Authentication, 10 Hours
Confidentiality and Integrity, Viruses, Worms, and Other Malware, Firewalls –
Basics, Practical Issues, Intrusion Prevention and Detection - Introduction,
Prevention Versus Detection, Types of Instruction Detection Systems, DDoS
Attacks Prevention/Detection, Web Service Security – Motivation, Technologies
for Web Services, WS- Security, SAML, Other Standards.
Module – 5
IT act aim and objectives, Scope of the act, Major Concepts, Important 10 Hours
provisions, Attribution, acknowledgement, and dispatch of electronic records,
Secure electronic records and secure digital signatures, Regulation of certifying
authorities: Appointment of Controller and Other officers, Digital Signature
certificates, Duties of Subscribers, Penalties and adjudication, The cyber
regulations appellate tribunal, Offences, Network service providers not to be
liable in certain cases, Miscellaneous Provisions.
Course outcomes: The students should be able to:
• Discuss cryptography and its need to various applications
• Design and develop simple cryptography algorithms
• Understand cyber security and need cyber Law
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Cryptography, Network Security and Cyber Laws – Bernard Menezes, Cengage
Learning, 2010 edition (Chapters-1,3,4,5,6,7,8,9,10,11,12,13,14,15,19(19.1-
19.5),21(21.1-21.2),22(22.1-22.4),25
Reference Books:
1. Cryptography and Network Security- Behrouz A Forouzan, Debdeep Mukhopadhyay,
Mc-GrawHill, 3rd Edition, 2015
2. Cryptography and Network Security- William Stallings, Pearson Education, 7th
Edition
3. Cyber Law simplified- Vivek Sood, Mc-GrawHill, 11th reprint , 2013
4. Cyber security and Cyber Laws, Alfred Basta, Nadine Basta, Mary brown, ravindra
kumar, Cengage learning
 FILE STRUCTURES
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15IS62 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Explain the fundamentals of file structures and their management.
• Measure the performance of different file structures
• Organize different file structures in the memory.
• Demonstrate hashing and indexing techniques.
Module – 1 Teaching
Hours
Introduction: File Structures: The Heart of the file structure Design, A Short 10 Hours
History of File Structure Design, A Conceptual Toolkit; Fundamental File
Operations: Physical Files and Logical Files, Opening Files, Closing Files,
Reading and Writing, Seeking, Special Characters, The Unix Directory Structure,
Physical devices and Logical Files, File-related Header Files, UNIX file System
Commands; Secondary Storage and System Software: Disks, Magnetic Tape,
Disk versus Tape; CD-ROM: Introduction, Physical Organization, Strengths and
Weaknesses; Storage as Hierarchy, A journey of a Byte, Buffer Management,
Input /Output in UNIX.
Fundamental File Structure Concepts, Managing Files of Records : Field
and Record Organization, Using Classes to Manipulate Buffers, Using
Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field
Buffers, An Object-Oriented Class for Record Files, Record Access, More about
Record Structures, Encapsulating Record Operations in a Single Class, File
Access and File Organization.
Module – 2
Organization of Files for Performance, Indexing: Data Compression, 10 Hours
Reclaiming Space in files, Internal Sorting and Binary Searching, Keysorting;
What is an Index? A Simple Index for Entry-Sequenced File, Using Template
Classes in C++ for Object I/O, Object-Oriented support for Indexed, Entry-
Sequenced Files of Data Objects, Indexes that are too large to hold in Memory,
Indexing to provide access by Multiple keys, Retrieval Using Combinations of
Secondary Keys, Improving the Secondary Index structure: Inverted Lists,
Selective indexes, Binding.
Module – 3
Consequential Processing and the Sorting of Large Files: A Model for 10 Hours
Implementing Cosequential Processes, Application of the Model to a General
Ledger Program, Extension of the Model to include Mutiway Merging, A Second
Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk.
Multi-Level Indexing and B-Trees: The invention of B-Tree, Statement of the
problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees,
Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees,
B-Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-
case Search Depth, Deletion, Merging and Redistribution, Redistribution during
insertion; B* Trees, Buffering of pages; Virtual B-Trees; Variable-length
Records and keys.
Module – 4
Indexed Sequential File Access and Prefix B + Trees: Indexed Sequential 10 Hours
Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence Set,
The Content of the Index: Separators Instead of Keys, The Simple Prefix B+ Tree
and its maintenance, Index Set Block Size, Internal Structure of Index Set
Blocks: A Variable-order B- Tree, Loading a Simple Prefix B+ Trees, B-Trees,
B+ Trees and Simple Prefix B+ Trees in Perspective.
Module – 5
Hashing: Introduction, A Simple Hashing Algorithm, Hashing Functions and 10 Hours
Record Distribution, How much Extra Memory should be used?, Collision
resolution by progressive overflow, Buckets, Making deletions, Other collision
resolution techniques, Patterns of record access.
Extendible Hashing: How Extendible Hashing Works, Implementation,
Deletion, Extendible Hashing Performance, Alternative Approaches.
Course outcomes: The students should be able to:
• Choose appropriate file structure for storage representation.
• Identify a suitable sorting technique to arrange the data.
• Select suitable indexing and hashing techniques for better performance to a given
problem.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Michael J. Folk, Bill Zoellick, Greg Riccardi: File Structures-An Object Oriented
Approach with C++, 3rd Edition, Pearson Education, 1998. (Chapters 1 to 12
excluding 1.4, 1.5, 5.5, 5.6, 8.6, 8.7, 8.8)
Reference Books:
1. K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj: File Structures Using C++, Tata
McGraw-Hill, 2008.
2. Scot Robert Ladd: C++ Components and Algorithms, BPB Publications, 1993.
3. Raghu Ramakrishan and Johannes Gehrke: Database Management Systems, 3rd
Edition, McGraw Hill, 2003.
 SOFTWARE TESTING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – V
Subject Code 15IS63 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Differentiate the various testing techniques
• Analyze the problem and derive suitable test cases.
• Apply suitable technique for designing of flow graph
• Explain the need for planning and monitoring a process
Module – 1 Teaching
Hours
Basics of Software Testing: Basic definitions, Software Quality , Requirements, 10 Hours
Behaviour and Correctness, Correctness versus Reliability, Testing and
Debugging, Test cases, Insights from a Venn diagram, Identifying test cases,
Test-generation Strategies, Test Metrics, Error and fault taxonomies , Levels of
testing, Testing and Verification, Static Testing. Problem Statements:
Generalized pseudocode, the triangle problem, the NextDate function, the
commission problem, the SATM (Simple Automatic Teller Machine) problem,
the currency converter, Saturn windshield wiper
T1:Chapter1, T3:Chapter1, T1:Chapter2.
Module – 2
Functional Testing: Boundary value analysis, Robustness testing, Worst-case 10 Hours
testing, Robust Worst testing for triangle problem, Nextdate problem and
commission problem, Equivalence classes, Equivalence test cases for the triangle
problem, NextDate function, and the commission problem, Guidelines and
observations, Decision tables, Test cases for the triangle problem, NextDate
function, and the commission problem, Guidelines and observations. Fault
Based Testing: Overview, Assumptions in fault based testing, Mutation analysis,
Fault-based adequacy criteria, Variations on mutation analysis.
T1: Chapter 5, 6 & 7, T2: Chapter 16
Module – 3
Structural Testing: Overview, Statement testing, Branch testing, Condition 10 Hours
testing , Path testing: DD paths, Test coverage metrics, Basis path testing,
guidelines and observations, Data –Flow testing: Definition-Use testing, Slice-
based testing, Guidelines and observations. Test Execution: Overview of test
execution, from test case specification to test cases, Scaffolding, Generic versus
specific scaffolding, Test oracles, Self-checks as oracles, Capture and replay
T3:Section 6.2.1, T3:Section 6.2.4, T1:Chapter 9 & 10, T2:Chapter 17
Module – 4
Process Framework :Basic principles: Sensitivity, redundancy, restriction, 10 Hours
partition, visibility, Feedback, the quality process, Planning and monitoring,
Quality goals, Dependability properties ,Analysis Testing, Improving the process,
Organizational factors.
Planning and Monitoring the Process: Quality and process, Test and analysis
strategies and plans, Risk planning, monitoring the process, Improving the
process, the quality team
Documenting Analysis and Test: Organizing documents, Test strategy
document, Analysis and test plan, Test design specifications documents, Test and
analysis reports.
T2: Chapter 3 & 4, T2: Chapter 20, T2: Chapter 24.
Module – 5
Integration and Component-Based Software Testing: Overview, Integration 10 Hours
testing strategies, Testing components and assemblies. System, Acceptance and
Regression Testing: Overview, System testing, Acceptance testing, Usability,
Regression testing, Regression test selection techniques, Test case prioritization
and selective execution. Levels of Testing, Integration Testing: Traditional
view of testing levels, Alternative life-cycle models, The SATM system,
Separating integration and system testing, A closer look at the SATM system,
Decomposition-based, call graph-based, Path-based integrations.
T2: Chapter 21 & 22, T1 : Chapter 12 & 13
Course outcomes: The students should be able to:
• Derive test cases for any given problem
• Compare the different testing techniques
• Classify the problem into suitable testing model
• Apply the appropriate technique for the design of flow graph.
• Create appropriate document for the software artefact.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Paul C. Jorgensen: Software Testing, A Craftsman’s Approach, 3rd Edition, Auerbach
Publications, 2008. (Listed topics only from Chapters 1, 2, 5, 6, 7, 9, 10, 12, 13)
2. Mauro Pezze, Michal Young: Software Testing and Analysis – Process, Principles and
Techniques, Wiley India, 2009. (Listed topics only from Chapters 3, 4, 16, 17, 20,21,
22,24)
3. Aditya P Mathur: Foundations of Software Testing, Pearson Education, 2008.( Listed
topics only from Section 1.2 , 1.3, 1.4 ,1.5, 1.8,1.12,6. 2.1,6. 2.4 )
Reference Books:
1. Software testing Principles and Practices – Gopalaswamy Ramesh, Srinivasan Desikan, 2
nd Edition, Pearson, 2007.
2. Software Testing – Ron Patton, 2nd edition, Pearson Education, 2004.
3. The Craft of Software Testing – Brian Marrick, Pearson Education, 1995.
4. Anirban Basu, Software Quality Assurance, Testing and Metrics, PHI, 2015.
5. Naresh Chauhan, Software Testing, Oxford University press.
 OPERATING SYSTEMS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15CS64 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Introduce concepts and terminology used in OS
• Explain threading and multithreaded systems
• Illustrate process synchronization and concept of Deadlock
• Introduce Memory and Virtual memory management, File system and storage
techniques
Module – 1 Teaching
Hours
Introduction to operating systems, System structures: What operating systems 10 Hours
do; Computer System organization; Computer System architecture; Operating
System structure; Operating System operations; Process management; Memory
management; Storage management; Protection and Security; Distributed system;
Special-purpose systems; Computing environments. Operating System Services;
User - Operating System interface; System calls; Types of system calls; System
programs; Operating system design and implementation; Operating System
structure; Virtual machines; Operating System generation; System boot. Process
Management Process concept; Process scheduling; Operations on processes;
Inter process communication
Module – 2
Multi-threaded Programming: Overview; Multithreading models; Thread 10 Hours
Libraries; Threading issues. Process Scheduling: Basic concepts; Scheduling
Criteria; Scheduling Algorithms; Multiple-processor scheduling; Thread
scheduling. Process Synchronization: Synchronization: The critical section
problem; Peterson’s solution; Synchronization hardware; Semaphores; Classical
problems of synchronization; Monitors.
Module – 3
Deadlocks : Deadlocks; System model; Deadlock characterization; Methods for 10 Hours
handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock
detection and recovery from deadlock. Memory Management: Memory
management strategies: Background; Swapping; Contiguous memory allocation;
Paging; Structure of page table; Segmentation.
Module – 4
Virtual Memory Management: Background; Demand paging; Copy-on-write; 10 Hours
Page replacement; Allocation of frames; Thrashing. File System,
Implementation of File System: File system: File concept; Access methods;
Directory structure; File system mounting; File sharing; Protection:
Implementing File system: File system structure; File system implementation;
Directory implementation; Allocation methods; Free space management.
Module – 5
Secondary Storage Structures, Protection: Mass storage structures; Disk 10 Hours
structure; Disk attachment; Disk scheduling; Disk management; Swap space
management. Protection: Goals of protection, Principles of protection, Domain of
protection, Access matrix, Implementation of access matrix, Access control,
Revocation of access rights, Capability- Based systems. Case Study: The Linux
Operating System: Linux history; Design principles; Kernel modules; Process
management; Scheduling; Memory Management; File systems, Input and output;
Inter-process communication.
Course outcomes: The students should be able to:
• Demonstrate need for OS and different types of OS
• Apply suitable techniques for management of different resources
• Use processor, memory, storage and file system commands
• Realize the different concepts of OS in platform of usage through case studies
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles 7th
edition, Wiley-India, 2006.
Reference Books
1. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th
Edition
2. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw-
Hill, 2013.
3. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition,
PHI(EEE), 2014.
4. William Stallings Operating Systems: Internals and Design Principles, 6th Edition,
Pearson.
 DATA MINING AND DATA WAREHOUSING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15CS651 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Define multi-dimensional data models.
• Explain rules related to association, classification and clustering analysis.
• Compare and contrast between different classification and clustering algorithms
Module – 1 Teaching
Hours
Data Warehousing & modeling: Basic Concepts: Data Warehousing: A 8 Hours
multitier Architecture, Data warehouse models: Enterprise warehouse, Data mart
and virtual warehouse, Extraction, Transformation and loading, Data Cube: A
multidimensional data model, Stars, Snowflakes and Fact constellations:
Schemas for multidimensional Data models, Dimensions: The role of concept
Hierarchies, Measures: Their Categorization and computation, Typical OLAP
Operations.
Module – 2
Data warehouse implementation& Data mining: Efficient Data Cube 8 Hours
computation: An overview, Indexing OLAP Data: Bitmap index and join index,
Efficient processing of OLAP Queries, OLAP server Architecture ROLAP versus
MOLAP Versus HOLAP. : Introduction: What is data mining, Challenges, Data
Mining Tasks, Data: Types of Data, Data Quality, Data Preprocessing, Measures
of Similarity and Dissimilarity,
Module – 3
Association Analysis: Association Analysis: Problem Definition, Frequent Item 8 Hours
set Generation, Rule generation. Alternative Methods for Generating Frequent
Item sets, FP-Growth Algorithm, Evaluation of Association Patterns.
Module – 4
Classification : Decision Trees Induction, Method for Comparing Classifiers, 8 Hours
Rule Based Classifiers, Nearest Neighbor Classifiers, Bayesian Classifiers.
Module – 5
Clustering Analysis: Overview, K-Means, Agglomerative Hierarchical 8 Hours
Clustering, DBSCAN, Cluster Evaluation, Density-Based Clustering, Graph-
Based Clustering, Scalable Clustering Algorithms.
Course outcomes: The students should be able to:
• Identify data mining problems and implement the data warehouse
• Write association rules for a given data pattern.
• Choose between classification and clustering solution.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining,
Pearson, First impression,2014.
2. Jiawei Han, Micheline Kamber, Jian Pei: Data Mining -Concepts and Techniques, 3rd
Edition, Morgan Kaufmann Publisher, 2012.
Reference Books:
1. Sam Anahory, Dennis Murray: Data Warehousing in the Real World, Pearson,Tenth
Impression,2012.
2. Michael.J.Berry,Gordon.S.Linoff: Mastering Data Mining , Wiley Edition, second
edtion,2012.
 SYSTEM SOFTWARE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15IS652 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Define System Software such as Assemblers, Loaders, Linkers and Macroprocessors
• Familiarize with source file, object file and executable file structures and libraries
• Describe the front-end and back-end phases of compiler and their importance to
students
Module – 1 Teaching
Hours
Introduction to System Software, Machine Architecture of SIC and SIC/XE. 08 Hours
Assemblers: Basic assembler functions, machine dependent assembler features,
machine independent assembler features, assembler design options.
Macroprocessors: Basic macro processor functions, machine independent macro
processor features, Macro processor design options, implementation examples
Text book 1: Chapter 1: (1.1-1.3.2), Chapter2: 2.1- 2.4 ,Chapter4
Module – 2
Loaders and Linkers: Basic Loader Functions, Design of an absolute loader, a 08 Hours
simple Bootstrap loader, Machine-dependent loader features-relocation, program
linking, algorithm and data structures for a linking loader, Machine –independent
loader features-automatic library search, Loader options, loader design options-
linkage editor, dynamic linkage, bootstrap loaders, implementation examples-MS
DOS linker.
Text book 1 : Chapter 3
Module – 3
System File and Library Structure: Introduction, Library And File 08 Hours
Organization, Design Of A Record Source Program File Structure, Object Code,
Object File, Object File Structure, Executable File, Executable File Structure,
Libraries, Image File Structure. Object Code translators: introduction, binary
code translators, object code translators, translation process, hybrid method,
applications
Reference 1: chapter 5 and chapter 15
Module – 4
Lexical Analysis: Introduction, Alphabets And Tokens In Computer Languages, 08 Hours
Representation, Token Recognition And Finite Automata, Implementation, Error
Recovery.
Text book 2: Chapter 1(1.1-1.5), Chapter 3(3.1-3.5)
Module – 5
Syntax Analysis: Introduction, Role Of Parsers, Context Free Grammars, Top 08 Hours
Down Parsers, Bottom-Up Parsers, Operator-Precedence Parsing
Text book 2: Chapter 4 (4.1 – 4.6)
Course outcomes: The students should be able to:
 • Explain system software such as assemblers, loaders, linkers and macroprocessors
• Design and develop lexical analyzers, parsers and code generators
• Utilize lex and yacc tools for implementing different concepts of system software
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. System Software by Leland. L. Beck, D Manjula, 3rd edition, 2012
2. Compilers-Principles, Techniques and Tools by Alfred V Aho, Monica S. Lam, Ravi
Sethi, Jeffrey D. Ullman. Pearson, 2nd edition, 2007
Reference Books:
1. Systems programming – Srimanta Pal , Oxford university press, 2016
2. System software and operating system by D. M. Dhamdhere TMG
3. Compiler Design, K Muneeswaran, Oxford University Press 2013.
4. System programming and Compiler Design, K C Louden, Cengage Learning
 OPERATIONS RESEARCH
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15CS653 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Formulate optimization problem as a linear programming problem.
• Solve optimization problems using simplex method.
• Formulate and solve transportation and assignment problems.
• Apply game theory for decision making problems.
Module – 1 Teaching
Hours
Introduction, Linear Programming: Introduction: The origin, nature and 8 Hours
impact of OR; Defining the problem and gathering data; Formulating a
mathematical model; Deriving solutions from the model; Testing the model;
Preparing to apply the model; Implementation .
Introduction to Linear Programming Problem (LPP): Prototype example,
Assumptions of LPP, Formulation of LPP and Graphical method various
examples.
Module – 2
Simplex Method – 1: The essence of the simplex method; Setting up the simplex 8 Hours
method; Types of variables, Algebra of the simplex method; the simplex method
in tabular form; Tie breaking in the simplex method, Big M method, Two phase
method.
Module – 3
Simplex Method – 2: Duality Theory - The essence of duality theory, Primal 8 Hours
dual relationship, conversion of primal to dual problem and vice versa. The dual
simplex method.
Module – 4
Transportation and Assignment Problems: The transportation problem, Initial 8 Hours
Basic Feasible Solution (IBFS) by North West Corner Rule method, Matrix
Minima Method, Vogel’s Approximation Method. Optimal solution by Modified
Distribution Method (MODI). The Assignment problem; A Hungarian algorithm
for the assignment problem. Minimization and Maximization varieties in
transportation and assignment problems.
Module – 5
Game Theory: Game Theory: The formulation of two persons, zero sum games; 8 Hours
saddle point, maximin and minimax principle, Solving simple games- a prototype
example; Games with mixed strategies; Graphical solution procedure.
Metaheuristics: The nature of Metaheuristics, Tabu Search, Simulated
Annealing, Genetic Algorithms.
Course outcomes: The students should be able to:
• Select and apply optimization techniques for various problems.
• Model the given problem as transportation and assignment problem and solve.
• Apply game theory for decision support system.
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. D.S. Hira and P.K. Gupta, Operations Research, (Revised Edition), Published by S.
Chand & Company Ltd, 2014
Reference Books:
1. S Kalavathy, Operation Research, Vikas Publishing House Pvt Limited, 01-Aug-2002
2. S D Sharma, Operation Research, Kedar Nath Ram Nath Publishers.
 DISTRIBUTED COMPUTING SYSTEM
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15CS654 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Explain distributed system, their characteristics, challenges and system models.
• Describe IPC mechanisms to communicate between distributed objects
• Illustrate the operating system support and File Service architecture in a distributed
system
• Analyze the fundamental concepts, algorithms related to synchronization.
Module – 1 Teaching
Hours
Characterization of Distributed Systems: Introduction, Examples of DS, 8 Hours
Resource sharing and the Web, Challenges
System Models: Architectural Models, Fundamental Models
Module – 2
Inter Process Communication: Introduction, API for Internet Protocols, 8 Hours
External Data Representation and Marshalling, Client – Server Communication,
Group Communication
Distributed Objects and RMI: Introduction, Communication between
Distributed Objects, RPC, Events and Notifications
Module – 3
Operating System Support: Introduction, The OS layer, Protection, Processes 8 Hours
and Threads, Communication and Invocation , Operating system architecture
Distributed File Systems: Introduction, File Service architecture, Sun Network
File System
Module – 4
Time and Global States: Introduction, Clocks, events and process status, 8 Hours
Synchronizing physical clocks, Logical time and logical clocks, Global states
Coordination and Agreement: Introduction, Distributed mutual exclusion,
Elections
Module – 5
Distributed Transactions: Introduction, Flat and nested distributed transactions, 8 Hours
Atomic commit protocols, Concurrency control in distributed transactions,
distributed deadlocks
Course outcomes: The students should be able to:
• Explain the characteristics of a distributed system along with its and design
challenges
• Illustrate the mechanism of IPC between distributed objects
• Describe the distributed file service architecture and the important characteristics of
SUN NFS.
• Discuss concurrency control algorithms applied in distributed transactions
Question paper pattern:
The question paper will have TEN questions.
There will be TWO questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer FIVE full questions, selecting ONE full question from each
module.
Text Books:
1. George Coulouris, Jean Dollimore and Tim Kindberg: Distributed Systems – Concepts and
Design, 5th Edition, Pearson Publications, 2009
Reference Books:
1. Andrew S Tanenbaum: Distributed Operating Systems, 3rd edition, Pearson publication,
2007
2. Ajay D. Kshemkalyani and Mukesh Singhal, Distributed Computing: Principles,
Algorithms and Systems, Cambridge University Press, 2008
3. Sunita Mahajan, Seema Shan, “ Distributed Computing”, Oxford University Press,2015
 SOFTWARE TESTING LABORATORY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15ISL67 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
• Analyse the requirements for the given problem statement
• Design and implement various solutions for the given problem
• Employ various design strategies for problem solving.
• Construct control flow graphs for the solution that is implemented
• Create appropriate document for the software artefact
Description (If any):
Design, develop, and implement the specified algorithms for the following problems using
any language of your choice under LINUX /Windows environment.
Lab Experiments:
1. Design and develop a program in a language of your choice to solve the triangle
problem defined as follows: Accept three integers which are supposed to be the three
sides of a triangle and determine if the three values represent an equilateral triangle,
isosceles triangle, scalene triangle, or they do not form a triangle at all. Assume that the
upper limit for the size of any side is 10. Derive test cases for your program based on
boundary-value analysis, execute the test cases and discuss the results.
2. Design, develop, code and run the program in any suitable language to solve the
commission problem. Analyze it from the perspective of boundary value testing, derive
different test cases, execute these test cases and discuss the test results.
3. Design, develop, code and run the program in any suitable language to implement the
NextDate function. Analyze it from the perspective of boundary value testing, derive
different test cases, execute these test cases and discuss the test results.
4. Design and develop a program in a language of your choice to solve the triangle
problem defined as follows: Accept three integers which are supposed to be the three
sides of a triangle and determine if the three values represent an equilateral triangle,
isosceles triangle, scalene triangle, or they do not form a triangle at all. Assume that the
upper limit for the size of any side is 10. Derive test cases for your program based on
equivalence class partitioning, execute the test cases and discuss the results.
5. Design, develop, code and run the program in any suitable language to solve the
commission problem. Analyze it from the perspective of equivalence class testing,
derive different test cases, execute these test cases and discuss the test results.
6. Design, develop, code and run the program in any suitable language to implement the
NextDate function. Analyze it from the perspective of equivalence class value testing,
derive different test cases, execute these test cases and discuss the test results.
7. Design and develop a program in a language of your choice to solve the triangle
problem defined as follows: Accept three integers which are supposed to be the three
sides of a triangle and determine if the three values represent an equilateral triangle,
 isosceles triangle, scalene triangle, or they do not form a triangle at all. Derive test cases
for your program based on decision-table approach, execute the test cases and discuss
the results.
8. Design, develop, code and run the program in any suitable language to solve the
commission problem. Analyze it from the perspective of decision table-based testing,
derive different test cases, execute these test cases and discuss the test results.
9. Design, develop, code and run the program in any suitable language to solve the
commission problem. Analyze it from the perspective of dataflow testing, derive
different test cases, execute these test cases and discuss the test results.
10. Design, develop, code and run the program in any suitable language to implement the
binary search algorithm. Determine the basis paths and using them derive different test
cases, execute these test cases and discuss the test results.
11. Design, develop, code and run the program in any suitable language to implement the
quicksort algorithm. Determine the basis paths and using them derive different test
cases, execute these test cases and discuss the test results.
12. Design, develop, code and run the program in any suitable language to implement an
absolute letter grading procedure, making suitable assumptions. Determine the basis
paths and using them derive different test cases, execute these test cases and discuss the
test results
Study Experiment / Project:
1. Design, develop, code and run the program in any suitable language to solve the triangle
problem. Analyze it from the perspective of dataflow testing, derive different test cases,
execute these test cases and discuss the test results.

2. Design, develop, code and run the program in any suitable language to solve the
Nextdate problem. Analyze it from the perspective of decision table-based testing,
derive different test cases, execute these test cases and discuss the test results.

Course outcomes: The students should be able to:

• List out the requirements for the given problem
• Design and implement the solution for given problem in any programming
language(C,C++,JAVA)
• Derive test cases for any given problem
• Apply the appropriate technique for the design of flow graph.
• Create appropriate document for the software artefact.
Conduction of Practical Examination:
1. All laboratory experiments are to be included for practical examination.
2. Students are allowed to pick one experiment from the lot.
3. Strictly follow the instructions as printed on the cover page of answer script for
breakup of marks
4. Procedure + Conduction + Viva: 35 + 35 + 10 (80)
5. Change of experiment is allowed only once and marks allotted to the procedure
part to be made zero
 FILE STRUCTURES LABORATORY WITH MINI PROJECT
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VI
Subject Code 15ISL68 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
• Apply the concepts of Unix IPC to implement a given function.
• Measure the performance of different file structures
• Write a program to manage operations on given file system.
• Demonstrate hashing and indexing techniques
Description (If any):
Design, develop, and implement the following programs
Lab Experiments:
PART A

1. Write a program to read series of names, one per line, from standard input and write
these names spelled in reverse order to the standard output using I/O redirection and
pipes. Repeat the exercise using an input file specified by the user instead of the
standard input and using an output file specified by the user instead of the standard
output.
2. Write a program to read and write student objects with fixed-length records and the
fields delimited by “|”. Implement pack ( ), unpack ( ), modify ( ) and search ( )
methods.
3. Write a program to read and write student objects with Variable - Length records
using any suitable record structure. Implement pack ( ), unpack ( ), modify ( ) and
search ( ) methods.
4. Write a program to write student objects with Variable - Length records using any
suitable record structure and to read from this file a student record using RRN.
5. Write a program to implement simple index on primary key for a file of student
objects. Implement add ( ), search ( ), delete ( ) using the index.
6. Write a program to implement index on secondary key, the name, for a file of
student objects. Implement add ( ), search ( ), delete ( ) using the secondary index.
7. Write a program to read two lists of names and then match the names in the two lists
using Consequential Match based on a single loop. Output the names common to
both the lists.
8. Write a program to read k Lists of names and merge them using k-way merge
algorithm with k = 8.
Part B --- Mini project:
Student should develop mini project on the topics mentioned below or similar applications
Document processing, transaction management, indexing and hashing, buffer
management, configuration management. Not limited to these.
Course outcomes: The students should be able to:
 • Implement operations related to files
• Apply the concepts of file system to produce the given application.
• Evaluate performance of various file systems on given parameters.
Conduction of Practical Examination:
1. All laboratory experiments from part A are to be included for practical
examination.
2. Mini project has to be evaluated for 30 Marks as per 6(b).
3. Report should be prepared in a standard format prescribed for project work.
4. Students are allowed to pick one experiment from the lot.
5. Strictly follow the instructions as printed on the cover page of answer script.
6. Marks distribution:
a) Part A: Procedure + Conduction + Viva:10 + 35 +5 =50 Marks
b) Part B: Demonstration + Report + Viva voce = 15+10+05 = 30 Marks
7. Change of experiment is allowed only once and marks allotted to the procedure
part to be made zero.
 WEB TECHNOLOGY AND ITS APPLICATIONS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS71 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course Objectives: This course will enable students to
• Illustrate the Semantic Structure of HTML and CSS
• Compose forms and tables using HTML and CSS
• Design Client-Side programs using JavaScript and Server-Side programs using PHP
• Infer Object Oriented Programming capabilities of PHP
• Examine JavaScript frameworks such as jQuery and Backbone
Module – 1 Teaching
Hours
Introduction to HTML, What is HTML and Where did it come from?, HTML 10 Hours
Syntax, Semantic Markup, Structure of HTML Documents, Quick Tour of
HTML Elements, HTML5 Semantic Structure Elements, Introduction to CSS,
What is CSS, CSS Syntax, Location of Styles, Selectors, The Cascade: How
Styles Interact, The Box Model, CSS Text Styling.
Module – 2
HTML Tables and Forms, Introducing Tables, Styling Tables, Introducing 10 Hours
Forms, Form Control Elements, Table and Form Accessibility, Microformats,
Advanced CSS: Layout, Normal Flow, Positioning Elements, Floating Elements,
Constructing Multicolumn Layouts, Approaches to CSS Layout, Responsive
Design, CSS Frameworks.
Module – 3
JavaScript: Client-Side Scripting, What is JavaScript and What can it do?, 10 Hours
JavaScript Design Principles, Where does JavaScript Go?, Syntax, JavaScript
Objects, The Document Object Model (DOM), JavaScript Events, Forms,
Introduction to Server-Side Development with PHP, What is Server-Side
Development, A Web Server’s Responsibilities, Quick Tour of PHP, Program
Control, Functions
Module – 4
PHP Arrays and Superglobals, Arrays, $_GET and $_POST Superglobal Arrays, 10 Hours
$_SERVER Array, $_Files Array, Reading/Writing Files, PHP Classes and
Objects, Object-Oriented Overview, Classes and Objects in PHP, Object
Oriented Design, Error Handling and Validation, What are Errors and
Exceptions?, PHP Error Reporting, PHP Error and Exception Handling
Module – 5
Managing State, The Problem of State in Web Applications, Passing Information 10 Hours
via Query Strings, Passing Information via the URL Path, Cookies, Serialization,
Session State, HTML5 Web Storage, Caching, Advanced JavaScript and jQuery,
JavaScript Pseudo-Classes, jQuery Foundations, AJAX, Asynchronous File
Transmission, Animation, Backbone MVC Frameworks, XML Processing and
Web Services, XML Processing, JSON, Overview of Web Services.
Course Outcomes:After studying this course, students will be able to
• Adapt HTML and CSS syntax and semantics to build web pages.
 • Construct and visually format tables and forms using HTML and CSS
• Develop Client-Side Scripts using JavaScript and Server-Side Scripts using PHP to
generate and display the contents dynamically.
• Appraise the principles of object oriented development using PHP
• Inspect JavaScript frameworks like jQuery and Backbone which facilitates developer
to focus on core features.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Randy Connolly, Ricardo Hoar, "Fundamentals of Web Development”, 1stEdition,
Pearson Education India. (ISBN:978-9332575271)
Reference Books:
1) Robin Nixon, “Learning PHP, MySQL &JavaScript with jQuery, CSS and
HTML5”, 4thEdition, O’Reilly Publications, 2015. (ISBN:978-9352130153)
2) Luke Welling, Laura Thomson, “PHP and MySQL Web Development”, 5th Edition,
Pearson Education, 2016. (ISBN:978-9332582736)
3) Nicholas C Zakas, “Professional JavaScript for Web Developers”, 3rd Edition,
Wrox/Wiley India, 2012. (ISBN:978-8126535088)
4) David Sawyer Mcfarland, “JavaScript & jQuery: The Missing Manual”, 1st
Edition, O’Reilly/Shroff Publishers & Distributors Pvt Ltd, 2014 (ISBN:978-
9351108078)
5) Zak Ruvalcaba Anne Boehm, “Murach's HTML5 and CSS3”, 3rdEdition,
Murachs/Shroff Publishers & Distributors Pvt Ltd, 2016. (ISBN:978-9352133246)
 SOFTWARE ARCHITECTURE AND DESIGN PATTERNS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15IS72 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Learn How to add functionality to designs while minimizing complexity.
• What code qualities are required to maintain to keep code flexible?
• To Understand the common design patterns.
• To explore the appropriate patterns for design problems
Module – 1 Teaching
Hours
Introduction: what is a design pattern? describing design patterns, the catalog of 10 Hours
design pattern, organizing the catalog, how design patterns solve design
problems, how to select a design pattern, how to use a design pattern. What is
object-oriented development? , key concepts of object oriented design other
related concepts, benefits and drawbacks of the paradigm
Module – 2
Analysis a System: overview of the analysis phase, stage 1: gathering the 10 Hours
requirements functional requirements specification, defining conceptual classes
and relationships, using the knowledge of the domain. Design and
Implementation, discussions and further reading.
Module – 3
Design Pattern Catalog: Structural patterns, Adapter, bridge, composite, 10 Hours
decorator, facade, flyweight, proxy.
Module – 4
Interactive systems and the MVC architecture: Introduction , The MVC 10 Hours
architectural pattern, analyzing a simple drawing program , designing the system,
designing of the subsystems, getting into implementation , implementing undo
operation , drawing incomplete items, adding a new feature , pattern based
solutions.
Module – 5
Designing with Distributed Objects: Client server system, java remote method 10 Hours
invocation, implementing an object oriented system on the web (discussions and
further reading) a note on input and output, selection statements, loops arrays.
Course outcomes: The students should be able to:
• Design and implement codes with higher performance and lower complexity
• Be aware of code qualities needed to keep code flexible
• Experience core design principles and be able to assess the quality of a design
with respect to these principles.
• Capable of applying these principles in the design of object oriented systems.
• Demonstrate an understanding of a range of design patterns. Be capable of
comprehending a design presented using this vocabulary.
• Be able to select and apply suitable patterns in specific contexts
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Object-oriented analysis, design and implementation, brahma dathan, sarnath
rammath, universities press,2013
2. Design patterns, erich gamma, Richard helan, Ralph johman , john vlissides
,PEARSON Publication,2013.
Reference Books:
1. Frank Bachmann, RegineMeunier, Hans Rohnert “Pattern Oriented Software
Architecture” –Volume 1, 1996.
2. William J Brown et al., "Anti-Patterns: Refactoring Software, Architectures and
Projects in Crisis", John Wiley, 1998.
 MACHINE LEARNING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS73 IA Marks 20
Number of Lecture Hours/Week 03 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course Objectives: This course will enable students to
• Define machine learning and problems relevant to machine learning.
• Differentiate supervised, unsupervised and reinforcement learning
• Apply neural networks, Bayes classifier and k nearest neighbor, for problems appear in
machine learning.
• Perform statistical analysis of machine learning techniques.
Module – 1 Teaching
Hours
Introduction: Well posed learning problems, Designing a Learning system, 10 Hours
Perspective and Issues in Machine Learning.
Concept Learning: Concept learning task, Concept learning as search, Find-S
algorithm, Version space, Candidate Elimination algorithm, Inductive Bias.
Text Book1, Sections: 1.1 – 1.3, 2.1-2.5, 2.7
Module – 2
Decision Tree Learning: Decision tree representation, Appropriate problems for 10 Hours
decision tree learning, Basic decision tree learning algorithm, hypothesis space search
in decision tree learning, Inductive bias in decision tree learning, Issues in decision
tree learning.
Text Book1, Sections: 3.1-3.7
Module – 3
Artificial Neural Networks: Introduction, Neural Network representation, 08 Hours
Appropriate problems, Perceptrons, Backpropagation algorithm.
Text book 1, Sections: 4.1 – 4.6
Module – 4
Bayesian Learning: Introduction, Bayes theorem, Bayes theorem and concept 10 Hours
learning, ML and LS error hypothesis, ML for predicting probabilities, MDL
principle, Naive Bayes classifier, Bayesian belief networks, EM algorithm
Text book 1, Sections: 6.1 – 6.6, 6.9, 6.11, 6.12
Module – 5
Evaluating Hypothesis: Motivation, Estimating hypothesis accuracy, Basics of 12 Hours
sampling theorem, General approach for deriving confidence intervals, Difference in
error of two hypothesis, Comparing learning algorithms.
Instance Based Learning: Introduction, k-nearest neighbor learning, locally
weighted regression, radial basis function, cased-based reasoning,
Reinforcement Learning: Introduction, Learning Task, Q Learning
Text book 1, Sections: 5.1-5.6, 8.1-8.5, 13.1-13.3
Course Outcomes:After studying this course, students will be able to
• Identify the problems for machine learning. And select the either supervised,
 unsupersvised or reinforcement learning.
• Explain theory of probability and statistics related to machine learning
• Investigate concept learning, ANN, Bayes classifier, k nearest neighbor, Q,
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Tom M. Mitchell, Machine Learning, India Edition 2013, McGraw Hill Education.
Reference Books:
1. Trevor Hastie, Robert Tibshirani, Jerome Friedman, h The Elements of Statistical
Learning, 2nd edition, springer series in statistics.
2. Ethem Alpaydın, Introduction to machine learning, second edition, MIT press.
 NATURAL LANGUAGE PROCESSING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS741 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Learn the techniques in natural language processing.
• Be familiar with the natural language generation.
• Be exposed to Text Mining.
• Understand the information retrieval techniques
Module – 1 Teaching
Hours
Overview and language modeling: Overview: Origins and challenges of NLP- 8 Hours
Language and Grammar-Processing Indian Languages- NLP Applications-
Information Retrieval. Language Modeling: Various Grammar- based Language
Models-Statistical Language Model.
Module – 2
Word level and syntactic analysis: Word Level Analysis: Regular Expressions- 8 Hours
Finite-State Automata-Morphological Parsing-Spelling Error Detection and
correction-Words and Word classes-Part-of Speech Tagging. Syntactic Analysis:
Context-free Grammar-Constituency- Parsing-Probabilistic Parsing.
Module – 3
Extracting Relations from Text: From Word Sequences to Dependency 8 Hours
Paths:
Introduction, Subsequence Kernels for Relation Extraction, A Dependency-Path
Kernel for Relation Extraction and Experimental Evaluation.
Mining Diagnostic Text Reports by Learning to Annotate Knowledge Roles:
Introduction, Domain Knowledge and Knowledge Roles, Frame Semantics and
Semantic Role Labeling, Learning to Annotate Cases with Knowledge Roles and
Evaluations.
A Case Study in Natural Language Based Web Search: InFact System
Overview, The GlobalSecurity.org Experience.
Module – 4
Evaluating Self-Explanations in iSTART: Word Matching, Latent Semantic 8 Hours
Analysis, and Topic Models: Introduction, iSTART: Feedback Systems,
iSTART: Evaluation of Feedback Systems,
Textual Signatures: Identifying Text-Types Using Latent Semantic Analysis
to Measure the Cohesion of Text Structures: Introduction, Cohesion, Coh-
Metrix, Approaches to Analyzing Texts, Latent Semantic Analysis, Predictions,
Results of Experiments.
Automatic Document Separation: A Combination of Probabilistic
Classification and Finite-State Sequence Modeling: Introduction, Related
Work, Data Preparation, Document Separation as a Sequence Mapping Problem,
Results.
Evolving Explanatory Novel Patterns for Semantically-Based Text Mining:
Related Work, A Semantically Guided Model for Effective Text Mining.
Module – 5
INFORMATION RETRIEVAL AND LEXICAL RESOURCES: Information 8 Hours
Retrieval: Design features of Information Retrieval Systems-Classical, Non
classical, Alternative Models of Information Retrieval – valuation Lexical
Resources: World Net-Frame Net- Stemmers-POS Tagger- Research Corpora.
Course outcomes: The students should be able to:
• Analyze the natural language text.
• Generate the natural language.
• Do Text mining.
• Apply information retrieval techniques.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and Information
Retrieval”, Oxford University Press, 2008.
2. Anne Kao and Stephen R. Poteet (Eds), “Natural LanguageProcessing and Text
Mining”, Springer-Verlag London Limited 2007.
Reference Books:
1. Daniel Jurafsky and James H Martin, “Speech and Language Processing:
Anintroduction to Natural Language Processing, Computational Linguistics and
SpeechRecognition”, 2nd Edition, Prentice Hall, 2008.
2. James Allen, “Natural Language Understanding”, 2nd edition,
Benjamin/Cummingspublishing company, 1995.
3. Gerald J. Kowalski and Mark.T. Maybury, “Information Storage and Retrieval
systems”, Kluwer academic Publishers, 2000.
 CLOUD COMPUTING AND ITS APPLICATIONS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS742 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Explain the fundamentals of cloud computing
• Illustrate the cloud application programming and aneka platform
• Contrast different cloud platforms used in industry
Module – 1 Teaching
Hours
Introduction ,Cloud Computing at a Glance, The Vision of Cloud Computing, 8 Hours
Defining a Cloud, A Closer Look, Cloud Computing Reference Model,
Characteristics and Benefits, Challenges Ahead, Historical Developments,
Distributed Systems, Virtualization, Web 2.0, Service-Oriented Computing,
Utility-Oriented Computing, Building Cloud Computing Environments,
Application Development, Infrastructure and System Development, Computing
Platforms and Technologies, Amazon Web Services (AWS), Google
AppEngine, Microsoft Azure, Hadoop, Force.com and Salesforce.com,
Manjrasoft Aneka
Virtualization, Introduction, Characteristics of Virtualized, Environments
Taxonomy of Virtualization Techniques, Execution Virtualization, Other Types
of Virtualization, Virtualization and Cloud Computing, Pros and Cons of
Virtualization, Technology Examples Xen: Paravirtualization, VMware: Full
Virtualization, Microsoft Hyper-V

Module – 2
Cloud Computing Architecture, Introduction, Cloud Reference Model, 8 Hours
Architecture, Infrastructure / Hardware as a Service, Platform as a Service,
Software as a Service, Types of Clouds, Public Clouds, Private Clouds, Hybrid
Clouds, Community Clouds, Economics of the Cloud, Open Challenges, Cloud
Definition, Cloud Interoperability and Standards Scalability and Fault Tolerance
Security, Trust, and Privacy Organizational Aspects
Aneka: Cloud Application Platform, Framework Overview, Anatomy of the
Aneka Container, From the Ground Up: Platform Abstraction Layer, Fabric
Services, foundation Services, Application Services, Building Aneka Clouds,
Infrastructure Organization, Logical Organization, Private Cloud Deployment
Mode, Public Cloud Deployment Mode, Hybrid Cloud Deployment Mode, Cloud
Programming and Management, Aneka SDK, Management Tools
Module – 3
Concurrent Computing: Thread Programming, Introducing Parallelism for Single 8 Hours
Machine Computation, Programming Applications with Threads, What is a
Thread?, Thread APIs, Techniques for Parallel Computation with Threads,
Multithreading with Aneka, Introducing the Thread Programming Model, Aneka
Thread vs. Common Threads, Programming Applications with Aneka Threads,
Aneka Threads Application Model, Domain Decomposition: Matrix
Multiplication, Functional Decomposition: Sine, Cosine, and Tangent.
High-Throughput Computing: Task Programming, Task Computing,
Characterizing a Task, Computing Categories, Frameworks for Task Computing,
Task-based Application Models, Embarrassingly Parallel Applications,
Parameter Sweep Applications, MPI Applications, Workflow Applications with
Task Dependencies, Aneka Task-Based Programming, Task Programming
Model, Developing Applications with the Task Model, Developing Parameter
Sweep Application, Managing Workflows.
Module – 4
Data Intensive Computing: Map-Reduce Programming, What is Data-Intensive 8 Hours
Computing?, Characterizing Data-Intensive Computations, Challenges Ahead,
Historical Perspective, Technologies for Data-Intensive Computing, Storage
Systems, Programming Platforms, Aneka MapReduce Programming, Introducing
the MapReduce Programming Model, Example Application
Module – 5
Cloud Platforms in Industry, Amazon Web Services, Compute Services, Storage 8 Hours
Services, Communication Services, Additional Services, Google AppEngine,
Architecture and Core Concepts, Application Life-Cycle, Cost Model,
Observations, Microsoft Azure, Azure Core Concepts, SQL Azure, Windows
Azure Platform Appliance.
Cloud Applications Scientific Applications, Healthcare: ECG Analysis in the
Cloud, Biology: Protein Structure Prediction, Biology: Gene Expression Data
Analysis for Cancer Diagnosis, Geoscience: Satellite Image Processing, Business
and Consumer Applications, CRM and ERP, Productivity, Social Networking,
Media Applications, Multiplayer Online Gaming.
Course outcomes: The students should be able to:
• Explain cloud computing, virtualization and classify services of cloud computing
• Illustrate architecture and programming in cloud
• Describe the platforms for development of cloud applications and List the application
of cloud.

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi Mastering
Cloud. Computing McGraw Hill Education
Reference Books:
1. Dan C. Marinescu, Cloud Computing Theory and Practice, Morgan Kaufmann,
Elsevier 2013.
 INFORMATION AND NETWORK SECURITY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS743 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Analyze the cryptographic processes.
• Summarize the digital security process.
• Indicate the location of a security process in the given system
Module – 1 Teaching
Hours
Introduction. How to Speak Crypto. Classic Crypto. Simple Substitution Cipher. 8 Hours
Cryptanalysis of a Simple Substitution. Definition of Secure. Double
Transposition Cipher. One-time Pad. Project VENONA. Codebook Cipher.
Ciphers of the Election of 1876. Modern Crypto History. Taxonomy of
Cryptography. Taxonomy of Cryptanalysis.
Module – 2.
What is a Hash Function? The Birthday Problem.Non-cryptographic Hashes. 8 Hours
Tiger Hash. HMAC. Uses of Hash Functions. Online Bids. Spam Reduction.
Other Crypto-Related Topics. Secret Sharing. Key Escrow. Random Numbers.
Texas Hold 'em Poker. Generating Random Bits. Information Hiding.
Module – 3
Random number generation Providing freshness Fundamentals of entity 8 Hours
authentication Passwords Dynamic password schemes Zero-knowledge
mechanisms Further reading Cryptographic Protocols Protocol basics From
objectives to a protocol Analysing a simple protocol Authentication and key
establishment protocols
Module – 4
Key management fundamentals Key lengths and lifetimes Key generation Key 8 Hours
establishment Key storage Key usage Governing key management Public-Key
Management Certification of public keys The certificate lifecycle Public-key
management models Alternative approaches
Module – 5
Cryptographic Applications Cryptography on the Internet Cryptography for 8 Hours
wireless local area networks Cryptography for mobile telecommunications
Cryptography for secure payment card transactions Cryptography for video
broadcasting Cryptography for identity cards Cryptography for home users
Course outcomes: The students should be able to:
• Analyze the Digitals security lapses
• Illustrate the need of key management
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Information Security: Principles and Practice, 2nd Edition by Mark Stamp Wiley
2. Everyday Cryptography: Fundamental Principles and Applications Keith M. Martin
Oxford Scholarship Online: December 2013
Reference Books:
1. Applied Cryptography Protocols, Algorithms, and Source Code in C by Bruce
Schneier
 UNIX SYSTEM PROGRAMMING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS744 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Explain the fundamental design of the unix operating system
• Familiarize with the systems calls provided in the unix environment
• Design and build an application/service over the unix operating system
Module – 1 Teaching
Hours
Introduction: UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO 8 Hours
C++ Standards, Difference between ANSI C and C++, The POSIX Standards,
The POSIX.1 FIPS Standard, The X/Open Standards. UNIX and POSIX APIs:
The POSIX APIs, The UNIX and POSIX Development Environment, API
Common Characteristics.
Module – 2
UNIX Files and APIs: File Types, The UNIX and POSIX File System, The 8 Hours
UNIX and POSIX File Attributes, Inodes in UNIX System V, Application
Program Interface to Files, UNIX Kernel Support for Files, Relationship of C
Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links.
UNIX File APIs: General File APIs, File and Record Locking, Directory File
APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs.
Module – 3
UNIX Processes and Process Control: The Environment of a UNIX Process: 8 Hours
Introduction, main function, Process Termination, Command-Line Arguments,
Environment List, Memory Layout of a C Program, Shared Libraries, Memory
Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit,
setrlimit Functions, UNIX Kernel Support for Processes. Process Control:
Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4
Functions, Race Conditions, exec Functions, Changing User IDs and Group
IDs, Interpreter Files, system Function, Process Accounting, User Identification,
Process Times, I/O Redirection. Process Relationships: Introduction, Terminal
Logins, Network Logins, Process Groups, Sessions, Controlling Terminal,
tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs,
Orphaned Process Groups.
Module – 4
Signals and Daemon Processes: Signals: The UNIX Kernel Support for Signals, 8 Hours
signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function,
The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb
Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules,
Error Logging, Client-Server Model.
Module – 5
Interprocess Communication : Overview of IPC Methods, Pipes, popen, pclose 8 Hours
Functions, Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores.
Shared Memory, Client-Server Properties, Stream Pipes, Passing File
Descriptors, An Open Server-Version 1, Client-Server Connection Functions.
Course outcomes: The students should be able to:
• Ability to understand and reason out the working of Unix Systems
• Build an application/service over a Unix system.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Unix System Programming Using C++ - Terrence Chan, PHI, 1999.
2. Advanced Programming in the UNIX Environment - W.Richard Stevens, Stephen A.
Rago, 3nd Edition, Pearson Education / PHI, 2005.
Reference Books:
1. Advanced Unix Programming- Marc J. Rochkind, 2nd Edition, Pearson Education,
2005.
2. The Design of the UNIX Operating System - Maurice.J.Bach, Pearson Education /
PHI, 1987.
3. Unix Internals - Uresh Vahalia, Pearson Education, 2001.
 SOFT AND EVOLUTIONARY COMPUTING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS751 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Familiarize with the basic concept of soft computing and intelligent systems
• Compare with various intelligent systems
• Analyze the various soft computing techniques
Module – 1 Teaching
Hours
Introduction to soft computing: ANN, FS,GA, SI, ES, Comparing among 8 Hours
intelligent systems
ANN: introduction, biological inspiration, BNN&ANN, classification, first
Generation NN, perceptron, illustrative problems
Text Book 1: Chapter1: 1.1-1.8, Chapter2: 2.1-2.6
Module – 2
Adaline, Medaline, ANN: (2nd generation), introduction, BPN, KNN,HNN, 8 Hours
BAM, RBF,SVM and illustrative problems
Text Book 1: Chapter2: 3.1,3.2,3.3,3.6,3.7,3.10,3.11
Module – 3
Fuzzy logic: introduction, human learning ability, undecidability, probability 8 Hours
theory, classical set and fuzzy set, fuzzy set operations, fuzzy relations, fuzzy
compositions, natural language and fuzzy interpretations, structure of fuzzy
inference system, illustrative problems
Text Book 1: Chapter 5
Module – 4
Introduction to GA, GA, procedures, working of GA, GA applications, 8 Hours
applicability, evolutionary programming, working of EP, GA based Machine
learning classifier system, illustrative problems
Text Book 1: Chapter 7
Module – 5
Swarm Intelligent system: Introduction, Background of SI, Ant colony system 8 Hours
Working of ACO, Particle swarm Intelligence(PSO).
Text Book 1: 8.1-8.4, 8.7
Course outcomes: The students should be able to:
• Understand soft computing techniques
• Apply the learned techniques to solve realistic problems
• Differentiate soft computing with hard computing techniques
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Soft computing : N. P Padhy and S P Simon , Oxford University Press 2015
Reference Books:
1. Principles of Soft Computing, Shivanandam, Deepa S. N Wiley India, ISBN
13: 2011
 COMPUTER VISION AND ROBOTICS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS752 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Review image processing techniques for computer vision
• Explain shape and region analysis
• Illustrate Hough Transform and its applications to detect lines, circles, ellipses
• Contrast three-dimensional image analysis techniques, motion analysis and
applications of computer vision algorithms
Module – 1 Teaching
Hours
CAMERAS: Pinhole Cameras, Radiometry – Measuring Light: Light in 8 Hours
Space, Light Surfaces, Important Special Cases, Sources, Shadows, And
Shading: Qualitative Radiometry, Sources and Their Effects, Local Shading
Models, Application: Photometric Stereo, Interreflections: Global Shading
Models, Color: The Physics of Color, Human Color Perception, Representing
Color, A Model for Image Color, Surface Color from Image Color.
Module – 2
Linear Filters: Linear Filters and Convolution, Shift Invariant Linear Systems, 8 Hours
Spatial Frequency and Fourier Transforms, Sampling and Aliasing, Filters as
Templates, Edge Detection: Noise, Estimating Derivatives, Detecting Edges,
Texture: Representing Texture, Analysis (and Synthesis) Using Oriented
Pyramids, Application: Synthesis by Sampling Local Models, Shape from
Texture.
Module – 3
The Geometry of Multiple Views: Two Views, Stereopsis: Reconstruction, 8 Hours
Human Stereposis, Binocular Fusion, Using More Cameras, Segmentation by
Clustering: What Is Segmentation?, Human Vision: Grouping and Getstalt,
Applications: Shot Boundary Detection and Background Subtraction, Image
Segmentation by Clustering Pixels, Segmentation by Graph-Theoretic Clustering,
Module – 4
Segmentation by Fitting a Model: The Hough Transform, Fitting Lines, Fitting 8 Hours
Curves, Fitting as a Probabilistic Inference Problem, Robustness, Segmentation
and Fitting Using Probabilistic Methods: Missing Data Problems, Fitting, and
Segmentation, The EM Algorithm in Practice, Tracking With Linear Dynamic
Models: Tracking as an Abstract Inference Problem, Linear Dynamic Models,
Kalman Filtering, Data Association, Applications and Examples.
Module – 5
Geometric Camera Models: Elements of Analytical Euclidean Geometry, 8 Hours
Camera Parameters and the Perspective Projection, Affine Cameras and Affine
Projection Equations, Geometric Camera Calibration: Least-Squares
Parameter Estimation, A Linear Approach to Camera Calibration, Taking Radial
Distortion into Account, Analytical Photogrammetry, An Application: Mobile
Robot Localization, Model- Based Vision: Initial Assumptions, Obtaining
Hypotheses by Pose Consistency, Obtaining Hypotheses by pose Clustering,
Obtaining Hypotheses Using Invariants, Verification, Application: Registration
In Medical Imaging Systems, Curved Surfaces and Alignment.
Course outcomes: The students should be able to:
• Implement fundamental image processing techniques required for computer vision
• Perform shape analysis
• Implement boundary tracking techniques
• Apply chain codes and other region descriptors
• Apply Hough Transform for line, circle, and ellipse detections.
• Apply 3D vision techniques.
• Implement motion related techniques.
• Develop applications using computer vision techniques.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. David A. Forsyth and Jean Ponce: Computer Vision – A Modern Approach, PHI
Learning (Indian Edition), 2009.
Reference Books:
2. E. R. Davies: Computer and Machine Vision – Theory, Algorithms and Practicalities,
Elsevier (Academic Press), 4th edition, 2013.
 INFORMATION MANAGEMENT SYSTEM
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15IS753 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Explain the Role of information management system in business
• Evaluate the role of the major types of information systems in a business
environment and their relationship to each other
Module – 1 Teaching
Hours
Information Systems in Business : Introduction, The real world of Information 08 Hours
Systems, Networks, What you need to know, The fundamental role of IS in
business, Trends in IS, Managerial challenges of IT. System Concepts: A
foundation, Components of an Information System, Information System
Resources, Information System activities, Recognizing Information Systems.
Fundamentals of strategic advantages: Strategic IT, Competitive strategy
concepts, The competitive advantage of IT, Strategic uses of IT, Building a
customer-focused business, The value chain and strategic IS, Reengineering
business processes, Becoming an agile company Creating a virtual company,
Building a knowledge-creating company.
Module – 2
Enterprise Business Systems: Introduction, Cross-functional enterprise 08 Hours
applications, Enterprise application integration, Transaction processing systems,
Enterprise collaboration systems. Functional Business Systems: Introduction,
Marketing systems, Manufacturing systems, Human resource systems,
Accounting systems, Financial management systems.
Module – 3
Customer relationship management: Introduction, What is CRM? The three 08 Hours
phases of CRM, Benefits and challenges of CRM, Trends in CRM Enterprise
resource planning: Introduction, What is ERP? Benefits and challenges of ERP,
Trends in ERP. Supply chain Management: Introduction, What is SCM? The role
of SCM, Benefits and challenges of SCM, Trends in SCM.
Module – 4
Electronic commerce fundamentals: Introduction, The scope of ecommerce, 08 Hours
Essential e-commerce, processes, Electronic payment processes. e-Commerce
applications and issues: E-commerce application trends, Business-to- Consumer
e-commerce, Web store requirements, Business-to- Business e-commerce, e-
commerce marketplaces, Clicks and bricks in ecommerce
Module – 5
Decision support in business: Introduction, Decision support trends, Decision 08 Hours
support systems (DSS), Management Information Systems, Online analytical
processing, Using DSS, Executive information systems, Enterprise portals and
decision support, Knowledge management systems, Business and Artificial
Intelligence (AI), An overview of AI, Expert systems.
Course outcomes: The students should be able to:
 • Describe the role of information technology and information systems in business
• Record the current issues of information technology and relate those issues to the firm
• Interpret how to use information technology to solve business problems
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. James A.O’Brien, George M Marakas, Management Information Systems, 7th
Edition, Tata McGrawHill. Chapter: 1, 2, 7 , 8 ,9 ,13
Reference Books:
2. Kenneth C. Laudon and Jane P.Laudon, Management Information System, Managing
the Digital Firm, 9th Edition, Pearson Education.
3. Steven Alter, Information Systems the Foundation of E-Business, 4th Edition, Pearson
Education.
4. W.S.Jawadekar, Management Information System, Tata McGraw Hill
 STORAGE AREA NETWORKS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CS754 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Evaluate storage architectures,
• Define backup, recovery, disaster recovery, business continuity, and replication
• Examine emerging technologies including IP-SAN
• Understand logical and physical components of a storage infrastructure
• Identify components of managing and monitoring the data center
• Define information security and identify different storage virtualization technologies
Module – 1 Teaching
Hours
Storage System Introduction to evolution of storage architecture, key data center 8 Hours
elements, virtualization, and cloud computing. Key data center elements – Host
(or compute), connectivity, storage, and application in both classic and virtual
environments. RAID implementations, techniques, and levels along with the
impact of RAID on application performance.Components of intelligent storage
systems and virtual storage provisioning and intelligent storage system
implementations.
Module – 2
Storage Networking Technologies and Virtualization Fibre Channel SAN 8 Hours
components, connectivity options, and topologies including access protection
mechanism ‘zoning”, FC protocol stack, addressing and operations, SAN-based
virtualization and VSAN technology, iSCSI and FCIP protocols for storage
access over IP network, Converged protocol FCoE and its components, Network
Attached Storage (NAS) - components, protocol and operations, File level
storage virtualization, Object based storage and unified storage platform.
Module – 3
Backup, Archive, and Replication This unit focuses on information availability 8 Hours
and business continuity solutions in both virtualized and non-virtualized
environments. Business continuity terminologies, planning and solutions,
Clustering and multipathing architecture to avoid single points of failure, Backup
and recovery - methods, targets and topologies, Data deduplication and backup in
virtualized environment, Fixed content and data archive, Local replication in
classic and virtual environments, Remote replication in classic and virtual
environments, Three-site remote replication and continuous data protection
Module – 4
Cloud Computing Characteristics and benefits This unit focuses on the 8 Hours
business drivers, definition, essential characteristics, and phases of journey to the
Cloud. ,Business drivers for Cloud computing, Definition of Cloud computing,
Characteristics of Cloud computing, Steps involved in transitioning from Classic
data center to Cloud computing environment Services and deployment models,
Cloud infrastructure components, Cloud migration considerations
Module – 5
Securing and Managing Storage Infrastructure This chapter focuses on 8 Hours
framework and domains of storage security along with covering security.
implementation at storage networking. Security threats, and countermeasures in
various domains Security solutions for FC-SAN, IP-SAN and NAS
environments, Security in virtualized and cloud environments, Monitoring and
managing various information infrastructure components in classic and virtual
environments, Information lifecycle management (ILM) and storage tiering,
Cloud service management activities
Course outcomes: The students should be able to:
• Identify key challenges in managing information and analyze different storage
networking technologies and virtualization
• Explain components and the implementation of NAS
• Describe CAS architecture and types of archives and forms of virtualization
• Ilustrate the storage infrastructure and management activities
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Information Storage and Management,Author :EMC Education Services, Publisher:
Wiley ISBN: 9781118094839
2. Storage Virtualization, Author: Clark Tom, Publisher: Addison Wesley Publishing
Company ISBN : 9780321262516
Reference Books:
NIL
 MACHINE LEARNING LABORATORY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CSL76 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
1. Make use of Data sets in implementing the machine learning algorithms
2. Implement the machine learning concepts and algorithms in any suitable language of
choice.
Description (If any):
1. The programs can be implemented in either JAVA or Python.
2. For Problems 1 to 6 and 10, programs are to be developed without using the built-in
classes or APIs of Java/Python.
3. Data sets can be taken from standard repositories
(https://archive.ics.uci.edu/ml/datasets.html) or constructed by the students.
Lab Experiments:
1. Implement and demonstratethe FIND-Salgorithm for finding the most specific
hypothesis based on a given set of training data samples. Read the training data from a
.CSV file.
2. For a given set of training data examples stored in a .CSV file, implement and
demonstrate the Candidate-Elimination algorithmto output a description of the set
of all hypotheses consistent with the training examples.
3. Write a program to demonstrate the working of the decision tree based ID3
algorithm. Use an appropriate data set for building the decision tree and apply this
knowledge toclassify a new sample.
4. Build an Artificial Neural Network by implementing the Backpropagation
algorithm and test the same using appropriate data sets.
5. Write a program to implement the naïve Bayesian classifier for a sample training
data set stored as a .CSV file. Compute the accuracy of the classifier, considering few
test data sets.
6. Assuming a set of documents that need to be classified, use the naïve Bayesian
Classifier model to perform this task. Built-in Java classes/API can be used to write
the program. Calculate the accuracy, precision, and recall for your data set.
7. Write a program to construct aBayesian network considering medical data. Use this
model to demonstrate the diagnosis of heart patients using standard Heart Disease
Data Set. You can use Java/Python ML library classes/API.
8. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data
set for clustering using k-Means algorithm. Compare the results of these two
algorithms and comment on the quality of clustering. You can add Java/Python ML
library classes/API in the program.
9. Write a program to implement k-Nearest Neighbour algorithm to classify the iris
data set. Print both correct and wrong predictions. Java/Python ML library classes can
be used for this problem.
10. Implement the non-parametric Locally Weighted Regressionalgorithm in order to
fit data points. Select appropriate data set for your experiment and draw graphs.
Study Experiment / Project:
NIL
Course outcomes: The students should be able to:
1. Understand the implementation procedures for the machine learning algorithms.
2. Design Java/Python programs for various Learning algorithms.
3. Applyappropriate data sets to the Machine Learning algorithms.
4. Identify and apply Machine Learning algorithms to solve real world problems.
Conduction of Practical Examination:
• All laboratory experiments are to be included for practical examination.
• Students are allowed to pick one experiment from the lot.
• Strictly follow the instructions as printed on the cover page of answer script
• Marks distribution: Procedure + Conduction + Viva:20 + 50 +10 (80)
Change of experiment is allowed only once and marks allotted to the procedure part to
be made zero.
 WEB TECHNOLOGY LABORATORY WITH MINI PROJECT
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VII
Subject Code 15CSL77 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to
1. Design and develop static and dynamic web pages.
2. Familiarize with Client-Side Programming, Server-Side Programming, Active server
Pages.
3. Learn Database Connectivity to web applications.

Description (If any):

NIL
Lab Experiments:
PART A
1. Write a JavaScript to design a simple calculator to perform the following operations:
sum, product, difference and quotient.
2. Write a JavaScript that calculates the squares and cubes of the numbers from 0 to 10
and outputs HTML text that displays the resulting values in an HTML table format.
3. Write a JavaScript code that displays text “TEXT-GROWING” with increasing font
size in the interval of 100ms in RED COLOR, when the font size reaches 50pt it
displays “TEXT-SHRINKING” in BLUE color. Then the font size decreases to 5pt.
4. Develop and demonstrate a HTML5 file that includes JavaScript script that uses
functions for the following problems:
a. Parameter: A string
b. Output: The position in the string of the left-most vowel
c. Parameter: A number
d. Output: The number with its digits in the reverse order
5. Design an XML document to store information about a student in an engineering
college affiliated to VTU. The information must include USN, Name, and Name of
the College, Branch, Year of Joining, and email id. Make up sample data for 3
students. Create a CSS style sheet and use it to display the document.
6. Write a PHP program to keep track of the number of visitors visiting the web page
and to display this count of visitors, with proper headings.
7. Write a PHP program to display a digital clock which displays the current time of the
server.
8. Write the PHP programs to do the following:
a. Implement simple calculator operations.
b. Find the transpose of a matrix.
c. Multiplication of two matrices.
d. Addition of two matrices.
 9. Write a PHP program named states.py that declares a variable states with value
"Mississippi Alabama Texas Massachusetts Kansas". write a PHP program that does
the following:
a. Search for a word in variable states that ends in xas. Store this word in element
0 of a list named statesList.
b. Search for a word in states that begins with k and ends in s. Perform a case-
insensitive comparison. [Note: Passing re.Ias a second parameter to method
compile performs a case-insensitive comparison.] Store this word in element1
of statesList.
c. Search for a word in states that begins with M and ends in s. Store this
word in element 2 of the list.
d. Search for a word in states that ends in a. Store this word in element 3 of the
list.
10. Write a PHP program to sort the student records which are stored in the database
using selection sort.
Study Experiment / Project:
Develop a web application project using the languages and concepts learnt in the theory and
exercises listed in part A with a good look and feel effects. You can use any web technologies
and frameworks and databases.

Note:
1. In the examination each student picks one question from part A.

2. A team of two or three students must develop the mini project. However during
the examination, each student must demonstrate the project individually.

3. The team must submit a brief project report (15-20 pages) that must include the
following
a. Introduction
b. Requirement Analysis
c. Software Requirement Specification
d. Analysis and Design
e. Implementation
f. Testing

Course outcomes: The students should be able to:

• Design and develop dynamic web pages with good aesthetic sense of designing
and latest technical know-how's.
• Have a good understanding of Web Application Terminologies, Internet Tools
other web services.
• Learn how to link and publish web sites
Conduction of Practical Examination:
1. All laboratory experiments from part A are to be included for practical
examination.
 2. Mini project has to be evaluated for 30 Marks.
3. Report should be prepared in a standard format prescribed for project work.
4. Students are allowed to pick one experiment from the lot.
5. Strictly follow the instructions as printed on the cover page of answer script.
6. Marks distribution:
a) Part A: Procedure + Conduction + Viva:10 + 35 +5 =50 Marks
b) Part B: Demonstration + Report + Viva voce = 15+10+05 = 30 Marks
Change of experiment is allowed only once and marks allotted to the procedure part to be
made zero.
 INTERNET OF THINGS TECHNOLOGY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CS81 IA Marks 20
Number of Lecture Hours/Week 04 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course Objectives:This course will enable students to
• Assess the genesis and impact of IoT applications, architectures in real world.
• Illustrate diverse methods of deploying smart objects and connect them to network.
• Compare different Application protocols for IoT.
• Infer the role of Data Analytics and Security in IoT.
• Identifysensor technologies for sensing real world entities and understand the role of IoT in
various domains of Industry.
Module – 1 Teaching
Hours
What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact, Convergence of IT and 10 Hours
IoT, IoT Challenges, IoT Network Architecture and Design, Drivers Behind New
Network Architectures, Comparing IoT Architectures, A Simplified IoT Architecture,
The Core IoT Functional Stack, IoT Data Management and Compute Stack.
Module – 2
Smart Objects: The “Things” in IoT, Sensors, Actuators, and Smart Objects, Sensor 10 Hours
Networks, Connecting Smart Objects, Communications Criteria, IoT Access
Technologies.
Module – 3
IP as the IoT Network Layer, The Business Case for IP, The need for Optimization, 10 Hours
Optimizing IP for IoT, Profiles and Compliances, Application Protocols for IoT, The
Transport Layer, IoT Application Transport Methods.
Module – 4
Data and Analytics for IoT, An Introduction to Data Analytics for IoT, Machine 10 Hours
Learning, Big Data Analytics Tools and Technology, Edge Streaming Analytics,
Network Analytics, Securing IoT, A Brief History of OT Security, Common Challenges
in OT Security, How IT and OT Security Practices and Systems Vary, Formal Risk
Analysis Structures: OCTAVE and FAIR, The Phased Application of Security in an
Operational Environment
Module – 5
IoT Physical Devices and Endpoints - Arduino UNO: Introduction to Arduino, Arduino 10 Hours
UNO, Installing the Software, Fundamentals of Arduino Programming. IoT
Physical Devices and Endpoints - RaspberryPi: Introduction to RaspberryPi, About the
RaspberryPi Board: Hardware Layout, Operating Systems on RaspberryPi, Configuring
RaspberryPi, Programming RaspberryPi with Python, Wireless Temperature Monitoring
System Using Pi, DS18B20 Temperature Sensor, Connecting Raspberry Pi via SSH,
Accessing Temperature from DS18B20 sensors, Remote access to RaspberryPi, Smart
and Connected Cities, An IoT Strategy for Smarter Cities, Smart City IoT Architecture,
Smart City Security Architecture, Smart City Use-Case Examples.
Course Outcomes:After studying this course, students will be able to
• Interpret the impact and challenges posed by IoT networks leading to new architectural
models.
• Compare and contrast the deployment of smart objects and the technologies to connect them
to network.
• Appraise the role of IoT protocols for efficient network communication.
• Elaborate the need for Data Analytics and Security in IoT.
• Illustrate different sensor technologies for sensing real world entities and identify the
applications of IoT in Industry.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton, Jerome Henry,"IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
Things”, 1stEdition, Pearson Education (Cisco Press Indian Reprint). (ISBN: 978-
9386873743)
2. Srinivasa K G, “Internet of Things”,CENGAGE Leaning India, 2017

Reference Books:
1. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-on-Approach)”,
1stEdition, VPT, 2014. (ISBN: 978-8173719547)
2. Raj Kamal, “Internet of Things: Architecture and Design Principles”, 1st Edition,
McGraw Hill Education, 2017. (ISBN: 978-9352605224)
 BIG DATA ANALYTICS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CS82 IA Marks 20
Number of Lecture Hours/Week 4 Exam Marks 80
Total Number of Lecture Hours 50 Exam Hours 03
CREDITS – 04
Course objectives: This course will enable students to
• Understand Hadoop Distributed File system and examine MapReduce Programming
• Explore Hadoop tools and manage Hadoop with Ambari
• Appraise the role of Business intelligence and its applications across industries
• Assess core data mining techniques for data analytics
• Identify various Text Mining techniques
Module – 1 Teaching
Hours
Hadoop Distributed File System Basics, Running Example Programs and 10 Hours
Benchmarks, Hadoop MapReduce Framework, MapReduce Programming
Module – 2
Essential Hadoop Tools, Hadoop YARN Applications, Managing Hadoop with 10 Hours
Apache Ambari, Basic Hadoop Administration Procedures
Module – 3
Business Intelligence Concepts and Application, Data Warehousing, Data 10 Hours
Mining, Data Visualization
Module – 4
Decision Trees, Regression, Artificial Neural Networks, Cluster Analysis, 10 Hours
Association Rule Mining
Module – 5
Text Mining, Naïve-Bayes Analysis, Support Vector Machines, Web Mining, 10 Hours
Social Network Analysis
Course outcomes: The students should be able to:
• Master the concepts of HDFS and MapReduce framework
• Investigate Hadoop related tools for Big Data Analytics and perform basic Hadoop
Administration
• Recognize the role of Business Intelligence, Data warehousing and Visualization in
decision making
• Infer the importance of core data mining techniques for data analytics
• Compare and contrast different Text Mining Techniques
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Douglas Eadline,"Hadoop 2 Quick-Start Guide: Learn the Essentials of Big Data
Computing in the Apache Hadoop 2 Ecosystem", 1stEdition, Pearson Education,
2016. ISBN-13: 978-9332570351
 2. Anil Maheshwari, “Data Analytics”, 1st Edition, McGraw Hill Education, 2017.
ISBN-13: 978-9352604180
Reference Books:
1) Tom White, “Hadoop: The Definitive Guide”, 4th Edition, O’Reilly Media,
2015.ISBN-13: 978-9352130672
2) Boris Lublinsky, Kevin T.Smith, Alexey Yakubovich,"Professional Hadoop
Solutions", 1stEdition, Wrox Press, 2014ISBN-13: 978-8126551071
3) Eric Sammer,"Hadoop Operations: A Guide for Developers and
Administrators",1stEdition, O'Reilly Media, 2012.ISBN-13: 978-9350239261
 HIGH PERFORMANCE COMPUTING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CS831 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Introduce students the design, analysis, and implementation, of high performance
computational science and engineering applications.
• Illustrate on advanced computer architectures, parallel algorithms, parallel languages,
and performance-oriented computing.
Module – 1 Teaching
Hours
Introduction: Computational Science and Engineering: Computational 10 Hours
Science and Engineering Applications; characteristics and requirements, Review
of Computational Complexity, Performance: metrics and measurements,
Granularity and Partitioning, Locality: temporal/spatial/stream/kernel, Basic
methods for parallel programming, Real-world case studies (drawn from multi-
scale, multi-discipline applications)
Module – 2
High-End Computer Systems : Memory Hierarchies, Multi-core Processors: 10 Hours
Homogeneous and Heterogeneous, Shared-memory Symmetric Multiprocessors,
Vector Computers, Distributed Memory Computers, Supercomputers and
Petascale Systems, Application Accelerators / Reconfigurable Computing, Novel
computers: Stream, multithreaded, and purpose-built
Module – 3
Parallel Algorithms: Parallel models: ideal and real frameworks, Basic 10 Hours
Techniques: Balanced Trees, Pointer Jumping, Divide and Conquer, Partitioning,
Regular Algorithms: Matrix operations and Linear Algebra, Irregular Algorithms:
Lists, Trees, Graphs, Randomization: Parallel Pseudo-Random Number
Generators, Sorting, Monte Carlo techniques
Module – 4
Parallel Programming: Revealing concurrency in applications, Task and 10 Hours
Functional Parallelism, Task Scheduling, Synchronization Methods, Parallel
Primitives (collective operations), SPMD Programming (threads, OpenMP, MPI),
I/O and File Systems, Parallel Matlabs (Parallel Matlab, Star-P, Matlab MPI),
Partitioning Global Address Space (PGAS) languages (UPC, Titanium, Global
Arrays)
Module – 5
Achieving Performance: Measuring performance, Identifying performance 10 Hours
bottlenecks, Restructuring applications for deep memory hierarchies, Partitioning
applications for heterogeneous resources, using existing libraries, tools, and
frameworks
Course outcomes: The students should be able to:
• Illustrate the key factors affecting performance of CSE applications, and
• Make mapping of applications to high-performance computing systems, and
 • Apply hardware/software co-design for achieving performance on real-world
applications
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Introduction to Parallel Computing, AnanthGrama, Anshul Gupta, George Karypis,
and Vipin Kumar, 2nd edition, Addison-Welsey, 2003.
2. Petascale Computing: Algorithms and Applications, David A. Bader (Ed.), Chapman
& Hall/CRC Computational Science Series, 2007
Reference Books:
1. Grama, A. Gupta, G. Karypis, V. Kumar, An Introduction to Parallel Computing,
Design and Analysis of Algorithms: 2/e, Addison-Wesley, 2003.
2. G.E. Karniadakis, R.M. Kirby II, Parallel Scientific Computing in C++ and MPI: A
Seamless Approach to Parallel Algorithms and their Implementation, Cambridge
University Press,2003.
3. Wilkinson and M. Allen, Parallel Programming: Techniques and Applications Using
Networked Workstations and Parallel Computers, 2/E, Prentice Hall, 2005.
4. M.J. Quinn, Parallel Programming in C with MPI and OpenMP, McGraw-Hill, 2004.
5. G.S. Almasi and A. Gottlieb, Highly Parallel Computing, 2/E, Addison-Wesley, 1994.
6. David Culler Jaswinder Pal Singh,"Parallel Computer Architecture: A
hardware/Software Approach", Morgan Kaufmann, 1999.
7. Kai Hwang, "Scalable Parallel Computing", McGraw Hill 1998.
 INTERFACE DESIGN
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15IS832 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• To study the concept of menus, windows, interfaces
• To study about business functions
• To study the characteristics and components of windows andthe various controls for
the windows.
• To study about various problems in windows design with color, text, graphics.
• To study the testing methods
Module – 1 Teaching
Hours
Introduction-Importance-Human-Computer interface-characteristics of graphics 10 Hours
interface-Direct manipulation graphical system - web user interface-popularity-
characteristic & principles.
Module – 2
User interface design process- obstacles-usability-human characteristics in design 10 Hours
- Human interaction speed-business functions-requirement analysis-Direct-
Indirect methods-basic business functions-Design standards-system timings -
Human consideration in screen design - structures of menus - functions of menus-
contents of menu-formatting -phrasing the menu - selecting menu choice-
navigating menus-graphical menus.
Module – 3
Windows: Characteristics-components-presentation styles-types-managements- 10 Hours
organizations-operations-web systems-device-based controls: characteristics-
Screen -based controls: operate control - text boxes-selection control-
combination control-custom control-presentation control.
Module – 4
Text for web pages - effective feedback-guidance & assistance- 10 Hours
Internationalization-accessibility -Icons-Image-Multimedia-coloring.
Module – 5
Windows layout-test :prototypes - kinds of tests - retest - Information search - 10 Hours
visualization - Hypermedia - www - Software tools.
Course outcomes: The students should be able to:
• Design the user interface, design, menu creation and windows creation and
connection between menu and windows
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Wilbent. O. Galitz ,"The Essential Guide to User Interface Design", John Wiley&
 Sons, 2001.
Reference Books:
1. Ben Sheiderman, "Design the User Interface", Pearson Education, 1998.
2. Alan Cooper, "The Essential of User Interface Design", Wiley - Dream Tech Ltd.,
2002.
 VIRTUAL REALITY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15IS833 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Explain understanding of this technology, underlying principles, its potential and
limits and to learn about the criteria for defining useful applications.
• Illustrate process of creating virtual environments
Module – 1 Teaching
Hours
Introduction : The three I’s of virtual reality, commercial VR technology and the 10 Hours
five classic components of a VR system.
Input Devices : (Trackers, Navigation, and Gesture Interfaces): Three-
dimensional position trackers, navigation and manipulation, interfaces and
gesture interfaces.
Text book1: 1.1, 1.3, 1.5, 2.1, 2.2 and 2.3
Module – 2
Output Devices: Graphics displays, sound displays & haptic feedback. 10 Hours
Text book1: 3.1,3.2 and 3.3
Module – 3
Modeling : Geometric modeling, kinematics modeling, physical modeling, 10 Hours
behaviour modeling, model management.
Text book1: 5.1, 5.2 and 5.3, 5.4 and 5.5
Module – 4
Human Factors: Methodology and terminology, user performance studies, VR 10 Hours
health and safety issues.
Text book1: 7.1, 7.2 and 7.3
Module – 5
Applications: Medical applications, military applications, robotics applications. 10 Hours
Text book1: 8.1, 8.3 and 9.2
Course outcomes: The students should be able to:
• Illustrate technology, underlying principles, its potential and limits and to learn about
the criteria for defining useful applications.
• Explain process of creating virtual environments
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Virtual Reality Technology, Second Edition, Gregory C. Burdea & Philippe Coiffet,
John Wiley & Sons
Reference Books:
 SYSTEM MODELLING AND SIMULATION
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CS834 IA Marks 20
Number of Lecture Hours/Week 3 Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS – 03
Course objectives: This course will enable students to
• Explain the basic system concept and definitions of system;
• Discuss techniques to model and to simulate various systems;
• Analyze a system and to make use of the information to improve the performance.
Module – 1 Teaching
Hours
Introduction: When simulation is the appropriate tool and when it is not 10 Hours
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 Simulation examples: Simulation of queuing systems. General
Principles, Simulation Software:Concepts in Discrete-Event Simulation. The
Event-Scheduling / Time-Advance Algorithm, Manual simulation Using Event
Scheduling
Module – 2
Statistical Models in Simulation :Review of terminology and concepts, Useful 10 Hours
statistical models,Discrete distributions. Continuous distributions,Poisson
process, Empirical distributions.
Queuing Models:Characteristics of queuing systems,Queuing notation,Long-run
measures of performance of queuing systems,Long-run measures of performance
of queuing systems cont…,Steady-state behavior of M/G/1 queue, Networks of
queues,
Module – 3
Random-NumberGeneration:Properties of random numbers; Generation of 10 Hours
pseudo-random numbers, Techniques for generating random numbers,Tests for
Random Numbers, Random-Variate Generation: ,Inverse transform technique
Acceptance-Rejection technique.
Module – 4
Input Modeling: Data Collection; Identifying the distribution with data, 10 Hours
Parameter estimation, Goodness of Fit Tests, Fitting a non-stationary Poisson
process, Selecting input models without data, Multivariate and Time-Series input
models.
Estimation of Absolute Performance: Types of simulations with respect to
output analysis ,Stochastic nature of output data, Measures of performance and
their estimation, Contd..
Module – 5
Measures of performance and their estimation,Output analysis for terminating 10 Hours
simulations Continued..,Output analysis for steady-state simulations.
Verification, Calibration And Validation: Optimization: Model building,
verification and validation, Verification of simulation models, Verification of
simulation models,Calibration and validation of models, Optimization via
Simulation.
Course outcomes: The students should be able to:
• Explain the system concept and apply functional modeling method to model the
activities of a static system
• Describe the behavior of a dynamic system and create an analogous model for a
dynamic system;
• Simulate the operation of a dynamic system and make improvement according to the
simulation results.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each
module.
Text Books:
1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event
System Simulation, 5 th Edition, Pearson Education, 2010.
Reference Books:
1. Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First
Course, Pearson Education, 2006.
2. Averill M. Law: Simulation Modeling and Analysis, 4 th Edition, Tata McGraw-
Hill, 2007
 INTERNSHIP / PROFESSIONAL PRACTISE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CS84 IA Marks 50
Duration 4 weeks Exam Marks 50
Exam Hours 03
CREDITS – 02
Course objectives: This course will enable students to

Description (If any):

Course outcomes: The students should be able to:

Evaluation of Internship :
 PROJECT WORK PHASE II
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CSP85 IA Marks 100
Number of Lecture Hours/Week 06 Exam Marks 100
Total Number of Lecture Hours -- Exam Hours 03
CREDITS – 05
Course objectives: This course will enable students to

Description (If any):

Course outcomes: The students should be able to:

Conduction of Practical Examination:

 SEMINAR
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2016 -2017)
SEMESTER – VIII
Subject Code 15CSS86 IA Marks 100
Number of Lecture Hours/Week 04 Exam Marks --
Total Number of Lecture Hours -- Exam Hours --
CREDITS – 02
Course objectives: This course will enable students to
•
Description:
•
Course outcomes: The students should be able to:
•
Evaluation of seminar: