ZuoTi.Pro
Question
Someone help me with the following questions using java
Canvas x New Tab Help Center Submitted Dec 3 at T0:06pm This attempt took 3 minutes. Question 1 0/0.5 Which of the following lists of numbers would accurately show the array after the first pass through the Selection Sort algorit Index 0 Value 12 18 4, 9, 12.2.6,8.18 9, 4, 12, 2,6,18,8 2,4,9,12, 6, 8. 18 2. 4, 6, 8, 9,12,18 2. 4, 12,9.6,8,18 0/0.5 pts Question 2 the array after the fourth pass of the Selection Sort
xNew Tab Question 8 0/0.5 pt Given the following array, list the INDEX VALUES of each comparison made in order when finding the target binary search? f 12 using 0 Value 3 12 13 16 5 Not yet graded/ 1 pts Question 9 Explain in plain English what is going on in the following code. Would the eqaiso comparison be te or sae w eather 51 weather I w-
Canvas New Tab Help Center。 Incorrect Question 6 0/0.5 pts How many passes will it take for Selection Sort to sort this array? Assume the algorithm runs to completion. Index 0 Value 12 18 3 7 0/0.5 pts Question 7 it takr te find the target value of 12 using binary search?
Helb Center Question 3 0,5 / 0.5 pts How many passes will it take in all for Selection Sort to sort this array? Assume the algorithm runs to completion. Index 0 3 Value 4 12 18 7 0/0.5 pts uestion 4
Ca xNew Tab Question 5 0/0.5 pts Which of the following lists of numbers would accurately show the array after the third pass of the Bubble Sort algorithm2 Index 0 Value 12 18 4, 2, 6, 8, 9. 12, 18 9. 4, 12. 2. 6, 8,18 9.2, 4, 6, 8, 12, 18 e 2,9,4,12, 6,8,18 2. 4, 6, 8, 9,12,18 0/0.5 pts Incorrect uestion6
Canvas xNew Tab Help Center Question 7 0/0.5 Given the following array, how many comparisons will it take to find the target value of 12 using binary search? Index 0 Value 12 13 16 6 0/0.5 pts Question 8 target value of 12 using made in order when finding the
Canvas New Tab Help Center。 Question 2 0. Which of the following lists of numbers would accurately show the array after the fourth pass of the Selection Sort algorit Index 0 Value 4 12 2. 4, 6,8,9,12.18 2. 4, 6,9.12,8,18 9,4,12, 2, 6, 8, 18 2. 4, 6,9,8, 12, 18 2. 4, 6,8, 12.9, 18 0.5/0.5 Question 3
xNew Tab Question 4 0/0.5 pts Which of the following lists of numbers would accurately show the array after the first pass of the Bubble Sort algorithm? Index 0 Value 4 12 18 9, 4, 12. 2, 6,18,8 4,9,2,6, 12, 8, 18 4, 12.9,2,6,8.18 4,9.2, 6,8,12,18 4, 9, 12, 2, 6,8,18 0/0.5 pts Question 5
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Request Professional Answer

Request Answer!

We need at least 10 more requests to produce the answer.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)

All students who have requested the answer will be notified once they are available.
Know the answer?
Add Answer to:
Someone help me with the following questions using java Canvas x New Tab Help Center Submitted...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Similar Homework Help Questions

  • Why not A, who can help me? Canvas Help Center ? Unanswered Question 4 0/3 pts...

    Why not A, who can help me? Canvas Help Center ? Unanswered Question 4 0/3 pts Suppose we were to implement a queue using an array such that both enqeueue and dequeue have O(1) worst-case time complexity. Recall that to ensure con- stant time operations, we had to treat the array as circular. Assume that the front and rear markers begin at index 0. Suppose also that the queue has a fixed capacity of 5. That is, there is no...

  • Java The following questions ask about tracing a binary search. To trace the binary search, list...

    Java The following questions ask about tracing a binary search. To trace the binary search, list the value of first, last, and mid for each pass through the loop or method. Use one of these methods for your trace. public static int binarySearchIterative(int[] numbers, int target) { boolean found = false; int first = 0; int last = numbers.length - 1; while (first <= last && !found) { int mid = (first + last) / 2; if (numbers[mid] == target)...

  • 2) Sorting (a) (5 pts) In a Merge Sort of 8 elements, the Merge function gets...

    2) Sorting (a) (5 pts) In a Merge Sort of 8 elements, the Merge function gets called 7 times. Consider a Merge Sort being executed on the array shown below. What does the array look like right AFTER the sixth call to the Merge function completes? نرا index value 0 40 2 12 4 11 5 99 6 31 7 16 27 18 0 1 2 زيا 4 5 6 7 Index Value (b) (5 pts) Consider sorting the array...

  • JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized...

    JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 int[] numbers = {-30, -9, -6, -4, -2, -1, 0, 2, 4, 10, 12, 17, 22, 30}; ​ // search for the value -5 int index = binarySearch(numbers, -5); Write the indexes of the elements that would be examined by the binary search (the mid values...

  • Write a java program to sort arrays using 3 different methods: Bubble Sort, Selection Sort and...

    Write a java program to sort arrays using 3 different methods: Bubble Sort, Selection Sort and Insertion Sort. The numbers to be sorted will be obtained using a library function which generates pseudo-random numbers. TO Do 1. Fill an array with 140 real numbers between 0.00 and 945.00. Generate the numbers using the subroutine that generates random numbers. Make a spare copy of the array; you will need it later. 2. Call a subroutine to print the contents of the...

  • Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8...

    Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8 9 7 0 4 Pivot selection is defined to be the first element of each sub-list. Show the array before and after each quicksort round (when the array is partitioned after placing the pivot at its correct position). Also, clearly highlight the pivot in each partition b. Consider an unsorted array of integers of size n. Write a Java program to arrange the array...

  • Tree Plot Please write a Java program to print or plot a binary tree in a 2-dimensional character format. You are not...

    Tree Plot Please write a Java program to print or plot a binary tree in a 2-dimensional character format. You are not allowed to use any existing Java classes such as ArrayList or Vector or Tree.    Your program must define 3 binary trees as follows. Each tree is defined in an integer 16 x 3 array. Programming Techniques: (1) The array for the binary tree can be integer data type with 16 rows by 3 columns. Please always make index...

  • Tree Plot Please write a Java program to print or plot a binary tree in a 2-dimensional character format. You are n...

    Tree Plot Please write a Java program to print or plot a binary tree in a 2-dimensional character format. You are not allowed to use any existing Java classes such as ArrayList or Vector or Tree.    Your program must define 3 binary trees as follows. Each tree is defined in an integer 16 x 3 array. Programming Techniques: (1) The array for the binary tree can be integer data type with 16 rows by 3 columns. Please always make index...

  • Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60,...

    Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...

  • Trees Traversals Please write a Java program to traverse a binary tree in in-order and pre-order,...

    Trees Traversals Please write a Java program to traverse a binary tree in in-order and pre-order, and to plot a binary tree into a 2-dimensional array. You may write many recursive methods for this project. You are not allowed to use any existing Java classes such as ArrayList or Vector or Tree. Please stop your program if the user enters 0 as the tree selection. Your program must run the following Test Case 1 plus two more test cases to...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT