University of Petroleum & Energy Studies College of Engineering Studies Dehradun

Format No. QSP/7.1/01.
F01 (B)
Issue No.04 Rev. No 4 Dated: June 7, 2014
__________________________________________________________________________________
UNIVERSITY OF PETROLEUM & ENERGY STUDIES

College of Engineering Studies
Dehradun
___________________________________________________
COURSE PLAN
Programme :
B. Tech(CSE) + BAO,RA, OGI, CCVT, TI, MFT, OSS & ITI
Course
Design & Analysis of Algorithm
Subject Code
CSEG 320
No. of credits
Semester
Session
Batch
III Semester
:
60 Minutes
Prepared by :
Dr. Hanumat Sastry G
Email
hsastry@ddn.upes.ac.in
Approved By
_______________________
_______________________
HOD
UPES Campus
Energy Acres
P.O. Bidholi, Via Prem Nagar
Dean
Tel : +91-135-2770137
Fax : +91 135- 27760904
Website : www.upes.ac.in
COURSE PLAN
Subject
:
Design and Analysis of

algorithm
Course: B.Tech. CSE+

(BAO,RA, OGI, CCVT, TI,
MFT, OSS & ITI)

Duratio
n:
36Hrs (60 Minutes /Lecture)
Subject code:
CSEG320
A. OBJECTIVES:
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:
(a) Able
(b)Able
(c) Able
(d)Able
to
to
to
to
understand the necessity of the algorithm design.

write the algorithm to solve a problem.
analyze the performance of the algorithm.
implement the algorithm in C/C++.
B. COURSE OUTLINE
SNo
Unit
Unit - 1
Algorithm, Role of algorithm in computing,

Analyzing and Designing algorithm
,Asymptotic notation,
Unit 2
Recurrence, methods to solve recurrences,

maximum sub array problem, Strassens
algorithm for matrix multiplication
Unit 3
Elements of greedy algorithm, Knapsack

problem, An activity selection problem,
Huffman codes, minimum cost spanning trees.
Unit 4
Elements of dynamic programming, matrix

chain multiplication, 0/1 Knapsack problem,
longest common subsequence, optimal binary
search tree.
Unit 5
Contents
Representation of graph, basic traversal

techniques(BFS and DFS) and its applications,
single source shortest path,
all pair shortest path
The general method, the 8-queens problem,

sum of subsets. Branchand Bound: The
method, 0/1 knapsack problem, travelling
salesman problem.
Unit 6
C. 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.
D. COURSE COMPLETION PLAN

completion plan.
1234567-
These are following expected to be mentioned in course
No. of lectures planed and no. of lectures held.

No. of tutorials planned and no. of tutorials held.
No. of assignment given and evaluated.
No. of test conducted.
No. of quiz conducted.
Percentage of syllabus covered.
Faculty suggestion for improvement in subject delivery.
E. EVALUATION & GRADING
Students will be evaluated based on the following 3 stages.
12-
Internal Assessment Mid Term Examination-
30%
20%
3-
End term Examination-
50%
1- INTERNAL ASSESSMENT:
WEIGHTAGE 30%
Internal Assessment shall be done based on the following:
Sl.
No.
Description
% of Weightage
Individual Assignments &

Problems/Presentations
40%
Class Tests
30%
Quizzes
20%
General Discipline
10%
Internal Assessment Record Sheet (including Mid Term Examination marks) will be
displayed on LMS/Icos at the end of semester i.e. last week of regular classroom teaching.
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 quiz
atleast 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.
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.
1.3- GENERAL DISCIPLINE: Based on students regularity, punctuality, sincerity and behavior in
the class.
The marks obtained by the students will be displayed on LMS at the end of semester.
2- MID TERM EXAMINATION:

WEIGHTAGE 20%
Mid Term examination shall be Two Hours duration and shall be a combination of Objective,
Short and Long theory Questions.
3- END TERM EXAMINATION:

WEIGHTAGE 50%
End Term Examination shall be Three Hours duration and shall be a combination of Objective,
Short and Long theory/numerical Questions.
Description
Weight age
Schedule
1.
Internal Examination
30%
Detailed Below
2.
Mid-term Exam
20%
Academic Calendar
3.
End-term Exam
50%
Academic Calendar
Internal Assessment: Marks 100 (It is based on the individual/group assignment, online
quizzes/test and class room attendance)- Faculty are advise to declare detailed break-up or
scheme for internal assessment.
Mid- Semester Examination: 20% Weightage
Mid- Semester examination shall be of two hour duration and shall be a combination of short
theory questions and numerical problems.
End -Semester Examination: 50% Weightage
End-Semester examination shall be of three hours duration. The examination paper shall have
theory questions, short, long and application oriented problems.
F. DETAILED SESSION PLAN

