 Resources from Tyler Clark in 2021

Cascading Style Sheets bring order and beauty to our applications.

Text used within elements can be modified with CSS. This includes the type of the font (font-family) as well as the weight, size, and style. Let's customize our H1 with different properties and then condense it all into a shorthand property. 

Modify Font Style in CSS

Elements flow along the page depending on their display values, however we can customize them to be placed literally anywhere. We can position elements absolute or relative to a certain location, as well as fixed to the top of a page.


Positioning HTML Elements using CSS

These special keywords can be used to affect specific selectors in customized ways. For example, when links enter a "hover" state, meaning a user has positioned their mouse over the element, we can apply a new set of styles using the :hover pseudo class. Another great example is styling inputs when a user clicks into it with the :focus pseudo class. 


Customize CSS Selectors with Pseudo Classes

Today the majority of internet traffic comes from mobile devices. So it is essential to understand how to make styles dynamic to different viewport sizes. In this lesson we assign some CSS to a ul and modify the styles depending on the viewport size. 


Use CSS Media Queries to Dynamically Apply Styles

This lesson combines many different css properties together to position a logo and navigation within a website. Together we will use display flex, define colors, and write media queries to give our <header/> life. 

Style a Logo and Navigation on a Website with CSS

JavaScript® (often shortened to JS) is a lightweight, interpreted, object-oriented language with first-class functions, most known as the scripting language for Web pages, but used in many non-browser environments as well such as node.js or Apache CouchDB. It is a prototype-based, multi-paradigm scripting language that is dynamic, and supports object-oriented, imperative, and functional programming styles.

javascript

Binary search is an algorithm that accepts a sorted list and returns a search element from the list. It provides a dramatic performance boost over searching linearly through a list for an element. Let’s play around number of iterations required for each search method to complete and refactor our linear list search into a binary search function. 


Refactor a Linear Search into a Binary Search with JavaScript

While not the fastest sorting algorithm, the selection sort function sorts an array by first creating a new array, calling a function that loops over a list and returns the location of the max/min element, and then pushes that returned indexed value into the newly created array. After the value is added it is then removed from the original list and the process continues until there is nothing left. 


Create a Selection Sort Function in JavaScript

Recursion is when a function calls itself. This self calling function handles at least two cases, the recursive case and the base case. People seem to either love it or hate it because it can be difficult to understand and implement correctly. Let’s walk through a recursive function and refactor a loop to instead perform the same result with a recursive function. 

Refactor a Loop in JavaScript to Use Recursion

Divide and conquer (or D&C) can take some time to comprehend. It is composed by using recursive functions to create a base case and to divide or decrease a problem until it becomes the base case. Let’s create a D&C function to accomplish a task with JavaScript


Create a Divide and Conquer Function in JavaScript

Quicksort is a sorting algorithm that is much faster than selection sort. Quicksort involves working with two subarrays as well as a pivot item. When implemented properly it's on average Big O notation is O(n log n). Let’s explore this function and recreate it to sort a array within JavaScript!

Sort a Array with a QuickSort Function in JavaScript

The breadth-first search is a different kind of search algorithm because it is run against graphs. It is typically used to answer one or both questions, is there a path between point A and point B? As well as, what is the shortest path from point A to point B. It utilizes a queue which is a first in first out data structure. Let’s implement a Breadth-first search function in JavaScript!

Implement a Breadth-first Search Function in JavaScript

Every dynamic programming algorithm starts with a grid. It entails solving subproblems and builds up to solving the big problem. Let’s break down a problem and solve it in pieces using dynamic programming with JavaScript. 


Solve Complex Problems in JavaScript with Dynamic Programming

The k-nearest neighbors algorithm is used for classification of unknown items and involves calculating the distance of the unknown item's neighbors. We'll use Euclidean distance to determine the closest neighbor and make our best guess on what the mystery fruit is. 

Classify Mystery Items with the K-Nearest Neighbors Algorithm in JavaScript

Regression involves analyzing multiple sources of data and predicting a response based off the results of the data. It takes using the k-nearest neighbors algorithm to the next level by choosing a N number of closest neighbors and taking the average between them. Let’s write a function that tries to predict how many pies our restaurant should make today!

Predict Outcomes with Regression Functions in JavaScript

Algorithms are methods that take data, perform a series of tasks, and stop when the answer is found. They’re used in day to day problems and teach you that large problems can be broken down into smaller problems. Sometimes we try to tackle  obstacles head on and become lost in a tangle of if checks. Instead we should take a step back and figure out, what is the root problem and how can we write a maintainable solution that will scale proficiently.     

Introduction to Algorithms in JavaScript

PostgreSQL is a powerful, open source object-relational database system.

postgres

Thanks for watching the course! In this video I am going to walk you through some info that is good to be aware of before watching the course. 

Topics

Instructors

Content Type