Normal view MARC view ISBD view

The bible of algorithms and data structures : a comples subject simply explained / Florian Dedov

By:

Dedov, Florian

Material type: Text

TextPublication details: USA : [publisher is not identified], c2020Description: 136 pages : 21cmISBN:

978-8678017-91-2

Subject(s):

ALGORITHMS

LOC classification:

GC QA 76.9 .A43 .D43 2020 c.1

Contents:

1. What Are Algorithms? -- 2. What Are Algorithms -- 3. Runtime Complexity -- 4. Sorting Algorithms -- 5. Graph Theory and Algorithms -- 6. Data Structures -- 7. Self-Balancing Trees -- 8. Hashing.

Summary: The field of algorithms and data structures is one of the most important in computer science. It doesn't matter if you are into macchine learning, ethical hacking, cyber security or enterpise software engineering. You will always need to be able to work with algorithms and data structures.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Shelving location	Call number	Status	Date due	Barcode
Books	NU BALIWAG	NU BALIWAG	Computer Engineering	General Circulation	GC QA 76.9 .A43 .D43 2020 c.1 (Browse shelf(Opens below))	Available		NUBUL000005074

1. What Are Algorithms? -- 2. What Are Algorithms -- 3. Runtime Complexity -- 4. Sorting Algorithms -- 5. Graph Theory and Algorithms -- 6. Data Structures -- 7. Self-Balancing Trees -- 8. Hashing.

The field of algorithms and data structures is one of the most important in computer science. It doesn't matter if you are into macchine learning, ethical hacking, cyber security or enterpise software engineering. You will always need to be able to work with algorithms and data structures.

There are no comments on this title.

to post a comment.