Hot questions in Programming and DS

0 votes
0 answers
1741
main(){int ar[5],a=0; ar={4,5,6,0,3}fun(ar[a],ar[ar[a])}// will the called function be resolved to fun(0,3) at compile time ?? [Code Optimization:Folding]
1 votes
3 answers
1744
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the r...
0 votes
1 answer
1745
Which of the following data structure is efficient to implement priority queue with basic operation such as insertion, deletion and searching?A) Linked listB) Sorted arra...
0 votes
0 answers
1746
2 votes
0 answers
1749
1 votes
0 answers
1750
What is the logic behind this code.#include <stdio.h void main() { int x; x = 3 2 1; printf("%d", x); return; }
0 votes
0 answers
1751
Find out the output of the given program?include<stdio.h int main() { char s[] = "Hello"; char *ptr = s ; *ptr++; // please explain this line ptr++; ...
0 votes
1 answer
1753
Please solve this by taking some exampleBack edgecross edgetree edgeThankyou.
0 votes
0 answers
1756
A sen B men C atheD vin
0 votes
1 answer
1758
Which of the following is the time complexity to find the determinant of an upper- triangular matrix of order n*n? O(n^2.5) O(n) O(n^2) O(1)
0 votes
0 answers
1759
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 ...
1 votes
1 answer
1760
#include<stdio.h>main(){ int j=0; int i; for( i=0;i<100;i++) { j=j++; } printf("%d",j);}why o/p is zero??