Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 35
Page 186
... translate it into machine - usable form . It was not long , however , before this translation process was recognized as a straightforward procedure that could be performed by the machine itself . Consequently , the use of mnemonics was ...
... translate it into machine - usable form . It was not long , however , before this translation process was recognized as a straightforward procedure that could be performed by the machine itself . Consequently , the use of mnemonics was ...
Page 195
... translate , link , and load , as repre- sented in Figure 5-4 . Of course , once the translate and link steps have been com- pleted , the program can be repeatedly loaded and executed without returning to the source version . If ...
... translate , link , and load , as repre- sented in Figure 5-4 . Of course , once the translate and link steps have been com- pleted , the program can be repeatedly loaded and executed without returning to the source version . If ...
Page 196
... translate / link / load / execute sequence required by translation . The major disadvantage of an interpreter is that no permanent copy of the translation is produced and saved . Rather , the internal translation steps must be repeated ...
... translate / link / load / execute sequence required by translation . The major disadvantage of an interpreter is that no permanent copy of the translation is produced and saved . Rather , the internal translation steps must be repeated ...
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