Register
Filter

Questions by ManojK

0 votes
1 answer
2
epsilon nfa
(a)I and II only (b) II and Ill only (c)I, II and III only (d)None of the above
(a)I and II only (b) II and Ill only (c)I, II and III only (d)None of the above
2 votes
2 answers
3
Memory management
(a) P3, Ps, P3, P2 (b)P2, P5, P3, 426k waits (c)P3, Ps, P2, 426k waits (d)P4, P2, P5, P3
(a) P3, Ps, P3, P2 (b)P2, P5, P3, 426k waits (c)P3, Ps, P2, 426k waits (d)P4, P2, P5, P3
1 votes
0 answers
4
VirtualGATE2017-1
0 votes
2 answers
6
Virtual Gate Test Series: Compiler Design - Triples
Which of the following is an advantage of $\text{'Triples'}$ Statements can be moved around Wastage of too much space Space is not wasted Two memory access per operation
Which of the following is an advantage of $\text{'Triples'}$Statements can be moved aroundWastage of too much spaceSpace is not wastedTwo memory access per operation
4 votes
2 answers
8
Structure in C
#include <stdio.h> struct Point { int x; int y; }; int main() { struct Point p1 = {10, 20}; struct Point p2 = p1; if (p1 == p2) { printf("p1 and p2 are same "); } getchar(); return 0; } What is the output for the above program ? Explain ?
#include <stdio.h struct Point { int x; int y; }; int main() { struct Point p1 = {10, 20}; struct Point p2 = p1; if (p1 == p2) { printf("p1 and p2 are same "); } getchar(...
0 votes
1 answer
9
Decidability and reducibility
Consider the language given below $L=\left \{ \left \langle M \right \rangle |M\ is\ TM \ and \ |L(M)|\ is\ prime\right \}$ is it deciable or not ? Explain with fact ?
Consider the language given below$L=\left \{ \left \langle M \right \rangle |M\ is\ TM \ and \ |L(M)|\ is\ prime\right \}$ is it deciable or not ? Explain with fact ?
1 votes
1 answer
12
Function in C
All functions have file scope. Thus, you cannot define a function within a function. This is why C is not technically a block-structured language.Explain pls ?
All functions have file scope. Thus, you cannot define a function within a function. This is why C is not technically a block-structured language.Explain pls ?
0 votes
0 answers
13
External variable
By default external variables and functions have the property that all references to them by the same name, even from functions compiled separately, are references to same thing .Explain this ?
By default external variables and functions have the property that all references to them by the same name, even from functions compiled separately, are references to sam...
1 votes
3 answers
14
Algorithm
In an integer array, there is 1 to 100 number, out of one is duplicate, how to find?Write an efficient algorithm and also determine complexity ?
In an integer array, there is 1 to 100 number, out of one is duplicate, how to find?Write an efficient algorithm and also determine complexity ?
4 votes
1 answer
15
Programming
Consider the following program below #include<stdio.h> int *call(); int main(){ int *ptr; ptr=call(); printf("%d",*ptr); return 0; } int * call(){ int x=25; ++x; return &x; } Explain the what the following code is doing ? How to resolve the problem ?
Consider the following program below#include<stdio.h int *call(); int main(){ int *ptr; ptr=call(); printf("%d",*ptr); return 0; } int * call(){ int x=25; ++x; return &x;...
2 votes
1 answer
16
Programming
For the below C code,what will be the output ? #include<stdio.h> int main() { show(); } void show(char *s) { printf("Welcome to Gate Overflow "); } (A)Welcome to Gate Overflow (B)No Output (C)Compilation Error (D)Infinite Loop
For the below C code,what will be the output ?#include<stdio.h int main() { show(); } void show(char *s) { printf("Welcome to Gate Overflow "); }(A)Welcome to Gate Overfl...
1 votes
1 answer
17
Types and Expressions
The qualifier signed or unsigned may be applied to char or any integer.So why does not C have unsigned float ?
The qualifier signed or unsigned may be applied to char or any integer.So why does not C have unsigned float ?
5 votes
3 answers
18
ISRO2016-30
A complete binary tree with $n$ non-leaf nodes contains $\log_{2}n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A complete binary tree with $n$ non-leaf nodes contains$\log_{2}n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
10 votes
2 answers
19
ISRO2016-44
Peephole optimization is form of Loop optimization Local optimization Constant folding Data flow analysis
Peephole optimization is form ofLoop optimizationLocal optimizationConstant foldingData flow analysis
11 votes
3 answers
20
ISRO2016-4
If $(\text{G} , .)$ is a group such that $(ab)^{-1}=a^{-1}b^{-1},\forall a,b \in \text{G},$ then $\text{G}$ is a/an Commutative semi group Abelian group Non-abelian group None of these
If $(\text{G} , .)$ is a group such that $(ab)^{-1}=a^{-1}b^{-1},\forall a,b \in \text{G},$ then $\text{G}$ is a/anCommutative semi groupAbelian groupNon-abelian groupNon...
Page: