Data Center Networking 3 0 0 3

DEPARTMENT OF INFORMATION TECHNOLOGY VTUR 15 CURRICULUM AND SYLLABUS

B.TECH – INFORMATION TECHNOLOGY CBCS CURRICULUM VTU R2015 PROGRAM CORE

Course Sl.No Code Program Core L T P C 1 1151IT101 Concrete Mathematics 3 0 0 3 2 1151IT102 Data Structures 3 0 0 3 Computer Organization and Digital 1151IT103 3 0 0 3 3 Design 4 1151IT104 Object Oriented Programming 3 0 0 3 5 1151IT105 Operating System 3 0 0 3 6 1151IT106 Object Oriented Software Engineering 3 0 0 3 7 1151IT107 Database Management System 3 0 0 3 8 1151IT108 Computer Networks 3 0 0 3 9 1151IT109 Information Coding Techniques 3 0 0 3 10 1151IT110 Mobile Application Development 3 0 0 3 11 1151IT111 Design And Analysis of Algorithm 3 0 0 3 12 1151IT112 Compiler Design 3 0 0 3 13 1151IT113 Mobile Communication 3 0 0 3 14 1151IT114 Cryptography and Network Security 3 0 0 3 15 1151IT115 Wireless Communication 3 0 0 3 16 1151IT116 Embedded Programming 3 0 0 3 17 1151IT117 Web Technologies 3 0 0 3 18 1151IT118 Cloud Computing 3 0 0 3 19 1151IT301 Data Structures Lab 0 0 2 1 20 1151IT302 Operating System Lab 0 0 2 1 21 1151IT303 Object Oriented Programming Lab 0 0 2 1 22 1151IT304 Database Management System Lab 0 0 2 1 23 1151IT306 Mobile Application Development Lab 0 0 2 1 24 1151IT307 Computer Networks Lab 0 0 2 1 Total Credits 60

COURSE CODE COURSE TITLE L T P C 1151IT101 CONCRETE MATHEMATICS 3 0 0 3

Course Category: Program Core

A. Preamble : This course provides an introduction to the basic concepts and techniques of numerical methods, graph theory, random variables, markov processes properties, distribution, queuing models non- markovian queuing models and their inter- relations and applications to computer science engineering, and science areas; introduce students to cognitive learning in mathematics; and develops problem solving skills with both theoretical and computer science engineering oriented problems.

B. Prerequisite Courses: Sl. No Course Code Course Name 1 1150MA202 Engineering Mathematics I

C. Related Courses:

Sl. No Course Code Course Name 1 1156IT701 Major Project

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Apply numerical methods to find our solution of algebraic equations using different methods under different conditions, and CO1 K3 numerical solution of system of algebraic equations.

Solve problems involving graph models, connectivity paths , connectedness in undirected and directed graphs ,Euler and CO2 K3 Hamilton paths . shortest-path problem,Trees,Connected Trees

Calculate probabilities, random processes, stationary random processes , autocorrelation and cross-correlation functions and CO3 K3 ergodic processes

Identify the nature of the process namely Binomial, Poisson, CO4 Normal, Markov, Sine wave processes and calculate stationary K3 and transition probabilities. Apply the concept of Markovian Queueing models and the CO5 concept of non-Markovian queues for obtaining measures of K3 performance of real-time problems under steady state conditions

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 M L CO2 M L CO3 L CO4 L CO5 M H- High; M-Medium; L-Low

F. Course Content :

UNIT I Linear Algebraic Equation And Eigen Value Problems L – 9 System of equations–solution by Gauss elimination, Gauss-Jordan and LU decomposition method–Jacobi, Gauss-Seidel iteration methods–finding Eigen values of a matrix by Jacobi and power methods

Non-Linear system of equations: Graphical method-Netwon-Raphson Method-modified Netwon- Raphson Method-Method of steepest descent method.

UNIT II Graphs L – 9

Simple graphs and multi-graphs – directed multi-graphs – graph models – handshaking theorem – some simple special graphs – representing graphs and graph isomorphism – adjacency and incidence matrices – connectivity paths – connectedness in undirected and directed graphs – Euler and Hamilton paths – shortest-path problems- Trees-Connected Trees

UNIT III Random Processes L – 9

Finite probability – probability distributions – conditional probability – independence – Bayes‘ theorem – mathematical expectation-Definition and description – random processes – stationary random processes – autocorrelation and cross-correlation functions and their properties – ergodic processes

UNIT IV Special Random Processes L – 9

Sine wave process – binomial, Poisson and normal processes – Markov process – Markov chains – transition probability matrix – steady-state distribution – classification of states of Markov chains – birth and death process

UNIT V Queueing Theory L – 9 Basics of queueing models – (M-M-1):( /FIFO) model - (M-M-s):( /FIFO) model -(M-M-1) :(k/FIFO) model - (M-M-s):(k/FIFO) model – (M-G-1) queueing model – Pollaczek-Khinchine formula TOTAL : 45 Periods

G. Learning Resources i. Text Books: 1. S.M. Ross, ―Introduction to Probability Models‖, eighth edition, Academic Press, San Diego, 2004.

2. B.S. Grewal, ―Numerical Methods in Engineering and Science‖, eighth edition, Khanna Publishers, New Delhi, 2008 3. John J. Shynk, Probability, Random Variables, and Random Processes: Theory and Signal , Wiley, 2012. 4. Scott L. Miller, Donald and G. Childers, Probability and Random Processes: With Applications to Signal Processing and Communications, Academic Press, 2012. 5. Kishor S. Trivedi, Probability & Statistics with Reliability, Queuing and Computer Applications, Second Edi., Prentice Hall of India ,2008. 6. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers and Keying Ye, Probability & Statistics for Engineers & Scientists, Prentice Hall, 9th Edi., 2010. 7. P.Z.Peebles Jr.Probability, Random Variables are Random Signal Principles, Tata McGraw Hill, New Delhi,2002 iii. Online resources 1. www.algebra.com › Algebra › College › Linear Algebra 2. www.richland.edu/james/lecture/m116/matrices/pivot.html 3. www.youtube.com/watch?v=wTlAUfv_O4s 4. www.sfb649.wiwi.hu-berlin.de/fedc_homepage/xplore/.../node39.htm 5. www.ergodic.ugr.es/cphys/LECCIONES/FORTRAN/power_method.pdfl 6. http://www.cs.cornell.edu/home/kleinber/networks-book/networks-book-ch02.pdf 7. http://www.math.fsu.edu/~pkirby/mad2104/SlideShow/s6_2.pdf 8. http://www.mathcove.net/petersen/lessons/get-lesson?les=2 9. www.am.qub.ac.uk/users/g.gribakin/sor/chap1a.pdf 10. www.slideshare.net/guest44b78/probability-concepts-applications 11. www.vassarstats.net/bayes.html 12. www.borooah.com/teaching/microeconomics/bayes.pdf 13. www.ccs.neu.edu/course/.../probability/conditionalprobability.pdf 14. www.cems.uvm.edu/~dben/chris_probability.ppt - united states 15. en.wikipedia.org/wiki/moment-generating_function 16. www.courses.ncssm.edu/math/stat_inst/pdfs/sec_2_f.pdf 17. www.statlect.com › additional topics in probability theory

COURSE CODE COURSE TITLE L T P C 1151IT102 DATA STRUCTURES 3 0 0 3

Course Category: Program Core

A. Preamble : This course provides an introduction to the basic concepts and techniques of Linear and non linear data Structures and Analyze the various algorithm.

B. Prerequisite Courses:

Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

C. Related Courses:

Sl. No Course Code Course Name 1 1151IT111 Design and Analysis of Algorithm

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Identify user defined data types, linear data structures for solving K2 CO1 real world problems. Write modular programs on non linear data structures and K3 CO2 algorithms for solving engineering problems efficiently. CO3 Illustrate some of the special trees and Hashing Techniques. K2 State what is an undirected graph, directed graph and apply BFS K2 CO4 and DFS to traverse a graph Demonstrate knowledge of sorting algorithms and their run-time K3 CO5 complexity.

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L CO2 M M L CO3 M M L CO4 M M L CO5 M M L H- High; M-Medium; L-Low

F. Course Content : UNIT I LINEAR DATA STRUCTURE L – 9

Introduction - Time and space complexity analysis - Abstract Data Type (ADT) – The List ADT – Array Implementation – Linked List Implementation– the Stack ADT – The Queue ADT – Applications of Stack, Queue and List.

UNIT II TREES L – 9 Introduction to trees - Tree Traversal - Binary Trees - Definitions – Expression Tree – Binary Tree Traversals - The Search Tree ADT – Binary Search Trees - AVL Tree.

UNIT III SPECIAL TREES & HASHING L – 9 Splay Tree – B-Tree - Priority Queue - Binary Heap –. Hashing - Separate Chaining – Open Addressing – Linear Probing – Quadratic Probing – Double Hashing –Rehashing

UNIT IV GRAPH L – 9

Introduction to Graphs - Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths –Dijkstra‘s Algorithm – Minimum Spanning Tree – Prim‘s Algorithm- Kruskal‘s Algorithm – Breadth first search – Depth-First Search – Undirected Graphs – Biconnectivity.

UNIT V SORTING & SEARCHING L – 9

Sorting algorithm- Insertion sort- Selection sort- Shell sort-Bubble sort- Quick sort- Heap sort- Merge sort- Radix sort - Searching – Linear search - Binary search. Total: 45 Periods G. Learning Resources i. Text Books: 1. M. A. Weiss, ―Data Structures and Algorithm Analysis in C‖, Second Edition , Pearson Education, 2007.

ii. Reference: 1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, ―Data Structures and Algorithms‖, Pearson Education, First Edition Reprint 2003. 2. R. F. Gilberg, B. A. Forouzan, ―Data Structures‖, Second Edition, Thomson India Edition, 2005. 3. Ellis Horowitz, Sartaj Sahni, Dinesh Mehta, ―Fundamentals of Data Structure‖, Computer Science Press, 1995.

iii. Online resources 1. http://simplenotions.wordpress.com/2009/05/13/java-standard-data-structures-big-o-notation/ 2. http://mathworld.wolfram.com/DataStructure.html/. 7

COURSE CODE COURSE TITLE L T P C 1151IT103 COMPUTER Organization and Digital Design 3 0 0 3

Course Category: Program Core

a. Preamble :

This course provides the basics of Number Systems, Boolean Functions, Simplification of Boolean Functions, Logic Gates, Combinational circuits, Multiplexers and Demultiplexers. Also gives knowledge on basics of organizational and architectural issues of a digital computer, analyze performance issues in processor and memory design of a digital computer, various data transfer techniques in digital and performance improvement using instruction level parallelism.

b. Prerequisite Courses:

Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C 2 1150MA202 Mathematics II

c. Related Courses:

Sl. No Course Code Course Name 1 1152IT101 Fundamentals of IT 2 1151IT105 Operating System

d. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised No’s Bloom’s Taxonomy) Able to understand the fundamentals of digital principles and K3,S3 CO1 able to design digital circuits by simplifying the Boolean functions.

CO2 Able to design various combinational and sequential circuits. K3, S3 Able to Understand the organization and working principle of K2, S3 CO3 computer hardware components.

Able to trace the execution sequence of an instruction through K4, S3 CO4 the processor.

CO5 Acquire knowledge about multiprocessor organization and K3, S3 8

parallel processing also can understand mapping between virtual and physical memory.

e. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M H M H CO2 H H H M L M CO3 M H L H M H CO4 H L M L L L M M H CO5 M L H H- High; M-Medium; L-Low f. Course Content:

UNITI DIGITAL FUNDAMENTALS

Number Systems and Conversions – Boolean Algebra and Simplification – Minimization of Boolean Functions – Karnaugh Map, Logic Gates – NAND – NOR Implementation

UNIT II COMBINATIONAL AND SEQUENTIAL CIRCUITS Design of Combinational Circuits – Adder / Subtracter – Encoder – Decoder – MUX / DEMUX – Comparators, Flip Flops – Triggering – Master – Slave Flip Flop – State Diagram and Minimization – Counters – Registers.

UNIT III BASIC STRUCTURE OF COMPUTERS & PARALLEL PROCESSING Functional units – Basic operational concepts – Bus structures – Performance and Metrics – Instruction and instruction sequencing – Addressing modes – ALU design – Fixed point and Floating point operation .

UNIT IV PROCESSOR DESIGN Processor basics – CPU Organization – Data path design – Control design – Basic concepts – Hard wired control – Micro programmed control – Pipeline control – Hazards – Super scalar operation.

UNIT V MEMORY, I/O SYSTEM AND PARALLEL PROCESSING

Memory technology – Memory systems – Virtual memory – Caches – Design methods – Associative memories – Input/output system – Programmed I/O – DMA and Interrupts – I/O Devices and Interfaces - Multiprocessor Organization – Symmetric multiprocessors – Cache Coherence – Clusters: Non Uniform Memory Access- Vector Computation.

TOTAL: 45 PERIODS

h. Learning Resources

i. Text Books: 1. Morris Mano, ―Digital Design‖, Prentice Hall of India, Fourth Edition 2007.

2.Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, ―Computer organization and Embedded Systems‖, Sixth Edition, Tata McGraw Hill, 2012. ii. Reference Books: 1. Charles H. Roth, Jr., ―Fundamentals of Logic Design‖, Jaico Publishing House, Mumbai, Fourth Edition, 1992. 2. William Stallings, ―Computer Organization & Architecture – Designing for Performance‖ 9 th Edition 2012. 3. David A. Patterson and John L. Hennessy, ―Computer Organization and Design: The Hardware/Software Interface‖, Fourth Edition, Morgan Kaufmann / Elsevier,2009. 6. John. 4. P. Hayes, ―Computer Architecture and Organization‖, Third Edition, Tata McGraw Hill, 1998. N.Yanushkevich, Vlad P.Shmerko, ―Introduction to Logic Design‖, CRC Press, 2012. iii. Online resources

1. nptel.ac.in/courses/106103068/pdf/coa.pdf 2. www.svecw.edu.in/Docs%5CITIIBTechIISemLecCOA.pdf 3. www.kinindia.net/29-cs6201-digital-principles-and-system-design-notes/

COURSE CODE COURSE TITLE L T P C 1151IT104 Object Oriented Programming 3 0 0 3

Course Category: Program Core

a. Preamble : This course provides an introduction to Object Oriented Programming concepts using C++. The course emphasis is on the object orientated facilities of C++ and how they can be used to create modular and re-usable code. Object-Oriented Software Development is an approach/paradigm of developing software by identifying and implementing a set of objects and their interactions to meet the desired objectives. The first step towards this kind of software development is to learn and master the various concepts, tools and techniques that are to be used design and implementation of such systems b. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

c. Related Courses: Sl. No Course Code Course Name 1 1152IT121 JAVA Design Pattern

d. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO (Based on revised Course Outcomes Nos. Bloom’s Taxonomy) Explain the concepts of object-oriented programming and CO1 K2, S3 basic structure of C++ programming Apply the concept of constructor and destructor for given  CO2 K3, S3 problem in C++. Demonstrate the template and exception handling for simple  CO3 K2, S3 and complex programs. Construct the C++ program, by using various inheritance  CO4 K3, S3 concepts and virtual function for given problem. Discuss various File IO stream, RTTI, and standards template  CO5 K2, S3 library. e. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M M L

CO2 M M L CO3 M M L CO4 M M L CO5 M M L H- High; M-Medium; L-Low f. Course Content :

UNIT I 9

Object oriented programming concepts – objects – classes – methods and messages – abstraction and encapsulation – inheritance – abstract classes – polymorphism. Introduction to C++ – classes – access specifiers – function and data members – default arguments – function overloading – friend functions – const and volatile functions - static members – Objects – pointers and objects – constant objects – nested classes – local classes

UNIT II 9

Constructors – default constructor – Parameterized constructors – Constructor with dynamic allocation – copy constructor – destructors – operator overloading – overloading through friend functions – overloading the assignment operator – type conversion – explicit constructors

UNIT III 9

Function and class templates - Exception handling – try-catch-throw paradigm – exception specification – terminate and unexpected functions – Uncaught exception.

UNIT IV 8

Inheritance – public, private, and protected derivations – multiple inheritance - virtual base class – abstract class – composite objects Runtime polymorphism – virtual functions – pure virtual functions.

UNIT V 10

RTTI – typeid – dynamic casting – RTTI and templates – cross casting – down casting.Streams and formatted I/O – I/O manipulators - file handling – random access – object serialization – namespaces - std namespace – ANSI String Objects – standard template library.

g. Learning Resources i.Text Books :

1. B. Trivedi, ―Programming with ANSI C++‖, Oxford University Press, 2012.

ii.Reference:

1. Goran Svenk, ―Object-oriented Programming: Using C++ for Engineering and Technology‖Second Edition 2003.

2. Balagurusamy, ―Object-oriented Programming with C++‖ Tata McGraw-Hill Education, Fourth Edition 2008

3. DEBASISH JANA, ―C++ AND OBJECT-ORIENTED PROGRAMMING PARADIGM, Eastern Economy Edition, Second Edition OCT 2005.

4. Ira Pohl, ―Object Oriented Programming using C++‖, Pearson Education, Second Edition Reprint 2004.

5. B. Lippman, Josee Lajoie, Barbara E. Moo, ―C++ Primer‖, Fourth Edition, Pearson Education, 2005.

6. Stroustrup, ―The C++ Programming language‖, Third edition, Pearson Education, 2004

iii. Online resources  www.tutorialspoint.com/cplusplus/cpp_object_oriented.htm  https://www.cs.virginia.edu/~knabe/.../c++/c++_3.h...  www.cplusplus.com/doc/tutorial/  www.mamcet.com/it/e-learning/3sem/cs1202/lecturenotes-cs1202.pdf

COURSE CODE COURSE TITLE L T P C 1151IT105 OPERATING SYSTEMS 3 0 0 3 Course Category: Program Core

A. Preamble : In this course will be discussing about Address spaces, system call interface, process/threads, inter process communication, deadlock, scheduling, memory, virtual memory, file systems.

B. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C 2 1151IT103 Computer Organization and Digital Design

C. Related Courses: Sl. No Course Code Course Name 1 1152IT114 Unix and Shell Programming 2 1152IT122 Open Source Computing 3 1152IT112 Virtualization Technologies 4 1152IT120 Distributed Computing

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning domain CO Course Outcomes (Based on revised Nos. Bloom’s taxonomy) Explain the operating system program, structures and operations CO1 K2 with system calls  CO2 Analyze the process management concept for the given situation. K3  CO3 Handle the deadlock and get knowledge about CPU scheduling. K3 CO4 Explain the different storage management for the given situation. K2 CO5 Explain the mass storage structure and file system Interface. K2

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 L M M CO2 L H M M CO3 L H M M CO4 L M M M CO5 L M M L H- High; M-Medium; L-Low

F. Course Content: UNIT I OPERATING SYSTEMS OVERVIEW L – 9 Operating system overview: Objectives – functions - Computer System Organization-Operating System Structure - Operating System Operations- System Calls, System Programs.

UNIT II PROCESS MANAGEMENT L – 9 Processes: Process Concept - Process Scheduling - Operations on Processes – Inter process Communication. Process Synchronization: The Critical-Section Problem - Semaphores - Classic Problems of Synchronization – Monitors. Case Study: Windows 10 operating system

UNIT III SCHEDULING AND DEADLOCK MANAGEMENT L – 9 CPU Scheduling: Scheduling Criteria - Scheduling Algorithms. Deadlocks: Deadlock Characterization - Methods for Handling Deadlocks - Deadlock Prevention - Deadlock Avoidance - Deadlock Detection - Recovery from Deadlock. Case Study: MAC operating system

UNIT IV STORAGE MANAGEMENT L – 9 Main Memory: Swapping - Contiguous Memory Allocation, Segmentation, Paging. Virtual Memory: Demand Paging - Page Replacement - Allocation of Frames - Thrashing. Case Study: Android operating system

UNIT V STORAGE STRUCTURE L – 9 Mass Storage Structure: Disk Structure - Disk Scheduling - Disk Management. File-System Interface: File Concepts, Directory Structure - File Sharing – Protection. File System. Case Study: Linux operating system

TOTAL : 45 Periods G. Learning Resources i. Text Books: 1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating System Concepts‖, 9th Edition, John Wiley and Sons Inc., 2012. 2. Richard Petersen, ―Linux: The Complete Reference‖, 6th Edition, Tata McGraw-Hill, 2008.

i. Reference Books: 1. Andrew S. Tanenbaum, ―Modern Operating Systems‖, 4th Edition, Prentice Hall, Wesley, 2014. 2. William Stallings, ―Operating Systems – Internals and Design Principles‖, 7th Edition, Prentice Hall, 2011. 3. Harvey M. Deitel, ―Operating Systems‖, 7th Edition, Prentice Hall, 2003. 4. D M Dhamdhere, ―Operating Systems: A Concept-Based Approach‖, 2nd Edition, Tata McGraw-Hill Education, 2007. 5. Charles Crowley, ―Operating Systems: A Design-Oriented Approach‖, Tata McGraw Hill Education‖, 1996. iii. Online Resources: 1. http://www.tutorialspoint.com/operating_system/ 2. http://www.mu.ac.in/myweb_test/MCA%20study%20material/OS%20- %20PDF.pdf 3. http://codex.cs.yale.edu/avi/os-book/OS8/os8c/slide-dir/PDF-dir/ch2.pdf 4. http://www.freebookcentre.net/CompuScience/Free-Operating-Systems-Books-Download.html

COURSE CODE COURSE TITLE L T P C 1151IT106 OBJECT ORIENTED SOFTWARE 3 0 0 3 ENGINEERING Course Category: Program Core

A. Preamble : Software engineers are those who contribute by direct participation or by teaching, to the analysis, specification, design, development, certification, maintenance, and testing of software systems

B. Prerequisite Courses: Sl No Course Code Course Name 1 1150CS201 Problem solving using C

C. Related Courses: Sl No Course Code Course Name 1 1152IT131 Software Quality Assurance

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Discuss about software development process models K2 Identify the contemporary issues and discuss about coding CO2 K2 standards Recognize the knowledge about testing methods and CO3 K2 comparison of various testing techniques. Use the concept and standards of quality and getting knowledge CO4 K2 about software quality assurance group.

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 L CO3 M M CO4 M M

F. Course Content : UNIT- I Introduction L – 9 Introduction to Software Engineering - Software Development process models – Agile Development - Project & Process - Project management - Process & Project metrics - Object Oriented concepts, Principles & Methodologies.

UNIT- II Planning & Scheduling L – 9 Software Requirements Specification, Software prototyping - Software project planning - Scope - Resources - Software Estimation - Empirical Estimation Models – Planning - Risk Management - Software Project Scheduling - Object Oriented Estimation & Scheduling.

UNIT -III Analysis L – 9 Analysis Modeling - Data Modeling - Functional Modeling & Information Flow - Behavioral Modeling-Structured Analysis - Object Oriented Analysis - Domain Analysis-Object oriented Analysis process - Object Relationship Model - Object Behaviour Model, Design modelling with UML.

UNIT -IV Design L – 9 Design Concepts & Principles - Design Process - Design Concepts - Modular Design - Design Effective Modularity - Introduction to Software Architecture - Data Design - Transform Mapping - Transaction Mapping - Object Oriented Design - System design process- Object design process - Design Patterns.

UNIT -V Implementation, Testing & Maintenance L – 9 Top - Down, Bottom-Up, object oriented product Implementation & Integration. Software Testing methods-White Box, Basis Path-Control Structure - Black Box - Unit Testing - Integration testing - Validation & System testing - Testing Tools – Software Maintenance & Reengineering. TOTAL : 45 Periods G. Learning Resources i. Text Books : 1. Roger. S. Pressman and Bruce R. Maxim, ―Software Engineering – A Practitioner‘s Approach‖, seventh Edition, McGraw Hill, 2015. 2. Ian Sommerville, ―Software Engineering‖, eighth edition, Pearson Education, New Delhi, 2011. 3. Bill Brykczynski, Richard D. Stutz ,‖Software Engineering Project Management‖, Wiley India Edition, IEEE computer society, 2007. 4. Craig Larman, Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development (3rd Edition), Pearson Education, 2008. ii.Reference: 1. Fairley R, ―Software Engineering Concepts‖, second edition, Tata McGraw Hill,New Delhi, 2003. 2. Jalote P, ―An Integrated Approach to Software Engineering‖, third edition, Narosa Publishers, New Delhi, 2013. 3. Grady Booch, James Rumbaugh, Ivar Jacobson - "the Unified Modeling Language User Guide" - Addison Wesley, 1999. 4. Ali Bahrami, ―Object Oriented Systems Development‖ 1st Edition, The McGraw-Hill Company, 1999.

COURSE CODE COURSE TITLE L T P C 1151IT107 DATABASE MANAGEMENT SYSTEM 3 0 0 3

Course Category: Program Core A. Preamble: This course provides demands the need for efficient storage and manipulation of data which will be used worldwide and exposed to different applications. B. Pre-requisite: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

C. Links to Other Courses: Sl. No Course Code Course Name 1 1152IT120 Distributed Computing 2 1151IT118 Cloud Computing 3 1152IT117 Data Warehousing and Data Mining

D. Course Outcomes: At the end of the course, the students are able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Explain the basic concepts of Database Management System K2 CO2 Write SQL Queries for the given scenario. K3 Apply normalization techniques for the given database CO3 K3 application. Illustrate the concepts of transaction, Concurrency and CO4 K2 Recovery techniques in database. CO5 Describe the concept of physical storage media. K2 CO6 Explain the various types of databases K2

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 H M L M CO3 H M M L CO4 L L L CO5 M CO6 M

F. Course Content UNIT I INTRODUCTION TO DBMS L – 9 Purpose of Database System – Database Schema and Instances- Views of data – Database Languages - Database System Architecture – Database users and Administrator – Entity– Relationship model – E-R Diagrams - Introduction to relational databases –Structure of relational databases. UNIT II RELATIONAL MODEL L – 9 Basics of the Relational Model- From E/R Diagrams to Relational Designs – Keys and Integrity Constraints - Relational Algebra – Relational Calculus-Tuple –Structured Query language( SQL) Basic and additional Operations – Nested Queries & Join Queries–Embedded SQL- Triggers - View Definitions and Modifications. UNIT III NORMALIZATION L – 9 Introduction and problem of data redundancy-Features of good Relational database design- Functional Dependencies - Normalization – First Normal Form, Second Normal Form and Third Normal Form –Advanced Normalization -Boyce/Codd Normal Form, Fourth Normal Form and Fifth Normal Form- Dependencies preservation-Case Studies of database system. UNIT IV TRANSACTION AND CONCURRENCY L – 9 Transaction Concepts – ACID Properties –Transactions and Schedules- Transaction States - Concurrent Execution- Serializability- Types of Failure-Recoverability -System Recovery – Media Recovery – Types of Locks-Two Phase locking – Deadlock- Detection, Recovery and Prevention. UNIT V PHYSICAL STORAGE AND DATABASE CONCEPTS L – 9 Overview of Physical Storage Media – Magnetic Disks – RAID – Introduction to Distributed Databases and Client/Server Databases- Statistical Databases- Multidimensional and Parallel databases- Spatial and multimedia databases- Mobile and web databases- Object Oriented Databases-XML Databases. TOTAL : 45 Periods G. Learning Resources i. Text Books: 1. Abraham Silberschatz, Henry F. Korth and S. Sudharshan, ―Database System Concepts‖, Sixth Edition, Tata McGraw Hill, 2011. 2. Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom, ―Database Systems: The Complete Book‖, Pearson Education, Second Edition, 2008. 3. RamezElmasri and Shamkant B. Navathe, ―Fundamentals of Database Systems‖, Fifth Edition, Pearson Education, 2008. 4. C.J.Date, A.Kannan and S.Swamynathan, ―An Introduction to Database Systems‖, Eighth Edition, Pearson Education, 2006. ii. References Books: 1. Raghu Ramakrishnan, ―Database Management Systems‖, Third Edition, McGraw Hill, 2003. 2. S.K.Singh, ―Database Systems Concepts, Design and Applications‖, First Edition, Pearson Education, 2006. 3. C. J. Date ,‖An Introduction to Database Systems‖ – 8th Edition, Addison Wesley, 2004. 4. S.K.Singh, ―Database Systems Concepts, Design and Applications‖, First Edition, Pearson Education, 2006. iii. Online Resources: a) http://cs.ulb.ac.be/public/_media/teaching/infoh303/dbmsnotes.pdf b) http://www.iitg.ernet.in/awekar/teaching/cs344fall11/lecturenotes/september%2012.pdf c) http://sage.virtual-labs.ac.in/home/pub/1/

COURSE CODE COURSE TITLE L T P C 1151IT108 COMPUTER NETWORKS 3 0 0 3

Course Category: Program Core

A. Preamble : This course is to provide students with an overview of the concepts and fundamentals of computer networks. Topics to be covered include: data communication concepts and techniques in a layered network architecture, communications switching and routing, types of communication, network congestion, network topologies, network configuration and management, network model components, layered network models (OSI reference model, TCP/IP networking architecture) and their protocols, various types of networks (LAN, MAN, WAN and Wireless networks) and their protocols. B. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C 2 1151IT102 Data Structures C. Related Courses: Sl. No Course Code Course Name 1 1152IT110 Internet of Things 2 1151IT114 Cryptography and network security 3 1151IT118 Cloud computing 4 1152IT120 Distributed computing D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO (Based on revised Course Outcomes Nos. Bloom’s Taxonomy) Describe various techniques for Encoding, decoding and Digital data K1 CO1 communication. Explain the various keying techniques, digital data communication K2 CO2 techniques and its standards. CO3 Experiment with various error detection and flow control techniques. K3 Explain the various concepts of network topologies, components and K2 CO4 categories of networks. CO5 Experiment with various network layer protocols. K3 CO6 Illustrate the OSI layers, functions and its protocols. K2 CO7 Experiment with various application layer protocols K3

E. Correlation of COs with POs :

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H H L L L CO2 H H L L L CO3 H H H L M CO4 M M M L L M CO5 M M H L L M CO6 H H H L H CO7 H H H H H H- High; M-Medium; L-Low F. Course Content :

UNIT I Introducion L – 9

Data Communication: Data Communication system components - Network Models - OSI Model - TCP/IP Protocol Suite - Addressing - Data and Signals - Analog And Digital - Transmission Impairment - Data rate and Channel capacity – Performance.

UNIT II Physical Layer L – 9

Digital Transmission - Digital-To-Digital Conversion - Analog Transmission - Digital- To-Analog Conversion - Transmission Media - Guided Media - Unguided Media: Wireless - Wired LANs: Ethernet - Token ring - Connecting Devices – Switching techniques.

UNIT III Data Link Layer L – 9

Link Layer: Types of errors –Error detection- VRC, LRC, CRC techniques - Data Forward and backward error correction - Hamming code. Flow control: stop and wait- sliding window protocol, Error control: Stop and wait ARQ- Go-Back-N ARQ- Selective Repeat ARQ Protocols- Asynchronous and Synchronous Protocol - HDLC frames.

UNIT IV Network layer L – 9

Logical Addressing - IPv4 Addresses - IPv6 Addresses - Address Mapping – ARP – RARP, BOOTP, and DHCP – ICMP - Unicast Routing Protocols - Intra- and Interdomain Routing - Distance Vector Routing - Link State Routing.

UNIT V Transport Layer and Application Layer L – 9

Process-to-Process Delivery: UDP – TCP - Congestion Control - Quality of Service - Techniques to Improve QoS – Application layer protocols : REMOTE LOGGING - TELNET - ELECTRONIC MAIL – DNS – SMTP – FTP - HTTP .

TOTAL : 45 Periods G. Learning Resources i.Text Books :

1. Behrouz Forouzan, ―Introduction to Data Communications and Networking‖, Tata McGraw Hill, 5th Edition, 2015. 2. Stallings, ―Data and Computer Communications‖, PHI, 10th Edition, 2015.

ii.Reference: 1.William Schewber ,―Data Communication‖, McGraw Hill, 1987. 2. Tanenbaum , ―Computer Networks‖, PHI, 5rd Edition, 2011

iii. Online Resources

1. http://www.cse.iitk.ac.in/users/dheeraj/cs425/ 2. http://www.tcpipguide.com/free/t_OSIReferenceModelLayers.htm 3. http://iit.qau.edu.pk/books/Data%20Communications%20and%20Networking%20By%20Behrou z%20A.Forouzan.pdf 4. http://www.networkdictionary.com/protocols/osimodel.php

COURSE CODE COURSE TITLE L T P C 1151IT109 Information Coding Techniques 3 0 0 3

Course Category: Program Core a. Preamble Coding theory is the study of the properties of codes and their fitness for a specific application. Codes are used for compression, cryptography, error-correction and more recently also for network coding. Codes are studied by various scientific disciplines—such as information, electrical engineering, mathematics, and computer science—for the purpose of designing efficient and reliable data transmission methods. b. Prerequisite Courses:

Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C 2 1150MA202 Mathematics II

c. Related Courses: Sl. No Course Code Course Name 1 1151IT108 Computer Networks 2 1152IT106 Multimedia Communication Networks

d. Course Outcomes :

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Explain Information Entropy Fundamentals. K2 CO2 Describe voice and data encoding. K2 CO3 Illustrate the methods to control errors in coding. K3 CO4 Explain the methods to compress data using various formats. K2 CO5 Explain the techniques for audio and video coding. K3 e. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M

CO3 M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low f. Course Content :

Unit I INFORMATION ENTROPY FUNDAMENTALS

Uncertainty - Information and entropy – Source coding theorem – Huffman coding – Shannon Fano coding – Discrete memory less channels – Channel capacity – Channel coding theorem – Channel capacity theorem.

Unit II DATA AND VOICE CODING

Differential pulse code modulation – Adaptive differential pulse code modulation – Adaptive sub-band coding – Delta modulation – Adaptive delta modulation – Coding of speech signal at low bit rates (Vocoders – LPC).

Unit III ERROR CONTROL CODING

Linear block codes – Syndrome decoding – Minimum distance consideration – Cyclic codes – Generator polynomial – Parity check polynomial – Encoder for cyclic codes – Calculation of syndrome – Convolutional codes.

Unit IV COMPRESSION TECHNIQUES

Principles – Text compression – Static Huffman coding – Dynamic Huffman coding – Arithmetic coding – Image compression – Graphics interchange format – Tagged image file format – Digitized documents – Introduction to JPEG standards.

Unit V AUDIO AND VIDEO CODING

Linear predictive coding – Code excited LPC – Perceptual coding – MPEG audio coders – Dolby audio coders – Video compression – Principles – Introduction to H.261 & MPEG video standards. Total: 45

h. Learning Resources i. Text Books

1. Simon Haykin, ―Communication Systems‖, 4th Edition, John Wiley and Sons, 2001. 2. Fred Halsall, ―Multimedia Communications - Applications Networks Protocols and Standards‖, Pearson Education, 2002

ii. Reference Books

1. Mark Nelson, ―Data Compression Book‖, BPB, 1992. 2. Watkinson J, ―Compression in Video and Audio‖, Focal Press, London, 1995.

COURSE CODE COURSE TITLE L T P C 1151IT110 Mobile Application Development 3 0 0 3

Course Category: Program Core

Preamble : In this modern era almost every hands has a handheld devices. Each handheld device have the computing capability to meet the half the needs of user such as banking, browsing, education and emergency etc. It is a must for a computer engineer to have some basic knowledge about the handheld devices platform and its supporting software development. This course will give adequate knowledge in developing a mobile applications for different such as Android, iOS, Windows.

