Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
25 Cards in this Set
- Front
- Back
|
The programmers who used the first computers (e.g., ENIAC adn EDSAC) believed that the computer's time was more valuable than theirs. Assess the validity of this statement.
a. It is a valid statement. b. It is not a valid statement. |
a. It is a valid statement
|
|
|
Assembly languages were invented to allow computer operations to be expressed with ______.
a. mnemonic abbreviations b. graphical abbreviations c. spoken abbreviations d. All of the above are valid answers e. None of these are valid answers. |
a. mnemonic abbreviations
|
|
|
As computers evolved, and as competing designs developed, it became increasingly frustrating to have to rewrite programs for every new machine. This frustration led to the development of the original dialect of Fortran, the first arguably ______ programming language.
a. low-level b. mid-level c. high-level d. modern e. medieval |
c. high-level
|
|
|
Translating from a high-level language to assembly or machine language is the job of a systems program known as a(n) _____.
a. operating system b. compiler c. optimizer d. defragmenter e. lexical analyzer |
b. compiler
|
|
|
Over time, the performance gap between assembly language programs written by humans and those produced by a compiler from high-level programs has narrowed and eventually reversed. Assess the validity of this statement.
a. It is a valid statement. b. It is not a valid statement. |
a. It is a valid statement.
|
|
|
Because of the need for software maintenance (enhancement and correction), labor costs now _____ the cost of computing hardware.
a. are insignificant compared with b. heavily outweigh c. roughly equal d. All of these are valid answers. e. None of these are valid answers. |
b. heavily outweigh
|
|
|
Today there are _____ of high-level programming languages, and new ones continue to emerge.
a. tens b. hundreds c. thousands d. millions e. billions |
c. thousands
|
|
|
Of the many that have been designed, only a few dozen languages are widely used. Assess the validity of this statement.
a. It is a valid statement. b. It is not a valid statement. |
a. It is a valid statement.
|
|
|
According to the textbook author, this is one of the reasons why there are so many different programming languages:
a. evolution b. special purpose c. personal preference d. All of these are valid answers e. None of these are valid answers |
d. All of these are valid answers
|
|
|
According to the author of the textbook, this is one of the reasons why a programming language might be more successful than another:
a. expressive power b. ease of use for novices c. easy of implementation d. influential sponsor(s)/patron(s) e. All of these are valid answers. |
e. All of these are valid answers.
|
|
|
Functional languages employ a computational model based on the recursive definition of functions (e.g., Church's lambda calculus). Assess the validity of this statement.
a. It is a valid statement b. It is not a valid statement |
a. it is a valid statement
|
|
|
The van Neumann languages are those in which the basic means of computation is the modification of variables. Assess the validity of this statement.
a. It is a valid statement. b. It is not a valid statement. |
a. It is a valid statement.
|
|
|
Both the form (or ____ ) and meaning (or ____ ) of programming languages must be specified without ambiguity so that both programmers and computers can tell what a program is supposed to do.
a. phraseology/ philosophy b. morphology/phenomenology c. alphabet/ dictionary d. syntax/semantics e. semantics/syntax |
d. syntax / semantics
|
|
|
Different programming languages often provide features with very similar semantics but very different syntax. Assess the validity of this statement.
a. It is a valid statement. b. It is not a valid statement. |
a. It is a valid statement.
|
|
|
This is a formal language notion used in determining the syntax of a programming language (at least insofar as Ch. 2 in the textbook is concerned):
a. regular grammar b. context-free grammar c. finite automaton d. All of these are valid answers. e. None of these are valid answers. |
d. All of these are valid answers.
|
|
The minimal DFA below accepts strings over the alphabet {1, 0}. which _____ .
a. contain an even number of 0s. b. contain an odd number of 0s. c. contain at least one 0. d. contain at least one 1. e. None of these is a valid answer. |
a. contain an even number of 0s.
|
|
|
Names in most languages are identifiers (alphanumeric tokens), though certain other symbols, such as + or :=, can also be names. Assess the validity of this statement.
a. It is a valid statement. b. It is not a valid statement. |
a. It is a valid statement.
|
|
|
Binding time, more generally, is the time at which any implementation decision is made. This is one of the times at which decisions may be bound:
a. language design time b. program writing time c. link time d. run time e. All of these are valid answers |
e. All of these are valid answers.
|
|
|
The terms ____ and _____ are generally used to refer to things bound before run time and at run time, respectively.
a. static / dynamic b. dynamic / static c. compilation / interpretation d. interpretation / compilation e. conceptualization / implementation |
a. static / dynamic
|
|
|
Compiler-based language implementations tend to be more efficient than interpreter-based implementations because they make earlier decisions. Assess the validity of this statement.
a. This statement is valid. b. This statement is not valid. |
a. The statement is valid.
|
|
|
Each instance of a subroutine at run time as its own ____ (or activation record) which contains arguments and return values, local variables, temporaries, and bookkeeping information.
a. name b. frame c. scheme d. scope e. mnemonic |
b. frame
|
|
|
A heap is a region of storage in which sub-blocks can be allocated and deallocated at arbitrary times. Assess the validity of this statement:
a. The statement is valid. b. The statement is not valid. |
a. The statement is valid.
|
|
|
Many languages specify that objects are to be deallocated implicitly when it is no longer possible to reach them from any program variable. The run-time library for such a language must then provide a _____ mechanism to identify and reclaim unreachable objects.
a. garbage collection b. search-and-destroy c. syntax analyzer d. lexical scanner e. depth-first search |
a. garbage collection
|
|
|
The textual region of the program in which a binding is active is its scope. Assess the validity of this statement:
a. The statement is valid. b. The statement is not valid. |
a. The statement is valid.
|
|
|
In a language with dynamic coping, the bindings between names and objects depend on the flow of control at run time. Assess the validity of this statement:
a. The statement is valid. b. The statement is not valid. |
a. The statement is valid.
|
