a) Inventory Management for a EMart Grocery Shop

b) Society Financial Management

c) Cop Friendly App – Eseva
d) Property Management – eMall
e) Star Small and Medium Banking and Finance
● Build Entity Model diagram. The diagram should align with the business and functional
goals stated in the application.
● Apply Normalization rules in designing the tables in scope.
● Prepared applicable views, triggers (for auditing purposes), functions for enabling
enterprise grade features.
● Build PL SQL / Stored Procedures for Complex Functionalities, ex EOD Batch
Processing for calculating the EMI for Gold Loan for each eligible Customer.
● Ability to showcase ACID Properties with sample queries with appropriate settings
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Create databases with different types of key constraints.
CO2: Construct simple and complex SQL queries using DML and DCL commands.
CO3: Use advanced features such as stored procedures and triggers and incorporate in GUI based
application development.
CO4: Create an XML database and validate with meta-data (XML schema).
CO5: Create and manipulate data using NOSQL database.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 - - - - 3 1 3 2 2 3 2
2 2 2 3 2 2 - - - 1 2 3 3 2 1 2
3 3 3 2 1 1 - - - 1 1 1 3 2 3 3
4 1 3 3 3 1 - - - 1 1 3 2 3 1 3
5 3 2 1 1 1 - - - 2 2 3 1 3 1 2
AVg. 2 3 2 2 1 - - - 2 1 3 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3591 COMPUTER NETWORKS L T PC

3 0 2 4
COURSE OBJECTIVES:
 To understand the concept of layering in networks.
 To know the functions of protocols of each layer of TCP/IP protocol suite.
 To visualize the end-to-end flow of information.
 To learn the functions of network layer and the various routing protocols
 To familiarize the functions and protocols of the Transport layer

90
UNIT I INTRODUCTION AND APPLICATION LAYER 10
Data Communication - Networks – Network Types – Protocol Layering – TCP/IP Protocol suite –
OSI Model – Introduction to Sockets - Application Layer protocols: HTTP – FTP – Email protocols
(SMTP - POP3 - IMAP - MIME) – DNS – SNMP
UNIT II TRANSPORT LAYER 9
Introduction - Transport-Layer Protocols: UDP – TCP: Connection Management – Flow control -
Congestion Control - Congestion avoidance (DECbit, RED) – SCTP – Quality of Service

UNIT III NETWORK LAYER 7

Switching : Packet Switching - Internet protocol - IPV4 – IP Addressing – Subnetting - IPV6, ARP,
RARP, ICMP, DHCP

UNIT IV ROUTING 7
Routing and protocols: Unicast routing - Distance Vector Routing - RIP - Link State Routing – OSPF
– Path-vector routing - BGP - Multicast Routing: DVMRP – PIM.

UNIT V DATA LINK AND PHYSICAL LAYERS 12

Data Link Layer – Framing – Flow control – Error control – Data-Link Layer Protocols – HDLC –
PPP - Media Access Control – Ethernet Basics – CSMA/CD – Virtual LAN – Wireless LAN
(802.11) - Physical Layer: Data and Signals - Performance – Transmission media- Switching –
Circuit Switching.
45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Learn to use commands like tcpdump, netstat, ifconfig, nslookup and traceroute. Capture
ping and trace route PDUs using a network protocol analyzer and examine.
2. Write a HTTP web client program to download a web page using TCP sockets.
3. Applications using TCP sockets like: a) Echo client and echo server b) Chat
4. Simulation of DNS using UDP sockets.
5. Use a tool like Wireshark to capture packets and examine the packets
6. Write a code simulating ARP /RARP protocols.
7. Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using NS.
8. Study of TCP/UDP performance using Simulation tool.
9. Simulation of Distance Vector/ Link State Routing algorithm.
10. Simulation of an error correction code (like CRC)

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO 1: Explain the basic layers and its functions in computer networks.
CO 2: Understand the basics of how data flows from one node to another.
CO 3: Analyze routing algorithms.
CO 4: Describe protocols for various functions in the network.
CO 5: Analyze the working of various application layer protocols.
TOTAL:75 PERIODS
TEXT BOOKS
1. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach Featuring the
Internet, Eighth Edition, Pearson Education, 2021.
2. Behrouz A. Forouzan, Data Communications and Networking with TCP/IP Protocol Suite, Sixth
Edition TMH, 2022
91
REFERENCES
1. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition,
Morgan Kaufmann Publishers Inc., 2012.
2. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education,
2013.
3. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall, 2014.
4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
Approach”, McGraw Hill, 2012.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 - 2 - - - - - - - - - 3 - -
2 - 1 - - 2 - - - - - - 2 - 2 -
3 - 2 - - 3 - - - - - - - - 3 -
4 - - 1 2 - - - - 3 - - - - -
5 - 3 2 - - - - - - - - - - - 3
AVg. - 1 - - 1 - - - - 1 - - - 1 1
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3501 COMPILER DESIGN LTPC

