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
is thiz valid code
#include<Stdio.h> main() { int *a[10]; *a[0]=323; printf("%d",*a); } // i m getting error what is error here ?
#include<Stdio.h>main(){ int *a[10]; *a[0]=323; printf("%d",*a);}// i m getting error what is error here ?
Wanted
610
views
Wanted
asked
Jan 12, 2017
0
votes
0
answers
15272
Single Level Directory
A single level directory stuctue based file system. The directory occupies 4 disk blocks . File system support maximum of 2k files and each file in directory uses 32 bits if each disk block is addressed with 16 bits then maximm possible file size in this file system is ___MB
A single level directory stuctue based file system. The directory occupies 4 disk blocks . File system support maximum of 2k files and each file in directory uses 32 bits...
Anjana Babu
766
views
Anjana Babu
asked
Jan 12, 2017
Operating System
operating-system
+
–
0
votes
0
answers
15273
Can we use string inside switch statement?
Wanted
200
views
Wanted
asked
Jan 12, 2017
0
votes
0
answers
15274
Decidability in CFG
As we know that equivalence in CSL is undecidable,so if i want to look for Non-equivalence,then will it be complement of this and answer will be NOT RE or will it be RE BUT NOT REC. Similarly for disjointness test,if i say i want to see if some string is common in two CFG,will it be RE BUT NOT REC or NOT RE
As we know that equivalence in CSL is undecidable,so if i want to look for Non-equivalence,then will it be complement of this and answer will be NOT RE or will it be RE B...
rahul sharma 5
1.0k
views
rahul sharma 5
asked
Jan 12, 2017
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
0
answers
15275
Virtual Gate Test Series: Theory Of Computation - Context Sensitive Grammar
How can L(G) be regular? If we derive bSb --> bAcAb, now we have Ab-->b but we do not have the production bA since G is all production except last. So there is no production for A or bA. How can we go further?
How can L(G) be regular?If we derive bSb bAcAb, now we have Ab >b but we do not have the production bA since G is all production except last. So there is no production ...
Purple
423
views
Purple
asked
Jan 12, 2017
Theory of Computation
theory-of-computation
context-sensitive
grammar
virtual-gate-test-series
+
–
0
votes
0
answers
15276
Are these languages NP-complete
GateAspirant999
298
views
GateAspirant999
asked
Jan 11, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
0
answers
15277
NUMBER SYSTEM FLOATING POINT
IN FLOATING POINT REPRESENTATION WE KNOW THAT BIAS ADDED IS THE MAXIMUM NUMBER WHICH CAN BE REPRESENTED IN 2S COMPLEMENT. Suppose exponent is represented using 8 bits, so bias added= (2^7)-1=127. But the max negative number representable with 8 bits ... So how do we get postitive exponent by biassing in this case??. It sounds confusing to me. Plz resolve my confusion.
IN FLOATING POINT REPRESENTATION WE KNOW THAT BIAS ADDED IS THE MAXIMUM NUMBER WHICH CAN BE REPRESENTED IN 2S COMPLEMENT.Suppose exponent is represented using 8 bits, so ...
sushmita
1.0k
views
sushmita
asked
Jan 11, 2017
Digital Logic
floating-point-representation
digital-logic
number-representation
+
–
0
votes
0
answers
15278
LL1 parsing
Consider the following grammar : S →(S) | ε Consider an instant where while parsing the string “(())” Top of stack: S Input pointer: ) The operation performed at this point is? S is popped off S is kept as it is. S is kept as it is and the input pointer is incremented None of these.
Consider the following grammar :S →(S) | εConsider an instant where while parsing the string “(())”Top of stack: SInput pointer: )The operation performed at this p...
Anirban Biswas
681
views
Anirban Biswas
asked
Jan 11, 2017
0
votes
0
answers
15279
TEST SERIES
Why option (c) is non regular as I can write it as [a(a+b)+(a+b)+a]+[b(a+b)+(a+b)+b]
Why option (c) is non regular as I can write it as [a(a+b)+(a+b)+a]+[b(a+b)+(a+b)+b]
Adiaspirant
288
views
Adiaspirant
asked
Jan 11, 2017
0
votes
0
answers
15280
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
232
views
smartmeet
asked
Jan 11, 2017
CO and Architecture
general
co-and-architecture
+
–
0
votes
0
answers
15281
MadeEasy Subject Test: Theory of Computation - Finite Automata
Its not accepting (10)=2 in decimal
Its not accepting (10)=2 in decimal
Adiaspirant
335
views
Adiaspirant
asked
Jan 11, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
0
answers
15282
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_
162
views
Sanket_
asked
Jan 11, 2017
0
votes
0
answers
15283
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
513
views
rahul sharma 5
asked
Jan 11, 2017
Theory of Computation
theory-of-computation
pumping-lemma
pumping
lemma
+
–
0
votes
0
answers
15284
ME Test series
how to solve this?
how to solve this?
S Ram
191
views
S Ram
asked
Jan 11, 2017
0
votes
0
answers
15285
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.6k
views
Akriti sood
asked
Jan 11, 2017
Programming in C
programming-in-c
+
–
1
votes
0
answers
15286
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
298
views
Akriti sood
asked
Jan 11, 2017
Programming in C
programming-in-c
+
–
0
votes
0
answers
15287
MadeEasy Subject Test: General Aptitude - Number Series
Arnabi
417
views
Arnabi
asked
Jan 11, 2017
Quantitative Aptitude
made-easy-test-series
general-aptitude
number-series
+
–
0
votes
0
answers
15288
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
147
views
Wanted
asked
Jan 11, 2017
2
votes
0
answers
15289
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
15290
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
272
views
rahul sharma 5
asked
Jan 11, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
15291
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
307
views
srestha
asked
Jan 11, 2017
DS
data-structures
+
–
0
votes
0
answers
15292
testbook
focus _GATE
199
views
focus _GATE
asked
Jan 11, 2017
Compiler Design
testbook-test-series
test-series
compiler-design
+
–
0
votes
0
answers
15293
testbook
focus _GATE
222
views
focus _GATE
asked
Jan 11, 2017
Compiler Design
testbook-test-series
test-series
compiler-design
+
–
1
votes
0
answers
15294
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
391
views
tejas dadhe
asked
Jan 10, 2017
0
votes
0
answers
15295
doubt
Prateek kumar
175
views
Prateek kumar
asked
Jan 10, 2017
Digital Logic
digital-logic
+
–
1
votes
0
answers
15296
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
302
views
Akriti sood
asked
Jan 10, 2017
CO and Architecture
co-and-architecture
+
–
2
votes
0
answers
15297
toc check
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$
focus _GATE
672
views
focus _GATE
asked
Jan 10, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
15298
SSH problem
Anirban Biswas
264
views
Anirban Biswas
asked
Jan 10, 2017
0
votes
0
answers
15299
Threads and Processes
Anirban Biswas
307
views
Anirban Biswas
asked
Jan 10, 2017
0
votes
0
answers
15300
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
212
views
focus _GATE
asked
Jan 10, 2017
Compiler Design
compiler-design
test-series
+
–
Page:
« prev
1
...
505
506
507
508
509
510
511
512
513
514
515
...
591
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register