|
FOR THE THIRD
MILLENIUM
|
 |
|
 |
Class Notes |
 |
Software |
 |
Errata |
|
New! |
|
FOR YOUR CLASSES The text is appropriate for use in introductory computer science courses for students not planning to major in the field. |
This new text presents the "great ideas" of computer science, condensing a large amount of complex material into a manageable, accessible form. Java is used for programming examples. The material is presented at a level appropriate for those new to programming or not planning to major in computer science.
The text is based on the problem-oriented approach that has been so succesful in traditional quantitative sciences. For example: students learn about database systems by coding one in Java; about the mechanisms of a compiler by hand-compiling Java statements into assembly language; and about noncomputability by studying a proof of noncomputablilty and by learning to classify problems as either computable or noncomputable.
The authors cover an unusually broad range of material at a surprisingly deep level. Many exercises are included to facilitate learning the concepts presented. Even the student who pursues computer science no further will understand the conceptual structure of computing and information technology that is essential in today's technology-oriented society.
ABOUT THE AUTHORS
Alan W. Biermann is Professor and Chair of the Department
of Computer Science at Duke University, and is the author of the first
two editions of Great Ideas in Computer Science (MIT Press, 1990,
1997)
Dietolf
Ramm is Associate Professor of the Practice of Computer Science
at Duke University, and he is also Director of Undergraduate Studies
at Duke.
|
CONTACT
THE AUTHORS
|
|
VISIT
THE PUBLISHER
|