Register

Webpage

Programming in C. Recursion.
Filter

Recent questions in Programming and DS

0 votes
0 answers
1951
Integer in c
User Avatar
0 votes
2 answers
1952
Modulous operator
User Avatar
–1 votes
0 answers
1953
Printf
User Avatar
1 votes
1 answer
1954
Size of operator
#include<stdio.h> int main(void) { printf("bytes occupied by '7' = %d\n", sizeof('7')); printf("bytes occupied by 7 = %d\n", sizeof(7)); printf("bytes occupied by 7.0 = %d\n", sizeof(7.0)); return 0; }
#include<stdio.h int main(void) { printf("bytes occupied by '7' = %d\n", sizeof('7')); printf("bytes occupied by 7 = %d\n", sizeof(7)); printf("bytes occupied by 7.0 = %d...
User Avatar
1 votes
2 answers
1955
AVL Tree
Minimum number of internal nodes in an AVL tree with height 5? Please give a standard procedure that can be applied to larger heights as well. I know the formula: S(h) = S(h-1) + S(h-2) + 1, but here it is asked for internal nodes only. Drawing a tree is tedious.
Minimum number of internal nodes in an AVL tree with height 5?Please give a standard procedure that can be applied to larger heights as well. I know the formula: S(h) = S...
User Avatar
0 votes
4 answers
1958
Why b is not decrementing ?
main() { int a = 1; int b = 1; int c = a || b--; printf("a = %d b=%d\n",a,b); return 0; }
main(){int a = 1; int b = 1; int c = a || b ; printf("a = %d b=%d\n",a,b); return 0;}
User Avatar
0 votes
1 answer
1959
Binary Tree
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
User Avatar
0 votes
1 answer
1960
gfg C pointer Basic
Please explain solution in brief . #include <stdio.h> void f(char**); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char **p) { char *t; t = (p += sizeof(int))[-1]; printf("%s\n", t); } A] ab B] cd C] ef D] gh
Please explain solution in brief . #include <stdio.h void f(char ); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char ...
User Avatar
0 votes
2 answers
1961
gfg c pointer basic
What changes must be done for printing value 5. #include <stdio.h> int main() { int var; /*Suppose address of var is 2000 */ void *ptr = &var; *ptr = 5; printf("var=%d and *ptr=%d",var,*ptr); return 0; }
What changes must be done for printing value 5. #include <stdio.h int main() { int var; /*Suppose address of var is 2000 */ void *ptr = &var; *ptr = 5; printf("var=%d and...
User Avatar
0 votes
1 answer
1965
Doubt
The number of times “MadeEasy” will be printed ________.
The number of times “MadeEasy” will be printed ________.
User Avatar
0 votes
1 answer
1966
Doubt
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate on top two elements of the stack. The minimum size of stack required to evaluate given expression is ________.
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate on top two e...
User Avatar
0 votes
2 answers
1967
Doubt
Consider A be a 2-dimensional array declared as follows: A[15] [15] of integers. Assume each integer take 1B. The array stored in row major order and first element of array is stored at location 1000, then the address of element a[10] [6] is ________ B.
Consider A be a 2-dimensional array declared as follows: A[15] [15] of integers. Assume each integer take 1B. The array stored in row major order and first element of arr...
User Avatar
Page: