ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH

Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.

Syllabus Structure (Admission Batch: 2023-24)

School/Department: School of Computer Sciences

Course: B. Tech. Programme:

Abbreviation used:

AC Audit course LC Laboratory Course PA Practical Assessment

PC Professional Core PR Project/ Practical/ Internship L Lecture
PE Professional Elective SE Seminar/ Expert Lecture/ Etc. T Tutorial
OE Open Elective IA* Internal Assessment P Practical
MC/BS/HS Mandatory/ Common Course EA End-Semester Assessment
ACC Advanced Competency Course
*
Internal Assessment Mark (40 marks) consists of (i) Mid Semester (20 marks), (ii) Quiz/ Assignment/Attendance (20 marks)

Minor in Data Science

Teaching
Sl. Subje Maximum Marks
Subject Subject Hours Cre
No ct Semester
Code Name dit Tota
. Type L T P IA EA PA
l
5th Data Structures, and
1 CS3261 Algorithms in Python
3 0 0 3 40 60 - 100
th
6 Introduction to Machine
2 CS3262 Learning
3 0 0 3 40 60 - 100
th
3 CS4261 7 Data Analytics with Python 3 0 0 3 40 60 - 100
4 CS4263 7th AI based Search Methods 3 0 0 3 40 60 - 100
5 CS4179 8th Reinforcement Learning 3 0 0 3 40 60 - 100
6th Data Structures, and
6 CS3581 Algorithms Lab
0 0 3 3 - - 100 100
th
7 CS4581 7 Data Analytics Lab 0 0 3 3 - - 100 100
Total 15 0 6 21 200 300 200 700
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

SUB_CODE: Data Structures and Algorithms in Python (3-0-0:3)

Prerequisites  Basic knowledge of Python programming (variables, loops, functions)

 Understanding of control structures and object-oriented programming.
 Familiarity with mathematical logic and basic problem-solving.

Course Outcomes:

CO1 Implement basic data structures like arrays, stacks, queues, linked lists in Python.
CO2 Apply suitable data structures for problem solving and algorithm development.
CO3 Analyze the time and space complexity of algorithms.
CO4 Design efficient algorithms for searching, sorting, and graph-based problems using
Python.

Detailed Syllabus

Module-I (8 Hours)
Introduction to Data Structures and Algorithms, Python Specific Data Structures: List,
Tuples, Set, Dictionaries, Comprehensions and its Types, Strings, slicing. Performance
Analysis: Space complexity, time complexity, asymptotic notation. Arrays: Overview, Types
of Arrays, Operations on Arrays, Stacks and Queues: representation and application. Linked
lists: Single linked lists, linked list representation of stacks and Queues. Operations on
polynomials, Double linked list, circular list.
Module-II ( 8 Hours)
Trees: binary trees, binary search trees, AVL trees, tree traversal techniques, Heaps: min-
heap, max-heap, heapify, priority queues using heaps, Graphs: representation (adjacency
list/matrix), traversal (BFS, DFS).
Module-III ( 7 Hours)
Divide and Conquer techniques, Greedy algorithms (e.g., Activity selection problem,
Fractional knapsack problem, Huffman codes), Dynamic programming (e.g., 0/1 Knapsack,
LCS, matrix chain multiplication).
Module-IV ( 7 Hours)
Searching algorithms: Linear and Binary Search, Sorting algorithms: Bubble, Insertion,
Selection, Merge Sort, Quick Sort, Hashing: hash functions, collision resolution strategies
(chaining, open addressing)

Text Books:

1. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, Data Structures and

Algorithms in Python, Wiley, 2013
2. Rance D. Necaise, Data Structures and Algorithms Using Python, Wiley, 2019
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

References Books:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in Python, Pearson
2. Kenneth A. Lambert, Fundamentals of Python: Data Structures, Cengage Learning,2019

CO-PO Mapping:

PO PO PO
PO1 PO2 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 4 5
CO1 3 2 2 1 2 0 0 0 0 1 0 0
CO2 3 3 3 2 2 0 0 0 1 1 0 1
CO3 3 2 3 2 1 0 0 0 0 1 0 2
CO4 3 3 3 3 2 0 0 0 1 2 0 2

(1:Low, 2:Medium, 3:High)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

