Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 59
Page 116
... routine since it is the routine executed by the CPU immediately after being inter- rupted . To review the interrupt process we see that upon an interrupt signal being generated , the register contents are saved in memory and the CPU ...
... routine since it is the routine executed by the CPU immediately after being inter- rupted . To review the interrupt process we see that upon an interrupt signal being generated , the register contents are saved in memory and the CPU ...
Page 163
... routine is designed to test for the termination condition ( often called the base case ) before requesting further activations . If this condition is not met , the routine assigns an activation to the task of solving a revised problem ...
... routine is designed to test for the termination condition ( often called the base case ) before requesting further activations . If this condition is not met , the routine assigns an activation to the task of solving a revised problem ...
Page 310
... routine ? Routine 1 1. Copy the value in the pointer field of PREVIOUS ENTRY into the pointer field of NEW ENTRY . 2. Change the value in the pointer field of PREVIOUS ENTRY to the address of NEW ENTRY . Routine 2 1. Change the value in ...
... routine ? Routine 1 1. Copy the value in the pointer field of PREVIOUS ENTRY into the pointer field of NEW ENTRY . 2. Change the value in the pointer field of PREVIOUS ENTRY to the address of NEW ENTRY . Routine 2 1. Change the value in ...
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