Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Introduction to Operating Systems: Processes, Memory, and Scheduling, Exams of Computer Science

Queen Mary, University of London (QMUL)Computer Science

Introduction to Operating Systems: Processes, Memory, and Scheduling Introduction to Operating Systems: Processes, Memory, and Scheduling

Typology: Exams

2024/2025

Available from 08/12/2025

Emma_Johnson
Emma_Johnson ๐Ÿ‡ฌ๐Ÿ‡ง

2.1K documents

1 / 13

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Introduction to Operating Systems: Processes,
Memory, and Scheduling
1. What is an operating system?
oA program that manages computer hardware
and software resources โœ”
oA user application
oA database system
oAn internet browser
2. What does a process represent in an OS?
oA running instance of a program โœ”
oA file on disk
oA user session
oHardware device
3. Threads are:
oIndependent processes
oSub-processes that share the same process
resources โœ”
oPrograms waiting to execute
oDisk partitions
4. What is the main advantage of multithreading?
oFaster execution by performing multiple
operations simultaneously โœ”
oUses less memory
pf3
pf4
pf5
pf8
pf9
pfa
pfd

Partial preview of the text

Download Introduction to Operating Systems: Processes, Memory, and Scheduling and more Exams Computer Science in PDF only on Docsity!

Introduction to Operating Systems: Processes,

Memory, and Scheduling

  1. What is an operating system? o A program that manages computer hardware and software resources โœ” o A user application o A database system o An internet browser
  2. What does a process represent in an OS? o A running instance of a program โœ” o A file on disk o A user session o Hardware device
  3. Threads are: o Independent processes o Sub-processes that share the same process resources โœ” o Programs waiting to execute o Disk partitions
  4. What is the main advantage of multithreading? o Faster execution by performing multiple operations simultaneously โœ” o Uses less memory

o Avoids deadlocks o Prevents process creation

  1. In memory management, what is paging? o Dividing memory into fixed-size blocks called pages โœ” o Allocating memory based on process priority o Storing entire process in contiguous memory o Using virtual memory
  2. Segmentation divides memory into: o Equal-sized pages o Variable-length segments based on logical divisions โœ” o Fixed frames o Disk blocks
  3. What is a page fault? o When a required page is not in physical memory and needs loading from disk โœ” o A syntax error in code o A type of scheduling error o When a process runs out of memory
  4. Which of the following is NOT a memory management technique? o Paging o Segmentation

o Encrypting communication o File creation

  1. What is the First-Come, First-Served (FCFS) scheduling algorithm? o Processes are scheduled in the order they arrive โœ” o Highest priority first o Round-robin with time slices o Longest job first
  2. Which scheduling algorithm assigns CPU to processes in circular order with time slices? o FCFS o Priority o Round Robin โœ” o Shortest Job First
  3. Priority scheduling selects processes based on: o Arrival time o Process priority โœ” o Random choice o Process size
  4. What is a drawback of FCFS scheduling? o High overhead o Starvation o Convoy effect causing long wait times โœ”

o Requires priorities

  1. In Round Robin scheduling, the time slice is also called: o Quantum โœ” o Cycle o Epoch o Period
  2. Which scheduling algorithm can cause starvation? o Round Robin o Priority scheduling โœ” o FCFS o Multilevel feedback
  3. What component of the OS is responsible for process scheduling? o Memory manager o File manager o Scheduler โœ” o Device manager
  4. What is context switching? o Saving and loading CPU state between processes โœ” o Starting a new process o Deleting old files
  1. What is thrashing in memory management? o Excessive paging causing performance degradation โœ” o A type of deadlock o File system corruption o Interrupt overload
  2. Which of the following is NOT a file access method? o Sequential access o Direct access o Indexed access o Parallel access โœ”
  3. What is the role of the directory in file systems? o Organizing files in a hierarchy โœ” o Storing file data o Scheduling processes o Managing memory
  4. What is a swap space used for? o Extending physical memory by using disk space โœ” o Storing system logs o Maintaining device info o Running processes concurrently
  1. What does segmentation support that pure paging does not? o Logical division by data type or function โœ” o Fixed-size memory blocks o Virtual memory o Faster access
  2. Which is an advantage of paging in memory management? o Avoids external fragmentation โœ” o Simple to implement only o Uses less CPU o Encrypts data
  3. Which data structure is commonly used by operating systems to keep track of process states? o Process Control Block (PCB) โœ” o Interrupt vector o File descriptor o Semaphore
  4. What state does a process enter when waiting for CPU time? o Running o Ready โœ” o Blocked o Terminated

o About 256

  1. In file systems, what is a cluster? o The smallest unit of disk space allocation โœ” o An I/O device o A block in memory o CPU register
  2. What is the use of a superblock in a file system? o Contains information about the file system such as size, status โœ” o Stores file contents o Acts as a device driver o Manages process scheduling
  3. Which scheduling algorithm minimizes average waiting time? o FCFS o Shortest Job First (SJF) โœ” o Round Robin o Priority
  4. In FCFS scheduling, what is the average waiting time for processes with burst times 3, 6, and 9 units, respectively, arriving at time 0? o 0 units o 6 units o 5 units โœ”

o 9 units

  1. What is fragmentation in memory management? o Wasting of memory space due to allocation and deallocation โœ” o Increasing CPU speed o Process creation o File system indexing
  2. Which scheduling algorithm assigns CPU to the shortest next CPU burst? o Round Robin o Shortest Job Next (SJN) โœ” o Priority o FCFS
  3. What does a deadlock in process scheduling mean? o Multiple processes blocked, each waiting for resources held by others โœ” o CPU overload o Memory failure o Process termination
  4. What memory management technique partitions memory into fixed-size units? o Segmentation o Paging โœ”

o Entire process o Memory allocation routine

  1. File permissions in Linux control: o Who can read, write, and execute a file โœ” o File size o Disk allocation o Process priority
  2. In Round Robin scheduling, if the time quantum is too large: o The system behaves like FCFS scheduling โœ” o The number of context switches increases o Processes get equal CPU time o Starvation occurs