Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 60
Page 116
... routine since it is the routine executed by the CPU immediately after being interrupted . 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 interrupted . 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 . 14 15 E 16 B U 17 18 19 20 21 22 F 2. Change the value in the pointer field of PREVIOUS ENTRY to the address of NEW ENTRY ...
... routine ? Routine 1 1. Copy the value in the pointer field of PREVIOUS ENTRY into the pointer field of NEW ENTRY . 14 15 E 16 B U 17 18 19 20 21 22 F 2. Change the value in the pointer field of PREVIOUS ENTRY to the address of NEW ENTRY ...
Contents
Introduction | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
activities actually addition algorithm allow appear application approach assign associated begin binary block called cell Chapter characters collection communication complete consider consists contains contents database described devices discussed employee entry example execution expressed fact field Figure function given identified implemented indicated input insertion instruction involved language linked loop machine machine's major means memory memory cells module move node notation Note object obtain operating system organization original particular pattern perform pivot pointer position problem produce record refers relation represented request result retrieve routine sequence sequential single solution solving sort stack statement step storage stored string structure subprogram Suppose tape task technique terminal translator tree unit write