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{2024-1}&\textbf{2024-2}&\textbf{2023}& \textbf{2022}&\textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2&2&1&1 &0&2&0&1.33&2
\\\hline\textbf{2 Marks Count} &1&1&0& 2&2&2&0&1.33&2
\\\hline\textbf{Total Marks} &4&4&1& 5&4&6&\bf{1}&\bf{4}&\bf{6}\\\hline
\end{array}}}$$

Recent questions in Programming

0 votes
0 answers
1121
int main(){int arr[3]={2,3,4};char *p;p = (char*)arr;printf("%d",*p);p=p+1;printf("%d",*p);return 0;}
1 votes
1 answer
1122
In a modified merge sort, the input array is split at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(log...
0 votes
1 answer
1123
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list :i think answer is O(1).Am i right?
0 votes
0 answers
1124
What is the output of the following program?#include<stdio.h main(){ int i = 258; int *iptr = &i; printf("%d %d",*((char*)iptr),*((char*)iptr + 1));}explain brie...
0 votes
1 answer
1126
What should be the output of the code? #include<stdio.h>union data{ int a; float b;} ;int main(){union data a1;a1.a=4;a1.b=32768.0;printf("%d \n%f",a1.a,a1.b);ret...
3 votes
3 answers
1127
#include <stdio.h int main() { static int i=5; if( i) { main(); printf("%d ",i); } }
0 votes
1 answer
1128
void main(main) { int i,a[8]={000,001,010,011,100,101,110,111}; for(i=0;i<8;i++) printf("%d",a[i]); } $\text{o/p is}$ $0,1,8,9,100,101,110,111$ $\text{Pls Explain}$...
0 votes
1 answer
1129
main() { char s[]={'a','b','c','\n','c','\0'}; char *p,*str,*str1; p=&s[3]; str=p; str1=s; printf("%d",++*p+++*str1-32); }output is 76 pls explain.
0 votes
1 answer
1130
Its answer comes to be in table [5] what should be answer as it starts from 0 then I think answer should be 6 but in test it was given as 5 . please answer
0 votes
1 answer
1131
0 votes
3 answers
1132
Int A[3]={0,1,2}A++; For this code snippet un C will there be a compilation error,if yes then please explain a bit.
0 votes
1 answer
1133
#include<stdio.h>#define funct(x) x*x+xint main(){ int x; x=36+funct(5)+funct(3); printf("%d",x); return 0;}
1 votes
1 answer
1134
#include<stdio.h>int main(){ int a; char *x; x = (char *) &a; a = 512; x[0] = 1; x = 2; printf("%dn",a); return 0;}
0 votes
3 answers
1135
How many times will the loop execute?What is the general expression in terms of 'n'?for( i=1; i<=n; i=i*3) { for( j=i; j<=n; j++) { printf ...
0 votes
2 answers
1137
#include<iostream>using namespace std;int main(){ int a[] = {10,20,30,40,50}; cout<<(*(&a+1)-a); return 0;}how th o/p is 5 ??
0 votes
0 answers
1138
The number of different directed trees with 3 nodes areA) 3B) 4C) 5D) 6I think the answer is 5 but the answer is not.
0 votes
0 answers
1139
int add(int a){ return a;}int sub(int b){ return b;}void main (){Int (*fun[])(int)={add,sub};printf("%d %d %d",&add,&fun[0],&sub);} address of add is 657 and address of ...
3 votes
1 answer
1140
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required ...