Most viewed questions in Programming and DS

0 votes
0 answers
2041
#include<stdio.h int reverse(int); int main() { int num=4; reverse(num); return 0; } int reverse(num) { if(num==0) return 0; else printf("%d",num); reverse(num ); }What i...
2 votes
1 answer
2042
Main() Int myarray[32]Printf(%d ,size of(myarray[])/sizeof(myarray(0))A..4B..8C.16D.depends on compiler for into size
1 votes
1 answer
2043
there was a question on global counter variablewhat is the answer to that question???
0 votes
0 answers
2046
explain me briefly what is valid stack stack permutations ?
1 votes
1 answer
2047
How D) could be answer here?I think for head->next=temp; will not work properly. Am I doing any mistake?
1 votes
2 answers
2048
#include <stdio.h int main() { //code int x; printf("%d",printf("A")+printf("BC")*printf("DEF")); return 0; }What should be the output of following program? Please explai...
5 votes
2 answers
2050
Main(){int a [3] ={{{2,4},{7,8},{3,4}},{{2,2},{2,3},{3,4}}};Printf("%u",a);Printf("%u",*a);Printf("%u", a);Printf("%u", *a);Printf("%u",a+1);Printf("%u",*a+1);Printf("%...
1 votes
2 answers
2051
In a circularly linked list organization, insertion of a record involves the modification ofno pointer$1$ pointer$2$ pointers$3$ pointers
0 votes
2 answers
2058
Convert (A - B^C + H)*D + E^5.Is the answer +*+-A^BCHD^E5 ?
2 votes
3 answers
2059
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level orde...
3 votes
2 answers
2060