System calls, Processes, Threads, Inter‐process communication, Concurrency and synchronization. Deadlock. CPU scheduling. Memory management and Virtual memory. File systems. Disks is also under this

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2024-1} & \textbf{2024-2} &\textbf{2023}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &2&2&3& 2 &4&2&2&2.5&4
\\\hline\textbf{2 Marks Count} & 4&4&3&4 &1&3&1&3.16&4
\\\hline\textbf{Total Marks} & 10&10&9&10 &6&8&\bf{6}&\bf{8.83}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Operating System

0 votes

0 answers

OS | File Management | Made Easy Q105
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes of a file that can be accessed by quadruple pointer is 4TB using the ... Answer: 32bits i'm bit confused in the difference between I-Node disk block size and the given disk block size.

A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes...

RahulVerma3

13 views

RahulVerma3 asked 1 day ago

0 votes

0 answers

Consider the following segment table: Segment Base Length 0 219 600 1 2300 14 2 90 100 3 1327 580 4 1952 96 What are the physical addresses for the following logical addresses? a. 0,430 b. 1,10 c. 2,500 d. 3,400 e. 4,112

Ovie

61 views

Ovie asked 6 days ago

0 votes

0 answers

Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved

Ovie

22 views

Ovie asked 6 days ago

0 votes

1 answer

CPU Scheduling
Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to know is there any faster way to get solutions . Please provide any resource if available. Thanks

Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to kn...

arpit.jha

86 views

arpit.jha asked Apr 26

0 votes

0 answers

Memory management
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 requests 6 KB of memory. Process P3 requests 12 KB of memory. Process P4 requests 4 KB of ... requests 8 KB of memory. The system uses the following memory allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit

Consider a system with 32 KB of physical memory and the following memory allocation requests from processes:• Process P1 requests 10 KB of memory.• Process P2 r...

Sahun

74 views

Sahun asked Apr 25

0 votes

1 answer

Contiguous memory allocation
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 requests 6 KB of memory. Process P3 requests 12 KB of memory. Process P4 requests 4 ... 8 KB of memory. The system uses the following memory allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit

Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: • Process P1 requests 10 KB of memory. • Process P2...

SWETHA MURUGANANDHAM

126 views

SWETHA MURUGANANDHAM asked Apr 23

1 votes

0 answers

Andrew S. Tanenbaum (MOS) Edition 5 Exercise 3 Question 16 (Page No. 252)
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual address space. If memory address space is divided evenly ... virtual address space would be allocated to each process at a minimum, with the maximum number of processes running?

The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual address space. If mem...

sofigenr

80 views

sofigenr asked Apr 18

0 votes

1 answer

gate zeal cse pdf
Consider the four mutex locks L1, L2, L3, and L4. Two processes A and B request these four locks. Each process requests them in some (possibly different) pre programmed sequence. There are 24 possible sequences for requesting the locks making for 576 programming possibilities. How many of these can possibly result in a deadlock?

Consider the four mutex locks L1, L2, L3, and L4. Two processes A and B request these four locks. Each process requests them in some (possibly different) pre programmed s...

jugnu1337

97 views

jugnu1337 asked Apr 14

0 votes

0 answers

PGEE exam
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None

What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None

Himanshu_2211

101 views

Himanshu_2211 asked Apr 8

1 votes

1 answer

fork() system call
Consider the following pieces of codes for fork( ) system call. Solve and explain how many child processes are created upon execution of this program? Snippet 1: void main( ) { fork( ); fork( ); exit( ); } Snippet 2: int main( ) { int i; for (i = 0; i < 4; i++) fork(); return 0; } Learning Outcomes. Understand the working of fork ( ) system call.

Consider the following pieces of codes for fork( ) system call. Solve and explain how many child processes are created upon execution of this program? Snippet 1:void main...

Sparkboy

189 views

Sparkboy asked Apr 4

0 votes

0 answers

