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 are the different representations of trees that we are concerned with for Novak's class?
  2. What is a node with no children called?
  3. What is the Big O of inserting at the front of a LinkedList?
  4. What is a link?
  5. How can you find the Big O of an if statement?
  1. a O(1)
  2. b Binary trees, First-Child/Next-sibling, Linked lists, Implicit
  3. c a leaf
  4. d A directed pointer from one node to another
  5. e The max of the Big O of the test, then statement, and else statement

5 Multiple choice questions

  1. 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.
  2. It returns the set of elements that are members of either set (basically all elements with no duplicates).
    (union '(i c e) '(c r e a m)) = (i c r e a m)
  3. Exponential
  4. an order of processing a tree in which the parent node is processed in between its children
  5. A data structure where each element has two fields: a link and contents

5 True/False questions

  1. What does it mean to divide and conquer?To break down a large problem into two smaller problems, until the problem becomes easy


  2. What does the function assoc do?It provides a simple lookup tool to find information in a linked list. (assoc 'b '((a 1) (b 2) (c 3))) = (b 2)


  3. What are the two fields of a cons cell called?Something as simple as a number, or a pointer to another linked list


  4. What is a root?A directed pointer from one node to another


  5. A long is how many bits?64 bits, or about 19 decimal digits.