CSCI 255 Fall 2025
Introduction to Algorithms		Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework
Policies
Advice
College
    Policies
Notes
Programs
Tutorials
CSCI 235
MATH 160
Others
Admin

Homework 18

General Comments

  • For full credit, provide context for each problem, show all calculations, and justify all answers by providing enough comments to explain your reasoning.
  • Homework assignments must be very neatly written or typeset (e.g. using Word or OpenOffice).
  • You can get up to 50% credit on a problem if you get significant outside assistance. Thus, if you are totally stuck on a problem it might be worth getting help. However, you must indicate any assistance/collaboration (See the Homework Assistance section on the Policies page). Failure to do so could result in a failing grade for the course! Note that getting help from the Help Center or me does not count as significant outside assistance, but talking with your classmates or searching on the Internet does!
  • If a problem asks for an algorithm, you should give the most efficient algorithm you can find to ensure full credit. You should also specify the complexity of the algorithm with justification, whether or not the problem asks for it.

Details

Vibe Coding an Algorithm Demo

Goal: Create a demo of an algorithm (choices listed below) with the assistance of your favorite AI tool(s). Make sure you do enough learning about your algorithm so you know that the demo is an accurate representation of how the algorithm works. Here are the details:
  1. Go to Books
  2. Right-click on the following files and download and save them somewhere (I will add the names below once assigned):
    • Algorithm Demo TEMPLATE.html
    • style.css
    • demo.css
    • demoScripts.js
  3. You will be assigned one of the following during an in-class discussion:
    1. Hashing--Open Addressing (insert, delete, search)
    2. Closest Pair (2D)--Brute Force (R-Dawg)
    3. Closest Pair (2D)--Divide-and-Conquer
    4. Unbalanced BST (insert, delete, search)
    5. 2-3 Trees (insert, delete, search) (Bryson)
    6. Red-Black Trees (insert, delete, search)
    7. AVL Trees (insert, delete, search) (Matthew)
    8. Fibonacci number using 2x2 matrix multiplication
    9. Dijkstra's Algorithm (Alem)
    10. Generating permutations
    11. Generating subsets (Wyatt)
  4. Give the 4 files to your favorite AI chatbot, describe the demo you want, dialog with it back and forth making sure it "understands" what you want.
    • Tell it the demo should follow the template and use the style/js scripts and not override the style unless absolutely necessary
    • Tell it the demo should use HTML/CSS/JS/SVG.
    • Give it enough details about what the demo should display and what the steps should do so it has a good starting point.
    • If the algorithm is similar to one of the existing ones, download the existing demo code and feed it into the AI as a starting point.
  5. Submit the demo by copying the HTML file to your shard Google folder.
  6. You will also give a short presentation (10 minutes?) of your chosen algorithm, using the demo to explain the details.
Bonus! Write a page similar to those in DAIA to go along with your demo. You will need to give the AI the following files as a starting point:
  • Algorithm TEMPLATE.html
  • style.css
  • chapter.css
  • chapterScripts.js
You can get an OK draft via AI, but getting a polished page involves a lot of back-and-forth with it to smooth everything out, make sure it makes sense and is readable, and make sure it is accurate.