|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/pythondsa/
课程评论：没有评论
Course Title: Python Data Structures and Algorithms Fundamentals (เรียน Python Data Structures and Algorithms ฉบับปูพื้นฐาน) This comprehensive Python course is designed for beginners with no prior programming experience. It delves into essential data structures and algorithms, providing a solid foundation for aspiring programmers. **Course Breakdown:** The course is divided into 14 modules, covering a wide range of topics: * **Module 1: Recursion in Python:** Learn the concept of self-referential programming through various exercises, including calculating factorials, understanding recursive data structures, and implementing Fibonacci sequences. * **Module 2: Stacks in Python:** Explore stack data structures, including implementation using Python's built-in list functions and creating custom stack classes, with practical applications like converting decimal to binary. * **Module 3: Queues in Python:** Master queue data structures, covering implementations using built-in lists, custom classes, and circular queues, understanding the First-In, First-Out (FIFO) principle. * **Module 4: Deques in Python:** Learn about double-ended queues (Deques) and their operations. * **Module 5: Linked Lists in Python:** Understand linked lists, including singly, doubly, and circular linked lists, along with Big O notation for analyzing their efficiency. * **Module 6: Trees in Python:** Dive into tree data structures, their various types (including binary trees and binary search trees), and traversal methods used in applications. * **Module 7: Graphs in Python:** Grasp graph data structures, their applications, and common graph traversal algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS). * **Module 8: Python Recursion Practice:** Reinforce recursion concepts with a variety of problem-solving exercises, including factorial, binary search, list summation, and calculating sums involving geometric and harmonic series. * **Module 9: Python Arrays Practice:** Work through array-based problems, from dynamic arrays and implementing them to practical applications like Caesar ciphers and Tic Tac Toe. * **Module 10: Python Stacks Practice:** Solve problems related to stacks, focusing on the Last-In, First-Out (LIFO) principle, reversing data, and matching delimiters. * **Module 11: Python Queues Practice:** Practice queue applications, emphasizing FIFO, priority queues, and circular queues. * **Module 12: Python Deques Practice:** Focus on solving problems involving double-ended queues. * **Module 13: Python Linked Lists Practice:** Engage in hands-on exercises comparing linked lists with arrays, implementing various types of linked lists (singly, doubly, circular), and using them for stacks, queues, and positional lists, including sorting and frequency maintenance. * **Module 14: Python Trees Practice:** Tackle a wide range of tree-related problems, including traversals (pre-order, in-order, post-order), binary search trees, breadth-first traversal, counting leaf nodes, and finding root-to-leaf paths. This course aims to equip learners with the fundamental knowledge of data structures and algorithms in Python, enabling them to build efficient and well-structured programs.
หลักสูตร เรียนเขียนโปรแกรม 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
