0
(
ratings
)
1
students
Created by:
Last updated:
Duration:
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
CS1: Higher Computing (UNSW). Instructors: Richard Buckland, Tim Lambert, and Malcolm Ryan.
This is a collection of the 2008 lectures of COMP 1917 - the introductory course for computer science at UNSW (University of New South Wales). 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.
Course Curriculum
- Lecture 01 – Higher Computing Unlimited
- Lecture 02 – Inside a computer Unlimited
- Lecture 03 – Machine Code Unlimited
- Lecture 04 – Simple C Program Unlimited
- Lecture 05 – Clarity (C programming #2) Unlimited
- Lecture 06 – Solving Problems Unlimited
- Lecture 07 – Side Effects Unlimited
- Lecture 08 – Writing a simple C program Unlimited
- Lecture 09 – A simple recursive function Unlimited
- Lecture 10 – Functions Unlimited
- Lecture 11 – What to do when things go wrong? Unlimited
- Lecture 12 – The mechanics of function calls, The Amazing Alan Turing Unlimited
- Lecture 13 – Higher Computing Unlimited
- Lecture 14 – The Turing Test Unlimited
- Lecture 15 – Higher Computing Unlimited
- Lecture 16 – Frames (revision) Unlimited
- Lecture 17 – Arrays (part 1) Unlimited
- Lecture 18 – Arrays (part 2) Unlimited
- Lecture 19 – Pass by reference: Arrays#3 Unlimited
- Lecture 20 – Game design Unlimited
- Lecture 21 – Everything you need to know about pointers Unlimited
- Lecture 22 – The most important thing Unlimited
- Lecture 23 – Stack Frames Unlimited
- Lecture 24 – eXtreme Programming Unlimited
- Lecture 25 – A Miracle Unlimited
- Lecture 26 – Programming in the Large Unlimited
- Lecture 27 – Stress Unlimited
- Lecture 28 – Random Numbers Unlimited
- Lecture 29 – The Trouble with Concrete Types Unlimited
- Lecture 30 – Abstract Data Types in C Unlimited
- Lecture 31 – The Major Project, Task2 rewritten as an ADT Unlimited
- Lecture 32 – Steganography (hidden messages) Unlimited
- Lecture 33 – Don’t give up Unlimited
- Lecture 34 – The Australian National Anthem Unlimited
- Lecture 35 – Linked Lists Unlimited
- Lecture 36 – Experimenting with CMOS Unlimited
- Lecture 38 – Complexity & Trees Unlimited
- Lecture 39 – Programming errors Unlimited
- Lecture 40 – Taste of Graphics Unlimited
- Lecture 41 – Sample Tree Code: loop detection Unlimited
- Lecture 42 – Ethics Unlimited
- Lecture 43 – Hamming Error Correcting Code Unlimited
- Lecture 44 – Professionalism Unlimited
- Lecture 45 – What makes a good programmer? Unlimited
- Lecture 46 – The entire semester Unlimited
- Lecture 47 – Learning and Teaching Computing Unlimited
- Lecture 48 – The strange case of the erotic kiss Unlimited
About the instructor
Instructor Rating
Reviews
Courses
Students
