Material covered on the Final
Reading assignments: The entire book plus http://max.cs.kzoo.edu/~abrady/java/sorting/.
Homework: All.
LOGO commands: SENTENCE, NUMBER?, PRINT, AND, OR, NOT, FORWARD,
BACK, RIGHT, LEFT, HOME, CLEARSCREEN, XCOR, YCOR, HEADING, PENDOWN, PENUP,
SETPENCOLOR, SAVE, LOAD, TO, REPEAT, IF, IFELSE, STOP, OP, WAIT, EDIT,
BYE, all numeric operators, RANDOM, SETX, SETY, SETH, LIST,
FPUT, LPUT, REVERSE, FIRST, LAST, BUTFIRST, BUTLAST, EMPTY?, MAKE,
FOR, ARRAY, ITEM, SETITEM, COUNT, RUN, WHILE, TRACE, UNTRACE, STEP,
UNSTEP, EDIT, LISTTOARRAY, ARRAYTOLIST, READWORD, READLIST and
MEMBER?.
Vocabulary/Concepts: interpreted language, argument, procedure,
extensible, variable, state, state transparency, recursion (and
output!), trace, modular programming, pseudocode, flow chart,
algorithms, efficiency, implementation, sort, array, index of an array
element, output, input (READWORD/READLIST) and debugging.
Dijkstra's algorithm will not be on the final.
Be prepared to:
- Answer short questions on programming and teaching.
- Answer essay questions on programming and teaching.
- Translate pseudocode to LOGO.
- Predict the output of a pseudocode program.
- Translate descriptions of algorithms into pseudocode or LOGO.
- Discuss the efficiency of a program or algorithm.
- Write a LOGO program.
- Find the errors in a LOGO program.
Mtht420