3 024

COURSE OBJECTIVES:
 To learn the various phases of compiler.
 To learn the various parsing techniques.
 To understand intermediate code generation and run-time environment.
 To learn to implement the front-end of the compiler.
 To learn to implement code generator.
 To learn to implement code optimization.

UNIT I INTRODUCTION TO COMPILERS & LEXICAL ANALYSIS 8

Introduction- Translators- Compilation and Interpretation- Language processors -The Phases of

Compiler – Lexical Analysis – Role of Lexical Analyzer – Input Buffering – Specification of Tokens
– Recognition of Tokens – Finite Automata – Regular Expressions to Automata NFA, DFA –
Minimizing DFA - Language for Specifying Lexical Analyzers – Lex tool.

UNIT II SYNTAX ANALYSIS 11

Role of Parser – Grammars – Context-free grammars – Writing a grammar Top Down Parsing -
General Strategies - Recursive Descent Parser Predictive Parser-LL(1) - Parser-Shift Reduce
Parser-LR Parser- LR (0)Item Construction of SLR Parsing Table - Introduction to LALR Parser -
Error Handling and Recovery in Syntax Analyzer-YACC tool - Design of a syntax Analyzer for a
Sample Language

92
UNIT III SYNTAX DIRECTED TRANSLATION & INTERMEDIATE CODE GENERATION 9

Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-Attribute

Definitions- Design of predictive translator - Type Systems-Specification of a simple type Checker-
Equivalence of Type Expressions-Type Conversions. Intermediate Languages: Syntax Tree, Three
Address Code, Types and Declarations, Translation of Expressions, Type Checking, Back
patching.

UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 9

Runtime Environments – source language issues – Storage organization – Storage Allocation

Strategies: Static, Stack and Heap allocation - Parameter Passing-Symbol Tables - Dynamic
Storage Allocation - Issues in the Design of a code generator – Basic Blocks and Flow graphs -
Design of a simple Code Generator - Optimal Code Generation for Expressions– Dynamic
Programming Code Generation.

UNIT V CODE OPTIMIZATION 8

Principal Sources of Optimization – Peep-hole optimization - DAG- Optimization of Basic Blocks -
Global Data Flow Analysis - Efficient Data Flow Algorithm – Recent trends in Compiler Design.
45 PERIODS
LIST OF EXPERIMENTS:

1. Using the LEX tool, Develop a lexical analyzer to recognize a few patterns in C. (Ex.
identifiers, constants, comments, operators etc.). Create a symbol table, while recognizing
identifiers.
2. Implement a Lexical Analyzer using LEX Tool
3. Generate YACC specification for a few syntactic categories.

a. Program to recognize a valid arithmetic expression that uses operator +, -, * and /.

b. Program to recognize a valid variable which starts with a letter followed by any
number of letters or digits.
c. Program to recognize a valid control structures syntax of C language (For loop,
while loop, if-else, if-else-if, switch-case, etc.).
d. Implementation of calculator using LEX and YACC

4. Generate three address code for a simple program using LEX and YACC.
5. Implement type checking using Lex and Yacc.
6. Implement simple code optimization techniques (Constant folding, Strength reduction and
Algebraic transformation)
7. Implement back-end of the compiler for which the three address code is given as input and
the 8086 assembly language code is produced as output.
30 PERIODS
TOTAL: 75 PERIODS
COURSE OUTCOMES:
On Completion of the course, the students should be able to:

CO1:Understand the techniques in different phases of a compiler.

CO2:Design a lexical analyser for a sample language and learn to use the LEX tool.
CO3:Apply different parsing algorithms to develop a parser and learn to use YACC tool
CO4:Understand semantics rules (SDT), intermediate code generation and run-time environment.
93
CO5:Implement code generation and apply code optimization techniques.

TEXT BOOK:

