Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 73
Page
... sections . These sections are marked in the table of contents as well as within the chapters themselves . The fact that a section is declared optional does not mean that its material is necessarily more difficult or should be skipped ...
... sections . These sections are marked in the table of contents as well as within the chapters themselves . The fact that a section is declared optional does not mean that its material is necessarily more difficult or should be skipped ...
Page 330
... section 2 will cause section 2 to do the same . ) Observe that when trying to retrieve a record from a hashed file , one would first extract the proper section using the hash algorithm . If , however , the desired record was not found ...
... section 2 will cause section 2 to do the same . ) Observe that when trying to retrieve a record from a hashed file , one would first extract the proper section using the hash algorithm . If , however , the desired record was not found ...
Page 477
... Section 9-3 1. a . G. Jerry Smith b . Cheryl H. Clark c . S26Z 2. One solution would be : SELECT FROM JOB WHERE DEPT EQUALS " PERSONNEL " GIVING TEMP . PROJECT JOB - TITLE FROM TEMP GIVING LIST . In some systems this would result in a ...
... Section 9-3 1. a . G. Jerry Smith b . Cheryl H. Clark c . S26Z 2. One solution would be : SELECT FROM JOB WHERE DEPT EQUALS " PERSONNEL " GIVING TEMP . PROJECT JOB - TITLE FROM TEMP GIVING LIST . In some systems this would result in a ...
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