Amazon no longer offers textbook rentals. We do!

Data Structures: A Pseudocode Approach With C++

by: Gilberg,Richard F.

Data Structures: A Pseudocode Approach With C++

by: Gilberg,Richard F.

ISBN 13:
9780534952167
ISBN 10:
053495216X
Edition: 1st
Format: Hardcover
Copyright: 04/25/2000
Publisher: Cengage Learning
Newer Edition

Rent

Sorry, this item is currently unavailable.

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Extend or Purchase Your Rental at Any Time

Need to keep your rental past your due date? At any time before your due date you can extend or purchase your rental through your account.

Summary

This new text makes it simple for beginning computer science students to design algorithms first using pseudocode and then build them using the C++ programming language. Based on Gilberg and Forouzan's successful text, Data Structures: A Pseudocode Approach with C, this new book emphasizes a practical approach to data structures.

Introduction

(28)

Pseudocode

(5)

Algorithm Header

(1)

Purpose, Conditions, and Return

(1)

Statement Numbers

(1)

Variables

(1)

Algorithm Analysis

(1)

Statement Constructs

(1)

Pseudocode Example

(1)

The Abstract Data Type

(4)

Atomic and Composite Data

(1)

Data Structure

(1)

Abstract Data Type

(2)

A Model for an Abstract Data Type

(3)

ADT Operations

(1)

ADT Data Structure

(1)

ADT Class Templates

(1)

Algorithm Efficiency

(10)

Linear Loops

(1)

Logarithmic Loops

(1)

Nested Loops

(2)

Big-O Notation

(1)

Standard Measures of Efficiency

(1)

Big-O Analysis Examples

(3)

Summary

(1)

Practice Sets

(4)

Exercises

(2)

Problems

(1)

Projects

(2)

Searching

(48)

List Searches

(13)

Sequential Search

(3)

Variations on Sequential Searches

(4)

Binary Search

(3)

Binary Search Algorithm

(1)

Analyzing Search Algorithms

(2)

C++ Search Algorithms

(6)

Sequential Search in C++

(1)

Binary Search in C++

(2)

Search Example

(3)

Hashed List Searches

(10)

Basic Concepts

(2)

Hashing Methods

(5)

Hashing Algorithm

(2)

Collision Resolution

(13)

Open Addressing

(4)

Linked List Resolution

(1)

Bucket Hashing

(1)

Combination Approaches

(1)

Hash List Example

(4)

Summary

(2)

Practice Sets

(3)

Exercises

(1)

Problems

(1)

Projects

(2)

Linked Lists

(79)

Linear List Concepts

(3)

Insertion

(1)

Deletion

(1)

Retrieval

(1)

Traversal

(1)

Linked List Concepts

(3)

Nodes

(1)

Linked List Data Structure

(2)

Pointers to Linked Lists

(1)

Linked List Algorithms

(18)

Create List

(1)

Insert Node

(5)

Delete Node

(3)

Search List

(3)

Unordered List Search

(1)

Retrieve Node

(1)

Empty List

(1)

Full List

(1)

List Count

(1)

Traverse List

(2)

Destroy List

101

(1)

Processing a Linked List

102

(6)

Add Node

104

(1)

Remove Node

105

(1)

Print List

106

(1)

Testing Insert and Delete Logic

107

(1)

List Applications

108

(5)

Append Lists

108

(2)

Array of Lists

110

(3)

Complex Linked List Structures

113

(9)

Circularly Linked Lists

113

(1)

Doubly Linked Lists

113

(6)

Multilinked Lists

119

(2)

Multilinked List Insert

121

(1)

Multilinked List Delete

122

(1)

Building a Linked List---C++ Implementation

122

(7)

Data Structure

122

(1)

Application Functions

123

(6)

List Abstract Data Type---Linked List Implementation

129

(14)

List ADT Declaration

131

(12)

Summary

143

(1)

Practice Sets

144

(12)

Exercises

144

(3)

Problems

147

(1)

Projects

148

(8)

Stacks

156

(61)

Basic Stack Operations

157

(3)

Push

157

(1)

Pop

157

(1)

Stack Top

158

(2)

Stack Linked List Implementation

160

(8)

Data Structure

160

(1)

Stack Algorithms

161

(7)

Stack Applications

168

(20)

Reversing Data

169

(1)

Reverse a List

169

(1)

Convert Decimal to Binary

170

(1)

Parsing

171

(2)

Postponement

173

(8)

Backtracking

181

(7)

Eight Queens Problem---C++ Implementation

188

(7)

Main Line Logic

189

(1)

Get Board Size

190

(5)

Stack Abstract Data Type Implementation

195

(7)

Data Structure

195

(1)

