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

#861
3.3k
views
1 answers
0 votes
A is a 2D-array with the range [-5....5,3......13] of elements.The starting location is 100. each element accupies 2 memeory cells.Calculate the location ... major order and row major order.Does indexing matter??Why C follow $0$ indexing??
#862
500
views
0 answers
0 votes
Predict the value returned by the function MyFunc().int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i< size; i++ ... maximum element in all sub-arrays of array arr$D)$ Sum of all the elements in the array arr
#863
464
views
0 answers
0 votes
Let arr[] be an array containing n integers. The following algorithm computes the frequency of each element in arr and stores it in another array fre[].for(i=0;i<n;i++) { count=1; for ... $D) arr[i]==arr[j]$
#864
279
views
0 answers
0 votes
What is the output of given C code? If address of x is 2000 and integer requires four byte of memory.int main(){unsigned int x[4][3] = {{1,2,3},{4,5,6},{7,8,9},{10,11,12} };printf("%u %u %u",x+3,*(x+3),*(x+2)+3));}
#865
1.2k
views
1 answers
0 votes
Maximum number of BFS Traversal Possible on BST of height 3 is ..........
#866
508
views
0 answers
0 votes
#867
1.3k
views
1 answers
3 votes
What is S1,S2?and how to to decide their scope for variable access? Procedure A; x,y:intger; Procedure B; x,z:real S1 end B; Procedure C; i:integer; S2 end C; end A;The ... , z and y in S1 and x of A, i and y in S2(D) None of the above
#868
154
views
0 answers
0 votes
#869
891
views
0 answers
0 votes
Please convert it to postfix by using stack and explain in detailvoid (*bsd_signal(int sig, void (*func)(int)))(int);
#870
673
views
0 answers
0 votes
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........
#871
2.1k
views
0 answers
2 votes
What is the Output of following Array ? A. 8 10B. 10 8C. 10 2D. 8 1E. Garbage value
#872
2.4k
views
2 answers
6 votes
int arr[2][3][2];print(arr[1]-arr[0],arr[1][0]-arr[0][0])P.s :Sorry i can't able to paste the question but this is main Context.
#873
595
views
1 answers
0 votes
Void Test (int arr[], int s, int e) { int temp; if(s >= e) return; temp = arr[s+1]; arr[s+1] = arr[e]; arr[e] = temp; Test(arr, s+1, e - 1) }
#874
214
views
0 answers
0 votes
Can someone explain how value of i is evaluted step by step
#875
772
views
0 answers
0 votes
Given an array with n symbols,How many stack permutations possible?
#876
967
views
1 answers
3 votes
#include<stdio.h> #define type int type foo(type b) { return b*b; } #undef type #define type float int main() { float a = foo(1.1); printf("%1.2f", a); } Please explain line by line execution of this program.
#877
229
views
1 answers
0 votes
What is the output of given program? main() { char g[] = "iamsahilraza"; printf("%s", g + g[8] - g[10]); }
#878
572
views
1 answers
0 votes
We wish to implement a double ended queue using link list. The double ended queue must support , the operations of(i) struct node *push_back(struct node*,struct node ... S1:rear->next=temp;S2:rear=temp;S3:front==NULLS4:front=front->next
#879
3.4k
views
1 answers
8 votes
(int *) a means the base address of the array a ,(int *) a+1 means the address of 2nd element in the array. or base address of 2nd row of the array ? please clear this doubt i am facing ... 4, 2, 43, 0, 3, 04, 2, 4, 25, 5, 5, 56, 0, 6, 0
#880
324
views
0 answers
0 votes
what is the output of the program?#include<stdio.h>int main(){ int p=10; p<<2>>1; printf("%d",p); return 0; ... to associativity and associativity of shift operator is left to right then how it gives the result 10.