Names, Scopes, Binding, and Control Flow

Question 1

What is the main driving force behind the design of modern languges?

Answer 1

Ease of programming

Question 2

High level programming is more a______

Answer 2

Abstract

Question 3

Abstraction means that complexity becomes

Answer 3

Manageable

Question 4

What do the following mean:

Name

Binding

Scope

Binding Time

Answer 4

Question 5

What is static binding vs dynamic binding?

Answer 5

Question 6

Early binding times have greater ____

Late binding times have greater _____

Answer 6

Early binding times: greater efficiency

Late binding times: greater flexibility

Question 7

What is the difference between compiled and interpreted languages?

Answer 7

Question 8

What is the lifetime of name-to-binding?

Answer 8

Question 9

What is a dangling reference?

Answer 9

When the object’s lifetime is less than the binding’s lifetime

Question 10

What is the scope of a binding?

Answer 10

The textual region of the program in which the binding is active

Question 11

What is the difference between the following storage allocation mechanisms:

Static

Stack

Heap

Answer 11

Question 13

What is static allocation

Answer 13

Question 14

What is stack-based allocation?

Answer 14

Question 15

What is a Frame for a subroutine call?

Answer 15

Question 16

What is heap allocation?

Answer 16

Question 17

For heap allocation, what are the differene between the following allocation algorithms:

first fit, best fit

pool allocation

Answer 17

Question 18

Examine some of the differences between explicit deallocation and implicit deallocation?

Answer 18

Question 19

What is a subroutine entry?

Answer 19

Question 20

What is a subroutine exit?

Answer 20

Question 21

What is a referencing environment?

Answer 21

Question 22

What is static scoping?

Answer 22

Question 23

What are some important things for scope rules

Answer 23

Question 24

Examine the following nested subroutine graphic:

Answer 24

Question 25

What are static links?

Answer 25

Question 26

What is declaration order?

Answer 26

Question 27

Examine the following examples for declaration order:

Answer 27

Question 28

What is dynamic scoping?

Answer 28

Question 29

Examine the following dynamic scoping examples;

Answer 29

Question 30

What is a referencing environment?

Answer 30

Question 31

What is shallow binding vs deep binding?

Answer 31

Question 32

What is subroutine closure?

Answer 32

Question 33

Why does binding time matter with static scoping?

Answer 33

Question 34

Consider the following deep binding example:

Answer 34

Question 35

What are the following:

First-class values

Second-class values

Third-class

Answer 35

Question 36

Examine the following with regards to first-class subroutines:

Answer 36

Question 37

What are lambda expressions?

Answer 37

Question 38

Examine the following lambda function examples:

Answer 38

Question 39

What is sequencing’s role in imperative and functional languages?

Answer 39

Question 40

What is recursion’s role in imperative and functional languages?

Answer 40

Question 41

Does logic programming have control flow

Answer 41

Question 42

What are the differences between:

prefix

postfix

infix

Answer 42

Question 43

What is the difference between the value model and the reference model?

Answer 43

Question 44

What are the following:

• call by value
• call by reference
• call by sharing
• call by name
• call by need

Answer 44

Question 45

What is short circuiting?

Answer 45

Question 46

Is recursion generally more efficient that iteration?

Answer 46

No

Question 47

What type of recursion is as fast as iteration? How?

Answer 47

Question 48

What is applicative evaluation order?

Answer 48

Question 49

What is normal-order evaluation order?

Answer 49

Question 50

What is lazy vs strict evaluation?

Answer 50

Lazy evaluation stops evaluating params when it knows the result: