Four Semesters of Computer Science in 5 Hours
This course tackles some of the most fundamental computer science topics in just five hours, including algorithms and Big O analysis, recursion, sorting, data structures, and functional programming.
What you'll learn
This course, Four Semesters of Computer Science in 5 Hours, tackles some big topics in just five hours: algorithms and Big O analysis, recursion, sorting, data structures, and functional programming. Since many developers are self-taught, they can lack the advantages that a formal computer science education provides. The additional theory covered in this course provides useful context to make trade-offs when designing implementations and architectures.
Table of contents
- Array List 5m
- Exercise 6: Array List 4m
- Exercise 6 Solution 8m
- Linked List 11m
- Exercise 7: Linked List 6m
- Exercise 7 Solution, Part 1 9m
- Exercise 7 Solution, Part 2 8m
- Binary Search Tree 6m
- Exercise 8: Binary Search Tree 6m
- Exercise 8 Solution 8m
- AVL Tree 5m
- Single Rotation 11m
- Double Rotation 6m
- Exercise 9 Solution, Part 1 7m
- Exercise 9 Solution, Part 2 9m
- Hash Table 9m