Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Two
(week 4)
Question 1. In the linear-time selection algorithm, the elements in the input sequenc
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2017 Tutorial Three
(Week 6)
Question 1.
Insert the keys 5, 2, 8, 9, 1, 6, 3 into a max-heap that was initially
COMP3900/6390 Assignment 1 Specifications 2017
Individual assignment. Marked out of 50, worth 15% of the course total
Due date: 6pm Saturday 12th August (end of Week 3)
Overview of this assignment.
In
The Australian National University
Research School of Computer Science
Dirk Pattinson
Semester 1, 2017
Tutorial 3
Foundations of Computation
Exercises marked MA are this weeks mini-assignment, and con
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2017 Tutorial Two
Solutions
Question 1. In the linear-time selection algorithm, the elements in the input
sequen
The Australian National University
Research School of Computer Science
Dirk Pattinson
Semester 1, 2017
Tutorial 2
Foundations of Computation
Exercises marked MA are this weeks mini-assignment, and con
COMP3900/6390 Assignment 2 Specifications 2017
Group assignment. Marked out of 50, worth 15%
Due date: 6pm Saturday 2nd September (end of Week 6)
Overview of this assignment
In this assignment, your g
Lower Bound on Comparison-based Sorting
Different sorting algorithms may have different time complexity, how to know whether
the running time of an algorithm is best possible?
We know of several sorti
9.3 Linear-Time Selection
We aim to find the i-th smallest element from a set A containing n elements,
1 i n.
The general strategy is to find a pivot element x in A such that a constant fractional
num
11. Hash Tables
Many applications require a dynamic set that supports only the directory
operations INSERT, SEARCH and DELETE.
A hash table is a generalization of the simpler notion of an ordinary arr
Recurrences
When an algorithm contains a recursive call to itself, its running time can often be
described by a recurrence. A recurrence is an equation or inequality that describes a
function in terms
Asymptotic notations
O(g(n)= cfw_ f (n) : there exist positive constants c and n0 such that
0 f (n) c g(n) for all n n0, e.g. 8 log n = O(n).
(g(n)= cfw_ f (n) : there exist positive constants c and n
Divide-and-Conquer (D&C) Paradigm
Given a problem A , if the D&C strategy is applicable, the problem is then solved
using the strategy. The detailed steps are as follows.
1. Divide A into a number of
6. Heapsort and Priority Queues
Heapsort is an in place sorting algorithm that runs in O(n log n).
It achieves asymptotically optimal running time
It only takes a constant amount of space outside th
Asymptotic notation
In the analysis of algorithms, it is common to estimate the running time in the
asymptotic sense, that is, to estimate the running time for arbitrarily large inputs.
Notations like
Australian National University
Research School of Computer Science
Computer Science COMP3600/COMP6466
Answers to Tutorial One
In the following we provide some reference answers to the problems of Tuto
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2017 Quiz One
Due: 5pm Friday, August 4
Submit your work electronically through Wattle. The total mark of this q
The Austalian National University
Research School of Computer Science
Dirk Pattinson
Semester 1, 2017
Tutorial 1
Foundations of Computation
Exercises marked MA are this weeks mini-assignment, and cont
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Three
Solutions
Question 1.
Show how to reconstruct an LCS from the completed c table and the orig
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Four
Question 1.
Insert the keys 5, 2, 8, 9, 1, 6, 3 into a max-heap one at a time, then remove th
Australian National University
Research School of Computer Science
Computer Science COMP3600/COMP6466 in
2016 Answer to Tutorial Five
Question 1.
(i) What are essential differences between the binary
Computer Science COMP3600/COMP6466 in
2016 Tutorial One
Question 1. (i) Study the definitions of the basic notations such as , O, , o,
(ii) Rank the following functions in the order
p of growth:
2
2
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial five
(Week 10)
Question 1.
(i) What are essential differences between the binary search tree and t
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Two
Solutions
Question 1. In the linear-time selection algorithm, the elements in the input
sequen
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Four
(Week 8)
Question 1.
Insert the keys 5, 2, 8, 9, 1, 6, 3 into a max-heap that was initially e
Australian National University
Research School of Computer Science
Computer Science COMP3600/COMP6466
Answers to Tutorial One (2016)
In the following we provide some reference answers to the problems
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Three
(Week 6)
Question 1.
Show how to reconstruct the Longest Common Subsequence from the complet
Department of Computer Science, Australian National University
COMP2600 / COMP6260 Formal Methods in Software Engineering
Semester 2, 2015
Assignment 1
Structural Induction, FOL Specification and Natu
COMP2610/6261 Information Theory
Lecture 13: Symbol Codes for Lossless Compression
NU Logo UseYoung
Guidelines
Lee and Aditya Menon
U logo is a contemporary
on of our heritage.
y presents our name,
ld