This course provides an in-depth understanding of data storage principles using Arrays, Array Lists, and linked list nodes. Through visualizations, you will learn about their operations and performance. The course covers implementing low-level linear and related data structures with recursive methods and explores edge cases.
You'll also extend these structures to Abstract Data Types like Stacks, Queues, and Deques. While prior knowledge of Java and object-oriented programming is required, no previous experience with data structures or algorithms is necessary.
🆓 Free to Audit
🕒 Approx. 5 Weeks
✏️ Intermediate Level
🧾 Paid Certificate Available Upon Completion
🎓 Offered by Georgia Institute of Technology (Georgia Tech) via edX
