Recursion Focused Listing Tammy VanDeGrift and Kate Deibel March 30, 2004 Focused Listing

This activity allows instructors to see what students associate with recursion.

At the top of the page, write the word "Recursion". In the time allowed, please write as many words or phrases that you associate with recursion below the heading.

Given the free-form nature of this CAT, student answers will encompass a wide range of possibilities. Primarily, it is important for the instructor to prepare his or her own list based on the class's materials.

Here is one possible sample solution:

requires 1 or more base cases
recursive call must make progress to base case
allows repetition
function that calls itself
can be converted to iterative process
some algorithms are naturally recursive
might lead to inefficient implementations
function defined in terms of itself

There might be other points that your students add to this list. The instructor might point out other facts about recursion during the viewing of the lecture.

Create your own list and put it aside.

Read through the student lists and record entries as either "Good", "Questionable," or "Wrong." Note that you do not have to record every list item.

Look over the "Good" entries and add them to you master list if appropriate. Also, select a few entries from the other piles that highlight common misconceptions that you wish to address.

Have students work in groups to complete this activity. The instructor may want to circulate throughout the groups to ensure that each group is making progress. After the groups have completed their lists, the instructor can make a composite list with all phrases from every group. As a group adds a new word or phrase, encourage the groups to explain why this concept relates to recursion. Have students work individually on their lists and then form groups of 4-5 people to discuss their individual lists with other members of the group. Learn concepts and theories Improve skill at paying attention Improve listening skills Learn terms and facts of this subject Recursion Memory Functions LOW LOW LOW LOW Lecture Next Day Summary Straightforward to Enable Functions Iteration Efficiency Compilation