An Introduction to Data Structures

Overview

Dive into a comprehensive 3-hour lecture-style course on data structures in computer science. Explore the fundamentals of data structures, learn how to measure their efficiency using Big O notation, and delve into 12 of the most common data structures essential for any computer science journey. Cover arrays, ArrayLists, stacks, queues, linked lists, doubly-linked lists, dictionaries, hash tables, trees, tries, heaps, and graphs. Gain insights into their structure, implementation, time complexity, and real-world applications. Perfect for beginners and those looking to solidify their understanding of these crucial computer science concepts.

Syllabus

Introduction
⌨️ Timestamps
⌨️ Script and Visuals
⌨️ References + Research
⌨️ Questions
⌨️ Shameless Plug
⌨️ What are Data Structures?
⌨️ Series Overview
Measuring Efficiency with BigO Notation
⌨️ Time Complexity Equations
⌨️ The Meaning of BigO
⌨️ Why BigO?
⌨️ Quick Recap
⌨️ Types of Time Complexity Equations
⌨️ Final Note on Time Complexity Equations
The Array
⌨️ Array Basics
⌨️ Array Names
⌨️ Parallel Arrays
⌨️ Array Types
⌨️ Array Size
⌨️ Creating Arrays
⌨️ Populate-First Arrays
⌨️ Populate-Later Arrays
⌨️ Numerical Indexes
⌨️ Replacing information in an Array
⌨️ 2-Dimensional Arrays
⌨️ Arrays as a Data Structure
⌨️ Pros and Cons
The ArrayList
⌨️ Structure of the ArrayList
⌨️ Initializing an ArrayList
⌨️ ArrayList Functionality
⌨️ ArrayList Methods
⌨️ Add Method
⌨️ Remove Method
⌨️ Get Method
⌨️ Set Method
⌨️ Clear Method
⌨️ toArray Method
⌨️ ArrayList as a Data Structure
⌨️ Comparing and Contrasting with Arrays
The Stack
⌨️ The Different types of Data Structures
⌨️ Random Access Data Structures
⌨️ Sequential Access Data Structures
⌨️ Stack Basics
⌨️ Common Stack Methods
⌨️ Push Method
⌨️ Pop Method
⌨️ Peek Method
⌨️ Contains Method
⌨️ Time Complexity Equations
⌨️ Uses for Stacks
The Queue
⌨️ Queue Basics
⌨️ Common Queue Methods
⌨️ Enqueue Method
⌨️ Dequeue Method
⌨️ Peek Method
⌨️ Contains Method
⌨️ Time Complexity Equations
⌨️ Common Queue Uses
The Linked List
⌨️ LinkedList Visualization
⌨️ Adding and Removing Information
⌨️ Time Complexity Equations
⌨️ Uses for LinkedLists
The Doubly-LinkedList
⌨️ Visualization
⌨️ Adding and Removing Information
⌨️ Time Complexity Equations
⌨️ Uses of a Doubly-LinkedList
The Dictionary
⌨️ Dictionary Basics
⌨️ Indexing Dictionaries
⌨️ Dictionary Properties
Hash Table Mini-Lesson
⌨️ Time Complexity Equations
Trees
⌨️ Introduction to Hierarchical Data
⌨️ Formal Background on the Tree
⌨️ Tree Terminology and Visualization
⌨️ Different types of Trees
⌨️ Uses for the Tree
Tries
⌨️ Trie Basics
⌨️ Trie Visualization
⌨️ Flagging
⌨️ Uses for Tries
Heaps
⌨️ Heap Basics
⌨️ Min-Heaps
⌨️ Max-Heaps
⌨️ Building Heaps
⌨️ Deleting from Heaps
⌨️ Heap Implementations
Graphs
⌨️ Graph Basics
⌨️ Directed vs. Undirected Graphs
⌨️ Cyclic vs. Acyclic Graphs
⌨️ Weighted Graphs
⌨️ Types of Graphs
Conclusion
Shameless Plug