Webpage

Programming in C. Recursion.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year} & \textbf{2022}&\textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1 &0&2&1&2&2&1&2&2&1&0&1.4&2
\\\hline\textbf{2 Marks Count} & 2&2&2&1&3&3&4&4&2&2&1&2.5&4
\\\hline\textbf{Total Marks} & 5&4&6&3&8&8&9&10&6&5&\bf{4}&\bf{6.4}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Programming

3 votes
4 answers
391
What is the time complexity to delete an arbitrary node from binary heap?O(n)O(log n)O(1)O(n log n)
3 votes
3 answers
392
for(int i=0; i<=100;i++) { if (i % 3 == 0) printf("Great); if(i%5 == 0) printf("India"); }Count the number of times GreatIndia is printed.62033none of these
3 votes
4 answers
393
What is the time complexity for insertion in binary tree in worst case?O(1)O(log n)O(n)O(n log n)
0 votes
1 answer
399
int main();{int a,*b, c, *d, e;a=10;b=&a;c=&b;d=&c;e=&d;print f(“a=%d b=%u c=%u d=%u e=%u e=%u\n”, a,b,c,d,e);print f(“ %d %d %d \n”,a,a+*b, c+ *d+, e);return 0...
–1 votes
0 answers
400
void fun(int,int*);int main(){int=-5,j=-2;fun(i,&j);print f(“i=%d j=%d\n”,i,j);return 0;}void fun(int i,int *j){i=i*i;*j=*j * *j;}
0 votes
1 answer
401
X=2;Y=++x * ++x * ++x ;Printf("%d",Y);In the above question, we have to use the final value of x or it will be evaluated seperately and then multiplied.Ex: Y= 3*4*5; or Y...
0 votes
1 answer
403
What will happen if using MALLOC ( ) we allocate entire memory from heap and we don't free it using FREE( ) ? what will happen next ?
0 votes
1 answer
404
–2 votes
0 answers
405
1 votes
1 answer
406
1 votes
3 answers
409
What is the output of the program? int main() { union a { int i; char ch ; }; union a u; u.ch[0] = 3; u.ch = 2; printf("%d, %d, %d", u.ch[0], u.ch , u.i); return 0; }