Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. a. You are given n telephone bills and m checks sent to pay the bills (n ≥ m).Assuming that telephone numbers are written on the checks, find out who failed to pay. (For simplicity, you may also assume that only one check is written for a particular bill and that it covers the bill in full.)

Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. a. You are given n telephone bills and m checks sent to pay the bills (n ≥ m).Assuming that telephone numbers are written on the checks, find out who failed to pay. (For simplicity, you may also assume that only one check is written for a particular bill and that it covers the bill in full.)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. For a given positive integer n, find the pair of integers whose sum is n and whose product is as large as possible.
Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. You have a file of n student records indicating each student’s number, name, home address, and date of birth. Find out the number of students from each of the 50 U.S. states.
Write an efficient algorithm for the following problem (either pseudocode or java), and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem will be on repeat numbers input will be ARRAY[1,2, ... , n] number of positive numbes. Output will any one number that is repeated more than n/3 times. for example, if you have [1,1,2,2,2,1], since n = 6 and n/3 = 2, both 1 and 2 showed up more than n/3 times. the output will be either 1 or 2 (just one of the values are required) if you have [1,1,3,4,5,6,7,8,9], since 1 is only repeated twice, and n/3 = 3, output will be "none"
Write an efficient algorithm (to the best of your knowledge) for the following problem, briefly describe why it is a correct algorithm, provide pseudocode, and analyze the time complexity. Problem: RobotWalk Input: An array A[0...n,0...n] of positive integers. A robot that starts at position A[0,0] and wants to reach A[n,n]. At each step, the robot can only move on step either rightward, along the diagonal, or downward. For example, if the current position is (i,j), then the next possible positions are (i,j+1), (i+1,j+1), or (i+1,j). The cost of a path is the sum of the entries that the robot visits. Output: The most expensive path that the robot can take. Example: Input: A = 50 (robot Starts at A[0,0]) 20 30 10 10 10 10 40 40 (robot ends at A[n,n]) Output: 160 (because of the path 50 -> 20 -> 10 -> 40-> 40.
Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamic programming-based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer. Draw the recursion tree for the algorithm where N = 7. Derive the complexity bound of the algorithm. Do not need to prove the complexity bound formally, just derive it by analyzing each component in your algorithm.
Construct a memoized algorithm for this algorithm and and derive its time complexity: Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamicprogramming based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer. You do not need to prove the complexity bound formally, just derive it by analyzing each component in your algorithm.
Write an efficient algorithm for the following problem, and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem: Tower of Hanoi with Every Tower having some Disks Input: Each of the three towers contains roughly n/3 disks. Tower A contains floor(n/3) largest disks. Tower C contains ceiling(n/3) smallest disks. Tower B contains the remaining disks. The disks at each tower are already sorted according to the typical Tower of Hanoi rule. Output: A set of moves that transfers all the n disks to C maintaining the Tower of Hanoi rule that after each move, the smaller disks at a tower will always be above the larger ones.
Santa needs to start preparing for the coming Christmas. He has one bag that canhold a maximum of Mkg in gifts’ weight. Each gift gi has a weight wi, and obviouslySanta wants to take the maximum number of gifts he can hold.Given the weight and value of n gifts and the total weight, M, the bag can hold,Santa needs you to design an algorithm that tells him which gifts he should put in hisbag such that the total number of gifts is maximized given that the total weight ofthe selected gifts should not exceed M. What is the worst-case running time of youralgorithm? Justify your answer.
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply dynamic programming. Do not use recursion/memoization. Make sure ALL test cases return expected outputs. Sample Input 04 412340123 Sample Output 013715 Explanation 0You are given the sequence 1,2,3,4.F0 = A0 = 1F1 = A1 + F0 = 2 + 1 = 3F2 = A2 + F1 + F0 = 3 + 3 + 1 = 7F3 = A3 + F2 + F1 + F0 = 4 + 7 + 3 + 1 = 15 The actual code def solve(k,a): MOD = 1000000007 # compute and return answer here q, n = list(map(int,input().rstrip().split(" ")))a = [int(input().rstrip()) for i in range(n)]outs = []for i in range(q): k = int(input().rstrip()) outs.append(solve(k,a))print("{}".format("\n".join(list(map(str,outs)))))
Design an algorithm for testing if a given number belongs to the following sequence or not, compute its time complexity. u(0)=1, u(1)=1, u(N)=u(N-1)+N.u(N-2)+N
43- Suppose that you implement an algorithm to solve a problem. It works correctly and quickly for small inputs, but you notice that your program runs much slower as the input size grows (to the point of becoming unusable). In fact, each time you increase the input size by one the execution time of your program roughly doubles! Which of the following options is the most effective way of addressing this issue? You may assume that program outputs which are close to optimal are acceptable. a. Purchase a faster computer---this is a worthwhile investment as a programmer and will resolve this kind of issue. b. Design a new approximate algorithm with lower time complexity. c. Remove comments and any other non-essential elements in your source code that may be slowing things down. d. Switch to a more efficient programming language, such as machine code, because although Python is readable it is also too slow. e. Invoke Python with the --linear-time option to force…