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 answers
0
votes
0
answers
15871
1.You are in a game show! There are 10 closed doors, 0 leads to nothing and 1 leads to an expensive sports car.
Q.You are in a game show! There are 10 closed doors, 0 leads to nothing and 1 leads to an expensive sports car. You are allowed to pick a door and earn the sports car if ...
Akriti sood
1.1k
views
Akriti sood
asked
Nov 24, 2016
Probability
probability
+
–
1
votes
0
answers
15872
Doubt on primary indexing and clustred index.
I have read this. - Clustered index are those in which data is arranged on fields so that it act as an index. like the phonebook. And in non-clustered index we make a new index outside and data and indexes are at different places ... a clustred index then what is clustred index that states that make a entry for unique keys only. Are they both the same?
I have read this. -Clustered index are those in which data is arranged on fields so that it act as an index. like the phonebook. And in non-clustered index we make a new...
Tendua
650
views
Tendua
asked
Nov 24, 2016
Databases
indexing
databases
+
–
0
votes
0
answers
15873
Cache Coherence problem and how it can be solved?
Cache Coherence problem and how it can be solved please explain
Cache Coherence problem and how it can be solved please explain
LavTheRawkstar
424
views
LavTheRawkstar
asked
Nov 24, 2016
CO and Architecture
co-and-architecture
+
–
–4
votes
0
answers
15874
Morge sort the array 9,6,5,0,8,2
Amit parida
230
views
Amit parida
asked
Nov 24, 2016
1
votes
0
answers
15875
Self Made
We get a Page Fault if the valid/invalid bit in Page Table is 0, which means 1 memory access to see the page table. In case of page fault we service the page fault and then access the page from main memory (1 memory access time), else we directly access the page from main ... = (1 - p) x 2 x memory access time + p (page fault service time + 2 x memory access time). What am i missing?
We get a Page Fault if the valid/invalid bit in Page Table is 0, which means 1 memory access to see the page table.In case of page fault we service the page fault and the...
Samujjal Das
196
views
Samujjal Das
asked
Nov 23, 2016
1
votes
0
answers
15876
Multiple options may be correct
thor
417
views
thor
asked
Nov 23, 2016
Algorithms
algorithms
+
–
1
votes
0
answers
15877
DBMS Question
Is Nested loop join a part of GATE SYLLABUS this year
Is Nested loop join a part of GATE SYLLABUS this year
Shivangi Verma
533
views
Shivangi Verma
asked
Nov 23, 2016
1
votes
0
answers
15878
Urgent- Memory management
Can someone please tell me the resource to study memory management. I am finding difficulty to solve the numerical on multilevel paging and segmentation.
Can someone please tell me the resource to study memory management. I am finding difficulty to solve the numerical on multilevel paging and segmentation.
cse7
223
views
cse7
asked
Nov 23, 2016
Operating System
memory-management
operating-system
+
–
1
votes
0
answers
15879
self doubt related to program counter
As PC points to the next instruction to be executed. When the last instruction will execute , What will be the value of program counter?
As PC points to the next instruction to be executed.When the last instruction will execute , What will be the value of program counter?
vaishali jhalani
373
views
vaishali jhalani
asked
Nov 23, 2016
CO and Architecture
co-and-architecture
+
–
1
votes
0
answers
15880
output
I think this program will show undefined behaviour as a is changing more than once in a expression .correct me if i am wrong?
I think this program will show undefined behaviour as a is changing more than once in a expression .correct me if i am wrong?
Sanket_
383
views
Sanket_
asked
Nov 23, 2016
2
votes
0
answers
15881
MadeEasy Test Series: Compiler Design - Syntax Directed Translation
I think we can not traverse the tree..because it is not a valid SDT, A is taking value from sign. Correct me if i am wring.
I think we can not traverse the tree..because it is not a valid SDT, A is taking value from sign.Correct me if i am wring.
vaishali jhalani
614
views
vaishali jhalani
asked
Nov 23, 2016
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
2
votes
0
answers
15882
tag directory
Where the tag directory is present for a particular cache?
Where the tag directory is present for a particular cache?
vaishali jhalani
364
views
vaishali jhalani
asked
Nov 23, 2016
CO and Architecture
co-and-architecture
cache-memory
+
–
2
votes
0
answers
15883
#doubt
Q its decidable or not?? ---> The set of all TM's that accept same language by visiting at most 100 distinct tape cells
Q its decidable or not?? - The set of all TM's that accept same language by visiting at most 100 distinct tape cells
Hradesh patel
296
views
Hradesh patel
asked
Nov 23, 2016
1
votes
0
answers
15884
MadeEasy Test Series: Compiler Design - Syntax Directed Translation
vaishali jhalani
567
views
vaishali jhalani
asked
Nov 23, 2016
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
1
votes
0
answers
15885
DAg for this wil be _________
LavTheRawkstar
260
views
LavTheRawkstar
asked
Nov 23, 2016
Compiler Design
compiler-design
+
–
1
votes
0
answers
15886
#dout
check for which is regular?? (B). where i+j+k>100 & k>50 (C). where i+j+k>100 & j+k>50
check for which is regular??(B). where i+j+k>100 & k>50(C). where i+j+k>100 & j+k>50
Hradesh patel
250
views
Hradesh patel
asked
Nov 23, 2016
1
votes
0
answers
15887
GATEBOOK
There are 5 bins labelled 1,2,3,4,5. Now there are 5 numbers 1,2,3,4,5. How many combinations exist such that 1,2,3 all arent at proper place? Now, we can easily solve using inclusion-exclusion principle. But, sometimes this principle counts duplicates ... which always gives correct answers. This is the first problem where I am not able to set up a recurrance relation. Could anyone help?
There are 5 bins labelled 1,2,3,4,5. Now there are 5 numbers 1,2,3,4,5. How many combinations exist such that 1,2,3 all arent at proper place?Now, we can easily solve usi...
Sushant Gokhale
654
views
Sushant Gokhale
asked
Nov 23, 2016
Combinatory
discrete-mathematics
combinatory
+
–
1
votes
0
answers
15888
MIT QUIZs 2009
Topological sort can be performed using one breadth-first search procedure on the graph?? ans) False. why? as both are DFS and BFS can do it in O(v+e) time
Topological sort can be performed using one breadth-first search procedure on the graph??ans) False. why? as both are DFS and BFS can do it in O(v+e) time
2018
424
views
2018
asked
Nov 23, 2016
Algorithms
topological-sort
+
–
0
votes
0
answers
15889
Need help
Here the exact answer should be 0.01*(10+50) + 0.99*10 = 10.6. ?? And By default we always consider hierarchial access or direct access.
Here the exact answer should be 0.01*(10+50) + 0.99*10 = 10.6. ??And By default we always consider hierarchial access or direct access.
thor
229
views
thor
asked
Nov 23, 2016
0
votes
0
answers
15890
Database
1. W1(x),R2(x),W1(x),commit2,commit1 2. W1(x),R2(x),W1(x),commit2,Rollback1 Are these schedules view serializable ??
1. W1(x),R2(x),W1(x),commit2,commit12. W1(x),R2(x),W1(x),commit2,Rollback1Are these schedules view serializable ??
papesh
222
views
papesh
asked
Nov 22, 2016
0
votes
0
answers
15891
What are the important topics of TOC?
I have started GATE preparation today, I am not comfortable with Theory of computation, Compiler design and COA, please provide me list of topics which have highest mark distribution and should be concentrated
I have started GATE preparation today, I am not comfortable with Theory of computation, Compiler design and COA, please provide me list of topics which have highest mark ...
PieChuckerr
1.4k
views
PieChuckerr
asked
Nov 22, 2016
Theory of Computation
theory-of-computation
compiler-design
co-and-architecture
+
–
0
votes
0
answers
15892
Operating System: Deadlock
Samujjal Das
195
views
Samujjal Das
asked
Nov 22, 2016
1
votes
0
answers
15893
Write_TS(X) in basic timestamp ordering
Say, when write_item(x) is executed; at that time, then write_TS(X) is not set to TS(T); and after write_item(x) is executed the process gets pre-empted. In that scenario won't the two values be different?(as write_TS(X) still contains the previoius TS(T))
Say, when write_item(x) is executed; at that time, then write_TS(X) is not set to TS(T); and after write_item(x) is executed the process gets pre-empted. In that scenario...
prasitamukherjee
528
views
prasitamukherjee
asked
Nov 22, 2016
Databases
databases
+
–
3
votes
0
answers
15894
Kenneth Rosen Edition 6th Exercise 8.2 Question 26 (Page No. 553)
For which values of n are these graphs bipartite ? 1. $K_n$ 2. $C_n$ 3. $W_n$ 4. $Q_n$
For which values of n are these graphs bipartite ?1. $K_n$2. $C_n$3. $W_n$4. $Q_n$
dd
5.3k
views
dd
asked
Nov 22, 2016
Graph Theory
discrete-mathematics
kenneth-rosen
graph-theory
graph-connectivity
+
–
–2
votes
0
answers
15895
Probability
monty
287
views
monty
asked
Nov 22, 2016
1
votes
0
answers
15896
graph theory
Which of the following statements is/are TRUE? [P] Every disconnected graph has an isolated vertex [Q] A graph is connected if and only if some vertex is connected to all other vertices [R] The edge set of every closed trail can be partitioned into edge sets of cycles [S] If a maximal trail in a graph is not closed, then its endpoints have odd degree
Which of the following statements is/are TRUE?[P] Every disconnected graph has an isolated vertex[Q] A graph is connected if and only if some vertex is connected to all o...
Akriti sood
442
views
Akriti sood
asked
Nov 22, 2016
Graph Theory
graph-theory
graph-connectivity
discrete-mathematics
+
–
1
votes
0
answers
15897
memory accessing
https://gateoverflow.in/8119/gate2015-2_24 https://gateoverflow.in/2078/gate2014-3_44 in both these question how we confirmed that we are accessing the memory simultaneously not one after other and these type of questions are fill in the blank type then which one to take
https://gateoverflow.in/8119/gate2015-2_24https://gateoverflow.in/2078/gate2014-3_44in both these question how we confirmed that we are accessing the memory simultaneousl...
Rahul Singhal
190
views
Rahul Singhal
asked
Nov 22, 2016
0
votes
0
answers
15898
output of SDT
vaishali jhalani
399
views
vaishali jhalani
asked
Nov 22, 2016
Compiler Design
compiler-design
+
–
0
votes
0
answers
15899
What do you interpret from question?
It took me hell a lot of time. Still cann't figure out question??
It took me hell a lot of time. Still cann't figure out question??
thor
245
views
thor
asked
Nov 22, 2016
Programming in C
hashing
+
–
0
votes
0
answers
15900
Programming Doubt
thor
211
views
thor
asked
Nov 21, 2016
Programming in C
programming-in-c
wrong-choices
+
–
Page:
« prev
1
...
525
526
527
528
529
530
531
532
533
534
535
...
590
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register