Course Code 22SSP423 COMPUTER NETWORKS AND TCP/IP L T P C

& Title 3 1 0 4
Major

Pre-requisite Computer Organization Academic year 2022-23 onwards

Class II M.Sc.(Software Systems) Semester

IV
On completion of this course, student will be able to K level
CO1 : Describe the general principles of data communication.
Course CO2 : Describe how computer networks are organized with the concept of
Outcomes layered approach.
CO3 : Describe how signals are used to transfer data between nodes.
CO4 : Implement a simple LAN with hubs, bridges and switches.
CO5 : Describe how packets in the Internet are delivered?

SYLLABUS

No. of
Module Contents
Hours

Introduction :
Network goals - Applications of Networks - Design issues for the
layers - OSI Reference Model - Types of Network - Network Topologies- Analog
and Digital data transmission- Data encoding- Bandwidth and data rate-.Bit Rate,
Baud Rate- Sampling Rate.
I
8 hours
DATA COMMUNICATION :
Multiplexing - Synchronous and Asynchronous
TDM – FDM –CDM - Switching, Circuit Switching, Packet Switching.

Transmission of Digital Data :

Transmission Impairments - Single and Multiple
bit error correction-Error Detection and Correction - Cyclic Redundancy Check
Code -.Hamming Code.
II
Data Link Control and Protocols : 10 Hours
Line Discipline - Flow Control - Sliding
Window Protocol - Error Control - Automatic Repeat Request – Stop and wait -
ARQ - Go back by n ARQ - Selective Reject ARQ.

Local Area Networks :

Random Access protocols- Ethernet – Fast Ethernet –
Gigabit Ethernet – Wireless LANs- Internetworking- LAN -LAN Connections –
Repeaters- Hubs - Bridge – Spanning tree-Switches – Routers
III
14 Hours
IP :
TCP/IP Protocol Structure - Internet Protocol – IP addressing-Subnetting-
NAT- IPV6-ICMP-ARP-DHCP
 ROUTING :
Distance vector routing _ Link state Routing – RIP – OSPF

IV TRANSPORT LAYER :
TCP concepts - Port number – Connection control – Flow 10 Hours
control - Congestion Control

Applications :
V SMTP - MIME Format, FTP, DNS, HTTP. 6 Hours

Total Hours 45 Hours

Essential : [ Text Book ]

1. Behrouz A Forouzan, “Data Communications and Networking”, Tata McGraw Hill,

2013.
2. Behrouz A Forouzan, “TCP/ IP Protocol Suite”, Tata McGraw Hill, 2017.
3. Peterson, Larry L., and Bruce S. Davie. Computer networks: a systems approach. Elsevier,
2012.

References Suggestive:

1. 1. Kevin Fall R and Richard Stevens W, "TCP/IP Illustrated, Volume 1: The Protocols”,
Addison-Wesley, Ann Arbor, 2011.
2. James F. Kurose, Keith Ross, “Computer Networking: A Top-Down Approach”,
Addison-Wesley, 2017.
3. Douglas Comer, “Internetworking with TCP/IP”, Prentice Hall, 2013.
William Stallings, "Data and Computer Communications”, Prentice Hall, 2007.

Online Resources :
1. https://www.isi.edu/~hussain/TEACH/Spring2014/notes/Steven00a.pdf
2. https://www.slideshare.net/vipersnh/53426980-tcpip

Teaching- Prescribed E – Learning Resources,

Learning
Process
Assessment
Methods Seminars, Assignments,

Signature of
Designed by Verified by
the HoD
Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1

CO2

CO3

CO4

CO5

* 1 = Low ; 2 = Medium ; 3 = Strong

 For Practical

Course Code 22SSP428 LAB – X COMPUTER NETWORKS AND L T P C

& Title TCP/IP LAB 0 0 3 2
Major

Pre-requisite Academic year 2022-23 onwards

Class M.Sc.(Software Systems) Semester IV

On completion of this course, student will be able to K level
Course CO1 : Learn socket programming.
Outcomes
CO2 : Implement and analyze various network protocols.
CO3 : Use simulation tools to analyze the performance of various network
protocols

