1. Higher Computing
2. Inside a Computer
3. Machine Code
4. Simple C Program
5. Clarity (C Programming #2)
6. Solving Problems
7. Side Effects
8. Writing a Simple C Program
9. A Simple Recursive Function
10. Functions
11. What to Do When Things Go Wrong?
12. The Mechanics of Function Calls
13. The Mechanics of Function Calls (Part II)
14. The Amazing Alan Turing
15. Higher Computing
16. The Turing Test
17. Higher Computing
18. Frames (revision)
19. Arrays (Part I)
20. Arrays (Part II)
21. Pass by Reference: Arrays #3
22. Game Design
23. Everything You Need to Know About Pointers
24. The Most Important Thing
25. Stack Frames
26. eXtreme Programming
27. A Miracle
28. Programming in the Large
29. Stress
30. Random Numbers
31. The Trouble With Concrete Types
32. Abstract Data Types in C
33. The Major Project
34. Task2 Rewritten as an ADT
35. Steganography
36. Don't Give Up
37. The Australian National Anthem
38. Linked Lists
39. Experimenting with CMOS
40. Complexity & Trees
41. Programming Errors
42. Taste of Graphics
43. Sample Tree Code: Loop Detection
44. Ethics
45. Hamming Error Correcting Code
46. Professionalism
47. What Makes a Good Programmer?
48. The Entire Semester in 46 Minutes and 2 Seconds
49. Learning and Teaching Computing
50. The Strange Case of the Erotic Kiss

In this course, Prof. Richard Buckland gives 51 video lectures on Higher Computing. This is the introductory course for computer science at UNSW. This course consists of three strands: programming, systems, and general computer-science literacy. The programming strand is further divided into two parts. For the first half of the course we cover small scale programming, in the second half we look at how to effectively use teams to produce more substantial software. In the systems strand we will look at how computers work. Concentrating on microprocessors, memory, and machine code. In the literacy strand we will look at topics drawn from: computing history, algorithms, WWW programming, ethics and law, cryptography and security, and other topics of general interest. The strands will be covered in an intermingled fashion. The following course, COMP1927 "Data Structures and Algorithms", will be recorded and posted in semester 2 of 2009.