1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, “Compilers: Principles,
Techniques and Tools”, Second Edition, Pearson Education, 2009.

REFERENCES

1. Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependence
based Approach, Morgan Kaufmann Publishers, 2002.
2. Steven S. Muchnick, Advanced Compiler Design and Implementation‖, Morgan Kaufmann
Publishers - Elsevier Science, India, Indian Reprint 2003.
3. Keith D Cooper and Linda Torczon, Engineering a Compiler‖, Morgan Kaufmann Publishers
Elsevier Science, 2004.
4. V. Raghavan, Principles of Compiler Design‖, Tata McGraw Hill Education Publishers, 2010.
5. Allen I. Holub, Compiler Design in C‖, Prentice-Hall Software Series, 1993.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 - - - - 3 3 1 3 2 3 2
2 3 3 3 3 3 - - - 3 2 3 2 2 1 2
3 3 3 2 2 3 - - - 3 1 1 1 2 2 3
4 3 2 2 1 1 - - - 2 3 2 3 1 2 1
5 3 3 3 2 1 - - - 2 1 1 3 2 1 2
AVg. 3.00 2.80 2.60 2.20 2.00 - - - 2.60 2.00 1.60 2.40 1.80 1.80 2.00
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CB3491 CRYPTOGRAPHY AND CYBER SECURITY L T P C

3 0 0 3
COURSE OBJECTIVES:
 Learn to analyze the security of in-built cryptosystems.
 Know the fundamental mathematical concepts related to security.
 Develop cryptographic algorithms for information security.
 Comprehend the various types of data integrity and authentication schemes
 Understand cyber crimes and cyber security.

UNIT I INTRODUCTION TO SECURITY 9

Computer Security Concepts – The OSI Security Architecture – Security Attacks – Security Services
and Mechanisms – A Model for Network Security – Classical encryption techniques: Substitution
techniques, Transposition techniques, Steganography – Foundations of modern cryptography:
Perfect security – Information Theory – Product Cryptosystem – Cryptanalysis.

UNIT II SYMMETRIC CIPHERS 9

Number theory – Algebraic Structures – Modular Arithmetic - Euclid‘s algorithm – Congruence and
matrices – Group, Rings, Fields, Finite Fields

94
SYMMETRIC KEY CIPHERS: SDES – Block Ciphers – DES, Strength of DES – Differential and
linear cryptanalysis – Block cipher design principles – Block cipher mode of operation – Evaluation
criteria for AES – Pseudorandom Number Generators – RC4 – Key distribution.

UNIT III ASYMMETRIC CRYPTOGRAPHY 9

MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes – Primality Testing –
Factorization – Euler’s totient function, Fermat’s and Euler’s Theorem – Chinese Remainder
Theorem – Exponentiation and logarithm

ASYMMETRIC KEY CIPHERS: RSA cryptosystem – Key distribution – Key management – Diffie
Hellman key exchange -– Elliptic curve arithmetic – Elliptic curve cryptography.

UNIT IV INTEGRITY AND AUTHENTICATION ALGORITHMS 9

Authentication requirement – Authentication function – MAC – Hash function – Security of hash
function: HMAC, CMAC – SHA – Digital signature and authentication protocols – DSS – Schnorr
Digital Signature Scheme – ElGamal cryptosystem – Entity Authentication: Biometrics, Passwords,
Challenge Response protocols – Authentication applications – Kerberos
MUTUAL TRUST: Key management and distribution – Symmetric key distribution using symmetric
and asymmetric encryption – Distribution of public keys – X.509 Certificates.

UNIT V CYBER CRIMES AND CYBER SECURITY 9

Cyber Crime and Information Security – classifications of Cyber Crimes – Tools and Methods –
Password Cracking, Keyloggers, Spywares, SQL Injection – Network Access Control – Cloud
Security – Web Security – Wireless Security

TOTAL:45 PERIODS

COURSE OUTCOMES:
CO1: Understand the fundamentals of networks security, security architecture, threats and
vulnerabilities
CO2: Apply the different cryptographic operations of symmetric cryptographic algorithms
CO3: Apply the different cryptographic operations of public key cryptography
CO4: Apply the various Authentication schemes to simulate different applications.
CO5: Understand various cyber crimes and cyber security.

TEXT BOOKS
1. William Stallings, "Cryptography and Network Security - Principles and Practice", Seventh
Edition, Pearson Education, 2017.
2. Nina Godbole, Sunit Belapure, “Cyber Security: Understanding Cyber crimes, Computer
Forensics and Legal Perspectives”, First Edition, Wiley India, 2011.

REFERENCES
1. Behrouz A. Ferouzan, Debdeep Mukhopadhyay, "Cryptography and Network Security", 3rd
Edition, Tata Mc Graw Hill, 2015.
2. Charles Pfleeger, Shari Pfleeger, Jonathan Margulies, "Security in Computing", Fifth Edition,
Prentice Hall, New Delhi, 2015.

95
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 1 2 2 - - - 1 - - 1 2 3 3
2 3 3 3 3 3 - - - 2 - - 1 3 3 3
3 3 3 3 3 3 - - - 2 - - 1 3 3 3
4 3 3 3 3 3 - - - 2 - - 1 3 3 3
5 3 2 3 2 3 - - - 3 - - 2 3 2 3
AVg. 3 2.6 2.6 2.6 2.8 - - - 2 - - 1.2 2.8 2.8 3
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3551 DISTRIBUTED COMPUTING L T P C

3 0 0 3
COURSE OBJECTIVES:
 To introduce the computation and communication models of distributed systems
 To illustrate the issues of synchronization and collection of information in distributed systems
 To describe distributed mutual exclusion and distributed deadlock detection techniques
 To elucidate agreement protocols and fault tolerance mechanisms in distributed systems
 To explain the cloud computing models and the underlying concepts

UNIT I INTRODUCTION 8
Introduction: Definition-Relation to Computer System Components – Motivation – Message -Passing
Systems versus Shared Memory Systems – Primitives for Distributed Communication –
Synchronous versus Asynchronous Executions – Design Issues and Challenges; A Model of
Distributed Computations: A Distributed Program – A Model of Distributed Executions – Models of
Communication Networks – Global State of a Distributed System.

UNIT II LOGICAL TIME AND GLOBAL STATE 10

Logical Time: Physical Clock Synchronization: NTP – A Framework for a System of Logical Clocks
– Scalar Time – Vector Time; Message Ordering and Group Communication: Message Ordering
Paradigms – Asynchronous Execution with Synchronous Communication – Synchronous Program
Order on Asynchronous System – Group Communication – Causal Order – Total Order; Global
State and Snapshot Recording Algorithms: Introduction – System Model and Definitions – Snapshot
Algorithms for FIFO Channels.

UNIT III DISTRIBUTED MUTEX AND DEADLOCK 10

Distributed Mutual exclusion Algorithms: Introduction – Preliminaries – Lamport’s algorithm – Ricart-
Agrawala’s Algorithm –– Token-Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm;
Deadlock Detection in Distributed Systems: Introduction – System Model – Preliminaries – Models
of Deadlocks – Chandy-Misra-Haas Algorithm for the AND model and OR Model.

UNIT IV CONSENSUS AND RECOVERY 10

Consensus and Agreement Algorithms: Problem Definition – Overview of Results – Agreement in a
Failure-Free System(Synchronous and Asynchronous) – Agreement in Synchronous Systems with
Failures; Checkpointing and Rollback Recovery: Introduction – Background and Definitions – Issues
in Failure Recovery – Checkpoint-based Recovery – Coordinated Checkpointing Algorithm -
- Algorithm for Asynchronous Checkpointing and Recovery
96
UNIT V CLOUD COMPUTING 7
Definition of Cloud Computing – Characteristics of Cloud – Cloud Deployment Models – Cloud
Service Models – Driving Factors and Challenges of Cloud – Virtualization – Load Balancing –
Scalability and Elasticity – Replication – Monitoring – Cloud Services and Platforms: Compute
Services – Storage Services – Application Services

COURSE OUTCOMES:
Upon the completion of this course, the student will be able to
CO1: Explain the foundations of distributed systems (K2)
CO2: Solve synchronization and state consistency problems (K3)
CO3 Use resource sharing techniques in distributed systems (K3)
CO4: Apply working model of consensus and reliability of distributed systems (K3)
CO5: Explain the fundamentals of cloud computing (K2)
TOTAL:45 PERIODS
TEXT BOOKS
1. Kshemkalyani Ajay D, Mukesh Singhal, “Distributed Computing: Principles, Algorithms and
Systems”, Cambridge Press, 2011.
2. Mukesh Singhal, Niranjan G Shivaratri, “Advanced Concepts in Operating systems”, Mc-
Graw Hill Publishers, 1994.

