FIT1029: Tutorial 3 Solutions
Semester 1, 2014
Task
1
Part 1. From lecture and tutorials we know that the sum of all numbers up
to N is given by the following formula:
Sum of all numbers from 1 to N = N (N + 1)/2
To extend this to the even numbers we note
FIT1029: Tutorial 2 Solutions
Semester 1, 2014
Task
1
Part 1. One possible solution:
0. 000
1. 100
2. 101
3. 111
4. 110
5. 010
6. 011
7. 001
The problem can be represented as a graph by assigning each bitstring to
a node, and adding edges between pairs of
Tutorial 3
FIT 1029 Algorithmic Problem Solving
16 March 2015 Prepared by Julian Garca
The objectives of this tutorial are:
To solve problems by identifying invariants.
To be able to identify invariants in algorithms.
To understand the Greedy approach
FIT1040 PROGRAMMING FUNDAMENTALS
EXAM PREPARATION WORKBOOK
Examination Preparation Workbook
Objective
The best way to become a good programmer is to practice, at least a little every day. While the
activities in the tutorials and labs are designed to be f
FIT1031
Data Representation
FIT1031 Tutorial for LN02
Data Representation
General Tutorial Instructions:1. All students are expected to try and work out solutions to tutorial exercises before coming to
the weekly tutorial session.
2. At the tutorials, gro
www.monash.edu.au
FIT1031 Computers and Networks
Lecture Notes 2
Data Representation and
Computer Arithmetic
www.monash.edu.au
LN 2: Learning Objectives
Number systems
Methods of storage used for binary data
Representation of integer, floating point an
FIT1029: Tutorial 9 Solutions
Semester 1, 2014
Task
1
The largest amount of money that can be picked up is $19 the $7 coin
and the $12 coin.
The best solution for n coins is the maximum value out of (a) the best
solution for n-1 coins, and (b) the best so
FIT1029: Tutorial 8 Solutions
Semester 1, 2014
Task
1
Fig. 1 represents the dierent recursive calls made on MergeSort Algorithm
when it is called to sort a list [A,L,G,O,R,I,T,H,M]. The numbers on the
arrows represent the order in which these parts are ex
FIT1029: Tutorial 6 Solutions
Semester 1, 2014
This week we are looking at recursion and how to write recursive algorithms. The two important components of a recursive algorithm are:
1. The Base Case: This case will decide when we should stop the recursiv
FIT1029: Tutorial 11 Solutions
Semester 1, 2014
Task
1
Figure 1 shows the graph with vertices representing bitstrings of length 4,
and edges joining vertices that dier by one bit. The edges in bold show one
example of a Hamiltonian path in this graph (but
FIT1029: Tutorial 1 Solutions
Semester 1, 2014
Task 1
Any graph has two important components: a set of vertices (call this V ) and
a set of edges (call this E). We will often refer to a graph as G(V, E) to mean
graph G consists of the sets V and E. Graphs
FIT1029: Tutorial 5 Solutions
Semester 1, 2014
Certain large problems are too big (and complex) to be solved in a single
algorithm. In those cases, it is worthwhile spending some time to break them
down in to simpler problems which can then be handled by
FIT1029: Tutorial 4 Solutions
Semester 1, 2014
Task
1
Part 1. When k = 0, j = 0, ., 8, i.e., 9 values. When k = 1, j = 1, ., 8, i.e.,
8 values, and so on. So, the total number of substrings is 9 + 8 + . + 1 = 45.
Part 2. Refer to Algorithm 1 below.
Algori
Generative Art with Scribble
A Project Based Introduction to Programming
Aidan Lane, Bernd Meyer and Jonathan Mullins
With contributions by Jon McCormack
WWWWWWWWW
BlockBooks Series
WWW
Like to be notied about updates and new releases?
Simulation with Cel
FIT1029: Tutorial 10 Solutions
Semester 1, 2014
Task
1
The Sequential Search algorithm is given in Algorithm 1.
Algorithm 1 sequentialSearch(target, L[0.N-1])
1: input: A target to search for, and a list L of length N to search in.
2: output: The index of
Tutorial 2
FIT 1029 Algorithmic Problem Solving
12 March 2015 Prepared by Julian Garca
The objectives of this tutorial are:
To get familiar with bit strings.
To understand selection sort and insertion sort.
To get familiar with fundamental algorithms i
FIT1031
Tutorial T01
Introduction
Solutions to FIT1031 Tutorial for LN01
Computers and Networks
(*: Important to complete)
Please note: In this tutorial, there are questions which have got ambiguity. There are other questions,
answers to which can be deba
FIT1031
Tutorial T01
Introduction
FIT1031 Tutorial for LN01
Computers and Networks
(*: Important to complete)
Exercise 1
Explain the major contribution(s) of Alan Turing to computing. Why is Turing called the
Father of Computing? Discuss.
*Exercise 2
Who
Prepared by Julian Garca
Lecture 5
Invariants
FIT 1029
Algorithmic Problem Solving
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
Prepared by Julian Garca
Lecture 6
Greedy Approach
FIT 1029
Algorithmic Problem Solving
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
Prepared by Julian Garca
Lecture 1 - Introduction
FIT 1029
Algorithmic Problem Solving
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
41
1. Press Channel
2. Press 41
3. Press Channel
4
Prepared by Julian Garca
Lecture 3
Introduction to Algorithms
FIT 1029
Algorithmic Problem Solving
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and commu
Prepared by Julian Garca
Lecture 4
Finding an Algorithm
FIT 1029
Algorithmic Problem Solving
COMMONWEALTH OF AUSTRALIA
Copyright Regulations 1969
WARNING
This material has been reproduced and communicated to you by or on behalf of Monash University pursu
Simulation with Cellular
A Project Based Introduction to Programming
Aidan Lane, Bernd Meyer and Jonathan Mullins
With contributions by David Albrecht
WWWWWWWWW
BlockBooks Series
WWW
Like to be notied about updates and new releases?
Simulation with Cellul
Robotics with Enchanting
and LEGO NXT
A Project Based Introduction to Programming
Aidan Lane, Bernd Meyer and Jonathan Mullins
With contributions by David Albrecht
WWWWWWWWW
BlockBooks Series
WWW
Like to be notied about updates and new releases?
Simulatio
CSE1301 Semester 1, 2006
Practical Session 7
CSE1301 Practical Session 7 Strings and File I/O (15 marks)
You should complete at least the preparation question before the prac, but it is recommended that you make substantial progress in the other question
CSE1301 Semester 1, 2006
Practical Session 5
CSE 1301 PRACTICAL SESSION 5 Functions (15 marks)
By the end of this practical session, you should be able to write programs which call functions you have written. Coding style and documentation: You are expect
CSE1301 Semester 1, 2006
Practical Session 6
CSE1301 Practical Session 6 Pointers and Arrays (15 marks)
You should complete at least the preparation question before the prac, but it is recommended that you make substantial progress in the other questions
(* Important to complete)
CSE1301 Exercise Sheet 2 Arithmetic and Boolean Expressions
Exercise 1 Perform the indicated bitwise operations: a) 10010111 AND 11101001 10010111 OR 11101001 b) 11101010 AND 01010101 11101010 OR 01010101 c) 01011100 AND 10100011