Lab Content Archive

  • Lab 9: Combinatorial Circuits

    In this lab, you will use the Logisim tool, along with pen and paper, to analyse and create simple combinatorial circuits.

    posted on 1 May, 2016

  • Lab 8: Learning to diagnose - Machine learning with decision trees

    This lab practice the ideas of recursive computation with tree structure and core concepts of machine learning, by learning a decision tree for diagnosing breast cancer. May 2014 ## Preface This tutorial is designed to support the _Topic 6: Machine Learning_ component of the upcoming Joy of Computing (JoC) course at ANU. It details a set of practical tasks that JoC students will undertake as part of the course in an interactive format. posted on 20 April, 2016

  • Lab 7: Solving Sudoku

    In this lab, we explore how reasoning, and figuring things out by trial-and-error, can be coded as an algorithm, and use it to solve Sudoku puzzles. Sudoku: The search for a solution The most well known form of a sudoku puzzle is a 9-by-9 grid in which the numbers 1-9 must be placed such that each row, column and 3-by-3 box contains exactly one of each of the 9 digits. A typical puzzle will initially have enough of the numbers filled in to ensure that the puzzle has exactly one solution. posted on 30 March, 2016

  • Lab 6: The Sentiment of a Superstorm

    For this tutorial, we’ll explore how we can use social data (tweets from Twitter) to enrich our understanding of one of the most destructive hurricanes in US history: “Superstorm Sandy”.

    The first part of this lab sheet contains reading material for both sentiment analysis and hashing, the second part contains the excercise questions. Skip directly to the practical part of you are impatient.

    posted on 20 March, 2016

  • Lab 5: Sequence alignment (with pointers)

    This weeks lab is a practical test of algorithms based on “dynamic programming”, applied to one of the fundamental problems in bioinformatics. Determining Similarity One of the central problems pursued in bioinformatics is determining similarity between sequences of nucleotides or amino acids (the basic information that makes up our genetic structure). Similarity information is required to perform some typical tasks including: Using a given sequence of amino acids to infer a protein’s shape and function, and Finding all the genes and proteins in a given genome. posted on 12 March, 2016

  • Lab 4: Recursion

    This week we will pratice recursion – with Karel, and with a special-purpose calculator.

    posted on 2 March, 2016

  • Lab 3: Make Your Computer Sing (tunes) and Talk (nonsense)

    This week, Snap will sing and talk! – all using the notion of lists and arrays learned this week.

    posted on 1 March, 2016

  • Lab 1: Karel the Robot

    Lab 1: Programming Karel First, open Snap with Karel, in a new tab or window so that you can do the lab exercises and continue reading these instructions at the same time. Slow to load? Loading the page can take some time - anywhere from 20 seconds to 5 minutes. Exactly how long it takes depends on which browser you’re using and the computer you’re on. We recommend using an up-to-date version of the chromium (chrome) browser, but we have tested Snap! posted on 15 February, 2016

  • Lab 2: Karel the Robot (II)

    Lab 2: Programming Karel (part II) Again, start by opening Snap with Karel. (Note that this is not the same link as in lab 1: This version comes with a few other blocks ready-made.) Open it in a new tab or window so that you can do the lab exercises and continue reading these instructions at the same time. Reminder: Loading the page can take a long time - how long depends on which browser you’re using and the computer you’re on. posted on 9 February, 2016

Quick links

2016 S1 lectures schedule:
  • Monday 1-2pm (RS Chem T)
  • Tuesday 9-10am (ENGN T)
  • Thursday 12-1pm (JD101)

Note: TBD.

Quick-access class pointers: TBC