Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 74
Page 74
... given in the following table : Address Contents 00 14 01 02 02 34 03 17 04 CO 05 00 If we started the machine with its program counter containing 00 , what would be the contents of the memory cell whose address is hexadecimal 17 when ...
... given in the following table : Address Contents 00 14 01 02 02 34 03 17 04 CO 05 00 If we started the machine with its program counter containing 00 , what would be the contents of the memory cell whose address is hexadecimal 17 when ...
Page 77
... given amount of time rather than how long it takes to do one task . One example of how a machine's throughput can be increased without requiring an increase in execution speed is the technique called pipelining . This term comes from ...
... given amount of time rather than how long it takes to do one task . One example of how a machine's throughput can be increased without requiring an increase in execution speed is the technique called pipelining . This term comes from ...
Page 139
... given a name by beginning that module with a statement of the form procedure name where name is the name to be given the module consisting of the instructions that follow this statement . Then , we allow that module to be used elsewhere ...
... given a name by beginning that module with a statement of the form procedure name where name is the name to be given the module consisting of the instructions that follow this statement . Then , we allow that module to be used elsewhere ...
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