Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without an upvoted answer
0
votes
1
answer
14701
How to validate below proposition ?
(p->q) ^ (r->s) ~q OR ~s Conclusion is ~p OR ~r How to see if the conclusion is valid or not ?
(p->q) ^ (r->s)~q OR ~s Conclusion is ~p OR ~r How to see if the conclusion is valid or not ?
radha gogia
219
views
radha gogia
asked
Sep 7, 2018
Mathematical Logic
mathematical-logic
+
–
0
votes
0
answers
14702
Addressing mode
Deepalitrapti
322
views
Deepalitrapti
asked
Sep 7, 2018
CO and Architecture
co-and-architecture
addressing-modes
self-doubt
+
–
0
votes
1
answer
14703
Test series
T(n) = T(root(n)) + n where n>=2 Time complexity ?
T(n) = T(root(n)) + n where n>=2Time complexity ?
syncronizing
644
views
syncronizing
asked
Sep 7, 2018
Algorithms
algorithms
test-series
recurrence-relation
+
–
0
votes
0
answers
14704
Algorithm
How is Σ (1/k * log k) = O( n log n) for k=1 to n?
How is Σ (1/k * log k) = O( n log n) for k=1 to n?
Nidhi Budhraja
340
views
Nidhi Budhraja
asked
Sep 7, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
+
–
0
votes
0
answers
14705
Gate Application Form Doubt
Hi Friend , I have made mistake in College Name section while filling the form: Given Kalyani Government Engineering instead of Kalyani Government Engineering College . Do any one have any idea on, how I can correct the college name or is it create any problem? Please help me,
Hi Friend , I have made mistake in College Name section while filling the form: Given Kalyani Government Engineering instead of Kalyani Government Engineering Colle...
ben10
233
views
ben10
asked
Sep 7, 2018
0
votes
0
answers
14706
SELF DOUBT CO
https://gateoverflow.in/318/gate2004-47 I AM DOING IT LIKE THAT 100+TLB HIT (TLB ACCESS TYM+ 2 MEMORY ACCESS)+TLB MISS(PAGE FAULT(PAGE FAULT SERVICE TIME )+PAGE HIT(TLB ACCESS+TWO PAGE TABLE ACCESS +2 MEMORY ACCESS) 100+0.90(0+2*150)+(1-0.90)((1/10000)*8000000+(1-1/10000)*(0+150+150+2*150)) 510 SO DOUBT IS THAT WHY THEY NOT INCLUDED PAGE HIT CASE IN THE CASE OF TLB MISS ??
https://gateoverflow.in/318/gate2004-47I AM DOING IT LIKE THAT 100+TLB HIT (TLB ACCESS TYM+ 2 MEMORY ACCESS)+TLB MISS(PAGE FAULT(PAGE FAULT SERVICE TIME )+PAGE HIT(TLB AC...
eyeamgj
184
views
eyeamgj
asked
Sep 7, 2018
0
votes
0
answers
14707
Predict the output and give explanation
#include <stdio.h> int main(void) { int i=10; printf(" %d %d %d",i==10,i=40,i>15 ); } Concepts undefined behavior floating point representation
#include <stdio.h>int main(void) { int i=10; printf(" %d %d %d",i==10,i=40,i>15 );} Conceptsundefined behaviorfloating point representation
pC
580
views
pC
asked
Sep 7, 2018
Programming in C
programming-in-c
+
–
0
votes
0
answers
14708
My doubt
In slotted aloha.....let p = probability with each node wants to send data and transmit in an idle slot Total no of hosts =n Probability of a particular host send data in idle slot ,,let say X = p * (1-p)^n-1 Can anyone explain what is the actual meaning ... throughput whose unit is frames / sec is equal to X which is probability with no unit..... Please explain it......thanks in advance..
In slotted aloha.....let p = probability with each node wants to send data and transmit in an idle slotTotal no of hosts =nProbability of a particular host send data in i...
Ritam Biswas 1
244
views
Ritam Biswas 1
asked
Sep 7, 2018
0
votes
1
answer
14709
regular expression
True/False? (0+1)*(0+1)(0+1)* = (0+1)* If it is true then please explain briefly?
True/False?(0+1)*(0+1)(0+1)* = (0+1)*If it is true then please explain briefly?
Siddharth Bhardawaj
369
views
Siddharth Bhardawaj
asked
Sep 7, 2018
0
votes
1
answer
14710
K-MAP
saumya mishra
375
views
saumya mishra
asked
Sep 7, 2018
0
votes
0
answers
14711
Series
Could anyone pls help me to solve this series ?
Could anyone pls help me to solve this series ?
Raghav Khajuria
296
views
Raghav Khajuria
asked
Sep 6, 2018
0
votes
1
answer
14712
Page fault : self doubt
A demand paging system takes 100 units time to service a page fault and 300 units to replace a dirty page. Memory access time is 1 unit.the probability of page fault is p.In case of page fault; the probability of page is being dirty is also p.if EMAT is 3 time units then the value of p? (A .194 (B .233 (C .514 (D .981 I got = 0.0194 pls anybody explain me ?
A demand paging system takes 100 units time to service a page fault and 300 units to replace a dirty page. Memory access time is 1 unit.the probability of page fault is ...
Aks9639
475
views
Aks9639
asked
Sep 6, 2018
Operating System
operating-system
+
–
0
votes
1
answer
14713
Tricky question
The function f(x) = |x – 2| + |2.5 – x| + |3.6 – x|, where x is a real number, attains a minimum at? x = 2.3 x = 2.5 x = 2.7 none of the above.
The function f(x) = |x – 2| + |2.5 – x| + |3.6 – x|, where x is a real number, attains a minimum at?x = 2.3x = 2.5x = 2.7none of the above.
Lakshman Bhaiya
508
views
Lakshman Bhaiya
asked
Sep 6, 2018
Quantitative Aptitude
general-aptitude
+
–
2
votes
1
answer
14714
Algorithms timeComplexity
It answer is given as A but according to me answer should be C. Please help
It answer is given as A but according to me answer should be C.Please help
I_am_winner
518
views
I_am_winner
asked
Sep 6, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
+
–
0
votes
0
answers
14715
MY BOOK
T(n)=√nT(√)n+$2^{n}$ time complexity
T(n)=√nT(√)n+$2^{n}$ time complexity
amit166
245
views
amit166
asked
Sep 6, 2018
Algorithms
algorithms
+
–
0
votes
1
answer
14716
Algorithms Questions
f(n)>=c1.n h(n)=c2.n then why answer cant be O(n),It is given as C
f(n)>=c1.nh(n)=c2.nthen why answer cant be O(n),It is given as C
I_am_winner
367
views
I_am_winner
asked
Sep 6, 2018
Algorithms
algorithms
asymptotic-notation
test-series
+
–
0
votes
1
answer
14717
algorithms
I_am_winner
234
views
I_am_winner
asked
Sep 6, 2018
Algorithms
asymptotic-notation
test-series
+
–
0
votes
1
answer
14718
questions
Q.which give unique BST ? 1.level order and pre-order 2.level order and post-order 3.level order and in-order 4.all of these 5.none of these
Q.which give unique BST ?1.level order and pre-order2.level order and post-order3.level order and in-order4.all of these5.none of these
amit166
162
views
amit166
asked
Sep 6, 2018
0
votes
1
answer
14719
ds book
Consider an array A in which upto some index I , integers are stored and after that NULL values are stored. Let the size of array be n, then the time taken to find the value of I is : 1.O(n) 2.O(n^2) 3.O(logn) 4.O(loglogn)
Consider an array A in which upto some index I , integers are stored and after that NULL values are stored. Let the size of array be n, then the time taken to find the va...
amit166
599
views
amit166
asked
Sep 6, 2018
0
votes
1
answer
14720
bookk
Solution of $T(n)=\sqrt{n}T(\sqrt{n})+n$
Solution of $T(n)=\sqrt{n}T(\sqrt{n})+n$
amit166
355
views
amit166
asked
Sep 6, 2018
Algorithms
recurrence-relation
reference-book
+
–
0
votes
1
answer
14721
#Test series
what is the output?
what is the output?
himgta
445
views
himgta
asked
Sep 6, 2018
0
votes
0
answers
14722
How to convert below E-R Model into relational model ?
radha gogia
420
views
radha gogia
asked
Sep 6, 2018
Databases
databases
er-to-relational
+
–
0
votes
0
answers
14723
toc 2005
Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production. E → number E.val = number. val | E '+' E E(1).val = E(2).val + E(3).val | E ' ' E E(1).val = ... of a shift over a reduce action (D). It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift action
Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production.E → number E.val = number. val | E...
turendar
461
views
turendar
asked
Sep 6, 2018
Theory of Computation
usergate2005
usermod
+
–
0
votes
0
answers
14724
SELF DOUBT
https://gateoverflow.in/1516/gate1999-17 HERE HOW COMPARISION IS DONE AND BIT IS SET ...BECZ AS I KNOW THE COMPARISION INVOKES SUBTRACTION AND IF THE RESULT IS ZERO THEN FLAG IS SET TO 1 ......THEN THIS QUESTION ASKING TO BE THE RESULT OF THEIR DIFFERENCE ZERO FOR JUMPING TO Y OR THE FLAG SHOULD BE ZRO TO JUMP TO Y????
https://gateoverflow.in/1516/gate1999-17HERE HOW COMPARISION IS DONE AND BIT IS SET ...BECZ AS I KNOW THE COMPARISION INVOKES SUBTRACTION AND IF THE RESULT IS ZERO THEN F...
eyeamgj
497
views
eyeamgj
asked
Sep 6, 2018
0
votes
0
answers
14725
ME TEST SERIES QUESTION Compiler Design.
I am getting 5 as answer. I am not getting the solution approach? How did sign of A of production 5 get 0?
I am getting 5 as answer.I am not getting the solution approach? How did sign of A of production 5 get 0?
aoao
188
views
aoao
asked
Sep 6, 2018
0
votes
0
answers
14726
Test pipleine
The 4 stage pipeline has stage reliability of .8,.9,.7,.8 The maximum reliability of pipeline system is
The 4 stage pipeline has stage reliability of .8,.9,.7,.8The maximum reliability of pipeline system is
priyanka manwani
124
views
priyanka manwani
asked
Sep 6, 2018
0
votes
0
answers
14727
Operating System Multilevel Paging
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bi 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. Page Table Entry Size is 2B 10-bit 8- ... page size which is 2^8 so outer most page cannot fit in one page table But outermost page table should fit in one page ?? ref:
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bi 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit ar...
jatin khachane 1
946
views
jatin khachane 1
asked
Sep 6, 2018
Operating System
paging
memory-management
+
–
0
votes
0
answers
14728
Limit
abhishekmehta4u
226
views
abhishekmehta4u
asked
Sep 6, 2018
0
votes
0
answers
14729
Normalization
If Relation R is in 3NF but not BCNF then R must contain prime attribute- > prime attribute True or false
If Relation R is in 3NF but not BCNF then R must contain prime attribute- prime attribute True or false
Priyanka Agarwal
307
views
Priyanka Agarwal
asked
Sep 6, 2018
0
votes
1
answer
14730
Cache
Shivangi Parashar 2
590
views
Shivangi Parashar 2
asked
Sep 6, 2018
CO and Architecture
cache-memory
+
–
Page:
« prev
1
...
486
487
488
489
490
491
492
493
494
495
496
...
1006
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register