class CircularArray: def __init__(self, lin, st, sz): # Initializing Variables self.start = st self.size = sz self.cir = []*len (lin) # This method will check whether the array is palindrome or not def palindromeCheck(self): #Hard # To Do pass # Remove this line print("= ======Test 4====== ") lin_arr3 = [10, 20, 30, 20, 10, None, None] c3 = CircularArray (lin_arr3, 3, 5) c3.printForward() # This should print: 10, 20, 30, 20, 10 c3.palindromeCheck() # This should print: This array is a palindrome print("==========Test_5==== lin_arr4 = [10, 20, 30, 20, None, None, None] c4 = CircularArray (lin_arr4, 3, 4) c4.printForward() # This should print: 10, 20, 30, 20 c4.palindromeCheck() # This should print: This array is NOT a palindrome

class CircularArray: def init(self, lin, st, sz): # Initializing Variables self.start = st self.size = sz self.cir = []*len (lin) # This method will check whether the array is palindrome or not def palindromeCheck(self): #Hard # To Do pass # Remove this line print("= ======Test 4====== ") lin_arr3 = [10, 20, 30, 20, 10, None, None] c3 = CircularArray (lin_arr3, 3, 5) c3.printForward() # This should print: 10, 20, 30, 20, 10 c3.palindromeCheck() # This should print: This array is a palindrome print("==========Test_5==== lin_arr4 = [10, 20, 30, 20, None, None, None] c4 = CircularArray (lin_arr4, 3, 4) c4.printForward() # This should print: 10, 20, 30, 20 c4.palindromeCheck() # This should print: This array is NOT a palindrome

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter7: Using Methods

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

