01.md

W4D1

Today's Learning Goals:

• What are the constraints of a Binary Search Tree?
• What is the big O lookup time for a value in a binary search tree?
• Does JS assign variables by value or by reference?
• What is Round Robin DNS binding?
• What issue arises regarding sessions when implementing a Load Balancer?
• What is striping when talking about writing to a Hard drive?
• What is RAID and what functionality can it give you?
• What is a symbol when talking about transmitting data?
• How is information transmitted over wireless signal?

Study

Algos

Binary Search Trees are one of the most asked about data structures in the programming industry. They're extremely efficient for storing sorted data, and extremely efficient for insertion and removal. Relational Databases often use Binary Search Trees to add indexes to certain table columns.

Spend today and tomorrow watching the following video!

Watch:

• Binary Search Tree

Web

Continue Harvard video on scalability:

• Scalability Continued

JavaScript

How does JavaScript handle values and references?

Read:

• Value vs. Reference

Misc

• Networking

Network and Apply

• Reach out to 2 people
• Apply to 5 jobs