Lecture 3: Machine Code – Richard Buckland UNSW

16 August, 2011 (09:13) | computer science | By: admin

Comments

Comment from gnamp
Time August 16, 2011 at 10:11 am

shhhhhhhhhhhh shhh shhh shhhhh

Comment from CrazyForCooCooPuffs
Time August 16, 2011 at 10:39 am

a chalk board?

Comment from FokuzBoi
Time August 16, 2011 at 11:30 am

I also realize that the 4917 cannot do arithmetic involving any numbers larger than 15, be it the inputs or the outputs, but instead resolves to clock arithmetic e.g. 15=15, 16=0, 17=1 and so on. Could someone verify this please?
Thanks :D
However, I do find it sort of strange that the emulator being used doesn’t do the same with negative numbers to negative infinity.

Comment from FokuzBoi
Time August 16, 2011 at 12:08 pm

I’m completely new to this. Probably an A person by definition of Buckland. But I feel that both addition and if programs can be optimized.
Addition
9,14,10,15,1,11,8,8,0,7,0,0,0,0,0,0
and the Beep program
9,15,11,5,8,0,14,9,0,7,0,0,0,0,0,0,0
Both of them definitely leave out more free memory locations, which in turn could store more beeps that never happen :P
Would somebody mind checking this?
Thankee :D

Comment from dumdumwill
Time August 16, 2011 at 12:38 pm

I love this professor. The guy is freaking amazing and funny ; )

Comment from DroopyDog17
Time August 16, 2011 at 12:55 pm

very anxious guy

Comment from azkeyz
Time August 16, 2011 at 1:44 pm

This is not education in machine code , this is basic electronics.

This wasted an hour of my life.

Comment from Mandalorx10
Time August 16, 2011 at 1:53 pm

I prefer a road runner effect, beep – math – beep – print – beep
7.9.14.10
13.1.11.15
7.8.15.7
0.3.10.13

Comment from KelwinDicks666
Time August 16, 2011 at 1:53 pm

Respond to this video…

Comment from jongamerx21
Time August 16, 2011 at 2:47 pm

This is really great. I’m been wanting to learn this stuff for awhile now and these lectures are really helping. I really like how Richard speaks with such passion, confidence and humour.

Comment from avondale31
Time August 16, 2011 at 3:33 pm

9 2 10 15 1 11 14 7 8 14 7 0 0 0 0 3

that does the maths and also beeps twice

or you can make it beep five times with

9 2 10 15 1 11 14 7 8 14 7 7 7 7 0 3

or on an infinite loop with

9 2 10 15 1 11 14 7 8 14 7 13 10 0 0 3

which is even better :P

Comment from romonabruno
Time August 16, 2011 at 4:15 pm

What Mars bar?? Ill bring your mars bar for you on monday…..OR MY NAME ISNT RUPID! lmaooooooooo 31:29

Comment from Potenti4lz
Time August 16, 2011 at 4:26 pm

you guys still use chalk boards, woah ancient!

Comment from jugobugo
Time August 16, 2011 at 4:56 pm

cool teacher

Comment from ToshiroDK
Time August 16, 2011 at 5:17 pm

URL for the emulator:

cgi.cse.unsw.edu.au/~timothyw/cgi-bin/mc_emulator/emulator.cgi

Comment from drewmandan
Time August 16, 2011 at 5:22 pm

@Aphid4 7-13-0…beeps without that pesky math stuff

Comment from holyvincent420
Time August 16, 2011 at 6:09 pm

@Aphid4 code seems to b kewl…

can you tell me where is the emulator on the web???

Comment from holyvincent420
Time August 16, 2011 at 6:43 pm

@Aphid4 seems to b kewl…

can you tell me where is the emulator on the web???

Comment from theNewCodingFrontier
Time August 16, 2011 at 6:51 pm

@stabilini MIT opencourseware

Comment from theNewCodingFrontier
Time August 16, 2011 at 7:16 pm

@0neofthem well it is machine code…

Comment from 0neofthem
Time August 16, 2011 at 8:09 pm

college looks confusing

Comment from Delishful
Time August 16, 2011 at 8:55 pm

@KrakenSoup I learning love Fuck

Comment from SuperFeimer
Time August 16, 2011 at 9:41 pm

Anyone interested in writing emulators? Come to my blog :)
emucode (dot) blogspot.com

Viva La Richard Buckland…. if only he was my lecturer :(

Comment from SuperMaurad
Time August 16, 2011 at 9:53 pm

URL plz?

Comment from Aphid4
Time August 16, 2011 at 10:12 pm

9-13-10-14-1-11-15-7-11-11-8-0-0-3-10-0. Change this to:
9-13-10-14-1-11-15-7-11-11-8-0-13-3-10-0.
Now it produces (much more than) two beeps.

Write a comment