"# coursera_algorithms_part_2_DequesAndRandomizedQueues" See the Assessment Guide for information on how to interpret this report.
ASSESSMENT SUMMARY
Compilation: PASSED (0 errors, 2 warnings) API: PASSED
Findbugs: PASSED PMD: PASSED Checkstyle: PASSED
Correctness: 30/43 tests passed Memory: 103/105 tests passed Timing: 126/136 tests passed
Aggregate score: 80.20% [Compilation: 5%, API: 5%, Findbugs: 0%, PMD: 0%, Checkstyle: 0%, Correctness: 60%, Memory: 10%, Timing: 20%]
ASSESSMENT DETAILS
The following files were submitted:
3.5K Mar 4 01:32 Deque.java 554 Mar 4 01:32 Permutation.java 2.8K Mar 4 01:32 RandomizedQueue.java
- COMPILING
% javac Deque.java *-----------------------------------------------------------
% javac RandomizedQueue.java *----------------------------------------------------------- RandomizedQueue.java:11: warning: [unchecked] unchecked cast this.items = (Item[]) new Object[1]; ^ required: Item[] found: Object[] where Item is a type-variable: Item extends Object declared in class RandomizedQueue RandomizedQueue.java:32: warning: [unchecked] unchecked cast Item[] copy = (Item[]) new Object[capacity]; ^ required: Item[] found: Object[] where Item is a type-variable: Item extends Object declared in class RandomizedQueue 2 warnings
% javac Permutation.java *-----------------------------------------------------------
================================================================
Checking the APIs of your programs. *----------------------------------------------------------- Deque:
RandomizedQueue:
Permutation:
================================================================
- CHECKING STYLE AND COMMON BUG PATTERNS
% findbugs *.class *-----------------------------------------------------------
================================================================
% pmd . *-----------------------------------------------------------
================================================================
% checkstyle *.java *-----------------------------------------------------------
% custom checkstyle checks for Deque.java *-----------------------------------------------------------
% custom checkstyle checks for RandomizedQueue.java *-----------------------------------------------------------
% custom checkstyle checks for Permutation.java *-----------------------------------------------------------
================================================================
- TESTING CORRECTNESS
Testing correctness of Deque *----------------------------------------------------------- Running 16 total tests.
Tests 1-6 make random calls to addFirst(), addLast(), removeFirst(), removeLast(), isEmpty(), and size(). The probabilities of each operation are (p1, p2, p3, p4, p5, p6), respectively.
Test 1: check random calls to addFirst(), addLast(), and size()
- 5 random calls (0.4, 0.4, 0.0, 0.0, 0.0, 0.2)
- 50 random calls (0.4, 0.4, 0.0, 0.0, 0.0, 0.2)
- 500 random calls (0.4, 0.4, 0.0, 0.0, 0.0, 0.2)
- 1000 random calls (0.4, 0.4, 0.0, 0.0, 0.0, 0.2) ==> passed
Test 2: check random calls to addFirst(), removeFirst(), and isEmpty()
- 5 random calls (0.8, 0.0, 0.1, 0.0, 0.1, 0.0)
- 50 random calls (0.8, 0.0, 0.1, 0.0, 0.1, 0.0)
- 500 random calls (0.8, 0.0, 0.1, 0.0, 0.1, 0.0)
- 1000 random calls (0.8, 0.0, 0.1, 0.0, 0.1, 0.0)
- 5 random calls (0.1, 0.0, 0.8, 0.0, 0.1, 0.0)
- 50 random calls (0.1, 0.0, 0.8, 0.0, 0.1, 0.0)
- 500 random calls (0.1, 0.0, 0.8, 0.0, 0.1, 0.0)
- 1000 random calls (0.1, 0.0, 0.8, 0.0, 0.1, 0.0) ==> passed
Test 3: check random calls to addFirst(), removeLast(), and isEmpty()
- 5 random calls (0.8, 0.0, 0.0, 0.1, 0.1, 0.0)
- 50 random calls (0.8, 0.0, 0.0, 0.1, 0.1, 0.0)
- 500 random calls (0.8, 0.0, 0.0, 0.1, 0.1, 0.0)
- 1000 random calls (0.8, 0.0, 0.0, 0.1, 0.1, 0.0)
- 5 random calls (0.1, 0.0, 0.0, 0.8, 0.1, 0.0)
- 50 random calls (0.1, 0.0, 0.0, 0.8, 0.1, 0.0)
- 500 random calls (0.1, 0.0, 0.0, 0.8, 0.1, 0.0)
- 1000 random calls (0.1, 0.0, 0.0, 0.8, 0.1, 0.0) ==> passed
Test 4: check random calls to addLast(), removeLast(), and isEmpty()
- 5 random calls (0.0, 0.8, 0.0, 0.1, 0.1, 0.0)
- 50 random calls (0.0, 0.8, 0.0, 0.1, 0.1, 0.0)
- 500 random calls (0.0, 0.8, 0.0, 0.1, 0.1, 0.0)
- 1000 random calls (0.0, 0.8, 0.0, 0.1, 0.1, 0.0)
- 5 random calls (0.0, 0.1, 0.0, 0.8, 0.1, 0.0)
- 50 random calls (0.0, 0.1, 0.0, 0.8, 0.1, 0.0)
- 500 random calls (0.0, 0.1, 0.0, 0.8, 0.1, 0.0)
- 1000 random calls (0.0, 0.1, 0.0, 0.8, 0.1, 0.0) ==> passed
Test 5: check random calls to addLast(), removeFirst(), and isEmpty()
- 5 random calls (0.0, 0.8, 0.1, 0.0, 0.1, 0.0)
- 50 random calls (0.0, 0.8, 0.1, 0.0, 0.1, 0.0)
- 500 random calls (0.0, 0.8, 0.1, 0.0, 0.1, 0.0)
- 1000 random calls (0.0, 0.8, 0.1, 0.0, 0.1, 0.0)
- 5 random calls (0.0, 0.1, 0.8, 0.0, 0.1, 0.0)
- 50 random calls (0.0, 0.1, 0.8, 0.0, 0.1, 0.0)
- 500 random calls (0.0, 0.1, 0.8, 0.0, 0.1, 0.0)
- 1000 random calls (0.0, 0.1, 0.8, 0.0, 0.1, 0.0) ==> passed
Test 6: check random calls to addFirst(), addLast(), removeFirst(), removeLast(), isEmpty(), and size()
- 5 random calls (0.3, 0.3, 0.1, 0.1, 0.1, 0.1)
- 50 random calls (0.3, 0.3, 0.1, 0.1, 0.1, 0.1)
- 500 random calls (0.3, 0.3, 0.1, 0.1, 0.1, 0.1)
- 1000 random calls (0.3, 0.3, 0.1, 0.1, 0.1, 0.1)
- 5 random calls (0.1, 0.1, 0.3, 0.3, 0.1, 0.1)
- 50 random calls (0.1, 0.1, 0.3, 0.3, 0.1, 0.1)
- 500 random calls (0.1, 0.1, 0.3, 0.3, 0.1, 0.1)
- 1000 random calls (0.1, 0.1, 0.3, 0.3, 0.1, 0.1) ==> passed
Test 7: check removeFirst() and removeLast() from an empty deque
- removeFirst()
- removeLast() ==> passed
Test 8: check whether two Deque objects can be created at the same time ==> passed
Test 9: check iterator() after n calls to addFirst()
-
n = 10
- number of student entries = 11
- number of reference entries = 10
-
n = 50
- number of student entries = 51
- number of reference entries = 50
==> FAILED
Test 10: check iterator() after each of m intermixed calls to addFirst(), addLast(), removeFirst(), and removeLast()
-
m = 20
- number of student entries = 2
- number of reference entries = 1
- iterator failed after applying operation 1
- sequence of operations was: Deque deque = new Deque() deque.addFirst(1)
-
m = 50
- number of student entries = 2
- number of reference entries = 1
- iterator failed after applying operation 1
- sequence of operations was: Deque deque = new Deque() deque.addLast(1)
-
m = 100
- number of student entries = 2
- number of reference entries = 1
- iterator failed after applying operation 1
- sequence of operations was: Deque deque = new Deque() deque.addLast(1)
-
m = 1000
- number of student entries = 2
- number of reference entries = 1
- iterator failed after applying operation 1
- sequence of operations was: Deque deque = new Deque() deque.addFirst(1)
==> FAILED
Test 11: create two nested iterators to same deque
-
n = 10 java.lang.NullPointerException
TestDeque.twoNestedIterators(TestDeque.java:324) TestDeque.test11(TestDeque.java:619) TestDeque.main(TestDeque.java:839)
==> FAILED
-
n = 50 java.lang.NullPointerException
TestDeque.twoNestedIterators(TestDeque.java:324) TestDeque.test11(TestDeque.java:620) TestDeque.main(TestDeque.java:839)
==> FAILED
==> FAILED
Test 12: create two parallel iterators to same deque - failed on call 10 to hasNext() - student iterator 1 hasNext() = true - student iterator 2 hasNext() = true - reference iterator hasNext() = false
- failed on call 50 to hasNext()
- student iterator 1 hasNext() = true
- student iterator 2 hasNext() = true
- reference iterator hasNext() = false
==> FAILED
Test 13: create Deque objects of different parameterized types ==> passed
Test 14: call addFirst() and addLast() with null argument ==> passed
Test 15: check that remove() and next() throw the specified exceptions in iterator() - fails to throw an exception when calling next() when iterator is exhausted
==> FAILED
Test 16: call iterator() when the deque is empty - hasNext() returns true
==> FAILED
Total: 10/16 tests passed!
================================================================ Testing correctness of RandomizedQueue *----------------------------------------------------------- Running 18 total tests.
Tests 1-4 make random calls to enqueue(), dequeue(), sample(), isEmpty(), and size(). The probabilities of each operation are (p1, p2, p3, p4, p5), respectively.
Test 1: check random calls to enqueue() and size()
- 5 random calls (0.8, 0.0, 0.0, 0.0, 0.2)
- 50 random calls (0.8, 0.0, 0.0, 0.0, 0.2)
- 500 random calls (0.8, 0.0, 0.0, 0.0, 0.2)
- 1000 random calls (0.8, 0.0, 0.0, 0.0, 0.2) ==> passed
Test 2: check random calls to enqueue() and dequeue()
- 5 random calls (0.7, 0.1, 0.0, 0.1, 0.1)
- 50 random calls (0.7, 0.1, 0.0, 0.1, 0.1)
- 500 random calls (0.7, 0.1, 0.0, 0.1, 0.1)
- 1000 random calls (0.7, 0.1, 0.0, 0.1, 0.1)
- 5 random calls (0.1, 0.7, 0.0, 0.1, 0.1)
- 50 random calls (0.1, 0.7, 0.0, 0.1, 0.1)
- 500 random calls (0.1, 0.7, 0.0, 0.1, 0.1)
- 1000 random calls (0.1, 0.7, 0.0, 0.1, 0.1) ==> passed
Test 3: check random calls to enqueue(), sample(), and size()
- 5 random calls (0.8, 0.0, 0.1, 0.0, 0.1)
- 50 random calls (0.8, 0.0, 0.1, 0.0, 0.1)
- 500 random calls (0.8, 0.0, 0.1, 0.0, 0.1)
- 1000 random calls (0.8, 0.0, 0.1, 0.0, 0.1)
- 5 random calls (0.1, 0.0, 0.8, 0.0, 0.1)
- 50 random calls (0.1, 0.0, 0.8, 0.0, 0.1)
- 500 random calls (0.1, 0.0, 0.8, 0.0, 0.1)
- 1000 random calls (0.1, 0.0, 0.8, 0.0, 0.1) ==> passed
Test 4: check random calls to enqueue(), dequeue(), sample(), isEmpty(), and size()
- 5 random calls (0.6, 0.1, 0.1, 0.1, 0.1)
- 50 random calls (0.6, 0.1, 0.1, 0.1, 0.1)
- 500 random calls (0.6, 0.1, 0.1, 0.1, 0.1)
- 1000 random calls (0.6, 0.1, 0.1, 0.1, 0.1)
- 5 random calls (0.1, 0.6, 0.1, 0.1, 0.1)
- 50 random calls (0.1, 0.6, 0.1, 0.1, 0.1)
- 500 random calls (0.1, 0.6, 0.1, 0.1, 0.1)
- 1000 random calls (0.1, 0.6, 0.1, 0.1, 0.1) ==> passed
Test 5: call dequeue() and sample() from an empty randomized queue
- dequeue()
- sample() ==> passed
Test 6: create multiple randomized queue objects at the same time
- n = 10
- n = 100 ==> passed
Test 7: check that iterator() returns correct items after a sequence of n enqueue() operations
- n = 10
- n = 50 ==> passed
Test 8: check that iterator() returns correct items after sequence of m enqueue() and dequeue() operations
- m = 10
- m = 1000 ==> passed
Test 9: create two nested iterators over the same randomized queue
- n = 10
- n = 50 ==> passed
Test 10: create two parallel iterators over the same randomized queue
- n = 10
- n = 50 ==> passed
Test 11: create two iterators over different randomized queues ==> passed
Test 12: create RandomizedQueue objects of different parameterized types ==> passed
Test 13: check randomness of sample() by enqueueing n items, repeatedly calling sample(), and counting the frequency of each item
- n = 3, trials = 12000
- n = 5, trials = 12000
- n = 8, trials = 12000
- n = 10, trials = 12000 ==> passed
Test 14: check randomness of dequeue() by enqueueing n items, dequeueing n items, and seeing whether each of the n! permutations is equally likely
- n = 2, trials = 12000
- n = 3, trials = 12000
- n = 4, trials = 12000
- n = 5, trials = 12000 ==> passed
Test 15: check randomness of iterator() by enqueueing n items, iterating over those n items, and seeing whether each of the n! permutations is equally likely
- n = 2, trials = 12000
- n = 3, trials = 12000
- n = 4, trials = 12000
- n = 5, trials = 12000 ==> passed
Test 16: call enqueue() with a null argument - throws wrong exception when calling enqueue() with a null argument - throws a java.lang.NullPointerException - should throw a java.lang.IllegalArgumentException
==> FAILED
Test 17: check that remove() and next() throw the specified exceptions in iterator() - throws wrong exception when calling next() when iterator is exhausted - throws a java.lang.ArrayIndexOutOfBoundsException - should throw a java.util.NoSuchElementException
==> FAILED
Test 18: call iterator() when randomized queue is empty ==> passed
Total: 16/18 tests passed!
================================================================
- TESTING CORRECTNESS (substituting reference RandomizedQueue and Deque)
Testing correctness of Permutation *----------------------------------------------------------- Tests 1-5 call the main() function directly, resetting standard input before each call.
Running 9 total tests.
Test 1a: check formatting for sample inputs from assignment specification % java Permutation 3 < distinct.txt F F A
% java Permutation 3 < distinct.txt E I H
% java Permutation 8 < duplicates.txt BB AA BB BB BB BB AA AA
==> passed
Test 1b: check formatting for other inputs % java Permutation 8 < mediumTale.txt it the age was wisdom times it times
% java Permutation 0 < distinct.txt [no output]
==> passed
Test 2: check that main() reads all data from standard input
- filename = distinct.txt, k = 3
- filename = distinct.txt, k = 3
- filename = duplicates.txt, k = 8
- filename = mediumTale.txt, k = 8 ==> passed
Test 3a: check that main() prints each item from the sequence at most once (for inputs with no duplicate strings)
-
filename = distinct.txt, k = 3
- number of times student prints string "B" = 2
- number of times string "B" appears in input = 1
- failed on trial 2 of 1000
-
filename = distinct.txt, k = 1
-
filename = distinct.txt, k = 9
- number of times student prints string "H" = 2
- number of times string "H" appears in input = 1
- failed on trial 1 of 1000
-
filename = permutation6.txt, k = 6
- number of times student prints string "D" = 3
- number of times string "D" appears in input = 1
- failed on trial 1 of 1000
-
filename = permutation10.txt, k = 10
- number of times student prints string "D" = 3
- number of times string "D" appears in input = 1
- failed on trial 1 of 1000
==> FAILED
Test 3b: check that main() prints each item from the sequence at most once (for inputs with duplicate strings)
-
filename = duplicates.txt, k = 8
- number of times student prints string "AA" = 2
- number of times string "AA" appears in input = 1
- failed on trial 1 of 1000
-
filename = duplicates.txt, k = 3
- number of times student prints string "AA" = 2
- number of times string "AA" appears in input = 1
- failed on trial 18 of 1000
-
filename = permutation8.txt, k = 6
- number of times student prints string "D" = 3
- number of times string "D" appears in input = 2
- failed on trial 1 of 1000
-
filename = permutation8.txt, k = 2
- number of times student prints string "B" = 2
- number of times string "B" appears in input = 1
- failed on trial 8 of 1000
-
filename = tinyTale.txt, k = 10
- number of times student prints string "it" = 4
- number of times string "it" appears in input = 2
- failed on trial 1 of 1000
==> FAILED
Test 3c: check that main() prints each item from the sequence at most once (for inputs with newlines)
-
filename = mediumTale.txt, k = 10
- number of times student prints string "wisdom" = 2
- number of times string "wisdom" appears in input = 1
- failed on trial 2 of 1000
-
filename = mediumTale.txt, k = 20
- number of times student prints string "foolishness" = 3
- number of times string "foolishness" appears in input = 1
- failed on trial 1 of 1000
-
filename = tale.txt, k = 10
-
filename = tale.txt, k = 50
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
==> FAILED
Test 4: check main() when k = 0
- filename = distinct.txt, k = 0
- filename = distinct.txt, k = 0 ==> passed
Test 5a: check that permutations are uniformly random (for inputs with no duplicate strings)
-
filename = permutation4.txt, k = 1
-
filename = permutation4.txt, k = 2
- student prints an invalid permutation: D D
- failed on trial 21 of 1000
-
filename = permutation4.txt, k = 3
- student prints an invalid permutation: A A C
- failed on trial 1 of 1000
-
filename = permutation4.txt, k = 4
- student prints an invalid permutation: A D A D
- failed on trial 1 of 1000
-
filename = permutation6.txt, k = 2
- student prints an invalid permutation: B B
- failed on trial 4 of 1000
==> FAILED
Test 5b: check that permutations are uniformly random (for inputs with duplicate strings)
-
filename = permutation5.txt, k = 1
-
filename = permutation5.txt, k = 2
value observed expected 2*O*ln(O/E) ------------------------------------------- A A 362 300.0 136.01 A B 231 300.0 -120.75 B A 232 300.0 -119.27 B B 175 100.0 195.87 ------------------------------------------- 1000 1000.0 91.86G-statistic = 91.86 (p-value = 0.000000, reject if p-value <= 0.0001) Note: a correct solution will fail this test by bad luck 1 time in 10,000.
-
filename = permutation5.txt, k = 3
- student prints an invalid permutation: B B B
- failed on trial 7 of 1000
-
filename = duplicates.txt, k = 3
- student prints an invalid permutation: AA AA BB
- failed on trial 9 of 1000
-
filename = permutation8.txt, k = 2
- student prints an invalid permutation: A A
- failed on trial 23 of 1000
==> FAILED
Total: 4/9 tests passed!
================================================================
- TIMING (substituting reference RandomizedQueue and Deque)
Timing Permutation *----------------------------------------------------------- Running 23 total tests.
Test 1: count calls to methods in StdIn
-
java Permutation 5 < distinct.txt
-
java Permutation 10 < permutation10.txt
-
java Permutation 1 < mediumTale.txt
-
java Permutation 20 < tale.txt
-
java Permutation 100 < tale.txt
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: -
java Permutation 16412 < tale.txt
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
==> FAILED
Test 2: count calls to methods in Deque and RandomizedQueue
-
java Permutation 5 < distinct.txt
-
java Permutation 10 < permutation10.txt
-
java Permutation 1 < mediumTale.txt
-
java Permutation 20 < tale.txt
-
java Permutation 100 < tale.txt
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: -
java Permutation 16412 < tale.txt
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
==> FAILED
Test 3: count calls to methods in StdRandom
-
java Permutation 5 < distinct.txt
- main() should call StdRandom() at most twice per string
- number of strings = 9
- number of elementary StdRandom() operations = 45
-
java Permutation 10 < permutation10.txt
- main() should call StdRandom() at most twice per string
- number of strings = 10
- number of elementary StdRandom() operations = 100
-
java Permutation 1 < mediumTale.txt
-
java Permutation 20 < tale.txt
- main() should call StdRandom() at most twice per string
- number of strings = 138653
- number of elementary StdRandom() operations = 2773060
-
java Permutation 100 < tale.txt
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: -
java Permutation 16412 < tale.txt
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: OperationCountLimitExceededException Number of calls to methods in RandomizedQueue exceeds limit: 10000000 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
==> FAILED
Test 4: Time main() with k = 5, for inputs containing n random strings
n seconds
=> passed 1000 0.00 => passed 2000 0.00 => passed 4000 0.01 => passed 8000 0.01 => passed 16000 0.01 => passed 32000 0.02 => passed 64000 0.04 => passed 128000 0.08 => passed 256000 0.17 => passed 512000 0.36 ==> 10/10 tests passed
Test 5: Time main() with k = 1000, for inputs containing n random strings
n seconds
=> passed 1000 0.02 => passed 2000 0.05 => passed 4000 0.09
::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
OperationCountLimitExceededException
Number of calls to methods in StdRandom exceeds limit: 10000000
::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
=> FAILED 8000 Infinity [ Most likely main() takes more than linear time. ] ==> 3/10 tests passed
Total: 13/23 tests passed!
================================================================
- MEMORY
Analyzing memory of Permutation *----------------------------------------------------------- Running 2 total tests.
Test 1: check that only one Deque or RandomizedQueue object is created
- filename = distinct.txt, n = 9, k = 1
- filename = distinct.txt, n = 9, k = 2
- filename = distinct.txt, n = 9, k = 4
- filename = tinyTale.txt, n = 12, k = 10
- filename = tale.txt, n = 138653, k = 50 ==> passed
Test 2: check that the maximum size of any Deque or RandomizedQueue object created is between k and n
- filename = distinct.txt, n = 9, k = 1
- filename = distinct.txt, n = 9, k = 2
- filename = distinct.txt, n = 9, k = 4
- filename = tinyTale.txt, n = 12, k = 10
- filename = tale.txt, n = 138653, k = 5
- filename = tale.txt, n = 138653, k = 50
- filename = tale.txt, n = 138653, k = 500
- filename = tale.txt, n = 138653, k = 5000
- filename = tale.txt, n = 138653, k = 50000
Total: 0/2 tests passed: Could not complete tests, which results in a reported score of 0.
- MEMORY
Analyzing memory of Deque *----------------------------------------------------------- For tests 1-4, the maximum amount of memory allowed for a Deque containing n items is 48n + 192.
Running 28 total tests.
Test 1a-1e: Total memory usage after inserting n items, where n is a power of 2.
n bytes
=> passed 8 480
=> passed 64 3168
=> passed 256 12384
=> passed 1024 49248
=> passed 4096 196704
==> 5/5 tests passed
Memory: 48.00 n + 96.00 (R^2 = 1.000)
Test 2a-2e: Total memory usage after inserting n+1 items, where n is a power of 2.
n bytes
=> passed 8 528
=> passed 64 3216
=> passed 256 12432
=> passed 1024 49296
=> passed 4096 196752
==> 5/5 tests passed
Memory after adding n = 2^i + 1 items: 48.00 n + 96.00 (R^2 = 1.000)
Test 3a-3e: Total memory usage after inserting 2n+1 items and deleting n items, where n is a power of 2.
n bytes
=> passed 8 528
=> passed 64 3216
=> passed 256 12432
=> passed 1024 49296
=> passed 4096 196752
==> 5/5 tests passed
Memory: 48.00 n + 96.00 (R^2 = 1.000)
Test 4a-4e: Total memory usage after inserting n items and then deleting all but one item, where n is a power of 2. (should not grow with n or be too large of a constant)
n bytes
=> passed 8 144
=> passed 64 144
=> passed 256 144
=> passed 1024 144
=> passed 4096 144
==> 5/5 tests passed
Memory after adding n = 2^i items: 144.00 (R^2 = 1.000)
Test 5a-5e: Total memory usage of iterator after inserting n items. (should not grow with n or be too large of a constant)
n bytes
=> passed 8 32
=> passed 64 32
=> passed 256 32
=> passed 1024 32
=> passed 4096 32
==> 5/5 tests passed
Memory of iterator after adding n = 2^i items: 32.00 (R^2 = 1.000)
Test 6a: Insert n strings; delete them one at a time, checking for loitering after each deletion. The probabilities of addFirst() and addLast() are (p1, p2), respectively. The probabilities of removeFirst() and removeLast() are (q1, q2), respectively
- 100 random insertions (1.0, 0.0) and 100 random deletions (1.0, 0.0)
- 100 random insertions (1.0, 0.0) and 100 random deletions (0.0, 1.0)
- 100 random insertions (0.0, 1.0) and 100 random deletions (1.0, 0.0)
- 100 random insertions (0.0, 1.0) and 100 random deletions (0.0, 1.0)
- 100 random insertions (0.5, 0.5) and 100 random deletions (0.5, 0.5) ==> passed
Test 6b: Perform random operations, checking for loitering after each operation. The probabilities of addFirst(), addLast(), removeFirst(), and removeLast() are (p1, p2, p3, p4), respectively.
- 100 random operations (0.8, 0.0, 0.2, 0.0)
- 100 random operations (0.8, 0.0, 0.0, 0.2)
- 100 random operations (0.0, 0.8, 0.2, 0.0)
- 100 random operations (0.0, 0.8, 0.0, 0.2)
- 100 random operations (0.4, 0.4, 0.1, 0.1)
- 100 random operations (0.2, 0.2, 0.3, 0.3) ==> passed
Test 7: Worst-case constant memory allocated or deallocated per deque operation?
- 128 random operations
- 256 random operations
- 512 random operations ==> passed
Total: 28/28 tests passed!
================================================================
Analyzing memory of RandomizedQueue *----------------------------------------------------------- For tests 1-5, the maximum amount of memory allowed for a RandomizedQueue containing n items is 48n + 192.
Test 1a-1i: Total memory usage after inserting n items when n is a power of 2.
n bytes
=> passed 32 312
=> passed 64 568
=> passed 128 1080
=> passed 256 2104
=> passed 512 4152
=> passed 1024 8248
=> passed 2048 16440
=> passed 4096 32824
=> passed 8192 65592
==> 9/9 tests passed
Memory: 8.00 n + 56.00 (R^2 = 1.000)
Test 2a-2i: Total memory usage after inserting n items, when n is one more than a power of 2.
n bytes
=> passed 33 568
=> passed 65 1080
=> passed 129 2104
=> passed 257 4152
=> passed 513 8248
=> passed 1025 16440
=> passed 2049 32824
=> passed 4097 65592
=> passed 8193 131128
==> 9/9 tests passed
Memory: 16.00 n + 40.00 (R^2 = 1.000)
Test 3a-3i: Total memory usage after inserting 2n-1 items, and then deleting n-1 items, when n is one more than a power of 2.
n bytes
=> passed 33 1080
=> passed 65 2104
=> passed 129 4152
=> passed 257 8248
=> passed 513 16440
=> passed 1025 32824
=> passed 2049 65592
=> passed 4097 131128
=> passed 8193 262200
==> 9/9 tests passed
Memory: 32.00 n + 24.00 (R^2 = 1.000)
Test 4a-4i: Total memory usage after inserting n items, deleting n items, then inserting n times, when n is a power of 2.
n bytes
=> passed 32 312
=> passed 64 568
=> passed 128 1080
=> passed 256 2104
=> passed 512 4152
=> passed 1024 8248
=> passed 2048 16440
=> passed 4096 32824
=> passed 8192 65592
==> 9/9 tests passed
Memory: 8.00 n + 56.00 (R^2 = 1.000)
Test 5a-5i: Total memory usage after inserting n items, and then deleting all but one item.
n bytes
=> passed 32 88
=> passed 64 88
=> passed 128 88
=> passed 256 88
=> passed 512 88
=> passed 1024 88
=> passed 2048 88
=> passed 4096 88
=> passed 8192 88
==> 9/9 tests passed
Memory: 88.00 (R^2 = 1.000)
Test 6a-6d: Total memory usage of iterator after inserting n items.
n bytes
=> passed 32 192
=> passed 64 320
=> passed 128 576
=> passed 256 1088
=> passed 512 2112
=> passed 1024 4160
=> passed 2048 8256
=> passed 4096 16448
=> passed 8192 32832
==> 9/9 tests passed
Memory: 4.00 n + 64.00 (R^2 = 1.000)
Test 7a: Insert 100 strings; delete them one at a time, checking for loitering after each deletion. ==> passed
Test 7b: Perform random operations, checking for loitering after each operation. The probabilities of enqueue(), dequeue(), and sample() are (p1, p2, p3), respectively.
- 200 random operations (0.8, 0.2, 0.0)
- 200 random operations (0.2, 0.8, 0.0)
- 200 random operations (0.6, 0.2, 0.2)
- 200 random operations (0.2, 0.4, 0.4) ==> passed
Test 8: Insert T items into queue; then iterate over queue and check that worst-case constant memory is allocated or deallocated per iterator operation.
- T = 64
- T = 128
- T = 256 ==> passed
Test 9: Total memory usage after inserting n items, seeking to identify values of n where memory usage is minimized as a function of n.
n bytes
=> passed 8 120
=> passed 16 184
=> passed 32 312
=> passed 64 568
=> passed 128 1080
=> passed 256 2104
=> passed 512 4152
=> passed 1024 8248
=> passed 2048 16440
==> 9/9 tests passed
Memory: 8.00 n + 56.00 (R^2 = 1.000)
Test 10: Total memory usage after inserting 4096 items, then successively deleting items, seeking values of n where memory usage is maximized as a function of n
n bytes
=> passed 2048 65592
=> passed 1024 32824
=> passed 512 16440
=> passed 256 8248
=> passed 128 4152
=> passed 64 2104
=> passed 32 1080
=> passed 16 568
=> passed 8 312
==> 9/9 tests passed
Memory: 32.00 n + 56.00 (R^2 = 1.000)
Min observed memory for RandomizedQueue: 8.00 n + 56.00 (R^2 = 1.000) Max observed memory for RandomizedQueue: 32.00 n + 24.00 (R^2 = 1.000)
Running 75 total tests.
Total: 75/75 tests passed!
================================================================
- TIMING
Timing Deque *----------------------------------------------------------- Running 55 total tests.
Test 1a-1g: make n random calls to addFirst(), removeFirst(), isEmpty(), and size() with probabilities (0.7, 0.1, 0.1, 0.1)
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.01 => passed 128000 0.01 => passed 256000 0.02 => passed 512000 0.04 => passed 1024000 0.08 => passed 2048000 0.12 ==> 12/12 tests passed
Test 2a-2g: make n random calls to addLast(), removeLast(), isEmpty(), and size(), with probabilities (0.7, 0.1, 0.1, 0.1)
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.00 => passed 128000 0.01 => passed 256000 0.01 => passed 512000 0.02 => passed 1024000 0.04 => passed 2048000 0.07 ==> 12/12 tests passed
Test 3a-3g: make n random calls to addFirst(), addLast(), removeFirst(), removeLast(), isEmpty(), and size() with probabilities (0.3, 0.3, 0.1, 0.1, 0.1, 0.1)
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.00 => passed 128000 0.00 => passed 256000 0.01 => passed 512000 0.02 => passed 1024000 0.04 => passed 2048000 0.16 ==> 12/12 tests passed
Test 4a-4g: make n calls to addFirst(); iterate over the n items by calling next() and hasNext()
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.01 => passed 128000 0.01 => passed 256000 0.02 => passed 512000 0.04 => passed 1024000 0.02 => passed 2048000 0.03 ==> 12/12 tests passed
Test 5a-5g: make n calls to addFirst()/addLast(); interleave n calls each to removeFirst()/removeLast() and addFirst()/addLast()
n seconds
=> passed 1025 0.00 => passed 2049 0.00 => passed 4097 0.00 => passed 16385 0.00 => passed 32767 0.00 => passed 32768 0.00 => passed 32769 0.00 ==> 7/7 tests passed
Total: 55/55 tests passed!
================================================================
Timing RandomizedQueue *----------------------------------------------------------- Running 58 total tests.
Test 1: make n calls to enqueue(); make n calls to dequeue(); count calls to StdRandom
- n = 10
- n = 100
- n = 1000 ==> passed
Test 2: make n calls to enqueue(); make n calls to sample(); count calls to StdRandom
- n = 10
- n = 100
- n = 1000 ==> passed
Test 3: make n calls to enqueue(); iterate over the n items; count calls to StdRandom
- n = 10
- n = 100
- n = 1000 ==> passed
Test 4a-g: make n random calls to enqueue(), sample(), dequeue(), isEmpty(), and size() with probabilities (0.2, 0.2, 0.2, 0.2, 0.2)
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.00 => passed 128000 0.01 => passed 256000 0.01 => passed 512000 0.02 => passed 1024000 0.05 => passed 2048000 0.09 ==> 12/12 tests passed
Test 5a-g: make n random calls to enqueue(), sample(), dequeue(), isEmpty(), and size() with probabilities (0.6, 0.1, 0.1, 0.1, 0.1)
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.00 => passed 128000 0.01 => passed 256000 0.02 => passed 512000 0.03 => passed 1024000 0.07 => passed 2048000 0.14 ==> 12/12 tests passed
Test 6a-g: make n random calls to enqueue(), sample(), dequeue(), isEmpty(), and size() with probabilities (0.1, 0.1, 0.6, 0.1, 0.1)
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.00 => passed 128000 0.01 => passed 256000 0.01 => passed 512000 0.02 => passed 1024000 0.04 => passed 2048000 0.09 ==> 12/12 tests passed
Test 7a-g: make n calls to enqueue(); iterate over the n items by calling next() and hasNext().
n seconds
=> passed 1024 0.00 => passed 2048 0.00 => passed 4096 0.00 => passed 8192 0.00 => passed 16384 0.00 => passed 32768 0.00 => passed 65536 0.01 => passed 128000 0.01 => passed 256000 0.02 => passed 512000 0.04 => passed 1024000 0.06 => passed 2048000 0.14 ==> 12/12 tests passed
Test 8a-g: make n calls to enqueue(); interleave n calls each to dequeue() and enqueue().
n seconds
=> passed 1025 0.00 => passed 2049 0.00 => passed 4097 0.00 => passed 16385 0.00 => passed 32767 0.00 => passed 32768 0.00 => passed 32769 0.00 ==> 7/7 tests passed
Total: 58/58 tests passed!
================================================================