CSE 2203: Computer Algorithms

MD. MUKTAR HOSSAIN

LECTURER
DEPARTMENT OF COMPUTER SCIENCE
AND ENGINEERING
VARENDRA UNIVERSITY
 Outline

Assessment Details

Textbook References

Why Study this Course?

Course Learning Outcomes

Course Description
 Assessment Details
Assessment Tools Marks (%)

Class Participation 10%

Continuous Assessment (CA)

Class Test, Assignment, Discussion, 40%
30%
Presentation

Mid-term Examination 24%

Summative Assessment (SA) 60%
Final Examination 36%

Total 100%
 Textbook References

1.Thomas Cormen, Charles Leiserson, : Introduction to Algorithms

Ronald, Rivest, Clifford Stein

2.Jon Kleinberg, Eva Tardos : Algorithm Design

3.Sartaj Sahni, Ellis Horrowitz, Rajasekara : Fundamentals of Computer Algorithms.

 Why Study this Course?

Donald E. Knuth stated “Computer Science is the study of algorithms”

Programs will not exist without algorithms.

Closely related to our lives

Help to guide how to analyze and solve problems

Help to develop the ability of analyzing and solving problems via computers
Course Learning Outcomes

CLOs Descriptions

CLO1 Apply runtime analysis techniques

CLO2 Design new algorithms to solve problems in real life

CLO3 Analyze the requirements for approximation of NP-complete problems

 Course Description
Basics of Algorithms
Searching Algorithms
•••• String
BubbleMatching
Definition
BFS
Fractional
Introduction
DefinitionSort to DP Algorithms
knapsack
•••• Recurrence
DFS
Huffman
Divide
Insertion& relations vs DP
coding
Conquer
Sort
P,• NP,multiplication
Naïve
Analyzing
Linear
Matrix NP
Search Complete, NP-Hard
algorithm
algorithms
Sorting Algorithm ••••• Detect
Dijkstra’s
• Cycle
Tabulation vsinMemoization
shortestGraph
Knuth–Morris–Pratt
Selection
Problems
Merge Sort Sort path algorithm
•••• Design
Binary
Prim’s
Fibonacci
Merge Search
algorithms
• Boyer–Moore
Dijkstra’s shortest
Minimum
numbers
Sort path algorithm
Spanning Tree
Quick Sort
Differences among
Divide and Conquer Design ••••• Asymptotic
Fibonacci
Bellman–Ford
Kruskal’s
Factorials
QuickSearch
Binary Sort Search
notations
Minimum SpanningNP,
Algorithm Tree NP
•••• Complete,
Interpolation
Floyd
RadixWarshall
Activity
Longest NP-Hard
Search
selection
Common
Sort
Calculate pow(x, n) etc.
Algorithm
problem
Subsequence
Dynamic Programming ••• Maximum
Prim’s
Job
Weighted sub
Minimum
Sequencing
Bucket Sort Jobarray sum problem
Spanning
Scheduling
problem Tree
Analysis of divide and conquer
Greedy Design ••• Kruskal’s
0-1 Minimum Spanning Tree
Knapsack
Topological
algorithms. sort etc.
• Convex Hull vs Concave Hull
Graph Theory
String Processing
Computational Complexity
Thank You