Interested to Buy Any Domain ? << Click Here >> for more details...
value = 0xabcd;
for (loop = 1; (value >> 1) & 1 | loop & 1; loop++) {
foo();
if (loop & 1)
value >>= 1;
}
how many times is foo() executed?
- 6 Answers
- 12599 Views
- Google, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / jaroosh
This is a very neat example of program where you need to
note some interesting things about values in order to easily
estimate how many times it will be executed.
So, here it goes
0. first of all, were looking for the value of LOOP for
which (value >> 1) & 1 | loop & 1 will be false.
1. loop variable in for loop will sequentially take values
that are :
odd (1), even (2), odd (3), even (4) ...etc
so (loop & 1) part of for loop condition will sequentially
take values:
true(loop=1), false(loop=2),true,false...etc
2. the only thing to figure now is how (value >> 1) & 1 part
will behave. It is a good choice to convert hex abcd to bit
pattern, so we will have 1010101111001101
now only thing we have to do is see what will the boolean
part of condition will initially be:
1010101111001101 >> 1 = 101010111100110
101010111100110 & 1 = 0
initially, the (value >> 1) & 1 part is then FALSE.
3. now, we only have see 3 things:
a) in for loop body there is :
if (loop & 1)
value >>= 1;
so EVERY TIME loop condition : (loop & 1) is TRUE (as we've
noticed earlier for each loop iteration, it has sequentially
values : true, false, true, false, true, false..etc),
we CHANGE the value of '(value >> 1) & 1' part of condition
to its opposite (if it was FALSE, it becomes true)
b) were looking for the situation where both parts of
condition will be false, so all we have to do now is write
down how those parts behave starting from loop = 1.
LOOP PART : true , false , true , false , true , false(!)
OTHER PART: false , true, true, true, false , FALSE(!)
since we have FALSE and FALSE in both parts of for
condition, the for loop ends.
Now, we count how many times the for loop body (and so - foo
function) executed. Right, it IS 5.
It may sound a bit complicated, but this shows the way how
to solve algorithm problems that sound complicated at first
and use bit patterns (on interviews, no-one expects you to
do complicated binary/hex equatations in memory, you only
have to note some things, and simplify).
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / adam
It is 5, as stated... anybody can figure that out by just compiling the code. I
doubt that guy actually knows why.
This problem is heavy on bitwise operations, so you'll need to convert the
numbers into binary. The 0xABCD = 10, 11, 12, 13 = 1010 1011 1100
1101. Now make a table to hold the binary values of loop and value on each
iteration and walk through the code. Notice that "value" is shifted every other
iteration.
At the start of the 6th iteration, the value of "value" is 1010101111001 and
the "loop" is obviously 110. This makes the for-loop check:
((value >> 1) & 1) | (110 & 1)
(101010111100 & 1) | (110 & 1)
0 | 0
0
And it exits the loop at this point.
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / sbay
Shouldn't it be || though?
for (loop = 1; (value >> 1) & 1 || loop & 1; loop++)
????
| Is This Answer Correct ? | 0 Yes | 0 No |
Explain pointer. What are function pointers in C?
What's the difference between struct x1 { ... }; and typedef struct { ... } x2; ?
What's the difference between calloc() and malloc()?
Why c language is called c?
How can you convert integers to binary or hexadecimal?
what is the difference between procedure oriented and object oriented progaming language
What are local and global variables?
#define f(x) main() { printf("\n%d",f(2+2)); }
Write a c program using for loop to print typical pattern if number of rows is entered by keyboard. ABCBA AB BA A A
write a c program to calculate sum of digits till it reduces to a single digit using recursion
ratio,age,persentage
compute the nth mumber in the fibonacci sequence?
10 Answers Canon, HPL, Satyam, TCS,
C 