A. Prerequisite Courses:

Sl. No Course Code Course Name 1 1151IT104 Object Oriented Programming 2 1151IT303 Object Oriented Programming Lab

B. Related Courses: Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

C. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning domain CO Course Outcomes (Based on revised Nos. Bloom’s taxonomy) CO1 Explain Basics Mobile Platform K2 CO2 Develop Android application K3 CO3 Familiarize in the Graphics used for Android application K2 development CO4 Test the developed app and publish in market K3 CO5 Explain the basic behind app development for iOS and K2 Windows

D. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M H CO3 M H CO4 M H CO5 M H H- High; M-Medium; L-Low

E. F. Course Content: UNIT 1: GETTING STARTED WITH MOBILITY L – 9 Mobility landscape- Mobile platform- Mobile apps development, Overview of Android platform- setting up the mobile app development environment along with an emulator- case study on Mobile app development

UNIT II: BUILDING BLOCKS OF MOBILE APPS L – 9 App user interface designing – mobile UI resources (Layout, UI elements, Draw-able, Menu), Activity- states and life cycle, interaction amongst activities-App functionality beyond user interface - Threads, Async task, Services – states and lifecycle, Notifications, Broadcast receivers, Telephony and SMS

UNIT III: SPRUCING UP MOBILE APPS L – 9 Graphics and animation – custom views, canvas, animation APIs, multimedia – audio/video playback and record location awareness- native hardware access (sensors such as accelerometer and gyroscope)

UNIT IV: TESTING MOBILE APPS L – 9

Debugging mobile apps- White box testing-Black box testing- test automation of mobile apps- JUnit for Android- Robotium- MonkeyTalk

UNIT V: TAKING APPS TO MARKET L – 9

Versioning, signing and packaging mobile apps, distributing apps on mobile market place

TOTAL : 45 Periods G. Learning Resources i. Text Books 1. ―Anubhav Pradhan, Anil V Deshpande‖ Composing Mobile Apps Learn|Explore|Apply using Andriod, Wiley Publications 1st Edition 2014. 2. Jeff. McWherter and Scott Gowell ―Professonal Moblie Application Development‖ John Wiley & Sons Ltd. 3. Mark Gargenta, ―Learning ANDROID‖, Oreilly Publication, First Edition, March 2011. 4. James Dovey and Ash Furrow, ―Beginning Objective C‖, Apress, 2012 ii. Reference Books 1. David Mark, Jack Nutting, Jeff LaMarche and Frederic Olsson, ―Beginning iOS 6 Development: Exploring the iOS SDK‖, Apress, 2013. 2. Charlie Collins, Michael Galpin and Matthias Kappler, ―Android in Practice‖, DreamTech, 2012 iii. Online Resources 1. http://developer.android.com/develop/index.html 2. http://www.cmer.ca/cmer-ak/course_01.html 3. vjit.ac.in/new/wp-content/.../Mobile-Application-Development.doc 4. http://www.eli.sdsu.edu/courses/fall09/cs696/notes/index.html 5. http://www.slideshare.net/iivanoo/lecture01-11910341

COURSE CODE COURSE TITLE L T P C

1151IT111 DESIGN AND ANALYSIS OF ALGORITHM 3 0 0 3

Course Category: Program Core

A. Preamble : For an engineer, problem solving is not about just solving a problem somehow but about solving the problem in the most effective and efficient way. Two key skills that a software professional needs are (1) to choose suitable data structures to store the information part of the problem, and (2) use of efficient algorithms for developing a programming solution of a given problem. Selection of a particular data structure greatly influences the characteristics of the obtained solution that include efficiency (performance, or speed), space (memory) requirements, scalability, reuse, and robustness (or reliability). The other equally important skill is to choose a suitable problem solving technique to apply to a particular problem. Acquiring these skills, greatly enhances the problem solving skills of the learner. B. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C 2 1151IT102 Data Structures C. Related Courses: Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project D. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO Course Outcomes domain (Based on Nos. revised Bloom’s) Explain various asymptotic notations and Compute the efficiency CO1 K3 of given algorithms CO2 Apply the brute force technique to solve the given problem K3 CO3 Use DAC technique to solve a given problem. K3 CO4 Compute optimum solutions for the given problem. K3 CO5 Apply B&B and B&T technique to solve combinatorial problem K3 Discuss the improvement of computational efficiency using CO6 K3 iterative approaches

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L CO4 M M M L L CO5 M M L L L CO6 M M L L F. Course Content: 27

UNIT I INTRODUCTION L – 9 Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations– Mathematical analysis for Recursive and Non-recursive algorithms.

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER L – 9 Brute Force: Closest-Pair Problems- Exhaustive Search - Traveling Salesman Problem - Knapsack Problem - Assignment problem. Divide and conquer methodology: Merge sort – Quick sort – Binary search.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE L – 9 Dynamic Programming: Computing Binomial Coefficient Warshall‘s and Floyd‘ algorithm – Knapsack Problem. Greedy Technique: Prim‘s algorithm- Kruskal's Algorithm- Dijkstra's Algorithm.

UNIT IV BACKTRACKING AND BRANCH & BOUND L – 9 Backtracking: n-Queens problem-Hamiltonian Circuit Problem - Branch and Bound: Assignment problem-Knapsack Problem- Traveling Salesman Problem

UNIT V ITERATIVE IMPROVEMENT AND LIMITATIONS OF ALGORITHM POWER L – 9 The Maximum matching in bipartite graph. Limitations of Algorithm Power--Decision Trees- P, NP and NP-Complete Problems. TOTAL: 45Periods G. Learning Resources i.Text Books: 1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, Third Edition, Pearson Education, 2012.

ii. REFERENCES: 1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, ―Introduction to Algorithms‖, Third Edition, PHI Learning Private Limited, 2012. 2. Donald E. Knuth, ―The Art of Computer Programming‖, Volumes 1& 3 Pearson Education, 2009. 3. ―Fundamentals of Computer Algorithms‖ by Ellis Horowitz, Sartaj Sahmi, Sanguthevar Rajasekaran, University Press, Second Edition 2008.

iii. Online Resources: 1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html 2. http://nptel.ac.in/courses/106101060/ 3. https://www.coursera.org/course/algo

COURSE CODE COURSE TITLE L T P C 1151IT112 COMPILER DESIGN 3 0 0 3

Course Category: Program Core

A. Preamble : This Course describes the theory and practice of compilation, in particular, the lexical analysis, parsing and code generation and optimization phases of compilation, and design a compiler for a concise programming language.

B. Prerequisite Courses:

Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C 2 1150MA202 Mathematics II

C. Related Courses: Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised No’s Bloom’s Taxonomy) Use the knowledge of patterns, tokens & regular expressions K2 CO1 for solving a problem Apply the knowledge of Lex tool & YAAC tool to develop K3 CO2 scanner & parser CO3 Explain a intermediate code generator K3 Design & conduct experiments for intermediate generation in K3 CO4 compiler Learn the new code optimization technique to improve the K3 CO5 performance of a program in terms of speed and space

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H CO2 H M CO3 M CO4 M CO5 H M H- High; M-Medium; L-Low

F. Course Content: UNIT I Introduction to Compilers L – 9 Compilers, Analysis of the Source Program, The Phases of a Compiler, Cousins of the Compiler, The Grouping of Phases, Compiler-Construction Tools. LEXICAL ANALYSIS: Need and role of lexical analyzer-Lexical errors, Input Buffering - Specification of Tokens, Recognition of Tokens, Design of a Lexical Analyzer Generator

UNIT II Syntax Analysis L – 9 Need and role of the parser- Context Free Grammars-Top Down parsing - Recursive Descent Parser - Predictive Parser - LL(1) Parser -Shift Reduce Parser - LR Parser - LR (0) item - Construction of SLR Parsing table -Introduction to LALR Parser, YACC- Design of a syntax analyzer for a sample language

UNIT III Intermediate Code Generation L – 9 Intermediate languages – Declarations – Assignment Statements – Boolean Expressions – Case Statements – Back patching – Procedure calls.

UNIT IV Code Generation L – 9 Issues in the design of code generator – The target machine – Runtime Storage management – Basic Blocks and Flow Graphs – Next-use Information – A simple Code generator – DAG representation of Basic Blocks

UNIT V Code Optimization and Run Time Environments L – 9 Introduction– Principal Sources of Optimization – Peephole Optimization- Optimization of basic Blocks – Introduction to Global Data Flow Analysis – Runtime Environments – Source Language issues – Storage Organization – Storage Allocation strategies – Access to non-local names – Parameter Passing. TOTAL : 45 Periods G. Learning Resources i. Text Books: 1.Alfred Aho, Ravi Sethi, Jeffrey D Ullman, ―Compilers Principles, Techniques and Tools‖, Pearson Education Asia, 2003.

ii. Reference Books: 1. Allen I. Holub ―Compiler Design in C‖, Prentice Hall of India, 2003. 2. C. N. Fischer and R. J. LeBlanc, ―Crafting a compiler with C‖, Benjamin Cummings, 2003. 3. J.P. Bennet, ―Introduction to Compiler Techniques‖, Second Edition, Tata McGraw-Hill, 2003. 4. Henk Alblas and Albert Nymeyer, ―Practice and Principles of Compiler Building with C‖, PHI, 2001. 5. Kenneth C. Louden, ―Compiler Construction: Principles and Practice‖, Thompson Learning, 2003

iii. Online Recourses: 1. http://www.tutorialspoint.com/compiler_design/ 2. http://nptel.ac.in/courses/106104123/Compiler%20DesignQuestions.pdf 3. http://www.vssut.ac.in/lecture_notes/lecture1422914957.pdf

COURSE CODE COURSE TITLE L T P C 1151IT113 MOBILE COMMUNICATION 3 0 0 3

Course Category: Program Core

a. Preamble : Communication technologies in this era become one of the dominant fields. Especially handheld devices growth such as PDA, Mobile Phones, Tablet, makes use of GSM or 3G for both voice and data. It is must for the computer science engineer to learn the Basics of Wireless and data Communication Technologies. About the various Satellites Networks and Wireless LAN Standards. To known about the various Mobile computing algorithms and Wireless application protocol to Develop mobile content applications. b. Prerequisite Courses:

Sl No Course Code Course Name 1 1151IT108 Computer Networks

c. Related Courses:

Sl No Course Code Course Name 1 1152IT104 Mobile Adhoc and Sensor Networks d. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Explain the basics of wireless communication systems. K2

CO2 Demonstrate the concepts of Telecommunication networks K2 CO3 Design wireless LAN. K2 CO4 Develop and demonstrate various routing protocols. K2 CO5 Work with Wireless application Protocols to develop K2 mobile content application and to appreciate the social and ethical issues of mobile computing, including privacy.

f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M H- High; M-Medium; L-Low

g. Course Content :

UNIT I Wireless Communication Fundamentals 9 Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks. UNIT II Telecommunication Networks 9 Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems – DAB - DVB. UNIT III WIRELESS LAN 9 Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a - 802.11b standards – HIPERLAN – Blue Tooth. UNIT IV Mobile Network Layer 9 Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative Metrics. UNIT V Transport And Application Layers 9 Traditional TCP – Classical TCP improvements – WAP, WAP 2.0. Total : 45 Hours h. Learning Resources: i. Text Books a. Jochen Schiller, ―Mobile Communications‖, PHI/Pearson Education, Second Edition, 2003. (UNIT I Chap 1,2 &3- UNIT II chap 4,5 &6-UNIT III Chap 7.UNIT IV Chap 8- UNIT V Chap 9&10.) b. William Stallings, ―Wireless Communications and Networks‖, PHI/Pearson Education, 2002. (UNIT I Chapter – 7&10-UNIT II Chap 9) ii. Reference Books: f. Kaveh Pahlavan, Prasanth Krishnamoorthy, ―Principles of Wireless Networks‖, PHI/Pearson Education, 2003. g. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile Computing‖, Springer, New York, 2003. h. Hazysztof Wesolowshi, ―Mobile Communication Systems‖, John Wiley and Sons Ltd, 2002.

g. Online resources http://www.tutorialspoint.com/Mobile Networks

COURSE CODE COURSE TITLE L T P C CRYPTOGRAPHY AND NETWORK 1151IT114 SECURITY 3 0 0 3

Course Category: Program Core

a. Preamble: This course describes the explosive growth in computer systems and their interconnections via networks, has increased the dependence of both organizations and individuals on the information stored and communicated using these systems. This, in turn, has led to a heightened awareness of the need to protect data and resources from disclosure, to guarantee the authenticity of data and messages, and to protect systems from network-based attacks and the disciplines of cryptography and network security have matured, leading to the development of practical, readily available applications to enforce network security. Pre-requisites:

b. Sl. No Course Code Course Name 1 1151IT108 Computer Networks

c.Related Courses

Sl.No Course Code Course Name 1 1152IT105 Modern Cryptography 2 1152IT108 Ethical Hacking

D. Course Outcomes: CO Course Outcomes Level of learning domain Nos (Based on revised Bloom’s taxonomy) CO1 Compare various Cryptographic Techniques K3 CO2 Demonstrate various data encryption techniques. K3

CO3 Implement Hashing and Digital Signature techniques K3 CO4 Explain the various Security Application K2

CO5 Design and implement Secure applications K3

f. Correlation of COs with Program Outcomes Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L

CO4 M M M L H CO5 M L M L

H- High; M-Medium; L-Low

g. Course Content: UNIT I FOUNDATIONS OF CRYPTOGRAPHY AND SECURITY 10 OSI Security Architecture - Security Attacks and Services. Mathematical Tools for Cryptography: Substitutions and Permutations, Modular Arithmetic, Euclid‘s Algorithm, Finite Fields, Polynomial Arithmetic.. Design Principle of Block ciphers: DES and Triple DES, Modes of Operation ( ECB, CBC, OFB, CFB) UNIT II BLOCK CIPHER ALGORITHMS AND PUBLIC KEY CRYPTOGRAPHY 9 AES- RC5- Introduction to Number Theory : Prime numbers- Chinese remainder theorem-Fermat and Euler‘s theorem –RSA- Public Key Management - Diffie-Hellman key Exchange - Elliptic Curve Cryptography. UNIT III AUTHENTICATION AND HASH FUNCTION 9 Authentication requirements - Authentication functions - Message Authentication Codes - Hash Functions - Security of Hash Functions and MACs - MD5 message Digest algorithm - Secure Hash Algorithm -SHA 512 – HMAC- Digital Signatures - Authentication Protocols - Digital Signature Standard UNIT IV NETWORK SECURITY 9 Authentication Applications: Kerberos - X.509 Authentication Service - Electronic Mail Security - PGP - S/MIME - IP Security - Web Security. UNIT V SYSTEM LEVEL SECURITY 8 Intrusion detection - password management - Viruses and related Threats - Virus Counter measures - Firewall Design Principles - Trusted Systems. TOTAL: 45 Periods h. Learning Resources i. Text Books: 1. Wade Trappe, Lawrence C Washington, ― Introduction to Cryptography with coding theory‖, 2nd ed, Pearson, 2007. 2. William Stallings, ―Cryptography and Network security Principles and Practices‖, Pearson/PHI, 4th ed, 2006. ii. Reference Books: 1. W. Mao, ―Modern Cryptography – Theory and Practice‖, Pearson Education, Second Edition, 2007. 2. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing Third Edition - Prentice Hall of India, 2006. iii. Online Resources: 1. williamstallings.com/Extras/Security-Notes/ 2. www.cs.bilkent.edu.tr/~selcuk/teaching/cs519/

COURSE CODE COURSE TITLE L T P C 1151IT115 Wireless Communication 3 0 0 3

Course Category: Program Core

a. Preamble: Describes the concepts of wireless / mobile communication using cellular environment. Details of various modulation techniques, propagation methods, coding and multi access techniques used in mobile communication.

b. Pre-requisites:

Sl. No Course Code Course Name 1 1151IT108 Computer Networks

c.Related Courses

Sl.No Course Code Course Name 1 1152IT104 Mobile ad hoc and Sensor Networks 2 1151IT113 Mobile Communication

E. Course Outcomes: CO Course Outcomes Level of learning domain Nos (Based on revised Bloom’s taxonomy) Explain the techniques and services of wireless CO1 communication K3 CO2 Demonstrate the propagation mechanism K3

CO3 Illustrate the shift keying strategies K3 CO4 K2 Describe the signal processing system. CO5 K3 Summarize transceiver schemes f. Correlation of COs with Program Outcomes Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L CO4 M M M L H CO5 M L M L H- High; M-Medium; L-Low g. Course Content

UNIT I SERVICES AND TECHNICAL CHALLENGES 9

Types of Services, Requirements for the services, Multipath propagation, Spectrum Limitations, Noise and Interference limited systems, Principles of Cellular networks, Multiple Access Schemes.

UNIT II WIRELESS PROPAGATION CHANNELS 9

Propagation Mechanisms (Qualitative treatment), Propagation effects with mobile radio, Channel Classification, Link calculations, Narrowband and Wideband models.

UNIT III WIRELESS TRANSCEIVERS 9

Structure of a wireless communication link, Modulation and demodulation – Quadrature Phase Shift Keying, /4-Differential Quadrature Phase Shift Keying, Offset-Quadrature Phase Shift Keying, Binary Frequency Shift Keying, Minimum Shift Keying, Gaussian Minimum Shift Keying, Power spectrum and Error performance in fading channels.

UNIT IV SIGNAL PROCESSING IN WIRELESS SYSTEMS 9

Principle of Diversity, Macrodiversity, Microdiversity, Signal Combining Techniques, Transmit diversity, Equalisers- Linear and Decision Feedback equalisers, Review of Channel coding and Speech coding techniques.

UNIT V ADVANCED TRANSCEIVER SCHEMES 9

Spread Spectrum Systems- Cellular Code Division Multiple Access Systems- Principle, Power control, Effects of multipath propagation on Code Division Multiple Access, Orthogonal Frequency Division Multiplexing – Principle, Cyclic Prefix, Transceiver implementation, Second Generation (GSM, IS–95) and Third Generation Wireless Networks and Standards

TEXT BOOKS

1. Andreas.F. Molisch, ―Wireless Communications‖, John Wiley – India, 2006. 2. Simon Haykin & Michael Moher, ―Modern Wireless Communications‖, Pearson Education, 2007. REFERENCES 1. Rappaport. T.S., ―Wireless communications‖, Pearson Education, 2003. 2. Gordon L. Stuber, ―Principles of Mobile Communication‖, Springer International Ltd., 2001. 3. Andrea Goldsmith, Wireless Communications, Cambridge University Press, 2007.

COURSE CODE COURSE TITLE L T P C 1151IT116 Embedded Programming 3 0 0 3

Course Category: Program Core

b. Preamble: Embedded systems are increasingly complex and have to fulfill a wide range of competing constraints: development cost, unit cost, reliability, security, size, performance, power consumption, flexibility, time to market, maintainability, etc. In order to meet these constraints the right balance between the hardware and software components has to be achieved. In this context, the task of designing such systems is becoming increasingly important and difficult at the same time. The spectacular growth and rapid commercialization of VLSI, DSP & Embedded techniques have forced the research and engineering academic community with a serious challenge: either gain working knowledge or risk obsolescence. For making the students industry ready, it is essential to train the young faculty. Keeping this in view, 5 day refresher course is planned. This course aims at imparting the state of art in Embedded technologies. Participants learn the essential concepts of embedded systems development through a practical hands-on approach utilizing industry design automation (EDA) tools and design kits b. Pre-requisites:

Sl. No Course Code Course Name 1 1151IT103 Computer Organization and Digital Design

c.Related Courses

Sl.No Course Code Course Name 1 1156IT701 Major Project

F. Course Outcomes: CO Course Outcomes Level of learning domain Nos (Based on revised Bloom’s taxonomy) CO1 Explain embedded system concept K3 CO2 Describe the embedded operating system K3

CO3 Illustrate the hardware fundamentals of embedded system K3 CO4 K2 Demonstrate RTOS CO5 K3 List the development tools and explain f. Correlation of COs with Program Outcomes Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L

CO4 M M M L H CO5 M L M L H- High; M-Medium; L-Low

g.SYLLABUS CONTENT

PROGRAMMING EMBEDDED SYSTEMS Embedded Program – Role of Infinite loop – Compiling, Linking and locating – downloading and debugging – Emulators and simulators processor – External peripherals – Memory testing – Flash Memory.

OPERATING SYSTEM Embedded operating system – Real time characteristics – Selection process – Flashing the LED – serial ports – Zilog 85230 serial controlled code efficiency – Code size – Reducing memory usage – Impact of C++.

HARDWARE FUNDAMENTALS Buses – DMA – interrupts – Built-ins on the microprocessor – Conventions used on schematics – Microprocessor Architectures – Software Architectures – RTOS Architectures – Selecting and Architecture.

RTOS Tasks and Task states – Semaphores – Shared data – Message queues, Mail boxes and pipes – Memory management– Interrupt routines – Encapsulating semaphore and queues – Hard Real- time scheduling – Power saving.

EMBEDDED SOFTWARE DEVELOPMENT TOOLS Host and target machines – Linkers / Locators for Embedded Software – Debugging techniques – Instruction set simulators Laboratory tools – Practical example – Source code.

REFERENCE BOOKS 1. David E.Simon, ―An Embedded Software Primer‖, Perason Education, 2003. 2. Michael Bass, ―Programming Embedded Systems in C and C++‖, Oreilly, 2003.

COURSE CODE COURSE TITLE L T P C 1151IT117 Web Technologies 3 0 0 3

Course Category: Program Core a.Preamble : Quick review of the Internet and Internet programming concepts, Web Servers and Web Application Servers, Design Methodologies with concentration on Object- Oriented concepts, Client-Side Programming, Server-Side Programming, Active Server Pages, Database Connectivity to web applications, Adding Dynamic content to web applications, Programming Common Gateway Interfaces, Programming the User Interface for the web applications. b.Prerequisite Courses:

Sl No Course Code Course Name 1 1151IT104 Object Oriented Programming

c. Related Courses:

Sl No Course Code Course Name 1 1152IT135 Service Oriented Architecture e.Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) Understand, analyze and apply the role of languages like HTML, DHTML, CSS, XML, Javascript, VBScript, ASP, CO1 K2 PHP and protocols in the workings of the web and web applications analyze and create web pages using HTML, DHTML and  CO2 K2 Cascading Styles sheets. analyze and build dynamic web pages using server side  CO3 K2 programming K2  CO4 analyze and create XML documents and XML Schema.

 CO5 Understand, analyze and build and consume web services. K2

f.Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M CO3 M CO4 M CO5 M M H- High; M-Medium; L-Low

g.Course Content :

UNIT I Web Essentials: Clients, Servers, and Communication. The Internet-Basic Internet Protocols - The World Wide Web-HTTP request message-response message-Web Clients Web Servers-Case Study. Markup Languages: XHTML. An Introduction to HTML History-Versions-Basic XHTML Syntax and Semantics-Some Fundamental HTML Elements-Relative U RLs-Lists-tables-Frames- Forms-XML Creating HTML Documents Case Study.

UNIT II Style Sheets: CSS-Introduction to Cascading Style Sheets-Features-Core Syntax-Style Sheets and HTML Style Rle Cascading and Inheritance-Text Properties-Box Model Normal Flow Box Layout-Beyond the Normal Flow-Other Properties-Case Study. Client- Side Programming: The JavaScript Language-History and Versions Introduction JavaScript in Perspective-Syntax- Variables and Data Types-Statements-Operators- Literals-Functions-Objects-Arrays-Built-in Objects-JavaScript Debuggers.

UNITIII Host Objects : Browsers and the DOM-Introduction to the Document Object Model DOM History and Levels-Intrinsic Event Handling-Modifying Element Style-The Document Tree- DOM Event Handling-Accommodating Noncompliant Browsers Properties of window-Case Study. Server-Side Programming: Java Servlets- Architecture -Overview-A Servelet-Generating Dynamic Content-Life Cycle-Parameter Data-Sessions-Cookies¬U RL Rewriting-Other Capabilities-Data Storage Servelets and Concurrency-Case Study- Related Technologies.

UNIT IV Representing Web Data: XML-Documents and Vocabularies-Versions and Declaration - Namespaces JavaScript and XML: Ajax-DOM based XML processing Event-oriented Parsing: SAX-Transforming XML Documents-Selecting XML Data :XPATH-Template-based Transformations: XSLT-Displaying XML Documments in Browsers-Case Study- Related Technologies. Separating Programming and Presentation: JSP Technology Introduction-JSP and Servlets-Running JSP Applications Basic JSP-JavaBeans Classes and JSP-Tag Libraries and Files-Support for the Model-View-Controller Paradigm-Case Study-Related Technologies.

UNIT V Web Services: JAX-RPC-Concepts-Writing a Java Web Service-Writing a Java Web Service Client-Describing Web Services: WSDL- Representing Data Types: XML Schema- Communicating Object Data: SOAP Related Technologies-Software Installation-Storing Java Objects as Files-Databases and Java Servlets. h. Learning Resources i.TEXT BOOK 1. Jeffrey C.Jackson, "Web Technologies--A Computer Science Perspective", Pearson Education, 2006. ii.REFERENCES 1. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition, Pearson Education, 2007. 2. Deitel, Deitel, Goldberg, "Internet & World Wide Web How To Program", Third Edition,

Pearson Education, 2006. 3. Marty Hall and Larry Brown,‖Core Web Programming‖ Second Edition, Volume I and II, Pearson Education, 2001. 4. Bates, ―Developing Web Applications‖, Wiley, 2006.

COURSE CODE COURSE TITLE L T P C 1151IT118 Cloud Computing 3 0 0 3

Course Category: Program Core

a.Preamble It aims to provide technology-oriented students with the knowledge and ability to develop creative solutions, and better understand the effects of future developments of mobile applications and its technology. b. Prerequisite Courses:

Sl. No Course Code Course Name 1 1151IT108 Computer Networks 2 1151IT104 Object Oriented Programming

c. Related Courses:

Sl. No Course Code Course Name 1 1152IT120 Distributed Computing 2 1152IT119 Parallel Computing

d. Course Outcomes :

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Articulate the main concepts, key technologies, strengths and CO1 K2 limitations of cloud computing CO2 Apply suitable virtualization concept K3 Discover the core issues of cloud computing such as security, CO3 K3 privacy and interoperability Identify the architecture, infrastructure and delivery models of CO4 K2 cloud computing Ability to choose the appropriate technologies, algorithms and CO5 K3 approaches for the related issues. e. Correlation of COs with POs :

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

CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low f. Course Content :

UNIT I INTRODUCTION 9 Evolution of Cloud Computing –System Models for Distributed and Cloud Computing – NIST Cloud Computing Reference Architecture -IaaS – On-demand Provisioning – Elasticity in Cloud – E.g. of IaaS Providers - PaaS – E.g. of PaaS Providers - SaaS – E.g. of SaaS Providers – Public Private and Hybrid Clouds.

UNIT II VIRTUALIZATION 9 Basics of Virtualization - Types of Virtualization - Implementation Levels of Virtualization - Virtualization Structures - Tools and Mechanisms - Virtualization of CPU, Memory, I/O Devices - Desktop Virtualization – Server Virtualization.

UNIT III CLOUD INFRASTRUCTURE 9 Architectural Design of Compute and Storage Clouds – Layered Cloud Architecture Development – Design Challenges - Inter Cloud Resource Management – Resource Provisioning and Platform Deployment – Global Exchange of Cloud Resources.

UNIT IV PROGRAMMING MODEL 9 Parallel and Distributed Programming Paradigms – Map Reduce , Twister and Iterative MapReduce – Hadoop Library from Apache – Mapping Applications - Programming Support - Google App Engine, Amazon AWS - Cloud Software Environments -Eucalyptus, Open Nebula, OpenStack

UNIT V SECURITY IN THE CLOUD 9 Security Overview – Cloud Security Challenges – Software-as-a-Service Security – Security Governance – Risk Management – Security Monitoring – Security Architecture Design – Data Security – Application Security – Virtual Machine Security.

h. Learning Resources

i. TEXTBOOK

1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, ―Distributed and Cloud Computing, From Parallel Processing to the Internet of Things‖, Morgan Kaufmann Publishers, 2012.

ii. REFERENCES 1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, ―Distributed and Cloud Computing, From Parallel Processing to the Internet of Things‖, Morgan Kaufmann Publishers, 2012. 2. John W.Rittinghouse and James F.Ransome, ―Cloud Computing: Implementation, Management, and Security‖, CRC Press, 2010. 3. Toby Velte, Anthony Velte, Robert Elsenpeter, ―Cloud Computing, A Practical Approach‖, TMH, 2009.

iii. Online Resources

1. http://en.wikipedia.org/wiki/Cloud_computing 2. http://en.wikipedia.org/wiki/Virtualization 3. https://technet.microsoft.com/en-us/magazine/hh509051.aspx 4. http://www.porticor.com/2009/08/cloud-computing-programming-models-part-1-of-4/ 5. http://en.wikipedia.org/wiki/Cloud_computing_security

COURSE CODE COURSE TITLE L T P C 1151IT301 DATA STRUCTURES LAB 0 0 2 1

A. Preamble : In this course, programs will be implemented based on lab Course that is related to content which is given in theory and executed in C.

B. Pre-requisites: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

C. Related Courses: Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

D. Course Outcomes: Students undergoing this course are able to Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Apply the different data structures for implementing 1 S3 solutions to practical problems 2 Develop recursive programs S3 3 Develop Programs for Searching and Sorting S3

E. Correlation with Programme Outcomes : H- Strong; M-Medium; L-Low COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1. H M H CO2. H M H CO3 H H M H

F. Course Content

LIST OF EXPERIMENTS: CYCLE I S. No Experiment name 1 Implementation of Queue using Array 2 Implementation of singly linked list 3 Infix to postfix conversion 4 Implementation of Binary Search Tree CYCLE II 5 Implementation of Breadth First Search 6 Implementation of Depth First Search 7 Insertion sort and Bubble sort 8 Heap sort 9 Quick sort 10 Linear search and Binary search

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS: Stand alone desktops with C/C++ compiler 30 Nos. (or) Server with C/C++ compiler supporting 30 terminals or more.

G. Learning Resources i. Text Book  M. A. Weiss, ―Data Structures and Algorithm Analysis in C‖, Second Edition, Pearson Education, 2007. ii. Reference Books  V. Aho, J. E. Hopcroft, and J. D. Ullman, ―Data Structures and Algorithms‖, Pearson Education, First Edition Reprint 2003.  R. F. Gilberg, B. A. Forouzan, ―Data Structures‖, Second Edition, Thomson India Edition, 2005.  Ellis Horowitz, Sartaj Sahni, Dinesh Mehta, ―Fundamentals of Data Structure‖, Computer Science Press, 1995. iii. Online Resources  http://www.academictutorials.com/data-structure/  http://www.c4learn.com/data-structure/introduction-to-linked-list-c-programming/  http://randu.org/tutorials/c/ads.php  https://faculty.washington.edu/jstraub/dsa/Master_2_7a.pdf  http://www.zentut.com/c-tutorial/  http://www.studytonight.com/data-structures/introduction-to-data-structures

COURSE CODE COURSE TITLE L T P C

1151IT302 OPERATING SYSTEM LAB 0 0 2 1

Course Category: Program Core A. Preamble : Operating systems are the fundamental part of every computing device to run any type of software. The increasing use of computing devices in all areas of life (leisure, work), lead to a variety of operating systems. Yet all operating systems share common principles. These principles are important for computer science students in their understanding of programming languages and software built on top of operating systems. The Operating System Laboratory, OS Lab is a course that will teach students about principles of operating systems using a constructivist approach and problem-oriented learning.

B. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

C. Related Courses: Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

D. Course Outcomes: Upon the successful completion of the course, learners will be able to Level of learning CO domain (Based Course Outcomes Nos. on revised Bloom’s) CO1 Demonstrate the fundamental UNIX commands & system calls S3 CO2 Apply the scheduling algorithms for the given problem S3 Implement the process synchronous concept using message queue, shared CO3 S3 memory, semaphore and Dekker‘s algorithm for the given situation. CO4 Experiment an algorithm to detect and avoid dead lock S3 Implement the various methods in memory allocation and page replacement CO5 S3 algorithm. CO6 Demonstrate the various operations of file system. S3 K2-Understand, K3-Apply, S3-Processes

E. Correlation of COs with Programme Outcomes: Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H CO2 H M L L L L CO3 H M L L L L CO4 H M L L L L

CO5 H M L L L L CO6 M M F. Course Content: Cycle I Basics of UNIX Commands 1. Write programs using the following system calls of UNIX operating system: fork, exec, getpid, exit, wait, close. 2. Write programs using the I/O System calls of UNIX operating system (open, read, write, etc). 3. Given the list of processes, their CPU burst times. Display/print the Gantt chart for FCFS scheduling algorithm. Compute and print the average waiting time and average turnaround time. 4. Given the list of processes, their CPU burst times and arrival times. Display the Gantt chart for SJF scheduling algorithm. Compute and print the average waiting time and average turnaround time.

Model Practical Examination I Cycle II 5. Given the list of processes, their CPU burst times and time quantum. Display the Gantt chart for Round robin scheduling algorithm. Compute and print the average waiting time and average turnaround time. 6. Given the list of processes, their CPU burst times and arrival times. Display the Gantt chart for Priority scheduling algorithm. Compute and print the average waiting time and average turnaround time. 7. Develop application using Inter-Process Communication (using shared memory, pipes or message queues). 8. Implement the Producer-Consumer problem using semaphores (using UNIX system calls) 9. Implement Memory management schemes like paging and segmentation. 10. Implement Memory allocation schemes like First fit, Best fit and Worst fit.

Model Practical Examination II

G. Learning Resources: i. Reference Books: 1. Universal Command Guide: For Operating Systems – April 15, 2002 ,by Guy Lotgering 2. The Easy Guide to Operating Systems, Larry Miller,2012.

COURSE CODE COURSE TITLE L T P C 1151IT303 OBJECT ORIENTED PROGRAMMING LAB 0 0 2 1

Course Category: Program Core

a. Preamble: In this course, programs will be implemented based on lab syllabus that is related to content which is given in theory and executed in C.

D. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

E. Related Courses: Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

e. Course Outcomes: Students undergoing this course are able To Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Apply the different data structures for implementing 1 S3 solutions to practical problems 2 Develop recursive programs S3

3 Develop Programs for Searching and Sorting S3

f. Correlation with Programme Outcomes : H- Strong; M-Medium; L-Low

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

CO1. H M H

CO2. H M H CO3 H H M H

g. Course Content

LIST OF EXPERIMENTS:

CYCLE I S. No Experiment name Design C++ classes with static members. 1

Design C++ classes with default arguments, friend functions. 2

3 Implement complex number class with necessary operator overloading Implement Matrix class with dynamic memory allocation and necessary 4 methods. Give proper constructor, destructor, and copy constructor, and overloading of assignment operator. 5 Overload the new and delete operators to provide custom dynamic allocation of memory.

CYCLE II

Develop templates of standard sorting algorithms such as bubble sort, insertion 6 sort. 7 Design stack and queue classes with necessary exception handling. 8 Design C++ Classes with Concepts of Inheritance. 9 Design C++ Program as virtual Functions and virtual Base Class. Design C++ Classes with necessary File Handling Concepts.(Sequential and 10 random merge sort, and quick sort. Access)

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS: Stand alone desktops with C/C++ compiler 30 Nos. (or) Server with C/C++ compiler supporting 30 terminals or more. h. Learning Resources i. Text Book 1. Fundamentals of Programming C++ (Richard L. Halterman). 2. Programming Abstractions in C++ (Eric S. Roberts) ii. Reference Books

 How to Design Classes (Matthias Felleisen, et al).  Programming -- Principles and Practice Using C++. iii.Online Resources • http://www.byte-notes.com/oop-concepts-c • https://www.hscripts.com/tutorials/cpp/cpp-oops-concepts.php http://en.cppreference.com/w/cpp/concept

COURSE CODE COURSE TITLE L T P C 1151IT304 Database Management System Lab 0 0 2 1

Course Category: Program Core

A. Preamble: This course starts from developing a simple query to notification and security level issues that involve views trigger events and reports. Also students are encouraged to do a Minor Project with the help of Visual basic and SQL on their own that tunes out them in finding various procedures that suits the need of the application.

F. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

G. Related Courses:

Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

B. Course Outcomes At the end of the course, the students are able to: Level of learning domain CO Course Outcomes (Based on revised Bloom’s Nos. taxonomy) Create database using DDL and retrieve data from database CO1 K3, S3 using DML for a given situation. Experiment Nested query, Integrity Constraints and Views in CO2 K3, S3 database

CO3 Demonstrate trigger, function and procedure using PL/SQL. K3, S3

CO4 Develop Projects using front end and back end. K4, S3 K3-Apply, K4-Analyse, S3-Processes

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H H H M H L CO2 H H H M H CO3 L M H M H L CO4 L L L H H L L L D. Course Content

LIST OF EXPRIMENTS Cycle-1

1. DDL Commands – Table Creation, Altering the table structures, truncating a table and dropping a table. 1. DML Commands – Insert, Select Commands, update & delete Commands. 3. Creating relationship between the databases – Nested Queries & Join Queries 4. Creating a database and to set various possible constraints. 5. Views – Create a Virtual table (Views) based on the result set of an SQL statement. 6. To create PL/SQL functions and to implement the stored procedures in SQL (Function and Procedures). Model practical Examination-I Cycle-2 7. To study the basics of front end tools. 8. To implement the forms using front end tool and use oracle for database creation. 9. Triggers – To create a statement that executes automatically as a side effect of a modification to the DB. 10. Menu Design – To Design menus using menu editor in Visual Basic. 11. Reports – To generate data report from existing DB 12. Minor Project (Application Development using Oracle/Mysql) Model practical Examination-II

E. Learning Resources: i. Reference Books: 1. Database Management Systems solutions manual, Raghu Ramakrishnan, Johannes Gehrke, Jeff Derstadt, Scott Selikoff and Lin Zhu, third Edition, 2013 2. SQL with Guru99 by Krishna Rungta,Smashwords 2013 3. A Primer on SQL by Rahul Batra, dreamincode.net 2012 4. Learn SQL The Hard Way by Zed A. Shaw, LCodeTHW 2011 5. Developing Time-Oriented Database Applications in SQL, by Richard T. Snodgrass, Morgan Kaufmann 1999

COURSE CODE COURSE TITLE L T P C

1151IT306 MOBILE APPLICATION DEVELOPMENT LAB 0 0 2 1

Course Category: Program Core

a. Preamble : The ANDROID Application Development Lab needed to implement rich Android applications for the Android mobile platform. Student will build the code, compile, execute, and debug mobile applications using the Java for Android programming language and Eclipse to develop programs using advanced programming concepts.

b. Prerequisite Courses: Sl. No Course code Course Name 1 1151IT303 Object Oriented Programming Lab b. Related Courses:

Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

d. Course Outcomes: Upon the successful completion of the course, learners will be able to

CO Course Outcomes Level of learning Nos. domain(Based on revised Bloom’s) Demonstrate the android features and create 1 ,develop using android K2

Demonstrate and Understanding anatomy of an 2 K3 Android application 3 Apply the android geo location based services K3 Illustrate the android wifi features and advance 4 K3 android development Demonstrate the linux security and implement 5 K2 ADL interface

K2-Understand, K3-Apply, S3-Processes

f. Correlatin of COs with Programme Outcomes:

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

CO1 H

CO2 H M L L L L

CO3 H M L L L L

CO4 H M L L L L

CO5 H L L L L L

CO6 M M L

H- High; M-Medium; L-Low

g. Syllabus Content: Cycle I 1. Introduction to mobile technologies and devices

2 Android platform and applications overview

3 Setting Android development environments

4 Writing Android applications

5 Understanding anatomy of an Android application

6 Managing application resources

7 Essentials of Android user interface design

Model Practical Examination I Cycle II 8. User interface design elements, events, and dialogs

9. User interface design layouts

10. Working with texts and shapes

11.Working with animations

12 .Using Android location based APIs

13 .Using Android storage APIs

14 .Using Android web APIs

Model Practical Examination II

Learning Resources: h. Online Resources: • http://www.tutorialspoint.com/android/ • https://www.udacity.com/course/android-development-for-beginners--ud837

COURSE CODE COURSE TITLE L T P C 1151IT307 COMPUTER NETWORKS LAB 0 0 2 1 Course Category: Program Core

B. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

C. Related Courses:

Sl. No Course Code Course Name 1 1156IT601 Minor Project 2 1156IT701 Major Project

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Describe various techniques for Encoding, decoding and Digital K1 CO1 data communication. Explain the various keying techniques, digital data K2 CO2 communication techniques and its standards. Experiment with various error detection and flow control K3 CO3 techniques. Explain the various concepts of network topologies, components K2 CO4 and categories of networks. CO5 Experiment with various network layer protocols. K3 CO6 Illustrate the OSI layers, functions and its protocols. K2 CO7 Experiment with various application layer protocols K3

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H H L L L CO2 H H L L L CO3 H H H L M CO4 M M M L L M CO5 M M H L L M CO6 H H H L H CO7 H H H H H H- High; M-Medium; L-Low

F. Course Content : LIST OF EXPERIMENTS: 1. a) Study of different types of network cables and practically implement cross wired cable and straight through cable using clamping tool. b) Study of network devices and network IP in detail. 2. Study of network IP and practically connect the computers in LAN 3. a) Study of basic network command and network configuration commands. b) Configure a network topology using packet tracer software. 4. Configure a network using Distance vector/Link state routing protocol. 5. Simulation of sliding window protocol. 6. Simulation of ARP and RARP. 7. Implementation of File Transfer Protocol 8. Half Duplex Chat Using UDP 9. Full Duplex Chat Using TCP/IP 10. Simulate the packet transmission over Ethernet LAN and its CSMA/CD protocol using NS2. G. Learning Resources i.Text Books :

1. Behrouz Forouzan, ―Introduction to Data Communications and Networking‖, Tata McGraw Hill, 5th Edition, 2015. 2. Stallings, ―Data and Computer Communications‖, PHI, 10th Edition, 2015.

ii.Reference: 1.William Schewber ,―Data Communication‖, McGraw Hill, 1987.

2. Tanenbaum , ―Computer Networks‖, PHI, 5rd Edition, 2011

iii. Online Resources

1. http://www.cse.iitk.ac.in/users/dheeraj/cs425/ 2. http://www.tcpipguide.com/free/t_OSIReferenceModelLayers.htm 3. http://iit.qau.edu.pk/books/Data%20Communications%20and%20Networking%20 By%20Behrouz%20A.Forouzan.pdf 4. http://www.networkdictionary.com/protocols/osimodel.php

B.TECH – INFORMATION TECHNOLOGY CBCS CURRICULUM VTU R2015 PROGRAM SPECIFIC ELECTIVE

Course Sl.No Program Specific Elective L T P C Code

Network and Security

1 1152IT101 Fundamentals of IT 3 0 0 3

2 1152IT102 Network Protocols 3 0 0 3

3 1152IT103 High Speed Networks 3 0 0 3

4 1152IT104 Mobile ad hoc and Sensor Networks 3 0 0 3

5 1152IT105 Modern Cryptography 3 0 0 3

6 1152IT106 Multimedia Communication Networks 3 0 0 3

7 1152IT107 Optical Communication 3 0 0 3

8 1152IT108 Ethical Hacking 3 0 0 3

9 1152IT109 Forensics and Cyber Applications 3 0 0 3

10 1152IT110 Internet of Things 3 0 0 3

Data Analytics

11 1152IT111 Big Data Analytics 3 0 0 3

12 1152IT112 Virtualization Technologies 3 0 0 3

13 1152IT113 Social Network Analysis 3 0 0 3

14 1152IT114 Unix and Shell Programming 3 0 0 3

15 1152IT115 Digital Image Processing 3 0 0 3

16 1152IT116 Information Storage Management 3 0 0 3

17 1152IT117 Data Warehousing and Mining 3 0 0 3

Computing

18 1152IT118 Soft Computing 3 0 0 3

19 1152IT119 Parallel Computing 3 0 0 3

20 1152IT120 Distributed Computing 3 0 0 3

21 1152IT121 JAVA Design Pattern 3 0 0 3

22 1152IT122 Open Source Computing 3 0 0 3

Design and Intelligence

23 1152IT123 User Interface Design 3 0 0 3

24 1152IT124 Artificial Intelligence 3 0 0 3

25 1152IT125 Human-Computer Interaction 3 0 0 3

26 1152IT126 Component Based Technology 3 0 0 3

27 1152IT127 Knowledge Based Decision Support Systems 1 2 2 3

28 1152IT128 Computer Vision 3 0 0 3

29 1152IT129 Computer Graphics 3 0 0 3

30 1152IT130 Machine Learning 3 0 0 3

31 1152IT301 Graphics Lab 0 0 2 1

Software Engineering

32 1152IT131 Software Quality Assurance 3 0 0 3

33 1152IT132 Software Testing 3 0 0 3

Industrial Elective

34 1152IT133 IT Infrastructure Management 3 0 0 3

35 1152IT134 Semantic Web 3 0 0 3

36 1152IT135 Service Oriented Architecture 3 0 0 3

37 1152IT136 Bio Informatics 3 0 0 3

38 1152IT137 Game Theory 3 0 0 3

39 1152IT138 Agile Technologies 3 0 0 3

40 1152IT139 Python Programming 3 0 0 3

41 1152IT302 Service Oriented Architecture Lab 0 0 2 1

Cloud Computing Elective

42 1152IT140 Cloud Storage Infrastructures 3 0 0 3

43 1152IT141 Cloud Security 3 0 0 3

44 1152IT142 Cloud Application and Architecture 3 0 0 3

45 1152IT143 Cloud Middleware 3 0 0 3

46 1152IT144 Managing Virtual Environments 3 0 0 3

47 1152IT145 Data Center Networking 3 0 0 3

48 1152IT146 Data Center Virtualization 3 0 0 3

49 1152IT147 Cloud Strategy Planning & Management 3 0 0 3

50 1152IT148 Enterprise Storage Systems 3 0 0 3

51 1152IT149 Data Science & Big Data Analytics 3 0 0 3

52 1152IT150 Design & Development of Cloud Applications 3 0 0 3

53 1152IT151 Cloud Database 3 0 0 3

53 1152IT152 Deep Learning 3 0 0 3

COURSE CODE COURSE TITLE L T P C

1152IT101 Fundamentals of IT 3 0 0 3

Course Category:

a. Preamble

Any discipline of engineering, when learned through formal education programs, necessitates having a specially designed course which covers the fundamentals of various focus areas of that discipline. With this in mind, the course on IT fundamentals is designed to provide the students with fundamental know how‘s of different topics in Information Technology in addition to stressing the need for interpersonal skills development. b. Prerequisite Courses:

Nil

c. Related Courses:

 Software Engineering  Computer Networks d. Course Educational Objectives : Students undergoing this course are expected to

 Understand the computing flavors in the field of Information Technology.  Understand the disciplines related to Information Technology.  Describe the elements of an IT application and Business Process Integration.  Develop and follow the professional skills that are expected out of an IT professional.  Understand the application domain of IT.

e. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Explain terms and concepts of information Technology (H/W, K2

S/W, N/W, security, internet/web, and Applications)

Describe the relation between IT and other computing CO2 disciplines K2

Explore the elements of an IT application and business process CO3 integration. K2

Use internet / web services as a resource for learning and CO4 discovery K2

Create useful end products in IT areas of internet to explore CO5 major, career, skills, interest and talents. K3

f. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M H CO2 M H CO3 M H CO4 M H H CO5 M H  H- High; M-Medium; L-Low g. Course Content :

UNIT I-COMPUTING FLAVOURS IN INFORMATION TECHNOLOGY (8 hours)

Introduction to IT Systems – Information Processing Logic and Management – ICT - Networking - Programming –HCI design principles - Web and Multimedia foundations – Information Assurance and Security.

UNIT II-COMPUTING DISCIPLINES IN IT (5 hours)

Problem Space of Computing - Computing Disciplines – Definition of IT - Relationship between IT and other computing disciplines - Relationship between IT and non computing disciplines

UNIT III- IT APPLICATION AND BUSINESS PROCESS INTEGRATION (7 hours) Emergence of complexity in IT – Tools and Techniques to handle complexity – Elements of an IT application – Business Processes - Project Management – Cost Benefit Analysis - Integration of Processes.

UNIT IV- IT PROFESSIONAL CHARACTERISTICS (5 hours)

Professionalism–Responsibility - Interpersonal Skills - Life-long Learning- Computing Ethics - Crime, Law, Privacy and Security.

UNIT V- IT SECTORS AND SERVICES (5 hours)

Medical Applications- Business Applications- Law Enforcement and Political Processes- E- commerce- Manufacturing- Education- Entertainment – Agriculture– BioInformatics

Total: 45 h. Learning Resources

i. TEXT BOOKS

1. Brian.K.Williams, Stacey.C.Sawyer,Using Information Technology – A Practical Introduction to Computers and Communication, Tata McGraw Hill Publishing Company Ltd., New Delhi, 6th Education, 2005. 2. Shelley.G, Vermaat.M, Cashman.T, Discovering Computers 2005: A Gateway to Information, Thompson Course Technologies, 2005

ii. REFERENCE BOOKS

1. Jedlicka.L, Computers in Our World, Thompson Course Technologies, 2003 .

COURSE CODE COURSE TITLE L T P C 1152IT102 NETWORK PROTOCOLS 3 0 0 3 Course Category:

a.Preamble This course covers a few basic concepts of security protocols and network management .protocols. b.Prerequisite Courses:  Computer Networks

c.Related Courses:

 High Speed Networks  d.Course Educational Objectives : Students undergoing this course are expected to

 To understand the existing network architecture models and analyze the their performance  To understand the high speed network protocols and design issues.  To learn Network Security Technologies and Protocols  To study various protocols in wireless LAN, MAN. i. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Explain terms and concepts of Network technologies (Frame CO1 relay protocol architecture,ISDN,BISDN) K2

Ability to study, analyze and design seven layers of protocols CO2 of wired and wireless networks K2

Explore the elements of various cryptographic models. CO3 K2 Design various Network management protocols CO4 K2 Evaluate the QoS related performance measurements of CO5 Network management protocols K3

UNIT I FRAME RELAY AND ISDN 9 Frame relay protocol architecture − Call control − Data transfer − Overview of ISDN − Channels −User access − Protocols.

UNIT II ATM AND BISDN 9 ATM protocol architecture − Transmission of ATM cells − ATM adaptation layer −Congestion control − Broadband ISDN.

UNIT III SECURITY PROTOCOLS 9 Private key encryption − Data encryption system, public key encryption − RSA − Elliptic curve − Cryptography − Authentication − Web security − Current protocols.

UNIT IV NETWORK MANAGEMENT FUNDAMENTALS 9 Network management requirements − Network monitoring − Network control − SNMP − Concepts, MIBs − Implementation issues.

UNIT V NETWORK MANAGEMENT PROTOCOLS 9 SNMP V2 system architecture − Protocols − SNMP V3 − RMON − CMIP.

Total: 45 Periods TEXT BOOKS

1. William Stallings, ―Data and Computer Communications‖, 5th Edition, PHI, 1997.

2. William Stallings, ―SNMP, SNMPV2, SNMPV3 and RMON1 and 2‖, 3rd Edition, Addison Wesley, 1999.

REFERENCES

1. Mani Subramanian, ―Network Management−Principles and Practices‖, Addison Wesley, 2000.

2. William Stallings, ―Cryptography and Network Security‖, PHI, 2000.

COURSE CODE COURSE TITLE L T P C 1152IT103 HIGH SPEED NETWORKS 3 0 0 3

Course Category:

Foundation (0) / Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7). a. Preamble It aims to provide technology-oriented students with the knowledge and ability to develop creative solutions, and better understand the effects of future developments of mobile applications and its technology. b. Course Educational Objectives :  Understand the basics of high speed network.  Learn various fundamental and emerging models of congestion and traffic management.  Analyze the issues pertaining to major obstacles in establishment and efficient management of high speed network.  Understand the nature and applications of Integrated Services Architecture.  Understand various protocols for QOS support . c. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Establish a high speed network environment for different type CO1 K2 of applications. Demonstrate High speed networks, wireless network operation CO2 K3 CO3 Analyze the security and Network management aspects. K3 Design TCP and ATM Congestion Control for High speed CO4 K2 networks with respect to some protocol design issues Evaluate the QoS related performance measurements of High CO5 K3 speed networks.

UNIT I HIGH SPEED NETWORKS 9

Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical Connection – ATM Cell – ATM Service Categories – AAL. High Speed LAN‘s: Fast Ethernet – Gigabit Ethernet– Fibre Channel – Wireless LAN‘s, WiFi and WiMax Networks applications, requirements – Architecture of 802.11

UNIT II CONGESTION AND TRAFFIC MANAGEMENT 8

Queuing Analysis – Queuing Models – Single Server Queues – Effects of Congestion - Congestion Control – Traffic Management – Congestion Control in Packet Switching-Networks– Frame Relay Congestion Control.

UNIT III TCP AND ATM CONGESTION CONTROL 12

TCP Flow control – TCP Congestion Control – Retransmission – Timer Management – Exponential RTO backoff – KARN‘s Algorithm – Window management – Performance of TCP over ATM. Traffic and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame work, Traffic Control – ABR traffic Management – ABR rate control, RM cell formats – ABR Capacity allocations – GFR traffic management.

UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 8 Integrated Services Architecture – Approach, Components, Services- Queuing Discipline – FQ – PS – BRFQ – GPS – WFQ – Random Early Detection – Differentiated Services.

UNIT V PROTOCOLS FOR QOS SUPPORT 8 RSVP – Goals & Characteristics, Data Flow, RSVP operations – Protocol Mechanism- Multiprotocol Label Switching – Operations, Label Stacking – Protocol details – RTP– Protocol Architecture – Data Transfer Protocol– RTCP.

TOTAL: 45 PERIODS

TEXT BOOKS: 1. William Stallings, ―High speed networks and internet‖, Second Edition, Pearson Education, 2002. REFERENCES: 1. Warland, Pravin Varaiya, ―High performance communication networks‖, Second Edition , Jean Harcourt Asia Pvt. Ltd., , 2001.

COURSE CODE COURSE TITLE L T P C MOBILE AD HOC AND SENSOR 1152IT104 3 0 0 3 NETWORKS Course Category:

d. Preamble It aims to provide technology-oriented students with the knowledge and ability to develop creative solutions, and better understand the effects of future developments of mobile applications and its technology.

e. Prerequisite Courses: Mobile Communication f. Related Courses: Wireless Sensor network MANET g. Course Educational Objectives :  Understand the basics of Ad-hoc & Sensor Networks.  Learn various fundamental and emerging protocols of all layers.  Analyze the issues pertaining to major obstacles in establishment and efficient management of Ad-hoc and sensor networks.  Understand the nature and applications of Ad-hoc and sensor networks.  Understand various security practices and protocols of Ad-hoc and Sensor Networks. h. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Establish a Sensor network environment for different type of CO1 K2 applications. Explain the concepts, network architectures and applications CO2 K3 of ad hoc and wireless sensor networks Analyze the protocol design issues of ad hoc and sensor CO3 K3 networks Design routing protocols for ad hoc and wireless sensor CO4 K2 networks with respect to some protocol design issues Evaluate the QoS related performance measurements of ad hoc CO5 K3 and sensor networks i. Correlation of COs with POs :

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

CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low j. Course Content : UNIT I : ADHOC SENSOR ROUTING : Cellular and Ad hoc wireless networks – Issues of MAC layer and Routing – Proactive, Reactive and Hybrid Routing protocols – Table Driven Routing Protocols- Multicast Routing – Tree based and Mesh based protocols – Multicast with Quality of Service Provision. UNIT II QOS & Security : Real-time traffic support – Issues and challenges in providing QoS – Classification of QoS Solutions – MAC layer classifications – QoS Aware Routing Protocols – Ticket based and Predictive location based Qos Routing Protocols. Security in Ad Hoc Wireless Networks – Network Security Requirements – Issues and Challenges in Security Provisioning – Network Security Attacks UNIT III ENERGY MANAGEMENT AD HOC NETWORKS : Need for Energy Management – Classification of Energy Management Schemes – Battery Management and Transmission Power Management Schemes – Network Layer and Data Link Layer Solutions – System power Management schemes UNIT IV MESH NETWORKS : Necessity for Mesh Networks – MAC enhancements – IEEE 802.11s Architecture – Opportunistic Routing – Self Configuration and Auto Configuration - Capacity Models –Fairness – Heterogeneous Mesh Networks – Vehicular Mesh Networks UNIT V SENSOR NETWORKS : Introduction – Sensor Network architecture – Data Dissemination – Data Gathering – MAC Protocols for sensor Networks – Location discovery – Quality of Sensor Networks – Evolving Standards – Other Issues – Recent trends in Infrastructure less Networks

h. Learning Resources

i. TEXT BOOK: 1. C. Siva Ram Murthy and B.S.Manoj, ―Ad hoc Wireless Networks – Architectures and Protocols‘, Pearson Education, 2008

ii. REFERENCES 1. Feng Zhao and Leonidas Guibas, ―Wireless Sensor Networks‖, Morgan Kaufman Publishers, 2004. 2. C.K.Toh, ―Adhoc Mobile Wireless Networks‖, Pearson Education, 2002. 3. Thomas Krag and Sebastin Buettrich, ‗Wireless Mesh Networking‘, O‘Reilly Publishers, 2007.

iii. Online Resources 1. http://en.wikipedia.org/wiki/Mobile_ad_hoc_network 2. http://research.ac.upc.edu/CompNet/qos_adhoc.htm 3. http://www.cse.wustl.edu/~jain/cse574-06/ftp/j_gema.pdf 4. http://en.wikipedia.org/wiki/Mesh_networking

COURSE CODE COURSE TITLE L T P C

1152IT105 MODERN CRYPTOGRAPHY 3 0 0 3

a.Preamble : This course provides an introduction to Modern Cryptography is an introductory-level treatment of cryptography written from a modern, computer science perspective. a. Prerequisite Courses: Introduction to cryptography , Cryptography and network security b. Related Courses: Network security Principles and protocols c. Course Educational Objectives : Students undergoing this course are expected:

 Know about Classical encryption techniques  Understand Block ciphers and pseudorandom functions

d. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Classical cryptography. K1 Modern cryptography, symmetric and CO2 K2 asymmetric ciphers.  CO3 Symmetric ciphers. Key length, brute force attack. K2 Examples of symmetric ciphers. Feistel, DES, modes of  CO4 K2 operation. Typical application of symmetric cryptograph  CO5 K2

70 e. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M H- High; M-Medium; L-Low f. Course Content :

UNIT I L-9 Classical Cryptography-The Shift Cipher, The Substitution Cipher, The Affine Cipher Cryptanalysis-Cryptanalysis of the Affine Cipher ,Cryptanalysis of the Substitution Cipher, Cryptanalysis of the Vigenere Cipher, Shannon‘s Theory.

UNIT II L-9 Block Cipher and the Advanced Encryption Standard-Substitution -Permutation Netrworks, Linear Cryptanalysis, Differential Crypto analysis , The Data Encryption Standard, The Advanced Encryption Standard, Modes of Operation ,Cryptography Hash Function- Hash Function and Data Integrity,Security of Hash Function ,Iterated Hash Functions, Message

UNIT III L-9 The RSA Cryptosystem and Factoring Integer- Intoduction to Public –key Cryptography, Number theory,The RSA Cryptosystem ,Other Attacks on RSA,The ELGamal Cryptosystem,Shanks‘ Algorithm,Finit Fields,Elliptic Curves over the Reals, Elliptical Curves Modulo a Prime,Signature Scheme –Digital Signature Algorithm.

UNIT IV L-9 Identification Scheme and Entity Attenuation-Challenge – and – Response in the Secret-key Setting,Challenge – and – Response in the Public key Setting,The Schnorr Identificataon Scheme,Key distribution-Diffie-Hellman Key, Predustribution,Unconditionaly Secure key Predistribution,Key Agreement SchemeDiffie-Hellman Key agreement,Public key infrastructure- PKI,Certificates.

UNIT V L-9 Secret Sharing Schemes-The Shamir Threshold Scheme,Access Structure and General Scret key sharing,Informataion Rate and Construction of Effcient Schemes,Multicast Securuty and Copyright production-Multicast Security,Braodcast Encryption ,Multicast Re-keying,Copyright Protection ,Tracing Illegally Redistribution keys.

h. Learning Resources

i)Text Book

1. Introduction to Modern Cryptography Jonathan Katz and Yehuda Lindell,Chapman & Hall/CRC Press, Second or third edition

ii) Reference Books

1. Menges A. J , Oorschot P, Vanstone S.A,―Handbollk of Appliled Cryptography‖ CRC Press,1997.

2. William Stallings, ―Cryptography and Network Security: Principles and Practices‖, Third Edition, Pearson Education,2006.

3. Wenbo Mao, ―Modern Cryptography – Theory and Practice‖, Pearson Education, First Edition, 2006.

4. Charles B. Pfleeger, Shari Lawrence Pfleeger, ―Security in Computing‖, Fourth Edition, Pearson Education, 2007. 14

5. Wade Trappe and Lawrence C. Washington, ―Intrduction to Cryptography

iii) Online Learning:

 www.amazon.com/Modern cryptography-Applications.../dp/1852333081

 www.myreaders.info/01_Introduction_to_modern cryptography.pdf

COURSE CODE COURSE TITLE L T P C 1152IT106 MULTIMEDIA COMMUNICATION NETWORKS 3 0 0 3

a.Preamble : This course provides an introduction to Standards for Multimedia Communications, provides concepts of Broadband ATM networks, Multimedia Communications Across different Networks. g. Prerequisite Courses: Computer networks h. Related Courses: Network security Principles and protocols i. Course Educational Objectives : Students undergoing this course are expected:  To learn the multimedia communication standards and compression techniques.  To understand the multimedia communication models  To analyze the guaranteed service model  To study the multimedia transport in wireless networks  To explore real-time multimedia network applications

e.Course Outcomes:

CON Level of learning domain(Based Course Outcomes os on revised Bloom’s taxonomy)

CO1 Deploy the right Multimedia Communication models K2 Apply QoS to multimedia network applications with CO2 efficient routing techniques K2 CO3 Develop the real-time multimedia network applications K2

g. Course Content: Unit I

Multimedia Communications -Introduction-Multimedia networks-Multimedia applications- Applications and networking terminology- Audio compression and Video Compression Unit II

Standards for Multimedia Communications-Introduction-Reference models-Standards relating to interpersonal communications-Standards relating to interactive applications over the Internet Standards for entertainment applications. Digital communication basics: Transmission media Sources of signal impairment-Asynchronous transmission-Synchronous transmission-Error Detection methods Unit III The Internet-IP data grams-Fragmentation and reassembly-IP addresses-ARP and RARP Routing algorithms-ICMP-QoS support-The PPP link layer protocol-IPv6-IPv6/IPv4 interoperability Unit IV Broadband ATM networks: Cell format and switching principles- Switch architectures-Protocol architecture. Entertainment networks and high-speed modems: Cable TV networks-Satellite television networks-Terrestrial television networks-High-speed PSTN access technologiesTransport protocols: TCP/IP protocol suite-UDP-RTP and RTCP Unit V Multimedia Communications Across Networks: Packet Audio/Video in the network Environment -Video transport across generic networks-Multimedia transport across ATM networks – Multimedia across IP networks – Multimedia across DSLs – Internet access Networks – Multimedia across wireless - Mobiles Networks – Broadcasting Networks – Digital Television infrastructure for interactive multimedia services

Text Books: 1.Fred Halsall, Multimedia Communications, Pearson, Seventh Indian Reprint, 2005. ISBN: 81- 7808-532-1. 2. 2.K .R. Rao, Zaron S. Bojkovic, Dragorad A. Milocanovic, Multimedia Communication Systems, Prentice Hall India, 2002. ISBN: 81-203-2145-6. Reference Book: Steve Heath, Multimedia and Communication Technology, Second Edition, Focal Press, 2003. ISBN: 81-8147-145-8.

COURSE CODE COURSE TITLE L T P C OPTICAL COMMUNICATION 1152IT107 3 0 0 3

To introduce the various optical fiber modes, configurations and various signal degradation factors associated with optical fiber, various optical sources and optical detectors and their use in the optical communication system.

b. Pre-requisites: Sl. No Course Code Course Name 1 Computer networks c. Related Courses: Sl. No Course Code Course Name 1 Multimedia Communication Networks 3 Project Work

d. Course Educational Objectives: Students undergoing this course are expected to

 To learn the basic elements of optical fiber transmission link, fiber modes configurations and structures.  To understand the different kind of losses, signal distortion in optical wave guides and other signal degradation factors. Design optimization of SM fibers, RI profile and cut-off wave length.  To learn the various optical source materials, LED structures, quantum efficiency, Laser diodes and different fiber amplifiers.  To learn the fiber optical receivers such as PIN APD diodes, noise performance in photo detector, receiver operation and configuration.  To learn fiber slicing and connectors, noise effects on system performance, operational principles WDM and solutions.

e.Course Outcomes:

Level of learning domain(Based CONos Course Outcomes on revised Bloom’s taxonomy) Provides thorough knowledge of different optical CO1 K2 communication systems A thorough knowledge of optical components and its CO2 performances K2

Details of impairments in optical fiber links and CO3 K2 schemes to mitigate them

UNIT - 1 : INTRODUCTION TO OPTICAL FIBERS

Evolution of fiber optic system- Element of an Optical Fiber Transmission link- Ray Optics- Optical Fiber Modes and Configurations -Mode theory of Circular Wave guides- Overview of Modes-Key Modal concepts- Linearly Polarized Modes -Single Mode Fibers-Graded Index fiber structure.

UNIT - 2 : SIGNAL DEGRADATION OPTICAL FIBERS

Attenuation - Absorption losses, Scattering losses, Bending Losses, Core and Cladding losses, Signal Distortion in Optical Wave guides-Information Capacity determination -Group Delay- Material Dispersion, Wave guide Dispersion, Signal distortion in SM fibers-Polarization Mode dispersion, Intermodal dispersion, Pulse Broadening in GI fibers-Mode Coupling -Design Optimization of SM fibers-RI profile and cut-off wavelength.

UNIT - 3 : FIBER OPTICAL SOURCES AND COUPLING

Direct and indirect Band gap materials-LED structures -Light source materials -Quantum efficiency and LED power, Modulation of a LED, lasers Diodes-Modes and Threshold condition - Rate equations -External Quantum efficiency -Resonant frequencies -Laser Diodes, Temperature effects, Introduction to Quantum laser, Fiber amplifiers- Power Launching and coupling, Lencing schemes, Fibre -to- Fibre joints, Fibre splicing.

UNIT - 4 : FIBER OPTICAL RECEIVERS

PIN and APD diodes -Photo detector noise, SNR, Detector Response time, Avalanche Multiplication Noise -Comparison of Photo detectors -Fundamental Receiver Operation - preamplifiers, Error Sources -Receiver Configuration -Probability of Error - Quantum Limit.

UNIT - 5 : DIGITAL TRANSMISSION SYSTEM

Point-to-Point links System considerations -Link Power budget -Rise - time budget -Noise Effects on System Performance-Operational Principles of WDM, Solitons-Erbium-doped Amplifiers.

TEXT BOOKS

1. Gerd Keiser, "Optical Fiber Communication" McGraw -Hill International, Singapore, 3rd ed., 2000

REFERENCES

1. J.Senior, "Optical Communication, Principles and Practice", Prentice Hall of India, 1994. 2. J.Gower, "Optical Communication System", Prentice Hall of India, 2001. 

COURSE CODE COURSE TITLE L T P C 1152IT108 Ethical Hacking 3 0 0 3

a.Preamble: This Ethical hacking course is used to investigate the importance of ethical hacking and its implementation in organizations. b. Pre-requisites: Sl. No Course Code Course Name 1 Cryptography and network security c. Related Courses: Sl. No Course Code Course Name 1 Modern Cryptography 2 Web Technology 3 Project Work

d. Course Educational Objectives: Students undergoing this course are expected to  To covers the importance of information security.  To understand different scanning and enumeration methodologies and tools.  To analyze various hacking techniques and attacks.  To provide importance of programming languages for security professionals e.Course Outcomes:

Level of learning domain(Based CONos Course Outcomes on revised Bloom’s taxonomy)

CO1Defend hacking attacks and protect data assets K2 To get knowledge on various scanning CO2 methodologies and Enumeration Techniques K2

Defend a computer against a variety of security attacks CO3 K2 using various tools Practice and use safe techniques on the World Wide CO4 K2 Web To get familiarized with the different phases in CO5 penetration testing. K3

g. Course Content:

UNIT I INTRODUCTION TO HACKING 9

Introduction to Hacking – Importance of Security – Elements of Security – Phases of an Attack – Types of Hacker Attacks – Hacktivism – Vulnerability Research – Introduction to Foot printing – Information Gathering Methodology – Foot printing Tools – WHOIS Tools – DNS Information Tools – Locating the Network Range – Meta Search Engines.

UNIT II SCANNING AND ENUMERATION 9 Introduction to Scanning – Objectives – Scanning Methodology – Tools – Introduction to Enumeration – Enumeration Techniques – Enumeration Procedure – Tools.

UNIT III SYSTEM HACKING 9 Introduction – Cracking Passwords – Password Cracking Websites – Password Guessing – Password Cracking Tools – Password Cracking Counter measures – Escalating Privileges –Executing Applications – Key loggers and Spyware. UNIT IV PROGRAMMING FOR SECURITY PROFESSIONALS 9 Programming Fundamentals – C language – HTML – Perl – Windows OS Vulnerabilities – Tools for Identifying Vulnerabilities – Countermeasures – Linux OS Vulnerabilities – Tools for Identifying Vulnerabilities – Countermeasures. UNIT V PENETRATION TESTING 9 Introduction – Security Assessments – Types of Penetration Testing- Phases of Penetration Testing – Tools – Choosing Different Types of Pen-Test Tools – Penetration Testing Tools

TOTAL : 45 PERIODS h.Learning Resources i.Text Books: 1. Ec-Council, ―Ethical Hacking and Countermeasures: Attack Phases‖, Delmar Cengage Learning, 2009. 2. Michael T. Simpson, Kent Backman, James E. Corley, ―Hands-On Ethical Hacking and Network Defense‖, Cengage Learning, 2012. ii.References: 1. Patrick Engebretson, ―The Basics of Hacking and Penetration Testing – Ethical Hacking and Penetration Testing Made Easy‖, Syngress Media, Second Revised Edition, 2013. 2. Jon Erickson, ―Hacking: The Art of Exploitation‖, No Starch Press, Second Edition, 2008.

COURSE CODE COURSE TITLE L T P C 1152IT109 Forensics and Cyber Applications 3 0 0 3

