MSc-Comp.Sci-_Syllabus

Course Structure and Syllabus for

Master of Science
(Computer Science)

(Four Semester Course)
Proposed for 2015 batch onwards

With

CHOICE BASED CREDIT SYSTEM (CBCS)

Department of Computer Science
Faculty of Science
St. Joseph’s College (Autonomous)

DEPARTMENT OVERVIEW

VISION STATEMENT

The vision of the department is to make possible for our students to have a
deep and analytical understanding of the field and to enable them to use
their immense potential to enhance the quality of human life.

MISSION STATEMENT

The mission of the department is to offer a high-quality science education
in the science of computing, as well as to prepare students for career
opportunities in this area requiring a high level of technical knowledge and
skill. The department will continue to develop and administer programs
which serve the needs of industrial computer scientists, researchers, and
computer application specialists for whom the discipline of computing
sciences provides indispensable tools.

INTRODUCTION TO PROGRAM

Master of Science in Computer Science is a two year four semester course.
The course includes important areas of Computer Science designed to
improve the skills of the student in analytical, problem solving and
research areas. The curriculum includes the latest technologies to prepare
the student for the future. The infrastructure provides an excellent
environment for the student to contribute effectively in the field.

PROGRAM OBJECTIVE

Provide a strong base in the field of computers. Prepare the students with
exceptional skills of problem solving, communication and leadership skills.
To create leaders who can help software professionals in their domains.
Facilitate the culture of research in the field if information technology.
Prepare the students to provide professional solutions to real time
problems.

SEMESTER WISE COURSE STRUCTURE

FIRST SEMESTER

THEORY

SL.NO. CODE COURSE TITLE Hrs / Credits IA SE Total
4 30 70 100
Week 4 30 70 100
4 30 70 100
1 CS7115 Theory of Computation 4 4 30 70 100

2 CS7215 Design Methods and 4 3 30 70 100
3 30 70 100
Analysis of Algorithm

3 CS7315 Data Communication and 4

Computer Network

4 CS7415 Object Oriented 4

Programming using Java

PRACTICAL

1 MCS1P1 Design Methods and 6

Analysis of Algorithm Lab

2 MCS1P2 Object Oriented 6

Programming Lab

SECOND SEMESTER

THEORY

SL.NO. CODE COURSE TITLE Hrs / Credits IA SE Total

Week 4 30 70 100
4 30 70 100
1 CS8115 Artificial Intelligence 4
4 30 70 100
2 CS8215 Computer Graphics And 4 4 30 70 100

Multimedia 3 30 70 100
3 30 70 100
3 CS8315 Advanced Course in DBMS 4

4 CS8415 Software Project 4

Management

PRACTICAL

1 MCS2P1 Artificial Intelligence Lab 6

2 MCS2P2 Computer Graphics And 6

Multimedia Lab

THIRD SEMESTER

THEORY

SL.NO. CODE COURSE TITLE Hrs / Credits IA SE Total
4 30 70 100
Week 4 30 70 100
2 15 35 50
1 CS9115 Data mining and Data 4 2 15 35 50

Warehousing 4 30 70 100

2 CS9215 Network Security 4 3 30 70 100
3 30 70 100
Department Elective (One of the two)

3 CSDE9 Computer Architecture 2

315

CSDE9 Mobile Computing 2

415

Open Elective (For other students)

4 CSOE9 Web Technologies 4

515

PRACTICAL

1 MCS3P1 Mini Project / Dissertation 6

Lab

2 MCS3P2 Networking Lab 6

FOURTH SEMESTER

THEORY COURSE TITLE Hrs / Credits IA SE Total
SL.NO. CODE Week 30 70 100
Distributed Computing 4 30 70 100
1 CS0115 4 30 70 100
Systems 4 30 70 100
2 CS0215 4 4
3 CS0315 OOAD Using UML 4 30 70 100
4
4 CS0415 Android Application 4

PRACTICAL Development
1 MCS4P1
Data Storage

Technologies

Major Project / 12 6
Dissertation

EXAMINATION AND ASSESMENTS 30 %
70%
1. IA Weight age
2. End Semester Examination Weight age

QUESTION PAPER PATTERN
The question papers of the theory examinations should follow the pattern specified below:

Section Marks for each Number Of Questions Total Marks
question
A Total Should Answer 20
B 2 30
C 6 10 10 20
10
75

32

Total Marks 70

While selecting the questions importance should be given to all major units.

PRACTICAL QUESTION PAPER FORMAT 25 marks
25 marks
Scheme of valuation: 10 marks
05 marks
1. Writing two programs one from each section 05 marks
2. Execution of one program
3. Formatting the program and output 70 marks
3. Record verification
4. Viva voce related to practical topics only 35 marks
35 marks
Total
70 marks
PROJECT EVALUATION FORMAT

Scheme of valuation:

1. Demonstration and presentation
2. Documentation

Total

INTERNAL ASSESSMENT FORMAT
THEORY:

1. IA test 15 marks
2. First Activity 10 marks
3. Attendance 5 marks

Total 30 marks

PRACTICALS:

Every practical class the student should be assessed.

1. Writing the observation book 3 marks
2. Executing the programs 5 marks
3. Record writing 2 marks

Total 10 marks

Internal marks for the final semester project work can be awarded by the guide by evaluating
the performance of the student during the course of the project work.

FIRST SEMESTER

TITLE : Theory of Computation

CODE : CS7115
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

The course introduces some fundamental concepts in automata theory and formal languages
including grammar, finite automaton, regular expression, formal language, pushdown
automaton, and Turing machine. Not only do they form basic models of computation, they are
also the foundation of many branches of computer science, e.g. compilers, software engineering,
concurrent systems, etc. The properties of these models will be studied and various rigorous
techniques for analyzing and comparing them will be discussed, by using both formalism and
examples.

Learning Outcome:

By the time this course is completed, a student should:
Understand mathematical models of computations, Be able to reason formally about
mathematical models, and Understand decidability and NP-Completeness.

Introduction to Finite Automata: 10 Hrs

Introduction to Finite Automata; The central concepts of Automata theory; Deterministic finite

automata; Nondeterministic finite automata

Finite Automata, Regular Expressions: 8 Hrs

An application of finite automata; Finite automata with Epsilon-transitions; Regular

expressions; Finite Automata and Regular Expressions; Applications of Regular Expressions

Regular Languages, Properties of Regular Languages: 8 Hrs

Regular languages; Proving languages not to be regular languages; Closure properties of

