01.md

W3D1

Today's Learning Goals:

• What are the constraints of (any type of) Heap?
• What type of Data Structure might we use to implement a heap?
• What is the formula for getting the left child of a Heap root node? Right child?
• What is a Priority Queue?
• What is an XMLHttpRequest?
• What's the difference between the DOMContentLoaded and load event triggers?

Study

Algorithms

Heaps are a new type of tree that are extremely useful when implementing any type of priority queue. They are unique in that one very efficient way to implement them is with an array. They are especially efficient for extracting a min/max value from a set of data!

Read:

• Heap Animation
• Heaps Review
• Heaps In Depth (BONUS)

Web

AJAX Review.

Read:

• Intro to AJAX
• AJAX in depth

JavaScript

• Familiarize yourself with various categories of events
• Page Lifecycle

Misc

• Redux - "Passing the Store down Explicitly through Context" through "Passing the Store down with from React Redux"

Network and Apply

• Reach out to 2 people
• Apply to 5 jobs