An Introduction to Data Structures and Algorithms / Najlacnejšie knihy
An Introduction to Data Structures and Algorithms

Kód: 01399325

An Introduction to Data Structures and Algorithms

Autor James A. Storer, John C. Cherniavsky

Data structures and algorithms are presented at the college level §in a highly accessible format that presents material with one-page §displays in a way that will appeal to both teachers and students. The §thirteen chapters cover: ... celý popis

55.77


Skladom u dodávateľa v malom množstve
Odosielame za 13 - 18 dní

Potrebujete viac kusov?Ak máte záujem o viac kusov, preverte, prosím, najprv dostupnosť titulu na našej zákazníckej podpore.


Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darčekový poukaz: Radosť zaručená
  1. Darujte poukaz v ľubovoľnej hodnote, a my sa postaráme o zvyšok.
  2. Poukaz sa vzťahuje na všetky produkty v našej ponuke.
  3. Elektronický poukaz si vytlačíte z e-mailu a môžete ho ihneď darovať.
  4. Platnosť poukazu je 12 mesiacov od dátumu vystavenia.

Objednať darčekový poukazViac informácií

Viac informácií o knihe An Introduction to Data Structures and Algorithms

Nákupom získate 135 bodov

Anotácia knihy

Data structures and algorithms are presented at the college level §in a highly accessible format that presents material with one-page §displays in a way that will appeal to both teachers and students. The §thirteen chapters cover: Models of Computation, Lists, Induction and §Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, §Sets Over a Small Universe, Graphs, Strings, Discrete Fourier §Transform, Parallel Computation. § Key features: Complicated concepts are expressed clearly in a §single page with minimal notation and without the "clutter" of the §syntax of a particular programming language; algorithms are presented §with self-explanatory "pseudo-code." Chapters 1-4 focus on §elementary concepts, the exposition unfolding at a slower pace. Sample §exercises with solutions are provided. Sections that may be skipped §for an introductory course are starred. Requires only some basic §mathematics background and some computer programming experience. §Chapters 5-13 progress at a faster pace. The material is suitable for §undergraduates or first-year graduates who need only review Chapters 1 §-4. This book may be used for a one-semester introductory course §(based on Chapters 1-4 and portions of the chapters on algorithm §design, hashing, and graph algorithms) and for a one-semester advanced§course that starts at Chapter 5. A year-long course may be based on §the entire book. Sorting, often perceived as rather technical, is §not treated as a separate chapter, but is used in many examples §(including bubble sort, merge sort, tree sort, heap sort, quick sort, §and several parallel algorithms). Also, lower bounds on sorting by §comparisons are included with the presentation of heaps in the context §of lower bounds for comparison-based structures. Chapter 13 on §parallel models of computation is something of a mini-book itself, and §a good way to end a course. Although it is not clear what parallel

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Databases

55.77

Obľúbené z iného súdka



Osobný odber Bratislava a 12820 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: