© Coding4Youth.org. All rights reserved.
CS205: Advanced Python Data Structure and Algorithm
The course covers recursion, algorithms, and advanced data structures. Such topics include Merge Sorts, Big-O notation, Linked Lists, Trees, and more. By the end of the course, students who succeed are able to understand more advanced algorithms such as merge sorts and implement them using a powerful programming technique called recursion. They will also understand and be able to implement advanced data structures such as a Binary Search Tree. Students will utilize recursion to navigate these data structures in ways that will enhance the way they approach solving problems and will be able to identify commonalities among problems such as divide and conquer problems. This is a continuation of CS202 with more advanced topics. The first class session will cover software installation, configuration, and introductions.
- Learn algorithm analysis
- Understand a variety of Algorithms/Problem Solving such merge sorting using the divide and conquer technique
- Understand and be able to create various advanced data structures such as Linked Lists, Trees, and more.
- Design and develop programs using recursion
Must have completed Intro to Python as well as Artificial Intelligence with Python