◆新書介紹
◆圖書分類
◆進階查詢
◆特價書區
◆教師服務
◆會員專區
◆購物車
◆討論區
◆網站連結

美國地址驗證
貨物追蹤

SSL 交易安全聲明


*COMPUTER ALGORITHMS C++ 1997

△看放大圖
ISBN: 0716783150
類別: 電腦Computer Science & Engineering
出版社: W. H. FREEMAN
作者: HOROWITZ
年份: 1997
裝訂別: 精裝
頁數: 700
定價: 1,120
售價: 550
原幣價: USD 128.50
狀態: 正常
The author team that established its reputation nearly twenty years ago with Fundamentals of Computer Algorithms offers this new title, available in both pseudocode and C++ versions. Ideal for junior/senior level courses in the analysis of algorithms, this well-researched text takes a theoretical approach to the subject, creating a basis for more in-depth study and providing opportunities for hands-on learning. Emphasizing design technique, the text uses exciting, state-of-the-art examples to illustrate design strategies.

Table of Contents

1. Introduction
What Is An Algorithm?
Algorithm Specification
Performance Analysis
Randomized Algorithms

2. Elementary Data Structures
Stacks and Queues
Trees
Dictionaries
Priority Queues
Sets and Disjoint Set Union
Graphs

3. Divide-and-Conquer
General Method
Binary Search
Finding the Maximum and Minimum
Merge Sort
Quicksort
Selection
Strassen's Matrix Multiplication
Convex Hull
Additional Exercises

4. The Greedy Method
The General Method
Knapsack Problem
Tree Vertex Splitting
Job Sequencing with Deadlines
Minimum-Cost Spanning Trees
Optimal Storage on Tapes
Optimal Merge Patterns
Single-Source Shortest Paths
Additional Exercises

5. Dynamic Programming
The General Method
Multistage Graphs
All Pairs Shortest Paths
Single Source Shortest Paths: General Weights
Optimal Binary Search Trees
String Editing
0/1 Knapsack
Reliability Design
The Traveling Salesperson Problem
Flow Shop Scheduling
Additional Exercises

6. Basic Traversal and Search Techniques
Techniques for Binary Trees
Techniques for Graphs
Connected Components and Spanning Trees
Biconnected Components and DFS

7. Backtracking
The General Method
The 8-Queens Problem
Sum of Subsets
Graph Coloring
Hamiltonian Cycles
Knapsack Problem
Additional Exercises

8. Branch-and-Bound
The Method
0/1 Knapsack Problem
Traveling Salesperson
Efficiency Considerations

9. Algebraic Problems
The General Method
Evaluation and Interpolation
The Fast Fourier Transform
Modular Arithmetic
Even Faster Evaluation and Interpolation

10. Lower Bound Theory
Comparison Trees
Oracles and Adversary Arguments
Lower Bounds Through Reductions
Techniques for Algebraic Problems

11. NP-Hard and NP-Complete Problems
Basic Concepts
Cook's Theorem
NP-Hard Graph Problems
NP-Hard Scheduling Problems
NP-Hard Code Generation Problems
Some Simplified NP-Hard Problems
Additional Exercises

12. Approximation Algorithms
Introduction
Absolute Approximations
E-Approximations
Polynomial Time Approximation Schemes
Fully Polynomial Time Approximation Schemes
Probabilistically Good Algorithms
Additional Exercises

13. PRAM Algorithms
Introduction
Computational Model
Fundamental Techniques and Algorithms
Selection
Merging
Sorting
Graph Problems
Computing the Convex Hull
Lower Bounds

14. Mesh Algorithms
Computational Model
Packet Routing
Fundamental Algorithms
Selection
Merging
Sorting
Graph Problems
Computing the Convex Hull
Additional Exercises

15. Hypercube Algorithms
Computational Model
PPR Routing
Fundamental Algorithms
Selection
Merging
Sorting
Graph Problems
Computing the Convex Hull
Additional Exercises

Index
Springer 國外現貨
帳號:
密碼:
 

    

 

 

 
科大文化事業股份有限公司 SCI-TECH Publishing Company Ltd.
221 新北市汐止區新台五路一段99號11樓之8
TEL: 886-2-26971353 FAX: 886-2-26971631
Copyright © 2004 SCI-TECH All Rights Reserved.
訪客人數:2405253