Routing configuration tasks constitute a core component of computer networking education. However, the evaluation of such tasks is traditionally performed manually or through direct comparison of routing table entries, both of which suffer from limitations in scalability, consistency, and fairness. Structural comparison of configurations cannot reliably capture intended network behavior, because different routing implementations may produce identical forwarding outcomes, while seemingly similar configurations may lead to forwarding errors such as unreachable subnets or routing loops. This thesis proposes automated verification and evaluation of network routing configurations. The framework reformulates routing configuration assessment as the verification of constrained network properties. Instead of comparing configuration syntax, the system evaluates behavioral correctness by verifying data-plane properties derived from each question's target prefix set.