Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 57
Page 179
... assign Count the value 0 assign Remainder the value of the dividend repeat ( assign Remainder the value of Remainder divisor , assign Count the value of Count + 1 ) until ( Remainder < the divisor ) assign Quotient the value of Count ...
... assign Count the value 0 assign Remainder the value of the dividend repeat ( assign Remainder the value of Remainder divisor , assign Count the value of Count + 1 ) until ( Remainder < the divisor ) assign Quotient the value of Count ...
Page 180
... assign Count the value 2 while ( Count < 7 ) do ( print the value assigned to Count and assign Count the value Count + 1 ) 4. Rewrite the following program segment using a while structure rather than a repeat structure . Be sure the new ...
... assign Count the value 2 while ( Count < 7 ) do ( print the value assigned to Count and assign Count the value Count + 1 ) 4. Rewrite the following program segment using a while structure rather than a repeat structure . Be sure the new ...
Page 182
... assign Product the value 0 assign Count the value ( repeat ( assign Product the value of Product + Y , and assign Count the value of Count + 1 ) until ( Count = X ) 30. The following program segment is designed to report which of the ...
... assign Product the value 0 assign Count the value ( repeat ( assign Product the value of Product + Y , and assign Count the value of Count + 1 ) until ( Count = X ) 30. The following program segment is designed to report which of the ...
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