Hi, Thanks for pointing that out You are correct - the method needs a return type, which should be void in this case. I'll add that. It might be worth pointing out that documentation testing , which was mentioned in lectures, is a good way of avoid...

Another minor update to a labsheet I thought I'll mention, lab 4 at the bottom it has an example function " public setMinutes(int minutes) this.minutes minutes; " I believe the method signature should be "void setMinutes(int minutes)"

Hi Xia, You're correct. The expression should actually contain the clause m a, not m a. Then the assignment "m a 0" will result in m a evaluating to false, which is what is required. I'll correct that on the lab sheet shortly. Thanks Arran

In Lab 6 Part 2, for question c (G (m a) (H U)), to make the clause G active, we need both (m a) and (H U) to be false. However, if m a 0, then (m a) will be true, and regardless of whether G is true or false, the overall result will be...

No worries Unicode is a bit of a complicated topic, so I've tried to avoid going into it in too much detail (though Wikipedia has a good discussion of Unicode for anyone who's interested, and there's a useful blog post on Java's use of Unicode here ...

Hi Arran, Thank you. Your answer is really helpful. It cleared things up for me.

Just to let you know, I've updated the lab 3 worksheet, which I saw had a couple of other portions which were out of date. Cheers Arran

ANONYMOUS wrote That's a simplifying assumption I'll make a note of that in the lab sheet. Actually, Java chars are 2 bytes (16 bits) in size. They can therefore take on 65,5356 distinct values. (Also, note that you linked to version 8 of the Ja...

Hi, Yes, that's a mistake in the solution I'll correct it. However, I'll note that if you look at the other paths listed on that same line, and think through what they represent, you should be able to work out both that it's incorrect, and what th...

Hi Kazi, That's not correct that's not what the definition of "simple path" is. I recommend checking the lecture slides again to see what the definition of a simple path is. Cheers Arran

Hi, I think you raise too many questions for me to easily answer all of them in a single post. I recommend dropping in on a lab next week, and discussing them with the teaching staff then. Briefly, however the documented behaviour of a method or class...

Hi Arran, In lab 3.1 Binary Search-question b, you said the input domain consists of a set of all possible chars s (there are 256 of them). I am curious why there are 256 possible chars. Is it because each character is 8 bits long and thus has 256 poss...

Also regarding prime paths, in the solution for lab 4, this is listed as a prime path. "EFBCDEF" Is this incorrect? The first and last node are different and F and E both appear twice, so from my understanding this is not a simple path, and so can't b...

I have a confusion from the question 3 of First Semester Examinations 2020. I have quoted the question below. Q3 "List at least four prime paths through the state diagram, using the letter labels. At least one prime path should pass include node D tw...

Yes it does, thank you

Hi Arran, I'm unable to attend the labs this week so posting here. I wanted to ask about the stack class in lab 3. "Some possible characteristics Does the array have zero elements in it, or one, or more? (This partitions the domain into 3.)" I'm a little...

Hi, No, you don't. Cheers Arran ANONYMOUS wrote

As per my previous post post , there are no changes. post https secure.csse.uwa.edu.au run help5501?p np opt B34 year 2024 Cheers Arran ANONYMOUS wrote

hi professor, I wanna ask do we need to draw a table similar the lecture when we encounter questions like the 'Monster Release Example' in the exam?

Hi Arran, Because of the changes discussed for the mid sem test, I wanted to confirm the date for the mid sem test for next week as I'm a little uncertain. According to the github page, the mid sem test is "Available 11 59 pm Wed 11 Sep Due 11 59 pm Th...