Program – Master of Computer Application

Program Educational Objectives (PEOs)

 PEO 01: Technical Expertise: Develop the ability to plan, analyze, design, code, imple-
ment, test and maintain the software product for real time systems that are technically
sound, economically feasible and socially acceptable
 PEO 02: Successful Career: Exhibit professionalism, ethical attitude with updated tech-
nologies in Computer Application based career and capability to set up their own enter-
prise in various sectors of Computer Applications
 PEO 03: Soft Skills: Develop communication skills, team work and leadership quality in
their professional multidisciplinary projects and adapt to current trends by engaging in
lifelong learning.
 PEO 04: Life Long Learning: Prepare the students to pursue higher studies by acquiring
knowledge in mathematical, computing and engineering principles in the field of comput-
ing and related fields and to work in the fields of teaching and research

Program Outcomes
 PO1 Foundation Knowledge: Apply knowledge of mathematics, programming logic
and coding fundamentals for solution architecture and problem solving.
 PO2 Problem Analysis: Identify, review, formulate and analyze problems for primarily
focusing on customer requirements using critical thinking frameworks.
 PO3 Development of Solutions: Design, develop and investigate problems with as an
innovative approach for solutions incorporating ESG/SDG goals.
 PO4 Modern Tool Usage: Select, adapt and apply modern computational tools such as
development of algorithms with an understanding of the limitations including human
biases.

1
 PO5 Individual and Teamwork: Function and communicate effectively as an individual
or a team leader in diverse and multidisciplinary groups. Use methodologies such as
agile.
 PO6 Project Management and Finance: Use the principles of project management such
as scheduling, work breakdown structure and be conversant with the principles of
Finance for profitable project management.
 PO7 Ethics: Commit to professional ethics in managing software projects with financial
aspects. Learn to use new technologies for cyber security and insulate customers from
malware 8.
PO8 Life-long learning: Change management skills and the ability to learn, keep up
with contemporary technologies and ways of working

Program Specific Outcomes

PSO1: Apply computational thinking, emerging technologies, programming languages, math-

ematical foundations, and algorithmic principles to design and develop effective soft-
ware solutions for real-world problems using modern and open-source platforms

PSO2: Analyze and adapt to evolving trends in computing by leveraging standard practices
and interdisciplinary research to deliver innovative and sustainable IT solutions

PSO3: Create a foundation for entrepreneurial ventures and advanced studies through skilled
use of modern computing platforms, programming tools, and development environ-
ments in Computer Applications.

2
 SEMESTER I (Common for All)

MCA I SEMESTER

Teaching Scheme
Course Course
Course Name
Code Type Total Credi
L* T* P*
Hrs t

PGMAT1010
PCC Discrete Mathematics 4 0 0 4 4
N
and Graph Theory

PGCSA101 PCC
Fundamentals of Com- 3 0 2 5 4
puter and Programming
in C
PGCSA102 PCC Operating Systems 3 0 0 3 3

Database Management
PGCSA103 PCC 3 0 2 5 4
Systems

PGCSA104 PCC Software Engineering 3 0 0 3 3

and Project Management
Virtualization and
PGCSA105 PCC 3 0 0 3 3
Cloud Technology

PGCSA106N PCC Web Technologies 3 0 2 5 5

TOTAL 22 0 6 28 25

L*- Lecture
T*-Tutorial
P*- Practical

3
 PGMAT1010N: DISCRETE MATHEMATICS & GRAPHY THEORY
4L + 0T + 0P= 4C

COURSE OVERVIEW AND OBJECTIVES:

This course introduces the fundamental concepts of discrete mathematics with a strong emphasis on
logical reasoning, set theory, lattice theory, Boolean algebra, and graph theory. It builds a foundation
for the mathematical reasoning required in computer science and its applications in areas like logic
circuits, data structures, and algorithm design.

COURSE OUTCOME:

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

CO1. Apply propositional and predicate logic for formal reasoning and proofs.
CO2. Use lattice theory and Boolean algebra for logical operations.
CO3. Understand and implement key concepts in graph theory, including trees and connectivity.
CO4. Analyze graphs using matrix representations and graph algorithms.
CO5. Explore properties of planar graphs and graph isomorphism for structural analysis.

OUTLINE OF THE COURSE:

Unit No. Title of the unit Time required for the Unit
(Hours)

1. Logic and Predicate Calculus 8

2. Lattices and Boolean Algebra 10

3. Graph Theory Fundamentals 10

4. Matrix Representations and Graph 8

Algorithms

5. Planar Graphs and Advanced Topics 8

4
DETAILED SYLLABUS:

Module 1: Logic and Predicate Calculus

Propositions, Logical Operators, Expressions, Truth Tables, Predicates, Rules of Quantifiers, Rules of
Inference for Propositions and Predicates, Valid Arguments, Logical Equivalences.

Module 2: Lattices and Boolean Algebra

Relations, Equivalence relation, Posets, Hasse Diagram, Lattices as Posets, Properties of Lattices,
Lattices as Algebraic Systems, Duality. Boolean Algebra: Definitions and Properties, Application of
Lattices and Boolean algebra.

Module 3: Graph Theory Fundamentals

Definition of Graphs, Degree, Incidence, Walks, Paths, Circuits, Connected Graphs, Eulerian and
Hamiltonian Graphs. Trees: Properties, Binary Trees, Spanning Trees, Minimal Spanning Trees.

Module 4: Matrix Representations and Graph Algorithms

Adjacency and Incidence Matrices, Connectivity and Separability, Fundamental Circuits and Cut
Sets, Graph Isomorphism (1-Isomorphism and 2-Isomorphism), Dijkstra's Algorithm, Prim’s and
Kruskal’s Algorithms.

Module 5: Planar Graphs and Advanced Topics

Planarity of Graphs, Stereographic Projections, Graph Embedding, Kuratowski’s Graphs, Euler’s

Formula, Detection of Planarity, Elementary Reduction Techniques.

TEXTBOOKS:

1. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, McGraw-Hill, 7th Edition.
2. C. L. Liu, “Elements of Discrete Mathematics”, 2nd edition, Tata McGraw Hill Pub-
lication.

REFERENCE BOOKS:

1. Seymour Lipschutz, “Discrete Mathematics”, Schaum’s Outline Series.

5
2. G. Shankar Rao, “Discrete Mathematical Structure”, New Age Publisher
3. Narsingh Deo, “Graph Theory with Applications to Engineering and Computer Science”, PHI.

CO-PO MAPPING:

COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 3 3 2 3 1 - - 3

CO2 3 3 2 3 1 2 - 2

CO3 2 2 3 2 2 - - 3

CO4 3 3 3 3 3 1 1 3

CO5 3 2 3 2 2 1 2 3

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO1 3 2 2

CO2 2 2 1

CO3 2 2 3

CO4 3 3 3

CO5 2 3 2

6
 PGCSA101: FUNDAMENTALS OF COMPUTER AND PROGRAMMING IN C
3L + 0T + 2P= 4C

COURSE OVERVIEW AND OBJECTIVES:

This course aims to provide students with a comprehensive understanding of the C programming
language. It includes setting up the environment to run C programs, understanding data types and
looping techniques, implementing functions and arrays, and developing logical solutions to
problems using C. The course is designed to enhance problem-solving skills and prepare students
for real-world programming tasks.

COURSE OUTCOME:

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

CO1. Understand the fundamentals of computers, different types of hardware and software, and
basic Windows features.
CO2. Apply C programming concepts, including data structures, operators, control statements,
and looping constructs to solve problems.
CO3. Apply array and string concepts, including declaration, initialization, sorting, and string
manipulation using built-in functions.
CO4. Apply modular programming concepts to define, declare, and call functions, using them
with decision statements, loops, and arrays.
CO5. Understand the concepts of structures, unions, storage classes, and file I/O, and effectively
utilize command-line arguments in C programming.

OUTLINE OF THE COURSE:

Unit No. Title of the unit Time required for the Unit (Hours)

1. Introduction to Computer 8

2. C Fundamentals and 8

7
 3. Arrays 8

4. Functions 8

5. Structures 8

DETAILED SYLLABUS:

Module 1: Introduction to Computers

Characteristics and limitations of computers, Block diagram of computers, Types of computers,

Uses of computers, Computer generations, Input and output devices: Keyboard and mouse,
inputting data in other ways, Types of Software: system software, Application software,
commercial, open source, domain and freeware software, Memories: primary, secondary, and
cache memory, Windows basics: desktop, start menu, icons.

Module 2: C Fundamentals

C structure, Simple I/O operations, Operators and Expressions: Operator precedence and
associativity, bitwise operators, arithmetic expressions, evaluation of expressions, Control
Statements: Statements and blocks, switch–case statement, looping constructs, Decision Control
Instructions: if, if-else, if-else-if, nested if-else, Loop Control Instructions: For Loop, While
Loop, Do While.

Module 3: Arrays

Arrays: Declaration, Initialization, sorting, Strings: String operations, built-in string handling
functions, programs on strings.

Module 4: Functions

Modular programming, function declaration, definition and function call, Types of functions,
function returning more values, function with operators, function and Decision Statements,
function and loop operators, function with Arrays.

8
Module 5: Structures

Declaring and Accessing Structures, variables, Uses of Structures, Unions, Storage Classes and
Scoping: Automatic, Register, External, Static, Scope of a Variable, File Input/Output:
Command-line arguments.

TEXTBOOKS:

1. E. Balaguruswamy, “Computing Fundamentals & C Programming”, TataMcGraw Hill,

2008.

REFERENCE BOOKS:

1. B. A. Forouzan& R. F. Gilberg “Computer Science – A structured programming Approach

Using C”, 2011
2. E. Balaguruswamy, “Programming in ANSI” Tata McGraw Hill, 2011.

LAB EXERCISES:

1. Setting up the environment to run C programs.

2. Writing basic C programs to understand input and output operations.
3. Implementing arithmetic operations using different operators in C.
4. Writing programs using branching control statements (if, if-else).
5. Writing programs using looping control statements (for, while, do-while).
6. Declaring and initializing arrays and performing basic operations.
7. Implementing string operations using built-in string handling functions.
8. Writing modular programs using functions.
9. Implementing recursive functions in C.
10. Declaring and accessing structures and unions, understanding scope and storage classes.

9
CO-PO MAPPING:

COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 3 2 2 2 – – – 2

CO2 3 3 3 3 1 – – 2

CO3 3 2 3 3 1 – – 2

CO4 3 3 3 3 2 – – 2

CO5 3 3 3 2 2 2 – 2

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO1 1 2 -

CO2 1 1 2

CO3 2 1 1

CO4 1 1 1

CO5 1 1 2

10
 PGCSA102: OPERATING SYSTEMS
3L+0T+0P=3C

COURSE OVERVIEW AND OBJECTIVES:

The course aims to provide students with a comprehensive understanding of operating systems,
their components, and functionalities. It covers fundamental concepts such as process
management, memory management, inter-process communication, and information management.
The objective is to equip students with the knowledge and skills required to manage and
administer various types of operating systems, including their role in resource management and
virtual machine operations. By the end of the course, students will be able to analyze and apply
different OS concepts to solve real-world problems efficiently.

COURSE OUTCOME:

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

CO1. Understand the basic concepts of operating systems, differentiate OS types, and analyze
their structures, services, and system calls.
CO2. Apply process and thread management concepts, analyze scheduling algorithms, and solve
problems related to synchronization and deadlock.
CO3. Understand memory management techniques, including paging, segmentation, and virtual
memory, and apply algorithms for memory allocation and page replacement.
CO4. Understand inter-process communication methods, including message queues, sema-
phores, and shared memory, and apply them to solve IPC-related problems.
CO5. Analyze file and directory management, disk scheduling methods, and device manage-
ment concepts, and apply techniques for optimizing resource usage.

11
OUTLINE OF THE COURSE:

Unit No. Title of the unit Time required for the Unit (Hours)

1. OS concepts 8

2. Process management 8

3. Memory management 8

4. Inter process communication 8

5. Information management 8

DETAILED SYLLABUS:

Module 1: OS Concepts