Course Category: Foundation (0)/ Program Core (1)/ Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) a.Preamble: The Cyber forensics, sometimes referred to as computer forensic science, is a special branch of digital forensic science that deals with legal evidence accessed from computers and digital media. The goal of digital forensic programs is to examine digital media in detail with the aim of storing, recovering, examining and presenting factual evidence and opinions thereof, about the information b. Pre-requisites: Sl. No Course Code Course Name 1 Computer Networks c. Related Courses: Sl. No Course Code Course Name 1 Cryptography and network security 2 Web Technology 3 Project Work

c. Course Educational Objectives: Students undergoing this course are expected to  To study the basics of networks for Digital investigations.  Plan and prepare for all stages of an investigation - detection, initial response and management interaction.  Learn the importance of evidence handling and storage .  Monitor network traffic and detect illicit servers and covert channels

Level of learning domain(Based CONos Course Outcomes on revised Bloom’s taxonomy)

Discuss the security issues network layer and transport CO1 layer and Identify, design the new network models for K2 Digital investigators. Study and Analyze various Cybercrime Law and CO2 Explain digital forensics. K2

Capable to design, practice and use safe techniques on the CO3 K2 Digital evidence. Able to handle various ethical issues related to CO4 K2 Forensics CO5Analyze and design different models of Hacking Tools K3

Unit 1 Network Basics for Digital Investigators

Network Basics for Digital Investigators, Applying Forensic Science to Networks, Digital Evidence on the Internet, Digital Evidence on Physical and Data-Link Layers, Digital Evidence at the Network and Transport Layers, Security and Fraud detection in Mobile and wireless networks.

Unit 2 Digital forensics and digital investigation.

Foundations of digital Forensics, Language of Computer Crime Investigation, Digital Evidence of Courtroom, Cybercrime Law: United State Perspective, Indian Perspective, Indian IT Act, conductive Digital Investigation, Handling a Digital Crime Scene: Principles, Preservation, Modus Operandi, Motive, and Technology .

Unit 3 Violent Crime and Digital Evidence, Cyber Crimes and Investigation Procedures Violent Crime and Digital Evidence, Digital Evidence as Alibi, Gender Offenders on the Internet, Computer Intrusions, Cyber Forensic and Computer Crimes, Types of Cyber Crimes: Crimes targeting Computers, Online based Cyber Crimes.

Unit 4 Cyber stalking and Evidence Handling

Cyber stalking, Computer Basics for Digital Investigators, Applying Forensic Science to Computers , Types of Evidence, Challenges in evidence handling, Overview of evidence handling procedure

Unit 5 Digital Evidence and ETHICAL ISSUES

Digital Evidence on Windows Systems, Digital Evidence on UNIX Systems,Digital Evidence on Mobile Devices, Intellectual Property Rights.. Data Analysis Techniques - Investigating Live Systems (Windows &Unix) - Investigating Hacker Tools - Ethical Issues – Cybercrime.

TOTAL : 45 PERIODS h.Learning Resources i.Text Books:

1. Eoghan Casey, "Handbook Computer Crime Investigation's Forensic Tools and Technology", Academic Press, 1st Edition, 2001 2. Skoudis. E., Perlman. R. Counter Hack: A Step-by-Step Guide to Computer Attacks and Effective Defenses.Prentice Hall Professional Technical Reference. 2001.

ii.References:

1.Bill Nelson,Amelia Philips and Christopher Steuart, ―Guide to computer forensics and investigations‖,course technology,4thedition,ISBN: 1-435-49883-6

COURSE CODE COURSE TITLE L T P C 1152IT110 Internet of Things 3 0 0 3

Course Category: Foundation (0)/ Program Core (1)/ Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) a.Preamble: The Internet of Things (IoT) has been called the next Industrial Revolution — it will change the way all businesses, governments, and consumers interact with the physical world. b. Pre-requisites: Sl. No Course Code Course Name 1 Computer Networks c. Related Courses: Sl. No Course Code Course Name 1 IT Infrastructure Management 2 Android Application Development 3 Project Work

d. Course Educational Objectives: Students undergoing this course are expected to  To understand the basics of Internet of Things  To get an idea of some of the application areas where Internet of Things can be applied  To understand the middleware for Internet of Things  To understand the concepts of Web of Things  To understand the concepts of Cloud of Things with emphasis on Mobile cloud computing  To understand the IOT protocols

e. Course Outcomes: Level of learning domain(Based CONos Course Outcomes on revised Bloom’s taxonomy) Identify and design the new models for market strategic CO1 K2 interaction. CO2 Analyze various protocols for IoT. K2 Design business intelligence and information security CO3 K2 for Web of Things. CO4 Design a middleware for IoT. K2 Analyze and design different models for network CO5 K3 dynamics.

f. Correlation of COs with Program Outcomes COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L CO4 M M M L H CO5 M L M L

H- High; M-Medium; L-Low

g. Course Content: UNIT I INTRODUCTION 10 Definitions and Functional Requirements –Motivation – Architecture - Web 3.0 View of IoT– biquitousIoT Applications – Four Pillars of IoT – DNA of IoT - The Toolkit Approach for End- user-Participation in the Internet of Things. Middleware for IoT: Overview – Communication middleware forIoT –IoT Information Security.

UNIT II IOT PROTOCOLS 8 Protocol Standardization for IoT – Efforts – M2M and WSN Protocols – SCADA and RFID Protocols –Issues with IoT Standardization – Unified Data Standards – Protocols – IEEE 802.15.4 – BACNetProtocol – Modbus – KNX – Zigbee Architecture – Network layer – APS layer – Security.

UNIT III WEB OF THINGS 10 Web of Things versus Internet of Things – Two Pillars of the Web – Architecture Standardization forWoT– Platform Middleware for WoT – Unified Multitier WoT Architecture – WoT Portals and BusinessIntelligence. Cloud of Things: Grid/SOA and Cloud Computing – Cloud Middleware – Cloud Standards– Cloud Providers and Systems – Mobile Cloud Computing – The Cloud of Things Architecture.

UNIT IV INTEGRATED 9 Integrated Billing Solutions in the Internet of Things Business Models for the Internet of Things - Network Dynamics: Population Models – Information Cascades - Network Effects – NetworkDynamics: Structural Models - Cascading Behavior in Networks - The Small-World Phenomenon.

UNIT V APPLICATIONS 8 The Role of the Internet of Things for Increased Autonomy and Agility in Collaborative ProductionEnvironments - Resource Management in the Internet of Things: Clustering, Synchronisation andSoftware Agents. Applications - Smart Grid – Electrical Vehicle Charging. TOTAL: 45 Periods i. Learning Resources i. Text Books: 1. The Internet of Things in the Cloud: A Middleware Perspective - Honbo Zhou – CRC Press – 2012. 2. Architecting the Internet of Things - Dieter Uckelmann; Mark Harrison; Florian Michahelles-(Eds.) – Springer – 2011.

COURSE CODE COURSE TITLE L T P C 1152IT111 BIG DATA ANALYTICS 3 0 0 3

Sl. No Course Code Course Name 1 Linux 2 Distributed computing d. Course Educational Objectives : Learners are exposed to • To explore the fundamental concepts of big data analytics. • To learn to analyze the big data using intelligent techniques. • To understand the various search methods and visualization techniques.

• To learn to use various techniques for mining data stream. • To understand the applications using Map Reduce Concepts. e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised No’s Bloom’s Taxonomy) CO1 Work with big data platform K2

Analyze the big data analytic techniques for useful business K2, S3 CO2 applications. Design efficient algorithms for mining the data from large K2, S3 CO3 volumes.

Analyze the HADOOP and Map Reduce technologies associated K3, S3 CO4 with big data analytics CO5 Explore on Big Data applications Using Pig and Hive K3, S3 f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M CO3 M M M CO4 M M M CO5 M H M H- High; M-Medium; L-Low g. Course Content: Theory UNIT I INTRODUCTION TO BIG DATA 8 Introduction to BigData Platform – Challenges of Conventional Systems - Intelligent data analysis – Nature of Data - Analytic Processes and Tools - Analysis vs Reporting - Modern Data Analytic Tools - Statistical Concepts: Sampling Distributions - Re-Sampling - Statistical Inference - Prediction Error.

UNIT II MINING DATA STREAMS 9 Introduction To Streams Concepts – Stream Data Model and Architecture - Stream Computing - Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream – Estimating Moments – Counting Oneness in a Window – Decaying Window - Real time Analytics Platform(RTAP) Applications - Case Studies - Real Time Sentiment Analysis, Stock Market Predictions. UNIT III HADOOP 10 History of Hadoop- The Hadoop Distributed File System – Components of HadoopAnalyzing the Data with Hadoop- Scaling Out- Hadoop Streaming- Design of HDFS-Java interfaces to HDFSBasics- Developing a Map Reduce Application-How Map Reduce Works-Anatomy of a Map Reduce Job run-Failures-Job Scheduling-Shuffle and Sort – Task execution - Map Reduce Types and Formats- Map Reduce Features UNIT IV HADOOP ENVIRONMENT 9 Setting up a Hadoop Cluster - Cluster specification - Cluster Setup and Installation – Hadoop Configuration-Security in Hadoop - Administering Hadoop – HDFS - MonitoringMaintenance- Hadoop benchmarks- Hadoop in the cloud UNIT V FRAMEWORKS 9 Applications on Big Data Using Pig and Hive – Data processing operators in Pig – Hive services – HiveQL – Querying Data in Hive - fundamentals of HBase and ZooKeeper - IBM InfoSphere BigInsights and Streams. Visualizations - Visual data analysis techniques, interaction techniques; Systems and applications Total: 45 Hours h. Learning Resources i.Text Books: 1. Big Data: A Revolution That Will Transform How We Live, Work, and Think by Viktor Mayer-Schoenberger & Kenneth Cukier 2. MapReduce Design Patterns: Building Effective Algorithms and Analytics for Hadoop and Other Systems

COURSE CODE COURSE TITLE L T P C 1152IT112 VIRTUALIZATION TECHNIQUES 3 0 0 3

Course Category:

a.Preamble It aims to create a virtual version of a device or resource, such as a server, storage device, network or even an operating system where the framework divides the resource into one or more execution environments. Even something as simple as partitioning a hard drive is considered virtualization because you take one drive and partition it to create two separate hard drives. Devices, applications and human users are able to interact with the virtual resource as if it were a real single logical resource. b. Prerequisite Courses:

CLOUD COMPUTING

c. Related Courses:

DISTRIBUTED COMPUTNG GRID COMPUTING d. Course Educational Objectives :

Students undergoing this course are expected to

 Understand the need of virtualization  Explore the types of virtualization  Understand the concepts of virtualization and virtual machines  Understand the practical virtualization solutions and enterprise solutions  Understand the security issues in cloud computing

e. Course Outcomes :

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Deploy legacy OSs on virtual machines CO1 K2

Understand the intricacies of server, storage, network, desktop CO2 and application virtualizations K3

Design new models for virtualization CO3 K3

Design and develop cloud applications on virtual machine CO4 platforms K2

Design new models for Bigdata processing in cloud CO5 K3

f. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low g. Course Content :

UNIT- I INTRODUCTION TO VIRTUALIZATION : Basics of Virtualization – Virtualization Types – Model of Virtualization – Layers of Virtualization – Server Machine Virtualization - Application Virtualization – Goals of Virtualization – Taxonomy of Virtual Machines.

UNIT - II VIRTUALIZATION INFRASTRUCTURE: Hardware Virtualization- Virtual Hardware Overview – Virtual Machine Products - Sever Consolidation – Server Pooling - Types of Server Virtualization – Business cases for Sever-Virtualization –Selecting server Virtualization Platform

UNIT - III NETWORK VIRTUALIZATION : Virtual File Systems – Process Virtualization – Layers in Virtualization – Players in Virtualization - Virtualizing the Campus WAN Design – - Routing Protocols- Virtualization Aware Routing - Multi-Topology Routing – Case Studies of Network Virtualization.

UNIT - IV DESKTOP VIRTUALIZATION AND STORAGE VIRTUALIZATION : Desktop Virtualization- Preparing a Virtualization Machine Host- Storage Virtualization - iSCSI Architecture – Securing iSCSI – SAN backup and recovery techniques – RAID – SNIA Shared Storage Model – Classical Storage Model – Virtual Information Systems.

UNIT – V SECURITY : Secure Virtual Infrastructure- Protect Virtual Infrastructure-Prepare Business Continuity -Update Management Structure

86 h.Learning Resources i.Textbook :

1. Dan Kusnetzky ,‖Virtualization: A Manager’s Guide‖, O‘Reily,2011 ii. Reference Books 1. Danielle Ruest, Nelson Ruest,‖ Virtualization: A Beginner’s Guide‖,McGraw Hill, 2009 2. Chris Wolf, Erick M. Halter ,‖Virtualization: From Desktop to the Enterprise‖, A Press, 2006 iii. Online Resources

1.http://www.ss.pku.edu.cn/vs/style/resources/Introduction%20to%20Virtualization.pdf 2. http://www.vmware.com/in/virtualization 3.http://bradhedlund.com/2013/01/28/network-virtualization-a-next-generation-modular-platform- for-the-virtual-network/ 4.http://en.wikipedia.org/wiki/Desktop_virtualization 5.http://www.vmware.com/files/pdf/cloud/vmware-cloud-solution-security-in-the-cloud-wp- en.pdf

COURSE CODE COURSE TITLE L T P C 1152IT113 Social Network Analysis 3 0 0 3

d. Course Educational Objectives : Students undergoing this course are expected to: • Basics of computer networks • Formalize different types of networks • Plan and execute network communities. • Network applications. • Network Implications and cascades. e. Course Outcomes : Upon the successful completion of the course, students will be able to: COURSE OUTCOMES Knowledge Level CO (Based on revised Nos. Bloom’s Taxonomy) CO1 Describe the basic concepts of computer networks.

K2 CO2 Formalize different types of networks

CO3 Explain network communities K2

CO4 Discuss about network applications K2

CO5 Explain Network Implications and cascades K2

f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L

CO2 M L M

CO3 M M M

CO4 M M

CO5 M M

CO6 M M

CO7 H M H M H

g. Course Content :

UNIT 1 Introduction to Complex Networks and Random Graphs 9

Networks –face book-terrorist network –Internet – Airline Network-Geo-social Networks A Network is a Graph Node Degree - Directed & Undirected-Graphs Paths and Cycles Connectivity- Components- Path Length/Distance-Small-world Phenomenon-Milgram‘s Experiment Erdos Number Bacon Number Random Graphs - model – Properties Diameter

UNIT II 9 Small World and Weak ties- Clustering Co-eﬃcient of Real Networks -Real Networks vs Random Networks –Small World Model-Other Real Networks-Examples- Bridges- Network Centrality and Applications Centrality-Measures-Normalization-Freeman‘s Network-Centrality Betweenness-Closeness-Centrality

UNIT III 9 Communities-Overlapping Communities and Community Detection – Communities-Edge Betweenness –Calculating number of shortest paths - Calculating flows – Modularity- Modularity Optimization

UNIT IV 9

Structure of the Web,-Search and Power Laws Precursor of hypertexts-SCC-Power Law vs Exponent-Reach ability-Unpredictability -Network Robustness and Applications-Internet as topology-Properties- Robustness Site-Percolation- eﬀ ect of attacks and failure on WWW and Internet- Eﬀ ect on Giant Component Scale-free networks

UNIT V 9

Cascades and Behavior Influence – Decision Making and Behaviour Influence - Model of Discussion - Network Implications- Chain Reactions Cascades – Viral Marketing - Clusters and Cascades- Epidemic Spreading-EpidemicSpreading and Information Cascades Examples

h. Learning Resources i. TEXT BOOKS: 1. D. Easley, J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.

2. M. Newmann. Networks. Oxford University Press. April 2010. ii. REFERENCE BOOKS: 1. Stanley Wasserman, University of Illinois, Urbana-Champaign, Social Network Analysis Methods and Applications, University of South Carolina, May 1995. 2. Stanley Wasserman, Joseph Galaskiewicz, Advances in Social Network Analysis: Research in the Social and Behavioral Sciences (Google eBook), SAGE Publications, 27-Jul-1994

iii. Online resources 1. http://lrs.ed.uiuc.edu/tse-portal/analysis/social-network-analysis

COURSE CODE COURSE TITLE L T P C

1152IT114 Unix and Shell Programming 3 0 0 3

a.Preamble : This course provides an introduction to write simple Unix scripts Cshell script files end in .csh or .com but the presence of a "file extension" and it's name are entirely optional in Unix. b. Prerequisite Courses: Problem solving using C

c. Related Courses:

Shell programming Shell Scripting d. Course Educational Objectives : Students undergoing this course are expected:

 State how the shell functions at the user interface and command line interpreter.  Modify built-in shell variables and create and use user-defined shell variables.  Use I/O redirection, pipes, quoting, and filename expansion mechanisms.  Create structured shell programming which accept and use positional parameters and exported variables.  Use shell flow control and conditional branching constructs (while, for, case, if, etc.)  Create shell programs which process interrupts, pass signals, invoke sub-shells and functions, and trap signals.  Use shell debugging mechanisms to improve shell program efficiency and detect and correct error. e. Course Outcomes :

Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Create structured shell programming K1 CO2 How the shell functions will be used K4  CO3 Filename expansion mechanisms K3  CO4 Create shell programs with process interrupts K2

Shell program efficiency and detect and correct error.  CO5 K2

f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M H- High; M-Medium; L-Low g. Course Content :

UNIT – 1: INTRODUCTION: L-10

Introduction to Multi user System- History of UNIX - Features & Benefits - Versions of UNIX, Features of UNIX File System - Commonly Used Commands like who, pwd, cd, mkdir, rm,rmdir, ls, mv, ln, chmod, cp, grep, sed, awk ,tr, yacc etc.

UNIT II INTRODUCTION TO SHELL SCRIPTS & AWK PROGRAMMING: L-8

Bourne Shell, C Shell, Shell Variables, Scripts, Meta Characters and Environment, if and case Statements, for, while and until loops. Awk Pattern Scanning and Processing, begin and end Patterns, Awk Arithmetic and Variables, built In functions and Operators, Arrays, Strings.

UNIT III GENERAL OVERVIEW OF THE SYSTEM : L-10

System Structure, User Perspective, Operating System Services Assumption about Hardware, The Kernel and Buffer Cache Architecture of UNIX Operating System, System Concepts, Buffer Headers, Structure of the Buffer Pool, Scenarios for Retrieval of the Buffer, Reading and Writing Disk Blocks, Advantages and Disadvantages of Buffer Cache

UNIT IV FUNCTIONS OF UNIX: L-8 Unix system, components of Unix, structure of Unix file system, directories, wildcards, finding files, archives, file I/O, backingup, linking, utilities. Unix shell commands, pipes, filters, Login and logout, using korn, bourne and C shells as programming language.

UNIT V ADVANCED CONCEPTS : L - 9 Limitations of Unix, FTP and Telnet, Regular expression parsing and engines - grep, egrep, sed, awk, vi etc. Process and signals - fork, Networking commands, Unix programming in C.

92 h. Learning Resources

i)Text Book

1. Harvey M.Deital, Paul Deital, "C - How to Program", Pearson Education Asia Publication, 2001

ii) Reference Books

1. Mullish Cooper, "The spirit of C, Jaico publishing house, 2002

2. Maurice Bach, "Design of Unix Operating System", PHI 1999.

iii)Online Learning:

 www.amazon.com/Unix Shell Programming-Applications.../dp/1852333081

 www.myreaders.info/01_Introduction_to_unix programming.pdf

COURSE CODE COURSE TITLE L T P C 1152IT115 DIGITAL IMAGE PROCESSING 3 0 0 3

a.Preamble : This course provides an introduction regarding the various image processing techniques b. Prerequisite Courses: Introduction to digital images, digital processing techniques c. Related Courses:  Digital signal processing  Digital programming concepts d. Course Educational Objectives : Students undergoing this course are expected:  Tostudy the image fundamentals and mathematical transforms necessary for image proces sing.  To study the image enhancement techniques  To study image restoration procedures.  To study the image compression procedures.  To study the image segmentation and representation techniques. e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Mathematical transforms necessary for image processing. K1

CO2 Image enhancement techniques K2

 CO3 Image restoration procedures. K2

 CO4 Image compression procedures K2

 CO5 Image segmentation and representation techniques. K2

f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M

CO3 M M M CO4 M M CO5 M M H- High; M-Medium; L-Low g. Course Content: UNITI Elements of digital image processing systems, Vidicon and Digital Camera working principles, El ements ofvisual perception, brightness, contrast, hue, saturation, mach band effect, Color image fundamentals

UNIT II IMAGE ENHANCEMENT Histogram equalization and specification techniques, Noise distributions, Spatial averaging, Direc tionalSmoothing, Median, Geometric mean, Harmonic mean, Contraharmonic mean filters, Homo morphic filtering,Color image enhancement.

UNITIII IMAGERESTORATION Image Restoration degradation model, Unconstrained restoration Lagrange multiplier and Constr ainedrestoration, Inverse filteringremoval of blur caused by uniform linear motion, Wiener filt ering, Geometrictransformations-spatial transformations. UNITIVIMAGESEGMENTATION Edge detection, Edge linking via Hough transform – Thresholding - Region based segmentation RegiongrowingRegion splitting and Merging Segmentation by morphological Watersheds basic concepts –Dam construction UNIT V IMAGE COMPRESSION Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding, VectorQuantization, Transform coding, JPEG standard, MPEG. Total 45 periods h. Learning Resources i) TEXTBOOK

1. Rafael C. Gonzalez, Richard E. Woods, , Digital Image Processing', Pearson, Second Edition,2 004.

2. Anil K. Jain, , Fundamentals of Digital Image Processing', Pearson 2002.

ii) REFERENCE BOOKS

1.Kenneth R. Castleman, Digital Image Processing, Pearson, 2006.

2. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,' Digital Image Processing using MAT LAB',Pearson Education, Inc., 2004.

3. D,E. Dudgeon and RM. Mersereau, , Multidimensional Digital Signal Processing', Prentice Hal lProfessional Technical Reference, 1990. 4. William K. Pratt, , Digital Image Processing' , John Wiley, New York, 2002

5. Milan Sonka et aI, 'IMAGE PROCESSING, ANALYSIS AND MACHINE VISION', Brookes /Cole, VikasPublishing House, 2nd edition, 1999,

iii) Online Learning:

 www.amazon.com/Digital image processing-Applications.../dp/1852333081

 www.myreaders.info/01_Introduction_to_digital image processing.pdf

COURSE CODE COURSE TITLE L T P C INFORMATION STORAGE 1152IT116 3 0 0 3 MANAGEMENT

b. Prerequisite Courses:

 Database storage  Data ware housing. c. Related Courses:  Parallel computer architecture.  Database Administration. d. Course Educational Objectives: Students undergoing this course are expected:

 Understanding logical and physical components of a storage infrastructure.  Evaluating storage architectures, including storage subsystems, DAS, SAN, NAS, CAS  Define information security and identify different storage virtualization technologies  Define backup, recovery, disaster recovery, business continuity, and replication

e. Course Outcomes: Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Analyze Data storage technology K2 Explain about Storage system architecture , concepts like CO2 RAID, parity algorithms, Array caching and logical K1 partioning CO3 Describe concepts like DAS, SAN, CAS ,NFS etc K1 CO4 Explain recovery and continuity technique K1 Describe about Industry management standards (SNMP, SMI- CO5 K1 S, CIM), Key management metrics (thresholds, availability,

capacity, security, performance)

f. Correlation of COs with POs : CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M H- High; M-Medium; L-Low g. Course Content:

UNIT I Introduction to Storage Technology L- 9

Data proliferation and the varying value of data with time & usage, Sources of data and states of data creation, Data center requirements and evolution to accommodate storage needs, Overview of basic storage management skills and activities, The five pillars of technology, Overview of storage infrastructure components, Evolution of storage, Information Lifecycle Management concept, Data categorization within an enterprise, Storage and Regulations.

UNIT II Storage Systems Architecture L- 9

Intelligent disk subsystems overview, Contrast of integrated vs. modular arrays, Component architecture of intelligent disk subsystems, Disk physical structure components, properties, performance, and specifications, Logical partitioning of disks, RAID & parity algorithms, hot sparing, Physical vs. logical disk organization, protection, and back end management, Storage system connectivity protocols.

UNIT III Introduction to Networked Storage 1 L- 9

JBOD, DAS, SAN, NAS, & CAS evolution, Direct Attached Storage (DAS) environments: elements, connectivity, & management, Storage Area Networks (SAN): elements & connectivity, Fibre Channel principles, standards, & network management principles, SAN management principles,

UNIT IV Introduction to Networked Storage 2 L- 9

Network Attached Storage (NAS): elements, connectivity options, connectivity protocols (NFS, CIFS, ftp), & management principles, IP SAN elements, standards (SCSI, FCIP, FCP), connectivity principles, security, and

management principles, Content Addressable Storage (CAS): elements, connectivity options, standards, and management principles, Hybrid Storage solutions overview including technologies like virtualization & appliances

UNIT V Introduction to Information Availability L- 9

Business Continuity and Disaster Recovery Basics, Local business continuity techniques, Remote business continuity techniques, Disaster Recovery principles & techniques.

TOTAL: 45 periods h. Learning Resources i.Text Books :

1. Stephen Haag and Maeve Cummings, ‖Information Systems Essentials, II Edition, Mc- a. graw /Irwin 2008. 2. Ralph Stair ―principles of information Systems, VI edition, 2003.

ii.Reference: 1. Harold koontz and Heinz Weirich,‖ Essentials of management‖ ,fifth edition, Tata McGraw Hill,1998 iii. Online resources

1. www.cs.washington.edu/education/courses/cse341/95au/.../storage.ht... 2. education.emc.com › Home › Training › Learning Paths 3. www.faadooengineers.com › ... › FaaDoOEngineers.com Recycle Bin 4. www.cs.cmu.edu/~fp/courses/15312-f03/handouts/18-storage.pdf

COURSE CODE COURSE TITLE L T P C

1152IT117 3 0 0 3 DATA WAREHOUSING AND MINING

Course Category: Foundation (0) / Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7). a. Preamble : This Course Is An Introduction To Data Warehousing , Business Analysis Data Mining , Association Rule Mining And Classification , Clustering And Applications And Trends In Data Mining , Types Of Data And Data Mining Application b. Prerequisite Courses:  Database Management System c. Related Courses:  Construct a lightweight prototype or simulation that supports the concept of data mining. d. Course Educational Objectives : Students undergoing this course are expected:  Introduce the concept of data mining with in detail coverage of basic tasks, metrics, issues, and implication.  Core topics like classification, clustering and association rules are exhaustively dealt with.  Introduce the concept of data warehousing with special emphasis on architecture and design. e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Implement Data warehouse architecture. K3

CO2 OLAP tools and its functions. K1

CO3 Various types of data models. K2 Concept of Data mining concepts , functionalities, and CO4 classification of data mining systems. K2

CO5 Concept of clustering and various methods of clustering K2 f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M M M CO2 M M CO3 M

100

CO4 M CO5 M M

H- High; M-Medium; L-Low

g. Course Content :

UNIT I DATA WAREHOUSING 9

Data warehousing Components –Building a Data warehouse –- Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS Schemas for Decision Support – Data Extraction, Cleanup, and Transformation Tools –Metadata.

UNIT II BUSINESS ANALYSIS 9

Reporting and Query tools and Applications – Tool Categories – The Need for Applications – Cognos Impromptu – Online Analytical Processing (OLAP) – Need – Multidimensional Data Model – OLAP Guidelines – Multidimensional versus Multirelational OLAP – Categories of Tools – OLAP Tools and the Internet.

UNIT III DATA MINING 9

Introduction – Data – Types of Data – Data Mining Functionalities – Interestingness of Patterns – Classification of Data Mining Systems – Data Mining Task Primitives –Integration of a Data Mining System with a Data Warehouse – Issues –Data Preprocessing.

UNIT IV ASSOCIATION RULE MINING AND CLASSIFICATION 9

Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining Various Kinds of Association Rules – Correlation Analysis – Constraint Based Association Mining – Classification and Prediction - Basic Concepts - Decision Tree

Induction - Bayesian Classification – Rule Based Classification – Classification by Backpropagation – Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods – Prediction

UNIT V CLUSTERING AND APPLICATIONS AND TRENDS IN DATA MINING 9

Cluster Analysis - Types of Data – Categorization of Major Clustering Methods – Kmeans – Partitioning Methods – Hierarchical Methods - Density-Based Methods –Grid Based Methods – Model-Based Clustering Methods – Clustering High Dimensional Data - Constraint – Based Cluster Analysis – Outlier Analysis – Data Mining Application

TOTAL: 45

h. Learning Resources i) TEXT BOOKS: 1. Alex Berson and Stephen J. Smith, ― Data Warehousing, Data Mining & OLAP‖, Tata

101

McGraw – Hill Edition, Tenth Reprint 2007. 2. Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques‖, Second Edition, Elsevier, 2007. ii) REFERENCES: 1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, ― Introduction To Data Mining‖,Person Education, 2007. 2. K.P. Soman, Shyam Diwakar and V. Ajay ―, Insight into Data mining Theory andPractice‖, Easter Economy Edition, Prentice Hall of India, 2006. 3. G. K. Gupta, ― Introduction to Data Mining with Case Studies‖, Easter EconomyEdition, Prentice Hall of India, 2006. 4. Daniel T.Larose, ―Data Mining Methods and Models‖, Wile-Interscience, 2006. iii) Online resources  rgpv-engineering.blogspot.com/.../mca-501-data-warehousing-and-mini..  121.241.25.1/4.7.1%20-%20Data%20Warehousing%20Mining%20&%... www.nyu.edu/classes/jcf/g22.3033.../DataWarehousingAndOLAP.pdf

102

COURSE CODE COURSE TITLE L T P C

1152IT118 SOFT COMPUTING 3 0 0 3

a.Preamble : This course provides an introduction to neuro, optimization and genetic algorithms, neural networks, neuro fuzzy modeling and applications of computational intelligence,

b.Prerequisite Courses: Design and analysis of algorithms Fundamental of computer programming

c.Related Courses: Artificial Intelligences Robotics

d.Course Educational Objectives : Students undergoing this course are expected  To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human experience.  To become familiar with neural networks that can learn from available examples and generalize to form appropriate rules for inferencing systems.  To provide the mathematical background for carrying out the optimization associated with neural network learning.  To familiarize with genetic algorithms and other random search procedures useful while seeking global optimum in self-learning situations.  To introduce case studies utilizing the above and illustrate the intelligent behavior of programs based on soft computing

e.Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Discuss the concepts of Fuzzy set theory K1 CO2 Apply various soft computing frame works K2  CO3 Design of various neural networks K2  CO4 Use fuzzy logic K2  CO5 Apply genetic programming K2

f.Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

103

CO1 M M CO2 CO3 M M CO4 M CO5 M M H- High; M-Medium; L-Low

g.Course Content :

UNIT I FUZZY SET THEORY Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and Terminology – Set-theoretic Operations – Member Function Formulation and Parameterization – Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling,

UNIT II OPTIMIZATION AND GENETIC ALGORITHMS Derivative-based Optimization – Descent Methods – The Method of Steepest Descent – Classical Newton‘s Method – Step Size Determination – Derivative-free Optimization – Genetic Algorithms – Simulated Annealing – Random Search – Downhill Simplex Search, Simple GA, crossover and mutation, genetic algorithms in search and optimization

UNIT III NEURAL NETWORKS Supervised Learning Neural Networks – Perceptrons - Adaline – Backpropagation Mutilayer Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks – Competitive Learning Networks – Kohonen Self-Organizing Networks – Learning Vector Quantization – Hebbian Learning.

UNIT IV NEURO FUZZY MODELING Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – Learning Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling – Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum, Neuro-fuzzy systems: neuro-fuzzy modeling; neuro-fuzzy control

UNIT V APPLICATIONS OF COMPUTATIONAL INTELLIGENCE Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction , Pattern Recognitions, Image Processing, Biological Sequence Alignment and Drug Design, Robotics and Sensors, Information Retrieval Systems Share Market Analysis, Natural Language Processing j. Learning Resources

i.TEXT BOOK 1. J.S.R.Jang, C.T.Sun and E.Mizutani, ―Neuro-Fuzzy and Soft Computing‖, PHI, 2004, Pearson Education 2004.

ii. REFERENCE BOOKS

1.Timothy J.Ross, ―Fuzzy Logic with Engineering Applications‖, McGraw-Hill, 1997.

104

2. Davis E.Goldberg, ―Genetic Algorithms: Search, Optimization and Machine Learning‖, Addison Wesley, N.Y., 1989.

3. S. Rajasekaran and G.A.V.Pai, ―Neural Networks, Fuzzy Logic and Genetic Algorithms‖, PHI, 2003.

4. R.Eberhart, P.Simpson and R.Dobbins, ―Computational Intelligence - PC Tools‖, AP Professional, Boston, 1996.

iii.Online resources

 www.amazon.com/Soft-Computing-Applications.../dp/1852333081

 www.myreaders.info/01_Introduction_to_Soft_Computing.pdf

105

COURSE CODE COURSE TITLE L T P C 1152IT119 PARALLEL COMPUTING 3 0 0 3

Course Category:

Course Content:

UNIT 1 Principles of parallel algorithm design - decomposition techniques - mapping & scheduling computation – templates - Programming shared-address space systems - Cilk Plus – OpenMP- Pthreads

UNIT 2 Parallel computer architectures - shared memory systems and cache coherence - distributed- memory systems - interconnection networks and routing

UNIT 3 Programming scalable systems - message passing: MPI - global address space languages - Analytical modeling of program performance - speedup, efficiency, scalability, cost optimality, iso efficiency

UNIT 4 Collective communication – Synchronization - Non-numerical algorithms - Sorting, graphs, dynamic programming. Numerical algorithms - dense matrix algorithms, sparse matrix algorithms

UNIT 5 Performance measurement and analysis of parallel programs - GPU Programming- Problem solving on clusters using MapReduce - Warehouse-scale computing

Text book: 1. Introduction to Parallel Computing, Second Edition, AnanthGrama, George Karypis, Vipin Kumar, Anshul Gupta, Addison-Wesley, 2003, ISBN: 0201648652 (Recommended, but not required)

Reference Book: 1. Parallel Programming in C with MPI and OpenMP by M J Quinn 2. Introduction to Parallel Computing by AnanthGrama, George Karypis,Vipin Kumar, and Anshul Gupta. 3. Programming Massively Parallel Processors by D.Kirk and W. Hwu

106

COURSE CODE COURSE TITLE L T P C 1152IT120 Distributed Computing 3 0 0 3

a. Preamble : Data from various sources saved in different location in an distributed manner. Handling this distribution need incorporation of different technologies for transferring and receiving, saving and giving security etc. This course will give enough knowledge to handle such distributed data. b. Prerequisite Courses: Sl No Course Code Course Name 1 Operating System Computer Networks

c. Related Courses: Sl No Course Code Course Name 1 Project

d. Course Educational Objectives : Students undergoing this course are expected to: • To expose students to both the abstraction and details of file systems. • To introduce concepts related to distributed computing systems. • To focus on performance and flexibility issues related to systems design decisions. e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Describe the basics of Hardware Infrastructure? K2 CO2 Explain the concept of software architecture? K2 CO3 Explain the basic concepts of Distributed Systems? K2 CO4 Explain the various problems in Distributed database? K2

f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L

CO2 M L M

107

CO3 M M M

CO4 M M

g. Course Content :

UNIT I Hardware Infrastructure 9

Broad Band Transmission Facilities - Open Interconnection Standards - Local Area Networks - Wide Area Networks - Network Management - Network Security.

UNIT II Software Architectures 9

