Results 1-3 of 80
First, consider the algorithm for folding a bird from a square piece of paper as
represented in Figure 4-1. Our first observation is that the representation of an
algorithm can take on a variety of syntactic forms — even a sequence of pictures.
Thus, we might pick up the third name, David, slide the name Fred down into the
hole where David was, and then insert David in the hole left by Fred, as
summarized in the second row of Figure 4-10. The top three entries in the list
would now ...
More precisely, the relational model allows information regarding the employees
of a firm to be represented by a relation such as that in Figure 9-4. A row in a
relation is called a tuple. Thus, in the relation of Figure 9-4, tuples consist of 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