• Lecture 0: Introduction to Computing 1B and C
  • Welcome to Higher Computing 1B
  • Objectives
  • Prerequisites
  • Lectures
  • Subject Materials
  • Tutorial and Laboratory Class Allocation
  • Accelerated Labs
  • Assessment Summary
  • Final Exam
  • Textbooks
  • Other C Books
  • Top 10 Ways to Piss off your Lecturer
  • C, What is it Good For?
  • C - Phylogeny
  • C - Ontogeny
  • C Offspring
  • Why has Computing 1B changed to Java from C
  • A C Program
• Lecture 1: Introduction to Procedural Programming
  • Functional vs Procedural Programming
  • Programs and States
  • Variables
  • Names
  • Keywords
  • Assignment
  • Functional programming is not about ``state change''.
  • Summing the first 1000 integers
• Lecture 2:
  • The if Statement
  • If statement #1 - Flow of Control
  • If statement #2 - Flow of Control
  • The if statement
  • Guards vs. if
  • If Example - Dating for Engineers
  • Another Simple I/O Example: Celsius to Farenheit
  • I/O Example: Celsius to Farenheit

• Lecture 3: Types & Expressions
  • Installing gcc at home
  • Integral Types
  • Floating-Point Types
  • Boolean Types
  • Literals
  • Expressions
  • Operators
  • Arithmetic Operators
  • Comparison Operators
  • Boolean Operators
  • Evaluating Expressions
  • Precedence Levels
  • Expressions
• Lecture 4: Repetition
  • Top 10 Ways to Piss off your Lecturer
  • Repetition
  • The while Statement
  • while Example
  • While statement - Flow of Control
  • The do while Statement
  • The for Statement
  • The for Statement - flow of control
  • For Example - A Table of Squares
  • The break Statement
• Lecture 5: More Control Structures and a Programming Example
  • The continue Statement
  • If statement #1 - Flow of Control
  • If statement #2 - Flow of Control
  • While statement - Flow of Control
  • Break statement - Flow of Control
  • Continue statement - Flow of Control
  • For statement - Flow of Control
  • Program Layout
  • Braces - {}
  • Comments
  • Increment/Decrement
  • Operator-Assignment
  • Nested Loops Example - The 6 Times Table
  • Generating Random Numbers
  • Character I/O
  • Programming Example - Printing Random Numbers
  • Reading

• Lecture 6: Arrays
  • Friday's Lecture Cancelled
  • Types
  • Arrays
  • Using Arrays
  • Programming Example - Print an Array
  • Array Initialisers
  • Programming Example - Sieve of Eratosthenes
• Lecture 7: Strings
  • Week 4 labs
  • Strings
  • String I/O
  • Programming Example - Strings
  • fgets and the end of input
  • Programming Example - Upper Case Filter
  • Manipulating Characters
  • Programming Example - Upper Case Filter - revisited
• Lecture 8: Lecture Cancelled
  • Lecture Cancelled

• Lecture 9: Strings
  • Another Programming Example - Strings
  • Programming Example - Upper Case Filter - Character at a time
• Lecture 10: Functions
  • Functions
  • C versus Haskell Functions
  • Functions of type void
  • Functions with no Arguments
  • The return statement
  • Local variables in Functions
  • Arguments are Local variables
  • Function declarations
• Lecture 11: Multi-dimensional Arrays
  • Defining Constants
  • Multi-dimensional Arrays
  • Programming Example - Identity Matrix
  • Programming Example - Noughts and Crosses

• Lecture 12: Pointers
  • Pointers
  • The Address-Of Operator
  • The Dereferencing Operator
  • The Null Pointer
  • Be Careful Dereferencing
  • Using Pointers as Function Arguments
• Lecture 13: Pointers and Arrays
  • Pointers Arithmetic
  • Pointers and Array Names
  • Pointers and Indexing
  • Arrays as Function Arguments
  • Passing Sub-Arrays as Parameters
  • Multi-dimensional Arrays as Function Arguments
  • Programming Example - strlen
• Lecture 14: Discussion of Assignment 1
  • Discussion of Assignment 1
  • String Library
  • Programming Example - strcmp
  • Programming Example - strchr
  • Converting String to Numbers
  • The function main
  • Programming Example - Echo
  • Programming - Printing Sum of Arguments
  • Main - Return Value

• Lecture 15: Structures
  • Structs
  • Structs and Pointers
  • Scope and Lifetime of Objects
  • Local Variables
  • Local Variables with static modifier
  • Function Parameters
  • External variables
  • External variables with static modifier
  • Scope and Lifetime of Objects
• Lecture 16: Multi File Programs - Header Files and Libraries
  • Use of ++ and -- within expressions
  • gcc Revisited
  • Multi-file Compilation
  • Incremental Compilation
  • Accessing Top-Level Variables from Other Files
  • Header Files
  • Style Rules for Multi-File Programs
  • Dividing Program Between Files
  • Library
  • Maths Library
• Lecture 17: File I/O
  • File I/O
  • Programming example - cat
  • Programming example - cp

• Lecture 18: Completion of Last Week's Examples and Assignment Discussion
  • Completion of Last Week's Examples and Assignment Discussion
• Lecture 19: typedef and malloc/free
  • Typedef
  • Why - Use Typedef
  • typedef and structs
  • Overloading Typedef Names
  • void *
  • Dynamic Memory Allocation
  • sizeof Operator
  • Allocating Arrays with Malloc
  • Programming Example - Sieve of Eratosthenes with malloc
• Lecture 20: Variable Lifetimes and Malloc example
  • Pointers and Local Variables
  • Programming Example - get_word (with Major Error)
  • Pointers and Static Variables
  • Programming Example - get_word (with Major Error)
  • Programming Example - get_word (fixed)
  • realloc - grow a malloc'ed region
  • Programming Example - get_word (limit removed)

• Lecture 21: Linked lists
  • Self-Referential Types
  • Linked Lists
  • Types to Store A Linked List of Integers
  • Insert a Node at the Front of A Linked List
  • Print A Linked List
• Lecture 22: Linked lists
  • Test if a Linked List is Empty
  • Find the Last Node in a Linked List
  • Append Node to a Linked List
  • Testing Code
  • Better Testing Code
  • Whole Program
• Lecture 23: Deleting a Node from a Linked List
  • Deleting a Node from a Linked List
  • Finding the Previous Node
  • Deleting the Node
  • Deleting the First Node in a Linked list
  • Deleting a Node from a Linked List
  • Entire Program

• Lecture 24: Recursion & Linked lists
  • Recursive Functions
  • Factorial - Iterative and Recursive Solutions
  • Factorial - Iterative and Recursive Solutions - Whole Program
  • Free the Nodes of a Linked List
  • Create a Copy of a Linked List
• Lecture 25: Switch
  • The switch statement
  • Switch example - traffic light
  • switch - common mistake
  • switch as an alternative to if
  • Programming Example - int to words
• Lecture 26: C Preprocessor
  • C Preprocessor

• Lecture 27: Computer Systems
  • Computer Systems
  • History of Computer Technology
  • The von Neumann Computer
  • Memory
  • Processor (CPU)
  • Fetch-Execute Cycle
  • Processor Operations
  • Input/Output Devices
  • From High-level Languages to
    Low-level Languages
  • A real processor: MIPS R2000
  • Why don't we write machine code?
  • Assembly Code
  • Why do we write assembly code?
  • Assembler to Machine
  • Assembly Code
• Lecture 28: MIPS R2000
  • MIPS R2000 Architecture
  • MIPS Registers
  • MIPS Memory Map
  • Data and Addresses
  • Memory Addressing Modes
  • Describing MIPS Assembler Operations
  • Setting Registers
  • Accessing Memory
  • Storage order of words
  • Arithmetic Instructions
  • Logic Instructions
  • Bit Manipulation Instructions
  • Jump Instructions
  • Branch Instructions
  • System Calls
• Lecture 29: Writing MIPS Programs
  • goto in C
  • Writing MIPS Programs
  • Mapping C into MIPS
  • Example Printing First 10 Integers
  • Constants
  • Variables
  • Assignment
  • Translating if Statements to MIPS
  • Translating if Statements to MIPS - Example
  • Translating while Statements to MIPS
  • Arrays
  • Arrays - Example

