國立虎尾科技大學 |

Algorithms and Data Structures = Foundations and Probabilistic Methods for Design and Analysis /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms and Data Structures/ by Helmut Knebl.
其他題名:	Foundations and Probabilistic Methods for Design and Analysis /
作者:	Knebl, Helmut.
面頁冊數:	XI, 349 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithm Analysis and Problem Complexity. -
電子資源:	https://doi.org/10.1007/978-3-030-59758-0
ISBN:	9783030597580

Algorithms and Data Structures = Foundations and Probabilistic Methods for Design and Analysis /
Knebl, Helmut.

Algorithms and Data StructuresFoundations and Probabilistic Methods for Design and Analysis /[electronic resource] :by Helmut Knebl. - 1st ed. 2020. - XI, 349 p.online resource.

Introduction -- Sorting and Searching -- Hashing -- Trees -- Graphs -- Weighted Graphs -- App. A, Probabilities -- App. B, Mathematical Terminology and Useful Formulas -- References -- Symbols -- Index.

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.

ISBN: 9783030597580

Standard No.: 10.1007/978-3-030-59758-0doiSubjects--Topical Terms:

593923
Algorithm Analysis and Problem Complexity.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and Data Structures = Foundations and Probabilistic Methods for Design and Analysis /
LDR:02585nam a22003975i 4500 001 1020771
003 DE-He213
005 20201031184338.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030597580 $9 978-3-030-59758-0
024 7 $a 10.1007/978-3-030-59758-0 $2 doi
035 $a 978-3-030-59758-0
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Knebl, Helmut. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069280
245 1 0 $a Algorithms and Data Structures $h [electronic resource] : $b Foundations and Probabilistic Methods for Design and Analysis / $c by Helmut Knebl.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XI, 349 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Introduction -- Sorting and Searching -- Hashing -- Trees -- Graphs -- Weighted Graphs -- App. A, Probabilities -- App. B, Mathematical Terminology and Useful Formulas -- References -- Symbols -- Index.
520 $a 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.
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Algorithms. $3 527865
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030597573
776 0 8 $i Printed edition: $z 9783030597597
776 0 8 $i Printed edition: $z 9783030597603
856 4 0 $u https://doi.org/10.1007/978-3-030-59758-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)