Term
|
Definition
-Data that is not defined in terms of other types
-Usually reflect the hardware types |
|
|
Term
|
Definition
| -Treated as primitives by the programmer after being defined but are translated to other hardware (integers, chars) |
|
|
Term
|
Definition
-Keys are translated into integers
Advantages:
-Readability
-Reliability |
|
|
Term
|
Definition
-User-defined type which is a continuous sequence of another discrete type
Advantages:
-Readability
-Reliability
-Storage Optimization |
|
|
Term
|
Definition
| -Allow programmer to collect together data elements into a group and get built-in operators for accessing/storing/... elements in the data structure |
|
|
Term
|
Definition
| Homogeneous ordered collection whose data elements are accessed by their position. |
|
|
Term
|
Definition
Unordered collection of homogeneous elements which are accessed by a key (not position)
Key = unique name associated w/ each value |
|
|
Term
|
Definition
Heterogeneous ordered collection of data elements where access/storage is done by a field name
-Structs |
|
|
Term
|
Definition
| Heterogeneous ordered collection where elements are referred to by field name but fields all share the same memory area. |
|
|
Term
|
Definition
| Dynamic length ordered list type |
|
|
Term
|
Definition
| Heterogeneous unordered collection of unnamed objects which are referenced indirectly |
|
|
Term
|
Definition
Not enough contiguous space on heap to satisfy a request but enough total space on the free list
fix: system can run a compaction algorithm |
|
|
Term
|
Definition
| Block of space on the heap that is not on the free list but has no active ptr to it (can't be referenced) |
|
|
Term
|
Definition
Set up a counter for every allocated block on the heap
Adv:
-Never interrupted to handle garbage
Disadv:
-Continual runtime overhead to handle reference counters |
|
|
Term
|
Definition
Programming Language system ignores garbage until free list is empty: interrupts your program and runs the garbage collector (gc) which goes through entire heap and decides if a cell is being used or not
Adv:
Only need the runtime overhead gc if you run out of space
Disadv:
Will be interrupted if you run out of space |
|
|
Term
|
Definition
| Anything an operator/function does other than returning its one final value |
|
|
Term
| Bohm and Jacopini Theorem |
|
Definition
All algorithms can be implemented with only 3 control forms:
1. Sequencing 1,2,3...
2. A 2-way selector
3. A logically-controlled iterator |
|
|
Term
|
Definition
The parameter of the loop are evaluated on entrance to loop and stored in registers
-Safest and most reliable |
|
|
Term
|
Definition
| The loop parameters are reevaluated in each iteration |
|
|
Term
|
Definition
Programmer can collect a section of code together and give it a programmer-generated name
Adv:
1. Saves space: code stored once
2. Saves programmer's time: program/debug code once
3. Organizational Tool: break a complex program into subprograms
4. Allows information hiding: keep details separate from the users of the subprogram
5. Allows reuse of subprograms - libraries
6. Allows recursion and other subprogram forms
7. Allows separate storage and compilation of pieces of program |
|
|
Term
|
Definition
Includes:
-Actual code segment - body
-Header info, including
1. name of subprogram
2. parameters
-number
-order/name of parameters
-type
-passing method
3. Direct return value and types
4. Kind of the subprogram |
|
|
