1. True / False

T / F (a) Recursion is a form of iteration.

T / F (b) A two-pass assembler uses the first pass to build a symbol table.

T / F (c) A Turing Machine is an abstract model of computation suitable for mathematical analysis.

T / F (d) One of the critical responsibilities of an operating system is to provide a convenient fiction for the user in the form of an interface.

T / F (e) Some problems are impossible to solve with computers.

T / F (f) An advantage of high-level languages is that the programmer must manage the movement of data items between memory locations.

T / F (g) Python is the most appropriate language choice for any programming problem.

T / F (h) Racket is a functional programming language.

T / F (i) During lexical analysis the compiler converts the program from a sequence of characters to a sequence of tokens.

T / F (j) Programming languages are too complex to be created by individuals, and so are always designed by committee.

T / F (k) BNF grammars are used to define the semantic structure of programming languages.

T / F (l) Encryption technology serves two purposes: security and authentication.