Introduction, Evolution of OS, OS Structures: Kernel, Shell, General Structure of MSDOS,

Windows 2000, Introduction and need of operating system, layered architecture/logical structure
of Operating system, Type of OS, operating system as resource manager and virtual machine, OS
services, BIOS, System Calls/Monitor Calls, Firmware: BIOS, Boot Strap Loader.

Module 2: Process Management

Process & Threads, Process States, Process Control Block, Process Scheduling, Operations on
Processes, Threads, CPU Scheduler: Preemptive and Non-Preemptive, Dispatcher, Scheduling
Criteria, Concurrent Processes, Co-operating Processes, Precedence Graph, Hierarchy of
Processes, Critical Section Problem, two process solution, Synchronization Hardware,
Semaphores, Deadlock: detection, handling, prevention, avoidance, recovery, Starvation, Critical
Regions, Monitors, Inter-process communication.

Module 3: Memory Management

12
Objectives and functions, Simple Resident Monitor Program (No design), Overlays, Swapping;

Schemes, Paging, Simple, Multi-level Paging; Internal and External Fragmentation; Virtual
Memory Concept, Demand Paging, Page Interrupt Fault, Page Replacement Algorithms;
Segmentation: Simple, Multi-level, Segmentation with Paging, Cache Memory.

Module 4: Inter Process Communication

Virtual Memory: Concept, virtual address space, paging scheme, pure segmentation and
segmentation with paging scheme, hardware support and implementation details, memory
fragmentation, Overview of IPC Methods, Pipes, popen, pclose Functions, Coprocessors, FIFOs,
System V IPC, Message Queues, Semaphores, Interprocess Communication, Shared Memory,
Client-Server Properties, Stream Pipes, Passing File Descriptors, An Open Server-Version 1,
Client-Server Connection Functions.

Module 5: Information Management

Files and Directories, Directory Structure, Directory Implementation: Linear List, Hash Table.
Device Management: Dedicated, Shared and Virtual Devices, Serial Access Devices, Direct
Access Devices, Direct Access Storage Devices, Channels and Control Modules, Disk
Scheduling methods.

TEXTBOOKS:

1. Operating Systems Concepts – Silberschatz, Galvin, Wiley Publications (2008)

2. Modern Operating Systems - Andrew S. Tenenbaum, Pearson Education Asia / PHI (2005)
3. Operating Systems – William Stallings, Pearson Education Asia (2002)

REFERENCE BOOKS:

1. H UNIX System Programming Using C++, by Terrence Chan: Prentice Hall India,1999.
2. Advanced Programming in UNIX Environment, by W. Richard Stevens: 2nd Ed, Pearson Ed-
ucation,2005.

13
CO-PO MAPPING:

COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 1 2 - - 1 - - 1

CO2 1 1 1 1 2 - - 1

CO3 1 2 1 3 1 - - -

CO4 3 2 1 2 1 - - -

CO5 1 1 1 1 3 2 - -

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO-1 1 2 -

CO-2 1 1 2

CO-3 1 1 1

CO-4 - 1 2

CO-5 1 1 2

14
 PGCSA103: DATABASE MANAGEMENT SYSTEMS
3L + 0T + 2P= 4C

COURSE OVERVIEW AND OBJECTIVES:

This course provides a comprehensive understanding of database management systems, focusing

on data storage, organization, and retrieval. Students will learn about the fundamental elements
of databases, including relational models, database design. The course aims to equip students
with practical skills in database management and the ability to implement efficient database
solutions.

COURSE OUTCOME:

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

CO1. Understand the basic concepts of database systems, data models, transaction management,
and the entity-relationship model, and analyze their applications in DBMS architecture.
CO2. Apply relational database concepts, including relational algebra, SQL, and query han-
dling, to design and manage databases using security and connectivity features.
CO3. Evaluate and apply normalization techniques, functional dependencies, and object-rela-
tional concepts in database design and file structures.
CO4. Analyze internet databases, XML data structures, client-server interactions, and web
scripting for database applications.
CO5. Analyze advanced concepts in transaction management, concurrency control, data analy-
sis.

