Hey friend,

Happy to answer. Feel free to get in touch on one of the socials in my profile to discuss further.

Q1. I'm from Australia, and the target destination is USA. Although I have no firm plans, I want to have the option in future. Australian's have access to a particular visa called E-3, which I have failed to obtain in the past due to lack of degree.

Q2. Yes. Upon completing this, I will have a BSc in Computer Science from the University of London. It's a bachelor's degree as good as anywhere. The exams are proctored, and all the exams/assignments are graded via Goldsmiths University. It's 100% legit.

Q3. You pay per module, so you don't need to pay up front. You just pick how many modules you want to do that semester and pay for them. The only requirement is that you must complete enough modules per semester to finish within 6 years. Since the education is directly related to my work, it is also tax-deductible in my country.

I'm a CS professional of 15 years, getting a CS degree for visa purposes. I'm doing it via the University of London's World Class on Coursera [1], and it costs around ~20-25K USD for the whole thing. If all continues to go well, I'll be done in 3.5 years, all while working full time.

So that's another option to consider: do the CS degree part-time while working on breaking into the industry. You can adjust your workload each semester depending on circumstances, so it's flexible for someone job hunting.

[1] https://www.coursera.org/degrees/bachelor-of-science-compute...

My recent horror from some git work was discovering how git sorts its tree objects.

The docs just say to sort by C locale (byte-order sorting). Easy. Except git was sometimes rejecting my packfiles as being bogus per its fsck code, saying my trees were misordered.

TURNS OUT THERE'S AN UNDOCUMENTED RULE: you need to append an implicit forward slash to directory tree entry names before you sort them.

That forward slash is not encoded in the tree object, nor is the type of the entry. You just put the 20 byte SHA1 hash, which is to either a blob or a hash (or a commit for submodules).

So you can have one directory with directory "testing" and file "testing.md" and it'll sort differently than a directory with two files "testing" and "testing.md".

You can see a repro at https://gist.github.com/bradfitz/4751c58b07b57ff303cbfec3e39...

(So to verify whether a tree object is formatted correctly, you need to have the blobs of all the entries in the tree, at least one level)

Neat to see this done by hand! It helps demystify the magic behind git commands.

If you like this, I also recommend "Write Yourself a Git", where you build a minimal git implementation using python: https://wyag.thb.lt/

how can I know when it's ready?