An edition of Schaum's outline of theory and problems of data structures (1986)

Schaum's outline of theory and problems of data structures

by

  • ★★★★ 4.3 (3 ratings)
  • 109 Want to read
  • 12 Currently reading
  • 3 Have read
Cover of: Schaum's outline of theory and problems of data structures by Seymour Lipschutz, Seymour Lipschutz
Preview
Borrow

My Reading Lists:

Create a new list
Notes
  • ★★★★ 4.3 (3 ratings)
  • 109 Want to read
  • 12 Currently reading
  • 3 Have read
Notes

Check nearby libraries

Buy this book

Last edited by ImportBot
March 19, 2022 | History
Edit
An edition of Schaum's outline of theory and problems of data structures (1986)

Schaum's outline of theory and problems of data structures

by

  • ★★★★ 4.3 (3 ratings)
  • 109 Want to read
  • 12 Currently reading
  • 3 Have read

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
McGraw-Hill
Language
English
Pages
344

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Data structures (Computer science) Structures de données (Informatique) Datenstruktur Einführung
Edition Availability
Cover of: Seymour lipschutz - Schaumt series: Theory and problems of data structures
Seymour lipschutz - Schaumt series: Theory and problems of data structures
2013, TMH
Cover of: Schaum's outline of theory and problems of data structures
Schaum's outline of theory and problems of data structures
1986, McGraw-Hill
in English

Add another edition?

Book Details

Table of Contents

Chapter 1. Introduction and Overview
Page 1
1.1. Introduction
Page 1
1.2. Basic Terminology; Elementary Data Organization
Page 1
1.3. Data Structures
Page 2
1.4. Data Structure Operations
Page 8
1.5. Algorithms: Complexity, Time-Space Tradeoff
Page 9
Chapter 2. Preliminaries
Page 17
2.1. Introduction
Page 17
2.2. Mathematical Notation and Functions
Page 18
2.3. Algorithmic Notation
Page 21
2.4. Control Structures
Page 23
2.5. Complexity of Algorithms
Page 27
2.6. Subalgorithms
Page 30
2.7. Variables, Data Types
Page 31
Chapter 3. String Processing
Page 41
3.1. Introduction
Page 41
3.2. Basic Terminology
Page 41
3.3. Storing Strings
Page 42
3.4. Character Data Type
Page 46
3.5. String Operations
Page 47
3.6. Word Processing
Page 49
3.7. Pattern Matching Algorithms
Page 53
Chapter 4. Arrays, Records and Pointers
Page 67
4.1. Introduction
Page 67
4.2. Linear Arrays
Page 67
4.3. Representation of Linear Arrays in Memory
Page 69
4.4. Traversing Linear Arrays
Page 70
4.5. Inserting and Deleting
Page 71
4.6. Sorting; Bubble Sort
Page 73
4.7. Searching; Linear Search
Page 76
4.8. Binary Search
Page 78
4.9. Multidimensional Arrays
Page 81
4.10. Pointers; Pointer Arrays
Page 86
4.11. Records; Record Structures
Page 90
4.12. Representation of Records in Memory; Parallel Arrays
Page 92
4.13. Matrices
Page 94
4.14. Sparse Matrices
Page 97
Chapter 5. Linked Lists
Page 114
5.1. Introduction
Page 114
5.2. Linked Lists
Page 115
5.3. Representation of Linked Lists in Memory
Page 116
5.4. Traversing a Linked List
Page 120
5.5. Searching a Linked List
Page 121
5.6. Memory Allocation; Garbage Collection
Page 123
5.7. Insertion into a Linked List
Page 127
5.8. Deletion from a Linked List
Page 134
5.9. Header Linked Lists
Page 140
5.10. Two-Way Lists
Page 144
Chapter 6. Stacks, Queues, Recursion
Page 164
6.1. Introduction
Page 164
6.2. Stacks
Page 165
6.3. Array Representation of Stacks
Page 166
6.4. Arithmetic Expressions; Polish Notation
Page 168
6.5. Quicksort, an Application of Stacks
Page 173
6.6. Recursion
Page 176
6.7. Towers of Hanoi
Page 180
6.8. Implementation of Recursive Procedures by Stacks
Page 183
6.9. Queues
Page 188
6.10. Deques
Page 192
6.11. Priority Queues
Page 193
Chapter 7. Trees
Page 214
7.1. Introduction
Page 214
7.2. Binary Trees
Page 214
7.3. Representing Binary Trees in Memory
Page 217
7.4. Traversing Binary Trees
Page 221
7.5. Traversal Algorithms Using Stacks
Page 224
7.6. Header Nodes; Threads
Page 229
7.7. Binary Search Trees
Page 233
7.8. Searching and Inserting in Binary Search Trees
Page 234
7.9. Deleting in a Binary Search Tree
Page 238
7.10. Heap; Heapsort
Page 243
7.11. Path Lengths; Huffman's Algorithm
Page 249
7.12. General Trees
Page 255
Chapter 8. Graphs and Their Applications
Page 277
8.1. Introduction
Page 277
8.2. Graph Theory Terminology
Page 277
8.3. Sequential Representation of Graphs; Adjacency Matrix; Path Matrix
Page 280
8.4. Warshall's Algorithm; Shortest Paths
Page 282
8.5. Linked Representation of a Graph
Page 286
8.6. Operations on Graphs
Page 289
8.7. Traversing a Graph
Page 294
8.8. Posets; Topological Sorting
Page 297
Chapter 9. Sorting and Searching
Page 318
9.1. Introduction
Page 318
9.2. Sorting
Page 318
9.3. Insertion Sort
Page 322
9.4. Selection Sort
Page 324
9.5. Merging
Page 325
9.6. Merge-Sort
Page 328
9.7. Radix Sort
Page 330
9.8. Searching and Data Modification
Page 332
9.9. Hashing
Page 333
Index
Page 341

Edition Notes

Includes index.

Published in
New York
Series
Schaum's outline series.
Other Titles
Data structures., Theory and problems of data structures.

Classifications

Dewey Decimal Class
005.7/3
Library of Congress
QA76.9.D35 L57 1986

The Physical Object

Pagination
344 p. :
Number of pages
344

Edition Identifiers

Open Library
OL2541770M
Internet Archive
schaumsoutlineof0000lips_g8z1
ISBN 10
0070380015
LCCN
85023108
LibraryThing
2476837
Goodreads
749907

Work Identifiers

Work ID
OL1832424W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Download catalog record: RDF / JSON