Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
1 answer
121
Go Class data structure asymptotic notation practice video question 21
I have specific doubt on this question and I’ve tried to explain that in the picture , If anyone can explain it then it’ll be of great help. according to sachin sir the answer should be false( fyi).
I have specific doubt on this question and I’ve tried to explain that in the picture ,If anyone can explain it then it’ll be of great help. according to sachin sir th...
User Avatar
0 votes
0 answers
122
Gate Overflow Test series
Can anyone explain this question to me
Can anyone explain this question to me
User Avatar
1 votes
2 answers
123
Self doubt
#include<stdio.h> void dynamic(int s, ...) { printf("%d ", s); } int main() { dynamic(2, 4, 6, 8); dynamic(3, 6, 9); return 0; }
#include<stdio.h void dynamic(int s, ...) { printf("%d ", s); } int main() { dynamic(2, 4, 6, 8); dynamic(3, 6, 9); return 0; }
User Avatar
0 votes
0 answers
125
Ace test series
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ? 255 and 6560 127 and 2186 6561 and 255 255 and 2186
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ?255 and 6560127 and 2186 6561 and 255255 and 2186
User Avatar
4 votes
1 answer
126
what will be output and explain how
#include<stdio.h> #include<string.h> #define MAX(x, y) ((x) > (y) ? (x) : (y)) int main() { int i = 10, j = 5, k = 0; k = MAX(i++, ++j); printf("%d %d %d", i, j, k); return 0; }
#include<stdio.h #include<string.h #define MAX(x, y) ((x) (y) ? (x) : (y)) int main() { int i = 10, j = 5, k = 0; k = MAX(i++, ++j); printf("%d %d %d", i, j, k); return ...
User Avatar
1 votes
2 answers
127
Self Doubt
char st[] = {‘G’,’A’,’T’,’E’,’\0’}; then string ka length 4 hoga ya 5 with null character?
char st[] = {‘G’,’A’,’T’,’E’,’\0’};then string ka length 4 hoga ya 5 with null character?
User Avatar
0 votes
0 answers
128
Programming 2024 test series
Caption @sachinmittal1 sir here answer should be B na because Arr[2] point s to the 0th index of 2nd 1D-array so it means pointing to address of arr[2][0] so address size would be 8.
Caption@sachinmittal1 sir here answer should be B na because Arr point s to the 0th index of 2nd 1D-array so it means pointing to address of arr [0] so address size woul...
User Avatar
3 votes
3 answers
129
C Programming Recursion
#include<stdio.h> void print(int n) { printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main() { void print(); print(-4); } How many times printf execute?? And How ??
#include<stdio.h void print(int n) { printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main() { void print(); print(-4); }How many times printf execute?? And H...
User Avatar
0 votes
1 answer
130
C Programming Recursion
#include<stdio.h> void print(int n){ printf("Hello "); if(n++ == 0) return ; print(n); n++; } int main(){ void print(); print(-4); }
#include<stdio.h>void print(int n){ printf("Hello "); if(n++ == 0) return ; print(n); n++;}int main(){ void print(); print(-4);}
User Avatar
0 votes
0 answers
131
testbook question
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
User Avatar
0 votes
1 answer
132
data structure tree
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
User Avatar
0 votes
1 answer
133
DRDO INTERVIEW..
We have stored an element after a few elements in an array, where the array size is unknown, then find the position of in array.
We have stored an element after a few elements in an array, where the array size is unknown, then find the position of in array.
User Avatar
2 votes
2 answers
136
#Pointers #Pointer_initialization
Why can’t we do pointer initialization as int *p; *p=x; instead of p = &x; ?
Why can’t we do pointer initialization as int *p; *p=x; instead of p = &x; ?
User Avatar
4 votes
1 answer
137
Go Classes C programming Course
I am getting all output as 65527, Please Explain.
I am getting all output as 65527, Please Explain.
User Avatar
3 votes
1 answer
138
Pointers
Please explain this question void main() { int a =300; char *ptr = (char*) &a ; ptr++; *ptr=2; printf("%d" , a); }
Please explain this question void main() { int a =300; char *ptr = (char*) &a ; ptr++; *ptr=2; printf("%d" , a); }
User Avatar
Page: