Assess students' ability to design, interpret, and trace simple algorithms using flowcharts and pseudocode; tasks include translating short problem statements into clear step-by-step algorithms, using sequence/selection/iteration correctly, writing concise pseudocode for small tasks (e.g., loops and conditionals), and tracing execution with sample inputs to predict outputs or locate logic errors. Emphasize correctness, clarity, and basic debugging.