regular languages; Decision properties of regular languages; Equivalence and minimization of

automata

Context-Free Grammars And Languages: 10 Hrs

Context –free grammars; Parse trees; Applications; Ambiguity in grammars and Languages .

Pushdown Automata: 8 Hrs

Definition of the Pushdown automata; the languages of a PDA; Equivalence of PDA’s and

CFG’s; Deterministic Pushdown Automata

Properties of Context-Free Languages: 8 Hrs
Normal forms for CFGs; The pumping lemma for CFGs; Closure properties of CFLs

Introduction To Turing Machine: 8 Hrs

Problems that Computers cannot solve; The turning machine; Programming techniques for

Turning Machines; Extensions to the basic Turning Machines; Turing Machine and Computers.

BOOKS:
1. J.E.Hopcraft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,

Languages and Computation”, Pearson Education
2. Cohen, “Introduction to Computer Theory”, John Wiley.
3. M. Sipser, Introduction to Theory of Computation, PWS Publishing Corporation, 1997.
4. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and

Computation, Addison-Wisley, 1979.
5. T.C. Martin, Theory of Computation, Tata McGraw-Hill
6. H.R. Lewis, C.H. Papadimitrou, Elements of the Theory of Computation, PHI.

TITLE : Design Methods and Analysis of Algorithm

CODE : CS7215
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

To introduce the classic algorithms in various domains and study the different techniques for
designing efficient algorithms.

Learning Outcome:

Upon successful completion of the course student will be able to
• Design efficient algorithms using the various approaches for real world problems.
• Analyze the running time of algorithms for problems in various domains.
• Apply the algorithms and design techniques to solve problems.

Elementary Data Structures: 12 Hrs

Arrays, stacks, queue, linked list, Basic Computational Models, simple Algorithms. Analyzing

Algorithms, Asymptotic Notation, Recurrence relations. Design Methods: General

Consideration, Algorithm design paradigms and representative problems.

Divide and Conquer: 12 Hrs
Binary search, Merge Sort, Quick Sort, Arithmetic with Large integers.

Greedy Method: 12 Hrs

Minimal Spanning Tree, Shortest Paths, Knapsack. Dynamic Programming, Chained Matrix

Multiplication, Optimal Storage on Tapes, Shortest Paths, Optimal Search Trees.

Backtracking Method: 12 Hrs

8-queens problem, Graph Coloring, Hamiltonian Cycles, Branch and Bound 0/1 Knapsack

problem, Travelling Salesperson, Approximation Graph Coloring, Task Scheduling, Bin

Packing.

Graph Algorithms: 12 Hrs

BFS, DFS and its applications. Polynomial Evaluation , Intractable Problems : Basic Concepts,

Nondeterministic Algorithms, NP Completeness, Cook's Theorem, Examples of NP-Hard

and NP-Complete problems.

BOOKS:
1. A.Aho, J. Hopcroft and J.Ullman, The Design and Analysis of Computer Algorithms,

Addison Wesley.
2. E. Horowitz and S. Sahani, Fundamentals of Computer Algorithms, Galgotia,

New Delhi.
3. S.E.Goodman and S.T.Hedetniemi, Introduction to the Design and Analysis of

Algorithms, McGraw Hill.
4. G.Brassard and P.Bratley, Algorithmics, PHI.
5. S.K.Basu, Design Methods and Analysis of Algorithms, PHI, 2005.

TITLE : Data Communication and Computer Network
CODE : CS7315

Hrs / Week : 4 Hrs
CREDITS :4

Course Objective:

 To study about network components. To study about topologies and network models.
 To study about various network protocols, algorithms.

Learning outcome

• Students will gain knowledge about networks, internal components and its functionality.

Elements of data communication: 15 Hrs

Concepts and terminology, analog and digital data transmission, signals, attenuation, delay

distortion, noise, channel capacity, transmission media, data encoding, asynchronous and

synchronous transmission, multiplexing.

Communication network, Circuit Switching, Message Switching and Packet Switching, Radio

and Satellite Networks, Local Area Network topology, medium access control protocols.

Design and Setting a practical Network: 15 Hrs
Network Adaptors, Repeaters, Hubs, Bridges, Switches and Routers, Cables.

Network Architecture and Distributed Processing: 15 Hrs

OSI reference model, layered and hierarchical approaches, network interfaces, internet

protocols and standards. Network services, electronic mail, Digital Signature, and Firewalls.

Introduction to high-speed networks: 15 Hrs
Routing, Scheduling, Congestion Control issues and algorithms.

BOOKS:
1. B. A. Forouzan, Data Communications and Networking, TMH, 2003.
2. W.Stallings, Data and Computer Communication, McMillan.
3. A.S.Tanenbaum, Computer Networks, PHI.
4. J. Martin, Computer Network and Distributed Data Processing, Prentice Hall.
5. W.Stallings, Local Networks, McMillan.
6. M.Schwertz, Computer Communication Network Design and Analysis, Prentice

Hall
7. Keshav, An Engineering Approach to Computer Networks, Addison-Wisley, 1998.
8. Peterson and Davie, Computer Networks, Morgan and Kaufmann, 2000.

TITLE : Object Oriented Programming using JAVA

CODE : CS7415
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

This course introduces fundamental structured and object-oriented programming concepts and
techniques, using Java, and is intended for all who plan to use computer programming in their
studies and careers. Topics covered include variables, arithmetic operators, control structures,
arrays, functions, recursion, dynamic memory allocation, files, class usage , arrays, recursion,
polymorphism, exceptions ,Applet Programming and class writing. Program design and testing
are also covered, in addition to more advanced object-oriented concepts including inheritance
and exceptions as time permits.

Learning Outcomes:

On successful completion if this course, students should be able to:

 Understand the basic concepts and principles of structured programming.
 Understand the basic concepts and principles of object oriented programming.
 Produce sample use-cases, pseudo code, and an incremental coding plan for a given

problem specification.

 Design, write, and test a Java program to implement a solution to a given problem
specification.

 Understand the operation of common data structures and algorithms.

Introduction to JAVA: 12 Hrs

JAVA Evolution, Introduction to Programming Languages, The Evolution of Java, Object-

Oriented Programming Concepts and Java, Differences between C++ and Java, The Primary

Characteristics of Java, The Architecture, Simple Java Program, Java Tokens, Java Statements,

Implementing a Java Program, Java Virtual Machine, Programming Style. Constants, Variables,

