We don’t need to tell you that data can be beautiful—but the process of putting it in order can look pretty darn good, too. A new site called SORTING aims to make people aware of just how elegant some ...

From designing algorithms to analyzing their efficiency, understanding these core concepts is key to solving problems in ...

The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way. If ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...