Profile

Cover photo
Verified local business
GATE Overflow
Educational Consultant
Today 1–11PM
462 followers|336,267 views
AboutPostsPhotosVideos

Stream

GATE Overflow

Shared publicly  - 
 
Ace test series - Which of the following scheduling algorithms can cause indefinite blocking of a process? a>FIFO b>SRTF c>Round Robin d>Priority scheduling   According to me answer should be B and D.Am I correct??
Which of the following scheduling algorithms can cause indefinite blocking of a process? a>FIFO b>SRTF ... answer should be B and D.Am I correct??
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
operator grammer
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
precedence in grammer
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
Rosen Exercise problem - 1. What is good for corporations is good for the United States. 2. What is good for the United States is good for you. 3. What is good for the corporations is for you to buy lots of stuf   What are the valid conclusions?Please explain the solution
1. What is good for corporations is good for the United States. 2. What is good for ... What are the valid conclusions?Please explain the solution
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
Answered: maths:: can ny mathematician find out lub and gub in following ones with possible sets
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
GATE1988-12iib - Using Armstrong’s axioms of functional dependency derive the following rules: $\{ x \rightarrow y. \: wy \rightarrow z \} = xw \rightarrow z$ (Note: $x \rightarrow y$ denotes $y$ is functionally dependenet on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).
Using Armstrong's axioms of functional dependency derive the following rules: $\{ x \rightarrow y. \: wy ... of $y$, and $\mid =$ means derives).
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
complexity - Which of the following is correct? a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n)))  b)If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n)) c)Both (a) and (b) d)None of the above ans given is b) but there is nothing given about functions so it is possible that there is some function like-. f(n)=n and g(n)=n^(2*sinn) then we cannot say  anything  i think it should  be d)
Which of the following is correct? a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) ... *sinn) then we cannot say anything i think it should be d)
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
Doubt - What is Dijkstra's algorithm running time using sorted array?
What is Dijkstra's algorithm running time using sorted array?
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
Answered: GATE2013_41 - There is an algorithm to check whether the given CFG is empty, finite or infinite and also to convert NFA to DFA hence 1 and 4 are decidable
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
GATE1988-17i-ii-iii - The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods at the origins and the requirements at the destinations.  The transportation problem implied by this table can also be written in the form $$\text{minimize} \: \: \underline{c} \: ^T \: \underline{x}$$ $$\text{subject to :}  \: \: Ax= \underline{b}$$ $$ \underline{x} \geq 0$$ Display $\underline{c} \:...
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
Answered: Multiple Links between S & D1.1 - Propagation delay  $\approx$ 1ms Transmission delay for packet of 1000 bits = 1ms Now, consider a pipeline (as in Computer organization) with 8 stages(5  transmissions at source, destination and routers; 3 for propagation delays) with single stage delay of 1 ms(stage delay dictated by longest stage). So, total time = 999 stages(1 stage of each instriction except the last) + 8 stages(due to last instruction)                         = 1007 ms
1
Add a comment...

GATE Overflow

Shared publicly  - 
 
maths doubt - what is wrong here? let A={1,2} (i) 1 belong to A (ii) 1 is a subset  of A (iii) 1 is a proper subset of A
what is wrong here? let A={1,2} (i) 1 belong to A (ii) 1 is a subset of A (iii) 1 is a proper subset of A
1
Add a comment...
Contact Information
Map of the business location
Pettah - Venpalavattom Rd, Anayara Thiruvananthapuram, Kerala 695029 India
Pettah - Venpalavattom RoadINKeralaThiruvananthapuram695029
+91 99456 75693gateoverflow.in
Educational ConsultantToday 1–11PM
Wednesday 1–11PMThursday 1–11PMFriday 1–11PMSaturday ClosedSunday ClosedMonday 1–11PMTuesday 1–11PM
Google+ URL
Your Activity
Write a review
Review Summary
2 reviews
Photos
Scrapbook photo 2
Scrapbook photo 3
Upload public photo