m.tech. (full time) - information technology curriculum & syllabus 2013 ... · 2013 – 2014...

0 IT2013 SRM(E&T)

M.Tech. (Full Time) - INFORMATION TECHNOLOGY

CURRICULUM & SYLLABUS

2013 – 2014

DEPARTMENT OF INFORMATION TECHNOLOGY

FACULTY OF ENGINEERING AND TECHNOLOGY

SRM UNIVERSITY

SRM NAGAR, KATTANKULATHUR – 603 203

1 IT2013 SRM(E&T)

DEPARTMENT OF INFORMATION TECHNOLOGY

M.Tech. (Full Time) - INFORMATION TECHNOLOGY

CURRICULUM & SYLLABUS

2013 – 2014 Course

Code Course Name L T P C

I AND II SEMESTER

IT2001 Data Structures and Algorithms 3 0 2 4

DB2001 Database Management Systems 3 0 2 4

IT2002 Object Oriented Software Engineering 3 0 2 4

IT2003 Operating Systems and Linux Administration 3 0 2 4

IT2004 Applied Advanced Routing 3 0 2 4

IT2005 Heterogeneous Computing 3 0 2 4

III SEMESTER

IT2047 Seminar 0 0 1 1

IT2049 Project Work Phase-I 0 0 12 6

IV SEMESTER

IT2050 Project Work Phase-II 0 0 32 16

SUPPORTIVE COURSE

MA2013 Mathematical Foundations of Computer Science

3 0 0 3

INTER DISCIPLINARY ELECTIVE

One course to be taken in Semester I or II or II 3 0 0 3

PROGRAM ELECTIVES

6 courses of 3 credits each to be taken in Semesters I -III

- - - 18

TOTAL CREDITS 71

Total Number of credits to be earned for M.Tech degree: 71

CONTACT HOUR/CREDIT:

L: Lecture Hours per week T: Tutorial Hours per week

P: Practical Hours per week C: Credit

2 IT2013 SRM(E&T)

PROGRAM ELECTIVES

Course

Code Course Name L T P C

IT2101 Electronic Commerce 2 0 2 3

IT2102 Mobile Computing 3 0 0 3

IT2103 Mobile Application Development 2 0 2 3

IT2104 Internet Programming 2 0 2 3

IT2105 Artificial Intelligence Planning 3 0 0 3

IT2106 Multilayer Switching 2 0 2 3

IT2107 Software Testing 2 0 2 3

IT2108 Software Quality Management 3 0 0 3

IT2109 Software Reliability Engineering 3 0 0 3

IT2110 Information Storage Management 3 0 0 3

IT2111 Cloud Computing 2 0 2 3

NOTE:

Students have to register for the courses as per the following guidelines:

Sl.

No. Category

Credits

I

Semester

II

Semester

III

Semester

IV

Semester

Category

Total

1. Core courses 12 ( 3 courses)

12 ( 3 courses)

--- --- 24

2. Program Elective courses

18 (in I to III semesters) --- 18

3. Interdisciplinary elective courses (any one program elective from other programs)

3 (One course to be taken in Semester I or II or III)

3

4. Supportive courses - mandatory

3 (One course to be taken in Semester I or II or III)

--- 3

5. Seminar --- --- 1 --- 1

6. Project work --- --- 06 16 22

Total 71

3 IT2013 SRM(E&T)

I AND II SEMESTER

IT2001

DATA STRUCTURES AND ALGORITHMS L T P C

Total Contact Hours - 75 3 0 2 4

Prerequisite

Nil

PURPOSE

Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course will cover major results and current directions of research in data structures.

INSTRUCTIONAL OBJECTIVES

1. To make the student learn a object oriented way of solving problems.

2. To make the student write ADTS for all data structures.

3. To make the student learn different algorithm design techniques.

UNIT I- OVERVIEW OF C++ (5 hours)

C++ class overview-class definition-objects-class members- access control- constructors and destructors-parameter passing methods-dynamic memory allocation and de-allocation-Function overloading.

UNIT II- LINEAR DATA STRUCTURES AND ALGORITHM ANALYSIS (7 hours)

Review of Arrays-Stacks-Queues-linked lists-Linked stacks and Linked queues-Applications- Efficiency of algorithms-Asymptotic Notations- Time complexity of an algorithm using O notation- Average- Best- and Worst Case Complexities- Analyzing Recursive Programs. UNIT III- NON LINEAR DATA STRUCTURES AND HASH TABLES (14 hours) Introduction- Definition and Basic terminologies of trees and binary trees- Representation of trees and Binary trees- Binary tree Traversals- Threaded binary trees- Graphs- basic concepts –- representation and traversals. Introduction- Binary Search Trees: Definition- Operations and applications. AVL Trees: Definition- Operations and applications. B Trees: Definition- Operations and applications. Red – Black Trees- Splay Trees and its applications. Hash Tables: Introduction- Hash Tables- Hash Functions and its applications.

4 IT2013 SRM(E&T)

UNIT IV- DIVIDE AND CONQUER & GREEDY METHOD (9 hours)

General Method- Binary Search- Finding Maximum and Minimum- Quick Sort- Merge sort- Strassen’s Matrix Multiplication- Greedy Method- General Method- Minimum Cost Spanning Trees- Single Source Shortest Path.

UNIT V- DYNAMIC PROGRAMMING AND BACKTRACKING (10 hours)

General Method- 0 / 1 Knapsack problem- Reliability Design- Traveling Sales Person’s Problem. General Method-8–Queen’s Problem-Graph Coloring-Branch and Bound

PRACTICAL (30 hours)

REFERENCES

1. Mark Allen Weiss, “Data Structures and Problem Solving using C++”, The Benjamin Cummings / Addison Wesley Publishing Company, 2002.

2. Pai G.A.V., “Data Structures and Algorithms”, TMH, 2009, 3. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran “Fundamentals of

Computer Algorithms”, 2nd edition, University Press, 1996. 4. Samanta D., “Classic Data Structures”, PHI, 2005. 5. Aho, Hopcraft, Ullman, “Design and Analysis of Computer Algorithms” PEA,

1998. 6. Goodman and Hedetniemi, “Introduction to the Design and Analysis of

Algorithms”, TMH 2002. 7. Horowitz E., Sahani S., “Design and Analysis of Algorithms”, 3rd Edition,

University Press, 2002. 8. Drozdek, “Data Structures and Algorithms in C++”, 2nd Edition, Thomson

Learning Academic Resource Center, 2001.

DB2001

DATABASE MANAGEMENT SYSTEMS L T P C

Total contact hours – 75 3 0 2 4

Prerequisite

Nil

PURPOSE

Most of the organizations depend on databases for storing the data and to share the data among different kinds of users for their business operations. Persistent storage required and several users must be able to safely access the same data concurrently. Hence this course discusses about the problems with the file processing system and how it can be handled effectively in Database Systems through various design tools, design techniques and algorithms.

5 IT2013 SRM(E&T)


1. Learn the fundamentals of Database management and to design the database for any given problem.

2. Understand the SQL and Provide the proof of good database design.

