Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 81
Page 147
... Consider the problem of searching a list for the occurrence of a particular target value . We wish to develop an algorithm that determines whether or not that value is in the list . If the value is in the list , we will consider the ...
... Consider the problem of searching a list for the occurrence of a particular target value . We wish to develop an algorithm that determines whether or not that value is in the list . If the value is in the list , we will consider the ...
Page 173
... consider the problem of a university registrar who is faced with the task of retrieving and updating student records . Although the university has an enroll- ment of approximately 10,000 students , it actually maintains a current record ...
... consider the problem of a university registrar who is faced with the task of retrieving and updating student records . Although the university has an enroll- ment of approximately 10,000 students , it actually maintains a current record ...
Page 200
... consider the statement EXTRA = TAX which represents a common statement structure in the language FORTRAN . With- out further explanation of the language , one is left with doubts as to the meaning of this statement . To the layperson it ...
... consider the statement EXTRA = TAX which represents a common statement structure in the language FORTRAN . With- out further explanation of the language , one is left with doubts as to the meaning of this statement . To the layperson it ...
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