Naive Implementations of Priority Queues

Loading...
강의 계획서 보기

배우게 될 기술

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

검토

4.6(3,483개의 평가)
  • 5 stars
    72.20%
  • 4 stars
    21.90%
  • 3 stars
    3.96%
  • 2 stars
    0.68%
  • 1 star
    1.23%
TT

Apr 06, 2018

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

KL

Sep 05, 2020

one of the best course i have ever taken on any platform.\n\ni love to learn on coursera platform.\n\ncoursera makes one to think fro solution.\n\nafter completion of course one feel satisfied.

수업에서
Priority Queues and Disjoint Sets

강사:

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.