Register
Filter

Recent activity by gate_forum

1 answer
1
Max heap
Conversion of binary search tree into a Max heap takes: O(n) time O(nlog n) time None
Conversion of binary search tree into a Max heap takes:O(n) timeO(nlog n) timeNone
0 answers
2
Trees
StateTrue/False: Conversion of Max heap into a binary search tree takes O(n) time.
StateTrue/False:Conversion of Max heap into a binary search tree takes O(n) time.
1 answer
3
Complexity
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum is O(1) O(n) None
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum isO(1)O(n)None
0 answers
4
boolean functions
1 2 3 4
1234
1 answer
6
processor performance
insufficient info p2 p1
insufficient infop2p1
1 answer
7
toplogical sort
none
none
0 answers
9
TLB misses
1 2 2048 none
122048none
2 answers
10
permutation and combination
1 2 10 16
121016
0 answers
11
Data Hazards
B. C. D.
B. C. D.
1 answer
12
Child Process Semantics
100 100 100 100 200 200 200 200 none 100 100 200 200
100 100 100 100200 200 200 200none100 100 200 200
0 answers
13
Error detection
https://gateoverflow.in/?qa=blob&qa_blobid=14481016955578650399
https://gateoverflow.in/?qa=blob&qa_blobid=14481016955578650399
0 answers
14
Error detection
https://gateoverflow.in/?qa=blob&qa_blobid=10139953772158305238 a. 1 B. 3 C. 4 D. None
https://gateoverflow.in/?qa=blob&qa_blobid=10139953772158305238a. 1B. 3C. 4D. None
0 answers
15
Boolean functions
https://gateoverflow.in/?qa=blob&qa_blobid=2194426117198453372 A. 0 B. 1 C. None
https://gateoverflow.in/?qa=blob&qa_blobid=2194426117198453372A. 0B. 1C. None
0 answers
16
different boolean circuits with n variables
Q.13 Ans A. B. C. D.
Q.13 AnsA. B. C. D.
0 answers
17
Program Output
Q.18 a. Hello b. World c. None
Q.18 a. Hellob. Worldc. None
0 answers
18
Program Error Type
integer overflow problem heap overflow problem none
integer overflow problemheap overflow problemnone
1 answer
20
UGC NET CSE | June 2013 | Part 2 | Question: 27
For a B-tree of height h and degree t, the total CPU time used to insert a node is O(h log t) O(t log h) O(t$^2$h) O(th)
For a B-tree of height h and degree t, the total CPU time used to insert a node isO(h log t)O(t log h)O(t$^2$h)O(th)
0 answers
22
LL grammar
LL grammar for the language: $L = \{a^mb^nC^{n+m} \mid m\geq 0, n\geq 0\}$ is a. S->aSc | S1 ; S1 -> bS1c | lambda b. none
LL grammar for the language:$L = \{a^mb^nC^{n+m} \mid m\geq 0, n\geq 0\}$ is a. S->aSc | S1 ; S1 - bS1c | lambdab. none
2 answers
24
Program Output
What will be the output: #include <iostream> using namespace std; int main() { char *A[] = { "abcx", "dbba", "cccc"}; char var = *(A+1) - *A+1; cout << (*A + var); } 1. $abba$ 2. $bba$ 3. $a$ d. none
What will be the output: #include <iostream using namespace std; int main() { char *A[] = { "abcx", "dbba", "cccc"}; char var = *(A+1) - *A+1; cout << (*A + var); }1. $ab...
4 answers
26
recursion in c
output of program: void function(int); void main() { function(3); } void function(int num){ if(num>0) { function(--num); printf("%d",num); function(--num); } } will the argument num value be retained at all recursion levels?
output of program:void function(int); void main() { function(3); } void function(int num){ if(num>0) { function( num); printf("%d",num); function( num); } }will the argum...
8 answers
27
GATE CSE 2017 Set 1 | Question: GA-5
The probability that a $k$-digit number does NOT contain the digits $0, 5,$ or $9$ is $0.3^{k}$ $0.6^{k}$ $0.7^{k}$ $0.9^{k}$
The probability that a $k$-digit number does NOT contain the digits $0, 5,$ or $9$ is$0.3^{k}$$0.6^{k}$$0.7^{k}$$0.9^{k}$
0 answers
29
passage
1 answer
30
master slave ff
a master slave JK flip flop is equivalent to: cascade of sr flip flop sr flip flop and a T flip flop none
a master slave JK flip flop is equivalent to:cascade of sr flip flopsr flip flop and a T flip flopnone