Lecture 13: COMP1917 Higher Computing - Richard Buckland UNSW

[@mrmadmaxalot]

For any who are curious, at 37:00 when he guesses that the 2 empty bytes are due to divisibility by 4, he is actually correct. The problem is he forgot it was allocating from the bottom of his graph. If you look at it you will see that there are 6 bytes stored in 2 4-byte chunks, leaving a two byte gap at the end between the byte variables and the int. This means the final address of each 4-byte chunk is divisible by 4 (the final empty byte is 48, which divides evenly).

[@dpilankar]

Thanks for the lectures, I love the stories Richard tells :)

[@sspoke]

i dont think u gotta do it like pointer+1; if its a byte pointer could u do like pointer+=6 or whatever pointer=pointer+6;

[@YoVille451]

Late AF response but what you said is legal. You can even subtract but I don't think that multiplication and division are accepted

[@vicsar]

Lesson begin @ 10:02

[@rodney6325]

Haha!! Mate the teaching begins @ 00:42

[@justcurious1940]

@@rodney6325 The excitement begins @ 00.00 .

[@snazelle]

does anyone know what the TASK ONE assignment was that year? It had something to do with Vikings....or Task two? it would make it easier to follow along! thanks!

[@PangeaMinor]

@snazelle The task was writing a program that took in a number and printed out how a viking would've pronounced it. Here's the test program used for demonstration: htAtp://cgi.cse.unsw.edu.Aau/~hs1917/10s1/bjorn/index.cgi (remove upper case A's)

[@J90JAM]

The rest of the COMP1917 lectures aren't easy to find. Help?

[@ASeventhSign]

I lie to the compiler.

[@SauronsEye]

Any paraody of Richard's lecture style would have to involve a hand on the forehead.

[@thisusernameistaken2]

Parolu Esperanton!

[@intindse]

15:00 nice wallpaper

[@Desrathedemon]

39:06 hilarious!