3. Know the fundamentals of transaction processing, practical problems of Concurrency control and Recovery mechanisms.

UNIT I- INTRODUCTION TO DATABASE DESIGN (7 hours)

Data- Database – DBMS-File Processing System Vs DBMS- Approaches to build a Database - Data Independence-Data Catalog-Three schema Architecture of a database-Functional components of a DBMS - DBMS Languages - Database design and ER diagrams - Beyond ER Design Entities, Attributes and Entity sets - Relationships and Relationship sets - Additional features of ER Model - Concept Design with the ER Model - Conceptual Design for Large enterprises. UNIT II- RELATIONAL MODEL AND SQL (6 hours)

Relational Algebra - Selection and projection set operations - renaming - Joins - Division - Examples of Algebra overviews - Relational calculus – SQL - Basic SQL Query -Nested queries - correlated and uncorrelated queries - Comparison Operators - Aggregative Operators - NULL values - Comparison using Null values - Logical connectivity's - AND, OR and NOTR - Impact on SQL Constructs - Outer Joins – PLSQL programming – cursors, procedures, functions, triggers. UNIT III- DEPENDENCIES AND NORMAL FORMS (11 hours)

The importance of a good schema design, - Problems encountered with bad schema designs - Motivation for normal forms- functional dependencies -Armstrong's axioms for FD's- Closure of a set of FD's- Minimal covers-Definitions of 1NF- 2NF- 3NF and BCNF- Decompositions and desirable properties - Algorithms for 3NF and BCNF normalization-Multivalued dependencies-4NF-5NF. UNIT IV- TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL

(12 hours)

Overview of Transaction Management: ACID Properties – Transactions and Schedules – Concurrent Execution of the transaction – Lock Based Concurrency Control – Performance Locking – Introduction to Crash recovery. Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock Conversions – Dealing with Dead Locks – Specialized Locking Techniques – Concurrency without Locking. Crash recovery: Introduction to ARIES – the Log –

6 IT2013 SRM(E&T)

Other Recovery related Structures – the Write- Ahead Log Protocol – Check pointing – recovering from a System Crash – Media recovery UNIT V- RECOVERY (9 hours)

Overview of Storage and Indexing: Data on External Storage – File Organization and Indexing– Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base Indexing – Comparison of File Organizations – Indexes and Performance Tuning


REFERENCES

1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database System Concepts”, McGraw-Hill, 6th Edition, 2010.

2. Raghu Ramakrishnan, Johannes Gehrke, “Database Management System”, McGraw Hill., 3rd Edition, 2007.

3. Elmasri & Navathe, “Fundamentals of Database System”, Addison-Wesley Publishing, 5th Edition, 2008.

4. Date C.J, “An Introduction to Database”, Addison-Wesley Pub Co, 8th Edition, 2006.

5. Peter rob, Carlos Coronel, “Database Systems – Design, Implementation, and Management”, 9th Edition, Thomson Learning, 2009.

IT2002

OBJECT ORIENTED SOFTWARE

ENGINEERING L T P C


Prerequisite

Knowledge of Object Oriented Analysis and Design, Programming in Java is preferred

PURPOSE

As Software development is the expensive process, proper measures are required so that the resources can be used efficiently and effectively. Thus this course is to provide the students with the concepts of organized methodology for implementing medium-large software systems like Team programming, Common design and coding methodologies, including Object-Oriented Design (OOD), Design Patterns, Refactoring, and the Unified Modeling Language (UML) and Standard software engineering tools.


1. Understand the phases in a software project and activities in project

7 IT2013 SRM(E&T)

management

2. Comprehend the purpose of different UML diagrams

3. Understand the major considerations in collecting, documenting and analyzing project requirements.

4. Cognize the activities in the crucial phase of system design.

5. Identify the key phases in the recent trends of RUP and agile development

UNIT I- INTRODUCTION TO SOFTWARE ENGINEERING (3 hours)

Software engineering development activities-Managing software development

UNIT II- MODELING WITH UML (9 hours)

UML Diagrams: Use Case Diagrams - Class Diagrams - Interaction Diagrams - State Machine Diagrams - Activity Diagrams. Modeling Concepts - Diagram Organization - Diagram Extension UNIT III- REQUIREMENTS AND ANALYSIS (9 hours)

Requirements Elicitation - Concepts - Activities & Managing Requirements Elicitation Analysis: Concepts - Analysis Activities - Analysis Model

UNIT IV- SYSTEM DESIGN (15 hours)

Decomposing the System - Addressing Design Goals - Reusing Patterns - Specifying Interfaces - Mapping Models to Code.

UNIT V- AGILE DEVELOPMENT AND RATIONAL UNIFIED PROCESS (9 hours)

Rational Unified Process Key Features - Software Best Practices - Static Structure - Dynamic Structure Agile Development: Adapting to Scrum - Patterns for Adopting to Scrum - New Roles - Changed Roles - Sprints - Product Backlogs - Teamwork


REFERENCES

1. Bernd Bruegge, Alan H Dutoit, “Object-Oriented Software Engineering Using UML, Patterns, and Java”, 3rd Edition, ISBN-10: 0136061257 | ISBN-13: 978-0136061250, 2010.

2. Philippe Kruchten, “The Rational Unified Process: An Introduction”, Addison-Wesley Professional; 3 edition, ISBN-10: 0321197704 | ISBN-13: 978-0321197702, 2003.

8 IT2013 SRM(E&T)

3. Mike Cohn, “Succeeding with Agile: Software Development Using Scrum”, 1st Edition, ISBN-10: 0321579364 | ISBN-13: 9780321579362, 2010.

4. Grady Booch, James Rumbaugh and Ivar Jacobson, “The Unified Modeling Language User Guide”, Addison-Wesley Longman, USA, 2nd Edition, ISBN-10: 0321267974 | ISBN-13: 978-0321267979, 2005.

5. Timothy Lethbridge, Robert Laganiere, “Object-oriented software engineering: practical software development using uml and java”, 2nd Edition, | ISBN-10: 0077109082 | ISBN-13: 978-0077109080, 2004.

IT2003

OPERATING SYSTEMS AND LINUX

ADMINISTRATION L T P C


Prerequisite

Knowledge of Computer Architecture is preferred

PURPOSE

To have a thorough knowledge of processes, scheduling concepts, memory management, I/O and file systems in an operating system.


1. To have an overview of different types of operating systems

2. To have a thorough knowledge of process management

3. To have a thorough knowledge of storage management and memory

4. To know the how operating system concepts are implemented in Linux.

5. To know the fundamentals of Linux Administration

UNIT I- OVERVIEW OF OPERATING SYSTEM (9 hours)

Introduction - Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed Systems. Operating System Services – System Calls – System Programs .Process Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Interposess Communication. Threads- Multithreading Models- Threading Issues UNIT II- PROCESS SCHEDULING AND MANAGEMENT (9 hours) CPU Scheduling–Basic Concepts–Scheduling Criteria–Scheduling Algorithms–Multiple-Processor Scheduling–Real Time Scheduling-The Critical-Section Problem–Synchronization Hardware– Semaphores–Classic problems of Synchronization–Critical regions-Monitors-Deadlock characterization-Methods for handling Deadlock-Recovery from Deadlock

