Invitation to Computer Science: C++ VersionIn this best-selling text, Mike Schneider and Judy Gersting unify and lend relevance to the topics of computer science within their proven framework of a six-layer hierarchy of abstractions. The authors begin by showing that computer science is the study of algorithms, which is the central theme of the book, then move up the next five levels of the hierarchy: hardware, virtual machine, software, applications, and ethics. Each layer in the hierarchy builds upon the ideas and concepts presented in earlier chapters. In addition to some motivational applications such as Web page design and interactive graphics, the book covers the fundamental issues of algorithms, hardware design, computer organization, system software, language models, theory of computation, and social and ethical issues of computing. Exposure to these deeper and more complex core ideas introduces students to the richness and beauty of the field and helps them appreciate the principles behind their creation and implementation. While feeling the excitement of computer science, students receive a solid grounding in the central concepts as well as in important uses of computing and information technology. |
From inside the book
25 pages matching binary search algorithm in this book
Where's the rest of this book?
Results 1-3 of 25
Contents
An Introduction to Computer Science | 2 |
An Introduction to Computer Science 1 | 20 |
5 Organization of the Text | 31 |
Copyright | |
22 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 binary search algorithm bits called Chapter circuit compiler computer science computer system computing agent CON(X construct contains cout decimal decoder described device digits efficient encoding endl example execute fetch function gates halts hardware high-level language high-level programming language integer Internet largest LOAD look loop machine language machine language instructions memory cell memory location Neumann node number of comparisons op code operating system output line parse tree processor produce programming language protocols pseudocode puter radius represent representation result rithm selection sort sequence server Set the value shown in Figure single solve sort algorithm specific step symbol system software tape task tion transistors truth table Turing machine variable Von Neumann architecture write