Register

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}}}$$

Filter

Most answered questions in Programming

0 votes
1 answer
1381
# c questions
#define cube(x) x*x*x main(){ int a=3,b; b=cube(a++); printf("% d % d",a,b); }
#define cube(x) x*x*xmain(){int a=3,b;b=cube(a++);printf("% d % d",a,b);}
User Avatar
1 votes
1 answer
1383
Test Book- Data Structure Test
In an AVL tree a single insertion can cause how many rotations at a particular time in worst case?
In an AVL tree a single insertion can cause how many rotations at a particular time in worst case?
User Avatar
0 votes
1 answer
1385
BFS TRAVERSAL
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
User Avatar
0 votes
1 answer
1386
#c books
int a=10 if(i++<10),if(++i<10).,while(i++<10) what is logic behind
int a=10if(i++<10),if(++i<10).,while(i++<10) what is logic behind
User Avatar
0 votes
1 answer
1387
#c book
#include<stdio.h> int main() { int num=10; do { while(num++ <10); }while(num++ <=11); printf(“%d”,num); }
#include<stdio.h>int main(){int num=10;do{while(num++ <10);}while(num++ <=11);printf(“%d”,num);}
User Avatar
0 votes
1 answer
1388
#c books
main() { int x=1,y=0,z=5; int a=x&&y&&z++; printf("%d",z); }
main() { int x=1,y=0,z=5; int a=x&&y&&z++; printf("%d",z); }
User Avatar
0 votes
1 answer
1389
Extern Variable
User Avatar
0 votes
1 answer
1391
Gateforum Test Series: Programming & DS - Programming In C
#include<stdio.h> void main() { int i ; for(i=0; i<5; i++) f() ; } void f() { static int x ; x=5 ; x++ ; printf("%d", x); } OUTPUT OF THE FUNCTION IS (A)6,6,6,6,6 (B)6,7,8,9,10 (C)5,5,5,5,5 (D)5,6,7,8,9
#include<stdio.h>void main(){ int i ;for(i=0; i<5; i++)f() ;}void f(){static int x ;x=5 ;x++ ;printf("%d", x);}OUTPUT OF THE FUNCTION IS(A)6,6,6,6,6(B)6,7,8,9,10(C)5,5,5,...
User Avatar
0 votes
1 answer
1393
Static Variable
Is it static declaration or static assignment? int main() { int x=20; static int y=x; if(x==y) printf("Equal"); else printf("Not Equal"); return 0; } What is output?and why?
Is it static declaration or static assignment?int main() { int x=20; static int y=x; if(x==y) printf("Equal"); else printf("Not Equal"); return 0; }What is output?and why...
User Avatar
0 votes
1 answer
1397
drdo 2013
let A(1:8, -5:5, -10:5) be a three dimentional arrey. how many elements are there in the arrey A
let A(1:8, -5:5, -10:5) be a three dimentional arrey. how many elements are there in the arrey A
User Avatar
0 votes
1 answer
1399
ibps 2014
if n elements are sorted in a binary search tree .what would be the asymptotic complexity to search a key in the tree. a. o(1) b. 0(log n) c. o(n) d. o(n log n)
if n elements are sorted in a binary search tree .what would be the asymptotic complexity to search a key in the tree.a. o(1)b. 0(log n)c. o(n)d. o(n log n)
User Avatar
0 votes
1 answer
1400
made easy test series
what will be the output?
what will be the output?
User Avatar
Page: