B.M.S.

COLLEGE OF ENGINEERING
(Autonomous Institute, Affiliated to VTU)

Department of Computer Science &

Engineering

UG Scheme and Syllabus

(2014-2018)
(3rd to 8th Sem)
 DEPARTMENT OF COMPUTER SCIENCE AND ENGG.
BMSCE, BANGALORE.

DEPARTMENT VISION
To be a model centre for education and training in the frontier areas of Computer Science and
Engineering.

DEPARTMENT MISSION
The mission of Computer Science and Engineering department is to educate students in the
areas of computer science by providing best practices of teaching learning process for careers
in software industry/higher education/research.

Programme Educational Objectives(PEO)

PEO1: Graduates of the program will have successful professional career in IT industry.
PEO2: Graduates of the program will pursue higher education.
PEO3: Graduates of the program will develop computing systems for real life problems.

Programme Specific Outcomes (PSO)

PSO1. Apply Software Engineering Principles and Practices to provide software solutions.
PSO2. Design and Develop Network, Mobile and Web based Computational systems under
realistic constraints
PSO3. Design efficient algorithms and develop effective code.
 PROGRAM OUTCOMES
Engineering knowledge: Apply the knowledge of mathematics, science,
PO1 engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
Problem analysis: Identify, formulate, review research literature, and analyze
PO2 complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified
PO3
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and
PO4 research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources,
PO5 and modern engineering and IT tools including prediction and modeling to
complex engineering activities with an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual
PO6 knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
Environment and sustainability: Understand the impact of the professional
PO7 engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
Ethics: Apply ethical principles and commit to professional ethics and
PO8
responsibilities and norms of the engineering practice.
Individual and team work: Function effectively as an individual, and as a member
PO9
or leader in diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities
with the engineering community and with society at large, such as, being able to
PO10
comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of
the engineering and management principles and apply these to one’s own work,
PO11
as a member and leader in a team, to manage projects and in multidisciplinary
environments.
Life-long learning: Recognize the need for, and have the preparation and ability
PO12 to engage in independent and life-long learning in the broadest context of
technological change.
 SCHEME OF INSTRUCTIONS FOR THIRD SEMESTER
Sl Credit Hours/Week
.
Course Code Course Title
N L T P S Total
o
1
1 5 M A 3 C C D M S Discrete Mathematics 3 1 - - 4
2
1 5 C S 3 D C D S T Data Structures 4 - 1 - 5
3
1 6 C S 3 D C P C P Programming with C++ 3 - 1 2 6
4
1 5 C S 3 D C WE P Web Programming 3 - 1 2 6
5 Computer Organization and
1 5 C S 3 D C C O A 4 - - - 4
Architecture
Total 4 25

SCHEME OF INSTRUCTIONS FOR FOURTH SEMESTER

S Credit Hours/Week
l
. Course Code Course Title
L T P S Total
N
o
1
1 6 MA 4 C C L I A Linear Algebra 3 1 - - 4
2
1 6 CS 4 D C O O J OOPS with Java 3 - 1 2 6
3 Data Base Management
1 6 CS 4 D C D B M 3 - 1 2 6
Systems
4
1 6 CS 4 D C O P S Operating Systems 4 - - - 4
5
1 6 CS 4 D C D C M Data Communication 4 - 1 - 5

Total 4 25
III SEMESTER
SYLLABUS
 III SEMESTER
DISCRETE MATHEMATICS
Contact Hours/Week: 05 L-T-P-S: 3-1-
0-0
Total Lecture Hours: 39 CIE Marks:
50
Subject Code: 15MA3GCDMS SEE Marks:
50

UNIT 1:

Set Theory And Relations 11

Hours
Introduction to sets and subsets, operations on sets, laws of set theory. Duality, Principle of
duality for the equality of sets. Countable and uncountable sets. Addition Principle.
Introduction to Relations. Definition, Types of functions, operations on relations, matrix
representation of relations, composition of relations, properties of relations, equivalence
relations, partial orders, Hasse diagram. Posets- extremal elements on posets.
(8L+3T)
Suggested Reading: Some particular functions- Floor and ceiling functions, Projection, Unary
and Binary operations.

UNIT 2:

Algebraic Structures-Groups 10
Hours
Groups, properties of groups. Some particular groups- The Klein 4-group, additive group of
integers modulo n, multiplicative group of integers mod p, permutation groups. Subgroups,
Cyclic groups, Coset decomposition of a group, homomorphism, isomorphism.(7L+3T)
Suggested Reading: Lagrange’s theorem and its consequences.

UNIT 3:

Combinatorics 9
Hours
Principles of counting: The rules of sum and product, permutations. Combinations- Binomial
and multinomial theorems. Catalan numbers, Ramsey numbers. The Pigeon hole principle,
the principle of inclusion and exclusion. Derangements, Rook polynomials.
(7L+2T)
Suggested Reading: Ordinary Generating Functions, Partitions of integers and their
generating functions, exponential generating functions.

UNIT 4:

Graph Theory 9
Hours
Basic concepts: Types of graphs, order and size of a graph, in-degree and out-degree,
connected and disconnected graphs, Eulerian graph, Hamiltonian graphs, sub-graphs, dual
graphs, isomorphic graphs. Matrix representation of graphs: adjacency matrix, incidence
matrix. Trees: spanning tree, breadth first search. Minimal spanning tree: Kruskal’s
algorithm, Prim’s algorithm, shortest path-Dijkstra’s algorithm. (7L+2T)
Suggested Reading: Konigsberg bridge problem, Utilities problem, seating problem.

UNIT 5:

Number Theory 09
Hours
Introduction: Integers, properties of integers. Primes. Congruences-: Introduction,
Equivalence Relations, Linear Congruences, Linear Diophantine Equations and the Chinese
Remainder Theorem, Modular Arithmetic: Fermat’s Theorem, Wilson’s Theorem and Fermat
Numbers. Polynomial congruences, Pythagorean equations.(7L+2T)Suggested Reading:
Prime counting function, Test of primality by trial division, Sieve of Eratosthenes, Canonical
factorization, Fundamental theorem of arithmetic, determining the Canonical factorization of
a natural number.

*******
Mathematics Lab
• Hasse diagram
• Rook Polynomials
• Minimal spanning tree- Kruskal’s algorithm, Prim’s algorithm.
• Shortest Path- Dijkstra’salgorithm.

Text Books:

1. “Discrete Mathematical Structures”, Dr. DSC, 4th edition, 2011-12, Prism

Engineering Education Series.
2. “Discrete Mathematics”, Seymour Lipchitz. M. Lipson, 2005, Tata Mc.Graw Hill.
3. “Graph Theory and Combinatorics”, Dr. DSC, 4th edition, 2011-12, Prism
Engineering Education Series.
4. “Elementary Number Theory” by David M Burton - Tata McGraw Hill Publ.-6th
Edition 2006.

Reference Books:

1. “Discrete Mathematics and its Applications”, Kenneth H Rosen, 2002, Mc. Graw
Hill.
2. “Discrete Mathematics”, Kolman, Busby Ross, 5thedition, 2004, Prentice Hall.
3. “Discrete Mathematics”, J K Sharma, 3rd edition, 2013, Macmillan India Ltd.

E-books:

(1)Discrete Mathematics with Algorithms by M. O. Albertson, J. P. Hutchinson - J. 1988

Wiley.
(2)Discrete Mathematics for Computer Science, Gary Haggard, John Schlipf, Sue
Whitesides,
Thomson Brooks/Cole, 2006.
(3)http://ocw.mit.edu/courses/mathematics/ (online course material)

MOOCs:

(1)httpwww.nptelvideos.in/2012/11/discrete-mathematical-structures.html
(2)https://www.khanacademy.org/
(3) www.cs.berkeley.edu/~daw/teaching/cs70-s05/

Course Outcomes:

Course Code CO # COURSE OUTCOMES (CO) PO Bloom’s

level
CO 1: Use the notation of set theory. 2, 3 3
CO 2: Construct a Hasse diagram for partial 2, 3, 4 4
orderings.
CO 3: Differentiate between a relation and a 2, 3, 4 4
function.

CO 4: Recognize certain well known groups 2, 3, 4 4

15MA3CCDMS CO 5: Apply basic tools of Combinatorics such 2, 3, 4 4
as sum and product rules, pigeon-hole principle.
CO6:Use graphs as representation tools in a 2, 3 3
network analysis.
CO 7: Understand basic properties of integers, 2, 3 3
greatest common divisor, congruence relations
and arithmetic of residue classes.

ASSESSMENT:

1. Each unit consists of one full question.

2. Each full question consists of three or four subdivisions.
3. Five full questions to be answered.
4. To set one question in Units 1, 3, 5 and two questions each in unit 2 and unit 4.

Questions for CIE (50%) and SEE(50%) will be designed to evaluate the various educational
components (Blooms taxonomy) such as:
• Remembering and understanding the course contents (weightage: 40%)
• Applying the knowledge acquired from the course (weightage: 35%)
• Designing and analyzing various engineering problems (weightage: 15%)
• Understanding of various system models (weightage: 10%)
 DATA STRUCTURES

Contact Hours/Week: 06 L-T-P-S: 4-0-

1-0
Total Lecture Hours: 52 CIE Marks:
50
Subject Code: 15CS3DCDST SEE Marks:
50

UNIT 1:
Introduction: Structures and Pointers revisited, Introduction to Data Structures.
Stacks: Definition, Representation and operations on stack, Implementation of stack using
array.
Applications of stack: Recursion: Definition, Sum of n numbers, factorial of given number,
Fibonacci Series, GCD, Tower of Hanoi, Infix, Prefix, Postfix expressions, Conversions:
Infix to postfix, Evaluation of postfix expression, Iteration v/s recursion techniques.
Queues: Definition, Representation and operation on Linear queues, Implementation of
queue using array, Circular Queue, Priority Queue: Ascending PQ, Descending PQ, Multi-
Level PQ, Application of Queue.
12 Hours

UNIT 2:
Linked List: Dynamic Memory Allocation Revisited, Introduction to Linked List, Arrays v/s
Linked List, Operation on Linked List: Insert, Delete, Display, Doubly Linked List, Circular
Linked List, Circular Doubly Linked List.
Applications on Linked List: Reversing, Concatenation, Merging, Searching, Sorting,
Addition of two polynomial, Evaluation of Polynomials, Addition of two long integers,
Linked Implementation of Stacks, Linked Implementation of Queues.
11 Hours

UNIT 3:
Trees: Definition, Types of Trees, Representation of trees using array and Linked List,
Operation on Binary Trees: Create, Display, Insert, Delete. Binary Search Tree: Definition,
Operation on Binary Search Trees: Create, Display, Insert, Delete.
Tree Traversal: Preorder, Post order, Implementing tree traversal using recursion.
Applications of Binary Trees and Binary Search Trees.
10 Hours

UNIT 4:
Variations of BST: Threaded Binary Tree and its types, B-Tree and its operations, Red-
Black and its operations, Splay Tree, AVL Tree,2-3 Trees,2-3-4 Trees, Huffman Tree,
Introduction to Binomial Heaps and Fibonacci Heaps.
10 Hours
UNIT 5:
Sorting: Bubble Sort, Selection Sort, Insertion Sort, Radix Sort, Sorting by Counting,
Distribution Sorting.
Searching: Linear Search, Binary Search, Hashing: Introduction, Hash Function, Collision
Resolution Techniques: Linear Probing, Quadratic Probing, Double Hashing, Rehashing,
Separate Chaining, Extendible Hashing. 09
Hours

Text Books:
1. Data Structures: A Pseudocode Approach with C by Richard.F.Gilberg,
Behrouz.A.Forouzan, 2nd edition 2007. (Latest Edition)
2. Introduction to Algorithms by T. H Cormen, C. E. Leiserson and R. L. Rivest, 2nd
Edition, Prentice Hall India 2009. (Latest Edition)
Reference Books:
1. Data Structures using C and C++ by YedidyahLangsam and Moshe J. Augenstein
and Aaron M.Tenanbaum, PHI / Pearson 2008 Reprint.(Latest Edition)
2. Introduction to the design and analysis of algorithms by AnanyLevitin,
Pearson Education, 2005. (Latest Edition)
3. Data Structures and Program Design by C R.Kruse, C.L Tondo and B.Leung,
Second
Edition, Pearson Education, 2007. (Latest Edition)
4. Data Structures using C by A.M.Padma Reddy, 2013 Revised Edition. (Latest
Edition)
E- Books:
1. Data Structures and algorithm analysis in C++ by Marks Allen Wesis, Pearson
Education, 3rd Edition, 2007.
2. Data Structures Using C by R. Krishnamoorthy, Tata McGraw-Hill Education, 2010
3. Principles of Data Structures Using C and C++ by Vine V Das, New age International
Publishers.
4. “C Programming: Data Structures and Algorithms” by Jack Straub, Version 2.07,
2006
MOOCs:
1. NPTEL: http://nptel.ac.in/courses/106102064/1
2. UC Berkeley Data Structures:
https://www.youtube.com/playlist?list=PLBB2FC97598A3B254
3. Algorithms, Part I(Princeton University): https://www.coursera.org/course/algs4partI

Course Outcomes:

CO1 Design applications using stacks and implement various types of queues.

CO2 Analyze and implement operations on linked lists and demonstrate their
applications.
CO3 Demonstrate operations on trees.

CO4 Demonstrate implementation of various types of Binary Search Trees.

CO5 Implement various searching and sorting techniques.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz /AAT 5
2 Internals 20 (10+10)
Lab Internals 25 (10+10+5)
Total 50

Best 2 out of 3 Tests and 1 Quiz and Lab Internals will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100
marks. Students have to answer 5 questions from five units, three units to carry one question
each(mandatory from Unit 1, Unit 3 and Unit 5) two units to carry two questions each
(internal choice from Unit 2 and Unit 4).

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
 PROGRAMMING WITH C++
Contact Hours/Week: 05 L-T-P-S: 3-0-1-2
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS3DCPCP SEE Marks: 50

UNIT 1:
Overview of C++: What is Object Oriented Programming, Some C++ fundamentals.
Classes and Objects: Classes, Friend functions, Friend classes, Inline functions,
Parameterized constructors, Static Class Members, The Scope resolution operator, nested and
local classes, Passing Objects to functions, returning objects, object assignment.
Arrays, Pointers, References: Array of Objects, Pointers to objects, the This pointer,
References.

8 Hours
UNIT 2:
Function Overloading, Copy Constructors, and Default Arguments: Function Overloading,
Overloading Constructors, Copy constructors, Default Function Arguments.
Operator Overloading: Creating a member operator function, operator overloading using a
friend function, overloading new and delete, overloading some special operators, and comma
operator.

8 Hours
UNIT 3:
Inheritance: Base Class Access Control, Inheritance and protected members, inheriting
multiple base classes, constructors, destructors and inheritance, granting access, virtual base
classes.
Virtual Functions and Polymorphism: Pointers to objects, Pointers to derived classes, Virtual
Functions, Pure Virtual Functions.

9 Hours
UNIT 4:
Templates: Generic functions, Applying Generic Functions.
Exception Handling: Exception Handling fundamentals, Handling derived class exceptions,
Exception Handling options.

7 Hours

UNIT 5:
C++ File I/O: <fstream> and the file classes, Opening and Closing the file, Reading and
Writing text files, Unformatted and Binary I/O.
Namespaces: Namespace fundamentals, the std namespace.
Introducing the Standard Template Library: An overview of the STL.

7 Hours
Text Book:
1. “C++ - The Complete Reference” by Herbert Schildt, 4th edition, Tata McGraw Hill,
2015.

Reference Books:
1. “C++ Program Design: An introduction to Programming and object – Oriented
Design” by Cohoon and Davidson, 3rd Edition, Tata McGraw Hill, 2003
2. “Object-Oriented Programmig in C++” by Robert Lafore, 4th edition, Pearson
Education.
3. “Problem Solving with C++“ by Walter Savitch, 9th edition, Pearson Education, 2015.

E-Books:
1. http://www.cplusplus.com/files/tutorial.pdf
2. http://mazonka.com/shared/Straustrup4th.pdf

MOOCS:
1. https://www.coursera.org/learn/c-plus-plus-a#syllabus
2. https://www.udemy.com/free-learn-c-tutorial-beginners/

Course Outcomes:

Develop C++ programs that implement the object oriented programming

CO 1 concepts.

Overload functions and operators exhibiting polymorphism.

CO 2

Apply the concept of inheritance and runtime polymorphism in real world

CO 3
applications.

Develop C++ Programs to create generic functions and to handle exceptions.

CO 4
Illustrate the procedure to store and retrieve data to/from files.
CO 5
Analyze existing modules, design and develop new modules to extend the
CO 6
functionalities of a project code.
ASSESSMENT:
CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:

Semester End Examination (SEE) is a written examination of three hours duration for 100
marks. Students have to answer 5 questions from five units, three units to carry one question
each(mandatory) two units to carry two questions each ( internal choice).

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.

WEB PROGRAMMING
 Contact Hours/Week: 05 L-T-P-S: 3-0-1-2
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 15CS3DCWEP SEE Marks: 50

UNIT 1:
XHTML: Basic syntax, Standard XHTML document structure; Basic text markup, Images;
Hypertext Links, Lists, Tables, Forms, The Audio Element, The Video Element,
Organization Elements, The Time Element, Syntactic differences between HTML and
XHTML.
Cascading Style Sheets: Introduction, Levels of style sheets, Style specification formats,
Selector forms, Property value forms, Font properties, List properties, Alignment of text,
Color, The Box model, Background images, The <span> and <div> tags, Conflict resolution.
10
Hours

UNIT 2:
JAVASCRIPT: Overview of JavaScript, Object orientation and JavaScript, General
syntactic characteristics, Primitives, Operations and Expressions, Screen output and keyboard
input, Control statements, Object creation and modification, Arrays, Functions, Constructor,
Pattern matching using regular expressions.
JavaScript and HTML Documents: The JavaScript execution environment, The Document
Object Model, Element access in JavaScript, Events and event handling, Handling events
from the Body elements, Button elements, Text box and Password elements.
Dynamic documents with JavaScript: Introduction, Positioning elements, Moving
elements, Element visibility, Changing colors and fonts, Dynamic content, Stacking
elements, Locating the mouse cursor, Reacting to a mouse click, Slow movement of
elements. 10 Hours

UNIT 3:
PHP Programming
Creating PHP Pages Using PHP6 : Overview of PHP Structure and Syntax, Creating Your
First Program, Using HTML to Spice Up Your Pages, Using Constants and Variables to Add
Functionality, Passing Variables between Pages, Using if/else Arguments, Using Includes for
Efficient Code, Using Functions for Efficient Code, All about Arrays, OOP Dreams.
09
Hours

UNIT-4
Using PHP with MySQL: Overview of MySQL Structure and Syntax, How PHP Fits with
MySQL, Connecting to the MySQL Server, Looking at a Ready-Made Database, Querying
the Database,
Form Elements- Letting the User Work with Data: Your First Form, Driving the User
Input, Linking Forms Together.
XML: Introduction to XML, Uses of XMLSyntax, The Syntax of XML, Document structure,
Namespaces, XML schemas, Displaying raw XML documents, Displaying XML documents
with CSS, XSLT style sheets..10 Hours

Text Books:
1. “Programming the World Wide Web” by Robert W. Sebesta, 8thEdition,Pearson, 2015.
2. “Beginning PHP6, Apache, MySQL® Web Development” by Timothy Boronczyk,
Elizabeth Naramore, Jason Gerner, Yann Le Scouarnec, Jeremy Stolz, Michael K.
Glass,John Wiley &Sons, 2009.

Reference Books:
1. “Internet & World Wide Web How to program” by Paul Deitel, Harvey Deitel, Abbey
Deitel, 5th Edition, Pearson Education / PHI, 2012.
2. “Learning PHP, MySQL, JavaScript, CSS & HTML5” by Robin Nixon, 3rd Edition,
O’REILLY, 2014.

E- Books:
1. The Web Book: How to create Web sites and applications with HTML, CSS, JavaScript,
PHP and MySQL by Robert Schifreen, 2010.
2. Sams Teach Yourself PHP, MySQL® and Apache All in One by Meloni, Julie C, 2012.
3. Build your own Website The Right Way Using HTML & CSS, 3rd edition by Ian Lloyd,
SitePoint publication, 2011
4. Creating Web Pages All-in-One For Dummies by Richard Wagner, 4th Edition, Wiley
Publication, 2011

MOOCs:
1. World Wide Web School , URL : http://www.w3schools.com/html
2. NPTEL : http://nptel.ac.in/video.php?subjectId=106105084
3. http://www.creativebloq.com/web-design/training-online-resources-812225

COURSE OUTCOMES:
Design web pages using XHTML.
CO 1
Apply Cascading Style Sheets to web pages.
CO 2
Develop JavaScript programs to validate and create dynamic WebPages.
CO 3
Develop server side programs using PHP.
CO 4
Write XML schema to define the declaration rules for web pages.
CO 5

ASSESSMENT:

CIE Scheme:
 Assessment Weightage in Marks
1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 10
1 Self Study 15
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100
marks. Students have to answer 5 questions from four units, three units to carry one question
each(mandatory from Unit 3 and Unit 4) two units to carry two questions each (internal
choice from Unit 1 and Unit 2) and the last question is from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
 COMPUTER ORGANIZATION AND ARCHITECTURE

Contact Hours/Week: 04 L-T-P-S: 4-0-0-0

Total Lecture Hours: 52 CIE Marks: 50
Subject Code: 15CS3DCCOA SEE Marks: 50

UNIT 1:
Basic Structure of Computers: Computer Types, Functional Units, Basic Operational
Concepts, Bus Structures, Performance-Processor Clock, Basic Performance Equation,
Pipelining and Superscalar, Clock Rate, Instruction set: CISC & RISC, Compiler,
Performance Measurement, Historical Perspective.
Machine Instructions and Programs: Numbers, Arithmetic Operations and Characters,
Memory Location and Addresses, Memory Operations, Instructions and Instruction
Sequencing, Addressing Modes, Assembly Language, Basic Input and Output Operations,
Stacks and Queues, Subroutines, Additional Instructions, Encoding of Machine Instructions.
12 Hours

