Recent activity by tiger / GATE Overflow for GATE CSE

1 answer

1

probabilty
There are two boxes namely A and B. A contains 20 green and 15 blue balls and B contains 7 green and 8 blue balls. You can move the balls between the two boxes. If you are allowed to choose a box at random then what will be the maximum probability of getting a green ball from the chosen box?

There are two boxes namely A and B. A contains 20 green and 15 blue balls and B contains 7 green and 8 blue balls. You can move the balls between the two boxes. If you ar...

595 views

answer selected Nov 26, 2016

5 answers

2

GATE2014 AG: GA-6
In a group of four children, Som is younger to Riaz. Shiv is elder to Ansu. Ansu is youngest in the group. Which of the following statements is/are required to find the eldest child in the group? Statements 1. Shiv is younger to Riaz. 2. Shiv is ... and $2$ are both required to determine the eldest child. Statements $1$ and $2$ are not sufficient to determine the eldest child.

In a group of four children, Som is younger to Riaz. Shiv is elder to Ansu. Ansu is youngest in the group. Which of the following statements is/are required to find the e...

3.3k views

commented Oct 3, 2016

2 answers

3

counting semaphore related question
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too? Please justify your answers.

A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too?Please justify your answers.

1.6k views

commented Oct 2, 2016

4 answers

4

Can anyone explain the below question in a detailed way?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is the present(final) value of the binary semaphore mutex?

A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is t...

3.5k views

answered Sep 17, 2016

3 answers

5

Synchronization of two processes using Binary Semaphore_2n_EDITION_HARRIS
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U: Process P: Process Q: P(S) W: P(T) X: P(U) Y: Print ‘a’ Print ‘a’; Print ‘b’ Print &lsquo ... above problem? (a) P(S), P(T) (b) P(T), P(U) (c) P(S), P(U) (d) None

Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U:Process P: Process Q:P(S) ...

1.8k views

answered Sep 17, 2016

10 answers

6

GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______

Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)...

15.9k views

answered Sep 17, 2016

11 answers

7

ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above

Semaphores are used to solve the problem ofRace ConditionProcess SynchronizationMutual ExclusionNone of the aboveI and IIII and IIIAll of the aboveNone of the above

21.6k views

commented Sep 17, 2016

3 answers

8

GATE CSE 2011 | Question: 16, UGCNET-June2013-III: 65
A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? OS ... thread OS does not maintain virtual memory state for each thread OS does not maintain a separate stack for each thread

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to th...

17.3k views

commented Sep 17, 2016

2 answers

9

How many process are created by the program?
int main(){ int i; for(i=0;i<4;i++) fork(); return 0; } in my calculation i think 14 processes will be created including the the parent process. am i right ? Is there any easier method to solve this kind of question ?? please provide the right approach to solve these kind of problems

int main(){ int i; for(i=0;i<4;i++) fork(); return 0; }in my calculation i think 14 processes will be created including the the parent process. am i right ? Is there any ...

4.6k views

answered Sep 16, 2016

3 answers

10

Fork
What is the output and how many child(what is the code of all other child .what they copied from parent give tree diagram) t1=0;t2=0; Fork(); Printf("hi"); t1=Fork(); Printf("hi"); t2=fork(); printf("hi); fork(); printf("hi);

What is the output and how many child(what is the code of all other child .what they copied from parent give tree diagram)t1=0;t2=0;Fork();Printf("hi");t1=Fork();Printf("...

914 views

answered Sep 16, 2016

4 answers

11

Fork
what if the program like this(t1 is copied to all or printf will copied to all child) main() { t1=0,t2=0; t2=fork(); Fork(); Printf("Hi"); Fork(); t1=Fork(); Printf("hi"); } Arjun sir , I don't know the buffer concept.please explain with tree method. How many child and how many time Hi printed.

what if the program like this(t1 is copied to all or printf will copied to all child)main(){t1=0,t2=0;t2=fork();Fork();Printf("Hi");Fork();t1=Fork();Printf("hi");}Arjun s...

1.3k views

answered Sep 16, 2016

2 answers

12

Fork query what will be the effect of t3= -1 here?

724 views

answered Sep 16, 2016

3 answers

13

General Topic Doubt Operating System: Fork
How is the answer coming out to be 32?

How is the answer coming out to be 32?

989 views

answered Sep 16, 2016

7 answers

14

GATE CSE 2013 | Question: 52
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)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$

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 ...

37.7k views

answered Sep 15, 2016

5 answers

15

GATE CSE 2014 Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.

An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...

22.4k views

answered Sep 14, 2016

6 answers

16

GATE CSE 2015 Set 2 | Question: 28
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ isA multiple of 4EvenOddCongruent to 0 $mod$ 4...

13.7k views

commented Jan 18, 2016

2 answers

17

Counting number of articulation points
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check

Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check

1.1k views

commented Jan 18, 2016

2 answers

18

continuity
how to solve it

how to solve it

499 views

answer selected Jan 17, 2016

0 answers

19

Page Table
In a 32-bit machine we subdivide the virtual address into 4 pieces as follows: 8-bit 4-bit 8-bit 12-bit. We use a 3-level page table, such that the first 8 bits are for the first level and so on. Physical addresses are44 bits and ... data segment of 600K starting at address 0x80000000 and a stack segment of 64K starting at address 0xf0000000 and growing upward (towards higher addresses)?

In a 32-bit machine we subdivide the virtual address into 4 pieces as follows:8-bit 4-bit 8-bit 12-bit.We use a 3-level page table, such that the first 8 bits are for the...

569 views

asked Jan 14, 2016

0 answers

20

Page table size
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for the first level and so on. 1. What is the size of a page table ... of 600K starting at address 0x80000000 and a stack segment of 64K starting at address 0xf00000000 and growing upward (like in the PA-RISC of HP)?

In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bitWe use a 3-level page table, such that the first 10-bit are for t...

329 views

asked Jan 14, 2016

2 answers

21

pipeline cycles

441 views

answered Jan 11, 2016

1 answer

22

Speedup
my ans 2.64

my ans 2.64

315 views

asked Jan 10, 2016

1 answer

23

miss ratio

315 views

commented Jan 10, 2016

2 answers

24

RAW hazard

1.4k views

asked Jan 10, 2016

1 answer

25

Outer join

406 views

commented Jan 10, 2016

2 answers

26

co
A computer has a cache, main memory and a hard disk used for virtual memory. If referenced word is in cache, 20 ns are required to access it. If it is in main memory but not in cache 60 ns are needed to load it into cache and then reference is ... memory hit ratio is 0.6. The average time in nano seconds required to access a referenced word on this system is ___________. Solution: 480026

A computer has a cache, main memory and a hard disk used for virtual memory. If referenced word is in cache, 20 ns are required to access it. If it is in main memory but ...

3.2k views

asked Jan 10, 2016

1 answer

27

cardinality

504 views

commented Jan 9, 2016

1 answer

28

blind writes
Consider the following schedule $S1$. $S_{1}: R_{1}(C) R_{2}(C) W_{1}(A) W_{2}(A) W_{1}(C) R_{1}(B) R_{2}(B) W_{1}(B) W_{1}(D) W_{2}(B) W_{2}(D) R_{1}(F) W_{3}(E) R_{3}(F)$ Let $'X'$ be the number of 'blind-write' operations in the given schedule and $'z'$ be the number of conflict equivalent serial schedules to $S_{1}$. The value of $X*Z$ is_________.

Consider the following schedule $S1$.$S_{1}: R_{1}(C) R_{2}(C) W_{1}(A) W_{2}(A) W_{1}(C) R_{1}(B) R_{2}(B) W_{1}(B) W_{1}(D) W_{2}(B) W_{2}(D) R_{1}(F) W_{3}(E) R_{3}(F)...

1.3k views

asked Jan 9, 2016

1 answer

29

B+ tree order

519 views

asked Jan 9, 2016

1 answer

30

consistency in database

274 views

asked Jan 9, 2016

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