Operating system concepts 9th edition Abdraham Silberschatz
Write a monitor to solve the consumer-producer problem. The basic program structure is shown as follows. monitor ProducerConsumer { int in, out, count; Item buffer[BUFFER_SIZE]; condition empty, full; // To add anything ... } Process Consumer: while(true) { ProducerConsumer.get(next_consumed); /* consume the item in next_consumed */ }

Write a monitor to solve the consumer-producer problem. Thebasic program structure is shown as follows.monitor ProducerConsumer {int in, out, count;Item buffer[BUFFER_SIZ...

Maxine

68 views

Maxine asked Apr 3

0 votes

1 answer

Paging
If Page size = Frame size is always true and offset in Logical address = offset in physical address holds Then how/why Logical address size can come different than physical address size?

If Page size = Frame size is always true and offset in Logical address = offset in physical address holdsThen how/why Logical address size can come different than physica...

Mrityudoot

172 views

Mrityudoot asked Mar 20

1 votes

2 answers

OS, Process Scheduling
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and the context switch takes 0 seconds. At what time the first process will complete the execution? (assume all the variables as integers). A) nkx B) k(nx-1) C) k(nk+n) D) x(nk-n+1)

Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...

delxbydelt

328 views

delxbydelt asked Mar 15

0 votes

1 answer

Three process P1, P2 and P3 arrive at time zero. Their total execution time is 10ms, 20ms, and 30ms respectively. They spent first 20% of their execution time in doing I/O, next 70% in CPU processing and the last 10% again doing I/O. For what percentage of time was the CPU free? Using SRTF algorithm

kamogelommoyane

275 views

kamogelommoyane asked Mar 10

1 votes

2 answers

#OS-FORK Output
Q23. The following C program is executed on a Unix/Linux system: main() { int i=0; while (i<20) if (i%2==0) fork(); i++; return 0; } Calculate how many number of processes will be created after executing the above program. Options: 1.1023 2.Infinite 3.1024 4.2048

Q23. The following C program is executed on a Unix/Linux system: main(){ int i=0; while (i<20) if (i%2==0) fork(); ...

BitMask

449 views

BitMask asked Mar 3

0 votes

1 answer

Doubt on OS Syllabus (Galvin)
Hi, i'm starting my GATE journey and wanted to verify if these are the topics which should be learnt for GATE. The book is Operating Systems by Avi Silberschatz, Greg Gagne, and Peter Baer Galvin (9th Edition). Also have 10th edition but it seems to have rearranged a lot of topics and chapters.

Hi, i'm starting my GATE journey and wanted to verify if these are the topics which should be learnt for GATE. The book is Operating Systems by Avi Silberschatz, Greg Gag...

Apex7D0

223 views

Apex7D0 asked Feb 17

0 votes

1 answer

GATE CSE 2024 | Set 2 | Question: 14
Which of the following tasks is/are the responsibility/responsibilities of the memory management unit $\text{(MMU)}$ in a system with paging-based memory management? Allocate a new page table for a newly created process Translate a virtual address ... table Raise a trap when a process tries to write to a page marked with read-only permission in the page table

Which of the following tasks is/are the responsibility/responsibilities of the memory management unit $\text{(MMU)}$ in a system with paging-based memory management?Al...

Arjun

2.8k views

Arjun asked Feb 16

1 votes

1 answer

GATE CSE 2024 | Set 2 | Question: 15
Consider a process $\text{P}$ running on a $\text{CPU}$. Which one or more of the following events will always trigger a context switch by the $\text{OS}$ that results in process $\mathrm{P}$ moving to a non-running ... page fault An interrupt is raised by the disk to deliver data requested by some other process A timer interrupt is raised by the hardware

Consider a process $\text{P}$ running on a $\text{CPU}$. Which one or more of the following events will always trigger a context switch by the $\text{OS}$ tha...

Arjun

3.1k views

Arjun asked Feb 16

5 votes

3 answers

GATE CSE 2024 | Set 2 | Question: 27
Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is its arrival time, and the second value is its $\text{CPU}$ ... $\mathrm{SRTF}=7, \mathrm{NP}-\mathrm{SJF}=7.5$ $\mathrm{SRTF}=7, \mathrm{NP}-\mathrm{SJF}=8.5$

Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is...

Arjun

2.6k views

Arjun asked Feb 16

2 votes

1 answer

GATE CSE 2024 | Set 2 | Question: 36
Consider a multi-threaded program with two threads $\mathrm{T} 1$ and $\mathrm{T} 2$. The threads share two semaphores: $s1$ (initialized to $1$) and $s2$ (initialized to $0$). The threads also share a global variable $\mathrm{x}$ ( ... not print anything (deadlock) $\mathrm{T} 2$ runs first and prints $1, \mathrm{~T} 1$ does not print anything (deadlock)

Consider a multi-threaded program with two threads $\mathrm{T} 1$ and $\mathrm{T} 2$. The threads share two semaphores: $s1$ (initialized to $1$) and $s2$ ...

Arjun

2.4k views

Arjun asked Feb 16

Page:

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true