5 Written questions
5 Matching questions
- base case
- random access
- set difference
- a describes a data structure or device in which all accesses have the same cost, O(1).
- b a tree node containing a contents value but with no children.
- c a simple case that can be solved easily, without recursion.
- d describes a process in which every arriving customer will eventually be served.
- e given two sets, the set difference is the set of elements of the first set that are not members of the second set.
5 Multiple choice questions
- describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.
- (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.
- in a search tree, the number of children of a given node. Often, the branching factors of individual nodes will vary, so an average value may be used.
- 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.
- an item (or description of items) being sought in a search.
5 True/False questions
recursive case → a condition of the input data where the data will be handled by call(s) to the same program.
destructive → a problem that is so hard (typically exponential) that it cannot be solved unless the problem is small.
divide and conquer → a problem-solving strategy in which a problem is broken down into sub-problems, until simple subproblems are reached.
word → 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.
ancestors → in a tree, the union of a node's parent and the parent's ancestors.