8. A country has coins of denomination 3, 5 and 10 respectively. Write a recursive function canchange() which returns -1 if it is not possible to pay a value of k using these coins. Otherwise, it returns the minimum number of coins needed to make the payment. For example, canchange (7) will return -1. On the other hand, canchange(14) will return 4 because 14 can be paid as 3+3+3+5 and there is no other way to pay with fewer coins Programming Language:- C

8. A country has coins of denomination 3, 5 and 10 respectively. Write a recursive function canchange() which returns -1 if it is not possible to pay a value of k using these coins. Otherwise, it returns the minimum number of coins needed to make the payment. For example, canchange (7) will return -1. On the other hand, canchange(14) will return 4 because 14 can be paid as 3+3+3+5 and there is no other way to pay with fewer coins Programming Language:- C

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

Write a recursive function that lists al of the two-element subsets of a given set of letters in the folowing format. For example, when twoElementSubsets takes "ACEG"as parameter, wil print twoelement-subsets in the folowing format (A, C) (A, E) (A, G) (C, E} (C, G) E. G) Write a C program to test your function. Read the string (a set of letters) from he user. The number of parameters that twoElementSubsets function may take depends on your recursive function de sign. Sample Inputi ACEG Sample Outputi: (A C) (A. E) (A G) (C. E) (C. G) (E. G)
Write function log(arg1,arg2) which returns floating number of ln(1 + ?) using following taylor series : ? is arg1 (−1.0 < ? < 1.0) and ? is arg2 (positive integer) log(arg1,arg2) function should contain the concept of recursion function
Modify the recursive Fibonacci function to employ the memoization technique discussed in this chapter. The function creates a dictionary and then defines a nested recursive helper function named memoizedFib. You will need to create a dictionary to cache the sum of the fib function. The base case of the fib function is the same as before. However, before making any recursive calls, the helper function looks up the value for the function’s current argument in the dictionary (use the method get, with None as the default value). If the value exists, the function returns it and skips any recursive calls. Otherwise, after the helper function adds the results of its two recursive calls, it saves the sum in the dictionary with the current argument of the function as the key. Note: The program should output in the following format: n fib(n) 2 1 4 3 8 21 16 987 32 2178309 ---------------------------------------------------------------------------------- def…
Question: First write a function mulByDigit :: Int -> BigInt -> BigInt which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1] Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] [] Your implementation should not be recursive. Code: import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…
Prepare the SPIM program for the function: int fun(int n) { int i,f=1; for (i=n; i>0; i--) f=f+1; return f; }
Create a function that takes two integers, num and n, and returns an integer which is divisible by n and is the closest to num. If there are two numbers equidistant from num and divisible by n, select the larger one. Examples roundNumber (33, 25). - 25 roundNumber (46, 7)→ 49 roundNumber (133, 14) → 140
Create a program using java data structures That has the user enter their pay rate; the program will require the employee to enter hours for two days ( they work two days a week); and the conversion must be done. via a recursive function (all calculation and display happen in a single function). Include an additional function to prompt the user for their numbers. Do NOT USE Stack ADT, ANY ADTs, or structures that we created in class. Employee - hoursWorked : int - payRate : double -Employee(void) Default constructor - has NO parameters and must NOT return anything. Sets both attributes to 0. -AddHours(hoursToAdd : int) : void Adds the given hours to add to the hoursWorked attribute. -SetPayRate(newPayRate : double) : void Changes the payrate attribute to the given new pay rate. -GetHoursWorked(void) : int {hoursWorked} Gives back the hoursWorked attribute -+ GetPayRate(void) : double {payRate} Gives back the payRate attribute. -GetGrossPay(void) : double {grossPay} Computes and…
Suppose you have a dictionary of survey responses: keys are student names values are favourite ice cream flavours (e.g. "chocolate", "vanilla", "strawberry", etc.) Write a function that takes a dictionary of survey responses and returns a new dictionary where: keys are ice cream flavours and values are number of students with that favourite flavour. For example: Test survey = {"Howlett": "vanilla", "Grey": "chocolate", "Munroe": "vanilla", "Summers": "strawberry", "Xavier": "strawberry", "Drake": "strawberry"} print (survey_results (survey)) Result {'vanilla': 2, 'chocolate': 1, 'strawberry': 3}
Write a function that takes 4 Inter gets (num1, den1,num2,den2) as parameters which represent the rational numbers num1/den1, num2/den2 and returns the division of these two fractions. A/B ÷ C/D = A/B × D/C = AD/BC • den 1, den2, and num2 can not be zero. • use multiplication_rat function.
Define an enumeration type, triangleType, that has the values scalene, isosceles, equilateraland noTriangle. Write a function triangleShape that takes as parameters three numbers, each of which represents the length of a side of the triangle. The function should return the shape of the triangle. (Note, ina triangle, the sum of the lengths of any two sides is greater than the length of the third side). Write a program that prompts the user to input the length of the sides of a triangle and outputs the shape of the triangle. The user can enter the sides in no particular order. C++
Implement the following scenario using C++. Ibri City Polyclinic wishes to maintain their doctor details such as doctor id, name, and their specialization (Example: General / Pediatrician / El Specialist / Artho / Neurologist) in an array. Kindly help the hospital authorities to read the doctor details in an ascending order based on doctor id, store it in an array and search any given doctor id in the array using binary search. If the searched doctor id is found, then display only doctor name and their specialization otherwise display ' This doctor is not working in our hospital '. Note: 1. Use your name as the name of the structure. 2. Maximum number of account holders 25o
plz in c++ tks.