Lab 9: Combinatorial Circuits Posted on 1 May, 2016

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

Lab 8: Learning to diagnose - Machine learning with decision trees Posted on 20 Apr, 2016

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.

Essay Specs Posted on 30 Mar, 2016

Your essay is due at the end of the semester, here is what you are expected to do, and how it will be graded.

Lab 7: Solving Sudoku Posted on 30 Mar, 2016

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.

Lab 6: The Sentiment of a Superstorm Posted on 20 Mar, 2016

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.

Lab 5: Sequence alignment (with pointers) Posted on 12 Mar, 2016

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.

Lab 4: Recursion Posted on 2 Mar, 2016

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

Lab 3: Make Your Computer Sing (tunes) and Talk (nonsense) Posted on 1 Mar, 2016

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

Lab 1: Karel the Robot Posted on 15 Feb, 2016

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!

Course Mechanics -- Important Posted on 15 Feb, 2016

This document summarizes the logistics for participating in Art of Computing and getting credit for it.

All registered student need to read and understand all the content (and information it links to) here. Comments and changes will be incorporated up until the 2nd week of semester.