Quiz 4

Question 1

The high-level language instructions are known as _____ code.

Answer 1

Source code

Question 2

procedural languages are also called ____ languages

Answer 2

imperative

Question 3

A ____ stores and fetches values to and from memory cells.

Answer 3

Random access memory

Question 4

Ada, Java, C++ and C# require a ____ to terminate an executable program statement.

Answer 4

semicolon

Question 5

____ was originally designed for systems programming, in particular for writing the operating system UNIX

Answer 5

C

Question 6

A program to interact with an I/O device is called a ____.

Answer 6

device driver

Question 7

A _____ occurs when a function, in the course of acting on it argument values to produce a result value, also changes other values that it has no business changing.

Answer 7

Side effect

Question 8

During the ____ phase, the sequence of tokens formed by the scanner is checked to see whether it is syntactically correct according tot he rules of the programming language.

Answer 8

parsing

Question 9

In the ____ phase, the compiler takes the generated code and sees whether it can be made more efficient, either by making it run faster or having it occupy less memory.

Answer 9

Code optimization

Question 10

The collection of all statements that can be successfully parsed is called the ____ defined by a grammar

Answer 10

language

Question 11

___ parsing algorithms examine several token “down the road” to see what would happen if a certain choice was made.

Answer 11

Look ahead

Question 12

A ____ is a data structure that stores information about a non terminal, such as the actual name of the object and its data type.

Answer 12

Semantic Record

Question 13

____ is the ability to write highly optimized programs that contain no wasted time or unnecessary memory cells.

Answer 13

Efficiency

Question 14

____ is the replacement of slow arithmetic operations with faster ones

Answer 14

Strength reduction

Question 15

in a state diagram, ____ are used to represent states.

Answer 15

circles

Question 16

A(n) ____ is a statement advanced for consideration and maintained by argument.

Answer 16

Thesis

Question 17

The ____ thesis can never be proved because the definition of an algorithm is descriptive, not mathematical

Answer 17

Church-Turing

Question 18

Turing machines define the limits of ____. Which is what can be done by symbol manipulation algorithms.

Answer 18

Computability

Question 19

It is important to note that unsolvable problems related to the halting problem are unsolvable because of their ____.

Answer 19

Generality