5 Written questions
5 Matching questions
- circular queue
- circularly linked list
- a 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.
- b O(n2), a problem whose solution requires a quadratic amount of time or space if the problem is of size n.
- c a linked list in which the last element points back to the first element.
- d a case where a program calls itself.
- e a queue implemented within an array, where the first element of the array logically follows the last element.
5 Multiple choice questions
- first-in, first-out: describes the ordering of a queue. A queue is fair.
- an order of processing a tree in which the parent node is processed after its children.
- given two sets, the set difference is the set of elements of the first set that are not members of the second set.
- to combine two ordered linear structures into one.
- a formal description of a language in terms of vocabulary and rules for writing phrases and sentences.
5 True/False questions
gedanken → a variable containing the address of other data.
DFS → 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.
successor → in a tree, the union of a node's parent and the parent's ancestors.
association list → a sequence of records, where each record contains a link to the next one.
first-child/next-sibling → a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.