Computer Science 101: Master the Theory Behind Programming

Let's jump in to one of the core concepts of Computer Science. The analysis of Time Complexity! 

Let's go over the log function and how it's important to computer science. 

Let's go over factorials and how they related to computer science. 

Let's go over algebraic expressions and how they relate to computer science. 

Some notes on the refresher course and how it ties in to computer science. 

Let's begin our analysis with one of Computer Science's fundamental concepts, n-notation.

Let's go more in-depth into n-notation for computer science.

Let's go over an example in n-notation. This will apply some concrete numbers to this computer science concept.

In Computer Science, n-Notation is usually combined with the important Big O Notation.

Let's go over some notes on n-Notation. 

Let's put together everything we have learned and test our comprehension! 

Let's take this concept and look at a real world example to help reinforce it a little bit better. 

Let's take a step back and look at how data is stored in computer's. This study will help us understand different computer science data structures like arrays, linked lists, and so on. 

Learn about the computer science run times of different operations associated with arrays.

Learn about the binary search algorithm, and how it applies to a sorted fixed array in computer science.

Here is a good summary to reinforce the main concepts about an array! 

Let's take a look at and extension of the computer science array data structure, the circular array. With just a small change, we can improve some of the run times, and make this data structure even more flexible. 

Let's look at another improvement we can add to arrays, the ability to scale with the data. We will also look at the most efficient way to do this, making the insertion still amortized O(1) time. 

Learn the math behind why in some computer science problems we can approximate O(n) -> O(1)

Let's reinforce what we have learned with a quick review using text. 

Let's bring all of these computer science array patterns together with a single video. 

Lets look at some applications for the array, and how it's used in the real world. This will help cement what exactly an array is and when you might use one. 

Let's cement our learning with a quiz! 

Let's discuss a key computer science element to hold data. The node. These are very versatile data structures which can be used to create trees and linked lists. 

Through combining nodes, we have the ability to form a different data structure, the linked list. This computer science data structure gives us the ability to link data from multiple places! 

Let's take a step back and reinforce the singly linked lists and how they help with different computer science operations. 

These are very similar to singly linked lists. They give us a little bit more flexibility and some time improvements, which are always great in the computer science field!  

These help improve our access time to the back of a linked list. This allows constant time to both the back and front of the list, giving us a lot more application with them in Computer Science. 

Let's take a step back and look at these improvements and how they are important to Computer Science. 

Let's go over some Linked List real world examples in Computer Science. 

Let's go over everything together at once. Now you should have a good understanding of the Computer Science linked list data structure. 

Let's make sure we know the main points of a linked list! 

Now that we have a couple of data structures under our belt, we can begin to combine them to make new data structures. This constant improvement is something that is common in Computer Science. 

Lets take a look at some examples of stacks and how we might parse through them. These types of questions are common on Computer Science tests. 

Let's reinforce all of the ideas behind stacks and how they are applied in the computer science curriculum. 

Let's take a look at the Stack's brother, the queue. The big difference is where insertion and removal happen. Both of these data structures have wide applications within computer science. 

Let's take a look at a few examples and how these queues are built. This will also give you an idea of their usefulness within Computer Science. 

Let's tie it all together with a quick summary of what we have learned and how it applies to computer science. 

Let's take a look at the run times of both of these operations and how we might build them to give us the best run times. In computer science it is essential to get these fast run times. 

Let's go over some real world examples of Stacks and Queues in Computer Science. 

Let's test our knowledge with a stacks and queues quiz. 

Let's go over one of the trickier problems in the last quiz! 

Let's discuss one of the most important aspects of computer science, sorting. 

The first sort we will cover is the bubble sort. This is typically the first sorting algorithm to be introduced in the computer science ciriculum. The reason for this is because of it's simplicity and how easy it is to analyze why it's bad. 

Let's break Bubble sort down just a little bit more and how it ties in to computer science. 

Selection sort is the next logical step, as it performs pretty similar to that of bubble sort with a slight change. A sorted and unsorted region. This new addition makes it the next logical step in the computer science curriculum.  

Let's summarize what we have learned about selection sort and how it applies to computer science. 

Let's go over some of the key concepts of Bubble and Selection Sort. 

The next step on our journey is insertion sort. It is very similar to selection sort, but adds a little bit more ingenuity. This is the next logical step and gives us the the last piece of the puzzle to start building more advanced algorithms. This is why computer science classes typically cover this sorting algorithm here. 

Let's summarize what we have learned about insertion sort and how it ties to computer science. 

Let's start getting in to the faster computer science sorting algorithms. Quick sort implements a divide and conquer method to begin dividing up the work in more efficient manners. 

Let's take a look at the run time for quick sort and how it we are able to derive this run time. 

Let's summarize what we have learned about quick sort and how it applies to computer science. 

Let's do some test problems on Insertion and Quick Sort

Now let's move to one of our fastest sorting algorithms. Although quick sort is technically faster, merge sort has a consistent speed which makes it more reliable. This and quick sort are frequently used within computer science.  

Let's take a look at the run times this sort offers us and how with our computer science knowledge we can figure these run times out. 

Let's summarize what we have learned about merge sort and how it applies to computer science. 

Let's discuss a topic that is important to sorting algorithms stability. This is an important part to consider when discussing these algorithms with respect to computer science. 

Let's summarize stability and how it applies to computer science. 

Let's reinforce the key concepts of Merge Sort and Stability. 

Let's discuss another important aspect of computer science, the basics of trees. 

We can use trees to build another important aspect of computer science, the BST or the binary search tree. 

Le'ts look at the run times of these neat computer science data structures. 

Let's reinforce some of the important ideas about Trees. 

Another important aspect of trees and computer science, the tree traversals. 

Let's take a look at some real world applications of trees in Computer Science. 

Learn about heaps and how they are different from trees in computer science. 

Learn about some of the applications of heaps. 

We will learn the basics of graphs and how graphs are different than charts in computer science.

We will learn about directed, undirected and weighed graphs in computer science.

Learn how to use a depth first search, which is not only important for graphs, but many other computer science topics.

Learn about how to use Breadth First Search with graphs in Computer Science

Learn about the run times of BFS and DFS in Computer Science.

Thanks everyone for joining me in this computer science course!