Datenstrukturen und Algorithmenanalyse in Java
US $11,74US $11,74
Sa, 19. Jul, 03:12Sa, 19. Jul, 03:12
Bild 1 von 1
Galerie
Bild 1 von 1
Ähnlichen Artikel verkaufen?
Datenstrukture
US $11,74
Ca.CHF 9,34
Artikelzustand:
Gut
Buch, das gelesen wurde, sich aber in einem guten Zustand befindet. Der Einband weist nur sehr geringfügige Beschädigungen auf, wie z.B. kleinere Schrammen, er hat aber weder Löcher, noch ist er eingerissen. Bei gebundenen Büchern ist der Schutzumschlag möglicherweise nicht mehr vorhanden. Die Bindung weist geringfügige Gebrauchsspuren auf. Die Mehrzahl der Seiten ist unbeschädigt, das heißt, es gibt kaum Knitter oder Einrisse, es wurden nur in geringem Maße Bleistiftunterstreichungen im Text vorgenommen, es gibt keine Textmarkierungen und die Randbereiche sind nicht beschrieben. Alle Seiten sind vollständig vorhanden. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
Kostenlos USPS Media MailTM.
Standort: Feasterville Trevose, Pennsylvania, USA
Lieferung:
Lieferung zwischen Do, 31. Jul und Do, 7. Aug nach 94104 bei heutigem Zahlungseingang
Rücknahme:
Keine Rücknahme.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:177236205530
Artikelmerkmale
- Artikelzustand
- Release Year
- 2011
- Book Title
- Data Structures and Algorithm Analysis in Java
- ISBN
- 9780132576277
Über dieses Produkt
Product Identifiers
Publisher
Pearson Education
ISBN-10
0132576279
ISBN-13
9780132576277
eBay Product ID (ePID)
109275384
Product Key Features
Number of Pages
648 Pages
Language
English
Publication Name
Data Structures and Algorithm Analysis in Java
Subject
Programming / General, Programming / Algorithms, Programming Languages / Java, Algebra / General, Software Development & Engineering / Systems Analysis & Design
Publication Year
2011
Features
Revised
Type
Textbook
Subject Area
Mathematics, Computers
Format
Hardcover
Dimensions
Item Height
1.6 in
Item Weight
43.4 Oz
Item Length
9.4 in
Item Width
7.7 in
Additional Product Features
Edition Number
3
Intended Audience
College Audience
LCCN
2011-035536
Dewey Edition
23
Dewey Decimal
005.1
Edition Description
Revised edition
Synopsis
Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text s coverage. ", Data Structures and Algorithm Analysis in Java is an "advanced algorithms" book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage., Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year graduate course in algorithm analysis As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage., In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. KEY TOPICS: This new edition contains all the enhancements of the new Java 7 code including diamonds. This book explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. MARKET: This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.
LC Classification Number
QA76.73.J38
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
OnTimeBooks
98,1% positive Bewertungen•210 Tsd. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (51'524)
Dieser Artikel (1)
Alle Artikel (51'524)
- o***a (104)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThe appearance, condition, and quality of this book was good and for the price it was hard to pass up on. Thank you.
- t***i (114)- Bewertung vom Käufer.Letzter MonatBestätigter KaufExcellent
- 1***m (920)- Bewertung vom Käufer.Letzter MonatBestätigter KaufMix-up in item description but Ontime Books refunded purchase and provided buyer with alternate choice at no cost. Very professional seller and would do business with them again.
OnTimeBooks
98,1% positive Bewertungen•210 Tsd. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (51'524)
Dieser Artikel (1)
Alle Artikel (51'524)
- o***a (104)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThe appearance, condition, and quality of this book was good and for the price it was hard to pass up on. Thank you.
- t***i (114)- Bewertung vom Käufer.Letzter MonatBestätigter KaufExcellent
- 1***m (920)- Bewertung vom Käufer.Letzter MonatBestätigter KaufMix-up in item description but Ontime Books refunded purchase and provided buyer with alternate choice at no cost. Very professional seller and would do business with them again.