Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 42
Page 68
... refers to a STORE instruction , and any instruction code starting with 1010 ( hexadecimal A ) refers to a ROTATE instruction . The machine has two ADD instructions . One is a binary ADD and the other is a floating - point ADD . This ...
... refers to a STORE instruction , and any instruction code starting with 1010 ( hexadecimal A ) refers to a ROTATE instruction . The machine has two ADD instructions . One is a binary ADD and the other is a floating - point ADD . This ...
Page 77
... refers to the total amount of work the machine can do , that is , how much processing the machine can accom- plish in a given amount of time rather than how long it takes to do one task . One example of how a machine's throughput can be ...
... refers to the total amount of work the machine can do , that is , how much processing the machine can accom- plish in a given amount of time rather than how long it takes to do one task . One example of how a machine's throughput can be ...
Page 204
... refers to a data item that can take on one of only two values - true or false . A data item of type Boolean can be ... refer to memory locations containing floating - point values ; similarly PRICE , TAX , and TOTAL will refer to cells ...
... refers to a data item that can take on one of only two values - true or false . A data item of type Boolean can be ... refer to memory locations containing floating - point values ; similarly PRICE , TAX , and TOTAL will refer to cells ...
Contents
Contents | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array ASCII assign binary bit patterns block bulk storage called Carol Chapter concept consider contains current entry Current Pointer data structures data types database declare search deleted devices diagram disk employee example execution Figure goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's memory main memory memory cells modified module move notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue record represented request result retrieve routines search tree Section sequence sequential file solution solving sort algorithm stack statement step storage system stored string subprogram Tail pointer tape target value task technique terminal Turing machine two's complement