and Using Data Types, Operators and Expressions, Type conversion and Associativity,

Mathematical Functions. Decision Making and Branching: Introduction, Decision Making with

if Statement, Simple if Statement, The if …… else Statement, Nesting of if ……… else

Statements, The Switch Statement, The?: Operator. Decision Making and Looping: Introduction.

The while Statement, The do Statement, the for Statement, Jumps in Loops Labeled Loops.

Classes, Arrays, Strings and collection frame work: 12 Hrs

Introduction, Defining a Class, Adding Variables, Adding Methods, Creating Objects, Accessing

Class Members, Constructors, Methods Overloading, Static Members, Nesting of Methods.

Inheritance: Extending a Class Overriding Methods, Final Variables and Methods, Finalizer

methods, Abstract Methods and Classes, Visibility Control.

Arrays Strings and Vectors: Arrays, One – dimensional Arrays, Creating an Array, Two –

dimensional Arrays, Strings, Vectors, WrapperClasses.

Interfaces, Packages, and Multithreaded Programming: 6 Hrs

Interfaces: Multiple Inheritance: Introduction, Defining Interfaces, Extending Interfaces,

Implementing Interfaces, Accessing Interface Variables. Packages: Putting Classes together:

Introduction, Java API Packages, Using System Packages, Naming Conventions, Creating

Packages, Accessing a Package, Using a Package, Adding a Class to a Package, Hiding Classes.

Multithreaded Programming: 10 Hrs

Introduction, Creating Threads, Extending the Thread Class, Stopping and Blocking a thread,

Life Cycle of a thread, Using Thread Methods, Thread Exceptions, Thread Priority,

Synchronization, Implementing the ‘Runnable’ Interface.

Managing Exceptions, Applet Programming: 12 Hrs

Introduction, Types of Errors, Exceptions, Syntax of Exception Handling Code, Multiple Catch

Statements, Using Finally Statement, Throwing Our Own Exceptions, Using Exceptions for

Debugging.

Applet Programming: Introduction, How Applets Differ from Applications, Preparing to Write

Applets, Building Applet Code, Applet Life Cycle, Creating an Executable applet, Designing a

Web Page, Applet Tag, Adding Applet to HTML File, running the Applet, More about Applet

Tag, Passing Parameters to Applets, Aligning the Display, More About HTML Tags, Displaying

Numerical Values, Getting Input from the Usr.

Managing Input / Output Files in JAVA: 8 Hrs

Introduction, Concept of Streams, Stream Classes, Byte Stream Classes, Character Stream

Classes, Using Streams, Other Useful I/O Classes, Using the File Class, Input/Output

Exceptions, Creation of Files, Reading/Writing Characters, Reading/Writing Bytes, Handling

Primitive Data Types, Concatenating and Buffering Files, Interactive Input and output, Other

Stream Classes.

BOOKS:
1. Shishir Gundavaram, CGI Programming on the World Wide Web, O’Reilly and

Associates, (1996).
2. E. Balaguruswamy, Programming with JAVA, A Primer, 2nd Edition., TMH (1999)
3. Thomas Boutel, CGI programming in C and Perl, Addison – Wesley, (1996).
5. Jefry Dwight et al, Using CGI, (Second Edition), Prentice Hall, India, (1997).
6. Darrel Ince & Adam Freeman, Programming the Internet with Java, Addison – Wesley,

(1997).
7. KenArnold & James Gosling, The Java Programming Language, Addison – Wesley,

(1998)
8. Patrick Naughton & Herbert Schildt, JAVA 2: The Complete Reference, 3rd Edition,

TMH, (1999).

PRACTICALS

TITLE : Design Methods and Analysis of Algorithm Lab

CODE : MCS1P1
Hrs / Week : 6 Hrs

CREDITS :3

1. A list of programs should be prepared by the lab in-charge and displayed at the
beginning of the semester with the approval of the HOD.

2. The list should include at least 20 programs (more can be considered) covering all units
equally.

3. The students should write the algorithm and the flow charts for the problems solved in
the labs itself, this should be evaluated by the lab in-charge.

4. The questions can be designed with real time application in mind, the programs should
not be conventional type.

5. All the students should execute the same set of problems.

TITLE : Object Oriented Programming Lab

CODE : MCS1P2
Hrs / Week : 6 Hrs

CREDITS :3

1. A list of programs should be prepared by the lab in-charge and displayed at the
beginning of the semester with the approval of the HOD.

2. The list should include at least 20 programs (more can be considered) covering all units
equally.

3. The students should write the algorithm and the flow charts for the problems solved in
the labs itself, this should be evaluated by the lab in-charge.

4. The questions can be designed with real time application in mind, the programs should
not be conventional type.

5. All the students should execute the same set of problems.

SECOND SEMESTER

TITLE : Artificial Intelligence
CODE : CS8115

Hrs / Week : 4 Hrs
CREDITS :4

Course Objective:

To study about the concept of artificial intelligence and the various techniques used for
developing intelligent computer programs. To familiarize students to the application area of AI.

Learning outcome:
Students will gain knowledge about developing intelligent computer programs.

Introduction: 15 Hrs

Definitions and approaches, Foundations of A.I., History of AI, Areas and state of the art in A.I.,

A.I. Programming languages, Concept of Intelligent Agents.

Problem Solving: 15 Hrs

Problem solving as state space search, production system, control strategies and problem

characteristics; Search techniques: Breadth First and Depth-first, Hill-climbing, Heuristics, Best-

First Search, A* algorithm, Problem reduction and AO* algorithm, Constraints satisfaction,

Means Ends Analysis, Game Playing.

Knowledge Representation and Reasoning: 15 Hrs

Syntactic and Semantic representations, Predicate and prepositional logic, Resolution,

Unification, Deduction and theorem proving, Question answering, Overview of PROLOG;

Forward versus backward reasoning, Matching, Indexing; Ontological Engineering, Formal

Theory of Beliefs, Semantic Net, Frames, Conceptual Dependencies and Scripts, Truth

Maintenance Systems.

Selected Topics and Applications: 15 Hrs

Philosophical issues, Introduction to Natural Language Processing, Expert Systems and Multi-

agent Systems.

BOOKS:
1. S. Russel, P. Norvig, Artificial Intelligence: A Modern Approach, Pearson Education.
2. E. Rich and K. Knight, Artificial Intelligence, Tata McGraw Hill.
3. Nilsson, Artificial Intelligence: A New Synthesis, Morgan Kaufmann.
4. Manual of Turbo PROLOG.

