Search results

Agreed. Once i actually research and learn what we're actually meant to do (ie. what shouldve been taught in lectures), i find the assignments pretty simple. I guess for those that haven't learnt java its a little hard to start since they dont teach java syntax at all. Edit: anyone know how...

Yeah the assignments have been...interesting. Heres hoping assignment 3 is completely theoretical and involves no coding :p Has anyone actually done any work at all in tutes? I honestly havent taken a look at one tute question yet, and it seems most of those in my tute havent either.

It compares them automatically using a function in the BinaryTreeNode class called compareTo. All you need to do is add the nodes into the priorityqueue and it automatically sorts them by weight. The only functions you need for the priorityqueue are add(node), poll() and size(). Calling the...

You can count it as a science elective

agreed ^^ HPSC 1100, two fairly short essays (~800 words), three short answer tests, fairly straight forward. Most people got Credit or higher in the first test.

Usyd isnt co-op no, but they do have entry scholarships for BIT (I got one myself). Since they're not co-op you don't have to do the industry placement during your degree also (something which i wasnt too keen on doing in the middle of my degree). If you've got the marks, and want to get into...

Yeah by the last layer having all the leaves it satisfies that criteria. Each node cant possibly have a leaf because then you'd get a tree which has height like 256, which sucks if your first byte in the file youre meant to compress it right at the bottom and you need to represent it by 256 bits.

Well you'd have two functions wouldnt you? A left and a right rotation. The zig-zig and zig-zag are just applying these to the parent/grandparent nodes. Are we allowed to add extra functions to the classes we can modify? I've never really needed to include extra functions before, and being my...

1. It will read and write to the compressed file whatever the current value of A is, so first 001, then next time it'll write it as 11100. 2. Splaying is only done to internal nodes (the value passed to the splay method has to be an internal node). I assume you splay the parent of the leaf...

i only have windows xp at home :( :o *shame*

Huffman compression part runs fine for me, been having trouble with the splaying for 2 days, it just runs on an infinite loop, cant get the splaying right :(

I did first year at usyd in the bachelor of IT. This is my first semester at unsw. This year im doing: Session 1 COMP 2711 Higher Data Organisation HPSC 1100 Cosmos and Culture MATH 2111 Higher Several Variable Calculus MATH 2240 Introduction to Oceanography & Meteorology MATH 2901...

I had initially planned that too, and sort of wish i had to check out the new subject. Instead i left comp2041/2121 for session 2. I dont think you're missing out on anything. In reality, i havent even completed first year comp subjects. UNSW credited me the 2nd semester 1st year comp subject...

lowest ive gone is 50%, funnily enough i HD'd the subject :/ <3 advanced maths

Any 2011/2711 students hang around this board? I'd post more on the designated forum but it seems pretty evident they dont like taking criticism on there. I think this is quite easily the most inefficiently run subject i've ever taken :mad1: Which sucks, since its probably the most important...

Started at looking at what i'll be doing after 4th year (need to start planning 3rd year subjects from next semester). Probably want to do a computer science and mathematics honours in 5th year, from there either go into computing industry or postgrad in maths i guess.

Depends what you want to do. USyd IT is a lot more technical, its basically a specialised advanced science degree, which means you need to do maths and software development in first year. From there, it really depends on what you want to do. If you want to do information systems and management...

Not true, im combined and have to do 6 uoc of geneds. It depends on how similar the two degrees you're doing are.

Nah, it was just the registry wasnt updated properly when IE7 uninstalled so it still thought IE7 was installed instead of IE6. When it saw no IE7, it redirected it to Firefox.

the derivative method works for all x but 0, so i guess you'd take 0 as a special case and do something like: Let a > 0 be any real number as small or large as you want and let f(x) = x3 f(0) = 0 f(0 + a) = a3 > 0 = f(0) f(0 - a) = -a3 < 0 = f(0) So f(-a) < f(0) < f(a) which preserves the...