- Johnson, Charles
- Nonfiction
- Barlowe, Wayne, Douglas
- Memling, Hans
- General
- Currents & Tides
- Sanchez, Sonia
- Degen, Bruce
- Thailand
- War on Drugs
- Prayer
- Perennials
- Communicable Diseases
- Americas
- Tolan, Stephanie S.
- Beauty & Fashion
- Shreve, Anita
- Rationalism
- Earth Sciences
- Facture Mechanics
- ( S-U )
- Scrabble
- Robbins, Tom
- Crandall, Melissa
- Beaton, M.C.
- Paleoecology
- Singapore
- General
- Bowen, Rhys
- Graduate School Guides
- Some of our other sites:
- Books
- Clothing, Shoes and Accessories
- Baby Clothes and Accessories
- Cosmetics, Beauty Products and Fragrances
- Cellphones, Call Plans and Accessories
- Video Games
- DVDs
- Electronics, Gadgets and Computers
- Health and Personal Care
- Home and Garden
- Home DIY
- Jewelry
- Magazines and Newspapers
- Music Downloads
- Musical Instruments
- Office Equipment and Supplies
- Software and Games
- Sporting Goods
- Toys and Games
- Watches
- UK Books
- UK Video Games
- UK Home and Garden
- UK Electronics, Gadgets and Computers
- UK Baby Clothes and Accessories
- UK Software and Games
- UK Sporting Goods
- UK Toys and Games
Books : Computers & Internet : Programming : C : Algorithms
-
Introduction to Computing Systems: From bits & gates to C & beyond, now in its second edition, is designed to give students a better understanding of computing early in their college careers in order to give them a stronger foundation for later courses. The book is in two parts: (a) the underlying structure of a computer, and (b) programming in a high level language and programming methodology.To understand the computer, the authors introduce the LC-3 and provide the LC-3 Simulator to give students hands-on access for testing what they learn. To develop their understanding of programming and programming methodology, they use the C programming language. The book takes a "motivated" bottom-up approach, where the students first get exposed to the big picture and then start at the bottom and build their knowledge bottom-up. Within each smaller unit, the same motivated bottom-up approach is followed. Every step of the way, students learn new things, building on what they already know. The authors feel that this approach encourages deeper understanding and downplays the need for memorizing. Students develop a greater breadth of understanding, since they see how the various parts of the computer fit together.
-
This revision adds a new chapter examining advanced data structures and their implementation such as red black trees, top down splay trees, treaps, k-d trees and pairing heaps, among others. In addition, the author has refined the presentation, made all code examples conform to standard C programming style conventions, and strengthened the coverage of formal proofs.
-
-
This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
-
-
Confusing Textbooks? Missed Lectures? Not Enough Time?
Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.
This Schaum's Outline gives you
- Practice problems with full explanations that reinforce knowledge
- Coverage of the most up-to-date developments in your course field
- In-depth review of practices and applications
Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!
Schaum's Outlines-Problem Solved.
-
Using the increasingly popular C language, this book teaches data structures from their theoretical conception through to their concrete realizations. It emphasizes structured design and programming techniques, and contains numerous debugged programming samples. For CS2 course in advanced programming or data structures in C.
-
-
This introduction to the fundamentals of data structures explores abstract concepts, considers how those concepts are useful in problem solving, explains how the abstractions can be made concrete by using a programming language, and shows how to use the C language for advanced programming and how to develop the advanced features of C++. Covers the C++ language, featuring a wealth of tested and debugged working programs in C and C++. Explains and analyzes algorithms — showing step- by-step solutions to real problems. Presents algorithms as intermediaries between English language descriptions and C programs. Covers classes in C++, including function members, inheritance and object orientation, an example of implementing abstract data types in C++, as well as polymorphism.
-
This handy desktop reference gathers together into one easy-to-use volume the most popular image processing algorithms. Designed to be used at the computer terminal, it features an illustrated, annotated dictionary format — with clear, concise definitions, examples, and C program code. Covers algorithms for adaptive filters, coding and compression, color image processing, histogram operations, image fundamentals, mensuration, morphological filters, nonlinear filters, segmentation, spatial filters, spatial frequency filters, storage formats, and transforms. Includes graphic oriented techniques such as warping, morphing, zooming, and dithering. Provides algorithms for image noise generation. MARKETS: For users and developers of image processing systems and programs.
-
Covers fundamental data structures and algorithms for sorting, searching, and related applications. Includes expanded coverage of arrays, linked lists, strings, trees, and other basic data structures. Contains many examples. Paper. DLC: C (Computer program language)
-
Digital signal processing techniques have become the method of choice in signal processing as digital computers have increased in speed, convenience, and availability. At the same time, the C language is proving itself to be a valuable programming tool for real-time computationally intensive software tasks. This book is a complete guide to digital signal processing techniques in the C language. Covers the basic principles of digital signal processing and C programming. Introduces the basic real-time DSP programming techniques and typical programming environments which are used with DSP microprocessors. Covers the basic real-time filtering techniques which are the cornerstone of one-dimensional real-time digital signal processing. For electrical engineers and computer scientists.
-
Memory Management: Algorithms and Implementation in C/C++ describes how to construct production-quality memory managers. This approach includes both high-performance explicit memory managers and more intricate garbage collectors like those popularized by the Java Virtual Machine. Every implementation is complemented by an in-depth presentation of theory, benchmark tests, extensive source code examples, and a discussion of each implementation's trade-offs.
-
Develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from concrete examples to abstract principles. DLC: C (Computer program language)
-
This book constitutes the refereed proceedings of the 10th Interntaional Workshop on Cryptographic Hardware and Embedded Systems, CHES 2008, held in Washington, D.C., USA, during August 10-13, 2008.
The book contains 2 invited talks and 27 revised full papers which were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on side channel analysis, implementations, fault analysis, random number generation, and cryptography and cryptanalysis.
-
This volume contains the proceedings of the NATO Advanced Research Workshop on Numerical Integration that took place in Bergen, Norway, in June 1991. It includes papers for all invited talks and a selection of contributed talks. The papers are organized into four parts: numerical integration rules, numerical integration error analysis, numerical integration applications and numerical integration algorithms and software; many papers are relevant to more than one category. The workshop studied the state of the art in numerical integration (both single and multidimensional). The book contains a number of survey papers by experts on themes such as: numerical solution of integral equations, cubature formulae construction, handling singularities in finite elements, statistical applications, lattice rules, error estimates, error bounds and software.
-
-
Great for engineers who want to learn programming. Hands-on approach to program design techniques that will caryy over to an object-oriented environment. Each topic explained and illustrated with practice exercises and lists of command errors. Offers many excellent engineering applications.
-
Readers without a computer programming background will now be able to design programs and write efficient, structured applications in C--thanks to this thorough guide. Example programs are contained on a disk packaged with the book. An introduction to C++ is included that prepares the reader for learning this important language in the future.
-
This is the eBook version of the printed book. If the print book includes a CD-ROM, this content is not included within the eBook version.
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years.
Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.
Coverage includes:
- A complete overview of graph properties and types
- Diagraphs and DAGs
- Minimum spanning trees
- Shortest paths
- Network flows
- Diagrams, sample C code, and detailed algorithm descriptions
The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators.
A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.
0201316633B08022001