UNIT 2:
Input/Output Organization: Accessing I/O Devices, Interrupts - Interrupt Hardware,
Enabling and Disabling Interrupts, Handling Multiple Devices, Controlling Device Requests,
Exceptions, Direct Memory Access, Buses
Interface Circuits, Standard I/O Interfaces - PCI Bus, SCSI Bus, USB. 10
Hours

UNIT 3:
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories,
Speed, Size, and Cost, Cache Memories - Mapping Functions, Replacement Algorithms,
Performance Considerations, Virtual Memories, Secondary Storage. 10
Hours

UNIT 4:
Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders,
Multiplication of Positive Numbers, Signed Operand Multiplication, Fast Multiplication,
Integer Division, Floating-point Numbers and Operations.
10 Hours

UNIT 5:
Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction,
Multiple Bus Organization, Hard-wired Control and Micro programmed Control (only
Architecture).
Parallel Computer Architecture: Processor Architecture and Technology Trends, Flynn’s
Taxonomy of Parallel Architectures, Memory Organization of Parallel Computers, Thread-
Level Parallelism (Example: Architecture of the Intel Core i7).
10 Hours

Text Books:
1.”ComputerOrganization” by Carl Hamacher, ZvonkoVranesic, Safwat Zaky,
5thEdition, Tata McGraw Hill, 2009. (Latest Edition)
2.”Parallel Programming For Multicore & Cluster Systems
by Thomas Rauber, GudulaRunger, 2nd Edition, Springer, 2013.

Reference Books:
1.”Computer Organization and Design - The Hardware/Software Interface” by David
A. Patterson, John L. Hennessy, 4th Edition, Elsevier, 2008. ( Latest Edition)
2.”Computer Organization & Architecture” by William Stallings, 7th Edition, PHI.
3.”Computer Systems Design and Architecture” by Vincent P. Heuring& Harry F.
Jordan, 2ndEdition,Pearson Education.

E- Books:
1. Computer Organization: TMH, Ace series.
2. Computer Organization and Architecture by William Stallings.

MOOCs:
1.NPTEL:http://nptel.ac.in/courses/106106092/
2. http://freevideolectures.com/Course/2277/Computer-Organization#

Course Outcomes:
CO1 Explain the basic operation, analyze parameters that affect the performance of
computer, write assemble language programs and explain different types of parallel
computing architectures.

CO2 Describe input and output organization techniques.

CO3 Explain different memory technologies and design memory organization for a
computing system.

CO4 Design different components of ALU

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration of 100
marks. Students have to answer 5 questions from five units, three units to carry one question
each(mandatory) two units to carry two questions each ( internal choice).

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
IV SEMESTER
SYLLABUS
 IV SEMESTER
LINEAR ALGEBRA
Contact Hours/Week: 05 L-T-P-S: 3-1-0-0
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16MA4GCLIA SEE Marks: 50

UNIT 1:

System Of Linear Equations And Vector Spaces 12

Hours
System of Linear Equations: Elementary row operations and echelon forms, invertible
matrices. Consistency of a system of linear equations. Solution of a system of algebraic
equations: Gauss elimination method, LU decomposition method, Gauss Seidel method.
Vector spaces; subspaces, computations concerning subspaces, summary of row-equivalence,
Linear combination, linear dependence and linear Independence, spanning sets, Row spaces
of a matrix, Column space of a matrix, bases and dimension, coordinates.
(9L+2T)
Suggested Reading: Solution of a system of equations using Gauss Jordan method, inverse of
a matrix using Gauss Jordan method.

UNIT 2:

Linear Transformations 12
Hours
Linear transformations; Algebra of Linear transformations, Matrix of linear transformations;
Rank- Nullity theorem (no proof), problems on Rank-Nullity theorem, Singular and Non-
singular Linear transformations, Eigenvalues and Eigenvectors of a linear transformation,
Invertible operators. (9L+2T)

UNIT 3:

Eigenvalues And Eigenvectors 10

Hours
Rayleigh power method, Gerschgorin circle method, Jacobi’s method, invariant subspaces,
Jordan canonical form.
(9L+2T)
Suggested Reading: Cayley Hamilton theorem, Givens method, inverse Power method.

UNIT 4:

Inner Product Spaces 10

Hours
Inner product, inner product spaces, length and orthogonality, orthogonal sets and Bases,
projections, Gram-Schmidt process, QR-factorization, least squares problem. (9L+2T)
Suggested Reading: least square errors.

UNIT 5:
Symmetric Matrices And Quadratic Forms 8
Hours
Power of a matrix, Diagonalization of Real symmetric matrices, quadratic forms, Reduction
of quadratic form to canonical form, Nature of quadratic form, Singular value decomposition.

(9L+2T)
: Mathematics Lab
• Gauss Seidel method
• LU decomposition method
• Largest, smallest eigenvalue and corresponding eigenvectors.
• Linear transformations

Text Books:

1. “Schaum’s outline series-Theory and problems of linear algebra”, Seymour

Lipschutz, 5th edition, 2012, McGraw-Hill Education.
2. “Linear Algebra and its applications”, David C lay, Steven R lay, Judi J Mc.
Donald, 5th Edition, 2015, Pearson Education.

Reference Books:

1. “Linear Algebra and its applications”, Gilbert Strang, 4th edition, 2005, Brooks Cole.
2. “Linear Algebra and its applications”, Peter D Lax, 2nd edition, 2007, Wiley
Interscience.
3. “Elementary Linear Algebra and its applications”, Bernard Kolman and David R
Hill , 9th Edition, 2007, Pearson.

E- books:

1. https://www.math.ucdavis.edu/~linear/linear.pdf
2. http://ocw.mit.edu/courses/mathematics/ (online course material)

MOOCs:

1. http www.linear-algebra-Gilbert- Strangs-lectures-or-the-lectures-from-Khan-Academy

2. www.cs.berkeley.edu/~daw/teaching/cs70-s05/
3. nptel.ac.in/courses/111108066

ASSESSMENT:

1. Each unit consists of one full question.

2. Each full question consists of two, three or four subdivisions.
3. Five full questions to be answered.
4. To set one question each in Units 2, 3, 4 and two questions each in Unit 1 and Unit 4.

Questions for CIE (50%) and SEE(50%) will be designed to evaluate the various educational
components (Blooms taxonomy) such as:
• Remembering and understanding the course contents (weightage: 40%)
 • Applying the knowledge acquired from the course (weightage: 35%)
• Designing and analyzing various engineering problems (weightage: 15%)
• Understanding of various system models (weightage: 10%)

COURSE OUTCOMES:

Course Code COURSE OUTCOME (CO) PO Bloom’s

level
CO 1: Solve system of linear algebraic equations. 2 2
CO 2: Demonstrate competence with the ideas of vector
2 2
spaces, subspaces, Basis and dimension.
CO 3: Obtain the matrix associated with a linear
2,3 3
transformation with respect to given bases.
CO 4: Understand the relationship between the operations
on linear transformations and their corresponding
matrices.
16MA4GCLIA CO 5: Compute eigenvalues, eigenvectors and
2,3 3
eigenspaces of matrices.

CO6: Apply Gram-Schmidt process tofind an orthogonal

base in a subspace of an inner product space, and to be 2,3 3
able to characterize orthogonal matrices.

CO7: Use of Singular value decomposition that finds

2,3 3
applications in signal processing.
 OOPS WITH JAVA
Contact Hours/Week: 05 L-T-P-S: 3-0-1-
2
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS4DCOOJ SEE Marks: 50

UNIT 1:
Introduction of Java: Java and Java applications, java Development kit (JDK), Java is
interpreted, Byte code, JVM, simple java Programs.
Data types and other tokens: Boolean Variables, int, long, char, operators, arrays, white
spaces, literals, assigning values, creating and destroying objects, access specifiers.
Control Statements: Selection statements, iteration statements, Jump statements, Classes in
Java, declaring a class, class name, Super classes, constructors, creating instances of a class,
Inner classes.
Inheritance: Simple, Multiple, multilevel inheritance, overriding, overloading, using super,
multilevel hierarchy, dynamic method dispatch, abstract class, using final with inheritance.
10
Hours

UNIT 2:
Process Description and Control
Packages: Defining a package, Finding packages and class path, Example, Access
protection, importing packages
Interfaces: Defining Interface, Implementing Interface, Nested Interfaces, Applying
interfaces, Variables in interfaces.
Enumeration, Autoboxing: Enumeration, Type Wrappers, Autoboxing.
Generics: Introduction to Generics. A Simple Generics Example, A generics Class with two
type parameters, The General form of a Generic Class. 9
Hours

UNIT 3:
String handling: Special string operators, character extraction, string comparison, searching
strings, modifying a string, string buffer, additional string methods.
Exception handling: Fundamentals, Exception types, uncaught exceptions, using try and
catch, multiple catch clauses, nested try statements, throw, throws, finally, Java’s built-in
exceptions. Creating your own exception subclasses.
Multithreaded Programming: Introduction to Process, Difference between Process and
Threads, Java thread model, main thread, creating thread, creating multiple threads, using
isalive() and Join(), thread priorities, synchronization, Interthread communication,
suspending, resuming and stopping threads.
10 Hours

UNIT 4:
Input/Output: Exploring java.io: The Java I/O Classes and Interfaces. File, The Closable
and the Flushable Interfaces, The Stream classes, The Byte Streams, The Character Streams,
Console Class files.
Applets Fundamentals: Applet class, two types of applets, Applet basics, Applet
architecture, An Applet skeleton, display methods, requesting repainting, using status
window, HTML applet tag, Passing parameters to Applets, getDocumentbase(),
getCodebase().
Abstract window toolkit: Introducing the AWT working with windows, Event Handling,
Using AWT controls, Layout Managers and Menus, working with graphics and Text.
10 Hours

Text Books:
1. “Java the Complete Reference” by HerbertSchildt, 9th Edition, Tata McGraw-hill Edition
2014.
2. “Programming with Java A Primer” by E.BalaGuruSwamy 5th Edition, McGraw Hill
Education 2014.

Reference Books:
1.”Introduction to JAVA Programming” by Y. Daniel Liang, 9th edition, pearson
education, 2012.
2.”Programming in JAVA 5.0”, James P Cohoon, Jack W Davidson; TATA McGraw hill.
Cay S Horstmann, Gary Cornell: Core Java2, Volume 1 and 2, Seventh Edition, Pearson
Education.

E-Books:
1. Oracle Technology Network.
2. Essentials of the Java Programming Language Hands -On Guide.
3. Building Object-Oriented, Multi-Threaded Applications with Java by Bill Venners.
4. Java Reference Guide by Stevens Haines.
5.Getting Started with Java.

MOOCs:
1. https://www.edx.org/course/introduction-programming-java-part-1-uc3mx-it
2. http://www.learnerstv.com/video/Free-video-Lecture-226-Computer-Science.htm
Course Outcomes:

CO1 Able to identify the salient features and develop simple Java programs.

CO2 Able to design user defined packages , interfaces and use built in Java I/O
Streams.

CO3 Able to use built-in exceptions and design user defined exceptions.

CO4 Able to create multiple threads and applets.

CO5 Able to create user windows using AWT classes.

ASSESSMENT:

CIE Scheme:
 Assessment Weightage in Marks
1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 10
1 Self Study 15
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100
marks. Students have to answer 5 questions from four units, three units to carry one question
each(mandatory from Unit 1 and Unit 4) two units to carry two questions each ( internal
choice from Unit 2 and Unit 3) and the last question is from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
 DATABASE MANAGEMENT SYSTEMS
Contact Hours/Week: 05 L-T-P-S: 3-0-1-
2
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS4DCDBM SEE Marks: 50

UNIT 1:
Introduction to Databases: Introduction, An Example, Characteristics of Database
approach, Advantages of using DBMS approach, When not to use a DBMS.
Database System Concepts and Architecture: Data models, Schemas and instances, Three
schema architecture and data independence, Database languages and interfaces, The database
system environment.
SQL: SQL Data Definition and Data Types specifying basic constraints in SQL, Basic
retrieval queries in SQL, Insert, Delete and Update statements in SQL, Additional features of
SQL, More complex SQL Queries, Specifying Constraints as Assertion and Trigger, Views
(Virtual Tables) in SQL, Schema Change Statement in SQL.
11 Hours

UNIT 2:
Relational Data Model and Relational Database Constraints: Relational Model Concepts,
Relational Model Constraints and Relational Database Schemas, Update Operations,
Transactions and Dealing with Constraint Violations.
Relational Algebra: Unary Relational Operations, SELECT and PROJECT, Relational
Algebra Operations from Set Theory, Binary Relational Operations: JOIN and DIVISION,
Additional Relational Operations, Examples of Queries in Relational Algebra.

Data Modeling using the Entity-Relationship(ER) model: Using High-Level conceptual

Data Models for Database Design, A sample Database Application, Entity types, Entity Sets,
Attributes and Keys, Relationship Types, Relationship Sets, Roles and Structural Constraints,
Weak Entity types, Refining the ER Design, ER Diagrams, Naming Conventions and Design
Issues, Relationship Types of Degree Higher than Two, Database Design using ER-to-
Relational Mapping.
11 Hours

UNIT 3:
Database Design Theory and Normalization: Informal Design Guidelines for Relation
Schemas, Functional Dependencies, Normal Forms Based on Primary Keys, General
Definitions of Second and Third Normal Forms, Boyce-Codd Normal Form, Multi-valued
Dependencies and Fourth Normal Form, Join Dependencies and Fifth Normal Form.
9 Hours

UNIT 4:
Transaction Processing, Concurrency Control, and Recovery: Introduction to Transaction
Processing, Transaction and System Concepts, Desirable Properties of Transactions,
Characterizing Schedules Based on Recoverability, Characterizing Schedules Based on
Serializability, Two-Phase Locking Techniques for Concurrency Control, Recovery
Concepts, NO-UNDO/REDO Recovery Techniques based on Deferred Update, Recovery
Techniques Based on Immediate Update, Shadow Paging, The ARIES Recovery Algorithm.
8 Hours
Text Books:
1. “Fundamental of Database Systems” by RamezElmasri and Shamkant B Navathe,
Sixth Edition, Addison Wesley, 2011.
2. “Database System Concepts”, Sixth Edition,AbrahamSilberschatz, Henry F. Korth, S.
Sudarshan : Tata McGraw-Hill,2010

Reference Books:
1. “An Introduction to Database Systems” by C.J. Date, A.Kannan, S.Swamynathan, 8th
Edition, Pearson Education, 2006.
2. “Database Systems: The Complete Book”, Second Edition, Hector Garcia-
Molina,Jeffrey D.Ullman, Jennifer Widom , Pearson Education, 2001

E- Books:
1. Introduction to structured Query Language (SQL)
2. An Introduction to Relational Database Theory by Hugh Darwen
3. Database Management System by Raghu Ramakrishnan

MOOCs:
1. http://nptel.ac.in/courses/IIT-MADRAS/Intro_to_Database_Systems_Design
2.http://www.iitg.ernet.in/awekar/teaching/cs344fall11/
3. www.w3schools.com/sql/

Course Outcomes:

CO 1 Describe basic concepts of Database Management System

CO 2 Implement SQL queries using relational model concepts.
CO 3 Formulate relational algebraic expressions using relational
model concepts
CO 4 Design ER-Diagram for real world applications using database
concepts
CO 5 Analyze and apply normalization concept for relational schema
CO 6 Analyze transaction processing and concurrency control
techniques.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 10
1 Self Study 15
Total 50
 Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration of 100
marks. Students have to answer 5 questions from four units. Two units to carry one question
each (mandatory from Unit 3 and Unit 4), two units to carry two questions each (internal
choice from Unit 1 and Unit 2) and one question from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project covering the concepts for learning practical
applications. Academic projects will be developed by students.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
 OPERATING SYSTEM
Contact Hours/Week: 04 L-T-P-S: 4-0-0-0
Total Lecture Hours: 52 CIE Marks: 50
Subject Code: 16CS4DCOPS SEE Marks: 50

UNIT 1:
Operating System Overview
Operating System Objectives and Functions, The Evolution of Operating Systems,
Developments Leading to Modern Operating Systems, Virtual Machines, OS Design
Considerations for Multiprocessor and Multicore architectures, Modern UNIX Systems,
Linux, Android, User Operating system interface, system Calls, Types of System calls,
System programs, System boot.
8 Hours

UNIT 2:
Process Description And Control
Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication.
Threads: Overview, Multicore Programming, Multithreading Models, Implicit Threading,
Threading Issues, Linux process and thread management.
Scheduling: Basic concepts, Scheduling Criteria, Scheduling Algorithms Thread Scheduling,
Multiple-Processor Scheduling, Real-Time CPU Scheduling, Linux Scheduling. 12
Hours

UNIT 3:
Concurrency: Mutual Exclusion And Synchronization
The critical section problem, Semaphores, Classical problems of synchronization, Critical
regions.
Deadlocks: System Model, Deadlock characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection and recovery from deadlock,
Linux kernel concurrency mechanisms. 11
Hours

UNIT 4:
Memory management strategies
Background, Swapping, Contiguous memory allocation, Paging, Structure of page table,
Segmentation.
Virtual memory management: Background, Demand paging, Copy on write, Page
replacement algorithms, Allocation of frames, Thrashing, Linux Memory Management.
11 Hours

UNIT 5:
Input/ Output and Files
Implementing File system: File System structure, File system implementation, Directory
Implementation, Allocation methods, Free space management, Linux Virtual File System.
Mass storage structures: Disk structure, Disk attachment, Disk scheduling methods, Linux
I/O.
Protection: Goals of protection, Principles of protection, Domain of protection, Access
matrix, Implementation of access matrix.
10 Hours

Text Books:
1. “Operating System: Internals and Design Principles” by William Stallings, Prentice Hall,
8th Edition, 2014.
2. “Operating System Concepts” by Abraham Silberschatz, Peter Baer Galvin and Greg Gagne,
John Wiley &Sons,Inc., 9th Edition,2012.

Reference Books:
1. “Linux System Administration” by Tom Adelstein and Bill Lubanovic, O'Reilly Media, Inc.,
1st Edition, 2007.
2. “Modern Operating System” by Andrew S. Tanenbaum, Prentice Hall, 3rd Edition, 2007.
3. “Schaum's Outline of Operating Systems” (Schaum's Outline Series), by J. Archer Harris,
Publisher: McGraw-Hill, 2001.

E-Books:
5. Operating Systems Guide :by Tim Bower
6. Operating Systems Course Notes: by Dr. John T.Bell
7. Schaum's Outline of Operating Systems (Schaum's Outline Series) [Kindle Edition] by J.
Archer Harris.

MOOCs:
1. http://onlinevideolecture.com/?course=computer-science&subject=operating-systems
2. http://www.nptel.ac.in/courses/106108101/

COURSE OUTCOMES:

CO1 Describe features, types and design considerations of modern operating system.
CO2 Analyze & Apply the various process scheduling algorithms
CO3 Illustrate the concepts of synchronization and handle Deadlocks
CO4 Explain memory management strategies and analyze various page replacement
algorithms
CO5 Describe the design considerations of file system and compare various disk
scheduling algorithms
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz /AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration of 100
marks. Students have to answer 5 questions from five units, three units to carry one question
each(mandatory) two units to carry two questions each ( internal choice).

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
 DATA COMMUNICATION
Contact Hours/Week: 06 L-T-P-S: 4-0-1-0
Total Lecture Hours: 52 CIE Marks: 50
Subject Code: 16CS4DCDCM SEE Marks: 50

UNIT 1:
Data Communications, Networks, The Internet, Protocols and standards, Network Models-
Reference models OSI, TCP/IP Model, Addressing, Data & Signal-Analog and Digital,
Periodic Analog Signals, Digital Signals, Transmission impairment, Data Rate Limits,
Performance.
9
Hours

UNIT 2:
Digital Transmissions: Digital to Digital Conversions, Analog to Digital Conversions,
Transmission Modes, Analog Transmission-Digital to Analog conversion, Analog to Analog
conversion, Multiplexing- FDM, WDM, STDM, Statistical TDM, Spread Spectrum, Guided
Media-Twisted pair cable, Co-axial cable, Fiber optic cable, Unguided media-Wireless-
Radiowaves, Microwaves, Infrared. 12
Hours

UNIT 3:
Circuit switched networks, Datagram networks, Virtual circuit networks, Structure of a
Switch-Structure of Circuit Switches & Packet Switches, Data Link Layer-Detection and
Correction-Introduction, Block Coding-Error Detection and Correction, Hamming Distance,
Minimum Hamming Distance, Linear Block Codes, Cyclic Codes- CRC, Polynomials,
Checksum.10Hours

UNIT 4:
Data Link Layer– Data Link Control- Framing, Flow and error control, Protocols, Noiseless
Channels, Noisy Channels, HDLC, Point-to-Point Protocol- Framing, Transition phases,
Multiple Access- Random access-Aloha, CSMA, CSMA/CD, CSMA/CA, Controlled access-
reservation, polling, token passing, Channelization - FDMA,TDMA,CDMA. 12
Hours

UNIT5:
Wired LANs: Ethernet – Standard Ethernet, Fast Ethernet, Gigabit Ethernet, Wireless LANs-
IEEE 802.11, Bluetooth - Architecture, Bluetooth layers, Radio layer, Baseband layer,
L2CAP Connecting Devices–Hub, Repeater, Bridges, Transparent Bridges, Switches, Router,
and Gateway. 9
Hours

Text Books:
th
1. “Data Communication and Networking”, Behrouz A.Forouzan, McGrawHill, 5
Edition,2012.
2. “Data and Computer Communication”, William Stallings, 10th
Edition,PearsonEducation,2014.
Reference Books:
1. “Introduction to Data Communications and Networking”–Wayne Tomasi, Pearson
Education, 2009.(Latest Edition)

2. “Communication Networks-Fundamental Concepts and key

nd
Architectures”,AlbertoLeon-GarciaandIndraWidjaja,TataMc-Graw-Hill, 2 Edition,
Pearson Education,2007.

E-Books:
1.Data Communications by Brian Brown
2. Introduction to Data Communicationsby Eugene Blanchard

MOOCs:
1. http://nptel.ac.in/courses/106105082/
2. http://nptel.ac.in/video.php?subjectId=106105081
3. http://www.computerscienceonline.org/courses/
4. https://www.youtube.com/view_play_list?p=32DBC269EF768F74

Course outcomes:

CO1 Analyze OSI and TCP network models and the layers associated functionalities
CO2 Analyze and apply different types of signal conversion techniques in physical
layer
CO3 Analyze and apply different types of error detection and correction mechanisms
CO4 Analyze flow control and Error control mechanism using standard data link layer
protocols and Compare different categories of Medium Access protocols
CO5 Analyze different protocols used for Ethernet and various connecting devices
used in networks.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz /AAT 5
2 Internals 20 (10+10)
Lab Internals 25 (10+10+5)
Total 50

Best 2 out of 3 Tests and 1 Quiz and Lab Internals will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100
marks. Students have to answer 5 questions from five units, three units to carry one question
each(mandatory from Unit 1, Unit 3 and Unit 4) two units to carry two questions each (
internal choice from Unit 2 and Unit 5).
Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
B.M.S. COLLEGE OF ENGINEERING
(Autonomous Institute, Affiliated to VTU)

Department of Computer Science &

Engineering

UG Scheme and Syllabus

(5th and 6th semester)
2016-2017
 SCHEME OF INSTRUCTIONS FOR 5TH SEMESTER
Credit Hours/Week Marks
Contact
Course Code Course Title
hrs/wk
L T P S Total CIE SEE Total

1 6 C S 5 D C C O N Computer Networks 4 - 1 - 5 6 50 50 100

Analysis and Design of

1 6 C S 5 D C A D A 3 1 1 - 5 7 50 50 100
Algorithms

1 6 C S 5 D C I O T Internet of Things 3 - 1 2 6 5 50 50 100

1 6 C S 5 D C S W E Software Engineering 3 - - - 3 3 50 50 100

1 6 C S 5 D E D E 1 Department Elective - 1 3 - 1 2 6 5 50 50 100

Total 16 1 4 4 25 26 500

Department Credit Hours/Week Marks

Contact
Course Code
Elective - 1 hrs/wk
L T P S Total CIE SEE Total

Programming in
1 6 C S 5 D E P I P 3 - 1 2 6 5 50 50 100
Python

1 6 C S 5 D E A J V Advanced Java 3 - 1 2 6 5 50 50 100

1 6 C S 5 D E C D N C#.Net 3 - 1 2 6 5 50 50 100
 SCHEME OF INSTRUCTIONS FOR 6TH SEMESTER

Credit Hours/Week Marks

Contact
Course Code Course Title
hrs/wk
L T P S Total CIE SEE Total

Theoretical
1 6 C S 6 D C T F C Foundations of 3 1 - - 4 5 50 50 100
Computations

Mobile Application
1 6 C S 6 D C M A D 3 - 1 2 6 5 50 50 100
Development

Object Oriented
1 6 C S 6 D C O O M 3 - 1 0 4 5 50 50 100
Modeling and Design

Software Project
1 6 C S 6 H S H S 1 2 - - - 2 2 50 50 100
Management

Department Elective
1 6 C S 6 D E D E 2 3 - 1 2 6 5 50 50 100
–2

Department Elective
1 6 C S 6 D E D E 3 3 - - - 3 3 50 50 100
–3

Total 17 1 3 4 25 25 600
 Credit Hours/Week Marks
Department Contact
Course Code
Elective - 2 hrs/wk
L T P S Total CIE SEE Total

Mobile Adhoc
1 6 C S 6 D E M A N 3 - 1 2 6 5 50 50 100
Networks

1 6 C S 6 D E C C T Cloud Computing 3 - 1 2 6 5 50 50 100

1 6 C S 6 D E A I N Artificial Intelligence 3 - 1 2 6 5 50 50 100

Department Credit Hours/Week Marks

Contact
Course Code
Elective - 3 hrs/wk
L T P S Total CIE SEE Total

System Software &

1 6 C S 6 D E S S D 3 - - - 3 3 50 50 100
Compiler Design

Cryptography and
1 6 C S 6 D E C N S 3 - - - 3 3 50 50 100
Network Security

1 6 C S 6 D E S A N Storage Area Networks 3 - - - 3 3 50 50 100

Fuzzy Logic and Neural

1 6 C S 6 D E F L N 3 - - - 3 3 50 50 100
Networks
V SEMESTER
SYLLABUS
 V SEMESTER
COMPUTER NETWORKS
Contact Hours/Week: 04 L-T-P-S: 4-0-1-0
Total Lecture Hours: 52 CIE Marks: 50
Subject Code: 16CS5DCCON SEE Marks: 50

UNIT 1:

Application Layer:Principles of Network Applications: Network Application 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: FTP
Commands and Replies, Electronic Mail in the Internet: SMTP, Comparison with HTTP, Mail Message
Formats, Mail Access Protocols. 10 hours

UNIT 2:
Application Layer: DNS-The Internet’s Directory Service: Services Provided by DNS, Overview of
How DNS Works, DNS Records and Messages, Socket Programming: Creating Network Applications,
Socket Programming with TCP, Socket programming with UDP.
Transport layer: Introduction and Transport-Layer Services: Relationship Between Transport and
Network Layers, Overview of the Transport Layer in the Internet, Multiplexing and Demultiplexing.
10 hours

UNIT 3:
Transport layer: Connectionless Transport-UDP: UDP Segment Structure, UDP Checksum,
Connection-Oriented Transport-TCP: The TCP Connection, TCP Segment Structure, Round-Trip Time
Estimation and Timeout, Reliable Data Transfer, Flow Control, TCP Connection Management.
10 hours

UNIT 4:
Transport layer: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.
Network Layer:Introduction: Forwarding and Routing, Network Service Models, What’s Inside a
Router: Input Processing, Switching, Output Processing, Where Does Queuing Occur?,The Routing
Control Plane. 10 hours

UNIT 5:

Network Layer: The Internet Protocol (IP): Forwarding and addressing in the Internet, Datagram
Format,IPv4 Addressing, ICMP, IPv6.
Routing Algorithms: The Link-State Routing Algorithm, The Distance-Vector Routing Algorithm,
Hierarchical Routing, Routing in the internet: RIP, OSPF, BGP. 12 hours

Text books:
1. “Computer Networking: A Top - Down Approach” by James F. Kurose and Keith W. Ross,
Pearson Education, Sixth Edition Inc, 2013.

Reference Books:
1. “Data Communications and Networking” by Behrouz A. Forouzan, 5th Edition, Tata McGraw-Hill,
2012.
2. “Data and Computer Communication” by William Stallings: 10th Edition, Pearson Education, 2013.
3. “Computer Networks – A Systems Approach” by Larry L. Peterson and Bruce S. David:, 4th
Edition, Elsevier, 2014.

E-Books:
1. An Introduction to Computer Networks Release 1.8.17 by Peter L Dordal, 2016.
2. Networking all in one for dummies- 4th edition by Doug Lowe

MOOCs:
1. http://nptel.ac.in/courses/106105081/1
2. https://www.coursera.org/course/comnetworks

Course Outcomes:

CO Number Course Outcome

CO1 Analyze the different protocols functioning at application layer.
CO2 Analyse Transport Layer protocols and its functionalities.
CO3 Analyze the flow control and congestion control services of TCP.
CO4 Describe network layer functionalities and Apply Routing protocols for forwarding of
packets.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
Lab Internals 25
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 ANALYSIS AND DESIGN OF ALGORITHMS
Contact Hours/Week: 07 L-T-P-S: 3-1-1-0
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS5DCADA SEE Marks: 50

UNIT 1:
Introduction
Algorithms, Fundamentals of Algorithmic Problem Solving, Space Complexity, Time Complexity,
Asymptotic notations, Mathematical Analysis of Non- recursive algorithms, Mathematical Analysis of
Recursive Algorithms. Introduction to Brute Force Technique, Exhaustive Search.8 Hours

UNIT 2:
Divide and Conquer Technique
Introduction, Merge Sort, Quick Sort, Strassen's Matrix Multiplication.Sorting Networks: Comparison
networks, Zero-one principle, Abitonic sorting network, Merging network.5 Hours
Decrease and Conquer Technique
Introduction, Depth First Search [DFS], Breadth First Search [BFS], Topological Sorting, Analysis of
Insertion Sort Algorithm. 4 Hours
Backtracking
Introduction, Sum of Subsets,N-Queens Problem, Knapsack Problem.3 Hours

UNIT 3:
Dynamic Programming Technique
Introduction, Binomial Coefficient, Floyd's Algorithm, Knapsack Problem, Travelling Salesman Problem,
Multistage Graphs, Longest Common Subsequence.6 Hours
Transform and Conquer Technique
Introduction, Presorting, Heap sort, Horner’s Rule for Polynomial Evaluation. 3Hours

UNIT 4:
Greedy Technique
Introduction, Spanning Tree, Finding MST using Prims’ and Kruskals' Algorithm, Dijkstra's Algorithm,
Job Sequencing with Deadline, Knapsack Problem, Activity-selection problem.7 Hours
Complexity Classes
P and NP classes: Introduction, Comparison, Approximation Algorithm for NP hard: Hamiltonian Cycle
Problem, Algorithm for NP Complete Problems: Vertex Cover Problem. 3 Hours

Text Books:

1. “Introduction to the Design and Analysis of Algorithms” by AnanyLevitin, Pearson Education, 2nd
Edition,2011.
2. “Introduction to Algorithms”, Revised second edition, T.H. Cormen, C.E.Leiserson, R.L. Rivest and
C. Stein, PHI Pvt. Ltd./ Pearson Education, 2009.

Reference books:

1. “Fundamentals of Computer Algorithms”, Ellis Horowitz, SatrajSahni and Rajasekharam, University

Press Pvt. Ltd, 2nd Edition, 2009.
2. “Analysis and design of Algorithms”, Padma Reddy, Sri Nandi Publications, 2009.

E-Books:

1. “Introduction to Design & Analysis of Algorithms” by K. RaghavaRao, Smashwords 2013.

2. “Data structures and Algorithm Analysis in C++”, Allen Weiss, Fourth edition, Pearson
education, 2014

MOOCs:

1. http://www.nptelvideos.in/2012/11/design-analysis-of-algorithms.html
2. http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms
3. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-
algorithms-fall-2011/lecture-videos/

Course Outcomes:

CO Number Course Outcome

CO1 Apply asymptotic notations to analyze and compare performance of algorithms.
CO2 Design an efficient algorithm by applying appropriate
algorithm design technique.
CO3 Analyze time complexity of any given algorithm.
CO4 Classify problems as P, NP and NP-complete problems and analyze its significance
and limitations.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
Lab 25
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from five units, three units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 INTERNET OF THINGS

Contact Hours/Week: 05 L-T-P-S: 3-0-1-2

Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS5DCIOT SEE Marks: 50

UNIT 1:
Introduction To Internet Of Things
Definition and Characteristics of IoT, Physical Design of IoT – IoT Protocols, IoT communication
models, IoT Communication APIs IoT enabled Technologies – Wireless Sensor Networks, Cloud
Computing, Big data analytics, Communication protocols, Embedded Systems, IoT Levels and
Templates. Overview of Microprocessor and Microcontroller, Basics of Sensors and actuators.
9 Hours

UNIT 2:
Prototyping IoT Objects Using Microprocessor/Microcontroller
Working principles of sensors and actuators – Setting up the board - Programming for IOT – Reading
from Sensors, Communication: Connecting microcontroller with mobile devices – communication
through Bluetooth, Wi-Fi, Ethernet, Zigbee, RFID, NFC. 10 Hours

UNIT 3:
Iot Architecture And Protocols
Architecture Reference Model- Introduction, Reference Model and architecture, IoT reference Model.
Protocols- 6LowPAN, RPL, CoAP, MQTT.
Device Discovery Management
Device Discovery capabilities – Registering a device, De-register a device, Querying for devices, Intel
IoTivity, XMPP Discovery extension. 11 Hours

UNIT 4:
Cloud Services ForIoT
Introduction to Cloud Storage models and communication APIs Webserver – Web server for IoT, Cloud
for IoT, Python web application framework designing a RESTful web API, Amazon Web services for
IoT. 9 Hours
Text Books:
1. “Internet of Things (A Hands-on-Approach)”byVijay Madisetti and ArshdeepBahga, , 1stEdition,
VPT, 2014. ( UNIT 1 AND UNIT 4)
Note : Hand Notes will be provided to the students for UNITS 2 & 3

Reference Books:

1. “TheInternet of Things – Key applications and Protocols” by Olivier Hersent, David Boswarthick,
Omar Elloumi , , Wiley, 2012
2. “Internet of Things with Arduino: Build Internet of Things Projects With the Arduino
Platform” by Marco Schwartz
3. “Enabling Things to Talk - Designing IoT solutions with the IoT Architectural Reference”

E-Books:

1. Designing for the Internet of Things, O'Reilly, February 2015

2. Getting Started with the Internet of Things, O'Reilly 4th edition, October, 2015

MOOCs:

1. www.coursera.org/specializations/iot
2. www.futurelearn.com/courses/internet-of-things

Course Outcomes:

CO Number Course Outcome

CO1 Analyze IoT architectural components
CO2 Interfacing Sensor and Actuator with Arduino development board.
CO3 Describe protocols of resource constraint network
CO4 Apply device discovery and cloud services for IoT applications.
CO5 Design and develop IoT applications
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 SOFTWARE ENGINEERING

Contact Hours/Week: 3 L-T-P-S: 3-0-0-0

Total Lecture hours: 39 CIE Marks: 50
Subject Code: 16CS5DCSWE SEE Marks: 50

UNIT 1:
OVERVIEW: Introduction: FAQs about software engineering, Professional and ethical responsibility.
Software Process Models,Process Iteration,Process Activities.
REQUIREMENTS: Software requirements: Functional and Non-functional requirements, User
requirements, System requirements, Interface specification, The software requirements document,
Requirements engineering process, Feasibility studies, Requirements elicitation and analysis,
Requirements validation, Requirements management.10 Hours

UNIT 2:
SYSTEM MODELS: System models: Context models, Behavioural models, Data models, Object
models, structured methods.
SOFTWARE DESIGN: Architectural Design: Architectural Design Decisions, system organizations,
Modular decomposition styles, control Styles. Object-Oriented Design: Objects and Object classes, An
object oriented design process, Design evolution.9 Hours

UNIT 3:
Software Project Management:The Management spectrum,Management of people,product,processAnd
project,The W5HH Principle,Critical practices.
Estimation for Software Project:Software Project estimation;Decomposition
techniques,Examples,EmpiricalEstimation models.Software Project Scheduling:Basis concept and
principles of Project scheduling,Defining task set and task Network;Scheduling.Risk
Management:Reactive versus proactive strategies;Software Risks,Risk identification,Risk
mitigation,monitoring and management.The RMMM Plan.10 Hours

UNIT4:
DEVELOPMENT: Rapid software development, Agile methods, Extreme programming, Rapid
application development, Software evolution, Legacy system evolution.
VERIFICATION AND VALIDATION: Verification and validation: Planning, Software inspections,
Automated static analysis, Verification and formal methods. Software testing: System Testing,
Component testing, Test case design, test automation.10 Hours
Text Books:
1. “Software Engineering”by Ian Somerville, 8th Edition, Pearson Education, 2007.
2. “Software Engineering: A Practitioners Approach” by Rogers S Pressman, 7th edition,
MCGrawHill, 2007.

Reference Books:
1. “Software Engineering theory and Practice” by Shari Lawrence Pfleeger, Joanne m Atlec, 3rd
edition, Pearson Education, 2006.
2. “Software Engineering Principles and Practice” byWaman S Jawadekar, Tata McGraw Hill, 2004.

MOOCs:
1. www.nptelvideos.com/software-engineering/Software Engineering_video_lectures.php
2. http://onlinevideolecture.com/?subject=Software%20Engineering
3. www.courseera.org/learn/Software-Processes-and Agile Practices

E-Books:

1. Fundamentals of Software Engineering by Rajib Mall.

2. Software Engineering E-book by Roger.S.Pressman A practitioner’s Approach.
3. An Integrated approach to Software Engineering by PankajJalote.

Course Outcomes:

CO Number Course Outcome

CO1 Analyse the system to be automated for identifying the software requirements.
CO2 Create High-level and Low-level design of an application from the identified
software requirements
CO3 Estimate cost and time required to develop an application.
CO4 Comprehend various software testing techniques.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 2*5=10
2 Internals 2*20=40

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 PROGRAMMING IN PYTHON

Contact Hours/Week: 05 L-T-P-S: 3-0-1-2

Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS5DEPIP SEE Marks: 50

UNIT 1:
Introduction to Python, Python Concepts, Dynamic vs. Static Types, Interpreted vs. Compiled,
Prototyping, Procedural vs. Object-Oriented Programming, Comparing Programming Languages-C, C++,
JAVA,C#, Python, The Python Interpreter, Python Versions, Using the Python Command Prompt,
Commenting Python, Launching Python programs, Integrated Development Environments, Types and
Operators, Python Syntax , Indentation, Multiple Line Spanning, Python Object Types, Python Numbers.
Strings: Basic string operations, Indexing and slicing strings, String Formatting, Combining and
Separating Strings, Regular Expressions .
Lists: List usage, Adding List Elements, Mutability, Methods.
Dictionaries: Making a dictionary, Basic operations, Dictionary details, Operation.
Tuples: Why Use Tuples? Sequence Unpacking, Methods .
Statements: Assignment, Expressions/Calls, Printing, if Tests, while Loops, for Loops, pass Statement,
break and continue Statements .try, except, finally and raise Statements, import and from Statements, def
and return Statements , Class Statements, Scope, Default Arguments.10 Hours

UNIT 2:
Files: File Operations, Files and Streams, Creating a File, Reading From a File, Iterating Through Files,
Seeking, Serialization.
Exceptions: Exception Class Hierarchy, User-Defined Exceptions.
Object Oriented Programming: Learning Python Classes, How Are Classes Better? , “New-style” classes,
Inheritance , Operator Overloads, Class Methods.
Databases: How to Use a Database, Working With a Database , Using SQL to Query a Database, Python
and SQLite, Creating an SQLite DB, Pulling Data from a DB, SQLite Database Files, Distributing Your
Program. 10 Hours

UNIT 3:
GUI development – examining GUI, understanding event driven programming, root window, labels,
buttons, creating a GUI using a class, binding widgets and event handlers, text and entry widgets and Grid
layout manager, check buttons, radio buttons, mad lib program.
Graphics – Pizza panic game, creating a graphics window, setting background image, understanding the
graphics coordinate system, displaying sprite, text, message, moving sprites, dealing with screen
boundaries, mouse input, collisions.10 Hours

UNIT 4:
Sound, animation and program development – reading keyboard, rotating a sprite, creating an animation,
working with sound and music, astrocrash game, asteroids, rotating the ship, moving the ship, firing
missiles, controlling the missile rate, collisions and explosions, adding levels, store keeping and theme
music. 9 Hours
Text books:
1. “Learning to Program using Python” by Cody Jackson, Second Edition, 2014.
2. “Python Programming”, Michael DAWSON, 3rd Edition, Course technology PTR, 2010

Reference Books:

1. “Introducing Python”by Bill Lubanovic, O'Reilly Media, Edition 2014.

2. “Learning Python Network Programming” by Dr. M. O. FaruqueSarker and Sam Washington,
Packt Publishing, 2015.
3. ‘Python Essential Reference”, 4th Edition by David M. Beazley, Pearson Education, Inc., Edition
– 2009
4. “Python Crash Course: A Hands-on, Project Based Introduction to Programming” by Eric
Matthes, No Starch Press Inc, San Francisco, 2016.
E-books:

1. Learning Python, Fifth Edition by Mark Lutz, 2013

2. Programming in Python 3: A Complete Introduction to the Python Language 1st Edition
MOOCS:

1. https://www.coursera.org/course/interactivepython1
2. https://www.coursera.org/course/interactivepython2

Course Outcomes:
CO Number Course Outcome
CO1 Demonstrate the salient features of python.
CO2 Illustrate object oriented concepts using python programming.
CO3 Demonstrate database storage and retrieval in python.
CO4 Develop User-interface and graphics applications in python.
CO5 Design and develop interactive applications for a given real world requirements.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 ADVANCED JAVA

Contact Hours/Week: 05 L-T-P-S: 3-0-1-2

Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS5DEJAV SEE Marks: 50

UNIT 1:
Swings: Swings, The origins of Swing, Two key Swing features, Components and Containers, The 10Hrs
Swing Packages,A simple SwingApplication,Create a Swing Applet, Jlabel and ImageIcon,
JTextField, TheSwing Buttons, JTabbedpane, JScrollPane,JList,JComboBox, JTable.

UNIT 2: 10Hrs
The Concept of JDBC, JDBC Driver Types, JDBC Packages, A Brief Overview of the JDBC
process, Database Connection, Associating the JDBC/ODBC Bridge with the Database, Statement
Objects, ResultSet, Transaction Processing, Metadata, Data types, Exceptions.
Servlets: Background, The Life Cycle of a Servlet, Using Tomcat for Servlet Development, A
simple Servlet, The Servlet API.The Javax.servlet Package, Reading Servlet Parameter, The
Javax.servlet.http package, Handling HTTPRequests and Responses, Using Cookies, Session
Tracking.

UNIT 3: 10Hrs
JSP, RMI: Java Server Pages (JSP): JSP, JSP Tags, Tomcat, Request String,User Sessions,
Cookies, Session Objects.
Java Remote Method Invocation: Remote Method Invocation concept, ServerSide, Client side.
Enterprise Java Beans: Enterprise java Beans, Deployment Descriptors, Session Java Bean, Entity
Java Bean, Message-Driven Bean, The JAR File.

UNIT 4: 9 Hrs
Networking Basics: The Networking Classes and Interfaces, InetAddress, Factory Methods,
Instance Methods, Inet4Address and Inet6Address, TCP/IP Client Sockets.
URL, URLConnection, HttpURLConnection, The URI Class, Cookies, TCP/IP Server Sockets,
Datagrams, DatagramSocket, DatagramPacket, A Datagram Example.

Text Books:
 2. “Java the Complete Reference” by Herbert Schildt, 9th edition, Tata McGraw-hill Edition 2014
