Recent questions and answers in Operating System - GATE CSE Doubts

0 votes

0 answers

Fork () in for Loop
As it runs for i=0 to 10 except I=5 as continue is used. Therefore 10 times. Therefore 2^10-1 children. But I couldn't get the concept as I am using formulae. Please make a diagram just for overview to some iterations that his fork exactly calls.

asked 10 hours ago in Operating System by lokeshsharma123456 (11 points) | 5 views

0 votes

0 answers

Fork () in for Loop
As it runs for i=0 to 10 except I=5 as continue is used. Therefore 10 times. Therefore 2^10-1 children. But I couldn't get the concept as I am using formulae. Please make a diagram just for overview to some iterations that how fork exactly calls.

asked 22 hours ago in Operating System by lokeshsharma123456 (11 points) | 3 views

0 votes

0 answers

synchronization problems
#include <sys/types.h> #include <stdio.h> #include <unistd.h> int value = 10; int main() { pid_t pid; pid = fork(); if (pid == 0) { value = value + 100; } else if (pid > 0) { value = value -100; printf("PARENT: value= %d \n", value); //Line A wait (NULL); } } is there any synchronization problem in updating values

asked 3 days ago in Operating System by navo123 (7 points) | 4 views

0 votes

0 answers

synchronization
The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8, .... Formally, it can be expressed as: f ib0 = 0 f ib1 = 1 f ibn = f ibn−1 + f ibn−2 i. Write a C program using the fork() system call that that generates ... . How do y ou identify the zombie process? vii. Modify the above program to create an orphan process. viii. Compare and contrast the process and threads.

asked 3 days ago in Operating System by navo123 (7 points) | 7 views

0 votes

0 answers

gate 2006 -IT-56
For each of the four processes P1,P2,P3,P1,P2,P3, and P4P4. The total size in kilobytes (KB)(KB) and the number of segments are given below. ProcessP1P2P3P4Total size (in KB)19525445364Number of segments4538ProcessTotal size (in KB)Number of ... ; P Answer to this question is B or C ? and if possible can anyone provide the solution with explanation ; Thanks

asked 4 days ago in Operating System by Harpuneet Kalsi (6 points) | 6 views

0 votes

0 answers

GATE 1993 7.8
The root directory of a disk should be placed at a fixed address in main memory at a fixed location on the disk anywhere on the disk at a fixed location on the system disk anywhere on the system disk in this question what is the difference between system disk and disk?

asked 6 days ago in Operating System by faizalkhan (7 points) | 3 views

0 votes

0 answers

#process Synchronization #binary semaphore
Please provide book name for pseudocode of Binary semaphore. Thankyou in advance.

asked Mar 23 in Operating System by Ekta07_GATE (24 points) | 17 views

0 votes

1 answer

Convoy Effect
Is CONVOY Effect possible in "Longest job first" non preemptive scheduling policy?

answered Mar 22 in Operating System by !KARAN (351 points) | 20 views

0 votes

1 answer

page table access
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?

answered Mar 19 in Operating System by Arjun (142 points) | 15 views

0 votes

1 answer

Virtual address calculation
“ virtual address is found by page number × page size + Oﬀset” can someone explain this ? Isn’t it so that VA is found just by page number and page offset?

answered Mar 18 in Operating System by smsubham (64 points) | 14 views

0 votes

0 answers

No bits in Frames
Account for the validity and justification about the correctness of this statement " Whatever level page table is always the number of bits which are going to refer a frame number will always going to be same "

asked Mar 18 in Operating System by smsubham (64 points) | 2 views

+1 vote

2 answers

Self Doubt : Operating System
What is default page size of 32 and 64 bit WINDOWS OS?

answered Mar 18 in Operating System by smsubham (64 points) | 30 views

0 votes

1 answer

