PA_03_2008_Fall - When you run Boyer-Moore algorithm, you...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS300 Algorithm Programming Assignment #3 GOAL Implement Kruskal’s MST algorithm and Boyer-Moore string matching algorithm Programming Requirements Language: only C (C++ is not allowed.) Environment (1): Windows – Visual Studio 6.0 / Visual Studio 2005 Environment (2): Compiler: gcc TA will test your program on the adam server. (*Environment (1) is recommended) Requirements (a) Menu-driven interface. Each algorithm has to be selected by menu. Ex) Select an algorithm. 1. Kruskal’s algorithm 2. Boyer-Moore algorithm (b) Input file name is ‘graph.dat’. File format is as follows. n (# of vertex. Less than or equal to 20) e1 (# of edges) v 11 v 12 w 1 v 21 v 22 w 2 …. v n1 v n2 w n The information about Boyer-Moore algorithm is not included in ‘input.dat’. (c) The input for Boyer-Moore algorithm is made by your keyboard input. Ex) Select an algorithm 1. Kruskal 2. Boyer-Moore
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
> 2 Input string: Kaede Reference string: Azusa is older than Kaede
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: When you run Boyer-Moore algorithm, you have to decide the input string and the reference string, like the example above. (d) For Kruskal’s algorithm, you just have to print out the final MST and the cost. For Boyer-Moore algorithm, you have to print out each step of the algorithm. Any format is OK if TA can understand your results. Explain your format in your documentation file. (e) You MUST use the O(n G(n)) Union-find algorithm so as to not make cycles in Kruskal’s algorithm. (f) You MUST write a short report on algorithm of Union-find. Due date December 10th. 23:59 p.m. (Wednesday) Send to [email protected] your source code, executable file, documentation. E-Mail title format: [CS300 PA03 by 20040001] Explanation of your code and method of compilation have to be contained in your documentation file. No delay is allowed...
View Full Document

This note was uploaded on 02/04/2010 for the course COMPUTER S cs300 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.

Page1 / 2

PA_03_2008_Fall - When you run Boyer-Moore algorithm, you...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online