TITLE : Computer Graphics And Multimedia

CODE : CS8212
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

This course deals with two and three dimensional transformation, projection and graphical
functions. It helps to have a better understanding of 2D and 3D technologies.

Learning Outcome:

Students will understand 2D and 3D graphic techniques which will help them to proceed with
their project development.

Introduction: 10 Hrs

Introduction to Computer Graphics, Display Technologies, Random and Raster Scan, frame

buffer, bit plane, Input Devices, Graphics Standards, Graphics Hardware.

Line and Circle drawing: 30 Hrs

Line and Circle Drawing Algorithms, Scan Conversion, filling algorithms, clipping, Two and

Three Dimensional transformations, Homogeneous Coordinates, Rigid Body and Affine

transformations, Parallel and perspective projections, vanishing points, viewing transformation,

Hidden line removal method, Curve and Surface: Cubic Spline, Bezier curve, B-Spline Curves,

Parametric Surface, Surface of revolution, Sweep surface, Fractal Curves and surfaces.

Introduction to Multi-media technology: 20 Hrs

Introduction to Multi-media Technology, Audio System, Image Compression, Data

Compression, Digital Motion Video, Authoring tools, Multimedia Applications, Multimedia

DBMS.

BOOKS:
1. R. Steinmetz and K. Nahrstedt, Multimedia: Computing, Communications and

Applications, Prentice Hall P T R, 1995.
2. Computer Graphics (Principles and Practice) by Foley, van Dam, Feiner and Hughes,

Addisen Wesley (Indian Edition)
3. Computer Graphics by D Hearn and P M Baker, Printice Hall of India (Indian Edition).
4. Mathematical Elements for Computer Graphics by D F Rogers

TITLE : Advanced Course in DBMS

CODE : CS8315
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

The course will cover a number of advanced topics in big data, databases, and modern data-
intensive systems. The specific topics include advanced concurrency control techniques, query
processing and optimization strategies for relational database systems, advanced indexing
methods, parallel and distributed database systems, data mining on large databases, data on the
web, and topics in database security and privacy.

Learning Outcome:

Upon completion of this course, students should be able to:
 Explain in detail DBMS architecture.
 Explain in detail query processing and techniques involved in query optimization.
 Explain the principles of concurrency control.
 Explain the principles of recovery management.
 Know recent developments and active research topics in database.

Functional Dependencies: 12 Hrs

Basic definitions, Trivial and non trivial dependencies, closure of a set of dependencies, closure

of a set of attributes, irreducible set of dependencies. Normalization techniques : Normal forms,

First normal form, second normal form, third normal form, BCNF, fourth normal form, Fifth

normal form.

Query Optimization: 12 Hrs

Introduction, General Optimization Strategies, Algebraic Manipulation, Optimization of

Selections in System R optimizer.

Database Protection and recovery: 12 Hrs

Integrity, Constraints in Query-by-Example, Security, Security in query-by-Example, Security in

Statistical Databases, Transactions, properties of transactions, recovery(System recovery, Media

recovery).

Concurrent Operations on the Database: 12 Hrs

Basic Concepts, A simple Transaction Model, Model with Read- and Write-Locks, Read-only,

Write-only Model, Protection against Crashes, Optimistic Concurrency Control.

Principles of Distributed Data Bases: 12 Hrs

Framework for distribution. Query optimization and management of distributed transaction.

Concurrency control and reliability in distributed databases. Administration of Distributed

Data Bases.

BOOKS:
1. J.D.Ullman, Principles of Database Systems, Galgotia, New Delhi.
2. Database Systems , C .J Date
3. Fundamentals of Database Management Systems, Alexis Leon and Mathews Leon
4. S.Ceri and G. Relagatti, Distributed Databases, McGraw-Hill.
5. C.Papadimitriou , The Theory of Database concurrency Control, Computer Science

Press.
6. T. Ozsu and P. Valduriez, Principles of Distributed Database Systems, Prentice-Hall.

TITLE : Software Project Management
CODE : CS8415

Hrs / Week : 4 Hrs
CREDITS :4

Course Objectives:

 To introduce the fundamentals of software project management
 To give an insight into the project planning phase, selection of an appropriate project

approach

 An in-depth study of software project models.
 To understand the concepts of effort estimation, activity planning, risk management.
 Understanding the methods for resource allocation, monitoring and control and people

management.

 To outline the formal procedures for software quality.

Learning Outcome:

After learning the course the students should be able to explain about the fundamentals of
software project management, he /she should be able to apply the project planning approaches
and corresponding software models for upcoming projects. They should be able to understand
the concept of effort estimation, activity planning and risk management. The student should get
acquainted in concepts of managing teams. They should be able to recognize the importance of
software quality.

Introduction to Software Project Management: 6 Hrs

Introduction, Software project versus other types of projects, contract management and

technical project management, activities covered by Software Project Management, plans

methods and Methodologies, Categorizing Software Projects, setting objectives stakeholders,

business case, requirement specification, Management control.

Project planning: 6 Hrs
Introduction and various steps in project planning.

Project evaluation: 6 Hrs

Strategic assessment, technical assessment, cost-benefit analysis, cash flow forecasting, cost-

benefit evaluation techniques, risk evaluation.

Selection of appropriate Project approach: 6 Hrs

Choosing technologies, technical plan contents list, choice of process models, (structure versus

speed of delivery), waterfall model, V-process model, spiral model, software prototyping, other

ways of categorizing prototypes, controlling changes during prototyping, incremental delivery,(

dynamic systems development method, extreme programming, Managing iterative processes),

selecting more appropriate process model.

Software Effort Estimation: 6 Hrs

Estimation Techniques – COCOMO Model. Activity planning: Objectives, When to plan, project

schedules, projects and activities, sequencing and scheduling the activities, network planning

models, formulating a network model, adding time dimension, forward pass, backward pass,

identifying critical path, activity float, shortening project duration, identifying critical activities,

activity-on-arrow networks.

Risk Management: 6 Hrs

Nature of risk, types of risk, managing risk, hazard identification, hazard analysis, risk planning

and control, evaluating risks to the schedule.

Resource allocation: 6 Hrs

Nature of resources, identifying resource requirements, scheduling resources, creating critical

paths, counting the cost, publishing resource schedule.

Monitoring and control: 6 Hrs

Creating framework, collecting data, visualizing progress, cost monitoring, earned value,

prioritizing monitoring, getting the project back to target, change control.