REFERENCES
1. George Coulouris, Jean Dollimore, Time Kindberg, “Distributed Systems Concepts and
Design”, Fifth Edition, Pearson Education, 2012.
2. Pradeep L Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of
India, 2007.
3. Tanenbaum A S, Van Steen M, “Distributed Systems: Principles and Paradigms”, Pearson
Education, 2007.
4. Liu M L, “Distributed Computing: Principles and Applications”, Pearson Education, 2004.
5. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, 2003.
6. Arshdeep Bagga, Vijay Madisetti, “ Cloud Computing: A Hands-On Approach”, Universities
Press, 2014.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 3 1 - - - 2 1 3 3 2 1 1
2 1 3 2 1 2 - - - 2 2 2 2 1 3 2
3 2 2 1 3 3 - - - 3 2 1 1 1 2 1
4 1 2 2 3 1 - - - 3 3 2 1 3 1 1
5 3 3 1 2 3 - - - 3 3 3 1 3 2 3
AVg. 1.8 2.4 1.8 2.4 2 - - - 2.6 2.2 2.2 1.6 2 1.8 1.6
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

97
C-3: How to read films?
C-4: Film Criticism / Appreciation

Theme – D: Development of Films

D-1: Representative Soviet films

D-2: Representative Japanese films
D-3: Representative Italian films
D-4: Representative Hollywood film and the studio system

Theme - E: Indian Films

E-1: The early era

E-2: The important films made by the directors
E-3: The regional films
E-4: The documentaries in India

READING:

A Reader containing important articles on films will be prepared and given to the students. The
students must read them and present in the class and have discussion on these.

MX3084 DISASTER RISK REDUCTION AND MANAGEMENT LTPC

300 0
COURSE OBJECTIVE
 To impart knowledge on concepts related to disaster, disaster risk reduction, disaster
management
 To acquaint with the skills for planning and organizing disaster response

UNIT I HAZRADS, VULNERABILITY AND DISASTER RISKS 9

Definition: Disaster, Hazard, Vulnerability, Resilience, Risks – Types of Disasters: Natural, Human
induced, Climate change induced –Earthquake, Landslide, Flood, Drought, Fire etc – Technological
disasters- Structural collapse, Industrial accidents, oil spills -Causes, Impacts including social,
Economic, political, environmental, health, psychosocial, etc.- Disaster vulnerability profile of India
and Tamil Nadu - Global trends in disasters: urban disasters, pandemics, Complex emergencies, -
-, Inter relations between Disasters and Sustainable development Goals

UNIT II DISASTER RISK REDUCTION (DRR) 9

Sendai Framework for Disaster Risk Reduction, Disaster cycle - Phases, Culture of safety,
prevention, mitigation and preparedness community Based DRR, Structural- nonstructural
measures, Roles and responsibilities of- community, Panchayati Raj Institutions / Urban Local
Bodies (PRIs/ULBs), States, Centre, and other stakeholders- Early Warning System – Advisories
from Appropriate Agencies.- Relevance of indigenous Knowledge, appropriate technology and Local
resources.

UNIT III DISASTER MANAGEMENT 9

Components of Disaster Management – Preparedness of rescue and relief, mitigation, rehabilitation
and reconstruction- Disaster Risk Management and post disaster management – Compensation
202
and Insurance- Disaster Management Act (2005) and Policy - Other related policies, plans,
programmers and legislation - Institutional Processes and Framework at State and Central Level-
(NDMA –SDMA-DDMA-NRDF- Civic Volunteers)

UNIT IV TOOLS AND TECHNOLOGY FOR DISASTER MANAGEMENT 9

