Algorithms and Data Structures in C++
Regular price
€107.99
14 days return policy
Shipping & Delivery
A01=Alan Parker
adder
advanced data structure analysis
Alan Parker
algorithm visualization
Author_Alan Parker
Biased Exponent
booth
Booth Algorithm
Category=UMB
Category=UMX
Category=UYA
char
Code List
Complement Addition
computational complexity
Const Void
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Fixed Point Division
Floating Point
full
Full Adder
graph algorithms
Half Adder
Hex Digits
Hypercube Topology
Int Size
linked
Linked List
lists
Memory Allocation
NAND Gate
Nonrestoring Division
number
parallel computing
polymorphism techniques
Present Key
RECTANGLE Class
Rectangular Mesh
residue
Residue Number System
Signed Magnitude Notation
Simulated Annealing
system
template programming
True Inverse
Unbiased Exponent
unsigned
Unsigned Char
Product details
- ISBN 9780849371714
- Weight: 660g
- Dimensions: 174 x 246mm
- Publication Date: 26 Aug 1993
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Algorithms and Data Structures in C++ introduces modern issues in the theory of algorithms, emphasizing complexity, graphs, parallel processing, and visualization. To accomplish this, the book uses an appropriate subset of frequently utilized and representative algorithms and applications in order to demonstrate the unique and modern aspects of the C++ programming language.
What makes this book so valuable is that many complete C++ programs have been compiled and executed on multiple platforms. Each program presented is a stand-alone functional program. A number of applications that exercise significant features of C++, including templates and polymorphisms, is included. The book is a perfect text for computer science and engineering students in traditional algorithms or data structures courses. It will also benefit professionals in all fields of computer science and engineering.
