# Outline-W-18

## My Notion Notes:

{% embed url="https://www.notion.so/webdevhub42/D3-Aux-Resources-82d1b5c6ff8f4e139902e7c678f555fe#344c1246d74949dbb8469221eb17358d" %}

### Overview <a href="#overview" id="overview"></a>

In this sprint, you will learn about number bases, character encoding, and how values are stored in memory. We'll also talk all about hash tables, a very powerful data structure for getting more performance and flexibility out of your algorithms. Finally, we'll look at optimizing searching through data, as well as the powerful programming technique of recursion.

### Number Bases and Character Encoding <a href="#number-bases-and-character-encoding" id="number-bases-and-character-encoding"></a>

This module will teach about RAM, number bases, fixed-width integers, how arrays are stored in memory, and character encoding. These basics allow you to better understand how other data structures are stored in memory and have an intuitive sense of the time complexity of specific data structures' operations.

### Hash Tables I <a href="#hash-tables-i" id="hash-tables-i"></a>

In this module, you will learn about the properties of hash tables, hash functions, and how to implement a hash table in Python. Hash tables are arguably one of the most important and common data structures you use and encounter to solve algorithmic coding challenges.

### Hash Tables II <a href="#hash-tables-ii" id="hash-tables-ii"></a>

In this module, you will learn about hash collisions and implement a complete hash table in Python that takes collisions into account.

### Searching and Recursion <a href="#searching-and-recursion" id="searching-and-recursion"></a>

This module will teach about logarithms, linear search, binary search, and recursion. This material sets the stage for learning about traversal techniques of trees and graphs. Additionally, using a binary search is a common optimization technique that may come up during a technical interview.

{% embed url="https://codesandbox.io/s/iframes-v9xfe?file=/index.html" %}
