Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.


Data Structures - Computer Science Course for Beginners

via freeCodeCamp


This course on Data Structures aims to teach learners the fundamentals of Data Structures, including their efficiency measurement and the most common types. The course covers 12 key Data Structures such as Arrays, ArrayLists, Stacks, Queues, Linked Lists, Doubly-Linked Lists, and Dictionaries. By the end of the course, students will have a solid understanding of how these Data Structures work, their methods, and their practical applications. The teaching method involves lecture-style presentations with visual aids and practical examples. This course is designed for beginners in Computer Science who want to build a strong foundation in Data Structures.


) 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.

Taught by


Start your review of Data Structures - Computer Science Course for Beginners

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.