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
15271
In COA's sums of hit and miss ratios What configuration we should take, if nothing given in the question?
Hierarchical or Strict Hierarchical
smartmeet
228
views
smartmeet
asked
Jan 11, 2017
CO and Architecture
general
co-and-architecture
+
–
0
votes
0
answers
15272
MadeEasy Subject Test: Theory of Computation - Finite Automata
Its not accepting (10)=2 in decimal
Its not accepting (10)=2 in decimal
Adiaspirant
326
views
Adiaspirant
asked
Jan 11, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
0
answers
15273
parse tree
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative while operator ‘+’ to left associative. What is the parse tree for expression (5 + 2 – 7 + 3 – 4)
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative whi...
Sanket_
159
views
Sanket_
asked
Jan 11, 2017
0
votes
0
answers
15274
TOC Pumping Lemma
In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constraing also. 2N-1>=|W|>=N Can anyone tell me about the use of 2N-1 here ?
In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constrain...
rahul sharma 5
500
views
rahul sharma 5
asked
Jan 11, 2017
Theory of Computation
theory-of-computation
pumping-lemma
pumping
lemma
+
–
0
votes
0
answers
15275
ME Test series
how to solve this?
how to solve this?
S Ram
187
views
S Ram
asked
Jan 11, 2017
0
votes
0
answers
15276
In the following program where is the variable a getting defined and where it is getting declared?
In the following program where is the variable a getting defined and where it is getting declared? #include int main() { extern int a; printf("%d\n", a); return 0; } int a=20; (a) extern int a ... definition (c) int a = 20 is definition, a is not defined (d) a is declared, a is not defined
In the following program where is the variable a getting defined and where it is getting declared?#includeint main(){ extern int a;printf("%d\n", a);return 0;} int a=20;(...
Akriti sood
2.5k
views
Akriti sood
asked
Jan 11, 2017
Programming in C
programming-in-c
+
–
1
votes
0
answers
15277
self doubt
just confused in these things- we are perfoming a/b if we have two INT variables a=6 and b=2 in which scenario we will get answe as 3 3.0 similarly ,if they are float then when will we get 3 3.0 if we have two floats as a=3.2 and b= 1.1 then what will be the answer on division
just confused in these things-we are perfoming a/bif we have two INT variables a=6 and b=2in which scenario we will get answe as 33.0similarly ,if they are float then whe...
Akriti sood
285
views
Akriti sood
asked
Jan 11, 2017
Programming in C
programming-in-c
+
–
0
votes
0
answers
15278
MadeEasy Subject Test: General Aptitude - Number Series
Arnabi
410
views
Arnabi
asked
Jan 11, 2017
Quantitative Aptitude
made-easy-test-series
general-aptitude
number-series
+
–
0
votes
0
answers
15279
Can ny one tell me , stack pointer work independently ?
Can ny one tell me , stack pointer work independently ? means it works locally or it wil increment decrement means change it state by using PC ?
Can ny one tell me , stack pointer work independently ?means it works locally or it wil increment decrement means change it state by using PC ?
Wanted
139
views
Wanted
asked
Jan 11, 2017
2
votes
0
answers
15280
CO important question :: need answer Howw?
An instruction is stored at location 300 with it's address field at location 301, that address field has value 400. A processor register R1 contains the number 200. If Relative addressing mode is used by the instruction ,with R1 as index register then the effective address is _________ .
An instruction is stored at location 300 with it's address field at location 301, that address field has value 400. A processor register R1 contains the number 200. If Re...
Wanted
1.1k
views
Wanted
asked
Jan 11, 2017
0
votes
0
answers
15281
TOC Grammers equivalence
Are the following two grammers equivalent? G1 :-S-> aS | e G2: S-> aaS | e I was reading this question somewhere and it was written that second one is sentential form of first and they are equal,but i dont think so.Second one will generate only even a's but first one is generating every combination of a.Please help
Are the following two grammers equivalent?G1 :-S- aS | eG2: S- aaS | eI was reading this question somewhere and it was written that second one is sentential form of first...
rahul sharma 5
253
views
rahul sharma 5
asked
Jan 11, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
15282
DS-Complexity2
1)Consider the AVL tree with n nodes. The best upper bound on the time required to insert n more elements in given AVL tree is O(na logb n). Then the value of a + 50b is ________. 2) https://gateoverflow.in/1776/gate2014-1_12 -------------- ... or BST. best upper bound= lowest upper bound should be worst case. Then GATE question complexity should be $\Theta (n log n)$ Plz explain
1)Consider the AVL tree with n nodes. The best upper bound on the time required to insert n more elements in given AVL tree is O(na logb n). Then the value of a + 50b is ...
srestha
298
views
srestha
asked
Jan 11, 2017
DS
data-structures
+
–
0
votes
0
answers
15283
testbook
focus _GATE
193
views
focus _GATE
asked
Jan 11, 2017
Compiler Design
testbook-test-series
test-series
compiler-design
+
–
0
votes
0
answers
15284
testbook
focus _GATE
216
views
focus _GATE
asked
Jan 11, 2017
Compiler Design
testbook-test-series
test-series
compiler-design
+
–
1
votes
0
answers
15285
MadeEasy Test Series
How come Ttrans(From A to Link 1) become 16 uS? Shouldn't it be 2 uS?
How come Ttrans(From A to Link 1) become 16 uS? Shouldn't it be 2 uS?
tejas dadhe
372
views
tejas dadhe
asked
Jan 10, 2017
0
votes
0
answers
15286
doubt
Prateek kumar
169
views
Prateek kumar
asked
Jan 10, 2017
Digital Logic
digital-logic
+
–
1
votes
0
answers
15287
What is left in a 4-entry, fully associative, MRU cache
A designer makes a mistake and builds a cache that has a MRU (most recently used) replacement policy instead of an LRU replacement policy. What is left in a 4-entry, fully associative, MRU cache with 1 byte lines after the following address accesses? 1, 2, 3, 4 ... 5, 2 2 2, 5 2, 5, 3 2, 5, 1, 3 please verify this..it will be option D..right??
A designer makes a mistake and builds a cache that has a MRU (most recently used) replacement policy instead of an LRU replacement policy. What is left in a 4-entry, full...
Akriti sood
287
views
Akriti sood
asked
Jan 10, 2017
CO and Architecture
co-and-architecture
+
–
2
votes
0
answers
15288
toc check
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$
focus _GATE
625
views
focus _GATE
asked
Jan 10, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
15289
SSH problem
Anirban Biswas
256
views
Anirban Biswas
asked
Jan 10, 2017
0
votes
0
answers
15290
Threads and Processes
Anirban Biswas
294
views
Anirban Biswas
asked
Jan 10, 2017
0
votes
0
answers
15291
compiler
the need of heap allocation at runtime is a) to support dynamic data structure b)to support dynamic scoping c) to support recursion d) all of the above explain?
the need of heap allocation at runtime is a) to support dynamic data structure b)to support dynamic scoping c) to support recursiond) all of the above explain?
focus _GATE
200
views
focus _GATE
asked
Jan 10, 2017
Compiler Design
compiler-design
test-series
+
–
0
votes
0
answers
15292
cominations
Please explain 1)Out of n non current and non-parallel stright lines point of intersection are 2)In a polygon total no of diagonals out of n points
Please explain1)Out of n non current and non-parallel stright lines point of intersection are 2)In a polygon total no of diagonals out of n points
Atul Verma12
212
views
Atul Verma12
asked
Jan 10, 2017
0
votes
0
answers
15293
is booth's algo for multiplication in syllabus?
S Ram
1.4k
views
S Ram
asked
Jan 10, 2017
0
votes
0
answers
15294
Few Doubts in CN
1. Througput = data size/ TT + 2PT or data size/ 2PT.?? 2. What are the minimum number of interfaces required in a router? 3. Why we have a separate flow control at TCP layer when we already have it in DLL? 4. What is the difference between efficiency of ... the last bit in first octet is 1, then it is multicasting orelse unicast. But mac address is fixed, so, how can we say this?
1. Througput = data size/ TT + 2PT or data size/ 2PT.??2. What are the minimum number of interfaces required in a router?3. Why we have a separate flow control at TCP l...
Lucky sunda
480
views
Lucky sunda
asked
Jan 10, 2017
Computer Networks
computer-networks
+
–
1
votes
0
answers
15295
SQL DBMS
shubhamdarokar
775
views
shubhamdarokar
asked
Jan 10, 2017
Databases
sql
databases
+
–
–1
votes
0
answers
15296
test series
If a grammar is CLR, how can we have any conflict?
If a grammar is CLR, how can we have any conflict?
Adiaspirant
272
views
Adiaspirant
asked
Jan 10, 2017
0
votes
0
answers
15297
Test series
What about empty rules?
What about empty rules?
Adiaspirant
222
views
Adiaspirant
asked
Jan 10, 2017
1
votes
0
answers
15298
How to convert BST to max/min heap in-place ?
Please explain using images how to convert BST into max/min heap in-place . Please explain the complexity of doing so.
Please explain using images how to convert BST into max/min heap in-place .Please explain the complexity of doing so.
Anjana Babu
1.3k
views
Anjana Babu
asked
Jan 10, 2017
Algorithms
algorithms
binary-heap
+
–
0
votes
0
answers
15299
Doubt in pipelining
I1: L R0, loc 1; R0 <= M[loc1] I2: A R0, R0; R0 <= R0 +R0 WB of I1 and ID stage of I2....should be overlapping or not? How to consider this case...as in gate previous questions answers are changing according to the given options?
I1: L R0, loc 1; R0 <= M[loc1]I2: A R0, R0; R0 <= R0 +R0 WB of I1 and ID stage of I2....should be overlapping or not?How to consider this case...as in gate previou...
vaishali jhalani
280
views
vaishali jhalani
asked
Jan 10, 2017
CO and Architecture
pipelining
co-and-architecture
+
–
0
votes
0
answers
15300
Pipelining Doubt
I1: L R0, loc 1; R0 <= M[loc1] I2: A R0, R0; R0 <= R0 +R0 WB of I1 and ID stage of I2....should be overlapping or not? How to consider this case...as in gate previous questions answers are changing according to the given options?
I1: L R0, loc 1; R0 <= M[loc1]I2: A R0, R0; R0 <= R0 +R0 WB of I1 and ID stage of I2....should be overlapping or not?How to consider this case...as in gate previou...
vaishali jhalani
243
views
vaishali jhalani
asked
Jan 10, 2017
CO and Architecture
pipelining
co-and-architecture
+
–
Page:
« prev
1
...
505
506
507
508
509
510
511
512
513
514
515
...
590
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register