SYLLABUS

Contents Hrs

1. Familiarize with GNS3 simulator.

2. Implement Hamming code and CRC.
3. Implement a primitive email server.
4. Familiarize with packet capturing tools in Java and Wireshark.
5. Implement a simple firewall system.
6. Analyse the existing routing protocols and implement any one of them.
7. Write a program where a single entity can communicate with other entities by using IP-multicasting.
8. Assignments using the network simulator.

Signature of
Designed by Verified by
the HoD

Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1

CO2

CO3

* 1 = Low ; 2 = Medium ; 3 = Strong

 For Theory

Course Code 22SSP853A PARALLEL AND DISTRIBUTED L T P C

& Title COMPUTING 4 1 0 5
Discipline Specific Elective Course - III
Microprocessor and Interlacing, Operating
iiii Academic year 2022-23 onwards
systems
VIII
Class IV M.Sc.(Software Systems) Semester
On completion of this course, student will be able to K level
CO1 : Describes the architecture of Parallel Computing
Course CO2 : Describe the various Message passing models
Outcomes CO3 : Discuss the models Parallel computations
CO4 : Implement Group Communication
CO5 : Discuss about the Distributed Computing Tools and technologies

SYLLABUS

No. of
Module Contents
Hours

INTRODUCTION :
Forms of Computing – Monolithic – Distributed – Parallel-
Cooperative - Computational demands of parallel processing, Flynn’s classification
– Terminology.
PARALLEL COMPUTER ARCHITECTURES :
I
Classification – Inter 14 Hours
connection networks – Vector computers – Shared memory parallel computers –
Cache coherence – Distributed shared memory parallel computers – Message
passing parallel computers – Cluster of workstations.

PARALLEL PROGRAMMING MODELS :

Shared memory model, Message 9 Hours
II passing model - Synchronous and Asynchronous message passing models, Leader-
Election algorithm, Breadth-First Search. Shortest Paths, Broadcast and Converge
cast, Data Parallel model.

III PARALLEL ALGORITHMS :

Models of parallel computation including PRAM -
CRCW, CREW, ERCW, EREW models, Design and analysis of Parallel
algorithms: : Automatic vs. Manual Parallelization – Understand the Problem and
the Program – Partitioning – Communications – Synchronization – Data 13 Hours
Dependencies – Load Balancing – Granularity – I/O – Limits and Costs of Parallel
Programming – Performance Analysis and Tuning – Parallel Examples – Array
Processing Matrix multiplication, Sorting, Searching, Merging, Minimum spanning
tree, Prime numbers.
 DISTRIBUTED COMPUTING :
Introduction to Distributed Programming -
System Models-   Architectural models - Client-server model, Peer-to-peer model-
IV Variations of the above models -Distributed computing paradigms – Inter process 12 Hours
communication  -The API for the Internet protocols -  External data representation
and marshalling - Group communication -   Case study: inter process
communication in UNIX - Distributed file systems.

DISTRIBUTED PROGRAMMING ALGORITHMS :

Fundamental issues and
concepts - Synchronization, Mutual Exclusion, Termination Detection, Clocks,
Event ordering, Locking - Distributed Computing Tools & Technologies (CORBA, 12 Hours
V JavaRMI, Web Services).

EMERGING AREAS OF PARALLEL AND DISTRIBUTED SYSTEMS :

Grid
computing, Peer-to-peer systems, Overlay networks, Edge computing and Ad-hoc
networks.
60 Hours
Total Hours

Essential : [ Text Book ]

1. Quinn Michael J, "Designing Efficient Algorithms for Parallel Computers", Tata
McGraw Hill, 2004.
2. Wilkinson B and Allen M, “Parallel Programming: Techniques and Applications Using
References Networked Workstations and Parallel Computers”, Prentice Hall, 2005.

