QUESTION 1

In programming languages, the use of keywords is more restrictive than reserved words.(T/F)?

QUESTION 2

Like the if/else statement in Java and C++, the Racket else statement is optional. (T/F)?

QUESTION 3

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

QUESTION 4

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

	a.	Load time
	b.	Compile time
	c.	Runtime
	d.	Language design time
	e.	Language implementation time

QUESTION 5

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

	a.	Compile time
	b.	Load time
	c.	Runtime
	d.	Language implementation time
	e.	Language design time

QUESTION 6

Select all that are examples of dynamic type binding.

	a.	Perl $x = 4;
	b.	Python x = int(4.0)
	c.	Java int x = (int)4.0;
	d.	C++ int x = 4;

QUESTION 8

Match these Storage Binding and Lifetime categories of scalar variables with their definitions.

-A.B.C.D.	Variables that are bound to memory cells before program execution begins and remain bound to those same memory cells until program execution terminates.
-A.B.C.D.	Variables whose storage bindings are created when their declaration statements are elaborated, but whose types are statically bound.
-A.B.C.D.	Variables that are nameless (abstract) memory cells allocated and deallocated by explicit run-time instructions written by the programmer.
-A.B.C.D.	Variables bound to heap storage only when they are assigned values.

A.	Static variables
B.	Stack-dynamic variables
C.	Explicit heap-dynamic variables
D.	Implicit heap-dynamic variables

QUESTION 7

Match the terms with their definitions.

-A.B.C.D.	The process of taking a memory cell from a pool of available memory and binding it to a viariable.
-A.B.C.D.	The process of placing a memory cell that has been unbound from a variable back into the pool of available memory.
-A.B.C.D.	The time during which the variable is bound to a specific memory location.
-A.B.C.D.	The binding of more than one variable to the same memory cell.

A.	Allocation
B.	Deallocation
C.	Lifetime
D.	Aliasing

QUESTION 9

Python data types are declared explicitly.

True

False

QUESTION 10

Matching the term to the definition.

-A.B.C.D.	Keyword
-A.B.C.D.	Reserved word
-A.B.C.D.	Name
-A.B.C.D.	Variable

A.	A word of a programming language that is special only in certain contexts.
B.	A special word of a programming language that can- not be used as a name.
C.	A string of characters used to identify some entity in a program.
D.	An abstraction of a computer memory cell or collection of cells.

QUESTION 11

What are the design issues for names?

QUESTION 12

What is the potential danger of case- sensitive names?

QUESTION 13

What is an alias?

QUESTION 14

Define static binding and dynamic binding.

QUESTION 16

What is a block?

QUESTION 17

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

QUESTION 18

What is a static ancestor of a subprogram? What is a dynamic ancestor of a subprogram?

QUESTION 19

What are the advantages of named constants?

QUESTION 20

What are the advantages and disadvantages of dynamic scoping?