The BOS are a bunch of Phucken Wankers (1 Viewer)

[Sir Dave]

Whats wrong with the people at the BOS?
How do you expect to write 2 bloody algorithms in 3 Hours?
It seems like they think SDD students are Bill Gates, bloody Arseholes.

Is there a way to claim mis-adventure forms without comprimising post-HSC parties?

This SDD Exam screwed me up BIG-TIME!

 

[vertigo]

OMG dude, don't worry... I felt the same way.

But its not like it came as a surprise or anything, did you do last years HSC? It was just as bad...

 

[blah]

yeh well if u did the other option topic like me we had to do 3 algorithms!!!

 

[BraZen]

yeaH in hardware they had 3.. and it was longer than the other two!

we have about 50 people who do sdd.. about 10-15 people just walked out early.

 

[sunny]

Because they couldn't do it?!

I mean at least write something to get some marks...

 

[blah]

maybe sdd isnt gonna count towards there best tens units and rather leave early to study their other subjects or it was their last exam and couldnt be fuked.

but anyhow its pretty selfish since it will affect other ppl's moderated assessment marks in their skool except for 1st place.

we had one dude leave early in my skool.booooo

 

[sunny]

Great just great so maybe this year we'll end up with 5 people in band 6

 

[blah]

lol, i thought bos was meant to make more band 6 ppl this year.

by making a harder exam?? or by marking easier??

GW pags

 

[idontknow]

what was the deal with the 2nd algorithm, it must
- create an array of records
- sort the array
- calculate number of tickets sold

First i thought we didn't have to know how to write sort algorithms but some things change. I love algorithms like these where they give you half hearted information to write a porgram! Good work BOS

 

[sunny]

That was definitly a weird question....it tells you that the files are already sorted....and then it tells you to sort the array.

But if you just read the file in sequential order then your array will already be sorted anyway.

I think they wanted us to sort a sorted array.

 

[BraZen]

Yeah.. i looked up and was wonder where the hell did every1 go.
talked to some of them b4.. they probably just gave up.. for alot them they already planned not to count sdd.

i was reading for a BOS newsletter.. they where wondering why not many people got band 6 last.. they where going to change elements in the exam to fix this.. uMM yeah.. they did a gREAT job.

 

[Winsux]

i'm first in the year for SDD at my school, and i still wasn't planning SDD to count

 

[Morgues]

Exactly.......
why in the world did they want to sort a sorted array?
I sorted anyway because I wanted to show I know the sort algorithms that I spent hours learning the night before

 

[Milly]

Originally posted by Winsux
i'm first in the year for SDD at my school, and i still wasn't planning SDD to count

Yeah... same here! It's my worst subject by far...

 

[saladsurgery]

Originally posted by sunny
Great just great so maybe this year we'll end up with 5 people in band 6

even so they reckon a few of last yr's band 6'ers shouldn't of been there... the criteria were pretty much impossible.

 

[milan24]

i am glad it is my last and worst exam, i hope the moron who write this exam will experience the way we feel about it sometime in their freaky life. if i know who they are, i will express my feeling thouguht my punches and kicks

 

[BennyT]

Thats not the worst part,

The fact there is a commitee that checks out the exam before it starts printing, and the BOS asks them if its fair!!!

My teacher was part of it the year before!

 

[iptteacherssuck]

that algorithm wasn't too hard really

all u need to do was do something like this

Ticket is a record containing,
event number, event anem and numticketsold
end

begin prog1

ticketarray is an array containing ticket records indexed from 0 to number of tickets -1

count=0
while count<=lastindexof ticketarray
ticketarray[count] = read ticket /// random access cz they used random accces in the scenario
end while


DoSort(ticketarray)
Calculate (ticketArray)

end

begin ticketarray
sorting blah blah

but make sure u use ticketarray[index].eventnumber
I did selection sort
end

then calculateis ust

begin calculate

count=0
while count<= last index of ticketarray
print ticketarray[index].numbicketsold
print ticketarray[index].event number
count ++
endwhile

 

[vertigo]

Didn't they say they rearranged the bands for this year? Only because hardly anyone got band 6 last year?

There are 6 people in my school doing software design (all girls private school). They're all physics/4 u maths buffs... can you guess where that leaves me? :/

 

[vertigo]

Originally posted by iptteacherssuck
that algorithm wasn't too hard really

all u need to do was do something like this

Ticket is a record containing,
event number, event anem and numticketsold
end

begin prog1

ticketarray is an array containing ticket records indexed from 0 to number of tickets -1

count=0
while count<=lastindexof ticketarray
ticketarray[count] = read ticket /// random access cz they used random accces in the scenario
end while


DoSort(ticketarray)
Calculate (ticketArray)

end

begin ticketarray
sorting blah blah

but make sure u use ticketarray[index].eventnumber
I did selection sort
end

then calculateis ust

begin calculate

count=0
while count<= last index of ticketarray
print ticketarray[index].numbicketsold
print ticketarray[index].event number
count ++
endwhile

Mine wasn't anything like that... *Shakes head* Now I know the real meaning of tragedy...