Managing people and organizing teams: 6 Hrs

Understanding behavior, organizational behavior: a background, selecting the right person for

the job, instruction in the best methods, motivation, working in groups, becoming a team,

decision making, leadership, organizational structures, stress, health and safety.

Software quality: 6 Hrs

Place of software quality in project planning, importance of project quality, defining software

quality, ISO 9126, practical software quality measures, product versus process quality

management, external standards, techniques to help enhance software quality, quality plans.

BOOKS:
1. Hughes, Bob and Cotterell, Mike, Software project Management, 3rd OR 4th Edition,

TMH, 2005
2. Kathy Schwalbe, Information Technology Project Management, Vikas Publishing House,

2004
3. Kieron Conway, Software Project Management – From Concept to Deployment, Dreamtech

Press, 1st Reprint Edition, 2002
4. Kelkar S. A,Information Technology Project Management, A concise study, PHI, 2005
5. Royce, Walker, Software project Management A unified Framework, Pearson

PRACTICALS

TITLE : Artificial Intelligence Lab
CODE : MCS2P1

Hrs / Week : 6 Hrs
CREDITS :3

1. A list of programs should be prepared by the lab in-charge and displayed at the
beginning of the semester with the approval of the HOD.

2. The list should include at least 20 programs (more can be considered) covering all units
equally.

3. The students should write the algorithm and the flow charts for the problems solved in
the labs itself, this should be evaluated by the lab in-charge.

4. The questions can be designed with real time application in mind, the programs should
not be conventional type.

5. All the students should execute the same set of problems.

TITLE : Computer Graphics Lab
CODE : MCS2P2

Hrs / Week : 6 Hrs
CREDITS :3

1. A list of programs should be prepared by the lab in-charge and displayed at the
beginning of the semester with the approval of the HOD.

2. The list should include at least 20 programs (more can be considered) covering all units
equally.

3. The students should write the algorithm and the flow charts for the problems solved in
the labs itself, this should be evaluated by the lab in-charge.

4. The questions can be designed with real time application in mind, the programs should
not be conventional type.

5. All the students should execute the same set of problems.

THIRD SEMESTER

TITLE : Data Mining and Data Warehousing

CODE : CS9115
Hrs / Week : 4 Hrs

CREDITS :4

Course Objectives:

The student should be made to:

 Be familiar with the concepts of data warehouse and data mining,

 Be acquainted with the tools and techniques used for Knowledge Discovery in
Databases.

Learning Outcome:

After completing this course, the student will be able to:
 Apply data mining techniques and methods to large data sets.
 Use data mining tools
 Compare and contrast the various classifiers.

UNIT I DATA MINING 10 Hrs

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 II ASSOCIATION RULE MINING AND CLASSIFICATION 10 Hrs

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 Back propagation – Support Vector

Machines – Associative Classification – Lazy Learners – Other Classification Methods –

Prediction.

UNIT III CLUSTERING AND TRENDS IN DATA MINING 10 Hrs

Cluster Analysis – Types of Data – Categorization of Major Clustering Methods – K-means–

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 Applications.

UNIT IV DATA WAREHOUSING 15 Hrs

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 V BUSINESS ANALYSIS 15 Hrs

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.

BOOKS:
1. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining and OLAP”, Tata

McGraw – Hill Edition, Thirteenth Reprint 2008.
2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Third

Edition, Elsevier, 2012.
3. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”,

Person Education, 2007.
4. K.P. Soman, Shyam Diwakar and V. Aja, “Insight into Data Mining Theory and

Practice”, Eastern Economy Edition, Prentice Hall of India, 2006.
5. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy

Edition, Prentice Hall of India, 2006.
6. Daniel T.Larose, “Data Mining Methods and Models”, Wiley-Interscience, 2006.

TITLE : Network Security

CODE : CS9215
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

 To provide a solid understanding of the main issues related to security in modern
networked computer systems.

 To understand concepts and foundations of computer security.

 Basic knowledge about security-relevant decisions in designing IT infrastructures like
personal laptop to large-scale infrastructures.

Learning Outcome:

Upon successful completion of this course student should be able to

 Understand extensive, detailed and critical understanding of the concepts, issues,
principles and theories of computer network security.

 Understand critical theoretical and detailed practical knowledge of a range of computer
network security technologies as well as network security tools and services.

 Gain experience of analyzing, designing, implementing and validating solutions to
computer network security challenges using common network security tools and formal
methods.

Introduction: 12 Hrs

Introduction to the concepts of security, the need for security, security approaches, principles of

security, types of attacks. Convention Encryption: Conventional Encryption Model,

Steganography, Classical Encryption Techniques, Simplified DES, Block Cipher Principles, The
Data Encryption Standard, The Strength of DES, Differential and Linear Cryptanalysis, Block
Cipher Design Principles, Block Cipher Modes of operation, Conventional Encryption
algorithms.

Public Key Encryption And Hash Functions: 12 Hrs

Public Key Cryptography, Principles of Public Key Cryptosystems, The RSA Algorithm, Key

Management, Diffie Hellman Key Exchange, Elliptic Curve Cryptography Message

Authentication and Hash Functions Authentication Requirements, Authentication Functions,

Message Authentication Codes, Hash Functions, Security of Hash Functions.

Hash and Mac Algorithms: 12 Hrs

Introduction, Nifty things to do with a Hash, MD5 Message Digest Algorithm, Secure Hash

Algorithm (SHA-I), RIPEMD, HMAC, CMAC, Digital Signatures, Authentication Protocols -

Digital Signature Standard.

Network Security Applications: 12 Hrs

Authentication Applications, Kerberos, X.509 authentication service, public key Infrastructure

(PKI), Electronic Mail Security, Pretty Good Privacy, S/MIME, IP Security, IP Security

Overview, IP Security Architecture, Authentication Header, Encapsulating payload, combining

security association, Key Management, Web Security, Web Security Considerations, Secure

Socket Layer & Transport Layer Security, Secure Electronic Transaction, Introduction to

Wireless security.

Intruders, Viruses and Worms: 12 Hrs

Intruders, Intrusion detection, password management, Viruses and Related Threats, Distributed

Denial of service attacks, Firewall Design Principles, Trusted Systems, virtual private

network(VPN).

BOOKS:
1. William Stallings, “Cryptography and Network Security”, Fourth edition, Prentice Hall,