9 IT2013 SRM(E&T)

UNIT III- MEMORY AND STORAGE MANAGEMENT (9 hours)

Storage Management – Swapping – Paging – Segmentation – Segmentation with Paging- Demand Paging-Page Replacement -Virtual Memory – Demand Paging – Process creation – Page Replacement – Allocation of frames – Thrashing UNIT IV- THE LINUX SYSTEMS FUNDAMENTALS (5 hours)

The Linux System – Design Principles – Kernel Modules – Process Management – Scheduling – Memory management – File systems – Network Structure – Security UNIT V- LINUX ADMINISTRATION (13 hours)

Setting up a LINUX Multifunction Server - Domain Name Service-Installing-Setting up and Safeguarding Linux Web Server–Mail Server–Local Network Services–Backing up Data


REFERENCES

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”,7th Edition, John Wiley & Sons (ASIA) Pvt. Ltd., 2005.

2. Tom Adelstein and Bill Lubanovic, “Linux System Administration”, O’Reilly Media, Inc., March 2007.

3. Harvey M. Deitel, “Operating Systems”, 3rd Edition, Pearson/Prentice Hall, 2004.

4. Andrew S. Tanenbaum, “Modern Operating System”, 3rd Edition, Pearson Prentice Hall, 2008.

5. William Stallings, “Operating System”, Prentice Hall, 2008.

IT2004

APPLIED ADVANCE ROUTING L T P C


Prerequisite

Knowledge of Computer Networks, TCP/IP Technology is preferred

PURPOSE

This Course aims to provide theoretical and practical knowledge equivalent to Cisco Certified Network Professional. Course also aims to develop competence towards design and deployment of Routing on high end computer networks.

10 IT2013 SRM(E&T)


1. Understand and work with network devices and technologies.

2. Understand and deploy various interior and exterior routing protocols.

3. Learn and work with next generation IP (IPv6).

UNIT I-INTRODUCTION TO COMPUTER NETWORKS (9 hours)

Evolution of Computer Networks (History) Classification of Computer Networks (LAN, WAN, MAN, PAN, INTERNET) OSI Layered Architecture – TCP/IP Model-Networking devices UNIT II-IPv4 ADDRESSUING ARCHITECTURE (9 hours)

IP Protocol suite – IPv4 Public and Private Address- Sub-netting-VLSM-CIDR-Zinin’s Routing principles - Classification of routing protocols UNIT III-DISTANCE VECTOR AND LINK STATE ROUTING PROTOCOLS (9 hours)

Introduction to EIGRP –EIGRP technologies–Reliable transport protocols–DUAL-EIGRP packet types–EIGRP tables–EIGRP terminology- Introduction tovOSPF-Basic OSPF configuration–OSPF topologies–OSPF areas–LSA sequence numbering-Configuring OSPF for multiple areas – OSPF over non broadcast multi access topology – virtual links – Stub and totally stubby area. UNIT IV-EXTERIOR GATEWAY ROUTING PROTOCOLS (9 hours)

Autonomous systems – IANA – RIR’s - BGP operational overview – Public IP address space – Single, double and multi- homed ISP’s- BGP databases – BGP message types – EBGP- IBGP –BGP commands –BGP states –BGP Attributes and path control- Route optimization and Route distribution

UNIT V-INTODUCTION TO IPv6 (9 hours)

Ipv6 advanced features –V4 and V6 header compression – V6 address types –Stateless auto configuration – IPv6 routing protocols – Ipv4-V6 tunneling and transition techniques- Advanced Interior Gateway Protocol Redistribution


REFERENCES

1. Todd Lammle, “CCNA Cisco Certified Network Associate Study Guide”, Sybex; 7 edition, ISBN: 978-0-470-90107-6, 2011.

11 IT2013 SRM(E&T)

2. Wendell Odom, “CCNP Route 642-902, Official Certification Guide”, CCIE, Pearson Publication, Published:, ISBN-10: 1-58720-253-0, ISBN-13: 978-1-58720-253-7, 2010.

3. Douglas E.Comer, “Internet Working with TCP/IP Principles, Protocols, and Architecture”, 5th Edition), 4th edition, Publication ISBN-10: 0130183806 | ISBN-13: 978-0130183804, 2000.

IT2005

HETEROGENEOUS COMPUTING L T P C

Total Contact Hours – 75 3 0 2 4

Prerequisite

Knowledge of Computer architecture and Organization is preferred

PURPOSE

The purpose is to understand the methodologies and trade-offs involved in designing a heterogeneous system.


1. To give the knowledge of parallel and super computers.

2. Analysis of static and dynamic scheduling.

3. Implementation of hardware based speculation algorithm.

4. To demonstrate the implementation of parallel code using OpenCL

UNIT I-INTRODUCTION (9 hours) Instruction Set-Measuring Performance-Implementation of MIPS-Pipelining Basics-Hazards UNIT II-EXPLOITING ILP (9 hours)

Software scheduling-Loop Unrolling-Loop Transformation-Dynamic Scheduling-Hardware Based speculation-Branch Prediction UNIT III-INTRODUCTION TO OPENCL (9 hours)

OpenCL SDK kit-Platform and Devices-Execution Environment-Memory model-Writing kernel- Matrix Multiplication example UNIT IV-OPENCL DEVICE ARCHITECTURE (9 hours)

Super scalar execution-SIMD and Vector Processing-Multi-core CPU-GPU Architecture-APU

12 IT2013 SRM(E&T)

UNIT V-MULTITHREADING & MULTIPROCESSORS (9 hours)

Introduction to parallel programming-Single Thread Execution-TLP-Multithreading-SMT- Multiprocessors-SIMD-MIMD-Challenges in parallel processing


REFERENCES

1. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The Hardware/Software Interface”, Elsevier. ISBN: 978- 0-12- 374493-7, 2011.

2. D. E. Culler and J. P. Singh with A. Gupta, “Parallel Computer Architecture” Morgan- Kaufmann publishers, ISBN: 978- 1-55860-343-1 1998.

3. Benedict R. Gaster, Lee Howe’s, “Heterogeneous computing with Open CL”, Elsevier Publishers, ISBN: 978-0-12-387766-6, 2012.

4. Introduction to Open CL Programming, Training Guide, May 2010.

IT2047

SEMINAR L T P C


Prerequisite

Nil

PURPOSE

Seminar is one of the important components for the engineering graduates to exhibit and expose their knowledge in their field of interest. It also gives a platform for the students to innovate and express their ideas in front of future engineering graduates and professionals.


1. To make a student study and present a seminar on a topic of current relevance in Information Technology or related fields.

2. Enhancing the debating capability of the student while presenting a seminar on a technical topic.

3. Training a student to face the audience and freely express and present his ideas without any fear and nervousness, thus creating self-confidence and courage which are essentially needed for an Engineer.

GUIDELINES

1. Each student is expected to give a seminar on a topic of current relevance in IT/Related field with in a semester.

2. Students have to refer published papers from standard journals.

3. The seminar report must not be the reproduction of the original papers but it can be used as reference.

