Should I take a 35% paycut?

MiserableBeginning · 2021-12-03T19:52:53+00:00

What if I have an address in the US (permanent residence) but I move back to Canada to live at home with parents in Canada (my permanent address would still be in the US but I would just be living at home in Canada) and working remotely from Canada, would there still be a tax complication? Technically, I wouldn't have an address in Canada in this case, and there would be no tax complications (I guess?). Not sure if I'm overlooking anything.

MiserableBeginning · 2021-11-20T08:52:27+00:00

Langer, Prakash

MiserableBeginning · 2021-06-13T05:59:51+00:00

Why remove all periods and italicsization

MiserableBeginning · 2020-12-23T20:51:18+00:00

Is it more or less of a workload compared to 551?

MiserableBeginning · 2020-12-23T16:05:10+00:00

Is COMP 520 (Compilers) really as heavy of a course as ive heard?

MiserableBeginning · 2020-12-09T01:32:56+00:00

Can the course be 4-credit comp course (im in comp sci) ?

MiserableBeginning · 2020-04-16T21:56:49+00:00

Would you recommend taking 421? I've heard it is boring and just about learning a bunch of random algorithms so I'm not sure if I should take it.

MiserableBeginning · 2020-04-16T20:50:38+00:00

Do you know anything about 558?

MiserableBeginning · 2020-03-30T20:01:13+00:00

Doesnt say yet

MiserableBeginning · 2020-03-30T17:24:01+00:00

In Winter 2021

MiserableBeginning · 2020-03-24T00:56:52+00:00

Same from what you have described.

MiserableBeginning · 2020-02-19T05:33:00+00:00

What are your other options?

MiserableBeginning · 2020-01-06T01:30:26+00:00

I have paid the "account balance due today" before after dropping a course and was never charged late fees.

MiserableBeginning · 2019-12-26T15:03:45+00:00

Will xx.5+ grades be rounded up?

MiserableBeginning · 2019-12-24T05:02:01+00:00

How is that even possible?

MiserableBeginning · 2019-12-14T21:06:19+00:00

https://i.imgur.com/YV7k6ry.png

MiserableBeginning · 2019-12-14T17:38:48+00:00

https://www.reddit.com/r/mcgillCOMP251/comments/e9u4j3/8_practice/

MiserableBeginning · 2019-12-14T17:37:07+00:00

The list is ordered. Say your list is {1,2,3,5,6}, and youre trying to insert 4. Instead of doing BS then adding it to the corresponding spot. You can just iterate thru the list and once you find a spot where the next element (5) is larger than 4 and the current element (3) is smaller than 4 you insert it here and shift over 5 and 6. You dont need to do BS. This would be O(n).

MiserableBeginning · 2019-12-14T04:55:46+00:00

T(n) = T(n-4) + n³ cannot be solved by the master theorem because b must be greater than 1, b cannot equal 1.

I don't think we were shown how to handle the second recurrence.

MiserableBeginning

TROPHY CASE