click below
click below
Normal Size Small Size show me how
IPL_Ch8
Chapter8_Programming Logic
Term | Definition |
---|---|
algorithm | A list of instructions that accomplish a task |
bubble sort | A sorting algorithm in which a list of elements is arranged by comparing items in pairs; if out of order it is swapped with the item below it |
swap values | When values are exchanged between two variables |
mean | The arithmetic average of a list of numbers |
median | The value from a list that is exactly in the middle of that list. If there are an even amount of values in the list then the mean of the middle two values is used. |
sequential order | The arrangement of records when they are stored one after another on the basis of the value in a particular field |
physical order | The arrangement of elements in the actual or "real" stored order |
logical order | The arrangement of records in a virtual order based on any criterion the user chooses |
key field | A field whose contents make the record unique among all records in a file |
addresses | The data records' identifying computer memory and storage location |
index | A stored list of key fields paired with the storage address for the corresponding data record |
linked list | When an extra field exists in every record of stored data that holds the physical address of the next logical record |
random-access storage | is a location from which records can be accessed in any order |