13 IT2013 SRM(E&T)

ASSESMENT

1. The students are expected to give at least two presentations on their topics of interest which will be assessed by a committee constituted for this purpose. This course is mandatory and a student has to pass the course to become eligible for the award of degree. Marks will be awarded out of 100 and appropriate grades assigned as per the regulations

L T P C

IT2049 PROJECT WORK PHASE I

(III SEMESTER) 0 0 12 6

IT2050 PROJECT WORK PHASE II

(IV SEMESTER) 0 0 32 16

PURPOSE

To undertake research in an area related to the program of study

INSTRUCTIONAL OBJECTIVE

The student shall be capable of identifying a problem related to the program of study and carry out wholesome research on it leading to findings which will facilitate development of a new/improved product, process for the benefit of the society.

M.Tech projects should be socially relevant and research oriented ones. Each student is expected to do an individual project. The project work is carried out in two phases – Phase I in III semester and Phase II in IV semester. Phase II of the project work shall be in continuation of Phase I only. At the completion of a project the student will submit a project report, which will be evaluated (end semester assessment) by duly appointed examiner(s). This evaluation will be based on the project report and a viva voce examination on the project. The method of assessment for both Phase I and Phase II is shown in the following table:

Assessment Tool Weightage

In- semester I review 10%

II review 15%

III review 35%

End semester Final viva voce examination

40%

14 IT2013 SRM(E&T)

Student will be allowed to appear in the final viva voce examination only if he / she has submitted his / her project work in the form of paper for presentation / publication in a conference / journal and produced the proof of acknowledgement of receipt of paper from the organizers / publishers.

SUPPORTIVE COURSE

MA2013

MATHEMATICAL FOUNDATIONS OF

COMPUTER SCIENCE L T P C


Prerequisite

Nil

PURPOSE

To impart analytical ability and to solve real life problems pertaining to branches of Computer Science and Engineering


1. To be exposed with logic, normal forms and mathematical reasoning and to count/enumerate objects in a systematic way.

2. To be thorough in mathematical induction, generating functions and recursive functions for calculating recurrence relations

3. To understand algebraic systems such as relations, functions and construct mathematical arguments.

4. To be familiar with the basic concepts of lattices, posets and Boolean algebra

UNIT I (9 hours)

Logic - Statements - Connectives - Truth tables - Normal forms - Predicate calculus - Inference Theory for Statement calculus and predicate calculus UNIT II (9 hours)

Combinatory - Mathematical Induction - Pigeonhole principle - Principle of inclusion and exclusion UNIT III (9 hours)

Recursive Functions- Recurrence relation - Solution of recurrence relation using characteristic polynomial and using generating function - Recursive functions - Primitive recursive functions, Computable and non-computable functions

15 IT2013 SRM(E&T)

UNIT IV (9 hours)

Algebraic Structures - Groups - Definition and examples only - Cyclic groups - Permutation group (Sn and Dn) - Subgroups - Homomorphism and Isomorphism - Cosets - Lagrange's Theorem - Normal subgroups - Cayley's representation theorem

UNIT V (9 hours)

Lattices - Partial order relations, Poset-Lattices-Hasse diagram-Boolean algebra

REFERENCES 1. Tremblay J.P. and Manohar R., "Discrete Mathematical Structures with

applications to Computer Science", McGraw Hill International Edition, 1987Kenneth H. Rosen, Discrete Mathematics and Its Applications, 4th Edition, Tata McGraw Hill, 2002.

2. Venkataraman M.K. etal., "Discrete Mathematics", National Publishing Co.,2000.

3. Prof. V. Sundaresan, K.S. Ganapathy Subramanian and K. Ganesan, Discrete Mathematics, New Revised Edition, 2001.

4. Alan Doerr and Kenneth Levasseur, "Applied Discrete Structures for Computer Science", Galgotia Publications (P) Ltd.1992.

5. C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill Publications, 1985.

6. Gersting. J.L. Mathematical Structures for Computer Science, 3rd Edition, W.H. Freeman and Co., 1993.

7. Lidl and Pitz, Applied abstract Algebra, Springer - Verlag, New York, 1984.

PROGRAM ELECTIVES

IT2101

ELECTRONIC COMMERCE L T P C


Prerequisite

Nil

PURPOSE

The course overview knowledge in E-commerce.


1. Understanding Mobile Application development features and trends

2. To provide knowledge on best practices for E-commerce design

3. To provide incisive knowledge in building E-commerce Systems

4. Enable students to understand software for E-commerce

16 IT2013 SRM(E&T)

5. Impart knowledge in e-payment systems and security issues

6. Learn E-commerce laws and ethics

UNIT I-INTRODUCTION (6 hours) Introduction to E-commerce: E-commerce business models-Roles of E-commerce, trends in E-commerce -Current Web technologies for E-commerce-Social E-commerce and Mobile E-commerce- E-commerce current and future scope-E-commerce market.

UNIT II–BUILDING E-COMMERCE SYSTEMS (8 hours) Building E-commerce systems –software for E-commerce systems-Hardware for E-commerce systems-Scalability–E-commerce web system development life cycle-HCI for E-commerce: User experience design-Designing E-commerce for Mobile systems - Cloud services and computing in E-commerce UNIT III–E-COMMERCE SOFTWARES (6 hours) Multi tier architecture –web server software-Application server software-database software-Dynamic web page programming languages-MVC Frameworks-E-commerce system tools and personalization tools –web site management tools-Intelligent Agents UNIT IV–PAYMENT AND E-COMMERCE SECURITY (6 hours) Electronic payment systems: Credit cards –Debit cards -online transactions. Security Threats in E-commerce: vulnerability in client side, server side and in communication medium-Technology and solutions: Encryption, SSL VPN, firewalls-server and client side protection. SET: Key Technologies in Secure Electronic Transactions

UNIT V-E-COMMERCE MARKETING, LAWS, POLICIES AND ETHICS (4 hours) Marketing and promotion of e-business -E-commerce security policy, Laws and Cyber Forensics an overview- Ethics in E-commerce


REFERENCES

1. Janice Reynolds, “The Complete E-Commerce Book: Design, Build and maintain a successful Web-based Business” CRC Press; 2 edition,2nd Edition, MP Books, 2004.

2. Paul Todd, “E Commerce Law” Cavendish Publishing company, 2005.

17 IT2013 SRM(E&T)

IT2102

MOBILE COMPUTING L T P C


Prerequisite

Knowledge of Mobile Communication is preferred

PURPOSE

The course aims to provide basic understanding about Mobile Communication, Mobile Hardware, Mobile Software


1. To understand about the architecture for Mobile Computing

2. To get an idea about the mobile computing through telephony and GPRS, WAP

3. To understand the WAP and Symbian OS, Windows CE with wireless devices and their security issues

4. To understand mobile computing through Java

UNIT I-INTRODUCTION AND MOBILE COMPUTING ARCHITECTURE (9 hours)

Mobility of bits and bytes-Mobile computing-Networks- Middleware and gateways-Applications and services- Developing mobile computing applications-Security in mobile computing- Architecture for mobile computing- Design considerations for mobile computing

