for me, I find it pretty reasonable to get consistently 19+/20 in the multi choice, 56+/60 in short, and 18+/20 in optionI want to know whats your averages for the 3 sections?
I'm averaging around 13 for sect 1, 53(only did the 2014 paper) for sect 2, 16 for sect 3.
I'm gonna fail, should not have crammed.
All the content questions are pretty straight forward in any software paper, and can definitely be bs'ed. The only places you would lose mark in short answer would be stuff like weird algorithms like in the 2014 one with the 2d array of records or diagrams in my opinion, which can cost you 4 or 5 marksreally? most of the content questions could be bs and becuz recent exams consists of more algorithms apparently I feel like they could be harder.
but currently, my 2015 paper MCQ is the highest with 15 and the rest before that and 2016 are consistent 13's.
Anyways thanks for the reply and GL!
I got not C (A+B) but yeah i was tilted having to retry it 3 times.Thoughts on today's exam? I found it pretty good tbh, all the algorithms were honestly pretty straight forward. The circuit simplification for Option Topic 2 had me stumped though, anyone else have trouble with this? I couldn't simplify it below 5 Logic Gates :/
I had a glance at question 35 after i finished just to see the kinda questions u guys got and i was so fucking confused LMFAO i feel bad for uThoughts on today's exam? I found it pretty good tbh, all the algorithms were honestly pretty straight forward. The circuit simplification for Option Topic 2 had me stumped though, anyone else have trouble with this? I couldn't simplify it below 5 Logic Gates :/
I thought that question was pretty straight forward since they gave you the length and extract subroutines alreadyHowever there was one algorithm i spent like 20 mins on which was the one where you had to find a match for a small string inside of a big string. I remembered doing a leetcode question with the same problem and I just sat there for so long thinking of my pythonic solution and how to make it suitable for pseudocode
ah well done i just did the truth table now and i think your output is right. nice work! how did you find the rest of the exam?I got not C (A+B) but yeah i was tilted having to retry it 3 times.
I did two nested FOR loops where it incremented 'Start' from 0 until the end of the string and the next FOR loops it incremented length from 1 till end of string - start (to make sure it didn't compare with any NULL values once the string had ended). Hopefully that works, I think it does / if not if gets pretty close. It tests all length combos starting at each letter. I then compared it with the smaller string after each sort and just flagged true when it was equal to that. Anyone else do something similar logic wise?that sorting algorithm question was annoying af
Most of it was alright. I completely forgot the way to access relative files so I just had to make some stuff up with the employee id.ah well done i just did the truth table now and i think your output is right. nice work! how did you find the rest of the exam?
Yeah i really overcomplicated my solution but im pretty sure ill get the marksI thought that question was pretty straight forward since they gave you the length and extract subroutines already
that was a different question than the one i was talking about (the string question), but i got something likeI did two nested FOR loops where it incremented 'Start' from 0 until the end of the string and the next FOR loops it incremented length from 1 till end of string - start (to make sure it didn't compare with any NULL values once the string had ended). Hopefully that works, I think it does / if not if gets pretty close. It tests all length combos starting at each letter. I then compared it with the smaller string after each sort and just flagged true when it was equal to that. Anyone else do something similar logic wise?
BEGIN IsMatch(string, BigString)
Let len = length(string)
FOR index = 1 TO length(BigString) - len STEP 1
IF extract(bigString, index, len) = string THEN
RETURN true
ENDIF
NEXT index
RETURN false
END
I got this too!!not C (A+B)