2. “J2EE - The Complete Reference” by Jim Keogh ,Tata McGraw Hill, 2007

1. Reference Books:

1.”Introduction to JAVA Programming” by Y. Daniel Liang, 6th edition, pearson education, 2007.

2. 2. “Programming in JAVA 5.0”, James P Cohoon, Jack W Davidson; TATA McGraw hill. Cay
S H orstmann, Gary Cornell: Core Java2, Volume 1 and 2 , Seventh Edition, Pearson Education.
3. 3. “The J2EE Tutorial” by Stephanie Bodoff ,2nd Edition, Pearson Education, 2004.
4. ‘Head First Servlets and JSP” by Shroff,2nd Edition, O,Reilly Publications ,2008.

E-Books:
5. Oracle Technology Network
6. Essentials of the Java Programming Language: A Hands -On Guide
7. Building Object-Oriented, Multi-Threaded Applications with Java by Bill Venners,
8. Java Reference Guide by Stevens Haines
5.Getting Started with Java

MOOCs:

1.https://www.edx.org/course/introduction-programming-java-part-1-uc3mx-it

2. http://www.learnerstv.com/video/Free-video-Lecture-226-Computer-Science.htm

Course Outcomes:

CO Number Course Outcome

CO1 Demonstrate and develop the different applications using Swings.
CO2 Develop the java applications to use database connection using JDBC
Package.
CO3 Demonstrate and develop servlet application.
CO4 Demonstrate the concepts JSP, RMI and Java beans.
CO5 Demonstrate & develop the basic Network concepts in Java.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100
marks. Students have to answer 5 questions from four units, two units to carry one
question each(mandatory), two units to carry two questions each (internal choice) and the
last question is from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course
shall be judged individually and together based on the results of CIE and SEE.
 C# AND .NET
Contact Hours/Week: 05 L-T-P-S: 3-0-1-2
Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS5DECDN SEE Marks: 50

UNIT 1:
Introducing the Building Blocks of the .NET Platform (the CLR, CTS, and CLS), Additional .NET-
Aware Programming Languages, An Overview of .NET Assemblies, Building C# Applications Using
csc.exe, The Anatomy of a Simple C# Program, The System.Console Class, System Data Types and
Corresponding C# Keywords, Working with String Data,Method Parameter Modifiers, Understanding
Value Types and Reference Types, Arrays, Understanding C# Nullable Types.
The First Pillar: C#'s Encapsulation Services The Second Pillar of OOP: The Details of Inheritance,
The Third Pillar of OOP: C#'s Polymorphic Support, Understanding the .NET Delegate Type, The
Simplest Possible Delegate Example, Understanding C# Events.10 Hours

UNIT 2:
Understanding Structured Exception Handling:The Role of .NET Exception Handling, The Simplest
Possible Example, Configuring the state of an Exception, System-Level Exceptions
(System.SystemException), Application-Level Exceptions (System.ApplicationException),
Understanding Object Lifetime:Classes, Objects, and References, The Basics of Object Lifetime, The
Role of Application Roots, Understanding Object Generations, The System.GC Type, Building
Finalizable Objects, Building Disposable Objects. 9Hours

UNIT 3:
A High-Level Definition of ADO.NET, Understanding ADO.NET Data Providers, Understanding the
Connected Layer of ADO.NET, Working with Data Readers, Understanding the Disconnected Layer
of ADO.NET, Understanding the Role of the DataSet, Working with DataColumns, Working with
DataRows, Working with DataTables, Working with Data Adapters.
The Role of HTTP, Understanding Web Applications and Web Servers, The Role of HTML, The
Role of Client-Side Scripting, Posting Back to the Web Server, Building a Single-File ASP.NET Web
Page, Building an ASP.NET Web Page Using Code Files, ASP.NET Web Sites vs. ASP.NET Web
Applications, The ASP.NET Web Site Directory Structure. 10 Hours

UNIT 4:
Understanding the Nature of Web Controls, The Control and WebControl Base Classes, Major
Categories of ASP.NET Web Controls, The Role of the Validation Controls, The Issue of State,
ASP.NET State Management Techniques, Understanding the Role of ASP.NET View State, The Role
of the Global,asax File, Understanding the Application/Session Distinction, Working with the
Application Cache, Maintaining Session Data, Understanding Cookies, The Role of the
<sessionState> Element, Introducing the ASP.NET Profile API. 10 Hours

Text Books:
1. “Pro C# 5.0 and the .NET 4.5 Framework” by Andrew Troelsen (SixthEdition) Apress
2012.

Reference Books:
1. “Pro ASP.NET 4 in VB 2010” by Matthew MacDonald, Dan Mabbutt, Adam Freeman.
1. “Programming C# 4.0”, 6th Edition, Ian Griffiths, Jesse Liberty, Matthew Adams , 6th
edition , O'Reilly Media 2010.

E-Books:
1.Pro C# 5.0 and the .NET 4.5 Framework by Andrew Troelsen (Sixth Edition) Apress 2012.
2.Programming C# 4.0, 6th Edition, Ian Griffiths, Jesse Liberty, Matthew Adams , 6th edition ,
O'Reilly Media 2010.

MOOCs:
1. https://www.edx.org/course/programming-c-microsoft-dev204x-1
2. http://www.homeandlearn.co.uk/csharp/csharp.html
3. https://mva.microsoft.com/en-us/training-courses/c-fundamentals-for-absolute-beginners-
8295
4. http://www.tutorialspoint.com/csharp/
Course Outcomes:

CO Number Course Outcome

CO1 Develop Applications using C# Programming Language.
CO2 Design & Demonstrate the use of Exception Handling, Garbage collection, delegate
and Events in C# Programs.
CO3 Design and Develop Web Applications using ADO.NET.
CO4 Design and Develop Web Applications using ASP.NET.
CO5 Designing and developing a web based project.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
VI SEMESTER
SYLLABUS
 VI SEMESTER
THEORETICAL FOUNDATIONS OF COMPUTATION

Contact Hours/Week: 03 L-T-P-S: 3-1-0-0

Total Lecture Hours: 39 CIE Marks: 50
Subject Code:16CS6DCTFC SEE Marks: 50

UNIT 1:
Introduction to Finite Automata
Introduction to Finite Automata, Central Concepts of Automata Theory, Deterministic Finite Automata
(DFA), Nondeterministic Finite Automata (NFA), Equivalence of NFA and DFA. Text search using
automata. 9 Hours
UNIT 2:
Regular Expressions and Regular Languages
Relation between Regular Expressions and Regular Languages, Regular grammars, Pumping Lemma,
Equivalence and minimization of automata, Closure properties of regular languages. Applications of RE –
RE in Unix, Lexical analysis, finding patterns in text.9 Hours
UNIT 3:
Context Free Grammars and Languages
Parse trees, Application of Context Free Grammars, Ambiguity in Grammars and Languages,
Simplification of Context Free Grammar, Normal Forms – CNF and GNF, Pumping Lemma for CFG’s,
Closure properties of CFG’s. Applications of CFG- Parsers, YACC, Mark up languages, XML. 10
Hours

UNIT 4:
Push Down Automata
Languages of PDA: Acceptance by final state, empty stack and conversion. Equivalence of PDA’s and
CFG’s, Deterministic Push Down Automata.
Turing Machines
Definition, Notation, Instantaneous Description and Languages, Design of TM’s, Extension of Basic TM:
Multitape TM, Restricted TM, Semi-infinite tape Machines, Multi-stack TM. Introduction to undecidable
problems, Post-correspondence Problem.11 Hours
Text Books:
1. “Introduction to Automata Theory, Languages and Computation” by John E. Hop croft, Rajeev
Motwani, Jeffrey D.Ullman: 3rd Edition, Pearson education, 2007.

Reference Books:
1. ‘Introduction to Languages and Automata Theory” by John C Martin, 3rd Ed, Tata McGraw-Hill,
2007.
2. “An Introduction to formal Languages and Automata” by Peter Linz,Narosa publishing house, II
edition, 1997.
3. “Introduction to Computer Theory” by Daniel I.A. Cohen, John Willy & Sons, Inc, 2nd Edition,
2000.

E- Books:

1. Foundations of Computation-CAROL CRITCHLOW, DAVID ECK

2. Introduction to Theory of Computation- Anil Maheshwari,Michielsmid-carleton University-2012

MOOCs:

1. www.nptel/videos.in/2012/11/theory-of-computation.html
2. nptel.ac.in/courses/106104028/theory of computation.

Course Outcomes:

CO Number Course Outcome

CO1 Design finite automata for given languages.
CO2 Write regular expressions for given languages.
CO3 Convert finite automata to regular expressions and vice versa.
CO4 Design context free grammar for specified language.
CO5 Design Push Down Automata and Turing Machine.

ASSESSMENT:

CIE Scheme:
 Assessment Weightage in Marks
2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.
 MOBILE APPLICATION DEVELOPMENT

Contact Hours/Week: 05 L-T-P: 3-0-1-2

Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS6DCMAD SEE Marks: 50

UNIT 1:
HELLO, ANDROID: A Little background, Android: An Open Platform for Mobile Development,
Native Android Applications, Android SDK Features: Access to Hardware including Camera, GPS, and
Sensors, Data Transfers Using Wi-Fi, Bluetooth, and NFC, Maps, Geocoding, and Location-Based
Services, Background Services, SQLite Database for Data Storage and Retrieval, Shared Data and Inter-
Application Communication, Using Widgets and Live Wallpaper to Enhance the Home Screen, Extensive
Media Support and 2D/3D Graphics, Cloud to Device Messaging, Optimized Memory and Process
Management, Introducing the open handset alliance.
Introducing the Development Framework: What Comes in the Box, Understanding the Android
Software Stack, TheDalvik Virtual Machine, Android Application Architecture, Android Libraries.
Developing for Android, Android Development Tools. 8 Hours

UNIT 2:
Creating Applications and Activities: What Makes an Android Application?, Introducing the Application
Manifest, Using the Manifest Editor, Externalizing Resources, The Android Application Life Cycle,
Understanding Application Priority and Process States. Introducing the Android Application Class, A
Closer Look at Android Activities.
Building User Interfaces: Fundamental Android U I Design, Introducing Layouts, To-Do List Example,
Introducing Fragments. Creating New Views, Introducing Adapters.
Introducing Intents: Introducing Pending Intents .
Using Internet Resources: Connecting to an Internet Resource, Creating an Earthquake Viewer.
14 Hours
UNIT 3:
Files, Saving State, and Preferences: Saving Simple Application Data, Creating and Saving Shared
Preferences, Retrieving Shared references, Creating a Settings Activity for the Earthquake Viewer,
Introducing the Preference Framework and Preferences Activity, Creating a Standard Preference Activity
for the Earthquake Viewer, Including Static Files as Resources, Working with the File System: File
Management Tools.
Databases And Content Providers: Introducing Android Databases, Introducing SQLite, Content
Values and Cursers, Working with SQLite Databases, Creating a Content Providers, Using Content
Providers, Creating a Searchable Earthquake Content Provider, Native Android Content Providers.
8 Hours
UNIT 4:
Maps, Geocoding, andLocation-Based Services: Using Location-Based Services, Using the Emulator
with Location-Based Services, Selecting a Location Provider, Finding Your Current Location, Using
Proximity Alerts, Using the Geocoder, Creating Map-Based Activities, Mapping Earthquakes Example.
AUDIO, VIDEO, AND USING THE CAMERA: Playing Audio and Video, Manipulating Raw Audio,
Using the Camera and Taking Pictures, Using Media Effects, Adding Media to the Media Store.
BLUETOOTH, NFC, NETWORKS, AND WI-FI: Using Bluetooth, Managing Network and Internet
Connectivity, Managing Wi-Fi, Near Field Communication. 9 Hours

Text Books:
1. “Professional Android 4 Application Development”by Reto Meier, Wiley Publishing, 2012. ISBN:
978-1-118-10227-5

Reference Books:
1. “Pro Android”by Sayed Y. Hashimi, SatyaKomatineni, Apress, 2009.
2. “Professional Android Application Development”by Reto Meier, Wiley Publishing, 2009.
3. “Beginning Android”by Mark Murphy, Apress, 2009.
4. “The Android Developer’s Cookbook: Building Applications with the Android SDK”by James
Steele, Nelson To, Addison-Wesley Professional; 2010.

E-Books:
1. Beginning Android 4 Application Development by Wei-Meng Lee, Worx
Wiley Publishing, 2014. http://www3.ul.ie/ictlc/Android.pdf

2. Android Tutorial Simply Easy Learning,

https://www.tutorialspoint.com//android/android_tutorial.pdf

MOOCS:
1. https://www.coursera.org/learn/posacontent
2. https://www.edx.org/xseries/java-android-beginners
Course Outcomes:
CO Number Course Outcome
CO1 Ability to Comprehend the basics of Android development framework.
CO2 Ability to analyze and design user interfaces for the given specification.
CO3 Ability to demonstrate the saving of data on persistent storage.
CO4 Ability to apply different packages and hardware resources to design a given
application.
CO5 Design and develop a project using Android framework.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 OBJECT-ORIENTED MODELING AND DESIGN

Contact Hours/Week:05 L-T-P-S: 3-0-1-0

Total Lecture Hours: 39 CIE Marks: 50
Subject Code:16CS6DCOOM SEE Marks: 56

UNIT 1:
Class Modeling: Object and class concepts; Link and associations concepts; Generalization and 11 Hours
inheritance;
Advanced Class Modeling: Advanced object and class concepts; Association ends; N-ary
associations; Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification;
Constraints; Derived data; Packages.
State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior.

UNIT 2: 10 Hours
Advanced State Modeling: Nested state diagrams; Nested states; Signal generalization;
Concurrency;
Interaction Modeling: Use case models; Sequence models; Activity models.
Advanced interaction modeling: Use case relationships; Procedural sequence models; Special
constructs for activity models.

UNIT 3:
System Conception: Devising a system concept; elaborating a concept; preparing a problem 10 Hours
statement.
Domain Analysis: Overview of analysis; Domain class model;
Application Analysis: Application interaction model; Application class model;

UNIT 4: 8Hours
System Design: Overview of system design; Estimating performance; Making a reuse plan;
Breaking a system in to sub-systems; Choosing a software control strategy; Common architectural
styles; Architecture of the ATM system.
Class Design: Realizing use cases; Recurring downwards, Refactoring; Design optimization;
Reification of behavior; Organizing a class design; ATM example. Implementation Modeling:
Overview of implementation; Fine tuning classes; Fine-tuning generalizations; Realizing
associations.

Text Books:
1. “Object - Oriented Modeling and Design With UML”,2/e by Michael Blaha and James
Rumbaugh, Pearson Education, 2007.
2. “Pattern-Oriented Software Architecture: A System of Patterns” by Frank Buschmann,
RegineMeunier, Hans Rohnert, Peter Sommerlad, Michael Stal, Volume 1, John Wiley and Sons, 2006.

Reference Books:

1. “Object Oriented Systems Development” by Ali Bahrami, Irwin/McGraw-Hill, 1999

2. “Object-oriented Analysis and Design with Applications” by Grady Booch, Addison-Wesley,
2007

E-books:

1. Head First Object-Oriented Analysis and Design,

www.headfirstlabs.com/books/hfooad/.../HeadFirstOOAD_as05.pdf

MOOCs:

1. Software Architecture & Design, https://www.udacity.com/course/software-architecture-design--

ud821

Course Outcomes:
CO Number Course Outcome
CO1 Design class diagrams using advanced class modelling concepts.
CO2 Design state diagrams using advanced state modelling concepts.
CO3 Design use case diagrams, sequence diagrams& activity diagrams using advanced
interaction modelling concepts.
CO4 Analyse and Design Domain & Application models for a given system.
CO5 Analyse the different criterion for designing a system.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20(10+10)
Lab Internals 25(10+10+5)
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 SOFTWARE PROJECT MANAGEMENT

Contact Hours/Week : 2 L-T-P-S:2-0-0-0

Total Lecturehours : 26 CIE Marks : 50
Subject Code :16CS6HSHS1 SEE Marks : 50

UNIT 1:
Projects and their Environments: What is a Project?Project management, Project Manager, Benefits of
Project Management.
The Project Environment: Internal and External Environment, Programs, Mission, Goals, Objectives
and Strategy, Portfolios Management, Scoring Matrix, Financial Evaluation Criteria.
5 Hours

UNIT 2:
Software project planning, understand project needs, create and diagnose project plan.4 Hours

UNIT 3:
Integration: The Charter, Project Management Plan.
Scope: Beginning the Scope, Scope Contents, Triple Constraints, Priority Matrix, Scope Issues Sample
Scope Statement. 4 Hours

UNIT 4:
Estimation, Project schedules
Managing project cost, Estimation project cost, calculating total project cost ,monitoring and controlling
project cost 5 Hours

UNIT 5:
Project quality management: Key Concepts, Quality Planning, Quality Assurance, Quality Control.
Risks: Risks, Risks Strategies, Planning Risk Management, Identify Risks, Risk Assessment, Risk
Monitoring and Control. 5 Hours
Text Books:

4. “Applied software project management” by Andrew Stellman and Jennifer Green, Oriely
publications, 2012
5. “The Art and Science of Project Management” by Roger Warburton and Vijay Kanabar, , RW
Press Newport, 2nd Edition, 2013.

Reference Books:

1. “Project Management for Business, Engineering and Technology” by Nicholas, J. and Steyn, H.,
ELSEVIER.
2. “Project Planning, Analysis, Selection, Implementation and Review” by Prasanna Chandra, New
Delhi, Tata McGraw Hill Publications, 2000.

E-books:

1. http://www.free-management-ebooks.com/skills-project.htm
6. A Guide to the Project Management Body of Knowledge (PMBOK Guide), Project Management
Institute, http://www.pmi.org/en/PMBOK-Guide-and-Standards/Standards-Library-of-PMI-Global-
Standards.aspx

MOOCs:
1. http://nptel.ac.in/syllabus/110101009/

Course Outcomes:

CO Number Course Outcome

CO1 Understand the Project Management processes and identify all the elements
and construct project life cycle.
CO2 Develop and diagnose a software project plan.
CO3 Develop a project charter specifying the scope.
CO4 Estimating cost of a project.
CO5 Create a project plan identifying quality metrics to control quality, perform a
risk analysis.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from five units, three units to carry one question
each(mandatory) and two units to carry two questions each (internal choice).

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 MOBILE ADHOC NETWORKS

Contact Hours/Week: 05 L-T-P-S-:3-0-1-2

Total Lecture Hours: 39 CIE Marks: 50
Subject Code: 16CS6DEMAN SEE Marks: 50

UNIT 1:
Introduction
Introduction to adhoc networks–definition, characteristics features, applications.
Characteristics of Wireless channel, Adhoc Mobility Models:-Indoor and outdoor
models. 9 Hours

UNIT 2:
Medium Access Protocols
MAC Protocols: design issues, goals and classification. Contention based protocols- with
reservation, scheduling algorithms, protocols using directional antennas. IEEE standards: 802.11a,
802.11b, 802.11g, 802.15. HIPERLAN. 10 Hours

UNIT 3:
Network Protocols
Routing Protocols: Design issues, goals and classification. Proactive Vs reactive routing, Unicast routing
algorithms, Multicast routing algorithms, hybrid routing algorithm, Energyaware routing algorithm,
Hierarchical Routing, QoS aware routing. 10 Hours

UNIT 4:
End-End Delivery And Security
Transport layer: Issues in designing- Transport layer classification, adhoc transportprotocols. Security
issues in adhoc networks: issues and challenges, network securityattacks, secure routing protocols.
10 Hours

Text Books:
 1. “Ad hoc Wireless Networks Architectures andprotocols” byC.Siva Ram Murthy and
B.S.Manoj, 2nd edition, Pearson Education. 2007
2. “Ad hoc Networking” by Charles E. Perkins, , Addison – Wesley, 2000

Reference Books:
1. “Mobile ad hocnetworking”by Stefano Basagni, Marco Conti, Silvia Giordano and Ivan stojmenovic,
, Wiley-IEEE press, 2004

2.“The handbook of adhoc wireless networks”by MohammadIlyas, CRC press, 2002.

E-Books:
1. Handbook of Mobile Ad Hoc Networks for Mobility Models by RadhikaRanjan Roy
2. Adhoc Networks: Technologies and Protocols- PrasantMohapatra, Srikanth Krishnamurthy

MOOCs:
1.http://nptel.ac.in/courses/117104099/
2.http://nptel.ac.in/syllabus/syllabus.php?subjectId=106104124

Course Outcomes:
CO Number Course Outcome
CO1 Analyze basics of adhoc networks and different mobility models.
CO2 Analyze and apply different types of Medium access protocols used in adhoc
networks.
CO3 Analyze and apply different types of routing protocols.
CO4 Analyse transport layer protocols and security issues of adhoc networks.

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 CLOUD COMPUTING
Contact Hours/Week:05L-T-P-S: 3-0-1-2
Total Lecture Hours: 39 CIE Marks: 50
Subject code:16CS6DECCT SEE Marks: 50

UNIT 1:

Introduction to Cloud Computing: Cloud Computing in a nutshell, Roots of cloud computing, Layers
and Types of cloud, Features of cloud, Cloud Infrastructure Management , Challenges and Risk, Benefits:
Economic, Operational and Staffing, Hardware and Infrastructure: Client, Security , Network , Services.
9 Hours

UNIT 2:

Infrastructure as a service provider: Features, Platform as a service provider: Features, Cloud Computing
with the Titans: Google, Microsoft, Amazon , Salesforce. Sofware as a service: Overview, Driving
Forces, Case Studies of Company Offerings. Software Plus Services: Overview
10 Hours

UNIT 3:

Cloud Storage: Basics, Storage as a service, Providers, Security, Reliability, Advantages, Cautions,
Outages, Theft.2 Hours

Virtualization for Cloud: Need for Virtualization – Pros and cons of Virtualization – Types of
Virtualization – System VM, Process VM, Virtual Machine monitor – Virtual machine properties -
Interpretation and binary translation, HLL VM - Hypervisors – Xen, KVM , VMWare, Virtual Box,
Hyper-V. 8 Hours

UNIT 4:

