CS110 Programming Assignment 7
Loops and Basic Arrays
PROGRAM 1
Write a Java program that tests the method ridFives().
ridFives() receives an integer array of any size and returns a version of the given array where all the 5's have been removed. The remaining elements should shift left towards the start of the array as needed, and the empty spaces at the end of the array should be 0.
Perform the following tests:
- ridFives([1, 5, 6, 7, 2, 5, 5]) -----> [1,6,7,2,0,0,0]
- ridFives([5, 5, 5, 5, 5, 5]) -----> [0,0,0,0,0,0]
- ridFives([5, 6, 5]) -----> [6 ,0,0]
PROGRAM 2
Write a Java program that tests the method hasValues().
hasValues() receives two integer arrays, both sorted in increasing order, big and little.
Code hasValues() so that it returns true if all the numbers in little appear in big and false otherwise.
Perform the following tests:
- hasValues([1,2,3,4], [2,3]) -----> true
- hasValues([2,3,4], [3,4,5]) -----> false
- hasValues([1,2,3,4], [3,4]) -----> true
PROGRAM 3
Write a Java program that tests the method countAdjacent().
countAdjacentSeries() receives an integer array, of random values and returns the number of adjacent series in the given array. For example, an adjacent series is 1, 2, 3, 4.
Perform the following tests:
- countAdjacentSeries([1,2,3,4,5,6]) -----> 1
- countAdjacentSeries([1,2,3,2,3,4]) -----> 2
- countAdjacentSeries([1,2,3,1,2,3]) -----> 2
- countAdjacentSeries([1,1,1,1,1,1]) -----> 0
PROGRAM 4
Write efficient code to create a two-dimensional array containing the 20 rows and 20 columns of a multiplication table from 1 to 20.
See the image below. Only print your code.
