OS Final Day 2

If you required high response times such as when playing a video game, which of the following process types would be the best

Which of the following scheduling algorithms could be subject to starvation

Name 2 difference between a semaphore and a monitor

Which one of the following buffer types could be asynchronous

When tracking free blocks, which strategy would be more memory efficient if you're memory is almost empty

With virtual memory paging, which of the following is true

Can you hard link to a directory

Can you soft link across file systems

Which of the following are NOT practical to use for preventing deadlocks

The Dining Philosophers Problem is a classic computer science synchronization problem that illustrates the challenges of avoiding deadlock and starvation in a concurrent system. The problem involves a group of philosophers sitting at a circular table, with a fork placed between each pair of adjacent philosophers. The philosophers spend their time either thinking or eating spaghetti, and in order to eat, they need to pick up the two forks adjacent to them. What problem could possibly happen here and how might you go about solving it

Which of the following IO paradigms does the CPU NOT interact directly with the device or device controller?

An i-node file system supports 10 direct blocks, 2 single indirect blocks, and 4 double indirect blocks. Assuming 1KB data block size, each i-node pointer entry uses 2 bytes, and each i-node must fit into one data block. What is the biggest file size support by this system?

An i-node file system supports 10 direct blocks, 2 single indirect blocks, and 4 double indirect blocks. Assuming 1KB data block size, each i-node pointer entry uses 2 bytes, and each i-node must fit into one data block. Determine which i-node blocks (staring from the root inode) need to be accessed if we wanted to start reading at 269,495,596 bytes into the file (a direct access into a spot in a file).

Multi level page tables are more memory efficient

Inverted page tables contain 1 entry per frame

Write some simple psuedocode or important points about removing and adding a hardlink

For every virtual address you need to do a translation