Question 1
#include <stdio.h>
// Assume base address of \"GeeksQuiz\" to be 1000
int main()
{
printf(5 + \"GeeksQuiz\");
return 0;
}
Question 3
Consider the following ANSI C code segment:
z=x + 3 + y->f1 + y->f2;
for (i = 0; i < 200; i = i + 2)
{
if (z > i)
{
p = p + x + 3;
q = q + y->f1;
} else
{
p = p + y->f2;
q = q + x + 3;
}
}
Assume that the variable y points to a struct (allocated on the heap) containing two fields f1 and f2, and the local variables x, y, z, p, q, and i are allotted registers. Common sub-expression elimination (CSE) optimization is applied on the code. The number of addition and the dereference operations (of the form y ->f1 or y ->f2) in the optimized code, respectively, are:
Question 5
int fun(char *str1){ char *str2 = str1; while(*++str1); return (str1-str2);}int main(){ char *str = \"GeeksQuiz\"; printf(\"%d\", fun(str)); return 0;}
Question 6
Given that x = 7.5, j = -1.0, n = 1.0, m = 2.0 the value of - - x + j == x>n> = m is:
Question 8
#include "stdio.h" int main() { int x, y = 5, z = 5; x = y == z; printf("%d", x); getchar(); return 0; }
Question 9
#include <stdio.h>
int main()
{
int i = 3;
printf(\"%d\", (++i)++);
return 0;
}
What is the output of the above program?
There are 50 questions to complete.