• Help the next generation of students in the community for the new syllabus!
    Share your notes and exam papers on our Notes & Resources page
  • Like us on facebook here

General Thoughts: Software Design and Development (1 Viewer)

Gigacube

Active Member
Joined
Apr 19, 2010
Messages
1,335
Location
Australia
Gender
Female
HSC
2012
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

New Member
Joined
Dec 4, 2011
Messages
8
Gender
Male
HSC
2012
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

New Member
Joined
Mar 11, 2012
Messages
2
Gender
Male
HSC
2012
It was in the encryption question something along the lines of "Gone Fishing"
 

onedaysnotice

Member
Joined
Aug 27, 2011
Messages
262
Gender
Male
HSC
2012
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

Member
Joined
Nov 11, 2011
Messages
37
Gender
Male
HSC
2012
I sat there for until the exam is over :D. I find the Paradigm questions easy though and too many algorithms.
 

GoldyOrNugget

Señor Member
Joined
Jul 14, 2012
Messages
583
Gender
Male
HSC
2012
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
 

ahdil33

Member
Joined
Feb 28, 2011
Messages
183
Gender
Male
HSC
2012
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

Where do you live?
Joined
Oct 29, 2011
Messages
122
Gender
Undisclosed
HSC
2012
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

Member
Joined
May 28, 2010
Messages
59
Gender
Male
HSC
2012
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 :)
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top