Proof: Universal Family for Integers (Optional)

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.6(3,802 個評分)
  • 5 stars
    72.17%
  • 4 stars
    21.90%
  • 3 stars
    3.99%
  • 2 stars
    0.71%
  • 1 star
    1.20%
KL
2020年9月4日

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.

SG
2019年10月27日

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.

從本節課中
Hash Tables

教學方

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。