OUTLINE OF THE COURSE:

Unit No. Title of the unit Time required for the Unit
(Hours)

1. Introduction 8

2. Relational model 8

3. Relational database design 8

15
 4. Internet databases 8

5. Advanced topics 8

DETAILED SYLLABUS:

Module 1: Introduction

Database Systems versus File Systems, View of Data, Data Models, database languages,
Database Users and Administrators, Transaction Management, Decision Support Systems,
Components of a Database Management System, Distributed Processing and Client-Server
Architecture, Entity-Relationship Model–Basic Concepts, Constraints, Keys, Design Issues, E-R
Diagrams.

Module 2: Relational Model

Structures of relational databases, Integrity Constraints, Logical database Design, Tables, Views,
and Data Dictionary, Relational Algebra, Relational Calculus, SQL–Basic Structures, Query
Handling, Embedded SQL, Open Database Connectivity (ODBC), Java Database Connectivity
(JDBC), Triggers, Security and Authorization, Query By Example (QBE), User Interfaces and
Tools, Forms and Graphical User Interfaces, Report Generators.

Module 3: Relational Database Design

Functional Dependencies, Multi-valued Dependencies, Normal Forms, Decomposition into

Normalized Relations, Physical Database Design–File Structures, Object-Relational Databases–
Nested Relations, Complex Data types, Object-Relational Features in SQL:1999.

Module 4: Internet Databases

World Wide Web, Client-Side Scripting and Applets, Web Servers and Sessions, Services,
Server-Side Scripting, XML–Structure of XML Data, XML Document Schema, XQuery, Storage
of XML Data, XML Applications.

16
Module 5: Advanced Topics

Fundamental Concepts of Transaction Management, Concurrency Control, Recovery Systems,

Data Analysis and OLAP, Introduction to Data Mining, Data Farming, Data Warehousing,
Spatial and Geographic Databases, Temporal databases and Multimedia Databases.

TEXTBOOKS:

1. Date C J, “ An Introduction to Database Systems”, Addision Wesley

2. Korth, Sibert, Sudarshan,” Database Concepts”, McGraw-Hill
3. Elmasri, Navathe, “Fudamentals of Database Systems”, Addision Wesley

REFERENCE BOOKS:

1. Leon & Leon,” Database Management Systems”, Vikas Publishing House

2. Bipin C. Desai, “An Introduction to Database Systems”, Gagotia Publications
3. Majumdar& Bhattacharya, “Database Management System”, TMH

LAB EXERCISES:

1. Write a C++ program to store student records (roll no, name, father name) of a class using
file handling (Using C++ and File handling).
2. Rewrite program 1, using any DBMS and any compatible language (C++/MySQL).
3. Write a program to take a string as input from the user. Create a database of the same name.
Now ask the user to input two more strings, create two tables of these names in the above
database.
4. Write a program, which asks the user to enter the database name and table name to delete. If
the database exists and the table exists, then delete that table.
5. Write a program, which asks the user to enter a valid SQL query and displays the result.
6. Write a program in C++ to parse the user-entered query and check the validity of the query
(Only SELECT query with WHERE clause).
7. Create a database db1, having two tables t1 (id, name, age) and t2 (id, subject, marks). Write
a query to display the name and age of a given id (id should be asked as input).

17
8. Write a query to display the average age of all students.
9. Write a query to display the mark-sheet of any student (whose id is given as input).
10. Display a list of all students sorted by the total marks in all subjects.

CO-PO MAPPING:

COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 3 2 2 2 – – – 1

CO2 3 3 3 3 1 – – 1

CO3 3 3 3 3 1 – – 1

CO4 3 3 3 3 2 – – 2

CO5 3 3 3 2 2 2 – 2

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO1 1 2 -

CO2 1 1 2

CO3 1 1 1

CO4 1 - 2

CO5 1 1 2

18
 PGCSA104: SOFTWARE ENGINEERING AND PROJECT MANAGEMENT

3L+0T+0P=3C

COURSE OVERVIEW AND OBJECTIVES:

This course provides a comprehensive understanding of software engineering principles,

focusing on the design, testing, and implementation of software systems. Students will learn
about various software development life cycles, requirement analysis models, system design
methodologies, and software testing strategies. Additionally, the course covers project planning,
scheduling, and quality assurance to prepare students for managing software projects effectively.

COURSE OUTCOME:

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

CO1. Understand software engineering concepts, development life-cycle models, and apply en-
gineering principles to structured software development.
CO2. Analyze and apply requirements elicitation, analysis, modeling, specification, and valida-
tion techniques for software systems.
CO3. Apply design principles, structured approaches, and abstraction techniques to create func-
tional and object-oriented software designs.
CO4. Understanding software testing strategies, perform validation, verification, and manage
software maintenance and configuration activities.
CO5. Understanding project planning, cost estimation, risk management, and quality assurance
techniques for successful software project management.

OUTLINE OF THE COURSE:

Unit No. Title of the unit Time required for the Unit
(Hours)

1. Introduction to Software Engineering 8

19
 2. Software requirement specification 8

3. System design 8

4. Testing 8

5. Software project management 8

DETAILED SYLLABUS:

Module 1: Introduction to Software Engineering

Introduction to Software Engineering, Software characteristics, Software components, Software

applications, Software Engineering principles, Software metrics and measurement, monitoring
and control, Software development life-cycle, Waterfall model, Prototyping model, Incremental
model, Iterative enhancement model, Spiral model.

Module 2: Software Requirement Specification

Requirements elicitation techniques, Requirements analysis, Models for requirements analysis,

Requirements specification, Requirements validation.

Module 3: System Design

Design principles: Problem partitioning, Abstraction, Top-down and bottom-up design,

Structured approach, Functional versus object-oriented approach of design, Design specification,
Cohesiveness and coupling, Overview of SA/SD methodology, Structured analysis, Data flow
diagrams, Extending DFD to structure charts.

Module 4: Testing

Verification and validation, Code inspection, Test plan, Test case specification, Levels of testing:
Module, Integration testing, Top-down and bottom-up integration testing, Alpha and beta testing,
System testing and debugging, Functional testing, Structural testing, Software testing strategies,
Software maintenance: Structured vs. unstructured maintenance, Maintenance models,
Configuration management, Reverse engineering, Software re-engineering.

20
Module 5: Software Project Management

Project planning and project scheduling, Software metrics: Size metrics like LOC, Token count,
and function count, Cost estimation using models like COCOMO, Risk management activities,
Software reliability and quality assurance: Reliability issues, Reliability metrics, Reliability
models, Software quality, ISO 9000 certification for software industry, SEI capability maturity
model.

TEXTBOOKS:

1. R.S. Pressman, Software Engineering: A Practitioner’s Approach, McGraw-Hill, Ed 7, 2010.

2. P. Jalote, An Integrated Approach to Software Engineering, Narosa Publishing House, Edi-
tion 3, 2011.
3. R. Mall, Fundamentals of Software Engineering, Prentice-Hall of India, 3rd Edition,2009.

REFERENCE BOOKS:

1. Sommerville, Software engineering (9th edition), Addison Wesley, 2010

CO-PO MAPPING:

COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 3 2 2 2 1 – – 1

CO2 3 3 3 2 1 – – 1

CO3 3 3 3 3 2 – – 1

21
 CO4 3 3 3 3 2 1 1 1

CO5 3 3 3 2 2 3 2 2

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO1 1 2 -

CO2 1 1 2

CO3 2 1 1

CO4 1 1 2

CO5 1 1 2

22
 PGCSA105: VIRTUALIZATION AND CLOUD TECHNOLOGY
3L+0T+0P=3C

COURSE OVERVIEW AND OBJECTIVES:

This course aims to provide a comprehensive understanding of cloud computing concepts and
architecture. Students will learn about the various deployment and service models of cloud computing,
analyze the architectural requirements, and understand the security issues and solutions related to cloud
computing. The course also covers the role of virtualization in enhancing the performance and capacity of
cloud services.

COURSE OUTCOME:

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

CO1. Understand the fundamentals of cloud computing, its benefits, drawbacks, service models, and
deployment models

