Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

Concepts of Programming Language Chapter 6

memorize.ai (lvl 286)

(0)

36 cards

()

Section 1

Preview this deck

enumeration type

Front

1 / 36

Go R Programming Language

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (36)

Section 1

(36 cards)

enumeration type

Front

one in which all of the possible values, which are named constants, are provided, or enumerated, in the definition

Back

boolean

Front

true or false, often represent switches

Back

slice

Front

is some substructure of that array

Back

row major order

Front

the elements of the array that have as their first subscript the lower bound value of the subscript are stored first, followed by the elements of the second value of the first subscript, and so forth

Back

dynamic length strings

Front

strings that have a varying length with no maximum length

Back

associative array

Front

an unordered collection of data elements that are indexed by an equal number of values called keys, basically hashes

Back

range

Front

a combination of the range of fractions, and more important, the range of exponents

Back

finite mappings

Front

arrays are sometimes called this

Back

static length string

Front

static and set when the string is created

Back

precision

Front

the accuracy of the fractional part of a value, measured as the number of bits

Back

elliptical references

Front

the field is named, but any or all of the enclosing record names can be omitted, as long as the resulting reference is unambiguous in the referencing environment

Back

jagged array

Front

one in which the lengths of the rows need not be the same

Back

regular expressions

Front

pattern-matching expressions that are some what loosely based on mathematical regular expressions

Back

limited dynamic length strings

Front

strings that have varying length up to a declared and fixed maximum set, based on variables definition

Back

fixed heap-dynamic array

Front

similar to a fixed stack-dynamic array, in that the subscript ranges and the storage bindings are both fixed after storage is allocated

Back

rectangular array

Front

a multidimensional array in which all of the rows have the same number of elements and all of the columns have the same number of elements

Back

character string type

Front

one in which the values consist of sequences of characters

Back

data type

Front

defines a collection of data values and a set of predefined operations on those values

Back

decimal

Front

store a fixed number of decimal digits, with the implied decimal point at a fixed position in the value

Back

fixed stack-dynamic array

Front

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

Back

floating-point

Front

data types model real numbers

Back

enumeration constants

Front

collections of named constants that are defined and group collections

Back

fully qualified reference

Front

to a record field is one in which all intermediate record names, from the largest enclosing record to the specific field, are named in the reference.

Back

array

Front

a homogeneous aggregate of data elements in which an individual elements is identified by its position in the aggregate, relative to the first element

Back

fields

Front

record elements, not referenced in indices(records)

Back

heap-dynamic array

Front

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

Back

subscripts or indeces

Front

specific elements of an array that are referenced by means of a two-level syntactic mechanism

Back

static array

Front

one in which the subscript ranges are statically bound and storage allocation is static(done before runtime)

Back

binary coded decimal(BCD)

Front

decimal types are stored very much like character strings, using binary codes for the decimal digits.

Back

slices

Front

are what substring references are called

Back

primitive data types

Front

data types that are not defined in terms of other types

Back

descriptor

Front

is the collection of the attributes of a variable

Back

complex data type

Front

values that are represented as ordered pairs of floating point values

Back

substring reference

Front

a reference to a substring of a given string

Back

twos complement

Front

basically how they taught you how to add in binary

Back

record

Front

an aggregate of data elements in which the individual elements are identified by names and accesses through offsets from the beginning of the structure

Back