Efficient searching I: B-Trees

video-placeholder
Loading...
강의 계획표 보기

검토

4.6개(54개 평가)

  • 5 stars
    66.66%
  • 4 stars
    25.92%
  • 3 stars
    5.55%
  • 2 stars
    1.85%

CV

2022년 5월 8일

The course is really good and the course material is also amazing. I highly reccomend it provided you have an interest in this specialization.

YZ

2020년 9월 28일

Really like the course. Though it's difficult and challenging, I managed to understand the concept. I will keep practicing.

수업에서

I/O-efficient data structures

In this module we introduce some I/O-efficient data structures: B-trees and buffer trees, and an I/O-efficient priority queue based on buffer trees.

강사:

  • Placeholder

    Mark de Berg

    Prof.dr.

Coursera 카탈로그 살펴보기

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