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

Filter

Recent questions in Programming

#621
142
views
0 answers
0 votes
Trees
Time complexity of creating a balanced binary search tree as well as unbalanced search tree from inorder traversal and preorder traversals?
User Avatar
#622
470
views
0 answers
0 votes
MadeEasy Test Series: Programming & DS - Programming In C
consider the following C code #define a(x+1) int x=2; void b() { x=9; printf("%d\n ,a); } void c() { int x=1; printf("%d\n ,a); } void main() ... but now i want to ask what is the value of global x after the program executionis it 9 ,10 ??
User Avatar
#623
430
views
0 answers
0 votes
MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explain the solution, whats the actual logic in questions of Preprocessor codes?
User Avatar
#624
1.0k
views
0 answers
0 votes
https://www.geeksforgeeks.org/data-structure-gq/binary-trees-gq/
A weight-balanced tree is a binary tree in which for each node. The number of nodes in the left sub tree is at least half and at most twice the number of nodes ... is best described by which of the following?a) b) c) d) Binary Trees
User Avatar
#625
300
views
0 answers
0 votes
ME Test Series
A sen B men C atheD vin
User Avatar
#626
580
views
1 answers
0 votes
ME Test Series
User Avatar
#627
383
views
2 answers
0 votes
Made easy Test
void foo(int n){ while (n! = 0) { if (!(n & 1)) printf(“*”); n = n >> 1 ; }} The number of times printf(“*”) is executed, when the value 2 raised to power 24 is passed to the function foo() is ?
User Avatar
#628
550
views
1 answers
0 votes
Self doubt
How the below code snippet is working when the function black(“213”) is called?
User Avatar
#629
295
views
1 answers
0 votes
ME Test Series
A 1070B 1071C 1072D 1073
User Avatar
#630
177
views
0 answers
0 votes
SELF DOUBT RECURSION
NOT GGETTING THIS STATEMENT“Recursion is not useful for branching processes” WHAT DOES IT MEANS?
User Avatar
#631
353
views
0 answers
0 votes
data structure
let R be the class of recursive program and l be the class of iterative program now consider below statement S S : every program in R uses strictly more space compare to its equivalent program in class ITRUE of FALSE ?
User Avatar
#632
296
views
0 answers
0 votes
#c programming
#include <stdio.h>int cou=0;int cal(int a,int b){ int c; cou++; if(b==3) return(a*a*a); else{ c=cal(a,b/3); return(c*c*c); }}int main() { int d= cal(4,81); printf("%d",d); return 0;}
User Avatar
#633
858
views
0 answers
2 votes
GATE Overflow | Mock GATE | Test 1 | Question: 36
#include<stdio.h>#define create_node struct node {char x, y;};#define call_main int main() {#define create_pointer struct node *p=&obj;#define create_object(a,b) struct node ... $1$, $2$ and $4$ are correctOnly $3$ is correct
User Avatar
#634
321
views
0 answers
0 votes
#Incriment and decriment
#include <stdio.h>int main(void) {int i=1;printf("%d%d%d",i++,i++,i);}how to evaluate this type of questions
User Avatar
#636
600
views
0 answers
0 votes
Sudo GATE by geeksforgeeks
What does the following function do? int fun(unsigned int n) { if (n == 0 || n == 1) return n; if (n%3 != 0) return 0; return fun(n/3); } ... n is multiple of 3, otherwise returns 1Returns 0 when n is the power of 3, otherwise returns 1
User Avatar
#637
454
views
1 answers
0 votes
self doubt
Please solve this by taking some exampleBack edgecross edgetree edgeThankyou.
User Avatar
#638
318
views
0 answers
1 votes
Please tell me the logic for x = 3 > 2 > 1;
What is the logic behind this code.#include <stdio.h> void main() { int x; x = 3 > 2 > 1; printf("%d", x); return; }
User Avatar
#639
486
views
0 answers
1 votes
TestBook_P&DS
The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s. int ... ]]--4 A: count[a[j]]++ and B: count [b[j++]]--
User Avatar
#640
359
views
0 answers
0 votes
ME Test Series
The output of the below program is _______
User Avatar
Page: