OS Final Day 2
Operating Systems Final Quiz Day 2
Test your knowledge on Operating Systems concepts with our comprehensive quiz designed for students and professionals alike. Covering key topics such as scheduling algorithms, memory management, deadlocks, and file systems, this quiz challenges your understanding of operating systems.
- 22 Engaging Questions
- Multiple Choice, Text, and Checkbox Formats
- Instant Feedback on Answers
If you required high response times such as when playing a video game, which of the following process types would be the best
Batch
Interactive
Real-Time
Which of the following scheduling algorithms could be subject to starvation
FCFS
Round Robin
Priority Scheduling
Shortest Job
Which one of the following buffer types could be asynchronous
Zero Buffer
Bounded Buffer
Unbounded Buffer
When tracking free blocks, which strategy would be more memory efficient if you're memory is almost empty
Free List
Bit map
With virtual memory paging, which of the following is true
Internal Fragmentation is eliminated
External Fragmentation is eliminated
Both Internal and External are eliminated
Can you hard link to a directory
True
False
Can you soft link across file systems
True
False
Which of the following are NOT practical to use for preventing deadlocks
Removing Mutual Exclusion
Removing Preemption
Hold & Wait
Removing Circular Wait
Examining the following graph, is there a deadlock situation?
True
False
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?
Programmed
Interrupt Driven
DMA
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?
~1GB
~256MB
~1.5GB
~512MB
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
True
False
Inverted page tables contain 1 entry per frame
True
False
For every virtual address you need to do a translation
True
False
{"name":"OS Final Day 2", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge on Operating Systems concepts with our comprehensive quiz designed for students and professionals alike. Covering key topics such as scheduling algorithms, memory management, deadlocks, and file systems, this quiz challenges your understanding of operating systems.22 Engaging QuestionsMultiple Choice, Text, and Checkbox FormatsInstant Feedback on Answers","img":"https:/images/course8.png"}