Data Structures I Essentials
Published on 1. January 2013
123 pages
978-0-7386-7149-9 (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 I includes scalar variables, arrays and records, elementary sorting, searching, linked lists, queues, and appendices of binary notation and subprogram parameter passing.
More details
Other editions
Additional editions
Dennis C. Smolarski
Data Structures: v.1
Book
12/1990
Prentice Hall & IBD
€26.13
No shipping information available
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 1 - INTRODUCTION
- 1.1 DATA AND PROGRAMS
- 1.2 ABSTRACT DATA TYPES
- 1.3 COMMENTS ON TOPICS
- CHAPTER 2 - SCALAR VARIABLES
- 2.1 COMPUTER MEMORY
- 2.2 DATA TYPES
- 2.3 ENCODING DATA
- 2.4 COMMENTS ON VARIABLE TYPES
- 2.5 DECLARING SCALAR VARIABLES
- CHAPTER 3 - ARRAYS AND RECORDS
- 3.1 AGGREGATE STRUCTURES
- 3.2 ONE-DIMENSION ARRAYS
- 3.3 STORAGE OF ARRAYS
- 3.4 TWO- AND HIGHER-DIMENSION ARRAYS
- 3.5 DECLARING ARRAYS
- 3.6 RECORDS
- CHAPTER 4 - ELEMENTARY SORTING
- 4.1 SORTING ALGORITHMS
- 4.2 BUBBLE SORT
- 4.3 STRAIGHT SELECTION SORT
- 4.4 STABLE SORTS
- CHAPTER 5 - SEARCHING
- 5.1 SEARCHING ALGORITHMS
- 5.2 LINEAR SEARCH
- 5.3 BINARY SEARCH
- 5.4 HASHING
- CHAPTER 6 - LINKED LISTS
- 6.1 BASIC DEFINITIONS
- 6.2 LINEAR IMPLEMENTATION
- 6.3 POINTER IMPLEMENTATION
- 6.4 COMMON OPERATIONS
- 6.5 VARIATIONS
- CHAPTER 7 - STACKS
- 7.1 STACK STRUCTURE AND OPERATIONS
- 7.2 USING STACKS
- 7.3 SAMPLE IMPLEMENTATION
- 7.4 APPLICATIONS
- CHAPTER 8 - QUEUES
- 8.1 QUEUE STRUCTURE AND OPERATIONS
- 8.2 IMPLEMENTING QUEUES USING ARRAYS
- 8.3 IMPLEMENTING QUEUES USING LINKED LISTS
- 8.4 IMPLEMENTING QUEUES USING CIRCULAR LINKED LISTS
- 8.5 DEQUES
- 8.6 EVALUATION
- APPENDIX A - BINARY NOTATION
- APPENDIX B - SUBPROGRAM PARAMETER PASSING
- INDEX
- These "Little Books" have rescued lots of grades and more!
