Description

Design and correctness of algorithms, including divide-and-conquer, greedy and dynamic programming methods. Complexity analyses using recurrence relations, probabilistic methods, and NP-completeness. Applications to order statistics, disjoint sets, B-trees and balances trees, graphs, network flows, and string matching.

Experience Gained

• Java
• Object Oriented Programming
• Algorithms(e.g LinkedList, Binary Trees, Graphs)