Operating Systems (saylor.org)

Offered by Saylor.org,
Operating Systems  (saylor.org)

This course will introduce you to modern operating systems. We will focus on UNIX-based operating systems, though we will also learn about alternative operating systems, including Windows.

This course will introduce you to modern operating systems. We will focus on UNIX-based operating systems, though we will also learn about alternative operating systems, including Windows. The course will begin with an overview of the structure of modern operating systems. Over the course of the subsequent units, we will discuss the history of modern computers, analyze in detail each of the major components of an operating system (from processes to threads), and explore more advanced topics in the field, including memory management and file input/output. The class will conclude with a discussion of various system-related security issues.

Upon successful completion of this course, the student will be able to:

  • Explain what an operating system does and how it is used.
  • Identify the various components of a computer system and how they interact with an operating system.
  • Describe the differences between a 32-bit and 64-bit operating system.
  • Explain the different types of operating systems and the major ones in use today.
  • Discuss the importance and use of threads and processes in an operating system.
  • Describe concurrency.
  • Explain the difference between a thread and a process.
  • Discuss context switching and how it is used in an operating system.
  • Describe synchronization.
  • Explain a race condition.
  • Discuss interprocess communication.
  • Describe how semaphores can be used in an operating system.
  • Discuss three of the classic synchronization problems
  • Explain the alternatives to semaphores.
  • Discuss CPU scheduling and its relevance to operating systems.
  • Explain the general goals of CPU scheduling.
  • Describe the differences between pre-emptive and non-preemptive scheduling.
  • Discuss four CPU scheduling algorithms.
  • Explain what deadlock is in relation to operating systems.
  • Discuss deadlock prevention, avoidance, and their differences.
  • Describe deadlock detection and recovery.
  • Explain the memory hierarchy.
  • Discuss how the operating system interacts with memory.
  • Describe how virtual memory works.
  • Discuss three algorithms for dynamic memory allocation.
  • Explain methods of memory access.
  • Describe paging and page replacement algorithms.
  • Describe a file system and its purpose.
  • Discuss various file allocation methods.
  • Explain disk allocation and associated algorithms.
  • Discuss types of security threats.
  • Describe the various types of malware.
  • Explain basic security techniques.
  • Explain basic networking principles.
  • Discuss protocols and how they are used.
  • Explain reference models, particularly TCP/IP and OSI.
Go to Class
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Related Courses

Cryptography I (Coursera) Coursera
Stanford University

Cryptography I (Coursera)

Cryptography is an indispensable tool for protecting information in computer systems. In this course you will learn the inner workings of cryptographic systems and how to correctly use them in real-world applications. The course begins with a detailed discussion of how two parties who have a shared secret key can communicate securely when a powerful adversary eavesdrops and tampers with traffic.

Sep 21st 2026
5-12 Weeks
Approximation Algorithms Part I (Coursera) Coursera
École normale supérieure

Approximation Algorithms Part I (Coursera)

How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum.

Sep 28th 2026
5-12 Weeks
Bitcoin and Cryptocurrency Technologies (Coursera) Coursera
Princeton University

Bitcoin and Cryptocurrency Technologies (Coursera)

To really understand what is special about Bitcoin, we need to understand how it works at a technical level. We’ll address the important questions about Bitcoin, such as: How does Bitcoin work? What makes Bitcoin different? How secure are your Bitcoins? How anonymous are Bitcoin users? What determines the price of Bitcoins? Can cryptocurrencies be regulated? What might the future hold?

Sep 21st 2026
5-12 Weeks
An Introduction to Logic for Computer Science (Coursera) Coursera
University of Leeds

An Introduction to Logic for Computer Science (Coursera)

Logic plays a fundamental role in computer science. This course is designed to equip you with a solid understanding of the fundamental principles of logic and their relevance in the field of computer science. In this course, you'll explore proposition logic and discover its practical applications in problem-solving, algorithm design, and the development of intelligent systems. By engaging in hands-on exercises, exploring real-world examples, and participating in discussions, you'll develop strong logical reasoning and critical thinking skills.

Sep 21st 2026
2 Weeks
Algorithms, Part II (Coursera) Coursera
Princeton University

Algorithms, Part II (Coursera)

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.

Sep 14th 2026
5-12 Weeks
Securing Digital Democracy (Coursera) Coursera
University of Michigan

Securing Digital Democracy (Coursera)

In this course, you'll learn what every citizen should know about the security risks--and future potential — of electronic voting and Internet voting. We'll take a look at the past, present, and future of election technologies and explore the various spaces intersected by voting, including computer security, human factors, public policy, and more.

Sep 21st 2026
5-12 Weeks
The Unix Workbench (Coursera) Coursera
Johns Hopkins University

The Unix Workbench (Coursera)

Unix forms a foundation that is often very helpful for accomplishing other goals you might have for you and your computer, whether that goal is running a business, writing a book, curing disease, or creating the next great app. The means to these goals are sometimes carried out by writing software. Software can’t be mined out of the ground, nor can software seeds be planted in spring to harvest by autumn. Software isn’t produced in factories on an assembly line. Software is a hand-made, often bespoke good. If a software developer is an artisan, then Unix is their workbench.

Sep 28th 2026
4 Weeks