MyLab Programming with Pearson eText -- Access Code Card -- for Starting Out with Java: From Control Structures through Objects
7th Edition
ISBN: 9780134793672
Author: GADDIS
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 7.11, Problem 7.21CP
Explanation of Solution
Sequential search:
- Sequential search is a process of searching for a particular element that is present in the array on by one till the last element until the search element is found.
- The search uses loop that iterates from the beginning till the last element to find the search element.
- The search continues for all the elements present in the array until the last element.
- The search of the target element is made after comparing with the each and every element that is present in the array.
Number of comparison in Sequential search:
To search the target element that is present in the array, the search element is compared with the number of elements present in the array...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
value
You are given 4 items as {value, weightpairs in this format {{20, 5}, {60, 20}, {25, 10}, {X, 25}}You can assume that the array is sorted based on the
ratio. The
weight
capacity of knapsack is 50. The item no. 4 (whose weightis 25 ) is taken fractionally to fill upto the knapsack capacity. That fraction is represented in format. What is the
lowest possible value of b?
For the question above, assume the total value stored in the knapsack is 135 after you have filled upto the knapsack capacity. What is the value of X(in other words, the valueof
the item no. 4) ?
Give your answer to at least two decimal places.
Detailed answer please. I will Upvote
Please correct answer only to get Upvote
Chapter 7 Solutions
MyLab Programming with Pearson eText -- Access Code Card -- for Starting Out with Java: From Control Structures through Objects
Ch. 7.1 - Write statements that create the following arrays:...Ch. 7.1 - Whats wrong with the following array declarations?...Ch. 7.1 - Prob. 7.3CPCh. 7.1 - Prob. 7.4CPCh. 7.1 - Prob. 7.5CPCh. 7.1 - Prob. 7.6CPCh. 7.1 - Prob. 7.7CPCh. 7.1 - Prob. 7.8CPCh. 7.2 - Prob. 7.9CPCh. 7.2 - Prob. 7.10CP
Ch. 7.2 - A program has the following declaration: double[]...Ch. 7.2 - Look at the following statements: int[] a = { 1,...Ch. 7.3 - Prob. 7.13CPCh. 7.3 - Write a method named zero, which accepts an int...Ch. 7.6 - Prob. 7.15CPCh. 7.7 - Recall that we discussed a Rectangle class in...Ch. 7.10 - Prob. 7.17CPCh. 7.11 - What value in an array does the selection sort...Ch. 7.11 - How many times will the selection sort swap the...Ch. 7.11 - Prob. 7.20CPCh. 7.11 - Prob. 7.21CPCh. 7.11 - If a sequential search is performed on an array,...Ch. 7.13 - What import statement must you include in your...Ch. 7.13 - Write a statement that creates an ArrayList object...Ch. 7.13 - Write a statement that creates an ArrayList object...Ch. 7.13 - Prob. 7.26CPCh. 7.13 - Prob. 7.27CPCh. 7.13 - Prob. 7.28CPCh. 7.13 - Prob. 7.29CPCh. 7.13 - Prob. 7.30CPCh. 7.13 - Prob. 7.31CPCh. 7 - In an array declaration, this indicates the number...Ch. 7 - Each element of an array is accessed by a number...Ch. 7 - The first subscript in an array is always. a. 1 b....Ch. 7 - The last subscript in an array is always. a. 100...Ch. 7 - Array bounds checking happens. a. when the program...Ch. 7 - This array field holds the number of elements that...Ch. 7 - Prob. 7MCCh. 7 - This search algorithm repeatedly divides the...Ch. 7 - Prob. 9MCCh. 7 - When initializing a two-dimensional array, you...Ch. 7 - Prob. 11MCCh. 7 - To delete an item from an ArrayList object, you...Ch. 7 - To determine the number of items stored in an...Ch. 7 - True or False: java does not allow a statement to...Ch. 7 - True or False: An arrays sitze declarator can be a...Ch. 7 - Prob. 16TFCh. 7 - True or False: The subscript of the last element...Ch. 7 - Prob. 18TFCh. 7 - True or False: The Java compiler does not display...Ch. 7 - Prob. 20TFCh. 7 - True or False: The first size declarator in the...Ch. 7 - Prob. 22TFCh. 7 - Prob. 23TFCh. 7 - int[] collection = new int[-20];Ch. 7 - Prob. 2FTECh. 7 - Prob. 3FTECh. 7 - Prob. 4FTECh. 7 - Prob. 5FTECh. 7 - The variable names references an integer array...Ch. 7 - The variables numberArray1 and numberArray2...Ch. 7 - Prob. 3AWCh. 7 - In a program you need to store the populations of...Ch. 7 - In a program you need to store the identification...Ch. 7 - Prob. 6AWCh. 7 - Prob. 7AWCh. 7 - Prob. 8AWCh. 7 - Prob. 9AWCh. 7 - Prob. 10AWCh. 7 - Prob. 11AWCh. 7 - Prob. 1SACh. 7 - Prob. 2SACh. 7 - Prob. 3SACh. 7 - Prob. 4SACh. 7 - Prob. 5SACh. 7 - Prob. 6SACh. 7 - Prob. 7SACh. 7 - Prob. 8SACh. 7 - Prob. 9SACh. 7 - Rainfall Class Write a RainFall class that stores...Ch. 7 - Payroll Class Write a Payroll class that uses the...Ch. 7 - Charge Account Validation Create a class with a...Ch. 7 - Charge Account Modification Modify the charge...Ch. 7 - Prob. 5PCCh. 7 - Drivers License Exam The local Drivers License...Ch. 7 - Magic 8 Ball Write a program that simulates a...Ch. 7 - Grade Book A teacher has five students who have...Ch. 7 - Grade Book Modification Modify the grade book...Ch. 7 - Average Steps Taken A Personal Fitness Tracker is...Ch. 7 - Array Operations Write a program with an array...Ch. 7 - Prob. 12PCCh. 7 - Sorted List of 1994 Gas Prices Note: This...Ch. 7 - Name Search If you have downloaded this books...Ch. 7 - Population Data If you have downloaded this books...Ch. 7 - World Series Champions If you have downloaded this...Ch. 7 - 2D Array Operations Write a program that creates a...Ch. 7 - Prob. 18PCCh. 7 - Trivia Game In this programming challenge, you...Ch. 7 - Prob. 20PC
Knowledge Booster
Similar questions
- Using r create a 4×3×4 array where for each of the 3 students, a 4×3 matrix holds their six scores and six averages (i.e., two averages by scores, three averages by subject, and the grand average). The last (i.e., 21st) matrix should hold the elementwise averages of the previous 20 matrices. Do not use a loop. Ini A1 A2 B1 B2 C1 C2 RE 81.9 75.1 78.3 69.2 79.6 74.4 ON 82.7 72.6 85.3 78.9 78.3 75.7 KS 83.8 63.4 73.4 73.5 80.4 66.2 Ini is the student's initials, A1 is subject 1 first, A2 is subject 1 second, etc.arrow_forwardList all the steps used to search for 18 in the sequence 1, 2, 4, 8, 10, 12, 18, 20, 22. Be sure to show EVERY step. A. linear search B. binary search Use the following array and indices in your answer: Array: 1 2 4 8 10 12 18 20 22 Index: 1 2 3 4 5 6 7 8 9arrow_forwardQuicksort Draw annotated arrays for a call to partition. except use initial array values {6, 8, 1, 9, 3, 4, 2, 5}. Make sure you understand the notation and when to switch to the next diagram (after highTurn changes values). The last diagram should be the one in which the pivot has been copied back to the array. Also, say what the return value is.arrow_forward
- WAP to create array for storing marks of 20 students and find2. Highest marks3. Lowest marks4. Average marks.5. Count how many students failed( marks<30)arrow_forwardWith an array of 20,000 elements, what is the maximum number of comparisons the binary search will perform?arrow_forwarddef weighted_mse_grad(w, X, y, V):"""Calculate gradient of the weight MSE loss in the given point w Parameters----------w: array_likeCurrent point, in which we want to evaluate gradient (vector with k+1 elements)X: array_likeDesign matrix with N rows and k+1 columnsy: array_likeVector with N observations of the target variableV: array_likeDiagonal matrix N x N, with the weightsReturns----------out: ndarrayvector of gradient, k+1"""# your code here # TEST weighted_mse_grad()w = np.zeros(5)X = np.random.randn(10, 5)y = np.ones(10)V = np.diag(np.ones(10)) L_grad = weighted_mse_grad(w, X, y, V)assert(L_grad.shape == (5,)) w = np.zeros(5)X = np.eye(5)y = np.ones(5)V = np.diag(np.ones(5))L_grad = weighted_mse_grad(w, X, y, V)assert(L_grad.shape == (5,)), 'The shape of the output on the test case is wrong'assert(np.allclose(5 * L_grad,- y * 2)), 'The values of the output on the test case is wrong'arrow_forward
- If A is a circular array of MAX elements, and rear is an index into that array, what is the formula for the index after rear? a. (rear % 1) + MAX b. rear + (1 % MAX) c. rear % (1 + MAX) d. (rear + 1) % MAXarrow_forwardUsing binary search, if looking for 23 in the following list, what are the numbers that will be compared with 23? (Mid index is the 3th element if there are 6 elements in the array) 8 10 14 20 27 30 36 39 43 51 O a. 25, 10, 14 O b. 30, 14, 27, 20 O c. 27, 10, 14, 20 O d. The element is not on the listarrow_forwardUsing binary search, if looking for 23 in the following list, what are the numbers that will be compared with 23? (Mid index is the 3th element if there are 6 elements in the array) 8 10 14 20 27 30 36 39 43 51 O a. 25, 10, 14 O b. 30, 14, 27, 20 O c. 27, 10, 14, 20 Od. The element is not on the listarrow_forward
- Question 8 Sort the following numbers using an "in place" version of a selection sort. This means that you should have only one array throughout and all elements should be present at all times. Show each "pass" of the algorithm. 34, 25, 11, 44, 21, 8, 4, 28, 16, 31arrow_forwardYou are given an array with following items in sequence: {14, 7, 3, 12, 9, 11, 6, 12} Sort the item using merge sort. Show all steps involve.arrow_forwardData Structure & Algorithm: Here is an array with exactly 15 elements:1 2 3 4 5 6 7 8 9 10 11 12 13 14 15Suppose that we are doing a serial search for an element. Circle any elements that will be found by examining two or fewer numbers from the array.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education