SUB_CODE: Subject: Machine Learning (L-T-P:Credits)(3-0-0:3)

Prerequisites Mathematics: Linear algebra, probability, and statistics, eigenvalues,

eigenvectors, probability distributions, and Bayes' theorem.
Basic computer science principles, data structures, and algorithms

Course Outcomes:
CO1 Students will be able to understand the need for machine learning for various problem
solving
CO2 Students will be able to understand a variety algorithm and evaluate models
CO3 Students will be able to understand the features of machine learning to apply on real
world problems
CO4 Students will be able design as well as analyse artificial neural networks and deep
learning models

Detailed Syllabus

Module-I (8 Hours)

Introduction to Machine learning system: Types of machine learning techniques,

hypothesis space and inductive bias
Pre-processing:
Features: type, measuring the central tendency, dispersion and graphical representation (box
plot, scattered plot, and quantile plot), missing and noisy features, Anomaly identification
Dimensional Reduction Techniques: Principal Component Analysis (PCA) and Linear
Discriminant Analysis (LDA)
Module-II (10 Hours)

Supervised learning:
Classification: Decision Tree Induction, Classification by artificial neural network
(Perceptron, Gradient Descent Algorithm, Stochastic Gradient Descent Algorithm,
Backpropagation), Support Vector Machines, Bayes Classification Methods, Lazy Learning
vs eager learning, Metrics for Evaluating Classifier Performance
Module-III (7 Hours)

Regression Analysis: Linear regression and evaluating regression fit, Logistic regression
Unsupervised Learning:
Cluster Analysis: Partitioning Methods, Hierarchical Methods and kNN algorithm
Outlier Detection: Outliers and Outlier Analysis, Outlier Detection Methods

Module-IV (5 Hours)
Reinforcement Learning: Introduction to Reinforcement Learning key concepts (agent,
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

environment, reward, policy, value function), Learning Task, Learning Model for
Reinforcement – Q Learning, Application of Reinforcement Learning.

Text Books:
1. Machine Learning. Tom Mitchell. First Edition, McGraw-Hill, 1997.
2. EthemAlpaydin, Introduction to Machine Learning. MIT Press (MA), 2004.

References Books:
1.Baldi, P. and Brunak, S. (2002). Bioinformatics: A Machine Learning Approach.
Cambridge, MA: MIT Press.
2. Cohen, P.R. (1999). Empirical Methods in Artificial Intelligence. Cambridge, MA: MIT
Press.

CO-PO Mapping:

PO PO PO
PO1 PO2 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 4 5
CO1 3 2 2 1 2 1 1 1 1 1 1 2
CO2 3 3 2 2 3 1 1 1 1 2 1 2
CO3 3 3 3 2 3 1 1 1 1 1 1 2
CO4 3 2 3 2 3 2 2 1 2 2 1 2

(1: Low, 2: Medium, 3: High)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

SUB_CODE: Subject: Data Analytics Using Python ( L-T-P:Credits)(3-0-0:3)

Prerequisites Python programming, mathematics&statistics background, and basic data

handling concepts.

Course Outcomes:

CO1 Understand and apply core Python programming constructs including data types,
control structures, functions, and object-oriented programming to support data
analysis tasks.
CO2 Demonstrate the ability to manipulate, clean, transform, and analyze datasets using
Python libraries such as NumPy and Pandas, and extract data from diverse sources
including files, APIs, and databases.
CO3 Apply descriptive and inferential statistical methods to summarize data
characteristics, interpret probability distributions, and perform hypothesis testing for
data-driven decision-making.
CO4 Explain and implement the stages of the data analytics lifecycle from problem
definition through data preparation, modeling, evaluation, and deployment of insights.

Detailed Syllabus