CO2. Analyze cloud architecture, infrastructure requirements, service-centric issues, and interoperability
standards.

CO3. Understand cloud scalability, fault tolerance, virtualization, and load balancing techniques for
enterprise deployment.

23
CO4. Understand cloud security management practices, access control, privacy protection, and
availability management for different service models.

CO5. Understand virtualization technologies to enhance cloud availability, storage, and system
performance.

OUTLINE OF THE COURSE:

Unit No. Title of the unit Time required for the Unit
(Hours)

1. Understanding cloud computing 8

2. Cloud computing technology 8

3. Fault Tolerance 8

4. Security Management in Cloud 8

5. Virtualization 8

DETAILED SYLLABUS:

Module 1: Understanding Cloud Computing

Introduction to Cloud Computing, Benefits and Drawbacks, Types of Cloud Service Development,
Deployment models.

Module 2: Cloud Architecture Technology and Architectural Requirements

The Business Case for Clouds, Hardware and Infrastructure, Accessing the Cloud, Cloud Storage,
Standards, Software as a Service, Discovering Cloud Services Development Tools, Three Layered
Architectural Requirement, Provider Requirements, Service Centric Issues, Interoperability, QoS.

Module 3: Fault Tolerance

Fault Tolerance, Data Management Storage and Processing, Virtualization Management, Scalability, Load
Balancing, Cloud Deployment for Enterprises, User Requirement, Comparative Analysis of Requirement.

Module 4: Security Management in Cloud

24
Security Management Standards, Security Management in the Cloud, Availability Management, SaaS
Availability Management, PaaS Availability Management, IaaS Availability Management, Access Control,
Security Vulnerability, Patch, and Configuration Management, Privacy in Cloud, The Key Privacy
Concerns in the Cloud, Security in Cloud Computing.

Module 5: Virtualization

Objectives, Benefits, Virtualization Technologies, Data Storage Virtualization, Storage Virtualization,

Improving Availability using Virtualization, Improving Performance using Virtualization.

TEXTBOOKS:

1. Virtualization: A Manager's Guide by Dan Kusnetzky

2. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl, Ricardo Puttini, and
Zaigham Mahmood

REFERENCE BOOKS:

1. David S Linthicum, “Cloud Computing and SOA Convergence in your Enterprise A Step-by-Step
Guide,” Addison Wesley Information Technology Series.
2. Anthony T Velte, Toby J.Velte, Robert Elsenpeter, “Cloud Computing: A Practical Approach,” Tata
McGraw Hill Publication.
3. Tim Mather, Subra Kumaraswamy, Shahed Latif, “Cloud Security and Privacy: An Enterprise Per-
spective on Risks and Compliance,” O’Reilly Publications, First Edition.
4. Michael Miller, “Cloud Computing – Web-Based Applications that Change the Way You Work and
Collaborate Online,” Pearson Education, New Delhi, 2009.
5. Cloud Computing Specialist Certification Kit – Virtualization Study Guide.

CO-PO MAPPING:

COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 3 2 2 2 1 – – 1

CO2 3 3 3 2 1 – – 1

CO3 3 3 3 3 2 – – 1

25
 CO4 3 3 3 3 2 1 – 1

CO5 3 3 3 2 2 3 – 2

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO1 1 - -

CO2 1 1 2

CO3 2 1 1

CO4 1 1 2

CO5 1 1 2

PGCSA106N: WEB TECHNOLOGIES

3L + 0T + 2P= 4C

COURSE OVERVIEW AND OBJECTIVES:

This course will introduce students to web technologies such as HTML, CSS, XML,
Java Script to create static and simple dynamic web pages or applications using
these technologies and to understand web application deployment and software
architectures

COURSE OUTCOME:

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

26
CO1: Describe Internet history, protocols, web architecture, and differentiate front-end and back-end
technologies.
CO2: Design structured static web pages using HTML elements like forms, tables, images, and
multimedia.
CO3: Apply CSS styling and layout techniques to enhance visual design and structure of web pages.
CO4: Develop dynamic and interactive web pages using JavaScript, functions, DOM, and control
structures.
CO5: Implement HTML5 and CSS3 features and use authoring tools for website development and
hosting.