2007.
2. Atul Kahate, “Cryptography and Network Security,” Tata McGraw-Hills, 2006.
3. Neal Krawetz, “Introduction to Network Security”, Thomson Business Press, 2007.
4. Eric Maiwald, “Information Security Series”, “Fundamental of Network security”,

Dreamtech press, 2004.
5. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security: Private

Communication in public world”, Prentice Hall, India, 2002.

TITLE : Computer Architecture

CODE : CSDE9315
Hrs / Week : 2 Hrs

CREDITS :2

Course Objective:

 To make students understand the basic structure and operation of digital computer.

 To familiarize the students with arithmetic and logic unit and implementation of fixed
point and floating-point arithmetic operations.

 To familiarize the students with hierarchical memory system including cache memories
and virtual memory.

 To expose the students with different ways of communicating with I/O devices and
standard I/O interfaces.

Learning Outcome:

At the end of the course the student will be able to:
 Design Arithmetic logic unit
 Evaluate the performance of memory systems

Computer system: 6 Hrs

Computer components – computer function – instruction fetch and execute – interrupts – I/O

functions – interconnection structures – Bus interconnection – Bus structure

Central processing unit: 8 Hrs

Machine Instruction sets characteristics – types of operands – types of operations – addressing

modes – instruction formats - processor organization

Memory: 10 Hrs

Computer memory system overview – characteristics of memory system – memory hierarchy –

Internal memory-semiconductor main memory – organization – DRAM and SRAM – types of

ROM – Cache memory principles – External memory – magnetic disk- read write mechanisms –

data organization and formatting – physical characteristics –disk performance parameters,

Optical Memory-Compact Disk

Input/output organization: 6 Hrs

External devices – I/O modules – programmed I/O – interrupt driven I/O, – Direct memory

access (DMA)

BOOKS:
1. David A. Patterson and John L. Hennessey, “Computer organization and design’,

Morgan Kauffman / Elsevier, Fifth edition, 2014.
2. V.Carl Hamacher, Zvonko G. Varanesic and Safat G. Zaky, “Computer Organisation“,

VI th edition, Mc Graw-Hill Inc, 2012.
3. William Stallings “Computer Organization and Architecture” , Seventh Edition ,

Pearson Education, 2006.

4. Vincent P. Heuring, Harry F. Jordan, “Computer System Architecture”, Second Edition,
Pearson Education, 2005.

5. Govindarajalu, “Computer Architecture and Organization, Design Principles and
Applications”, first edition, Tata McGraw Hill, New Delhi, 2005.

6. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata Mc
Graw Hill, 1998.

TITLE : Mobile Computing
CODE : CSDE9415

Hrs / Week : 2 Hrs
CREDITS :2

Course Objective:

This course will detail about the basics of mobile concepts along with the description of devices
and technologies that we use in day today life.

Learning Outcome:

A wide knowledge about the existing technologies with the background details. Also gives an
advanced thought provoking ideas about the protocols and other related terms.

Introduction to mobile computing: 10 Hrs

Mobility, portability, BS, MS, MSC, PSTN, FCC, RCC, FDD, TDD, simplex, half duplex, full

duplex, hand off, trunking, GoS, interference, CDMA, TDMA, FDMA, SDMA.

Telecommunications system: 10 Hrs

GSM-mobile services, system architecture, radio interface, protocols, localization and calling,

handover, security. Bluetooth, Wireless ATM (introductory concepts only)

Support for mobility: 10 Hrs
File systems, www, wireless application protocol

BOOKS:
1. Jochen Schiller., “Mobile communications”,Pearson Education,2008.
2. Rappaport. T.S., “Wireless communications”, Pearson Education, 2003.

TITLE : Web Technologies

CODE : CSOE9515 (Open elective for other students)
Hrs / Week : 4 Hrs

CREDITS :4

Course Objectives:

On successful completion of the course the students will be able to do the following:
• To provide an in-depth training for web development skills.
• To understand and develop l web pages independently.
• To understand the methods of debugging and correcting anomalies.
• To provide a proper foundation for learning other tools of web development.

Internet Basics: 12 Hrs

Introduction to internet and its applications, E-mail, telnet, FTP, e-commerce, video

conferencing, e-business. Internet service providers, domain name server, internet address,

World Wide Web and its evolution, uniform resource locator (URL), browsers – internet

explorer, netscape navigator etc. search engine, web saver – apache, proxy server, HTTP

protocols.

Web Designing Technologies: 12 Hrs

Introduction to HTML, ASP, JSP, Java scripts, VB scripts, HTML/DHTML – file creation, HTML

tags, titles footers, text formatting, forms, images, lists, tables, linking documents, front page

editing, frame sets, order list, un-order list, special characters

Java Script: 12 Hrs

Introduction to Java script, writing java script into HTML, Building of Java Script Syntax Data

types of variables, arrays, operators, expressions, programming construct of conditional

checking, loop ends functions, dialogue boxes

Java Script Document Object Model: 12 Hrs

Understanding objects in HTML – properties and methods, browsers objects, understanding

DOM, web page events. Forms Used by a Website Forms objects, user defined object

Cascading Style Sheets: 12 Hrs

Understanding the importance of CSS, Types: inline, internal and external with examples.

Selector types: id, class and overriding the styles.

BOOKS:
1. E. Balaguruswamy, Programming with JAVA, A Primer, 2nd Edition., TMH
2. KenArnold & James Gosling, The Java Programming Language, Addison – Wesley.
3. Patrick Naughton & Herbert Schildt, JAVA 2: The Complete Reference, 3rd Edition,

TMH.
4. Internet 6-in-1 by Kraynak and Habraken, Prentice Hall of India Pvt. Ltd., New Delhi
5. Internet for Everyone by Alexis Leon and Mathews Leon; Vikas Publishing House Pvt.

Ltd., New Delhi

6. HTML – 4 for World Wide Web by Castro Addison Wesley (Singapore) Pvt. Ltd., New
Delhi

7. Principles of Web Designing Joel Sklar, Web Warrior Series Available with Vikas
Publishing House Pvt. Ltd., New Delhi

PRACTICALS

TITLE : Mini Project / Dissertation Lab
CODE : MCS3P1

Hrs / Week : 6 Hrs
CREDITS :3

1. The students should choose a Mini Project/ Research activity / Dissertation at the
beginning of the semester with the approval of the HOD.

2. The students will be evaluated by the lab in-charge on a weekly basis.
3. The questions can be designed with real time application in mind.
4. At the end the students should submit a documentation and prepare a presentation to

