Register
Filter

Recent activity by Haseena Shaik

1 answer
1
ISRO2014-67
What is the time complexity for the following C module? Assume that $n>0$. int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); } $O(n)$ $O(\log n)$ $O(n^2)$ $O(n!)$
What is the time complexity for the following C module? Assume that $n>0$.int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); }$O(n)$$O(\log n)$$O(n^...
8 answers
3
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
4 answers
6
GATE Overflow | Programming | Test 1 | Question: 15
Which of the following statements produce a compile time error in C? int a = sizeof 3; *(1000) = 5; int a = 5; ((int)a)++; int b = 5, *a = &b; ((int*)a)++; 1, 2 and 3 2 only 2, 3 and 4 All 4
Which of the following statements produce a compile time error in C?int a = sizeof 3;*(1000) = 5;int a = 5; ((int)a)++;int b = 5, *a = &b; ((int*)a)++;1, 2 and 32 only2, ...