PLEASE NOTE: Due to UPS and FedEx suspending the Service/Money-Back Guarantees, we cannot guarantee the published delivery dates on this site. Please check the UPS site and FedEx site for potential service issues that may delay your order.
List price: $173.50
All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.
This title is currently not available in digital format.
Using C, this book develops the concepts and theory of data structures and algorithm analysis step-by-step. It gradually proceeds 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, representation, and trade-offs, unify the material completely. Important traditional and contemporary software engineering principles are also covered, including modularity, abstract data types and information hiding, as well as new developments, such as risk-based software life cycle models and object-oriented programming.
Standish, Thomas A. : University of California
Thomas A. Standish is the chairman of computer science at the University of California, Irvine. In 1990-91, he became the fourth winner of University of California Irvine's Distinguished Faculty Lectureship for Teaching, the campus' highest distinction for teaching excellence. He has also been a co-winner of his department's best-teacher award, chosen by the popular vote of University of California Irvine undergraduate computer science students.
Preparing for the Journey.
Linked Data Representations.
Introduction to Recursion.
Modularity and Data Abstraction.
Introduction to Software Engineering Concepts.
Introduction to Analysis of Algorithms.
Linear Data Structures-Stacks and Queues.
Lists, Strings, and Dynamic Memory Allocation.
Trees.
Graphs.
Hashing and the Table ADT.
External Collections of Data.
Sorting.
Advanced Recursion.
Object-Oriented Programming.
Advanced Software Engineering Concepts.
Appendix: Math Reference and Tutorial.
Free Month Trial* with Your Purchase of
Data Structures, Algorithms and Software Principles in C
Expertly curated help for
Data Structures, Algorithms and Software Principles in C.
Plus easy-to-understand solutions written by experts for thousands of other textbooks.
*You will get your 1st month of Bartleby for FREE when you bundle with these textbooks where solutions are available
($9.99 if sold separately.) After your trial, your monthly subscription will automatically continue at $9.99 each month. You can cancel at any time.
Using C, this book develops the concepts and theory of data structures and algorithm analysis step-by-step. It gradually proceeds 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, representation, and trade-offs, unify the material completely. Important traditional and contemporary software engineering principles are also covered, including modularity, abstract data types and information hiding, as well as new developments, such as risk-based software life cycle models and object-oriented programming.
Standish, Thomas A. : University of California
Thomas A. Standish is the chairman of computer science at the University of California, Irvine. In 1990-91, he became the fourth winner of University of California Irvine's Distinguished Faculty Lectureship for Teaching, the campus' highest distinction for teaching excellence. He has also been a co-winner of his department's best-teacher award, chosen by the popular vote of University of California Irvine undergraduate computer science students.
Preparing for the Journey.
Linked Data Representations.
Introduction to Recursion.
Modularity and Data Abstraction.
Introduction to Software Engineering Concepts.
Introduction to Analysis of Algorithms.
Linear Data Structures-Stacks and Queues.
Lists, Strings, and Dynamic Memory Allocation.
Trees.
Graphs.
Hashing and the Table ADT.
External Collections of Data.
Sorting.
Advanced Recursion.
Object-Oriented Programming.
Advanced Software Engineering Concepts.
Appendix: Math Reference and Tutorial.
Using C, this book develops the concepts and theory of data structures and algorithm analysis step-by-step. It gradually proceeds 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, representation, and trade-offs, unify the material completely. Important traditional and contemporary software engineering principles are also covered, including modularity, abstract data types and information hiding, as well as new developments, such as risk-based software life cycle models and object-oriented programming.
Standish, Thomas A. : University of California
Thomas A. Standish is the chairman of computer science at the University of California, Irvine. In 1990-91, he became the fourth winner of University of California Irvine's Distinguished Faculty Lectureship for Teaching, the campus' highest distinction for teaching excellence. He has also been a co-winner of his department's best-teacher award, chosen by the popular vote of University of California Irvine undergraduate computer science students.
Preparing for the Journey.
Linked Data Representations.
Introduction to Recursion.
Modularity and Data Abstraction.
Introduction to Software Engineering Concepts.
Introduction to Analysis of Algorithms.
Linear Data Structures-Stacks and Queues.
Lists, Strings, and Dynamic Memory Allocation.
Trees.
Graphs.
Hashing and the Table ADT.
External Collections of Data.
Sorting.
Advanced Recursion.
Object-Oriented Programming.
Advanced Software Engineering Concepts.
Appendix: Math Reference and Tutorial.