explain the work that has been done.

TITLE : Networking Lab
CODE : MCS3P2

Hrs / Week : 6 Hrs
CREDITS :3

1. A list of programs should be prepared by the lab in-charge and displayed at the
beginning of the semester with the approval of the HOD.

2. The list should include at least 20 programs (more can be considered) covering all units
equally.

3. The students should write the algorithm and the flow charts for the problems solved in
the labs itself, this should be evaluated by the lab in-charge.

4. The questions can be designed with real time application in mind, the programs should
not be conventional type.

5. All the students should execute the same set of problems.

FOURTH SEMESTER

TITLE : Distributed Computing Systems

CODE : CS0115
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

 To understand tools and techniques for implementing substantial communication and
synchronization

 To study core ideas behind modern coordination and distributed data structures

 To understand a variety of methodologies and approaches for reasoning about
concurrent and distributed programs

Learning Outcome:

Upon successful completion of this course student should be able to

 Gain knowledge of the theoretical and conceptual foundations of distributed computing.
 Understand the inherent difficulties that arise due to distributedness of computing

resources.

 Understand the feasibilities and the impossibilities in managing resources.
 Identify the problems in developing distributed applications.

Introduction to Distributed Systems: 12 Hrs

Introduction -- What is a Distributed System? – Goals – (Advantages of Distributed Systems

over Centralized Systems, Advantages of Distributed System over Independent PCs,

Disadvantages of Distributed Systems) – Hardware Concepts – (Bus-Based Multiprocessors,

Switched Multiprocessors, Bus-Based Multicomputers, Switched Multicomputers) – Software

Concepts – (Network Operating Systems, True Distributed Systems, Multiprocessor

Timesharing Systems) – Design Issues – (Transparency, Flexibility, Reliability, Performance,

Scalability)

Communication in Distributed Systems: 12 Hrs

Introduction Asynchronous Transfer Mode Network – (What is Asynchronous Transfer Mode?

ATM Physical Layer, ATM Layer, ATN Adaptation Layer, ATM Switching) – The Client-Server

Model – (Client and Servers, Addressing, Block versus Nonblocking Primitives, Buffered versus

Unreliable Primitives) – Remote Procedure Call – (Basic RPC Operation, Parameter Passing,

Dynamic Binding, RPC Semantics in the Presence of Failures) Distributed objects and remote

invocation : Introduction, Communication between distributed objects, Java RMI case study

Synchronization in Distributed Systems: 12 Hrs

Introduction -- Clock Synchronization – (Logical Clocks, Physical Clocks, Clock

Synchronization Algorithms) – Mutual Exclusion – (A Centralized Algorithm, A Distributed

Algorithm, A Token Ring Algorithm) – Election Algorithms – (The Bully Algorithm, A Ring

Algorithm) – Atomic Transactions – (Introduction to Atomic Transactions, The Transaction
Model. Implementation, Concurrency Control) – Deadlocks in Distributed Systems –
(Distributed Deadlock Detection & Prevention)

Processes and Processors in Distributed Systems: 12 Hrs

Introduction – Threads – (Introduction to Threads, Threads Usage, Design Issues for Threads

Packages,) – System Models – (The Workstation Model, Using Idle Workstations, The Processor

Pool Model, A hybrid Model) – Processor Allocation – (Allocation Models, Design Issues for

Processor Allocation Algorithms, Implementation Issues for Processor Allocation Algorithms,

Example Processor Allocation Algorithms) – Scheduling in Distributed Systems – Fault

Tolerance – (Component Fault, System Failures, Synchronous versus Asynchronous Systems,

Use of Redundancy, Fault Tolerance Using Active Replication, Agreement in Fault Systems)

Distributed File Systems: 12 Hrs

Introduction – Distributed File System Design – (The File Service Interface, The Directory Server

Interface, Semantics of File Sharing) -- Distributed File System Implementation – (File Usage,

System Structure, Caching, Replication, An Example: Sun’s Network File System). Distributed

Shared Memory: Introduction, What is Shared Memory? , Consistency Models, Page-Based

Distributed Shared Memory.

BOOKS:
1. Tanenbaum S Andrew, Distributed Operating Systems, Pearson Eduction Asia, 2001
2. Singhal Mukesh, Shivaratri G Niranjan, Advanced Concepts In Operating Systems

Distributed Data Base, And Multiprocessor Operating Systems, McGraw-Hill, Inc., 2002
3. George Colulouris , Jean Dollimore, Tim Kindberg, Distributed systemsConcepts and

Design, Second edition, Addison_Wesely 2. Sinha K Pradeep, Distributed Operating
Systems Concepts and Design, Eastern

TITLE : OOAD with UML

CODE : CS0215
Hrs / Week : 4 Hrs

CREDITS :4

Course Objective:

Object Oriented Analysis and Design Using UML Course Description: provides instruction and
practical experience focusing on the effective use of object-oriented technologies and the
judicious use of software modeling as applied to a software development process.

Learning Outcome:

The successful completion of this course will enable the students to:
 To understand the object oriented life cycle.
 To know how to identify objects, relationships, services and attributes through UML.
 To understand the use-case diagrams.
 To know the Object Oriented Design process.

 To know about software quality and usability.

Complexity, The Object Model: 12 Hrs

Complexity: The inherent complexity of software, The Structure of complex systems, Bringing

order to chaos, on designing complex systems, Categories of analysis and Design methods.

The Object Model: The evolution of object model, Elements of object model, applying the object

model, foundations of the object model.

Classes and Objects, Classification: 12 Hrs

Classes and Objects: The nature of an object, Relationship among objects, the nature of a class,

Relationship among classes, The interplay of classes and objects, On building quality classes

and objects, invoking a method.

Classification: The importance of proper classification, Identifying classes and objects, Key

abstraction and mechanisms, A problem of classification.

Notations with OOAD: 12 Hrs

Basic Behavioral Modeling, Basic elements, class diagram, object, state Transition diagram,

Interactions, Use Case Diagrams, Activity, module and process diagrams.

Process: 12 Hrs

Principles, Micro and macro development process, Pragmatics- Management and planning,

staffing, Release management, Reuse, Quality Assurance Metrics, Documentation, Tools, The

benefits and risks and Object-oriented development

Architectural Modeling: 12 Hrs

Components, Deployment, Collaborations, Pattern and Frameworks, Component Diagram,

Deployment Diagrams, Systems and Models.

Case Study: A domain based analysis and design using using Star UML(open source).

