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 71
... entry in the list . Here we write the word middle in quotation marks because the list may have an even number of entries and thus no middle entry in the exact sense . In this case , let us agree that the middle entry refers to the first ...
... entry , comparing this entry to those preceding it until the proper place for the pivot is found , and then inserting the pivot entry in this place . Since the activity of comparing two names dominates the algorithm , our approach will ...
... entry to be its current entry ) if ( InputListB is empty ) then ( Declare it to be exhausted ) else ( Declare its first entry to be its current entry ) while ( neither input list is exhausted ) do ( Put the " smaller " current entry in ...