Shurlow

Binary, ASCII, and UTF-8 Instructor notes

Objectives

• Define Bits and Bytes
• Convert decimal to binary and hexadecimal numbers.
• Describe UTF-8 and ASCII, including the differences between the two.

Define Bits and Bytes

What are bits and bytes?

Shurlow

Searching

Objectives

• Write pseudocode for linear search
• Write pseudocode for binary search
• Translate algorithm pseudocode to working code
• Describe the Big O complexity of linear and binary search

Guiding Questions

Shurlow

SQL Joins

Objectives

• Explain what a Relational Databases is
• Describe why Relational Databases are useful
• Diagram 1-to-many & many-to-many relationships with ERDs
• Create primary and foreign keys on tables
• Join tables with SQL
• Use aggregate & group by queries

Shurlow

Scope

Objectives

• Describe what global scope is
• Describe what local (or lexical) scope is
• Explain why global scope should be avoided
• Describe what variable shadowing is
• Explain how variables are hoisted
• Explain how an IIFE can help with scope

Shurlow

Git and Github

Objectives

• Explain what Git is
• Use Git to manage a local repository

Practice

Lets go through this list of steps together. As we work through each step, take notes about the commands used.

Shurlow

Command Line

Objectives

• Explain what the command line is
• Explain why the command line is useful
• Identify and use common command line tools

Guiding Questions

Shurlow

Iteration & Conditionals

Objectives

• Use if / else if / if to write conditional code
• Identify the syntax of standard for loops
• Write for loops
• Write while loops
• Loop over an array
• Loop over an object

Shurlow

Data Structures

Objectives

• Explain the difference between objects and arrays
• Create arrays with data
• Identify methods on arrays:
  • Create
  • Read
• Update

Shurlow

Primitive Types

Objectives

• Identify the 5 primitive types
• Create & modify variables
• Create expressions using arithmetic operators (+, -, *, /, %)
• Evaluate comparisons (===, !==, >, ||, &&)

Guiding Questions

Shurlow

Binary Search Trees

Objectives

• Define what a binary search tree is
• Explain why binary search trees are useful
• Write pseudo code to traverse a binary search tree
• Explain the difference between depth first search methods (pre-order, in-order, post-order)
• Describe the Big O of binary search tree methods
• Implement binary search tree methods