Cloud Applications: Exploring online calendar applications, Online scheduling applications , Web Based
Spread Sheets ,Contact Management &CRM applications, Collaborating on databases – Understanding
database management, exploring web based data bases.
Map Reduce Programming Model and Implementation: Introduction, Map Reduce Programming
Model, Major Map Reduce Implementation for Cloud: Hadoop10 Hours

Text Books:

1. “CLOUD COMPUTING – Principles and Paradigms” by RajkumarBuyya, James Broberg,

AndrzejGoscinski, WILEY: A JOHN WILEY & SONS, INC., PUBLICATION, 2011.

2. “Cloud Computing: A practical Approach” by Anthony T. Velte, Toby J. Vetle and Robert
Elsenpeter, McGrawHill, 2010.

3. “Virtual Machines”, James E Smith, Ravi Nair, Morgan Kaufmann Publishers, 2006.

4. “CLOUD COMPUTING Web Based Application That Change the Way You Work and
Collaborate Onlne” by Michael Miller, Que.

E-books:

1. “Cloud Services for Dummies”by Judwith Hurwitz, Marcia Kaufman, Dr Fern Halper, Wiley: A
John Wiley & Sons, Inc., Publication.
2. “CLOUD COMPUTING – Theory and Practice” by Dan C Marinescu, MK Publication,2012.

Reference Books:

1. “CLOUD COMPUTING” by Dr. Kumar Saurabh, Second Edition, WILEY INDIA

MOOCs:

1. http://nptel.ac.in/courses/106106129/21
2. https://alison.com/courses/Introduction-to-Cloud-Computing

Course Outcomes:

CO Number Course Outcome

CO1 Explain basics of cloud computing technology.
CO2 Analyze various cloud services and cloud service providers.
CO3 Describe virtualization concepts and illustrate virtualization products.
CO4 Experiment various cloud applications and paraphrase map reduce programming
module.

CIE Scheme:
 Assessment Weightage in Marks
1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project/ assignment covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 ARTIFICIAL INTELLIGENCE

ContactHrs/Week: 05 L-T-P-S:3-0-1-2
Total Lecture Hrs: 39 CIE Marks: 50
Subject Code: 16CS6DEAIN SEE Marks: 50

UNIT 1:
What is AI? Intelligent Agents: Agents and environment; Rationality; the nature of environment; the
structure of agents. Problem‐solving: Problem‐solving agents; Example problems;
Knowledge representation issues: Representations and mappings Approaches to knowledge
representation, Issues in knowledge representation. 10Hours

UNIT 2:
Logical Agents: Knowledge based agents, The Wumpus world, Logic-Propositional logic Propositional
theorem proving, Effective propositional model checking, Agents based on propositional logic.Using
predicate logic: Representing simple facts in logic. 10 Hours

UNIT 3:
Resolution, Natural Deduction, Learning: Forms of Learning; Inductive learning; Learning decision trees;
Ensemble learning; Computational learning theory. 10 Hours

UNIT 4:
Statistical learning, Maximum likelihood parameter learning, Bayesian parameter learning, passive
reinforcement learning, active reinforcement learning. 9 Hours

Text Books:
1. “Artificial Intelligence: A Modern Approach”by Stuart Russel, Peter Norvig, 2nd Edition,
Pearson Education, 2003.
2. “Artificial Intelligence” by Elaine Rich, Kevin Knight, Shivashankar B Nair: Tata MCGraw
Hill 3rd edition. 2013

Reference Books:
1. “Artificial Intelligence”by George F Luger, 5th Edition Pearson Education, 2009.
E Books:
1. Practical Artificial Intelligence Programming With Java,Third Edition ,Mark Watson
2. Artificial Intelligence Lecture Notes MIT.
MOOCs:
1. Artificial Intelligence -http://www.nptelvideos.in/2012/11/artificial-intelligence.html

Course Outcomes:
CO Number Course Outcome
CO1 Describe the modern view of AI as the study of agents that receive percepts and
perform actions.
CO2 Apply AI search Models and Generic search strategies.
CO3 Write Logic for representing Knowledge and Reasoning of AI systems.
CO4 Design different learning algorithms for improving the performance of AI systems.
CO5 Implement projects using differentAI learning techniques.

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

Self-Study Scheme:
Students will be carrying out a project work covering the concepts for learning practical
applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 SYSTEM SOFTWARE

Contact Hrs/Week: 03L-T-P-S: 3-0-0-0

Teaching Hours: 39hrsCIE Marks: 50
Course code: 16CS6DESSD SEE Marks: 50

UNIT 1:
Machine Architecture: Introduction, System software and machine architecture, Simplified instructional
computer (SIC) - SIC Machine architecture, SIC/XE machine architecture, SIC programming example.
Assemblers-1: Basic Assembler Function – A simple SIC assembler, Assembler algorithm and data
structures, Machine Dependent Assembler features – Instruction formats and addressing modes, Program
relocation.10 Hours

UNIT 2:
Assembler-2: Machine independent assembler features – Literals, symbol definition statements, expression,
program blocks, control sections and programming linking, assembler design operations –one pass
assembler, Multi pass assembler.
Loaders and Linkers: Basic loader functions, Design of an absolute loader, A simple bootstrap
loader,machine dependent loader features – Relocation, program linking, algorithm and Data structures for
linking loader, machine independent loader features. 10 Hours

UNIT 3:
Macro Processors: Basic macro processors Functions, macro definitions and expansion, macro processor
algorithm and data structures, machine Independent Macro processor features- Concatenation of macro
parameters, Generation of Unique labels, Conditional Macro expansion, Keyword macro parameters,
macro processor design options, Recursive macro Expansion, General purpose macroprocessors.9 Hours
UNIT 4:
Compilers
Basic Compiler Functions, Grammars, Lexical Analysis, Syntactic Analysis, Operator Precedence
Parsing,Code Generation. Machine dependent Compiler Features, Intermediate form of the
programs,Machine dependent Code Optimization.
Machine Independent Compiler Features,Structured Variables,Machine Independent Code Optimization,
Storage Allocation.10 Hours

Text Books:
1. “System Software”by Leland L Beck,D.Manjula, 3rd Edition, Addison Wesley,Pearson
Education,2012.

Reference Books:
1.“Compiler Principles Techniques and Tools”by Afred.V.aho,JeffreyD.Ullman:,2nd Edition,2014.
2.“System programming and operating systems”by D.M.Dhamdhere: 2nd Edition, TataMcGraw
Hill,2011.

E-books:
1.Introduction to System Software by Dhamdhere
2.System Programming by Srimanta Pal.

MOOCs:
1. http://nptel.ac.in/courses/106108052/1
2. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-035-computer-
language-engineering-sma-5502-fall-2005

Course Outcomes:
CO Number Course Outcome
CO1 Identify the appropriate data structures for various system software’s like
assemblers, linkers, and loaders.
CO2 Design systemsoftwares like assemblers, linkers, and loaders.
CO3 Illustrate the changes/extensions to be made for system softwares by considering
machine architecture and different requirements.
CO4 Describe the Machine Dependent and Machine Independent compiler features.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 2*5=10
2 Internals 2*20=40

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.
 CRYPTOGRAPHY AND NETWORK SECURITY

Contact Hrs/Week: 03 L-T-P-S: 3-0-0-0 Total

Lecture Hrs: 39 CIE Marks: 50Course Code: 16CS6DECNS SEE Marks: 50

UNIT 1:
Introduction: Security Goals, Attacks, Services and Mechanism, Techniques, Mathematics of
Cryptography, Integer arithmetic, Modular Arithmetic, Matrices, Linear Congruence, Primes, Primality
Testing, Factorization, Chinese Remainder Theorem. 9 Hours

UNIT 2:
Traditional Symmetrickey Ciphers: Introduction, Substitution Ciphers, Transposition Ciphers, Streams
and Block Ciphers, Introduction to Modern Symmetric Key Ciphers Modern Block Ciphers, Modern
Stream Ciphers. 10 Hours

UNIT 3:
Data Encryption Standard: Introduction, DES Structure, DES Analysis, Multiple DES, Security of
DES, Differential Cryptanalysis, Linear Cryptanalysis of DES, Encipherment Using Modern Symmetric
Key Ciphers Use of Modern Block Ciphers, Use of Stream Ciphers.10 Hours

UNIT 4:
Asymmetric Key Cryptography and Message Integrity: Introduction, RSA Cryptosystem, Message
Integrity, Message Authentication Cryptographic Hash Functions, Introduction, SHA-512, Digital
Signature Comparison, Attacks on Digital Signature.
User Authentication Protocols: Remote User Authentication Principles, Remote User Authentication
using Symmetric Encryption, Kerberos
Electronic Mail Security: PGP 10 Hours

Text Books:
1.“Cryptography and Network Security”by BehrouzA.Forouzan, Special Indian Edition, 2008
2.”Cryptography and Network Security”by William Stallings, 6th Edition, Pearson Education/PHI,
2014
Reference Books:
1. “Cryptography and Network Security”by AtulKahate, Tata McGraw Hill, 2003.
2. "RSA Security's official guide to cryptography" by Steve Burnett, Stephene Paine, RSA Pren,
Tata McGraw Hill Edition, 2001

E-books:
1. Online resources of Stallings's Cryptography and Network Security. Principles and Practice
http://williamstallings.com/Crypto3e.html
2. Online resources of Menez, van Oorschot, Vanstone's Handbook of Applied Cryptography
available at http://www.cacr.math.uwaterloo.ca/hac/

MOOCs:
1. NPTEL Course on http://nptel.ac.in/courses/106105031/
2. CryptographyI on Coursera, https://www.coursera.org/course/crypto

Course Outcomes:

CO Number Course Outcome

CO1 Able to demonstrate the basic components of security and mathematics of
cryptography.
CO2 Able to demonstrate various traditional symmetric key ciphers
CO3 Analyse DES and its variants.
CO4 Able to demonstrate private and public-key cryptosystem, Digital signature and
attacks on it.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 2*5=10
2 Internals 2*20=40

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.

STORAGE AREA NETWORKS

Contact Hours/Week: 03L-T-P-S: 3-0-0-0

Teaching Hours: 39hrsCIE Marks: 50
Course code: 16CS6DESSD SEE Marks: 50

UNIT 1:
Introduction to Storage Technology: Information Storage, Evolution of Storage Technology and
Architecture, Data Center Infrastructure, Key Challenges in Managing Information, Information
Lifecycle.
Storage System Environment: Components of a Storage System Environment , Disk Drive
Components.

10Hours
UNIT 2:
Storage System Environment:Disk Drive Performance, Fundamental Laws Governing Disk
Performance, Logical Components of the Host.
Data Protection: RAID:Implementation of RAID,RAID Array Components, RAID Levels,RAID
Comparison , RAID Impact on Disk Performance.
Intelligent Storage System:Components of an Intelligent Storage System,Intelligent Storage Array.

10Hours
UNIT 3:
Introduction to SCSI: Introduction to Parallel SCSI.
Storage Area Networks: Fibre Channel: Overview, The SAN and Its Evolution , Components of
SAN,FC Connectivity,Fibre Channel Ports, Fibre Channel Architecture,Zoning, Fibre Channel Login
Types , FC Topologies.
Software Components of SAN: The switch's Operating system; Device Drivers; Supporting the
switch's components; Configuration options for SANs.
Network-Attached Storage: General-Purpose Servers vs. NAS Devices, Benefits of NAS, NAS File
I/O Components of NAS, NAS Implementations,NAS File-Sharing Protocols, NAS I/O Operations.
IP SAN:iSCSI. 9Hours

UNIT 4:
Content-Addressed Storage:Fixed Content and Archives, Types of Archives, Features and Benefits
of CAS, CAS Architecture.
Storage Virtualization:Forms of Virtualization,SNIA Storage Virtualization Taxonomy, Storage
Virtualization Configurations, Storage Virtualization Challenges,Types of Storage Virtualization.

Text Books:
1. “Information Storage and Management” by G.Somasundaram, AlokShrivastava, EMC
Education Series, , Wiley, Publishing Inc., 2011.
2. “Storage Networks: The Complete Reference” by Robert Spalding, Tata McGraw Hill,
Osborne, 2003.

Reference Books:
1. “Building Storage Networks” by Marc Farley, Tata McGraw Hill, Osborne. 2001.
2. “Storage Area Network Fundamentals”by Meeta Gupta, , Pearson Education Limited, 2002.

E- Books:
1. Storage Area Networks For Dummies, 2nd Edition : by Christopher Poelker, Alex Nikitin.
2. Storage Area Network : by Kumar V.

MOOCs:
1. http://www.virtualnuggets.com/emcs--storage-area-network.html
2. http://nptel.ac.in/syllabus/106108058/

Course Outcomes:

CO Number Course Outcome

CO1 Describe the Storage Technology and Storage System Environment.
CO2 Analyse the various RAID and Intelligent Storage System.
CO3 Describe SCSI,Storage Area Networks and Network-Attached Storage.
CO4 Explain Content-Addressed Storage and storage virtualization.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 2*5=10
2 Internals 2*20=40

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.
 FUZZY LOGIC AND NEURAL NETWORKS

Contact Hours/Week :03 L-T-P-S: 3-0-0-0

Total Lecture Hours :39 CIE Marks :50
Subject Code : 16CS6DEFLN SEE Marks :50

UNIT 1:
Basic Concepts of Neural Networks, Models of an Artificial Neuron, Neural Network Architecture –
Single Layer Feedforward Network, Multilayer Feedforward Network, Recurrent Networks,
Characteristics of Neural Networks, Learning Methods, Taxonomy of Neural Network. Early Neural
Network Architecture.9 Hours
UNIT 2:
Architecture of a Backpropagation Network, Backpropagation Learning, Effect of tuning parameters of
the Backpropagation Neural Network, Selection of Various Parameters in Backpropagation Network,
Variations of Standard Back propagation Algorithm. 9 Hours

UNIT 3:
Fuzzy versus Crisp, Crisp Sets- Operations on Crisp Sets, Properties, Partition and Covering, Fuzzy Sets
–Membership Function, Basic Fuzzy Set Operations, Properties of Fuzzy Sets, Crisp Relations –
Cartesian Product, Other Crisp Relation, Operations of Relations, Fuzzy Relations – Fuzzy Cartesian
Product, Operations on Fuzzy Relations. 11 Hours

UNIT 4:
Crisp Loigic, Predicate Logic, Fuzzy Logic, Fuzzy Rule based System, Defuzzification Methods
Neuro-Fuzzy Hybrids, Fuzzy –Backpropagation Network – Fuzzy Neuron, Fuzzy Back Propagation
Architecture, Learning in Fuzzy Backpropagation.10 Hours

Text Books:
1. “Neural Networks, Fuzzy Logic and Genetic Algorithms” by S. Rajasekaran and G.A.V.Pai,
PHI,2003.
Reference Books:

1. “Neuro-Fuzzy and Soft Computing” by J.S.R.Jang, C.T.Sun and E.Mizutani, PHI, 2004, Pearson
Education 2004.

E-Books:

1. Timothy J.Ross, “Fuzzy Logic with Engineering Applications”

MOOCs:

1. Ahmad Ibrahim, "Introduction to Neural Networks" in TechOnLine Courses

http://www.techonline.com/learning/course/100106
2. Marcelo Godoy Simoes, "Introduction to Fuzzy Control" in TechOnLine Courses
http://www.techonline.com/learning/course/100261
3. http://nptel.ac.in/syllabus/syllabus.php?subjectId=108104049

Course Outcomes:
CO Number Course Outcome
CO1 Understand the features of Neural Networks, architecture and its classifications.
CO2 Analyze the supervised learning algorithm in neural networks.
CO3 Describe the concepts of Fuzzy sets and logic.
CO4 Apply fuzzy logic and reasoning to handle uncertainty.
CO5 AnalyzeNeuro Fuzzy system for data classification.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 2*5=10
2 Internals 2*20=40

Best 2 out of 3 Tests and 1 Quiz/AAT will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and the last question is
from the entire syllabus.
B.M.S. COLLEGE OF ENGINEERING
(Autonomous Institute, Affiliated to VTU)

Department of Computer Science &

Engineering

UG Scheme and Syllabus

(7th and 8th semester)
2016-2017
 7th Semester Scheme
Credit Hours/Week Marks
Contact
Course Code Course Title
hrs/wk
L T P S Total CIE SEE Total

Institutional
1 6 C S 7 I E I E 1 3 - - - 3 3 50 50 100
Elective – 1

1 6 C S 7 D C P P 1 Project Phase – 1 - - 2 - 2 - 50 50 100

Probability,
1 6 C S 7 D C P S Q Statistics and 2 1 - - 3 4 50 50 100
Queuing

Department Elective
1 6 C S 7 D E D E 4 3 - 1 2 6 5 50 50 100
–4

Department Elective
1 6 C S 7 D E D E 5 3 - 1 2 6 5 50 50 100
–5

1 6 C S 7 C E C E 1 Cluster Elective – 1 3 - - - 3 3 50 50 100

HSS - 1
1 6 C S 7 H S H S 2 2 - - - 2 2 50 50 100
[Professional Ethics]

Total 16 1 4 4 25 22 700

Credit Hours/Week Marks

Contact
Course Code Institutional Elective-1
hrs/wk
L T P S Total CIE SEE Total

1 6 C S 7 I E J A P Java Programming 3 - - - 3 3 50 50 100

1 6 C S 7 I E C C T Cloud Computing 3 - - - 3 3 50 50 100

1 6 C S 7 I E A I N Artificial Intelligence 3 - - - 3 3 50 50 100

 Credit Hours/Week Marks
Department Contact
Course Code
Elective – 4 hrs/wk
L T P S Total CIE SEE Total

1 6 C S 7 D E S W T Software Testing 3 - 1 2 6 5 50 50 100

1 6 C S 7 D E C Y F Cyber Forensics 3 - 1 2 6 5 50 50 100

Multicore
1 6 C S 7 D E M C P 3 - 1 2 6 5 50 50 100
Programming

Big Data and

1 6 C S 7 D E B D A 3 - 1 2 6 5 50 50 100
Analytics

Credit Hours/Week Marks

Department Contact
Course Code
Elective – 5 hrs/wk
L T P S Total CIE SEE Total

Advanced Web
1 6 C S 7 D E A W T 3 - 1 2 6 5 50 50 100
Technologies

1 6 C S 7 D E C G R Computer Graphics 3 - 1 2 6 5 50 50 100

Data Science using

1 6 C S 7 D E D S C 3 - 1 2 6 5 50 50 100
R

Digital Image
1 6 C S 7 D E D I P 3 - 1 2 6 5 50 50 100
Processing
 Credit Hours/Week Marks
Cluster Contact
Course Code
Elective – 1 hrs/wk
L T P S Total CIE SEE Total

Distributed
1 6 C S 7 C E D O S 3 - - - 3 3 50 50 100
Operating Systems

Multimedia
1 6 C S 7 C E M M C 3 - - - 3 3 50 50 100
Communications

Software Quality
1 6 C S 7 C E S Q M 3 - - - 3 3 50 50 100
Metrics

Bio-Inspired
1 6 C S 7 C E B I A 3 - - - 3 3 50 50 100
Algorithms
 8th Semester Scheme
Credit Hours/Week Marks
Contact
Course Code Course Title
hrs/wk
L T P S Total CIE SEE Total

Institutional Elective
1 6 C S 8 I E I E 2 3 - - - 3 3 50 50 100
–2

1 6 C S 8 D C P P 2 Project Phase – 2 - - 13 - 13 - 50 50 100

1 6 C S 8 D C G C T Green Computing 3 1 - - 4 5 50 50 100

HSS – 3 [Professional
1 6 C S 8 H S H S 4 3 - - - 3 3 50 50 100
Skills]

Internship /
1 6 C S 8 D C I N T #Industrial Training / - - 2 - 2 - 50 50 100
#Technical Seminar

Total 10 - 16 - 25 12 600

Credit Hours/Week Marks

Contact
Course Code Institutional Elective-2
hrs/wk
L T P S Total CIE SEE Total

1 6 C S 8 I E P I P Programming in Python 3 - - - 3 3 50 50 100

1 6 C S 8 I E I O T Internet of Things 3 - - - 3 3 50 50 100

1 6 C S 8 I E S E W Semantic Web 3 - - - 3 3 50 50 100

 Credit Hours/Week Marks
Contact
HSS-3
hrs/wk
L T P S Total CIE SEE Total

Management and Entrepreneurship 3 - - - 3 3 50 50 100

Law for Engineers 3 - - - 3 3 50 50 100

Economics for Engineers 3 - - - 3 3 50 50 100

Psychology for Engineers 3 - - - 3 3 50 50 100

Human Rights and Legislative

3 - - - 3 3 50 50 100
Procedures

Foreign Language 3 - - - 3 3 50 50 100

Comparative Science of Culture 3 - - - 3 3 50 50 100

Basics of Marketing and Sale 3 - - - 3 3 50 50 100

Family Business Management 3 - - - 3 3 50 50 100

Financial Management and Costing 3 - - - 3 3 50 50 100

Cyber Law 3 - - - 3 3 50 50 100

IPR/RTI/Labour Law/Contract Act 3 - - - 3 3 50 50 100

Engineering for Social Innovation and

3 - - - 3 3 50 50 100
Sustainability
 VII
SYLLABUS
INSTITUTIONAL
ELECTIVE-1
 COURSE TITLE Java Programming

COURSE CODE 16CS7IEJAP L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:

UNIT – 1

Java and Java applications, java Development kit (JDK); Java is interpreted, Byte code, JVM,
Objected Oriented Programming; simple java programs. Data types and other tokens: Boolean
Variables, int, long, char, operators, arrays, white spaces, literals, assigning values, creating and
destroying objects, access specifiers. Classes in Java, declaring a class, class name, super classes,
constructors, creating instances of class, inner classes.simple, multiple, multilevel inheritance,
overriding, overloading, using super, multilevel hierarchy, dynamic method dispatch, abstract
class, using final with inheritance. 10 Hours

UNIT – 2

Packages and Interfaces Packages: Defining a package, Finding packages and class path,
Example; Access protection; importing packages Interfaces: Defining an Interface, Implementing
Interface, Nested Interfaces Applying Interfaces, variables in interfaces.
Type Wrappers, Auto boxing, Enumeration. Generics: What are Generics?, A Simple Generics
Example, A Generics Class with two Type Parameters, The General Form of a Generic Class.

