Designing Courseware on Algorithms for Active Learning with Virtual Board Games Nils Faltin Department of Computer Science University of Oldenburg [email protected].

Designing Courseware on Algorithms for Active Learning with Virtual Board Games

Nils Faltin

Department of Computer Science

University of Oldenburg

[email protected]

Nils Faltin Designing Courseware on Algorithms ...

2

Contents

• Didactical Goals in learning an algorithm• Textbook vs. courseware, role of exercises• Design method SALA

– Structuring into sections– Treatment of functions– Virtual board game

• Material prototype tests• Example courseware products


3

Goals in Learning an Algorithm

algorithm operationsdata-linking

data-properties

steps-which

steps-why

modify analyze code

compare


4

From textbook to courseware

?


5

Structuring Algorithm Courseware into Sections

Why split into sections?

Typical sections:• Problem• Comparison of Algorithms• Link structure and ordering properties• Functions of the Algorithm• Implementation


6

Structuring the Heapsort Courseware

• Sorting problem• Heapsort vs. other sorting

algoritms

• Complete binary tree

• Heap property

• Each Function

• Storing the heap and the result list


7

Heapsort Functions

heapify-locally

heapsort

move-maxheapify

*

build-heap

*

sort

*


8

Learning an Algorithm Function

1 Problem statement– purpose of new function– available functions– sketch code of new function?

2 Problem solving exercise– sequence of applying av. functions to data example– experiment: virtual board game

3 Standard solution– explain the function code – student practices the steps (virtual board game)


9

Virtual board game

• Visual display of data structure• Functions by direct manipulation• Room for errors• Visual and textual feedback• Name: „virtual board game“


10

Using the heapify function

pre-condition: child trees heap ordered

post-condition

heapify


11

Virtual board game for build-heap

heapify

heapify-locally

swap

Done

Wrong! child trees must be heap

Redundant!

OK! Heapified

OK! Heapified

OK! Heapified

OK! Heapified

You succeeded!


12

Material Game Prototypes

• Test vbg-idea, learning process• Card board and flanell prototype• Informal tests

– aid in explaining– students liked it– alternative solutions– linked tree?

• Prototype test good for courseware design


13

Courseware: Binomial heap

• Courseware we developped– Master thesis– Web based

• Binomial heap courseware– developed after SALA– formally evaluated– demo: union function


14

Union function


15


16


17


18


19


20


21


22


23

Courseware: ESPRESSO logic minimizer


24

Courseware: LALR parser generator


25

Conclusion and future work

• Method SALA (PhD thesis)• Courseware for active learning

– www-cg-hci.informatik.uni-oldenburg.de

• Positive feedback from authors and users• Qualitative and quantitative evaluation• Potential of courseware for active learning

Designing Courseware on Algorithms for Active Learning with Virtual Board Games Nils Faltin Department of Computer Science University of Oldenburg [email protected].

Documents

courseware design slide

binomial heap courseware

union function slide

steps virtual board

algorithm implementation

result list slide

algorithm function

heapsort functions