Recent questions tagged operating-system / GATE Overflow for GATE CSE

0 votes

1 answer

1831

Uttrakhand Asst. Professor Exam-44
In a multiprogramming environment The processor executes more than one process at a time The programs are developed by more than one person More than one process resides in the memory A single user can execute many programs at the same time

In a multiprogramming environmentThe processor executes more than one process at a timeThe programs are developed by more than one personMore than one process resides in ...

gatecse

259 views

gatecse asked Mar 2, 2018

0 votes

1 answer

1832

Uttrakhand Asst. Professor Exam-31
An exceptional condition in a computer system caused by an event external to the CPU is known as Halt Process Interrupt None of these.

An exceptional condition in a computer system caused by an event external to the CPU is known as Halt Process InterruptNone of these.

gatecse

223 views

gatecse asked Mar 2, 2018

7 votes

3 answers

1833

GATE CSE 2002 | Question: 18-b
The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C function int TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: return y; } Complete the following C functions for implementing code ... -free? For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic?

The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C functionint TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: retu...

go_editor

3.4k views

go_editor asked Feb 28, 2018

11 votes

4 answers

1834

GATE CSE 1999 | Question: 20-b
Consider the following solution to the producer-consumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of count and assignment to count are atomic operations. Producer: Repeat Produce an ... item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.

Consider the following solution to the producer-consumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of co...

go_editor

3.5k views

go_editor asked Feb 28, 2018

0 votes

2 answers

1835

mock test
Consider following pseudo code : main() { int t1,t2,t3; t1=t2=t3=0; t1=fork(); t2=fork(); if (t1!=0){ t3=fork(); printf("Hello"); } } How many Hello's are printed when above code get executed. $1$ $2$ $3$ $4$

Consider following pseudo code : main() { int t1,t2,t3; t1=t2=t3=0; t1=fork(); t2=fork(); if (t1!=0){ t3=fork(); printf("Hello"); } }How many Hello's are printed when...

bhanu kumar 1

1.3k views

bhanu kumar 1 asked Feb 27, 2018

0 votes

5 answers

1836

Testbook Test Series: Operating System - Virtual Memory

nish kim

1.1k views

nish kim asked Feb 14, 2018

44 votes

2 answers

1837

GATE CSE 2018 | Question: 53
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, , 199$), and $256$ sectors per track (numbered as $0, 1, 255$). The following $6$ disk ... negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____

Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, … , 199$), and $256$ sectors per track (numbered as $0, 1...

gatecse

15.8k views

gatecse asked Feb 14, 2018

30 votes

6 answers

1838

GATE CSE 2018 | Question: 40
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined with respective initial values of $0, N$ and $1$. Semaphore $empty$ denotes the number of available slots in the buffer, ... $P: empty, \ \ \ Q:full, \ \ \ R:full, \ \ \ S:empty$

Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined ...

gatecse

14.6k views

gatecse asked Feb 14, 2018

21 votes

3 answers

1839

GATE CSE 2018 | Question: 39
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. ... $safe$ state, but would be $safe$ if one more instance of $G$ were available

In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have decl...

gatecse

11.9k views

gatecse asked Feb 14, 2018

34 votes

5 answers

1840

GATE CSE 2018 | Question: 24
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___

Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested a...

gatecse

21.8k views

gatecse asked Feb 14, 2018

22 votes

3 answers

1841

GATE CSE 2018 | Question: 10
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is $M$ units if the corresponding memory page is available in memory, and $D$ units if the memory access causes a page fault. It has been experimentally measured that the average ... $(X-M) / D-M)$ $(D-X) / D-M)$ $(X-M) / D-X)$

Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is $M$ units if the corresponding memory p...

gatecse

10.6k views

gatecse asked Feb 14, 2018

23 votes

4 answers

1842

GATE CSE 2018 | Question: 9
The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution. P. The processor pushes the process status of $L$ onto the control stack Q. The processor finishes the execution of the ... based on the interrupt Which of the following is the correct order in which the events above occur? QPTRS PTRSQ TRPQS QTPRS

