Algorithms and Data Structures: Design, Correctness, Analysis: Kingston, Jeffrey H.: 9780201403749: Book: Computers: eCampus.com

This book provides an in-depth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness, and analysis required for understanding them. The book starts with techniques before covering the major application areas. Dr. Kingston presents the various approaches and the trade-offs involved in choosing among them. The theory is then completed with a closing chapter on lower bounds. The book provides complete and carefully tested Eiffel implementations.

Preface

Chapter 1 Algorithm Correctness

(14)

1.1 Problems and specifications

(1)

1.2 Recursive algorithms

(2)

1.3 Iterative algorithms

(6)

1.4 Exercises

(4)

Chapter 2 Analysis of Algorithms

(24)

2.1 Characteristic operations and time complexity

(3)

2.2 Recursive algorithms

(5)

2.3 Iterative algorithms

(4)

2.4 Evaluating efficiency, and the O-notation

(4)

2.5 Exercises

(8)

Chapter 3 Data Abstraction

(22)

3.1 Abstract data types

(3)

3.2 Correctness of ADT implementations

(5)

3.3 Analysis of ADT implementations

(2)

3.4 Amortized analysis

(5)

3.5 Practical issues in the design of container ADTs

(4)

3.6 Exercises

(3)

Chapter 4 Algorithm Design

(18)

4.1 The design process

(2)

4.2 Incremental algorithms

(2)

4.3 Divide-and-conquer

(4)

4.4 Dynamic programming

(5)

4.5 Exercises

(5)

Chapter 5 Lists, Stacks, and Queues

(24)

5.1 Lists

(8)

5.2 Stacks

(4)

5.3 Queues

(8)

5.4 Exercises

(4)

Chapter 6 Trees

103

(27)

6.1 Definitions

104

(3)

6.2 Operations on trees

107

(10)

6.3 Mathematical properties of trees

117

(5)

6.4 Huffman trees

122

(4)

6.5 Exercises

126

(4)

Chapter 7 Symbol Tables

130

(47)

7.1 Specification

130

(1)

7.2 Linked lists

131

(2)

7.3 Locality of reference and self-adjusting lists

133

(4)

7.4 The binary search tree

137

(8)

7.5 Splay trees

145

(6)

7.6 B-trees

151

(6)

7.7 Hashing

157

(6)

7.8 The Indexed List ADT

163

(3)

7.9 Choosing a symbol table implementation

166

(1)

7.10 Exercises

167

(10)

Chapter 8 Priority Queues

177

(32)

8.1 Specification

177

(2)

8.2 Heap-ordered trees

179

(4)

8.3 The heap

183

(4)

8.4 Heapsort

187

(3)

8.5 Binomial queues

190

(3)

8.6 Fibonacci heaps

193

(11)

8.7 Choosing a priority queue implementation

204

(2)

8.8 Exercises

206

(3)

Chapter 9 Sorting

209

(25)

9.1 Insertion sorting

209

(5)

9.2 Selection sorting

214

(1)

9.3 Merging and Mergesort

215

(3)

9.4 Quicksort

218

(5)

9.5 Radix sorting

223

(3)

9.6 Choosing a sorting algorithm

226

(1)

9.7 Exercises

227

(7)

Chapter 10 Disjoint Sets

234

(17)

10.1 Specification

234

(3)

10.2 The Galler-Fischer representation

237

(3)

10.3 Union by size

240

(2)

10.4 Path compression

242

(7)

10.5 Exercises

249

(2)

Chapter 11 Graphs

251

11.1 Definitions

252

(1)

11.2 Specification and representation

253

(2)

11.3 Relations and digraphs

255

(6)

11.4 Directed acyclic graphs

261

(7)

11.5 Breadth-first search

268

(3)

11.6 Depth-first search

271

(2)

11.7 Strongly connected components

273

(2)

11.8 Biconnectivity

275

(4)

11.9 Exercises

279


	Buy Textbooks Sell Textbooks College Apparel Shop by School Virtual Bookstores	Order Status Shipping Rates Return Policy Marketplace Info F.A.S.T.	Contact Us Privacy Policy Legal Notices Site Security Employment	Help Desk eCampus Blog Affiliate Program Bulk Orders College Marketing

Need Help? eService@ecampus.com Copyright© 1999-2008
.