main()
{
main();
}
Answer / susie
Answer :
Runtime error : Stack overflow.
Explanation:
main function calls itself again and again. Each time the
function is called its return address is stored in the call
stack. Since there is no condition to terminate the function
call, the call stack overflows at runtime. So it terminates
the program and results in an error.
| Is This Answer Correct ? | 2 Yes | 0 No |
write the function. if all the character in string B appear in string A, return true, otherwise return false.
main() { static int a[3][3]={1,2,3,4,5,6,7,8,9}; int i,j; static *p[]={a,a+1,a+2}; for(i=0;i<3;i++) { for(j=0;j<3;j++) printf("%d\t%d\t%d\t%d\n",*(*(p+i)+j), *(*(j+p)+i),*(*(i+p)+j),*(*(p+j)+i)); } }
main() { if (!(1&&0)) { printf("OK I am done."); } else { printf("OK I am gone."); } } a. OK I am done b. OK I am gone c. compile error d. none of the above
main() { char *p; printf("%d %d ",sizeof(*p),sizeof(p)); }
Develop a routine to reflect an object about an arbitrarily selected plane
main() { char * strA; char * strB = I am OK; memcpy( strA, strB, 6); } a. Runtime error. b. I am OK c. Compile error d. I am O
What is "far" and "near" pointers in "c"...?
#define SQR(x) x * x main() { printf("%d", 225/SQR(15)); } a. 1 b. 225 c. 15 d. none of the above
#define clrscr() 100 main() { clrscr(); printf("%d\n",clrscr()); }
String reverse with time complexity of n/2 with out using temporary variable.
In the following pgm add a stmt in the function fun such that the address of 'a' gets stored in 'j'. main(){ int * j; void fun(int **); fun(&j); } void fun(int **k) { int a =0; /* add a stmt here*/ }
main() { int i=-1; +i; printf("i = %d, +i = %d \n",i,+i); }