Client - Server Architectures - Intranets and Groupware - Hardware and Software for Intranet - Groupware and Features - Network as a Computer - The Internet - IP Addressing - Internet Security

UNIT III Operating System Issues 9 Distributed Operating Systems - Transparency - Inter-Process Communication - Client - Server Model - Group Communications - Threads - System Models - Process Synchronization

UNIT IV Fundamental Distributed Computing Aspects 9

Distributed Databases - Distribution Transparency - Distributed Database Design - Query Translation – Query Optimization -

UNIT V Managing Distributed Data 9

Concurrency Control - Object-Oriented Databases - Strategic Considerations - Applications of Object-oriented Databases – Features of Object-oriented Databases

Total : 45 Hours

k. Learning Resources i.Text Books : 1. SapeMullender, Distributed Systems, Addison-Wesley, 1993.

2. Albert Fleishman, Distributed Systems - Software Design & Implementation, Springer-Verlag, 1994.

ii.Reference:

1. MukeshSingal and Shivaratu N.G., Advanced Concepts in Operating Systems, McGraw Hill, Newyork 1994.

2. George Coulouris and Jean Dollimore, Distributed Systems - Concepts and Design, Addison- Wesley, 1988.

3. Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.

108

COURSE CODE COURSE TITLE L T P C JAVA DESIGN PATTERN 1152IT121 3 0 0 3

A. Preamble : This course introduces the students to 1. Understand and be able to apply incremental/iterative development 2. Understand common design patterns 3. Be able to identify appropriate design patterns for various problems 4. Be able to refactor poorly designed program by using appropriate design patterns.

B. Prerequisite Courses: Sl. No Course Code Course Name 1 1151IT106 Object Oriented Software Engineering

C. Related Courses:

Sl. No Course Code Course Name 1 1151IT104 Object Oriented Programming

D. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 To reason each object oriented design principle K1

CO2 Identifying what specific design problem the pattern solves K2

CO3 To draw class diagrams in each pattern K2 Provide specific context for each pattern in which it can be CO4 applied K2

E. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 L L H M CO2 L M H CO3 L L H CO4 L H

109

H- High; M-Medium; L-Low

F. Course Content :

UNIT I- CORE JAVA FUNDAMENTAL L-10 Introduction to Java Platform, Introduction to Java Virtual Machine (JVM), First Java Program, Principles of Inheritance & Polymorphism, Variables & Primitive Data Types, How to Design A Class?, Arrays, Basic IO Operation.

UNIT II- INTRODUCTION TO DESIGN PATTERNS L-8 What Is a Design Pattern?, Design Patterns in Smalltalk MVC, Describing Design Patterns, The Catalog of Design Patterns, Organizing the Catalog, How Design Patterns Solve Design Problems, How to Select a Design Pattern, How to Use a Design Pattern, UML Diagrams.

UNIT III- IT CREATIONAL PATTERNS L-8 Abstract Factory, Builder, Factory Method, Prototype, Singleton.

UNIT IV- IT STRUCTURAL PATTERN L-9 Singleton. Structural Pattern : Adapter, Bridge, Composite, Decorator, Façade, Flyweight, Proxy.

UNIT V- IT BEHAVIORAL PATTERNS L-8 Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento, Observer, State, Strategy, Template Method, Visitor. Total: 45 G. Learning Resources

i. TEXT BOOKS

1. Erich Gamma ,Helm,Johnson and Vlissides,‖Design Patterns-elements of Reusable Software , Pearson Education, 1995. 2. Herbert Schildt ,‖Complete Reference ―,Fifth Edition,The Mcgrawhill/Osberne,2002. ii. REFERENCE BOOKS

1. James W Cooper ,‖Java Design Patterns A Tutorial‖ Second Edition,Pearson Education,2007. 2. Mark Grand ,‖Pattern‘s in JAVA Vol-I‖ Wiley Dream Tech. iii .WEB REFERENCES

1. http://www.javatpoint.com/design-pattern-in-java

110

COURSE CODE COURSE TITLE L T P C 1152IT122 OPEN SOURCE COMPUTING 3 0 0 3

Course Category: Foundation (0) / Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7). a.Preamble Open Source Computing is to provide exposure in FOSS and to develop open source software for society. b.Prerequisite Courses: Unix Programming. c.Related Courses: Web technology d.Course Educational Objectives : The student should be made to:

 Be exposed to the context and operation of free and open source software (FOSS) communities and associated software projects.  Be familiar with participating in a FOSS project  Learn scripting language like Python or Perl  Learn programming language like Ruby  Learn some important FOSS tools and techniques e.Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Install and run open-source operating systems. K2 Gather information about Free and Open Source Software CO2 K2 projects from software releases and from sites on the internet. CO3Build modify one or more Free and Open Source Software packages. K1 Contribute software to and interact with Free and Open CO4 K2 Source Software development projects.

UNIT I PHILOSOPHY 9 Four degrees of freedom - FOSS Licensing Models - FOSS Licenses – GPL- AGPL- LGPL - FDL - Implications – FOSS examples-Open Source, Free Software, Free Software vs. Open Source software, Public Domain Software- History : BSD, The Free Software Foundation and the GNU Project.

UNIT II LINUX 9 Linux Installation and Hardware Configuration – Boot Process-The Linux Loader (LILO) - The Grand Unified Bootloader (GRUB) - Dual-Booting Linux and other Operating System - Boot- Time Kernel Options- X Windows System Configuration-System Administration – Backup and

111

Restore Procedures- Strategies for keeping a Secure Server.

UNIT III PROGRAMMING LANGUAGES 9 Programming using languages like Python , Perl , Ruby

UNIT IV PROGRAMMING TOOLS AND TECHNIQUES 9 Usage of design Tools like Argo UML or equivalent, Version Control Systems like Git or equivalent–Bug Tracking Systems- Package Management Systems

UNIT V FOSS CASE STUDIES 9 Open Source Software Development - Case Study – Libreoffice –Samba-Mozilla (Firefox), Wikipedia, Joomla, GCC, Open Office. TOTAL: 45 PERIODS

Learning Resources i. TEXT BOOKS

1.Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, ―Linux in a Nutshell‖, Sixth Edition, OReilly Media, 2009. ii.REFERENCES: 1. Philosophy of GNU URL: http://www.gnu.org/philosophy/. 2. Linux Administration URL: http://www.tldp.org/LDP/lame/LAME/linux-admin-made- easy/. 3. The Python Tutorial available at http://docs.python.org/2/tutorial/. 4. Perl Programming book at http://www.perl.org/books/beginning-perl/. 5. Ruby programming book at http://ruby-doc.com/docs/ProgrammingRuby/. 6. Version control system URL: http://git-scm.com/. 7. Samba: URL : http://www.samba.org/. 8. Libre office: http://www.libreoffice.org/.

112

COURSE CODE COURSE TITLE L T P C 1152IT123 USER INTERFACE DESIGN 3 0 0 3

a. Preamble User interface design (UI) or user interfaceengineering is the design of user interfacesfor machines and software, such as computers, home appliances, mobile devices, and other electronic devices, with the focus on maximizing the user experience. b. Prerequisite Courses: Computer graphics c. Related Courses: Web technology d. Course Educational Objectives : Students undergoing this course are expected:  Understanding logical and physical Interface.  Know about multimedia. e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Demonstrate the characteristics of graphic interface K2  CO2 Illustrate the various human computer interaction K2  CO3 Discuss the characteristics of windows K1  CO4 Explain the web creation using multimedia K2  CO5 Explain the layout structure of windows K1 f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M M CO3 M CO4 M CO5 M H- High; M-Medium; L-Low g. Course Content :

UNIT I INTRODUCTION

Human–Computer Interface – Characteristics Of Graphics Interface –Direct Manipulation Graphical System – Web User Interface –Popularity –Characteristic & Principles.

113

UNIT II HUMAN COMPUTER INTERACTION

User Interface Design Process – Obstacles –Usability –Human Characteristics In Design – Human Interaction Speed –Business Functions –Requirement Analysis – Direct –Indirect Methods – Basic Business Functions – Design Standards – System Timings –Human Consideration In Screen Design – Structures Of Menus – Functions Of Menus– Contents Of Menu– Formatting – Phrasing The Menu – Selecting Menu Choice– Navigating Menus– Graphical Menus.

UNIT III WINDOWS

Characteristics– Components– Presentation Styles– Types– Managements–Organizations– Operations– Web Systems– Device– Based Controls Characteristics– Screen – Based Controls – Operate Control – Text Boxes– Selection Control– Combination Control– Custom Control– Presentation Control.

UNIT IV MULTIMEDIA

Text For Web Pages – Effective Feedback– Guidance & Assistance– Internationalization– Accesssibility– Icons– Image– Multimedia – Coloring.

UNIT V WINDOWS LAYOUT– TEST

Prototypes – Kinds Of Tests – Retest – Information Search – Visualization – Hypermedia – WWW– Software Tools.

TOTAL: 45 periods h. Learning Resources i) TEXT BOOKS

1. Wilbent. O. Galitz ,―The Essential Guide To User Interface Design‖, John Wiley& Sons, 2001.

2. Ben Sheiderman, ―Design The User Interface‖, Pearson Education, 1998. ii) REFERENCE BOOK

1. Alan Cooper, ―The Essential Of User Interface Design‖, Wiley – Dream Tech Ltd., 2002.

i) Web Reference: www.usernomics.com/user-interface-design.html

114

COURSE CODE COURSE TITLE L T P C 1152IT124 ARTIFICIAL INTELLIGENCE 3 0 0 3

a. Preamble : Artificial intelligence (AI) is the intelligence exhibited by machines or software. It is also the name of the academic field of study which studies how to create computers and computer software that are capable of intelligent behavior b. Prerequisite Courses: Fuzzy logic,neural networks c. Related Courses: Robotics, soft computing d. Course Educational Objectives : Students undergoing this course are expected:  Realize the intelligent human behaviors on a computer.  AI is to make a computer that can learn, plan, and solve problems autonomously. e. Course Outcomes: Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) Use various symbolic knowledge representation to specify domains and reasoning tasks of a situated software CO1 K2 agent to solve a problem

Use different logical systems for inference over formal domain representations, and trace how a particular inference  CO2 K2 algorithm works on a givenproblem specification

Analyze a problem, and plan according to solve those  CO3 problems K2

 CO4 Discuss the uncertainity by using various models K2 Demonstrate learning from observation using various  CO5 K2 methods

f.Correlation of COs with POs :

115

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M CO3 M CO4 M CO5 M M H- High; M-Medium; L-Low g.Course Content :

UNIT I PROBLEM SOLVING

Introduction – Agents – Problem formulation – uninformed search strategies – heuristics– informed search strategies – constraint satisfaction

UNIT II LOGICAL REASONING Logical agents – propositional logic – inferences – first-order logic – inferences in firstorder logic – forward chaining – backward chaining – unification – resolution

UNIT III PLANNING Planning with state-space search – partial-order planning – planning graphs – planning and acting in the real world

UNIT IV UNCERTAIN KNOWLEDGE AND REASONING Uncertainty – review of probability - probabilistic Reasoning – Bayesian networks –inferences in Bayesian networks – Temporal models – Hidden Markov models

UNIT V LEARNING Learning from observation - Inductive learning – Decision trees – Explanation based learning – Statistical Learning methods - Reinforcement Learning

b. Learning resources

i.TEXT BOOK:

1. S. Russel and P. Norvig, ―Artificial Intelligence – A Modern Approach‖, Second Edition, Pearson Education, 2003. ii.REFERENCES: 1. David Poole, Alan Mackworth, Randy Goebel, ‖Computational Intelligence : a logical approach‖, Oxford University Press, 2004. 2. G. Luger, ―Artificial Intelligence: Structures and Strategies for complex problem solving‖, Fourth Edition, Pearson Education, 2002.

3. J. Nilsson, ―Artificial Intelligence: A new Synthesis‖, Elsevier Publishers, 1998.

iii. ONLINE RESOURCES http://www.annaunivedu.in/2012/09/cs2351-artificial-intelligence- syllabus.html#ixzz3awNdEdX2

116

COURSE CODE COURSE TITLE L T P C 1152IT125 Human Computer Interaction 3 0 0 3

Course Category:

Foundation (0) / Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7). a. Preamble Human-computer interaction, also known as Man-Machine Interaction, is a concept that emerged side by side with computers. If machines are not using by men then they are worthless. The method is traveled a long way by which human has been interacting with computers. The journey still continues and new designs of technologies and systems appear more and the research in this area has been growing very fast in the last some decades. HCI (human-computer interaction) is the study of how people interact with computers and to what extent computers are or are not developed for successful interaction with human beings. Software engineering focuses on the production of software application solutions, whereas HCI focuses on discovering methods and techniques that support people. HCI has expanded rapidly and steadily for three decades, attracting professionals from many other disciplines and incorporating diverse concepts and approaches. b. Prerequisite Courses:

Artificial Intelligence c. Related Courses:

User Interface Design Machine Learning

d. Course Educational Objectives: Students undergoing this course are expected to

o To learn the principles and fundamentals of human computer interaction (HCI). o To analyze HCI theories, as they relate to collaborative or social software. o To establish target users, functional requirements, and interface requirements for a given computer application. o To understand user interface design principles, and apply them to designing an interface. o To learn user interface designs through usability inspection and user models. o To know the applications of multimedia on HCI.

e. Course Outcomes :

117

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Interpret the contributions of human factors and technical CO1 K2 constraints on human-computer interaction. Evaluate the role of current HCI theories in the design of CO2 K3 software. CO3 Apply HCI techniques and methods to the design of software. K3 Categorize and carefully differentiate various aspects of CO4 K2 multimedia interfaces. CO5 Design and develop issues related to HCI for real application. K2

f. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L M CO2 M L M M CO3 M M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low

g. Course Content:

UNIT I : DESIGN PROCESS Humans – Information Process – Computer – Information Process – Differences and Similarities – Need for Interaction – Models – Ergonomics – Style – Context – Paradigms – Designing of Interactive Systems – Usability – Paradigm shift – Interaction Design Basics – Design Process – Scenarios – Users Need –Complexity of Design

UNITII DESIGN AND EVALUATION OF INTERACTIVE SYSTEMS Software Process – Usability Engineering – Issue based Information Systems – Iterative Design Practices – Design Rules – Maximum Usability – Principles – Standards and Guidelines – Design Patterns – Programming Tools – Windowing Systems – Interaction Tool Kit – User Interface Management System – Evaluation Techniques – Evaluation Design – Evaluating Implementations – Observational Methods.

UNITIII MODELS Universal Design Principles – Multimodal Systems – User Support – Presentation and Implementation Issues – Types – Requirements – Approaches – Cognitive Model – Hierarchical Model – Linguistic Model – Physical and Device Models – Socio technical Models – Communication and Collaboration Models – Task Models – Task Analysis And Design.

118

UNIT IV EXPERIMENTAL DESIGN AND STATISTICAL ANALYSIS OF HCI Basic Design Structure – Single Independent Variable – Multiple Independent Variable – Factorial Design – Split-Plot Design – Random Errors – Experimental Procedure – Statistical Analysis – T Tests – Analysis of Variance Test – Regression – Chi-Square Test – Survey – Probabilistic Sampling – Non-Probabilistic Sampling – Developing Survey Questions.

UNIT V THEORIES

Dialogue Notations and Design – Dialogue Need – Dialogue Design Notations – Graphical – Textual - Representing Dialogue – Formal Descriptions – Dialogue Analysis – System Models – Interaction Models – Relationship with Dialogue – Formalisms – Formal Notations – Interstitial Behavior – Virtual Reality – Modeling Rich Interaction – Status Event Analysis – Properties – Rich Contexts – Sensor-based Systems – Groupware – Applications – Ubiquitous Computing – Virtual Reality h. Learning Resources i. TEXTBOOK :

1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, ―Human Computer Interaction‖, Third Edition, Prentice Hall, 2004. ii. REFERENCES: 1. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, ―Research Methods in Human- Computer Interaction‖, Wiley, 2010. 2. Ben Shneiderman and Catherine Plaisant, ―Designing the User Interface: Strategies for Effective Human-Computer Interaction‖, Fifth Edition, Addison-Wesley Publishing Co, 2009. iii. Online resources

1.http://www.cs.cmu.edu/~bam/uicourse/special/ 2.http://www.dcs.gla.ac.uk/~johnson/teaching/isd/course.html 3.http://en.wikibooks.org/wiki/Models_and_Theories_in_Human-Computer_Interaction 4.http://www.upf.edu/hipertextnet/en/numero-11/experiments_users.html 5.https://www.ischool.utexas.edu/~adillon/BookChapters/User%20acceptance.htm

119

COURSE CODE COURSE TITLE L T P C 1152IT126 COMPONENT BASED TECHNOLOGY 3 0 0 3 Course Category: Foundation (0)/ Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7)

a. Preamble : This course Component Based Technology provides an introduction and Basic Concepts of Various Platform Component Based Technology b. Prerequisite Courses: Sl. No Course Code Course Name 1 1151CS104 JAVA PROGRAMMING 2 1151CS305 INTERNET PROGRAMMING c. Related Courses: Sl. No Course Code Course Name 1 MINI PROJECT 2 PROJECT WORK

d. Course Educational Objectives : Students are exposed to:

• Introduces in depth JAVA, CORBA and .Net Components • Deals with Fundamental properties of components, technology and architecture and middleware. • Component Frameworks and Development are covered in depth. e. Course Outcomes: Upon the successful completion of the course, learners will be able to Level of learning domain CO Course Outcomes (Based on revised Nos. Bloom’s taxonomy) CO1 Explain Component Based Architecture K2 CO2 Design a Java Thread and Create a bean for a Application K2 CO3 Design and Implement CORBA Based Technology K3 Component CO4 Design and Implement .NET Based Technology K3 Component CO5 Explain about Component Based connectors and testing K2 Tools

f. Correlation of COs with Programme outcomes:

120

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

CO1 H H L

CO2 M

CO3 H H H L

CO4 H H H M

CO5 H H M M

g. Course Content: UNIT I INTRODUCTION 9 Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture –components and middleware

UNIT II JAVA BASED COMPONENT TECHNOLOGIES 9 Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP

UNIT III CORBA COMPONENT TECHNOLOGIES 9 Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture

UNIT IV . NET BASED COMPONENT TECHNOLOGIES 9 COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting

UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 9 Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools TOTAL : 45 h. Learning Resources i. Text Books 1. Clemens Szyperski, ―Component Software: Beyond Object-Oriented Programming‖, Pearson Education publishers, 2013 ii. REFERENCES 1. Ed Roman, ―Mastering Enterprise Java Beans‖, John Wiley & Sons Inc., 2012. 2. Mowbray, ―Inside CORBA‖, Pearson Education, 2013. 3. Freeze, ―Visual Basic Development Guide for COM & COM+‖, BPB Publication, 2011.

121

COURSE CODE COURSE TITLE L T P C 1152IT127 KNOWLEDGE BASED DECISION SUPPORT 1 2 2 3 SYSTEM Course Category: Foundation (0)/ Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7)

a. Preamble : There has been a radical shift in the management parlance. Organizations can use Intranets and Internets to analyze various aspects about the performance and predict the future. This course aims at exposing the student to one of the important applications of the computer. b. Prerequisite Courses: Sl. No Course Code Course Name 1 Database Management System c. Related Courses: Sl. No Course Code Course Name 1 Data Mining and data warehousing d. Course Educational Objectives : Learners are exposed to • Development of support system

• Methods of managing knowledge • Intelligent decision system development e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO Course Outcomes (Based on revised No’s Bloom’s Taxonomy) CO1 Program conversational case-based reasoners. K2 CO2 Discuss encoding knowledge bases for decision support K2

CO3 Discuss programming help-desk systems K2

Differentiate knowledge representation formalism based on K3 CO4 the target domain

Explain wide range of applications for decision support K3 CO5 Technologies f. Correlation of COs with POs :

122

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M CO3 M CO4 M CO5 M CO6 H M M M M CO7 M H- High; M-Medium; L-Low g. Course Content: Unit 1 Decision Making and computerized support: Management support systems. Decision making systems modeling- support.

Unit 2 Decision Making Systems – Modeling and Analysis – Business Intelligence – Data Warehousing, Data Acquisition - Data Mining. Business Analysis – Visualization - Decision Support System Development.

Unit 3 Collaboration, Communicate Enterprise Decision Support System & Knowledge management – Collaboration Com Technologies Enterprise information system – knowledge management.

Unit 4 Intelligent Support Systems – AI & Expert Systems – Knowledge based Systems – Knowledge Acquisition , Representation & Reasoning, Advanced intelligence system – Intelligence System over internet.

Unit 5 Implementing MSS in the E-Business ERA – Electronic Commerce – integration, Impacts and the future management support systems. j. Learning Resources i.Text Books: 1. Decision Support Systems & Intelligent Systems – Seventh edition Efraim Turban & Jay E. Aronson Ting-Peng Liang - Pearson/prentice Hall 2. Decision support Systems – Second Edition – George M Marakas - Pearson/prentice Hall. ii.Reference Books: Decision Support Systems – V.S. Janakiraman & K. Sarukesi Decision Support systems and Data warehouse Systems by Efrem G Mallach- Mc Graw Hill iii Online resources 1. http://nptel.ac.in/courses/105108081/module9/lecture39/lecture.pdf 2. http://lecture-notes-forstudents.blogspot.in/2010/04/knowledge-based-decision-support- system_03.html

123

COURSE CODE COURSE TITLE L T P C 1152IT128 Computer Vision 3 0 0 3

a. Preamble : How can computers understand the visual world of humans? This course treats vision as a process of inference from noisy and uncertain data and emphasizes probabilistic, statistical, data-driven approaches. Topics include image processing; segmentation, grouping, and boundary detection; recognition and detection; motion estimation and structure from motion. b. Prerequisite Courses:

Sl. No Course Code Course Name 1 Image Processing c. Related Courses:

Sl. No Course Code Course Name 1 Computer Graphics and Image Processing

d. Course Educational Objectives : • To review image processing techniques for computer vision • To teach mathematical concepts and techniques • To solve real vision problems • To understand shape and region analysis • To understand Hough Transform and its applications to detect lines, circles, ellipses • To understand three-dimensional image analysis techniques • To understand motion analysis • To study some applications of computer vision algorithms

e. Course Outcomes : Upon Completion of the course, the students will be able to

• Implement fundamental image processing techniques required for computer vision • perform shape analysis • implement boundary tracking techniques • apply chain codes and other region descriptors • apply Hough Transform for line, circle, and ellipse detections • apply 3D vision techniques

124

• implement motion related techniques • develop applications using computer vision techniques

125 i. Correlation of COs with Program Outcomes Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L CO4 M M M L H CO5 M L M L

H- High; M-Medium; L-Low

g. Course Content:

UNIT I IMAGE PROCESSING FOUNDATIONS 9 Geometric Camera Models - Geometric Camera Calibration - Radiometry - Measuring Light – Shadows and shading - Color - Review of image processing techniques –classical filtering operations –thresholding techniques –edge detection techniques –corner and interest point detection –mathematical morphology –texture

UNIT II SHAPES AND REGIONS 9 Binary shape analysis – connectedness –object labeling and counting –size filtering –distance functions –skeletons and thinning –deformable shape analysis –boundary tracking procedures– active contours –shape models and shape recognition –centroidal profiles –handling occlusion – boundary length measures –boundary descriptors –chain codes –Fourier descriptors–region descriptors –moments

UNIT III HOUGH TRANSFORM 9 Line detection –Hough Transform (HT) for line detection –foot-of-normal method –line localization –line fitting –RANSAC for straight line detection –HT based circular object detection –accurate center location –speed problem –ellipse detection –Case study: Human Iris location –hole detection –generalized Hough Transform –spatial matched filtering –GHT for ellipse detection –object location –GHT for feature collation

UNIT IV 3D VISION AND MOTION 9 Methods for 3D vision –projection schemes –shape from shading –photometric stereo –shape from texture –shape from focus –active range finding –surface representations –point-based representation –volumetric representations –3D object recognition –3D reconstruction – introduction to motion –triangulation –bundle adjustment –translational alignment –parametric motion –spline-based motion –optical flow –layered motion

UNIT V APPLICATIONS 9 Application: Photo album –Face detection –Face recognition –Eigen faces –Active appearance and 3D shape models of faces Application: Surveillance –foreground- background separation – particle filters –Chamfer matching, tracking, and occlusion –combining views from multiple cameras –human gait analysis Application: In-vehicle vision system: locating roadway –road markings –identifying road signs –locating pedestrians

126 e. Learning Resources Text Books: • E. R. Davies, ―Computer & Machine Vision‖, Fourth Edition, Academic Press, 2012. • R. Szeliski, ―Computer Vision: Algorithms and Applications‖, Springer 2011. • Simon J. D. Prince, ―Computer Vision: Models, Learning, and Inference‖, Cambridge University Press, 2012. • Mark Nixon and Alberto S. Aquado, ―Feature Extraction & Image Processing for Computer Vision‖, Third Edition, Academic Press, 2012.

ii. Reference Books:

1. D. L. Baggio et al., ―Mastering OpenCV with Practical Computer Vision Projects‖, Packt Publishing, 2012. 2. Jan Erik Solem, ―Programming Computer Vision with Python: Tools and algorithms for analyzing images‖, O'Reilly Media, 2012. 3. Forsyth D A and Ponce J Computer Vision : A Modern Approach– Prentice Hall 2003 4. Horn B K P Robot Vision Cambridge MIT press 1986. 5. Haralick R M And Shapiro L G Computer And Robot Vision Vo I and II Addison Wesley 1993 6. Jain R C Kasturi R Machine Vision McGrawHill 1995

iii. Online Resources: 1. http://kercd.free.fr/linksKCD.html 2. http://www.cs.ubc.ca/spider/lowe/vision.html 3. http://www.teiath.gr/seyp/optics/Vision.htm 4. http://www.visionscience.com/

165

COURSE CODE COURSE TITLE L T P C

1152IT129 Computer Graphics 3 0 0 3

 Engineering Mathematics – I  Engineering Mathematics – II  Problem Solving Using C

c. Related Courses:

 Multimedia Computing  Digital Image Processing.

d. Course Educational Objectives:

Students undergoing this course are exposed to

 Identify and explain the core concepts of computer graphics.  Apply graphics programming techniques to design, and create computer graphics scenes.

 To learn the basic principles of 3-dimensional computer graphics. Thus, the student will study the elementary mathematics techniques that allow them to position objects in three dimensional spaces.

e. Course Outcomes:

Upon the successful completion of the course, students will be able to:

Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Design 2D and 3D models K2,S3

166

Generate algorithms for ellipse, points and curves CO2 K2,S3

CO3 Modeling of 3D objects K2,S3

CO4 Knowledge on how to detect edges and surfaces K2,S3

CO5 Design various color models K2,S3

f. Correlation of COs with POs : Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M M L CO2 M M L CO3 M M L CO4 M M L CO5 M M L H- High; M-Medium; L-Low g. Course Content:

UNIT I L- 9

Introduction – Overview of Graphics system – Output primitives – Points and Lines – Line, Circle, Ellipse-Generating algorithms – Other Curves – Parallel curve algorithms – Curve functions – Pixel addressing – Filled area primitives – Fill area functions – Cell array – Character generation.

UNIT II L- 9

Attributes of output primitives – Line attributes – Curve attributes – Color and grayscale levels – Area fill attributes – Character attributes – Bundled attributes – Inquiry functions – Antialiasing – Two Dimensional geometric Transformation – Two Dimensional viewing – Two Dimensional viewing functions – Clipping.

UNIT III L- 9

Three Dimensional Concepts – Display methods – Three Dimensional Object representations – Three Dimensional geometric and modeling transformation – Three Dimensional Viewing – 3D and greater than 3D transformation.

UNIT IV L- 9

Visible surface Detection methods – Classification of algorithms – Backface detection – Depth- Buffer, Scan line, Depth-sorting, BSP-tree, Area-subdivision and other methods – Illumination models and surface – Rendering methods – Basic models – Displaying light intensities – Halftone patterns and dithering techniques – Polygon-rendering methods – Ray-Tracing – Radiosity lighting models – Environment mapping – Adding surface details.

UNIT V L- 9

167

Color Models and Color applications – Properties of Light – Standard primitives – Intutive color concepts – RGB, YIQ, CMY, HSV Color Models – Conversion – HLS colos model – Computer animation.

TOTAL: 45 periods k. Learning Resources i.Text Books :

Donald Hearn and M.Pauline Baker, ―Computer Graphics C Version‖, Pearson Education, 2003.

ii.Reference:  Foley, Vandam, Feiner, Huges, ―Computer Graphics: Principles & Practice‖, Pearson Education, second edition 2003.  Digital Animation Bible – AVGERAKIF, Tata McGraw Hill. iii. Online resources

1. www.graphics.cornell.edu/online/tutorial/ 2. www.cs.wellesley.edu/~cs110/lectures/M01-color/graphics.pdf 3. http://www.opengl.org/resources/libraries/glut/ 4. http://www.xmission.com/~nate/glut.html

168

COURSE CODE COURSE TITLE L T P C 1152IT130 MACHINE LEARNING 3 0 0 3

a.Preamble : This course is a branch of computing science that deals with the specification, design and implementation of machine learning models, such systems designed to be responsive to the needs of their end-users.

b. pre-requisite:

Data Warehousing and Mining c. Related Courses:  Project Work

d.COURSE EDUCATIONAL OBJECTIVES

 To understand the concepts of machine learning

 To appreciate supervised and unsupervised learning and their applications

 To understand the theoretical and practical aspects of Probabilistic Graphical Models

 To appreciate the concepts and algorithms of reinforcement learning

 To learn aspects of computational learning theory e. Course Outcomes: Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) To implement a neural network for an application of your CO1 choice using an available tool K2,S3

To implement probabilistic discriminative and generative K2,S3 CO2 algorithms for an application of your choice and analyze the results

CO3 To use a tool to implement typical clustering algorithms for K2,S3

169

different types of applications

To design and implement an HMM for a sequence model type K2,S3 CO4 of application

To identify applications suitable for different types of machine K2,S3 CO5 learning with suitable justification.

UNIT I INTRODUCTION

Machine Learning - Machine Learning Foundations –Overview – applications - Types of machine learning - basic concepts in machine learning Examples of Machine Learning -Applications - Linear Models for Regression - Linear Basis Function Models - The Bias-Variance Decomposition - Bayesian Linear Regression - Bayesian Model Comparison

UNIT II SUPERVISED LEARNING

Linear Models for Classification - Discriminant Functions -Probabilistic Generative Models - Probabilistic Discriminative Models - Bayesian Logistic Regression. Decision Trees - Classification Trees- Neural Networks -Feed-forward Network Functions - Ensemble methods- Bagging- Boosting.

UNIT III UNSUPERVISED LEARNING

Clustering- K-means - The EM Algorithm in General -Model selection for latent variable models - high-dimensional spaces -- The Curse of Dimensionality -Dimensionality Reduction - Factor analysis - Principal Component Analysis - Probabilistic PCA.

UNIT IV PROBABILISTIC GRAPHICAL MODELS

Directed Graphical Models - Bayesian Networks - Exploiting Independence Properties - From Distributions to Graphs -Examples -Markov Random Fields - Inference in Graphical Models - Learning –Naive Bayes classifiers-Markov Models – Hidden Markov Models

UNIT V ADVANCED LEARNING

Sampling – Basic sampling methods – Reinforcement Learning- K-Armed BanditElements - Model- Based Learning- Value Iteration- Policy Iteration. Temporal Difference Learning.

TOTAL: 45 Periods h.Learning Resources i.Text Books : 1.Tom Mitchell, "Machine Learning", McGraw-Hill, 1997

2. Kevin P. Murphy, ―Machine Learning: A Probabilistic Perspective‖, MIT Press, 2012 ii.REFERENCES:

1. Christopher Bishop, ―Pattern Recognition and Machine Learning‖ Springer, 2006

170

COURSE CODE COURSE TITLE L T P C 1152IT301 GRAPHICS LAB 0 0 2 1

a.Preamble : This course Graphics lab, programs will be implemented based on lab syllabus; All experiments are executed in Turbo Compiler.

b. pre-requisite:

 Basic concept of C Programming lab c. Related Courses:  Project Work d. COURSE EDUCATIONAL OBJECTIVES

 To practice the graphics techniques and algorithms.  To enable the students to develop their creativity  To differentiate the 2D and 3D aspects in practical. e. Course Outcomes: Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) Able to acquire a background in descriptive geometry, CO1 K2,S3 orthographic Dimensions Able to understand point line and plane relationships in K2,S3 projection; multi-view engineering drawings; auxiliary and CO2 section views.

To Design basic dimensioning; engineering applications. CO3 K2,S3 To analyze and implement isometric projection, engineering K2,S3 CO4 drawing techniques.

To understand and implement computer-aided engineering K2,S3 CO5 graphics and zooming effects.

f. Correlation of COs with POs : Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M M L CO2 M M L CO3 M M L CO4 M M L

171

CO5 M M L H- High; M-Medium; L-Low

g. Course Content LIST OF EXPERIMENTS:

1) To implement output primitives.

2) To implement Bresenham‘s algorithms for line, circle and ellipse drawing.

3) To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.

4) To implement Cohen-Sutherland 2D clipping and window-viewport mapping.

5) To perform 3D and greater than 3D Transformations such as translation, rotation and scaling.

6) To visualize projections of 3D and greater than 3D images.

7) To convert between color models.

8) To perform animation using any Animation software.

9) To implement the Zooming effect.

10) Generating Fractal images

h.Learning Resources i.Text Books :

1. Donald Hearn and M.Pauline Baker, ―Computer Graphics C Version‖, Pearson Education, 2003.

ii.Reference:

1.Foley, Vandam, Feiner, Huges, ―Computer Graphics: Principles & Practice‖. 2.Digital Animation Bible – AVGERAKIF, Tata McGraw Hill. iii. Online resources

1.www.graphics.cornell.edu/online/tutorial/ 2.www.cs.wellesley.edu/~cs110/lectures/M01-color/graphics.pdf

172

COURSE CODE COURSE TITLE L T P C 1152IT131 SOFTWARE QUALITY ASSURANCE 3 0 0 3 Course Category: Foundation (0)/ Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7)

a. Preamble : This course covers the principles of software development emphasizing processes and activities of quality assurance.

b. Prerequisite: Sl. No Course Code Course Name 1 Software Engineering 2 Software Testing

c. Link to other Course: Sl. No Course Code Course Name 1 Minor Project 2 Major Project

d. Course Educational Objectives:  This course introduces concepts, metrics, and models in software quality assurance.  The course covers components of software quality assurance systems before, during, and after software development.  It presents a framework for software quality assurance and discusses individual components in the framework such as planning, reviews, testing, configuration management, and so on. e. Course Outcomes: Upon the successful completion of the course, learners will be able to CO Course Outcomes Level of learning domain Nos (Based on revised Bloom’s taxonomy) C01 Relate Quality Assurance Plan K2  C02 Understand how to conduct formal inspections, record K3 and evaluate results of inspection  C03 Apply quality tools and technique in their projects K3  C04 Establish software development with quality plan K3  C05 Explain about standard and certification K2 K2 – Understand, K3 - Apply f. Correlation of COs with Programme Outcomes: COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M L M CO3 M M L M CO4 M L M CO5 M H- High; M-Medium; L-Low

173

g. Course Content:

UNIT I FUNDAMENTALS OF SOFTWARE QUALITY ASSURANCE 9 The Role of SQA – SQA Plan – SQA considerations – SQA people – Quality Management – Software Configuration Management

