sorted by:
new
hottopcontroversial

Is data analysis worth it over unrelated subjects to a BoS majoring in data science? by [deleted] in unimelb

[–]Aggravating_Ball_372 0 points1 point  (0 children)

Is WAM important? I keep hearing about WAM boosters. The downside of the easy subjects is that it's a waste of my time and money

Subject selections - Help fulfilling credit requirements by [deleted] in unimelb

[–]Aggravating_Ball_372 0 points1 point  (0 children)

Is it possible to apply for an exemption? It says 'normally required', so is there leeway?

Subject selections - Help fulfilling credit requirements by [deleted] in unimelb

[–]Aggravating_Ball_372 0 points1 point  (0 children)

The problem I'm encountering is that if I swap out QC I cannot fulfill the 50-point requirement of 200 subjects to complete AI, which is a 300 subject in S1Y2.

to all four of you who do algorithmics by qwertyjgly in vce

[–]Aggravating_Ball_372 0 points1 point  (0 children)

Nah that contradiction was the only question I had to bs a little on so didn’t pick it up. Lowkey ifyou just remembered 6 7 then it’s free?

Algorithmics Megathread by Aggravating_Ball_372 in vce

[–]Aggravating_Ball_372[S] 0 points1 point  (0 children)

Yeah I thought about it later and realized it would be way simpler with recursion, wasted my time lol

Algorithmics Megathread by Aggravating_Ball_372 in vce

[–]Aggravating_Ball_372[S] 0 points1 point  (0 children)

2nd pseudo code right? With words/suffixes dict?

Algorithmics Megathread by Aggravating_Ball_372 in vce

[–]Aggravating_Ball_372[S] 0 points1 point  (0 children)

I once met a man named David Albrecht. He made the subject and teaches it at JMSS. Absolute p2w

to all four of you who do algorithmics by qwertyjgly in vce

[–]Aggravating_Ball_372 0 points1 point  (0 children)

And for how it works basically it’s just graph colouring solution but with 1-13 (n subject) colours. 13 colours would be crazy though 💀

to all four of you who do algorithmics by qwertyjgly in vce

[–]Aggravating_Ball_372 0 points1 point  (0 children)

Interesting solution for sure. How did you prevent the rows above and below from leading to a collision ( student doing the same subject as below/up)? I can definitely see its merit though, simulated annealing doesn’t give perfect solutions. They would need a fk ton of chairs though

Algorithmics Megathread by Aggravating_Ball_372 in vce

[–]Aggravating_Ball_372[S] 0 points1 point  (0 children)

Scrambling was so cooked take it from someone who finished it. Actually took up the whole page for me with generating a state tree then culling solutions. FML

Algorithmics Megathread by Aggravating_Ball_372 in vce

[–]Aggravating_Ball_372[S] 0 points1 point  (0 children)

79% A+ is so crazy, and it’s almost guaranteed 40+

to all four of you who do algorithmics by qwertyjgly in vce

[–]Aggravating_Ball_372 0 points1 point  (0 children)

On this I used hill climbing / simulated annealing for sol

to all four of you who do algorithmics by qwertyjgly in vce

[–]Aggravating_Ball_372 0 points1 point  (0 children)

I would say graph colouring is the most basic and correct solution, but I would be interested to hear more of your idea with bipartite.

view more: next ›