COURSE HANDBOOK

ON
ALGORITHM DESIGN-1 (CSE3131)

(B.Tech. 3rd Semester)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Faculty of Engineering and Technology,

Institute of Technical Education and Research
SIKSHA ‘O’ ANUSANDHAN (DEEMED TO BE) UNIVERSITY
Bhubaneswar, Odisha, India
(SEPTEMBER 2022)

1|Page
 TABLE OF CONTENTS
Contents Page Number
Course Details 1

Course Outcomes (COs) and Mapping Course Outcomes with Program

2
Outcomes (POs)

Grading Pattern and Components of Evaluation 2

Tentative Lesson Plan 3

Assessment Rubrics for the Course 4

Course Related Surveys 6
Appendix I – Vision 9
Appendix II – Mission 9
Appendix III – Program Educational Objectives 9
Appendix IV – Program Specific Outcome 10

Appendix V – Programme Outcomes 10

Appendix VI – Bloom’s Taxonomy 12
Appendix VII – Course Assessment (For Grading pattern 1) 13

Appendix VIII – Attainment of COs, POs, & PSOs 14

Appendix IX – Grading System 15
Appendix X – Relative Grading 15

Appendix XI – Graduation CGPA Requirements 16

Appendix XII – Minimum Requirements for A Passing Grade 16
Appendix XIII – Appearing The (Deemed to be University) Exam 17

2|Page
 PREFACE
This course handbook contains all the necessary details of the concerned subject, i.e., ALGORITHM
DESIGN-1 (CSE3131). It is designed in order keep up with the Outcome Based Education (OBE).
The handbook provides necessary details about the Grading Pattern, Grading System, Course
Assessment, Assessment Rubrics, the Outcomes (POs, PEOs, PSOs), Bloom’s Taxonomy,
Graduation CGPA requirements, Minimum Requirements for Passing Grade and Appearing the
(Deemed to be University) Examination.

3|Page
1. Course Details

Name of the Course : ALGORITHM DESIGN-1

Course Code : CSE3131

Course Credits :4

Grading Pattern :1

Branch and Semester : Computer Science and Engineering,

3rd Semester B.Tech.

Name of the Instructor: Suvadip Hazra

Contact Details : 9836075575

Email : [email protected]

SUBJECT
SUBJECT NAME CREDIT GRADING PATTERN
CODE

CSE3131 ALGORITHM DESIGN-1 4 1

Text Book:
 Introduction to algorithm design
 Algorithm correctness Algorithm Design by Jon
 Algorithm analysis – Kleinberg and Eva Tardos,
 Sorting and Searching algorithms Pearson Publication
 Graphs and related algorithms
 Greedy approach Course Format:
 Divide-and-conquer
4 Credits;
 Dynamic Programming 3 Classes/Week, 1 hr/Class;
1 Problem Solving Session/Week, 2 hrs/Problem
Solving Session

4|Page
2. Course Outcomes (COs) and Mapping Course Outcomes with
Program Outcomes (POs)

Course Outcomes Program

Outcomes

to apply knowledge of computing and mathematics to algorithm design;

(i) to argue/prove correctness of algorithms (both recursive and iterative)
CO1 using inductive proofs and invariants; PO1, PO2
(ii) to analyze worst-case running times of algorithms (both recursive and
iterative) using asymptotic analysis;

CO2 to understand various types and aspects of sorting and searching algorithms. PO1

to explain the major graph algorithms and their analyses. Employ graphs to
CO3 PO2, PO3
model engineering problems, when appropriate.

to describe the greedy paradigm and explain when an algorithmic design

CO4 situation calls for it. Recite algorithms that employ this paradigm. Synthesize PO2, PO3, PO4
greedy algorithms. Derive and describe the performance of greedy algorithms.

to describe the divide-and-conquer paradigm and explain when an

algorithmic design situation calls for it. Recite algorithms that employ this
CO5 PO2, PO3, PO4
paradigm. Synthesize divide-and-conquer algorithms. Derive and solve
recurrences describing the performance of divide-and-conquer algorithms.

to describe the dynamic programming paradigm and explain when an

algorithmic design situation calls for it. Recite algorithms that employ this
CO6 PO2, PO3, PO4
paradigm. Synthesize dynamic programming algorithms. Derive and solve
recurrences describing the performance of dynamic programming algorithms.

*Refer Appendix for list of Pos

