Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 78
Page 154
... Figure 4-10 ) . Finally , we can complete the sorting process by picking up Carol , sliding Fred and David down , and then inserting Carol in the remaining hole ( see the fourth row of Figure 4-10 ) . Having analyzed the process of ...
... Figure 4-10 ) . Finally , we can complete the sorting process by picking up Carol , sliding Fred and David down , and then inserting Carol in the remaining hole ( see the fourth row of Figure 4-10 ) . Having analyzed the process of ...
Page 393
... Figure 10-9 for developing a search tree and executing the solution obtained . As an example , let us walk through this algorithm as it applies to the 8 - puzzle starting from the initial configuration in Figure 10-5 . First , we ...
... Figure 10-9 for developing a search tree and executing the solution obtained . As an example , let us walk through this algorithm as it applies to the 8 - puzzle starting from the initial configuration in Figure 10-5 . First , we ...
Page 396
... Figure 10-13 . Comparing this with the tree in Figure 10-6 shows that even with the temporary wrong turn taken early on by the new algorithm , the use of heuristic information has greatly decreased the size of the search tree and ...
... Figure 10-13 . Comparing this with the tree in Figure 10-6 shows that even with the temporary wrong turn taken early on by the new algorithm , the use of heuristic information has greatly decreased the size of the search tree and ...
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array assign binary bit patterns block bulk storage called Carol Chapter COBOL concept contains current entry Current Pointer data control block data flow diagram database declare search deleted diagram disk employee example execution Figure FILLED-BY FORTRAN hashed head pointer hexadecimal identify implemented input insertion sort instruction integer linked list loop machine language machine's memory main memory memory cells modified module move notation operating system password perform pivot entry problem produce program counter programming languages pseudocode Questions/Exercises queue record relation represented request result retrieve routines schedule search a failure search a success search tree sequence sequential file solution solving stack statement step storage system stored string subprogram syntax tape target value task technique terminal time-sharing translator Turing machine