Competitive Programming Course
What will I learn?
Ithute botsipa jwa go rarabolola Mathata a Morekisi yo o Tsamayang ka Khoso ya rona ya Thuto ya go Logagana ka go Dira Diporokeramo, e e diretsweng bomankge ba thekenoloji ba ba batlang go tokafatsa bokgoni jwa bone jwa di-algorithm. Ithute ka botlalo ka di-data structures tse di dirang sentle, mekgwa ya go boela morago (backtracking), le kemedi ya digarafo (graph representation). Sekaseka mekgwa ya go tokafatsa dilo jaaka branch and bound, di-algorithm tsa kakanyo (approximation algorithms), le di-heuristics. Ithute dynamic programming, di-algorithm tsa bogagaru (greedy algorithms), le mekgwa ya brute force. Itlhaganelele dikgang tse di kwa godimo, go akaretsa parallel computing le NP-hardness, fa o ntse o tokafatsa maano a gago a go leka le go baakanya diphoso (debugging).
Apoia's Unique Advantages
Develop skills
Enhance the development of the practical skills listed below
Nna le bokgoni jwa di-data structures tse di dirang sentle go bona maduo a a botoka a di-algorithm.
Dirisa mekgwa ya go boela morago (backtracking) go rarabolola mathata a a thata.
Dirisa kemedi ya digarafo (graph representation) go dira dipopego tse di mosola tsa mathata.
Dirisa mekgwa ya heuristic go bona tharabololo e e bonako le e e atumetseng.
Dira dikgetsi tsa diteko (test cases) go netefatsa gore tharabololo e a tsepama.
Suggested summary
Workload: between 4 and 360 hours
Before starting, you can modify the chapters and the workload.
- Choose which chapter to start with
- Add or remove chapters
- Increase or decrease the course workload
Examples of chapters you can add
You’ll be able to generate more chapters like the examples below
This is a free course, focused on personal and professional development. It is not equivalent to a technical, undergraduate, or postgraduate course, but offers practical and relevant knowledge for your professional journey.