J. Glenn Brookshear is a Professor Emeritus at Marquette University where he taught Formal Language, Introduction to Computer Science, and Theory of Computation. He is the author of the previous editions of Computer Science: An Overview.
Students and instructors alike continue to praise the broad coverage and clear exposition that Computer Science: An Overview uses to present a complete picture of the dynamic computer science field. Accessible to students from all backgrounds, Glenn Brookshear uses a language-independent context to encourage the development of a practical, realistic understanding of the field.
Introduction; Data Storage; Operating Systems; Networking and the Internet; Algorithms; Programming Languages; Software Engineering; Data Abstractions; Database Systems; Computer Graphics; Artificial Intelligence; Theory of Computation.
For all readers interested in the basics of computer science.
For computer science majors and minors in the early stages of their college careers, many of whom mistakenly equate programming and computer science, and for students of other disciplines who want computer literacy beyond the ability to manipulate a particular program or do a little elementary programming. Exposes such students to the breadth of the subject, discussing machine architecture--data storage and manipulation; software--algorithms, programming languages, and software engineering; data organization; and the potential of algorithmic machines. Annotation c. Book News, Inc., Portland, OR (booknews.com)
|Ch. 1||Data storage||17|
|Ch. 2||Data manipulation||73|
|Ch. 3||Operating systems||109|
|Ch. 4||Networking and the Internet||135|
|Ch. 6||Programming languages||225|
|Ch. 7||Software engineering||285|
|Ch. 8||Data abstractions||319|
|Ch. 9||Database systems||359|
|Ch. 10||Artificial intelligence||403|
|Ch. 11||Theory of computation||457|
|App. B||Circuits to manipulate two's complement representations||497|
|App. C||A simple machine language||501|
|App. D||High-level language program examples||503|
|App. E||The equivalence of iterative and recursive structures||511|