
Course Information
Unleash the power of computer science with our data structure and algorithm course for children! This course is designed to ignite your child's curiosity and passion for computer science, by introducing them to the building blocks of programming. They will learn how to organize and manage data with efficiency, and how to use algorithms to solve problems in creative ways. Our experienced instructors will guide them every step of the way, ensuring they master the concepts and are able to apply them to their own projects.
With our course, your child will be able to navigate through complex data and tackle challenging problems with ease. They will learn to think like computer scientists, and to approach problems with logical and analytical thinking. By the end of the course, your child will have a portfolio of their own projects, showcasing their newly acquired skills and knowledge.
This is an opportunity for your child to develop a valuable skill set that will open up many doors for them in the tech industry, and to discover the power and potential of computer science. Don't miss out on this amazing opportunity, enroll your child today and watch them thrive as they learn and create with our data structure and algorithm course for children!
Course Duration:
Class Consumption:
Prerequisites:
Table of Course Content
Please take note that this content is subjected to change. Click the left black triangle to view details of each section.
Data Structure and Algorithms
- Why We Need Algorithms?
- Basic Algorithms Example
- Complexity I
- Complexity II
Linear Lists
- Linear Lists
- Array
- Linked Lists
- More Examples
Stack and Queue
- Recursive Algorithms
- Stack
- Use Stack to Mimic Recursive Algorithms
- Queue
- More Examples
String Algorithms
- Use Brute Force to Compare String
- KMP Algorithm I
- KMP Algorithm II
- KMP Applications and Other Algorithms
Binary Tree
- Binary Tree Introduction
- Binary Tree Traversal
- Binary Tree Applications I
- Binary Tree Applications II
Sorting
- Basic Sorting I
- Basic Sorting II
- Merge Sort
- Quick Sort I
- Quick Sort II
Other Tree Structures
- Binary Search Tree
- Heap I
- Heap II
- Huffman Tree
Graph
- Graph Introduction
- DFS
- BFS
- Shortest Path
- Minimum Spanning Tree
- Topology Sort
