Data Structures Fundamentals

Type product
Logo van edX

Tip: meer info over het programma, prijs, en inschrijven? Download de brochure!

Beschrijving

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures. A few examples of questions …

Lees de volledige beschrijving

Veelgestelde vragen

Heb je een vraag? Onze adviseurs helpen je graag. Bel ons op 085 7440830 of e-mail naar info@springest.nl.

Nog niet gevonden wat je zocht? Bekijk deze onderwerpen: Adviserend verkopen, Telemarketing & telesales, Relatiemanagement, Commercieel medewerker en Klantgerichte Sales.

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures. A few examples of questions that we are going to cover in this course are: What is a good strategy of resizing a dynamic array? How priority queues are implemented in C++, Java, and Python? How to implement a hash table so that the amortized running time of all operations is O(1) on average? What are good strategies to keep a binary tree balanced? We look forward to seeing you in this course! We know it will make you a better programmer.

Blijf op de hoogte van nieuwe ervaringen

Er zijn nog geen ervaringen.

Deel je ervaring

Heb je ervaring met deze cursus? Deel je ervaring en help anderen kiezen. Als dank voor de moeite doneert Springest € 1,- aan Stichting Edukans.

Heb je een vraag? Onze adviseurs helpen je graag. Bel ons op 085 7440830 of e-mail naar info@springest.nl.

Download gratis en vrijblijvend de informatiebrochure

Aanhef
(optioneel)
(optioneel)
(optioneel)
(optioneel)
(optioneel)

Heb je nog vragen?

(optioneel)
We slaan je gegevens op om je via e-mail en evt. telefoon verder te helpen.
Meer info vind je in ons privacybeleid.