Early warning systems -Components of Disaster Relief: Water, Food, Sanitation, Shelter, Health,
Waste Management, Institutional arrangements (Mitigation, Response and Preparedness, – Role of
GIS and Information Technology Components in Preparedness, Risk Assessment, Response and
Recovery Phases of Disaster – Disaster Damage Assessment. - Elements of Climate Resilient
Development –Standard operation Procedure for disaster response – Financial planning for disaster
Management

UNIT V DISASTER MANAGEMENT: CASE STUDIES 9

Discussion on selected case studies to analyse the potential impacts and actions in the contest of
disasters-Landslide Hazard Zonation: Earthquake Vulnerability Assessment of Buildings and
Infrastructure: Case Studies, Drought Assessment: Case Studies, Coastal Flooding: Storm Surge
Assessment, Floods: Fluvial and Pluvial Flooding: Case Studies; Forest Fire: Case Studies, Man
Made disasters: Case Studies, Space Based Inputs for Disaster Mitigation and Management and
field works related to disaster management.- Field work-Mock drill -
TOTAL : 45 PERIODS
TEXT BOOKS:
1 Taimpo (2016), Disaster Management and Preparedness, CRC Publications
2 Singh R (2017), Disaster Management Guidelines for earthquakes, Landslides, Avalanches and
tsunami, Horizon Press Publications
3 Singhal J.P. “Disaster Management”, Laxmi Publications, 2010. ISBN-10: 9380386427 ISBN-
13: 978-9380386423
4 Tushar Bhattacharya, “Disaster Science and Management”, McGraw Hill India
Education Pvt. Ltd., 2012. ISBN-10: 1259007367, ISBN-13: 978-1259007361]

REFERENCES
1. Govt. of India: Disaster Management Act, Government of India, New Delhi, 2005.
2. Government of India, National Disaster Management Policy, 2009.
3. Shaw R (2016), Community based Disaster risk reduction, Oxford University Press

COURSE OUTCOME:
CO1: To impart knowledge on the concepts of Disaster, Vulnerability and Disaster Risk reduction
(DRR)
CO2: To enhance understanding on Hazards, Vulnerability and Disaster Risk Assessment
prevention and risk reduction
CO3: To develop disaster response skills by adopting relevant tools and technology
CO4: Enhance awareness of institutional processes for Disaster response in the country and
CO5: Develop rudimentary ability to respond to their surroundings with potential Disaster response
in areas where they live, with due sensitivity

203
 3. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, Prentice Hall, 2011.
4. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Pearson, 1997.
5. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth
Edition, Springer, 2003.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 2 1 - - - - - - 3 2 3 -
2 3 3 3 2 2 - - - - - - 3 2 3 -
3 3 3 3 2 2 - - - - - - 3 2 3 -
4 3 3 3 3 2 2 - - - - - - 3 2 -
5 3 3 3 3 3 3 2 2 1 3 1 3 3 3 -
AVg. 2.8 2.8 3 2.4 2 2.5 2 2 1 3 1 3 2.4 2.8 -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS335 CLOUD COMPUTING L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the principles of cloud architecture, models and infrastructure.
 To understand the concepts of virtualization and virtual machines.
 To gain knowledge about virtualization Infrastructure.
 To explore and experiment with various Cloud deployment environments.
 To learn about the security issues in the cloud environment.

UNIT I CLOUD ARCHITECTURE MODELS AND INFRASTRUCTURE 6

Cloud Architecture: System Models for Distributed and Cloud Computing – NIST Cloud Computing
Reference Architecture – Cloud deployment models – Cloud service models; Cloud Infrastructure:
Architectural Design of Compute and Storage Clouds – Design Challenges

UNIT II VIRTUALIZATION BASICS 6

Virtual Machine Basics – Taxonomy of Virtual Machines – Hypervisor – Key Concepts –
Virtualization structure – Implementation levels of virtualization – Virtualization Types: Full
Virtualization – Para Virtualization – Hardware Virtualization – Virtualization of CPU, Memory and
I/O devices.

UNIT III VIRTUALIZATION INFRASTRUCTURE AND DOCKER 7

Desktop Virtualization – Network Virtualization – Storage Virtualization – System-level of Operating
Virtualization – Application Virtualization – Virtual clusters and Resource Management – Containers
vs. Virtual Machines – Introduction to Docker – Docker Components – Docker Container – Docker
Images and Repositories.

UNIT IV CLOUD DEPLOYMENT ENVIRONMENT 6

Google App Engine – Amazon AWS – Microsoft Azure; Cloud Software Environments – Eucalyptus
– OpenStack.

