A teenage programmer tests how different types of algorithms can be used to speed up searching her massive music collection. Suitable for teaching at KS3, KS4 and National 4 and 5.

Algorithms are the sets of steps necessary to complete computation - they are at the heart of what our devices actually do. And this isn’t a new concept. Since the development of math itself ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...

Program Overview Why get a master's in computer science? Expand your knowledge of the full lifecycle of software development – from design and testing to deployment and maintenance – with a hands-on, ...

A teenage programmer explores the concept of writing algorithms by creating step-by-step instructions to teach her computer a dance routine. Suitable for teaching at KS3, KS4 and National 4 and 5.

The bookshelf problem (which computer scientists call the “list labeling” problem) is one of the most basic topics in the field of data structures. “It’s the kind of problem you’d teach to freshman or ...

As computer scientists tackle a greater range of problems, their work has grown increasingly interdisciplinary. This year, many of the most significant computer science results also involved other ...

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

This is the case with an important problem in computer science called "graph isomorphism testing" whereby scientists use algorithms to test whether two graphs are the same.

If you choose this pathway, you must complete three courses in the Foundations of Data Structures and Algorithms specialization.