File Organization And Processing,New

File Organization And Processing,New

In Stock
SKU: DADAX0471605212
Brand: Wiley
Condition: New
Regular price$71.72
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Introduces The Many And Powerful Data Structures For Representing Information Physically (In Contrast To A Database Management System That Represents Information With Logical Structures). Covers Specialized Data Structures, And Explains How To Choose The Appropriate Algorithm Or Data Structure For The Job At Hand. The Four Sections Treat Primary File Organizations, Bit Level And Related Structures, Tree Structures, And File Sorting. Opening Chapters Cover Sequential File Organization, Direct File Organization, Indexed Sequential File Organization, Bits Of Information, Secondary Key Retrieval, And Bits And Hashing. Following Chapters Cover Binary Tree Structures, Btrees And Derivatives, Hashing Techniques For Expandable Files, Other Tree Structures, More On Secondary Key Retrieval, Sorting, And Applying File Structures. Contains Pseudocode, Or An Outline In English, For Most Algorithms. Includes Endofsection Questions, With Answers To Some. Extensively Illustrated.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

  • Q: What is the binding type of this book? A: This book has a hardcover binding. Hardcover bindings are durable and provide a sturdy structure for prolonged use.
  • Q: How many pages does this book contain? A: This book contains four hundred sixteen pages. It offers comprehensive coverage of file organization and processing.
  • Q: What are the dimensions of this book? A: The book measures seven point seventy-four inches in length, zero point eighty-three inches in width, and nine point fifty-five inches in height. These dimensions make it suitable for easy handling.
  • Q: Who is the author of this book? A: The author of this book is Alan L. Tharp. He brings expertise in data structures and algorithms.
  • Q: What category does this book belong to? A: This book is categorized under Storage & Retrieval. It focuses on various data structures essential for effective file organization.
  • Q: Can beginners understand this book? A: Yes, beginners can understand this book. It covers fundamental concepts in file organization, making it accessible for all levels.
  • Q: Is there pseudocode included in this book? A: Yes, the book includes pseudocode for most algorithms. This helps readers grasp the logic behind algorithms without deep programming knowledge.
  • Q: Are there exercises included in the book? A: Yes, there are end-of-section questions included. Some answers are provided to facilitate learning and self-assessment.
  • Q: Does the book cover advanced data structures? A: Yes, the book covers advanced data structures such as binary trees and B-trees. It provides insights into choosing the right structures for specific tasks.
  • Q: Is this book suitable for academic purposes? A: Yes, this book is suitable for academic purposes. It provides a thorough understanding of data structures, making it ideal for students.
  • Q: How should I store this book to maintain its condition? A: Store this book upright in a cool, dry place to maintain its condition. Avoid exposure to direct sunlight and moisture.
  • Q: Can I easily transport this book? A: Yes, this book is easy to transport due to its compact size. You can carry it in a backpack or briefcase.
  • Q: Are there any illustrations in the book? A: Yes, the book is extensively illustrated. These visuals enhance understanding of complex data structures.
  • Q: What is the main focus of this book? A: The main focus of this book is on file organization and processing. It emphasizes the selection of appropriate algorithms and data structures.
  • Q: Is there a focus on file sorting techniques? A: Yes, the book includes detailed discussions on file sorting techniques. It covers various methods to efficiently organize data.
  • Q: How is this book relevant to data management? A: This book is highly relevant to data management as it teaches effective file organization strategies. It is essential for anyone working with data structures.

Recently Viewed