Data Structures II Essentials
Published on 1. January 2013
138 pages
978-0-7386-7172-7 (ISBN)
Description
REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Data Structures II includes sets, trees, advanced sorting, elementary graph theory, hashing, memory management and garbage collection, and appendices on recursion vs. iteration, algebraic notation, and large integer arithmetic.
More details
Other editions
Additional editions
Dennis C. Smolarski
Data Structures: v.2
Book
12/1990
Prentice Hall & IBD
€26.14
Shipment within 3-4 weeks
Content
- Intro
- These "Little Books" have rescued lots of grades and more!
- Title Page
- Copyright Page
- WHAT "THE ESSENTIALS" WILL DO FOR YOU
- Table of Contents
- CHAPTER 9 - SETS
- 9.1 BASIC DEFINITIONS
- 9.2 OPERATIONS ON SETS AND ITEMS
- 9.3 OPERATIONS ON TWO SETS
- 9.4 RELATIONS BETWEEN TWO SETS
- 9.5 IMPLEMENTATION OF SETS
- 9.6 SETS IN PASCAL
- CHAPTER 10 - TREES
- 10.1 BASIC DEFINITIONS
- 10.2 TRAVERSING BINARY TREES
- 10.3 OPERATIONS ON TREES
- 10.4 BALANCING AND ROTATING
- 10.5 THREADING TREES
- 10.6 GENERAL TREES
- CHAPTER 11 - ADVANCED SORTING
- 11.1 HEAP SORT
- 11.2 QUICK SORT
- 11.3 INDEX SORTING
- CHAPTER 12 - ELEMENTARY GRAPH THEORY
- 12.1 FUNDAMENTALS
- 12.2 GRAPH PROBLEMS AND ALGORITHMS
- 12.3 EULER AND HAMILTON PATHS
- 12.4 IMPLEMENTING GRAPHS
- CHAPTER 13 - HASHING
- 13.1 RESOLVING CLASHES
- CHAPTER 14 - MEMORY MANAGEMENT AND GARBAGE COLLECTION
- 14.1 OVERVIEW
- 14.2 MARKING PHASE
- 14.3 COLLECTION AND COMPACTION
- APPENDIX C - RECURSION VS. ITERATION
- APPENDIX D - ALGEBRAIC NOTATION
- APPENDIX E - LARGE INTEGER ARITHMETIC
- INDEX
