sitemap | contact us
      
 
  Book Series
  Journals
  Book Proposal Form
 
  Using Published Material
  Rights and Permissions
  Examination Copies
   
   
  List of Publishers
  Bargains
   
   
  Services
   
   
  About Narosa
  History
  Mission
  Group Companies
  Our Strength
  Alliances
   
   
   
 
view in print mode
Applied Data Structures with C++
Author(s): Peter Smith

ISBN:    978-81-7319-617-1 
E-ISBN:   
Publication Year:   2004
Pages:   710
Binding:   Paper Back
Dimension:   185mm x 240mm
Weight:   950


Textbook


About the book

Designed for use in either a one –or two-semester advanced data structures course, Applied Data Structures with C++ covers all of the fundamental structures and data types, and features implementations presented in C++. Using clear explanations and efficient examples, the book presents a comprehensive overview of main memory and file-based structures, with an emphasis on files and persistent structures. Additional coverage of object-oriented design, persistence, recursion, and databases as large-scale file structures supplements the standard approach to fundamental topics. Material can be adapted flexibly according to the focus or length of the course, with suggestions for use in one- and two-semester formats from the author.


Key Features

  • Comprehensive coverage of fundamental topics including: Lists, sets, stacks and queues/ Array-based structures/ Binary, tries, and ternary search trees/ Internal and external sorting/ Graphs and maps/ Indexed files and grid file organization/ Big-O analysis and recursion/ Algorithm analysis • Clear, concise, and efficient implementation of algorithms and data types in C++ rather than pseudocode. For ease of learning, large-scale algorithms are implemented in pseudo-C++. • Numerous worked examples corresponding to the implementations, including complete source code for each, available for download at the book’s web site. • Brief introduction to database systems as large-scale file structures. • End-of-chapter exercises include programming problems and design and analysis questions.



Table of Contents

Preface / Part I: Transient Objects: Programming with Objects/ Lists and Strings/ Sets/ Stacks and Queues/ Maps: Hash Tables/ Maps: Binary Trees, Tries, and Ternary Trees/ Graphs / Part II: Persistent Objects: Hardware Foundations of Persistent Objects/ Files and Objects/ Sorting/ Maps: Hash Files/ Maps: File-Based Trees/ Multimaps: Secondary Key Retrievals/ Persistent Structures and Databases / Appendix A: Random Numbers and Data Generation / Appendix B: Data Normalization / Appendix C: Test of File Object / Glossary / Index




Audience

Undergraduate and Postgraduate Students


CLICK HERE


Group
| Companies | Mission | Strength | Values | History | Contact us
© Narosa Publishing House