Suggestive:
1. 1. Hariri and Parashar, “Tools and Environments for Parallel and Distributed
Computing”, John Wiley, 2004.
2. Jean Dollimore,TimKindberg and George Coulouris, “Distributed Systems: Concepts and
Design”, Addison Wesley, 2011.
3. Michael J Quinn, “Parallel Computing: Theory and Practice”, Tata McGraw-Hill, 2004.
4. Joel M.Crichlow, “Distributed And Parallel Computing”, Prentice Hall Of India, 2004.
5. Andrew S Tannenbaum and Maarten Van Steen, “Distributed Systems, Principles and
Paradigm” Prentice Hall, 2013.
6. Vijay K Garg,”Elements of Distributed Computing”, John Wiley, 2014.

Online Resources :
1. https://www.scribd.com/document/526638196/Book-Advanced-Computer-
2. https://www.scribd.com/document/442851285/MCAP-QP-CT-I-2-marks-Key

Teaching-
Learning Chalk and talk, Power point presentation
Process
Assessment Seminar, case study, quiz
Methods
 Signature of
Designed by Verified by
HoD

Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1
CO
1
CO
2
CO
3

* 1 = Low ; 2 = Medium ; 3 = Strong

 For Theory

Course Code 22SSP853B INFORMATION RETRIEVAL L T P C

& Title 4 1 0 5
Discipline Specific Elective Course - III

Pre-requisite Linear algebra, Design and analysis of Algorithms Academic year 2022-23 onwards

Class IV M.Sc.(Software Systems) Semester

VIII
On completion of this course, student will be able to K level
CO1 : Describe about basic Tokenizing and Indexing
Course CO2 : Have an Idea about Boolean matching and vector space models
Outcomes CO3 : Discuss about performance metrics and clustering
CO4 : Describe about the Information and collaborative filtering
CO5 : Know about event extraction and Integration

SYLLABUS

No. of
Module Contents
Hours

INTRODUCTION :
Overview of IR Systems - Historical Perspectives - Goals of
IR - The impact of the web on IR - The role of artificial intelligence (AI) in IR.

TEXT REPRESENTATION :
I
Statistical Characteristics of Text: Zipf's law; Porter 12 Hours
stemmer; morphology; index term selection; using thesauri. Basic Tokenizing,
Indexing: Simple tokenizing, stop-word removal, and stemming; inverted indices;
Data Structure and File Organization for IR - efficient processing with sparse
vectors.

RETRIEVAL MODELS :
Similarity Measures and Ranking - Boolean Matching
– Extended Boolean models - Ranked retrieval - Vector Space Models -, text-
II
similarity metrics - TF-IDF (term frequency/inverse document frequency) 12 Hours
weighting - cosine similarity, Probabilistic Models, Evaluations on benchmark text
collections.

III QUERY PROCESSING :

Query Operations and Languages- Query expansion;
Experimental Evaluation of IR: Performance metrics: recall, precision, and F-
measure.

TEXT CATEGORIZATION AND CLUSTERING : 12 Hours

 Categorization:Rocchio;
Naive Bayes, kNN; Clustering: Agglomerative clustering; k-means; Expectation
Maximization (EM); Dimension Reduction: LSI, PCA.

WEB SEARCH :
IR Systems and the WWW - Search Engines: Spidering, Meta
Crawlers and near duplicate pages, Question answering, ; Link analysis: Hubs and
Authorities, Google PageRank, Duplicate Detection.

IV INFORMATION FILTERING TECHNIQUES : 14 Hours

Introduction to Information
Filtering, Relevance Feedback - Applications of Information Filtering:
RECOMMENDER SYSTEMS: Collaborative filtering and Content-Based
recommendation of documents and products.

INFORMATION EXTRACTION AND INTEGRATION :

Extracting data from 10 Hours
text; Basic Techniques: Named Entity Recognition, Co-reference Resolution,
V
Relation Extraction, Event Extraction; Extracting and Integrating specialized
information on the Web, Web Mining and Its Application

Total Hours 60 Hours

Essential : [ Text Book ]

1. Christopher D. Manning, PrabhakarRaghavan and HinrichSchütze, “Introduction to
Information Retrieval”, Cambridge University Press, 2012.
2. Stefan Büttcher, Charles L. A. Clarke, Gordon V. Cormack, “Information Retrieval –
References Implementing and Evaluating Search Engines “, The MIT Press, 2016
3. B.Croft, D. Metzler, T. Strohman,“Search Engines: Information Retrieval in Practice”,
Pearson Education, 2015.

