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