<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Operating-Systems on Adam Hacks</title><link>https://hackeradam.com/blog/operating-systems/</link><description>Recent content in Operating-Systems on Adam Hacks</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Fri, 21 Aug 2020 00:00:00 +0000</lastBuildDate><atom:link href="https://hackeradam.com/blog/operating-systems/index.xml" rel="self" type="application/rss+xml"/><item><title>The Dining Philosophers Problem</title><link>https://hackeradam.com/blog/the-dining-philosophers-problem/</link><pubDate>Fri, 21 Aug 2020 00:00:00 +0000</pubDate><guid>https://hackeradam.com/blog/the-dining-philosophers-problem/</guid><description>&lt;p&gt;The dining philosophers problem is a classic problem in the realm of computer science. If you’ve had any formal CS education you’ve more than likely seen the problem when learning about concurrent programming.&lt;/p&gt;
&lt;p&gt;Today we will take a look at the problem and look at an example of how we can solve it.&lt;/p&gt;</description></item></channel></rss>