134
UNIT V CLOUD SECURITY 5
Virtualization System-Specific Attacks: Guest hopping – VM migration attack – hyperjacking. Data
Security and Storage; Identity and Access Management (IAM) - IAM Challenges - IAM Architecture
and Practice.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Install Virtualbox/VMware/ Equivalent open source cloud Workstation with different flavours
of Linux or Windows OS on top of windows 8 and above.
2. Install a C compiler in the virtual machine created using a virtual box and execute Simple
Programs
3. Install Google App Engine. Create a hello world app and other simple web applications using
python/java.
4. Use the GAE launcher to launch the web applications.
5. Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not present
in CloudSim.
6. Find a procedure to transfer the files from one virtual machine to another virtual machine.
7. Install Hadoop single node cluster and run simple applications like wordcount.
8. Creating and Executing Your First Container Using Docker.
9. Run a Container from Docker Hub
COURSE OUTCOMES:
CO1: Understand the design challenges in the cloud.
CO2: Apply the concept of virtualization and its types.
CO3: Experiment with virtualization of hardware resources and Docker.
CO4: Develop and deploy services on the cloud and set up a cloud environment.
CO5: Explain security challenges in the cloud environment.
TOTAL:60 PERIODS
TEXT BOOKS
1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud Computing, From
Parallel Processing to the Internet of Things”, Morgan Kaufmann Publishers, 2012.
2. James Turnbull, “The Docker Book”, O’Reilly Publishers, 2014.
3. Krutz, R. L., Vines, R. D, “Cloud security. A Comprehensive Guide to Secure Cloud
Computing”, Wiley Publishing, 2010.
REFERENCES
1. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and
Processes”, Elsevier/Morgan Kaufmann, 2005.
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, “Cloud Security and Privacy: an
enterprise perspective on risks and compliance”, O’Reilly Media, Inc., 2009.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 1 1 1 - - - 2 3 1 3 2 1 3
2 3 1 2 2 1 - - - 1 2 1 3 2 2 1
3 2 3 2 3 1 - - - 3 1 1 3 1 1 1
4 1 2 3 3 3 - - - 3 3 1 2 1 3 3
5 2 3 3 1 3 - - - 2 2 1 2 2 2 3
AVg. 2.2 2.2 2.2 2 1.8 - - - 2.2 2.2 1 2.6 1.6 1.8 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

135
 2. Create a Cost-model for a web application using various services and do Cost-benefit
analysis
3. Create alerts for usage of Cloud resources
4. Create Billing alerts for your Cloud Organization
5. Compare Cloud cost for a simple web application across AWS, Azure and GCP and suggest
the best one
TOTAL:60 PERIODS
TEXT BOOKS
1. Cloud Service Management and Governance: Smart Service Management in Cloud Era by
Enamul Haque, Enel Publications
2. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl, Ricardo Puttini,
Zaigham Mohammad 2013
3. Cloud Computing Design Patterns by Thomas Erl, Robert Cope, Amin Naserpour

REFERENCES
1. Economics of Cloud Computing by Praveen Ayyappa, LAP Lambert Academic Publishing
2. Mastering Cloud Computing Foundations and Applications Programming Rajkumar Buyya,
Christian Vechhiola, S. Thamarai Selvi

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 1 1 1 - - - 2 1 3 2 2 1 3
2 3 1 2 3 2 - - - 1 2 3 1 2 2 2
3 1 1 3 1 3 - - - 3 3 1 1 3 2 1
4 1 1 1 2 3 - - - 2 3 3 1 1 1 1
5 1 3 3 2 2 - - - 1 3 1 2 1 3 2
AVg. 1.8 1.8 2 1.8 2.2 - - - 1.8 2.4 2.2 1.4 1.8 1.8 1.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS370 UI AND UX DESIGN L T P C

2 0 2 3
COURSE OBJECTIVES:
 To provide a sound knowledge in UI & UX
 To understand the need for UI and UX
 To understand the various Research Methods used in Design
 To explore the various Tools used in UI & UX
 Creating a wireframe and prototype

UNIT I FOUNDATIONS OF DESIGN 6

UI vs. UX Design - Core Stages of Design Thinking - Divergent and Convergent Thinking -
Brainstorming and Game storming - Observational Empathy

UNIT II FOUNDATIONS OF UI DESIGN 6

Visual and UI Principles - UI Elements and Patterns - Interaction Behaviors and Principles –
Branding - Style Guides

125
UNIT III FOUNDATIONS OF UX DESIGN 6
Introduction to User Experience - Why You Should Care about User Experience - Understanding
User Experience - Defining the UX Design Process and its Methodology - Research in User
Experience Design - Tools and Method used for Research - User Needs and its Goals - Know about
Business Goals

