Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Algorithms and Data Structures

Name: Algorithms and Data Structures
Brand: Springer Nature Switzerland AG
SKU: 33361847
Price: 29715 HUF
Availability: InStock
Author: Helmut Knebl
ISBN: 9783030597573

Helmut Knebl

Language

English

Book Hardback

Libristo code: 33361847

Publishers Springer Nature Switzerland AG, November 2020

This is a central topic in any computer science curriculum. To distinguish this textbook from others... Full description

Libristo code: 33361847

199 b

29 715 Ft

In stock at our supplier Shipping in 10-13 days

Up to 30 days for returns

Customers also purchased

Duch domu Ashburnů - limitovaná edice Darcy Coates

Hardback

6 441 Ft

Duch domu Ashburnů Darcy Coates

Hardback

4 504 Ft

Německé menšiny v právních normách 1938-1948. collegium

Sheet

9 079 Ft

Czerwony Blazen Aleksander Blazejowski

Paperback

2 294 Ft

This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.