Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 11
Page 146
... tiles , each of which can cover exactly three squares on the board . If any single square is cut out of the board , could we cover the remaining board with tiles such that tiles do not overlap or hang off the edge of the board ? b ...
... tiles , each of which can cover exactly three squares on the board . If any single square is cut out of the board , could we cover the remaining board with tiles such that tiles do not overlap or hang off the edge of the board ? b ...
Page 382
... tiles from the visual image , its task becomes that of actually solving the puzzle . One technique that might come to mind is to preprogram the machine with solutions to all possible arrangements of the tiles . Then , the machine's task ...
... tiles from the visual image , its task becomes that of actually solving the puzzle . One technique that might come to mind is to preprogram the machine with solutions to all possible arrangements of the tiles . Then , the machine's task ...
Page 383
... tiles . Each movement of a tile has the precondition that the hole must be next to the tile in question . ) A control system . The control system consists of the logic that decides which of those productions whose preconditions are ...
... tiles . Each movement of a tile has the precondition that the hole must be next to the tile in question . ) A control system . The control system consists of the logic that decides which of those productions whose preconditions are ...
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