5|Page
 3. Course Articulation Matrix

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 0 0 0 0 0 0 0 0 0 0 3 0
CO2 2 0 0 0 0 0 0 0 0 0 0 0 0 0
CO3 0 2 1 0 0 0 0 0 0 0 0 0 3 0
CO4 0 2 2 2 0 0 0 0 0 0 0 0 3 0
CO5 0 2 2 2 0 0 0 0 0 0 0 0 2 3
CO6 0 2 2 2 0 0 0 0 0 0 0 0 0 3

*0: No correlation, 1: Slight (Low), 2: Moderate, 3: Substantial (High)

*Refer Appendix for list of POs

4. Justifications of Mapping
Justification about the correlation between COs Vs POs & PSOs mentioned in the Articulation Matrix.
Please describe the justifications.

5. Grading Pattern and Components of Evaluation

The Subject, ALGORITHM DESIGN-1 (CSE3131), has 4 Credits, and belongs to Grading Pattern 1.
The First Grading Pattern will be for those Subjects which are of 4 credits and which combinations
of theory and laboratory components are. The breakdown required for the calculation of the Numeric
Score (out of 100) for Grading Pattern 1 is given below.

ATTENDANCE 5
MAJOR LAB / SESSION ASSIGNMENTS / QUIZZES 10
MINOR ASSIGNMENTS 10
MID TERM 15
TOTAL INTERNAL 40

IN LAB EXAM 15
THEORY EXAM 45
TOTAL EXTERNAL 60

6|Page
 6. Tentative Lesson Plan
Contact
Topics To Be Covered Remarks(if any) CO PO
Hour
Week # 1:
Course Overview
Introduction to the course/subject: Program Outcomes; Course Outcomes;
L 01 with OBE
Lesson plan; Teaching methodology; Evaluation strategy etc.
awareness
Introduction to Algorithm Design: Importance of problem solving using
L 02 algorithms; Characteristic features of an algorithm(input, output, finiteness,
definiteness, effectiveness, correctness, efficiency);
Introduction to Algorithm Design: Expressing algorithms (pseudocode);
L 03
Basic aspects of algorithms (design and analysis)
To be referred
PSS 01 Stable Matching Problem; Five Representative Problems from T1(1.1, 1.2)

Week # 2:
Algorithm Correctness: using counter examples, loop invariants, induction
L 04
method
To be referred
Algorithm Correctness: using counter examples, loop invariants, induction CO1
L 05 from R1
method
Algorithm Correctness: using counter examples, loop invariants, induction
L 06
method
To be referred
PSS 02 Discussion on correctness of various recursive and iterative algorithms CO1
from R1,R2

Week # 3:
Introduction to Algorithm Design: Time and space complexity of an
L 07
algorithm To be referred
Basics of Algorithm Analysis: Asymptotic notations; Summations; from T1(Chapter CO1
L 08
Logarithms 2)
Basics of Algorithm Analysis: Asymptotic notations; Summations;
L 09
Logarithms (contd..)

To be referred
CO1
PSS 03 Discussion on exercise problems from T1, R2

Week # 4:
L 10 Basics of Algorithm Analysis: Recurrences To be referred
CO1
L 11 Basics of Algorithm Analysis: Recurrences (contd..) from R2
L 12 Basics of Algorithm Analysis: Recurrences (contd..)
To be referred
CO1
PSS 04 Discussion on exercise problems from R1, R2

Week # 5:
L 13 Sorting and Searching: Heap and Heap sort To be referred
CO2
from R2
L 14 Sorting and Searching: Heap and Heap sort
Sorting and Searching: External and internal sorting; In-place sorting; Stable CO2
L 15
sorting; Special cases of sorting and searching etc.
Discussion on numerical and analytical questions on sorting(bubble, CO2
PSS 05
insertion, selection, radix etc.) and searching (linear, binary)

7|Page
Week # 6:
L 16 Graph: Basic definitions, applications and representations To be referred
L 17 Graph: Basic definitions, applications and representations (contd..) from T1(Chapter
CO3
3) and
L 18 Graph: Graph connectivity and graph traversal (BFS, DFS) R2(Chapter 22)

Discussion on applications and variants of graph based algorithms already CO3

