Using 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.
%0 Book
%1 standish1995structures
%A Standish, Thomas A.
%D 1995
%I Addison-Wesley
%K algorithm c computer-science data-structure mathematics pi3-prog-report programming
%T Data Structures, Algorithms, and Software Principles in C
%U https://www.pearson.com/us/higher-education/program/PGM289630.html
%X Using 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.
%@ 0-201-59118-9
@book{standish1995structures,
abstract = {Using 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.},
added-at = {2020-06-14T21:04:06.000+0200},
author = {Standish, Thomas A.},
biburl = {https://www.bibsonomy.org/bibtex/2d12b6173dd2853a40029a893bf85eaa1/jpmor},
interhash = {44437ab99f39268a96402d29eceb96f2},
intrahash = {d12b6173dd2853a40029a893bf85eaa1},
isbn = {0-201-59118-9},
keywords = {algorithm c computer-science data-structure mathematics pi3-prog-report programming},
language = {en},
publisher = {Addison-Wesley},
timestamp = {2020-10-07T13:36:50.000+0200},
title = {Data Structures, Algorithms, and Software Principles in C},
type = {Publication},
url = {https://www.pearson.com/us/higher-education/program/PGM289630.html},
year = 1995
}