This two-part course is designed for experienced computer scientists to build on the principles learned in the "Principles of Computing" course. In part one, students will explore the concept of algorithmic efficiency and apply it to various problems in graph theory.
They will implement key graph algorithms in Python and use these algorithms to analyze two large real-world data sets, emphasizing the interaction between the algorithms and the data structures. To succeed, students should be comfortable writing intermediate-sized Python programs and have an understanding of searching, sorting, recursion, and math concepts such as algebra and pre-calculus.
🆓 Free to Audit
🕒 Approx. 12 Hours
✏️Intermediate Level
🧾 Paid Certificate Available Upon Completion
🎓 Offered by Rice University via Coursera