UNIT II MANAGING SOFTWARE QUALITY 9 Managing Software Organizations – Managing Software Quality – Defect Prevention – Software Quality Assurance Management

UNIT III SOFTWARE QUALITY ASSURANCE METRICS 9 Software Quality – Total Quality Management (TQM) – Quality Metrics – Software Quality Metrics Analysis

UNIT IV SOFTWARE QUALITY PROGRAM 9 Software Quality Program Concepts – Establishment of a Software Quality Program – Software Quality Assurance Planning – An Overview – Purpose & Scope.

UNIT V SOFTWARE QUALITY ASSURANCE STANDARDIZATION 9 Software Standards–ISO 9000 Quality System Standards - Capability Maturity Model and the Role of SQA in Software Development Maturity – SEI CMM Level 5 – Comparison of ISO 9000 Model with SEI‘s CMM TOTAL: 45 periods h. Learning Resources i. Text Books 1. Mordechai Ben-Menachem / Garry S Marliss, ―Software Quality‖, Vikas Publishing House, Pvt, Ltd., New Delhi. 2. Watts S Humphrey, ―Managing the Software Process‖, Pearson Education Inc. ii. Reference Books 1. Gordon G Schulmeyer, ―Handbook of Software Quality Assurance‖, Third Edition, Artech House Publishers 2007 2. Nina S Godbole, ―Software Quality Assurance: Principles and Practice‖, Alpha Science International, Ltd, 2004 iii. Online References

1. www.ou.ac.lk/science/.../277-cpu3147-software-quality-assurance 2. www.site.uottawa.ca/~awilliam/seg3203/May02.ppt 3. www.slideshare.net/.../sdpm-lecture-8-software-quality-assurance 4. ceng482.cankaya.edu.tr/.../CENG%20482_W1_publish_RLSD.pdf

174

COURSE CODE COURSE TITLE L T P C 1152IT132 Software testing 3 0 0 3

a. Preamble : Software testing is an investigation conducted to provide stakeholders with information about the quality of the product or service under test. Software testing can also provide an objective, independent view of the software to allow the business to appreciate and understand the risks of software implementation. Test techniques include the process of executing a program or application with the intent of finding software bugs (errors or other defects). b. Prerequisite Courses: Software engineering c. Related Courses: Software engineering and project management. d. Course Educational Objectives : Students undergoing this course are expected:

 Ability to apply software testing knowledge and engineering methods.  Have an ability to design and conduct a software test process for a software testing project.  To identify the needs of software test automation, and define and develop a test tool to support test automation.(c)  Identify various software testing problems, and solve these problems by designing and selecting software test models, criteria, strategies, and methods.

e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) Illustrate the concepts in software testing, including software CO1 K2 testing objectives, process, criteria, strategies, and methods

 CO2 Demonstrate software test automation problems and solutions K2

Explain the quality measurement of software using software  CO3 K2 metrics  CO4 Discuss the various models for software quality assurance K2  CO5 Illustrate the various testing projects K2

175 f. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M CO3 M CO4 M CO5 M M …. …. …. H- High; M-Medium; L-Low g.Course Content :

UNIT I TESTING FUNDAMENTALS:

Principles of testing- Software development life cycle models-Types of testing- White box testing- Black box testing- Integration Testing –System and acceptance testing- Performance testing - Regression testing – Internalization testing – Ad hoc testing – Testing of object oriented systems – Usability and accessibility testing.

UNIT II TEST MANAGEMENT AND AUTOMATION: Introduction – Test Planning – Test Management –Software test automation – Scope of automation – Test automation tools – Generic requirement for test tool/framework – Selecting a test tool – Challenges in automation.

UNIT III SOFTWARE QUALITY METRICS: Software Measurement and Metrics – Measurement Theory – Software quality metrics – Product quality metrics – Software maintenance metrics – Collecting software engineering data.

UNIT IV SOFTWARE QUALITY ASSURANCE: Software quality in business context – Planning for software quality assurance – Product quality and process quality – Software process models – ISO – Capability Maturity Model – CMMi – People CMM – Test Maturity Model.

UNIT V TESTING PROJECTS: Managing Testing projects and groups – Legal consequences of defective software – Managing a testing group – Role of testing group.

TOTAL: 45 periods

h. Learning Resources

i.References:

1. Gopalswamy Ramesh and Srinivasan Desikan, ―Software Testing: Principles and Practices‖, Pearson Education, New Delhi, 2006. 2. Nina S Godbole, ―Software Quality Assurance: Principles and Practice‖, Narosa Publishers, New Delhi, 2004. 3. Glenford J Myers, Corey Sandler, Tom Badgett and Todd M Thomas, ―The Art of Software Testing‖, Wiley, USA, 2004. 4. Ilene Burnstein, ―Practical Software Testing‖, Springer – Verlag, New Delhi, 2003. 176

COURSE CODE COURSE TITLE L T P C

1152IT133 IT INFRASTRUCTURE MANAGEMENT 3 0 0 3

Course Category:

a.Preamble:

In the current competitive world, business enterprises face great challenges in scaling and managing their IT infrastructure. To handle these challenges, IT infrastructure management offers focused and efficient solutions in important infrastructure areas for developing and managing the organizational IT infrastructure. Business organizations can achieve cost- effective and quick time-to-delivery by using proven delivery models, mature techniques, standardized tools and robust processes offered by IT infrastructure management. IT infrastructure management guarantees high reliability, round-the-clock availability of services, efficient manageability and optimum scalability. IT infrastructure service delivery helps in achieving proactive and cost-effective solutions and gaining fast return on IT infrastructure investments.

b. Prerequisite Courses:

Fundamentals of IT c. Related Courses:

 Cloud storage  Information techniques

d. Course Educational Objectives:

Students undergoing this course are expected To introduce basic postulates of IT Infrastructure Management and shows the correlation between system and service management process. To understand the strategic methods in Service Delivery Process & Service Support Process using different management trends. Able to Know the Storage and database Management in Information Technology. Able to know the Security Management in IT. To provide detailed knowledge of IT recent trends in globally.

e. Course Outcomes:

Upon the successful completion of the course, students will be able to: Knowledge Level (Based CO Course Outcomes on revised Bloom‘s Nos. Taxonomy) CO1 Acquire knowledge of IT Infrastructure and management . K1

177

Apply Service Delivery and Service Support Process in IT CO2 infrastructure management. K3

CO3 Discuss about various storage levels in IT. K2

CO4 Discuss various security techniques in information technology K2 Develop a new communication mechanism based on emerging CO5 trends in information technology. K3

f. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M M CO2 M CO3 M M M CO4 M M M CO5 M M M M

H- High; M-Medium; L-Low

g. Course Content :

UNIT-I INTRODUCTION & IT INFRASTRUCTURE 9

Information Technology , IT Infrastrudure Management ,Introduction—IT Infrastructure Management ,Challenges in IT Infrastructure Management ,Design Issues of IT Organisations and IT Infrastructure ,Determining Customers' Requirements , IT Systems Management Process ,IT Service Management Process,Information System Design Process ,

UNIT-II SERVICE DELIVERY PROCESS & SERVICE SUPPORT PROCESS 9

Service Level Management ,Financial Management ,IT Service Continuity Management ,Capacity Management ,Availability Management, Configuration Management ,Incident Management ,Problem Management ,Change Management

UNIT-III STORAGE MANAGEMENT 9

Introduction to Storage ,Backup and Storage ,Archive ,Retrieve ,Disaster Recovery ,Space Management ,Database and Application Protection ,Bare Machine Recovery (BMR) ,Data Retention,

UNIT-IV SECURITY MANAGEMENT & IT ETHICS 9

178

Computer Security ,Internet Security ,Physical Security ,Identity Management ,Access Control System ,Intrusion Detection, Intellectual Property ,Privacy and Law ,Computer Forensics ,

UNIT-V EMERGING TRENDS IN IT 9

Introduction , Electronic Data Interchange ,Global System for Mobile Communication (GSM) ,Bluetooth ,Infrared Technology

h. Learning resources:-

ii) TEXT BOOKS:

1. Gupta, ―It Infrastructure & Its Management ‖,First Edition , Tata McGraw-Hill Educatio Education.

179

COURSE CODE COURSE TITLE L T P C 1152IT134 Semantic Web 3 0 0 3

Course Category:

Foundation (0) / Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7). a.Preamble The Semantic Web is an extension of the Web through standards by the World Wide Web Consortium (W3C) The standards promote common data formats and exchange protocols on the Web, most fundamentally the Resource Description Framework (RDF).According to the W3C, "The Semantic Web provides a common framework that allows data to be shared and reused across application, enterprise, and community boundaries". The term was coined by Tim Berners-Lee for a web of data that can be processed by machines. While its critics have questioned its feasibility, proponents argue that applications in industry, biology and human sciences research have already proven the validity of the original concept. b. Prerequisite Courses:

Database management system c. Related Courses:

Data mining d. Course Educational Objectives :

Students undergoing this course are expected to

1. To understand the concepts of Semantic Web. 2. To understand the characteristics of the agents. 3. To understand design and implementation of Agents. 4. To understand the implementation described in the architecture level. e. Course Outcomes :

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy)

CO1 Discuss about basic of semantic web and search engine K1

180

 CO2 Explain RDFS and its process K2

 CO3 Explain owl and its operation K2

 CO4 Explain semantic issue and prototype system K2

 CO5 Explain various semantic web services and its design K2

f. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low

g. Course Content :

UNIT I - INTRODUCTION

The world of the semantic web-WWW-meta data-Search engine-Search engine for traditional web- Semantic web-Search engine for semantic web-Traditional web to semantic web.

UNIT II - SEMANTIC WEB TECHNOLOGY

RDF-Rules of RDF-Aggregation-Distributed information-RDFS-core elements of RDFS-Ontology- Taxonomy-Inferencing based on RDF schema

UNIT III - OWL

OWL-Using OWL to define classes-Set operators-Enumerations-Define propertiesontology matching-Three faces of OWL-Validate OWL.

UNIT IV- SWOOGLE

Swoogle-FOAF-Semantic markup-Issues-prototype system-Design of Semantic web search engine- Discovery and indexation-prototype system-case study.

UNIT V - SEMANTIC WEB SERVICES

Semantic web services-OWL-S-Upper ontology-WSDL-S,OWL-S to UDDI mapping ,Design of the search engine,implementations.

Total: 45 181

h. Learning Resources i.Text Books : 1. Liyang Yu , ―Introduction to the Semantic Web and Semantic web services‖ Chapman & Hall/CRC, Taylor & Francis group, 2007. ii.Reference: 1.Johan Hjelm, ―Creating the Semantic Web with RDF―, Wiley,2001 2. Grigoris Antoniou and Frank van Harmelen, ―A Semantic Web Primer‖, MIT Press, 2012. iii. Online resources 1.http://www.w3.org/standards/semanticweb/ 2. http://www.w3.org/2001/sw/ 3. http://semanticweb.org/wiki/Main_Page

182

COURSE CODE COURSE TITLE L T P C 1152IT135 SERVICE ORIENTED ARCHITECTURE 3 0 0 3

a. Preamble : Service Oriented Architecture provides an introduction to the basic concepts of SOA, Xml &Web Services, and WSDL Basics.

b. Prerequisite Courses:

Web service

c. Related Courses:

 Network Programming  Web Programming and XML Services Lab

d. Course Educational Objectives :

Learners are exposed to  To provide fundamental concepts of Service Oriented Architecture..  To gain knowledge about SOAP, UDDI and XML to create web services.  To know about the Cloud Computing architecture and services.

e. Course Outcomes : Upon the successful completion of the course, students will be able to: Knowledge Level CO (Based on revised Course Outcomes No’s Bloom’s Taxonomy) Describe about the basic principles of service oriented architecture CO1 K2 , its components and techniques  CO2 Illustrate the architecture of web services K2  CO3 Design and develop web services using protocol K3  CO4 Enumerate technology underlying the service design K2  CO5 Study about various WS-* specification standards K2

f. Correlation of COs with POs : Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M

183

CO2 M CO3 M CO4 H M M M M H CO5 M H- High; M-Medium; L-Low g. Course Content:

UNIT I SOA BASICS 9 Roots of SOA – Characteristics of SOA - Comparing SOA to client-server and distributed internet architectures – Anatomy of SOA- How components in an SOA interrelate - Principles of service orientation . UNIT II XML AND WEB SERVICES 9 XML structure – Elements – Creating Well-formed XML - Name Spaces – Schema Elements, Types, Attributes – XSL Transformations – Parser – Web Services Overview – Architecture. UNIT III WSDL, SOAP and UDDI 9 WSDL - Overview Of SOAP – HTTP – XML-RPC – SOAP: Protocol – Message Structure – Intermediaries – Actors – Design Patterns And Faults – SOAP With Attachments – UDDI. UNIT IV SOA in J2EE and .NET 9 SOA platform basics – SOA support in J2EE – Java API for XML-based web services (JAX-WS) - Java architecture for XML binding (JAXB) – Java API for XML Registries (JAXR) - Java API for XML based RPC (JAX-RPC) – JAX-RS SOA support in .NET – ASP.NET web services. UNIT V WEBSERV ICE SPECIFICATION STANDARDS 9 WS-BPEL basics – WS-Coordination overview - WS-Choreography, WS-Policy, WSSecurity Total:45 h. Learning Resources

i.Text Books :

1. Thomas Erl, ―Service-Oriented Architecture: Concepts, Technology, and Design‖, Pearson Education, 2006. 2. Heather Williamson, ―XML, The Complete Reference‖, McGraw Hill Education, 2012. 3. Frank. P. Coyle, ―XML, Web Services And The Data Revolution‖, Pearson Education, 2002. ii.Reference:

1. Sandeep Chatterjee, James Webber, ―Developing Enterprise Web Services. An Architect‘s Guide‖, Pearson Education, 2005. 2. Newcomer, Lomow, ―Understanding SOA with Web Services‖, Pearson Education, 2005. 3. Dan woods and Thomas Mattern, ―Enterprise SOA designing IT for Business Innovation‖, O‘REILLY, First Edition, 2006.

184

COURSE CODE COURSE TITLE L T P C 1152IT136 Bioinformatics 3 0 0 3

Course Category:

a. Preamble: It aims to provide technology-oriented students with the knowledge and ability to develop creative solutions, and better understand the effects of future developments of mobile applications and its technology.

b. Prerequisite Courses:

Data Mining

c. Related Courses:

Data Warehousing and Data Mining Pattern Recognition

d. Course Educational Objectives : The student should be made to:

 Understand the theoretical basis behind bioinformatics.

 Search databases accessible on the WWW for literature relating to molecular biology and biotechnology.

 Analyse protein sequences, identify proteins, and retrieve protein structures from databases. View and interpret these structures. Understand homology modelling and computational drug design  Manipulate DNA and protein sequences using stand-alone PC programs and programs available on the WWW.  Query biological data, interpret and model biological information and apply this to the solution of biological problems in any arena involving molecular data.

e. Course Outcomes :

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) 185

CO1 Develop models for biological data. K2 Apply pattern matching techniques to bioinformatics data – CO2 K3 protein data genomic data. Demonstrate individual learning and scientific work by being an independent and self-directed learner; working effectively, CO3 responsibly, ethically, and safely in an individual or team K3 context Demonstrate an advanced understanding of biological sciences by articulating the methods of science, You will have an CO4 understanding of recent developments in a specialised area of K2 biotechnology

CO5 Apply micro array technology for genomic expression study K3 f. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L CO2 M L M CO3 M M M CO4 M M CO5 M M  H- High; M-Medium; L-Low g. Course Content : UNIT I INTRODUCTION 9 Need for Bioinformatics technologies – Overview of Bioinformatics technologies Structural ioinformatics – Data format and processing – Secondary resources and applications – Role of Structural bioinformatics - Biological Data Integration System.

UNIT II DATAWAREHOUSING AND DATAMINING IN BIOINFORMATICS 9 Bioinformatics data – Data warehousing architecture – data quality – Biomedical data analysis – DNA data analysis – Protein data analysis – Machine learning – Neural network architecture and applications in bioinformatics.

UNIT III MODELING FOR BIOINFORMATICS 9 Hidden Markov modeling for biological data analysis – Sequence identification –Sequence classification – multiple alignment generation – Comparative modeling –Protein modeling – genomic modeling – Probabilistic modeling – Bayesian networks – Boolean networks - Molecular modeling – Computer programs for molecular modeling.

UNIT IV PATTERN MATCHING AND VISUALIZATION 9 Gene regulation – motif recognition – motif detection – strategies for motif detection – Visualization – Fractal analysis – DNA walk models – one dimension – two dimension – higher dimension – Game representation of Biological sequences – DNA, Protein, Amino acid sequences. 186

UNIT V MICROARRAY ANALYSIS 9 Microarray technology for genome expression study – image analysis for data extraction – preprocessing – segmentation – gridding – spot extraction – normalization, filtering – cluster analysis – gene network analysis – Compared Evaluation of Scientific Data Management Systems – Cost Matrix – Evaluation model - Benchmark – Tradeoffs.

h. Learning Resources i.TEXT BOOK: 1. Yi-Ping Phoebe Chen (Ed), ―BioInformatics Technologies‖, First Indian Reprint, Springer Verlag, 2007. ii.REFERENCES: 1. Bryan Bergeron, ―Bio Informatics Computing‖, Second Edition, Pearson Education, 2003. 2. Arthur M Lesk, ―Introduction to Bioinformatics‖, Second Edition, Oxford University Press, 2005. iii. Online Resources 1. http://bioinfo.mbb.yale.edu/mbb452a/intro/ 2. http://en.wikipedia.org/wiki/Integrative_bioinformatics 3. http://www.bioinformatics.org/wiki/Protein_structure_prediction 4. http://mathematica.stackexchange.com/questions/73685/how-to-visualize-pattern-matching- process 5. http://en.wikipedia.org/wiki/DNA_microarray

187

COURSE CODE COURSE TITLE L T P C 1152IT137 GAME THEORY 3 0 0 3

c.Link to Other Courses:  Computer Graphics

d.Course Educational Objectives:  To familiarize with the process of game design and development

 To learn the processes, mechanics, issues in game design

 To understand the architecture of game programming

 To know about game engine development, modeling, techniques and frameworks

e.Course Outcomes:

Students undergoing this course are able to: CO Level of learning domain (Based on Course Outcomes Nos. revised Bloom’s)

Develop game programming skills in various gaming CO1 K3 models.

 CO2 To create interactive games K3

Do a literature survey on applications of Game Theory  CO3 K3 in Computer Science and Engineering.

g.Syllabus Content:

UNIT I INTRODUCTION 9

Elements of Game Play – Artificial Intelligence – Getting Input from the Player - Sprite Programming – Sprite Animation - Multithreading – Importance of Game Design – Game Loop.

UNIT II 3D GRAPHICS FOR GAME PROGRAMMING 9

188

Coordinate Systems, Ray Tracing, Modeling in Game Production, Vertex Processing, Rasterization, Fragment Processing and Output Merging, Illumination and Shaders, Parametric Curves and Surfaces.

UNIT III GAME DESIGN PRINCIPLES 9

Character Development, Story Telling, Narration, Game Balancing, Core mechanics, Principles of level design, Genres of Games, Collision Detection, Game Logic, Game AI, Path Finding, Case study : Tetris.

UNIT IV GAMING ENGINE DESIGN 9

Renderers, Software Rendering, Hardware Rendering, and Controller Based Animation, Spatial Sorting, Level of Detail, Collision Detection, Standard Objects, and Physics, Case study : The Sims

UNIT V GAME DEVELOPMENT 9

Developing 2D and 3D Interactive Games Using OpenGL, DirectX – Isometric and Tile Based Games, Puzzle Games, Single Player Games, Multi-Player Games. Case study: Mine craft.

1. Learning Resources

i. Text Book: 1.David H. Eberly, ―3D Game Engine Design, Second Edition: A Practical Approach to Real-Time Computer Graphics‖ Morgan Kaufmann, 2 Edition, 2006. 2. JungHyun Han, ―3D Graphics for Game Programming‖, Chapman and Hall/CRC, 1st edition, 2011. ii.References 1.Mike McShaffrfy, ―Game Coding Complete‖, Third Edition, Charles River Media, 2009. 2.Jonathan S. Harbour, ―Beginning Game Programming‖, Course Technology PTR, 3 edition, 2009.

189

COURSE CODE COURSE TITLE L T P C 1152IT138 AGILE TECHNOLOGIES 3 0 0 3 Course Category: Foundation (0)/ Program Core (1)/ Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) a.Preamble:  In this course, students learn how to develop the project vision and the product roadmap, identify user roles and the agile methodologies for project management framework. b. Pre-requisites:  Object Oriented Software Engineering c. Link to Other Courses:  Software Quality Assurance  Software Testing  Project work d. Course Educational Objectives: Students undergoing this course are exposed to  To understand how an iterative, incremental development process leads to faster delivery of more useful software.  To understand the essence of agile development methods  To understand the principles and practices of extreme programming  To understand the roles of prototyping in the software process  To understand the concept of Mastering Agility e.Course Outcomes:

Students undergoing this course are able to:

CO Level of learning domain Course Outcomes Nos. (Based on revised Bloom’s)

CO1 Understand The XP Lifecycle, XP Concepts, Adopting XP K3

Work on Pair Programming, Root-Cause Analysis, CO2 Retrospectives, Planning, Incremental Requirements, K3 Customer Tests Demonstrate competency in the creation of the roadmap and CO3 K3 backlog. Share best practices and tools related to Agile project CO4 K2 management.

K2-Understand, K3-Apply g.Syllabus Content: 190

UNIT I Why Agile? Understanding Success, Beyond Deadlines, The Importance of Organizational Success, Enter Agility, How to Be Agile?: Agile Methods, Don‘t Make Your Own Method, The Road to Mastery, Find a Mentor 10 Hours

UNIT II Understanding XP The XP Lifecycle, The XP Team, XP Concepts, Adopting XP: Is XP Right for Us? Go!, Assess Your Agility

UNIT III Practicing XP Thinking: Pair Programming, Energized Work, Informative Workspace, Root-Cause Analysis, Retrospectives, Collaborating: Trust, Sit Together, Real Customer Involvement, Ubiquitous Language, Stand-Up Meetings, Coding Standards, Iteration Demo, Reporting, Releasing, Version Control, Ten-Minute Build, Continuous Integration, Collective Code Ownership, Documentation.

UNIT IV Mastering Agility Values and Principles Commonalities, About Values, Principles, and Practices, Further Reading, Improve the Process: Understand Your Project, Tune and Adapt, Break the Rules, Rely on People: Build Effective Relationships, Let the Right People Do the Right Things; Build the Process for the People.

UNIT V Agile Practicing and Testing Project management – Environment – Requirements – Test – The agile alliances – The manifesto – Supporting the values – Agile testing – Nine principles and six concrete practices for testing on agile teams. h.Learning Resources i.Text Book: i.The Art of Agile Development (Pragmatic guide to agile software development), James shore, Chromatic, O'Reilly Media, Shroff Publishers & Distributors, 2007 ii. Reference Books

i. Agile Software Development, Principles, Patterns, and Practices, Robert C. Martin, Prentice Hall; 1st edition, 2002 ii. ―Agile and Iterative Development A Manger‘s Guide‖, Craig Larman Pearson Education, First Edition, India, 2004.

191

COURSE CODE COURSE TITLE L T P C 1152IT139 Python Programming 3 0 0 3 Course Category: Foundation (0)/ Program Core (1)/ Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) 2. Preamble: This course focused on constructing reasonably self-contained programs, where the input and output either comes from a user or from files, and any "external" functionality comes from imported Python modules.

2. Pre-requisites:  Basics of Computing and C Programming

3. Link to Other Courses:  Image Processing  Data Communications and Computer Networks  Cryptography and Network Security

4. Course Educational Objectives:

Students undergoing this course are exposed to  Introduces core programming basics—including data types, control structures, algorithm development, and program design with functions  Course discusses the fundamental principles of Object-Oriented Programming, as well as in- depth data and information processing techniques  Students will solve problems, explore real-world software development challenges, and create practical and contemporary applications.

3. Course Outcomes:

Students undergoing this course are able to: Level of learning CO Course Outcomes domain (Based on Nos. revised Bloom’s)

CO1 Explain various operators used in python. K3

 CO2 Apply the string handling functions to solve the given problem K3

Use image processing techniques with python programming to solve a  CO3 K3 given problem.

 CO4 Describe Object oriented concepts with python K2

192

CO5 Discuss the functions of networking with python K2

K2-Understand, K3-Apply

4. Correlation of COs with Program Outcomes :

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H M L L CO2 M L L CO3 M M M L CO4 M M M L L CO5 M L L L

H- High; M-Medium; L-Low 5. Syllabus Content:

UNIT I INTRODUCTION L- 9 installing Python; basic syntax, interactive shell, editing, saving, and running a script- variables, assignments; immutable variables; numerical types; arithmetic operators and expressions; comments in the program; understanding error messages;

UNIT II CONDITIONAL STATEMENT & STRING HANDLING L- 9 Conditions, Boolean logic, logical operators; ranges; Control statements: if-else, loops (for, while); short-circuit (lazy) evaluation - Manipulating files and directories, os and sys modules; text files: reading/writing text and numbers from/to a file; creating and reading a formatted file (csv or tab- separated). String manipulations: subscript operator, indexing, slicing a string; strings and number system: converting strings to numbers and vice versa. Binary, octal, hexadecimal numbers .

UNIT III IMAGE PROCESSINGWITH PYTHON L-9 Design with functions: hiding redundancy, complexity; arguments and return values; formal vs actual arguments, named arguments. Program structure and design. Recursive functions- Simple Graphics and Image Processing: ―turtle‖ module; simple 2d drawing - colors, shapes; digital images, image file formats, image processing Simple image manipulations with 'image' module (convert to bw, greyscale, blur, etc).

UNIT IV OBJECT ORIENTED PROGRAMMING WITH PYTHON L- 9 Classes and OOP: classes, objects, attributes and methods; defining classes; design with classes, data modeling; persistent storage of objects - OOP, continued: inheritance, polymorphism, operator overloading; abstract classes; exception handling, try block

UNIT V NETWORKINGWITH PYTHON L- 9

Multithreading, Networks, and Client/Server Programming; introduction to HTML, interacting with remote HTML server, running html-based queries, downloading pages; CGI programming, programming a simple CGI form. Total: 45 PERIODS 193

6. Learning Resources iii. Text Book: 1. “Learning Python: Powerful Object-Oriented Programming: 5th Edition Shroff; Fifth edition (24 July 2013)

iv. Reference Books

1. ―Python Essential Reference‖. Addison-Wesley Professional; 4 edition (July 19, 2009) by David M.Baezly

2. “Python Cookbook” O'Reilly Media; 3 edition (June 1, 2013) by David M.Baezly.

v. Online Resources:

4. https://www.codecademy.com/learn/python 2. www.learnpython.org/

194

COURSE CODE COURSE TITLE L T P C

1152IT302 SERVICE ORIENTED ARCHITECTURE LAB 0 0 2 1

a. Preamble : Service Oriented Architecture provides an introduction to the basic concepts of SOA, Xml &Web Services, and WSDL Basics.

b. Prerequisite Courses: Sl. No Course code Course Name 1 Web Programming

c. Related Courses: Sl. No Course Code Course Name 1 Open Source Systems 2 Project Work

f. Course Educational Objectives: Students are exposed to:  To provide fundamental concepts of Service Oriented Architecture..  To gain knowledge about SOAP, UDDI and XML to create web services.  To know about the Cloud Computing architecture and services.

g. Course Outcomes: Upon the successful completion of the course, learners will be able to

CO Course Outcomes Level of learning Nos. domain(Based on revised Bloom’s) Implement the concepts of XML and XSL 1 S2 document in database Design and develop the Web Service creation 2 S3 using JAX-WS and JAX-RS. 3 Design and develop web services using protocol S3 Implement the technology underlying the Web 4 S3 service creation using .NET To learn about JAXB Marshaling and 5 S2 Unmarshaling

K2-Understand, K3-Apply, S3-Processes

195 f. Correlatin of COs with Programme Outcomes:

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

CO1 H M L

CO2 H M L L L L

CO3 H M L L L L L

CO4 H L L L

CO5 H M L L L L L

H- High; M-Medium; L-Low

g. Syllabus Content: Cycle I

1. XML document creation.

2. Importing and Exporting XML document in database.

3. XSL Transformation

4. Internal and External DTD creation

5. XML Schema creation

Model Practical Examination I Cycle II 7. Parsing XML document using DOM/SAX parser.

7. Web Service creation using JAX-WS

8. Web Service creation using JAX-RS

9. Web Service creation using .NET

10. JAXB Marshaling and Unmarshaling

A possible set of applications may be the following: a. Currency Conversion b. Temperature Conversion c. Ticket Booking d. Dictionary

196

COURSE CODE COURSE TITLE L T P C

1152IT140 Cloud Storage Infrastructures 3 0 0 3

CLOUD STORAGE INFRASTRUCTURES

Unit I

Virtualized Data Center Architecture : Cloud infrastructures; public, private, hybrid. Service provider interfaces; Saas, Paas, Iaas. VDC environments; concept, planning and design, business continuity and disaster recovery principles. Managing VDC and cloud environments and infrastructures.

Unit II

Information Storage Security & Design : Storage strategy and governance; security and regulations. Designing secure solutions; the considerations and implementations involved. Securing storage in virtualized and cloud environments. Monitoring and management; security auditing and SIEM.

Unit III

Storage Network Design: Architecture of storage, analysis and planning. Storage network design considerations; NAS and FC SANs, hybrid storage networking technologies (iSCSI, FCIP, FCoE), design for storage virtualization in cloud computing, host system design considerations.

Unit IV

Cloud Optimized Storage: Global storage management locations, scalability, operational efficiency. Global storage distribution; terabytes to petabytes and greater. Policy based information management; metadata attitudes; file systems or object storage.

Unit V

Information Availability Design : Designing backup/recovery solutions to guarantee data availability in a virtualized environment. Design a replication solution, local remote and advanced. Investigate Replication in NAS and SAN environments. Data archiving solutions; analyzing compliance and archiving design considerations.

TEXT / REFERENCES BOOKS

1.Greg Schulz 2011, Cloud and Virtual Data Storage Networking, uerbach Publications [ISBN: 978- 1439851739]

2. Marty Poniatowski, Foundations of Green IT [ISBN: 978-0137043750]

3. EMC, Information Storage and Management [ISBN: 978-0470294215]

4. Volker Herminghaus, Albrecht Scriba,, Storage Management in Data Centers [ISBN:978-3540850229]

197

COURSE CODE COURSE TITLE L T P C

1152IT141 Cloud Security 3 0 0 3

Unit I Security Concepts: Confidentiality, privacy, integrity, authentication, non-repudiation, availability, access control, defence in depth, least privilege, how these concepts apply in the cloud, what these concepts mean and their importance in PaaS, IaaS and SaaS. e.g. User authentication in the cloud; Cryptographic Systems: Symmetric cryptography, stream ciphers, block ciphers, modes of operation, public-key cryptography, hashing, digital signatures, public-key infrastructures, key management, X.509 certificates, OpenSSL. Unit II Multi-tenancy Issues: Isolation of users/VMs from each other. How the cloud provider can provide this; Virtualization System Security Issues: e.g. ESX and ESXi Security, ESX file system security, storage considerations, backup and recovery; Virtualization System Vulnerabilities: Management console vulnerabilities, management server vulnerabilities, administrative VM vulnerabilities, guest VM vulnerabilities, hypervisor vulnerabilities, hypervisor escape vulnerabilities, configuration issues, malware (botnets etc). Unit III Virtualization System-Specific Attacks: Guest hopping, attacks on the VM (delete the VM, attack on the control of the VM, code or file injection into the virtualized file structure), VM migration attack, hyperjacking. Unit IV Technologies for Virtualization-Based Security Enhancement: IBM security virtual server protection, virtualization-based sandboxing; Storage Security: HIDPS, log management, Data Loss Prevention. Location of the Perimeter. Unit V Legal and Compliance Issues: Responsibility, ownership of data, right to penetration test, local law where data is held, examination of modern Security Standards (eg PCIDSS), compliance for thecloud provider vs. compliance for the customer.

TEXT / REFERENCES BOOKS

1. Tim Mather, SubraKumaraswamy, ShahedLatif, Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance [ISBN: 0596802765] 2. Ronald L. Krutz, Russell Dean Vines, Cloud Security [ISBN: 0470589876] 3. John Rittinghouse, James Ransome, Cloud Computing [ISBN: 1439806802] 4. J.R. ("Vic") Winkler, Securing the Cloud [ISBN: 1597495921] 5. Cloud Security Alliance 2009, Security Guidance for Critical Areas of Focus in Cloud Computing 6. vmwareVMware Security Hardening Guide 7. Cloud Security Alliance 2010, Top Threats to Cloud Computing 8. NIST Guidelines on Security and Privacy in Public Cloud Computing 9. William Hau, Rudolph Araujo et al How Virtualization Affects PCI DSS www.mcafee.com/us/resources/.../wp-how-virt-affect-pci-dss-part-1.pdf 10. Chenxi Wang Compliance with Clouds: Caveat Emptor

198

COURSE CODE COURSE TITLE L T P C

CLOUD APPLICATION AND ARCHITECTURE 1152IT142 3 0 0 3

Unit I

Cloud Computing Fundamental: Cloud Computing definition, private, public and hybrid cloud. Cloud types; IaaS, PaaS, SaaS. Benefits and challenges of cloud computing, public vs private clouds, role of virtualization in enabling the cloud; Business Agility: Benefits and challenges to Cloud architecture. Application availability, performance, security and disaster recovery; next generation Cloud Applications.

Unit II

Cloud Applications: Technologies and the processes required when deploying web services; Deploying a web service from inside and outside a cloud architecture, advantages and disadvantages

Unit III

Cloud Services Management: Reliability, availability and security of services deployed from the cloud. Performance and scalability of services, tools and technologies used to manage cloud services deployment; Cloud Economics : Cloud Computing infrastructures available for implementing cloud based services. Economics of choosing a Cloud platform for an organization, based on application requirements, economic constraints and business needs (e.g Amazon, Microsoft and Google, Salesforce.com, Ubuntu and Redhat)

Unit IV

Application Development: Service creation environments to develop cloud based applications. Development environments for service development; Amazon, Azure, Google App.

Unit V

Best Practice Cloud IT Model : Analysis of Case Studies when deciding to adopt cloud computing architecture. How to decide if the cloud is right for your requirements. Cloud based service, applications and development platform deployment so as to improve the total cost of ownership.

TEXT / REFERENCES BOOKS

1. Cloud Architecture and Engineering by Conor Suarez 2. Cloud Computing Patterns: Fundamentals to Design, Build, and Manage Cloud Applications by Christoph Fehling , Frank Leymann , Ralph Retter , Walter Schupeck

199

COURSE CODE COURSE TITLE L T P C

CLOUD MIDDLEWARE 1152IT143 3 0 0 3

UNIT 1 CONCEPTS & SOA

The concepts of object, component, service. SOA. - Web Service Description Language (WSDL) and selected WS-* specifications. Representational State Transfer (REST) and its implementation RESTful - compared with WSDL. Process modeling - workflow patterns - Business Process Execution Language (BPEL).

UNIT 2 ARCHITECTURES

Architectures for middleware: Middleware Software / Platforms - Conducting a PaaS Comparison - Understanding PaaS Software- Managed Private Cloud- Open Source PaaS – Benefits and Solutions - ESB,P / S, MQ. - Reliability and scalability of applications. - P2P systems, Skype case study.

UNIT 3 DB MIDDLEWARES

