I/O-efficient algorithms(으)로 돌아가기

4.6
별점
53개의 평가
12개의 리뷰

## 강좌 소개

Operations on data become more expensive when the data item is located higher in the memory hierarchy. An operation on data in CPU registers is roughly a million times faster than an operation on a data item that is located in external memory that needs to be fetched first. These data fetches are also called I/O operations and need to be taken into account during the design of an algorithm. The goal of this course is to become familiar with important algorithmic concepts and techniques needed to effectively deal with such problems. We will work with a simplified memory hierarchy, but the notions extend naturally to more realistic models. Prerequisites: In order to successfully take this course, you should already have a basic knowledge of algorithms and mathematics. Here's a short list of what you are supposed to know: - O-notation, Ω-notation, Θ-notation; how to analyze algorithms - Basic calculus: manipulating summations, solving recurrences, working with logarithms, etc. - Basic probability theory: events, probability distributions, random variables, expected values etc. - Basic data structures: linked lists, stacks, queues, heaps - (Balanced) binary search trees - Basic sorting algorithms, for example MergeSort, InsertionSort, QuickSort - Graph terminology, representations of graphs (adjacency lists and adjacency matrix), basic graph algorithms (BFS, DFS, topological sort, shortest paths) The material for this course is based on the course notes that can be found under the resources tab. We will not cover everything from the course notes. The course notes are there both for students who did not fully understand the lectures as well as for students who would like to dive deeper into the topics. The video lectures contain a few very minor mistakes. A list of these mistakes can be found under resources. If you think you found an error, report a problem by clicking the square flag at the bottom of the lecture or quiz where you found the error....

## 최상위 리뷰

NC

2019년 11월 5일

Everything was clearly explained and the questions were quite intuitive and checking my knowledge. More examples for different scenarios too would help us a lot to learn more.

TL

2022년 2월 28일

The excercises and assignments helped in undertanding the concepts much better. Also as this course content can't be found easily at one place this really helped. Thank you

필터링 기준:

## I/O-efficient algorithms의 11개 리뷰 중 1~11

교육 기관: Nicholas P

2020년 6월 25일

Great introduction the I/O-centric model of computation. The course was fairly easy to follow but the quizzes were a bit confusing at times. There's also not much support going around in the discussion boards. Nevertheless, the material is easily self-teachable and you'll come out of the course knowing a couple more tools and tricks than you started with.

교육 기관: Natarajan C

2019년 11월 6일

Everything was clearly explained and the questions were quite intuitive and checking my knowledge. More examples for different scenarios too would help us a lot to learn more.

교육 기관: CHARISIOS V

2022년 5월 9일

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

교육 기관: Yucheng Z

2020년 9월 29일

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

교육 기관: 周柏宇

2020년 1월 31일

An introduction to the I\O-efficient algorithms. Short and sweet!

교육 기관: vignesh p

2020년 7월 3일

Very precise and efficient course.

교육 기관: Sergio G

2020년 4월 27일

Excellent

Thanks for the tuition

교육 기관: Kota V K 1

2021년 5월 27일

good

교육 기관: Никулин О А

2020년 8월 30일

Great course, but interface is quit lacking, because course notes are under different section

교육 기관: Sinha A

2020년 8월 25일

The evaluations should have been more in number.

교육 기관: Raghu V

2021년 12월 1일

T​he course touched on critical theoretical concepts around I/O efficiency while designing algorithms but I felt the resource notes lacked depth and clarity (they had overlap with the video lessons). Would have been good to get insight into solutions for exercises (at least on the course notes)