Operating Systems Concepts Quiz

False (B)

Loads the operating system kernel

<p>Higher speed than hard disks</p> Signup and view all the answers

<p>Temporary, faster access to frequently used data (B)</p> Signup and view all the answers

<p>Multiprogramming = Organizing jobs in a way that maximizes CPU utilization Multitasking = Running multiple tasks concurrently with user interactivity Mainframe = A powerful computer system that supports multiple users Cache = A temporary storage area for faster data access</p> Signup and view all the answers

<p>Mainframe (C)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>Reduce CPU load during data transfer (A)</p> Signup and view all the answers

<p>True (A)</p> Signup and view all the answers

<p>Vectored interrupt system</p> Signup and view all the answers

<p>Registers</p> Signup and view all the answers

<p>Software as a Service (SaaS) (B)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>DMA = Reduces CPU load during data transfer TCP/IP = Protocols for internet communication VMM = Provides virtualization services Bitmap = Uses a string of binary digits</p> Signup and view all the answers

<p>Increased reliability and throughput</p> Signup and view all the answers

<p>Access to the shared memory (C)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>zombie process</p> Signup and view all the answers

<p>ready</p> Signup and view all the answers

<p>Browser sandboxing for rendering processes (D)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>communication links</p> Signup and view all the answers

<p>A fundamental unit of CPU utilization (A)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>They manage threading APIs.</p> Signup and view all the answers

<p>OpenMP</p> Signup and view all the answers

<p>Thread cancellation (D)</p> Signup and view all the answers

<p>Thread-local storage = Stores thread-specific data Thread pools = Manages a collection of reusable threads Amdahl's Law = Measures speedup in multicore systems Global Interpreter Lock = Limits true multithreading in Python</p> Signup and view all the answers

<p>start() (B)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>The serial portion limits speedup. (C)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>asynchronous</p> Signup and view all the answers

<p>Creates a thread with shared address space (D)</p> Signup and view all the answers

<p>True (A)</p> Signup and view all the answers

<p>#pragma omp parallel for</p> Signup and view all the answers

<p>non-Python</p> Signup and view all the answers

<p>User thread = A thread managed by the user-level library Kernel thread = A thread managed by the operating system kernel Lightweight process = A virtual processor used in multithreaded applications Thread pool = A collection of pre-initialized threads for reuse</p> Signup and view all the answers

<p>It assigns blocks to queues (B)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>Waits for a safe cancellation point</p> Signup and view all the answers

Manages computer hardware and executes user programs.

The Internet is not a core component.

Loads the operating system kernel during startup.

Faster than hard disks due to electronic storage.

Differentiates between user mode and kernel mode.

Temporary storage for frequently accessed data.

Mainframe computers support sharing resources among multiple users.

Multiprogramming organizes jobs, while multitasking manages user-perceivable processes.

Microsoft Windows is not open-source.

Job scheduling manages the order of jobs in a multiprogramming environment.

DMA (Direct Memory Access) reduces CPU load by letting hardware directly transfer data to/from memory, without CPU intervention.

A network of interconnected systems working together to solve a problem or complete a task that a single computer would have difficulty doing.

A method used by the operating system to handle interrupts, where each interrupt source has a specific address (vector) to jump to in the kernel for handling.

Increased reliability and throughput by utilizing multiple processors/cores for tasks.

Registers are the fastest level in a storage hierarchy, directly accessible to the CPU.

A bit array used to represent a set of boolean values efficiently, enabling space-saving.

A group of interconnected computers which work together.

Choosing the best way to handle what data is placed in cache and when items are replaced.

In shared memory communication, processes must synchronize access to the shared memory to avoid data inconsistencies.

Chrome's multiprocess architecture enhances security by isolating rendering processes within the browser.

A process state when it is waiting for CPU allocation.

Data structure storing information like memory limits and open files for a process.

Scheduler deciding which process will execute next on the CPU.

Processes that do not affect, or are unaffected by, other processes.

Communication channels used in message passing for sending and receiving messages between different processes.

A terminated process whose parent has not yet called a wait() function to collect its resources.

A fundamental unit of CPU utilization representing a running program.

Windows implements a One-to-One model where each thread has its own kernel-level thread.

Provide APIs (Application Programming Interfaces) for managing and manipulating threads.

The language handles creating and managing threads automatically, without explicit programmer instructions.

Threads managed directly by the operating system kernel.

Used to request the cancellation of a thread in Pthreads.

Stores data that is specific to each individual thread.

Two types of threading parallelism where Task parallelism focuses on dividing tasks among threads and Data parallelism focuses on dividing data among threads.

A law that states the speedup of a program on a parallel system is limited by the portion of the program that must be executed serially (cannot be parallelized).

A POSIX standard thread library that provides an API for creating and managing threads on Unix-like systems (including Linux and macOS).

A threading model where each user thread maps to a separate kernel thread. Allows for better OS management but may have a performance overhead.

A set of compiler directives that enable parallel programming by allowing code sections to be marked for parallel execution.

Creating a thread is generally faster and uses less resources than creating a new process. This is because threads share the same memory space and other resources, while processes have their own separate address spaces.

This threading model maps multiple user-level threads to an equal or greater number of kernel threads. It provides flexibility and efficiency, allowing multiple user threads to run concurrently on multiple CPU cores.

GCD uses blocks to represent tasks. These blocks are assigned to queues, which are then processed by threads managed by the system. This provides a highly efficient and flexible way to handle asynchronous tasks.

Kernel threads are managed directly by the operating system kernel. They have the advantage of being fully supported by the kernel and can be scheduled and run independently of other threads.

The #pragma omp parallel for directive in OpenMP allows you to parallelize a for loop, distributing iterations across multiple threads to speed up execution.

The Global Interpreter Lock (GIL) in Python restricts the execution of Python bytecode to a single thread at a time. This means that even with multiple threads, only one thread can execute Python code at a time, limiting true parallelism.

An LWP is a virtual processor that provides the illusion of multiple processors running concurrently on a single physical processor. It is often used in thread management to allow multiple threads to run concurrently on a single core.

In this model, thread cancellation does not happen immediately. Instead, it waits until the thread reaches a safe point, where it is safe to stop execution without causing errors.