CERTIFICATE IN DESIGN AND ANALYSIS OF ALGORITHMS

  • Home -
  • CERTIFICATE IN DESIGN AND ANALYSIS OF ALGORITHMS

CERTIFICATE IN DESIGN AND ANALYSIS OF ALGORITHMS -(C1165)

CERTIFICATE IN DESIGN AND ANALYSIS OF ALGORITHMS

Introduction

I DESIGN TECHNIQUES

 Divide-and-Conquer

 Prune-and-Search

 Dynamic Programming

 Greedy Algorithms

First Homework Assignment

II SEARCHING

 Binary Search Trees

 Red-Black Trees

 Amortized Analysis

 Splay Trees

Second Homework Assignment

III PRIORITIZING

 Heaps and Heapsort

 Fibonacci Heaps

 Solving Recurrence Relations

Third Homework Assignment

IV GRAPH ALGORITHMS

 Graph Search

 Shortest Paths

 Minimum Spanning Trees

 Union-Find

Fourth Homework Assignment

V TOPOLOGICAL ALGORITHMS

 Geometric Graphs

 Surfaces

 Homology

Fifth Homework Assignment

VI GEOMETRIC ALGORITHMS

 Plane-Sweep


.

OTHER COURSES