COSC401-Introduction to Algorithms & Complexity Analysis

  1. Course Syllabus
Basic algorithmic analysis: Asymptotic analysis of Upper and average complexity bounds; standard Complexity Classes Time and space tradeoffs in algorithms analysis recursive algorithms.  Algorithmic Strategies: Fundamental computing algorithms: Numerical algorithms, sequential and binary search algorithms; sorting algorithms, Binary Search tress, Hash tables, graphs & its representation.
  1. Reference Textbook
    "Introduction to the Design & Analysis of Algorithms”, 3rd Editiion by Analy Levitin, Pearson Education, Inc.  Upper Saddle River, NJ, 2002.
  2. Course Material
              
S/No
 Topic
 Chapter
1.
 Introduction
 Chapter 1
2
 Fundamentals of the Analysis of Algorithm Efficiency
 Chapter 2
3
 Brute Force and Exhaustive Search
 Chapter 3
4
 Decrease-and-Conquer
 Chapter 4
5
 Divide-and-Conquer
 Chapter 5
6
 Transform-and-Conquer
 Chapter 6
    • Students' Grades
      • ABU 2014/2015