Suggestive:
1. Ricardo Baeza-Yates and BerthierRibeiro-Neto, “Modern Information Retrieval”,
Pearson Education, 2010.
2. Francesco Ricci, LiorRokach, BrachaShapira, Paul B. Kantor, “Recommender Systems
– Handbook”, Springer, 2015

Online Resources :
1. https://nlp.stanford.edu/IR-book/newslides.html
2. https://www.slideserve.com/selia/introduction-to-information-retrieval

Teaching-
Learning Real life examples. Power point presentation
Process
Assessment Seminars, quiz
Methods
Signature of
Designed by Verified by
HoD
Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1

CO2

CO3

CO4

CO5

* 1 = Low ; 2 = Medium ; 3 = Strong

For Theory
Course Code 22SSP319 OPERATING SYSTEM CONCEPTS L T P C
& Title 4 - - 4
Major

Pre-requisite Academic year 2022-23 onwards

Class II M.Sc.(Software Systems) Semester

III
On completion of this course, student will be able to K level
CO1: Understand the fundamentals and mechanisms of Operating system to
Course handle threads and their communications.
Outcomes CO2: Gain Knowledge about process synchronization and scheduling.
CO3 : Know the memory management techniques.
CO4 : Learn I/O, Disk Scheduling algorithms and File Management.
CO5 : Introduce the Requirements and environment of virtualization

SYLLABUS

No. of
Module Contents
Hours

INTRODUCTION :
Abstract view of an operating system – Operating systems
Objectives and Functions – Evaluation of operating Systems – Dual –mode
operation – System calls – Structure of operating Systems.

PROCESS DESCRIPTON AND CONTROL :

I
Process concepts – Process 9 Hours
Creation –Process termination –Process states – Process Description – Process
control.

PROCESS AND THREADS :

Relationship between process and threads – Thread
States – Thread Synchronization –Types of Thread –Multithreading model.

II PROCESS SCHEDULING :
Scheduling basics –CPU I/O interleaving-non-pre-
emption-context switching-Types of Scheduling-Scheduling Criteria-Scheduling
Algorithms-Algorithms Evaluation-Real –time scheduling.
10 Hours
PROCESS SYNCHRONIZATION :
Concurrent Process-Principles of
Concurrency-Race Condition –Mutual Exclusion-Critical Section Problems-
Software Support-Hardware Support –Operating System Support: Semaphore,
Monitor-Classical problems of synchronization examples.

DEADLOCK :
 Principles-characterization-methods for handling deadlock -
Deadlock Prevention, Avoidance, Detection and recovery.

MEMORY MANAGEMENT :
Memory Hierarchy - Memory Management
requirements –Memory partitioning: Fixed partitioning, Dynamic partitioning,
Buddy Systems-Simple Paging-Page Table Structures-Simple Segmentation- 11 Hours
III segmentation and paging.

VIRTUAL MEMORY MANAGEMENT :

Need for Virtual Memory management
–Demand paging-copy on write-Page Fault handling -Page replacement - Frame
allocation - Thrashing-working set model.

I/O MANAGEMENT AND DISK SCHEDULING :

Organization of I/O function –
Types of I/O devices – Logical Structures of I/O functions – I/O –Disk Scheduling
algorithms-RAID-Disk Cache.
IV 10 Hours
FILE SYSTEM MANAGEMENT :
Files –Access Methods-File system
architecture-Functions of file management-Directory and disk structures-Mounting
–File Sharing-File System implementation - Directory implementation - File
Allocation-Free Space Management

VIRTUALIZATION : 8 Hours
V Requirements of virtualization-Type 1, Type 2 Hypervisors
- Paravirtualization-Memory virtualization-I/O virtualization -Virtual Machine on
multicore CPUs-Virtualization in microprocessor environment

Total Hours 48 Hours

Essential : [ Text Book ]