Commercial software vs. SaaS model. - Cloud computing - the architecture of modern applications- Infrastructure as a Service (IaaS) - distributed computing and distributed file system. Oracle Middleware in the Cloud.

UNIT 4 PLATFORAM & MIDDLEWARE

Middleware as a Platform - Database Middleware with PaaS- Grid middleware - Key Features of the PaaS System

UNIT 5 APPLICATIONS

Platform as a Service (PaaS), Google case study. - Software as a Service (SaaS) - SalesForce &

GoodData case studies. TEXT / REFERENCE BOOKS

1. Frank Munz. "Middleware and Cloud Computing: Oracle on Amazon Web Services (AWS), Rackspace Cloud and RightScale 2. : Volume 1 Paperback – Import, 1 Jan 2011 3. Honbo Zhou, "The Internet of Things in the Cloud: A Middleware Perspective", 2012 by CRC Press ,ISBN 9781439892992 . 4. www.apprenda.com http://www.oracle.com/technetwork/topics/cloud/middleware-084242.html

200

COURSE CODE COURSE TITLE L T P C

MANAGING VIRTUAL ENVIRONMENTS 1152IT144 3 0 0 3

MANAGING VIRTUAL ENVIRONMENTS

Pre requisite : 1151IT118- Cloud Computing

Unit I Performance Management in a Virtual Environment: Management techniques, methodology and key performance metrics used to identifying CPU, memory, network, virtual machine and application performance bottlenecks in a virtualized environment.

Unit II Configuration and Change Management: Configuration and change management goals and guidelines, tools and technologies in virtualized environments.

Unit III Secure Virtual Networking: Configuration and change management goals and guidelines, tools and technologies in virtualized environments; Virtual network security architecture, network segmentation and traffic isolation to secure a virtual network configuration.

Unit IV Protecting the Management Environment:Server authentication, authorization, and accounting, SSL certificates, server hardening; Protecting the host system: security architecture, controlling access to storage, hardening hosts, Hardening virtual machines; Virtual machine security architecture, security parameters; Protecting the host and virtual machine systems using server authentication, authorization, and accounting techniques.

Unit V Troubleshooting Virtual Environments: Interpreting host, network, storage, cluster and virtual machine log files. Network troubleshooting, traffic sniffing, storage access problems, iSCSI authentication and digests. Virtual machine migration, cluster errors with shares, pools, and limits; Command line interfaces and syntax, interpreting host, network, storage, cluster, virtual machine log files and network traces. TEXT / REFERENCES BOOKS

1.Massimo Cafaro (Editor), Giovanni Aloisio (Editor), Grids, Clouds and Virtualization [ISBN: 978- 0857290489]

2. Chris Wolf and Erick M. Halter, Virtualization [ISBN: 978-1590594957]

3. Gaurav Somani, Scheduling and Isolation in Virtualization, VDM Verlag Dr. Müller [ISBN: 978- 3639295139]

4. LatifaBoursas (Editor), Mark Carlson (Editor), Wolfgang Hommel (Editor), Michelle Sibilla (Editor), KesWold (Editor), Systems and Virtualization Management: Standards and New Technologies [ISBN: 978- 3540887072]

5. Edward L. Haletky, VMware ESX Server in the enterprise [ISBN: 978-0132302074]

201

COURSE CODE COURSE TITLE L T P C

DATACENTER NETWORKING 1152IT145 3 0 0 3

UNIT I- EVOLUTION OF DATA CENTRE DESIGN

Design for flexibility, scalability, environmental control, electrical power, flooring, fire protection, security, network infrastructure. Energy use and greenhouse gas emissions. Requirements for modern data centers, high availability and Service Orientated Infrastructures (SOI). Modern data centre use case studies.

UNIT II -DATA CENTRE ARCHITECTURES

Network connectivity optimization evolution: Top of rack (TOR), end of rack (EOR), scale up vs scale up, solutions that reduce power and cabling. Data Centre standards; TIA/EIA-942. Structured cabling standards, fibre and copper cabling characteristics, cable management, bandwidth requirements, I/O connectivity.

UNIT III - SERVER ARCHITECTURES

Stand-alone, blades, stateless, clustering, scaling, optimization, virtualization. Limitation of traditional server deployments; modern solutions. Applications; database, finance etc. Redundant Layer 2 and Layer 3 designs. Case studies.

UNIT IV-LAYER 2 NETWORKS

Ethernet; IEEE 802.3ba; 40 Gbps and 100 Gbps Ethernet. IEEE 802.1D Spanning Tree Protocol (STP), RSTP, PVST, MSTP. TRILL (Transparent Interconnection of Lots of Links), RBridges, IEEE 802.1Qbg Edge Virtual Bridging, 802.1Qbh Bridge Port Extension. Fibre Channel over Ethernet (FCoE) vs Internet Small Computer System Interface (iSCSI). Data Center Bridging (DCB); priority-based flow control, congestion notification, enhanced transmission selection, Data Center Bridging Exchange (DCBX). Layer 2 Multicasting; Case studies.

UNITV-LAYER3&BEYOND

Layer 3 Data Centre technologies, network virtualization. Protocols; IPv4, IPv6, MPLS, OSPF, IS-IS, BGP. OTV, VPLS layer 2 extension protocols. Locator Identifier Separation Protocol (LISP). Layer 3 Multicasting. Data centre application services. Data centre networking use case studies and the enabling technologies and protocols in the modern data centre.

TEXT / REFERENCES BOOKS

1. SilvanoGai, Claudio DeSanti, I/O Consolidation in the Data Center [ISBN: 9781587058882] 2. Kevin Corbin, Ron Fuller, David Jansen,, NX-OS and Cisco Nexus Switching: NextGeneration Data Center Architectures [ISBN: 9781587058929] 3. SilvanoGai, TommiSalli, Roger Andersson, Cisco Unified Computing System [ISBN: 9781587141935] 4. Nash Darukhanawalla, Patrice Bellagamba, Interconnecting Data Centers Using VPLS [ISBN: 9781587059926]

202

COURSE CODE COURSE TITLE L T P C

DATACENTER VIRTUALIZATION 1152IT146 3 0 0 3

UNIT I - DATA CENTER CHALLENGES

How server, desktop, network Virtualization and cloud computing reduce data center footprint, environmental impact and power requirements by driving server consolidation; Evolution of Data Centers: The evolution of computing infrastructures and architectures from standalone servers to rack optimized blade servers and unified computing systems (UCS).

UNIT II - ENTERPRISE-LEVEL VIRTUALIZATION

Provision, monitoring and management of a virtual datacenter and multiple enterprise-level virtual servers and virtual machines through software management interfaces; Networking and Storage in Enterprise Virtualized Environments - Connectivity to storage area and IP networks from within virtualized environments using industry standard protocols

UNIT III - VIRTUAL MACHINES & ACCESS CONTROL

Virtual machine deployment, modification, management; monitoring and migration methodologies.

UNIT IV - RESOURCE MONITORING

Physical and virtual machine memory, CPU management and abstraction techniques using a hypervisor.

UNIT V - VIRTUAL MACHINE DATA PROTECTION

Backup and recovery of virtual machines using data recovery techniques; Scalability - Scalability features within Enterprise virtualized environments using advanced management applications that enable clustering, distributed network switches for clustering, network and storage expansion; High Availability : Virtualization high availability and redundancy techniques.

TEXT / REFERENCES BOOKS

1. Mickey Iqbal 2010, IT Virtualization Best Practices: A Lean, Green Virtualized Data Center Approach, MC Press [ISBN: 978-1583473542] 2. Mike Laverick, VMware vSphere 4 Implementation [ISBN: 978-0071664523] 3. Jason W. McCarty, Scott Lowe, Matthew K. Johnson, VMware vSphere 4 Administration Instant Reference [ISBN: 978-0470520727] 4. Brian Perry, Chris Huss, Jeantet Fields, VCP VMware Certified Professional on vSphere 4 Study Guide [ISBN: 978-0470569610] 5. Brian Perry, Chris Huss, Jeantet Fields, VCP VMware Certified Professional on vSphere 4 Study Guide [ISBN: 978-0470569610]

203

COURSE CODE COURSE TITLE L T P C

CLOUD STRATEGY PLANNING AND MANAGEMENT 1152IT147 3 0 0 3

UNIT I - ACHIEVING BUSINESS VALUE FROM IT TRANSFORMATION (9 hours)

Moving to a cloud architecture and strategy to achieve business value. BPM, IS, Porter‘s Value chain model and BPR as a means of delivering business value; Developing Business Strategy: Investigate business strategy models to gain competitive advantage for organizations, SWOT/PEST, Economies of scale, Porter‘s 3 Strategies and 5 Competitive Forces, D‘Aveni‘s hyper competition models.

UNIT II - STRATEGIC IT LEADERSHIP IN THE ORGANIZATION (9 hours)

Emphasize the roles of the strategic IS/IT leaders such as Chief Information Officer (CIO) and the Chief Technology Officer (CTO) in planning and managing IT Strategic development in the organization.

UNIT III - PLANNING A CLOUD COMPUTING BASED IT STRATEGY (9 hours)

Develop an IT strategy to deliver on strategic business objectives in the business strategy. IT Project planning in the areas of ITaaS, SaaS, PaaS and IaaS are essential in delivering a successful strategic IT Plan.

UNIT IV - SOA AND BUSINESS AGILITY (9 hours)

Shared services delivered by a Service Oriented Architecture (SOA) in a Private or Public Cloud. Services, Databases and Applications on demand. The effect on Enterprise Architecture and its traditional frameworks such as Zachman and The Open Group Architecture Framework (TOGAF).

UNIT V - BENEFIT REALIZATION AND IT GOVERNANCE (9 hours)

Managing resources (people, process, technology), to realize benefit from Private/Public Cloud IT services (IaaS, PaaS, PraaS, SaaS), Gartner's 5 pillars of benefit realization. IT governance as a service in measuring the delivery of IT Strategy from Cloud IT Services using Sarbannes Oxley (CobiT) and other commonly-used approaches.

TEXT / REFERENCES BOOKS

1. Arnold J Cummins, Easiest Ever Guide to Strategic IT Planning

2. Andy Mulholland, Jon Pyke, Peter Finger, Enterprise Cloud Computing - A Strategy Guide for Business and Technology Leaders, Meghan Kiffer [ISBN: 0929652290]

3. David S. Linthicum, Cloud Computing and SOA Convergence in Your Enterprise, Addison Wesley [ISBN: 0136009220]

4. Charles Babcock, Management Strategies for the Cloud Revolution, 1st Ed., McGraw/Hill [ISBN: 0071740759]

204

COURSE CODE COURSE TITLE L T P C

ENTERPRISE STORAGE SYSTEMS 1152IT148 3 0 0 3

UNIT I - STORAGE SYSTEMS

Data Classification, Storage Evolution and Data Center infrastructure. Host components, Connectivity, Storage, and Protocols. Components of a disk drive, physical disk and factors affecting disk drive performance. RAID level performance and availability considerations. Components and benefits of an intelligent storage system.

UNIT II - STORAGE NETWORKING TECHNOLOGIES

Direct-Attached Storage (DAS)architecture, Storage Area Network (SAN) attributes, components, topologies, connectivity options and zoning. FC protocol stack, addressing, flow control, and classes of service. Networked Attached Storage (NAS)components, protocols, IP Storage Area Network (IP SAN) iSCSI, FCIP and FCoE architecture. Content Addressed Storage (CAS) elements, storage, and retrieval processes. 29 M.Tech (Cloud Computing)-2013

UNIT III - VIRTUALIZATION

Block-level and file-level storage virtualization technology, virtual provisioning and cloud computing.

UNIT IV - BUSINESS CONTINUITY

Business Continuity measurement, terminologies, and planning. Backup designs, architecture, topologies, and technologies in SAN and NAS environments. Local and Remote replication using host and array-based replication technologies such as Synchronous and Asynchronous methods.

UNIT V - STORAGE SECURITY AND MANAGEMENT

Storage security framework and various security domains. Security implementation in SAN,NAS and IP-SAN networking. Monitoring and Storage management activities and challenges

TEXT / REFERENCES BOOKS

1. EMC, Information Storage and Management [ISBN: 978-0470294215]

2. Richard Barker, Paul Massiglia 2002, Storage area network essentials, Wiley New York [ISBN: 978- 0471034452]

3. Ulf Troppens, Rainer Erkens, Wolfgang Mueller-Friedt, Rainer Wolafka, Nils Haustein, Storage Networks Explained [ISBN: 978-0470741436]

4. W. Curtis Preston 2002, Using SANs and NAS, O'Reilly & Associates Sebastopol, Calif. [ISBN: 978- 0596001537]

5. Himanshu Dwivedi 2006, Securing storage, Addison-Wesley Upper Saddle River, NJ [ISBN: 978- 0321349958]

205

COURSE CODE COURSE TITLE L T P C

DATA SCIENCE & BIG DATA ANALYTICS 1152IT149 3 0 0 3

UNIT I - INTRODUCTION TO BIG DATA ANALYTICS:

Big Data overview, State of the practice in analytics role of data scientists, Big Data Analytics in industry verticals

UNIT II - END-TO-END DATA ANALYTICS LIFE CYCLE

Key roles for successful analytic project, main phases of life cycle, Developing core deliverables for stakeholders

UNIT III - BASIC ANALYTIC METHODS:

Introduction to ―R‖, analyzing and exploring data with ―R‖, statistics for model building and evaluation

UNIT IV - ADVANCED ANALYTICS AND STATISTICAL MODELING FOR BIG DATA

Naïve Bayseian Classifier, K-means Clustering, Association Rules, Decision Trees, Linear and Logistic Regression, Time Series Analysis, Text Analytics;

UNIT V - MAPREDUCE/HADOOP

Technology and Tools – MapReduce/Hadoop , In- database Analytics, MADlib and advanced SQL Tools

TEXT / REFERENCES BOOKS

1. Noreen Burlingame ,The little book on Big Data, New Street publisher(eBook) http://www.prlog.org/11800911-just-published-the-little-book-of-big-data-2012-edition.html

2. Norman Matloff ,The Art of R Programming: A Tour of Statistical Software Design , ISBN-13: 978-1- 59327-384-2; ISBN-10: 1-59327-384-3

3. http://www.johndcook.com/R_language_for_programmers.html

4. http://bigdatauniversity.com/

5. http://home.ubalt.edu/ntsbarsh/stat-data/topics.htm#rintroduction

206

COURSE CODE COURSE TITLE L T P C

DESIGN & DEVELOPMENT OF CLOUD APPLICATIONS 1152IT150 3 0 0 3

UNIT I - DESIGNING CLOUD BASED APPLICATIONS

Role of business analyst, requirements gathering, UML, use of state diagrams, wire frame prototypes, use of design tools such as Balsamiq. Selecting front end technologies and standards, Impact of growth in mobile computing on functional design and technology decisions.

UNIT II - CLOUD APPLICATION DEVELOPMENT

Technical architecture considerations – concurrency, speed and unpredictable loads. Agile development, team composition (including roles/responsibilities), working with changing requirements and aggressive schedules. Understanding Model View Controller (MVC). Advanced understanding of ―views‖, location, and the presentation layer: Advanced Ajax and JQuery. Presenting to different browsers and devices. Localization and internationalization; Understanding client location and device type. Mobile application development – Android, iOS, WP, RIM, Symbian.

UNIT III - STORING OBJECTS IN THE CLOUD

Session management. Advanced database techniques using MySQL and SQL Server, blob storage, table storage. Working with Third Party APIs: Overview of interconnectivity in cloud ecosystems. Working with Twitter API, Flickr API, Google Maps API. Advanced use of JSON and REST.

UNIT IV - CLOUD APPLICATIONS AND SECURITY ISSUES

Understanding cloud based security issues and threats (SQL query injections, common hacking efforts), SSL, encrypted query strings, using encryption in the database. Authentication and identity. Use of oAuth. OpenID; Understanding QA and Support: Common support issues with cloud apps: user names and passwords, automated emails and spam, browser variants and configurations. Role of developers in QA cycle. QA techniques and technologies. Use of support forums, trouble ticketing.

UNIT V - USE CASES

Design, develop and deploy an advanced cloud app using framework and platform of choice to demonstrate an understanding of database, presentation and logic. Application should demonstrate integration with third party API, sensitivity to geography of user (language, currency, time and date format), authentication of user, security, and awareness of client device/browser. Case Studies: Salesforce, Basecamp, Xero.com, Dropbox.

TEXT / REFERENCES BOOKS

1. Jim Webber, SavasParastatidis, Ian Robinson, REST in Practice [ISBN: 978- 0596805821]

2. Eugenio Pace, Dominic Betts, Scott Densmore, Ryan Dunn, Masashi Narumoto, MatiasWoloski, Developing Applications for the Cloud on the Microsoft Windows Azure Platform [ISBN: 9780735656062]

3. Dan Wellman, jQuery UI 1.6 [ISBN: 9781847195128]

207

COURSE CODE COURSE TITLE L T P C

CLOUD DATABASE 1152IT151 3 0 0 3

UNIT 1 DISTRIBUTED DATABASE

Distributed database - Heterogeneous and Homogeneous Databases- Distributed Data Storage – Distributed Transactions - Commit Protocols - Distributed query processing - Heterogeneous distributed database – Cloud based databases.

UNIT 2 STUDY OF DISTRIBUTED DATABASE

Homogeneous distributed database - Heterogeneous Distributed Databases - The Distributed Query- PNUS -a cloud data storage system. cloud dbms (CDBMS).

UNIT 3 CLOUD DATABASE

The Cloud Implementation of Transactional and Query Systems –Towards a Cloud Database - Local Data and Distributed Data - Other Cloud Database Issues.

UNIT 4 CLOUD DATABASE ARCHITECTURE

Hadoop and Map/Reduce: A Distributed Architecture. Traditional Databases Evolve to be a CDBMS

UNIT 5 CLOUD DATABASE 7 OPEN CLOUD DB

Algebraix Data and Cloud Database - Data Growth - The Economy of A2DB – open DB source cloud databases.

TEXT / REFERENCE BOOKS

1. Ozsu ,"Principles Of Distributed Database Systems" , 3e Paperback – 2011

2. Lee Chao "Cloud Database Development and Management", by Auerbach Publications ISBN 9781466565050 - CRC press.

3. http://www.algebraixdata.com/wp-content/uploads/2010/01/Alge

208

COURSE CODE COURSE TITLE L T P C DEEP LEARNING 1152IT152 3 0 0 3

OBJECTIVES:

This course covers the basics of machine learning, neural networks and deep learning, present the mathematical, statistical and computational challenges of building neural networks, to introduce dimensionality reduction techniques.so enable the students to know deep learning techniques to support real- time applications and to examine the case studies of deep learning techniques.

OUTCOMES:

Upon completion of the course, the students will be able to:

1. Understand basics of deep learning 2. Implement various deep learning models 3. Realign high dimensional data using reduction techniques 4. Analyse optimization and generalization in deep learning 5. Explore the deep learning applications

UNIT I INTRODUCTION 9

Introduction to machine learning- Linear models (SVMs and Perceptrons, logistic regression)- Intro to Neural Nets: What a shallow network computes- Training a network: loss functions, back propagation and stochastic gradient descent- Neural networks as universal function approximates

UNIT II DEEP NETWORKS 9

History of Deep Learning- A Probabilistic Theory of Deep Learning- Backpropagation and regularization, batch normalization- VC Dimension and Neural Nets-Deep Vs Shallow Networks- Convolutional Networks- Generative Adversarial Networks (GAN), Semi-supervised Learning

UNIT III DIMENTIONALITY REDUCTION 9

Linear (PCA, LDA) and manifolds, metric learning - Auto encoders and dimensionality reduction in networks - Introduction to Convnet - Architectures – AlexNet, VGG, Inception, ResNet - Training a Convnet: weights initialization, batch normalization, hyperparameter optimization.

UNIT IV OPTIMIZATION AND GENERALIZATION 9

Optimization in deep learning– Non-convex optimization for deep networks- Stochastic Optimization- Generalization in neural networks- Spatial Transformer Networks- Recurrent networks, LSTM - Recurrent Neural Network Language Models- Word-Level RNNs & Deep Reinforcement Learning - Computational & Artificial Neuroscience

UNIT V CASE STUDY AND APPLICATIONS 9

Imagenet- Detection-Audio WaveNet-Natural Language Processing Word2Vec - Joint Detection- BioInformatics- Face Recognition- Scene Understanding- Gathering Image Captions

209

REFERENCES:

1. CosmaRohillaShalizi, Advanced Data Analysis from an Elementary Point of View, 2015.

2. Deng & Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.

3. Ian Goodfellow, YoshuaBengio, Aaron Courville, Deep Learning, MIT Press, 2016.

4. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.

210

Sl.N Course Code Allied Elective L T P C o

1 1153IT101 Computer Networks 3 0 0 3

2 1153IT102 Database Management Systems 3 0 0 3

3 1153IT103 Cryptography and Network Security 3 0 0 3

4 1153IT104 Mobile Communications 3 0 0 3

5 1153IT105 Wireless Communication 3 0 0 3

6 1153IT106 Multimedia Communication 3 0 0 3

7 1153IT107 Virtualization Techniques 3 0 0 3

8 1153IT108 Digital Image Processing 3 0 0 3

10 1153IT201 Java Programming(Lab Dominated) 1 0 4 3

11 1153IT110 Python Programming Fundamentals 3 0 3 3

12 1153IT202 SQL Fundamental(Lab Dominated) 1 0 4 3

13 1153IT203 C++ Programming Fundamentals (Lab Dominated) 1 0 4 3

211

COURSE CODE COURSE TITLE L T P C

1153IT101 COMPUTER NETWORKS 3 0 0 3

 Principles of Data Communication  Data Structure. c. Related Courses:  Network Programming.  Information Security. d. Course Educational Objectives: Students undergoing this course are expected:

 To understand the concepts of data communications.  To study the functions of different layers.  To introduce IEEE standards employed in computer networking.  To make the students to get familiarized with different protocols and network components. e. Course Outcomes: Upon the successful completion of the course, students will be able to:

Knowledge Level (Based CO Course Outcomes on revised Bloom’s Nos. Taxonomy) CO1 Design various networking layers K2, S3

CO2 Explain various modes of communication and devices K1, S3 Explain Error detection and Error control , and types of data CO3 transmission formats K1, S3

CO4 Illustrate various switching formats and connecting services K1, S3

CO5 Apply various protocols and explain about their applications K3, S3

f. Correlation of COs with POs : 212

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M M CO2 M M

CO3 M M

CO4 M M

CO5 M M H- High; M-Medium; L-Low g. Course Content:

UNIT I Introducion L – 9

UNIT II Physical Layer L – 9

Digital Transmission - Digital-To-Digital Conversion - Analog Transmission - Digital-To- Analog Conversion - Transmission Media - Guided Media - Unguided Media: Wireless - Wired LANs: Ethernet - Token ring - Connecting Devices – Switching techniques.

UNIT III Data Link Layer L – 9

UNIT IV Network layer L – 9

UNIT V Transport Layer and Application Layer L – 9

TOTAL: 45 periods

h. Learning Resources

213

i.Text Books :

1. Behrouz Forouzan, ―Data Communication and Networks‖, McGraw Hill, 2007.

2. Andrew S. Tanenbaum , Computer Networks, Prentice Hall of India,2008.

3. S. Keshav, An Engineering approach to computer networking, Addison Wesley, 2000. ii.Reference:  James F. Kurose and Keith W. Ross Pearson ―Computer Networking: A Top-Down Approach‖Addison-Wesley, Boston MA , Ó2008. ISBN 0 - 321 - 49770 – 8  Bruce A. Hallberg‖ Networking: A Beginner's Guide‖ McGraw-Hill / Osborne, 2003 ISBN 0 - 07 - 222563 – 7 iii. Online resources

 www.sciencedirect.com/science/journal/13891286  www.functionx.com/networking/  nptel.iitm.ac.in/video.php?subjectId=106105081 http://www.technolamp.co.in/2010/08/computer-networks-tanenbaum-powerpoint.html

214

COURSE CODE COURSE TITLE L T P C 1153IT102 DATABASE MANAGEMENT SYSTEM 3 0 0 3

Course Category: Foundation (0)/ Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) a.Preamble : Database Management System or DBMS in short refers to the technology of storing and retrieving users‘ data with utmost efficiency along with appropriate security measures. This tutorial explains the basics of DBMS such as its architecture, data models, data schemas, data independence, E-R model, relation model, relational database design, and storage and file structure and much more.

b. Prerequisite Courses:

Fundamentals of IT

c. Related Courses:

 Advanced database  Data warehousing and mining  Database administration

d. Course Educational Objectives :

Students undergoing this course are expected  Understand the difference between File system and DBMS, Data models and database system structure  Learn how to use the integrity constraints over the relations and know the expressive power of Algebra and calculus Knowledge CO Level (Based on Course Outcomes No’s revised Bloom’s Taxonomy) Explain the basic concepts of the database, data models and Design a K2 CO1 database using ER diagrams and map ER into Relations.

CO2 Illustrate the concepts of Relational Algebra and Distributed database. K2, S3

CO3 Develop a simple database applications using normalization. K2, S3 Discuss about the concepts of transaction, Concurrency and Recovery K3, S3 CO4 techniques.

Apply query evaluation techniques to monitor the performance of the K3, S3 CO5 DBMS.

215

CO6 Demonstrate practical on theory concepts K3, S3

CO7 Use DDL and DML commands K3

 Learn the query languages features which are the core of SQL‘s , DML, Join operations and Triggers  To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.  Enhancing knowledge about SQL Queries, PL/SQL functions and basics of front end tools.  To give a good formal foundation on the relational model of data  To introduce the concepts of transactions and transaction processing e. Course Outcomes : Upon the successful completion of the course, students will be able to:

f. Correlation of COs with POs : Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M

CO2 M

CO3 M

CO4 M

CO5 M

CO6 H M M M M

CO7 M H- High; M-Medium; L-Low

g. Course Content: UNIT I INTRODUCTION TO DBMS L – 9 Purpose of Database System – Database Schema and Instances- Views of data – Database Languages - Database System Architecture – Database users and Administrator – Entity– Relationship model – E-R Diagrams - Introduction to relational databases –Structure of relational databases. UNIT II RELATIONAL MODEL L – 9 Basics of the Relational Model- From E/R Diagrams to Relational Designs – Keys and Integrity Constraints - Relational Algebra – Relational Calculus-Tuple –Structured Query language( SQL) Basic and additional Operations – Nested Queries & Join Queries–Embedded SQL- Triggers - View Definitions and Modifications. UNIT III NORMALIZATION L – 9 Introduction and problem of data redundancy-Features of good Relational database design- Functional Dependencies - Normalization – First Normal Form, Second Normal Form and Third Normal Form –Advanced Normalization -Boyce/Codd Normal Form, Fourth Normal Form and Fifth Normal Form- Dependencies preservation-Case Studies of database system. UNIT IV TRANSACTION AND CONCURRENCY L – 9

216

Transaction Concepts – ACID Properties –Transactions and Schedules- Transaction States - Concurrent Execution- Serializability- Types of Failure-Recoverability -System Recovery – Media Recovery – Types of Locks-Two Phase locking – Deadlock- Detection, Recovery and Prevention. UNIT V PHYSICAL STORAGE AND DATABASE CONCEPTS L – 9 Overview of Physical Storage Media – Magnetic Disks – RAID – Introduction to Distributed Databases and Client/Server Databases- Statistical Databases- Multidimensional and Parallel databases- Spatial and multimedia databases- Mobile and web databases- Object Oriented Databases-XML Databases.

TOTAL = 45 periods

Learning Resources

i.Text Books:

1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ―Database SystemConcepts‖, Eighth Edition, Tata McGraw Hill, 2012 (Unit I and Unit-V ) . 2. C.J.Date, A.Kannan, S.Swamynathan, ―An Introduction to Database Systems‖, Eighth Edition, Pearson Education, 2012.( Unit II, III and IV) ii.Reference Books:

1. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systems‖,FourthEdition , Pearson / Addision wesley, 2007.

2. Raghu Ramakrishnan, ―Database Management Systems‖, Third Edition, McGraw Hill, 2003.

3. S.K.Singh, ―Database Systems Concepts, Design and Applications‖, First Edition, Pearson

Education, 2006. iii. Online resources

1. http://cs.ulb.ac.be/public/_media/teaching/infoh303/dbmsnotes.pdf 2. http://www.iitg.ernet.in/awekar/teaching/cs344fall11/lecturenotes/september%2012.pdf

217

COURSE CODE COURSE TITLE L T P C

1153IT103 CRYPTOGRAPHY AND NETWORK SECURITY 3 0 0 3

Course Category:

Foundation (0)/ Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) d. Preamble: This course describes the explosive growth in computer systems and their interconnections via networks, has increased the dependence of both organizations and individuals on the information stored and communicated using these systems. This, in turn, has led to a heightened awareness of the need to protect data and resources from disclosure, to guarantee the authenticity of data and messages, and to protect systems from network-based attacks and the disciplines of cryptography and network security have matured, leading to the development of practical, readily available applications to enforce network security. b. Pre-requisites:

Sl. No Course Code Course Name

1 Data Communication and Computer Networks c. Related Courses:

Sl. No Course Code Course Name

1 Forensics and Cyber Applications

2 Information Security

3 Project Work d. Course Educational Objectives:

Students undergoing this course are expected to

• Learn fundamentals of cryptography and its application to network security. • Understand network security threats, security services, and countermeasures.

• Acquire background on well known network security protocols such as IPSec, SSL, and WEP. • Understand vulnerability analysis of network security.

• Acquire background on hash functions; authentication; firewalls; intrusion detection techniques.

218

G. Course Outcomes: CO Course Outcomes Level of learning domain

Nos (Based on revised Bloom’s

taxonomy)

CO1 Compare various Cryptographic Techniques K3

CO2 Demonstrate various data encryption techniques. K3

CO3 Implement Hashing and Digital Signature techniques K3

CO4 Explain the various Security Application K2

CO5 Design and implement Secure applications K3

f. Correlation of COs with Program Outcomes

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

CO1 H M L L

CO2 M L L

CO3 M M M L

CO4 M M M L H

CO5 M L M L

H- High; M-Medium; L-Low g. Course Content:

UNIT I FOUNDATIONS OF CRYPTOGRAPHY AND SECURITY 10

OSI Security Architecture - Security Attacks and Services. Mathematical Tools for Cryptography: Substitutions and Permutations, Modular Arithmetic, Euclid‘s Algorithm, Finite Fields, Polynomial Arithmetic.. Design Principle of Block ciphers: DES and Triple DES, Modes of Operation ( ECB, CBC, OFB, CFB)

UNIT II BLOCK CIPHER ALGORITHMS AND PUBLIC KEY CRYPTOGRAPHY 9

219

AES- RC5- Introduction to Number Theory : Prime numbers- Chinese remainder theorem-Fermat and Euler‘s theorem –RSA- Public Key Management - Diffie-Hellman key Exchange - Elliptic Curve Cryptography.

UNIT III AUTHENTICATION AND HASH FUNCTION 9

Authentication requirements - Authentication functions - Message Authentication Codes - Hash Functions - Security of Hash Functions and MACs - MD5 message Digest algorithm - Secure Hash Algorithm -SHA 512 – HMAC- Digital Signatures - Authentication Protocols - Digital Signature Standard

UNIT IV NETWORK SECURITY 9

Authentication Applications: Kerberos - X.509 Authentication Service - Electronic Mail Security

- PGP - S/MIME - IP Security - Web Security.

UNIT V SYSTEM LEVEL SECURITY 8

Intrusion detection - password management - Viruses and related Threats - Virus Counter measures - Firewall Design Principles - Trusted Systems.

TOTAL: 45 Periods j. Learning Resources

i. Text Books: 1. Wade Trappe, Lawrence C Washington, ― Introduction to Cryptography with coding theory‖, 2nd ed, Pearson, 2007. 2. William Stallings, ―Cryptography and Network security Principles and Practices‖, Pearson/PHI, 4th ed, 2006. ii. Reference Books: 1. W. Mao, ―Modern Cryptography – Theory and Practice‖, Pearson Education, Second Edition, 2007. 2. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing Third Edition - Prentice Hall of India, 2006. iii. Online Resources: 1. williamstallings.com/Extras/Security-Notes/

220

COURSE CODE COURSE TITLE L T P C

1153IT104 MOBILE COMMUNICATION 3 0 0 3

Course Category:

b. Preamble :

Communication technologies in this era become one of the dominant fields. Especially handheld devices growth such as PDA, Mobile Phones, Tablet, makes use of GSM or 3G for both voice and data. It is must for the computer science engineer to learn the Basics of Wireless and data Communication Technologies. About the various Satellites Networks and Wireless LAN Standards. To known about the various Mobile computing algorithms and Wireless application protocol to Develop mobile content applications.

c. Prerequisite Courses:

Sl No Course Code Course Name

1 Computer Networks c. Related Courses:

Sl No Course Code Course Name

1 Mobile Adhoc and Sensor Networks d. Course Educational Objectives :

Students undergoing this course are exposed to

• The basics of Wireless voice and data communications technologies. • Build working knowledge on various telephone and satellite networks.

• The working principles of wireless LAN and its standards. • Build knowledge on various Mobile Computing algorithms.

221

• Build skills in working with Wireless application Protocols to develop mobile content applications. e. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level

Course Outcomes (Based on revised

Nos.

Bloom’s Taxonomy)

CO1 Explain the basics of wireless communication systems. K2

CO2 Demonstrate the concepts of Telecommunication networks K2

CO3 Design wireless LAN. K2

CO4 Develop and demonstrate various routing protocols. K2

CO5 Work with Wireless application Protocols to develop K2

mobile content application and to appreciate the social and

ethical issues of mobile computing, including privacy.

222 f. Correlation of COs with POs :

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

CO1 M L L

CO2 M L M

CO3 M M M

CO4 M M

CO5 M M

H- High; M-Medium; L-Low g. Course Content :

UNIT I Wireless Communication Fundamentals 9

Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.

UNIT II Telecommunication Networks 9

Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite

Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA

– Broadcast Systems – DAB - DVB.

UNIT III WIRELESS LAN 9

Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE

802.11a - 802.11b standards – HIPERLAN – Blue Tooth.

UNIT IV Mobile Network Layer 9

Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR –

Alternative Metrics.

UNIT V Transport And Application Layers 9

Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.

Total : 45 Hours

223

h. Learning Resources: i. Text Books

f. Jochen Schiller, ―Mobile Communications‖, PHI/Pearson Education, Second Edition, 2003. (UNIT I Chap 1,2 &3- UNIT II chap 4,5 &6-UNIT III Chap 7.UNIT IV Chap 8- UNIT V Chap 9&10.) g. William Stallings, ―Wireless Communications and Networks‖, PHI/Pearson Education, 2002. (UNIT I Chapter – 7&10-UNIT II Chap 9)

ii. Reference Books: i. Kaveh Pahlavan, Prasanth Krishnamoorthy, ―Principles of Wireless Networks‖, PHI/Pearson Education, 2003. j. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile Computing‖, Springer, New York, 2003. k. Hazysztof Wesolowshi, ―Mobile Communication Systems‖, John Wiley and Sons Ltd, 2002. h. Online resources http://www.tutorialspoint.com/Mobile Networks

224

COURSE CODE COURSE TITLE L T P C 1153IT105 Wireless Communication 3 0 0 3

Course Category: Program Core

c. Preamble: Describes the concepts of wireless / mobile communication using cellular environment. Details of various modulation techniques, propagation methods, coding and multi access techniques used in mobile communication.

b. Pre-requisites:

