Advanced Algorithms
  • Type Validation
  • Level Advanced
  • Time Weeks
  • Cost Paid
Additional Details

Advanced Algorithms

Issued by Binghamton University

The badge earner can identify complex algorithmic paradigms including greedy algorithms and dynamic programming. The earner can identify graphs using adjacency matrices and edge lists, find shortest path between vertices using Dijkstra’s algorithm, find the minimum spanning tree in a graph using Prim’s algorithm and Kruskal’s algorithm, explain and describe maximum matching in bipartite graphs and find the minimum vertex cover. The earner can explain the concept of NP and NP-completeness.

  • Type Validation
  • Level Advanced
  • Time Weeks
  • Cost Paid
Additional Details

Skills

Earning Criteria

  • This credential is open to anyone with a high school education (including currently enrolled high school students).
  • This is a self-paced, online course that will require 18-20 hours to complete. The course is divided into six (6) modules: Greedy Algorithms, Dynamic Programming, Graphs and Dijkstra's Algorithm, Minimum Spanning Trees, NP-Completeness, and Advanced Graph Algorithms.
  • To earn this credential the learner must pass the final exam.
  • $325.00 - standard/industry; $210.00 - BU faculty, staff, and alumni; $135.00 - BU or high school students; $35.00 retake fee - BU students; $50.00 - retake fee for all others.