CART

(0) items

Computer Science : An Overview,9780321247261
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Computer Science : An Overview

by
Edition:
8th
ISBN13:

9780321247261

ISBN10:
0321247264
Format:
Hardcover
Pub. Date:
1/1/2005
Publisher(s):
Addison Wesley
List Price: $92.80
More New and Used
from Private Sellers
Starting at $0.01
See Prices

Rent Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

New Textbook

We're Sorry
Sold Out

Related Products


  • Computer Science : An Overview
    Computer Science : An Overview
  • Computer Science : An Overview
    Computer Science : An Overview
  • Computer Science : An Overview
    Computer Science : An Overview
  • Computer Science : An Overview
    Computer Science : An Overview
  • Computer Science : An Overview
    Computer Science : An Overview
  • Computer Science An Overview
    Computer Science An Overview
  • Computer Science An Overview
    Computer Science An Overview




Summary

Now in its eighth edition, this book continues to provide a comprehensive, accessible, and up-to-date introduction to the dynamic field of computer science using a breadth-first approach.The table of contents and the text itself have been revised and expanded to reflect changes in the field, including the trend toward using Web and Internet Technology, the evolution of Objects, and the important growth in the field of databases. Specifically, chapter three from the previous edition has been expanded into two chapters. Chapter three will now only cover Operating Systems and the new chapter four will focus on Networks and the Internet.Anyone interested in gaining a thorough introduction to Computer Science.

Author Biography

J. Glenn Brookshear is an Associate Professor at Marquette University, where he has taught since 1975. In addition to this highly successful book, he is the author of Theory of Computation: Formal Languages, Automata, and Complexity, also published by Addison-Wesley. Professor Brookshear is an amateur magician and is also a vintage sportscar enthusiast, who can often be found in his garage maintaining his collection of British sportscars.

Table of Contents

Introduction
1(17)
The Role of Algorithms
2(2)
The Origins of Computing Machines
4(5)
The Science of Algorithms
9(1)
Abstraction
9(2)
An Outline of Our Study
11(1)
Social Repercussions
12(5)
Social Issues
13(2)
Additional Reading
15(2)
Data Storage
17(56)
Bits and Their Storage
18(8)
Main Memory
26(2)
Mass Storage
28(6)
Representing Information as Bit Patterns
34(7)
The Binary System
41(5)
Storing Integers
46(7)
Storing Fractions
53(4)
Data Compression
57(4)
Communication Errors
61(12)
Chapter Review Problems
65(5)
Social Issues
70(1)
Additional Reading
71(2)
Data Manipulation
73(36)
Computer Architecture
74(3)
Machine Language
77(6)
Program Execution
83(7)
Arithmetic/Logic Instructions
90(4)
Communicating with Other Devices
94(5)
Other Architectures
99(10)
Chapter Review Problems
102(5)
Social Issues
107(1)
Additional Reading
108(1)
Operating Systems
109(26)
The Evolution of Operating Systems
110(3)
Operating System Architecture
113(7)
Coordinating the Machine's Activities
120(3)
Handling Competition Among Processes
123(4)
Security
127(8)
Chapter Review Problems
129(3)
Social Issues
132(1)
Additional Reading
133(2)
Networking and the Internet
135(36)
Network Fundamentals
136(5)
The Internet
141(6)
The World Wide Web
147(9)
Network Protocols
156(8)
Security
164(7)
Chapter Review Problems
167(2)
Social Issues
169(1)
Additional Reading
170(1)
Algorithms
171(54)
The Concept of an Algorithm
172(3)
Algorithm Representation
175(7)
Algorithm Discovery
182(6)
Iterative Structures
188(11)
Recursive Structures
199(8)
Efficiency and Correctness
207(18)
Chapter Review Problems
216(6)
Social Issues
222(1)
Additional Reading
223(2)
Programming Languages
225(60)
Historical Perspective
226(9)
Traditional Programming Concepts
235(11)
Procedural Units
246(8)
Language Implementation
254(9)
Object-Oriented Programming
263(6)
Programming Concurrent Activities
269(3)
Declarative Programming
272(13)
Chapter Review Problems
278(4)
Social Issues
282(1)
Additional Reading
283(2)
Software Engineering
285(34)
The Software Engineering Discipline
286(2)
The Software Life Cycle
288(5)
Modularity
293(6)
Design Methodologies
299(4)
Tools of the Trade
303(5)
Testing
308(1)
Documentation
309(2)
Software Ownership and Liability
311(8)
Chapter Review Problems
313(3)
Social Issues
316(1)
Additional Reading
317(2)
Data Abstractions
319(40)
Data Structure Fundamentals
320(4)
Implementing Data Structures
324(13)
A Short Case Study
337(5)
Customized Data Types
342(4)
Classes and Objects
346(2)
Pointers in Machine Language
348(11)
Chapter Review Problems
350(5)
Social Issues
355(2)
Additional Reading
357(2)
Database Systems
359(44)
Database Fundamentals
360(4)
The Relational Model
364(12)
Object-Oriented Databases
376(3)
Maintaining Database Integrity
379(3)
Traditional File Structures
382(9)
Data Mining
391(2)
Social Impact of Database Technology
393(10)
Chapter Review Problems
395(5)
Social Issues
400(1)
Additional Reading
401(2)
Artificial Intelligence
403(54)
Intelligence and Machines
404(4)
Understanding Images
408(3)
Reasoning
411(12)
Artificial Neural Networks
423(11)
Genetic Algorithms
434(4)
Other Areas of Research
438(8)
Considering the Consequences
446(11)
Chapter Review Problems
448(5)
Social Issues
453(2)
Additional Reading
455(2)
Theory of Computation
457(38)
Functions and Their Computation
458(2)
Turing Machines
460(4)
Universal Programming Languages
464(6)
A Noncomputable Function
470(6)
Complexity of Problems
476(9)
Public Key Cryptography
485(10)
Chapter Review Problems
489(4)
Social Issues
493(1)
Additional Reading
494(1)
Appendixes
495(55)
A ASCII
495(2)
B Circuits to Manipulate Two's Complement Representations
497(4)
C A Simple Machine Language
501(2)
D High-Level Language Program Examples
503(8)
E The Equivalence of Iterative and Recursive Structures
511(2)
F Answers to Questions/Exercises
513(37)
Index 550


Please wait while the item is added to your cart...