BOOKS:
1. Grady Booch, Object-Oriented Analysis And Design With Applications, Pearson

Education, 3rd Edition, 2009.
2. Mahesh P Matha, Object Oriented Analysis and Design using UML, PHI, 3rd reprint,

2012
3. Grady Booch, James Rumbaugh and Ivar Jacobson, The Unified Modeling Languages

User Guide, Addison Wesley, 4th Edition, Reprint 2000.
4. Mike O’Docherty, Object Oriented Analysis and Design Understanding system

development with UML 2.0, John Wiley and Sons, 1st Edition

TITLE : ANDROID Application Development
CODE : CS0315

Hrs / Week : 4 Hrs
CREDITS :4

Course Objective:

The use of mobile communication and android based applications are increasing day by day. It
is therefore necessary for students to know that how mobile communication works and how to
build mobile apps for android operating system. This course covers the necessary concepts
which are required to understand mobile communication and to develop Android Applications.
Thus it is key course for computer engineers, who want to work in the area of communication.

Learning Outcome:

The theory should be taught and practical should be carried out in such a manner that students
are able to acquire different learning out comes in cognitive, psychomotor and affective domain
to demonstrate following course outcomes.

 Explain functioning of different mobile technology
 Demonstrate Android activities life cycle
 Execute operations on GUI objects
 Perform Event driven programming
 Apply various techniques on working with menu

Introduction to Mobile Computing: 15 Hrs

Concept of Mobile Communication, Different generations of wireless technology, Basics of cell,

cluster and frequency reuse concept, Noise and its effects on mobile, Understanding GSM and

CDMA, Basics of GSM architecture and services like voice call, SMS, MMS, LBS VAS, Different

modes used for Mobile Communication, Architecture of Mobile Computing(3 tier), Design

considerations for mobile computing.

OOP Concepts: 15 Hrs

Introduction to OOP Concepts – Inheritance, Exception handling, Packages & interfaces, Multi

threading (Thread class & Runnable Interface)

Introduction to Android: 15 Hrs

Overview of Android, What does Android run On – Android Internals?, Android for mobile

apps development, Environment setup for Android apps Development, Framework - Android-

SDK, Eclipse, Emulators – What is an Emulator / Android AVD?, Android Emulation –

Creation and set up, First Android Application.

Android Activities and GUI Design concepts: 15 Hrs

Design criteria for Android Application : Hardware Design Consideration, Design Demands

For Android application, Intent, Activity, Activity Lifecycle and Manifest, Creating Application

and new Activities, Simple UI -Layouts and Layout properties :Introduction to Android UI

Design, Introducing Layouts. XML Introduction to GUI objects viz.: Push Button, Text / Labels,
EditText, ToggleButton , Padding.

BOOKS:

1. Building Android Apps IN EASY STEPS McGraw-Hill Education
2. Professional Android 2 Application Development, Reto Meier Wiley India Pvt Ltd
3. Beginning Android, Mark L Murphy Wiley India Pvt Ltd
4. Pro Android, Sayed Y Hashimi and Satya Komatineni Wiley India Pvt Ltd

TITLE : Data Storage Technologies

CODE : CS0415
Hrs / Week : 4 Hrs

CREDITS: 4

Course Objective:

To introduce the concepts of Storage Area Networks, their characteristics and components and
to become familiar with the SAN vendors and their products.

Learning Outcome:

The successful completion of this course the students will have knowledge of:
 Introduction to Storage Technology
 Storage Systems Architecture
 Introduction to Networked Storage
 Introductions to Information Availability
 Securing Storage and Storage Virtualization

Introduction to Storage Technology: 12 Hrs

Data proliferation and the varying value of data with time and 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.

Storage Systems Architecture: 12 Hrs

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, Array

caching properties and algorithms, Front end connectivity and queuing properties, Front end to

host storage provisioning, mapping, and operation, Interaction of file systems with storage,

Storage system connectivity protocols.

Introduction to Networked Storage: 12 Hrs

JBOD, DAS, SAN, NAS, & CAS evolution, Direct Attached Storage (DAS) environments:

elements, connectivity, & management, Storage Area Networks (SAN): elements and

connectivity, Fiber Channel principles, standards, and network management principles, SAN

management principles, Network Attached Storage (NAS): elements, connectivity options,

connectivity protocols (NFS, CIFS, ftp), & management principles, IP SAN elements, standards

(iSCSI, FCIP, iFCP), 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.

Introductions to Information Availability: 12 Hrs

Business Continuity and Disaster Recovery Basics, Local business continuity techniques,

Remote business continuity techniques, Disaster Recovery principles and techniques Managing

& Monitoring Management philosophies (holistic vs. system & component), Industry

management standards (SNMP, SMI-S, CIM), Standard framework applications, Key

management metrics (thresholds, availability, capacity, security, performance), Metric analysis

methodologies & trend analysis, Reactive and proactive management best practices,

Provisioning & configuration change planning, Problem reporting, prioritization, and handling

techniques.

Securing Storage and Storage Virtualization: 12 Hrs

Define storage security. , List the critical security attributes for information systems, describe

the elements of a shared storage model and security extensions, Define storage security

domains, List and analyze the common threats in each domain, Identify different virtualization

technologies, describe block-level and file level virtualization technologies and processes.

BOOKS:
1. Marc Farley Osborne, “Building Storage Networks”, Tata Mcgraw Hill,2006
2. Robert Spalding, “Storage Networks: The Complete Reference“, Tata Mcgraw

Hill,2002
3. Meeta Gupta, Storage Area Network Fundamentals, Pearson Education Limited,2006
4. Gerald J Kowalski / Mark T Maybury ,Information Storage & Retrieval Systems

Theory & Implementation, , BS Publications,2006
5. Thejendra BS ,Disaster Recovery & Business Continuity -, Shroff Publishers &

Distributors,2008
6. Barb Goldworm / Anne Skamarock, Blade Servers & Virtualization, Wiley India

PRACTICALS

TITLE : MAJOR PROJECT
CODE : MCS4P1

Hrs / Week : 12 Hrs
CREDITS :6

Major Project Lab

Students will be required to pursue a project work/ Research activity / Dissertation for an
organization or any topic of their choice with the permission of the HOD. This work generally
involves collecting data, solving and implementing a problem for the organization, developing
computer programs using the knowledge acquired in the theory and laboratory courses. They
will have to submit a report of the work done by them. Finally a demonstration of the work
with the help of a presentation has to be done.