Programming Assignment 1: Percolation


Answer these questions after you implement your solution.

/* *****************************************************************************
 *  What computer science and programming background do you have?
 *  Check all that apply.
 **************************************************************************** */
 [ ]  COS 126
 [ ]  COS 217 
 [ ]  COS 226 (started, but did not complete)
 [ ]  ECE 115
 [ ]  AP Computer Science A
 [ ]  AP Computer Science Principles 
 [ ]  Passed COS placement exam
 [ ]  Algorithms, Part I on Coursera
 [ ]  Algorithms, Part II on Coursera
 [ ]  Competed in programming contests


/* *****************************************************************************
 *  What Java programming environment are you using?
 *  Check all that apply.
 **************************************************************************** */
 [ ]  macOS
 [ ]  Windows
 [ ]  Linux
 [ ]  IntelliJ
 [ ]  Eclipse
 [ ]  Visual Studio
 [ ]  Other (please specify) __________________________________


/* *****************************************************************************
 *  Describe the data structures (i.e., instance variables) you used to
 *  implement the Percolation API.
 **************************************************************************** */


/* *****************************************************************************
 *  Briefly describe the algorithms you used to implement the constructor
 *  and each method in the Percolation API.
 **************************************************************************** */

Percolation():

open():

isOpen():

isFull():

numberOfOpenSites():

percolates():



/* *****************************************************************************
 *  First, implement Percolation using QuickFindUF.
 *  What is the largest value of n that PercolationStats can handle in
 *  less than one minute on your computer when performing T = 100 trials?
 *
 *  Fill in the table below to show the values of n that you used and the
 *  corresponding running times. Use at least 5 different values of n.
 **************************************************************************** */

 T = 100

 n          time (seconds)
--------------------------
...
...
...
...
...



/* *****************************************************************************
 *  Describe the strategy you used for selecting the values of n.
 **************************************************************************** */



/* *****************************************************************************
 *  Next, implement Percolation using WeightedQuickUnionUF.
 *  What is the largest value of n that PercolationStats can handle in
 *  less than one minute on your computer when performing T = 100 trials?
 *
 *  Fill in the table below to show the values of n that you used and the
 *  corresponding running times. Use at least 5 different values of n.
 **************************************************************************** */

 T = 100

 n          time (seconds)
--------------------------
...
...
...
...
...
 
/* *****************************************************************************
 *  Describe the strategy you used for selecting the values of n.
 *  If it's the same strategy as for QuickFindUF, just write "same".
 **************************************************************************** */



/* *****************************************************************************
 *  Known bugs / limitations.
 **************************************************************************** */





/* *****************************************************************************
 *  Describe any serious problems you encountered.                    
 **************************************************************************** */




/* *****************************************************************************
 *  List any other comments here. Feel free to provide any feedback   
 *  on how much you learned from doing the assignment, and whether    
 *  you enjoyed doing it.                                             
 **************************************************************************** */