Register

Webpage

Programming in C. Recursion.
Filter

Most answered questions in Programming and DS

3 votes
1 answer
2551
C program o/p
main() { float a=.5, b=.7; if(b<.7) if(a<.5) printf("TELO"); else printf("LTTE"); else printf("JKLF"); }
main() { float a=.5, b=.7; if(b<.7) if(a<.5) printf("TELO"); else printf("LTTE"); else printf("JKLF"); }
User Avatar
0 votes
1 answer
2552
C POINTER
int f(int x, int *py, int **ppz) { int y, z; **ppz += 1; z = **ppz; *py += 2; y = *py; x += 3; return x + y + z; } void main() { int c, *b, **a; c = 4; b = &c; a = &b; printf("%d ", f(c, b, a)); return 0; } Run on IDE (A) 18 (B) 19 (C) 21 (D) 22
int f(int x, int *py, int ppz){ int y, z; ppz += 1; z = ppz; *py += 2; y = *py; x += 3; return x + y + z;} void main(){ int c, *b, a; c = 4; b = &...
User Avatar
1 votes
1 answer
2553
self doubt
give an o(n) algorithm to check whether the given binary tree is bst or not
give an o(n) algorithm to check whether the given binary tree is bst or not
User Avatar
0 votes
1 answer
2554
Doubt in C-programming
The Correct answer is c but how? int main() { int a=210,b=120,c; c=a>b?1,2,3:2,5,6,7; printf("%d",c); } ans:- a) 1 b) 2 c) 3 d) Error.
The Correct answer is c but how?int main(){ int a=210,b=120,c; c=a>b?1,2,3:2,5,6,7; printf("%d",c);}ans:-a) 1b) 2c) 3d) Error.
User Avatar
0 votes
1 answer
2555
test series
pointers question, can someone please explain me solution
pointers question, can someone please explain me solution
User Avatar
1 votes
1 answer
2556
test series
Stack valid permutation , They haven't mentioned anywhere that input is in ascending order
Stack valid permutation , They haven't mentioned anywhere that input is in ascending order
User Avatar
0 votes
1 answer
2557
testseries
Data structure for loop. What is oxf ? can somebody explain
Data structure for loop. What is oxf ? can somebody explain
User Avatar
1 votes
1 answer
2558
query
from where we can practice different variety of programming questions related to output except previous year
from where we can practice different variety of programming questions related to output except previous year
User Avatar
3 votes
1 answer
2559
self doubt
#include <stdio.h> main() { float a ; double b ; scanf("%f %lf",&a, &b); if(a==b) printf ("true\n"); else if(a>b) printf("a>b"); else if(a<b) printf("a<b"); } Case 1: input $a=1, b=1$ output = true ... $a = 1.01, b= 1.01$ output = a<b Can anyone explain output of Case2 and Case3
#include <stdio.h main() { float a ; double b ; scanf("%f %lf",&a, &b); if(a==b) printf ("true\n"); else if(a>b) printf("a>b"); else if(a<b) printf("a<b"); } Case 1: inp...
User Avatar
1 votes
1 answer
2560
Self-doubt
#include <stdio.h> main() { if (sizeof(int) > -1) printf("True"); else printf("False"); } I expect output is True. But the output is False. Why? explain!!
#include <stdio.h main() { if (sizeof(int) -1) printf("True"); else printf("False"); }I expect output is True. But the output is False. Why? explain!!
User Avatar
1 votes
1 answer
2561
self doubt
#include<stdio.h> main() { char *p = 0; *p = 'a'; printf("value in pointer p is %c\n",*p); } What is the output of this code ? Why?
#include<stdio.h main() { char *p = 0; *p = 'a'; printf("value in pointer p is %c\n",*p); }What is the output of this code ? Why?
User Avatar
0 votes
1 answer
2562
Fibnocii heap
what is Potential function in Fibonacci heap (i dont remember the question ) plz explain with example
what is Potential function in Fibonacci heap (i dont remember the question ) plz explain with example
User Avatar
1 votes
1 answer
2564
self doubt
Give an algorithm for finding the height or depth of the tree
Give an algorithm for finding the height or depth of the tree
User Avatar
0 votes
1 answer
2565
C programming
#include<stdio.h> int main() { char *x; int a = 512; x = (char *) &a; x[0] = 1; x[1] = 2; printf("%d\n",a); return 0; } What is the output of above program? Machine dependent $513$ $258$ Compiler Error
#include<stdio.h int main() { char *x; int a = 512; x = (char *) &a; x[0] = 1; x = 2; printf("%d\n",a); return 0; }What is the output of above program?Machine dependent$...
User Avatar
2 votes
1 answer
2567
#Binary_heap
We have a binary heap with given n elements and now we want to insert n more elements, then what is the time required for insert those elements i) if elements inserted one after another and ii) not necessarily one after other??
We have a binary heap with given n elements and now we want to insert n more elements, then what is the time required for insert those elements i) if elements inserted on...
User Avatar
0 votes
1 answer
2568
SAnfoundary
What data structure would you most likely see in a non-recursive implementation of a recursive algorithm? Linked List Stack Queue Tree please explain also
What data structure would you most likely see in a non-recursive implementation of a recursive algorithm?Linked ListStack QueueTreeplease explain also
User Avatar
6 votes
1 answer
2569
Binary Tree
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?
User Avatar
Page: