Program Overview

Advanced Algorithms Course

Overview

The Advanced Algorithms course is offered by the Thomas J. Watson College of Engineering and Applied Science at Binghamton University. This course provides a solid foundation and background for the design and analysis of algorithms.

Course Details

• Instructor: Anand Seetharam
• Delivery: Self-paced online, video lectures, self-assessment quizzes (not graded), and final exam (graded)
• Credentials: Participants who complete the course by passing the final exam will receive the Advanced Algorithms digital badge and a Binghamton University-issued course completion certificate
• Eligibility: Open to all engineers, professionals, faculty, and students

Course Content

The course covers key algorithmic concepts and principles, including:

• Greedy algorithms (Activity Selection, 0-1 Knapsack Problem, Fractional Knapsack Problem)
• Dynamic programming (Longest Common Subsequence, 0-1 Knapsack Problem)
• Minimum Spanning Trees (Prim's Algorithm, Kruskal's Algorithm)
• Graph Algorithms (Dijkstra's Shortest Path Algorithm, Bipartite Graphs, Minimum Vertex Cover)
• Theory of NP and NP-completeness
• Total Course Duration: 18 to 20 hours

Learning Outcomes

At the end of the course, students will be able to:

• Describe and apply complex algorithmic paradigms, including greedy algorithms and dynamic programming
• Describe graphs using adjacency matrices and edge lists, and find the shortest path between vertices in a graph 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, as well as find the minimum vertex cover in a graph
• Explain the concept of NP and NP-completeness, as well as mathematically show that a problem is NP-complete

Instructor Profile

Anand Seetharam is a former assistant professor in computer science at the Thomas J. Watson College of Engineering and Applied Science at Binghamton University. His research interests include wireless networks, information-centric networks, ubiquitous computing, the Internet of Things (IoT), and smart grids.

Course Fees

• Standard/Industry Rate: $325
• BU Faculty, Staff, and Alumni: $210
• BU Students and High School Students: $135
• Retake Fee (BU Students): $35
• Retake Fee (non-students): $50

Cancellation and Refund Policy

All cancellations must be received in writing. All refunds will be assessed a 10% administrative fee. No refunds for cancellations or non-attendance will be given after the course has started. If the course is canceled, enrollees will be advised and receive a full refund.