Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

java ASSIGNMENT1 Student Grade Max Grade Question Number Q1 Q2 10 CLO 1.2 1.2 5 Total Q1) Write an array class that implements the search

image text in transcribed
java
ASSIGNMENT1 Student Grade Max Grade Question Number Q1 Q2 10 CLO 1.2 1.2 5 Total Q1) Write an array class that implements the search and sort methods discussed in the classroom. Then write a program to test your class. 1. Create an int Array of Size 10,000,000 2. generate random values between 1 and 10000 and store them in the array. 3. Implement the sort method discussed in class and use it to sort the array. 5. Implement search methods discussed in class (linear search and binary search). 6. Generate an array of 50000 keys each in the range (1 to 10000). Then search for each key using both searching techniques and record in another array the number of steps needed to find each key and the time the algorithm took to find the result. Then print the best case, the average case, and the worst case for both search algorithms in terms of the number of steps and the time needed to find a solution. 02) Write a program that represent a class and stores student names and student grades out of 100. The program should ask the users to enter the names and the grades. Then it will show the name of the student with highest grade and the number of students with grades less than the average. Note: DON'T use the Arrays class, Submit the.java files only

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Knowledge Discovery In Databases

Authors: Gregory Piatetsky-Shapiro, William Frawley

1st Edition

ISBN: 0262660709, 978-0262660709

More Books

Students also viewed these Databases questions