Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing

Subject: Algorithms and Programming Fundamentals
Level: IX
Category: student
Quiz questions: in English
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