Professional Documents
Culture Documents
dbs-pg2013-14
dbs-pg2013-14
NOTE: Students have to register for the courses as per the following
guidelines:
Sl. Category Credits
No. I II Semester III IV Category
Semester Semester Semester total
1 Core courses 12 ( 3 12( 3 --- --- 24
courses) courses)
2 Program Elective 18 (in I to III semesters) --- 18
courses
Interdisciplinary elective 3 (One course to be taken in 3
courses(any one Semester I or II or III)
program elective from
other programs)
3 Supportive courses - 3 (One course to be taken in --- 3
mandatory Semester I or II or III)
4 Seminar --- --- 1 --- 1
6 Project work --- --- 06 16 22
Total 71
2
SEMESTER I & II
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.
3
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.
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.
4
INSTRUCTIONAL OBJECTIVES
1. Get the overview of different types of operating systems
2. Gain thorough knowledge of process management
3. Thorough knowledge of storage management and memory
4. Know the how operating system concepts are implemented in Linux.
5. Know the fundamentals of Linux Administration
5
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”, Published
by O’Reilly Media, Inc., March 2007.
3. Harvey M. Deitel, “Operating Systems”, Third Edition, Pearson/Prentice Hall,
2004.
4. Andrew S. Tanenbaum, “Modern Operating System”,Third Edition, Pearson
Prentice Hall, 2008.
5. William Stallings, “Operating Systems”, Prentice Hall, 2008.
6
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 NOT - Impact on SQL Constructs - Outer
Joins – PLSQL programming – cursors, procedures, functions, triggers.
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.
7
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.
DATABASE ADMINISTRATION L T P C
Total contact hours - 75 3 0 2 4
DB2002 Prerequisite
Knowledge of Database Management
Systems is preferred
PURPOSE
Database administration is the function of managing and maintaining database
management systems software. This course includes the concepts those are
used to improve the skills in managing the database and to make strong career as
Database Administrator for challenging and critical environment.
INSTRUCTIONAL OBJECTIVES
1. Understand the architecture of database
2. Install, create and maintain databases.
3. Understand the backup and recovery concepts.
4. Configure the database in real time environment
8
UNIT IV-BACKUP AND RECOVERY (10 hours)
Types of failures – Statement failure, User Process failure, Network failure, User
error, Instance failure – Background Processes and Recovery - Checkpoint, redo
log files and log writer, archiver - Recovery Manager RMAN – Incremental back
up - Flash recovery area – Incremental Merge – Resetlogs and Recovery.
REFERENCES
1. Tom Best, Maria Billings, “Oracle Database 10g: Administration Workshop
I”, Oracle Press, Edition 3.1, 2008.
2. Sam R Alapati, “Expert Oracle 10g/11g Administration”, Dreamtech Press,
First Edition, 2009.
3. Matthew Hart and Robert G.Freeman, “Oracle Db 10G Rman Backup &
Recovery”, Tata McGraw-Hill, 2006.
4. http://www.oracle.com/technetwork/tutorials/index.html
5. http://docs.oracle.com/javase/tutorial/
6. http://www.oracle.com/technetwork/database/features/availability/rman-
overview-096633.html
7. http://www.youtube.com/watch?v=PIjcMMnSpq4
8. http://www.dba-oracle.com/concepts/rman.htm
9
INSTRUCTIONAL OBJECTIVES
1. To learn the need of business analytics and business intelligence.
2. Use of business analytics in data warehousing and data mining architects.
3. To learn the need for business intelligence and to implement Business
intelligence in data mining.
4 Use of business intelligence in data warehousing and data mining architects.
5. Business intelligence in knowledge storage and retrieval.
10
UNIT V - DATA STORAGE AND RETRIEVAL (10 hours)
Querying data from data servers (SQL)- Restructuring transactional files -
Recoding alphanumeric and date variables- Date transformation into time periods-
Data Import and Transformation- Linear Regression- Regression Output-
Regression Transformation- Logistic Regression- Logistic Regression Output.
REFERENCES
1. Shmueli, Patel and Bruce, “Data Mining for Business Intelligence:
Concepts, Techniques, and Applications in Microsoft Office Excel with
XLMiner”, Wiley publication,edition 2010.
2. Daniel S. Putler, Robert E. Krider, “Customer and Business Analytics:
Applied Data mining for business decision making using R”, CRC press,
edition 2012.
3. Gert H. N. Laursen, Jesper Thorlund, “Business Analytics for Managers:
Taking Business Intelligence Beyond Reporting”, edition 2010.
4. Turban, Sharda, Delen, King, “Business Intelligence: A Managerial
Approach”, Publisher: Prentice Hall, Edition: 2nd, ISBN: 13-978-0-136-
10066-9, 2011.
5. Galit Shmueli, Nitin R. Patel and Peter C. Bruce,“Data Mining for Business
Intelligence: Concepts, Techniques, and Applications in Microsoft Office
Excel with XLMiner”, Wiley, 2007.
6. Paulraj Ponniah, “Data Warehousing Fundamentals - A comprehensive
guide for IT professionals”, John Wiley publications, 2nd edition, 2010.
7. http: // www.statsoft.com/textbook/
8. http: //www.fsb.muohio.edu / departments / isa / undergraduate / minor-
requirements / business-analytics
REFERENCES
1. Alex Berson and Stephen J. Smith, “Data Warehousing, Data Mining &
OLAP”, Tata McGraw – Hill Edition, Thirteenth Reprint, 2008.
2. Jiawei Han and Micheline Kamber, Jian Pei, “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. Soman K.P., Shyam Diwakar and V. Ajay, “Insight into Data mining Theory
and Practice”, Easter Economy Edition, Prentice Hall of India, 2006.
5. Gupta G. K., “Introduction to Data Mining with Case Studies”, Easter
Economy Edition, Prentice Hall of India, 2006.
6. Daniel T.Larose, “Data Mining Methods and Models”, Wile-Interscience,
2006.
SEMINAR L T P C
Total contact hours - 45 0 0 1 1
DB2047
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.
INSTRUCTIONAL OBJECTIVES
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.
13
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.
ASSESMENT
1 Assessment will be done according to university regulation.
L T P C
DB2049 PROJECT WORK PHASE I 0 0 12 6
(III SEMESTER)
DB2050 PROJECT WORK PHASE II 0 0 32 16
(IV SEMESTER)
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:
SUPPORTING COURSE
15
Methods and Combinations), Interpretation of clusters and validation of profiling
of the clusters.
REFERENCES
1. Joseph F.Hair, William C.Black, Barry J.Babin, Rolph E.Anderson and Ronald
L.Tatham (2006). “Multivariate Data Analysis, 6th Edition”, Pearson
Education, Inc., (Chapters 1, 3 and 8 ), 2009.
2. Spyros Makridakis, Steven C.Wheelwright and Rob J. Hyndman.
“Forecasting methods and Applications, Third Edition”, John Wiley & Sons
Inc., New York (Chapters 1, 4 and 7 ), 2005.
INTERDISCIPLINARY ELECTIVE L T P C
Total Contact Hours - 45 3 0 0 3
Students to choose one Elective course from the list of Post Graduate courses
specified under the Faculty of Engineering and Technology other than courses
under M.Tech (DBS) curriculum either in I, II or III semester
PROGRAM ELECTIVES
17
PRACTICAL : ( 30 hours)
REFERENCES
1. Noreen Burlingame and Lars Nielsen, “A Simple Introduction To Data
Science”, 2012.
2. “Understanding Big Data: Analytics for Enterprise Class Hadoop and
streaming Data”, The McGraw-Hill Companies, 2012.
REFERENCES
1. Stefano Ceri, Guiseppe Pelagatti, “Distributed Databases - Principles and
Systems”, Tata McGraw Hill, 2008.
2. Ozsu M.T./ Sridhar S., “Principles of Distributed database systems”, Pearson
education, 2011.
3. Raghu RamaKrishnan, Johnaas Gehrke, “Database Management Systems”,
Tata McGrawHill, 2000.
4. Elmasri, Navathe, “Fundamentals of Database Systems”, Addison-Wesley,
Fifth Edition 2008.
19
5. Peter Rob, Carlos Coronnel, “Database Systems- Design, Implementation
and Management”, Course Technology, 2000.
20
UNIT IV – SEMANTIC WEB SERVICE (6 hours)
Semantic web service concepts – Representation mechanisms for semantic web
services- WSMO – WSDL-S – Related work in the area of semantic web service
frameworks.
REFERENCES
1. Grigoris Antoniou and Frank Van Harmelen, “A Semantic Web Primer”, The
MIT Press, Cambridge, Massachusetts London, England, 2004.
2. www.semanticweb.org
3. Frank. P. Coyle, “XML, Web Services and the data revolution”, Pearson
Education, 2002.
4. Jorge Cardoso, “Semantic web services: Theory, tools and applications”,
Information science, 2007.
5. Michael C, Daconta, Leo J. Obrst and Kevin T. Smith, “The semantic Web: A
guide to the future of XML, web services, and knowledge management”,
John wiley & sons, 2003.
6. http://www.dcs.bbk.ac.uk/~michael/sw/sw.html
PURPOSE
Advanced database course aims at developing computer applications with
different kinds of data models. A range of features and benefits of Advanced
Database Management Systems discusses about parallel databases, object
oriented databases, web databases and emerging trends in database systems.
21
INSTRUCTIONAL OBJECTIVES
1 Study the needs of different databases.
2 Get familiarized with transaction management of the database
3 Gain knowledge about web and intelligent database.
4 Provide an introductory concept about the way in which data can be stored in
geographical information systems.
23
4 Enable the student to appreciate the role and nature of Group Decision
Support Systems and related approaches such as Cognitive Mapping as a
means of structuring and supporting complex unstructured decision
problems with high levels of uncertainty
REFERENCES
1. Efraim Turban, Jay E. Aronson, Ting-Peng Liang, “Decision Support Systems
& Intelligent Systems”, 9th edition, Prentice Hall, 2010.
24
2. George M Marakas, “Decision support Systems”, 2nd Edition, Pearson /
Prentice Hall,2002.
3. Janakiraman V.S., Sarukesi K., “Decision Support Systems”, PHI,
ISBN8120314441, 9788120314443, 2004.
4. Efrem G Mallach, “Decision Support systems and Data warehouse
Systems”, 1st Edition, Tata McGraw Hill 2000.
DATABASE SECURITY L T P C
Total contact hours – 45 3 0 0 3
Prerequisite
DB2106
Knowledge of Database Management
Systems, Database Administration are
preferred.
PURPOSE
This course is about database security, with many methods and techniques that
will be helpful in securing, monitoring and auditing database environments. It
covers diverse topics that include all aspects of database security and auditing -
including network security for databases, authentication and authorization issues,
links and replication, database Trojans, etc. It also includes vulnerabilities and
attacks that exist within various database environments or that have been used to
attack databases.
INSTRUCTIONAL OBJECTIVES
1. Describe and apply security policies on Databases
2. Understand authentication and password security
3. Know about application vulnerabilities
4 Understand about auditing techniques
25
- Database/Application Security - Limitations of SQL Authorization - Access
Control in Application Layer - Oracle Virtual Private Database – Privacy.
REFERENCES
1. Ron Ben-Natan, “Implementing Database Security and Auditing: A Guide for
DBAs, Information Security Administrators and Auditors”, Published by
Elsevier, 2005.
2. Silvana Castano, “Database Security” , Published by Addison-Wesley, 1994.
3. Alfred Basta, Melissa Zgola, Dana Bullaboy, Thomas L. Witlock SR,
“Database Security”, google books, 2011.
4. Silberschatz, Korth and Sudarshan, “Database System Concepts”, 6th
Edition, 2010.
5. The Open Web Application Security Project, http://www.owasp.org
6. Web application security scanners, http: // www. Window security . com /
software/Web-Application-Security/
7. SQL Injection, http://www.cgisecurity.com/development/sql.shtml
8. 9 ways to hack a web app, http : / / developers. sun. com / learning / javaone
online/2005/webtier/TS-5935.pdf
9. Database security, http : / / docs . oracle . com / cd / B19306_01 /
server.102 / b14220/security.htm
26
KNOWLEDGE MANAGEMENT L T P C
Total contact hours -60 2 0 2 3
DB2107
Prerequisite
Nil
PURPOSE
Knowledge management is a topic of key interest among businesses which
compete with each other to survive in the market. In order to make the students
manage knowledge in the data driven world, this course is designed to provide an
overview of knowledge representation, management, and tools available for the
same.
INSTRUCTIONAL OBJECTIVES
1. Design and develop knowledge-based information systems for knowledge
representation, management, and discovery
2. Understand various knowledge management tools
3. Discuss about relevant case studies to understand how knowledge
management is applied in real time scenario
27
UNIT IV-KNOWLEDGEMANAGEMENT-APPLICATION (6 hours)
Components of a Knowledge Strategy - Case Studies (From Library to Knowledge
Center, Knowledge Management in the Health Sciences, Knowledge Management
in Developing Countries).
REFERENCES
1. Srikantaiah, T.K., Koenig, M., “Knowledge Management for the Information
Professional”, Information Today, Inc., 2000.
2. Nonaka, I., Takeuchi, H., “The Knowledge-Creating Company: How Japanese
Companies Create the Dynamics of Innovation”, Oxford University Press,
1995.
28
UNIT I -INTRODUCTION (6 hours)
Need for backup and recovery – common backup and recovery terminology –
components of client/server backup server architecture – flow of data in
client/server backup and restore operations.
REFERENCES
1. “Backup Recovery Systems and Architecture Student Guide”, EMC
Education Services, 2013.
2. Wei-Dong Zhu; Gary Allenbach; Ross Battaglia; Julie Boudreaux; David
Harnick-Shapiro; Heajin Kim; Bob Kreuch; Tim Morgan; Sandip Patel; Martin
Willingham, “Disaster Recovery and Backup Solutions for IBM FileNet P8
Version 4.5.1 Systems”, IBM Redbooks, 2010.
3. Techbook: “Backup and Recovery in a SAN” EMC Education Services, 2011-
2013.
29
TEXT MINING L T P C
Total contact hours – 45 3 0 0 3
DB2109 Prerequisite
Knowledge in C++ / Perl / Python, Data
structures and Algorithms are preferred
PURPOSE
Text mining is the analysis of data contained in natural language text. The
application of text mining techniques is used to solve business problems .Text
mining can help an organization derive potentially valuable business insights from
text-based content such as word documents, email and postings on social media
streams like Facebook, Twitter and LinkedIn.This course covers the techniques for
interpreting and retrieving required information from large volumes of unstructured
texts.
INSTRUCTIONAL OBJECTIVES
1. Learn the concepts of Machine Learning
2. Know the concepts of Information Extraction
3. Understand the concepts of Information Retrieval
4. Practice and understand the concepts of Classification and Clustering
30
UNIT IV-ALGORITHMIC TECHNIQUES (9 hours)
Probabilistic models - Aspect Models, Polysemy, Topic Proportion , Probabilistic
Latent, Semantic Analysis, Expectation Maximization Algorithm, Latent Dirichlet
Allocation, Gibbs Sampling, Model Evaluation. Implementation - Clustering
Terms, Document Classification, Polysemy Keyword Retrieval.
REFERENCES
1. Charles.T.Meadow, Bert R Boyce, Donald H Karft, “Text information Retrievel
System”, 3rd Edition, 2007.
2. David Grossman, OphirFrieder, “Information Retrieval – Algorithms and
Heuristics”, Springer, 2004.
3. Stefan Buttcher,Charles LA Clarke,Dordon. V.Cormack, “Information
Retrieval, Implementing and evaluating Search Engine”, 2010.
4. TanveerSiddiqui, Tiwari, “Natural Language Processing and Information
Retrieval”, Oxford University Press, 2008 .
5. Gerald Kowalski, Mary Maybury, “Information Storage and Retrieval
Systems”, Springer, 2006.
31
INSTRUCTIONAL OBJECTIVES
1 Understand the phases in a software project and activities in project
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
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”, 3rd
Edition, ISBN-10: 0321197704 | ISBN-13: 978-0321197702,2003.
32
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”, | ISBN-
10: 0077109082 | ISBN-13: 978-0077109080 | 2nd Edition, 2004.
33
representation and generated R.Java file ,Android manifest file. Creating a simple
application.
REFERENCES
1. Wei-Meng Lee, “Beginning Android 4 Application Development” Wrox
Publications, 2012.
2. Paul Deital and Harvey Deital,”Android How to Program”, Detial associates
publishers, 2013.
34
3. Zigurd Mednieks, Laird Dornin, G. Blake Meike, Masumi Nakamura,
“Programming Android Java Programming for the New Generation of Mobile
Devices”, O'Reilly Media, July 2011.
4. http://developer.android.com
35
UNIT IV - GRAPH PLAN AND ADVANCED HEURISTICS (9 hours)
Planning Graphs-The GraphPlan Planner-Constraint Satisfaction Techniques-
Heuristics in Planning
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, December 11, ISBN-10: 0136042597, ISBN-13: 978-0136042594,
2009.
36
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.
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.
37
CLOUD COMPUTING L T P C
Total contact hours – 60 2 0 2 3
IT2111 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.
INSTRUCTIONAL OBJECTIVES
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
38
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
Cloud based data storage- Cloud based backup devices- Cloud based database
solutions- Cloud based block storage.
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.
REFERENCES
1. Chris Hay, Brian Prince, “Azure in Action” [ISBN: 978-1935182481],
Microsoft, 2010.
2. Henry Li, “Introducing Windows Azure”, [ISBN: 978-1-4302-2469-3]
Apress, 2009
40
3. Eugenio Pace, Dominic Betts, Scott Densmore, Ryan Dunn, Masashi
Narumoto, MatiasWoloski, “Developing Applications for the Cloud on the
Microsoft Windows Azure Platform”, [ISBN: 9780735656062], Microsoft
Press; 1 edition, 2010.
4. Eugene Ciurana, “Developing with Google App Engine” [ISBN: 978-
1430218319], Apress, 2011.
5. Charles Severance, “Using Google App Engine” [ISBN: 978-0596800697],
O'Reilly Media; 1 edition, 2009).
6. George Reese, “Cloud application architectures”, O'Reilly Sebastopol, CA
[ISBN: 978-0596156367], 2009.
7. Dan Sanderson, “Programming Google App Engine”, [ISBN: 978-
0596522728], O'Reilly Media; 1 edition, 2009.
8. Paul J. Deitel, Harvey M. Deitel, “Ajax, rich Internet applications, and web
development for programmers”, Prentice Hall Upper Saddle River, NJ [ISBN:
978-0-13-158738-0], 2008.
41
AMENDMENTS
42