Register
Filter

Questions by Arjun

1 votes
3 answers
1321
NIELIT 2018-80
_____ traversals are not sufficient to build a binary tree. Preorder and Inorder Postorder and Inorder Postorder and Preorder None of these
_____ traversals are not sufficient to build a binary tree.Preorder and InorderPostorder and InorderPostorder and PreorderNone of these
1 votes
3 answers
1323
NIELIT 2018-82
Identify the true statement from the given statements. Program relocation at run time requires transfer complete block to some memory locations requires both base address and relative address requires only absolute address $1$ $1$ and $2$ $1$ , $2$ and $3$ $1$ and $3$
Identify the true statement from the given statements. Program relocation at run timerequires transfer complete block to some memory locationsrequires both base address a...
2 votes
1 answer
1324
NIELIT 2018-83
In the Given language $L=\{ab, aa, baaa\}$, ____ number of strings are in $L^*$ baaaba aabaaaa baaabaaaabaa baaabaaa $1$ $2$ $3$ $4$
In the Given language $L=\{ab, aa, baaa\}$, ____ number of strings are in $L^*$baaabaaabaaaabaaabaaaabaabaaabaaa $1$$2$$3$$4$
2 votes
3 answers
1325
NIELIT 2018-84
For the given nodes: $89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$ minimum ______ number of interchanges are required to convert it into a max-heap. $3$ $4$ $5$ $6$
For the given nodes:$89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$minimum ______ number of interchanges are required to convert it into a max-heap.$3$$4$$5$$6$
1 votes
3 answers
1326
NIELIT 2018-85
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8-$ is $192$ $190$ $110$ $92$
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8-$ is$192$$190$$110$$92$
13 votes
4 answers
1327
GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...
1 votes
2 answers
1332
GATE Suitability Test | Test 1 | Question: 5
In a group of 11 people what is the probability that exactly two people have birthday on same day ?
In a group of 11 people what is the probability that exactly two people have birthday on same day ?
1 votes
0 answers
1338
GATE Suitability Test | Test 1 | Question: 11
Consider the following C program? void mystery(int n){ if(n<=0) return; printf("%d", 0); mystery(n-1); mystery(n-2); } int main(){ int n=10; mystery(n); return 0; } The number of ‘0’s printed by above program is ?
Consider the following C program?void mystery(int n){ if(n<=0) return; printf("%d", 0); mystery(n-1); mystery(n-2); } int main(){ int n=10; mystery(n); return 0; }The num...
1 votes
0 answers
1339
GATE Suitability Test | Test 1 | Question: 12
There are 8 students, each of them is asked to choose a letter from A to Z. How many different ways they can choose the letters such that the selected letters can form GATEBOOK word (If properly arranged)?
There are 8 students, each of them is asked to choose a letter from A to Z. How many different ways they can choose the letters such that the selected letters can form G...
5 votes
2 answers
1340
ISRO2018-1
Consider the following program { int x=1; printf("%d",(*char(char*)&x)); } Assuming required header files are included and if the machine in which this program is executed is little endian, then the output will be 0 99999999 1 unpredictable
Consider the following program{ int x=1; printf("%d",(*char(char*)&x)); }Assuming required header files are included and if the machine in which this program is executed ...
Page: