Page 1 of 2 Updated on: 2020-01-23 CPS 151/Spring 2020 In-class Assignment 1 Textbook reference: See discussion of how to insert (add) and remove (delete) an item in a partially filled array while maintaining order of existing items (subsections 6.3.6, 6.3.7). The concept of a partially filled array is discussed in subsection 6.1.3. The program is supposed to: a) allocate storage for an array of integers of a size specified by the user b) fill the array partially with increasing values (number of values chosen by the user) c) check that the item at a user specified index position can be removed, maintaining order of other elements d) check that a new item can be added at a user specified index position, also maintaining order of other elements. Study the startup code and complete the program. You need to complete the validity checks for index position specified by the user. Note that only existing items may be removed, but a new item could be added right after the existing items in the list. Sample output from startup code Page 2 of 2 Updated on: 2020-01-23 Sample Output (successful insert/delete) Sample output with invalid delete/insert positions final static Scanner cin = new Scanner(System.in); static int currentSize; // number of values actually in the intList static int[] intList; // reference to the partially filled array storage /** * @param args the command line arguments */ public static void main(String[] args) { out.println("CPS 151 ICA 1 by _________________________"); setup(); printList(intList, "\nOriginal List"); checkDeletion(); checkInsertion(); printList(intList, "\nFinal List"); out.println("\nGoodbye"); } // end main private static void checkDeletion() { // Checking deletion int position = getInt("\nPosition to delete from: "); // check validity of position if (2 + 2 == 5) { shiftUp(position); currentSize--; printList(intList, "\nList after deletion"); } else { out.println("Invalid delete position, no changes made"); } // end if } // end method private static void checkInsertion() { // Checking insertion int value = getInt("\nValue to insert: "); int position = getInt("At what position? "); // check validity of position if (2 + 2 == 5) { shiftDown(position); intList[position] = value; currentSize++; printList(intList, "\nList after insertion"); } else { out.println("Invalid insert position, no changes made"); } // end if } // end method // fills array with increasing values private static void fillArrayInc(final int startValue, final int howMany) { // Validity check if (h ...

1. Page 1 of 2 Updated on: 2020-01-23
CPS 151/Spring 2020 In-class Assignment 1
Textbook reference: See discussion of how to insert (add) and
remove (delete) an item in a partially filled
array while maintaining order of existing items (subsections
6.3.6, 6.3.7). The concept of a partially filled array
is discussed in subsection 6.1.3.
The program is supposed to:
a) allocate storage for an array of integers of a size specified by
the user
b) fill the array partially with increasing values (number of
values chosen by the user)
c) check that the item at a user specified index position can be
removed, maintaining order of other elements
d) check that a new item can be added at a user specified index
position, also maintaining order of other
elements.

2. Study the startup code and complete the program.
You need to complete the validity checks for index position
specified by the user. Note that only existing items
may be removed, but a new item could be added right after the
existing items in the list.
Sample output from startup code
Page 2 of 2 Updated on: 2020-01-23
Sample Output (successful insert/delete)
Sample output with invalid delete/insert positions
final static Scanner cin = new Scanner(System.in);
static int currentSize; // number of values actually in the
intList
static int[] intList; // reference to the partially filled array
storage

3. /**
* @param args the command line arguments
*/
public static void main(String[] args) {
out.println("CPS 151 ICA 1 by
_________________________");
setup();
printList(intList, "nOriginal List");
checkDeletion();
checkInsertion();
printList(intList, "nFinal List");
out.println("nGoodbye");
} // end main
private static void checkDeletion() {
// Checking deletion
int position = getInt("nPosition to delete from: ");

4. // check validity of position
if (2 + 2 == 5) {
shiftUp(position);
currentSize--;
printList(intList, "nList after deletion");
} else {
out.println("Invalid delete position, no changes made");
} // end if
} // end method
private static void checkInsertion() {
// Checking insertion
int value = getInt("nValue to insert: ");
int position = getInt("At what position? ");
// check validity of position
if (2 + 2 == 5) {
shiftDown(position);

5. intList[position] = value;
currentSize++;
printList(intList, "nList after insertion");
} else {
out.println("Invalid insert position, no changes made");
} // end if
} // end method
// fills array with increasing values
private static void fillArrayInc(final int startValue, final int
howMany) {
// Validity check
if (howMany < 1 || howMany > intList.length) {
terminate("fillArrayInc: illegal argument, howMany = "
+ howMany);
}
for (int k = 0; k < howMany; k++) {
intList[k] = startValue + k;

6. }
currentSize = howMany;
} //end setSequenced
// prints partially filled array with a legend
private static void printList(final int[] arr, final String
legend) {
out.println(legend);
for (int k = 0; k < currentSize; k++) {
out.print(" " + arr[k]);
}
out.println();
} // end printList
// move items from pos+1:currentSize-1 one position up
(lower subscripts)
private static void shiftUp(int pos) {
// Write the code

7. } // end shiftUp
// move items from pos:currentSize-1 one position down
(higher subscripts)
private static void shiftDown(int pos) {
// Write the code
} // end shiftDown
private static void setup() {
int maxSize, initSize;
maxSize = getInt("Enter the maximum size: ");
intList = new int[maxSize];
initSize = getInt("Enter the starting size: ");
if (initSize > maxSize) {
terminate("starting size cannot be greater than
maximum size");
}
fillArrayInc(100, initSize);

8. } // end method
private static int getInt(String prompt) {
out.print(prompt);
return cin.nextInt();
} // end method
private static void terminate(String message) {
out.println("Error: " + message);
exit(0);
} // end terminate