Computer Science: An OverviewThe sixth edition of this classic text for the breadth-first computer science course has been thoroughly updated to discuss increasingly important trends such as networking, object-oriented programming, and genetic algorithms. Author and educator J. Glenn Brookshear continues to introduce students to the discipline of computer science by providing accurate and balanced coverage of CS as a whole and of a variety of CS topics, including programming languages and artificial intelligence. This edition features new sections on public key encryption, evolutionary programming and genetic algorithms, as well as thoroughly revised sections on data manipulation, operating systems and networking. Features *Updates students on recent changes and current trends in the industry, such as networking, genetic algorithms and object-oriented programming * Puts learning in perspective by using real-life analogies and concrete examples to make even the most complex topics accessible to students *Web site provides students and instructors with online resources of topics found in the text *New and extended ethical sections in software engineering and database systems, in addition to optional Computers a |
From inside the book
Results 1-3 of 21
Page 185
... target value . We want to develop an algorithm that determines whether that value is in the list . If the value is in the list , we consider the search a success ; otherwise , we consider it a failure . We assume that the list is sorted ...
... target value . We want to develop an algorithm that determines whether that value is in the list . If the value is in the list , we consider the search a success ; otherwise , we consider it a failure . We assume that the list is sorted ...
Page 199
... target value Bill . Our search begins by selecting David ( the middle entry ) as the test entry under consideration . Since the target value ( Bill ) must precede this test entry , we are instructed to apply the procedure Search to the ...
... target value Bill . Our search begins by selecting David ( the middle entry ) as the test entry under consideration . Since the target value ( Bill ) must precede this test entry , we are instructed to apply the procedure Search to the ...
Page 200
... target value , it declares its search to be a success and terminates . At this point , we have completed the secondary search as requested by the original copy of the procedure , so we are able to continue the execution of that original ...
... target value , it declares its search to be a success and terminates . At this point , we have completed the secondary search as requested by the original copy of the procedure , so we are able to continue the execution of that original ...
Contents
8 This new section also contains material on LZ77 and image repre | 4 |
Intelligence has two new sectionsSection 10 5 Genetic algorithms | 10 |
MACHINE ARCHITECTURE | 15 |
Copyright | |
19 other sections not shown
Common terms and phrases
algorithm application application software artificial neural network ASCII assign associated bit patterns Bones bucket byte called cards Chapter Church-Turing thesis circuit complex computer science consider consists contains contents control unit database decode described devices digits disk eight-puzzle employee encryption example executed Figure flip-flop floating-point function goal hash hexadecimal identify implemented input insertion sort instruction integer intelligence Internet knapsack problems loop machine language machine's main memory mass storage memory cell node object-oriented obtain operating system output perform pixel position procedure processing unit produce program counter programming language pseudocode QUESTIONS/EXERCISES record represented request result retrieve search tree Section sectors sequence sequential solution solving sort stack statement Step stored string structure Suppose tape TargetValue task techniques test entry tion today's Turing machine two's complement notation variable