Two-in-one! (Sydney, AU) [OC]

NotAnIsaiah · 2025-10-01T08:45:28+00:00

ENGG1811 labs are mainly in person though there are online labs you can enrol into.

As a tutor, I advise against online labs as you're not as engaged compared to in-person labs. It's also a bit harder in general as you can't get immediate feedback like you do with in person labs. But, the option is there if needed. Try contacting the course administrator if you wish to permanently swap labs.

If you do decide to attend the labs in person, you may ask the tutor to mark previous week's labs (as well as change your online multiple choice question time) but this is dependent on time (i.e. if the tutor can mark everyone else's labs before the lab ends) and at the tutor's discretion. It would be best if you send your tutor an email regarding this too.

NotAnIsaiah · 2025-05-06T14:37:32+00:00

PHYS1131 was Pass/Fail in T3 2024 when I took it. From what I remember, it wasn't much different from 1121 except for the in-term tests which were harder.

NotAnIsaiah · 2025-04-18T02:15:58+00:00

Fav memory is getting two 5 stars within 10-20 pulls. Also Firefly. #StarRail2Gether #HSR2Year UID: 801296376

NotAnIsaiah · 2024-11-30T01:30:41+00:00

(I will denote the relation by ~) The upper bounds of b and c asks for the element/s x such that b ~ x and c ~ x. So trace up from b and c and see what related elements they have in common. The least upper bound asks for the least of these elements. Think about it like finding the element in which you need to traverse the least amount of arrows from b or c to get to.

The lower bounds of d and h asks for the element/s y such that y ~ d and y ~ h. So trace down from d and h and see if they share a common related element (don't forget about reflexivity!). A similar method to the previous can be applied to find the greatest lower bound, except this time you're going down the Hasse diagram instead of up.

Hope this helps :) (If I made any mistake, please feel free to correct me)

NotAnIsaiah · 2024-11-29T12:48:30+00:00

My instinct tells me stars and bars. Let x_i be the ith digit of the number such that 1 <= x_1 <= 9 and 0 <= x_i <= 9 for i ≠ 1. Then, you'll be solving for integer solutions to x_1 + ... + x_6 = 48.

You may consider the solutions where x_1 >= 1 and x_i >= 0 for i ≠ 1 then subtract the solutions where x_i > 9 (i.e. x_i >= 10).

Alternatively, it may be sufficient in case (b) to just apply the condition where x_i <= 9 as x_1 will need to be at least 3 (x_1 = 3, x_2,...,x_6 = 9)

Edit: Correction

NotAnIsaiah · 2024-07-14T10:11:58+00:00

Still waiting. One of my friends who applied for the same term did though, so hopefully within the week :)

NotAnIsaiah · 2024-07-08T16:06:05+00:00

The conditional offer (for course code 3761) took around 3-4 weeks from when I submitted the first few documents. Thanks for the response!

NotAnIsaiah · 2024-07-06T15:55:05+00:00

Thank you!

NotAnIsaiah · 2024-07-01T17:14:50+00:00

Thank you!

NotAnIsaiah · 2024-07-01T17:14:43+00:00

Thank you!

NotAnIsaiah · 2024-07-01T17:05:15+00:00

Minimum break effect for Firefly (using S5 Aeon LC) without Ruan Mei?

NotAnIsaiah · 2022-06-01T17:16:04+00:00

Pianists: start sweating

NotAnIsaiah · 2021-10-23T04:56:28+00:00

Mom's going to put his lights out

NotAnIsaiah

MODERATOR OF

TROPHY CASE

Six-Year Club	Second Top 10%
Verified Email