1. Silberschatz A, Galvin, PB and Gagne, G. “Operating System Concepts Essentials”, John
Wiley, 2016.
2. William Stallings, “Operating Systems “, Pearson Education, 2015.
References
Suggestive:
1. Andrew S Tanenbaum, “Modern Operating System “, Prentice Hall, 2015.
2. Elmasri, E., Carrick A.G and Levine .D “ Operating System; A Spiral Approach”,
McGraw Hill 2012.
3. McHoes, A M and Flynn, I.M. “Understanding Operating systems”, Cengage Learning,
2013.
4. Dhamdhere D M,” Operating Systems :A Concept-based Approach”, McGraw Hill 2012.

Online Resources :
1.
2.
Teaching- Chalk and Talk, Power Point presentation
Learning
Process
Assessment Seminar, Library work
Methods
Signature of
Designed by Verified by
HoD

Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1

CO2

CO3

CO4

CO5

* 1 = Low ; 2 = Medium ; 3 = Strong

For Theory

Course Code 22SSP853C HUMAN COMPUTER INTERACTION L T P C

& Title 4 1 - 5
 Discipline Specific Elective – III

Pre-requisite Academic year 2022-23 onwards

Class IV M.Sc.(Software Systems) Semester

XVIII
On completion of this course, student will be able to K level
CO1: To Learn the various contexts of HCI.
Course CO2: To Analyze the various effects of Interaction,
Outcomes CO3 : To study the various Interaction Styles available
CO4 : To learn how to evaluate the User Interface
CO5 : To understand the role of centered Design and Prototyping

SYLLABUS

No. of
Module Contents
Hours

INTRODUCTION : 12 Hours
I
Design, Models, Evaluation, Need to understand people,
computer and methods, Motivation, Contexts of HCI.

FOUNDATION OF HCI – HUMAN ABILITIES & COMPUTERS :

II Human 12 Hours
abilities Vision, Hearing, Touch, Memory. Computers – Speed, Interface, Widgets,
Effects on interaction.

INTERACTION :
III Understanding the psychology towards computers, 12 Hours
Economics ,Need finding. Understanding user’s needs and expectations. Interaction
styles – Command language. From filling. Menu selection. Direct manipulation.

DESIGN GUIDELINES & EVALUATION :

Heuristics as guidelines – Simple
IV
and natural dialogue, Speak the user’s language. Be constant, Provide shortcuts. 12 Hours
Using heurists to explain usability problems. style guides. evaluation of user
interface: Heuristic evaluation, measuring API usability.

USER – CENTERED DESIGN :

V Introduction to User - centered design and 12 Hours
prototyping. Methods – Verbal techniques, Paper prototyping, Mock interfaces, Tutorials
and manuals. Collaborating with users.

Total Hours 60 Hours

Essential : [ Text Book ]

1. Alan Dix, Janet Finlay, Gregory Abowd and Russell Beale, “Human- Computer
Interaction”, Prentice Hall, 2009.
References Suggestive:
1. Yvonne Rogers, Heken Sharp and Jenny Preece ,”Interaction Design: Beyond
Human-
Computer Interaction”, John Wiley, 2011.
2. William Buxton, ”Performance by design: The role of design in software product
development”, Proceedings of the second International Conference on Usage - Centered
Design, 2003.

Online Resources :
1.
2.
Teaching- Power Point Presentation, Real Life examples
Learning
Process
Assessment
Methods Seminar, Assignment

Signature of
Designed by Verified by
HoD

Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1

CO2

CO3

CO4

CO5

* 1 = Low ; 2 = Medium ; 3 = Strong

For Theory
Course Code 22SSP960 DATA SCIENCE L T P C
& Title 4 - - 4
Major

Pre-requisite Academic year 2022-23 onwards

Class V M.sc.(Software Systems) Semester IX

On completion of this course, student will be able to K level
CO1: To Know about Data Science is and the skill sets needed to be a data
Course scientist.
Outcomes CO2: To describe the Data Science Process and how its components interact
CO3 : To develop practical skills needed in modern analytics.
CO4 : To explain how math and information sciences can contribute to
building better algorithms and software.
CO5 : To give a hands-on experience with real-world data analysis.

SYLLABUS

No. of
Module Contents
Hours

INTRODUCTION TO DATA SCIENCE :