Stack ADT Implementation

196

(6)

Stack ADT---Array Implementation

202

(7)

Array Data Structure

203

(1)

Create Stack Array

204

(1)

Push Stack Array

205

(1)

Pop Stack Array

206

(1)

Stack Top Array

207

(1)

Empty Stack Array

208

(1)

Full Stack Array

208

(1)

Stack Count Array

208

(1)

Destroy Stack Array

209

(1)

Summary

209

(1)

Practice Sets

210

(7)

Exercises

210

(1)

Problems

211

(2)

Projects

213

(4)

Queues

217

(54)

Queue Operations

218

(2)

Enqueue

218

(1)

Dequeue

218

(1)

Queue Front

219

(1)

Queue Rear

220

(1)

Queue Example

220

(1)

Queue Linked List Design

220

(9)

Data Structure

220

(2)

Queue Algorithms

222

(2)

Create Queue

224

(1)

Enqueue

224

(1)

Dequeue

225

(2)

Retrieving Queue Data

227

(1)

Empty Queue

228

(1)

Full Queue

228

(1)

Queue Count

228

(1)

Destroy Queue

229

(1)

Queuing Theory

229

(2)

Queue Applications

231

(10)

Queue Simulation

231

(8)

Categorizing Data

239

(2)

Categorizing Data---C++ Implementation

241

(5)

Main Line Logic

241

(1)

Fill Queues

242

(2)

Print Queues

244

(1)

Print One Queue

244

(2)

Queue ADT---Linked List Implementation

246

(7)

Queue Structure

246

(1)

Queue ADT Implementation

247

(6)

Queue ADT---Array Implementation

253

(8)

Array Queue Implementation

254

(7)

Summary

261

(1)

Practice Sets

262

(9)

Exercises

262

(3)

Problems

265

(1)

Projects

266

(5)

Recursion

271

(34)

Factorial---A Case Study

272

(3)

Recursion Defined

272

(1)

Iterative Solution

273

(1)

Recursive Solution

273

(2)

How Recursion Works

275

(2)

Designing Recursive Algorithms

277

(4)

The Design Methodology

278

(1)

Limitations of Recursion

279

(1)

Design Implementation---Reverse a Linked List

279

(2)

Another Case Study---Fibonacci Numbers

281

(4)

The Towers of Hanoi

285

(5)

Recursive Towers Of Hanoi

286

(4)

C++ Implementation of Recursion

290

(9)

Fibonacci Numbers

290

(1)

Prefix to Postfix Conversion

291

(6)

Towers of Hanoi

297

(2)

Summary

299

(1)

Practice Sets

300

(5)

Exercises

300

(2)

Problems

302

(1)

Projects

303

(2)

Introduction to Trees

305

(33)

Basic Tree Concepts

306

(4)

Terminology

306

(2)

Tree Representation

308

(2)

Binary Trees

310

(3)

Properties

312

(1)

Binary Tree Traversals

313

(9)

Depth-First Traversals

314

(6)

Breadth-First Traversals

320

(2)

Expression Trees

322

(2)

Infix Traversal

322

(2)

Postfix Traversal

324

(1)

Prefix Traversal

324

(1)

General Trees

324

(3)

Changing General Tree to Binary Tree

325

(1)

Insertions into General Trees

326

(1)

General Tree Deletions

327

(1)

Huffman Code

327

(5)

Summary

332

(1)

Practice Sets

333

(5)

Exercises

333

(4)

Problems

337

(1)

Projects

337

(1)

Search Trees

338

(68)

Binary Search Trees

339

(14)

Definition

339

(2)

Operations on Binary Search Trees

341

(1)

Binary Search Tree Search Algorithms

342

(11)

AVL Trees

353

(19)

AVL Balance Factor

354

(1)

Balancing Trees

355

(5)

AVL Node Structure

360

(7)

AVL Delete Algorithm

367

(5)

Adjusting the Balance Factors

372

(1)

AVL Tree Implementation

372

(6)

Data Structure

372

(1)

Program Design

373

(4)

Count Words Summary

377

(1)

AVL Abstract Data Type

378

(20)

AVL Tree Data Structures

379

(1)

AVL Tree Functions

380

(12)

AVL Tree Data Processing

392

(3)

AVL Tree Utility Functions

395

(3)

Summary

398

(1)

Practice Sets

399

(7)

Exercises

399

(4)

Problems

403

(1)

Projects

403

(3)

Heaps

406

(33)

Heap Definition

407

(1)

Heap Structure

407

(1)

Basic Heap Algorithms

408

(4)

ReheapUp

409

(2)

ReheapDown

411

(1)

Heap Data Structure

412

(2)

Heap Algorithms

414

(7)

ReheapUp

