Computer Science: An Overview
Now in its ninth edition, this book continues to provide acomprehensive, accessible, and up-to-date introduction to the dynamicfield of computer science using a breadth-first approach. This bookpresents an introductory survey of computer science. It explores thebreadth of the subject while including enough depth to convey anhonest appreciation for the topics involved. The new edition includesreorganization of some key material for enhanced clarity (SoftwareEngineering and Artificial Intelligence chapters), new and expandedmaterial on Security and Data Abstractions, more on ethics anddifferent ethical theories in Chapter 0. Anyone interested in gaining athorough introduction to Computer Science.
Results 1-3 of 79
o the list in question has n entries. The bubble sort would begin by comparing (
and possibly interchanging) the entries in positions n and n – 1. Then, it would
consider the entries in positions n – l and n – 2, and Continue moving forward in
234 - Algorithms in this fashion, we see that the target record will be found after
retrieving at most 15 entries from the list of 30,000 records. Thus, if each of these
retrievals can be performed in 10 milliseconds, the process of searching for a ...
Inserting a new entry in a linked list is only a little more involved. We first find an
unused block of memory cells large enough to hold the new entry and a pointer.
Here we store the new entry and fill in the pointer with the address of the entry in
What people are saying - Write a review
LibraryThing ReviewUser Review - readafew - LibraryThing
This book was assigned reading for the opening class to my MSIT. I found it a great refresher for a large part of my original CS degree. It is well put together and fairly easy to read. Lots of useful ... Read full review
i want read this book