Operating System II Chapter 1 Quiz
21 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to Lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

What is the state of a process when it is created?

  • New (correct)
  • Running
  • Waiting
  • Ready

A process in the Waiting state is actively being executed by the CPU.

False (B)

Name one state that a process can take during its execution period.

New, Running, Waiting, or Ready

A process is in the ______ state when it is loaded into the main memory and ready to run.

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

Match the following process states with their descriptions:

<p>New = Process is created Ready = Waiting to be assigned to the processor Running = Currently being executed by the CPU Waiting = Waiting for an event to occur</p> Signup and view all the answers

What does AT stand for in CPU scheduling?

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

Non-preemptive scheduling allows for interruptions of processes during execution.

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

What is the formula for calculating Turnaround Time (TAT)?

<p>TAT = Completion Time (CT) - Arrival Time (AT)</p> Signup and view all the answers

In CPU scheduling, _____ time is the duration a process takes to execute on the CPU.

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

Match the CPU scheduling types with their characteristics:

<p>Preemptive Scheduling = Faster response for urgent tasks. Non-preemptive Scheduling = Easier to manage.</p> Signup and view all the answers

Which of the following is true regarding preemptive scheduling?

<p>It allows interruptions for handling higher priority tasks. (C)</p> Signup and view all the answers

Waiting Time (WT) is calculated as TAT minus Burst Time (BT).

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

What is the main drawback of non-preemptive scheduling?

<p>It may cause delays in responding to urgent tasks.</p> Signup and view all the answers

Which CPU scheduling algorithm allocates the CPU to the process that requests it first?

<p>First-Come, First-Served (FCFS) (D)</p> Signup and view all the answers

Round Robin Scheduling allocates CPU time in fixed time units and can lead to starvation.

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

What is the main principle behind Shortest Job Next (SJN) scheduling?

<p>It allocates the CPU to the process with the smallest CPU burst.</p> Signup and view all the answers

In Priority Scheduling, processes are assigned based on their __________.

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

Match the CPU scheduling algorithms with their descriptions:

<p>Round Robin Scheduling = Allocates CPU time in fixed time slices First-Come, First-Served (FCFS) = Processes are executed in the order they arrive Shortest Job Next (SJN) = Allocates CPU to the shortest process available Priority Scheduling = Processes are scheduled based on assigned priorities</p> Signup and view all the answers

Which scheduling algorithm can lead to high waiting times for low-priority processes?

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

Preemptive algorithms allow a process to be interrupted and resumed later.

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

Define 'time quantum' in the context of Round Robin Scheduling.

<p>It is a fixed time unit allocated to each process for execution.</p> Signup and view all the answers

Flashcards

Process States

Different statuses a process can have during execution: New, Ready, Running, Waiting, Terminated.

New State

The state when a process is created before execution starts.

Ready State

The state where a process is loaded but waiting for CPU to execute.

Running State

The state when the process is being executed by the CPU.

Signup and view all the flashcards

Waiting State

The state where a process is waiting for an event to occur, like I/O completion.

Signup and view all the flashcards

Arrival Time (AT)

The moment a process enters the system for execution.

Signup and view all the flashcards

Burst Time (BT)

The total time required by a process for execution on the CPU.

Signup and view all the flashcards

Completion Time (CT)

The time when process execution is finished.

Signup and view all the flashcards

Turnaround Time (TAT)

The total time taken from arrival to completion of a process.

Signup and view all the flashcards

Waiting Time (WT)

The total time a process spends waiting in the ready queue.

Signup and view all the flashcards

Preemptive Scheduling

Allows a process to be interrupted and moved to a ready state.

Signup and view all the flashcards

Non-Preemptive Scheduling

Runs a process to completion without interruption.

Signup and view all the flashcards

CPU Scheduling Types

Refers to preemptive and non-preemptive methods of managing processes.

Signup and view all the flashcards

CPU Scheduling

The method of deciding which process is allocated to the CPU at any given time.

Signup and view all the flashcards

First-Come, First-Served (FCFS)

A scheduling algorithm where the first process to request the CPU is the first to be allocated.

Signup and view all the flashcards

Shortest Job First (SJF)

A scheduling algorithm that allocates CPU to the process with the smallest CPU burst time first.

Signup and view all the flashcards

Round Robin Scheduling

A scheduling method that assigns a fixed time quantum to each process in a cyclic order.

Signup and view all the flashcards

Time Quantum

A fixed amount of time that a process is allowed to run before being preempted in Round Robin Scheduling.

Signup and view all the flashcards

Priority Scheduling

A scheduling method that allocates CPU resources based on the priority level of each process.

Signup and view all the flashcards

Study Notes

Chapter 1: Operating System II, Section 1: Advanced Features of OS

  • The academic year is 2024-2025
  • Objectives include recalling OS principles, demonstrating scheduling purpose, and completing a scheduling algorithm.
  • CPU scheduling is the method of deciding which process gets the CPU for execution, while other processes are waiting
  • The computer system has users, software (system and application), and hardware (CPU, memory, I/O)

Computer System Components and Accessibility

  • Components in order of accessibility to users: User, Operating System, Computer Hardware, Application Programs

CPU Scheduling

  • A program running on a CPU is called a process
  • Processes have states: New, Running, Waiting, Ready
  • OS creates processes, and when the OS picks a program from secondary memory a process is created and enters the New state
  • A ready state is when a process is waiting to be assigned to a CPU
  • Running when a process is being executed by the CPU
  • The Waiting state is when a process needs additional input/output (I/O).
  • A terminated process has completed execution
  • CPU scheduling takes place when the CPU switches between processes
  • Preemptive scheduling allows interruption of a process, while non-preemptive scheduling runs until completion

CPU Scheduling Algorithms

  • Algorithms decide which ready process receives the CPU
    • First-Come, First-Served (FCFS): Process requests CPU first, gets allocated first
    • Shortest Job First (SJF): CPU allocated to process with the shortest burst time
    • Round Robin: Cyclic allocation of CPU time to processes (using a time quantum)
    • Priority: Based on the process's priority (usually determined by resource requirements)
    • Multilevel Queue: Arranges processes into multiple queues based on priority (uses round-robin within queues)
    • Multilevel Feedback Queue: Separates processes based on CPU burst characteristics; allows movement between priority queues based on waiting time.

Studying That Suits You

Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

Quiz Team

Related Documents

G12G_T2_W1 Operating System II PDF

Description

Test your understanding of advanced operating system features with this quiz focused on CPU scheduling and system components. Explore various states of processes and how the operating system manages them for optimal resource usage. Ideal for students in the 2024-2025 academic year.

More Like This

Use Quizgecko on...
Browser
Open
Browser
Browser