Special string operators, character extraction, string comparison, searching strings, modifying a
string, string buffer, additional string methods. 9 Hours

UNIT – 3

Fundamentals, Exception types, uncaught exceptions, using try and catch, multiple catch clauses,
nested try statements, throw, throws, finally, Java’s built-in exceptions, creating your own
exception subclasses, chained exceptions.

Multithreaded programming: Java thread model, main thread creating thread, creating multiple
threads, using isalive() and join(), thread priorities, synchronization, Interthread communication,
suspending, resuming and stopping threads. 10 Hours
 UNIT – 4

Exploring java.io: The Java I/O Classes and Interfaces, File, The Closable and Flushable
Interfaces, The Stream Classes, The Byte Streams, The Character Streams, The Console Class
files.

Applets: Fundamentals, Applet class two types of Applets, Applet Basics, Applet architecture,
An applet skeleton, display methods, requesting repainting, using status window, HTML Applet
Tag, Passing parameter to applets, getDocumentbase(), getCodebase().

Abstract window toolkit: AWT classes, window fundamentals, working with frame windows,
creating a frame window in an applet, creating a windowed program, displaying information,
working with graphics, working with color. 10 Hours

Text Books:

1. Java the Complete Reference, Herbert Schildt, 7th edition, Tata Mcgraw-Hill.

Reference Books:
1. Introduction to JAVA programming Y.Daniel Liang, 6th edition, Pearson education.
2. The Java Hand Book, Patrick Naughton, Tata Mcgraw-Hill, Eleventh Reprint 2002
3. Programming in JAVA 5.0, James P Cohoon, Jack W Davidson: TATA McGraw HILL.
4. Core Java 2, Volume I and II, Cay S Horstmann, Gary Cornell: Seventh Edition, Pearson
Education

E-books:

1. .Essentials of the Java Programming Language

2. Java Reference Guide by Stevens Haines
3. Building Object Oriented, Multi Threaded Applications with Java by Bill Venners
4. Getting Started with Java

COURSE OUTCOMES:

Course Outcomes Description

CO1 Able to identify the salient features and develop simple Java programs.
CO2 Able to design user defined packages interfaces and use built in Java IO
Streams
CO3 Able to use built in exceptions and design user defined exceptions.
 CO4 Able to create multiple threads and applets.
CO5 Able to create user windows using AWT classes

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, three units to carry one question
each(mandatory from Unit 1 and Unit2), two units to carry two questions each (internal choice
from Unit 3 and Unit 4 ) and last question is from the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Cloud Computing

COURSE CODE 16CS7IECCT L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:

UNIT – 1

Introduction to Cloud Computing: Cloud Computing in a nutshell, Roots of cloud computing,

Layers and Types of cloud, Features of cloud, Cloud Infrastructure Management. Infrastructure
as service providers: Features. Platform as service providers: Features, Challenges and Risk.
Software as a Service: Overview and Driving Forces, Case Studies of Company Offerings.
Software Plus Services: Overview, Mobile Device Integration 10 Hours

UNIT – 2

Cloud Storage: Basics, Storage as a Service, Providers, Security, Reliability, Advantages,

Cautions, Outages, Theft. Benefits: Economic, Operational and Staffing

Hardware and Infrastructure: Client, Security, Network, Services. Cloud Computing with the
Titans: Google, EMC, Microsoft, Amazon, Salesforce.com, IBM: Services, Movement to the
Cloud, Security 10 Hours

UNIT – 3

Local Clouds and Thin Clients: Virtualization in your organization, Server Solutions, Thin Client,
Migrating to the Cloud: Cloud Services for the Individuals, Enterprise Class Cloud Offerings
9 Hours

UNIT – 4

Map Reduce Programming Model and Implementation: Introduction, Map Reduce Programming
Model, Major Map Reduce Implementation for Cloud: Hadoop, Disco, Map Reduce.NET 10 Hours
Text Books:

1. “CLOUD COMPUTING – Principles and Paradigms” by Rajkumar Buyya, James Broberg,

Andrzej
Goscinski, WILEY: A JOHN WILEY & SONS, INC., PUBLICATION, 2011

2. “Cloud Computing: A practical Approach” by Anthony T. Velte, Toby J. Vetle and Robert
Elsenpeter,
McGrawHill, 2010.

Reference Books:
1. CLOUD COMPUTING” by Dr. Kumar Saurabh, Second Edition, WILEY INDIA

E-books:

1. Cloud Services for Dummies”by Judwith Hurwitz, Marcia Kaufman, Dr Fern Halper, WILEY:
A JOHN WILEY & SONS, INC., PUBLICATION
2. “CLOUD COMPUTING – Theory and Practice” by Dan C Marinescu, MK Publication,2012

COURSE OUTCOMES:

Course Course Description

Outcomes
Comprehend the basics of Cloud Computing technology and its
CO 1. services
Analyze various cloud services and providers with respect to
CO 2. services
Discuss virtualization and the technologies driving virtualization
CO 3.

Paraphrase map reduce programming modules

CO 4.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50
Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions. One question from each unit and last question is from the
entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE ARTIFICIAL INTELLIGENCE

COURSE CODE 16CS7IEAIN L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:

UNIT–1

What is AI? Intelligent Agents: Agents and environment; Rationality; the nature of environment;
the structure of agents. 9 Hours

UNIT–2

Problem‐solving: Problem‐solving agents; Example problems; Searching for Solutions;

Uninformed Search Strategies: Breadth First search, Depth First Search, Iterative deepening
depth first search; Informed Search Strategies: Heuristic functions, Greedy best first search,
A*search. 10 Hours

UNIT–3

Logical Agents: Knowledge –based agents, The Wumpus world, Logic-Propositional logic,
Propositional theorem proving, Effective propositional model checking Agents based on
propositional logic.
Using predicate logic: Representing simple facts in logic, Computable functions and predicates,
Resolution, Forward reasoning, Backward reasoning. 11 Hours

UNIT–4

Learning: Forms of Learning; Inductive learning; Learning decision trees; Ensemble learning.
9 Hours

Text Books:

3. Artificial Intelligence: A Modern Approach by Stuart Russel, Peter Norvig, 2nd

Edition, Pearson Education, 2003.
4. Artificial Intelligence, by Elaine Rich, Kevin Knight, Shivashankar B Nair: Tata
MCGraw Hill 3rd edition. 2013

Reference Book:
1. Artificial Intelligence by George F Luger, 5th Edition Pearson Education, 2009.
E-books:

3. Practical Artificial Intelligence Programming With Java, Third Edition ,Mark

Watson
4. Artificial Intelligence Lecture Notes MIT
.

MOOCs
2. Artificial Intelligence -http://www.nptelvideos.in/2012/11/artificial-intelligence.html

COURSE OUTCOMES:

Describe the modern view of AI as the study of

CO1 agents that receive percepts and perform actions.

Apply AI search Models and Generic search

CO2 strategies.

Write Logic for representing Knowledge and

CO3
Reasoning of AI systems.
Design different learning algorithms for improving
CO4 the performance of AI systems.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, three units to carry one question
each(mandatory from Unit 1 and Unit2), two units to carry two questions each (internal choice
from Unit 3 and Unit 4 ) and last question is from the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Probability , Statistics And Queuing

COURSE CODE 16CS7DCPSQ L-T-P-S 2-1-0-0

CIE/SEE
Total Lecture Hours: 26 50/50
Marks

SYLLABUS:

UNIT-1
Probability: Sample space and events, The axioms of Probability, Conditional Probability,
Independence of Events, Baye’s theorem, Combinatorial Problems, Bernoulli trials.
Random variables and their properties, Discrete Random variable, Probability Mass Function
and properties 6 Hours

UNIT-2
Continuous Random variables, Probability Density function and Properties, Joint probability
distributions and their properties, Mathematical expectations, Moments.
Probability Distributions: Discrete distributions: Binomial, Poisson , Negative binominal
distributions and their properties. 7 Hours

UNIT-3
Continuous distributions: Uniform, Normal, exponential distributions and their properties.
Statistical Inference: Parameter estimation, Hypothesis testing, Curve fitting using Principle of
Least Squares, Coefficient of determination, Confidence Intervals. 7 Hours

UNIT-4
Queuing Theory: Queuing notations, Rules for all Queues, Little Law, Types of Stochastic
Processes, Birth-Death Process, The M/M/1 Queuing System, The M/M/m Queuing System, The
M/M/m/B Queuing with Finite buffers. 6 Hours

Text Books:
1. Probability & Statistics with Reliability, Queuing and Computer Applications by Kishor
S. Trivedi , 2nd edition, John Wiley & sons, 2008.

2. The Art of Computer Systems Performance Analysis” by Raj Jain, Wiley India pvt ltd,
2010.

Reference Books:
2. Probability and Statistics for Computer Scientists, by M. Baron, Chapman & Hall,
Second edition CRC Press , 2013.
3. A first course in Probability, By Sheldon Ross, 8th edition, Prentice hall, 2010.

E-Books:

1. A Compendium of Common Probability Distributions By Michael P. McLaughlin.

 2. A first course in Probability, By Sheldon Ross, 8th edition, Prentice hall, 2010.

MOOCs:
1. Probability and statistics-http://nptel.ac.in/courses/111105041
2. Introduction to Probability- The Science of Uncertainty
https://www.edx.org/course/introduction-probability-science-mitx-6-041x-1
Course Outcomes:

Use probability in uncertain situations.

CO1
Compute probabilities using distributions functions of random
CO2 variables.

CO3 Analyze data distributions through statistical inference.

Able to use quantitative metrics to measure performance of queuing
CO4 systems.

Able to apply and extend queuing models to analyze engineering

CO5 problems

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.
Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 DEPARTMENT
ELECTIVE-4

COURSE TITLE SOFTWARE TESTING

 COURSE CODE 16CS7DESWT L-T-P-S 3-0-1-2
CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1
Fundamentals of Software Testing : Introduction, Definition of Testing, Testing during
development life cycle, Requirements traceability matrix, Essentials of software testing,
Workbench, Important features of Testing Process, Misconceptions about Testing, Principles of
Testing, Salient features of Good testing, Test policy, Test strategy of Test approach, Test
Planning, Testing process and number of defects found in Testing, Test team approach, Process
problems faced by Testing, Cost aspects of Testing, Establishing Testing policy, Methods,
Structured approach to Testing, Categories of Defect, Defect, Error or mistakes in software,
Developing test strategy, Developing Testing methodologies, Testing Process, Test
Methodologies/approaches, People challenges in software testing, , Skills required by tester.
Configuration Management: Introduction, configuration management, cycle of configuration
management Configuration management process, Auditing configuration Library 10 Hours

UNIT-2
Levels of Testing: Introduction, Proposal testing , Requirement testing, Design Testing, code
Review, UNIT Testing, Module testing, Integration testing, Big-Bang testing, Sandwich testing
,Critical path first , Subsystem testing, System testing, testing stages.
Acceptance testing: Introduction, Acceptance testing criteria, Importance of Acceptance criteria,
Some famous Acceptance criteria, Alpha testing, Beta testing , gamma testing, Acceptance
testing during each phase of software development, Consideration of Alpha and Beta Acceptance
testing process, What does software Acceptance enable?, customer’s responsibilities in
Acceptance testing, Fits for Acceptance testing, Define Acceptance criteria, Criticality of
requirements, Factors affecting criticality of the requirements, Developing Acceptance test plan,
Software Acceptance plan, User responsibilities in Acceptance test plan, Executing Acceptance
plan. 9 Hours

UNIT-3
Testing Tools: Introduction, Features of Test tool, Guidelines for selecting a tool, Tools and
skills of tester, Static Testing tools, Dynamic Testing tools, Advantages of using tools,
Disadvantages of using tools, when to use automated test tools, Testing using automated tools,
Difficulties while introducing new tools.
Test Planning: Introduction, Test policy, Content of test policy in general, Test Planning, Test
plan, Quality plan and Test plan, Quality plan template, Test plan template, Guidelines for
developing the test plan, Test administration definition, Test Estimation, Test standards, Building
Test data and test cases, Test scenarios, Test cases, Essential activities in testing, Template for
test cases, Test scripts, Test management software, Test log documents, Effective test cases, Test
file, Building test data, Generation of test data, Tools used to build test data, Roles and
responsibilities in testing life cycle, Test progress monitoring. 10 Hours
 UNIT-4
Test Metrics and Test Reports: Introduction, Testing related data, Defect data,
Efficiency/Productivity data Categories of the Product/Project test Metrics, Estimated Budgeted
approval and actual, Resources consumed in Testing ,Effectiveness of Testing, Defect Density,
Defeat Leakage Ratio, Residual Defect Density, Test Team Efficiency, Test case Efficiency,
Rework, MTBF/MTTR, Implementing Measurement Reporting system in an Organization, Test
Reports, Project Test status Reports, Integrated Test Report, System Test Report, Acceptance
Test Report, Guidelines for Writing and Using Report, Final Test Reporting, Test status Report,
Benchmarking. 10 Hours

Text BookS:
1. Software Testing Principles, Techniques and Tools by M.G. LIMAYE, Tata
McGraw‐ Hill Publication.

Reference Books:
1. Software Testing Principles and Practice by Srinivasan Desikan, Gopalaswamy Ramesh,
Pearson Education.
2. Software Testing concepts and Tools by Nageshwar Rao pusuluri, Greentech Press.

E-Books:

1. http://www.cs.ubbcluj.ro/~cretu/VVSS2014_2015/Bibliography/Springer.Verlag.Practica
l.Software.Testing.eBook-KB.pdf

Useful links:

1. https://github.com/ligurio/free-software-testing-books/blob/master/free-software-testing-
books.md
2. http://www.softwaretestinggenius.com/download/bgstpadmini.pdf

MOOCS:

1. http://nptel.ac.in/courses/106105150/
2. http://nptel.ac.in/courses/106101061/18
COURSE OUTCOMES:

Course Outcomes Description

CO1 Define Test policy and test strategy
CO2 Analyze various levels of testing.
CO3 Design and develop test plans.
CO4 Apply software testing techniques for proposed application

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Self-Study Scheme:
Under Self-study component of Software Testing, students should define test plans and test cases
for real-world applications.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE CYBER FORENSICS

COURSE CODE 16CS7DECYF L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT I
Computer Forensics Fundamentals: What is Computer Forensics?, Use of Computer Forensics
in Law Enforcement, Computer Forensics Assistance to Human Resources/Employment
Proceedings, Computer Forensics Services, Benefits of Professional Forensics Methodology,
Steps taken by Computer Forensics Specialists
Understanding Computer Investigations: Preparing a Computer Investigation, Taking
aSystematic Approach, Procedures for Corporate High-Tech Investigations, Understanding Data
Recovery Workstations and Software 7 Hours

UNIT II
Working with Windows and DOS Systems: Understanding File Systems, Exploring Microsoft
File Structures, Examining NTFS Disks, Understanding Whole Disk Encryption, Understanding
the Windows Registry, Understanding Microsoft Startup Tasks, Understanding MS-DOS Startup
Tasks, Understanding Virtual Machines.
Macintosh and Linux Boot Processes and File Systems: Understanding the Macintosh File
Structure and Boot Process, Examining UNIX and Linux Disk Structures and Boot Processes,
Understanding Other Disk Structures. 10 Hours

UNIT III
Data Acquisition: Understanding Storage Formats for Digital Evidence, Determining the best
Acquisition Method, Contingency Planning for Image Acquisitions, Using Acquisition Tools,
Validating Data Acquisitions, Performing RAID Data Acquisitions, Using Remote Network
Acquisition Tools, Using Other Forensic Acquisition Tools.
Computer Forensics Analysis: Determining What Data to Collect and Analyze, Validating
Forensic Data, Addressing Data-Hiding Techniques, Performing Remote Acquisitions.
Current Computer Forensics Tools: Evaluating Computer Forensic Tool Needs, Computer
Forensics Software Tools, Computer Forensics Hardware Tools, Validating and Testing
Forensics Software. 10 Hours

UNIT IV
Recovering Graphics Files: Recognizing a Graphics File, Understanding Data Compression,
Locating and Recovering Graphics Files, Identifying Unknown File Formats, Understanding
Copyright Issues with Graphics
Network Forensics: Network Forensic Overview, Performing Live Acquisitions, Developing
Standard Procedures for Network Forensics, Using Network Tools.
E-mail Investigations: Exploring the Role of E-mail in Investigations, Exploring the Roles of
the Client and Server in E-mail, Investigating E-mail Crimes and Violations, Understanding E-
mail Servers, Using Specialized E-mail Forensics Tools. 12 Hours

Text books:

1.
2. Amelia Phillips, Bill Nelson, Christopher Steuart,Guide to Computer Forensics and
Investigations,4th Edition, Cengage Learning, 2013.
3. Computer Forensics, Computer Crime Invistigation by Jhon R. Vacca, Firewall Media,
New Delhi.

Reference Books:
1. Cyber Forensics: from Data to Digital Evidence , Albert J. Marcella Jr., Wiley,1st
Edition,2012
2. Marjie T. Britz: Computer Forensics and Cyber Crime - An Introduction, 2ndEdition,
Pearson Education, 2012.
3. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council
Press Series:Computer Forensics), 2010

Online Resources:
1. http://www.cyberforensics.in/
2. http://news.asis.io/sites/default/files/Investigating_Intrusions_Network_CyberCrime.pdf

MOOCs:
1. MOOCs Course on Coursera “Introduction to Forensic Science”,
https://www.coursera.org/course/ntufsc
2. Computer and Hacking Forensics", https://www.cybrary.it/course/computer-hacking-
forensics-analyst/
COURSE OUTCOMES:

Course Outcomes Description

CO1 Able to describe various cyber forensics fundamentals and working with
windows and linux systems
CO2 Able to identify and apply cyber forensics for data acquisition and
analyze forensics analysis for hidden information
CO3 Able to identify and apply current forensics tools and recovering graphics files
CO4 Able to Apply Network Forensic tools for network forensic and perform Email
investigation.
CO5 Able to analyze & evaluate the data acquisition and investigation using
cyber forensic tools.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.

Self-Study Scheme:
Under Self study component of Cyber Security course, students should carry out a project
work/Assignment on real-world constraint to explore the practical applications of the concepts
learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Multicore Programming

COURSE CODE 16CS7DEMCP L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:

UNIT-1
Introduction to Multi-core Architecture: Motivation for Concurrency in software, Parallel
Computing Platforms, Parallel Computing in Microprocessors, Differentiating Multi-core
Architectures from Hyper- Threading Technology, Multi-threading on Single-Core versus Multi-
Core Platforms Understanding Performance, Amdahl’s Law, Growing Returns: Gustafson’s
Law. System Overview of Threading: Defining Threads, System View of Threads, Threading
above the Operating System, Threads inside the OS, Threads inside the Hardware, What
Happens When a Thread Is Created, Application Programming Models and Threading, Virtual
Environment: VMs and Platforms, Runtime Virtualization, System Virtualization.
Fundamental Concepts of Parallel Programming: Designing for Threads, Task
Decomposition, Data Decomposition, Data Flow Decomposition, Implications of Different
Decompositions, Challenges You’ll Face, Parallel Programming Patterns, A Motivating
Problem: Error Diffusion, Analysis of the Error Diffusion Algorithm, An Alternate Approach:
Parallel Error Diffusion, Other Alternatives. 10 Hours

UNIT-2
Threading and Parallel Programming Constructs: Synchronization, Critical Sections,
Deadlock, Synchronization Primitives, Semaphores, Locks, Condition Variables, Messages,
Flow Control- based Concepts, Fence, Barrier, Implementation-dependent Threading Features.
Threading APIs : Threading APls for Microsoft Windows, Win32/MFC Thread APls,
Threading APls for Microsoft. NET Framework, Creating Threads, Managing Threads, Thread
Pools, Thread Synchronization, POSIX Threads, Creating Threads, Managing Threads, Thread
Synchronization, Signaling, Compilation and Linking. 10 Hours

UNIT-3
OpenMP: A Portable Solution for Threading: Challenges in Threading a Loop, Loop-carried
Dependence, Data-race Conditions, Managing Shared and Private Data, Loop Scheduling and
Portioning, Effective Use of Reductions, Minimizing Threading Overhead, Work-sharing
Sections, Performance-oriented Programming, Using Barrier and No wait, Interleaving Single-
thread and Multi-thread Execution, Data Copy-in and Copy-out, Protecting Updates of Shared
Variables, Intel Task queuing Extension to OpenMP, OpenMP Library Functions, OpenMP
Environment Variables, Compilation, Debugging, performance. 10 Hours
 UNIT-4
Solutions to Common Parallel Programming Problems: Too Many Threads, Data Races,
Deadlocks, and Live Locks, Deadlock, Heavily Contended Locks, Priority Inversion, Solutions
for Heavily Contended Locks, Non-blocking Algorithms, ABA Problem, Cache Line Ping-
ponging, Memory Reclamation Problem, Recommendations, Thread-safe Functions and
Libraries, Memory Issues, Bandwidth, Working in the Cache, Memory Contention, Cache-
related Issues, False Sharing, Memory Consistency, Current IA-32 Architecture, Itanium
Architecture, High-level Languages, Avoiding Pipeline Stalls on IA-32,Data Organization for
High Performance. 9 Hours

Text Book:
1. Multicore Programming , Increased Performance through Software Multi-threading by
Shameem Akhter and Jason Roberts , Intel Press , 2006.

Reference Books:
1. Parallel Programming in C with MPI and OpenMP, Michael J. Quinn, McGraw-Hill
Higher Education, 2004.
2. Introduction to Parallel Computing – Ananth Grama et. al., PearsonEducation, 2009.

E- Books:
1. Parallel Programming in C with MPI and OpenMP, Michael J. Quinn, McGraw-Hill
Higher Education, 2004.
2. Introduction to Parallel Computing, Blaise Barney, Lawrence Livermore National
Laboratory.

MOOCs:

1. http://nptel.ac.in/courses/106102114/
2. https://software.intel.com/en-us/videos/introduction-to-parallel-programming-video-
lecture-series-part-01-why-parallel-why-now

COURSE OUTCOMES:

Course Outcomes Description

