General Thoughts: Software Design and Development (1 Viewer)

[Gigacube]

Finished in the end with about 15 minutes to go as well. But people I know who do reasonably well just finished in time though.

It seems like the inclusion of more algorithms threw people off this year so I'm not surprised if people just managed to finish. I also found MC to be more straightforward this year so that shaved a few mins off for me.

 

[Hpakins]

could not do that fucking encryption algorithm...

everything else was pretty straight forward... the programming paradigms option was a little harder than previous years I thought :\

 

[ShadowCry]

It was in the encryption question something along the lines of "Gone Fishing"

 

[ahdil33]

It was in the encryption question something along the lines of "Gone Fishing"

Oh yeah

"GONE FISHING YAY!"

Can't believe I didn't notice that til now haha. The fish will never die.

 

[onedaysnotice]

HOLY FUCK THAT THE WORST EXAM TO HAVE A CLASH WITH.

3 hours of CAFS then 3 hours of this paper = death. Frkn got a headache.

Expecting 60 raw.

Multiple choice was heaps easy
The main section was fucking hard
And the option topic (interrelationships) was pretty easy.

 

[huynguyencab]

I sat there for until the exam is over . I find the Paradigm questions easy though and too many algorithms.

 

[GoldyOrNugget]

MC was not straight-forward at all. Plenty of gotchas. 2 examples:

- recursive EBNF definition
- sorted by release date but you have to linear search for title

 

[mickstarify]

MC was not straight-forward at all. Plenty of gotchas. 2 examples:

- recursive EBNF definition
- sorted by release date but you have to linear search for title

Fuck linear search title? shit!

 

[ArguablyMitch]

Fuck my life. That's all.

So happy to be finished though!

 

[ahdil33]

MC was not straight-forward at all. Plenty of gotchas. 2 examples:

- recursive EBNF definition
- sorted by release date but you have to linear search for title

The answer to the EBNF was C right? like letterletternumberletterletter?

Because from my calcs there could only be an odd number of only letters and that didn't exist. Or something.

Lol I noticed that one too, but yeah said sorted by released date.

For the positive integer counting one, I put needs a loop but not necessarily an array. Is that right?

 

[Cyberbully]

The answer to the EBNF was C right? like letterletternumberletterletter?

Because from my calcs there could only be an odd number of only letters and that didn't exist. Or something.

Lol I noticed that one too, but yeah said sorted by released date.

For the positive integer counting one, I put needs a loop but not necessarily an array. Is that right?

mu1um from memory.

linear search, cause binary is search ineffective if not sorted to what is required

yes. add the sum of numbers, keep a counter, at the end numbers/counter. no array.

 

[Mayazcherquoi]

Very easy examination I thought. Finished in plenty of time

MC was not straight-forward at all. Plenty of gotchas. 2 examples:

- recursive EBNF definition
- sorted by release date but you have to linear search for title

Yep, noticed those too

 

[8student]

simple s***