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 77
... goal from the initial statements while keeping track of the unifications required to do so . Then , if the goal is obtained , Prolog reports these unifications . For example , consider the goal faster ( W , snail ) . In response to this ...
... goal faster ( rabbit , W ) . In fact , if we started with the goal faster ( V , W ) . Prolog ultimately reports all the faster relationships that can be derived from the ini- tial statements . Thus a single Prolog program can be used to ...
... goal state . ( In our case , a state is a con- figuration of the eight - puzzle ; the start state is the configuration of the puzzle when handed to the machine ; the goal state is the configuration of the solved puzzle , as shown in ...