UNIT IV WIREFRAMING, PROTOTYPING AND TESTING 6

Sketching Principles - Sketching Red Routes - Responsive Design – Wireframing - Creating
Wireflows - Building a Prototype - Building High-Fidelity Mockups - Designing Efficiently with Tools
- Interaction Patterns - Conducting Usability Tests - Other Evaluative User Research Methods -
Synthesizing Test Findings - Prototype Iteration

UNIT V RESEARCH, DESIGNING, IDEATING, & INFORMATION ARCHITECTURE 6

Identifying and Writing Problem Statements - Identifying Appropriate Research Methods - Creating
Personas - Solution Ideation - Creating User Stories - Creating Scenarios - Flow Diagrams - Flow
Mapping - Information Architecture
30 PERIODS
LIST OF EXPERIMENTS 30 PERIODS
1. Designing a Responsive layout for an societal application
2. Exploring various UI Interaction Patterns
3. Developing an interface with proper UI Style Guides
4. Developing Wireflow diagram for application using open source software
5. Exploring various open source collaborative interface Platform
6. Hands on Design Thinking Process for a new product
7. Brainstorming feature for proposed product
8. Defining the Look and Feel of the new Project
9. Create a Sample Pattern Library for that product (Mood board, Fonts, Colors based on
UI principles)
10. Identify a customer problem to solve
11. Conduct end-to-end user research - User research, creating personas, Ideation
process (User stories, Scenarios), Flow diagrams, Flow Mapping
12. Sketch, design with popular tool and build a prototype and perform usability testing and
identify improvements
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1:Build UI for user Applications
CO2:Evaluate UX design of any product or application
CO3:Demonstrate UX Skills in product development
CO4:Implement Sketching principles
CO5:Create Wireframe and Prototype
TEXT BOOKS
1. Joel Marsh, “UX for Beginners”, O’Reilly , 2022
2. Jon Yablonski, “Laws of UX using Psychology to Design Better Product & Services” O’Reilly
2021

126
REFERENCES
1. Jenifer Tidwell, Charles Brewer, Aynne Valencia, “Designing Interface” 3 rd Edition , O’Reilly
2020
2. Steve Schoger, Adam Wathan “Refactoring UI”, 2018
3. Steve Krug, “Don't Make Me Think, Revisited: A Commonsense Approach to Web &
Mobile”, Third Edition, 2015
4. https://www.nngroup.com/articles/
5. https://www.interaction-design.org/literature.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 1 3 1 - - - 3 3 2 1 3 3 1
2 2 3 1 3 2 - - - 1 2 2 2 1 2 2
3 1 3 3 2 2 - - - 2 3 1 2 1 3 3
4 1 2 3 3 1 - - - 3 2 1 3 3 3 3
5 1 2 3 2 1 - - - 2 1 1 1 3 2 2
AVg. 1.6 2.2 2.2 2.6 1.4 - - - 2.2 2.2 1.4 1.8 2.2 2.6 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS366 SOFTWARE TESTING AND AUTOMATION L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the basics of software testing
 To learn how to do the testing and planning effectively
 To build test cases and execute them
 To focus on wide aspects of testing and understanding multiple facets of testing
 To get an insight about test automation and the tools used for test automation

UNIT I FOUNDATIONS OF SOFTWARE TESTING 6

Why do we test Software?, Black-Box Testing and White-Box Testing, Software Testing Life Cycle,
V-model of Software Testing, Program Correctness and Verification, Reliability versus Safety,
Failures, Errors and Faults (Defects), Software Testing Principles, Program Inspections, Stages of
Testing: Unit Testing, Integration Testing, System Testing

UNIT II TEST PLANNING 6

The Goal of Test Planning, High Level Expectations,Intergroup Responsibilities, Test Phases, Test
Strategy, Resource Requirements, Tester Assignments, Test Schedule, Test Cases, Bug Reporting,
Metrics and Statistics.

UNIT III TEST DESIGN AND EXECUTION 6

Test Objective Identification, Test Design Factors, Requirement identification, Testable
Requirements, Modeling a Test Design Process, Modeling Test Results, Boundary Value Testing,
Equivalence Class Testing, Path Testing, Data Flow Testing, Test Design Preparedness Metrics,
Test Case Design Effectiveness, Model-Driven Test Design, Test Procedures, Test Case
Organization and Tracking, Bug Reporting, Bug Life Cycle.

127