{"id":7950,"date":"2026-08-10T09:50:08","date_gmt":"2026-08-10T09:50:08","guid":{"rendered":"https:\/\/nokobox.com\/index.php\/item\/coursera-i-o-efficient-algorithms-2025-1\/"},"modified":"2026-08-10T09:50:08","modified_gmt":"2026-08-10T09:50:08","slug":"coursera-i-o-efficient-algorithms-2025-1","status":"publish","type":"digital_item","link":"https:\/\/nokobox.com\/index.php\/item\/coursera-i-o-efficient-algorithms-2025-1\/","title":{"rendered":"Coursera \u2013 I\/O-efficient algorithms 2025-1"},"content":{"rendered":"
\n

Descriptions<\/h2>\n

I\/O-efficient algorithms, I\/O-efficient algorithms, also known as external memory algorithms or cache-oblivious algorithms, are a class of algorithms designed to efficiently process data that is too large to fit entirely in the main memory (RAM) of a computer. These algorithms are particularly useful when dealing with massive datasets, such as those found in large-scale data processing, database management, and file systems. Operations on data become more expensive when the data item is located higher in the memory hierarchy.<\/p>\n

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. 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.<\/p>\n

What you\u2019ll learn<\/h3>\n