• Congratulations to the Class of 2024 on your results!
    Let us know how you went here
    Got a question about your uni preferences? Ask us here

Search results

  1. H

    General Thoughts

    18 it said returns a number between 15 and 20 inclusive. Only the first one does does that, D will be an infinite loop
  2. H

    General Thoughts

    It's Q17. Q16 is acceptance testing
  3. H

    General Thoughts

    1C 2D 3B 4A 5C 6A 7C <-- unsure about this either a string or integer would be valid, but I went with int because it's more efficient 8D <-- decided that faster *software* download speeds wasn't relevant, were as A was a valid change of requirements 9A 10C 11B 12D 13B 14A 15B 16D <-- not sure...
  4. H

    General Thoughts

    Dam, I knew I was doing something wrong with the mantissa, I did the bias the wrong way round :( Still converted the modulus and sign right (and 1^-127 was still in the range) so hopefully get at least 1 for that
  5. H

    General Thoughts

    ^That's MC16, and I'm pretty sure B is correct for that. MC16 is the acceptance testing one. B really should have had brackets around (b[c]) but it appeared the closet, I just wanted to double check :)
  6. H

    General Thoughts

    With the floating point was the mantissa -127 that was the main bit I wasn't sure about. Now that I think about it it probably was -128 :/
  7. H

    General Thoughts

    Yeah that and the truth table/circuit diagram were very easy.
  8. H

    General Thoughts

    I found the paper significantly easier than previous ones, I actually spent about 5mins looking to see if I had missed a page. I felt there was a lot of drawing and not much algorithms at all. Confident mid-90s Only 2 multiple choice and one question in Section II I wasn't sure one. What did...
  9. H

    General Thoughts: Mathematics Extension 1

    That's because they're supposed to let you take it, I won't have access to a scanner until 6 but if no one has uploaded it by then I will
  10. H

    General Thoughts: Mathematics Extension 1

    Much easier than I expected given how hard the 2unit exam was. Skipped a few questions, but feeling pretty good about it.
  11. H

    algorithm design help :(

    indexes always go after the name of the array, so it would be SCORES[i].name or the same with () brackets. SCORES.name[i] is a record with an array in it, not an array of record. At least that would be the case in any programming language I've ever used. I just looked at the course specs for...
  12. H

    SDD Marathon 2013

    I've been doing alternating hours of MX1 and SDD. It'll probably decrease my mark in SDD, but I need to get a reasonable mark in MX1. Really annoyed that these are on the same day :/
  13. H

    MX1 Predictions

    Pretty sure I've seen finance questions in past 3u HSCs, its a harder 2u question. Hope there isn't any though, I'm prepared but all of the MX2s in my class, who are ranked above me didn't revise them because they didn't think they'll get any.
  14. H

    SDD Marathon 2013

    That's a possible question. I don't think its very likely, but you might have to compare the efficiency of two protocols from the same device
  15. H

    SDD Marathon 2013

    Ok, here's another scenario. Bob is an account, his job involves a number of repetitive tasks and he realises that developing a software solution would improve his efficiency. 1. What should Bob consider before beginning development. (3) 2. Bob decides to go ahead with development. Bob has...
  16. H

    SDD Marathon 2013

    They could ask any of those questions. It's more likely that if they ask 3 they'll give you a diagram to base it off. 1 is unlikely, but could be in there (I swear something similar was in a past paper). If it is in there it will be the hardest question in the option
  17. H

    SDD Marathon 2013

    They wouldn't do all three together. Each question by itself could easily be done. 2. Is actually very easy if you think about it
  18. H

    MX1 Predictions

    It will probably be like the 2u paper where the last question isn't the hardest.
  19. H

    SDD Marathon 2013

    Ok here's a hard question from the hardware option: 1. Draw a full-adder (3) 2. Complete a truth table for a full adder (2) 3. Write the formula for a full-adder in boolean algebra (2)
  20. H

    SDD Marathon 2013

    You have to know how to write them, I would learn how they work and then just reproduce them rather than memorising them. (The exam is tomorrow, there is no way you can memories all of them in that time). Focus on the sorts, because the others are all pretty obvious.
Top