Sl.
No. of
Pedagogy
Detail of
References
Coverage
No
Sessions
6
1.
Lecture,
Presentation,
Discussion,
Lecture,
Presentation,
Discussion,
Assignment #1
UNIT-I Introduction
T1
T1
T1
6
3
Algorithmic process
Role of algorithm in
computing
3 Analyzing Algorithm and
Designing algorithm
4 Asymptotic notation
UNIT-Divide & Conquer
2.1 General discussions
2.2 Recurrence
2.3 Different methods for
solving
recurrence(Substitution,
recursion tree and master
method)
2.4 The maximum-subarray
problem
2.5 Merge Sort, Quick sort,
Binary search
2.5 Strassens algorithm for
matrix multiplication
UNIT-III: The Greedy
Algorithm
3.1 General discussion,
3.2 Elements of the greedy
strategy
3.3 Knapsack problem
3.4 Minimum spanning tree
3.5 An activity selection
problem
3.6 Huffman codes
Lecture,
Presentation,
Discussion QuizI, Test-I
Lecture,
Presentation,
Discussion,
1
2
UNIT-IV Dynamic
Programming
T1
4.1 General discussion,

4.2 Elements of dynamic
programming
4.3 Matrix-chain multiplication
4.3 0,1 Knapsack Problem
4.5 Longest common
subsequence
4.6 Optimal binary search tree

UNIT-V Graph Algorithm
Lecture,
Presentation,
Discussion,
Assignment #2
T1
Quiz-II, Test-II
Lecture,
Presentation,
Discussion,
Assignment #3
Quiz-III, Test-III
R1
5.1Representation of graph
5.2Basic traversal
techniques(BFS and DFS)
and its applications
5.3Single source shortest
path(Bellman-Ford,
Dijkstras algorithm )
5.4All pair shortest path(FloydWarshall algorithm)
UNIT-VI Backtracking and B
&B
5.1General method-Discussion
5.2N queens problem
5.3Sum of subsets, graph
coloring
5.4Branch and bound vs
Backtracking
5.5 Knapsack, TSP,B & B
strategies
F. SUGGESTED READINGS:
F: 1 TEXT BOOKS:
[T1]: Introduction to Algorithm by Thomas H. Cormen
F : 2 REFERENCE BOOKS:
[R1]: Introduction to Design and Analysis of Algorithm by Anany Levitin
F : 3 VIDEO RESOURCES (URL LINK) :
1- Youtube.com
2- Nptel.iitc.ac.in
GUIDELINES
Cell Phones and other Electronic Communication Devices: Cell phones and other
electronic communication devices (such as Blackberries/Laptops) are not permitted in
classes during Tests or the Mid/Final Examination. Such devices MUST be turned off in the
class room.
E-Mail and LMS: Each student in the class should have an e-mail id and a pass word to
access the LMS system regularly. Regularly, important information Date of conducting class
tests, guest lectures, via LMS. The best way to arrange meetings with us or ask specific
questions is by email and prior appointment. All the assignments preferably should be
uploaded on LMS. Various research papers/reference material will be mailed/uploaded on
LMS time to time.
Attendance: Students are required to have minimum attendance of 75% in each subject.
Students with less than said percentage shall NOT be allowed to appear in the end semester
examination.
Passing criterion: Student has to secure minimum 30%/40% marks of the highest marks
in the class scored by a student in that subject (in that class/group class) individually in
both the End-Semester examination and Total Marks in order to pass in that paper.
Passing Criterion for B. Tech: minimum 30% of the highest marks in the class
Passing Criterion for M. Tech: minimum 40% of the highest marks in the class

University of Petroleum & Energy Studies College of Engineering Studies Dehradun

Uploaded by

Copyright:

Available Formats

University of Petroleum & Energy Studies College of Engineering Studies Dehradun

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

University of Petroleum & Energy Studies College of Engineering Studies Dehradun

Uploaded by

Copyright:

Available Formats

Format No. QSP/7.1/01.

UNIVERSITY OF PETROLEUM & ENERGY STUDIES

B. Tech(CSE) + BAO,RA, OGI, CCVT, TI, MFT, OSS & ITI

Design & Analysis of Algorithm

Dr. Hanumat Sastry G

Design and Analysis of

Course: B.Tech. CSE+

MFT, OSS & ITI)

36Hrs (60 Minutes /Lecture)

understand the necessity of the algorithm design.

Algorithm, Role of algorithm in computing,

Recurrence, methods to solve recurrences,

Elements of greedy algorithm, Knapsack

Elements of dynamic programming, matrix

Representation of graph, basic traversal

all pair shortest path

The general method, the 8-queens problem,

D. COURSE COMPLETION PLAN

These are following expected to be mentioned in course

No. of lectures planed and no. of lectures held.

E. EVALUATION & GRADING

Students will be evaluated based on the following 3 stages.

Internal Assessment Mid Term Examination-

End term Examination-

Individual Assignments &

2- MID TERM EXAMINATION:

3- END TERM EXAMINATION:

F. DETAILED SESSION PLAN

4.1 General discussion,

4.6 Optimal binary search tree

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.