- Articulate a set of steps to determine Big O complexity.
- List the Big O complexities of some commonly-used patterns and algorithms.
- Estimate the time or space efficiency of an algorithm using Big O notation.
- Describe the binary search algorithm and identify its advantages and disadvantages.
- Write a pseudocode version of binary search and a javascript version of binary search.
- Determine the runtime (in big-O notation) for binary search.
- Explain the benefits of using Angular and describe the problems Angular aims to solve.
- Initialize Angular in an HTML view, and use expressions and templates to impact the DOM.
- Organize the code into controllers and connect the View & Controller using
this
. - Implement 2-way data binding.
- Inject a service into a controller.
- Read data with
$http
. - Create data with
$http
. - Update data with
$http
. - Delete data with
$http
. - Update the view to reflect a successful state change.