Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing
1000 ₸
Subject: Algorithms and Programming Fundamentals Level: IX (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: A directed graph is processed by repeatedly removing vertices with indegree zero. The process stops before all vertices are removed. What can be concluded? The graph is disconnected, The graph contains a negative-weight edge, The graph has more than one valid topological ordering, The graph contains a directed cycle