made easy test series 2020 mock test2
they have given answer as all the above .can someone explain why statement 3 is correct? let’s take a case where all process are of same burst. Then processes are not of mix burst ,still still good results,making option C wrong. Am i thinking in correct way ?

answered Mar 18 in Operating System by smsubham (64 points) | 41 views

0 votes

1 answer

GATE FORUM: STARVATION AND DEADLOCK

answered Mar 18 in Operating System by smsubham (64 points) | 49 views

0 votes

1 answer

Circular Wait
"One way to eliminate circular wait is to have rule saying that a process is entitled only to a single resource at any moment." Is this to avoid circular wait or hold and wait?

answered Mar 17 in Operating System by !KARAN (351 points) | 16 views

0 votes

0 answers

ISI 2015- CS-6
Consider scheduling n processes p1,p2,p3, .Pn which are created in this order at almost the same instant. Assume that all processes have exactly one CPU burst of duration D units (and no I/O bursts). Compute the average waiting time and average turn- ... time to switch from one running process to another and Δ units of time to switch from a terminated process to a running process

asked Mar 17 in Operating System by AbhayPrajapati (6 points) | 6 views

0 votes

1 answer

Operating system CPU scheduling
Consider processes P1 and p2 arriving in the ready queue at time 0 with following properties I) P1 needs a total of 12 units of CPU time and 20 units of I/Otime. After every 3 units of CPU time P1 spends 5 units on I/0. ii) P2 needs ... after P1. Compute the completion times of P1 and P2 using the following scheduling technique. 1 SRTF 2 RR with time quanta=4 units.

answered Mar 16 in Operating System by Anirban Chand (20 points) | 22 views

0 votes

0 answers

#Process Synchronization #Interested variable #Flag variable

asked Mar 11 in Operating System by Ekta07_GATE (24 points) | 21 views

0 votes

1 answer

SJF : find avg waiting time
A. 4 seconds B. 5 seconds C. 6 seconds D. 7 seconds i got 6 secs .

answered Mar 5 in Operating System by Kushagra गुप्ता (261 points) | 22 views

0 votes

0 answers

COAL INDIA 2020 : effective memory access time calculation.

asked Mar 5 in Operating System by rjking7403 (27 points) | 19 views

0 votes

1 answer

gate practice papers
Conventional page table has ‘m’ entries and an Inverted page table has ‘n’ entries, Main memory access time is ‘k’ ns, the worst case time requirement for address translation using conventional paging and inverted paging is _____ and _____ respectively

answered Mar 5 in Operating System by smsubham (64 points) | 18 views

0 votes

1 answer

Self doubt gate previous year GATE2007 IT 12
The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 bytes per page is 0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0410. Suppose that the memory can store ... ) 4 (C) 7 (D) 8 Ps: how to solve this question not getting address are allocated here when page fault occur

answered Mar 4 in Operating System by dheeraj2310 (10 points) | 28 views

0 votes

0 answers

Madeeasy test series 2020 os
will mutual exclusion be guaranteed? please explain with reason.

asked Feb 7 in Operating System by ag2121 (6 points) | 17 views

0 votes

0 answers

Multi-Level Paging
How many levels of paging is required such that outer page table fits in one page size assuming page size=4 KB and page table entry size=4 B at all levels and logical address=64 bits?

asked Feb 4 in Operating System by Srush (10 points) | 34 views

0 votes

0 answers

Made Easy :Mock
Three processes P1,P2.P3 use the following synchronization mechanism with S1=3,S2=2,S3=1. 1. P(S1) 2. P(S2) 3. P(S3) 4. <CS> 5. V(S3) 6. V(S2) 7. V(S1) Is bounded waiting satisfied here? Suppose P1,P2,P3 all execute line 1. P1 and ... So processes P1 and P2 can keep on running one after the other without giving the chance to P3 to get a lock on S2. Am I thinking this straight?

asked Feb 3 in Operating System by Sambhrant Maurya (401 points) | 43 views

0 votes

