Operating Systems Concepts Quiz

<p>They have multiple execution sequences. (A)</p> Signup and view all the answers

<p>It maintains a record of used memory blocks. (C)</p> Signup and view all the answers

<p>Half-duplex transmission (C)</p> Signup and view all the answers

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

<p>The space is freed for new programs to be loaded. (D)</p> Signup and view all the answers

<p>Processes share a single program counter. (A)</p> Signup and view all the answers

<p>Many programs and processes must be monitored and managed. (B)</p> Signup and view all the answers

<p>10th edition (B)</p> Signup and view all the answers

<p>CPU and I/O devices. (C)</p> Signup and view all the answers

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

<p>Chapters 4-6 OSC (D)</p> Signup and view all the answers

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

<p>Difficult to implement and extend (B)</p> Signup and view all the answers

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

<p>Changes can impact all other parts due to tight coupling (C)</p> Signup and view all the answers

<p>Easier to port to another OS and provides more security (D)</p> Signup and view all the answers

<p>Performance may suffer due to inter-process communication (B)</p> Signup and view all the answers

<p>Layers can only call functions from the layer below (A)</p> Signup and view all the answers

<p>They allow for adding new services without modifying the kernel (D)</p> Signup and view all the answers

<p>Hardware interaction (D)</p> Signup and view all the answers

<p>Reliable, fast, and safe (D)</p> Signup and view all the answers

<p>Policy defines what to do, mechanism defines how to do it (C)</p> Signup and view all the answers

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

<p>It runs a single, static binary file in a single address space (C)</p> Signup and view all the answers

<p>Easier to understand and maintain code (D)</p> Signup and view all the answers

<p>Modify policies while keeping mechanisms intact (D)</p> Signup and view all the answers

<p>Policies can be changed without affecting existing mechanisms (B)</p> Signup and view all the answers

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

<p>Execute jobs submitted by users (A)</p> Signup and view all the answers

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

<p>By pushing and popping data using specific CPU instructions (B)</p> Signup and view all the answers

<p>They may overlap if not managed correctly (A)</p> Signup and view all the answers

<p>Contents of the CPU registers and program counter (D)</p> Signup and view all the answers

<p>To manage memory dynamically during execution (D)</p> Signup and view all the answers

<p>Time-shared systems (A)</p> Signup and view all the answers

<p>Returning to the caller function (D)</p> Signup and view all the answers

<p>To select a process to run from a set of available processes. (A)</p> Signup and view all the answers

<p>I/O bound process (D)</p> Signup and view all the answers

<p>Some processes will have to wait for CPU time. (A)</p> Signup and view all the answers

<p>To pause the current process and execute a kernel routine. (A)</p> Signup and view all the answers

<p>To reduce the degree of multiprogramming and contention for CPU. (B)</p> Signup and view all the answers

<p>Less than every 100 milliseconds (B)</p> Signup and view all the answers

<p>The number of processes currently in memory. (D)</p> Signup and view all the answers

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

A design philosophy that separates the 'what' (policies) from the 'how' (mechanisms) in operating system development.

An operating system design where all kernel functions are combined into a single, static binary file, running in a singular address space.

The traditional UNIX system's structure involves a kernel and separate system programs, representing a simplified form of a monolithic kernel.

High-level programming languages, like C and C++, benefit OS development by creating faster, more compact, easier to understand, and maintainable code. They also streamline compiler improvements and OS porting.

The process of choosing and implementing specific strategies to achieve the desired operating system goals.

A collection of user-defined goals and system-defined constraints that guide the development of an operating system.

The fundamental operating system principles, rules, and guidelines used in its development.

The core of an operating system, responsible for managing hardware resources and providing fundamental services to other programs.

A technique that breaks down the operating system into layers, with each layer providing services for the layer above it.

A type of operating system architecture that minimizes the core kernel functionality, running essential components as user-level processes.

Each component of a monolithic kernel is tightly intertwined, so changes in one can significantly impact others.

A loosely coupled operating system structure where each component is modularized and performs specific functions with minimal interference from others.

Each layer in a layered operating system can only access the services provided by the layer below it.

The advantage of breaking down a complex operating system into smaller, modular components is that debugging becomes easier.

The microkernel approach offers security benefits because most services run in user space, lowering the risk of a compromise affecting the core kernel functionality.

A process is a running instance of a program. It has its own unique execution sequence and resources. One program can have multiple processes.

The CPU executes instructions one after the other, in a linear fashion. It follows the instructions of a process until the process completes or is interrupted.

The operating system (OS) is responsible for managing multiple processes. It decides which process gets to run at any given time, giving each process a small slice of time in a time-sharing manner.

The OS handles tasks related to processes, including creating new processes, deleting existing processes, scheduling their execution, managing their resources, and handling communication between them.

Main memory, also known as RAM, is the primary memory used by the CPU for accessing data and instructions. It is directly accessible by the CPU, allowing for fast data access.

Data and instructions that are not currently in main memory (RAM) must first be loaded into RAM before the CPU can access them. This involves transferring data from secondary storage, such as hard drives, to RAM.

The OS manages memory by keeping track of which blocks of memory are used and which processes are using them. It also handles allocating and deallocating memory space to processes as needed.

When multiple processes are running at the same time, the OS needs to decide which process gets access to the CPU and for how long. This process of scheduling ensures fair and efficient usage of the CPU.

A unit of execution within an operating system that represents a running program, along with its resources (e.g., memory, files).

A collection of processes running concurrently (at the same time) in a single operating system. The OS manages the share of CPU time and resources among processes

The part of memory that holds the executable code of a program.

The part of memory that stores global variables, accessed by all parts of the program.

The part of memory that dynamically grows and shrinks as a program runs, providing space for program variables and data.

A stack-like data structure that stores temporary values used during function calls. It uses specific CPU instructions for pushing and popping data, like the push and pop instructions.

A memory management technique where processes can share the same memory space; primarily used to improve efficiency and communication between applications.

A mechanism that allows processes to safely communicate and exchange information with each other, typically through a structured format like messages passed between them.

A process that spends most of its time waiting for I/O operations to complete.

A process that spends most of its time executing instructions.

The process of selecting a ready process from a queue and assigning it to the CPU.

A data structure that holds processes waiting to be executed.

A data structure that holds processes waiting for I/O operations to complete.

The act of switching between processes, saving the state of the current process and loading the state of the next process.

A technique that moves a process from memory to disk to reduce contention for the CPU.

The number of processes currently in memory.

A communication channel between two processes that allows data transfer in a unidirectional manner (only one process can send data at a time).

A communication channel between two processes that allows data transfer in both directions, but only one direction at a time.

A process that can communicate with other processes through named pipes even after the original communicating processes have terminated.

A process that is capable of creating and accessing named pipes.

A process that shares the same memory space and resources with other processes, allowing them to communicate and work together efficiently.