The exam evaluates computational thinking, programming, and algorithmic problem-solving. Key topics include Reverse Polish Notation, graph theory with adjacency matrices and Dijkstra′s algorithm, and theoretical computer science concepts like the Halting problem and Turing machines. Programming tasks involve implementing prime number checks, adapting skeleton programs to modify tile points and hand size, optimizing search algorithms with binary search, and extending functionality for scoring prefixes of valid words. Additional tasks address frequency analysis and recursive subroutine development. The paper emphasizes practical programming, data structure implementation, and applying theoretical concepts to algorithmic and real-world challenges.