Write class name Student Management having array of students and count of students as attribute. There should be method for the following: Add new Student in Array Remove a Student from Array using Name (of Student) Sort the Students in array using Name (ascending order) Sort the Students in array using Age (ascending order) Sort the Students in array using CGPA (ascending order) Reverse the order of the Students in array Display information of all Students in array (from zero index to last index) Note.This is a java program

Write class name Student Management having array of students and count of students as attribute. There should be method for the following: Add new Student in Array Remove a Student from Array using Name (of Student) Sort the Students in array using Name (ascending order) Sort the Students in array using Age (ascending order) Sort the Students in array using CGPA (ascending order) Reverse the order of the Students in array Display information of all Students in array (from zero index to last index) Note.This is a java program

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
1.12.2 7.7 8.8 2.2 9.9 7.7 4.4 8.8 6.6 7. A method named addRow that takes two parameters: the first is a two-dimensional array of doubles, and the second is a one-dimensional array of doubles. The method must return a new two-dimensional array of doubles that results from adding the second parameter (one-dimensional array) as a last row to the first parameter (two-dimensional array). The following implementation forms the new array by making it point to the same rows of the 2-dimensional array and the 1-dimensional array: public static double[][] addRow(double [] array, double[]row)[ double[][] newArray = new double[array.length+1][]: for(int i=0; i
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example:(in java) Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
A prime integer is any integer that is evenly divisible only byitself and 1. The Sieve of Eratosthenes is a method of finding prime numbers. It operates as follows:a) Create an array with all elements initialized to 1 (true). Array elements with prime subscriptswill remain 1. All other array elements will eventually be set to zero. You’ll ignoreelements 0 and 1 in this exercise.b) Starting with array subscript 2, every time an array element is found whose value is 1,loop through the remainder of the array and set to zero every element whose subscriptis a multiple of the subscript for the element with value 1. For array subscript 2, all elementsbeyond 2 in the array that are multiples of 2 will be set to zero (subscripts 4, 6,8, 10, etc.); for array subscript 3, all elements beyond 3 in the array that are multiplesof 3 will be set to zero (subscripts 6, 9, 12, 15, etc.); and so on.When this process is complete, the array elements that are still set to one indicate that the subscriptis a…
Create a one dimensional array of random numbers and use array methods/functions from the array class to 1) sort the array in ascending/descending order 2) reverse the array 3) create a subarray from your array
What will be the problem with the following algorithm for finding an item in an unsorted array? How can you solve it? int location = 0; bool moreToSearch = (location > length); found = false; while (moreToSearch && !found) { if(item == info[location]) { item = info[location]; } else { location++; moreToSearch = (location > length); } }
Let’s try this calculation, assuming we have an array of size 10. If rear is currently 5, it will be set to 6%10, or 6. If rear is currently 9, it will be set to 10%10or 0. Try this calculation using various situations to see that it works no matterhow big the array is
Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.
Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]
In java language using arrays This method examines the two-dimensional array of integersidentified by the first parameter, whose length (number of rows,also the number of students) is the second parameter, while thethree columns in the array represent the scores for threedifferent tests.The test scores for each student (one row of three grades) arecombined to find the average score for each student. The integerreturned is the number of students with a test average less than 70. @param numStudents, the number of students who took the three tests@param theArray, a 2-D array of integer scores@return, the number of test averages below a score of 70*/public static int testAverage(double[][] theArray, int numStudents){int NUM_TESTS = 3; // your work here // loop though theArray, computing each student's average // your work here// return count of averages below 70.0 // your work here
Write the method sum2D() which accepts a two dimensional integer array and returns the sum of all the elements of the array.
Write a program to ask the user for the number of arrays he wants to maintain and then populate eacharray by taking elements from the user. Merge all these arrays in another array and finally remove duplicateelements from the merged array.