Skip to content

lucoodevcourse/cs2-lab3-listperformance-java

 
 

Repository files navigation

Pair project

Collaborate with your teammates but submit individually. Clearly list the members of your team.

Objectives

An understanding of the following concepts and techniques:

  • algorithmic complexity
  • runtime performance
    • how to measure
    • how it relates to algorithmic complexity
  • abstract data types (ADT)
  • array-based versus linked lists
  • getting started with iterators
  • automated unit testing using JUnit
    • testing for exceptions
    • test fixtures and assertions

Instructions

The key idea is to think about this lab like a physics experiment! You will set it up and then take measurements.

  1. Review the code.
  2. Fix the syntax errors (if any, though there probably aren't any).
  3. Run the code for various inputs to gain an understanding of what it does.
  4. Complete the items marked TODO in the code and get the tests to pass.
  5. Conduct the performance measurements: you will find the running times in the test report.
  6. Create a markdown document called Answers.md and answer the various questions embedded in the code.

Submission

  • Make sure you have created a separate project for this activity.
  • Include a project-specific readme file including your reflection and any other thoughts or design decisions.
  • In IDEA, export your project as a zip file and submit as an attachment.

Grading (total 5)

  • 1.5 tests passing and completion of items marked TODO
  • 1.5 performance testing for increasing problem sizes
  • 2 written part
    • 1.5 responses to the questions above
    • 0.5 grammar, style, formatting
  • 0.5 (optional) DRY in performance testing

About

Loyola COMP 271 Lab 3

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%