Results 1-3 of 77
This versatility is achieved by designing the machine to follow step-by-step
processes that can be easily altered or exchanged from outside the machine or,
in fact, by the machine itself. For now, we will accept the phrase "a step-by-step ...
Figure 2-3 Dividing values stored in memory Step 1 . LOAD a register with a
value from memory. Step 2. LOAD another register with another value from
memory. Step 3. If this second value is zero, jump to step 6. Step 4. Divide the
contents of ...
Technically speaking, computer science defines the term algorithm as a finite
sequence of unambiguous, executable steps that will ultimately terminate if
followed. You may think that the latter part of this definition (requiring a finite
sequence of ...
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