Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Algorithms in java, parts 1-4, Robert Sedgewick


Варианты приобретения
Цена: 31800.00T
Кол-во:
Наличие: Невозможна поставка.

в Мои желания

Автор: Robert Sedgewick
Название:  Algorithms in java, parts 1-4
Перевод названия: Алгоритмы на Java. Части 1-4
ISBN: 9780201361209
Издательство: Pearson Education
Классификация:



ISBN-10: 0201361205
Обложка/Формат: Paperback
Страницы: 768
Вес: 1.19 кг.
Дата издания: 05.08.2002
Серия: 1st Edition - Paper
Язык: English
Издание: 3 ed
Иллюстрации: Illustrations
Размер: 234 x 199 x 27
Читательская аудитория: Tertiary education (us: college)
Рейтинг:
Поставляется из: Англии
Описание: Provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. This book includes Java class implementations of more than 100 important practical algorithms. It emphasises on ADTs, modular programming, and object-oriented programming. It also covers arrays, linked lists, trees, and more.

      Новое издание
Algorithms, 4 ed.

Автор: Sedgewick Robert
Название: Algorithms, 4 ed.
ISBN: 032157351X ISBN-13(EAN): 9780321573513
Издательство: Pearson Education
Цена: 101810 T
Описание: This fourth edition of Robert Sedgewick and Kevin Wayne s " Algorithms " is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing--including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu, contains

  • An online synopsis
  • Full Java implementations
  • Test data
  • Exercises and answers
  • Dynamic visualizations
  • Lecture slides
  • Programming assignments with checklists
  • Links to related material
The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience."

Distributed Algorithms,

Автор: Nancy A. Lynch
Название: Distributed Algorithms,
ISBN: 1558603484 ISBN-13(EAN): 9781558603486
Издательство: Elsevier Science
Рейтинг:
Цена: 136990.00 T
Наличие на складе: Поставка под заказ.
Описание: A guide to designing, implementing and analyzing distributed algorithms. It covers problems including resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election and global snapshots.

Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия