CSE 2207 : Algorithms

Topics include algorithmic complexity analysis, design methods (divide and conquer, greedy, dynamic programming, backtracking), and understanding intractable problems.

Course Overview

CSE 2207: Algorithms covers foundational and advanced topics in algorithm design and analysis, including complexity analysis, various design paradigms, and intractable problems.

Sessions Conducted:

• Spring 2023 (CSE 2207)
• Fall 2022, Spring 2023, Fall 2023 (CSE 2208 Sessional)
  with Mr. Md. Khairul Hasan.

Syllabus Highlights

1. Algorithmic Complexity Analysis

   • Efficiency scaling with input size
   • Time and space complexity
   • Big O notation and other measures

2. Design Methods for Efficient Algorithms

   • Divide and Conquer: Merge sort, quicksort
   • Greedy Method: Huffman coding, Dijkstra’s algorithm
   • Dynamic Programming: Fibonacci sequence, shortest path problems
   • Backtracking: N-queens problem, Sudoku
   • Branch and Bound: Traveling salesman problem, 0/1 knapsack
   • Polynomial Evaluation: Horner’s method
   • Lower Bound Theory: Minimum resources required for problems
   • Intractable Problems: NP-hard, NP-complete