Algorithmics 3 - Tutorial Sheet 2
1
Algorithmics 3 - Tutorial Sheet 2
Strings and text algorithms
1. Explain how the Human-tree-building algorithm can be extended so that it also determines
the weighted path length of the tree that it constructs.
Recall:
Algorithmics 3 - Tutorial Sheet 1
1
Algorithmics 3 - Tutorial Sheet 1
Fundamental algorithms, data structures and sorting algorithms
1. The number of operations required by the (hypothetical) algorithms B1 , B2 , . . . , B5 to process
an input of size n a
Algorithmics 3 - Tutorial Sheet 4
1
Algorithmics 3 - Tutorial Sheet 4
NP-completeness
1. Show that the following problems are in NP.
(a) Satisability (SAT)
Instance: a Boolean expression B in CNF.
Question: is B satisable?
(b) CLIQUE
Instance: a graph G a
Algorithmics 3 - Tutorial Sheet 2
1
Algorithmics 3 - Tutorial Sheet 2
Strings and text algorithms
1. Explain how the Human-tree-building algorithm can be extended so that it also determines
the weighted path length of the tree that it constructs.
Recall:
Algorithmics 3 - Tutorial Sheet 5
1
Algorithmics 3 - Tutorial Sheet 5
Computability
Algorithmics 3 - Tutorial Exercises 5
1. Describe the language by the following deterministic nite state automaton
1. Describe the language acceptedaccepted by the followi
Algorithmics 3 - Tutorial Sheet 1
1
Algorithmics 3 - Tutorial Sheet 1
Fundamental algorithms, data structures and sorting algorithms
1. The number of operations required by the (hypothetical) algorithms B1 , B2 , . . . , B5 to process
an input of size n a
Algorithmics 3 - Tutorial Sheet 4
1
Algorithmics 3 - Tutorial Sheet 4
NP-completeness
1. Show that the following problems are in NP.
(a) Satisability (SAT)
Instance: a Boolean expression B in CNF.
Question: is B satisable?
Solution: An informal proof that
Algorithmics 3 - Tutorial Sheet 5
1
Algorithmics 3 - Tutorial Sheet 5
Computability
Algorithmics 3 - Tutorial Exercises 5
1. Describe the language by the following deterministic nite state automaton
1. Describe the language acceptedaccepted by the followi
Algorithmics 3
2014
Algorithmics 3
Section 1 Fundamental algorithms
and data structures
Dr. Gethin Norman
School of Computing Science
University of Glasgow
[email protected]
Section 1 Fundamental Algorithms & data structures
Stacks, queues, prio
Algorithmics 3
2014
Algorithmics 3
Section 3 Strings and text
algorithms
Dr. Gethin Norman
School of Computing Science
University of Glasgow
[email protected]
Section 3 Strings and text algorithms
Text compression
Huffman encoding
LZW compress
Algorithmics 3
2014
Algorithmics 3
Section 2 Sorting algorithms
Dr. Gethin Norman
School of Computing Science
University of Glasgow
[email protected]
Sorting - Recap
Nave sorting algorithms: O(n2) in the worst/average case
Selectionsort, Insert
Algorithmics 3
2014
Algorithmics 3
Section 4 Graphs & graph algorithms
Dr. Gethin Norman
School of Computing Science
University of Glasgow
[email protected]
Section 4 Graphs and graph algorithms
Graph basics
definitions: directed, undirected, c
Algorithmics 3 May 2011 - Model Answers
1. [part (a) is book work covered in lectures, while the remaining parts
have been covered in both lectures and tutorials for different strings]
(a) The complete recurrence relation is given by:
di-1,j-1
if xi=yi
di
Monday, 22 April 2013
2.00 pm 3.30 pm
(1 hour 30 minutes)
DEGREES OF MSci, MEng, BEng, BSc, MA and MA (Social Sciences)
COMPUTING SCIENCE 3P:
ALGORITHMICS 3
Answer all questions
This examination paper is worth a total of 60 marks.
You must not leave the e
Friday, 16 May 2014
9.30 am 11.00 am
(1 hour 30 minutes)
DEGREES of MSci, MEng, BEng, BSc, MA and MA (Social Sciences)
COMPUTING SCIENCE 3P:
ALGORITHMICS 3
Answer all 4 questions
This examination paper is worth a total of 60 marks.
The use of calculators
Tuesday, 24 April 2012
06.30 pm 08.00 pm
(1 hour 30 minutes)
DEGREES OF MSci, MEng, BEng, BSc, MA and MA (Social Sciences)
COMPUTING SCIENCE 3P:
ALGORITHMICS 3
Answer all questions
This examination paper is worth a total of 60 marks.
You must not leave th