← CS 314 Novak Test
5 Written Questions
5 Matching Questions
- runtime stack
- a a stack containing a stack frame of variable values for each active invocation of a procedure.
- b the area of program text over which a variable can be referenced.
- c all nodes below a given node in a tree.
- d a group of bits that are treated as a unit and processed in parallel by a computer CPU. Common word sizes are 32 bits and 64 bits.
- e (pronounced "ask-key") an abbreviation of American Standard Code for Information Interchange, a character code that maps between 8-bit binary integers and characters such as letters, numbers, and punctuation. There are 256 possible ASCII codes, of which 95 are printable.
5 Multiple Choice Questions
- a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
- 1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. a cons data structure. 3. to make a cons data structure.
- a case where a program calls itself.
- to look through a data structure until a goal object is found.
- a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
5 True/False Questions
FIFO → first-in, first-out: describes the ordering of a queue. A queue is fair.
Unicode → the area of program text over which a variable can be referenced.
filter → first-in, first-out: describes the ordering of a queue. A queue is fair.
depth → to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.
link → last-in, first out: describes the order of a stack.