The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution.P. The processor pushes the process status of ...

gatecse

10.6k views

gatecse asked Feb 14, 2018

0 votes

1 answer

1843

fork() call in operating systems
Kindly explain Output of the given program....

Kindly explain Output of the given program....

khalida mujahid

886 views

khalida mujahid asked Feb 8, 2018

0 votes

0 answers

1844

Gate_2018_model_Paper
There is any difference or same these two statement? 1. Page fault service time is 10ms. 2. The Time to service a page fault is on average 10ms.

There is any difference or same these two statement?1. Page fault service time is 10ms.2. The Time to service a page fault is on average 10ms.

Harikesh Kumar

267 views

Harikesh Kumar asked Feb 3, 2018

1 votes

2 answers

1845

CPU Scheduling
Pno Arrival Time 1st IO Burst time 2nd IO P1 0 4 14 2 P2 0 8 28 4 P3 0 12 42 6 Using SRTF:- Completion time :- P1 - 18, P2 - 46, P3 - 88 Turnaround Time:- According to the definition of Galvin it is Turnaround time is the sum of the periods spent waiting to get into the memory, ... - 4 - 2 = 0. P2 = 50 - 28 - 8 - 4 = 10 P3 = 94 - 42 - 12 - 6 = 34. Someone Verify these calculations.

PnoArrival Time1st IOBurst time2nd IOP104142P208284P3012426Using SRTF:-Completion time :- P1 - 18, P2 - 46, P3 - 88Turnaround Time:- According to the definition of Galvi...

Shubhanshu

974 views

Shubhanshu asked Feb 2, 2018

2 votes

0 answers

1846

Semaphores
If two processes R1 and R2 accessing the shared variables A and B protected by two binary semaphores SA and SB respectively, both initialized to 1. R and Q denote the usual semaphore operators, where R decrements the semaphore value, and Q increments the semaphore value. The pseudo code of R1 and R2 is as ... ) R(SA ),R(SB ),R(SA ),R(SB ) R(SA ),R(SB ),R(SB ),R(SA ) None of the above

If two processes R1 and R2 accessing the shared variables A and B protected by two binary semaphores SA and SB respectively, both initialized to 1.R and Q denote the usua...

Madhi Varman

538 views

Madhi Varman asked Feb 2, 2018

0 votes

1 answer

1847

operating system
Suppose $10$ processes $P_1$ to $P_{10}$ share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a processs $P_i$ is $S_P$ where $S_P$ is greater then $0$. The maximum value of $S_i\left(\displaystyle{\sum_{i=1}^{10}S_P}\right)$ that ensures deadlock does not occurs is ________ .

Suppose $10$ processes $P_1$ to $P_{10}$ share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a process...

Kaluti

351 views

Kaluti asked Feb 2, 2018

1 votes

0 answers

1848

Gate_2018_Mock_Paper
How to solve it ?

How to solve it ?

Harikesh Kumar

428 views

Harikesh Kumar asked Feb 1, 2018

0 votes

0 answers

1849

Operating System
Is ans 12 or 17?

Is ans 12 or 17?

srestha

536 views

srestha asked Jan 29, 2018

1 votes

0 answers

1850

OS GERERAL DOUBT
WHEN TIME OUT OCCUR IN ROUND ROUBIN ALGORITHM THEN IN WHICH STATE PROCESS GO

WHEN TIME OUT OCCUR IN ROUND ROUBIN ALGORITHM THEN IN WHICH STATE PROCESS GO

dm4006

212 views

dm4006 asked Jan 29, 2018

3 votes

0 answers

1851

Texas Tech University Final Exam question
The Operating System on a hypothetical computer provides its users with a virtual memory space of 232 bytes. But the computer has only 64 megabytes (226 bytes) of physical memory. This virtual memory is implemented using paging with a page size of 1024 (210) bytes. (10%) To what page number does virtual address 0x12345678 refer?

