CSCI 385 Spring 2025
Advanced Data Structures and Algorithms
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
Advice
College
    Policies

Notes
Programs
Tutorials

CSCI 125
CSCI 255
Others

Admin

Homework 13

Details

You may work in pairs on this assignment.

The following are from Grossman Homework. They will be equally weighted (10 points each).

  1. Write a program for Problem 1 but with some modifications— Keep reading!.

    Start with the code at LongestSequence for code to get you started and a decent test program. Please rename your class LongestSequence_Smith, where Smith is your last name, and make sure to change it in the test program.

    The code on page 27 of the Grossman notes is a good starting point.

    If you can figure out how, run it on Loki so you can test it with 24 cores.

    Submit your results as a textfile or on paper.

    For a lot of helpful tips on implementing your algorithm using ForkJoin, see Beginner's Introduction to Java's ForkJoin Framework and/or examples from the book.

    Hand in your code by placing it in the same shared directory as usual.

  2. Do Problem 3. Use Excel or a similar program to create the tables of values and charts. Submit your Excel file by putting it in your shared folder. If you use another program make sure you submit a printed copy of your tables and charts.
  3. Do Problem 4. Hand this one in on paper.