Question #1. Below is the pseudocode that we saw in the previous lesson for the linear search algorithm: for each item in list if item = target then output: true stop output:false Rewrite this pseudocode so that, instead of indicating whether or not the target was found in the list, the output is the number of occurrences of the target. For instance, if list were {8, 3, 5, 1, 3, 9, 2, 8, 3, 3} and target were 3, then the output should be 4, since the number 3 occurs four times in the list. The pseudo code above uses <- as assignment operators for this assessment.

Question #1. Below is the pseudocode that we saw in the previous lesson for the linear search algorithm: for each item in list if item = target then output: true stop output:false Rewrite this pseudocode so that, instead of indicating whether or not the target was found in the list, the output is the number of occurrences of the target. For instance, if list were {8, 3, 5, 1, 3, 9, 2, 8, 3, 3} and target were 3, then the output should be 4, since the number 3 occurs four times in the list. The pseudo code above uses <- as assignment operators for this assessment.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Q2: a. Write an algorithm that searches a sorted list of n items by dividing it into three sublists of almost n/3 items. This algorithm finds the sublist that might contain the given item and divides it into three smaller sublists of almost equal size. The algorithm repeats this process until it finds the item or concludes that the item is not in the list. Dry run the above algorithm to find the value 240. A[] = {10,15,20,60,65,110,150,220,240,245,260,290,300,460,470,501}
let list=1200 element. Note: java programmimg, use given code. 3a. Use the binary search 3b. Use the sequential search Print the number of comparison in step 3(a) and 3(b). If the item is found in the list, print its position. import java.util.*; public class Problem5 { staticScannerconsole = newScanner(System.in); finalstaticintSIZE = 1000; publicstaticvoidmain(String[] args) { Integer[] intList = newInteger[SIZE]; SearchSortAlgorithms<Integer> intSearchObject = new SearchSortAlgorithms<Integer>(); //code } public interface SearchSortADT<T> { publicintseqSearch(T[] list, intstart, intlength, TsearchItem); publicintbinarySearch(T[] list, intstart, intlength, TsearchItem); publicvoidbubbleSort(Tlist[], intlength); publicvoidselectionSort(T[] list, intlength); publicvoidinsertionSort(T[] list, intlength); publicvoidquickSort(T[] list, intlength); publicvoidheapSort(T[] list, intlength); } public class SearchSortAlgorithms<T> implements…
create a piece of code that demonstrates how to find a key K using a skip list S. The search is carried out using the algorithm using the functions next(p) and below(p).
* allSame returns true if all of the elements in list have the same value. * allSame returns false if any two elements in list have different values. * The array may be empty and it may contain duplicate values. * * Your solution should contain at most one loop. You may not use recursion. * Your solution must not call any other functions. * Here are some examples (using "==" informally): * * * * * * * * true == allSame (new double[] { }) true == allSame(new double[] {11}) true == allSame (new double[] { 11, 11, 11, 11 }) false == allSame(new double[] { 11, 11, 11, 22 }) false == allSame (new double[] { 11, 11, 22, 11 }) true == allSame (new double[] { 22, 22, 22, 22 }) * */ public static boolean allSame (double[] list) { return StdRandom.bernoulli(); //TODO: fix this
Create a Flowchart for this code. import random #Define a function to pick 5 numbers from 1 to 38 def getNJCash5lottery_numbers(): #Return the list return random.sample(range(1, 39), 5) def playNJCash5lottery(): #Call the method and assign the list to variable lottery_number = getNJCash5lottery_numbers() print("These are the cash 5 numbers."), #Iterate over list elements for number in lottery_number: #Print the number on one line print(number) #Define a function def main(): while(True): #Call the method to print the list elements playNJCash5lottery() #Prompt the user if they want to play again decide = input("\nDo you want to play again? Yes/No : ") #If they entered "no " or "No" if decide.lower() == "no": #Exit break #Call the "main()" function if __name__ == "__main__": main()
void listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **
This chapter's bubble sort method is less efficient than it could be. If a pass through the list is done without swapping any components, the list is sorted and there is no reason to continue. Change this algorithm to terminate as soon as it recognises that the list is sorted. A break statement should not be used.This chapter's bubble sort method is less efficient than it could be. If a pass through the list is done without swapping any components, the list is sorted and there is no reason to continue. Change this algorithm to terminate as soon as it recognises that the list is sorted. A break statement should not be used.This chapter's bubble sort method is less efficient than it could be. If a pass through the list is done without swapping any components, the list is sorted and there is no reason to continue. Change this algorithm to terminate as soon as it recognises that the list is sorted. A break statement should not be used.This chapter's bubble sort method is less efficient…
Directed Graph G=(V,E), where: v={1,2,3,4} E={{1,2},{2,4},{4,1},{2,3},{3,1},{4,3}}| Which of the following adjacency matrices represents digraph G? Select one: O a {{0,1,0,0},{0,0,11},{1,0,0,0},(1,0,1,0}} b. {{0,1,0,0),(1,0,11}, {1,0,0,0} {0,0,1,0}}| c. {{0,1,0,0},(0,0,1},10.0.1) (1,0,0,0}} d. {{0.10,1},(0.0,1L1).{1,0.10} (1,010}}
Looking for assistance with this question: Fulcrum def can_balance(items): Each element in items is a physical weight, a positive integer instead of some sort of helium balloon. Your task is to 0ind and return a fulcrum position in this list of weights so that when balanced on that position, the total torque of the items to the left of that position equals the total torque of the items to the right of that position. The item on the fulcrum is assumed to be centered symmetrically on the fulcrum, and does not participate in the torque calculation. In physics, the torque of an item with respect to the fulcrum equals its weight times distance from the fulcrum. If a fulcrum position exists, return that position. Otherwise return -1 to arti0icially indicate that the given items cannot be balanced, at least without rearranging them. items Expected result [6, 1, 10, 5, 4] 2 [10, 3, 3, 2, 1] 1 [7, 3, 4, 2, 9, 7, 4] -1 [42] 0…
That's enough for you! def first_preceded_by_smaller(items, k=1): Given a list of items, find and return the value of the first element for which at least k smaller elements precede that element in items. If no such element exists inside the list, this function should return None. The required k smaller items do not need to be consecutive immediate predecessors of the current item, but can be any k items positioned before the current element. items k Expected result [4, 4, 5, 6] 2 5 [42, 99, 16, 55, 7, 32, 17, 18, 73] 3 18 [42, 99, 16, 55, 7, 32, 17, 18, 73] 8 None ['bob', 'carol', 'tina', 'alex', 'jack', 'emmy', 'tammy', 'sam', 'ted'] 4 'tammy' [9, 8, 7, 6, 5, 4, 3, 2, 1, 10] 1 10 [42, 99, 17, 3, 12] 2 None
Baby Names: Each year, the government releases a list of the 10,000 most common baby namesand their frequencies (the number of babies with that name). The only problem with this is thatsome names have multiple spellings. For example, "John" and ''.Jon" are essentially the same namebut would be listed separately in the list. Given two lists, one of names/frequencies and the otherof pairs of equivalent names, write an algorithm to print a new list of the true frequency of eachname. Note that if John and Jon are synonyms, and Jon and Johnny are synonyms, then John andJohnny are synonyms. (It is both transitive and symmetric.) In the final list, any name can be usedas the "real" name.EXAMPLEInput:Names: John (15), Jon (12), Chris (13), Kris (4), Christopher (19)Synonyms: (Jon, John), (John, Johnny), (Chris, Kris), (Chris, Christopher)Output: John (27), Kris (36)
LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all!