Search results

what? dual adv maths and cs? or bsc (mathematics) bsc (cs)?

LAMEEE maths is just a tool to make more awesome programs

as cyberbully's pseudo-tutor (technically a mentor of another tute group that ran parallel to cyberbully's tute group), i'll tutor you better >: DDD

Goddammit where's the bug there's no bug that is a perfect binary search

Hmm I'm with cyberbully here. AND is a binary operation. I guess it's shorthand for (a AND b) AND c, but I don't think that's a valid depiction in a circuit.

It looks fine to me... he's using dual inclusive bounds and 1-based indexing. Where's the bug?

Issues I have with the textbook: - Only released halfway through the year. wtf? - Plenty of typos and grammatical errors, very unprofessional - Too damn long - Goes into content that's not even touched upon in the syllabus, and would probably lose you marks if you talked about it (e.g. big-O)...

To what detail do we need to know unicode? Samuel Davis goes into a LOT of detail, seems unnecessary.

Do we need to know all of these or just one from each category?

You forgot to increment the program counter so it points to the next instruction.

I was just correcting JaySimmo's post on page 3. It's not required in the course.

Yeah this is pretty much the expected solution. Try to actually implement it though in pseudocode. There are faster ways, but as usual they're not within the scope of the course.

- Selection sort requires at most n swaps, so it's effective on systems where memory manipulation is computationally expensive - Insertion sort runs best on almost-sorted lists - There's no real reason to use bubble sort, other than it being intuitive

All the sorts are O(n2). Linear search is O(n). Binary search is O(log n). The lower-bound for comparison sorts is provably O(n log n). EDIT: this means that binary search will try at most $ $\log \lceil n \rceil $ $ comparisons. This was tested in last year's HSC multiple choice.

In terms of big-O notation, all the SDD sorts are equivalent (i.e. in the worst case, they're all equally shitty). In terms of little-o notation however, selection sort is worse and insertion sort and bubble sort are equivalent (i.e. selection sort is always shitty, whereas the other two have...

Sample answers: Question 21 (c)(i) Answers could include: • Saves development time • Routines are already tested hence saves testing time • Helps maintenance by providing well-understood standard routine with consistent behaviour • Library routines can be updated independently • Library...

In terms of standard algorithms, are there limitations on how we choose to implement them? e.g. there are dozens of ways to implement a binary search. Are we allowed to use any of them?

ALGORITHM QUESTION (this one is moderately difficult, but definitely within the scope of the course, and similar to a past HSC question): You're given a sequential file of records representing item purchases. Each record contains the name of the customer (string) and the number of items they...

Alright guys focus! What were the major syllabus changes that will make a practical difference to us in the exam?

Don't think so. Mass A one was at a geostationary height, but it was on the vertical axis -- i.e. it wasn't orbiting, only rotating. It would thus plummet to the earth. However, Mass B was rotating with the tower, i.e. rotating with a period of 24h. So if the tower were to disappear, it would...