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

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

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

Related questions

Q: Problem: Write a recursive function power(x, n), where n is 0 or a postive integer. For example,…

A: Define a function called power that takes two parameters, x and n Check if n is equal to zero If n…

Q: c program, The greatest common divisor (GCD) of two integers (of which at least one is nonzero) is…

A: The algorithm of the above code is as follows: 1. Start by taking two integers as input. 2. If both…

Q: 1. Given the following function: int Fn (int N) { } if (N == 0) return 2; else return N + Fn (N/3);…

A: a) The given function is a recursive function. This is because the function calls itself in the…

Q: How do you refer to every element in a one-dimensional array?

A: Intro A one-dimensional array (sometimes known as a single-dimension array) is a sort of linear…

Q: Read Chapter 12 Recursive Lines Write a recursive function that accepts an integer argument, n.…

A: Input: The function takes two arguments: n (an integer) representing the number of lines to be…

Q: Please can be handwritten. Question 2: Implementing a Recursive Function . Write recursive function,…

A: Step 1 : STARTStep 2 : implement the recursionprob functionStep 3 : call the function with parameter…

Q: Implementing a Recursive Function . Write recursive function, recursionprob(n), which takes a…

A: A recursive function which refers to the one it is a function that calls itself, either directly or…

Q: Below,enter code to complete implementation of a recursive function sum_all_integers(), which takes…

A: As no programming language is mentioned, it is solved using Python

Q: This is in Python This has two parts. This is a problem on recursion. Part a: Write a recursive…

A: We need to write Python codes for the given scenarios.

Q: Write a function that outputs a string passed into the function in reverse. Use recursion to achieve…

A: Asked: Write a program to create a function for reversing the string.

Q: For function decToBinary, write the missing parts of the recursion case. This function should return…

A: The missing recursive call is the call to the same function, decToBinary, with the argument being…

Q: write a recursive version. The function takes two string parameters, s1 and s2 and returns the…

A: #include <iostream>using namespace std; //Recursive Function to see if the string and…

Q: 12. Consider the recursive function int gcd( int a, int b) int gcd( int a, int b){ if (b > a)…

A: Recursive function: It is a function that calls itself during execution. The number of invocations…

Q: Part I Implement the Fibonnaci Sequence One of this week’s quiz questions referred to the…

A: Define fibonacci(). This function calculates the nth element of the Fibonacci sequence using…

Q: health informatics

A: I think the student wants to know what health informatics is, so we will be providing a brief…

Q: Create a recursive function that simulates the range function. For example: Enter the range…

A: The code is given below.

Q: In Kotlin, Write and test a recursive function called harm with an expression body that takes an Int…

A: Check if the number is equal to 1.If yes, then we have to return 1.If no, then we have to continue…

Q: Write a recursive function that takes a positive integer and returns the factorial of that integer.…

A: Here is Your Code #include <stdio.h>int fatorial(int n){ if(n==0 || n==1) return 1;…

Q: Compute the sum of all elements of an array 1. Describe the definition of recursive function…

A: You can build a recursive function to sum up all the entries in an array recursively. A recursive…

Q: What is the return value of the function call Comp(4, 5), given the recursive function Comp defined…

A: INTRODUCTION: A recursive function is a routine that calls itself repeatedly, either directly or…

Q: In C programing Write a recursive function that returns the product of the digits of its integer…

A: When a function calls itself, that processes is called as recursion. The function which calls itself…

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.

Question

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

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

What is the return value of the function call Comp(3, 4), given the recursive function Comp defined below: int Comp(int a, int b) { if (a + b <= 5) return 2; else return Comp(a-1, b) + Comp(a, b-1); } Question 6 options: 6 10 12 8
The 4th problem mimics the situation where eagles flying in the sky can be spotted and counted.FindEagles: a recursive function that examines and counts the number of objects (eagles) in aphotograph. The data is in a two-dimensional grid of cells, each of which may be empty (value 0) orfilled (value 1 to 9). Maximum grid size is 50 x 50. The filled cells that are connected form an object(eagle). Two cells are connected if they are vertically, horizontally, or diagonally adjacent. Thefollowing figure shows 3 x 4 grids with 3 eagles. 0 0 1 21 0 0 01 0 3 1 FindEagle function takes as parameters the 2-D array and the x-y coordinates of a cell that is a part ofan eagle (non-zero value) and erases (change to 0) the image of an eagle. The function FindEagleshould return an integer value that counts how many cells has been counted as part of an eagle and havebeen erased. The following sample data has two pictures, the first one is 3 x 4, and the second one is 5 x 5 grids. Notethat your program…
1. Below, enter code to complete implementation of a recursive function sum allintegers(), which takes an input n and adds all integers preceding it, up to n: add all integers(n):
2. Consider the following function: def func1(n): output = 1 for i in range (1, n) : output = i return output Rewrite the function as a recursive function.
Beeblebrox question help
Write a recursive function that displays a string reversely on the console using the following header: def reverseDisplay(value):For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
Write a recursive function to sort an array of integers into ascending order using the following idea: the function must place the smallest element in the first position, then sort the rest of the array by a recursive call. This is a recursive version of the selection sort. (Note: You will probably want to call an auxiliary function that finds the index of the smallest item in the array. Make sure that the sorting function itself is recursive. Any auxiliary function that you use may be either recursive or iterative.) Embed your sort function in a driver program to test it. Turn in the entire program and the output.
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
1. Given, nCr= n! (n-r)!r!" Write a function to compute nCr without recursion.
Computer scientists and mathematicians often use numbering systems other than base 10. Write a program that allows a user to enter a number and a base and then prints out the digits of the number in the new base. Use a recursive function baseConversion (num, base) to print the digits. Hint: Consider base 10. To get the rightmost digit of a base 10 number, simply look at the remainder after dividing by 10. For example, 153 % 10 is 3. To get the remaining digits, you repeat the process on 15, which is just 153 // 10. This same process works for any base. The only problem is that we get the digits in reverse order (right to left). The base case for the recursion occurs when num is less than base and the output is simply num. In the general case, the function (recursively) prints the digits of num // base and then prints num % base. You should put a space between successive outputs, since bases greater than 10 will print out with multi-character "digits." For example, baseConversion(1234,…
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, the pattern generated is as follows: **** *** ** * * ** *** **** Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.