This document describes an assignment to simulate a roller coaster ride using multiple Linux processes. The processes include Tourist processes that board and ride the roller coaster, and processes that control the loading and unloading of tourists. Shared memory and semaphores must be used to coordinate access to data structures like queues and tables among the processes. The simulation tracks tourist wait times and emotions before and after riding.