Never stop talking " STOP the Gaza Genocide "

هياكل البيانات | RobEdwards

RobEdwards

تفاصيل الكورس

دروس الكورس

  1. 1 | Welcome to Data Structures 02:00:30
  2. 2 | Complexity 1 Introduction to complexity 02:12:38
  3. 3 | Complexity 2 Big Oh Notation 02:05:34
  4. 4 | Complexity 3 Some examples of big-Oh notation 02:08:15
  5. 5 | Java 1 ObjectOrientedProgramming 02:13:18
  6. 6 | Java 2 ComparableGenerics 02:13:16
  7. 7 | Java 3 Introduction to Generic Programming 02:11:13
  8. 8 | Java 4 Parameterized Types 02:11:12
  9. 9 | Java 5 Autoboxing 02:02:21
  10. 10 | Java 6 Exceptions 02:06:37
  11. 11 | LinkedList 1 Introduction 02:08:13
  12. 12 | LinkedList 2 Nodes and Size 02:08:51
  13. 13 | LinkedList 3 Boundary Conditions 02:03:26
  14. 14 | LinkedList 4 addFirst() 02:10:24
  15. 15 | LinkedList 5 addLast() 02:18:57
  16. 16 | LinkedList 6 removeFirst() 02:11:25
  17. 17 | LinkedList 7 removeLast() 02:11:58
  18. 18 | LinkedList 8 remove and find 02:22:53
  19. 19 | LinkedList 9 peek() 02:06:05
  20. 20 | LinkedList 10 Testing the list 02:06:56
  21. 21 | LinkedList 11 Iterators 02:20:36
  22. 22 | LinkedList 12 Double Linked Lists 02:12:11
  23. 23 | LinkedList 13 Circular Linked Lists 02:07:34
  24. 24 | Stacks and Queues 3 Using arrays to write stacks and queues 02:17:29
  25. 25 | Hashes 1 Introduction 02:15:36
  26. 26 | Hashes 2 Hash Functions 02:06:58
  27. 27 | Hashes 3 Collisions 02:05:04
  28. 28 | Hashes 4 Hash Functions for Strings 02:11:16
  29. 29 | Hashes 5 Compressing numbers to fit the size of the array 02:03:36
  30. 30 | Hashes 6 Make an integer positive 02:10:12
  31. 31 | Hashes 7 LoadFactor() 02:02:40
  32. 32 | Hashes 8 Open Addressing 02:10:46
  33. 33 | Hashes 9 Chaining 02:09:41
  34. 34 | Hashes 10 Rehashing 02:10:04
  35. 35 | Hashes 11 the hash class 02:13:23
  36. 36 | Hashes 12 Review of the hash element inner class 02:07:06
  37. 37 | Hashes 13 Constructor for a chained hash. 02:10:40
  38. 38 | Hashes 14 Review of constructors 02:07:13
  39. 39 | Hashes 15 add() and remove() methods 02:09:38
  40. 40 | Hashes 16 getValue() 02:04:58
  41. 41 | Hashes 17 resize 02:10:15
  42. 42 | Hashes 18 KeyIterator 02:11:41
  43. 43 | Trees and heaps 1 Introduction 02:04:13
  44. 44 | Heaps 1 Introduction and Tree levels 02:05:44
  45. 45 | Heaps 2 Add Remove 02:05:57
  46. 46 | Heaps 3 TrickleUp 02:13:25
  47. 47 | Heaps 4 TrickleDown 02:10:59
  48. 48 | Heaps 5 HeapSort 02:08:43
  49. 49 | Trees 2 Complete and Full 02:01:52
  50. 50 | Trees 3 Traversal 02:08:56
  51. 51 | Trees 4 Expression Trees 02:03:35
  52. 52 | Trees 5 Node Class 02:05:38
  53. 53 | Trees 6 recursive add 02:13:36
  54. 54 | Trees 7 Contains 02:05:17
  55. 55 | Trees 8 Remove 02:11:17
  56. 56 | Trees 9 Introduction to rotations 02:08:32
  57. 57 | Trees 10 Rotations 02:08:14
  58. 58 | Trees 11 Coding Rotations 02:12:32
  59. 59 | AVL 1 Introduction 02:11:14
  60. 60 | AVL Tree 2 Nodes 02:03:04
  61. 61 | AVL Tree 3 Adding a node 02:03:35
  62. 62 | AVL Tree 4 recursive add for an AVL tree 02:05:29
  63. 63 | AVL Tree 5 checking balance in an AVL tree 02:04:14
  64. 64 | AVL Tree 6 Rebalancing AVL trees 02:05:33
  65. 65 | AVL Tree 7 complete example of adding data to an AVL tree. 02:20:47
  66. 66 | Red Black Tree 1 The Rules 02:08:10
  67. 67 | Red Black Trees 2 Example of building a tree 02:17:45
  68. 68 | Red Black Tree 3 - Classes 02:06:36
  69. 69 | Red Black Tree 4 - Add methods 02:10:28
  70. 70 | Red Black Tree 5 checking violations in the tree 02:13:42
  71. 71 | Red Black Tree 6 The Rotate method 02:08:00
  72. 72 | Red Black Tree 7 left rotate 02:13:30
  73. 73 | Red Black Tree 8 leftRightRotate 02:03:12
  74. 74 | Red Black Tree 9 height 02:04:05
  75. 75 | Red Black Tree 10 number of black nodes 02:03:23
  76. 76 | Sorts 1 Introduction to sorts 02:08:29
  77. 77 | Sorts 2 Selection Sort 02:04:06
  78. 78 | Sorts 3 Insertion Sort 02:05:23
  79. 79 | Sorts 4 Insertion Sort Code 02:03:30
  80. 80 | Sorts 5 Shell Sort 02:06:53
  81. 81 | Sorts 6 Merge Sort 02:06:48
  82. 82 | Sorts 7 Merge Sort Code 02:09:17
  83. 83 | Sorts 8 Quick Sort 02:09:12
  84. 84 | Sorts 9 Quick Sort Worst Case 02:02:45
  85. 85 | Sorts 10 Quick Sort Code 02:06:47
  86. 86 | Sorts 11 Radix Sort 02:05:17
  87. 87 | Sorts 12 Sort Summary 02:06:14
  88. 88 | Bloom Filters 02:11:06
  89. 89 | k-mer algorithms: Compare and Swap 02:05:15
    تقييمات الطلاب

    ( 5 من 5 )

    ٢ تقييم
    5 نجوم
    100%
    4 نجوم
    0%
    3 نجوم
    0%
    نجمتين
    0%
    نجمة
    0%
    O
    Omar gomaa

    26-08-2025
    Y
    Youtube

    29-07-2024
    Data Structures

    Rob teaches CS310, Data Structures in Java at San Diego State University. These lectures accompany that course. There are both discussions of the topics and demonstrations about how to write the code.