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 : 3 Semester : Session Batch III Semester : 60 Minutes : Prepared by : Dr. Hanumat Sastry G Email [email protected] : 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, write the algorithm to solve a problem. minimum cost spanning trees. B. . designing and analyzing the algorithm to solve a problem. optimal binary search tree. matrix chain multiplication. OSS & ITI) Duratio n: 36Hrs (60 Minutes /Lecture) Subject code: CSEG320 A. Strassen’s algorithm for matrix multiplication Unit – 3 Elements of greedy algorithm. 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. Unit – 2 Recurrence.MFT. An activity selection problem. Huffman codes.1 Algorithm. Analyzing and Designing algorithm . OBJECTIVES: The objective of the course is to expertise the student in writing. Knapsack problem. maximum sub array problem. Role of algorithm in computing. COURSE OUTLINE SNo Unit 1 Unit . 0/1 Knapsack problem. implement the algorithm in C/C++. 5 Unit – 5 2 3 Contents Representation of graph.Asymptotic notation. 4 Unit – 4 Elements of dynamic programming. analyze the performance of the algorithm. single source shortest path. basic traversal techniques(BFS and DFS) and its applications. methods to solve recurrences. longest common subsequence. No. D. Unit – 6 C.all pair shortest path 6 The general method. of tutorials planned and no. The concepts will be adequately illustrated with examples to make applications of theoretical concepts clear. of assignment given and evaluated. E. PEDAGOGY The course will be taught using interactive lecture method. Faculty suggestion for improvement in subject delivery. of test conducted. sum of subsets. Students will be required to develop the programs for the problems and they have to take Assignments and Exercises. No. the 8-queens problem. of tutorials held. No. of lectures planed and no. COURSE COMPLETION PLAN completion plan. 0/1 knapsack problem. 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. of quiz conducted. travelling salesman problem. 1234567- These are following expected to be mentioned in course No.INTERNAL ASSESSMENT: WEIGHTAGE – 30% Internal Assessment shall be done based on the following: . No. Branch–and Bound: The method. Percentage of syllabus covered. of lectures held. Sl.GENERAL DISCIPLINE: Based on student’s regularity. 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. 1.e. The marks obtained by the students will be displayed on LMS after each submission and subsequent evaluation. 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.CLASS TESTS/QUIZZES: Two Class Tests based on descriptive type theoretical & numerical questions and Two Quizzes based on objective type questions will be held. 1. 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. last week of regular classroom teaching.2.3.1. . Those who do not appear in Viva-Voce and quiz examinations shall lose their marks. punctuality. sincerity and behavior in the class. The marks obtained by the students will be displayed on LMS at the end of semester. No. Description % of Weightage 1 Individual Assignments & Problems/Presentations 40% 2 Class Tests 30% 3 Quizzes 20% 4 General Discipline 10% Internal Assessment Record Sheet (including Mid Term Examination marks) will be displayed on LMS/Icos at the end of semester i.ASSIGNMENTS: After completion of each unit or in the mid of the unit. DETAILED SESSION PLAN Sl. The examination paper shall have theory questions.MID TERM EXAMINATION: WEIGHTAGE – 20% Mid Term examination shall be Two Hours duration and shall be a combination of Objective.END TERM EXAMINATION: WEIGHTAGE – 50% End Term Examination shall be Three Hours duration and shall be a combination of Objective. 3. Mid. F.Faculty are advise to declare detailed break-up or scheme for internal assessment. No. Short and Long theory/numerical Questions. Description Weight age Schedule 1. End -Semester Examination: 50% Weightage End-Semester examination shall be of three hours duration.Semester examination shall be of two hour duration and shall be a combination of short theory questions and numerical problems. End-term Exam 50% Academic Calendar Internal Assessment: Marks 100 (It is based on the individual/group assignment. short. of Pedagogy Detail of References Coverage . Short and Long theory Questions. online quizzes/test and class room attendance). long and application oriented problems. Mid-term Exam 20% Academic Calendar 3. Internal Examination 30% Detailed Below 2.Semester Examination: 20% Weightage Mid.2. Lecture. Presentation.5 Longest common subsequence .1 General discussion. Discussion.3 0. 3. 2 8 Lecture.1 General discussions 2.3 Different methods for solving recurrence(Substitution. Test-I Lecture.No Sessions 6 1. Discussion QuizI. Quick sort. Presentation. 1 2 UNIT-IV Dynamic Programming T1 4.2 Recurrence 2.4 Minimum spanning tree 3. Presentation.1 General discussion.4 The maximum-subarray problem 2.3 Matrix-chain multiplication 4. Assignment #1 UNIT-I Introduction T1 T1 T1 6 3 4 6 Algorithmic process Role of algorithm in computing 3 Analyzing Algorithm and Designing algorithm 4 Asymptotic notation UNIT-Divide & Conquer 2.6 Huffman codes Lecture.5 Strassen’s algorithm for matrix multiplication UNIT-III: The Greedy Algorithm 3.2 Elements of dynamic programming 4.3 Knapsack problem 3. Discussion.1 Knapsack Problem 4. Binary search 2.5 Merge Sort. 4. Discussion.5 An activity selection problem 3. recursion tree and master method) 2.2 Elements of the greedy strategy 3. Presentation. TSP. Presentation.com 2.1Representation of graph 5.2Basic traversal techniques(BFS and DFS) and its applications 5. Assignment #2 T1 Quiz-II.1General method-Discussion 5.5 Knapsack. Discussion. Dijkstra’s algorithm ) 5.2N queens problem 5. graph coloring 5.B & B strategies F. Discussion. Test-II 6 5 Lecture.3Sum of subsets.3Single source shortest path(Bellman-Ford. SUGGESTED READINGS: F: 1 TEXT BOOKS: [T1]: Introduction to Algorithm by Thomas H.in GUIDELINES Cell Phones and other Electronic Communication Devices: Cell phones and other electronic communication devices (such as Blackberries/Laptops) are not permitted in .Youtube. Assignment #3 Quiz-III.4. Cormen F : 2 REFERENCE BOOKS: [R1]: Introduction to Design and Analysis of Algorithm by Anany Levitin F : 3 VIDEO RESOURCES (URL LINK) : 1.Nptel. Presentation.4All pair shortest path(FloydWarshall algorithm) UNIT-VI Backtracking and B &B 5.4Branch and bound vs Backtracking 5.iitc.ac. Test-III R1 5.6 Optimal binary search tree UNIT-V Graph Algorithm 5 5 Lecture. All the assignments preferably should be uploaded on LMS. Tech: minimum 40% of the highest marks in the class . 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. Various research papers/reference material will be mailed/uploaded on LMS time to time.classes during Tests or the Mid/Final Examination. Attendance: Students are required to have minimum attendance of 75% in each subject. Regularly. Passing Criterion for B. 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. via LMS. The best way to arrange meetings with us or ask specific questions is by email and prior appointment. important information – Date of conducting class tests. Tech: minimum 30% of the highest marks in the class Passing Criterion for M. Such devices MUST be turned off in the class room. guest lectures.