Module-I (8 Hours)
Introduction to data analytics, Python Fundamentals: Variables, data types (numbers, strings,
lists, tuples, dictionaries, sets), control flow (if/else, loops), functions, modules, packages,
class, objects.
Module-II (7 Hours)
Data Manipulation and Analysis with Python Libraries:NumPy, Pandas (Creating and
manipulating Data Frames, data cleaning, filtering, grouping, and aggregation), Data
Acquisition (Reading data from various sources (CSV, JSON, databases, web APIs), Data
Cleaning and Transformation (Handling missing values, data type conversions, data
wrangling),
Statistical Analysis:Descriptive Statistics (Measures of central tendency (mean, median,
mode)), dispersion (variance, standard deviation), and distributions. Probability and
Distributions: Understanding probability concepts and common distributions (normal,
binomial, etc.)Hypothesis Testing: Performing t-tests, ANOVA, and other statistical tests.
Module-III (7 Hours)
Data Analytics Life cycle and Methodology: Business understanding, Data understanding,
Data Preparation, Modelling, Evaluation, communicating results and deployment, Data
exploration and preprocessing, Data Analytics- Theory and Methods: Measure and evaluation
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Module-IV (8 Hours)
Introduction to Machine Learning: Supervised and unsupervised learning:
Classification: Supervised learning techniques like Linear, logistic regression, Decision trees,
Naïve Bayes,Unsupervised learning: Association rules, clustering, Unstructured Data
Analytics, Technologies & tools, Text mining, Web miningetc.Opertionalizing an Analytics
project, Data Visualization Techniques, Creating final deliverables.

Text Books:
1. Allen, Downey. Think Python: How to Think Like a Computer Scientist
(Version 2.4. 0). Green Tea Press, 2015.
2. Moreira, J., Carvalho, A., & Horvath, T. A general introduction to data
analytics. John Wiley & Sons. 2018

References Books:
1. Machine Learning by Tom M. Mitchell
2. Kulkarni, Parag, Sarang Joshi, and Meta S. Brown. Big data analytics. PHI
Learning Pvt. Ltd., 2016.

CO-PO Mapping:

COs\
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
POs
CO1 3 2 1
CO2 3 3 2 2
CO3 3 2 3 2 2 1 1 2
CO4 2 2 2 2 3 1 2

(1:Low, 2:Medium, 3:High)

SUB_CODE: Subject: AI BASED SEARCH METHODS

Prerequisites BasicMathematics,DiscreteMathematics,ProgrammingLanguages,Algorithms
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Course Outcomes:

CO1 Develop a basic understanding of AI building blocks presented in intelligent

agents.
CO2 Choose an appropriate problem solving method and knowledge representation
technique.
CO3 Design models for reasoning with uncertainty as well as the use of unreliable
information.
CO4 Design and develop the AI applications in real world scenario.

Detailed Syllabus

Module-I ( 7 Hours)
Introduction to Artificial Intelligence: History of AI, Can Machines Think?, Turing Test,
Winograd Schema Challenge, Philosophy of Mind, Language and Thought, Dartmouth
Conference, The Chess Saga, Epiphenomena.
State Space Search: Depth First Search, Breadth First Search, Depth First Iterative
Deepening, Problem Representation, Search Strategies.
Heuristic Search:Best First Search, Hill Climbing, Solution Space, Traveling Salesman
Problem (TSP), Escaping Local Optima, Stochastic Local Search.

Module-II ( 7 Hours)
Logical Agents: Propositional and first order predicate Logic-Knowledge representation
Basic Probability Notation, Axioms of Probability and Bayes’ rule. Probabilistic Reasoning
techniques, Introduction to fuzzy logic.
Dimensional reduction:Reduction Techniques, Principal Component analysis(PCA).

Module-III ( 8 Hours)
Population-Based Methods:Genetic Algorithms, SAT, TSP, Emergent Systems, Ant Colony
Optimization.
Finding Optimal Paths:Branch & Bound, A* Algorithm, Admissibility of A*, Informed
Heuristic Functions, Weighted A*, Iterative Deepening A* (IDA*), Recursive Best-First
Search (RBFS), Monotone Condition.
Game Playing:Game Theory, Board Games, Game Trees, Minimax Algorithm, Alpha-Beta
Pruning, SSS* Algorithm.

Module-IV (8Hours)
Automated Planning:Domain Independent Planning, Blocks World, Forward and Backward
Search, Goal Stack Planning, Plan Space Planning.
Problem Decomposition and Expert Systems:Means-Ends Analysis, Graphplan Algorithm,
AO* Algorithm, Rule-Based Expert Systems, Production Systems,
Constraint Processing and Logical Deduction:Constraint Satisfaction Problems (CSPs),
Consistency-Based Diagnosis, Backtracking Algorithm, Arc Consistency, Forward Checking,
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Logic in AI, Soundness and Completeness, First-Order Logic, Forward Chaining, Backward
Chaining.

Text Books:
1. Elaine Rich, Kevin Knight, &Shivashankar B Nair, Artificial Intelligence,
McGraw Hill,3rded.,2009
2. M.TimJones.”ArtificialIntelligence:a Systems Approach(Computer
Science)”,Jones and Bartlett publishers,Inc.; 1st edition,2008
3. Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach,
2ndedition.

References Books:
1. Introduction to Artificial Intelligence & Expert Systems, Dan W
Patterson,PHI.,2010
2. S Kaushik, Artificial Intelligence, Cengage Learning, 1sted.2011

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3 2 3 1 1 2 3 2 2 1 3
CO2 3 2 3 1 1 2 2 2 3 3 1 2
CO3 2 1 2 1 1 2 2 2 3 3 2 3
CO4 1 3 3 2 1 1 2 2 3 1 1 2

SUB_CODE: Reinforcement Learning (3-0-0:3)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Prerequisites Probability, Linear Algebra, Machine Learning

Course Outcomes:

CO1 Understand the theoretical foundations of reinforcement learning including MDPs and
policies
CO2 Apply dynamic programming and model-free algorithms to solve RL problems.
CO3 Implement and evaluate reinforcement learning algorithms using modern tools (e.g.,
OpenAI Gym, TensorFlow/PyTorch).
CO4 Analyse and interpret the performance of RL algorithms in practical applications.

Detailed Syllabus

Module-I Foundations of Reinforcement Learning (7 Hours)

Introduction to RL: Scope and relevance, Supervised vs Unsupervised vs Reinforcement
Learning, Components: Agent, Environment, State, Action, Reward, Markov Decision
Processes (MDP), Value functions, Bellman equations, Policy, Optimality criteria, Dynamic
Programming, Policy Evaluation, Policy Iteration, Value Iteration
(8 Hours)
Module-II Model-free Learning
Monte Carlo Methods, First-visit and Every-visit MC, Temporal Difference (TD) Learning,
TD(0), SARSA, Q-Learning, Exploration vs Exploitation, ε-greedy, Softmax, Upper
Confidence Bound, Eligibility Traces, n-step returns, TD(λ)

Module-III Neural Approaches to Reinforcement Learning (8 Hours)

Function Approximation in RL, Linear and Non-linear approximators, Deep Q-Networks
(DQN), Experience Replay, Target Networks

Module-IV Deep Reinforcement Learning and Applications(7 Hours)

Policy Gradient Methods, REINFORCE, Actor-Critic, Advanced topics: Proximal Policy
Optimization (PPO), DDPG (overview only), Applications in Robotics, Games (Atari,
AlphaGo), and Autonomous Systems
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Text Books:
1. Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, 2nd
Edition, MIT Press, 2018.
2. CsabaSzepesvári, Algorithms for Reinforcement Learning, Morgan & Claypool, 2010.

Reference Books:
1. Ian Goodfellow, YoshuaBengio, and Aaron Courville, Deep Learning, MIT Press, 2016.
2. Alexander L. Strehl et al., Reinforcement Learning: Theory and Algorithms, Springer, 2020.
3. Marco Wiering and Martijn van Otterlo, Reinforcement Learning: State of the Art, Springer,
2012.
4. David Silver, Reinforcement Learning Course Slides (UCL), [Online Resource].

CO-PO Mapping:

PO PO PO
PO1 PO2 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 4 5
CO1 3 2 1 1 1 0 0 0 0 1 0 1
CO2 3 3 2 2 2 0 0 0 0 1 0 1
CO3 2 2 3 3 3 0 0 0 2 2 1 2
CO4 3 3 3 2 2 1 0 0 1 2 1 2

(1:Low, 2:Medium, 3:High)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

SUB_CODE: Data Structures and Algorithms Laboratory (0-0-3:1.5)

Prerequisites  Knowledge of basic Python programming

 Understanding of control structures, functions, and recursion
 Familiarity with object-oriented programming principles
 Basic mathematical and logical reasoning

Course Outcomes:

CO1 Implement linear data structures such as arrays, stacks, queues, and linked lists using
Python.
CO2 Design and apply non-linear data structures such as trees and graphs.
CO3 Analyze and evaluate algorithm performance using asymptotic notations.
CO4 Apply recursive, divide & conquer, greedy, and dynamic programming strategies to
solve problems in Python.

Detailed Syllabus

1. Implement Stack operations (Push, Pop, Peek) using Python lists.

2. Implement Queue and Circular Queue using Python.
3. Create and perform operations on Singly Linked List.
4. Create and perform operations on Doubly Linked List.
5. Implement Binary Tree and perform Preorder, Inorder, and Postorder Traversals.
6. Implement Binary Search Tree (BST) with insert and delete operations.
7. Implement Graph traversal using BFS and DFS.
8. Implement and compare Bubble Sort, Insertion Sort, Merge Sort, and Quick Sort.
9. Write a recursive program to solve Tower of Hanoi and Fibonacci series.
10. Implement 0/1 Knapsack or Longest Common Subsequence using Dynamic
Programming.

Text Books:
1. Rance D. Necaise, Data Structures and Algorithms Using Python, Wiley, 2019
2. Kenneth A. Lambert, Fundamentals of Python: Data Structures, Cengage Learning, 2019

Reference Books:
1. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, Data Structures and
Algorithms in Python, Wiley, 2013
2. Seymour Lipschutz, Data Structures with Python, McGraw-Hill
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1 2 0 0 0 0 1 0 0
CO2 3 3 3 2 2 0 0 0 1 1 0 1
CO3 3 2 3 2 1 0 0 0 0 1 0 2
CO4 3 3 3 3 2 0 0 0 1 2 0 2
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

SUB_CODE: SUBJECT: Data Analytics Laboratory (0-0-3:1.5)

Prerequisites Basic programming knowledge, Data handling concepts, Familiarity with

tools, python syntax and indentation rules
Course Outcomes:

CO1 To impart hands-on experience in Python programming fundamentals including data

types, control structures, functions, and object-oriented concepts for data analysis.
CO2 To enable students to manipulate, clean, and transform data using Python libraries such
as NumPy and Pandas.
CO3 To develop the ability to acquire data from various sources and apply statistical
methods for exploratory and inferential analysis.
CO4 To introduce students to practical applications of machine learning techniques like
classification and clustering using real-world datasets.

Detailed Syllabus

1. Programs using Python variables, data types, conditional statements (if-else) and
loops (for, while).
2. Functions and OOP in Python: Implement user-defined functions, use built-in modules, and
create classes/objects with constructors and methods.
3. NumPy for Numerical Computing: Perform array creation, indexing, slicing, mathematical
operations, and reshaping using NumPy
4. Load CSV files into DataFrames, clean data (handle missing values), filter, sort, and
group the data.
5. Data Transformation and Wrangling: Rename columns, change data types,
merge/join DataFrames, and reshape data using melt/pivot.
6. Data Acquisition from Various Sources: Read data from CSV, JSON files, SQL
databases, and web APIs (using requests or pandas.read_json).
7. Descriptive Statistics and Visualization: Compute mean, median, mode, std.
deviation, and plot histograms, boxplots, and scatterplots using Matplotlib/Seaborn.
8. Hypothesis Testing with Python: Conduct t-tests, ANOVA, and chi-square tests using
scipy.stats or statsmodels.
9. Supervised Machine Learning - Classification: Train and evaluate a Decision Tree or
Logistic Regression model using scikit-learn on a real dataset.
10. Reporting and Data Visualization: Create dashboards/charts in Jupyter Notebook for
communicating results from a case study dataset.

Text Books:
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, MahalaxmiVihar,Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

1. Stefanie Molin, “Hands-On Data Analysis with Pandas”, Publisher: Packt Publishing,
Edition: 2nd Edition (2021).
2. Peter Bruce, Andrew Bruce, Peter Gedeck, "Practical Statistics for Data Scientists ",
Publisher: O’Reilly Media Edition: 2nd Edition (2020)

Reference Books:
1. Wes McKinney, "Python for Data Analysis" , Publisher: O'Reilly Media Edition: 2nd
Edition (2017)
2. Jake VanderPlas,"Python Data Science Handbook” , Publisher: O’Reilly Media Edition:
1st Edition (2016)

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 1
CO2 3 3 3 2 2 1 2
CO3 3 3 3 2 2 1 2 2
CO4 3 3 3 3 3 2 1 1 3