# Practice

## Computer Science

### Additional Practice

Sharpen your skills with these quizzes designed to check your understanding of the fundamentals.

##### #bg-afeb6f6384 { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Introduction%20to%20Algorithms-w7hMnV.png?width=32); } @media (-webkit-min-device-pixel-ratio: 1.5), (min-resolution: 1.5dppx) { #bg-afeb6f6384 { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Introduction%20to%20Algorithms-w7hMnV.png?width=64); } } @media (-webkit-min-device-pixel-ratio: 2.5), (min-resolution: 2.5dppx) { #bg-afeb6f6384 { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Introduction%20to%20Algorithms-w7hMnV.png?width=96); } } #bg-a10b7482db { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Runtime%20Analysis-YJXrPH.png?width=32); } @media (-webkit-min-device-pixel-ratio: 1.5), (min-resolution: 1.5dppx) { #bg-a10b7482db { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Runtime%20Analysis-YJXrPH.png?width=64); } } @media (-webkit-min-device-pixel-ratio: 2.5), (min-resolution: 2.5dppx) { #bg-a10b7482db { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Runtime%20Analysis-YJXrPH.png?width=96); } } #bg-8e0b4aea98 { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Dynamic%20Programming%20-vDY3zz.png?width=32); } @media (-webkit-min-device-pixel-ratio: 1.5), (min-resolution: 1.5dppx) { #bg-8e0b4aea98 { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Dynamic%20Programming%20-vDY3zz.png?width=64); } } @media (-webkit-min-device-pixel-ratio: 2.5), (min-resolution: 2.5dppx) { #bg-8e0b4aea98 { background-image: url(https://ds055uzetaobb.cloudfront.net/brioche/chapter/Dynamic%20Programming%20-vDY3zz.png?width=96); } } Algorithms

• ###### Complexity / Runtime Analysis

A fast algorithm is most useful - you don't want the answer to your question in 10 years, do you? Runtime analysis studies how long an algorithm will take to complete, on average or in the worst case.

• ###### Dynamic Programming

You don't want to repeat yourself when trying to be efficient. Dynamic programming is the art of keeping track of results you've already computed that are useful in later computations.

• ###### Sorting Algorithms

Highly-organized data can be critical for many algorithms, and often you want your data ordered from least to greatest. The art of getting your data in order is trickier than you might think!

• ###### Computational Geometry

Computers are being used more and more to solve geometric problems, like modeling physical objects such as brains and bridges.

• ###### Computability

What are computers capable of?

• ###### Signals and Systems

From robots to radar, signals and systems allow computers to make decisions based on taking in the information around them.

### Community Wiki

Browse through thousands of Computer Science wikis written by our community of experts.

##### Machine Learning
×

Problem Loading...

Note Loading...

Set Loading...