Browse Prior Art Database

IEEE Computer Volume 11 Number 8 -- BOOK REVIEWS Disclosure Number: IPCOM000131353D
Original Publication Date: 1978-Aug-01
Included in the Prior Art Database: 2005-Nov-10
Document File: 5 page(s) / 25K

Publishing Venue

Software Patent Institute

Related People

Dr. Francis P. Mathur: AUTHOR [+3]



This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 22% of the total text.

Page 1 of 5


This record contains textual material that is copyright ©; 1978 by the Institute of Electrical and Electronics Engineers, Inc. All rights reserved. Contact the IEEE Computer Society (714-821-8380) for copies of the complete work that was the source of this textual material and for all use beyond that as a record from the SPI Database.


Recently published books and new periodicals may be submitted for review to the Book Reviews Editor:

Dr. Francis P. Mathur

Professor and Computer Science Coordinator Mathematics Department California State Polytechnic University 3801 WestTempleAvenue Pomona, CA 91 i68 Telephone: (714J 598- 4421

(Note: publications reviewed in this section are not available from the IEEE Computer Society. Please order directly from the publisher.)

B78-22 Data Structure and Management -- Ivan Flores (Englewood Cliffs, New Jersey: Prentice-Hall, Inc., 1977, 390 pp., $18.95)

The last year has seen at least six books on data structures published and now Ivan Flores' second edition joins the ranks. The book is markedly changed from the 1970 edition, with a substantial rearrangement of topics. Flores has included expanded material on lists and overflow, a new chapter on binary trees, and a cursory overview of complex files. He has dropped most of the material on hardware, access methods, and auxiliary memory. A new set of improved drawings enhances the book's appearance as does the simplified notation and choice of type font. The problems at the end of each chapter have been replaced with extensive new sets.

The book now begins with background material covering computers, graph theory, data records, and fields; classical data processing couched in terms of lists follows. These chapters make up 40 percent of the book. An equal portion of the book is devoted to simple link list files including directories, mappings, and overflow. The remainder of the book is devoted to trees, multilists, and multilinks, followed by appendices and an index.

Has Flores' updated version, which is less mathematical and more general in its approach to data structure, made this book the best choice for an undergraduate textbook? (As Flores indicates, this is his intended use for the book since he did not include any new material of import to researchers or active practitioners.) For instructional use the important areas for evaluation are the book's presentation, its comprehensiveness, and its applicability to the needs of a course outline.


How good is the presentation? The drawings are well done, and they often convey the meaning of a whole section of the text. However, they are difficult to understand because they employ about 20 different symbols defined at various places in the book -- legends are not included with each drawing. The simplification of the mathematical notation is helpful to the presentation but leads to the questio...