You have to modify the given Java function. You will be given a list of numbers, where numbers will appear multiple times. You have to return the number that appears exactly 5 times. You can be sure that input will consist of such a number. ** Modify the code snippet where it says "WRITE CODE HERE" import java.util.List; public class FinalsQ3 { public int getElementOccuringFiveTimes (List list){ // eg. list can contain [7,2,3,7,4,2,7,10,5,3,7,2,7,10,1] // your function should return 7, as '7' appears 5 times // WRITE CODE HERE return -1; // edit this return statement, to return correct number. // WRITING CODE ENDS HERE

You have to modify the given Java function. You will be given a list of numbers, where numbers will appear multiple times. You have to return the number that appears exactly 5 times. You can be sure that input will consist of such a number. ** Modify the code snippet where it says "WRITE CODE HERE" import java.util.List; public class FinalsQ3 { public int getElementOccuringFiveTimes (List list){ // eg. list can contain [7,2,3,7,4,2,7,10,5,3,7,2,7,10,1] // your function should return 7, as '7' appears 5 times // WRITE CODE HERE return -1; // edit this return statement, to return correct number. // WRITING CODE ENDS HERE

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

I have done this question, but I feel like for some lines, they were supposed to be changed would you be able to help me with that? Consider the following function and attempted body."""from typing import TextIOdef allergy_checker(shopping_lists: TextIO,clean_shopping_lists: TextIO, allergies: list[str]) -> None:'''shopping_lists is a file open for reading that has at least one food name on everynon-blank line. Food names are separated by a space.Each line in shopping_lists ends with a newline character.clean_shopping_lists is a file open for writing.allergies is a list of one-word food names.Copy lines from shopping_lists to clean_shopping_lists.For each food name that is in the allergies list, replace it with 'REMOVED'.If a blank line in shopping_lists is reached, stop reading the file.'''shopping_lists = open(shopping_lists) # Line 1clean_shopping_lists = open(clean_shopping_lists, 'w') # Line 2line = shopping_lists.readline() # Line 3while line.strip(): # Line 4line =…
Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
Write a python function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have to sort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9]) (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]
You are given a java program that creates a list of strings containing the names of some fruits, and then prints out the names of the fruits in reverse order: import java.util.*; public class FruitListExercise { public static void main(String[] args) { List<String> fruits = new ArrayList<>(); fruits.add("apple"); fruits.add("banana"); fruits.add("orange"); Collections.reverse(fruits); for (String fruit : fruits) { System.out.println(fruit); } } } Your job is to modify the above code to ask the user for the name of the fruits and print them in alpha order.
Please answer it in Python Write a function indice_de that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. Example: indice_de(12, [4, 7, 12, 0, 21, 5]) return => 2 (because 12 is placed at index 2), and indice_de(6, [4, 7, 12, 0, 21, 5]) return => None. Write a function trouve_premier_pair that takes a list as an argument and returns the even integer that appears first in the list. If the list does not contain an even integer, the function will return None. Example: trouve_premier_pair([1, 15, 4, 7, 12, 3]) return =>4 and trouve_premier_pair([1, 17, 7]) return =>None. Write a function extrait_even that takes as an…
PLEASE HELP ME ON THE NESTED LOOPING FUNCTION ON THE LAST... WHERE IN (When done, ask user to repeat or go back to main menu) So it must return to Main function when the user will choose "N" pleaseee,,,#include <stdio.h>#include <conio.h> int ch; void Nestedlooping();void Recursion();void Array();void FileHandling();void Exit(); void main(){ while (1); printf("\n\n\t\t\t oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo\n"); printf("\n\n\t\t\t oo \t\t ALLEAH CPE112 Final Exam Menu Programs oo"); printf("\n\n\t\t\t oo \t\t \n\nPress (1) for Nested Looping oo"); printf("\n\n\t\t\t oo \t\t \nPress (2) for Recursion oo"); printf("\n\n\t\t\t oo \t\t \nPress (3) for Array oo"); printf("\n\n\t\t\t oo \t\t \nPress (4) for File Handling oo"); printf("\n\n\t\t\t oo \t\t \nPress (5) to…
program- python Write a function called “missing”. Ask the user for a series of integers from 1 to N. Send that list to missing and have it return the list of what numbers are missing. For example, if they enter 1 3 7 10, then you would call missing on that list which returns the list of missing numbers and then you can let them know by printing out the list that they are missing 2 4 5 6 8 9. Test it out on this and show it works. PLEASE USE SET SUBTRACTION
Please answer it in Python Write a function min_odd that takes a list as an argument and returns the smallest even integer contained in the list. If the list contains no even integers, the function will return None. For Example : min_odd([45, 62, 19, 22, 26, 18, 3, 5, 14])Expected answer is 14 min_odd([])Expected answer is None Write a function index_of that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. For Example: index_of(34, [3, 67, 62, 34, 19, 24])Expected answer is 3 index_of(16, [2, 6, 104, 5, 25, 18, 50, 16])Expected answer is 7
A supermarket wants to reward its best customer of each day, showing the customer’s name on a screen in the supermarket. For that purpose, the customer’s purchase amount is stored in a list and the customer’s name is stored in a corresponding list. Implement a function nameOfBestCustomer that returns the name of the customer with the largest sale. def nameOfBestCustomer(sales, customers) Write a program that prompts the cashier to enter all prices and names, adds them to two lists, calls the function that you implemented, and displays the result. Use a price of 0 as a sentinel. Make sure that you use functions in your solution, including a main function.
PYTHON!!!! Complete the below function which takes a list of distinct positive integers and a target positive integer value, and then returns a list of the pairs of integers where each pair sums up to the target value. Each pair is represented as a tuple. For example, pairsum([3,2,6,1,5,4], 7) should return [(1,6), (2,5), (3,4)] If there are no pairs matching the target value, then you should return an empty list. IMPORTANT: the first integer in a tuple must be always smaller than the second integer. So, (5,3) is wrong and (3,5) is correct, and the resulting list must be in ascending order of first element in each tuple. """ def pairsum(list1, target):
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.