Intellectual Olympiad in Informatics - 2026 ongoing
1000 ₸
Subject: Informatics Level: X (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: A breadth-first search starts at vertex S in an unweighted graph. What does the first time a vertex is discovered determine? The number of its outgoing edges, Its final alphabetical position, Its minimum edge distance from S, The total number of graph components