Computer Science: An OverviewComputer Science: An Overview truly lives up to its title, providing a timely introduction to the entire computer science discipline. Broad coverage, combined with clear explanations, has made it the leading textbook for the breadth-first course. This book provides a balanced, realistic picture that communicates the dynamics of computer science by presenting topics in a historical perspective in which past developments, the current state of the art, and directions of research are discussed. The coverage of topics such as programming languages, operating systems, algorithms, software engineering, networking, database design, artificial intelligence, and machine architecture result in a complete overview of the field of computer science. |
From inside the book
Results 1-3 of 26
... termination of the looping process by watch- ing for a condition that indicates termination should take place . This condition is known as the termination condition . It is for the purpose of this test activity that we provide a ...
... termination - that are required in loop control . In general , a recursive routine is designed to test for the termination condition ( often called the base or degenerative case ) before requesting further activations . If the ...
... termination condition hold . ( The loop invariant still holds because the test for termination does not alter any values in the program , and the termination condition holds because otherwise the loop does not terminate . ) If these ...