Scribd
Upload
99 views2 pages

Algorithm Analysis and Design Course Guide

This document outlines the course objectives, schedule, and content for an Algorithm Analysis and Design course. The course is taught over one semester with 3 hours of theory and 1 hour of tutorial per week. It covers techniques for designing and analyzing algorithms, including divide-and-conquer, greedy methods, dynamic programming, backtracking, branch and bound, and NP-hard problems. The course content is divided into 7 chapters, each covering specific algorithm design strategies and examples. Students will be assessed through internal and final exams worth 20 and 80 marks respectively.

Uploaded by

Rubiya Khadka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
99 views2 pages

Algorithm Analysis and Design Course Guide

This document outlines the course objectives, schedule, and content for an Algorithm Analysis and Design course. The course is taught over one semester with 3 hours of theory and 1 hour of tutorial per week. It covers techniques for designing and analyzing algorithms, including divide-and-conquer, greedy methods, dynamic programming, backtracking, branch and bound, and NP-hard problems. The course content is divided into 7 chapters, each covering specific algorithm design strategies and examples. Students will be assessed through internal and final exams worth 20 and 80 marks respectively.

Uploaded by

Rubiya Khadka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Algorithm Analysis and Design

BEG 371 CO
Year: III Semester: I
Teaching Schedule Examination Scheme
Hours/Week
Theory Tutorial Practical Internal Final Total
Theory Practical Theory Practical
3 1 -- 100
20 80 -
Course Objective:
After completion of this course, students will be able to explore techniques for designing and
analyzing the algorithms.
1. Introduction (6 hrs)
1.1 Algorithm Definition
1.2 Algorithm Specification
1.2.1 Pseudo code Convention
1.2.2 Recursive Algorithms
1.3 Performance Analysis
1.3.1 Space Complexity
1.3.2 Time Complexity
1.3.3 Asymptotic Notation (Ὸ, Ω)
1.3.4 Practical Complexities
1.3.5 Performance Measurement
2. Divide-And- Conquer (10 hrs)
2.1 General Method
2.2 Binary Search
2.3 Merge Sort, Quick Sort, Selection Sort
2.4 Strassen’s Matrix Multiplication
2.5 Convex Hull
3. Greedy Method (6 hrs)
3.1 The General Method
3.2 Knapsack Problem
3.3 Job Sequencing with Deadlines
3.4 Minimum Cost spanning Trees
3.4.1 Prim’s Algorithm
3.4.2 Kruskal’s Algorithm
3.5 Dijkstra’s Algorithm
4. Dynamic Programming (6 hrs)
4.1 The General Method
4.2 Multistage Graph
4.3 All Pairs Shortest Path
4.4 0/1 Knapsack
4.5 The Travelling Salesperson Problem
5. Backtracking (6 hrs)
5.1 General Strategy
5.2 8-Queens Problem
5.3 Kanpsack Problem
5.4 Graph Coloring
5.5 Hamiltonian Cycles
6. Branch and Bound (6 hrs)
6.1 General Strategy
6.2 0/1 Knapsack
6.3 Travelling Salesperson Problem

7. Np-Hard and Np-Complete Problems (5 hrs)


7.1 Basic Concepts
7.2 Np-Hard Graph Problems

References
1. Horowitz, Sahani and Rajasekaran "Fundamentals of Computer Algorithms", Galgotia
Publication.
2. Bressard, "Fundamental of Algorithm.", PHI

Marks Distribution:
Chapter Marks
1 10
2 20
3 10
4 10
5 10
6 10
7 10
Total 80

* Attempt any Five Questions out of seven. One question include A and B.

You might also like