Analysis (Optional)

Loading...
Lehrplan anzeigen

Kompetenzen, die Sie erwerben

Binary Search Tree, Priority Queue, Hash Table, Stack (Abstract Data Type), List

Bewertungen

4.7 (2,553 Bewertungen)
  • 5 stars
    73%
  • 4 stars
    21%
  • 3 stars
    4%
  • 2 stars
    1%
  • 1 star
    1%
SG

Oct 28, 2019

I found the course a little tough, but it's worth the effort. It takes more time than mentioned. Apart from that, it is actually good and covers most of the topics required for interviews.

AS

Sep 19, 2019

The best data structures course that I have taken!\n\nThe complex topics are made simpler at the expense of teaching style that allowed me to make it applicable in a real world situations.

Aus der Unterrichtseinheit
Priority Queues and Disjoint Sets

Unterrichtet von

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Daniel M Kane

    Daniel M Kane

    Assistant Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

Durchsuchen Sie unseren Katalog

Melden Sie sich kostenlos an und erhalten Sie individuelle Empfehlungen, Aktualisierungen und Angebote.