Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

• In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,
  • Define the method “swapFirstAndLast()” to swap the first and last elements in an array.
  • Define the method.
    • Create an array.
    • Create an object for “SwapFirstLast”.
    • Create a test array containing random numbers.
    • Call the method “swapFirstAndLast()” to perform swap.

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

• In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,
  • Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.
    • Define the method “main()”.
    • Create an array.
    • Create an object for “RotateRight”.
    • Create an object for “Random”.
    • Create a test array containing random numbers.
    • Call the method “shiftRight()”.

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

• In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,
  • Define the method “replaceEven()” to replace all even elements with “0”.
  • Define the method “main()”.
  • Create an array.
  • Create an object for “ReplaceEven”.
  • Create an object for “Random”.
  • Create a test array containing random numbers.
  • Call the method “replaceEven()”.

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

• In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,
  • Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.
  • Define the method “main()”.
    • Create an array.
    • Create an object for “ReplaceWithLargestNeighbor”.
    • Create an object for “Random”.
    • Create a test array containing random numbers.
    • Call the method “replaceWithLargestNeighbor().

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

• In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,
  • Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.
  • Define the method “main()”.
    • Create an array of odd size.
    • Create an object for “RemoveMiddle”.
    • Create an object for “Random”.
    • Create a test array containing random numbers.
    • Call the method “removeMiddle()” with an array of odd size.
    • Create an array of even size.
    • Create a test array containing random numbers.
    • Call the method “removeMiddle()” with an array of even size.

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

• In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,
  • Define the method “moveEvenToFront()” to move all even elements to the front.
  • Define the method “main()”.
    • Create an array of odd size.
    • Create an object for “MoveEvenToFront”.
    • Create an object for “Random”.
    • Create a test array containing random numbers.
    • Call the method “moveEvenToFront()”.

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

• In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,
  • Define the method “getSecondLargest()” to return the second-largest element in the array.
  • Define the method “main()”.
    • Create an array of odd size.
    • Create an object for “GetSecondLargest”.
    • Create an object for “Random”.
    • Create a test array containing random numbers.
    • Call the method “getSecondLargest()” and print the output.

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

• In the file “InOrder.java”, import necessary package and create a class “InOrder”,
  • Define the method “inOrder()” to return true if the array is recently sorted in increasing order.
  • Define the method “main()”.
    • Initialize the array with sorted and unsorted order.
    • Call the method “inOrder()” to check if the array is sorted or not.

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

• In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,
  • Define the method “adjacentDupes()” to return  true if the array has two adjacent duplicate elements.
  • Define the method “main()”.
    • Create an array of adjacent and non-adjacent duplicate values.
    • Create an object for “AdjacentDupes”.
    • Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

• In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,
  • Define the method “containsDuplicates()” to return  true if the array has duplicate elements.
  • Define the method “main()”.
    • Create an array of adjacent and non-adjacent duplicate values.
    • Create an object for “ContainsDuplicates”.
    • Call the method “containsDuplicates()” to check if the array has duplicate elements.