SNOI-SP - NOI Preparation Programme

NOI (National Olympiad in Informatics)
Preparation Programme

Our rigorous programme ensures that our students always place ahead of the curve in the National Olympiad in Informatics (NOI) is a computing competition. Many has won national and international awards and competitions. Numerous have also utilised our programme to help them gain an edge to get into top universities globally.

Our entire NOI Preparation programme consists of 9 modules which will cover from the basics of C++ programming language to advanced algorithms on Directed Acyclic Graph and Trees. 

Programme Roadmap

Our entire NOI Preparation programme consists of 9 modules, taught over 6 terms (18 months).
For current students, click on the module title to go to the course (you must be logged in). Courses will become available to you progressively, aligned with your advancement in the programme.

SNOI101 - CPP Language
No. of lessons: 3
Topics: C++ syntax

SNOI102 - Sorting
No. of lessons: 6
Topics: Sorting algorithm | Algorithm efficiency | Big O notation

SNOI103 - Linear Data Structures
No. of lessons: 7
Topics: Vectors | Stack | Queue | List | Struct

SNOI104 - Divide and Conquer
No. of lessons: 6
Topics: Binary Search | Modulo | Exponentiation | Bit Operations | Bitset

SNOI105 - Non-Linear Data Structures
No. of lessons: 6
Topics: Priority Queue | STL | Set | Multiset | Map | Unordered

SNOI106 - Dynamic Programming
No. of lessons: 12
Topics: Changemaking | Static Sum | Longest Increasing Sequence | Longest Subsequence | Knapsack

SNOI107 - Graph Traversal
No. of lessons: 5
Topics: Graph | DFS | BFS

SNOI108 - Shortest Path Algorithm
No. of lessons: 5
Topics: Bellman-Ford | Dijkstra | Floyd-Warshall

SNOI109 - Directed Acyclic Graph and Trees
No. of lessons: 10
Topics: Cycle Finding | Toposort | DP | Trees | Spanning Tress | Union Find Data | Prim's Algo | Kruskal's Algo

Code. Practice. Win

Every line of code you write is a step closer to mastery—champions are made not in the final round, but in the hours of quiet practice.