課程概述
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
篩選依據：
1 - I/O-efficient algorithms 的 13 個評論（共 13 個）
創建者 Nicholas P
•2020年6月25日
創建者 Natarajan C
•2019年11月6日
創建者 CHARISIOS V
•2022年5月9日
創建者 Yucheng Z
•2020年9月29日
創建者 Jörg S
•2022年8月22日
創建者 周柏宇
•2020年1月31日
創建者 vignesh p
•2020年7月3日
創建者 Sergio G
•2020年4月27日
創建者 FREDERICKV P A E
•2022年7月6日
創建者 Kota V K 1
•2021年5月27日
創建者 Никулин О А
•2020年8月30日
創建者 Sinha A
•2020年8月25日
創建者 Raghu V
•2021年12月1日
Coursera Footer
© 2022 Coursera Inc.保留所有權利。
