Final Exam Multiple-Choice Topics (Part 1)

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/24

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

25 Terms

1
New cards

What are the stages in the lifecycle of a process?

New, ready, running, waiting, terminated.

2
New cards

What is context switching?

The process of storing the state of a process or thread so that it can be resumed later.

3
New cards

What are the benefits of multithreading?

Increased responsiveness, better resource utilization, and improved performance.

4
New cards

Describe the One-to-One model in thread management.

Each user-level thread is mapped to a kernel thread.

5
New cards

What is the difference between user threads and kernel threads?

User threads are managed at the user level, while kernel threads are managed by the operating system.

6
New cards

What are the types of schedulers in CPU scheduling?

Short-term, long-term, and medium-term schedulers.

7
New cards

What does FCFS stand for in CPU scheduling?

First Come First Serve.

8
New cards

What is the Shortest Job First (SJF) algorithm?

A scheduling algorithm that selects the process with the shortest execution time.

9
New cards

What is Round Robin scheduling?

A scheduling algorithm that assigns a fixed time slice to each process in a cyclic order.

10
New cards

Define Turnaround Time in CPU scheduling.

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

11
New cards

What are the requirements for the Critical Section Problem?

Mutual Exclusion, Progress, Bounded Waiting.

12
New cards

A solution(s) to the critical section problem?

Peterson’s algorithm, semaphores, and mutexes.

13
New cards

Race conditions and their impact on concurrent systems?

Situations where the outcome depends on the sequence or timing of uncontrollable events.

14
New cards

What are the necessary conditions for deadlocks?

Mutual Exclusion, Hold & Wait, No Preemption, Circular Wait.

15
New cards

What is the Banker’s Algorithm used for?

To avoid deadlocks by making resource allocation decisions.

16
New cards

What is a Resource Allocation Graph?

A directed graph that represents the relationship between processes and resources.

17
New cards

What is the difference between logical and physical addresses?

Logical addresses are generated by the CPU, while physical addresses refer to actual memory locations.

18
New cards

What is the role of the Memory Management Unit (MMU)?

To handle the translation of logical addresses to physical addresses.

19
New cards

What is Swapping in memory management?

Transferring processes between main memory and disk.

20
New cards

Explain Paging in memory management.

Dividing memory into fixed-size units called pages.

21
New cards

What are hierarchical page tables?

A multi-level structure for organizing page tables to save memory.

22
New cards

What are system calls?

Functions that provide the interface between a running program and the operating system.

23
New cards

What are some types of system calls?

Process control, file management, device management, inter-process communication.

24
New cards

What is the role of bootstrapping in operating systems?

The process of starting a computer and loading the operating system.

25
New cards

What services do operating systems provide?

Resource Management, Error Handling, Protection/Security.