Anonymous user
Books: Difference between revisions
Moar stuff. Still WIP.
| [unchecked revision] | [unchecked revision] |
m (Fix Griwes' accident and add more stuff.) |
(Moar stuff. Still WIP.) |
||
Line 2:
= Algorithms =
{{Book|ISBN=0073523402|ASIN=0073523402
|title=Algorithms
|author=Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
|supp=[http://www.cs.berkeley.edu/~vazirani/algorithms.html Penultimate draft], [http://highered.mcgraw-hill.com/sites/0073523402/ Link]
|description=This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest.
Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.
Features include:
* The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.
* Carefully chosen advanced topics which can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.
* An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides an unique peephole into this exciting topic.
|review=}}
{{Book|ISBN=032157351X|ASIN=032157351X
Line 59 ⟶ 74:
Chapter 11 Optimizing for Parallelism and Locality<br/>
Chapter 12 Interprocedural Analysis
|review=}}
{{Book|ISBN=1558604960|ASIN=1558604960
|title=Linkers and Loaders
|author=John R. Levine
|supp=[http://www.iecc.com/linker/ Free manuscript], [http://linker.iecc.com/ Errata and code]
|description=Whatever your programming language, whatever your platform, you probably tap into linker and loader functions all the time. But do you know how to use them to their greatest possible advantage? Only now, with the publication of Linkers and Loaders, is there an authoritative book devoted entirely to these deep-seated compile-time and run-time processes. The book begins with a detailed and comparative account of linking and loading that illustrates the differences among various compilers and operating systems. On top of this foundation, the author presents clear practical advice to help you create faster, cleaner code. You'll learn to avoid the pitfalls associated with Windows DLLs, take advantage of the space-saving, performance-improving techniques supported by many modern linkers, make the best use of the UNIX ELF library scheme, and much more. If you're serious about programming, you'll devour this unique guide to one of the field's least understood topics. Linkers & Loaders is also an ideal supplementary text for compiler and operating systems courses.
'''Features'''
* Includes a linker construction project written in Perl, with project files available for download.
* Covers dynamic linking in Windows, UNIX, Linux, BeOS, and other operating systems.
* Explains the Java linking model and how it figures in network applets and extensible Java code.
* Helps you write more elegant and effective code, and build applications that compile, load, and run more efficiently.
|review=}}
Line 384 ⟶ 413:
|review=}}
= Software
== Theory ==
Line 449 ⟶ 478:
Robert Mecklenburg, author of the third edition, has used ''make'' for decades with a variety of platforms and languages. In this book he zealously lays forth how to get your builds to be as efficient as possible, reduce maintenance, avoid errors, and thoroughly understand what make is doing. Chapters on C++ and Java provide makefile entries optimized for projects in those languages. The author even includes a discussion of the makefile used to build the book.
|review=}}
{{Book|ISBN=0138297711|ASIN=0138297711
|title=Source File Management with SCCS
|author=Israel Silverberg
|supp=N/A
|description=Oriented towards the needs of senior software engineers, software managers, system administrators, and configuration managers, this volume focuses on the building and maintenance of a source file library in the UNIX System V environment. The book gives an explanation of the concept of the UNIX source code control system, describes in detail the utilities that constitute SCCS, and shows how to use these tools to build and maintain a source file library. It also shows how to place all applications in a single library and how that library can be used by different departments. Techniques and additional tools for maintaining source files at the product level are explained with a view to allowing readers to establish a source file management system that will trace versions of an entire application instead of a single source file. The book then explains how to establish a secure source library where access to read and/or change is strictly controlled. Finally, the book provides source code for the special utilities needed to implement the concepts described. A disk of source codes is available separately.
|review=}}
Line 456 ⟶ 492:
|title=Introduction to the Theory of Computation, 3rd ed.
|author=Michael Sipser
|supp=[http://www.cengage.com/search/productOverview.do?Ntt=introduction+to+the+theory+of+computation
|description=Now you can clearly present even the most complex computational theory topics to your students with Sipser's distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser's well-known, approachable style with timely revisions, additional exercises, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. This edition's refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject's rigor and formalism. Readers gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E's comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing.
|review=}}
| |||