The Operating System on a hypothetical computer provides its users with a virtual memory space of 232 bytes. But the computer has only 64 megabytes (226 bytes) of physica...

Balaji Jegan

564 views

Balaji Jegan asked Jan 28, 2018

3 votes

0 answers

1852

Operating system bounded waiting
Can some one give example where bounded waiting satisfies but starvation freedom is not there? I have read Bounded Wait => Starvation freedom is a false implication Please some one give example for this?

Can some one give example where bounded waiting satisfies but starvation freedom is not there?I have read Bounded Wait = Starvation freedom is a false implicationPlease s...

rahul sharma 5

341 views

rahul sharma 5 asked Jan 28, 2018

2 votes

1 answer

1853

Doubt Threads Scheduling
How are user level threads scheduled?

How are user level threads scheduled?

_jerry

654 views

_jerry asked Jan 26, 2018

1 votes

1 answer

1854

OS IPC
Why not deadlock.... ans is B)

Why not deadlock.... ans is B)

Pawan Kumar 2

1.2k views

Pawan Kumar 2 asked Jan 26, 2018

1 votes

0 answers

1855

Test Series
Consider a processor has virtual address 52 bits, the physical address is 32 bits and page size is 16KB. Each individual table at any level of the page table occupies a single page of physical memory. Using multi level paging, how many entries are there in each individual page table page. ... purpose? <4,12,12,12> < 2, 12, 12, 12 > <4,14,14,14> <10,12,14,14>

Consider a processor has virtual address 52 bits, the physical address is 32 bits and page size is 16KB. Each individual table at any level of the page table occupies a s...

Sahil1994

629 views

Sahil1994 asked Jan 26, 2018

8 votes

3 answers

1856

Self Doubt Context Switching Threads
S1: Context Switching occurs only in kernel mode. :TRUE S2: Context Switching in user mode is faster as compared to context switching in kernel mode. : TRUE If Context Switching occurs only in kernel mode, then how is CS in user mode faster ... switching and then change back to user mode which means more time should be taken as compared to CS in kernel mode.

S1: Context Switching occurs only in kernel mode. :TRUES2: Context Switching in user mode is faster as compared to context switching in kernel mode. : TRUEIf Context Swit...

_jerry

3.0k views

_jerry asked Jan 26, 2018

3 votes

1 answer

1857

MadeEasy Test Series 2018: Operating System - VIrtual Memory
Consider a system implements 4 KB pages and 24 bits physical address space. Each page table entry contains a valid bits, a dirty bits, 2 permission bits and translation. If the maximum page table size of process is 30 KB. Then the size of virtual ... + 12 = 25 bits. Total virtual space = $2^{25}$ bytes = 32 MB Anything wrong in this ????

Consider a system implements 4 KB pages and 24 bits physical address space. Each page table entry contains a valid bits, a dirty bits, 2 permission bits and translation. ...

Rishabh Gupta 2

2.6k views

Rishabh Gupta 2 asked Jan 25, 2018

1 votes

1 answer

1858

OPERATING SYSTEM
S1 IS FALSE. WHY???

S1 IS FALSE. WHY???

raviyogi

782 views

raviyogi asked Jan 24, 2018

2 votes

1 answer

1859

MadeEasy Test Series 2018: Operating System - Process Syncronization
does this satisfy progress , if no then why?

does this satisfy progress , if no then why?

charul

399 views

charul asked Jan 24, 2018

1 votes

1 answer

1860

page replacemment policy
A system uses optimal policy for a page replacement. It has 4 page frames with no pages loaded to begin with. Consider the following scenario Case-1: System first accesses 200 distinct pages in sequential order and then access same 200 distinct ... access same 200 distinct page in reverse order. The difference in the number of faults occurred in both case are _________.

A system uses optimal policy for a page replacement. It has 4 page frames with no pages loaded to begin with. Consider the following scenarioCase-1: System first accesses...

_anu

377 views

_anu asked Jan 24, 2018

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