Computer Science 101: Master the Theory Behind Programming

Kurt Anderson, Computer Scientist, Multi-Media Designer

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
45 Lessons (6h 19m)
    • 1. Introduction

      4:48
    • 2. 1-1 Time Complexity Introduction

      2:12
    • 3. 1-2 Math Refresher: Logarithmic Functions

      11:07
    • 4. 1-3 Math Refresher: Factorial Functions

      3:19
    • 5. 1-4 Math Refresher: Algebraic Expressions

      2:47
    • 6. 1-5 N-notation

      18:55
    • 7. 1-6 Big O Notation

      12:58
    • 8. 1-7 Real World Big-O Example

      9:51
    • 9. 2-1 How is Data Stored

      8:38
    • 10. 2-2 Fixed Array Introduction

      5:09
    • 11. 2-3 Fixed Array Run Times

      12:23
    • 12. 2-4 Binary Search Algorithm (Fixed Array Sorted Search)

      9:59
    • 13. 2-5 Circular Arrays

      8:00
    • 14. 2-6 Dynamic Arrays

      15:51
    • 15. 2-7 Array Review

      7:57
    • 16. 2-8 Array Real World Examples

      5:42
    • 17. 3-1 Nodes

      4:19
    • 18. 3-2 Linked List

      13:36
    • 19. 3-3 Linked List Run Times

      14:59
    • 20. 3-4 Doubly Linked Lists

      8:07
    • 21. 3-5 Tail Pointer

      5:14
    • 22. 3-6 Linked List Review

      3:31
    • 23. 3-7 Linked List Real World Examples

      3:00
    • 24. 4-1 Stacks

      9:41
    • 25. 4-2 Stack Example

      11:05
    • 26. 4-3 Queues

      8:48
    • 27. 4-4 Queue Examples

      9:42
    • 28. 4-5 Queue and Stack Run Times

      6:03
    • 29. 4-6 Stack and Queues Real World Examples

      7:01
    • 30. 5-1 Sorting Algorithm Introdcution

      1:40
    • 31. 5-2 Bubble Sort

      10:12
    • 32. 5-3 Selection Sort

      9:49
    • 33. 5-4 Insertion Sort

      9:03
    • 34. 5-5 Quick Sort

      14:38
    • 35. 5-6 Quick Sort Run Times

      10:31
    • 36. 5-7 Merge Sort

      11:57
    • 37. 5-8 Merge Sort Run Times

      7:39
    • 38. 5-9 Stable vs Nonstable

      6:34
    • 39. 5-10 Sorting Algorithm Real World Examples

      4:01
    • 40. 6-1 Basics of Trees

      7:37
    • 41. 6-2 Binary Search Tree

      8:34
    • 42. 6-3 BST Run Times

      7:36
    • 43. 6-4 Tree Traversals

      13:04
    • 44. 6-5 Tree Real World Examples

      4:29
    • 45. Timing - Project Prep

      6:47
72 students are watching this class