Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 57
Page 150
... Modify : Test : Establish an initial state that will be modified toward the termination condition Change the state in such a way that it moves toward the termination condition Compare the current state to the termination condition and ...
... Modify : Test : Establish an initial state that will be modified toward the termination condition Change the state in such a way that it moves toward the termination condition Compare the current state to the termination condition and ...
Page 242
... modification phase would be more accurately called a repair or maintenance phase . That is , other prod- ucts tend to move from being used to being modified because their parts become worn . Software , on the other hand , does not wear ...
... modification phase would be more accurately called a repair or maintenance phase . That is , other prod- ucts tend to move from being used to being modified because their parts become worn . Software , on the other hand , does not wear ...
Page 455
... modified language can con- sist of a number of syntactically disjoint program units . We suppose that each program ... modified language has all the capabilities of the origina ! re Bones . It can also be shown that any problem that can ...
... modified language can con- sist of a number of syntactically disjoint program units . We suppose that each program ... modified language has all the capabilities of the origina ! re Bones . It can also be shown that any problem that can ...
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