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 91
Page 89
... execute ( Figure 2.6 ) . During the fetch step , the control unit requests that main memory provide it with the next instruction to be executed . The unit knows where the next instruction is in memory because its address is kept in the ...
... execute ( Figure 2.6 ) . During the fetch step , the control unit requests that main memory provide it with the next instruction to be executed . The unit knows where the next instruction is in memory because its address is kept in the ...
Page 168
... executed . This does not mean that the steps must be executed in a sequence consisting of a first step , followed by a second , and so on . Some algorithms , known as parallel algorithms , for exam- ple , contain more than one sequence ...
... executed . This does not mean that the steps must be executed in a sequence consisting of a first step , followed by a second , and so on . Some algorithms , known as parallel algorithms , for exam- ple , contain more than one sequence ...
Page 214
... executed , is affected by execut- ing the structure . As a simple example , if a certain statement about the value of Y is known to hold prior to executing the instruction assign X the value of Y then that same statement can be made ...
... executed , is affected by execut- ing the structure . As a simple example , if a certain statement about the value of Y is known to hold prior to executing the instruction assign X the value of Y then that same statement can be made ...
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