In java language Create a class name FunWithArrays and create the following methods: consecutiveValueChecker(int arr[]): This method will not allow user to input consecutive values in an array Input: 3,4,2,1,5,5 Output: Cannot input consecutive value please input value other than 5 calcultesLongestSequence(String arr[]): This method will take a string array and calculate length of values at each index also print the word having the longest length.
Method Implementation Design and implement a method to swap the first and the last element of an array. For example, 1 4 9 16 25 would be transformed into 25 4 9 16 1. Important: You don’t need to test this method in main(). You don’t need to initialize the array. You don’t print out the values in the method. All you need to do is swap the first with the last element. pubilc static void swapFirstLast(int [] arr) {
Java Programming (The Course class) Revise the Course class as follows: • Revise the getStudents() method to return an array whose length is the same as the number of students in the course. (Hint: create a new array and copy students to it.)• The array size is fixed in Listing 10.6. Revise the addStudent method to automatically increase the array size if there is no room to add more students. This is done by creating a new larger array and copying the contents of the current array to it.• Implement the dropStudent method.• Add a new method named clear() that removes all students from the course. Write a test program that creates a course, adds three students, removes one, and displays the students in the course
public class ArrayCommonOperations{ public static void main(String [] args) { //*** Task #1: Define and instantiate an array of integer numbers, with 10 elements //*** Task #2: Fill in the array with integer numbers from 1 to 100 //*** Task #3: define another array, named temp, and copy the initial array in it. //* This allows to preserve the original array //*** Task #4: Define the variables you need to calculate the following values, //* and initialize them with appropriate values. //*** Task #5: Print the original array //*** Task #6: Calculate the sum of all values //*** Task #7: Count the number of even values //*** Task #8: Calculate the minimum value in the array //*** Task #9: Calculate the maximum value in the array //*** Task #10: Replace the elements that are divisible by 3, with their value plus 2 //*** Task #11:…
Arrays: create an array of a given type and populate its values. Use of for loop to traverse through an array to do the following : to print the elements one by one, to search the array for a given value. ArrayList: create an ArrayList containing elements of a given type . Use some of the common ArrayList methods to manipulate contents of the ArrayList. Write methods that will take an ArrayList as its parameter/argument ; and/or return an ArrayList reference variable as its return type. Searching for an object in an Array: Loop through the ArrayList to extract each object and to check if this object’s attribute has a given value. Explain how and why interfaces are used in Java Collection Framework. Explain the major differences between a Stack and a Queue. Be able to use stack and queue methods. What is meant by O(N) notation? Express the complexity of a given code using the O(N) notation.
Method Details: public static java.lang.String getArrayString(int[] array, char separator) Return a string where each array entry (except the last one) is followed by the specified separator. An empty string will be return if the array has no elements. Parameters: array - separator - Returns: stringThrows:java.lang.IllegalArgumentException - When a null array parameter is provided
Enhanced selection sort SelectionSortDemo.java package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue =…
class Main { // this function will return the number elements in the given range public static int getCountInRange(int[] array, int lower, int upper) { int count = 0; // to count the numbers // this loop will count the numbers in the range for (int i = 0; i < array.length; i++) { // if element is in the range if (array[i] >= lower && array[i] <= upper) count++; } return count; } public static void main(String[] args) { // array int array[] = {1,2,3,4,5,6,7,8,9,0}; // ower and upper range int lower = 1, upper = 9; // throwing an exception…
Enhanced selection sort algorithm SelectionSortDemo.java package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue…
class Polygon:def __init__ (self, num):self.number_of_sides = numdef print_n_sides(self):print("There are" + str(self.number_of_sides) + "sides.") array = []try:number = int(input("Enter number of elemets :"))for i in range(0, number):ele = int(input())array.append(ele)print(array) except ValueError:print("The value was invalid")else:("No error") class Triangle(Polygon):def __init__(self, lenghts_of_sides):Polygon.__init__(self, 3)self.length_of_sides = length_of_sidesdef get_perimeterArea(self):a = float(input("Please Enter the First side of a Triangle: "))b = float(input("Please Enter the Second side of a Triangle: "))c = float(input("Please Enter the Third side of a Triangle: ")) p = a + b + cs = (a + b + c) / 2Area = (s*(s-a)*(s-b)*(s-c)) ** 0.5 class Quadrilateral(Polygon):def __init___(self, length_of_sides):Triangle.__init__(self)self.length_of_sides = length_of_sidesdef get_areaPerimeter(self):a = float(input("Please Enter the First side of a Quadrilateral: "))b =…
class Polygon:def __init__ (self, num):self.number_of_sides = numdef print_n_sides(self):print("There are" + str(self.number_of_sides) + "sides.") array = []try:number = int(input("Enter number of elemets :"))for i in range(0, number):ele = int(input())array.append(ele)print(array) except ValueError:print("The value was invalid")else:("No error") class Triangle(Polygon):def __init__(self, lenghts_of_sides):Polygon.__init__(self, 3)self.length_of_sides = length_of_sidesdef get_perimeterArea(self):a = float(input("Please Enter the First side of a Triangle: "))b = float(input("Please Enter the Second side of a Triangle: "))c = float(input("Please Enter the Third side of a Triangle: ")) p = a + b + cs = (a + b + c) / 2Area = (s*(s-a)*(s-b)*(s-c)) ** 0.5 class Quadrilateral(Polygon):def __init___(self, length_of_sides):Triangle.__init__(self)self.length_of_sides = length_of_sidesdef get_areaPerimeter(self):a = float(input("Please Enter the First side of a Quadrilateral: "))b =…
classHighArrayApp { public static void main(String[] args) { intmaxSize=100;// array size HighArrayarr;// reference to array arr=newHighArray(maxSize);// create the array arr.insert(77);// insert 10 items arr.insert(99); arr.insert(44); arr.insert(55); arr.insert(22); arr.insert(88); arr.insert(11); arr.insert(00); arr.insert(66); arr.insert(33); arr.display();// display items intsearchKey=35;// search for item if(arr.find(searchKey)) System.out.println("Found " + searchKey); else System.out.println("Can’t find " + searchKey); arr.delete(00);// delete 3 items arr.delete(55); arr.delete(99); arr.display();// display items again }// end main() }// end class HighArrayApp // highArray.java // demonstrates array class with high-level interface // to run this program: C>java HighArrayApp //////////////////////////////////////////////////////////////// class HighArray { private long[] a; // ref to array a private int nElems; // number of data items…