CO1 Identify the Basic needs for parallelism, examine different techniques for
achieving multithreading and estimate their performance benefits.
CO2 Explain the fundamental concepts of parallel programming and how they
enable parallel software development.
CO3 Apply multi-core programming constructs and threading implementations
using API’s on different platforms.
CO4 Apply and implement programs using Open-MP API.
CO5 Identify and learn solutions to common parallel programming problems.
ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz /AAT 5
2 Internals 20
Laboratory test 10
Parallel implementation of a 15
problem
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.

Self-Study Scheme:
Under Self study component of Multicore Programming course, students should carry out a
project work of developing a parallel implementation of a problem to explore the practical
applications of the concepts learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
COURSE TITLE Big Data and Analytics

COURSE CODE 16CS7DEBDA L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

UNIT-1

Types of Digital Data – Classification of Digital Data. Introduction to Big Data – Characteristics of
Data, Evolution of Big Data, Definition of Big Data, Challenges with Big Data, What is Big Data? Big
Data Analytics – What is Big Data Analytics? Classification of Analytics, Top Challenges Facing Big
Data, Data Science, Data Scientist…Your New Best Friend!!!, Terminologies Used in Big Data
Environments, Basically Available Soft State Eventual Consistency (BASE).

The Big Data Technology Landscape – NoSQL (Not Only SQL), Hadoop. 9 Hours

UNIT-2

Introduction to Hadoop – Introducing Hadoop, Why Hadoop?, Why not RDBMS?, RDBMS versus
Hadoop, Distributed Computing Challenges, History of Hadoop, Hadoop Overview, Use Case of
Hadoop,Hadoop Distributors, HDFS (Hadoop Distributed File System), Processing Data with Hadoop,
Managing Resources and Applications with Hadoop YARN (Yet another Resource Negotiator),
Interacting with Hadoop Ecosystem.

MAPREDUCE Programming – Mapper, Reducer, Combiner, Partitioner, Searching,

Sorting,Compression 10 Hours

UNIT-3

MongoDB – What is MongoDB? Why MongoDB? Terms Used in RDBMS and MongoDB, Data Types
in MongoDB , MongoDB Query Language.

Cassandra – Apache Cassandra - An Introduction , Features of Cassandra, CQL Data types, CQLSH,
Keyspaces, CRUD (Create, Read, Update and Delete) Operations, Collections, Using a Counter, Time to
Live (TTL), Alter Commands, Import and Export, Querying System Tables, Practice Examples.

Hive – What is Hive?,Hive Architecture, Hive Data Types, Hive File Format, Hive Query Language
(HQL), RCFile Implementation, SerDe, User-defined Function(UDF). 10 Hours

UNIT-4

Introduction to Pig – What is Pig? The Anatomy of Pig, Pig on Hadoop, Pig Philosophy, Use Case for
Pig: ETL Processing, Pig Latin Overview, Data Types in Pig, Running Pig, Execution Modes of Pig,
HDFS Commands, Relational Operators, Eval Function, Complex Data Types, Piggy Bank, User-Defined
Functions (UDF), Parameter Substitution, Diagnostic Operator, Word Count Example using Pig, When to
use Pig?, When not to use Pig?, Pig at Yahoo!, Pig versus Hive

Spark – Installing Spark, An Example, Spark Applications, Jobs, Stages, and Tasks, A Scala Standalone
Application, A Java Example, A Python Example, Resilient Distributed Datasets Creation,
Transformations and Actions, Persistence, Serialization, Shared Variables, Broadcast Variables,
Accumulators, Anatomy of a Spark Job Run, Job Submission, DAG Construction, Task Scheduling, Task
Execution, Executors and Cluster Managers, Spark on YARN. 10 Hours

Text Books:

1. Seema Acharya,Subhashini Chellappan, Big data and Analytics, Wiley publications, 2014.
2. Tom White, Hadoop: The Definitive Guide, Fourth Edition, O'Reilley, 2015.

References:

1. Eric Sammer, Hadoop Operations, O'Reilley, 2012.

2. Vignesh Prajapati, Big data analytics with R and Hadoop, SPD 2013.

MOOC Courses:

3. https://bigdatauniversity.com/courses/spark-overview-scala-analytics/
4. https://bigdatauniversity.com/courses/introduction-to-hadoop/
5. https://bigdatauniversity.com/courses/mapreduce-and-yarn/

Course Outcomes Description

CO1 Analyze the architectural elements of big data
CO2 Perform big data analytics using HDFS and MapReduce
CO3 Analyze the various database models for big data
CO4 Implement Cluster file System using Spark

CO5 Design and implement big data analytics for various application

ASSESSMENT:
CIE Scheme:

Assessment Weightage in Marks

1 Quiz /AAT 05
2 Internals 20
Laboratory test 15
Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.

Self-Study Scheme:
Under Self study component of big Data analytics course, students should carry out a project
work of developing practical implementation of a problem to explore the practical applications
of the concepts learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
DEPARTMENT
ELECTIVE-5
 COURSE TITLE Advanced Web Technologies

COURSE CODE 16CS7DEAWT L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hrs: 39 50/50
Marks

SYLLABUS:

UNIT-1
JQuery: Introducing jQuery; Adding jQuery to a Page; Modifying Web Pages: An Overview;
Understanding the Document Object Model; Selecting Page Elements: The jQuery Way; Adding
Content to a Page; Setting and Reading Tag Attributes; Reading, Setting, and Removing HTML
Attributes; Acting on Each Element in a Selection.
1. Action/Reaction: Making Pages Come Alive with Events; What Are Events?; Using Events
the jQuery Way, Tutorial: Introducing Events; More jQuery Event Concepts. 10 Hours

UNIT-2
2. Common jQuery Tasks : Controlling How Links Behave, Opening External Links in a New
Window, Creating New Windows
3. Enhancing Web Forms : Understanding Forms, Form Validation Introducing Ajax:What is
Ajax, Ajax: Basics, Ajax the jQuery Way, JSON. 8 Hours
4.
UNIT-3
The Programmable Web and Its Inhabitants: HTTP- Documents in Envelopes, Method
Information, Scoping Information, The Competing Architectures, Technologies on the
Programmable Web; Writing Web Service Clients: Web Services Are Web Sites, del.icio.us:
The Sample Application ,Making the Request: HTTP Libraries (only PHP: libcurl, JavaScript:
XMLHttpRequest), Processing the Response: XML Parsers (PHP, JavaScript: responseXML),
JSON Parsers: Handling Serialized Data; What Makes RESTful Services Different?:
Introducing the Simple Storage Service,Resources, HTTP Response Codes; The Resource-
Oriented Architecture: Resource-Oriented What Now?, What’s a Resource?, URIs,
Addressability, Statelessness, Representations, Links and Connectedness, The Uniform
Interface. 10 Hours
UNIT-4
Designing Read-Only ResourceOriented Services: Resource Design, Turning Requirements
Into Read-Only Resources, Figure Out the Data Set, Split the Data Set into Resources, Name the
Resources, Design Your Representations, Link the Resources to Each Other. The HTTP
Response. Designing Read/Write ResourceOriented Services: User Accounts as Resources,
Custom Places. Ajax Applications as REST Clients: From AJAX to Ajax, The Ajax
Architecture, A del.icio.us Example, The Advantages of Ajax, The Disadvantages of Ajax,
REST Goes Better, Making the Request, Handling the Response. 11 Hours
Text Book:

1. JavaScript & jQuery: The Missing Manual, 3rd Edition, By David Sawyer McFarland,
Publisher: O'Reilly Media, September 2014
2. RESTful Web APIs, By Leonard Richardson, Mike Amundsen, Sam Ruby, Publisher:
O'Reilly Media, September 2013.

Reference Book:

1. Professional Ajax, 2nd Edition by Nicholas C. Zakas (Author), Jeremy McPeak

(Author), Joe Fawcett (Author) 2007.
2. RESTful Web APIs, Leonard Richardson, Mike Amundsen, Sam Ruby, O'Reilly Media
(September 27, 2013)
3. jQuery in Action, Second Edition by Bear Bibeault, 2010.

E-Book:

1. Ajax Creating Web Pages with Asynchronous JavaScript and XML Edmond
Woychowsky
2. RESTful Web APIs, By Leonard Richardson, Mike Amundsen, Sam Ruby, Publisher:
O'Reilly Media, September 2013.

MOOCs:

1. https://alison.com/courses/Understanding-the-Functionality-of-JavaScript-jQuery-and-
AJAX
2. https://www.udacity.com/course/intro-to-ajax--ud110
3. https://sites.google.com/site/introsdeunitn/home/rest-tutorial

COURSE OUTCOMES:

CO 1 Designing web pages with jQuery validation

CO 2 Applying Ajax and JSON techniques for web page design

CO 3 Designing Web service client

CO 4 Developing RESTful web services

CO 5 Designing and developing a web based project

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each ( internal choice) and one question from the
entire syllabus.

Self-Study Scheme:
Under Self study component of Advanced Web programming course, students should carry out a
project work of developing a Website to explore the practical applications of the concepts
learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Computer Graphics

COURSE CODE 16CS7DECGR L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:

UNIT- 1
Introduction: Applications of computer graphics, A graphics system Images: Physical and synthetic
Imaging Systems, The synthetic camera model, The programmer’s interface, Graphics architectures,
Programmable Pipelines, Performance Characteristics.
The OpenGL: The OpenGL API, Primitives and attributes : Color, Viewing, Control functions ,The
Sierpinski gasket, Programming Two Dimensional Applications, The Gasket program, Polygons and
recursion, The three dimensional gasket. 9 Hours

UNIT -2
Interactive lnput Methods and Graphical User Interfaces: Graphical input Data, Logical
Classification of Input Devices, lnput Functions for Graphical data, Open GL Interactive input functions,
OpenGL menu functions, Designing Graphical User Interface. 10 Hours

UNIT -3
Geometric Transformations: Basic two dimensional Geometric Transformations, Matrix
Representations
and Homogeneous Coordinates, Inverse Transformations, Composite Transformations, Other two
dimensional Transformations, Raster Methods for Geometric Transformations, OpenGL raster
Transformations, Transformations between two dimensional coordinate systems.
Geometric Transformations in three dimensional space, There dimensional Translation, Three
dimensional Rotation, Three dimensional scaling, Composite 3D Transformations, Other three
dimensional Transformations, Transformations between three dimensional coordinate systems, Affine
Transformations , OpenGL geometric Transformation Functions. 10 Hours

UNIT -4
Viewing: Two dimensional viewing pipeline, Clipping Window, Normalization and Viewport
transformations, OpenGL Two-Dimensional Viewing Functions, Clipping algorithms, Point Clipping
Line Clipping, Polygon fill area clipping
Overview of three dimensional viewing concepts, Three dimensional viewing pipeline Three dimensional
viewing coordinate parameters, Transformations between World to Viewing coordinates ,Projection
transformations, Orthogonal Projections, Perspective projections, OpenGL Three-Dimensional Viewing
Functions. 10 Hours

Text Books:
1. Interactive Computer Graphics - A Top‐Down Approach with OpenGL by Edward
Angel, 5th Edition, Pearson Education, 2008.
 2. Computer Graphics‐ OpenGL Version by Donald Hearn and Pauline Baker, 3rd
Edition, Pearson Education, 2009.

Reference Books:
1. Computer Graphics by James D Foley, Andries Van Dam, Steven K Feiner, John F
Hughes, Addison‐Wesley 1997.
2. Computer Graphics Using OpenGL by Francis S Hill, Stephen M Kelle, 3rd Edition

E-books:

1. Graphics Programming Black Book by Michael Abrash.

MOOCs:
1. Computer Graphics -http://www.nptelvideos.in/2012/11/computer-graphics.html

COURSE OUTCOMES (COs):

Apply concepts of mathematics and science in computer graphics..

CO1

Implement event handling using OpenGL.

CO2

Identify the different transformations required for animation and

CO3
implement them.
Demonstrate clipping and viewing techniques.
CO4

Design graphics projects with different viewing conditions, lighting and

CO5 shading effects using OpenGL.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50
 Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.

Self-Study Scheme:
Under Self study component of Computer Graphics course, students should carry out a project
work of developing a graphics system for real-world applications to explore the practical
applications of the concepts learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Data Science using R

COURSE CODE 16CS7DEDSC L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Introduction to Data Science: Data Analytics Life Cycle –Overview, Discovery, Data preparation,
Model planning, Model building, Communicate results, Operationalize. Case study –Global Innovation
Network and Analysis 9 hours

UNIT-2

Data Analytics Using R: Introduction to R –R Graphical User Interfaces, Data Import and Export,
Attribute and Data types, Descriptive Statistics. Exploratory Data Analysis – Visualization before
analysis, Dirty data, visualizing a single variable, Examining multiple variable, Data exploration versus
presentation. Statistical Methods for Evaluation – Hypothesis testing, Difference of Means, Rank-sum
test, Type I and II errors, Power and Sample Size 11 hours

UNIT-3

Analytical Methods: Regression - Linear Regression, Logistic Regression, Reasons to Choose and
Cautions, Additional Regression Models, Classification – Decision tree, Naive Bayes, Diagnostics of
classifiers, Clustering –K-means, Text analysis- steps, example, collecting raw text, representing text

11 hours

UNIT-4

Delivering Results: Documentation and deployment – producing effective presentations – Introduction to

graphical analysis – plot () function – displaying multivariate data – matrix plots – multiple plots in one
window - exporting graph - using graphics parameters. Case studies. 8 hours

Text Books:
1. Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Presenting Data,
EMC Education Services 2015.
2. NINA ZUMEL , “Practical Data Science with R”, Manning Publications Co 2014
MOOCS:

1. nptel.ac.in/courses/110106064/

E-Books:

1. An Introduction to Data Science. By J. Stanton, 2013.

2. https://drive.google.com/file/d/0B6iefdnF22XQeVZDSkxjZ0Z5VUE/edit

COURSE OUTCOMES:

Course Outcomes Description

CO1 Describe the Data Analytics life cycle.
CO2 Perform data analytics using R tool.
CO3 Develop various data analytics methods.
CO4 Discuss various result presentation formats.
CO5 Design and develop a data analytics method for different applications

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

Test 20
Lab 15
Self-Study 10
Quiz/AAT 5
Total 50
Best 2 out of 2 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 4 questions from 4 units, 2 units to carry one question each(mandatory),
two units to carry two questions each (internal choice), and one question from the entire syllabus.

Self-Study Scheme:
Under Self study component of Data Science course, students should carry out a project work of
developing an Data Analytics of real-world applications to explore the practical applications of
the concepts learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Digital Image Processing

COURSE CODE 16CS7DEDIP L-T-P-S 3-0-1-2

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Introduction to Image Processing: Introduction, Type of Image Processing-analog versus

Digital Image Processing, Applications of DIP, Fundamental steps in DIP, Components of DIP
system, A simple image formation model, Image sampling and quantization, Basic relationship
between pixels, Arithmetic and Logical operations on images, Image file formats. 9 Hours

UNIT-2

Image Enhancement in Spatial Domain and Frequency Domain:

Image Enhancement in the Spatial Domain: Some Basic Gray Level Transformations, Histogram
Processing, Enhancement Using Arithmetic/Logic Operations, Basics of Spatial Filtering,
Smoothing Spatial Filters, Sharpening Spatial Filters, Combining Spatial Enhancement Methods.
Image Enhancement in the Frequency Domain: Introduction to the Fourier Transform and the
Frequency Domain, Smoothing Frequency-Domain Filters, Sharpening Frequency-Domain
Filters, Homomorphic Filtering. 11 Hours

UNIT-3

Image Restoration: Image enhancement versus Image restoration, Image

degradation/restoration model, Inverse filter, Noise models, Restoration using spatial filtering:
Arithmetic Mean filters, Geometric mean filters, Harmonic mean filters, Order Statistics filters:
Median filter, Max & min filters, Midpoint filter, Adaptive filters, Wiener filter, Constrained
Least squares filter. 10 Hours

UNIT-4

Color Image Processing: Fundamentals of color image processing, Color models, Conversion
of color models from one form to other form, Pseudo color image processing, Full color image
processing, Color Image Quantization, Histogram of color Image.
Basic Image Transforms: Discrete Cosine and Sine transform, Z-transform, Fourier transform,
Laplacian transform, Two-dimensional orthogonal unitary transforms, Properties of Unitary
Transforms, K-L Transform, Introduction to Wavelet Transform. 9 Hours
Text Books:

1. Digital Image Processing by Rafael C. Gonzalez & Richard E. Woods, Third Edition,
Pearson Education, 2009.
2. Fundamentals of Digital Image Processing by Anil.K.Jain, Prentice Hall, 4th Edition,
2014.

Reference Books:
1. Digital Image Processing by S.Jayaraman, S.Esakkirajan, T.Veerakumar, TMH, 2009.

E-Books:

1. Digital Image Processing by Rafael C. Gonzalez & Richard E. Woods, Third Edition,
Pearson Education, 2009.

MOOCS:

3. http://www.nptelvideos.in/2012/12/digital-image-processing.html
4. http://in.mathworks.com/discovery/digital-image-processing.html?s_tid=srchtitle

COURSE OUTCOMES:

Course Outcomes Description

CO1 Perform simple operations on images.
CO2 Analyze and apply spatial domain and/or frequency domain for image
enhancement.
CO3 Analyze various noise models and apply appropriate filtering techniques.
CO4 Perform color image processing and various transformations on images.
CO5 Design and develop an Image Processing system for real-world
applications.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

1 Quiz/AAT 5
2 Internals 20
1 Lab Internals 15
1 Self Study 10
Total 50
Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.

Self-Study Scheme:
Under Self study component of Digital Image Processing course, students should carry out a
project work of developing an Image processing system for real-world applications to explore
the practical applications of the concepts learned.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 CLUSTER
ELECTIVE-1
 COURSE TITLE Distributed Operating System

COURSE CODE 16CS7CEDOS L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Fundamentals: What is Distributed Computing Systems? Evolution of Distributed Computing

System; Distributed Computing System Models; What is Distributed Operating System? Issues
in Designing a Distributed Operating System; Message Passing: Introduction, Desirable features
of a Good Message Passing System, Issues in IPC by Message Passing, Synchronization.
9Hours

UNIT-2

Remote Procedure Calls: Introduction, The RPC Model, Transparency of RPC, Implementing
RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and Results, Server
Management, Parameter-Passing Semantics, Call Semantics, Communication Protocols for
RPCs, Complicated RPCs, Client-Server Binding,. 10 Hours

UNIT-3

Distributed Shared Memory: Introduction, General Architecture of DSM Systems, Design and
Implementation Issues of DSM, Granularity, Structure of Shared Memory Space, Consistency
Models, Replacement Strategy, Thrashing, Other approaches to DSM, Heterogeneous DSM,
Advantages of DSM. 10 Hours

UNIT-4

Process and File Management: Introduction, Process Migration, Threads.

Distributed File Systems: Introduction, Desirable Features of a Good Distributed File System,
File models, File–Accessing Models, File – Sharing Semantics, File – Caching Schemes, File
Replication, Fault Tolerance, Atomic Transactions, Design Principles. 10 Hours

Text Books:
 1. Pradeep. K. Sinha: Distributed Operating Systems: Concepts and Design, PHI
Fundamentals

Reference Books:
1. Andrew S. Tanenbaum: Distributed Operating Systems, Pearson Education.

E-Books:

1. Distributed Operating System by Andrew.S.TanenBaum

2. Distributed Concepts and Design by George Couloruis
3. Distributed Operating Systems by Ing. Tom ́aˇsSeidmann
4. http://nptel.ac.in/downloads/106106107/

MOOCS:

1. http://video.mit.edu/watch/lecture-20-distributed-systems-1845/
2. https://www.youtube.com/watch?v=C5I3e9c2v4

COURSE OUTCOMES:

Course Outcomes Description

CO1 Describe the issues and requirements for Distributed operating system.
CO2 Analyze the Functionalities of various Message Passing Interface and
Remote Procedure Call.
CO3 Illustrate the concepts of Shared memory architecture in Distributed
shared memory.
CO4 Describe the features and issues related to process and file management

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Multimedia Communications

COURSE CODE 16CS7CEMMC L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Multimedia communications: Multimedia information representation, Multimedia networks, multimedia

applications, Network QoS and Application QoS.

Information representation: Text, Images, Audio and Video.

Text and Image compression: Compression principles, Text compression, Image compression. Audio
compression. 10 Hours

UNIT-2

Video compression: Video compression, video compression principles, Video compression standards:
H.261, H.263

Detailed Study of MPEG 4: coding of audio-visual objects, MPEG 4 systems, MPEG 4 audio and video,
profiles and levels. 12 Hours

UNIT-3

MPEG 7 standardization process of multimedia content description, MPEG 21 multimedia

framework.

Multimedia Communication Across Networks: Layered video coding, error resilient video coding
techniques, multimedia transport across IP networks and relevant protocols such as RSVP, RTP, RTCP,
DVMRP, multimedia in mobile networks, multimedia in broadcast networks. 9 Hours

UNIT-4

Multimedia communication system: Application subsystem, Transport subsystem, Quality of Service

and Resource Management.

Multimedia Applications:

Introduction, Media preparation, Media composition, Media Integration, Media communication. 8 Hours

Text Books:
1. “Multimedia communications-Applications, Networks, Protocols and Standards”, Pearson education,
2011 by Fred Halsall.

2. “Introduction to Multimedia Communications: Applications, Middleware, Networking, 2009 By

K.R.Rao, Zoran s bojkovic, Dragorad a Milovanovic.

3. “Multimedia- Computing , Communications and Applications”, Pearson education, 2011 by Ralf

Steinmetz, Klara Nahrstedt.

Reference Books
1. Principles of Multimedia, Tata McGrawHill, 2011 by Ranan Parekh.
2. Multimedia: Systems Design by Prabhat K Andleigh, Kiran Thakrar, Prentice Hall of
India 2004.

E-Books:
1. Multimedia: Making it Work , Eighth edition, 2014 McGrawHill by Tay Vaughan.
2. ACM Transactions on Multimedia Computing, Communications and Applications, 2011 edited
by Ralf Steinmetz.

MOOC:
1. http://nptel.ac.in/courses/106105081/1
2. http://nptel.ac.in/courses/117105083/

