Search

Search Results

• Teaching puzzle-based learning: development of transferable skills

  245-268

  Nickolas Falkner

  Raja Sooriamurthi

  Zbigniew Michalewicz

  Views:

  36

  While computer science and engineering students are trained to recognise familiar problems with known solutions, they may not be sufficiently prepared to address novel real-world problems. A successful computer science graduate does far more than just program and we must train our students to reach the required levels of analytical and computational thinking, rather than hoping that it will just 'develop'. As a step in this direction, we have created and experimented with a new first-year level course, Puzzle-based Learning (PBL), that is aimed at getting students to think about how to frame and solve unstructured problems. The pedagogical goal is increase students' mathematical awareness and general problem solving skills by employing puzzles, which are educational, engaging, and thought provoking. In this paper we continue sharing our experiences in teaching such a course. Whereas a brief discussion on our pedagogical objectives were covered in the first paper together with the material of the first of two lectures on pattern recognition, this follow-up paper presents the material of the second of two lectures, in which additional exercises are discussed to reinforce the lesson. Along the way we provide a glimpse of some foundational ideas of computer science such as incomputability and general system development strategies such as incremental and iterative reasoning. This paper discusses the outcomes of PBL courses, which include expected improvement in the overall results achieved by students who have undertaken PBL courses, compared to those students who have not.

• Teaching puzzle-based learning: development of basic concepts

  183-204

  Nickolas Falkner

  Raja Sooriamurthi

  Zbigniew Michalewicz

  Views:

  17

  While computer science and engineering students are trained to recognise familiar problems with known solutions, they may not be sufficiently prepared to address novel real-world problems. A successful computer science graduate does far more than just program and we must train our students to reach the required levels of analytical and computational thinking, rather than hoping that it will just 'develop'. As a step in this direction, we have created and experimented with a new first-year level course, Puzzle-based Learning (PBL), that is aimed at getting students to think about how to frame and solve unstructured problems. The pedagogical goal is increase students' mathematical awareness and general problem solving skills by employing puzzles, which are educational, engaging, and thought provoking. We share our experiences in teaching such a course – apart from a brief discussion on our pedagogical objectives, we concentrate on discussing the presented material which covers (in two lectures) just one selected topic (pattern recognition). In this paper we present the ideas behind foundations for PBL and the material of the first of two lectures on pattern recognition, in which we address core concepts and provide students with sufficient exemplars to illustrate the main points.

• Brute force on 10 letters

  183-193

  Zoltán Kovács

  István Hudi

  Views:

  31

  We deal with two problems in the set of 10-character-long strings. Both problems can be solved by slightly different methods, but our approach for each is brute force. As we point out, there can be differences in effectivity even in different brute force algorithms. As an additional result, we answer an open question of Raymond Smullyan's.