1 - 4 of 4 Chapters
[At the beginning of this chapter, we define the concepts “metaphor” and “analogy” and we discuss their use as a teaching tool—both in general education and in computer science, in particular. We give an overview of prior research publications that discuss various aspects of using metaphors in...
[The first of the three main chapters of this book deals with two graph algorithms. First, we consider the single-source shortest path problem. For this problem, we present our original twist on the balls-and-strings metaphor. We show how our metaphor directly corresponds to the execution of...
[The second main chapter of this book is dedicated to problems from the area of computational geometry. We consider four different problems. First, we discuss the well-known use of the rubber band metaphor to find the Euclidean shortest path in a plane with obstacles. In the second problem, we...
[In the last main chapter we deal with algorithms on strings and sequences. In the first section we consider two elementary data structures: the stack and the queue. We discuss the abundance of flawed metaphors used in education for the queue data structure, and propose better metaphors that...
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.