OUTLINE OF THE COURSE:

Unit Title of the unit Time required for the Unit

No. (Hours)

1. Introduction to the Internet and the World Wide Web 8

2. Developing Web pages using HTML 8

3. Cascading Style sheet CSS 8

4. Working with Java Script 8

5. Practical Web Development using Advanced 8

techniques and tools

DETAILED SYLLABUS:

Module 1: Introduction to the Internet and WWW

Introduction, History of internet, Internet Design Principles, Internet Protocols - FTP, TCP/IP,
SMTP, Telnet, HTTP etc., Client Server Communication, Web System architecture. Web clients
and Web servers, Static and Dynamic Web Applications, Idea of front end and back-end web

27
development. Introduction to HTML, CSS, JS, and XML. Five Golden rules of web designing.
Organizing Home page and other web pages.

Module 2: Developing Web pages using HTML

Introduction to HTML, HTML Documents, Basic structure of an HTML document. Creating an

HTML document, Markup Tags and attributes. Heading-Paragraphs, Line Breaks, Designing
simple page - Head tag, Body tag. Working with Lists, Tables and Frames, Working with
Hyperlinks, Images and Multimedia, Working with Forms and controls.

Module 3: Introduction to Cascading Style Sheets

Concept of CSS, creating Style Sheets, CSS Properties, CSS Styling (Background, Text Format,
Controlling Fonts). Working with block elements and objects, Working with Lists and Tables,
CSS Id and Class, Box Model (Introduction, Border properties, Padding Properties, Margin
properties), CSS Advanced (Grouping, Dimension, Display, Positioning, Floating, Align, Pseudo
class, Navigation Bar, Image Sprites, Attribute sector). Creating page Layout and Site Designs.

Module 4: Working with Java Script

Introduction to JavaScript: Data types, variables, operators, expressions, statements, functions,

objects, arrays, date, math, error handling, flow control, loops. Document Object Model (DOM).

Module 5: Practical Web Development using Advanced techniques and tools

Introduction to HTML5, CSS3, New features, Local storage, Web Sockets, Canvas, Audio &
Video. Commonly used web authoring tools. Web hosting and website maintenance.

TEXT BOOKS:

1. Adrian W. West, “Practical Web Design for Absolute Beginners”, Apress, 2016

2. Thomas Powell, “HTML & CSS: The Complete Reference”, 5th Edition, McGraw Hill

3. Alexis Goldstein, Estelle W., Louis Lazaris, “HTML5 & CSS3 for the Real World”, 2nd,

28
LAB EXERCISES:

1. Design a simple web page with head, body and footer, with heading tags, image tag.

2. Design a web site for book information, home page should contain books list, when particu-
lar book is clicked, information of the books should display in the next page.

3. Design a page to display the product information such as name, brand, price and etc with
table tag

4. Design a web site for book information using frames, home page should contain two parts,
left part should contain books list, and right part should contain book information.

5. Design a web page with nice formatting like background image, text colors and border for
text using external CSS.

6. Design a web page to perform mathematical calculations such as addition, subtraction, mul-
tiplication, and division using form elements and Java Script.

7. Design a web page to capture the user information such as name, gender, mobile number,
mail id, city, state, and country using form elements and display them into other pages using
Java Script.

8. Design a web page to display timer in the left side of the web page using Java Script.

9. Design a web page to capture the student details such as student number, name, age, marks
using Java Script Object.

10. Design a web site for online purchase using CSS and JS, web site should contain the follow -
ing web pages (Home page, Login page, Signup page, Product details page)

CO-PO MAPPING:

29
 COs &
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
POs

CO1 3 2 2 2 – – – 1

CO2 3 3 3 3 1 – – 1

CO3 3 2 3 3 1 – – 1

CO4 3 3 3 3 2 – – 1

CO5 3 3 3 3 2 2 – 2

CO-PSO MAPPING:

COs & PSOs PSO-1 PSO-2 PSO-3

CO1 2 2 1

CO2 2 2 2

CO3 2 3 2

CO4 3 2 3

CO5 3 3 3

30