FIT1045 Algorithmic Problem Solving Workshop 2.
Objectives
The objectives of this workshop are:
To get familiar with Python.
To be able to perform iteration and selection in Python.
To be able to perform basic string and numerical manipulation.
To be

FIT1045 Algorithmic Problem Solving Workshop 5.
Objectives
The objectives of this workshop are:
To implement and manipulate data structures for graphs in Python.
To implement algorithms on graphs in Python.
To implement tables as lists of lists in Pyth

FIT1045 Algorithmic Problem Solving Tutorial 6.
Objectives
The objectives of this tutorial are:
To become familiar with the decomposition of a problem into smaller parts or components.
To investigate the benefits of decomposition.
To introduce the basi

FIT1045 Algorithmic Problem Solving Tutorial 1.
Objectives
The objectives of this tutorial are:
For students to get to know each other and your tutor.
To start thinking about: what are algorithms, where algorithms are used, how do you develop algorithms

FIT1045 Algorithmic Problem Solving Tutorial 3.
Objectives
The objectives of this tutorial are:
To get familiar with bit strings.
To understand selection sort and insertion sort.
To introduce the fake coin problem
Task 1: Fake Coin Game
The Fake Coin G

FIT1045 Algorithmic Problem Solving Tutorial 10.
Objectives
The objectives of this tutorial are:
To become familiar with heaps.
To become familiar with Binary Search Trees.
To introduce a simple computational model for counting the number of instructio

FIT1045 Algorithmic Problem Solving Tutorial 11.
Objectives
The objectives of this tutorial are:
To be able to find Hamiltonian cycles, vertex covers and cliques in a graph.
To understand the P vs NP problem.
To show that a given decision problem is in

FIT1045 Algorithmic Problem Solving Tutorial 12.
Objectives
The objectives of this tutorial are:
To introduce Big-O notation for simple functions.
To get familiar with Binary Trees, Binary Search Trees and cost of their operations.
To discuss how progr

FIT1045 Algorithmic Problem Solving Tutorial 9.
Objectives
The objectives of this tutorial are:
To become familiar with backtracking.
To understand how to apply backtracking to specific problems.
Task 1
Part A
Consider the backtracking approach to gener

FIT1045 Algorithmic Problem Solving Tutorial 2.
Objectives
The objectives of this tutorial are:
To introduce some fundamental data structures: lists, tables and strings.
To become familiar with fundamental algorithms involving these structures.
Task 1:

FIT1045
Introduction to Algorithms and
Programming
Lecture 15
Recursive Sorting
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB

Monash University
Sample Mid Semester Test
Faculty of Information Technology
TEST CODE!
!
!
FIT1045
TITLE OF PAPER!
!
Introduction to Algorithms and Programming
TEST DURATION!
!
45 minutes
READING TIME!
!
5 minutes
STUDENT ID _
During the test, you must n

FIT1045: Algorithms and Programming Fundamentals in Python
Lecture 14
Recursion
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB

# Do not change any line in writeResults and haversine functions
import math
def writeResults(results):
outfile = open("walkable.txt", "w")
string = "Location of the most walkable house: "+ str(results[0]) + ", " +
str(results[1])
print(string)
outfile.wr

FIT1045: Algorithms and
Programming Fundamentals in
Python
Lecture 2
Introduction to Python
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuan

FIT1045
Introduction to Algorithms and Programming
Lecture 5
Introduction to Data Structures
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursua

FIT1045: Algorithms and Programming Fundamentals in Python
Lecture 12
Understanding Python
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant

FIT1045: Algorithms and
Programming Fundamentals in
Python
Lecture 9
Brute Force Algorithms
Acknowledgment: Some of the slides are prepared by staff at
Monash College
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been repr

FIT1045: Algorithms and
Programming Fundamentals in
Python
Lecture 10
Exhaustive Search
Acknowledgment: Some of the slides are prepared by staff at
Monash College
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduc

FIT1045: Algorithms and Programming Fundamentals in Python
Lecture 11
Decomposition
http:/www.frankbuck.org/digital-organization-how-to-fit-all-of-the-pieces-together/
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been rep

FIT1045: Algorithms and Programming Fundamentals in Python
Lecture 13
Divide and Conquer
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant t

FIT1045: Algorithms and Programming Fundamentals in Python
Lecture 15
Recursion + Divide and Conquer
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash Universit

FIT1045
Introduction to Algorithms and
Programming
Lecture 16
Backtracking
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB of t

FIT1045
Introduction to Algorithms and
Programming
Lecture 17
Implementing Backtracking
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to

FIT1045
Introduction to Algorithms and
Programming
Lecture 20
Complexity for Tree Algorithms
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursua

N = int(input("Enter N")
T= [0 for i in range(N)] for k in range(0,N)]
#[0,0,0,0],[0,0,0,0],[0,0,0,0]
n = 0
while n < len(T):
queen = input("enter position of Queen")
T[int(queen[2])][int(queen[0])] = 1
n +=1
#[0, 1, 0, 0], [0, 0, 0, 1], [1, 0, 0, 0], [0,

n = int(input("enter value for n")
adjacencyList = [0 for i in range(n)] for k in range(0,n)]
f = input("enter the file name")
file = open(f,'r+')
data = file.read()
L1 = data.split("\n")
L2 = []
order = 0
while order < n:
L3 = L1[order].split(" ")
L2.app

FIT1045
Introduction to Algorithms and
Programming
Lecture 13
Divide and Conquer
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part V

FIT1045
Introduction to Algorithms and
Programming
Lecture 18
Transform and Conquer
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Par

FIT1045
Introduction to Algorithms and
Programming
Lecture 6
Finding an Algorithm
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part

FIT1045
Introduction to Algorithms and
Programming
Lecture 7
Invariants
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB of the

Images at http:/bloggertowordpresstestblog.blogspot.com.au/2009/11/michael-hansmeyer-solids-at-smallspace.html:
FIT1045
Introduction to Algorithms and Programming
Lecture 1
Introduction to Algorithms
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WA