Invitation to Computer Science: Java VersionThis new edition of Invitation to Computer Science follows the breadth-first guidelines recommended by CC2001 to teach computer science topics from the ground up. The authors begin by showing that computer science is the study of algorithms, the central theme of the book, then move up the next five levels of the hierarchy: hardware, virtual machine, software, applications, and ethics. Utilizing rich pedagogy and a consistently engaging writing style, Schneider and Gersting provide students with a solid grounding in theoretical concepts, as well as important applications of computing and information technology. A laboratory manual and accompanying software is available as an optional bundle with this text. |
From inside the book
Results 1-3 of 52
Page 42
... pseudocode to design and represent algorithms . This is a set of English language constructs designed to resemble statements in a programming language but that do not actually run on a computer . Pseudocode represents a compromise ...
... pseudocode to design and represent algorithms . This is a set of English language constructs designed to resemble statements in a programming language but that do not actually run on a computer . Pseudocode represents a compromise ...
Page 357
... pseudocode algorithm design mode , as we did in Chapter 2 , and then translate that pseudocode directly into Java code . Conditional flow of control begins with the evaluation of a Boolean condition , also called a Boolean expression ...
... pseudocode algorithm design mode , as we did in Chapter 2 , and then translate that pseudocode directly into Java code . Conditional flow of control begins with the evaluation of a Boolean condition , also called a Boolean expression ...
Page 368
... pseudocode version of the program is shown in Figure 8.15 . We should be able to translate this pseudocode fairly directly into the body of the main method . Other things we need to add to complete the program are • A prologue comment ...
... pseudocode version of the program is shown in Figure 8.15 . We should be able to translate this pseudocode fairly directly into the body of the main method . Other things we need to add to complete the program are • A prologue comment ...
Contents
An Introduction to Computer Science 1 | 20 |
LEVER The Algorithmic Foundations of Computer Science | 36 |
EXERCISES | 75 |
Copyright | |
23 other sections not shown
Other editions - View all
Invitation to Computer Science: Java Version G. Michael Schneider,Judith L. Gersting No preview available - 2006 |
Common terms and phrases
assembly language assignment statement Assume binary search bits called Chapter circuit compiler computer science computer system computing agent contains decimal decoder described developed device digits efficient encoding Ethernet example executed fetch gates hardware high-level language high-level programming language integer Internet Java LABORATORY EXPERIENCE language program largest layer LOAD machine language machine language instructions memory cell memory location Neumann node op code operating system output line parse tree processor produce programming language protocol pseudocode puter represent representation result rithm selection sort sequence sequential search algorithm server Set the value shown in Figure single solve sort algorithm specific speed step symbol system software tape task tion transistors truth table Turing machine variable Von Neumann architecture Von Neumann machine write