Sl. No Course Code Course Name

1 1151IT108 Computer Networks

c.Related Courses

Sl.No Course Code Course Name

1 1152IT104 Mobile ad hoc and Sensor Networks

2 1151IT113 Mobile Communication

H. Course Outcomes: CO Course Outcomes Level of learning domain

Nos (Based on revised Bloom’s

225

taxonomy)

CO1 Explain the techniques and services of wireless communication K3

CO2 Demonstrate the propagation mechanism K3

CO3 Illustrate the shift keying strategies K3

CO4 K2

Describe the signal processing system.

CO5 K3

Summarize transceiver schemes

f. Correlation of COs with Program Outcomes

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

CO1 H M L L

CO2 M L L

CO3 M M M L

CO4 M M M L H

CO5 M L M L

H- High; M-Medium; L-Low

h. Course Content

UNIT I SERVICES AND TECHNICAL CHALLENGES 9

Types of Services, Requirements for the services, Multipath propagation, Spectrum Limitations, Noise and Interference limited systems, Principles of Cellular networks, Multiple Access Schemes.

UNIT II WIRELESS PROPAGATION CHANNELS 9

226

Propagation Mechanisms (Qualitative treatment), Propagation effects with mobile radio, Channel Classification, Link calculations, Narrowband and Wideband models.

UNIT III WIRELESS TRANSCEIVERS 9

UNIT IV SIGNAL PROCESSING IN WIRELESS SYSTEMS 9

UNIT V ADVANCED TRANSCEIVER SCHEMES 9

TEXT BOOKS

1. Andreas.F. Molisch, ―Wireless Communications‖, John Wiley – India, 2006. 2. Simon Haykin & Michael Moher, ―Modern Wireless Communications‖, Pearson Education, 2007.

REFERENCES

1. Rappaport. T.S., ―Wireless communications‖, Pearson Education, 2003. 2. Gordon L. Stuber, ―Principles of Mobile Communication‖, Springer International Ltd., 2001. 3. Andrea Goldsmith, Wireless Communications, Cambridge University Press, 2007.

227

COURSE CODE COURSE TITLE L T P C 1153IT106 MULTIMEDIA COMMUNICATION 3 0 0 3

a.Preamble : This course provides an introduction to Standards for Multimedia Communications, provides concepts of Broadband ATM networks, Multimedia Communications Across different Networks. j. Prerequisite Courses: Computer networks k. Related Courses: Network security Principles and protocols l. Course Educational Objectives : Students undergoing this course are expected:  To learn the multimedia communication standards and compression techniques.  To understand the multimedia communication models  To analyze the guaranteed service model  To study the multimedia transport in wireless networks  To explore real-time multimedia network applications

e.Course Outcomes:

CON Level of learning domain(Based Course Outcomes os on revised Bloom’s taxonomy)

g. Course Content: Unit I

228

Multimedia Communications -Introduction-Multimedia networks-Multimedia applications- Applications and networking terminology- Audio compression and Video Compression Unit II Standards for Multimedia Communications-Introduction-Reference models-Standards relating to interpersonal communications-Standards relating to interactive applications over the Internet Standards for entertainment applications. Digital communication basics: Transmission media Sources of signal impairment-Asynchronous transmission-Synchronous transmission-Error Detection methods Unit III The Internet-IP data grams-Fragmentation and reassembly-IP addresses-ARP and RARP Routing algorithms-ICMP-QoS support-The PPP link layer protocol-IPv6-IPv6/IPv4 interoperability Unit IV Broadband ATM networks: Cell format and switching principles- Switch architectures-Protocol architecture. Entertainment networks and high-speed modems: Cable TV networks-Satellite television networks-Terrestrial television networks-High-speed PSTN access technologiesTransport protocols: TCP/IP protocol suite-UDP-RTP and RTCP Unit V Multimedia Communications Across Networks: Packet Audio/Video in the network Environment -Video transport across generic networks-Multimedia transport across ATM networks – Multimedia across IP networks – Multimedia across DSLs – Internet access Networks – Multimedia across wireless - Mobiles Networks – Broadcasting Networks – Digital Television infrastructure for interactive multimedia services

229

COURSE CODE COURSE TITLE L T P C 1153IT107 VIRTUALIZATION TECHNIQUES 3 0 0 3

Course Category:

Foundation (0) / Program Core (1) / Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7). a.Preamble It aims to create a virtual version of a device or resource, such as a server, storage device, network or even an operating system where the framework divides the resource into one or more execution environments. Even something as simple as partitioning a hard drive is considered virtualization because you take one drive and partition it to create two separate hard drives. Devices, applications and human users are able to interact with the virtual resource as if it were a real single logical resource. h. Prerequisite Courses:

CLOUD COMPUTING i. Related Courses:

DISTRIBUTED COMPUTNG GRID COMPUTING j. Course Educational Objectives :

Students undergoing this course are expected to

Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy)

230

Deploy legacy OSs on virtual machines CO1 K2

Understand the intricacies of server, storage, network, desktop and CO2 application virtualizations K3

Design new models for virtualization CO3 K3

Design and develop cloud applications on virtual machine CO4 platforms K2

Design new models for Bigdata processing in cloud CO5 K3

l. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M L L

CO2 M L M

CO3 M M M

CO4 M M

CO5 M M  H- High; M-Medium; L-Low

m. Course Content :

231

UNIT – V SECURITY : Secure Virtual Infrastructure- Protect Virtual Infrastructure-Prepare Business Continuity -Update Management Structure

h.Learning Resources

i.Textbook :

1. Dan Kusnetzky ,‖Virtualization: A Manager’s Guide‖, O‘Reily,2011

ii. Reference Books

1. Danielle Ruest, Nelson Ruest,‖ Virtualization: A Beginner’s Guide‖,McGraw Hill, 2009

2. Chris Wolf, Erick M. Halter ,‖Virtualization: From Desktop to the Enterprise‖, A Press, 2006

iii. Online Resources

1.http://www.ss.pku.edu.cn/vs/style/resources/Introduction%20to%20Virtualization.pdf 2. http://www.vmware.com/in/virtualization 3.http://bradhedlund.com/2013/01/28/network-virtualization-a-next-generation-modular-platform-for-the- virtual-network/ 4.http://en.wikipedia.org/wiki/Desktop_virtualization 5.http://www.vmware.com/files/pdf/cloud/vmware-cloud-solution-security-in-the-cloud-wp-en.pdf

232

COURSE CODE COURSE TITLE L T P C 1153IT108 DIGITAL IMAGE PROCESSING 3 0 0 3

a.Preamble : This course provides an introduction regarding the various image processing techniques

h. Prerequisite Courses: Introduction to digital images, digital processing techniques

i. Related Courses:  Digital signal processing  Digital programming concepts

j. Course Educational Objectives : Students undergoing this course are expected:  Tostudy the image fundamentals and mathematical transforms necessary for imag e processing.  To study the image enhancement techniques  To study image restoration procedures.  To study the image compression procedures.  To study the image segmentation and representation techniques.

k. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) CO1 Mathematical transforms necessary for image processing. K1 CO2 Image enhancement techniques K2

 CO3 Image restoration procedures. K2  CO4 Image compression procedures K2

 CO5 Image segmentation and representation techniques. K2

l. Correlation of COs with POs :

233

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 M L CO1 L M L CO2 M

CO3 M M M

CO4 M M

CO5 M M H- High; M-Medium; L-Low

m. Course Content: UNITI Elements of digital image processing systems, Vidicon and Digital Camera working principles, Elements ofvisual perception, brightness, contrast, hue, saturation, mach band effect, Color image fundamentals UNIT II IMAGE ENHANCEMENT Histogram equalization and specification techniques, Noise distributions, Spatial averaging, Dire ctionalSmoothing, Median, Geometric mean, Harmonic mean, Contraharmonic mean filters, Ho momorphic filtering,Color image enhancement. UNITIII IMAGERESTORATION

Image Restoration degradation model, Unconstrained restoration Lagrange multiplier and Constrainedre storation, Inverse filteringremoval of blur caused by uniform linear motion, Wiener filtering, Geometri ctransformations-spatial transformations.

UNITIVIMAGESEGMENTATION

Edge detection, Edge linking via Hough transform – Thresholding - Region based segmentation RegiongrowingRegion splitting and Merging Segmentation by morphological Watersheds basic concepts –Dam construction

UNIT V IMAGE COMPRESSION

Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding, VectorQuantization, Transform coding, JPEG standard, MPEG.

Total 45 periods

i. Learning Resources i) TEXTBOOK

1. Rafael C. Gonzalez, Richard E. Woods, , Digital Image Processing', Pearson, Second Edition,2004.

2. Anil K. Jain, , Fundamentals of Digital Image Processing', Pearson 2002.

234 ii) REFERENCE BOOKS

1.Kenneth R. Castleman, Digital Image Processing, Pearson, 2006. 2. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,' Digital Image Processing using MATLAB',Pe arson Education, Inc., 2004. 3. D,E. Dudgeon and RM. Mersereau, , Multidimensional Digital Signal Processing', Prentice HallProfess ional Technical Reference, 1990.

4. William K. Pratt, , Digital Image Processing' , John Wiley, New York, 2002

5. Milan Sonka et aI, 'IMAGE PROCESSING, ANALYSIS AND MACHINE VISION', Brookes/Cole, V ikasPublishing House, 2nd edition, 1999,iii) Online Learning:

 www.amazon.com/Digital image processing-Applications.../dp/1852333081

 www.myreaders.info/01_Introduction_to_digital image processing.pdf

235

COURSE CODE COURSE TITLE L T P C 1153IT201 JAVA PROGRAMMING 1 0 4 3

UNIT – I Basics of Java

History and Features of Java - Difference between JDK,JRE and JVM – Basic Language Elements - Lexical Tokens, Identifiers, Keywords, Literals, Comments ,Primitive Datatypes, Operators Assignments, I/O Operations

UNIT – II Classes and Objects

Advantage of OOPs - Object and Class - Method Overloading – Keywords – this, super, final, strictfp – call by value – call by reference - Nested classes - Constructor – Arrays

UNIT – III Inheritance

Benefits - Types – Inheriting Data Members and Methods - Method Overriding – Polymorphism – Abstract classes and methods – Implementing Interfaces

UNIT – IV Multithreading

Multithreading - Life Cycle of a Thread - Creating Thread - Thread Schedular - Sleeping a thread - Joining a thread - Thread Priority - Thread Pooling - Thread Group - Performing multiple task by multiple thread - Runnable class

UNIT – V Packages and Exception handling

Packages - Organizing Classes and Interfaces in Packages - Package as Access Protection - Defining Package - Naming Convention For Packages. Exceptions – Types - Control Flow In Exceptions, JVM reaction to Exceptions – try – catch - - finally – throw - throws in Exception Handling - In-built and User Defined Exceptions

H. Learning Resources TEXT BOOK 1. Herbert Schildt, ―Java – The Complete Reference‖, Ninth edition, Oracle press.

REFERENCES 1. Simon Kendal, ―Object oriented Programming using Java‖, First Edition, Pearson Education 2. E. Balagurusamy, ―Programming with Java – A Primer‖, Third edition, McGraw-Hill companies

236

COURSE CODE COURSE TITLE L T P C 1153IT110 PYTHON PROGRAMMING FUNDAMENTALS 3 0 0 3

UNIT I – INTRODUCTION 9

UNIT II DATA, EXPRESSIONS, STATEMENTS 9 Python interpreter and interactive mode; values and types: int, float, boolean, string, and list; variables, expressions, statements, tuple assignment, precedence of operators, comments; modules and functions, function definition and use, flow of execution, parameters and arguments; Illustrative programs: exchange the values of two variables, circulate the values of n variables, distance between two points.

UNIT III CONTROL FLOW, FUNCTIONS 9 Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained conditional (if-elif-else); Iteration: state, while, for, break, continue, pass; Fruitful functions: return values, parameters, local and global scope, function composition, recursion; Strings: string slices,immutability, string functions and methods, string module; Lists as arrays. Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.

UNIT IV LISTS, TUPLES, DICTIONARIES 9 Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters; Tuples: tuple assignment, tuple as return value; Dictionaries: operations and methods; advanced list processing – list comprehension.

UNIT V FILES, MODULES, PACKAGES 9 Files and exception: text files, reading and writing files, format operator; command line arguments, errors and exceptions, handling exceptions, modules, packages; Illustrative programs: word count, copy file.

TOTAL:45 PERIODS

COURSE OUTCOMES:

 Structure simple Python programs for solving problems.

237

 Read, write, execute by hand simple Python programs.  Read and write data from/to files in Python Programs.  Represent compound data using Python lists, tuples, and dictionaries.  Decompose a Python program into functions.

TEXT BOOKS:

1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist‘‘, 2nd edition, Updated for Python 3, Shroff/O‘Reilly Publishers, 2016 (http://greenteapress.com/wp/think- python/)

2. Guido van Rossum and Fred L. Drake Jr, ―An Introduction to Python – Revised and updated for Python 3.2, Network Theory Ltd., 2011.

REFERENCES:

1. Charles Dierbach, ―Introduction to Computer Science using Python: A Computational Problem-Solving Focus, Wiley India Edition, 2013.

2. John V Guttag, ―Introduction to Computation and Programming Using Python‘‘, Revised and expanded Edition, MIT Press , 2013

3. Kenneth A. Lambert, ―Fundamentals of Python: First Programs‖, CENGAGE Learning, 2012.

4. Paul Gries, Jennifer Campbell and Jason Montojo, ―Practical Programming: An Introduction to Computer Science using Python 3‖, Second edition, Pragmatic Programmers,LLC,2013.

5. Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming in Python: An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.

6. Timothy A. Budd, ―Exploring Python‖, Mc-Graw Hill Education (India) Private Ltd.,, 2015.

238

COURSE CODE COURSE TITLE L T P C 1153IT202 SQL FUNDAMENTALS 1 0 4 3

UNIT 1: BASIC CONCEPTS

Introduction to Databases – Database design-Process of database design - ER Model – ER diagram- Identifying entities, attributes and its relationships - Relational Algebra – Relational Calculus- Keys and Integrity Constraints

UNIT 2: DDL, DML AND JOINS

Data definition language-Data Manipulation Language- SQL Syntax Rules -Retrieving Data using the SQL SELECT Statement -The WHERE Statement- SQL Operators - SQL Data Types - Sub queries and Nested queries - LIKE and MIN- Joining Tables - Types of Join –Clauses – Conditions – Aliases.

UNIT 3: NORMALIZATION

Functional Dependencies - Normalization – First Normal Form, Second Normal Form and Third Normal Form –Advanced Normalization -Boyce/Codd Normal Form

UNIT 4: PL/SQL PROCEDURES Control structure, Stored procedures, Triggers - View Definitions and Modifications, SQL Injections and SQL Hosting.

UNIT 5: FORM DESIGN AND DATABASE CONNECTIVITY Forms and menu design (using visual basic) – database connectivity: JDBC, ODBC - Report generation- Case Studies.

Learning Resources i. Text Book 1. SQL: The Complete Reference, 3 rd Edition, James R.Groff, Paul.N.Weinberg. Andrew J.Oppel, McGraw – Hill Education ii. References 1. SQL QuickStart Guide: The Simplified Beginner's Guide To SQL , ClydeBank Technology . 2. SQL: The Ultimate Beginners Guide: Learn SQL Today, Steve Tale . 3. Learning SQL: Master SQL Fundamentals 2nd Edition by Alan Beauli.

239

COURSE CODE COURSE TITLE L T P C 1153IT203 C++ Programming Fundamentals 1 0 4 3

UNIT I Object Oriented Programming Concepts – Objects – Classes – Methods And Messages – Abstraction and Encapsulation – Inheritance – Abstract Classes – Polymorphism - Applications of OOP - Introduction to C++ – Classes – Access Specifiers – Function and Data Members – Default Arguments – Function Overloading – Friend Functions – Static Members – Objects – Nested Classes UNIT II Constructors – Default constructor – Parameterized constructors – Constructor with dynamic allocation – Copy constructor – Destructors – Operator overloading – Unary operator overloading – Binary operator overloading - Overloading the assignment operator UNIT III Inheritance – public, private, and protected derivations – Multiple Inheritance - Virtual Base Class – Abstract Class UNIT IV Exception handling – Try-Catch-Throw paradigm – Exception Specification – Terminate and Unexpected Functions – Uncaught Exception. UNIT V Runtime polymorphism – virtual functions – pure virtual functions – I/O operations – Formatted I/O operations – Unformatted I/O operations – Manipulators - File handling

i.Text Books :

1. B. Trivedi, ―Programming with ANSI C++‖, Oxford University Press, 2012 ii.Reference:

1. Goran Svenk, ―Object-oriented Programming: Using C++ for Engineering and Technology‖Second Edition 2003.

2. Balagurusamy, ―Object-oriented Programming with C++‖ Tata McGraw-Hill Education, Fourth Edition 2008

3. Ira Pohl, ―Object Oriented Programming using C++‖, Pearson Education, Second Edition Reprint 2004.

4. B. Lippman, Josee Lajoie, Barbara E. Moo, ―C++ Primer‖, Fourth Edition, Pearson Education, 2005.

240

Sl.N Course Code University Elective L T P C o

1 1154IT101 Computer Networks 3 0 0 3

2 1154IT102 Object Oriented programming 3 0 0 3

3 1154IT103 Fundamentals of IT 3 0 0 3

4 1154IT104 Operating Systems 3 0 0 3

5 1154IT105 Mobile Application Development 3 0 0 3

7 1154IT201 Java Programming(Lab Dominated) 1 0 4 3

8 1154IT107 Python Programming Fundamentals 3 0 0 3

9 1154IT202 SQL Fundamental(Lab Dominated) 1 0 4 3

10 1154IT203 C++ Programming Fundamentals(Lab Dominated) 1 0 4 3

241

COURSE CODE COURSE TITLE L T P C 1154IT101 COMPUTER NETWORKS 3 0 0 3

PRE-REQUISITE:  Principles of Data communication  Data Structure

LINKS TO OTHER COURSES  Network Programming  Information Security

COURSE EDUCATIONAL OBJECTIVES  To understand the concepts of Network devices.  To study the functions of layers.  To understand the switching techniques in computer networking.  To study the different forms of security.  To make the students to get familiarized with different protocols and network components.

COURSE OUTCOMES: Students undergoing this course are able to: Level of learning domain CO Course Outcomes (Based on revised Nos. Bloom’s taxonomy) Describe various modes of communication and C01 devices K2

 C02 Illustrate the function of layers K2

 C03 Various switching formats and connecting services K2

 C04 Describe various form of security K2 Apply various protocols and explain about  C05 K3 their applications

COURSE CONTENT

UNIT I Introduction L-9+T-3

Networks Applications, Network devices: Hub, Switches, Bridges, Routers, Gateways, Network card, Line configuration - point to point- Multipoint, Topology - Mesh - Star- Tree-Bus-Ring-Hybrid: Categories of Networks: LAN, WAN, MAN.

242

UNIT II Functions of layers L-9+T-3

Transmission Modes: Simplex, Half duplex, Full duplex - OSI Model - Functions of layers – Signals: Analog Signals & Digital Signals, Transmission Media: guided media- twisted pair cable, coaxial cable, fiber optic cable, un-guided media.

UNIT III Switching Techniques L-9+T-3

Types of error: single bit error, Burst error , Switching Techniques: Circuit Switching, Packet Switching, Message Switching - Connection Oriented & Connectionless Services.

UNIT IV Cryptography L-9+T-3

Presentation Layer: Translation-direct method and indirect method - encryption/decryption-conventional methods: character level encryption, bit level encryption - public key method: DES algorithm, RSA algorithm, Authentication, Data Compression.

UNIT V Protocols L-9+T-3

Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW –.Case Study: ATM, TCP/IP – Overview.

TOTAL: 45+15(Tutorial) = 60 periods

LEARNING RESOURSES:

TEXT BOOKS

1. Behrouz Forouzan, ―Data Communication and Networks‖, McGraw Hill, 2012

2. Andrew S. Tanenbaum , Computer Networks, Prentice Hall of India,2011.

REFERENCE BOOKS BOOKS

 James F. Kurose and Keith W. Ross Pearson ―Computer Networking: A Top-Down Approach‖Addison-Wesley, Boston MA , Ó2008. ISBN 0 - 321 - 49770 – 8  Bruce A. Hallberg‖ Networking: A Beginner's Guide‖ McGraw-Hill / Osborne, 2003 ISBN 0 - 07 - 222563 – 7  William Stallings, ―Data and Computer Communication‖, Eighth Edition, Pearson Education, 2007.  Nader F. Mir, ―Computer and Communication Networks‖, First Edition, Pearson Education, 2007  Douglas E. Comer, ―Computer Networks and Internets with Internet Applications‖, Fourth Edition, Pearson Education, 2003.

243

COURSE CODE COURSE TITLE L T P C 1154IT102 OBJECT ORIENTED PROGRAMMING 3 0 0 3 Course Category: Foundation (0)/Program Core (1)/ Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7)

Course Objectives:

Students undergoing this course are expected to:

 Understand of the utility of object oriented programming over procedure oriented programming.  Know the concept of code reusability to use third party code in the form of predefined classes to write their programs.  Use the programs written by others and write the programs that can be used by others without exposing the source code, using package and interface concepts.  Understand exception handling mechanism for handling exceptional situation that occur during run time.

Course Outcomes:

Students undergoing this course are able to:

 Write computer programs in java using object oriented concepts.  Write sophisticated programs that take care of exceptional situations.  Develop sophisticated, interactive, user friendly software for real world applications.  Develop reusable software components/tools which can be used for developing other sophisticated software.

Pre-requisites:

Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

Course Content

UNIT I 9

Object oriented programming concepts – objects – classes – methods and messages – abstraction and encapsulation – inheritance – abstract classes – polymorphism.

Introduction to C++ – classes – access specifiers – function and data members – default arguments – function overloading – friend functions – const and volatile functions - static members – Objects – pointers and objects – constant objects – nested classes – local classes

244

UNIT II 9

UNIT III 9

Function and class templates - Exception handling – try-catch-throw paradigm – exception specification – terminate and unexpected functions – Uncaught exception.

UNIT IV 8

UNIT V 10

RTTI – typeid – dynamic casting – RTTI and templates – cross casting – down casting .

Streams and formatted I/O – I/O manipulators - file handling – random access – object serialization – namespaces - std namespace – ANSI String Objects – standard template library.

Text Book

1. B. Trivedi, ―Programming with ANSI C++‖, Oxford University Press, 2007.

Reference Books

1. Ira Pohl, ―Object Oriented Programming using C++‖, Pearson Education, Second Edition Reprint 2004.. 2. S. B. Lippman, Josee Lajoie, Barbara E. Moo, ―C++ Primer‖, Fourth Edition, Pearson Education, 2005. B. Stroustrup, ―The C++ Programming language‖, Third edition, Pearson Education, 2004

245

COURSE CODE COURSE TITLE L T P C

1154IT103 Fundamentals of IT 3 0 0 3 Course Category:

l. Preamble

Nil

n. Related Courses:

 Software Engineering  Computer Networks o. Course Educational Objectives : Students undergoing this course are expected to

246

p. Course Outcomes : Upon the successful completion of the course, students will be able to:

Knowledge Level CO Course Outcomes (Based on revised Nos. Bloom’s Taxonomy) Explain terms and concepts of information Technology (H/W, S/W, CO1 N/W, security, internet/web, and Applications) K2

Describe the relation between IT and other computing disciplines CO2 K2 Explore the elements of an IT application and business process CO3 integration. K2

Use internet / web services as a resource for learning and discovery CO4 K2 Create useful end products in IT areas of internet to explore major, CO5 career, skills, interest and talents. K3

q. Correlation of COs with POs :

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M H

CO2 M H

CO3 M H

CO4 M H H

CO5 M H  H- High; M-Medium; L-Low

r. Course Content :

UNIT I-COMPUTING FLAVOURS IN INFORMATION TECHNOLOGY (8 hours)

247

UNIT II-COMPUTING DISCIPLINES IN IT (5 hours)

Problem Space of Computing - Computing Disciplines – Definition of IT - Relationship between IT and other computing disciplines - Relationship between IT and non computing disciplines

UNIT III- IT APPLICATION AND BUSINESS PROCESS INTEGRATION (7 hours)

Emergence of complexity in IT – Tools and Techniques to handle complexity – Elements of an IT application – Business Processes - Project Management – Cost Benefit Analysis - Integration of Processes.

UNIT IV- IT PROFESSIONAL CHARACTERISTICS (5 hours)

Professionalism–Responsibility - Interpersonal Skills - Life-long Learning- Computing Ethics - Crime, Law, Privacy and Security.

UNIT V- IT SECTORS AND SERVICES (5 hours)

Medical Applications- Business Applications- Law Enforcement and Political Processes- E-commerce- Manufacturing- Education- Entertainment – Agriculture– BioInformatics

Total: 45 s. Learning Resources t. i. TEXT BOOKS

248

COURSE CODE COURSE TITLE L T P C 1154IT104 OPERATING SYSTEMS 3 0 0 3 Course Category: Foundation (0)/Program Core (1)/ Program Elective (2) / Allied Elective (3) / University Elective (4) / Value Education Elective (5) / Independent Learning (6) / Industry - Higher Learning Institute Interaction (7) H. Preamble : In this course will be discussing about Address spaces, system call interface, process/threads, inter process communication, deadlock, scheduling, memory, virtual memory, file systems. I. Prerequisite Courses: Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C J. Related Courses: Sl. No Course Code Course Name

K. Course Educational Objectives : Learners are exposed to  Overview the components of an operating systems  The concepts of the process and threads  Principles of deadlock and related problems of starvations  Design issues related to processor scheduling  Thorough knowledge of Process management, Storage management and File Management L. Course Outcomes : Upon the successful completion of the course, students will be able to:

Level of learning domain CO Course Outcomes (Based on revised Nos. Bloom’s taxonomy) Explain the operating system program, structures and operations CO1 K2 with system calls  CO2 Analyze the process management concept for the given situation. K3  CO3 Handle the deadlock and get knowledge about CPU scheduling. K3 CO4 Explain the different storage management for the given situation. K2 CO5 Explain the mass storage structure and file system Interface. K2 M. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 L M M CO2 L H M M CO3 L H M M CO4 L M M M CO5 L M M L H- High; M-Medium; L-Low

249

N. Course Content: UNIT I OPERATING SYSTEMS OVERVIEW 9

Operating system overview: Objectives – functions - Computer System Organization-Operating System Structure - Operating System Operations- System Calls, System Programs.

UNIT II PROCESS MANAGEMENT 9

Processes: Process Concept - Process Scheduling - Operations on Processes – Inter process Communication. Process Synchronization: The Critical-Section Problem - Semaphores - Classic Problems of Synchronization – Monitors. Case Study: Windows 10 operating system

UNIT III SCHEDULING AND DEADLOCK MANAGEMENT 9

CPU Scheduling: Scheduling Criteria - Scheduling Algorithms. Deadlocks: Deadlock Characterization - Methods for Handling Deadlocks - Deadlock Prevention - Deadlock Avoidance - Deadlock Detection - Recovery from Deadlock. Case Study: MAC operating system

UNIT IV STORAGE MANAGEMENT 9

Main Memory: Swapping - Contiguous Memory Allocation, Segmentation, Paging. Virtual Memory: Demand Paging - Page Replacement - Allocation of Frames - Thrashing. Case Study: Android operating system

UNIT V STORAGE STRUCTURE 9

Mass Storage Structure: Disk Structure - Disk Scheduling - Disk Management. File-System Interface: File Concepts, Directory Structure - File Sharing – Protection. File System. Case Study: Linux operating system

TOTAL: 45 PERIODS h. Learning Resources i. Text Books: 3. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating System Concepts‖, 9th Edition, John Wiley and Sons Inc., 2012. 4. Richard Petersen, ―Linux: The Complete Reference‖, 6th Edition, Tata McGraw-Hill, 2008.

250

COURSE CODE COURSE TITLE L T P C 1154IT105 MOBILE APPLICATION DEVELOPMENT 3 0 0 3

A. Preamble : In this modern era almost every hands has a handheld devices. Each handheld device have the computing capability to meet the half the needs of user such as banking, browsing, education and emergency etc. It is a must for a computer engineer to have some basic knowledge about the handheld devices platform and its supporting software development. This course will give adequate knowledge in developing a mobile applications for different such as Android, iOS, Windows.

B. Prerequisite Courses:

Sl. No Course Code Course Name 1 1150CS201 Problem Solving using C

C. Related Courses: Sl. No Course Code Course Name 1 1156CS601 Minor Project

2 1156CS701 Major Project

D. Course Educational Objectives : Learners are exposed to  Basics about mobile platform  Techniques in implementation, software design, and user-interaction design for mobile application.

E. Course Outcomes : Upon the successful completion of the course, students will be able to:

Level of learning domain CO Course Outcomes (Based on revised Nos. Bloom’s taxonomy) CO1 Explain Basics Mobile Platform K2 CO2 Develop Android application K3 CO3 Familiarize in the Graphics used for Android application K2 development CO4 Test the developed app using Testing tools K3 CO5 Demonstrate to publish the app in various ways K2

251

F. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M CO2 M H

CO3 M H

CO4 M H

CO5 M H H- High; M-Medium; L-Low G. Course Content:

UNIT 1: GETTING STARTED WITH MOBILITY 9

Mobility landscape- Mobile platform- Mobile apps development, Overview of Android platform-setting up the mobile app development environment along with an emulator- case study on Mobile app development

UNIT II: BUILDING BLOCKS OF MOBILE APPS 9

App user interface designing – mobile UI resources (Layout, UI elements, Draw-able, Menu), Activity- states and life cycle, interaction amongst activities

UNIT III: SPRUCING UP MOBILE APPS 9

Graphics and animation – custom views, canvas, animation APIs, multimedia – audio/video playback and record location awareness- native hardware access (sensors such as accelerometer and gyroscope)

UNIT IV: TESTING MOBILE APPS 9

Debugging mobile apps- White box testing-Black box testing- test automation of mobile apps- JUnit for Android

UNIT V: TAKING APPS TO MARKET 9

Versioning, signing and packaging mobile apps, distributing apps on mobile market place

252

Total : 45

H. Learning Resources I. Text Books 5. ―Anubhav Pradhan, Anil V Deshpande‖ Composing Mobile Apps Learn|Explore|Apply using Andriod, Wiley Publications 1st Edition 2014. 6. Jeff. McWherter and Scott Gowell ―Professonal Moblie Application Development‖ John Wiley & Sons Ltd. 7. Mark Gargenta, ―Learning ANDROID‖, Oreilly Publication, First Edition, March 2011. 8. James Dovey and Ash Furrow, ―Beginning Objective C‖, Apress, 2012 ii. Reference Books 3. David Mark, Jack Nutting, Jeff LaMarche and Frederic Olsson, ―Beginning iOS 6 Development: Exploring the iOS SDK‖, Apress, 2013. 4. Charlie Collins, Michael Galpin and Matthias Kappler, ―Android in Practice‖, DreamTech, 2012 iii. Online Resources 6. http://developer.android.com/develop/index.html 7. http://www.cmer.ca/cmer-ak/course_01.html 8. vjit.ac.in/new/wp-content/.../Mobile-Application-Development.doc 9. http://www.eli.sdsu.edu/courses/fall09/cs696/notes/index.html

253

COURSE CODE COURSE TITLE L T P C 1154IT201 JAVA PROGRAMMING 1 0 4 3

UNIT – I Basics of Java

UNIT – II Classes and Objects

Advantage of OOPs - Object and Class - Method Overloading – Keywords – this, super, final, strictfp – call by value – call by reference - Nested classes - Constructor – Arrays

UNIT – III Inheritance

Benefits - Types – Inheriting Data Members and Methods - Method Overriding – Polymorphism – Abstract classes and methods – Implementing Interfaces

UNIT – IV Multithreading

UNIT – V Packages and Exception handling

I. Learning Resources TEXT BOOK 1. Herbert Schildt, ―Java – The Complete Reference‖, Ninth edition, Oracle press.

REFERENCES 1. Simon Kendal, ―Object oriented Programming using Java‖, First Edition, Pearson Education 3. E. Balagurusamy, ―Programming with Java – A Primer‖, Third edition, McGraw-Hill companies

254

COURSE CODE COURSE TITLE L T P C 1154IT107 PYTHON PROGRAMMING FUNDAMENTALS 3 0 0 3

UNIT I – INTRODUCTION

Installing Python-Basics Syntax-interactive shell,editing,saving,Running a script-Variables-Assignments- Immutable variables-Numerical types-Arithmetic Operators-Experssions-Comments in the Program- Understanding the error Messages. UNIT II DATA, EXPRESSIONS, STATEMENTS Python interpreter and interactive mode; values and types: int, float, boolean, string, and list; variables, expressions, statements, tuple assignment, precedence of operators, comments; modules and functions, function definition and use, flow of execution, parameters and arguments; Illustrative programs: exchange the values of two variables, circulate the values of n variables, distance between two points.

UNIT III CONTROL FLOW, FUNCTIONS Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained conditional (if- elif-else); Iteration: state, while, for, break, continue, pass; Fruitful functions: return values, parameters, local and global scope, function composition, recursion; Strings: string slices, immutability, string functions and methods, string module; Lists as arrays. Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.

UNIT IV LISTS, TUPLES, DICTIONARIES Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters; Tuples: tuple assignment, tuple as return value; Dictionaries: operations and methods; advanced list processing – list comprehension.

UNIT V FILES, MODULES, PACKAGES Files and exception: text files, reading and writing files, format operator; command line arguments, errors and exceptions, handling exceptions, modules, packages; Illustrative programs: word count, copy file.

TEXT BOOKS:

1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist‘‘, 2nd edition, Updated for Python 3, Shroff/O‘Reilly Publishers, 2016

2. Guido van Rossum and Fred L. Drake Jr, ―An Introduction to Python – Revised and updated for Python 3.2, Network Theory Ltd., 2011. REFERENCES:

1. Charles Dierbach, ―Introduction to Computer Science using Python: A Computational Problem-Solving Focus, Wiley India Edition, 2013.

255

COURSE CODE COURSE TITLE L T P C 1154IT202 SQL FUNDAMENTALS 1 0 4 3

UNIT 1: BASIC CONCEPTS

UNIT 2: DDL, DML AND JOINS

UNIT 3: NORMALIZATION

Functional Dependencies - Normalization – First Normal Form, Second Normal Form and Third Normal Form –Advanced Normalization -Boyce/Codd Normal Form

UNIT 4: PL/SQL PROCEDURES Control structure, Stored procedures, Triggers - View Definitions and Modifications, SQL Injections and SQL Hosting.

UNIT 5: FORM DESIGN AND DATABASE CONNECTIVITY Forms and menu design (using visual basic) – database connectivity: JDBC, ODBC - Report generation- Case Studies.

256

COURSE CODE COURSE TITLE L T P C 1154IT203 C++ Programming Fundamentals 1 0 4 3

i.Text Books :

2. B. Trivedi, ―Programming with ANSI C++‖, Oxford University Press, 2012 ii.Reference:

1. Goran Svenk, ―Object-oriented Programming: Using C++ for Engineering and Technology‖Second Edition 2003.

2. Balagurusamy, ―Object-oriented Programming with C++‖ Tata McGraw-Hill Education, Fourth Edition 2008

3. Ira Pohl, ―Object Oriented Programming using C++‖, Pearson Education, Second Edition Reprint 2004.

4. B. Lippman, Josee Lajoie, Barbara E. Moo, ―C++ Primer‖, Fourth Edition, Pearson Education, 2005.

257