Data Structures
Autor Harry F. Jr. Smithen Limba Engleză Hardback – sep 1987
material allowing maximum flexibility in structuring the course. Through the use of data structures, the author has included coverage of the following related topics: recursion, pattern recognition, and dynamic programming. Extensive examples, over 300 exercises, 400 figures and tables, and 80
working algorithms contribute to student learning.
Preț: 1758.63 lei
Preț vechi: 2198.29 lei
-20% Nou
Puncte Express: 2638
Preț estimativ în valută:
311.20€ • 364.91$ • 273.30£
311.20€ • 364.91$ • 273.30£
Carte tipărită la comandă
Livrare economică 11-25 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780155168206
ISBN-10: 0155168207
Pagini: 808
Ilustrații: illustrations
Dimensiuni: 183 x 260 x 47 mm
Greutate: 1.69 kg
Editura: Oxford University Press
Locul publicării:New York, United States
ISBN-10: 0155168207
Pagini: 808
Ilustrații: illustrations
Dimensiuni: 183 x 260 x 47 mm
Greutate: 1.69 kg
Editura: Oxford University Press
Locul publicării:New York, United States
V-ar putea interesa
-
Weapons of Math DestructionCathy O'Neil-21%Preț: 59.56 lei75.15 lei -
An Introduction to Quantum ComputingPhillip Kaye-23%Preț: 418.16 lei540.83 lei -
-27%Preț: 341.90 lei468.05 lei -
Algorithmic PuzzlesAnany Levitin-32%Preț: 221.35 lei325.00 lei -
Algorithms UnlockedThomas H. Cormen-27%Preț: 180.49 lei248.74 lei -
Concentration of Measure for the Analysis of Randomized AlgorithmsDevdatt P. Dubhashi-20%Preț: 306.07 lei382.59 lei -
-9%Preț: 843.32 lei926.73 lei -
-20%Preț: 412.32 lei515.40 lei -
-20%Preț: 318.48 lei398.10 lei -
Digital Logic for ComputingJohn Seiffertt-20%Preț: 491.72 lei614.65 lei -
-20%Preț: 315.00 lei393.74 lei -
-20%Preț: 329.74 lei412.17 lei -
Algorithmics of Matching Under PreferencesDavid Manlove-20%Preț: 1068.15 lei1335.19 lei
Descriere
This text is intended for the one-term course in data structures with the following prerequisites: mastery of a high-level programming language, preferably Pascal, and finite or discrete mathematics. Each basic concept is introduced first through numerous examples and followed by advanced material allowing maximum flexibility in structuring the course. Through the use of data structures, the author has included coverage of the following related topics: recursion,pattern recognition, and dynamic programming. Extensive examples, over 300 exercises, 400 figures and tables, and 80 working algorithms contribute to student learning.