Algo

Prepared by Julian Garca
Lecture 7
Brute Force
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 Part VB of the Copyright Act 1968 (the Act).The material in this communication may be subject to copyright under the Act.Any further
reproduction or communication of this material by you may be the subject of copyright protection under the Act.
Do not remove this notice.
Using Prims algorithm

6
2
4
12
2
4
12
10
10
2
4
12
8
12
10
12
10
10
10
22
Using Kruskals algorithm

6
12
10
4
12
10
12
10
12
2
4
2
4
12
10
10
2
4
8
12
10
2
4
8
10
22
Brute Force
(just do it)
Come up with all

possible solutions or states...
Brute Force is Good...

Can
be applied to most
problems ...resulting in reasonable
algorithms.
Generally cheap to design and
implement.
Useful for small size instances of the
problems.
Generating and checking solutions can
occur in parallel.
Finding a phone number

Consider the problem of trying to find a
telephone number in a phone book.
Aabataglilia A. ........9317 4532

Aabhas A. ...........0433 26 1471
Aabid Y & H. ............9729 8181
Aabryn B & K. ........ 9561 8162
Approach
Prints the name associated to a phone number
(if the number exists in the telephone book)
Input: phoneNum, a phone number

Output: Name corresponding to the phoneNum
Look at the first record
Does the record have

the phone number?
yes
print
name
no
Is there another record?
yes
Look at the next record
stop
Sequential Search
!
Given a value: target, and a list L.

! Find the first item in L, which has the
value target.
! Return:
If target is found then return the index of
the item.
If target not found then return -1.
Algorithm: Sequential Search

Search for target in L
Input: target, and a list L[0..n-1]

Output: If target is in L, returns the index of the first item with that value. Otherwise returns -1.
k0
k = length(L)
yes
return -1
no
yes
L[k] = target?
no
k k +1
return k

Search for target in L
Input: target, and a list L[0, n-1]

k0
k = length(L)
yes
return -1
no
yes
L[k] = target?
no
k k +1
return k
SequentialSearch(target, L)
k0
while (k length(L)) do
{
if (L[k] = target )
{
return k
}
k k+1
}
return -1
k0
{
if (L[k] = target )
{
return k
}
k k+1
}
return -1

Input: target, and a list L[0.. n-1]
k0
{
if (L[k] = target )
{
return k
}
k k+1
}
return -1
input: L = [3,1,4,5,9,2,6]; target =2

output: 5
input: L = [ ]; target =2
output: -1
input: L = [2,2,3,5,9,2]; target =2
output: 0
input: L = [3,1,4,9,5,6,1]; target =5
output: 4
input: L = [3,1,4,9,5,6,1]; target =8
output: -1
Is the substring cagcag in this

string?
atggctaagtctatgctttctggaattgtttttgctggtcttgttgct
gctgcagcggccagttcggccaacaacagcgccgccaa
cgtctccgttttggagagtgggcccgctgtgcaggaagtgc
cagcgcgcacggtcacagctcgcctggcgaagcctttgct
gcttcttttctgctcttgctgcgactttggcagcagct
A) Yes
B) No
String Matching
is T a substring of S?
A substring of a string S is another string T "that occurs in" S.
Brute Force String Matching

cagcag
atggctaagtctatgctttctggaattgtttttgctggtcttgttg
ctgctgcagcggccagttcggccaacaacagcgccgc
caacgtctccgttttggagagtgggcccgctgtgcaggaa
gtgccagcgcgcacggtcacagctcgcctggcgaagc
ctttgctgcttcttttctgctcttgctgcgactttggcagcagct

cagcag

cagcag

cagcag

cagcag
Algorithm: StringMatch
Checks if a string T is a substring of S
Input: string S, potential substring T

Output: true if T is in S, false if T is not in S.
Look athe the first
length(T) carachters of S
Does the
substring match
T?
yes
return
true
no
Are we at the
end of S?
no
Move one
character along S
yes
return
false
Strings as Lists
Str
0. a
1. t
2. g
Str = [a, t, g] or Str = atg
Str[1] = t
Str[1..2] = [t, g] = tg
Substrings
Str[0..1] = [a, t] = at
Str = [a, g, t, t, a, c, g, a, t, t, a]
0
Str[2..4] = [t, t, a]
Str[3..5] = [t, a, c]
Str[8 ..10] = [t, t, a]
10
Algorithm: StringMatch(S, T)
Checks if T is a substring of S
Input: string S, substring T

Output: true if T is in S, false if T is not in S.
k0
while (k + length(T) length(S)) do
{
If (S[k .. k+length(T)-1] = T)
{
return true
}
kk+1
}
return false
T = cagcag
lenght(T) = 6
k=0
k+lenght(T)-1=5
T = cagcag
lenght(T) = 6
k=1
k+lenght(T)-1=6
T = cagcag
lenght(T) = 6
k=2
k+lenght(T)-1=7
T = cagcag
lenght(T) = 6
k=3
k+lenght(T)-1=8
Check substring given by k

Str[k..k+lenght(T)-1] has size length(T)
k+ length(T)-1
k0
{
{
return true
Start checking at the

beginning
Are there enough
characters left?
k + length(T) is the
size of we have covered
Check substring
given by k
Str[k..k+lenght(T)-1]
has size length(T)
kk+1
}
return false
k
k+ length(T)-1
Ready for another

substring
k0
{
{
return true
}
kk+1
}
return false
k 0
{
j0
k0
{
{
return true
}
kk+1
}
return false
match true
while (j < length(T) and match = true) do
{
If (S[j+k] T[j]) {
match false
}
j j+1
}
If (match == true)
{
return true
}
kk+1
}
return false
Check substring given by k

Str[k..k+lenght(T)-1] has size length(T)
k+ length(T)-1
j0
match true
{
If (S[j+k] T[j]) {
match false
}
j j+1
j
T
k 0
{
j0
k0
{
If (S[k .. k+length(T)-1] == T)
{
return true
}
kk+1
}
return false
match true
{
If (S[j+k] T[j]) {
match false
}
j j+1
}
If (match == true)
{
return true
}
kk+1
}
return false
Why a,g, t and c?
A Boat Problem
A farmer wishes to take a goat, a cabbage and a wolf across
a river. However, his boat can only take one of them at a
time. Therefore he will need to make several trips. Also, he
cannot leave the goat alone with the cabbage, and cannot
leave the wolf alone with the goat.
Find a way for the farmer to get everything across the river.
Cover Design of Anany Levitin, Introduction to the Design and Analysis of Algorithms (2nd Edition)
Left of the
river
farmer
wolf
cabbage
goat
Right of the
river
Left of the
river
Right of the
river
farmer
wolf
cabbage
goat
Left of the
river
farmer
goat
Right of the
river
cabbage
wolf
Left of the
river
farmer
cabbage
Right of the
river
goat
wolf
List States
END
START
Farmer
Wolf
Goat
Cabbage
R = right side of the river

L = left side of the river
List States
END
START
Farmer
Wolf
Goat
Cabbage
R = right side of the river

L = left side of the river
Representation of States
Farmer
Wolf
Goat
Cabbage
FWGC
FWGc
FWgC
fwGC
FwGc
fWgC
fWgc
fwGc
fwgC
fwgc
!
!
!
!
R means they are on the right side of the river

L means they are on the left side of the river
lower case they on the left side
UPPER CASE they on the right side
Farmer
Wolf
Goat
Cabbage
FWGC
FWGc
FWgC
fwGC
FwGc
fWgC
fWgc
fwGc
fwgC
fwgc
!
!
!
!

Farmer
Wolf
Goat
Cabbage
FWGC
FWGc
FWgC
fwGC
FwGc
fWgC
fWgc
fwGc
fwgC
fwgc
!
!
!
!

FWGC
fwgc
fWgC
Farmer
Wolf
Goat
Cabbage
FWGC
FWGc
FWgC
fwGC
FwGc
fWgC
fWgc
fwGc
fwgC
fwgc
!
!
!
!

Final State
Start State
Transitions between states

fwgC
fwGc
fWgc
fwgc
FWGC
fWgC
FWGc
FwGc
FWgC
FwGC
Transitions between states

fwgC
fwGc
fWgc
fwgc
FWGC
fWgC
FWGc
FwGc
FWgC
FwGC
farmer
cabbage
goat
wolf
fwgC
fwGc
fwgc
fWgc
FWGC
fWgC
FWGc
FwGc
FWgC
FwGC
Boat Solution
FwGC
fwgc
FwGc
fwGc
FWGc
fwgC
FWgC
fWgc
fWgC
FWGC
Brute force approach

to the boat problem
1. List all possible states
2. Eliminate states that are not valid
3. Identify transitions between
states
4. Look for a path that starts at the
initial state, and ends at the end state
Traveling Salesman
Suppose you are given the following driving distances in
kms between the following capital cities.
Adelaide Brisbane Canberra
Darwin
Sydney
2053
1155
3017
1385
1080
3415
939
3940
285
Adelaide
Brisbane
2053
Canberra
1155
1080
Darwin
3017
3415
3940
Sydney
1385
939
285
3975
3975
Find the shortest route that enables a salesman to start at

Canberra, visit all the other cities, before returning to
Canberra.
Before Next Lecture

On the FIT1029 Moodle site:
Watch the following video:
The 8 Queens Problem
Think about the traveling salesman

problem

Algo

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Algo

Diunggah oleh

Hak Cipta:

Format Tersedia

Prepared by Julian Garca

Using Prims algorithm

Using Kruskals algorithm

Come up with all

Brute Force is Good...

Finding a phone number

Aabataglilia A. ........9317 4532

Input: phoneNum, a phone number

Look at the first record

Does the record have

Look at the next record

Given a value: target, and a list L.

Algorithm: Sequential Search

Input: target, and a list L[0..n-1]

Algorithm: Sequential Search

Input: target, and a list L[0, n-1]

Algorithm: Sequential Search

input: L = [3,1,4,5,9,2,6]; target =2

Is the substring cagcag in this

Brute Force String Matching

Brute Force String Matching

Brute Force String Matching

Brute Force String Matching

Brute Force String Matching

Input: string S, potential substring T

Input: string S, substring T

Check substring given by k

Start checking at the

Ready for another

Check substring given by k

Why a,g, t and c?

R = right side of the river

R = right side of the river

R means they are on the right side of the river

R means they are on the right side of the river

R means they are on the right side of the river

R means they are on the right side of the river

Transitions between states

Transitions between states

Brute force approach

Find the shortest route that enables a salesman to start at

Before Next Lecture

Think about the traveling salesman

Anda mungkin juga menyukai