Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 80
Page 225
... MOVE NAMES ( K ) TO PIVOT . PERFORM MOVE - DOWN VARYING J FROM I BY - 1 UNTIL J EQUAL 1 OR NAMES ( J ) LESS THAN PIVOT . COMPUTE K = J + 1 . IF NAMES ( J ) LESS THAN PIVOT THEN MOVE PIVOT TO NAMES ( K ) ELSE MOVE NAMES ( J ) TO NAMES ...
... MOVE NAMES ( K ) TO PIVOT . PERFORM MOVE - DOWN VARYING J FROM I BY - 1 UNTIL J EQUAL 1 OR NAMES ( J ) LESS THAN PIVOT . COMPUTE K = J + 1 . IF NAMES ( J ) LESS THAN PIVOT THEN MOVE PIVOT TO NAMES ( K ) ELSE MOVE NAMES ( J ) TO NAMES ...
Page 404
... moves in a competitive game showing that player X cur- rently has a choice between move A and move B. Following the move of player X , player Y will be allowed to select a move , and then player X will be allowed to select the last move ...
... moves in a competitive game showing that player X cur- rently has a choice between move A and move B. Following the move of player X , player Y will be allowed to select a move , and then player X will be allowed to select the last move ...
Page 457
... Move the contents of cell number 2 to cell num- ber 1 . Step 2. Move the contents of cell number 3 to cell num- ber 2 . Step 3. Move the contents of cell number 1 to cell num- ber 3 . 3. 32768 bits 4. Δ ΟΟ Ο Δ 5. a . 6AF2 b . E85517 c ...
... Move the contents of cell number 2 to cell num- ber 1 . Step 2. Move the contents of cell number 3 to cell num- ber 2 . Step 3. Move the contents of cell number 1 to cell num- ber 3 . 3. 32768 bits 4. Δ ΟΟ Ο Δ 5. a . 6AF2 b . E85517 c ...
Contents
PART | 1 |
Chapter 2 | 61 |
PART TWO The HumanMachine Interface | 95 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
activities actually algorithm Alice allow application application software ASCII assign bit patterns block bottom pointer bulk storage called Carol Chapter COBOL computer science concept consider consists contains current entry database declare search disk employee example execution Figure goal hexadecimal identified implemented input insertion sort instruction integer key field linked list machine language machine's main memory memory cells modified module move node notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue quick sort record recursive represented request resource result retrieve routine schedule search a failure search a success search tree Section segment sequence sequential file solution solving sort algorithm stack statement step stored string subprogram syntax tape target value task technique time-sharing top pointer Turing machine two's complement