Logo

Go on. Explore!

lvl 0 • 0 xp

lvl 1

HomeMarketDecksInterests
Programming Languages Quiz3 Review1

Programming Languages Quiz3 Review1

memorize.aimemorize.ai (lvl 286)
Star 0%
Star 0%
Star 0%
Star 0%
Star 0%
(0)
(0)
(0)
12 cards
()
Section 1

Preview this deck

if a language permits recursion...

Front

1 / 12

Go
Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (12)

Section 1

(12 cards)

if a language permits recursion...

Front

Static allocation of local variables may not be used

Back

reference counting, mark/sweep, coping, and generational are kinds of...

Front

garbage collection

Back

bindings may be made at...

Front

program writing time language implementation time language design time

Back

a bindings scope is

Front

the part of the program where it is active

Back

external fragmentation of a heap is when requests overflow the bounds of the stack

Front

false

Back

in selectively open scope modules...

Front

names are automatically exported but require qualification

Back

modules facilitate _____ by _____

Front

abstraction////allowing data to be made private

Back

there is always a one-to-one correspondence between names and objects

Front

false

Back

in dynamic scoping the bindings are...

Front

dependent on calling sequences

Back

nested blocks

Front

sometimes cause scope holes

Back

the referencing environment is..

Front

the set of active bindings

Back

in Pascal and C, all data must have names

Front

false

Back