Hot questions in Programming and DS

1 votes
1 answer
4112
Write an algorithm of the given problemGiven a chess board of order NxM and source points (s1,s2) and destination points (d1,d2), Your task to find min number of moves re...
1 votes
1 answer
4113
predict the correct options#include <stdio.h>int main(){ if (sizeof(int) -1) printf("Yes"); else printf("No"); return 0;}1.yes2.no3.compiler error...
0 votes
1 answer
4114
program in c to reverse a number with all 0's and 1's or a binary no.?
0 votes
0 answers
4115
#include <stdio.h>void main(){int a = -5;int k = (a++, ++a);printf("%d\n", k);}how to solve this int k = (a++, ++a); expression?
2 votes
1 answer
4117
The maximum size of operator stack, when converting the following infix expression to postfix expression? Assume that has the highest precedence and follows right associ...
–1 votes
0 answers
4118
if i = -5 then value of i++ is: -6/-4????
0 votes
2 answers
4119
Whats wrong with option B?Give an example?
1 votes
1 answer
4120
Which of the following algorithm have the smallest memory requirement i.e Low space complexity including data space and run time stack for recursive calls.A)insertion sor...
0 votes
1 answer
4122
0 votes
2 answers
4123
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
0 votes
1 answer
4125
#include <stdio.h int*fun() { intx=5; return&x; } int main(){ int*p=fun(); fflush(stdin); printf("%d",*p); return0; }Please explain this code, how's it's working line by ...
0 votes
1 answer
4126
0 votes
1 answer
4127
What is this pointer? and what is the use of this pointer?
0 votes
2 answers
4128
strcpy() char* strcpy(char*s,char*t) { *s=malloc(strlen(source)+1); while((*s=*t)!='\o') { s++; t++; } return s; }Please someone tell, that line *s=malloc(strlen(source)+...
11 votes
1 answer
4129
0 votes
3 answers
4130
what is the maximum difference between height of two nodes of AVL treea.1b.2c.3d.none