Title
Algorithms and Data Structures,New
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
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
Payment Option
From the inventor of Pascal and Modula2 comes a new version of Niklaus Wirth's classic work, Algorithms Plus Data Structure Equals Programs (PH, l975). This title uses Modula2 and includes new material on sequential structure, searching and priority search trees.
⚠️ 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 main focus of the book 'Algorithms and Data Structures'? A: The book primarily focuses on the relationship between algorithms and data structures, showcasing how they work together to form effective programs.
- Q: Who is the author of 'Algorithms and Data Structures'? A: The author of the book is Niklaus Wirth, who is also known for creating the Pascal and Modula-2 programming languages.
- Q: What programming language is emphasized in this book? A: The book uses Modula-2 as its primary programming language for illustrating its concepts and examples.
- Q: When was 'Algorithms and Data Structures' published? A: The book was published on January 1, 1985.
- Q: How many pages does the book contain? A: The book contains a total of 288 pages.
- Q: What is the binding type of this book? A: The book is available in hardcover binding.
- Q: What condition is the book in? A: The book is listed as being in good condition.
- Q: Does the book include any new material? A: Yes, the book includes new material on sequential structures, searching, and priority search trees.
- Q: Is this book suitable for beginners in computer science? A: While the book provides essential concepts, a basic understanding of programming and data structures may be beneficial for beginners.
- Q: Can this book help with understanding algorithms for real-world applications? A: Yes, the principles discussed in the book are applicable to real-world programming and software development challenges.