414

(1)

ReheapDown

415

(1)

BuildHeap

416

(2)

InsertHeap

418

(1)

DeleteHeap

419

(2)

Heap Applications

421

(3)

Selection Algorithms

421

(2)

Priority Queues

423

(1)

A Heap Program

424

(9)

Heap Program Design

425

(5)

Heap Functions

430

(3)

Summary

433

(1)

Practice Sets

434

(5)

Exercises

434

(2)

Problems

436

(1)

Projects

436

(3)

Multiway Trees

439

(63)

m-Way Search Trees

440

(2)

B-Trees

442

(29)

B-Tree Insertion

443

(1)

B-Tree Insert Design

444

(2)

B-Tree Insert Node

446

(8)

B-Tree Deletion

454

(13)

Traverse B-Tree

467

(3)

B-Tree Search

470

(1)

Simplified B-Trees

471

(1)

Tree

471

(1)

Tree

472

(1)

B-Tree Variations

472

(2)

B*Tree

473

(1)

B+Tree

474

(1)

Lexical Search Tree

474

(4)

Tries

475

(1)

Trie Structure

476

(2)

B-Tree Abstract Data Type

478

(21)

Header File

479

(2)

Utility Functions

481

(4)

Insert Algorithms

485

(6)

Delete Algorithms

491

(8)

Summary

499

(1)

Practice Sets

499

(3)

Exercises

499

(1)

Problems

500

(1)

Projects

501

(1)

Advanced Sorting Concepts

502

(58)

General Sort Concepts

503

(2)

Sort Order

503

(1)

Sort Stability

504

(1)

Sort Efficiency

504

(1)

Passes

505

(1)

Insertion Sorts

505

(12)

Straight Insertion Sort

505

(3)

Shell Sort

508

(5)

Insertion Sort Algorithms

513

(2)

Insertion Sort Implementation

515

(2)

Selection Sorts

517

(9)

Straight Selection Sort

517

(5)

Selection Sort Algorithms

522

(2)

Selection Sort Implementation

524

(2)

Exchange Sorts

526

(12)

Bubble Sort

526

(1)

Bubble Sort Algorithm

527

(2)

Quick Sort

529

(7)

Exchange Sort Algorithms

536

(2)

Summary

538

(4)

Exchange Sort Implementation

538

(4)

External Sorts

542

(11)

Merging Ordered Files

543

(1)

Merging Unordered Files

544

(2)

The Sorting Process

546

(5)

Sort Phase Revisited

551

(2)

Summary

553

(1)

Practice Sets

554

(6)

Exercises

554

(2)

Problems

556

(1)

Projects

556

(4)

Graphs

560

(152)

Terminology

561

(2)

Operations

563

(5)

Add Vertex

563

(1)

Delete Vertex

563

(1)

Add Edge

563

(1)

Delete Edge

564

(1)

Find Vertex

564

(1)

Traverse Graph

564

(4)

Graph Storage Structures

568

(2)

Adjacency Matrix

568

(1)

Adjacency List

569

(1)

Graph Algorithms

570

(15)

Create Graph

571

(1)

Insert Vertex

572

(1)

Delete Vertex

573

(2)

Insert Arc

575

(2)

Delete Arc

577

(1)

Retrieve Vertex

578

(1)

First Arc

579

(2)

Depth-First Traversal

581

(2)

Breadth-First Traversal

583

(2)

Networks

585

(11)

Minimum Spanning Tree

585

(6)

Shortest Path Algorithm

591

(5)

Abstract Data Type

596

(11)

Insert Vertex

598

(1)

Delete Vertex

599

(1)

Insert Arc

600

(2)

Delete Arc

602

(2)

Depth-First Traversal

604

(1)

Breadth-First Traversal

605

(2)

Summary

607

(1)

Practice Sets

608

(7)

Exercises

608

(2)

Problems

610

(1)

Projects

611

(4)

Appendixes

A ASCII Tables

615

(5)

B Structure Charts

620

(7)

C Program Standards and Styles

627

(6)

D Random Numbers

633

(6)

E Standard C++ Libraries

639

(2)

F C++ Function Prototypes

641

(9)

G Classes Related to Input and Output

650

(5)

H The String Class

655

(11)

I Pointers to Functions

666

(4)

J Inheritance

670

(15)

K C++ Templates

685

(7)

L Standard Template Library

692

(20)

Solutions to Selected Exercises

712

(23)

Glossary

735

(12)

Index

747

Amazon no longer offers textbook rentals. We do!

Data Structures: A Pseudocode Approach With C++

Data Structures: A Pseudocode Approach With C++

9780534952167

053495216X

Summary

Table of Contents

Supplemental Materials

Write a Review