Ads
related to: computer science book recommendations for class
Search results
Results From The WOW.Com Content Network
Donald Knuth - The Art of Computer Programming; Ellen Ullman - Close to the Machine; Ellis Horowitz - Fundamentals of Computer Algorithms; Eric Raymond - The Art of Unix Programming; Gerald M. Weinberg - The Psychology of Computer Programming; James Gosling - The Java Programming Language; Joel Spolsky - The Best Software Writing I
Code: The Hidden Language of Computer Hardware and Software; Compilers: Principles, Techniques, and Tools; Computer Graphics: Principles and Practice; Computers and Intractability; Concepts, Techniques, and Models of Computer Programming; Concrete Mathematics
SICP has been influential in computer science education, and several later books have been inspired by its style. Structure and Interpretation of Classical Mechanics (SICM), another book that uses Scheme as an instructional element, by Gerald Jay Sussman and Jack Wisdom; Software Design for Flexibility, by Chris Hanson and Gerald Jay Sussman
Creating the Computer: Government, Industry and High Technology. Brookings Institution. ISBN 978-0-8157-2849-8. Garfinkel, Simson L. (1999). Architects of the Information Society: Thirty-Five Years of the Laboratory for Computer Science at MIT. MIT Press. ISBN 0-262-07196-7. Gerovitch, Slava (2002).
Computer science books (8 C, 51 P) Cryptography books (1 C, 18 P) D. Books about the Digital Revolution (9 P) F. Books about free software (2 C, 17 P) I.
The book treats mostly 2- and 3-dimensional geometry. The goal of the book is to provide a comprehensive introduction into methods and approached, rather than the cutting edge of the research in the field: the presented algorithms provide transparent and reasonably efficient solutions based on fundamental "building blocks" of computational ...
The "Demystified" series is introductory in nature, for middle and high school students, favoring more in-depth coverage of introductory material at the expense of fewer topics. The "Easy Way" series is a middle ground: more rigorous and detailed than the "Demystified" books, but not as rigorous and terse as the Schaum's series.
Soon after it appeared, the book received positive reviews by reputed researchers in the area of theoretical computer science. In his review, Ronald V. Book recommends the book to "anyone who wishes to learn about the subject of NP-completeness", and he explicitly mentions the "extremely useful" appendix with over 300 NP-hard computational problems.