NAME

Question types


Start with


Question limit

of 105 available terms

Advertisement Upgrade to remove ads
Print test

5 Written questions

5 Matching questions

  1. What does the function merge do?
  2. What is random access?
  3. What does it mean for functions to share structure?
  4. What is XML?
  5. What is a pointer (aka reference)?
  1. a It combines two sorted lists into one sorted list. Duplicated elements are retained.
  2. b describes a data structure in which all accesses have the same costs, O(1). e.g. an array.
  3. c Extensible Markup Language, it allows users to put tags around their data to describe what the pieces of data mean. <city> Austin </city>
  4. d The memory address of the beginning of a record, or block of storage
  5. e The same list structure is part of more than one list.

5 Multiple choice questions

  1. It makes a new linked list whose elements are in reverse order of the original list
  2. Slowly. log(1000) = 10, log(1,000,000) = 20, log(1,000,000,000) = 30.
  3. an order of processing a tree in which the parent node is processed in between its children
  4. car and cdr (original names), or first and rest.
  5. A kind of graph composed of nodes and links. It has one root node. Each node except the root has exactly one parent. All nodes are reachable from the root.

5 True/False questions

  1. What does the function Intersection do?It returns a set of elements that are members of both sets. (intersection '(i c e) '(c r e a m)) = (e c)

          

  2. When the ratio of times as the size of input is doubled is about 8, what is the Big O?O(n²)

          

  3. What is well-founded ordering?ordering that can guarantee to terminate (go down to zero)

          

  4. For reference types, what do == and != test?The equality of pointer values (i.e. do they have the exact same data address in memory?)

          

  5. What is a node with no children called?a leaf

          

Create Set