Difference between revisions of "CISC220 F2023 Project"

Revision as of 08:59, 28 November 2023

The final project is your opportunity to explore an advanced data structure topic that was NOT covered in class this semester.

The main focus here is to write C++ code which implements and/or applies a data structure and/or algorithm of your choosing. You may use STL or other APIs/libraries, but only in a supporting role. If you use *any* code written by someone else (looking at you, Github), then you must cite it and be completely clear about what you added or changed. I am primarily interested in the code that you write and what your whole program does. Potential topics (first come, first served!):

• [Charmaine and Mithra] Red-black balanced binary trees
• Treaps
• [Molly and Ilana] Knight's tour or other kinds of searches with backtracking
• [Rubina and Listowel], [Kevin] Rabin-Karp string matching
• [Madison and MJ] k-d trees, nearest neighbor search -- basically spatial binary search trees
• Compression (text at the word/sentence level, image/video/audio)
  • [Trung and Araf] LZMA compression
• [Mateo] Minimax game tree search for checkers
• Automatic creation of crossword puzzles, sudoku, or other puzzles
• Automatic solution of a particular type of puzzle through graph search
  • [Daniel] Nonograms
• [Roger], [Coleman] Bigram/trigram/n-gram text modeling and generation
• Your own scintillating idea

You may work alone or as part of a pair.

Send me an e-mail with your proposal and partner name, if applicable, as soon as possible so that I can give some feedback. I don't just want a single word from the list above but also at least a sentence or two on what existing code/libraries you might use and a link to data that you intend to apply your program to. Time slots for 20-minute in-person demos (not in front of the class) on Tuesday, December 12 (reading day) will be posted after Thanksgiving break. Your code must also be submitted on the day of your demo.