5 Written questions
5 Matching questions
- circularly linked list
- a last-in, first out: describes the order of a stack.
- b 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.
- c O(n2), a problem whose solution requires a quadratic amount of time or space if the problem is of size n.
- d to convert from a pointer (address) to the data that is pointed to.
- e a linked list in which the last element points back to the first element.
5 Multiple choice questions
- a data structure representing a sequence of items, which are removed in the same order as they were inserted.
- given two sets, the intersection is the set of elements that are members of both sets.
- a character code that maps between binary numbers and the characters used in most modern languages, more than 110,000 characters. The lowest values of the UTF-8 encoding of Unicode are the same as ASCII, allowing characters to be 8 bits when staying within the ASCII character set. For other languages, more bits are used. Java uses Unicode.
- a pointer to data.
- to combine two ordered linear structures into one.
5 True/False questions
set difference → a pointer to data.
scope → an item (or description of items) being sought in a search.
first-child/next-sibling → a case where two data structures share some elements.
child → in object-oriented programming, a description of a set of similar objects.
goal → 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.