Opl Final

Front 1

In programming languages, the use of keywords is more restrictive than reserved words.

Back 1

FALSE

Front 2

Like the if/else statement in Java and C++, the Racket else statement is optional.

Back 2

FALSE

Front 3

Variables can be characterized as a sextuple (6-tuple) of which six attributes?

Back 3

name, address, value, type, lifetime, scope

Front 4

At which possible binding time is a C or C++ static variable bound to a memory location?

Back 4

load time

Front 5

At which possible binding time is the Java + operator symbol bound to a memory location?

Back 5

language design time

Front 6

Perl: $x = 4;

Python: x = int(4.0)

Back 6

dynamic type binding

Front 7

The process of taking a memory cell from a pool of available memory and binding it to a viariable.

Back 7

Allocation

Front 8

The process of placing a memory cell that has been unbound from a variable back into the pool of available memory.

Back 8

Deallocation

Front 9

The time during which the variable is bound to a specific memory location.

Back 9

lifetime

Front 10

The binding of more than one variable to the same memory cell.

Back 10

aliasing

Front 11

Variables that are bound to memory cells before program execution begins and remain bound to those same memory cells until program execution terminates.

Back 11

static variables

Front 12

Variables whose storage bindings are created when their declaration statements are elaborated, but whose types are statically bound.

Back 12

stack-dynamic variables

Front 13

Variables that are nameless (abstract) memory cells allocated and deallocated by explicit run-time instructions written by the programmer.

Back 13

explicit heap-dynamic variables

Front 14

Variables bound to heap storage only when they are assigned values.

Back 14

implicit heap-dynamic variables

Front 15

Python data types are declared explicitly.

Back 15

FALSE

Front 16

A word of a programming language that is special only in certain contexts.

Back 16

keyword

Front 17

A special word of a programming language that can- not be used as a name.

Back 17

reserved word

Front 18

A string of characters used to identify some entity in a program.

Back 18

name

Front 19

An abstraction of a computer memory cell or collection of cells.

Back 19

variable

Front 20

What are the design issues for names?

Back 20

case-sensitive, reserved/keywords, length

Front 21

What is the potential danger of ­case-​­sensitive names?

Back 21

readability

Front 22

_____ are when more than one variable name can be used to access the same memory location.

Back 22

alias

Front 23

A binding that first occurs before run time begins and remains unchanged throughout program execution

Back 23

static binding

Front 24

A binding that first occurs during run time or can change in the course of program execution

Back 24

dynamic binding

Front 25

The time during which the variable is bound to a specific memory location

Back 25

lifetime

Front 26

The range of statements in which the variable is visible

Back 26

scope

Front 27

scope that looks for the increasingly larger enclosing programs until a delcaration of the non-local variable is found.

Back 27

static scoping

Front 28

scope that determines the scope by the sequence of sub-program calls.

Back 28

dynamic scoping

Front 29

A section of code to have its own local variables whose scope is minimized.

Back 29

block

Front 30

What is the purpose of the let constructs in functional languages?

Back 30

we need that construct to achieve block like scoping of imperative languages

Front 31

What are the advantages of named constants?

Back 31

ability to read and modify

Front 32

What are the advantages and disadvantages of dynamic scoping?

Back 32

Advantages: More flexible than static scoping and convenient.

Disadvantages: Makes it difficult to read. Also, reliability and efficiency are affected.

Front 33

An array in which the subscript ranges are statically bound, but the allocation is done at declaration elaboration time during execution.

Back 33

Fixed stack-dynamic array

Front 34

An array in which both the subscript ranges and the storage allocation are dynamically bound at elaboration time.

Back 34

Stack-dynamic array

Front 35

An array in which the subscript ranges and the storage binding are both fixed after storage is allocated. Additionally, both the subscript ranges and storage bindings are done when the user program requests them during execution, and the storage is allocated from the heap.

Back 35

Fixed heap-dynamic array

Front 36

An array in which the subscript ranges are statically bound and storage allocation is static (done before run time).

Back 36

Static array

Front 37

An array in which the binding of subscript ranges and storage allocation is dynamic and can change any number of times during the array’s lifetime.

Back 37

Heap-dynamic array

Front 38

Are tuples in Python mutable?

Back 38

NO

Front 39

In Perl, and associative array is called a

Back 39

HASH

Front 40

A programming language is strongly typed if

Back 40

type errors are always detected

Front 41

____ is a data type whose variables may store different type values at different times during program execution.

Back 41

union

Front 42

A tuple is a data type that is similar to a record, except that the elements are not named.

Back 42

TRUE

Front 43

An associative array is an unordered collection of data elements that are indexed by

Back 43

an equal number of values called keys, which may be strings or numerics.

Front 44

The values of enumeration constants

Back 44

can be explicitly assigned any integer literal in the type’s definition.

Front 45

Which of the following are signed integers in Java?

Back 45

short, int, byte, long

Front 46

In Java, String objects are mutable.

Back 46

FALSE

Front 47

Which languages do not support coercion in expressions?
F#, ML, JAVA, Perl

Back 47

F#, ML

Front 48

An explicit type conversion is called

Back 48

casting

Front 49

According to your textbook, what are the two distinct kinds of uses for pointers?

Back 49

Pointers provide some of the power of indirect addressing.

Pointers provide a way to manage dynamic storage.

Front 50

Which language below allows arrays to have negative integer indices?

Java, C++, Python, Perl

Back 50

Python, Perl

Front 51

Are the unions of F# discriminated?

Back 51

YES

Front 52

Are the unions of Ada always type checked?

Back 52

No

Front 53

Variables that are defined inside subprograms are called "______ variables".

Back 53

local

Front 54

The repeated execution of a statement or compound statement is accomplished by either

iteration or recursion

Back 54

Iterative statements

Front 55

a control statement (gatekeeper) and the statements whose execution it controls

Back 55

control structure

Front 56

_____ provides the means of choosing between two or more paths of execution

Back 56

selection statement

Front 57

________ transfers execution control to a specified place in the program

Back 57

unconditional branch statement

Front 58

Each line in the selection statement, consisting of a Boolean expression (a guard) and a statement or statement sequence

Back 58

guarded command

Front 59

describes the interface to and the actions of the subprogram abstraction

Back 59

subprogram definition

Front 60

Design issues for subprograms

Back 60

variables static/dynamic?

parameter passing methods?

subprograms be overloaded?