Introductory Class of Batch: 16 [L-2 T-2]

Course Code: CSE-243, Course Title: Algorithm Design & Analysis

Course Code: CSE-244, Course Title: Algorithm Design & Analysis (Sessional)

Instructor
Md. Sabir Hossain
Lecturer
Dept. of CSE, CUET
Mobile: 01737143868/01882826575
Email: [email protected]
Website: www.developer.cryptobdresearch.com

Dept. of Computer Science & Engineering (CSE)

Chittagong University of Engineering & Technology
 “Your skills of dealing
with others determine
how they deal with
you.”

Enjoy Your Life, Sheikh Abdur Rahman Al Arifi,

Page-31

9/27/2018 Md. Sabir Hossain, Lecturer, Dept. of CSE, CUET 2

Road Map of CSE-243
(Algorithms Design & Analysis)
By Md. Sabir Hossain
Lecturer, Dept. of CSE, CUET
Contents

 Algorithms Course Overview

 Simple Introduction
 Guidelines to do well
Overview

Algorithms
Analysis Designs Paradigm

Solving
Asymptotic Sorting and Divide & Greedy Dynamic Sorting & Graph
Recurrence Backtracking
Analysis Searching Conquer Method Programming Searching Algorithms
Relations
Analysis

Algorithm Analysis
Running Asymptotic Solving Recurrence
Time Analysis Relations
Best, Asymptotic
Calculate Asymptotic Recurrence
Average and Notations Substitution Iteration Master
Running Analysis Tree
Worst Case Method Method Method
Time (Tn) Basic (Big Oh, Omega, Theta, Method
Analysis Little oh, omega)
Divide & Conquer

Binary Search

Merge Sort

Quick Sort

Calculate pow(x, n)

Divide & Conquer

Closest Pair of Points

Strassen’s Matrix Multiplication

Karatsuba algorithm for fast

multiplication

Count Inversions

Multiply two polynomials

Tiling Problem

Convex Hull (Simple Divide and

Conquer Algorithm)

Quickhull Algorithm for Convex

Hull
Greedy Method

Searching & Sorting Searching

Linear Binary Ternary

Sorting
Search Search Search

Non-
Comparison
Comparison
s Sort
s Sort
Greedy Method

Activity Selection Problem

Egyptian Fraction

Lists Based Job Sequencing Problem

Huffman Coding

Greedy Method
Efficient Huffman Coding for sorted input

Kruskal’s Minimum Spanning Tree

Prim’s Minimum Spanning Tree

Boruvka’s Minimum Spanning Tree

Reverse delete algorithm for MST

Graph Based Dijkastra’s Shortest Path Algorithm

Dial’s Algorithm

Dijkstra’s Algorithm for Adjacency List

Representation

Prim’s MST for adjacency list representation

Greedy Method

Sorting
Non-
Comparisons Sort Comparis
ons Sort
Merge
inserti
Cockta
Inserti Selecti Odd- on Counti
Bubbl Quicks Heaps Shells Merge Intros il Cycle Smoot Timso Radix Bucket
on on even (Ford- ng
e Sort ort ort ort sort ort shaker sort hsort rt sort sort
sort sort sort Johns sort
sort
on)
sort
 Overview

Backtracking
The Knight’s N Queen m Coloring Hamiltonian Solving
Print all Rat in a Maze Subset Sum Sudoku Tug of War
tour problem Problem Problem Cycle Cryptarithme
permutations tic Puzzles
of a given
string
Overview

Dynamic programming

Bellman–
Longest Longest Program
Longest Matrix Floyd Ford Largest
Increasin 0-1 Palindro for Subset
Common Edit Coin Chain Warshall Ugly Algorith Indepen Tiling
g Knapsack mic Fibonacc Sum
Subsequ Distance Change Multiplic Algorith Numbers m for dent Set Problem
Subsequ Problem Subsequ i Problem
ence ation m Shortest Problem
ence ence numbers
Paths
Overview

Graph Algorithm

DFS and BFS Minimum Spanning Tree

Check Application Prim’s MST Boruvka’s

Breadth whether a Bi- Kruskal’s
Depth First Snake and Prim’s s of for algorithm
First Detecting Longest Topologica given connected Minimum
Traversal Ladder Minimum Minimum Adjacency for
Traversal Cycle Path l Sorting graph is Componen Spanning
for a Graph Problem Spanning Spanning List Minimum
for a Graph Bipartite or t Tree
Tree (MST) Tree Representa Spanning
not Algorithm
Problem tion Tree
Overview

Graph Algorithm

Shortest Path Connectivity

Dijkstra’s Johnson’ Tarjan’s

Fleury’s
Algorith s Shortest Articulati Algorith
Dijkstra’s Bellman– Floyd Algorith Strongly Euler
m for algorithm Path in on Points Biconnec m to find
Bridges Eulerian m for Connecte Circuit in
shortest Ford Warshall (or Cut Biconnec ted Strongly
Adjacenc for All- Directed in a path and printing d a
path Algorith Algorith Vertices) ted graph Compone Connecte
y List pairs Acyclic graph circuit Eulerian Compone Directed
algorithm m m in a nts d
Represen shortest Graph Path or nts Graph
tation paths Graph Compone
Circuit
nts
Overview

Graph Algorithm

Maximum Flow Hard Problems

Ford- Find Travelling Vertex

Fulkerson maximum Graph Travelling
Find Salesman Cover K Centers
Algorithm number of Coloring Greedy Salesman
minimum s- Maximum Channel Problem Problem Problem
for edge (Introductio Algorithm Problem Hamiltonian
t cut in a Bipartite Assignment (Naive and (Introductio (Greedy
Maximum disjoint n and for Graph (Approximat Cycle
flow Matching Problem Dynamic n and Approximat
Flow paths Applications Coloring e using
network Programmin Approximat e Algorithm)
Problem between ) MST)
g) e Algorithm)
two vertices
How to do well in
Algorithm Design and
Analysis Course?
Guidelines

 Code immediately the concept learned in the theory class

 Complete the assignment provided by your teacher
 Be Punctual
 Response in class
 Be interactive with your teachers
 Feel free to ask questions in class
 Think your course teacher a friend but not ordinary friend
 Allah Hafez