My MC as follows:
1C
2D
3B
4B (although A should be correct too according to sam davis)
5C
6A
7A (Obv because format matters, or leading zeros)
8D
9A
10C
11B
12D
13B
14A
15B (Which I do believe is true, because all the others are invalid, and this is definetly true)
16B (Binary Search is closest...
Floating point, the mantissa worked out to be (when adding the hidden bit back) 1.0000... to the base 2.
The exponent was 127. however you had to remove your bias of 127, which made it 0. So the answer was 1*2^0, which is -1 when you factor in the sign bit.
I played a game of redesign tripview on my software paper ;)
MC15 i put B, which I was confident was true, and checked it like 4 times and compared with friends
MC16 I put B, binary search is whatever 2^n > number of values to search. where n is the number of passes required.
To make more...
In my opinion was quite an easy paper, compared to some of the past papers where we've needed a lot of content to be regurgitated. Very happy. Confident in getting around 90/100 :)