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. storage allocation
  2. deterministic finite automaton
  3. hash function
  4. finite automaton
  5. offset
  1. a a deterministic function that converts converts a symbol or other input to a pseudo-randomized integer value.
  2. b the location of data relative to the start of a data area.
  3. c the assignment of memory locations to data and program code.
  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 an 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.

5 Multiple choice questions

  1. lexical analyzer.
  2. insertion of unused storage in order to achieve storage alignment.
  3. a sequence of symbols or characters.
  4. a kind of parser, due to Cocke, Kasami, and Younger, that efficiently produces all possible parses of an input. Also written CYK.
  5. Not a Number, a floating-point value that does not represent a valid number. This could result from use of uninitialized data (if memory is initialized to NaN's), arithmetic performed on a NaN, or an undefined operation such as 0/0. A NaN may be quiet, or signalling, in which case its generation or use generates a CPU exception.

5 True/False questions

  1. alphabeta set of symbols used in the definition of a language.

          

  2. preorderan order of visiting trees, in which a node is examined first, followed by recursive examination of its children, in left-to-right order, in the same fashion.

          

  3. prefix1. a contiguous set of symbols at the beginning of a string. 2. a way of writing expressions in which an operator appears before its operands: +ab.

          

  4. base addressa data structure that shows how a statement in a language is derived from the context-free grammar of the language; it may be annotated with additional information, e.g. for compilation purposes.

          

  5. mantissathe fractional part of a floating-point number; also, significand.