These are the teams for project 6.
| team | project | members |
| 0 | | Brian Hague, Chris Lacher |
| 1 | A | Nicholas Goote, Carlos Munoz, Redge Allen, Mathew Streich |
| 2 | A | April Byrne, Brandi Frisbie, Joe McMillan |
| 3 | A | Dylan Sprague, Jason Bunyea, Caroline Willis |
| 4 | B | Robert Mooneyham, William Blough, Brian Howell |
| 5 | B | Bipol Alam, Derrick Bacon, Talor Gannaway, Brandon Sheffield |
| 6 | C | Matthew Tannehill, Sean Seltzer, Gustavo Maturana, Damien King-Acevedo |
| 7 | A | Amir Yousef, Shawn Suit, Benjamin Carothers, Caelan Alonge |
| 8 | A | Jacqueline Smith, William Bassett, Kevin Hall, Wei Huang |
| 9 | B | Andrew Kusel, Chad Duncan, Dan Nguyen |
| 10 | A | Sheena Salmon, Ronald Acebedo, Daniel McNaughton, Glenn Hall |
| 11 | A | Trevor Richardson, Joseph Young, Robert Vanhoose |
| 12 | A | Gregory Brown, Mathew Williams
|
Project Options
String Sorts.
Develop optimized implementations of the three string (key) sort algorithms LSD,
MSD, and QS-3W, and conduct experiments with different alphabets and
and string population characteristics with recommendations on when to use which sort.
Monte Carlo & Las Vegas Substring Search.
Develop the Rabin-Karp substring search algorithm, in both Monte Carlo and Las
Vegas modes. Pay careful attention to efficient calculation of hash values, both
in terms of speed and uniformity of distribution. Then offer a design plan to
upgrade the algorithm to search for 2-dimensional patterns in a 2-dimensional array
of characters.
Grep.
Produce an implementation of the classic grep search facility. A small subset of
special characters may be used, but it should include at least wild cards and
enough syntax to make searches workable from the command line. An implementation
of the classes GREP ("get regular expression pattern") and NFA ("non-deterministic finite automoton") is required.
|