Data Structures, Algorighms, and Software Principles
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Data Structures, Algorighms, and Software Principles
Data Structures, Algorighms, and Software Principles

Data Structures, Algorighms, and Software Principles

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

This book develops the concepts of data structures and algorithm analysis step-by-step in a gradual fashion, proceeding from concrete examples to abstract principles. The presentation stresses motivation, intuition, and utility before giving technical details. Recurring themes such as recursion, levels of abstraction, efficiency, and trade-offs unify the material. Important software engineering concepts and principles are also covered including modularity, abstract data types, and information hiding, as well as new developments such as risk-based software lifecycle models and object-oriented programming. Mathematical foundations are covered and can be engaged at a variety of depths. It is assumed that students using this book for a CS2 course will have already taken a CS1 course covering introductory programming using Pascal.Highlights *Develops the concepts and theory of data structures and algorithm analysis step-by-step, in a gradual fashion, proceeding from concrete examples to abstract principles *Uses recurring themes such as recursion, levels of abstraction, efficiency, and trade-offs to unify the material completely *Provides mathematical foundations that can be engaged at a variety of depths *Covers traditional software engineering principles as well as introducing new concepts such as risk-based software lifecycle models, rapid prototyping, and reusable software components *Introduction to object-oriented programming 0201528800B04062001

Table of Contents:
(Each chapter, except Chapter 1, begins with an Introduction and Motivation, and concludes with Pitfalls, Tips and Techniques, References for Further Study and a Chapter Summary.) 1. Preparing for the Journey. Where Are We Going? Blending Mathematics, Science, and Engineering. The Search for Enduring Principles in Computer Science. Principles of Software System Structure. Efficiency and Tradeoffs. Software Engineering Principles. Our Approach to Mathematics. Some Notes on Programming Notation. Preview of Coming Attractions. Chapter Summary. Problems and Exercises. 2. Linked Data Representations. What are Pointers? The Basic Intuition. Pascal Pointers - The Rudiments. Pointer Diagramming Notation. Linear Linked Lists. Other Linked Data Structures. 3. Introduction to Recursion. Thinking Recursively. Common Pitfall - Infinite Regresses. Quantitative Aspects of Recursive Algorithms. 4. Modularity and Data Abstraction. The Structure of Pascal Units. Priority Queues - An Abstract Data Type. A Pocket Calculator Interface. How to Hide Data Representations. Modularity and Information Hiding in Program Design. 5. Introduction to Software Engineering Concepts. Top-Down Programming By Stepwise Refinement. Proving Programs Correct. Transforming and Optimizing Programs. Testing Programs. The Philosophy of Measurement and Tuning. Software Reuse and Bottom-up Programming. Program Structuring and Documentation. 6. Introduction to Analysis of Algorithms. What Do We Use for a Yardstick? The Intuition Behind O-Notation. O-Notation - Definition and Manipulation. Analyzing Simple Algorithms. What O-Notation Doesn't Tell You. 7. Linear Data Structures - Stacks and Queues. Some Background on Stacks. ADTs for Stacks and Queues. Using the Stack ADT to Check for Balanced Parentheses. Using the Stack ADT to Evaluate Postfix Expressions. Implementing the Stack ADT. How Pascal Implements Recursive Function Calls Using Stacks. Implementations of the Queue ADT. More Queue Applications. 8. Lists, Strings, and Dynamic Memory Allocation. Lists. Generalized Lists. Applications of Generalized Lists. Strings. Dynamic Memory Allocation. 9. Trees. Basic Concepts and Terminology. Binary Trees. A Sequential Binary Tree Representation. An Application - Heaps and Priority Queues. Traversing Binary Trees. Binary Search Trees. AVL Trees and Their Performance. Two-Three Trees. Tries. An Application - Huffman Codes. 10. Graphs. Basic Concepts and Terminology. Graph Representations. Graph Searching. Topological Ordering. Shortest Paths. Task Networks. Useful Background on Graphs. 11. Hashing and the Table ADT. The Table ADT. Introduction to Hashing by Simple Examples. Collisions, Load Factors, and Clusters. Algorithms for Hashing by Open Addressing. Choosing a Hash Function. Comparison of Searching Methods Using the Table ADT. 12. External Collections of Data. Characteristics of External Storage Devices. Techniques That Don't Work Well. Techniques That Work Well. Information Retrieval and Databases. 13. Sorting. Laying Some Groundwork. Priority Queue Sorting Methods. Divide-and-Conquer Methods. Methods That Insert Keys and Keep Them Sorted. O(n) Methods - Address Calculation Sorting. Other Methods. Comparison and Perspective. 14. Advanced Recursion. Recursion as a Descriptive Method. Using Recursion to Build a Parser. Translating from Infix to Postfix. Recursion and Program Verification. 15. Object-Oriented Programming. Exploring OOP Through Progressive Examples. Building Systems Using Object-Oriented Programming. Advantages and Disadvantages of Object-Oriented Programming. 16. Advanced Software Engineering Concepts. The Software Lifecycle. Software Productivity. Software Process Models. Appendix: Math Reference and Tutorial. Arithmetic Progressions. Geometric Progressions. Floors and Ceilings. Logarithms and Exponentials. Modular Arithmetic. Sums. Recurrence Relations. Manipulating Logical Expressions. Index.


Best Sellers


Product Details
  • ISBN-13: 9780201528800
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Language: English
  • Spine Width: 34 mm
  • Width: 242 mm
  • ISBN-10: 0201528800
  • Publisher Date: 17 Dec 1993
  • Binding: Paperback
  • No of Pages: 748
  • Weight: 1434 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Data Structures, Algorighms, and Software Principles
Pearson Education (US) -
Data Structures, Algorighms, and Software Principles
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Data Structures, Algorighms, and Software Principles

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!