Get familiar with the system and marking homework online through the homework vectors of thinking to solve the problem (problem solving) . Learn how to evaluate and analyze the complexity of the Algorithmic Complexity (Algorithmic Complexity) to see when a given problem which Algorithm is best suited to solve it.

Get familiar with the basic data structures and algorithms of STL ( Standard Template Library ) library . Sorting, Stack & Queue, String. Applying to practical problems such as:

Become familiar with Algorithms related to graph (Graph) ( Breadth-first search , Depth-first search ) . This is a very important knowledge, widely used in AI and other fields. Solve road and traffic problems:

Build a complete binary tree is used to install the Heap (minHeap & maxHeap), the application creates a priority queue, to reduce the complexity of the route finding algorithms. Get familiar with the Shortest Path Search Algorithm (Graph) Dijkstra installed by priority queue . Solve the problem of finding a way:

Review the knowledge learned, evaluate the Instructor for each student after the first phase of learning. Organize a Mid-Course Exam to help students review what they have learned.

Continue to familiarize yourself with the algorithms related to graph (Graph) ( Bellman-Ford , Floyd-Warshall ) . Application in the fields of finance and banking, financial price prediction. Solving road problems, making friends:

Begin to familiarize yourself with Data Structures and Algorithms related to trees such as Binary Search , Binary Search Tree . Solve real problems:

Get familiar with advanced data structures . T Huat minimum spanning tree problem to find Prim. Application in the construction of network roads, public transport roads. Trie tree structure (prefix tree) . The structure is especially suitable for search suggestion applications. Solve road problems:

Advanced Structure Disjoint Set Union Application in Machine Learning and AI. Interview training guides how to practice Interview using Algorithm. Share and ask questions. The final exam will be held at the End of Course in order to reevaluate the students' learning process and award certificates of completion of the course.