Results 1-3 of 17
In most cases all the programmer must do is provide a statement to the effect that
a record having a particular key field value is to be retrieved or inserted relative to
a particular file and, in the case of a retrieval, that program execution should ...
Modify the algorithm in Figure 8-3 to handle the case where a transaction record
may have a key field value equal to a record already in the old master file. In this
case, the transaction record should appear in the new master file and the old ...
Suppose the entries in the index were the smallest key field values from each
segment and we were looking for the record with key field value 7. If the first entry
in the index were 5, we would not know whether or not the target record is in the ...
What people are saying - Write a review
LibraryThing ReviewUser Review - readafew - LibraryThing
This book was assigned reading for the opening class to my MSIT. I found it a great refresher for a large part of my original CS degree. It is well put together and fairly easy to read. Lots of useful ... Read full review
LibraryThing ReviewUser Review - geekcowboy - LibraryThing
Great book to introduce the theory and practical concepts of computer science. Read full review
PART ONE Machine Architecture
11 other sections not shown