Description: About this productProduct InformationUsing C, this book develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from concrete examples to abstract principles. Standish covers a wide range of both traditional and contemporary software engineering topics. The text also includes an introduction to object-oriented programming using C++. By introducing recurring themes such as levels of abstraction, recursion, efficiency, representation and trade-offs, the author unifies the material throughout. Mathematical foundations can be incorporated at a variety of depths, allowing the appropriate amount of math for each user.Product IdentifiersPublisherPearson EducationISBN-100201591189ISBN-139780201591187eBay Product ID (ePID)85829Product Key FeaturesAuthorThomas StandishPublication NameData Structures, Algorithms, and Software Principles in CFormatTrade PaperbackLanguageEnglishPublication Year1994TypeTextbookNumber of Pages768 PagesDimensionsItem Length9.2inItem Height1.6inItem Width7.9inItem Weight49.6 OzAdditional Product FeaturesLc Classification NumberQa76.73.C15s69 1995Table of Content( All chapters, except Chapter 1, begin with an Introduction and Motivation. ) 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. 2. Linked Data Representations. What are Pointers? The Basic Intuition. Pointers in C--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 C Modules. 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 C 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. 0201591189T04062001Copyright Date1995Target AudienceCollege AudienceTopicSoftware Development & Engineering / General, Programming / Algorithms, Programming Languages / C, Software Development & Engineering / Systems Analysis & DesignLccn94-011428Dewey Decimal005.13/3Dewey Edition20IllustratedYesGenreComputers
Price: 10.9 USD
Location: Multiple Locations
End Time: 2024-11-20T03:05:32.000Z
Shipping Cost: 3.97 USD
Product Images
Item Specifics
Return shipping will be paid by: Seller
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Data Structures, Algorithms, and Software Principles in C
Narrative Type: Systems Analysis & Design
Genre: N/A
Intended Audience: N/A
Number of Pages: 768 Pages
Publication Name: Data Structures, Algorithms, and Software Principles in C
Language: English
Publisher: Pearson Education
Item Height: 1.7 in
Publication Year: 1994
Subject: Programming / Algorithms, Software Development & Engineering / General, Programming Languages / C, Software Development & Engineering / Systems Analysis & Design
Item Weight: 49.4 Oz
Type: Textbook
Item Length: 9.1 in
Subject Area: Computers
Author: Thomas Standish
Item Width: 7.9 in
Format: Trade Paperback