Data Wrangling, Cleaning And
I Sampling To Get A Suitable Data Set-Mathematics For Understanding The Data- 10 Hours
Descriptive Statistics: Visualizing Data – Central Tendency –Variability–
Standardizing – Normal Distribution – Sampling Distributions

DATA MANIPULATION AT SCALE :

Parallel database, parallel query 10 Hours
II
processing, in-database analytics, MapReduce, Hadoop, Key-value stores and
NoSQL; tradeoffs of SQL and NoSQL

DATA ANALYTICS USING STATISTICAL TECHNIQUES :

Review of 8 Hours
III univariate regression – Linear regression and related methods –splines and EM
algorithm-Geometry, subspaces, orthogonality projections, normal equations, rank
deficiency

IV DATA ANALYTICS USING STATISTICAL TECHNIQUES :

Estimable
Functions And Gauss-Markov Theorem-Computation Via QR Decomposition,
Gramm-Schmidt Orthogonalization And The SVD- Multivariate Normal
Distribution.

COMMUNICATING RESULTS :
Visualization-Descriptive Statistics And 12 Hours
 Visualizations, Privacy , Ethics-Multivariate Visualization

SPECIAL TOPICS :
Graphic analytics : Structure Traversals, Analytics,
Page Rank, Community Detection, Recursive Queries, Semantic Web.
8 Hours
V
CASE STUDY :
Community Detection-Collaborative Network-Opinion
Mining-Co-citation network

Total Hours 48 Hours

Essential : [ Text Book ]

1. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge
University Press,2011.

References Suggestive:
1. Ravi Kannan and John Hopcroft, “Foundations of Data Science”,2013.
2. Johannes Ledolter, “Data Mining and Business Analytics with R”, John Wiley,2013
3. GarethJames and Daniel Witten, Trevor Hastie, Robert Tibshirani, “An Introduction to
Statistical Learning with Applications in R”,Springer,2013.
4. Michel T. Longnecker,R.Lyman Ott, “An Introduction to Statistical Methods and Data
Analysis”,Cengage Learning 2008.
5. T.Hastie,R.Tibshirani,andJ.Friedman, “The elements of statistical learning :data
mining,inference, and prediction”,Springer,2009.
6. Matthew A.Russel, “Mining the Social web :Analyzing data from Facebook, Twitter,
Linkdln and Other Social Media Sites”, O’Reilly Media,2013.

Online Resources :
1.
2.
Teaching-
Learning Power Point Presentation
Process
Assessment
Methods Seminar, Case study

Signature of
Designed by Verified by
HoD

Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1
CO2

CO3

CO4

CO5

* 1 = Low ; 2 = Medium ; 3 = Strong

For Theory

Course Code 22SSP853D MODELLING AND SIMULATION L T P C

& Title 4 1 - 5
 Major / Minor / Trans Disciplinary Course

Pre-requisite Academic year 2022-23 onwards

Class IV M.Sc.(Software Systems) Semester

XIII
On completion of this course, student will be able to K level
CO1:
Course CO2:
Outcomes CO3 :
CO4 :
CO5 :

SYLLABUS

No. of
Module Contents
Hours

PRINCIPLE OF COMPUTER MODELLING AND SIMULATION :

Monte
Carlo simulation. Nature of computer modeling and simulation. Limitations of
simulation, areas of application.

SYSTEM AND ENVIRONMENT :

Components of a system - discrete and
continuous systems. Models of a system - A variety of modeling approaches.
I (4)

DATA-DRIVEN MODELS :
Empirical Models-Introduction - Linear Empirical
Model- Predictions-Linear Regression - Nonlinear One-Term Model - Multiterm
Models - Advanced Fitting with Computational Tools

II

III

IV
 V

Total Hours

Essential : [ Text Book ]

1.
Suggestive:
1.
References 2.
Online Resources :
1.
2.
Teaching-
Learning Select best from TLP given as reference
Process
Assessment
Methods Choose from Skill Innovative Tasks

Signature of
Designed by Verified by
HoD

Mapping

PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2 PSO3
1

CO1

CO2

CO3

CO4

CO5

* 1 = Low ; 2 = Medium ; 3 = Strong