NAME

Question types


Start with


Question limit

of 102 available terms

Advertisement Upgrade to remove ads
Print test

5 Written questions

5 Matching questions

  1. SNaN
  2. operator
  3. deterministic finite automaton
  4. hash with buckets
  5. left-associative
  1. a Signaling Not a Number, a special value defined by IEEE floating point. An attempt to do arithmetic on a SNaN will cause a processor fault and halt execution; if an array is initialized to SNaN values, this can detect errors of uninitialized data at no runtime cost.
  2. b a form of hash table in which the hash code denotes a bucket or set of entries whose keys hash to that value.
  3. c a symbol that denotes an operation to be performed on data in an expression.
  4. d a finite automaton that has at most one transition from a state for each input symbol and no empty transitions. Abbreviated DFA.
  5. e describes operators in an arithmetic expression such that if there are two adjacent occurrences of operators with the same precedence, the left one should be done first. Thus, a - b + c means (a - b) + c. Most operators are left-associative.

5 Multiple choice questions

  1. the ability to observe the state of a system. For software, the provision of built-in code to allow the internal operations of a program to be easily observed.
  2. a deterministic function that converts converts a symbol or other input to a pseudo-randomized integer value.
  3. a table that associates key values with data by use of a hash function.
  4. the process of reading a source language, determining its structure, and producing intermediate code for it.
  5. a data structure that associates a name (symbol) with information about the named object.

5 True/False questions

  1. syntaxthe rules by which legitimate statements can be constructed. cf. semantics.

          

  2. synthesized translationa derivation in which the leftmost nonterminal of the string is replaced at each step.

          

  3. leftmost derivationa derivation in which the leftmost nonterminal of the string is replaced at each step.

          

  4. parse treea contiguous area of memory, specified by its base address and size. Data within the area are referenced by the base address of the area and the offset, or relative address, of the data within the area.

          

  5. finite automatonan abstract computer consisting of an alphabet of symbols, a finite set of states, a starting state, a subset of accepting states, and transition rules that specify transitions from one state to another depending on the input symbol. The machine begins in the starting state; for each input symbol, it makes a transition as specified by the transition rules. If the automaton is in an accepting state at the end of the input, the input is recognized. Also, finite state machine. Abbreviated FA.