1. Format No. QSP/7.1/01.F01 (A)
Issue No.04 Rev. No 3 Dated: April 18, 2012
UNIVERSITY OF PETROLEUM & ENERGY STUDIES
COURSE PLAN
SUBJECT
Design &Analysis of Algorithm
PROGRAMME
SUBJECT CODE
GNEG100
3
SEMESTER
DURATION
OF
SEMESTER
SESSION
DURATION
CREDIT
POINTS
PREREQUISITE
SUBJECTS
StepwiseProblemsolvingapproach
and Analysis
B. Tech. (CSE Withspl.
Cloud
Computing,O&G,MT,OSS)
III Semester
Aug2013-Dec 2013
60 Minutes
Faculty Members:G H Sastry
APPROVED BY:
(HOD)
(DEAN)
UPES Campus | “Energy Acres”| P.O. Bidholi via Prem Nagar| Dehradun-248007(UK)
Tel: +91-135-2261090/91 | Fax: +91-135-2694204 | URL: www.upes.ac.in
1

2. 2

3. 1.0
LEVEL OF KNOWLEDGE REQUIRED:
Logical Thinking
Problem Solving Attitude
C Programming
2.0
OBJECTIVES OF COURSE:
The objective of the course is to expertise the student in writing, designing and analyzing the algorithm
to solve a problem .
Upon completion of this course the learners will be:
Able to understand the necessity of the algorithm design.
Able to write the algorithm to solve a problem.
Able to analyze the performance of the algorithm.
3.0
SYLLABUS
Sl.No
Unit
1
Unit - 1
2
Unit – 2
3
Unit – 3
4
Unit – 4
5
Unit – 5
Contents
Algorithm
and
its
Specification,
complete
development of the algorithm, performance analysis ,
randomized algorithms.
Algorithm
and
its
Specification,
complete
development of the algorithm, performance analysis,
randomized algorithms.
The general method, Knapsack problem, tree vertex
splitting job sequencing with deadlines, Optimal
merge patterns, minimum cost spanning trees.
The general method , multistage graphs , all pairs
shortest paths , single source shortest paths : general
weights , 0/1 Knapsack problem , the travelling
salesman problem . Basic Traversal and search
Techniques: Techniques for binary trees and graphs
connected Components and spanning trees.
The general method, the 8-queens problem, sum of
subsets, graph colouring.Branch–and Bound: The
method, 0/1 knapsack problem, travelling salesman
problem.
3

4. 4.0
PEDAGOGY:
The course will be taught using interactive lecture method. The concepts will be adequately illustrated with
examples to make applications of theoretical concepts clear. Students will be required to develop the programs
for the problems and they have to take Assignments and Exercises.
5.0
EVALUATION OF GRADING:
Students will be evaluated based on the following 3 stages.
5.1 Internal Assessment
30%
5.2
Mid Term Examination
20%
5.3
End term Examination
50%
5.1.
INTERNAL ASSESSMENT:
WEIGHTAGE – 30%
Internal Assessment shall be done based on the following:
Sl.No.
1
2
3
4
Description
Individual Assignments&
Problems/Presentations
Class Tests
Quizzes
General Discipline
% of Weightage
40%
30%
20%
10%
Internal Assessment Record Sheet (including Mid Term Examination marks) will be displayed
on LMS at the end of semester i.e. last week of regular classroom teaching.
5.1.1 CLASS TESTS/QUIZZES: Two Class Tests based on descriptive type theoretical & numerical
questions and Two Quizzes based on objective type questions will be held; one class test and one quiz
atleast ten days before the Mid Term Examination and second class test and second quizatleast ten days
before the End Term Examination. Those who do not appear in Viva-Voce and quiz examinations shall
lose their marks.
The marks obtained by the students will be displayed on LMS a week before the start of Mid Term and
End Term Examinations respectively.
5.1.2 ASSIGNMENTS:After completion of each unit or in the mid of the unit,there will be home assignments
based on theory and numerical problems.Those who fail to submit the assignments by the due date shall
lose their marks.
The marks obtained by the students will be displayed on LMS after each submission and subsequent
evaluation.
5.1.3 GENERAL DISCIPLINE:Based on student’s regularity, punctuality, sincerity and behaviour in the
class.
The marks obtained by the students will be displayed on LMS at the end of semester.
4

5. 5.2.
MID TERM EXAMINATION:
WEIGHTAGE – 20%
Mid Term examination shall be Two Hours duration and shall be a combination ofObjective, Short and
Long theory Questions.
2012
5.3.
Date of showing Mid Term Examination Answer Sheets: Oct. 30/Nov 1st,
END TERMEXAMINATION:
WEIGHTAGE – 50%
End Term Examination shall be Three Hours duration and shall be a combination of Objective, Short
and Long theory/numerical Questions.
6.0
GRADING:
The overall marks obtained at the end of the semester comprising all the above three mentioned shall be
converted to a grade.
7.0.
ATTENDANCE:
Students are required to have a minimum attendance of 75% in the subject. Students with less than the
stipulated percentage shall not be allowed to appear in the End Term Examination
8.0
Sl.
No
1.
DETAILED SESSION PLAN
No. of
Sessions
8
Pedagogy
Lecture, Presentation,
Discussion.
Detail of References
T1
T1
2
7
Lecture, Presentation,
Discussion,
Assignment #1
Coverage
UNIT-I Introduction
1.1 Notion of algorithm
1.2 Algorithmic process
1.3 Algorithm Design and analysis cycle
1.4 Performance Metrics
1.5 Complexities
1.6 Significance of Big
Oh,Omega,Thetha notations
1.7 Randomized algorithms
UNIT-Divide & Conquer
2.1 General Method-Discussions
2.2 Binary Search Technique
2.3 Finding Maximum and MinimumMinimum overhead
2.4 Merge Sort,Quick sort
2.5 Selection sort,Insertion Sort
2.6 Strassen’s Matrix Multiplication
T1
T1
3
4
6
Lecture, Presentation,
UNIT-IV Dynamic Programming
4.1 Genral method-Discussion,Multi
Lecture, Presentation,
Discussion Quiz-I,
Test-I
9
UNIT-III: The Greedy Method
3.1 General MethodDiscussion,Knapsack
3.2 Tree vertex splitting
3.3 Job Sequencing problems,optimal
merge pattern
3.4 Mimimum cost spanning tree-method
5

6. stage graphs
4.2 All pair shortest path,Single source
shortest path
4.3Knapsack Problem,TSP-Dynamic
programming solution
4.4 Basic traversal and search
techniques
4.5 Search strategies-Graphs and Trees
4.6 MST
Discussion,
T1
5
6
Lecture, Presentation,
Discussion,
Assignment #2
Quiz-II, Test-II
UNIT-V Backtracking
5.1 General method-Discussion
5.2 N queens problem
5.3 Sum of subsets, Graph colouring
5.4 Branch and bound Vs Backtracking
5.5 Knapsack,TSP,B& B strategies
Total Number of Sessions: 36
9.0
SUGGESTED READINGS:
9.1
TEXT BOOK [T]:
1.Introduction to Design and Analysis of Algorithm by AnanyLevitin, Pearson.
REFERRENCE BOOKS:
1. Ref. 1: Algorithm by Coremen, PHI.
9.2
6