PSS 06
discussed
Week # 7:
L 19 Graph: Graph connectivity and graph traversal (BFS, DFS) To be referred
L 20 Graph: Testing bipartiteness – an application of BFS from T1(Chapter
CO3
3) and
Graph: Connectivity in directed graph; Directed-Acyclic-Graph and
L 21 R2(Chapter 22)
Topological ordering
Discussion on applications and variants of graph based algorithms already CO3
PSS 07
discussed
Week # 8:
Graph: Connectivity in directed graph; Directed-Acyclic-Graph and To be referred
L 22
Topological ordering from T1(Chapter
L 23 Graph: MST using Kruskal's algorithm—the union-find data structure 3) and CO3
R2(Chapter 22,
Graph: MST using Kruskal's algorithm—the union-find data structure 23)
L 24
(contd..)

Discussion on applications and variants of graph based algorithms already CO3

PSS 08
discussed
Week # 9:
L 25 Graph: MST using Prim's algorithm To be referred
L 26 Graph: Shortest path problem (Dijkstra' algorithm) from T1(Chapter
3) and CO3
R2(Chapter 23,
L 27 Graph: Shortest path problem (Dijkstra' algorithm)
24)

Discussion on applications and variants of graph based algorithms already CO3

PSS 09
discussed

Week # 10:
L 28 Greedy Method: Interval Scheduling: The Greedy Algorithm Stays Ahead
To be referred
Greedy Method: Scheduling to Minimize Lateness: An Exchange Argument
L 29 from T1(Chapter CO4
4)
Greedy Method: Optimal Caching: A More Complex Exchange Argument
L 30

CO4
PSS 10 Discussion on variants of greedy method based problems already discussed

Week # 11:
Greedy Method: Huffman Codes and Data Compression
L 31 To be referred
from T1(Chapter
Greedy Method: Huffman Codes and Data Compression (contd..) CO4
L 32 4) and
Greedy Method: Clustering R2(Chapter 16)
L 33

CO4
PSS 11 Discussion on variants of greedy method based problems already discussed

Week # 12:
L 34 Divide and Conquer: Control abstraction; Merge sort

8|Page
 L 35 Divide and Conquer: Counting inversions To be referred
from T1(Chapter CO5
L 36 Divide and Conquer: Quick sort 5)

CO5
PSS 12 Discussion on variants of divide and conquer based problems already discussed
Week # 13:
L 37 Divide and Conquer: Closest Pair of Points To be referred
L 38 Divide and Conquer: Karatsuba algorithm for fast integer multiplication from T1(Chapter CO5
5)
L 39 Divide and Conquer: Convolutions and FFT
CO5
PSS 13 Discussion on variants of divide and conquer based problems already discussed
Week # 14:
L 40 Dynamic Programming: Control abstraction; Recursion vs. Memorization
To be referred
Dynamic Programming: Generating nth Fibonacci number
L 41 from T1(Chapter CO6
6)
Dynamic Programming: Computing binomial coefficient
L 42
Discussion on variants of dynamic programming based problems already CO6
PSS 14
discussed
Week # 15:
L 43 Dynamic Programming: Matrix Chain Multiplication
To be referred
Dynamic Programming: String Matching using Edit Distance
L 44 from T1(Chapter CO6
6)
Dynamic Programming: Longest Common Subsequence
L 45

Discussion on variants of dynamic programming based problems already CO6

PSS 15
discussed
Week # 16:
L 46 Revision class

Revision class
L 47
Revision class
L 48

PSS 16 Revision class

9|Page
7. Assessment Rubric for the Course
Method: Assignments, Lab Report and Mid-Semester and End-Semester Exam
Outcomes Assessed:
PO1 – Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.
PO2 – Problem analysis: Identify, formulate, review research literature, and analyse complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
PO3 – Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations.
PO4 – Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.

PSO1- The ability to understand and develop computer programs in the areas related to business
intelligence, big data analytics, web design and networking for efficient design of computer-based
system of varying complexity.
PSO2- The ability to apply standard practices and strategy in software project development using open
ended programming environments to deliver a quality product for business success.

Mid-Semester and End-Semester Examination Rubrics

Performance High (2 Marks) Medium (1-1.5 Marks) Low (0.5 Marks)
Incomplete or poor
Minor errors in definition,
Theoretical Properly able to define, definition,
representation and
representation of represent, and interpret representation and
interpretation of physical
concepts the physical significance. interpretation of
significance.
physical significance.
Neat, clean and proper Sketches and Graphs are The pictures are
Pictorial
sketches, graphs with drawn but interpretation of unclear/not labelled and
representation of
proper labelling and significance is not done or the interpretation is
ideas
interpretation. labelling is missing. inappropriate.

10 | P a g e
 Solving Selection of appropriate
Erroneous selection of
mathematical concepts to formulate. Able to select correct
concepts, able to
and/or design Ability to solve concepts, formulate,
represent and formulate
problems and problems, represent them represent and solve, but
only, but error in
interpreting the pictorially and interpret error in interpreting
solving.
results the results.

Rubrics for Lab Component

Performance High (9-10 Marks) Medium (7-8 Marks) Low (4-6 Marks)
Student has problems
with both the graphs
Student demonstrates an Student has a basic
and the answers.
accurate understanding knowledge of content, but
Student appears to have
of the lab objectives and may lack some
not fully grasped the lab
concepts. Questions are understanding of the same
content, and the
Lab Experiments answered completely and concepts. Questions are
graphs(s) possess
and Report correctly. Graphs are answered fairly well
multiple errors. Student
neat, creative and include and/or graphs could have
turns in lab report late
complete titles and been done more neatly,
or the report is so
accurate units. Errors, if accurately or with more
incomplete and/or so
any, are minimal. complete information.
inaccurate that it is
unacceptable.
Student demonstrates an
accurate understanding
of the lab objectives and Student arrives on time to The unpreparedness of
concepts. The student lab, but maybe student makes it
can correctly answer unprepared. Answers to impossible to fully
questions and if questions are basic and participate. If able to
Lab Participation
appropriate, can explain superficial suggesting that participate, student has
and Presentation
concepts to fellow concepts are not fully difficulty explaining
classmates. Student is grasped. The student has key lab concepts. The
eager to participate and missed few (2-3) lab student has missed
assist when needed. The classes. many (5-6) lab classes.
student has attended all
labs.
The student is able to
The student doesn’t
answer all the asked Is able to answer some of
understand the concepts
questions pleasingly, and the asked questions
Viva-voice and hence answers the
explains all the concepts satisfactorily, and explains
questions but the logic
reasonably well, and in the concepts well.
or is concept
details.

11 | P a g e
 explanation provided is
improper.

Rubrics for Quiz

Performance High (9-10 Marks) Medium (7-8 Marks) Low (4-6 Marks)
The student has
The student has
answered all the The student has answered
answered some of the
questions correctly most of the questions
Short/Long Answer questions correctly,
and depicted them in a correctly and depicted
Type Questions though, with improper
neat and clean manner, them in a satisfactory
/erroneous/incomplete
with appropriate manner.
justification of the same.
explanation.
The student has
The student has attended The student has attended
attended all the
MCQ Type most of the quizzes and some of the quizzes and
quizzes and attempted
Questions attempted most of the answers few of the
all the questions
questions correctly. questions correctly.
correctly.

Rubrics for Assignments

Performance High (9-10 Marks) Medium (7-8 Marks) Low (4-6 Marks)
Completed and
Completed 60% of the
submitted all
Completed and submitted assignments. The
assignments within
above 80% of the submissions were made
Completion and deadline. The answers
assignments. Submission after repeated
Submission of are depicted correctly,
is by the due date. The reminders, and in the
Assignments completely and in a
answers were fairly extended deadline
neat and clean manner.
represented. period. The answers
The answers maybe
were fairly represented.
unique/innovative.
Rubrics for Mini Project
Medium (7-8
Performance High (9-10 Marks) Low (4-6 Marks)
Marks)
Problem statement is
Articulate problem Problem statement is Problem statement and
clear and objectives
statements and identify clear and objectives are objectives are not
are not in line with
objectives completely defined. clear.
problem statement.
Identify engineering Engineering systems are Engineering systems Engineering systems
systems, variables, and identified. Variables, and are clear. Variables, are identified but not

12 | P a g e
 parameters to solve the parameters to solve the and parameters to clear. Variables, and
problems problems are completely solve the problems parameters to solve the
defined. are not defined. problems are not
defined
Apply formal idea
Able to use the tool
generation tools to Able to generate Able to identify but not
but not able to
develop multiple engineering designs with able to use it
generate engineering
engineering design justification. effectively.
designs.
solutions
Build models/
Able to use the tool Able to choose the tool
prototypes to develop Able to generate and
but not able to but not able to use it
diverse set of design justify the best solution.
generate alternatives. effectively.
solutions
Generate information Able to follow testing
Able to apply Able to identify but not
through appropriate tests procedures but not
information for the able to follow testing
to improve or revise able to collect
improvement. procedure.
design information.
Analyze data for trends
Able to analyze data Able to understand but
and correlations, stating Able to identify errors
but not able to not able to analyze
possible errors and and limitations.
correlate them. data.
limitations
Present results as a Contribution from an
team, with smooth individual to a team is Contributions from an Contributions from an
integration of good and results in an individual to a team is individual to a team is
contributions from all integrated team moderate. minimal.
individual efforts. presentation.
Note – For specific assessments, specific rubrics may be followed.

13 | P a g e
8. Course Related Surveys

Pre-requisite Survey: The objective of this survey is to know the basic understanding and different
skills relevant to the subject, i.e., ALGORITHM DESIGN-1 (CSE3131). Please respond to the questions
by clicking any one of the options against each of the following questions.

1. Ability to apply theoretical knowledge in day-to-day life (PO3, PO7).

(a) Low Understanding (b) Medium (c) Adequate/High

2. Multidisciplinary skills and ability to work in a team (PO11).

(a) Low Understanding (b) Medium (c) Adequate/High

3. Communication and project management skills (PO10, PO11).

(a) Low Understanding (b) Medium (c) Adequate/High

4. Ability to solve numericals and to plot graphs (PO1, PO2).

(a) Low Understanding (b) Medium (c) Adequate/High

5. Coding/Pseudocoding skills (PO5).

(a) Low Understanding (b) Medium (c) Adequate/High

6. Basic knowledge about the method of induction (PO1).

(a) Low Understanding (b) Medium (c) Adequate/High

7. Understanding of basic principles of iteration and recursion (PO1).

(a) Low Understanding (b) Medium (c) Adequate/High

8. Knowledge of algorithm based problem-solving processes (PO1).

(a) Low Understanding (b) Medium (c) Adequate/High

9. Understanding of basics of asymptotic notations (PO1).

(a) Low Understanding (b) Medium (c) Adequate/High

10. Knowledge about the principles of sorting and searching (PO1).

(a) Low Understanding (b) Medium (c) Adequate/High

Interim Course Progress Survey: The objective of this survey is to know the students’ progress in
basic understanding and attaining different outcomes relevant to the subject, i.e., ALGORITHM

14 | P a g e
DESIGN-1 (CSE3131). Please respond to the questions by clicking any one of the options against each
of the following questions. The outputs will be shared with the respective Faculty Advisors for further
necessary actions.

Course End Survey: The objective of this survey is to know the attainment of the outcomes relevant
to the subject, i.e., ALGORITHM DESIGN-1 (CSE3131). Please respond to the questions by clicking
any one of the options against each of the given questions.

APPENDIX I – VISION
The Siksha ‘O’ Anusandhan will be a leading institution of higher learning in its chosen areas of
concentration, preparing future generations through quality teaching and innovative research and will
emerge as a comprehensive and socially inclusive University in the country for professional
advancements in related disciplines.

APPENDIX II – MISSION
 Educate students to become responsible, enlightened, and productive citizens;
 Conduct scholarship and promote entrepreneurship that improve the human condition;
 Serve business, education, government, health care systems, and community; and
 Enhance the cultural environment of the region.

APPENDIX III – PROGRAM EDUCATIONAL OBJECTIVES (PEO)

Our Graduates will have successful professional careers in industry, government, academia
1
or non-profit organisations.

Our Graduates will effectively lead, work and communicate in multidisciplinary teams and
2
apply sound engineering principles and design methodology to solve societal problems.

Our Graduates will maintain currency in their chosen field through higher study, through
3 organizational participation and through participation in professional developmental
activities.

15 | P a g e
 APPENDIX IV – PROGRAM SPECIFIC OUTCOMES (PSO)
The ability to understand and develop computer programs in the areas related to business
PSO1 intelligence, big data analytics, web design and networking for efficient design of
computer-based system of varying complexity.

The ability to apply standard practices and strategy in software project development using
PSO2
open ended programming environments to deliver a quality product for business success.

APPENDIX V – PROGRAM OUTCOMES (PO)

POs Description
Engineering knowledge: Apply the knowledge of mathematics, science, engineering
PO1 fundamentals, and an engineering specialization to the solution of complex engineering
problems.

Problem analysis: Identify, formulate, review research literature, and analyse complex
PO2 engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.

Design/development of solutions: Design solutions for complex engineering problems

and design system components or processes that meet the specified needs with appropriate
PO3
consideration for the public health and safety, and the cultural, societal, and
environmental considerations.

Conduct investigations of complex problems: Use research-based knowledge and

PO4 research methods including design of experiments, analysis and interpretation of data, and
synthesis of the information to provide valid conclusions.

Modern tool usage: Create, select, and apply appropriate techniques, resources, and
PO5 modern engineering and IT tools including prediction and modelling to complex
engineering activities with an understanding of the limitations.

The engineer and society: Apply reasoning informed by the contextual knowledge to
PO6 assess societal, health, safety, legal and cultural issues, and the consequent responsibilities
relevant to the professional engineering practice.

16 | P a g e
 Environment and sustainability: Understand the impact of the professional engineering
PO7 solutions in societal and environmental contexts, and demonstrate the knowledge of, and
need for sustainable development.

Ethics: Apply ethical principles and commit to professional ethics and responsibilities
PO8
and norms of the engineering practice.

Individual and teamwork: Function effectively as an individual, and as a member or

PO9
leader in diverse teams, and in multidisciplinary settings.

Communication: Communicate effectively on complex engineering activities with

the engineering community and with society at large, such as, being able to comprehend
PO10
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.

Project management and finance: Demonstrate knowledge and understanding of the

PO11 engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.

Life-long learning: Recognize the need for and have the preparation and ability to engage
PO12
in independent and life-long learning in the broadest context of technological change.

17 | P a g e
 APPENDIX VI – BLOOM’S TAXONOMY

In this subject, Levels 1–4 of Bloom’s Taxonomy, i.e., Remembering–Analysing are covered.

18 | P a g e
 APPENDIX VII – COURSE ASSESSMENT
(FOR GRADING PATTERN 1)

Course
Assessment

Direct Assessment Indirect

(80) Assessment
(20)

Internal (40%) External (60%)

Course End
Survey with
Respect to All
Mid Assignment/ End Lab/Analysis/
Attendance 6 COs of a
Semester Quiz/Mini- Semester Mini-Project
(5) Subject
(15) Project (20) (45) (15)

Attainment Levels – Low (1), Medium (2), High (3)

19 | P a g e
APPENDIX VIII – ATTAINMENT OF COs, POs, & PSOs

20 | P a g e
 APPENDIX IX – GRADING SYSTEM

Performance Letter grade Grade Point Per Credit

Outstanding O 10

Accomplished A 9.5

Impressive B 8.5

Encouraging C 7.5

Acceptable D 6.5

Must do better E 5.5

Fail F 0

PERCENTAGE EQUIVALENCE CONVERSION FOR CGPA:

Percentage of Marks = CGPA Multiplied by 10

APPENDIX X – 9.1.2 RELATIVE GRADING

LETTER GRADE
STUDENTS RANGE
GRADE POINT

O Top 5% 10

A Next 10% 9.5

B Next 20% 8.5

C Next 30% 7.5

D Next 20% 6.5

E Remaining Students having Numeric Score >= 40 5.5

F Numeric Score < 40 0

The minimum possible cutoff used for “E” grade is 40 (Internal + External), i.e., if the marks obtained
are less than 40 (Internal + External) then the student won't be given an "E" grade (or above) in a

21 | P a g e
particular instance of the Subject irrespective of value of cutoff for “E” grade.

The Relative Grading System will only be applicable for those subjects which follow Grading Patterns 1,
2, and 6. For Relative grading to be applicable, the number of students in the subject will need to be at
least 12. Absolute Grading will be applicable otherwise.

APPENDIX XI – 10. GRADUATION CGPA REQUIREMENTS

The Minimum Cumulative Grade Point Average required for Graduation is 6.0, i.e., a student can only
be considered for graduation if and only if his/her Cumulative Grade Point Average (after complying
with all the requirements of the (Deemed to be University) and the Constituent College required for
graduation) is greater than or equal to 6.0 (six point zero).

APPENDIX XII – 12. MINIMUM REQUIREMENTS FOR A

PASSING GRADE

The Minimum Attendance and Numeric Score Requirements for a passing grade at Institute of
Technical Education and Research (ITER), Siksha ‘O’ Anusandhan (Deemed to be University) which
will be followed from admission year 2018-2019.

NUMERIC SCORE REQUIREMENTS

INTERNAL 16

EXTERNAL 24

TOTAL 40

ATTENDANCE REQUIREMENTS
ATTENDANCE 75%

22 | P a g e
 APPENDIX XIII – 15. APPEARING THE (DEEMED TO
BE UNIVERSITY) EXAM
The Minimum Numeric Score and Attendance Requirements forappearing the External Exam of a
subject are as mentioned below.

NUMERIC SCORE REQUIREMENTS (For External Exam)

INTERNAL COMPONENT 16

ATTENDANCE REQUIREMENTS (For External Exam)

ATTENDANCE 75%

23 | P a g e