• Lecture 30: Continuation of Previous Lecture on MIPS
  • Continuation of Previous Lecture on MIPS
• Lecture 31: Discussion of Assignment 2
  • Discussion of Assignment 2
• Lecture 32: Integer Representation and Bitwise Operators
  • Bases and Digits
  • Hexadecimal
  • Representing Integers on Computers
  • Signed Magnitude
  • Two's Complement
  • Why Two's Complement
  • A Program to View representation of Integers
  • Other Number Representations Material
  • C Bitwise Operators
  • Bitwise Operators - Example Program

• Lecture 33: Implementing Functions on the MIPS
  • Where Andrew Was This Week
  • Variable Allocation
  • Function Calls
  • Implementing Function Calls
  • Returning a Result
  • Passing Arguments
  • Using Parameters
  • Preserving Registers
  • Stack Frames
  • Creating a Stack Frame
  • Example Function
  • Assembler for Example Function
  • Entire Assembler Program
  • Entire C Program
• Lecture 34: More on Mips
  • Pointers
  • Implementing Structs
  • Pointers and Structs
  • switch Statements
  • Example - Linked Lists in MIPS
  • MIPS Assembler to Construct and Print a Linked List
• Lecture 35: Binary search
  • A Postcode Server
  • Linear Search Unordered List
  • Linear Search Ordered List
  • Linear Search

• Lecture 36: Binary Search
  • Binary Search
  • Deriving Binary Search of an Array
  • Binary Search of an Ordered Array
  • Binary Search for Postcodes
  • A Postcode Server
  • Binary Search of an Ordered Array
  • How fast does log₂(N) Grow?
  • Searching A Larger Database
• Lecture 37: Continuation of Postcode Example
  • Using a Binary Tree
  • Read COMP1021 lecture slides on binary trees.
  • Using a Binary Tree - postcode.h
  • Using a Binary Tree - read_postcodes.c
  • Using a Binary Tree - search.c
  • Using a Binary Tree - time_search.c
  • Balanced versus Unbalanced trees
• Lecture 38: Continuation of Postcode Example
  • Table Lookup
  • Using Table Lookup - postcode.h
  • Using Table Lookup - read_postcodes.c
  • Using Table Lookup - search.c
  • Using Table Lookup - time_search.c
  • Strings and Table Lookup
  • Using a Hashtable - postcode.h
  • Using a Hashtable - read_postcodes.c
  • Using a Hashtable - search.c
  • Using a Hashtable - time_search.c

• Lecture 39: Sorting
  • Read COMP1021 lecture slides on sorting.
  • Sorting
  • Sorting Algorithms
  • Selection Sort
  • Analysis of Selection Sort
  • Quicksort
  • Quicksort Partitioning
  • Analysis of Quicksort
  • Best-case Performance of Quicksort
  • Worst-case Performance of Quicksort
  • Average-case Performance of Quicksort
  • Selection Sort versus Quick Sort - 200 items
  • Entire Program
• Lecture 40: Data structures - Case Study
  • Problem
  • Problem Decomposition
  • Linked Listed used to Count Words
  • Performance
  • Extrapolating Performance
  • Improving Performance - Inspection and Guessing
  • Counting Words with A Binary Tree
  • Binary Tree - Performance
  • Solving the Problem with A Shell Command
• Lecture 41: Exam
  • Cartoon
  • Assessment Summary
  • Hurdle Requirements
  • Check Your Marks
  • Written Exam
  • Written Exam - C Info Sheet
  • Written Exam - Core C Material
  • Written Exam - Core Systems Material
  • Written Exam - Systems Material
  • Practical Exam - Location and Time
  • Practical Exam - Format
  • Practical Exam - Materials
  • Practical Exam - Questions
  • Practical Exam - Hints
  • Sample Practical Exam
  • Automatic Marking
  • Practical Exam - Marking
  • Provisional Results
  • Supplementary Exams
  • Illness during Final Exam
  • Supplementary Exam
  • Good Luck

A zip file of all HTML is available

You can save paper and you printer quota by using the lz command when printing

For example, if when printing from inside netscape you specify lz -4 -Puclaser1 then your printout will be double-sided and will have 4 logical pages to the physical page.