|
via Udemy |
Go to Course: https://www.udemy.com/course/pythondsa/
Title: Comprehensive Self-Study Course on Python Data Structures and Algorithms on Coursera Overview: This course offers an in-depth journey into Python programming focusing on data structures and algorithms. Designed for beginners with no prior coding experience, it emphasizes practical exercises, making complex concepts accessible and engaging. The curriculum is divided into 14 detailed modules covering recursion, stacks, queues, deques, linked lists, trees, graphs, and advanced problem-solving techniques. Course Content: The course's structure ensures a progressive learning experience: - **Recursion (Part 1)**: Master recursive functions through exercises like factorials, Fibonacci sequences, and more. - **Stacks (Part 2), Queues (Part 3), and Deque (Part 4)**: Learn data organization and algorithm optimization. - **Linked Lists (Part 5)**: Explore singly, doubly, and circular linked lists. - **Trees (Part 6)**: Understand binary trees, traversals, and binary search trees. - **Graphs (Part 7)**: Delve into graph structures, applications, and search algorithms. - **Practical Challenges (Parts 8-14)**: Engage in problem-solving exercises with recursion, arrays, stacks, queues, deques, linked lists, and trees, reinforcing theoretical knowledge with real coding tasks. Review: This course stands out for its beginner-friendly approach, with clear explanations and hands-on coding exercises. The module on recursion is particularly well-designed, breaking down complex concepts into manageable steps. The variety of exercises fosters a deep understanding of each data structure's functionality and typical use cases. Additionally, the inclusion of algorithmic challenges ensures that learners not only understand theoretical concepts but can also apply them to solve real-world problems. Recommendation: I highly recommend this course for anyone new to programming who wishes to build a solid foundation in Python and data structures. Its practical orientation and comprehensive coverage make it ideal for aspiring developers, students, or hobbyists eager to enhance their coding skills. With consistent effort, learners will develop a robust understanding of how algorithms work and how to implement them effectively in Python. Conclusion: Whether you're starting from scratch or looking to strengthen your understanding of fundamental programming concepts, this Coursera course provides an excellent path forward. Its engaging content, practical exercises, and step-by-step approach make it a valuable resource for mastering Python data structures and algorithms, setting a strong groundwork for more advanced studies or real-world coding challenges.
หลักสูตร เรียนเขียนโปรแกรม Python Data Structures and Algorithms ด้วยตัวเอง ฉบับคนไม่เคยเขียนโปรแกรมสามารถเรียนได้ทุกคน ไม่จำเป็นต้องมีความรู้ด้านการเขียนโปรแกรมมาก่อน เนื้อหาการเรียน Python Data Structures and Algorithmsแบ่งเป็น 14 ส่วนส่วนที่ 1: Recursions in Python เขียนโปรแกรมด้วยการวนซ้ำตัวเองแบบอัตโนมัติ1. Recursion Exercise 1: Iterative Products Delivery2. Recursion Exercise 2: Recursive Products Delivery3. Recursion Exercise 3: Calculating Factorial4. Recursion Exercise 4.1 Assign Arguments5. Recursion Exercise 4.2 Global Mutable State6. Recursion Exercise 4.3 A List is an example of a Recursive Data Structure7. Recursion Exercise 5.1: List Input of a Recursive Data Structure8. Recursion Exercise 5.2: List Input of a Recursive Data Structure9. Recursion Exercise 6: Fibonacciส่วนที่ 2: Stacks in Python เขียนโปรแกรมด้วยโครงสร้างข้อมูลและอัลกอริทึมแบบสแตก10. Stack Exercise 1: Creating Stack using list Built-in -> List Functions11. Stack Exercise 2: Creating Stack using list Built-in -> Stack = Empty12. Stack Exercise 3: Creating Stack using list Built-in -> Automatics13. Stack Exercise 4: Python Stack Implementation -> Creating Stack Class14. Stack Exercise 5: Coverting Decimal Numbers to Binary Numbers Using Stacksส่วนที่ 3: Queues in Python เขียนโปรแกรมด้วยโครงสร้างข้อมูลและอัลกอริทึมแบบคิว15. Queue Exercise 1: Creating Queue using list Built-in16. Queue Exercise 2: Creating Queue using list Built-in -> Automatics17. Queue Exercise 3: Python Queue Implementation -> Creating Queue Class18. Queue Exercise 4: Circular Queue Implementationส่วนที่ 4: Deque in Python เขียนโปรแกรมด้วยโครงสร้างข้อมูลและอัลกอริทึมแบบเดค19. Deque Exercise 1 - 3: Creating Deque and Deque Operations 1 - 3ส่วนที่ 5: Linked Lists in Python เขียนโปรแกรมด้วยโครงสร้างข้อมูลและอัลกอริทึมแบบลิงก์ลิสต์20. Linked Lists and Big O Notation21. Linked List Exercise 1: Singly Linked Lists22. Linked List Exercise 2: Doubly Linked Lists23. Linked List Exercise 3: Circular Linked Listsส่วนที่ 6: Trees in Python เขียนโปรแกรมด้วยโครงสร้างข้อมูลและอัลกอริทึมแบบต้นไม้24. Understanding Trees Data Structures25. Applications of Tree Data Structures26. Binary Trees and Tree Traversals27. Binary Search Treeส่วนที่ 7: Graph in Python เขียนโปรแกรมด้วยโครงสร้างข้อมูลและอัลกอริทึมแบบกราฟ28. Understanding Graph Data Structures29. Applications of Graph Data Structure30. Graph Search Algorithms31. Graph Exercise 1: Basic Graph32. Graph Exercise 2: Breadth-First Search and Exercise 3: Depth-First Searchส่วนที่ 8: ตะลุยโจทย์ Python Recursion33. Factorial Functions34. Drawing the English Ruler35. Recursion Binary Search Algorithms36. Recursion The Sum of a List of Numbers37. Recursion List Sum38. Recursion Fibonacci Functions39. Recursion Sum of Integer Numbers40. Recursion Sum of the Integers41. Recursion Harmonic Sum42. Recursion Geometric Sum43. Recursion Value of A to the Power B44. Recursion Greatest Common Divisorส่วนที่ 9: ตะลุยโจทย์ Python Arrays45. Dynamic Arrays46. Implementing Dynamic Arrays47. Storing High Scores for a Game48. Caesar Cipher using Array-Based Sequences49. Tic Tac Toeส่วนที่ 10: ตะลุยโจทย์ Python Stacks50. Stacks FILO First In Last Out51. Stacks Reversing Data using a Stack52. Stacks an Algorithm for Matching Delimitersส่วนที่ 11: ตะลุยโจทย์ Python Queues53. Queues FIFO First In First Out54. Queues Priority Queue55. Queues Circular Queueส่วนที่ 12: ตะลุยโจทย์ Python Deques56. Deques Double-Ended Queuesส่วนที่ 13: ตะลุยโจทย์ Python Linked Lists57. Linked List VS Array58. A Single Linked List59. Stack a Single Linked List60. Queue with a Single Linked List61. Circularly Linked Lists62. Doubly Linked Lists63. Deque with a Doubly Linked List64. The Positional List ADT65. Sorting a Positional List66. Maintaining Access Frequenciesส่วนที่ 14: ตะลุยโจทย์ Python Trees67. Introduction to Trees68. Tree Traversals69. Pre/In/Post-Order Traversals70. Binary Search Tree71. Breadth First Traversal72. Count Leaf Nodes73. Finding Root to Leaf Paths