COURSE OUTCOMES:

Course Outcomes Description

CO1 Represent multimedia information using digital media.

CO2 Analyze and apply the text, image, audio and video compression techniques.
CO3 Analyze the protocols which help in multimedia communication across networks.
CO4 Integrate the various components of media.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question each
(mandatory), two units to carry two questions each (internal choice) and one question from the
entire syllabus.
 COURSE TITLE Software Quality Metrics

COURSE CODE 16CS7CESQM L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Basics of measurement: Measurement in everyday life, measurement in software engineering, scope of

software metrics, representational theory of measurement, measurement and models, measurement scales,
meaningfulness in measurement, classifying software measures, determining what to measure, software
measurement validation. 9 hours

UNIT-2

Software-metrics data collection and analysis: What is good data, how to define the data, how to
collect the data.

Measuring internal product attributes: Measuring size – Software size, Code Size, Functional size
measures and estimators, Applications of size measures. Measuring structure – Aspects of structural
measure, control flow structure of program units, Design level attributes, Object oriented structural
attributes and measures. Metrics tools – CCCC, CKJM, JMetric 10 hours

UNIT-3

Measuring external product attributes: Modeling software quality, measuring aspects of software
quality, software reliability, basics of software reliability, software reliability problem, parametric
reliability growth models, predictive accuracy, recalibration of software-reliability growth predictions,
importance of operational environment, and wider aspects of software reliability. 10 hours

UNIT-4

Metric Data Analysis in the Relationship Domain: A Fertile domain, Search for relationships,
perceiving relationships, Strength of relationship, Casual relationship and statistical Correlation, Linear
Regression, Example, Multiple Linear Regression. 10 hours

Text Books:

1. Norman Fenton and James Bieman, “software metrics: a rigorous and practical approach”, 3 rd
Edition 2015.
2. Ravindranath Pandian, software metrics: A guide to planning, analysis and application, CRC
Press, 2003.
Reference Books:

1. Stephen H.Kan, ”Metric and Models in software Quality Engineering”, Addison QWesley 2002

MOOCS:

1. https://www.coursera.org/learn/reviews-and-metrics-for-software-improvements

COURSE OUTCOMES:

Course Outcomes Description

CO1 Describe software metrics and measurement.
CO2 Measure the internal and external attributes of the software product.
CO3 Apply product and quality metrics to predict the quality.
CO4 Analyze how to detect, classify, prevent and remove defects.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

Test-1 20
Test-2 20
Quiz/AAT 10
Total 50

Best 2 out of 2 Tests and 2 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Bio Inspired Algorithms

COURSE CODE 16CS7CEBIA L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Introduction: What is Life? - Life and Information - The Logical Mechanisms of Life - What is
Computation? Universal Computation and Computability - Computational Beauty of Nature
(fractals, L-systems, Chaos) - Bio-inspired computing - Natural computing -Biology through the
lens of computer science. Complex Systems and Artificial Life - Complex Networks - Self-
Organization and Emergent Complex Behavior - Cellular Automata - Boolean Networks -
Development and Morphogenesis - Open-ended evolution 10 hours

UNIT-2

Natural Computation And Neural Networks: Biological Neural Networks- Artificial Neural
Nets and Learning - pattern classification & linear separability - single and multilayer
perceptron, back propagation - associative memory - Hebbian learning - Hopfield networks -
Stochastic Networks – Unsupervised learning. 9 hours

UNIT-3

Evolutionary Systems And Algorithms: Evolutionary Programming: biological adaptation &

evolution - Autonomous Agents and Self-Organization: termites, ants, nest building, flock, herds,
and schools. Genetic algorithms: Schema theorem - Reproduction-Crossover-Mutation operators
10 hours

UNIT-4

Competition, Cooperation And Swarm Intelligence: Collective Behavior and Swarm

Intelligence - Social Insects - Stigmergy and Swarm Intelligence; Competition and Cooperation -
zero- and nonzero-sum games - iterated prisoner’s dilemma - stable strategies - ecological &
spatial models - Communication and Multi-Agent simulation – Immuno computing 10 hours

Text Books:

1. Leandro Nunes De Castro, Fernando Jose Von Zuben, “Recent Developments in

Biologically Inspired Computing”, Idea Group Publishing, 2005.
 2. Leandro Nunes De Castro, “Fundamentals of Natural Computing: Basic concepts,
Algorithms and Applications”, Chapman & Hall/ CRC Computer & Information Science
Series, 2006.

Reference Books:
1. Dario Floreano, Claudio Mattiussi, “Bio-Inspired Artificial Intelligence: Theories, Methods
and Technologies”, MIT Press, 2008.

Websites:

1. http://informatics.indiana.edu/rocha/i-bic/
2. http://web.eecs.utk.edu/~mclennan/Classes/420/
3. http://www.cs.stir.ac.uk/courses/31YB/

MOOCS:

1. http://www.nptel.ac.in/syllabus/110104026/

COURSE OUTCOMES:

Course Outcomes Description

CO1 Describe how biological system exploits natural processes.
CO2 Visualize how complex and functional high-level phenomena can emerge
from low-level interactions.
CO3 Analyze group of agents and its self-organization and adaptation.
CO4 Design and implement simple bio-inspired algorithms.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

Test-1 20
Test-2 20
Quiz/AAT 10
Total 50
 Best 2 out of 2 Tests and 2 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Professional Ethics for Engineers

COURSE CODE 16CS7HSHS1 L-T-P-S 2-0-0-0

CIE/SEE
Total Lecture Hours: 26 50/50
Marks

UNIT-1

Engineering Ethics: Senses of ‘Engineering Ethics’ – Variety of moral issues – Types of inquiry
– Moral dilemmas – Moral Autonomy – Models of professional roles - Theories about right
action – Self-interest

Engineering as Social Experimentation: Engineering as Experimentation – Engineers as

responsible Experimenters – Codes of Ethics – A Balanced Outlook on Law. 13 Hours

UNIT-2

Safety, Responsibilities and Rights: Safety and Risk – Assessment of Safety and Risk – Risk
Benefit Analysis and Reducing Risk – The Professional Rights – Employee Rights – Intellectual
Property Rights (IPR) – Discrimination

Global Issues: Multinational Corporations – Environmental Ethics – Computer Ethics –

Weapons Development – Engineers as Managers – Consulting Engineers – Engineers as Expert
Witnesses and Advisors – Moral Leadership – Sample Code of Conduct. 13 Hours

Text Book:

1. Mike W. Martin and Roland Schinzinger, “Ethics in Engineering”, Tata McGraw Hill,
New Delhi, 2nd Edition, 2009.

References:

1. Charles B. Fleddermann, “Engineering Ethics”, Pearson Prentice Hall, New Jersey, 2004.
2. Charles E. Harris, Michael S. Pritchard and Michael J. Rabins, “Engineering Ethics –
Concepts and Cases”, Thompson Wadsworth, A Division of Thomson Learning Inc., United
States, 2000
3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi,
2003
4. Edmund G Seebauer and Robert L Barry, “Fundametals of Ethics for Scientists and
Engineers”, Oxford University Press, Oxford, 2001
Web sources:
1. www.onlineethics.org
2. www.nspe.org
3. www.globalethics.org
4. www.ethics.org

COURSE OUTCOMES:

Course Outcomes Description

CO1 Able to apply moral and professional ethics in society.
CO2 Able to demonstrate ethical issues related to engineer
CO3 Able to conceive the responsibilities and rights in the society

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 2 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from two units from the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
VIII SEMESTER
SYLLABUS
INSTITUTIONAL
ELECTIVE-2
 Programming In Python
COURSE TITLE

COURSE CODE 16CS8IEPIP L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT 1
Introduction to Python, Python Concepts, Dynamic vs. Static Types, Interpreted vs. Compiled,
Prototyping, Procedural vs. Object-Oriented Programming, Comparing Programming Languages-C, C++,
JAVA,C#, Python, The Python Interpreter, Python Versions, Using the Python Command Prompt,
Commenting Python, Launching Python programs, Integrated Development Environments, Types and
Operators, Python Syntax , Indentation, Multiple Line Spanning, Python Object Types, Python Numbers.
Strings: Basic string operations, Indexing and slicing strings, String Formatting, Combining and
Separating Strings, Regular Expressions
Lists: List usage, Adding List Elements, Mutability, Methods
Dictionaries: Making a dictionary, Basic operations, Dictionary details, Operation
Tuples: Why Use Tuples? Sequence Unpacking, Methods 10 hours

UNIT 2
Statements: Assignment, Expressions/Calls, Printing, if Tests, while Loops, for Loops, pass Statement,
break and continue Statements .try, except, finally and raise Statements, import and from Statements, def
and return Statements , Class Statements, Scope, Default Arguments.
Files: File Operations, Files and Streams, Creating a File, Reading From a File, Iterating Through Files,
Seeking, Serialization. 10 hours

UNIT 3
Exceptions: Exception Class Hierarchy, User-Defined Exceptions.
Object Oriented Programming: Learning Python Classes, How Are Classes Better? , “New-style” classes,
Inheritance , Operator Overloads, Class Methods. 9 hours
 UNIT 4
GUI development – examining GUI, understanding event driven programming, root window, labels,
buttons, creating a GUI using a class, binding widgets and event handlers, text and entry widgets and Grid
layout manager, check buttons, radio buttons, mad lib program.
Graphics – Pizza panic game, creating a graphics window, setting background image, understanding the
graphics coordinate system, displaying sprite, text, message, moving sprites, dealing with screen
boundaries, mouse input, collisions. 10 hours

Text books:
3. Learning to Program using Python by Cody Jackson, Second Edition, 2014.
4. Python Programming, Michael DAWSON, 3rd Edition, Course technology PTR, 2010

Reference Books:

5. Introducing Python by Bill Lubanovic, O'Reilly Media, Edition 2014.

6. Learning Python Network Programming by Dr. M. O. FaruqueSarker and Sam Washington,
Packt Publishing, 2015.
7. Python Essential Reference, 4th Edition by David M. Beazley, Pearson Education, Inc., Edition –
2009
8. Python Crash Course: A Hands-on, Project Based Introduction to Programming by Eric Matthes,
No Starch Press Inc, San Francisco, 2016.
E-books:

3. Learning Python, Fifth Edition by Mark Lutz, 2013

4. Programming in Python 3: A Complete Introduction to the Python Language 1st Edition
MOOCS:

3. https://www.coursera.org/course/interactivepython1
4. https://www.coursera.org/course/interactivepython2

Course Outcomes:

CO Number Course Outcome

CO1 Identify the salient features and develop Python programs.
CO2 Apply OO concepts using python.
CO3 Analyse and apply exception handling concepts.
CO4 Design & develop GUI applications for the given requirement.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Internet of Things

COURSE CODE 16CS8IEIOT L-T-P-S 3-0-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design of IoT – IoT
Protocols, IoT communication models, IoT Communication APIs, IoT enabled Technologies – Wireless
Sensor Networks, Cloud Computing, Big data analytics, Communication protocols, Embedded Systems,
IoT Levels and Templates, Domain Specific IoTs – Home, City, Environment, Energy, Retail, Logistics,
Agriculture, Industry, Health and Lifestyle.
10 hours

UNIT-2
Embedded System, Arduino board – Architecture, setting up the board, Introduction to sensors and
actuators, implementing simple program by interfacing with sensors and actuators
10 hours

UNIT-3

IoT Reference Architecture, Wireless Communication Technology for IoT - Wi-Fi, Storing the
sensor data to the cloud using WiFi, GSM, Bluetooth, ZigBee, NFC, RFID 10 hours

UNIT-4

IoT Protocol - Constrained Application Protocol (CoAP), MQ Telemetry Transport (MQTT), Advanced
Message Queuing Protocol (AMQP) 6LoWPAN, Extensible Messaging and Presence Protocol (XMPP)
09 hours

Text Books:
 Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015.
 Julien Bayle, C Programming for Arduino, PACKT Publishing 2013
 Jean-Philippe Vasseur, Adam Dunkels, “Interconnecting Smart Objects with IP”, 2010

Reference books:

 Michael Miller,” The Internet of Things”, First Edition, Pearson, 2015.

  Daniel Minoli, ”Building the Internet of Things with IPv6 and MIPv6:The Evolving
World of M2M Communications”, Wiley, 2013

COURSE OUTCOMES:

Course Outcomes Description

CO1 Describe the characteristics and key technologies for IoT system
CO2 Interfacing Sensor and Actuator with Arduino development board.
CO3 Implementing IoT device by interfacing communication module and cloud
CO4 Describe protocols of resource constraint network

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

Test-1 20
Test-2 20
Quiz/AAT 10
Total 50

Best 2 out of 2 Tests and 1 Quiz will be considered for CIE marks

SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 Course Title
Semantic Web
COURSE CODE 16CS8IESEW L-T-P-S 3-0-0-0
CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:

UNIT-1
INTRODUCTION
Introduction to the Syntactic web and Semantic Web, Evolution of the Web, The visual and
syntactic web, Levels of Semantics, Metadata for web information, The semantic web
architecture and technologies, Contrasting Semantic with Conventional Technologies, Semantic
Modeling, Potential of semantic web solutions and challenges of adoption. 9 hours

UNIT-2
ONTOLOGICAL ENGINEERING
Ontologies, Taxonomies, Topic Maps, Classifying Ontologies, Terminological aspects:
concepts, terms, relations between them, Complex Objects, Subclasses and Sub-properties
definitions, Upper Ontologies, Quality, Uses, Types of terminological resources for ontology
building, Methods and methodologies for building ontologies, Multilingual Ontologies, Ontology
Development process and Life cycle, Methods for Ontology Learning, Ontology Evolution,
Versioning. 10 hours

UNIT-3
STRUCTURING AND DESCRIBING WEB RESOURCES
Structured Web Documents, XML –Structuring, Namespaces, Addressing, Querying,
Processing, RDF – RDF Data Model, Serialization Formats, RDF Vocabulary, Inferencing,
RDFS, basic Idea, Classes, Properties, Utility Properties, RDFS Modelling for Combinations and
Patterns, Transitivity. 10 hours

UNIT-4
WEB ONTOLOGY LANGUAGE
OWL, Sub-Languages, Basic Notions, Classes, Defining and Using Properties, Domain and
Range, Describing Properties, Data Types, Counting and Sets, Negative Property Assertions,
Advanced Class Description, Equivalence , Owl Logic. 10 hours

Text Books:
1. Liyang Yu, A Developer’s Guide to the Semantic Web, Springer; 1st Edition. Edition,
2011.
2. John Hebeler, Matthew Fisher, Ryan Blace and Andrew Perez-Lopez, Semantic Web
Programming, Wiley; 1 edition, 2009.
3. Grigoris Antoniou, Frank van Harmelen, A Semantic Web Primer, Second Edition
(Cooperative Information Systems) (Hardcover), MIT Press, 2008
4. Robert M. Colomb, Ontology and the Semantic Web: Volume 156 Frontiers in Artificial
Intelligence and Applications (Frontier in Artificial Intelligence and Applications), IOS
Press, 2007.
5. Dean Allemang and James Hendler, Semantic Web for the Working Ontologist: Effective
Modeling in RDFS and OWL, Morgan Kaufmann; 2 edition, 2011.

References:
1. Michael C. Daconta, Leo J. Obrst and Kevin T. Smith, The Semantic Web: A Guide to the
Future of XML, Web Services, and Knowledge Management, Wiley; 1 edition 2003
2. Karin Breitman, Marco Antonio Casanova and Walt Truszkowski, Semantic Web:
Concepts, Technologies and Applications (NASA Monographs in Systems and Software
Engineering), Springer; Softcover, 2010.
3. Vipul Kashyap, Christoph Bussler and Matthew Moran, The Semantic Web: Semantics
for Data and Services on the Web (Data-Centric Systems and Applications), Springer,
2008.

COURSE OUTCOMES:

Course Outcomes Description

CO1 Able to comprehend the architecture of semantic web.
CO2 Able to illustrate and classify ontologies.
CO3 Able to create structured web documents.
CO4 Able to apply OWL logic.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 COURSE TITLE Green Computing

COURSE CODE 16CS8DCGCT L-T-P-S 3-1-0-0

CIE/SEE
Total Lecture Hours: 39 50/50
Marks

SYLLABUS:
UNIT-1

Green IT Fundamentals: Business, IT and the Environment, Green computing: carbon foot print,
scoop on power, Green IT Strategies: Drivers, Dimensions and Goals, Environmentally
Responsible Business: Policies, Practices, and Metrics. 9 Hours

UNIT-2

Green Assets: Buildings, Data Centers, Networks, and Devices, Green Business Process
Management: Modeling, Optimization, and Collaboration, Green Enterprise Architecture,
Environmental Intelligence, Green Supply Chains, Green Information Systems: Design and
Development Models. 10 Hours

UNIT-3

Virtualizing of IT systems, Role of electric utilities, Telecommuting, teleconferencing and

teleporting, Materials recycling, Best ways for Green PC, Green Data center, Green Grid
framework. 10 Hours

UNIT-4

Socio-cultural aspects of Green IT, Green Enterprise Transformation Roadmap, Green

Compliance: Protocols, Standards, and Audits, Emergent Carbon Issues: Technologies and
Future. 10 Hours

Text Books:

1. BhuvanUnhelkar, “Green IT Strategies and Applications-Using Environmental Intelligence”,

CRC Press, June 2011
2. Woody Leonhard, Katherrine Murray, “Green Home computing for dummies”, August 2009.

References:
1. Alin Gales, Michael Schaefer, Mike Ebbers, “Green Data Center: Steps for the Journey”,
Shoff/IBM Rebook, 2011.
2. John Lamb, “The Greening of IT”, Pearson Education, 2009.
3. Jason Harris, “Green Computing and Green IT- Best Practices on regulations & industry”,
Lulu.com, 2008.
4. Carl speshocky, “Empowering Green Initiatives with IT”, John Wiley & Sons, 2010.
5. Wu Chun Feng (editor), “Green computing: Large Scale energy efficiency”, CRC Press, 2012.

ASSESSMENT:

CIE Scheme:

Assessment Weightage in Marks

2 Quiz/AAT 10
2 Internals 40
Total 50

Best 2 out of 3 Tests and 1 Quiz will be considered for CIE marks
SEE Scheme:
Semester End Examination (SEE) is a written examination of three hours duration for 100 marks.
Students have to answer 5 questions from four units, two units to carry one question
each(mandatory), two units to carry two questions each (internal choice) and one question from
the entire syllabus.

Both CIE and SEE have equal (50:50) weightages. The Student's performance in a course shall
be judged individually and together based on the results of CIE and SEE.
 PROJECT
AND
INTERNSHIP
 COURSE TITLE Project Phase-1

COURSE CODE 16CS7DCPP1 L-T-P-S 0-0-2-0

CIE/SEE
Total Lecture Hours: ---- 50/50
Marks

7th sem Project Phase 1

Ability to identify a real life/engineering problem, utilize prior knowledge
CO1 and conduct extensive investigation, across diverse sources, in addressing
the problem and generating abstract design.

CO3 Ability to plan, monitor, and manage project schedule, resources, and work
assignments to ensure timely completion
Perform professionally—as a team member, accepting responsibility,
CO3 taking initiative, and providing leadership necessary to ensure project
success.

CO4 Ability to use formal and informal communications with team members
and guide, make presentations and prepare technical document.
Ability to provide solution within the context of leagal framework
CO5 addressing the societal and environmental concerns and upholding ethical
issues

Students are required to:

1. Form teams of 2 to 4 members.
2. Identify the problem.
3. Survey the related literature.
4. Formulate the High Level Deisgn.
5. Prepare Project Report and Survey Paper.

NOTE:
Presentations to be made:
 At the end of first month to an external audition committee, members comprising of industry
experts and alumni.
 At the end of third month to an internal panel for CIE.
 At the end of 7th semester for SEE.
 COURSE TITLE Project Phase-2

COURSE CODE 16CS8DCPP2 L-T-P-S 0-0-12-0

CIE/SEE
Total Lecture Hours: ---- 50/50
Marks

8th sem Project Phase 2

Competence in applying the software engineering principles in planning, formulating
CO1 an innovative design/ approach and computing the requirements appropriate to solve
the problem within the context of legal, global and environment constraint.
Capability to develop/implement the design with appropriate techniques, resources
CO2 and contemporary tools – exhibiting integrity and ethical behavior in engineering
practice.
Ability to plan, monitor, and manage project schedule, resources, and work
CO3
assignments to ensure timely completion
Ability to test and defend performance of the implemented project and understand the
CO4
implication of the solution.
Perform professionally—as a team member, accepting responsibility, taking initiative,
CO5
and providing leadership necessary to ensure project success.[
CO6
Ability to use formal and informal communications with team members and guide,
make presentations and prepare technical document.
Ability to provide solution within the context of leagal framework addressing the
CO7
societal and environmental concerns and upholding ethical issues

Students are required to:

1. Develop a Detailed Design.
2. Implementation of the set objectives using latest tools and technology within the given timeline.
5. Demonstrate results clearly after thorough testing.
6. Prepare Project Report andImplementation Paper.

NOTE:
Presentations to be made:
 At the end of third month to an internal panel for CIE.
 At the end of 8th semester for SEE.

*The project is split into two phases across two semesters:

 Phase 1 in 7th Semester is of 2 credits and it includes Problem Identification,
Formulation, Literature Survey and Design.
 Phase 2 in 8th Semester is of 12 credits and it includes Implementation, Testing and
Validation.
 COURSE TITLE Internship

COURSE CODE 16CS8DCINT L-T-P-S 0-0-2-0

CIE/SEE
Total Lecture Hours: ---- 50/50
Marks

COURSE OUTCOMES

Course Outcomes
CO 1 Ability to Apply domain knowledge in proposing solution for IT problem.
Ability to develop/implement the design with appropriate techniques, resources and
CO 2
contemporary tools and deliver solution with stipulated planning.
CO 3 Ability to work independently.
CO 4 Ability to work in collaboration/multidisciplinary environment.
Ability to exhibit integrity and ethical behaviour during preparation of Technical
CO 5
document/Report/development of solution.
Ability to use formal and informal communications with guide, make presentations and
CO 6
prepare technical document.