login
Home / Papers / Studied Questions in Data Structures and Algorithms Assessments

Studied Questions in Data Structures and Algorithms Assessments

1 Citations•2023•
I. Gaber, Amir Kirsh, D. Statter
Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1

A case study is described which supports the claim that answering these questions require the "Understand" level of Bloom's taxonomy, and that this strategy fosters more meaningful learning and better assesses students' knowledge.

Abstract

Designing a proper exam that accurately evaluates students' knowledge and skills is one of the important tasks of every teacher. The format of the exams affects the way students learn throughout the course, and a well-designed exam can enhance meaningful learning. In this paper, we address this topic in the context of Data Structures and Algorithms courses, and argue that a good exam should contain questions that students have seen during the semester, and that the grading of those questions should be strict. We describe a case study which, over three semesters, supports the claim that answering these questions require the "Understand" level of Bloom's taxonomy, and that this strategy fosters more meaningful learning and better assesses students' knowledge.