0 answers

Gate/processes/os/conceptual-doubt/basics
What part of os maintains process states

asked Feb 1 in Operating System by Steel_fairy (6 points) | 13 views

+1 vote

0 answers

SELF DOUBT:SEGMENTED PAGING
Consider a system using segmented-paging architecture with a V.A of 23 bits. The segment table has 32 entries and page table of segment is indexed with 9 bits. The size of largest segment is______KB.

asked Jan 29 in Operating System by Debapaul (699 points) | 22 views

0 votes

0 answers

Does multi level feedback queue suffer from starvation?

asked Jan 28 in Operating System by Pankajmjx (6 points) | 8 views

0 votes

0 answers

Made Easy Test OS
Can a process have bounded waiting and progress even if it has a possibility of deadlock?

asked Jan 27 in Operating System by tamaldeepmaity (17 points) | 11 views

0 votes

0 answers

Banker OS : Ace test series

asked Jan 26 in Operating System by Chirag Shilwant (180 points) | 22 views

0 votes

0 answers

Made easy OS full length
How no mutual exclusion occurs?

asked Jan 25 in Operating System by Jyoti Kumari97 (27 points) | 19 views

0 votes

0 answers

ace test series subject test( os)

asked Jan 24 in Operating System by Hrishabh_Gaur (10 points) | 18 views

0 votes

0 answers

Multi-level feedback queue
Consider there are five processes arriving in a system that implements the Multi-Level Feedback Queue (MLFQ) scheduler at 4, 7, 24, 26, 28 respectively. Their burst times are 14, 2, 5, 2, 2 respectively. There are 3 ready queues: queue 1 ... the third queue implements FCFS. Which process has the highest completion time? Note: Context Switching time is 1 unit. P2 P3 P4 P5

asked Jan 24 in Operating System by Akash Papnai (17 points) | 13 views

0 votes

1 answer

Made easy full length

answered Jan 23 in Operating System by shashin (1.9k points) | 65 views

0 votes

0 answers

applied gate:OS
A system uses 48 bit logical address and page size of 16 KB.Multilevel paging is used . A page table entry is of 4B. The total number of pages that are required to store the inner page table entries of a process in the outermost level of paging is:

asked Jan 20 in Operating System by abhinav649 (67 points) | 9 views

0 votes

0 answers

applied gate:OS(shared variable)
initial value of s and t is 1

asked Jan 20 in Operating System by abhinav649 (67 points) | 8 views

0 votes

1 answer

ME CBT2 2020
A COMPUTER SYSTEM IMPLEMENTS A 36 BIT VIRTUAL ADDRESS. PAGE SIZE OF 4 KB AND THE SIZE OF PHYSICAL MEMORY IS 30 BITS. THE APPROXIMATE SIZE OF PAGE TABLE IN THE SYSTEM IS __________ MB. [ASSUME MEMORY IS BYTE ADDRESSABLE].

answered Jan 19 in Operating System by SuvasishDutta (209 points) | 38 views

0 votes

0 answers

Self Doubt: Paging
We know that the paging formula is given by $P(ps+m) + (1-P)(m)$ where $P=Page-fault-rate$ $PS=Page-fault-service-time$ $m=memory-access$ Why there is only $1$ memory access when there is no page fault? Shouldn’t there be $2$ memory access assuming single level page table, $1$ for page table access and the other for accessing the frame of the memory?

asked Jan 19 in Operating System by Debapaul (699 points) | 17 views

0 votes

0 answers

OS : Ace test series

asked Jan 19 in Operating System by Chirag Shilwant (180 points) | 25 views

0 votes

0 answers

Made Easy test series os multi subject synchronization

asked Jan 19 in Operating System by Ram Swaroop (270 points) | 9 views

To see more, click for all the questions in this category.

Recent questions and answers in Operating System

3,511 questions

1,656 answers

10,449 comments

90,037 users