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 22
... node ( Figure 8.2 ) . The node at the top is called the root node ( if we turned the drawing upside down , this node would represent the base or root of the tree ) . The nodes at the other extreme are called terminal nodes ( or sometimes ...
... node ) of the binary tree contains three components : ( 1 ) the data , ( 2 ) a pointer to the node's first child , and ( 3 ) a pointer to the node's second child . Although there is no left or right inside a machine , it is help- ful to ...
... node of the state graph as the root of the search tree and record its heuristic value . while ( the goal node has not been reached ) do [ Select the leftmost leaf node with the smallest heuristic value of all leaf nodes . 1 To this selected ...