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

2 votes
0 answers
1831
3 votes
1 answer
1832
In circular singly linked list, insertion of node requires modification of how many pointers?1 pointers2 pointers3 pointers 4 pointers
2 votes
2 answers
1833
5 votes
3 answers
1835
1.Linear Probing suffers from both primary and secondary clustering. true or false?2. Quadratic Probing suffers from both primary and secondary clustering. true or fal...
2 votes
1 answer
1838
3 votes
1 answer
1839
3 votes
1 answer
1840
main( ){int num[ ] = { 24, 34, 12, 44, 56, 17 } ;dislpay ( &num[0], 6 ) ;} display ( int *j, int n ){int i ;for ( i = 0 ; i <= n - 1 ; i++ ){printf ( "\nelement = %d", *j...
2 votes
1 answer
1841
main( ){char ch = 200 ;printf ( "\n%d", ch ) ;}
2 votes
2 answers
1842
int i = 0 ;main( ){printf ( "\nmain's i = %d", i ) ;i++ ;val( ) ;printf ( "\nmain's i = %d", i ) ;val( ) ;}val( ){i = 100 ;printf ( "\nval's i = %d", i ) ;i++ ;}
0 votes
0 answers
1843
A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation ?
1 votes
1 answer
1845
#include <stdio.h>#include <conio.h>main( ){int i = 3, j = 4, k, l ;k = addmult ( i, j ) ;l = addmult ( i, j ) ;printf ( "\n%d %d", k, l ) ;}addmult ( int ii, int jj ){in...
3 votes
1 answer
1846
4 votes
1 answer
1849
void foo(int *); main() { int x=30 , *a=&x; foo(a++); } void foo(int *a) { printf("%d", *a); }