UNIT II-MOBILE COMPUTING THROUGH TELEPHONY AND GPRS (9 hours)

Multiple Access procedures-mobile computing through telephone- Voice XML-Telephony Application Programming Interface- GPRS and packet data network-GPRS Network Architecture-GPRS Network Operations-Data Services in GPRS-Applications and limitations of GPRS UNIT III–WAP AND WIRELESS DEVICES WITH SYMBIAN OS (9 hours)

Wireless Application protocol-MMS-GPRS Applications-Client Programming: Mobile phones-PDA-Design constraints in applications for handheld devices-Wireless devices with Symbian OS-Symbian OS Architecture-Applications for Symbian-Controls and Compound controls- Security on the Symbian OS UNIT IV–J2ME (9 hours)

J2ME Technology-CDC-CLDC-Programming for CLDC-MIDlet event handling-GUI in MIDP-UI Design issues-Record Management System-communication in MIDP-Security considerations in MIDP

18 IT2013 SRM(E&T)

UNIT V-WIRELESS DEVICES WITH WINDOWS CE AND SECURITY ISSUES IN

MOBILE COMPUTING (9 hours) Windows CE Architecture-Windows CE development environment-H.323 framework for voice over IP-Session Initiation Protocol-Real time protocols-Convergence technologies-Call routing-Voice over IP applications-IMS-Mobile VoIP-Security Protocols-Security framework for mobile environment

REFERENCES 1. Asoke K Talukder, Roopa R Yavagal “Mobile Computing Technology,

Applications and Service Creation” Tata McGraw Hill,1st Edition ISBN-10: 0070707316; ISBN-13: 978-0070707313, 2005.

2. Yu-Kwong Ricky Kwok, Vincent K.N. Lau, ”Wireless Internet and Mobile Computing: Interoperability and Performance “, Wiley-IEEE Press,ISBN-10: 0471679682 ISBN-13: 978-0471679684, 2007.

3. Frank Adelstein, Sandeep KS Gupta , Golden Richard III,Loren Schwiebert,” Fundamentals of Mobile and Pervasive Computing “ McGraw-Hill Professional; 1st Edition, ISBN 0-07-141237-9, 2004.

IT2103

MOBILE APPLICATION DEVELOPMENT L T P C


Prerequisite

Knowledge of Core java Programming is preferred

PURPOSE

The course harnesses the skills of student in developing mobile application development using the Android platform.


1. Understanding Mobile Application development features and trends

2. Understand the basics of Android devices and Platform.

3. Impart knowledge on basic building blocks of Android programming Activities, Services, Broadcast Receivers and Content providers

4.. Understanding persistence Data storage in Android

5. Understanding Advanced application concepts like networking, cloud interface and Google Maps services etc

6. Enable Students to develop and publish Android applications in to Android Market

UNIT I-INTRODUCTION (6 hours) Introduction to mobile application development-trends-introduction to various platforms-introductions to smart phones-introduction to development

19 IT2013 SRM(E&T)

environment/IDE. Android platform features and architecture-versions-Android market ANDROID DEVELOPMENT SETUP – Eclipse, ADT, Android SDK, tools. Android application anatomy, emulator setup. Application framework basics: resources, layout, values, asset XML representation, generated R.Java file, Android manifest file. Creating a simple application.

UNIT II-ACTIVITIES, INTENT AND UI DESIGN (8 hours)

Introduction to activities-activities life-cycle-User Interface INTENT – intent object, intent filters – adding categories, linking activities, user interface design. Components: Fragments, basic views, list views, picker views ,adapter views, Menu ,Action Bar etc, layouts, basics of screen design, registering listeners and different event Listeners. Creating application using multiple activities- views with different layouts UNIT III-DATA PERSISTENCE (4 hours) Shared preferences-File Handling-Managing data using SQLite database CONTENT PROVIDERS – user content provider, android provided content providers. Creating a simple applications using content provider and persisting data into database UNIT IV-BACK GROUND RUNNING PROCESS, NETWORKING AND TELEPHONY

SERVICES (6 hours) Services-Introduction to services–local service-remote service and binding the service- communication between service and activity-Multi-Threading-Handlers and AsyncTask-Android network programming- Telephony services- SMS and telephony applications BROADCAST RECEIVERS–Introduction to receivers, pending intent, Notification. UNIT V-ADVANCED APPLICATIONS (6 hours) Location based services-Google maps services using Google API-Overview on Tweened animations, Property animations- android media-Google App engine -connecting Android apps-Cloud Storage-Android application development guidelines-publishing android applications


REFERENCES 1. Wei-Meng Lee, “Beginning Android 4 Application Development” Wrox

Publications, ISBN: 978-1-118-19954-1, 2012.

20 IT2013 SRM(E&T)

2. Paul Deital and Harvey Deital, ”Android How to Program” ,Detial associates publishers, ISBN-10: 0132990547 ISBN-13: 978-0132990547, 2013.

3. Zigurd Mednieks, Laird Dornin, G. Blake Meike, Masumi Nakamura, ”Programming Android Java Programming for the New Generation of Mobile Devices”, O'Reilly Media, ISBN-10: 1449316646 | ISBN-13: 978-1449316648. July 2011.

4. http://developer.android.com 5. http://navinsandroidtutorial.blogspot.in

IT2104

INTERNET PROGRAMMING L T P C


Prerequisite

Nil

PURPOSE

Internet is part and parcel of everybody’s life today. Programming in web is every essential for any IT professional .The subject provides knowledge to learn and implement the various web programming technologies of current trend today


1. Understand the current technologies in Internet world

2. Implement client side programming using java script ,CSS

3. Learn and implement advanced and current technologies like AJAX, JQuery

4. Understand the socket programming in Java

5. Learn to implement web services

6. Learn various web development frame works like struts and JSF.

UNIT I-INTRODUCTION TO INTERNET WEB TECHNOLOGIES (4 hours)

Internet technology and Internet standards-Current evolution of web technology -web2.0 an overview –HTML 5 and CSS3 –XML technologies-DTD-Schema-parsers-XHTML.Java script-data types-control structures-functions—objects.

UNIT II–ADVANCED DYNAMIC WEB CLIENT SIDE PROGRAMMING (6 hours) AJAX-xmlHttpRequest object-AJAX applications-AJAX frame work -java script libraries -JQuery-basics – eventshandling ,DOM,AJAX-effects- jQuery UI -Web design Frameworks :Responsive web design-overview on Twitter bootstrap-DoJo-YahooUI-Google web toolkit libraries-Applets-overview on javaFX applets.

21 IT2013 SRM(E&T)

UNIT III–JAVA NETWORK PROGRAMMING (6 hours)

Java I/O streaming-files-lookup Internet address-socket programming-UDP sockets-Multicast sockets-client/server programs-secure sockets-javaMail API UNIT IV–DYNAMIC WEB SERVER SIDE PROGRAMMING

(8 hours)

Web servers and Java web containers-Servlets - Overview of JSP2.2 and Servlet 3.1-Lifecycle-content handling-cookies-session tracking-filters- Annotations- Filters-Event handling-Exception Handling -Asynchronous processing -Debugging - Security – Internationalization. Java server pages(JSP):Expressions-and declarations-directives-JSP and java beans-include and forward directives-- Standard Tag Library- Database Access- XML - Java Beans - Custom Tags - Expression Language(EL)-JSTL.

UNIT V-ADVANCED SERVER SIDE PROGRAMMING (6 hours)

Web services-SOAP protocol-UDDI-WSDL-creating publishing and describing web services.JDBC4.0: Database connectivity-drivers-connections-rowset interface-prepared statements-three tier applications- Web application frameworks MVC (model view controller) frame works-Struts- JSF(Java server faces)-Java EE design pattern an overview.


REFERENCES

1. Deitel, Harvey Deitel, Abbey Deitel, Paul J, “Internet and World Wide Web How to Program”, 5th Edition,. ISBN 0132151006 | 9780132151009, 2011.

2. Jonathan Chaffer, Karl Swedberg, “Learning jQuery”, 3rd Edition , , ISBN 13 : 9781849516549, 2011

3. Eilliote, Rusty Harold, “Java Network Programming” ,3/e,O'Reilly Media, Inc.,

CRC Press; 2 edition ISBN-10: 0596007213 | ISBN-13: 978-0596007218, 2004.

4. “Java server programming java JavaEE5 Black Book”, Kogent Solutions Dreamtech Press, Inc, ISBN-13 9788177228359 ISBN-10 8177228358, 2008.

5. “AJAX black book”, new edition, Kogent Solutions Inc, Dreamtech Press, ISBN:10-81-7722- 838-2 ISBN:13-978-81-7722-838-0 6. www.W3Schools.org, 2008.

22 IT2013 SRM(E&T)

IT2105

ARTIFICIAL INTELLIGENCE PLANNING L T P C


Prerequisite

Nil

PURPOSE

Planning is a fundamental part of intelligent systems. This course aims to provide a foundation in artificial intelligence techniques for planning, with an overview of the wide spectrum of different problems and approaches, including their underlying theory and their applications.


1. Understand different planning problems

2. Have the basic know how to design and implement AI planning systems using state-space Planning

3. Know how to use AI planning technology for projects in different application domains using HTN (Hierarchical Task Network) Planning

4. Have the ability to make use of graph plan for the problems and developing its heuristics.

5. Know how to plan the time and resources of the problem

UNIT I-INTRODUCTION AND PLANNING IN CONTEXT (9 hours)

Introduction to planning-Conceptual model for planning-Representations for classical planning-Complexity of classical planning UNIT II-STATE-SPACE SEARCH (9 hours)

Heuristic Search and STRIPS-State-Space Planning-The STRIPS algorithm-Domain-Specific State Space Planning.

UNIT III-PLAN-SPACE SEARCH AND HTN PLANNING (9 hours)

The Search-Space of Partial Plans-Solution Plans-Algorithms for Plan-Space Planning-Plan-Space versus State-Space Planning-HTN (Hierarchical Task Network) Planning. UNIT IV-GRAPH PLAN AND ADVANCED HEURISTICS (9 hours)

Planning Graphs-The GraphPlan Planner-Constraint Satisfaction Techniques-Heuristics in Planning

23 IT2013 SRM(E&T)

UNIT V-PLAN EXECUTION AND APPLICATIONS (9 hours)

Planning with Time and Resources-Time for Planning-Temporal Planning-Planning and Resource Scheduling-Case Studies and Applications REFERENCES

1. Ghallab M., Nau D., and Traverso P., “Automated Planning: Theory & Practice (The Morgan Kaufmann Series in Artificial Intelligence”, Elsevier, ISBN 1-55860-856-72004, 2004

2. Stuart Russell, Peter Norvig, “Artificial Intelligence: A Modern Approach”, 3rd Edition, ISBN-10: 0136042597, ISBN-13: 978-0136042594, 2009.

IT2106

MULTILAYER SWITCHING L T P C

Total Contact Hours 60 2 0 2 3

Prerequisite

Knowledge of Applied Advanced Routing is preferred

PURPOSE

This Course aims to provide theoretical and practical knowledge equivalent to Cisco Certified Network Professional. Course also addresses the design and deployment strategies of switching world and also gives an overview of Voice over IP Networks and its dependencies on Quality of service related issues.


1. Understand and work with layer 2 and layer 3 switching devices.

2. Learn and understand the difference between the existing PSTN and VOIP Networks.

3. Know the necessity of QOS while handling different types of Network traffic.

UNIT I-INTELLIGENT INFORMATION NETWORKS (6 hours)

SONA Architecture – L2 Switching/ L3 Routing / Multilayer Switching – VLAN-VLAN Trunking Protocol – VTP Pruning - Inter VLAN Routing- Redundant Topologies – STP and its Implementation - STP Enhancements(MSTP,RSTP) UNIT II-LAYER 2 HIGH AVAILABILITY AND SECURITY (6 hours)

High Availability–HSRP, VRRP, GLBP- Switch Security Issues: Port Security, VLAN Hopping, DHCP Snooping, Loop Guard, UDLD, VLAN ACL, Private VLANs and Protected Ports.

24 IT2013 SRM(E&T)

UNIT III-INTRODUCTION TO VOICEOVERIP (6 hours)

Benefits and Components of VOIP Network- Digitizing and Packetizing Voice – Digital Voice Encoding- Voice Codec Characteristics – Encapsulating voice packets for transport – Bandwidth Requirements of VOIP- Real-Time Concerns; RTP/RTCP; H.323 and SIP as signaling protocols.

UNIT IV-INTRODUCTION TO QOS (6 hours)

Congestion and Queuing-Queuing Algorithms-Converged Network Quality Issues–Different Types of Delay –Traffic policing and Shaping – Implementing QOS–Traffic Classification-3 QOS Models –DiffServ QOS Model and Its Implementation–Trust Boundaries UNIT V-MULTIPROTOCOL LABEL SWITCHING (6 hours)

WAN Topologies- Standard IP based Switching - CEF based Multi-Layer switching-MPLS Characteristics- Frame Mode MPLS Operation and configuration-wireless security (WEP-WPA-WPA2-802.1x)


REFERENCES

1. Richard Froom, ErumFrahim and BalajiSivasubramanian “Implementing Cisco IP Switched Networks (SWITCH)” Cisco Press; 1 edition, ISBN-10:1587058847 | ISBN-13:9781587058844, 2010.

2. Luc De Ghein 2006, “MPLS Fundamentals”, 1st Ed. Cisco Press, ISBN: 978-1-58705-197-5, 2006.

3. Jeremy Cioara, Michael J. Cavanaugh, “CCNA Voice Official Exam Certification Guide” (640- 460 IIUC), Publication | ISBN-10: 1587202077 | ISBN-13: 978-1587202070 | 1st Edition, 2008.

4. Amir Ranjbar, “CCNP ONT Exam Certification Guide”, Cisco Press ISBN: 978-1-58720-176-3, 2007.

5. Lab 4.6 Class-based Marking, Shaping, and Policing and Lab 4.8 Shaping and Policing “CCNP: Optimizing Converged Networks Student Manual”

25 IT2013 SRM(E&T)

IT2107

SOFTWARE TESTING L T P C


Prerequisite

Knowledge of Software Engineering, Programming in Java is preferred

PURPOSE

Software systems are being built and extensively used for various purposes in our daily life. These products, if not tested for accuracy, performance etc right from development, would cause a huge amount of rework. Thus this course is to provide the students with the concepts of organized methodology for testing medium-large software systems like - Test case generation, testing types, managing, automating and measuring testing.


1. Understand terms, types and activities in project testing

2. Comprehend the process of generating test cases

3. Understand the major types of testing strategies

4. Cognize the activities in managing the tests.

5. Identify the scope for test automation and measuring test results.

UNIT I-INTRODUCTION TO SOFTWARE TESTING (6 hours)

Errors, faults, failures - Software Quality – Requirements-input domain-behavior-correctness-Reliability-Testing-debugging-Verification-Program representation: Control flow graphs-Test generation Strategies-Finite State Machine-Types of Software Testing UNIT II–TEST CASE DESIGN (9 hours)

Test Generation from requirements-Equivalence Class Partitioning-Boundary Value Analysis-Testing Predicates Test Generation from FSM-Moore Machine-Mealy Machine-Properties-Fault Model-Chow's method- Automata Theoretic vs Control Theoretic methods-Partial W (Wp) method Test Generation from Combinatorial designs-Design of test configuration and cases-pair wise coverage-balance requirement-MOLS-Orthogonal arrays

UNIT III–TYPES OF TESTING (6 hours)

Planning-Management-Process-Reporting-Best Practices

26 IT2013 SRM(E&T)

UNIT IV–TEST MANAGEMENT (3 hours)

Decomposing the System-Addressing Design Goals-Reusing Patterns-Specifying Interfaces- Mapping Models to Code UNIT V-TEST AUTOMATION AND MEASUREMENT (6 hours) Automation - Terms-Skills-Design and Architecture for Automation-Generic Requirement of a test tool/framework-Challenges in automation - Metrics Project-Process-Progress-Productivity-Release Metrics


REFERENCES

1. Srinivasan Desikan, Gopalaswamy Ramesh, “Software Testing: Principles and Practices”, 1st Edition, , ISBN-10: 817758295X ISBN-13: 978-8177582956, 2007.

2. Aditya Mathur, “Foundations of Software Testing”, 1st Edition, ISBN-10: 8131716600 | ISBN-13: 978-8131716601, 2008.

3. Paul.C.Jorgensen, “Software Testing: A Craftsman's Approach”, Auerbach Publications; 3 edition, ISBN-10: 084937345X | ISBN-13: 978-0849373459, 2008.

4. Glenford J Myers, Corey Sandler, Tom Badgett and Todd M Thomas,“The Art of Software Testing”, Wiley, USA, ISBN-10: 1118031962 | ISBN-13: 978-1118031964 | 3rd Edition, 2011.

5. Ilene Burnstein, “Practical Software Testing: A Process-Oriented Approach”, Springer Professional Computing, ISBN-10: 1441928855 | ISBN-13: 978-1441928856, 2010.

IT2108

SOFTWARE QUALITY MANAGEMENT L T P C


Prerequisite

Nil

PURPOSE

To understand software quality Management Principles and Practices


1. To illustrate Software process Maturity Models

2. To learn the concepts of Software project Management

3. To understand Software Metrics & Risk Management

4. To learn Software Verification & Validation Methodologies

27 IT2013 SRM(E&T)

5. To Understand Software Configuration Management

UNIT I-SOFTWARE PROCESS MATURITY MODELS (9 hours) Process - Process Maturity – Capability Maturity Model Integrated (CMMI) – Staged representation – Continuous representation – process areas – Process assessment-SPICE model

UNIT II-SOFTWARE PROJECT MANAGEMENT (9 hours)

Software Project Planning – Estimation - COCOMO – Function point analysis – Feature point analysis; Project Scheduling; Tracking - Project reviews UNIT III-SOFTWARE METRICS & RISK MANAGEMENT (9 hours)

Role of Metrics in software development-project metrics-process metrics- Goal based quality metrics-project, product and process metrics; Risk Analysis and management-project and product risk-Risk management plan UNIT IV-SOFTWARE VERIFICATION & VALIDATION METHODOLOGIES (9 hours)

Software Quality Assurance Planning; Software V&V plan; Static analysis – Reviews & Inspection – Static analysis Tools; Dynamic Analysis – Testing & Testing Tools UNIT V-SOFTWARE CONFIGURATION MANAGEMENT (9 hours)

Configuration item – Baselines - SCM Process – Configuration control Board – Changes to Baselines – Change control – Version Control – Configuration audit – Status accounting – SCM Standards & Tools – SCM Team – Software Builds & SCM. REFERENCES

1. Roger S Pressman, “Software Engineering, A Practitioner’s Approach” McGraw Hill Edition, 5thEdition, New Delhi, ISBN 0-07-365578-3, 2001.

2. Watts Humphrey, “Managing the Software Process”, Pearson Education, New Delhi, 2000.

3. Pankaj Jalote, “Software Project Management in practice”, Pearson Education, New Delhi, 2002.

4. Stephen H Kan,”Metrics and Models in Software Quality Engineering”, Addison Wesley, 2002.

5. Journal Papers in “Software Quality Engineering”, Addison Wesley 1985.

28 IT2013 SRM(E&T)

IT2109

SOFTWARE RELIABILITY ENGINEERING L T P C


Prerequisite

Nil

PURPOSE

To understand software quality Management Principles and Practices


1. Understand and apply Reliability Mathematics to hardware and software systems

2. Understand evolution of software reliability growth models

3. Understand and apply Non-homogeneous Poisson Software Reliability Growth Models

4. Understand the need for flexible models and quality metrics producing models

5. Understand Determination of Software Release Time

UNIT I-SYSTEM RELIABILITY (9 hours)

Review of Reliability Mathematics–Random Experiment-Probability distributions-Binomial- Poisson-Exponential-Weibul and Generalized Exponential distributions-Reliability Block diagram-System Reliability-Repairable and Non Repairable systems-Maintainability and Availability-MTBF-MTTF-MDT-MTTR-Designing for higher reliability-Redundancy-k out of n systems

UNIT II-EVOLUTION OF SOFTWARE RELIABILITY MODELS (9 hours)

Basic Concepts – Failure and Faults-Introduction to Software Reliability Growth Models (SRGMs)-General Model Characteristic-Historical Development of models-Model Classification scheme-white box and black box models-models for application during operational phase and testing phase-Markovian models-Jelinski-Moranda model-Goel-Okumoto imperfect debugging model UNIT III-NON-HOMOGENOUS POISSON PROCESS MODELS (9 hours)

Stochastic process-Counting Process-NHPP-Execution time-Testing time and Calendar Time modeling-Musa models-Basic Execution time-Musa-Okumoto Logarithmic Poisson Execution time models-NHPP models-Goel-Okumoto-Yamada delayed S-shaped model-Log power model-Imperfect debugging models-Kapur-Garg model

29 IT2013 SRM(E&T)

UNIT IV–FLEXIBLE AND QUALITY METRICS PRODUCING MODELS (9 hours)

Flexible models-Goel Generalized NHPP-S-G GENHPP- SG We NHPP models-Quality metrics producing models- S-G-K (2007) model and S-G-K (2012) model-Failure Data-Parameter estimation-MLE and Least squares techniques-Use of tools-Comparison Criteria-Goodness of fit - Predictive Validity of Models-short term and long term

UNIT V-ADVANCED TOPICS IN SOFTWARE RELIABILITY (9 hours)

Bayesian models-Littlewood-Verall model-Discrete models-Efforts based models Release Time determination-criteria-cost-failure intensity-reliability

REFERENCES

1. John D. Musa, Anthony Iannino, Kazuhira Okumoto, “Software Reliability – Measurement, Prediction, Application, Series in Software Engineering and Technology”, McGraw Hill, 1987.

2. John D. Musa, “Software Reliability Engineering”, Tata McGraw Hill, 1999. 3. Patric D. T.O connor,” Practical Reliability Engineering”, 4th Edition, John

Wesley & sons, 2003. 4. M.Xie, “Software Reliability Modelling”, World Scientific, Singapore, 1991.

IT2110

INFORMATION STORAGE MANAGEMENT L T P C


Prerequisite

Knowledge of Database Management Systems, Computer Networks is preferred

PURPOSE

Information Storage and Management have highly developed into a sophisticated pillar of information technology, provides a variety of solutions for storing, managing, accessing, protecting, securing, sharing and optimizing information.


1. Identify the components of managing the data center and Understand logical and physical components of a storage infrastructure.

2. Evaluate storage architectures, including storage subsystems SAN, NAS, IPSAN,CAS

3. Understand the business continuity, backup and recovery methods.

30 IT2013 SRM(E&T)

UNIT I-INTRODUCTION TO STORAGE AND MANAGEMENT (9 hours)

Introduction to Information Storage Management - Data Center Environment–Database Management System (DBMS) - Host - Connectivity –Storage-Disk Drive Components- Intelligent Storage System -Components of an Intelligent Storage System- Storage Provisioning- Types of Intelligent Storage Systems

UNIT II-STORAGE NETWORKING (9 hours)

Fibre Channel: Overview - SAN and Its Evolution -Components of FC SAN -FC Connectivity-FC Architecture- IPSAN-FCOE-FCIP-Network-Attached Storage- General-Purpose Servers versus NAS Devices - Benefits of NAS- File Systems and Network File Sharing-Components of NAS - NAS I/O Operation -NAS Implementations -NAS File-Sharing Protocols-Object-Based Storage Devices-Content-Addressed Storage -CAS Use Cases. UNIT III-BACKUP AND RECOVERY (9 hours)

Business Continuity -Information Availability -BC Terminology-BC Planning Life Cycle - Failure Analysis -Business Impact Analysis-Backup and Archive - Backup Purpose -Backup Considerations -Backup Granularity - Recovery Considerations -Backup Methods -Backup Architecture - Backup and Restore Operations.

UNIT IV-CLOUD COMPUTING (9 hours)

Cloud Enabling Technologies -Characteristics of Cloud Computing -Benefits of Cloud Computing -Cloud Service Models-Cloud Deployment models-Cloud computing Infrastructure-Cloud Challenges.

UNIT V-SECURING AND MANAGING STORAGE INFRASTRUCTURE (9 hours)

Information Security Framework -Storage Security Domains-Security Implementations in Storage Networking - Monitoring the Storage Infrastructure -Storage Infrastructure Management Activities -Storage Infrastructure Management Challenges.

REFERENCES

1. EMC Corporation, “Information Storage and Management”, WileyIndia, 2nd Edition, 2011.

2. Robert Spalding, “Storage Networks: The Complete Reference”, Tata McGraw Hill, Osborne, 2003.

3. Marc Farley, “Building Storage Networks”, Tata McGraw Hill, Osborne,2nd Edition, 2001.

4. Meeta Gupta, “Storage Area Network Fundamentals”, Pearson Education Limited, 2002.

31 IT2013 SRM(E&T)

IT2111

CLOUD COMPUTING L T P C


Prerequisite

Knowledge of Computer Networks is preferred

PURPOSE

Cloud Computing has drawn the attention of industries and researchers worldwide. Many applications that are being built nowadays were developed to suit the needs of cloud environment. Hence it becomes necessary to have course in cloud computing which deals with the basics of cloud, different services offered by cloud, and security issues in cloud. In a nutshell, this course on cloud computing provides information on fundamental aspects of the cloud environment.


1. Learn about different deployment models of cloud and different services offered by cloud

2. Understand the technique of virtualization through theoretical concepts and practical training

3. Become knowledgeable in the rudimentary aspects of cloud application development

UNIT I-CLOUD COMPUTING BASICS (4 hours)

Cloud computing components- Infrastructure-services- storage applications-database services – Deployment models of Cloud- Services offered by Cloud- Benefits and Limitations of Cloud Computing – Issues in Cloud security- Cloud security services and design principles UNIT II-VIRTUALIZATION FUNDAMENTALS (4 hours)

Virtualization – Enabling technology for cloud computing- Types of Virtualization- Server Virtualization- Desktop Virtualization – Memory Virtualization – Application and Storage Virtualization- Tools and Products available for Virtualization UNIT III-SAAS AND PAAS (6 hours)

Getting started with SaaS- Understanding the multitenant nature of SaaS solutions- Understanding OpenSaaS Solutions- Understanding Service Oriented Architecture- PaaS- Benefits and Limitations of PaaS

UNIT IV-IAAS AND CLOUD DATA STORAGE (6 hours) Understanding IaaS- Improving performance through Load balancing- Server Types within IaaS solutions- Utilizing cloud based NAS devices – Understanding

32 IT2013 SRM(E&T)

Cloud based data storage- Cloud based backup devices- Cloud based database solutions- Cloud based block storage UNIT V-CLOUD APPLICATION DEVELOPMENT (10 hours)

Client Server Distributed Architecture for cloud – Traditional apps vs. Cloud apps – Client side programming model: Web clients. Mobile clients- Server Side Programming Technologies : AJAX, JSON, Web Services (RPC, REST)- MVC Design Patterns for Cloud Application Development


REFERENCES

1. Anthony T .Velte, Toby J.Velte, Robert Elsenpeter, “Cloud Computing: A Practical Approach”, Tata McGraw Hill Edition, Fourth Reprint, 2010

2. Kris Jamsa, “Cloud Computing: SaaS, PaaS, IaaS, “Virtualization, Business Models, Mobile, Security and more”, Jones & Bartlett Learning Company LLC, 2013

3. Ronald L.Krutz, Russell vines, “Cloud Security: A Comprehensive Guide to Secure Cloud Computing”, Wiley Publishing Inc., 2010.

33 IT2013 SRM(E&T)

AMENDMENTS

S. No. Details of Amendment Effective from Approval with

date

m.tech. (full time) - information technology curriculum & syllabus 2013 ... · 2013 – 2014...

Documents