Data Structures Easy to Advanced Course

Mark as Favorite Share
image

What Will You Learn?

Learn and master the most common data structures in this full course from Google engineer William Fiset. This course teaches data structures to beginners using high quality animations to represent the data structures visually.
You will learn how to code various data structures together with simple to follow step-by-step instructions. Every data structure presented will be accompanied by some working source code (in Java) to solidify your understanding.

About This Course

Provider: Youtube
Format: Online
Duration: 8 hours to complete [Approx]
Target Audience: Beginners
Learning Objectives: Upon completing this free course, you will be able to learn and master the most common data structures and acquire the skills to code various data structures, and each concept will be reinforced with working Java source code to solidify your understanding.
Course Prerequisites: NA
Assessment and Certification: NA
Instructor: Freecodecamp
Key Topics: Data Structures, Java Programming Language
Topic Covered: 
  2. - Abstract data types
  3. - Introduction to Big-O
  4. - Dynamic and Static Arrays
  5. - Dynamic Array Code
  6. - Linked Lists Introduction
  7. - Doubly Linked List Code
  8. - Stack Introduction
  9. - Stack Implementation
  10. - Stack Code
  11. - Queue Introduction
  12. - Queue Implementation
  13. - Queue Code
  14. - Priority Queue Introduction
  15. - Priority Queue Min Heaps and Max Heaps
  16. - Priority Queue Inserting Elements
  17. - Priority Queue Removing Elements
  18. - Priority Queue Code
  19. - Union Find Introduction
  20. - Union Find Kruskal's Algorithm
  21. - Union Find - Union and Find Operations
  22. - Union Find Path Compression
  23. - Union Find Code
  24. - Binary Search Tree Introduction
  25. - Binary Search Tree Insertion
  26. - Binary Search Tree Removal
  27. - Binary Search Tree Traversals
  28. - Binary Search Tree Code
  29. - Hash table hash function
  30. - Hash table separate chaining
  31. - Hash table separate chaining source code
  32. - Hash table open addressing
  33. - Hash table linear probing
  34. - Hash table quadratic probing
  35. - Hash table double hashing
  36. - Hash table open addressing removing
  37. - Hash table open addressing code
  38. - Fenwick Tree range queries
  39. - Fenwick Tree point updates
  40. - Fenwick Tree construction
  41. - Fenwick tree source code
  42. - Suffix Array introduction
  43. - Longest Common Prefix  array
  44. - Suffix array finding unique substrings
  45. - Longest common substring problem suffix array
  46. - Longest Repeated Substring suffix array
  47. - Balanced binary search tree rotations
  48. - AVL tree insertion
  49. - AVL tree removals
  50. - AVL tree source code
  51. - Indexed Priority Queue | Data Structure
  52. - Indexed Priority Queue | Data Structure | Source Code

0 Comments

No reviews yet !!

Please login first

Course Tags
Data Structure Course Data Structure Free Course Top Free Course Learn Data Structure Data Structure Course For Beginners Data Structure From Basic To Advance