5 Written questions
5 Matching questions
- random access
- virtual machine
- a in a tree search, to move back from the node currently being examined to its parent.
- b the number of links between the root of a tree and the leaves.
- c an abstract computer that is simulated by an interpreter program running on an actual computer.
- d describes a data structure or device in which all accesses have the same cost, O(1).
- e a process that removes unwanted elements from a collection.
5 Multiple choice questions
- an ordering that can be guaranteed to terminate, e.g. starting at a positive integer and counting down to 0.
- an abstracted function that describes the amount of computer time or memory space required by an algorithm, as a function of problem size. For problems larger than a certain size, the actual time or space required will be less than the Big O multiplied by some constant.
- search of a binary tree or other structure, in which the size of the set to be searched is cut in half at each step.
- last-in, first out: describes the order of a stack.
- a case where two data structures share some elements.
5 True/False questions
stack space → a simple case that can be solved easily, without recursion.
DFS → eXtensible Markup Language, a way of writing data in a tree-structured form by enclosing items in pairs of opening and closing tags, e.g. <zipcode> 78712 </zipcode>
null dereference → to convert from a pointer (address) to the data that is pointed to.
ASCII → describes a process in which every arriving customer will eventually be served.
circularly linked list → a linked list in which the last element points back to the first element.