Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions and answers in Operating System
67
votes
5
answers
1
GATE CSE 2001 | Question: 1.13
A CPU has two modes -- privileged and non-privileged. In order to change the mode from privileged to non-privileged a hardware interrupt is needed a software interrupt is needed a privileged instruction (which does not generate an interrupt) is needed a non-privileged instruction (which does not generate an interrupt) is needed
prasantkr.singh
answered
in
Operating System
38 minutes
ago
by
prasantkr.singh
21.6k
views
gatecse-2001
operating-system
normal
os-protection
30
votes
4
answers
2
GATE CSE 1996 | Question: 1.20, ISRO2008-56
Which of the following is an example of spooled device? A line printer used to print the output of a number of jobs A terminal used to enter input data to a running program A secondary storage device in a virtual memory system A graphic display device
prasantkr.singh
answered
in
Operating System
2 hours
ago
by
prasantkr.singh
10.9k
views
gate1996
operating-system
io-handling
normal
isro2008
8
votes
6
answers
3
OS:- Round Robin scheduling
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.
prasantkr.singh
answered
in
Operating System
3 days
ago
by
prasantkr.singh
4.4k
views
operating-system
round-robin-scheduling
context-switch
process-scheduling
0
votes
1
answer
4
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)
KraVLonE
answered
in
Operating System
3 days
ago
by
KraVLonE
123
views
process-scheduling
operating-system
round-robin-scheduling
context-switch
process-synchronization
0
votes
0
answers
5
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
asked
in
Operating System
Mar 10
by
kamogelommoyane
72
views
operating-system
1
vote
1
answer
6
#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
gateAspirant_X0
answered
in
Operating System
Mar 4
by
gateAspirant_X0
207
views
operating-system
fork-system-call
gate-preparation
programming-in-c
usermod
3
votes
2
answers
7
#OS Fork () tell the O/P?
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); fork (); The number of new processes created is
ADITYARAJ
answered
in
Operating System
Mar 3
by
ADITYARAJ
1.8k
views
fork-system-call
operating-system
0
votes
3
answers
8
#CPCB
How many helloWorld lines are printed by the program: #include <stdio.h> #include <stdlib.h> void myFunc() { if (fork() == 0) { fork(); printf(“helloWorld\n”); exit(0); } return ; } int main(){ printf(“helloWorld\n”); myFunc(); printf(“helloWorld\n”); return 1; }
amit166
answered
in
Operating System
Mar 2
by
amit166
527
views
fork-system-call
12
votes
3
answers
9
GATE CSE 2022 | Question: 16
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks? Circular wait is a necessary condition for the formation of deadlock. In a system where each resource has more than one instance, a cycle in its wait-for graph ... the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.
jvishal
answered
in
Operating System
Feb 29
by
jvishal
12.0k
views
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
1
vote
2
answers
10
UGC NET CSE | December 2004 | Part 2 | Question: 38
Remote computing system involves the use of timesharing systems and : Real time processing Batch processing Multiprocessing All of the above
ajayraho
answered
in
Operating System
Feb 29
by
ajayraho
1.6k
views
ugcnetcse-dec2004-paper2
0
votes
2
answers
11
UGC NET CSE | December 2004 | Part 2 | Question: 36
Semaphores are used to : Synchronise critical resources to prevent deadlock Synchronise critical resources to prevent contention Do I/o Facilitate memory management
ajayraho
answered
in
Operating System
Feb 29
by
ajayraho
847
views
ugcnetcse-dec2004-paper2
4
votes
2
answers
12
GATE CSE 2024 | Set 2 | Question: 54
Consider a $32$-bit system with $4 \mathrm{~KB}$ page size and page table entries of size $4$ bytes each. Assume $1 \mathrm{~KB}=2^{10}$ bytes. The OS uses a $2$-level page table for memory management, with the page table containing ... the maximum number of pages across the two levels of the page table of the process. The value of $\text{X+Y}$ is ___________.
rexritz
answered
in
Operating System
Feb 22
by
rexritz
2.1k
views
gatecse2024-set2
numerical-answers
operating-system
0
votes
2
answers
13
GATE CSE 2024 | Set 1 | Question: 47
Consider the following code snippet using the fork () and wait () system calls. Assume that the code compiles and runs correctly, and that the system calls run successfully without any errors. int $\mathrm{x}=3$; while $(\mathrm{x}>0)$ ... ("hello"); wait (NULL) ; X-- ; } The total number of times the printf statement is executed is __________.
Biswajit Kumar
answered
in
Operating System
Feb 18
by
Biswajit Kumar
1.8k
views
gatecse2024-set1
numerical-answers
operating-system
3
votes
3
answers
14
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$
Hira Thakur
answered
in
Operating System
Feb 18
by
Hira Thakur
1.9k
views
gatecse2024-set2
operating-system
process-scheduling
0
votes
1
answer
15
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.
TusharRana
answered
in
Operating System
Feb 18
by
TusharRana
149
views
syllabus
operating-system
1
vote
2
answers
16
GATE CSE 2024 | Set 1 | Question: 52
Consider a memory management system that uses a page size of $2 \mathrm{~KB}$. Assume that both the physical and virtual addresses start from $0$. Assume that the pages $0,1,2$, and $3$ ... $0$, respectively. The physical address (in decimal format) corresponding to the virtual address $2500$ (in decimal format) is ___________.
Psy Duck
answered
in
Operating System
Feb 17
by
Psy Duck
1.6k
views
gatecse2024-set1
numerical-answers
operating-system
0
votes
2
answers
17
GATE CSE 2024 | Set 1 | Question: 30
Consider the following two threads $\mathrm{T} 1$ and $\mathrm{T} 2$ that update two shared variables $\mathrm{a}$ and $\mathrm{b}$. Assume that initially $\mathrm{a}=\mathrm{b}=1$ ...
Hira Thakur
answered
in
Operating System
Feb 17
by
Hira Thakur
1.7k
views
gatecse2024-set1
operating-system
1
vote
1
answer
18
GATE CSE 2024 | Set 1 | Question: 14
Which of the following statements about threads is/are TRUE? Threads can only be implemented in kernel space Each thread has its own file descriptor table for open files All the threads belonging to a process share a common stack Threads belonging to a process are by default not protected from each other
phaniphani
answered
in
Operating System
Feb 17
by
phaniphani
2.4k
views
gatecse2024-set1
multiple-selects
operating-system
0
votes
2
answers
19
GATE CSE 2024 | Set 1 | Question: 44
Consider a $512$ GB hard disk with $32$ storage surfaces. There are $4096$ sectors per track and each sector holds $1024$ bytes of data. The number of cylinders in the hard disk is _________.
Hira Thakur
answered
in
Operating System
Feb 17
by
Hira Thakur
1.3k
views
gatecse2024-set1
numerical-answers
operating-system
1
vote
1
answer
20
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
Sachin Mittal 1
answered
in
Operating System
Feb 17
by
Sachin Mittal 1
2.5k
views
gatecse2024-set2
operating-system
multiple-selects
1
vote
1
answer
21
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)
Deepak Poonia
answered
in
Operating System
Feb 17
by
Deepak Poonia
1.7k
views
gatecse2024-set2
operating-system
multiple-selects
0
votes
1
answer
22
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
Sachin Mittal 1
answered
in
Operating System
Feb 17
by
Sachin Mittal 1
2.3k
views
gatecse2024-set2
operating-system
multiple-selects
1
vote
1
answer
23
GATE CSE 2024 | Set 2 | Question: 43
Consider a disk with the following specifications: rotation speed of $6000$ RPM, average seek time of $5$ milliseconds, $500$ sectors/track, $512$-byte sectors. A file has content stored in $3000$ sectors located randomly on the disk. Assuming ... total time (in seconds, rounded off to $2$ decimal places) to read the entire file from the disk is ______________.
puspeshsrivastava
answered
in
Operating System
Feb 17
by
puspeshsrivastava
1.4k
views
gatecse2024-set2
numerical-answers
operating-system
disk
1
vote
1
answer
24
GATE CSE 2024 | Set 1 | Question: 15
Which of the following process state transitions is/are NOT possible? Running to Ready Waiting to Running Ready to Waiting Running to Terminated
Hira Thakur
answered
in
Operating System
Feb 17
by
Hira Thakur
2.3k
views
gatecse2024-set1
operating-system
process-scheduling
multiple-selects
0
votes
1
answer
25
GATE 2024 CS set-1
If a process perform IO time first and then performing cpu, in that case process is going from ready state to wait state, is that true?
TusharRana
answered
in
Operating System
Feb 11
by
TusharRana
240
views
0
votes
0
answers
26
memory management
we have 8 pages (each side 32B) to store in physical memory of 2^32 bits how many bits are required to identify each page , according to me 3 bits are required but that is wrong plz explain why
SSR17
asked
in
Operating System
Feb 9
by
SSR17
173
views
memory-management
operating-system
paging
virtual-memory
7
votes
1
answer
27
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 23
Consider the context switch of a CPU from the context of process P1 to that of process P2. Consider the following two events in the chronological order of the events during the context switch: E1: The stack pointer ... atomic hardware instruction. The relative ordering of E1 and E2 can vary from one context switch to the other.
Sachin Mittal 1
answered
in
Operating System
Feb 8
by
Sachin Mittal 1
441
views
goclasses2024-mockgate-14
operating-system
context-switch
process
1-mark
58
votes
4
answers
28
GATE CSE 2013 | Question: 53
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)},$ which occupies exactly one ... to guarantee that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$
iam.sahilpatra
answered
in
Operating System
Feb 7
by
iam.sahilpatra
30.0k
views
gatecse-2013
normal
operating-system
virtual-memory
0
votes
1
answer
29
ACE OTS
A.330 B.388 C.279 D.389 Can someone please give detailed solution to this?
devBhaskar
answered
in
Operating System
Feb 7
by
devBhaskar
162
views
2
votes
2
answers
30
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 24
Consider a job A arrives at time $T=0$ and job length of $500 \mathrm{~ms}$. Job $B$ arrives at time $\mathrm{T}=100 \mathrm{~ms}$ with a length of $100 \mathrm{~ms}$. Considering the Shortest Remaining Time First Scheduler, what does ... for $100 \mathrm{~ms}$, then $B$ runs for $100 \mathrm{~ms}$, then A runs for $300 \mathrm{~ms}$
K1ngJok3r
answered
in
Operating System
Feb 6
by
K1ngJok3r
328
views
goclasses2024-mockgate-14
operating-system
process-scheduling
1-mark
9
votes
2
answers
31
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 36
Assume a linear page table, with a 1-byte page-table entry. Assume physical and virtual address spaces of size 128 bytes with 32-byte pages. The page-table base register is set to physical address 16. The contents of ... What are the physical addresses that will get referred in fetch and execute of the above instruction? 10 42 102 70
mayajeet
answered
in
Operating System
Feb 6
by
mayajeet
532
views
goclasses2024-mockgate-14
operating-system
memory-management
paging
multiple-selects
2-marks
2
votes
1
answer
32
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 37
Suppose that an operating system provides two functions, block() which puts the calling process on the blocked queue, and wakeup(P) which moves process P to the ready queue if it is currently on the blocked queue. ... alternation printing ABABAB . A and B will always run forever with strick alternation printing BABABA . None of these
Prabhas
answered
in
Operating System
Feb 6
by
Prabhas
379
views
goclasses2024-mockgate-14
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
2-marks
29
votes
2
answers
33
GATE CSE 2022 | Question: 53
Consider two files systems $\text{A}$ and $\text{B}$, that use contiguous allocation and linked allocation, respectively. A file of size $100$ blocks is already stored in $\text{A}$ and also in $\text{B}$. Now, consider inserting a new block in the middle of ... $\text{B}$ are $n_{A}$ and $n_{B}$, respectively, then the value of $n_{A} + n_{B}$ is__________________.
Mahanth Yalla
answered
in
Operating System
Feb 2
by
Mahanth Yalla
9.5k
views
gatecse-2022
numerical-answers
operating-system
file-system
2-marks
0
votes
0
answers
34
What is the difference between synchronous and asynchronous signals?
A process can receive two kinds of signals classified based on the source and reason. Synchronous are the one that are generated by illegal memory access or division by zero. Asynchronous are the one that ... exceptions? For example we have ZeroDivisionError or FileNotFoundError and all. Ref: Signal Handling from Galvin OS book
tbhaxor
asked
in
Operating System
Feb 1
by
tbhaxor
82
views
operating-system
process
0
votes
1
answer
35
Operating System
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page size of 2 KB. It is assumed that the pages are spread randomly around the disk. A. 1200 ms B. 1300 ms C. 1320 ms D. 1400 ms
vedantk
answered
in
Operating System
Jan 30
by
vedantk
262
views
operating-system
self-doubt
5
votes
1
answer
36
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 21
Consider a virtual memory system that uses paging. Virtual and physical addresses are both $32$ bits long, and the page size is $4 \textsf{KB}=2^{12}$ bytes. A process $\text{P}_1$ has the following page table. ... $\textsf{0x00003b65}$ $\textsf{0x00875b65}$ $\textsf{0x00875}$ Translation is not possible as per the given page table
ysingh89
answered
in
Operating System
Jan 30
by
ysingh89
334
views
goclasses2024-mockgate-13
goclasses
operating-system
paging
virtual-memory
1-mark
6
votes
2
answers
37
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 45
Imagine a computer with a $32$-bit virtual address space and $\text{1 KB}$ pages. It uses a two-level page table system, with page-sized chunks at the inner level(not at the outer level). Suppose the code is located at address $0,$ and there are ... is $4$ Bytes.) $64 \mathrm{~KB}$ $2 \mathrm{~KB}$ $66 \mathrm{~KB}$ $16 \mathrm{MB}$
Bharani Vish
answered
in
Operating System
Jan 30
by
Bharani Vish
684
views
goclasses2024-mockgate-13
goclasses
operating-system
paging
multilevel-paging
2-marks
0
votes
3
answers
38
Operating System Round Robin
Does Round Robin guarantee bounded waiting?
ByteCode
answered
in
Operating System
Jan 30
by
ByteCode
256
views
operating-system
round-robin-scheduling
process-scheduling
5
votes
1
answer
39
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 20
Suppose we have a multi-level index file system, and this file system has $512$ Bytes blocks, inodes with $3$ direct, $1$ single-indirect, $2$ double-indirect, and $1$ triple-indirect pointer, and $64$-bit block ... inode requires the first single-indirect block number be used? $1536$ Bytes $1537$ Bytes $512$ Bytes $1500$ Bytes
GO Classes
asked
in
Operating System
Jan 28
by
GO Classes
510
views
goclasses2024-mockgate-13
goclasses
operating-system
file-system
1-mark
7
votes
1
answer
40
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 46
Assume that for a given system, virtual addresses are $40$ bits long and physical addresses are $30$ bits long. The page size is $8$ KB. The Translation Look-aside Buffer (TLB) in the address translation path has $128$ entries. At most ... distinct virtual addresses can be translated without any TLB miss? $2^7$ $2^{20}$ $2^{13}$ $2^8$
GO Classes
asked
in
Operating System
Jan 28
by
GO Classes
380
views
goclasses2024-mockgate-13
goclasses
operating-system
translation-lookaside-buffer
2-marks
To see more, click for all the
questions in this category
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(683)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent questions and answers in Operating System
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation