Online CS Module: Algorithms http://courses.cs.vt.edu/csonline/Algorithms/Lessons/index.html

Kahn Academy CS: Algorithms

https://www.khanacademy.org/computing/computer-science/algorithms

1. Complete the Online CS Module: Algorithms Tutorial

2. Answer the following questions:

a. What simple algorithm did your use to rearrange the letters or cards in the Introduction to Algorithms section?

b. What are the five important characteristics that an algorithm must have and explain each briefly?

c. What was the best way to represent algorithms according to this tutorial?

d. What are the 3 sort algorithms covered in this tutorial and explain each briefly?

e. Which one of the sort methods did you use to complete A above, if any?

f. What were the two efficiencies covered in this tutorial and explain each briefly?

g. What are the four order notations covered in this tutorial and why is this important?

3. Complete the following parts of the Kahn Academy CS: Algorithms tutorial

a. Intro to algorithms

b. Binary search up to the Challenge: Linear search

c. Extra Credit - Complete the Challenge: Binary search [and Quiz: Running time of binary search).

4. Answer the following questions to prove you completed the Khan Academy tutorial:

a. List five of the algorithms mentioned in the first video: What is an algorithm and why should you care, and what each is used for?

b. What makes a good algorithm

c. What Is Asymptotic Analysis and why do we care?

d. Take a screen shot of your Computer Science Algorithm window showing the completed sections of intro to algorithm and Binary search.